Research On Blockchain Consensus Algorithm Based On Election

The consensus algorithm is responsible for the synchronization of server node information in the Blockchain system and is one of the most important technologies in the blockchain system.Because each node needs to be able to correctly process requests from different clients,if the node status is different,it will affect the accuracy of the system’s processing messages.Appropriate consensus algorithms can quickly complete the consensus work and ensure the smooth operation of the system.Therefore,selecting a suitable consensus algorithm is the first task of building a blockchain system.A good consensus algorithm can avoid wasting consensus time of system,thereby improving system operation efficiency.By summarizing the existing algorithms,the consensus algorithms are classified into election,proof,random,alliance,and hybrid.The Raft algorithm in the election consensus algorithm is studied,and the consensus process of the algorithm can be decomposed into the election phase and the log copy phase.In the election phase,if there are isolated “outdated” nodes in the system cluster,the algorithm lacks the processing of such nodes;during the log replication phase,if the leader of the cluster stops working suddenly,the Raft algorithm can only work again.Enter the election phase to re-elect the Leader node.Considering the above two shortcomings,the paper proposes a Raft for Leadership Transfer(LTRaft)that can transfer leadership by adding alternate Leader roles.After an “outdated” node appears in the system,the node is deprived of the right to vote during its election phase through the state monitoring mechanism;the candidate leader is selected during the election phase through the Leader permission transfer mechanism.After the leader node goes down,the candidate leader node will replace the leader node complete consensus work to ensure stable system operation.LTRaft algorithm coding and simulation experiments are performed in Golang language.These aspects are compared with other consensus algorithms after the election phase,log replication phase,system delay,throughput,and "outdated" nodes appear in the system.The experimental results show that under normal circumstances,the consensus time of the LTRaft algorithm and the unimproved Raft algorithm increases slightly,and the consensus time of the LTRaft algorithm will be significantly reduced after the above two cases.