Enhanced Byzantine consensus method and device in distributed system and readable storage medium

By combining Raft and PBFT algorithms to optimize the consensus process, the existing consensus algorithms are solved inadequate scalability and anti-Byzantine fault tolerance in large-scale distributed networks, and the effects of high throughput and low communication overhead are achieved.

CN119299463AActive Publication Date: 2025-01-10GUANGDONG AVCIT TECH HLDG CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411845934.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-12-16
Publication Date
2025-01-10
Estimated Expiration
2044-12-16

AI Technical Summary

Technical Problem

Existing consensus algorithms, such as Raft, PBFT and WBFT, have problems such as insufficient scalability, low fault tolerance, large communication overhead and insufficient anti-Byzantine fault tolerance, which limits their application in large-scale distributed networks.

Method used

By combining Raft and PBFT algorithms, node group design is introduced to reduce the number of global broadcast nodes, cancel the confirmation stage, only the preparation and preparation stage are retained, consensus process is optimized, and communication complexity and overhead are reduced.

Benefits of technology

Significantly improves the system's throughput, reliability and anti-Byzantine fault tolerance, reduces communication latency and overhead, and ensures efficient data processing capabilities under high load conditions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119299463A_ABST
    Figure CN119299463A_ABST
Patent Text Reader

Abstract

The invention discloses an enhanced Byzantine consensus method and device in a distributed system and a readable storage medium, and relates to the technical field of block chain network communication. The method comprises an initialization process and a consensus process. The initialization process comprises grouping and determining a group leader node; the consensus process comprises a request stage, a pre-preparation stage, a preparation stage and a response stage; after receiving the pre-preparation message broadcasted by the master node, the node judges that the node is a group leader node and verifies that the master node information is correct, consensus is continued, and the pre-preparation message is put into a temporary storage pool; and when the node receives the preparation message broadcasted by the group leader node and judges that the node is the group leader node or the main node, the node judges that the consensus is effective and stores the consensus in a local storage pool after receiving the preparation message broadcasted by more than 2f + 1 nodes. According to the method, the communication overhead between the nodes can be effectively reduced, the system throughput is improved, and the system reliability and the Byzantine fault-tolerant capability are improved.
Need to check novelty before this filing date? Find Prior Art

Citation Information

Patent Citations

  • Raft-PBFT-based block chain consensus method

    CN114422513A

  • Byzantine fault-tolerant consensus method of high-speed response client

    CN116633942A

  • Practical Byzantine fault-tolerant consensus algorithm optimization method and system for unmanned bee colony

    CN116709341A

  • Data processing method and device based on hierarchical block chain network, equipment and medium

    CN117056084A

  • Improved Byzantine fault tolerance method and system based on recommendation reputation model and clustering analysis

    CN117640650A