论文标题
Beegees：在链式BFT中活着
BeeGees: stayin' alive in chained BFT
论文作者
论文摘要
现代链链拜占庭式容错（BFT）系统利用了管道和领导者旋转的组合，以达到效率和公平性。但是，这些协议要求连续三个或四个诚实的领导者进行操作。因此，即使是简单的领导者失败，例如撞车事件也会在理论上和实际上都削弱无能。即使诚实的领导者的顺序是非连续的，也可以获得决策的链式BFT方案，这仍然是一个悬而未决的问题。为了解决这个问题，我们提出了Beegees，这是一种新型的链式BFT协议，即使在非连续的诚实领导者中也成功提交了障碍。它可以通过阈值签名，线性单词复杂性和连续的诚实领导者之间的响应能力来维持二次单词复杂性。 Beegees将预期的HotStuff的承诺潜伏期减少了三倍，而最严重的延迟延迟则增加了7倍。
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 both theoretically and practically. Obtaining a chained BFT protocol that reaches decisions even if the sequence of honest leaders is non-consecutive, remains an open question. To resolve this question we present BeeGees, 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.
