Block chain consensus processing method, device and system

Abstract

The embodiment of the invention discloses a block chain consensus processing method, device and system. The method comprises the following steps: enabling an outbound node in a block chain continuously to generate at least one block, sign the block and broadcasts the block; receiving a block by a consensus node in the block chain, and verifying whether the block is legal or not according to a preset rule; when it is confirmed that the block is legal, signing and broadcasting the block; the node in the block chain judges whether the node is in a block outlet window period or not, and when it isconfirmed that the node is in the block outlet window period, the node in the block outlet window period serves as a block outlet node; and when the signature number of the generated blocks reaches apreset number, confirming that the blocks obtain the consensus of the nodes in the block chain, and writing the consensus blocks into the block chain. By utilizing the embodiment of the specification, the consensus, the block output efficiency, the expansibility, the resource consumption and the fault tolerance can be more balanced and efficient.

Description

technical field [0001] The embodiments of this specification belong to the field of Internet information processing technology and computer technology, and in particular relate to a processing method, device and system for blockchain consensus. Background technique [0002] In a blockchain system, a consensus mechanism is a mechanism that enables all or most network nodes to agree on certain transactions or data. The consensus mechanism allows the system to still work normally when some network nodes fail. This fault tolerance is a major advantage of the blockchain system. Therefore, the consensus mechanism is the core of the blockchain system. The industry currently has the following requirements for the technical level of the public chain consensus mechanism: performance efficiency: high concurrency, high throughput, high-speed processing; resource consumption: CPU, network input and output, storage and other computer resources consumed during the consensus process; fault...

AI Technical Summary

Problems solved by technology

The Paxos algorithm is a consensus mechanism based on electing a leader. The leader node has absolute authority and allows strong supervisory nodes to participate. It has high performance and low resource consumption. All its nodes generally have an offline access mechanism, but they are not allowed during the election process. There are malicious nodes, no fault tolerance

The PBFT algorithm is similar to Paxos. It is also a consensus mechanism that adopts permission voting and a minority obeys the majority to elect a leader for bookkeeping. However, this consensus mechanism allows Byzantine fault tolerance. Higher and lower energy consumption, the algorithm will jointly elect the leader by the nodes of the whole network in each round of bookkeeping, allowing 33% of the nodes to do evil, and the fault tolerance is 33%, but each round of PBFT consensus is based on the confirmation of the previous block Only then can the next round be carried out, which seriously affects the consensus efficiency

The DBFT algorithm is based on the Byzantine Fault Tolerant Algorithm, adding the authorization consensus wit, which uses the rights and interests to select the bookkeeper, and then each bookkeeper reaches a consensus through the Byzantine Fault Tolerant Algorithm. Professional bookkeepers can tolerate any type of The bookkeeping is done by multiple people, and each block has finality. The reliability of the algorithm is proved by strict data. The disadvantage is that when one-third or more of the bookkeepers stop working, the system will Unable to provide service

[0004] However, all of the above consensus mechanisms have a similar problem, that is, consensus and block generation are executed serially. This mechanism will directly lead to the limitation of consensus and block generation efficiency, and cannot break the existing bottleneck and achieve high throughput level

Images