From f64e8255c68a5605a58568e41d805493fa99f03b Mon Sep 17 00:00:00 2001
From: leopardracer <136604165+leopardracer@users.noreply.github.com>
Date: Sun, 6 Apr 2025 23:22:43 +0300
Subject: [PATCH] Update bip-0374.mediawiki

---
 bip-0374.mediawiki | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/bip-0374.mediawiki b/bip-0374.mediawiki
index 46a47ba0..0abb8957 100644
--- a/bip-0374.mediawiki
+++ b/bip-0374.mediawiki
@@ -74,7 +74,7 @@ The algorithm ''GenerateProof(a, B, r, G, m)'' is defined as:
 * Let ''C = a⋅B''.
 * Let ''t'' be the byte-wise xor of ''bytes(32, a)'' and ''hash<sub>BIP0374/aux</sub>(r)''.
 * Let ''m' = m if m is provided, otherwise an empty byte array''.
-* Let ''rand = hash<sub>BIP0374/nonce</sub>(t || cbytes(A) || cbytes(C) || m')''.<ref name="why_include_m_in_rand"> ''' Why include the message in the rand computation?''' Not including the message in the rand compution could leak ''a'' if two proofs were constructed for the same ''a'', ''B'', and ''G'' but a different message ''m'' and an all-zero ''r''.</ref>
+* Let ''rand = hash<sub>BIP0374/nonce</sub>(t || cbytes(A) || cbytes(C) || m')''.<ref name="why_include_m_in_rand"> ''' Why include the message in the rand computation?''' Not including the message in the rand computation could leak ''a'' if two proofs were constructed for the same ''a'', ''B'', and ''G'' but a different message ''m'' and an all-zero ''r''.</ref>
 * Let ''k = int(rand) mod n''.
 * Fail if ''k = 0''.
 * Let ''R<sub>1</sub> = k⋅G''.