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
- A Time-Space Tradeoff for the Sumcheck Provereprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Collaborative zkSNARKseprint.iacr.org
- 370.pdfeprint.iacr.org
- A Zero Knowledge Sumcheck and its Applicationsarxiv.org
- 1043.pdfeprint.iacr.org
- 552.pdfeprint.iacr.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- 1482.pdfeprint.iacr.org