Research On PBFT Algorithm Based On DPoS And Scoring System

As the core part of the blockchain technology,the consensus algorithm plays a decisive role for the performance and security of the blockchain.Therefore,the consensus algorithm has become a hot research topic in this field.This paper conducts a comprehensive analysis for the shortcomings of the PBFT algorithm,delves into the PBFT algorithm by combining the idea of the DPoS algorithm with the scoring mechanism.and proposes an improved PBFT consensus algorithm.The main research contents of this paper are as follows.(1)This paper analyze and research the principles,applicable scenarios,advantages and disadvantages under different consensus mechanisms of the blockchain,and provide a theoretical basis for the improvement of the consensus mechanism for the alliance chain.The PBFT algorithm is further improved for the defects of few nodes,random master node election,low throughput,large communication volume and low consensus enthusiasm.The paper first introduces the DPoS algorithm,proposes a Practical Byzantine Fault Tolerant Algorithm S-PBFT,which categorize nodes into master node,shareholder node set,and reserve node set based on Shareholder Nodes.Under this classification,only the master node and the shareholder node set participate in the consensus,the reserve node set is responsible for recording the consensus results,so as to both reduce the communication overhead and improve the system throughput.On this basis,an improved S-PBFT algorithm is proposed to simplify the consensus protocol.As a result,the time complexity of the protocol is reduced from O(n~2)to O(n),which reduce the delay and improve the efficiency of the consensus algorithm in the meantime.(2)The S-PBFT algorithm is further improved,and a Practical Byzantine Fault Tolerant algorithm RS-PBFT based on the scoring system and shareholder nodes is proposed in this paper.The algorithm introduces a scoring system,sets a score for each node,and elects consensus participating nodes through scoring;a reward and punishment mechanism is set up,by which rewards and punishments are given according to the performance of the nodes at the same time;In the meanwhile,a Byzantine node marking mechanism is also established to eliminate Byzantine nodes that reach the upper limit of the mark.Besides,it establishes a reduction mechanism to balance the score gap between different nodes.It also improves the enthusiasm of nodes to participate in the consensus,increase the honesty of nodes,improve the security of the system and reduce the possibility of multi-centralization problems.Finally,this paper tests the relevant performance by building a blockchain system to verify the advantages of the S-PBFT algorithm and the RS-PBFT algorithm in performance.Figure[29]Table[16]Reference[66]...