Consensus method of alliance block chain network

Abstract

The invention discloses a consensus method of an alliance block chain network. The alliance block chain network is composed of peer nodes; a leader node is selected from the peer nodes; then the leader node selects 13 packers from the peer nodes; and one packer election chain records the election information of the packer. The leader node is selected from the peer nodes, and used for collecting the peer node information to build a peer information table, selecting the packers from the peer nodes in the block chain network by using a random algorithm, collecting and verifying transaction information sent by a client, adding transactions passing the verification into a transaction pool, sending transaction data to the packer nodes after the untreated transactions in the transaction pool reach a certain amount, and deleting the transactions from the transaction pool after the transaction information is successfully added into the block chain. The packers are selected by the leader from the peer information table by using a random number matching method, for receiving and verifying the transactions sent by the leader, and packaging the transactions passing the verification into a block. The invention is the consensus method that is random, fair, flexible, reliable and capable of tolerating Byzantium errors.

Description

technical field [0001] The invention belongs to the technical field of block chains and relates to a consensus method, in particular to a consensus method for an alliance block chain network. Background technique [0002] The consensus algorithm is the key to ensure the consistency of the ledger data of each node on the blockchain platform. At present, common consensus algorithms include POW, POS, DPOS, PBFT, RAFT, etc. POW relies on the computing power of the machine to obtain bookkeeping rights, which consumes a lot of resources and is slow. POS is selected based on the equity balance. Compared with POW, the performance is better, but there is still the problem of weak supervision. POW, POS, and DPOS all need reward mechanisms to motivate nodes to participate in bookkeeping, and there are problems such as weak supervision, so they are not suitable for alliance chains. Most alliance chains now use RAFT and PBFT as consensus algorithms. RAFT is a consistent and mature solu...

AI Technical Summary

Problems solved by technology

POW relies on the computing power of the machine to obtain bookkeeping rights, which consumes a lot of resources and is slow

POS is selected based on the equity balance. Compared with POW, the performance is better, but there is still the problem of weak supervision

POW, POS and DPOS all need a reward mechanism to motivate nodes to participate in bookkeeping, and there are problems such as weak supervision, so they are not suitable for alliance chains

Most alliance chains now use RAFT and PBFT as consensus algorithms. RAFT is a consistent and mature solution for traditional distributed systems, with high performance and low resource consumption, but it does not have Byzantine fault tolerance.

PBFT is a consensus mechanism that permits voting and a minority obeys the majority. It has the ability to tolerate Byzantine errors, but its flexibility and reliability are not perfect.

Images