Client-Directed Distributed Network Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed systems face challenges in ensuring liveness and safety, particularly in the presence of byzantine faults, where networks struggle to maintain consistency and availability while being resilient to adversarial behavior and faults, leading to inefficiencies and vulnerabilities in leader-based and leaderless consensus protocols.
Innovation Solution
A client-directed distributed network system where clients communicate state transition requests to nodes, which evaluate and validate requests, and upon consensus from a sufficient majority, advance the state, using cryptographic signatures and a state machine to ensure safety and liveness, with state transitions charged against a token account and recorded in a cryptographically linked hash chain or merkle structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If leader-based consensus protocols are used to maintain consistency and availability, then safety is improved, but the system becomes vulnerable to adversarial behavior and faults in the leader node
Solution Approach 1:
The patent extracts the leader role from the consensus process entirely. Instead of having a single leader node coordinate state transitions, any client can initiate transitions by collecting signatures from a quorum of nodes. This eliminates the single point of failure and adversarial vulnerability associated with leader-based protocols while maintaining safety through cryptographic verification of node consensus.
Solution Approach 2:
The patent inverts the traditional consensus model where the leader proposes and followers accept. Instead, any client can propose state transitions, and the system requires active signature collection from a quorum of nodes to validate and commit the transition. This inversion distributes power from a central leader to multiple independent nodes, reducing vulnerability to adversarial behavior.
2Reliability
If Byzantine fault tolerant consensus schemes are implemented to resist adversarial behavior, then reliability is improved, but network load and communication overhead increase
Solution Approach 1:
The patent segments the consensus process into independent state transition requests, each handled separately by collecting signatures from a quorum of nodes. Instead of requiring all nodes to participate in every consensus round (which creates O(n²) communication overhead), each state transition is processed independently with linear communication complexity O(n), significantly reducing network load while maintaining Byzantine fault tolerance.
Solution Approach 2:
The patent requires signatures from a quorum of nodes (more than half) rather than requiring all nodes to sign each state transition. This partial action approach provides sufficient Byzantine fault tolerance without the excessive communication overhead of requiring universal participation, reducing network load while maintaining security guarantees.
3Reliability
If state transitions require consensus from a sufficient majority of nodes, then safety is improved, but the time to complete state transitions increases
Solution Approach 1:
The patent implements preliminary action by having nodes maintain a cache of pre-validated state transition requests and their associated signatures. When a client wants to transition state, the system can quickly retrieve and verify pre-collected signatures from the cache rather than requiring real-time signature collection, significantly reducing state transition completion time while maintaining the safety guarantee of requiring quorum consensus.
4Reliability
If cryptographic verification and signature collection are implemented for each state transition, then security and consistency are improved, but the complexity of the system increases
Solution Approach 1:
The patent implements a universal signature verification mechanism that serves multiple functions: validating state transition requests, ensuring node consensus, preventing replay attacks, and maintaining audit trails. This single cryptographic primitive handles multiple security and consistency requirements, improving reliability without proportionally increasing system complexity compared to implementing separate mechanisms for each function.
Data Source
AI summary
There is provided a distributed network and method for organizing operation of a distributed network, and a node and client for the distributed network. The method including: directing each client to communicate a request for state transition to the nodes; directing the nodes to evaluate the validity of each request received from each client; directing each node to change a state associated with the clients that sent the validated request to a pre-commitment state, and communicate to the client a signed acknowledgement that the request has been validated; directing the clients that received signed acknowledgments to collate all the signed acknowledgments received from the nodes; where the client has collated signed acknowledgments from at least a predetermined number of nodes, directing the client to communicate the collated acknowledgements to the nodes; and directing each node to advance the state associated with each client that communicated collated acknowledgements.