Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus...

Area of Science:

• Computer Science
• Distributed Systems
• Blockchain Technology

Background:

• Current digital asset transaction consensus mechanisms suffer from high communication complexity and low efficiency.
• Practical Byzantine Fault Tolerance (PBFT) is a foundational consensus algorithm facing scalability challenges.

Purpose of the Study:

• To propose a novel Grouped Multilayer PBFT (GM-PBFT) consensus algorithm for digital asset transactions.
• To address the limitations of existing consensus mechanisms by improving efficiency, accuracy, and fault tolerance.

Main Methods:

• Nodes are grouped by transaction type to enable parallel processing of consensus requests.
• A supervisory mechanism using the Raft consensus algorithm enhances Byzantine fault tolerance through validation, auditing, and re-election.
• A stratified consensus approach is implemented, with upper layers recursively sending requests to lower layers to ensure ledger consistency.

Main Results:

• GM-PBFT significantly improves consensus efficiency and accuracy in digital asset transactions.
• The algorithm demonstrates enhanced Byzantine fault tolerance against malicious node attacks.
• Experimental results show superior performance of GM-PBFT over standard PBFT in large-scale networks regarding accuracy, efficiency, security, and reliability.

Conclusions:

• GM-PBFT offers a robust and efficient solution for digital asset transaction consensus.
• The proposed algorithm effectively balances performance and security in distributed ledger technologies.
• GM-PBFT is a promising advancement for large-scale, secure digital asset transaction systems.