Consensus method of block chain data and related equipment

Abstract

The embodiment of the invention discloses a block chain data consensus method and related equipment thereof, which are used for reducing the communication complexity of block chain consensus. The method comprises the steps of a proposal node obtaining a to-be-voted block; sending the to-be-voted block to the voting node; receiving signature information sent by the voting node, wherein the signature information is used for indicating that the voting node successfully verifies the to-be-voted block; judging whether the number of the signature information received within preset time reaches a preset value or not; if yes, confirming information is generated according to the signature information, and the confirming information indicating that the to-be-voted block is a block achieving consensus; and sending the confirmation information to the voting node, so that the voting node determines the to-be-voted block as a block achieving consensus. The proposal node and the voting node in the block chain realize the consensus of the block to be voted through the signature information and the confirmation information, so that the communication complexity of the block chain consensus is effectively reduced.

Description

technical field [0001] This application relates to the technical field of blockchain, and in particular to a consensus method and related equipment for blockchain data. Background technique [0002] The consensus mechanism is to complete the verification and confirmation of transactions in a very short period of time through the voting of special nodes. For a transaction, if several nodes with irrelevant interests can reach a consensus, it can be considered that the entire network can also agree on this. Reach a consensus. [0003] At present, there are many Byzantine fault-tolerant consensus algorithms, such as the practical Byzantine fault-tolerant algorithm (PBFT, Practical Byzantine Fault Tolerance), which was proposed by Miguel Castro and Barbara Liskov in 1999. It solves the problem of low efficiency of the original Byzantine fault-tolerant algorithm, and the time complexity of the algorithm The degree is O(n^2), which makes it possible to solve the Byzantine fault to...

AI Technical Summary

Problems solved by technology

[0003] At present, there are many Byzantine fault-tolerant consensus algorithms, such as the practical Byzantine fault-tolerant algorithm (PBFT, Practical Byzantine Fault Tolerance), which was proposed by Miguel Castro and Barbara Liskov in 1999. It solves the problem of low efficiency of the original Byzantine fault-tolerant algorithm, and the time complexity of the algorithm The degree is O(n^2), which makes it possible to solve the Byzantine fault tolerance problem in practical system applications

[0004] However, the communication complexity of the traditional PBFT consensus mechanism is high, and it cannot support a large number of nodes to participate in the consensus. When the number of nodes reaches more than a hundred levels, the performance of the PBFT consensus algorithm drops sharply, and the traditional PBFT algorithm cannot support large-scale node participation. consensus

Images