HYDRA: Breaking the Global Ordering Barrier in Multi-BFT Consensus
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909999578480640 |
|---|---|
| author | Lyu, Hanzheng Xie, Shaokang Niu, Jianyu Sadoghi, Mohammad Zhang, Yinqian Wang, Cong Beschastnikh, Ivan Feng, Chen |
| author_facet | Lyu, Hanzheng Xie, Shaokang Niu, Jianyu Sadoghi, Mohammad Zhang, Yinqian Wang, Cong Beschastnikh, Ivan Feng, Chen |
| contents | Multi-Byzantine Fault Tolerant (Multi-BFT) consensus, which runs multiple BFT instances in parallel, has recently emerged as a promising approach to overcome the leader bottleneck in classical BFT protocols. However, existing designs rely on a global ordering layer to serialize blocks across instances, an intuitive yet costly mechanism that constrains scalability, amplifies failure propagation, and complicates deployment. In this paper, we challenge this conventional wisdom. We present HYDRA, the first Multi-BFT consensus framework that eliminates global ordering altogether. HYDRA introduces an object-centric execution model that partitions transactions by their accessed objects, enabling concurrent yet deterministic execution across instances. To ensure consistency, HYDRA combines lightweight lock-based coordination with a deadlock resolution mechanism, achieving both scalability and correctness. We implement HYDRA and evaluate it on up to 128 replicas in both LAN and WAN environments. Experimental results show HYDRA outperforms several state-of-the-art Multi-BFT protocols in the presence of a straggler. These results demonstrate strong consistency and high performance by removing global ordering, opening a new direction toward scalable Multi-BFT consensus design. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_05843 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | HYDRA: Breaking the Global Ordering Barrier in Multi-BFT Consensus Lyu, Hanzheng Xie, Shaokang Niu, Jianyu Sadoghi, Mohammad Zhang, Yinqian Wang, Cong Beschastnikh, Ivan Feng, Chen Distributed, Parallel, and Cluster Computing Multi-Byzantine Fault Tolerant (Multi-BFT) consensus, which runs multiple BFT instances in parallel, has recently emerged as a promising approach to overcome the leader bottleneck in classical BFT protocols. However, existing designs rely on a global ordering layer to serialize blocks across instances, an intuitive yet costly mechanism that constrains scalability, amplifies failure propagation, and complicates deployment. In this paper, we challenge this conventional wisdom. We present HYDRA, the first Multi-BFT consensus framework that eliminates global ordering altogether. HYDRA introduces an object-centric execution model that partitions transactions by their accessed objects, enabling concurrent yet deterministic execution across instances. To ensure consistency, HYDRA combines lightweight lock-based coordination with a deadlock resolution mechanism, achieving both scalability and correctness. We implement HYDRA and evaluate it on up to 128 replicas in both LAN and WAN environments. Experimental results show HYDRA outperforms several state-of-the-art Multi-BFT protocols in the presence of a straggler. These results demonstrate strong consistency and high performance by removing global ordering, opening a new direction toward scalable Multi-BFT consensus design. |
| title | HYDRA: Breaking the Global Ordering Barrier in Multi-BFT Consensus |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2511.05843 |