552.pdf
eprint.iacr.org · 9,614 words · saved by 1 readers
N/A
Customizable constraint systems for succinct arguments Srinath Setty∗ Justin Thaler† Riad Wahby‡ Abstract This paper introduces customizable constraint system (CCS), a generalization of R1CS that can simultaneously capture R1CS, Plonkish, and AIR without overheads. Unlike existing descriptions of Plonkish and AIR, CCS is not tied to any particular proof system. Furthermore, we observe that the linear-time polynomial IOP for R1CS in Spartan (CRYPTO 20)…
related reading
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Spartaneprint.iacr.org
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- 1043.pdfeprint.iacr.org
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- 370.pdfeprint.iacr.org
- 1022.pdfeprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- P lonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge[0.72cm]eprint.iacr.org
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com