Leaderless Distributed Database Using HashDAG Consensus

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing distributed database systems face challenges in achieving consensus without a leader, with methods like Paxos being reliant on a trusted central server and blockchain systems being 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 an order based on a protocol and store it within the database.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a leader-based consensus method like Paxos is used, then consensus can be achieved, but the system requires a trusted central server which reduces security and creates a single point of failure

Engineering Contradiction:
Improveconsensus achievementVSAvoidsingle point of failure
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent extracts the leader role from the consensus mechanism by implementing a leaderless distributed database where all compute devices participate equally in event validation and ordering through a hashDAG structure, eliminating the single point of failure while maintaining consensus reliability

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The system segments the consensus function across multiple compute devices rather than concentrating it in a single leader, with each device independently validating events and contributing to the distributed consensus through cryptographic hashing and graph-based event linking

Inventive Principle:
Principle #1Segmentation

2Object-affected harmful factors

If a blockchain data structure is used for leaderless consensus, then no single point of failure exists, but the system is limited to a small number of transactions per second which reduces productivity

Engineering Contradiction:
Improvesingle point of failureVSAvoidtransactions per second
Core Design Contradiction:
Object-affected harmful factorsVSProductivity

Solution Approach 1:

The patent implements dynamic event linking in the hashDAG where compute devices can efficiently process and link events based on current system state, allowing the system to adaptively handle varying transaction loads without the rigid block structure limitations of traditional blockchain

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system transitions from the linear, sequential block structure of traditional blockchain to a multi-dimensional hashDAG structure where events can be linked in parallel through multiple parent references, enabling concurrent transaction processing and significantly increasing throughput while maintaining decentralization

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

3Reliability

If extensive data exchange occurs between compute devices to achieve consensus, then agreement can be reached, but the convergence speed decreases and system efficiency is reduced

Engineering Contradiction:
Improveconsensus agreementVSAvoidconvergence speed
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

Compute devices perform preliminary local validation of events against the hashDAG structure before broadcasting, filtering out invalid events early and reducing the amount of data that needs to be exchanged and revalidated across the network, thereby accelerating consensus convergence

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system uses cryptographic hashes of events as compact representations that can be rapidly exchanged and verified between compute devices, replacing the need to transmit and process entire event datasets, thus significantly reducing communication overhead and improving convergence speed

Inventive Principle:
Principle #26Copying

Data Source

PatentUS9646029B1Methods and apparatus for a distributed database within a network
Publication Date: 2017.05.09 HEDERA HASHGRAPH LLC
  • US9646029B1 patent drawing
  • US9646029B1 patent drawing
  • US9646029B1 patent drawing

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.