Byzantine fault-tolerant consensus method and system

Abstract

The invention belongs to the technical field of block chains, and provides a Byzantine fault-tolerant consensus method and system. The Byzantine fault-tolerant consensus method comprises the steps of:generating a block through a packaging transaction of a main node, and broadcasting the block to a consensus node in a blockchain; verifying the received newly generated block through using the consensus node, voting a current proposal according to a verification result, and broadcasting the voted current proposal to other consensus nodes; counting votes of the newly generated block through usingconsensus node, and judging whether the proportion of votes voting through in total votes exceeds a preset threshold value or not; if so, submitting the newly generated block, generating submission information and broadcasting the submission information to other consensus nodes; if not, generating non-assigned submission information and broadcasting the non-assigned submission information to other consensus nodes; and counting the submission information of the newly generated block through using the consensus node. According to the Byzantine fault-tolerant consensus method and the system of the invention, the fault-tolerant rate of the Byzantine fault-tolerant consensus method is improved, the tolerableness of network partition is realized, and the problem that states of the consensus nodes in the blockchain cannot be consistent due to the network partition is solved.

Description

technical field

[0001] The invention relates to the technical field of block chains, in particular to a Byzantine fault-tolerant consensus method and system. Background technique

[0002] The nodes in the consortium blockchain are peer-to-peer and exist in a distributed P2P network. In a P2P network, the status of nodes is uncontrollable, such as node downtime, network delay, or even being attacked and doing evil. These problems Modeled as the Byzantine Generals Problem. Byzantine fault-tolerant algorithms must handle these failures, and these algorithms must also meet the required specification of the problem they are trying to solve.

[0003] Currently, there are many algorithms for implementing Byzantine Fault Tolerance, among which PBFT (Practical Byzantine Fault Tolerance Algorithm), Tendermint, and Istanbul algorithms are representative and applied to the consortium blockchain. Byzantine fault-tolerant algorithms need to seek a balance between consistency and availab...

Images