Ladon: High-Performance Multi-BFT Consensus via Dynamic Global Ordering (Extended Version)
Hanzheng Lyu, Shaokang Xie, Jianyu Niu, Chen Feng, Yinqian Zhang and, Ivan Beschastnikh

TL;DR
Ladon introduces a dynamic global ordering mechanism for Multi-BFT consensus that improves throughput and latency by allowing blocks to be ordered based on their generation time, accommodating varying block production rates.
Contribution
The paper presents Ladon, a novel Multi-BFT protocol that dynamically orders blocks across instances, overcoming performance issues of prior static global ordering methods.
Findings
Ladon-PBFT achieves approximately 8x peak throughput increase.
Ladon-HotStuff doubles the peak throughput compared to prior art.
Ladon reduces latency by about 62% in WAN deployments.
Abstract
Multi-BFT consensus runs multiple leader-based consensus instances in parallel, circumventing the leader bottleneck of a single instance. However, it contains an Achilles' heel: the need to globally order output blocks across instances. Deriving this global ordering is challenging because it must cope with different rates at which blocks are produced by instances. Prior Multi-BFT designs assign each block a global index before creation, leading to poor performance. We propose Ladon, a high-performance Multi-BFT protocol that allows varying instance block rates. Our key idea is to order blocks across instances dynamically, which eliminates blocking on slow instances. We achieve dynamic global ordering by assigning monotonic ranks to blocks. We pipeline rank coordination with the consensus process to reduce protocol overhead and combine aggregate signatures with rank information to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
