Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance
Talkat 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) · 2024-04-16..04-18·
summary
Alea-BFT is an asynchronous BFT state-machine protocol that reintroduces a per-request designated replica and a two-stage pipeline: an efficient leader-led verifiable consistent broadcast followed by an inexpensive asynchronous binary agreement. Broadcast and recovery cost scale linearly, agreement is quadratic and may take up to Σ rounds. Implementations include a Java prototype and integrations into Mir (Filecoin subnets) and SSV Network distributed validators (Obal integration underway). Benchmarks show comparable throughput, significantly lower latency than Dumbo‑NG, higher throughput than QBFT baselines across crypto choices, and robust behavior under crashes.
AI-written summary · about
chapters (11)
- 0:00Alea-BFT introduction
- 1:42Byzantine faults in crypto
- 3:06Why async randomized protocols
- 4:07Simplicity for BFT adoption
- 5:11Alea-BFT design goals
- 7:16Alea-BFT core components
- 9:00Alea-BFT in practice
- 11:26Implementation complexity
- 12:51Distributed validators use
- 13:33Benchmark vs state-of-the-art
- 14:36Summary and future
related talks
36mFlexible Byzantine Fault Tolerance
29mBuilding Probabilistic BFT Protocols Through Subsampled Voting
17mBFTBrain: Adaptive BFT Consensus with Reinforcement Learning
01h 05mPBFT and Blockchains
33mLibraBFTv2: Optimistically-linear BFT Consensus with Concrete Latency Bounds
17mIn Link We Trust: BFT at the Speed of CFT using Switches
18mRandomized Testing of Byzantine Fault Tolerant Algorithms
16mShoal++: High Throughput DAG BFT Can Be Fast and Robust!