A consensus method for blockchain data and related equipment

Abstract

The embodiment of the present application discloses a consensus method for blockchain data, including the proposed node receiving the signature information sent by the plurality of voting nodes respectively, the signature information including the block to be confirmed by the voting node using the BLS signature algorithm Signing; judging whether the number of received signature information reaches a preset value; if so, using a plurality of received signature information to aggregate and generate an aggregate signature using the BLS signature algorithm; sending the aggregate signature to the voting node, so that when the voting node passes the verification of the aggregated signature, it is determined that the block to be confirmed is valid. The embodiment of the present application also discloses a blockchain data consensus system and device. Among them, the BLS signature algorithm is used to generate aggregated signatures in the consensus process of the blockchain, which can aggregate signature votes from various voting nodes, simplify the consensus process of the blockchain, and reduce the risk of blockage in the network.

Description

technical field [0001] This application relates to blockchain technology, and in particular, to a consensus method and related equipment for blockchain data. Background technique [0002] As a data structure that stores data in chronological order, blockchain can support different consensus mechanisms. Consensus mechanism is an important component of blockchain technology. The goal of blockchain consensus mechanism is to make all honest nodes maintain a consistent view of the blockchain. [0003] Practical Byzantine Fault Tolerant (PBFT, Practical Byzantine-Fault-Tolerant) is a commonly used consensus algorithm in blockchain, that is, the service is modeled as a state machine, and the state machine is replicated in different nodes of the distributed system. Each copy of the state machine saves the state of the service and also implements the operation of the service. [0004] In the process of the PBFT algorithm, the total number of nodes participating in the consensus is ...

AI Technical Summary

Problems solved by technology

[0006] As can be seen from the above process description, the communication complexity of the PBFT algorithm is relatively high. For a blockchain consensus network composed of n nodes, each round of consensus process requires O(n^2) times of communication

For a network composed of a small number of nodes in the same computer room, the performance problems caused by high communication complexity have little impact, but in many scenarios, the blockchain needs more nodes to participate in order to better reflect its credibility and practical value , so there is a demand for increasing the number of nodes

Experiments show that when the PBFT algorithm is applied to the number of nodes greater than 19, the performance will become significantly lower; when the number of nodes reaches 31, the consensus algorithm will hardly work normally

Images