Reserarch On Consortium Blockchain Consensus Algorithm Based On Byzantine Fault Tolerance Mechanism

Since the birth of the blockchain,it has attracted wide attention due to its characteristics of decentralization,security,credibility,non-tamperability and traceability.In recent years,it has emerged in many fields such as financial services,identity authentication,medical health,Internet of Things,asset securities,etc.As the core technology of the underlying blockchain,consensus algorithm can achieve the consistency of ledger through self-organization and large-scale collaboration in distributed networks without central control.At the same time,the consensus algorithm is also a key factor that restricts the commercialization of blockchain technology.However,At present,the public chain consensus algorithm faces the problems of low throughput and high transaction delay a,which makes it difficult to be applied in business.The Byzantine fault tolerance consensus algorithm also faces the problems of insufficient scalability,difficulty to resist adaptive attacks,and its practicability is not strong.Moreover,the above consensus algorithms can not realize the classification and concurrent processing of digital asset transactions,and can not meet the application needs of multi-scene collaboration in social production.Therefore,this paper studies the underlying architecture and consensus algorithms of blockchain technology,including the following:(1)This paper analyzes the key technologies of blockchain and its underlying architecture,including peer-to-peer network technology,cryptography technology and consensus algorithm.(2)Aiming at the fact that most Byzantine fault-tolerant algorithms are difficult to resist adaptive attacks,and have insufficient scalability and robustness,this paper proposes an efficient and robust Byzantine fault-tolerant consensus algorithm,which fits the application scenarios of the consortium chain.Firstly,we use ring signature to construct sorting algorithm to hide consensus sponsors,and then effectively resist adaptive attacks.Secondly,the Byzantine fault-tolerant consensus algorithm with low latency and high robustness is guaranteed in the minimum connectivity network by synthesizing threshold signatures representing the wishes of most voters in multi-round voting.Finally,the invalid proposer is replaced actively by view conversion protocol,and the threshold signature representing the will of quorum voters is broadcasted in the new view to ensure the consistency of replica states in cross-view conversion.The analysis shows that the system can improve the scalability,reduce the cost of view replacement,signature verification,and can effectively ensure the system activity before and after the proposal,thus supporting the high availability Byzantine system.(3)Aiming at the fact that blockchain has low performance,difficulty in supporting the classification and concurrent processing of digital assets in multiple scenarios,difficulty in achieving multi-chain consenus.This paper first designs a tree-based master-slave multi-chain architecture for consortium chain,and secondly designs a Byzantine fault-tolerant consensus algorithm based on threshold signature to solve the consistency problem.The master-slave chain structure divides the group into separate channels based on tree structure,each channel maintains its own slave chain,all channels jointly maintain the main chain,and many slave chains handle transactions in parallel to solve the problems of low throughput and high transaction delay in the existing block chains;the master-slave chains lock each other through hash values,so as to achieve the purpose of not tampering and easy to audit.The analysis shows that the master-slave multi-chain structure breaks through the restriction of single-chain,so it has good concurrency performance and privacy data isolation protection,and meets the diversified business needs of enterprises.