Merge pull request #2011 from Forostovec/master

Author: jonatack

bip-0374.mediawiki

@@ -82,7 +82,7 @@ The algorithm ''GenerateProof(a, B, r, G, m)'' is defined as:
 * Let ''e = int(hash<sub>BIP0374/challenge</sub>(cbytes(A) || cbytes(B) || cbytes(C) || cbytes(G) || cbytes(R<sub>1</sub>) || cbytes(R<sub>2</sub>) || 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.
+* If ''VerifyProof(A, B, C, proof, G, m)'' (see below) returns failure, abort.
 * Return the proof ''proof''.
 
 === DLEQ Proof Verification ===