From 90e7027f1957e9483d78ac6aae193c9dfdcb5128 Mon Sep 17 00:00:00 2001 From: Andrew Toth Date: Sat, 21 Dec 2024 16:11:46 -0500 Subject: [PATCH] Remove changelog --- bip-DLEQ.mediawiki | 6 +----- 1 file changed, 1 insertion(+), 5 deletions(-) diff --git a/bip-DLEQ.mediawiki b/bip-DLEQ.mediawiki index c5412b2f..b6ed6e4a 100644 --- a/bip-DLEQ.mediawiki +++ b/bip-DLEQ.mediawiki @@ -41,7 +41,7 @@ The basic proof generation uses a random scalar ''k'', the secret ''a'', and the * Let ''e = hash(R1 || R2)''. * Let ''s = (k + e⋅a)''. -Providing only the point being proven ''C'', and ''e'' and ''s'' as a proof does not reveal ''a'' or ''k''. +Providing only ''C'', ''e'' and ''s'' as a proof does not reveal ''a'' or ''k''. Verifying the proof involves recreating ''R1'' and ''R2'' with only ''e'' and ''s'' as follows: @@ -117,10 +117,6 @@ This proposal is compatible with all older clients. A reference python implementation is included [./bip-DLEQ/reference.py here]. Test vectors can be generated by running `./bip-DLEQ/gen_test_vectors.py` which will produce a CSV file of random test vectors for both generating and verifying proofs. These can be run against the reference implementation with `./bip-DLEQ/run_test_vectors.py`. -== Changelog == - -TBD - == Footnotes ==