Incremental proof systems
summary
Defines IVC and PCD and claims they can be built without full SNARKs by using accumulation schemes plus a homomorphic vector commitment (Pedersen-like), so the recursive verifier reduces to about two group scalar multiplications instead of millions of arithmetic gates; shows recursive buildup from SNARKs and from accumulation, warns of a critical random oracle security jump and an extractor blowup that forces straightline extraction for deep recursion. Practical numbers: pairings cost hundreds of thousands of gates; accumulation proofs run with tiny verifier work and no trusted setup.
AI-written summary · about
chapters (16)
- 0:00Recursive proofs intro
- 0:23What are recursive proofs
- 2:38Motivation: sequential IVC
- 6:40Motivation: federated IVC
- 9:56Constructing IVC from SNARKs
- 13:57Security challenges
- 23:15Arithmetization and hash choices
- 28:15Security models in PCD
- 32:36Extraction challenges
- 38:17Efficiency bottlenecks
- 41:59SNARKs for IVC/PCD?
- 46:40Accumulation schemes intro
- 52:42Building accumulation schemes
- 57:28Why accumulation schemes useful
- 59:17Post-quantum accumulation research
- 1:01:26Summary
