Granted Patent B2

US 12,487,990 · App. 18/330,581 · Granted Dec 2, 2025

Inventor: Leemon C. Baird, III (Richardson, TX)

Assignee: Hedera Hashgraph, LLC

G06F16/2379G06F11/0709G06F16/1837G06F16/28G06F16/9014G06F16/9024

Abstract

Claims (53)

1 . A non-transitory processor-readable medium storing code representing instructions to be executed by a processor, the code comprising code to cause the processor to:

receive, at a first compute device from a plurality of compute devices that implements a distributed database and based on a synchronization process with a second compute device from the plurality of compute devices, an event;

update, based on the event, a directed acyclic graph (DAG) at the first compute device and including a representation of a plurality of events;

identify, based on the DAG at the first compute device, a set of events not yet received by the second compute device;

send the set of events to the second compute device as part of the synchronization process such that the second compute device (1) updates a DAG at the second compute device based on the set of events and (2) computes a state of an instance of the distributed database associated with the second compute device based on a consensus protocol and the DAG at the second compute device;

receive, from the second compute device, the state of the instance of the distributed database associated with the second compute device;

compute a state of an instance of the distributed database associated with the first compute device based on the consensus protocol and the DAG at the first compute device;

receive an indication that a set of compute devices from the plurality of compute devices has agreed to the state of the instance of the distributed database associated with the first compute device; and

delete, from the instance of the distributed database associated with the first compute device, events used to calculate the state based on the indication.

2 . The non-transitory processor-readable medium of claim 1 , further comprising code to cause the processor to:

digitally sign the state of the instance of the distributed database associated with the second compute device when the state of the instance of the distributed database associated with the second compute device corresponds with the state of the instance of the distributed database associated with the first compute device.

3 . The non-transitory processor-readable medium of claim 1 , further comprising code to cause the processor to:

store in a memory the state of the instance of the distributed database associated with the second compute device.

4 . The non-transitory processor-readable medium of claim 1 , wherein the event is a first event, the code further comprising code to cause the processor to:

define a second event including the state of the instance of the distributed database associated with the first compute device to notify compute devices from the plurality of compute devices of the state of the instance of the distributed database associated with the first compute device.

5 . The non-transitory processor-readable medium of claim 1 , wherein the event is a first event, the code further comprising code to cause the processor to:

define a second event including the state of the instance of the distributed database associated with the first compute device to notify compute devices from the plurality of compute devices of the state of the instance of the distributed database associated with the first compute device;

digitally signing the state of the instance of the distributed database associated with the first compute device; and

confirm the state of the instance of the distributed database associated with the first compute device based on a threshold number of compute devices from the plurality of compute devices digitally signing the state of the instance of the distributed database associated with the first compute device.

6 . The non-transitory processor-readable medium of claim 1 , wherein the DAG encodes a partial order of the plurality of events.

7 . The non-transitory processor-readable medium of claim 1 , wherein the event includes a cryptographic hash of at least two events from the plurality of events.

8 . A method, comprising:

receiving an event defined by a compute device from a plurality of compute devices implementing a distributed database;

updating, based on the event and at a first time, a directed acyclic graph (DAG) including a representation of a plurality of events to define a partial order of the event with respect to a set of events from the plurality of events based on a position of the event in the DAG;

identifying, at a second time after the first time, a consensus order of the event with respect to the plurality of events based on the partial order and a consensus protocol;

calculating a state value associated with the distributed database based on the consensus order;

receiving an indication that a set of compute devices from the plurality of compute devices has agreed to the state value; and

deleting, from an instance of the distributed database, events used to calculate the state value based on the indication.

9 . The method of claim 8 , further comprising:

storing in a memory the consensus order of the event with respect to the plurality of events.

10 . The method of claim 8 , wherein the event is a first event, the method further comprising:

defining a second event including the state value to notify compute devices from the plurality of compute devices of the state value.

11 . The method of claim 8 , wherein the event is a first event, the method further comprising:

defining a second event including the state value to notify compute devices from the plurality of compute devices of the state value;

digitally signing the state value; and

confirming the state value based on the indication, the indication indicating that a threshold number of compute devices from the plurality of compute devices has digitally signed the state value.

12 . The method of claim 11 , wherein the threshold number of compute devices is based on an amount of stake associated with the plurality of compute devices.

13 . The method of claim 8 , wherein the event includes a cryptographic hash of at least two events from the plurality of events.

14 . The method of claim 8 , wherein the consensus order determines an order of a set of transactions in the event with respect to a set of transactions in each event from the plurality of events.

15 . An apparatus, comprising:

a memory; and

a processor operatively coupled to the memory, the processor configured to define, based on a plurality of events received from a plurality of compute devices implementing a distributed database, a directed acyclic graph (DAG) defining a partial order of the plurality of events,

the processor configured to calculate, based on the DAG and a consensus protocol, a consensus order of the plurality of events,

the processor configured to calculate a state value associated with the distributed database based on the consensus order of the plurality of events,

the processor configured to define an event including the state value to notify compute devices from the plurality of compute devices of the consensus order,

the processor configured to digitally sign the state value,

the processor configured to confirm the state value based on a threshold number of compute devices from the plurality of compute devices digitally signing the state value,

the processor configured to delete events used to calculate the state value based on the threshold number of compute devices from the plurality of compute devices digitally signing the state value.

16 . The apparatus of claim 15 , wherein the processor is configured to store in the memory the consensus order of the plurality of events.

17 . The apparatus of claim 15 , wherein each event from the plurality of events incudes a reference to at least one other event from the plurality of events.

18 . The apparatus of claim 15 , wherein each event from the plurality of events incudes a cryptographic hash of at least two other events from the plurality of events.

19 . The apparatus of claim 15 , wherein the consensus order of the plurality of events determines an order of a set of transactions in a first event from the plurality of events with respect to a set of transactions in a second event from the plurality of events.

20 . The apparatus of claim 15 , wherein the threshold number of compute devices is based on an amount of stake associated with the plurality of compute devices.

Assignments (2)

Continuity (6)

References Cited (351)