Byzantine fault-tolerant consensus method based on random threshold signature mechanism

Abstract

The invention relates to a Byzantine fault-tolerant consensus method based on a random threshold signature mechanism. The Byzantine fault-tolerant consensus method comprises the following steps: initially collecting information of all peer nodes in an alliance block chain network; selecting a peer node and a leader node with a right consensus according to a random algorithm, and actively repairingthe peer node without the right consensus; and the leader node putting the transaction into a transaction pool, packing a certain amount of transaction from the transaction pool to the new block, andproposing a plan. Each peer node with the right consensus determines the validity of the new block through a threshold signature mechanism. According to the invention, computing resources can be effectively saved, and dynamic expandability of nodes and stability of the system are realized.

Description

technical field [0001] The invention relates to a consensus method in the technical field of block chains, in particular to a Byzantine fault-tolerant consensus method based on a random threshold signature mechanism. Background technique [0002] In the blockchain network, data transmission between nodes faces various abnormal situations such as network delay, network packet loss, and hacker intrusion. For these abnormal situations, that is, the existence of Byzantine errors, nodes need to maintain the consistency of valid blocks. The consensus algorithm is the key technology to solve the consistency problem and realize Byzantine fault tolerance in the blockchain. [0003] Consortium blockchain is the preferred blockchain method for cooperation between enterprises today. The consensus algorithm commonly used in consortium chains is the Practical Byzantine Fault Tolerant Method (PBFT for short), which exchanges trust through mutual communication between nodes. One of Byzant...

AI Technical Summary

Problems solved by technology

However, PBFT has the following disadvantages: (1) Based on the static C / S structure, nodes need to be configured before starting, and nodes cannot dynamically join / exit the network; (2) It takes three rounds of communication to reach an agreement, and the cost of node communication is very high. The network bandwidth requirement is high; (3) When there is an error node, the repair speed is too slow, and the number of error nodes may exceed the fault tolerance limit in a certain time window, which will cause the collapse of the entire network; (4) Too much dependence on the master node , the master node is responsible for verifying the transaction sent by the client, and packaging the transaction from the transaction pool to the block. When the master node is malicious, it is easy to cause adverse effects

Images