Efficient Byzantine Fault Tolerant Algorithm With Supervision Mechanism

The rise of Bitcoin and Ethereum has driven the development of global blockchain,and more and more people are focusing on the blockchain technology.Although the public blockchain technology adopts a fully distributed structure and has excellent decentralization characteristics,broadcasting messages across the entire network will not only block the network,but also cause waste of resources,so that network throughput and delay can hardly meet the needs of supply chain finance,commodity traceability and other business scenarios in the public chain.The proof of work of the public chain generates a block every ten minutes,and transactions can be confirmed every six blocks.The long transaction time and low transaction efficiency can no longer meet the needs of life scenarios with high transaction volume requirements.The nodes of the consortium chain are fixed,the number is relatively stable,the node credit is higher,and it has the characteristics of low cost and easy maintenance.While the supervision is convenient,the transaction speed has also been improved.Therefore,compared to public chains,consortium chains are more suitable for various financial scenarios.This article made research and analyzed on the network model,node selection and security of the consortium chain consensus mechanism.As the core content of blockchain technology,the consensus mechanism differs in different application fields.This paper did research and analyzed on the network architecture and consensus mechanism of the blockchain,and compared some classic consensus algorithms,such as Paxos,Po W(Proof of Work),Po S(Proof of Work),DPo S(Delegated Proof of Work),etc,analyzed the efficiency and security problems of the widely used practical Byzantine fault-tolerant(PBFT)algorithm,studied the PBFT algorithm from the perspectives of network model,consensus nature and security attacks,and proposed an efficient supervised Byzantine fault-tolerant algorithm(Efficient Supervised Byzantine Fault Tolerance,ES-BFT).For efficiency issues,all PBFT algorithm nodes participate in consensus,and there are problems of high network overhead and waste of resources.Therefore,the ES-BFT algorithm randomly divided nodes into multiple node pieces,set reputation values,and elected consensus nodes and supervise nodes from node pieces through reputation values,and improved the efficiency and reliability of consensus network as much as possible;the reputation value classification mechanism adopted can effectively improve the trust of nodes;the supervisory node monitors the consensus node,avoiding the system incoordination problem that the consensus node may encounter before the start of Global Stabilization Time(GST),and further ensuring the security of the algorithm;experiments showed that the ES-BFT algorithm was more efficient and safer than the PBFT algorithm,and was immune to system incoordination problems caused by attacks before GST.