通过基于树的投票聚合扩展BFT共识的探索
The quest for scaling BFT Consensus through Tree-Based Vote Aggregation
摘要：
随着人们对区块链的商业兴趣越来越大，许可实现受到了越来越多的关注。不幸的是，现有的BFT共识协议是许可区块链的骨干，要么扩展性差，要么提供有限的吞吐量。这些算法中的大多数需要至少一个进程来接收和验证来自所有其他进程的投票，然后广播结果，这本质上是不可扩展的。一些算法通过使用聚合树来收集和验证投票来避免这个瓶颈。然而，据我们所知，这样的算法提供有限的吞吐量，并迅速降低故障的存在。在本文中，我们提出了\thesystem，第一BFT通信抽象，组织参与者在一棵树中进行可扩展的投票聚合，并在错误的运行，能够终止协议的最佳数量的重新配置（$f+1$）。我们精确地定义了哪些聚合树允许最佳的重新配置，并表明，与以前的协议不同，当使用这些配置，\thesystem的规模，以大量的进程和超过HotStuff的吞吐量高达38倍。
英文摘要：
With the growing commercial interest in blockchain, permissioned implementations have received increasing attention. Unfortunately, existing BFT consensus protocols that are the backbone of permissioned blockchains, either scale poorly or offer limited throughput. Most of these algorithms require at least one process to receive and validate the votes from all other processes and then broadcast the result, which is inherently non-scalable. Some algorithms avoid this bottleneck by using aggregation trees to collect and validate votes. However, to the best of our knowledge, such algorithms offer limited throughput and degrade quickly in the presence of faults. In this paper we propose \thesystem, the first BFT communication abstraction that organizes participants in a tree to perform scalable vote aggregation and that, in faulty runs, is able to terminate the protocol within an optimal number of reconfigurations ($f+1$). We define precisely which aggregation trees allow for optimal reconfiguration and show that, unlike previous protocols, when using these configurations, \thesystem scales to large number of processes and outperforms HotStuff's throughput by up to 38x.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
