1043.pdf
eprint.iacr.org · 8,904 words · saved by 1 readers
N/A
Brakedown: Linear-time and field-agnostic SNARKs for R1CS Alexander Golovnev∗ Jonathan Lee† Srinath Setty‡ Justin Thaler§ Riad S. Wahby¶ Abstract This paper introduces a SNARK called Brakedown. Brakedown targets R1CS, a popular NP-complete problem that generalizes circuit-satisfiability. It is the first built system that provides a linear-time prover, meaning the prover incurs O(N ) finite field operations to prove the satisfiability of an N -sized R1CS instance.…
related reading
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- 552.pdfeprint.iacr.org
- Spartaneprint.iacr.org
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- 370.pdfeprint.iacr.org
- Flock: Fast Proving for Batch Boolean Computationseprint.iacr.org
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- 306.pdfeprint.iacr.org
- 1022.pdfeprint.iacr.org