Unlock instant, AI-driven research and patent intelligence for your innovation.

Optimistic Byzantine fault-tolerant consensus method without backspacing

A Byzantine, consensus technology, applied in the field of Byzantine fault-tolerant consensus that does not require rollback, to achieve the effect of simple implementation method, less error-prone, and code quality assurance

Pending Publication Date: 2022-03-18
ZHEJIANG UNIV +1
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Existing Byzantine fault-tolerant algorithms either require two rounds of voting, or use speculative execution to reduce the number of voting rounds, and introduce the need for state rollback operations. How to improve the efficiency of the consensus process is still an unresolved problem

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
  • Optimistic Byzantine fault-tolerant consensus method without backspacing
  • Optimistic Byzantine fault-tolerant consensus method without backspacing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] The present invention will be described in detail below according to the accompanying drawings.

[0038] The optimistic Byzantine fault-tolerant consensus method without fallback of the present invention includes the following steps:

[0039] (1) The master node broadcasts the proposal.

[0040] Assume that there are (3f+1) nodes in the system, including at most f Byzantine nodes and at least (2f+1) correct nodes, and use the BLS (Boneh-Lynn-Shacham) signature algorithm to sign messages to achieve aggregated signatures. Client C sends request M=c >(where σ c ←Sign() is the signature information of the client, Sign() is the signature function, and TX is the transaction requested by the client) to the master node S p , at the same time, the client C sets the timer (the size of the timer can be set to an appropriate value according to the network conditions), and the master node S p Receive M and verify σ c After that broadcast p > to all nodes S i (i can be equal to ...

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 an optimistic Byzantine fault-tolerant consensus method without backspacing, which comprises the following steps that: a master node initiates a proposal, all nodes vote the proposal for the first round, and the master node judges whether the condition of a system is optimistic according to the voting result of the first round; different consensus methods are adopted to carry out consensus on the proposal under optimistic and non-optimistic conditions; all the nodes verify the proposal request sent by the main node and execute corresponding operation according to the message type; in the process, if the node finds that the master node has the Byzantine behavior, the node broadcasts a view change request to elect a new master node. The method can be applied to a consensus layer as a consensus protocol in block chain application, is simple in implementation method, is high in universality, effectively reduces the bandwidth consumption, and has the advantages of high efficiency, high robustness and the like.

Description

technical field [0001] The present invention relates to the technical field of block chains, in particular to an optimistic Byzantine Fault Tolerance (BFT) consensus method that does not require rollback. Background technique [0002] The Practical Byzantine Fault Tolerant Consensus Algorithm was proposed by Miguel Castro and Barbara Liskov in 1999 to solve the problem of low efficiency of the original Byzantine Fault Tolerance algorithm. All nodes reach a consensus through two rounds of voting. Since the voting behavior of nodes needs to broadcast information, the communication complexity is too high. Therefore, when the number of nodes reaches about 100, the performance of the general system drops sharply. [0003] Aggregated signature technology can combine multiple signatures into one signature, and only one verification operation is required for the aggregated signature. Using this technology, the signatures of multiple voting information received can be aggregated, and...

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): H04L9/32G06F16/27G06Q40/04
CPCH04L9/3247G06F16/27G06Q40/04H04L2209/463
Inventor 刘健芦浩任奎杨国正臧铖陈嘉俊
Owner ZHEJIANG UNIV