Consensus method of block chain data and related equipment

Abstract

The embodiment of the invention discloses a consensus method of block chain data, which comprises the following steps that: a proposal node receives signature information sent by a plurality of votingnodes respectively, and the signature information comprises signatures of blocks to be confirmed by the voting nodes by using a BLS signature algorithm; whether the number of the received signature information reaches a preset value or not is judged; if yes, the received plurality of pieces of signature information is utilized to aggregate and generate an aggregate signature by using a BLS signature algorithm; and the aggregation signature is sent to the voting node, so as to ensure that the to-be-confirmed block is valid when the voting node verifies the aggregation signature successfully. The embodiment of the invention further discloses a consensus system and device for the block chain data. Wherein an aggregation signature is generated by using a BLS signature algorithm in the consensus process of the block chain, signature votes from all the voting nodes can be aggregated, and the consensus process of the block chain is simplified, so that the risk of blockage in the network is reduced.

Description

Technical field [0001] This application relates to blockchain technology, and in particular to a consensus method of blockchain data and related equipment. Background technique [0002] As a data structure that stores data in chronological order, blockchain can support different consensus mechanisms. The consensus mechanism is an important component of blockchain technology. The goal of the 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 the blockchain, that is, the service is modeled as a state machine, and the state machine is replicated at different nodes in the distributed system. Each copy of the state machine saves the state of the service and also realizes the operation of the service. [0004] In the process of the PBFT algorithm, the total number of nodes participating in the consensus is s...

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