Applied Crypto #2: Polynomial Commitments | ZK Learning Resources
learn.0xparc.org · 263 words · saved by 1 readers
<iframe src="https://www.youtube.com/embed/7iZmftWJhWI"
On this page Description Yi Sun talks about polynomial commitments. 🔑 For polynomial P P P and pair ( x , y ) (x, y) ( x , y ) , a polynomial commitment allows the prover to show that P ( x ) = y P(x) = y P ( x ) = y , such that the verifier can verify this evaluation without knowing what P P P actually is. A polynomial commitment scheme starts with a trusted setup to generate public parameters used throughout the protocol. Then, the prover commits to a polynomial P P P and is verified to be a valid commitment to P P P . To create a polynomial opening, the prover shows that P ( x ) = y P(x)
related reading
- KZG polynomial commitments · Dankrad Feistdankradfeist.de
- The Polynomial Commitment - notes.0xparc.orgnotes.0xparc.org
- Variants of KZG: Part III, Multilinear Commitments with Zeromorphblog.zksecurity.xyz
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitment...youtube.com
- How does PLONK work? Part 8: A polynomial danceyoutube.com
- 306.pdfeprint.iacr.org
- Commitment scheme - Wikipediaen.wikipedia.org
- STARKs, Part I: Proofs with Polynomialsvitalik.eth.limo
- 1482.pdfeprint.iacr.org