Practical Byzantine fault-tolerant node setting method

A Byzantine and practical technology, applied in the field of communication, it can solve the problems of slow machine speed, waste of computing resources, robustness impact, etc., and achieve the effect of reducing the number of view changes, saving computing resources, and ensuring safe and reliable operation.

CN111629022BActive Publication Date: 2022-05-20HENGBAO
6 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Publication Date
2022-05-20

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The present invention provides a practical Byzantine fault-tolerant node setting method, wherein, the consensus message sent by the consensus node is received, and the information of the first consensus node is extracted from the consensus message, wherein the first consensus node is the one for sending the consensus message The set of consensus nodes; according to the received consensus message, extract the execution result of the consensus node, and according to the execution result, divide the first consensus node into the second type of Byzantine nodes and non-Byzantine nodes; extract The second consensus node information saved by the client, according to the first consensus node information and the second consensus node information, obtains the first type of Byzantine node; performs the first processing on the first type of Byzantine node, and performs the first processing on the second type The node does the second processing. The present invention distinguishes different types of Byzantine nodes, and adopts different processing strengths for different types of Byzantine nodes, can keep non-malicious Byzantine nodes as much as possible, reduces the number of view changes, saves online computing resources, and Try to eliminate malicious fraud or attacking Byzantine nodes to ensure the safe and reliable operation of the system.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The present invention relates to the field of communication technology or the field of 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 workl...

Examples

Embodiment 1

[0041] The following steps are taken as an example, all of which occur after a consensus process is completed, assuming that there are a total of N consensus nodes as the set of consensus nodes for this view. The implementation process of this embodiment refers to the attached image 3 .

[0042] Step S102, receiving a consensus message sent by a consensus node, and extracting first consensus node information from the consensus message, where the first consensus node is a set of consensus nodes that send the consensus message.

[0043] Client C receives consensus messages sent by each consensus node. Among them, at least 2f+1 consensus nodes have replied to the client with a consistent consensus message, assuming that the number of consensus nodes reached is N0, and the remaining consensus nodes either did not reply to the message, or the reply message was consistent with that of N0 consensus nodes Replied messages are inconsistent. Client C extracts the information of the ...

Embodiment 2

[0063] In this embodiment, the relevant steps or functions implemented on the client C can be moved to the main consensus node P for processing.

[0064] Step S202, after the client receives the consensus message, it sends the consensus message to the main consensus node for processing

[0065] After each consensus node replies, the consensus result of the reply is collected and sent to the main consensus node, which should contain at least 2f+1 consistent consensus messages.

[0066] After the main consensus node P receives the consensus message from the client C, it extracts the consensus node information that sent the consensus message. The consensus node information can use information such as digital ID, machine name, IP address, MAC address, etc. The structure of the consensus information is , among them, the digital identification i of the consensus node is a regular parameter, and can also be replaced by other identification methods. In addition, r is the execution resu...