A Correct by Construction Asynchronous Casper Protocol
summary
Claims a correct-by-construction asynchronous Byzantine‑fault‑tolerant binary Casper that decides a single bit by proving when an estimate cannot be changed under an ideal adversary that blocks or reorders bets. Core data are bets DAG entries (estimate, justification, sender), views, equivocations and invalid bets; safety is checked locally by simulating adversarial futures. Provides a Python implementation of the adversary for equivocation; achieves ex‑post safety in async settings but deliberately omits liveness (FLP limits).
AI-written summary · about
chapters (17)
- 0:00Intro
- 1:00Overview
- 2:40Live Safety
- 3:35Timing Assumptions
- 4:00Asynchronous Consensus
- 5:55Outline
- 6:50Estimates
- 7:10Consensus
- 9:10Data Structure
- 10:20Bet Structure
- 11:25Equivocation
- 13:00Validity
- 13:40Byzantine Validator
- 14:20Invalid Bets
- 14:50Safe in View
- 15:00Safe in Asynchronous Network
- 19:20Conclusion
related talks
36mFlexible Byzantine Fault Tolerance
31mProofless Consensus & Client-side Validation
18mSureDistrib: Verifying Almost-Sure Termination of Composite Asynchronous Byzantine(…)
42mBeyond Blockchain: Convergent Consensus
30mStrengthening Reliable Decentralized Systems at Interchain
29mBuilding Probabilistic BFT Protocols Through Subsampled Voting
18mAdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed Objects
28mOptimistic updates in a pessimistic world