From e4f1d7bb8e16e8ffa4b7d469b2a8b7222389284f Mon Sep 17 00:00:00 2001 From: Andrew Toth Date: Tue, 10 Dec 2024 19:18:16 -0500 Subject: [PATCH] Remove cbytes wrapper from m' Co-authored-by: Sebastian Falbesoner --- bip-DLEQ.mediawiki | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/bip-DLEQ.mediawiki b/bip-DLEQ.mediawiki index 28220cf1..57260591 100644 --- a/bip-DLEQ.mediawiki +++ b/bip-DLEQ.mediawiki @@ -55,7 +55,7 @@ The algorithm ''GenerateProof(a, B, r, G, m)'' is defined as: * Let ''R1 = k⋅G''. * Let ''R2 = k⋅B''. * Let ''m' = m if m is provided, otherwise an empty byte array''. -* Let ''e = int(hashBIP0???/challenge(cbytes(A) || cbytes(B) || cbytes(C) || cbytes(G) || cbytes(R1) || cbytes(R2) || cbytes(m')))''. +* Let ''e = int(hashBIP0???/challenge(cbytes(A) || cbytes(B) || cbytes(C) || cbytes(G) || cbytes(R1) || cbytes(R2) || m'))''. * Let ''s = (k + e⋅a) mod n''. * Let ''proof = bytes(32, e) || bytes(32, s)''. * If ''VerifyProof(A, B, C, proof)'' (see below) returns failure, abort.