Rapid consensus method and system based on distributed network, electronic equipment and readable storage medium

Abstract

The invention provides a rapid consensus method and system based on a distributed network, electronic equipment and a readable storage medium wherein the rapid consensus method comprises the following steps: forming a ring network structure by known network topology structures corresponding to the distributed network according to network transmission duration between nodes; and one node is selected as a main node to carry out consensus operation, and the consensus operation of the next round of nodes is carried out without completely realizing the whole consensus process by the previous round of nodes. Through the technical scheme provided by the invention, the nodes can be heterogeneous into the ring network through the network transmission duration between the nodes under the condition that the distributed network topology structure is known, so that a fast Byzantine fault-tolerant consensus algorithm is realized; and the next consensus round can be directly entered without waiting for a complete node confirmation process. In addition, the correctness and integrity of information can be ensured through a method of controlling the round time interval, and the method has a promotable value.

Description

technical field [0001] The present invention relates to the technical field of distributed system consensus, and specifically discloses a fast consensus method, system, electronic equipment and readable storage medium based on a distributed network. Background technique [0002] In a distributed system, multiple hosts form a network cluster through asynchronous communication. In such an asynchronous system, state replication between hosts is required to ensure that each host reaches a consistent state consensus. However, in an asynchronous system, there may be failed hosts that cannot communicate, the performance of the hosts may degrade, and the network may become congested, which may cause error messages to propagate within the system. Therefore, it is necessary to define a fault-tolerant protocol in an asynchronous network that is unreliable by default to ensure that each host reaches a safe and reliable state consensus. [0003] Byzantine Fault Tolerance (BFT) is an im...

AI Technical Summary

Problems solved by technology

In each round of the algorithm, the consensus must be completed after two confirmations from more than 2 / 3 nodes. The communication time is long and the structure of the network data packet is large, which cannot meet the performance requirements of high TPS.

However, other BFT algorithms in the prior art are optimized for the selection of the master node or the consensus verification process, and do not solve the fundamental problem of network communication performance.

Images