Chop Chop: Byzantine Atomic Broadcast to the Network Limit
Talkat 18th USENIX Symposium on Operating Systems Design and Implementation (OSDI '24) · 2024-07-10..07-12·
summary
Chop Chop claims Byzantine atomic broadcast at line rate, matching unordered protocol cost even for 8‑byte messages by converting full batches into distilled batches via brokers that build a Merkle‑style accumulator and collect client aggregate BLS signatures. Implemented on 64 geo‑distributed servers it sustains 43,600,000 messages/s at 3.6 s average latency, beats prior systems by ~100x throughput for that latency, and runs real apps achieving 32M, 2.3M, and 35M ops/s.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 0:44Byzantine Atomic Broadcast
- 1:46Batch distillation overview
- 3:10Key takeaways
- 3:33MLE protocols background
- 4:37Normal batch steps
- 5:21Overhead comparison
- 6:24Distillation process
- 8:11Batch verification
- 9:13Results and performance
- 10:39Network efficiency
- 11:21Summary and future
- 12:03Q&A
related talks
28mConversational big data
01h 12mScaling distributed ledgers: Achieving arbitrary throughput and sub-second latency
16mDispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks
17mIn Link We Trust: BFT at the Speed of CFT using Switches
26mBreaking Magical Barriers
29mBuilding Probabilistic BFT Protocols Through Subsampled Voting
28mRock around the clock (synchronization
17mBoomerang: Metadata-Private Messaging under Hardware Trust