Lumiere：使部分同步下的最优BFT变得实用
Lumiere: Making Optimal BFT for Partial Synchrony Practical
AI总结：
Lumiere提出一种乐观响应的拜占庭视图同步协议，在保持最优最坏情况通信复杂度的同时，解决了现有BFT协议中延迟和消息开销的无限增长问题，使部分同步下的BFT共识更实用。
摘要：
视图同步问题位于部分同步模型中许多拜占庭容错（BFT）状态机复制（SMR）协议的核心，因为这些协议通常基于视图。如果诚实的处理器在同步期间在同一视图中停留足够长的时间，并且该视图的领导者是诚实的，则保证活性。确保这些条件发生，即所谓的拜占庭视图同步（BVS），已被证明是许多BFT SMR协议的性能瓶颈。最近的一系列工作表明，通过使用适当的视图同步协议，BFT SMR协议在GST之后的最坏情况下可以实现$O(n^2)$的通信复杂度，从而最终匹配了Dolev和Reischuk在1985年建立的下界。然而，这些协议存在两个主要问题：（1）当实现为乐观响应时，即使单个拜占庭处理器也可能无限频繁地导致连续共识决策之间的$\Omega(n\Delta)$延迟。（2）即使在没有拜占庭行为的情况下，无限多的视图要求诚实的处理器发送$\Omega(n^2)$条消息。在这里，我们提出Lumiere，一个乐观响应的BVS协议，它在保持最优最坏情况通信复杂度的同时解决了上述两个问题：首次，Lumiere使得部分同步环境下的BFT共识解决方案具有$O(n^2)$的最坏情况通信复杂度，并且最终总是（即，除了少量常数次的“预热”决策外）具有与实际故障数量成线性的通信复杂度和延迟。
英文摘要：
The view synchronization problem lies at the heart of many Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocols in the partial synchrony model, since these protocols are usually based on views. Liveness is guaranteed if honest processors spend a sufficiently long time in the same view during periods of synchrony, and if the leader of the view is honest. Ensuring that these conditions occur, known as Byzantine View Synchronization (BVS), has turned out to be the performance bottleneck of many BFT SMR protocols. A recent line of work has shown that, by using an appropriate view synchronization protocol, BFT SMR protocols can achieve $O(n^2)$ communication complexity in the worst case after GST, thereby finally matching the lower bound established by Dolev and Reischuk in 1985. However, these protocols suffer from two major issues: (1) When implemented so as to be optimistically responsive, even a single Byzantine processor may infinitely often cause $Ω(nΔ)$ latency between consecutive consensus decisions. (2) Even in the absence of Byzantine action, infinitely many views require honest processors to send $Ω(n^2)$ messages. Here, we present Lumiere, an optimistically responsive BVS protocol which maintains optimal worst-case communication complexity while simultaneously addressing the two issues above: for the first time, Lumiere enables BFT consensus solutions in the partial synchrony setting that have $O(n^2)$ worst-case communication complexity, and that eventually always (i.e., except for a small constant number of "warmup" decisions) have communication complexity and latency which is linear in the number of actual faults in the execution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
