From 0d4191bae5facdb7b4ae20ab5f7afc98f7e84877 Mon Sep 17 00:00:00 2001 From: Pieter Wuille Date: Tue, 15 Oct 2019 12:11:17 -0700 Subject: [PATCH] Formulate claims about BatchVerify more accurately --- bip-schnorr.mediawiki | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/bip-schnorr.mediawiki b/bip-schnorr.mediawiki index af279c7f..b7bd541e 100644 --- a/bip-schnorr.mediawiki +++ b/bip-schnorr.mediawiki @@ -192,7 +192,7 @@ The algorithm ''BatchVerify(pk1..u,m1..u,sig1..u1 + a2s2 + ... + ausu)⋅G ≠ R1 + a2⋅R2 + ... + au⋅Ru + e1⋅P1 + (a2e2)⋅P2 + ... + (aueu)⋅Pu''. * Return success iff no failure occurred before reaching this point. -With overwhelming probability, ''BatchVerify(pk1..u,m1..u,sig1..u) = Verify(pk1,m1,sig1) and Verify(pk2,m2,sig2) and ... and Verify(pku,mu,sigu)''. If all signatures are valid it will always succeed. If one or more signatures are invalid, it will succeed with probability ''2-n''. +If all individual signatures are valid (i.e., ''Verify'' would return success for them), ''BatchVerify'' will always return success. If at least one signature is invalid, ''BatchVerify'' will return success with at most a negligable probability. === Optimizations ===