✳flâneur — a map of the web's best reading
KZG polynomial commitments | Dankrad Feist
dankradfeist.de · 2,998 words · saved by 1 readers
中文版本: KZG多项式承诺
← all posts 中文版本: KZG多项式承诺 Introduction I want to try and give an introduction to the commitment scheme introduced by Kate, Zaverucha and Goldberg 1 . This post does not aim to be mathematically or cryptographically rigorous or complete – it is meant to be an introduction. This scheme is often also called Kate polynomial commitment scheme (pronounced kah-tay ). As a polynomial commitment scheme, it allows a prover to compute a commitment to a polynomial, with the properties that this commitment can later be opened at any position: The prover shows that the value of the polynomial at a certain
Explore this link on the map →related reading
- Applied Crypto #2: Polynomial Commitments | ZK Learning Resourceslearn.0xparc.org
- The Polynomial Commitment - notes.0xparc.orgnotes.0xparc.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Commitment scheme - Wikipediaen.wikipedia.org
- STARKs, Part I: Proofs with Polynomialsvitalik.eth.limo
- Hidingzeroknowledgeblog.com
- Inner Product Arguments · Dankrad Feistdankradfeist.de
- Halo and more: exploring incremental verification and SNARKs without pairingsvitalik.eth.limo
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- Pedersen Commitments, Divide-and-Conquer, and the Inner Product Argument - notes.0xparc.orgnotes.0xparc.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org