Design Of Blockchain Consensus Mechanism Based On Hotstuff And Binary Communication Tre

As a typical decentralized technology,blockchain technology is widely used to solve the problems of authority concentration,data tampering and personal privacy leakage.At present,it is widely used in digital currency,asset management,election voting and other scenarios.Consortium chain,as the preferred choice for enterprise-level application implementation,has attracted much attention.For the Byzantine Fault Tolerant consensus in the consortium blockchain,there are problems such as high communication complexity,complicated view changing,high pressure on the primary,and difficulty in expanding the system scale.The HSP consensus based on binomial swap forest and Hotstuff is proposed.The details are as follows:1.Aiming at the complexity of the Elliptic Curve Digital Signature Algorithm in the Hotstuff consensus mechanism,the realization of the aggregation signature and threshold signature process is complex,this paper uses the BLS digital signature algorithm.Regarding the distribution method of the secret fragments in the threshold signature,the widely used Shamir secret sharing algorithm is abandoned,and the verifiable secret sharing algorithm proposed by Feldman is used to solve the evil of the master secret holder and the evil of the secret fragment holder.The test results show that,without view changing,when the total number of nodes in the system is 4and request/reply=256/256,Hotstuff+BLS increases the throughput by 19.5%compared with the original Hotstuff,and reduces the consensus delay by 19.9%;When request/reply=512/512,compared with the original Hotstuff,the throughput of Hotstuff+BLS is increased by 22.7%,and the consensus delay is reduced by 17.3%.2.Aiming at the problems of the large amount of tasks undertaken by the master node,the number of communications between the master and the backups,and the difficulty of system expansion in the Hotstuff consensus mechanism,this paper adopts an improved binomal swap forest method.The test results show that without view changing,when the total number of nodes in the system is 64 and request/reply=256/256,HSP increases the throughput of Hotstuff+BLS by 33.8%,and the consensus delay decreases by 16.4%;when request /reply=512/512,the throughput of HSP is 69.0% higher than that of Hotstuff+BLS,and the consensus delay is reduced by 11.2%.When the total number of nodes is 64 and request/reply=256/256,in the case of view changing due to network failures,HSP has increased the throughput of Hotstuff by 35.1%,and the consensus delay has decreased by 22.6%;when the master node fails continuously,in the case of continuous view switching,compared with Hotstuff+BLS,the throughput of HSP is increased by34.4%,and the consensus delay is reduced by 17.9%.