Hydrangea: Optimistic Two-Round Partial Synchrony with Improved Fault Resilience
Nibesh Shrestha, Aniket Kate, Kartik Nayak
摘要
Consensus protocols in the partially synchronous setting face a fundamental trade-off: achieving optimal Byzantine fault tolerance requires a good-case latency of at least three rounds, while committing in fewer than three rounds generally entails reduced resilience. Even optimistic protocols such as SBFT (DSN'19), FaB (TDSC'06), and Kudzu achieve an optimistic good-case latency of two rounds under favorable conditions, but only at the cost of reduced fault tolerance. In this work, we introduce Hydrangea, a partially synchronous Byzantine fault-tolerant state machine replication protocol that combines low latency with improved fault resilience. Let f denote the maximum number of tolerated Byzantine faults, c the maximum number of tolerated crash faults, and k 0 a tunable parameter. For a system of n = 3f + 2c + k + 1 parties, Hydrangea achieves an optimistic good-case latency of two rounds when the total number of faulty parties (Byzantine or crash) is at most p = c + k ⁄ 2 . In more adversarial settings, with up to f Byzantine faults and c crash faults, it guarantees a good-case latency of three rounds. We further prove a matching lower bound: no protocol can achieve a two-round optimistic commit under this fault model if p > c + k + 2 ⁄ 2 . Our experimental evaluation on geo-distributed deployments demonstrates that Hydrangea consistently achieves substantially lower latency than state-of-the-art protocols in both Byzantine-only and Byzantine–crash fault models, while also delivering modest improvements in throughput.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper5
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 被引用 259 次
- Sync HotStuff: Simple and Practical Synchronous State Machine ReplicationIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren 等S&P 2020 · 被引用 240 次
- On the Optimality of Optimistic ResponsivenessNibesh Shrestha, Ittai Abraham, Ling Ren, Kartik NayakCCS 2020 · 被引用 47 次
- Mysticeti: Reaching the Latency Limits with Uncertified DAGsKushal Babel, Andrey Chursin, George Danezis, Anastasios Kichidis 等NDSS 2025
- Optimistic, Signature-Free Reliable Broadcast and Its ApplicationsNibesh Shrestha, Qianyu Yu, Aniket Kate, Giuliano Losa 等CCS 2025
相关 Paper
- Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual EvaluationChristopher Hodsdon, Zijian Qin, Khiem Ngo, Siddhartha Sen 等EuroSys 2026
- Multi-Threshold Byzantine Fault ToleranceAtsuki Momose, Ling RenCCS 2021 · 被引用 1 次
- Ambulance: Saving BFT through RacingNeil Giridharan, Shubham Mishra, Lorenzo Alvisi, Natacha Crooks 等OSDI 2026 · 被引用 1 次
- Consensus in the Known Participation Model with Byzantine Faults and Sleepy ReplicasChenxu Wang, Sisi Duan, Minghui Xu, Feng Li 等NDSS 2026
- Integrating 2PC with Consensus for Fast ReplicationYan Chen, Xinyi Yu, Shengyun Liu, Ruofan Xiong 等SIGCOMM 2026
