Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Byzantine fault-tolerant method and device with high fault-tolerant expandability and storage medium

A Byzantine, consensus technology, applied in the field of devices and storage media, Byzantine fault tolerance method, can solve the problem of not being able to guarantee decentralization and democratization, achieve fault tolerance and scalability improvement, reduce communication complexity, improve The effect of scalability

Active Publication Date: 2022-03-15
XINJIANG UNIVERSITY
View PDF13 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The present invention aims at the problem that the existing PBFT and related improved algorithms cannot ensure the decentralization and democratization, and at the same time improve the performance in terms of network scalability, communication complexity and fault tolerance. The present invention proposes a With a highly fault-tolerant and scalable Byzantine fault-tolerant method, device, and storage medium, the present invention can not only ensure consensus democracy, but also improve network scalability, reduce network communication complexity, and improve fault-tolerant performance. See the following description for details:

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Byzantine fault-tolerant method and device with high fault-tolerant expandability and storage medium
  • Byzantine fault-tolerant method and device with high fault-tolerant expandability and storage medium
  • Byzantine fault-tolerant method and device with high fault-tolerant expandability and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0048] The embodiment of the present invention provides a Byzantine fault tolerance method with high fault tolerance and scalability, see figure 1 and figure 2 , the method includes the following steps:

[0049] Step 101: Introduce a consistent hash algorithm, map the IP information of each node on the hash ring after hash calculation, and carry out consensus on the hash ring according to the block information master node, each group representative node and each group node s Choice;

[0050] The embodiment of the present invention makes the selection of consensus nodes not require a centralized mechanism through the above-mentioned design, and hides the identity of the nodes in advance to achieve the purpose of restraining the nodes from doing evil.

[0051]Step 102: Design the node selective broadcast model and the representative node vote counting model by adopting the consensus within the group first and then the consensus between the groups;

[0052] Among them, the co...

Embodiment 2

[0063] Combine below Figure 2-Figure 6 The scheme in Example 1 is further introduced, see the following description for details:

[0064] Step 201: Introduce the consistent hash algorithm, map the IP information of each node on the hash ring after hash calculation, and carry out consensus on the hash ring according to the block information. Selection: In order to ensure the anonymity and decentralization of consensus nodes, the embodiment of the present invention adopts a consistent hash algorithm for grouping, selection of representative nodes, and selection of master nodes. Each node according to hash (node ip ) to calculate its own hash value (where node ip Represents the node IP), because the consistent hash algorithm has anti-collision and balanced decentralization. Therefore, the mapping values ​​of each node can be distributed as evenly as possible between 0 and 2 32 on the hash ring. In each round of consensus, first according to hash(master ip +previous hash +...

Embodiment 3

[0094] Combine below Figure 7 The scheme in embodiment 1 and 2 is carried out feasibility verification, see the following description for details:

[0095] Introduce the FND model (faulty number determined model) and combine the two models established to simulate the consensus experiment. When m=4, experiments were carried out when the network size was 101, 201, and 301. In the experiment, Byzantine nodes were randomly assigned to each group independently of each other, and the change of the system consensus success rate with the number of Byzantine nodes in the network was analyzed. . Under each number of Byzantine nodes, 200 simulation experiments were carried out, and the number of consensus successes was counted to obtain the consensus success rate.

[0096] The final experimental results are as Figure 7 As shown, it can be seen that the upper limit of fault tolerance does exceed 1 / 3. When the number of Byzantine nodes is less than 1 / 3 of the number of network nodes,...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a Byzantine fault-tolerant method and device with high fault-tolerant expandability and a storage medium, and the method comprises the steps: introducing a consistent Hash algorithm, mapping the IP information of each node on a Hash ring after Hash calculation, and carrying out the selection of a consensus main node, each group of representative nodes and each group of nodes on the Hash ring according to the block information; designing a node selective broadcast model and a representative node counting model by adopting in-group consensus and then inter-group consensus; based on the node selective broadcast model and the representative node counting model, obtaining an upper limit of high-fault-tolerance extensible Byzantine fault tolerance; probabilistic analysis is carried out on group representative node combined work and disable and inter-group node combined work and disable possibly existing in the group consensus; and calculating the communication complexity according to the consensus flow of the high-fault-tolerance extensible Byzantine fault tolerance. The device comprises a processor and a memory. According to the method, the democratic consensus can be ensured, the network expansibility can be improved, the network communication complexity is reduced, and the fault-tolerant performance is improved.

Description

technical field [0001] The present invention relates to the field of blockchain consensus, in particular to a Byzantine fault-tolerant method, device and storage medium with high fault tolerance and scalability, and in particular to the issues of scalability and fault tolerance of consensus algorithms in alliance chains. Background technique [0002] At present, the PBFT (Practical Byzantine Fault Tolerance) algorithm has become the most widely used consensus algorithm in the alliance chain. However, due to the high communication complexity, poor scalability, and poor fault tolerance of the PBFT algorithm, it is difficult for the performance of blockchain-related projects to meet actual business needs. [0003] In recent years, many improved algorithms have appeared for PBFT. For example, some algorithms combine PBFT with public chain consensus algorithms. Its core idea is to select a certain number of nodes as committees through algorithms such as PoW (proof of work), PoS...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/06H04L9/32H04L41/14
CPCH04L9/0643H04L9/3236H04L9/3255H04L41/145H04L2209/463
Inventor 贾振红阳建
Owner XINJIANG UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products