Raft-algorithm-based block chain consensus mechanism

Abstract

The invention relates to a Raft-algorithm-based block chain consensus mechanism. The mechanism comprises: consensus node information of a block chain is stored into the block chain and an initial state of a consensus node is set to be a follower state; on the basis of a Raft algorithm, a consensus node of an initial leader state is selected by combining the height of the block, wherein the consensus node of the leader state is used for recording a transaction event and generating a new block; and at the end of the term of the consensus node of the leader state, a consensus node of a leader state is selected again. Because the height of the synchronous block is considered for reference during the consensus node selection process of the leader state, the consensus efficiency can be improved and the transaction confirmation time can be shortened; and because the consensus node is selected again at the end of the term, the system fault tolerance can be improved. Moreover, on the basis of uniqueness of the consensus node selection of the leader state, each block has final consistency, thereby avoiding block chain furcation. Meanwhile, dynamic entrance and exit of a consensus node can be realized based on a management mechanism of the consensus node by an intelligent contract.

Description

technical field [0001] The invention relates to the technical field of block chain consensus mechanism, in particular to a block chain consensus mechanism based on Raft algorithm. Background technique [0002] At present, the consensus mechanisms widely used in the industry are PoW algorithm (including its extended algorithm PoS and DPoS), PBFT algorithm, Paxos algorithm and Raft algorithm. [0003] PoW algorithm (Proof Of Work): proof of work, used to confirm that a certain node has done a certain amount of work. It is an economic countermeasure against denial of service attacks and other service abuses. It requires the initiator to perform a certain amount of calculation, which means that the computer needs to consume a certain amount of computing time. [0004] PBFT algorithm (Practical Byzantine Fault Tolerance): PBFT means a practical Byzantine fault tolerance algorithm, which solves the problem of low efficiency of the original Byzantine fault tolerance algorithm and...

AI Technical Summary

Problems solved by technology

[0013] 1) The election consensus node does not refer to the block height of the node and cannot be effectively combined with the blockchain;

[0014] 2) Elect a consensus node and keep accounting by this node, which has poor fault tolerance;

[0015] 3) At present, many schemes have insufficient supervision of consensus nodes, and cannot realize the dynamic joining and exit of consensus nodes

Images