Leaderless Distributed Database Using Hashgraph Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed database systems require a leader or a trusted third party to achieve consensus, which compromises security and anonymity of transactions.
Innovation Solution
A distributed database system that operates without a leader, using a hashgraph consensus method to achieve consensus and maintain anonymity of transactions by encrypting public keys and digitally signing transfer commands.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a leader or trusted third party is used to achieve consensus in a distributed database system, then consensus can be achieved, but security and anonymity of transactions are compromised
Solution Approach 1:
The patent extracts and removes the leader or trusted third party from the distributed database system. By eliminating this central authority, the system achieves consensus through peer-to-peer verification where all nodes participate equally in validating transactions, thereby maintaining security and anonymity without requiring a central point of control.
Solution Approach 2:
The distributed database system performs self-verification through its own nodes. Each node independently validates transactions and reaches consensus with other nodes through cryptographic proofs, eliminating the need for external trusted authorities. The system serves its own consensus needs through decentralized verification mechanisms.
2Reliability
If a leader is designated to decide event ordering in a distributed database, then consensus can be achieved, but a single point of failure is created
Solution Approach 1:
The patent segments the consensus decision-making power across multiple independent nodes rather than concentrating it in a single leader. Each node maintains its own copy of the distributed database and independently validates events, distributing the critical functions across the network to eliminate single points of failure.
Solution Approach 2:
The leader role is completely removed from the system. Instead of designating one node to decide event ordering, the system uses a leaderless consensus mechanism where all nodes participate equally in verifying and agreeing on event sequences through cryptographic validation and peer-to-peer communication.
3Reliability
If public transactions are used in a leaderless distributed database, then anonymity is lost, but consensus can be achieved without a leader
Solution Approach 1:
The patent applies different properties to different parts of the transaction data structure. Public information such as event sequences and consensus validation data are made visible to all nodes, while sensitive information including transaction origins and participant identities remain encrypted and private. This selective transparency allows leaderless operation while preserving anonymity.
Solution Approach 2:
Cryptographic primitives serve as intermediaries between public verification requirements and private anonymity needs. Digital signatures and encrypted data structures allow nodes to verify transaction validity and reach consensus without exposing the actual transaction details or participant identities, acting as a mediator that satisfies both public verification and private confidentiality requirements.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method comprises: receiving, at a first compute device configured to be included within a plurality of compute devices that implements a distributed database and from a second compute device, (1) a first public key associated with the second compute device and logically related to a first source record and (2) a second public key associated with the second compute device and logically related to a first destination record, the distributed database including a second source record logically related to a first public key associated with the first compute device and a second destination record logically related to a second public key associated with the first compute device; defining a transfer command by executing a deterministic sort between the second public key associated with the first compute device and the second public key associated with the second compute device; and sending a signal to post into the distributed database the transfer command configured to transfer a value from (1) the first source record to one of the first destination record or the second destination record based on the deterministic sort and (2) the second source record to the other of the first destination record or the second destination record based on the deterministic sort.