Practical Byzantine fault-tolerant node setting method

Abstract

The invention provides a practical Byzantine fault-tolerant node setting method which comprises the following steps: receiving a consensus message sent by a consensus node, and extracting informationof a first consensus node from the consensus message, the first consensus node being a consensus node set for sending the consensus message; extracting an execution result of the consensus node according to the received consensus message, and dividing the first consensus node into a second type of Byzantine node and a non-Byzantine node according to the execution result; extracting second consensus node information stored by the client, and obtaining a first type of Byzantine node according to the first consensus node information and the second consensus node information; and performing firstprocessing on the first type of Byzantine node, and performing second processing on the second type of Byzantine node. According to the invention, different types of Byzantine nodes are distinguished,and different processing forces are adopted for different types of Byzantine nodes, so that non-malicious Byzantine nodes can be reserved as much as possible, the view change frequency is reduced, online computing resources are saved, malicious fraudulent or attacked Byzantine nodes are eliminated as much as possible, and safe and reliable operation of the system is ensured.

Description

technical field [0001] The present invention relates to the field of communication technology or computer technology, in particular to the improvement of the consensus process in the block chain, especially a practical Byzantine fault-tolerant node setting method. Background technique [0002] Consensus is the foundation of all blockchain technologies. Without consensus, the concept of blockchain decentralization cannot be formed. There are three deployment modes of blockchain: public chain, alliance chain, and private chain, corresponding to decentralized distribution system, partially decentralized distributed system, and weakly central distributed system. In a decentralized distributed system, we are faced with an unavoidable problem, that is, the consistency problem. When multiple hosts form a node set, the hosts need to perform state replication to reach a consistent state consensus. [0003] The commonly used mainstream consensus mainly includes Pow workload proof, Po...

AI Technical Summary

Problems solved by technology

First, due to environmental factors or the capabilities of the nodes themselves, the nodes do not often have problems, such as occlusion, fading, and electromagnetic interference in the wireless environment, electrophoresis, arcing in the wired environment, narrow bandwidth of the node, and slow machine speed. The above reasons All may cause the node to fail to complete the consensus process in time. In these cases, since deleting a node will change the view, and changing the view also requires a consensus operation, the deletion of the node obviously consumes the computing power of the current consensus system. If the node frequently has problems , then frequent deletion of nodes may consume a lot of computing power

Second, nodes that are disconnected and down are not identified and dealt with in a different way than nodes that are fraudulent or attacked. For example, some nodes that are disconnected or down are due to environmental factors or their own ability factors, and they cannot give feedback in a timely manner. In the case of consensus results, after the environmental factors of such nodes are normal or the processing speed is increased (for example, the machine has opened too many processes, some of the processes are closed after the speed slows down, and the speed returns to normal), at this time such nodes start from Byzantine nodes In this case, there is no need to delete such nodes. However, some fraudulent or attacking malicious nodes continuously release or feed back false consensus messages, which not only occupy and waste limited computing resources, but also Impact on the robustness of the consensus node set

For these two cases, the existing technology often adopts a one-size-fits-all approach, or it may be directly deleted by the node, or the node is deleted when the redundancy value or weight value of the node reaches a certain threshold, that is to say, the existing technology There is no distinction between two different types of nodes, malicious Byzantine nodes cannot be quickly deleted, and there is no fault-tolerant mechanism for non-malicious Byzantine nodes

Images