Succinct Proofs in Ethereum
summary
Describes concrete ZK uses on Ethereum: mixers and Semaphore for anonymous signals, and a rollup design that batches many account state transitions into one SNARK. Uses Zokrates/Circom/Bellman implementations, requires curve generation tied to the proof system, and validates signatures inside the circuit so an operator can include many signed state updates. Claims 100,000 constraints per state transition, forces on-chain data availability as a diffs list, and reports practical throughput of 100–500 transactions per second despite a single 600,000 gas verification cost.
AI-written summary · about
chapters (5)
- 0:00Introduction to ZK proofs
- 3:05Privacy applications
- 5:27Technical foundations
- 12:36Scalability and rollups
- 18:14Standardization and future
related talks
30mPractical Zero Knowledge Proofs
36mJoin Sandeep Nailwal, Rene Reinsberg, Alex Gluchowski & Steven Goldfeder I Pragma Denver 2024
40mEthereum at Hyperscale
19mThe Superpowers of the ZK Stack
24mZK: Accelerating DA Interop
25mHigh-Speed zkSNARKs without Trusted Setup
34mSNARKs and their Practical Applications
01h 26mPanel Discussion: The Challenges and Best Practices of Deploying Zero-Knowledge Proofs
