✳flâneur — a map of the web's best reading
Inner Product Arguments | Dankrad Feist
dankradfeist.de · 3,771 words · saved by 1 readers
中文版本: 内积证明
← all posts 中文版本: 内积证明 Introduction You might have heard of Bulletproofs: It’s a type of zero knowledge proof that is used for example by Monero, and that does not require a trusted setup. The core of this proof system is the Inner Product Argument 1 , a trick that allows a prover to convince a verifier of the correctness of an “inner product”. An inner product is the component by component product of two vectors: \[\vec a \cdot \vec b = a_0 b_0 + a_1 b_1 + a_2 b_2 + \cdots + a_{n-1} b_{n-1}\] where \(\vec a = (a_0, a_1, \ldots, a_{n-1})\) and \(\vec b = (b_0, b_1, \ldots, b_{n-1})\). One inte
Explore this link on the map →related reading
- Pedersen Commitments, Divide-and-Conquer, and the Inner Product Argument - notes.0xparc.orgnotes.0xparc.org
- bulletproofs::inner_product_proof - Rustdoc-internal.dalek.rs
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Halo and more: exploring incremental verification and SNARKs without pairingsvitalik.eth.limo
- KZG polynomial commitments · Dankrad Feistdankradfeist.de
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- Applied Crypto #2: Polynomial Commitments | ZK Learning Resourceslearn.0xparc.org
- Commitment scheme - Wikipediaen.wikipedia.org
- The Polynomial Commitment - notes.0xparc.orgnotes.0xparc.org
- Math & Engineeringxn--2-umb.com
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo