Granted Patent B2

US 12,443,622 · App. 18/318,787 · Granted Oct 14, 2025

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

Assignee: Hedera Hashgraph, LLC

G06F16/27G06F16/2237G06F16/2358

Abstract

Claims (57)

1. A method, comprising:

defining, at a first compute device from a plurality of compute devices that implements a distributed database via a network, an address book for the distributed database, the address book including an identifier for each compute device from the plurality of compute devices that implements the distributed database via the network;

receiving, at the first compute device and from a second compute device from the plurality of compute devices, a first event including a first transaction to update the address book;

calculating, at the first compute device and based on a consensus protocol of the distributed database that uses the address book, a received round for the first event, the received round for the first event not being a predetermined received round;

receiving at the first compute device and from a third compute device from the plurality of compute devices, a second event including a second transaction to update the address book;

updating, at the first compute device, a directed acyclic graph (DAG) that represents the distributed database to include a representation of the second event;

calculating, at the first compute device and based on the consensus protocol and the DAG, a received round for the second event, the received round for the second event being greater than the received round for the first event, the received round for the second event being a predetermined received round;

updating, at the first compute device, the address book to define an updated address book, based on (1) the first transaction, (2) the second transaction, and (3) the received round for the second event being a predetermined received round;

calculating, at the first compute device and using the updated address book with the consensus protocol, a received round for each event from a first plurality of events within a set of rounds from a predetermined number of rounds after the received round for the second event;

identifying, at the first compute device and using the consensus protocol, a set of famous witness events for each round of the consensus protocol, the set of famous witness events for each round being used by the consensus protocol to determine a received round for each event from a second plurality of events;

calculating an attribute for at least one first event from the second plurality of events using the address book; and

excluding an attribute for at least one second event from the second plurality of events from being calculated using the updated address book, the at least one second event from the second plurality of events being an ancestor of at least one famous witness event from the set of famous witness events for a round in which the updated address book is defined.

2. The method of claim 1 , further comprising:

defining a state of the distributed database based on the received round for each event from the first plurality of events; and

sending the state to at least one compute device from the plurality of compute devices that implements the distributed database.

3. The method of claim 1 , wherein the first transaction to update the address book includes at least one of adding a compute device to the plurality of compute devices that implements the distributed database or removing a compute device from the plurality of compute devices that implements the distributed database.

4. The method of claim 1 , wherein the address book includes a stake value for each compute device from the plurality of compute devices that implements the distributed database,

the first transaction to update the address book includes modifying the stake value for at least one compute device from the plurality of compute devices.

5. The method of claim 1 , wherein a received round for each event from a third plurality of events associated with the distributed database is based on a set of descendant events for that event, the set of descendant events being calculated using the address book prior to the updating the address book, the set of descendant events being recalculated using the updated address book after the updating the address book.

6. The method of claim 1 , wherein the attribute is recalculated for each event from the second plurality of events using the updated address book when that event is not an ancestor of at least one event from the set of famous witness events for a round in which the updated address book is defined.

7. The method of claim 1 , wherein the updated address book includes updates to the address book within events having a received round number between a round in which a previous update to the address book occurred and the received round for the second event.

8. The method of claim 1 , wherein the updating the address book occurs a predetermined number of rounds after the received round for the second event.

9. The method of claim 1 , wherein the identifier for each compute device from the plurality of compute devices is a public key for that compute device from the plurality of compute devices.

10. An apparatus, comprising:

a memory of a compute device associated with a distributed database implemented by a plurality of compute devices via a network operatively coupled to the plurality of compute devices; and

a processor operatively coupled to the memory, the processor configured to:

define an address book for the distributed database, the address book including an identifier for each compute device from the plurality of compute devices that implements the distributed database;

receive, from a compute device from the plurality of compute devices, a first event including a transaction to update the address book;

update a directed acyclic graph (DAG) that represents the distributed database to include a representation of the first event;

calculate a round created for each event from a first plurality of events, the first event included in the first plurality of events;

calculate, based on (1) the DAG, (2) a consensus protocol of the distributed database that uses the address book, and (3) the round created for each event from the first plurality of events, a received round for the first event, the received round for the first event being based on a threshold number of events from a second plurality of events being descendants of the first event;

update the address book (1) based on the transaction to define an updated address book and (2) a predetermined number of rounds after the received round for the first event;

recalculate, using the updated address book, the round created for each event from a first set of events from the first plurality of events to define a recalculated round created for that event from the first set of events, (1) each event from the first set of events not having a descendent event from the second plurality of events, (2) the round created for each event from a second set of events from the first plurality of events not being recalculated using the updated address book, and (3) each event from the second set of events having a descendent event from the second plurality of events; and

calculate, using the updated address book with the consensus protocol and based on the round created for each event from the second set of events and the recalculated round created for each event from the first set of events, a received round for a second event.

11. The apparatus of claim 10 , wherein the predetermined number of rounds after the received round for the first event is greater than one.

12. The apparatus of claim 10 , wherein the updated address book includes updates to the address book within events having the received round for the first event.

13. The apparatus of claim 10 , wherein the transaction to update the address book includes at least one of adding a compute device to the plurality of compute devices that implements the distributed database or removing a compute device from the plurality of compute devices that implements the distributed database.

14. The apparatus of claim 10 , wherein the processor is configured to not recalculate, using the updated address book, the round created for each event from the first plurality of events when that event has a descendent event from the second plurality of events.

15. 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:

define an address book for a distributed database, the address book including a public key for each compute device from a plurality of compute devices that implements the distributed database;

receive a set of events, each event from the set of events including a transaction to update the address book;

update a directed acyclic graph (DAG) that represents the distributed database to include a representation of the set of events;

calculate a round created for each event from the set of events;

calculate, based on (1) the DAG, (2) a consensus protocol of the distributed database that uses the address book, and (3) the round created for each event from the set of events, a received round for each event from the set of events;

update, during a first round of the consensus protocol and based on the transaction in each event from a first subset of events from the set of events, the address book to define a first updated address book, the received round for each event from the first subset of events being within a first range;

calculate, using (1) the first updated address book with the consensus protocol and (2) the DAG, a received round for each event from a first plurality of events within a set of rounds from a predetermined number of rounds after the first range;

update, during a second round of the consensus protocol and based on the transaction in each event from a second subset of events from the set of events, the first updated address book to define a second updated address book, the received round for each event from the second subset of events being within a second range different than the first range;

calculate, using the second updated address book with the consensus protocol, a received round for each event from a second plurality of events within a set of rounds from a predetermined number of rounds after the second range; and

define a state of the distributed database based on the received round for each event from the first plurality of events and the received round for each event from the second plurality of events.

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

send the state to at least one compute device from the plurality of compute devices that implements the distributed database.

17. The non-transitory processor-readable medium of claim 15 , wherein the transaction to update the address book included in each event from the set of events includes at least one of adding a compute device to the plurality of compute devices that implements the distributed database or removing a compute device from the plurality of compute devices that implements the distributed database.

18. The non-transitory processor-readable medium of claim 15 , wherein the address book includes a stake value for each compute device from the plurality of compute devices that implements the distributed database, the transaction to update the address book included within at least one event from the set of events includes modifying the stake value for at least one compute device from the plurality of compute devices.

19. The non-transitory processor-readable medium of claim 15 , wherein the received round for each event from the first plurality of events and the received round for each event from the second plurality of events are based on a set of descendant events,

a round created for each event from the set of descendant events being calculated using the first updated address book for the predetermined number of rounds after the first range, the round created for each event from the set of descendant events being recalculated using the second updated address book for the predetermined number of rounds after the second range.

20. The non-transitory processor-readable medium of claim 15 , wherein the DAG is a first DAG, the non-transitory processor-readable medium further comprising code to cause the processor to:

send the state of the distributed database to a compute device from the plurality of compute devices, the state (1) being associated with a completed round of the consensus protocol, (2) including an indication of a core set of events that (a) is associated with the completed round and (b) includes fewer events than the set of events, and (3) being used to generate a second DAG at the compute device.

Assignments (2)

Continuity (3)

References Cited (292)