Research On Blockchain Consensus Algorithm Based On Parallel Proposed Block

Blockchain technology is the most transformative technology in recent years,and its decentralized,immutable and traceable characteristics have attracted the attention of many countries and enterprises.Consensus algorithm is the core of blockchain technology,which determines the ledger consistency and system performance of blockchain system.The practical Byzantine fault tolerance(PBFT)algorithm is the most widely used consensus algorithm in consortium blockchain.However,both PBFT algorithm and other improved consensus algorithms based on PBFT can only serial consensus blocks,resulting in low efficiency of consensus.To solve the above problems,this paper studies the Byzantine fault-tolerant consensus algorithm based on parallel block generation.The main work is as follows:Firstly,in order to solve the problem that BFT consensus algorithm can only serial consensus blocks and consensus throughput is low,this paper proposes a practical Byzantine fault-tolerant based on multi-node parallel proposed block algorithm(MPBFT).The algorithm is improved on PBFT and the index block mechanism is proposed.MPBFT generating transaction blocks from multiple nodes,and the primary node packages the hash values of multiple transaction blocks into a index block to commit,which reduces the communication times of transaction blocks in the Commit stage,while the consensus of index blocks fixes the global order of the ledger.Analysis shows that MPBFT ensures the security and activity of blockchain system,and its communication cost is much lower than PBFT algorithm.Comparative experiments show that the consensus throughput of MPBFT algorithm is always higher than PBFT algorithm under the same conditions.When the total number of nodes is 16,the throughput of MPBFT algorithm is 2.2 times that of PBFT algorithm.Secondly,Although MPBFT algorithm improves consensus throughput,it does not solve the problem that PBFT algorithm degrades system performance as the number of nodes increases.In order to improve the scalability of MPBFT algorithm,this paper proposes a block chain consensus algorithm(PPBFT)based on the improvement of MPBFT algorithm.This algorithm also uses the index block mechanism proposed in MPBFT algorithm,but only the proposed committee member nodes can generate transaction blocks.PPBFT algorithm uses verifiable random function(VRF)to select proposal committee nodes and BLS threshold signature algorithm to reduce communication complexity.The algorithm analysis and experimental results show that the communication overhead of PPBFT algorithm is much lower than SBFT algorithm,MPBFT algorithm and PBFT algorithm.When the total number of nodes is 64,PPBFT algorithm’s consensus throughput is 2.5 times that of SBFT algorithm,8.7 times that of MPBFT algorithm and 65 times that of PBFT algorithm.Figure 16 Table 5 Reference 45...