Asynchronous BFT Consensus via Peer Leader Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional asynchronous Byzantine Fault Tolerant (BFT) protocols face inefficiencies in scaling with an increasing number of peers due to high computational complexity, message complexity, and round complexity, making them impractical for wide-area networks (WANs).
Innovation Solution
An efficient, scalable, and fast asynchronous BFT protocol with computational complexity up to O(N), round complexity of O(1) per bit, and message complexity of O(N^2) per bit, which allows more peers to join a growing WAN by electing peer leaders, broadcasting indices, and executing a binary agreement protocol to determine transaction validity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional asynchronous BFT protocols are used to ensure Byzantine fault tolerance in distributed networks, then reliability is maintained, but computational complexity increases to O(N^2) or higher, making the system difficult to operate and scale
Solution Approach 1:
The protocol segments the consensus process into distinct phases (proposal, pre-vote, vote, commit) and divides the network into peer leaders and regular peers. This segmentation allows the system to maintain reliability through comprehensive voting while reducing individual computational burden by distributing different tasks across different peer roles and phases.
Solution Approach 2:
Peer leaders act as intermediaries who aggregate votes and manage the consensus process on behalf of the network. This intermediary role reduces the computational complexity for regular peers while maintaining the reliability guarantees of the full BFT protocol through the leader's coordinated vote aggregation and proposal management.
2Reliability
If conventional asynchronous BFT protocols are deployed in WANs with growing numbers of peers, then Byzantine fault tolerance is maintained, but message complexity increases to O(N^2) or higher, increasing loss of information and communication overhead
Solution Approach 1:
The protocol merges multiple vote messages into aggregated vote sets that are broadcast once per phase. Peer leaders combine individual peer votes into consolidated representations, reducing the number of messages that need to be transmitted across the network while preserving the complete voting information needed for Byzantine fault tolerance.
Solution Approach 2:
Peer leaders perform preliminary vote aggregation in the proposal and pre-vote phases before the final commit phase. This preliminary action consolidates individual votes into aggregated forms that can be efficiently broadcast and processed, reducing the overall message complexity while maintaining the reliability guarantees of the complete voting process.
3Reliability
If conventional asynchronous BFT protocols are used to ensure consensus in distributed networks, then reliability is maintained, but round complexity increases, slowing down the speed of consensus generation
Solution Approach 1:
The protocol structures consensus around periodic phases (proposal, pre-vote, vote, commit) that repeat for each batch of transactions. This periodic structure allows the system to maintain reliability through complete voting rounds while improving speed by processing multiple transactions in batches and using the established phase rhythm to efficiently move through consensus steps.
Solution Approach 2:
The protocol maintains continuity by having peer leaders continuously manage the consensus process across phases without requiring full network re-coordination. Once leaders are elected, they continuously aggregate votes and progress through phases, maintaining useful action throughout the consensus process and reducing idle time between rounds, thereby improving consensus generation speed while preserving reliability.
Data Source
AI summary
Described in detail herein is a system for determining the validity of a transaction in a distributed network environment. The system includes a plurality of peer servers. The system elects a set of peer leaders from the plurality of peer servers. The set of peer leaders broadcast a first set of indices associated with a first subset of transactions, received from the plurality of peer servers, to one or more of the plurality of peer servers. The set of elected peer leaders execute a first instance of a binary agreement protocol based at least in part on a second subset of indices associated with a second subset of the transactions. The set of elected peer leaders output a consensus vector comprising one or more of the transactions.