Recursive SNARKs for Efficiency, Scalability, and Privacy
summary
Claims that Mina uses Ouroboros Samasika plus recursive zk‑SNARKs to let each new block include a succinct proof that it and all prior blocks connect to Genesis, so node sync drops from days or a week of reexecution to verifying one constant‑size proof; prover cost grows modestly while verifier time and proof size stay constant. Tools include the TypeScript library 1js for generating proofs and a demo Etonec payment system showing privacy sliders and regulatory checks via ZK statements.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:12Blockchains privacy scalability
- 5:45ZK-SNARKs trust verification
- 9:15Ouroboros Samasika recursive proofs
- 12:28Efficient computation ZK proofs
- 16:03Privacy decentralized systems
- 19:15Private stablecoin ZK transactions
- 21:19Privacy efficiency blockchain
- 22:43Questions and answers on recursive proofs
related talks
25mZK Rollup: Ethereum Scalability with ZKPs
25mThe Next 700 ZKP Programming Languages
12mHow We Did It: ZK Proofs on Bitcoin
25mGemini: Elastic SNARKs for Diverse Environments
22mHow Zero Knowledge Proofs Change the Narrative Around Privacy
32mSoK: Private Programmability on Blockchain Systems
37mEthereum Community and Values
18mSoK: Understanding zk-SNARKs: The Gap Between Research and Practice