Scalability Solutions from zk SNARKs
summary
zk SNARKs allow an aggregator to post a short proof instead of full transaction data, enabling zk-rollups and projects like Coda to compress history so a single SNARK can verify the chain; Vitalik's estimate of ~500 tx/sec is optimistic but directional. practical bottlenecks are prover cost (example: a Python big-int multiply taking ~0.01s), SHA-256 costs (hundreds of thousands of gates), hash choices with MiMC/Poseidon facing scrutiny and attacks, trusted setup limits (universal vs per-app), recursion options (MNT, Halo, SEXY), and need for target-group precompiles or faster C backends.
AI-written summary · about
chapters (11)
- 0:00Scalability with snarks
- 2:22Coda and recursion
- 3:33Starks versus snarks
- 4:13Soundness and zero-knowledge
- 5:47Challenges in proof generation
- 6:47Hash functions in snarks
- 8:40Universal snark setups
- 10:42Implementation experiences
- 12:59Recursive proof techniques
- 15:43Optimizing verifiers
- 18:30Q&A and future outlook
