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
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- 370.pdfeprint.iacr.org
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- Pearl Whitepaperpearlresearch.ai
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- 1043.pdfeprint.iacr.org
- Arithmetization II. “We Need To Go Deeper” | by StarkWare | StarkWare | Mediummedium.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org