Practical Byzantine fault-tolerant consensus mechanism optimization system for industrial block chain
A blockchain and Byzantine technology, applied in the field of practical Byzantine fault-tolerant consensus mechanism optimization system, can solve the problems of multi-access, high concurrency, low scalability and high complexity that are not suitable for industrial Internet
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example
[0044] The consensus process adopted by the present invention is an arbitration-based Byzantine copy. When there is no dispute or Byzantine fault, it is a fast consensus process, with a total of three steps; when there is a Byzantine fault or dispute, a slow Byzantine agreement is run, with a total of 5 steps. In order to maintain consistency in the absence of a leader, each replica node needs to maintain an instance table I[] and a dependency set D[]. Where D[I[L]] is the request instance number on which request L depends. The specific process is as Figure 5 shown.
[0045] (1) The client co sends a request m to its closest replica node i.
[0046] (2) Replica node i assigns instance number IL to it in sequence after receiving the request, and assigns its D[IL] to be empty. After the assignment is completed, send a prepare command to other replicas in node group n.
[0047] (3) After receiving the preparation message, other replicas verify according to the local dependen...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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