论文标题
在拜占庭帝国达成共识：BFT共识算法的全面评论
Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms
论文作者
论文摘要
拜占庭式耐断层（BFT）共识算法是为必须在有任意失败存在下运行的分布式系统提供安全性和行为保证的核心。最近，已经提出了许多新的BFT算法，尤其是由于吸引区块链技术在寻找提供高吞吐量，低潜伏期和强大系统设计的共识解决方案中获得的。在本文中，我们对选定和杰出的BFT算法进行了系统的调查，这些算法在学术界和行业中都受到广泛关注。我们在考虑信息和时间复杂性的所有算法之间进行定性比较。此外，我们将每个共识算法分解为其组成子组合，以复制和查看由直观数字支持的变化，以说明消息通话模式。与最先进的方法相比，我们还详细介绍了每种算法的优势和劣势。
Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been proposed, not least due to the traction blockchain technologies have garnered in the search for consensus solutions that offer high throughput, low latency, and robust system designs. In this paper, we conduct a systematic survey of selected and distinguished BFT algorithms that have received extensive attention in academia and industry alike. We perform a qualitative comparison among all algorithms we review considering message and time complexities. Furthermore, we decompose each consensus algorithm into its constituent subprotocols for replication and view change backed by intuitive figures to illustrate the message-passing pattern. We also elaborate on the strengths and weaknesses of each algorithm as compared to the state-of-the-art approaches.
