Metastable Byzantine Agreement via Repeated Polling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Byzantine Fault Tolerant (BFT) protocols, such as Nakamoto consensus protocols used in cryptocurrencies, are inefficient due to their reliance on proof-of-work and incur high quadratic message complexity, leading to scalability issues and high energy consumption, especially when no decisions are being made.
Innovation Solution
The implementation of metastable consensus protocols that use a leaderless mechanism with repeated network polling and a directed acyclic graph (DAG) to achieve consensus, reducing message complexity and energy consumption by being quiescent when no decisions are made, and allowing for higher throughput and lower latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Nakamoto consensus protocols use proof-of-work to achieve consensus, then consensus is achieved, but energy consumption increases and efficiency decreases
Solution Approach 1:
The patent extracts the proof-of-work mechanism from the consensus protocol, separating the consensus achievement function from the energy-intensive proof-of-work verification. This allows consensus to be reached through direct voting and message passing without the computational overhead of proof-of-work, thereby maintaining reliability while dramatically reducing energy consumption.
Solution Approach 2:
The patent replaces the mechanical proof-of-work system (computational puzzles requiring significant processing power) with a social consensus mechanism based on voting and message passing. This substitution eliminates the need for energy-intensive computational work while achieving the same consensus goal through cooperative agreement among nodes.
2Reliability
If conventional BFT protocols use all-to-all broadcast mechanism facilitated by a leader, then consensus can be reached, but message complexity becomes quadratic and scalability is limited
Solution Approach 1:
The patent segments the all-to-all broadcast communication into targeted message passing between specific nodes. Instead of every node broadcasting to every other node (O(n²) complexity), nodes only communicate with relevant subsets of the network, reducing message complexity to linear O(n) while maintaining consensus reachability through sufficient information propagation.
Solution Approach 2:
The patent transitions from a two-dimensional all-to-all communication matrix to a more efficient communication topology where messages propagate through the network in a structured manner. By organizing communication along different dimensions (e.g., through sampling, through leaderless coordination), the system achieves consensus without requiring quadratic message exchange.
3Reliability
If conventional protocols require many rounds of all-to-all communication to reach consensus, then consensus is achieved, but latency increases and throughput decreases
Solution Approach 1:
The patent performs preliminary actions by having nodes prepare and cache voting information, transaction data, and consensus state before formal consensus rounds begin. This pre-computation and pre-positioning of data allows nodes to participate in consensus more efficiently, reducing the number of communication rounds needed and thereby decreasing latency while maintaining consensus reliability.
Solution Approach 2:
The patent maintains continuous useful action by having nodes continuously update their local state, validate transactions, and prepare voting information even during periods between consensus rounds. This continuous processing ensures that when consensus is needed, nodes can participate immediately without idle waiting time, reducing overall latency and increasing throughput.
Data Source
AI summary
An apparatus comprises a first processing node configured to participate in a consensus protocol with a plurality of additional processing nodes. The first processing node is further configured in conjunction with its participation in the consensus protocol to implement repeated polling of respective selected subsets of the additional processing nodes, to resolve a state for a given transaction to a particular one of a plurality of possible states for the given transaction responsive to results of the repeated polling; and to initiate at least one automated action based at least in part on the resolved state for the given transaction. In some embodiments, the first processing node utilizes the results of the repeated polling to maintain a directed acyclic graph or other data structure of transactions that characterizes relationships between the given transaction and a plurality of other transactions.