Asynchronous Byzantine consensus method and system based on DAG

A Byzantine, consensus technology, applied in the field of DAG-based asynchronous Byzantine consensus method and system, it can solve the problems of low throughput, 51% computing power attack, high energy consumption, achieve a high degree of centralization, ensure security, and ensure fairness sexual effect

Pending Publication Date: 2022-01-11
NAT UNIV OF DEFENSE TECH
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The technical effect of this patented method described for achieving synchronized networks with low delays are improved reliability due to its ability to choose between two or more parties without relying on any external factors like clocks. This allows multiple agents working together at once to achieve better performance than if they were all acting independently from each other. Additionally, it improves upon traditional methods that rely heavily on central control mechanisms such as locking servers.

Problems solved by technology

This patented describes two main issues: 1) Conventional Distributed Computations Protocol (DCSP), used over networks where communication delays or interference occur; 2) Intermediate Network Time Synchronism Platform (ITS2), limited in their ability to provide reliable service across domains without compromising each other's capabilities due to resource limitations.

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
  • Asynchronous Byzantine consensus method and system based on DAG
  • Asynchronous Byzantine consensus method and system based on DAG
  • Asynchronous Byzantine consensus method and system based on DAG

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] Such as figure 1 and figure 2 As shown, the DAG-based asynchronous Byzantine consensus method in this embodiment includes:

[0030] 1) Specify N nodes participating in the consensus in the asynchronous network, where N takes the value of 3f+1, where f is the number of Byzantine nodes;

[0031] 2) For the baseline event created by the source node in the asynchronous network, other nodes are selected for propagation according to the weight probability, and during the event propagation process, each node generates a DAG locally based on the propagated event and the communication process;

[0032] 3) N nodes participating in the consensus vote and submit: Each node divides the local DAG into different rounds. If the witness event of the r+1 round can see the event of the r round, it means that the r+1 round The witness event votes for it, otherwise it means voting against it; if the witness event of the r+2 round is strong and the witness event of the r+1 round is visibl...

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 asynchronous Byzantine consensus method and system based on DAG, and the method comprises the steps: assigning N nodes which are used for forming a participation consensus in an asynchronous network, selecting other nodes for propagation according to a weight probability for a baseline event created by a source node, and in the event propagation process, each node generating a DAG locally based on the propagated event and the communication process; n nodes participating in consensus performing voting submission: each node divides a local DAG into different rounds, by taking visibility and strong visibility of witness events in continuous rounds as a voting basis, well-known witnesses are determined, if all or most of well-known witnesses are visible to baseline events, the current baseline event reaches a final confirmation state, and the state is submitted to a chain. The method has the advantages of high expandability, high security, high decentration degree and the like, and can effectively reduce the network communication overhead, improve the expandability of the existing algorithm, improve the system throughput and reduce the confirmation delay.

Description

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

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
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products