1022.pdf
eprint.iacr.org · 8,223 words · saved by 1 readers
N/A
Polynomial IOPs for Linear Algebra Relations Alan Szepieniec Yuncong Zhang alan@nervos.org shjdzhangyuncong@sjtu.edu.cn Nervos Foundation Shanghai Jiao Tong University Abstract. This paper proposes new Polynomial IOPs for arithmetic cir- cuits. They rely on the monomial coefficient basis to represent the matri- ces and vectors arising from the arithmetic constraint satisfaction system, and build on new protocols for establishing the correct computation of linear algebra relations such as…
related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- 1482.pdfeprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- 1043.pdfeprint.iacr.org
- P lonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge[0.72cm]eprint.iacr.org
- 552.pdfeprint.iacr.org
- 306.pdfeprint.iacr.org