关键词: 实用拜占庭容错, 高效监督拜占庭容错（ES-BFT）算法, 节点簇, 监督节点, GST

Abstract:

As the core content of blockchain technology, the consensus mechanism is different in different application fields. In view of the alliance chain application scenario, the widely used Practical Byzantine Fault Tolerancealgorithm （PBFT） still has efficiency and security issues. Therefore, the PBFT algorithm is studied from the perspective of network models, consensus essence and security attacks, and an Efficient Supervised Byzantine Fault Tolerant algorithm（ES-BFT）is proposed. For the efficiency problem, the ES-BFT algorithm randomly divides the nodes into multiple node clusters, sets the reputation value, and selects the consensus node and the supervision node from the node cluster through the reputation value to improve the efficiency and reliability of the consensus node as much as possible. The supervision node is introduced to monitor the consensus node, avoiding the system uncoordinated scenario that the consensus node may encounter before the Global Stabilization Time（GST） begins, and further ensuring the security of the algorithm. Experiments show that the ES-BFT algorithm has improved efficiency and security compared to the PBFT algorithm, and is immune to system incoordination caused by attacks before the GST.

Key words: Practical Byzantine Fault Tolerance（PBFT）, Efficiency Supervised Byzantine Fault Tolerant（ES-BFT） algorithm, node clusters, supervisory nodes, Global Stabilization Time（GST）