US 11,734,260 B2
Methods and apparatus for a distributed database within a network
Leemon C. Baird, III, Richardson, TX (US)
Assigned to Hedera Hashgraph, LLC, Las Vegas, NV (US)
Filed by Hedera Hashgraph, LLC, Las Vegas, NV (US)
Filed on Jun. 22, 2020, as Appl. No. 16/907,616.
Application 16/907,616 is a continuation of application No. 15/906,668, filed on Feb. 27, 2018, granted, now 10,747,753, issued on Aug. 18, 2020.
Application 15/906,668 is a continuation of application No. PCT/US2016/049067, filed on Aug. 26, 2016.
Claims priority of provisional application 62/344,682, filed on Jun. 2, 2016.
Claims priority of provisional application 62/211,411, filed on Aug. 28, 2015.
Prior Publication US 2020/0320064 A1, Oct. 8, 2020
Int. Cl. G06F 16/23 (2019.01); G06F 16/28 (2019.01); G06F 16/901 (2019.01); G06F 16/182 (2019.01); G06F 11/07 (2006.01)
CPC G06F 16/2379 (2019.01) [G06F 11/0709 (2013.01); G06F 16/1837 (2019.01); G06F 16/28 (2019.01); G06F 16/9014 (2019.01); G06F 16/9024 (2019.01)] 23 Claims
OG exemplary drawing
 
1. An apparatus, comprising:
a memory storing an instance of a distributed directed acyclic graph (DAG) at a first compute device configured to be included within a plurality of compute devices that implements the distributed DAG via a network operatively coupled to the plurality of compute devices, each compute device from the plurality of compute devices being associated with a stake value indicative of an influence that compute device has on the distributed DAG; and
a processor of the first compute device operatively coupled to the memory, the processor configured to:
receive a first event from an instance of the distributed DAG at a second compute device from the plurality of compute devices,
define a second event based on the first event, the second event being linked to a set of events, each event from the set of events being defined by a different compute device from a first set of compute devices from the plurality of compute devices,
define an order value for a third event using a consensus protocol based on a collective stake value associated with the first set of compute devices meeting a first stake value criterion, the collective stake value associated with the first set of compute devices being a sum of stake values associated with each compute device from the first set of compute devices,
update a state value associated with the distributed DAG based on the order value,
receive an indication that a second set of compute devices from the plurality of compute devices has agreed to the state value, and
delete, from the instance of the distributed DAG at the first compute device, events used to calculate the state value when a collective stake value associated with the second set of compute devices meets a second stake value criterion.