Consensus with Adaptive Adversaries in the Synchronous and Partially Synchronous Models...
summary
Protocol in the synchronous model avoids the key‑erasure assumption by chaining a continuous VDF per round to define rounds and force a time cost to produce proposals, using a per‑proposer VDF to commit each block and a VRF for leader and committee selection. Vote‑based eligibility limits double voting, three consecutive rounds with ≥2/3 committee votes commit a block, committee size is polylog so message complexity is n·polylog, and proofs show safety and liveness hold with overwhelming probability even against adaptive corruptors with a bounded speed advantage.
AI-written summary · about
chapters (11)
- 0:00Intro
- 4:23Traditional Adversaries
- 12:47Binary Byzantine Agreement
- 14:23Grinding Issue
- 16:38Batch Strategy
- 18:01Intuition
- 19:21Synchronous Model
- 21:22Properties
- 22:31Protocol
- 26:54Safety Measures
- 28:23Questions
related talks
52mGame-Theoretically Secure Protocols Inspired by Blockchains
14mA Practical Approach to Multi-Concurrent Proposers
31mSecure Aggregation with Lightweight Committees
19mThe Time Complexity of Consensus Under Oblivious Message Adversaries
17mSecure Vickrey Auctions for Online Advertising
58mThe Communication Complexity Landscape of Information-theoretic MPC
16mExploring Attacks in the Modular Rollup World
31mProofless Consensus & Client-side Validation