Chitu: Avoiding Unnecessary Fallback in Byzantine Consensus
summary
Chitu is an asynchronous DAG BFT protocol that tries a fast path based only on message exchange and falls back to coin or leader only when proposals diverge. It implements Byzantine reliable broadcast, an adaptive weight mechanism to wait for vertices with f+1 support, and embeds fast-path rules into the DAG. The prototype on EC2 achieves commits proposals in four message delays in best cases and shows up to 82.5% reduction in latency versus comparable DAG protocols.
AI-written summary · about
chapters (14)
- 0:00Chitu and consensus challenges
- 2:08Critical path bottlenecks in consensus
- 3:34Fast path concept and example
- 5:01Fast path failure and fallback
- 5:44Fair fallback framework
- 7:51Design challenges and CH protocol
- 8:53DAG-based commit rules and fast path
- 10:40Fast path and fallback case study
- 12:25Adaptive weight for latency reduction
- 14:12Implementation and evaluation
- 14:54Performance results and latency
- 15:38Throughput and crash fault tolerance
- 16:43Conclusion and future research
- 17:24Q&A
related talks
36mFlexible Byzantine Fault Tolerance
29mBuilding Probabilistic BFT Protocols Through Subsampled Voting
30mStrengthening Reliable Decentralized Systems at Interchain
25mEnhancing Bitcoin Security and Performance with Strong Consistency via...
15mAlea-BFT: Practical Asynchronous Byzantine Fault Tolerance
02h 44mBlockchain consensus mechanisms
22mOptimizing network topologies...
12mComet BFT