According to different application scenarios of blockchain system, it is generally divided into public chain, private chain and consortium chain. Consortium chain is a typical multi-center blockchain, because it has better landing, it is supported by more and more enterprises and governments. This paper analyzes the advantages and problems of Practical Byzantine Fault Tolerance (PBFT) algorithm for the application scenarios of the consortium chain. In order to be more suitable for consortium chains, this paper proposes a new optimized consensus algorithm based on PBFT. Aiming at the shortcomings of PBFT, such as the inability to dynamically join nodes, low multi-node consensus efficiency, and primary master node selection, our optimized algorithm has designed a hierarchical structure to increase scalability and improve consensus efficiency. The simulation results show that compared with PBFT and RAFT, our new consensus algorithm increases the data throughput while supporting more nodes, and effectively reducing the consensus delay and the number of communication times between nodes.

根据区块链系统的不同应用场景，一般分为公链，私链和财团链。财团链是典型的多中心区块链，因为它具有更好的着陆性，受到越来越多的企业和政府的支持。本文分析了实际拜占庭容错（PBFT）算法在财团链的应用场景中的优点和问题。为了更适合联盟链，本文提出了一种新的基于PBFT的优化共识算法。针对PBFT的缺点，例如无法动态加入节点，低的多节点共识效率和主要主节点选择，我们的优化算法设计了一种层次结构来增加可伸缩性并提高共识效率。