Inner Product Arguments
summary
Survey of inner product arguments that pin down what changes: a 2016 breakthrough yields a logarithmic proof size inner product protocol in discrete-log groups with no trusted setup, later tweaks cut verifier or prover cost and enable range proofs. Recursive schemes like Halo replace pairings with curve cycles to get succinct verification. Implementations in arkworks and a universal-setup variant let one aggregate 130,000 proofs (vs ~90 before) and build efficient polynomial commitments.
AI-written summary · about
chapters (6)
related talks
44mIOP based Zero-Knowledge Proofs
52mDiscrete Log based Zero-Knowledge Proofs
44mBilinear Pairings-based Zero-Knowledge Proofs
41mGKR based Zero-Knowledge Proofs
01h 25mIntroduction to Verifiable Computing
57mThe Cryptographic Lens: Visions of our Past and Future
34mSTIR: Reed-Solomon Proximity Testing with Fewer Queries
36mPublic Key Cryptography