论文标题
EBFT：通过平等主义简化BFT共识
EBFT: Simplifying BFT Consensus Through Egalitarianism
论文作者
论文摘要
我们提出了平等性BFT（EBFT），这是BFT共识方案的简单且高性能的框架，用于分散系统（如区块链）。 EBFT中的关键创新是平等主义块的产生：随机和非交互性的节点提出包含客户交易的块，而不是依靠领导者来做到这一点。除了确定性的安全性和livices保证BFT协议中的标准外，平均设计提供了两个新颖的特征：（i）EBFT具有针对针对领导者的攻击的弹性，例如贿赂和有针对性的DOS攻击，（ii）EBFT不需要任何失败的协议来检测和替换错误的领导者。 EBFT由三个协议组成：用于同步网络的EBFT-SYN，用于部分同步网络的EBFT-PSYN和EBFT-TURBO在EBFT上建立在EBFT上，以实现高性能。 我们实施EBFT并评估其在AWS上的性能。为了将EBFT与最新的BFT协议进行比较，我们建立了基于Bamboo的EBFT-PSYN，这是一个用于原型制作的开源平台，用于部分同步BFT协议。我们评估EBFT-PSYN和HOTSTUFF在EC2上，最多16个节点。评估表明，EBFT-PSYN比HOTSTUFF获得更好的吞吐量和潜伏期。为了证明其简单性和实用性，我们在BTCD的GO版本上构建了EBFT。我们总共在约920个LOC中实施了EBFT-Syn，EBFT-PSYN和EBFT-Turbo。这表明EBFT可以在相对较少的精力上建立在现有区块链的顶部。我们在具有多达256个节点的EC2实例上评估了这些协议。我们的评估表明，EBFT-Syn（分别EBFT-PSYN）达到了6秒（分别为1）秒的延迟，EBFT-PSYN的优化版本每秒可达3.6K交易，延迟为8秒。
We present Egalitarian BFT (EBFT), a simple and high-performance framework of BFT consensus protocols for decentralized systems like blockchains. The key innovation in EBFT is egalitarian block generation: nodes randomly and non-interactively propose blocks containing client transactions, rather than relying on a leader to do so. Apart from deterministic safety and liveness guarantees standard in BFT protocols, the egalitarian design provides two novel features: (i) EBFT is resilient to attacks targeting the leader, such as bribery and targeted DoS attacks, and (ii) EBFT does not require any fail-over protocol to detect and replace the faulty leader. EBFT consists of three protocols: EBFT-Syn for synchronous networks, EBFT-PSyn for partially synchronous networks, and EBFT-Turbo that builds on EBFT for high performance. We implement EBFT and evaluate its performance on AWS. To compare EBFT with state-of-the-art BFT protocols, we build EBFT-PSyn based on Bamboo, an open-source platform for prototyping partially synchronous BFT protocols. We evaluate EBFT-PSyn and HotStuff on EC2 with up to 16 nodes. The evaluation shows that EBFT-PSyn achieves better throughput and latency than HotStuff. To demonstrate its simplicity and practicality, we build EBFT on the Go version of Bitcoin, btcd. We implemented EBFT-Syn, EBFT-PSyn and EBFT-Turbo in about 920 LoCs in total. This indicates that EBFT can be built on top of existing blockchains with relatively little effort. We evaluate these protocols on EC2 instances with up to 256 nodes. Our evaluation shows that EBFT-Syn (resp. EBFT-PSyn) achieves a latency of 6 (resp. 1) seconds, and an optimized version of EBFT-PSyn processes up to 3.6k transactions per second and has a latency of 8 seconds.
