一种区块链实用拜占庭容错算法的改进

AN IMPROVED BLOCKCHAIN PRACTICAL BYZANTINE FAULT TOLERANCE ALGORITHM

共识算法性是区块链核心技术的重要组成部分。实用性拜占庭容错算法(Practical Byzantine Fault Tolerance,PBFT)是联盟链广泛使用的共识算法,但是由于其消耗高,吞吐量低下以及高延时等问题,导致共识效率低下。针对这些问题,提出基于PBFT的新型改进共识算法IPBFT。采用协商与执行节点分离的方式减少执行请求的服务器数量,在一致性协议中加入自证机制,用心跳检测机制和最长链选举原则对主节点选举进行了改进。实验仿真表明,IPBFT算法在能耗、吞吐量和延时性等方面都有显著的提升,提高了系统的效能。

Consensus algorithm is an important part of the Blockchain core technology.Practical Byzantine fault tolerance(PBFT)is a consensus algorithm widely used consensus in alliance chain.However,due to its high consumption,low throughput and high latency,the efficiency of consensus is low.Aiming at these problems,we propose an improved consensus algorithm based on PBFT(IPBFT).We reduced the number of servers executing requests by separating negotiation and execution nodes.The self-certification mechanism was added to the consistency protocol,and the heartbeat detection mechanism and the longest chain election principle were used to improve the primary node election.Experimental simulations show that IPBFT has significantly improved performance in terms of energy consumption,throughput and latency,and it improves the efficiency of the system.