Faster, Smaller, Weaker, Darker
summary
Protocol constructs algebraic proofs for bilinear inner products and yields a polynomial commitment with square-root CRS size: CRS ~4 MB vs KZG ~3.2 GB for degree 2^26, evaluation prover ~15 s vs ~60 min. SNARK aggregation runs 64 Groth16 proofs in ~1.1 s vs ~18 min and 256 GB RAM for recursive routes, and aggregates ~65,000 proofs in 12 minutes. Outsourced pairings give 8x speedup at N=2^20 and aggregator work is ~10N pairings, overall claiming a 900x speedup over prior recursion for mid-size batches.
AI-written summary · about
chapters (8)
- 0:00Introduction and motivation
- 5:39Polynomial commitments
- 7:02Rollup and SNARK applications
- 10:03Inner product arguments
- 19:00Protocol design and security
- 28:31Outsourcing and optimization
- 41:56Conclusion
- 42:13Q&A session
