GBFT:一种实用拜占庭容错算法改进方案

GBFT:An Improved Practical Byzantine Fault Tolerant Algorithm

区块链技术近年来成为研究热点,在金融、物流等行业已经有联盟链的落地案例。共识算法作为区块链的核心技术,将对区块链的整体性能产生直接影响。应用于联盟链的实用拜占庭容错算法(Practical Byzantine Fault Tolerance,PBFT)仍然存在着交易确认时间长、吞吐量低等问题。面向联盟链应用场景,基于PBFT算法,引入了非拜占庭容错协议,结合基于节点行为的选举机制,提出了三级共识机制的PBFT:GBFT。最后从吞吐量、交易确认时延、容错性等方面对GBFT方案和原始PBFT算法进行了对比实验与分析。实验结果表明,GBFT保持了PBFT算法1/3的容错性,有效提高了吞吐量,降低了交易确认时延。

Blockchain technology has become a research hotspot in recent years.In the financial,logistics and other indus-tries,there have been landing cases of alliance blockchain.As the core technology of blockchain,consensus algorithm will have a direct impact on the overall performance of blockchain.The PBFT(practical byzantine fault tolerance)algorithm used in alliance chain still has the problems of long transaction confirmation time and low throughput.For alliance chain application scenario,based on PBFT algorithm,non-Byzantine fault-tolerant protocol is introduced.Combined with the election mechanism based on node be-havior,a three-level consensus mechanism PBFT,GBFT,is proposed.Finally,GBFT is compared with PBFT algorithm in terms of throughput,transaction confirmation delay and fault tolerance.The experimental results show that GBFT maintains 1/3 of the fault tolerance of PBFT,improves throughput and reduces transaction confirmation delay.