From Byzantine Generals to Global Harmony, Modularly
summary
Argues that the Universal Composability framework gives a concrete method to build ledgers and blockchain stacks modularly by proving each component realizes an ideal functionality via a simulator, then composing them with a formal composition theorem. Shows tools for handling global setup like a gossip network, longest‑chain vs. committee protocols, and zkSNARK‑style privacy; notes key insight that many building blocks existed 30–40 years ago but only work once incentives are modeled. Claims a sequential deterministic execution model suffices for these proofs.
AI-written summary · about
chapters (6)
- 0:00Start
- 3:57Global Public Ledger: An amazing enabler
- 7:48Constructing a ledger
- 9:53Key characteristic: Inter-dependence of properties
- 31:09The universal composition theorem
- 32:11UC with joint modules
related talks
20mModular Blockchain Stack: The ENDGAME of Cosmos
16mExploring Attacks in the Modular Rollup World
20mImplementability of Global Distributed Protocols Modulo Network Architectures
36mJoin Sandeep Nailwal, Rene Reinsberg, Alex Gluchowski & Steven Goldfeder I Pragma Denver 2024
51mBuilding Distributed Applications in OCaml
22mCompositional Programming and Testing of Dynamic Distributed Systems
24mValidity and the future of blockchains
17mThe Future of Interchain Composability
