geneferneau / fischlin Goto Github PK

Fischlin proofs iterate over a range of T-bit challenge values to find a hash s.t.:

Sum[i=0, R](Hash(x, commitment_vector, i, challenge[i], response[i])[..B/8]) <= S 

where:

• x is a statement of the witness w (here, a public-private secp256k1 keypair)
• commitment_vector is the collection of commitments to randomness (here, rand*G in secp256k1)
• i is the current index in the commitment vector
• challenge[i] is the current T-bit challenge
• response is the current response from the Schnorr proof over the witness, randomness, and challenge
• S is the maximum sum of the first B-bits of the hash values interpreted as big-endian unsigned integer
• R is the number of rounds to perform, with each round having independent commitments to fresh randomness

Searching for valid challenge values is time consuming. However, the search can be parallelized, since each round is independent.

Split the inner Fischlin proof into an async / threaded function to parallelize the partial proofs.