Distributed Database Consensus Using HashDAG
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed database systems face challenges in achieving consensus without a leader, as methods like Paxos require a trusted central server, while leaderless systems like blockchain are inefficient for large-scale applications.
Innovation Solution
A distributed database system that uses a hashDAG (Directed Acyclic Graph) to establish consensus among compute devices without a leader, where events are linked through cryptographic hashes, allowing each device to calculate and converge on an order of events, thereby eliminating the need for a central authority and improving efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a leader-based consensus method like Paxos is used, then consensus can be achieved reliably, but the system requires a trusted central server which creates a single point of failure and reduces decentralization
Solution Approach 1:
The patent extracts the leader role from the consensus mechanism by using a leaderless architecture where any compute device can propose events. The system removes the central authority component while maintaining consensus through cryptographic proof and verification mechanisms that don't require trust in a specific node.
Solution Approach 2:
Each compute device independently verifies event ordering and consensus validity through cryptographic checks against the hashDAG structure. The system is self-organizing where nodes autonomously reach consensus without requiring coordination with or trust in a designated leader node.
2Reliability
If a leaderless distributed database like blockchain is used, then no single point of failure exists, but the system is inefficient with limited transactions per second
Solution Approach 1:
The patent segments the event verification process by allowing parallel validation of multiple events across the distributed network. The hashDAG structure enables independent verification of event chains, allowing the system to process multiple transactions simultaneously rather than sequentially, thereby increasing throughput while maintaining decentralization.
Solution Approach 2:
Events are pre-validated and linked to the hashDAG structure before being fully processed by the network. The cryptographic linking and event ordering are established in advance through the DAG structure, reducing the computational overhead required during consensus finalization and enabling faster transaction processing.
3Reliability
If traditional distributed consensus methods are used, then agreement on event ordering can be achieved, but network traffic and convergence time increase
Solution Approach 1:
The patent replaces the mechanical iterative voting and message-passing processes of traditional consensus algorithms with a cryptographic hashDAG structure. Event ordering is determined through cryptographic proof rather than repeated communication rounds, dramatically reducing convergence time while maintaining consensus reliability.
Solution Approach 2:
The hashDAG structure creates cryptographic copies of event data that can be independently verified by all nodes. Instead of requiring nodes to exchange and compare multiple versions of event ordering information, the system uses immutable cryptographic copies that provide immediate verification, reducing network traffic and acceleration consensus.
Data Source
AI summary
In some embodiments, an apparatus includes an instance of a distributed database at a first compute device configured to be included within a set of compute devices that implement the distributed database. The apparatus also includes a processor configured to define a first event linked to a first set of events. The processor is configured to receive, from a second compute device from the set of compute devices, a signal representing a second event (1) defined by the second compute device and (2) linked to a second set of events. The processor is configured to identify an order associated with a third set of events based at least one a result of a protocol. The processor is configured to store in the instance of the distributed database the order associated with the third set of events.