BeeGees: Stayin' Alive in Chained BFT
BeeGees: Stayin' Alive in Chained BFT
复制标题
DOI：
10.1145/3583668.3594572
复制
发表时间：
2022-05
期刊：
影响因子：
--
通讯作者：
N. Giridharan;Florian Suri-Payer;Matthew Ding;H. Howard;Ittai Abraham;Natacha Crooks
中科院分区：
文献类型：
--
作者：
N. Giridharan;Florian Suri-Payer;Matthew Ding;H. Howard;Ittai Abraham;Natacha Crooks
现代链式拜占庭容错（BFT）系统利用流水线和领导者轮换的组合来获得效率和公平性。然而，这些协议需要三个或四个连续的诚实领导者来执行操作。因此，即使是简单的领导者失败（如崩溃）也会削弱活跃度，导致高提交延迟或缺乏提交。我们发现，不幸的是，这个漏洞是固有的所有现有的BFT协议，轮流领导人与流水线协议。为了解决这个活性的缺点，我们提出了BeeGees1，一种新的链式BFT协议，即使有非连续的诚实领导者，也能成功地提交块。它在这样做的同时，还保持了阈值签名的二次词复杂度，SNARKs的线性词复杂度，以及连续诚实领导者之间的响应性。BeeGees将HotStuff的预期提交延迟在失败情况下减少了三倍，最坏情况下的延迟减少了七倍。
Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, require a sequence of three or four consecutive honest leaders to commit operations. Therefore, even simple leader failures such as crashes can weaken liveness, resulting in high commit latency or lack of commit all together. We show that, unfortunately, this vulnerability is inherent to all existing BFT protocols that rotate leaders with pipelined agreement. To resolve this liveness shortcoming we present BeeGees1, a novel chained BFT protocol that successfully commits blocks even with non-consecutive honest leaders. It does this while also maintaining quadratic word complexity with threshold signatures, linear word complexity with SNARKs, and responsiveness between consecutive honest leaders. BeeGees reduces the expected commit latency of HotStuff by a factor of three under failures, and the worst-case latency by a factor of seven.