Practical Groth16 Aggregation
summary
Proposes a practical Groth16 aggregation that collapses many SNARKs into a logarithmic-size aggregation and reduces verifier work from O(n) to O(log n). Adapts MIPP/TIP inner-pairing proofs to reuse existing CRS (Filecoin and Zcash powers of tau) with constant-size commitments (two target-group elements) and small extra overhead. Implements a Rust library (bellperson fork), audited once, and demonstrates that it can verify 8000 proofs in 33 ms and aggregate 8000 proofs in <9 s while supporting initial production limits (≈200 proof commits / ~2000 SNARKs).
AI-written summary · about
chapters (17)
- 0:00Introduction
- 0:39What is Aggregation
- 2:06How Aggregation Works
- 6:14Aggregation Tools
- 8:57Commitment Schemes
- 11:38Proof of Stake
- 15:46Bellman Fork
- 17:11Implementation
- 19:15Trusted Setup
- 21:05Questions
- 23:54Applications
- 24:36Statement structure
- 36:12Recursion
- 42:09Interoperability
- 44:38Groth16 Spec
- 49:13Milestones
- 49:50Small Details
related talks
17mSNARK Flipper. FLIP & Prove multiple instances efficiently
26mzk-SHARKs: Combining Succinct Verification and Public Coin Setup
34mSNARKs and their Practical Applications
25mSuccinct Proofs in Ethereum
25mLegoSNARK: Modular Design and Composition of Succinct Zero Knowledge Proofs
25mPractical Accountability of Secret Processes
31mTowards making private telemetry as ubiquitous as TLS
33mA Wishlist for Verifiable Computation: An Applied CS Perspective