small-sumcheck.pdf
people.cs.georgetown.edu · 9,344 words · saved by 1 readers
N/A
The Sum-Check Protocol over Fields of Small Characteristic Justin Thaler∗ Abstract The sum-check protocol of Lund, Fortnow, Karloff, and Nisan underlies SNARKs with the fastest known prover. In many of its applications, the prover can be implemented with a number of field operations that is linear in the number, n, of terms being summed. We describe an optimized prover implementation when the protocol is applied over an extension field…
related reading
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- A Time-Space Tradeoff for the Sumcheck Provereprint.iacr.org
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 1043.pdfeprint.iacr.org
- Flock: Fast Proving for Batch Boolean Computationseprint.iacr.org
- 370.pdfeprint.iacr.org
- P lonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge[0.72cm]eprint.iacr.org
- A Zero Knowledge Sumcheck and its Applicationsarxiv.org
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- 1022.pdfeprint.iacr.org
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org