Proteus: A Scalable BFT Consensus Protocol for Blockchains
Proteus: A Scalable BFT Consensus Protocol for Blockchains
复制标题
DOI：
10.1109/blockchain.2019.00048
复制
发表时间：
2019-07
期刊：
影响因子：
--
通讯作者：
M. M. Jalalzai-M.;C. Busch;G. Richard
中科院分区：
文献类型：
--
作者：
M. M. Jalalzai-M.;C. Busch;G. Richard
与区块链中的工作量证明（PoW）相比，拜占庭容错（BFT）共识具有更高的吞吐量。然而，BFT为基础的协议遭受可扩展性问题的副本在网络中的数量，由于其固有的二次消息的复杂性。以前，所提出的解决方案提高了正常操作的BFT性能，但一旦协议观察到一定数量的故障，则会回落到二次消息复杂度。为了解决这个问题，我们提出了Proteus，一个新的基于BFT的共识协议，它选择一个子集的节点C作为根委员会。Proteus保证了稳定的性能，无论网络中的故障数量如何，并且它将典型的基于BFT的协议的二次消息复杂度改进为O（cn）消息，其中c << n，对于大量的节点n。我们在200个Amazon EC2实例上测试了我们的协议，并使用两种不同的基线BFT协议（PBFT和Bchain）进行比较。在这些测试中，我们的协议在吞吐量和延迟方面超过基线2倍以上。
Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. However, BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network due to their inherent quadratic message complexity. Previously, proposed solutions improve BFT performance for normal operation, but will fall back to quadratic message complexity once the protocol observes a certain number of failures. To address this issue we propose Proteus, a new BFT-based consensus protocol which elects a subset of nodes c as a root committee. Proteus guarantees stable performance, regardless of the number of failures in the network and it improves on the quadratic message complexity of typical BFT-based protocols to O(cn) messages, where c << n, for large number of nodes n. We tested our protocol on 200 Amazon EC2 instances, with two different baseline BFT protocols (PBFT and Bchain) for comparison. In these tests, our protocol outperformed the baselines by more than 2× in terms of throughput as well as latency.