Adaptive Consensus Node Selection in Distributed Ledger Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional distributed ledger networks face issues with fairness and resource wastage in leader node selection due to biased consensus mechanisms, leading to centralization and inefficiencies, which compromise the decentralized nature and security of the network.
Innovation Solution
A method and system for adaptive consensus in a distributed ledger network, where a selector node randomly selects a set of consensus nodes based on predefined and sensitivity parameters to create unverified blocks, compute hash values, and validate transactions, ensuring fair and efficient leader node selection while minimizing resource wastage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional consensus algorithms are used for leader node selection, then security and correctness are maintained, but fairness deteriorates and resource wastage increases
Solution Approach 1:
The patent changes the selection parameter from cryptographic puzzle-solving time to a combination of stake weight and random selection. This parameter change eliminates the need for energy-intensive puzzle solving while maintaining security through stake-based validation and randomness, directly resolving the contradiction between security and resource wastage
Solution Approach 2:
The patent replaces the mechanical cryptographic puzzle-solving process with a stake-based probabilistic selection mechanism. Instead of nodes competing through computational mechanics, the system uses economic stake weights combined with random selection, substituting the energy-intensive mechanical process with a more efficient selection method that maintains security
2Productivity
If nodes with high computing power are selected as leaders, then transaction validation speed improves, but decentralization deteriorates and centralization occurs
Solution Approach 1:
The patent changes the leader selection parameter from computing power to stake-weighted random selection. This ensures that nodes with high computing power do not gain unfair advantages, maintaining decentralization while still enabling efficient transaction validation through the selected leader
Solution Approach 2:
The patent creates equipotential conditions for all nodes by using stake-based selection rather than computing power. All nodes operate on equal footing with selection based on economic stake and randomness, preventing centralization while maintaining validation efficiency through the selected leader
3Speed
If cryptographic puzzles are solved within pre-defined time periods, then block creation speed improves, but fairness deteriorates due to unequal node capabilities
Solution Approach 1:
The patent changes the selection mechanism from time-bound cryptographic puzzle solving to stake-based probabilistic selection. This eliminates the unfair advantage that nodes with superior computing power would have in time-bound puzzles, ensuring fairness while maintaining block creation speed through efficient leader selection
Solution Approach 2:
The patent introduces stake weight as an intermediary parameter that mediates between node capability and selection probability. Instead of direct competition through puzzles, the stake weight serves as a fair intermediary that accounts for node contribution without favoring computing power, ensuring equitable selection while maintaining speed
4Reliability
If all nodes validate and update each transaction, then correctness is ensured, but resource efficiency deteriorates
Solution Approach 1:
The patent segments the validation process by designating specific leader nodes to create and manage blocks, while other nodes validate through stake-based consensus. This segmentation reduces redundant computation across all nodes while maintaining correctness through the distributed validation of the selected leader's work
Solution Approach 2:
The patent applies partial action by having only the selected leader node perform full transaction validation and block creation, while other nodes perform lighter validation checks. This partial participation approach maintains correctness through distributed verification while significantly reducing overall resource consumption compared to full validation by all nodes
Data Source
AI summary
A method and system for performing adaptive consensus in a distributed ledger network are disclosed. The method includes identifying a selector node from plurality of nodes within distributed ledger network, based on random selection algorithm. The method includes adaptively selecting set of consensus nodes from plurality of nodes based on set of predefined node parameters and plurality of sensitivity parameters to create an unverified block in a ledger of each of adaptively selected set of consensus nodes. The method includes computing hash value for each of at least one new transaction in distributed ledger network. The method includes performing consensus based on computed hash value for identifying set of valid transactions in unverified blocks created by each of adaptively selected set of consensus nodes. The method includes creating verified block including set of valid transactions, and commits verified block to distributed ledger in distributed ledger network.