快速BFT状态机复制（SMR）的最优性与权衡（扩展版）
Optimality and Trade-offs in Fast BFT SMR (Extended Version)
浏览论文内容
中文总结 AI 辅助
本文针对快速BFT SMR，给出了其所需复制因子的紧上下界，并提出体现复制因子与恢复效率权衡的次优协议，填补了BFT场景下快速SMR研究的不足。
中文摘要 AI 辅助
crash故障场景下的快速状态机复制（SMR）协议已在学术界和工业界引起广泛关注，其优势在于相较于基于领导者的协议，无冲突命令的执行延迟更低、吞吐量更高、可用性更强且公平性更好。尽管快速SMR在 crash故障场景中已得到充分研究，但拜占庭容错（BFT）场景的理解仍十分有限，现有快速BFT SMR协议数量较少。本文给出了快速BFT SMR所需复制因子的紧上界与下界，还提出了一种次优协议，该协议体现了复制因子与恢复效率间的权衡关系。
英文摘要
Fast state-machine replication (SMR) protocols in the crash-fault setting have attracted significant interest in both academia and industry. This interest stems from their advantages over leader-based protocols, including low execution latency for non-conflicting commands, high throughput, improved availability, and increased fairness. While Fast SMR is well studied in the crash-fault setting, the Byzantine fault-tolerant (BFT) setting remains much less understood, with only a small number of existing Fast BFT SMR protocols. In this paper, we present tight upper and lower bounds on the replication factor required for Fast BFT SMR. We also present a suboptimal protocol that illustrates a trade-off between replication factor and recovery efficiency.
