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

Optimized practical byzantine fault tolerance applicable to block chain

A Byzantine and blockchain technology, applied in the field of optimizing Byzantine fault-tolerant algorithms, it can solve the problems of inability to dynamically perceive the number of nodes, low efficiency of malicious nodes, etc., to reduce availability, improve practicability, and improve security.

Pending Publication Date: 2020-10-30
NANJING UNIV OF TECH
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It is used to solve the problem that the traditional Byzantine algorithm cannot dynamically perceive the number of nodes and the efficiency of electing malicious nodes is low

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
  • Optimized practical byzantine fault tolerance applicable to block chain
  • Optimized practical byzantine fault tolerance applicable to block chain
  • Optimized practical byzantine fault tolerance applicable to block chain

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0008] see figure 1 , figure 2 , image 3 Shown:

[0009] 1. An optimized Byzantine fault-tolerant algorithm for blockchain practicability, where nodes join and exit and trigger a master node selection mechanism, characterized in that the method includes the following steps:

[0010] Step 1: The node joins. The process is divided into four stages: request, confirmation, reply, and completion. When the node joins, the master node selection mechanism is triggered. Go to step two;

[0011] Step 2: Select the master node. Through the scoring and voting coordination mechanism, the master node with high correctness is selected to prepare for the consensus of the system. If any node wants to exit, go to step 3;

[0012] Step 3: The node exits. The process is similar to that of joining. It is divided into four stages: request, confirmation, reply, and completion. When the node exits, the master node selection mechanism is triggered again to prepare for the next consensus.

[0...

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 designs an optimized practical byzantine fault tolerance (OPBFT)applicable to a block chain. The OPBFT is used for solve the problems that a traditional Byzantine algorithm cannot dynamically sense the number of nodes and the efficiency of electing malicious nodes is low. In order to solve the problem of node adding, a node dynamic adding and quitting mechanism is introduced in the method, node adding and quitting need mutual confirmation among all nodes, and the confirmation process is divided into four stages, namely request, confirmation, reply and completion. In order to solve the problem of randomness of main node selection, a scoring and voting collaborative mechanism is introduced, the scoring mechanism follows the longest chain principle of a block chain, and the voting scoring mechanism is cooperatively carried out. A node adding and quitting mechanism in the method enables the number of consensus nodes to be variable, and the practicability of a consensus algorithm is greatly improved. A scoring and voting cooperation mechanism greatly ensures the correctness of the selected main node and improves the security of the system.

Description

technical field [0001] The invention relates to the field of Byzantine consensus algorithm of block chain technology in a distributed system, and specifically designs an optimized Byzantine fault-tolerant algorithm applicable to block chain. Background technique [0002] Blockchain is a decentralized protocol that includes distributed symmetric network, data encryption, consensus algorithm and other technologies. Among them, the choice of consensus algorithm is the core part of blockchain design. The practical Byzantine fault tolerance algorithm PBFT (practicalByzantine fault tolerance) is improved from the Byzantine consensus algorithm BFT (Byzantine fault tolerance), inherits the advantages of BFT, and reduces the overhead of the Byzantine agreement on a large scale, so the Byzantine algorithm can be applied in the blockchain system . The PBFT algorithm is an algorithm based on state machine copy replication. Each state machine copy can save the service state and meet th...

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
IPC IPC(8): H04L29/06H04L29/08H04L9/32
CPCH04L63/08H04L67/10H04L9/3297H04L2209/463
Inventor 王辉周佳东
Owner NANJING UNIV OF TECH
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com