Validity and the future of blockchains
summary
Classifies execution approaches for sharding: committee attestation versus data-availability via erasure coding (Reed–Solomon style) with random sampling, 200× throughput for rollups, 3–5× estimated speedup from stateless execution, and 3–10 years for full-chain zk proofs. Describes optimistic rollups (fraud proofs) vs zk rollups (computational integrity proofs), stateless blocks that ship state witnesses, sequencer roles and costs (one sequencer could cost millions), and a practical trilemma between scalability, finality, and censorship resistance.
AI-written summary · about
chapters (12)
- 0:00Intro
- 0:42Outline
- 1:46Traditional blockchains
- 3:54Data availability using erasure coding
- 7:46The stateless model
- 9:46The rollup model
- 11:36Consensus node roles
- 12:44Sequencer complexity
- 14:28Dimension 3: Finality guarantees
- 15:37Why do these criteria matter?
- 19:14Summary
- 20:58The choice facing designers now
related talks
36mJoin Sandeep Nailwal, Rene Reinsberg, Alex Gluchowski & Steven Goldfeder I Pragma Denver 2024
31mShared Sequencing, the Next Step toward Decentralizing Rollups
28mThe wild world of Web3 rollups
25mModular Structure of Blockchains
37mEthereum Community and Values
30mFrom Concept to Reality: Modular Blockchain Architecture
28mEvolution of Optimistic Rollup proofs
23mScaling Wars: The Race to Speed Up On-Chain Infrastructure