Application US20200145387 Cryptocurrency: Networks and Computing

Search All Applications in Cryptocurrency: Networks and Computing

Hedera Hashgraph, Llc

Application US20200145387

Published 2020-05-07

Methods And Apparatus For Efficiently Implementing A Distributed Database Within A Network

An apparatus includes a processor and a memory operatively coupled to the processor and associated with an instance of a distributed database at a first compute device. The processor is configured to select an anonymous communication path. Each blinded public key from a sequence of blinded public keys associated with the anonymous communication path is associated with a pseudonym of a compute device from a set of compute devices that implement the anonymous communication path. The processor is configured to generate an encrypted message encrypted with a first blinded public key. The processor is configured to generate an encrypted data packet including the encrypted message and a compute device identifier associated with a second compute device. The encrypted data packet is encrypted with a second blinded public key. The processor is configured to send the encrypted data packet to a third compute device.

Much More than Average Length Specification

View the Patent Matrix® Diagram to Explore the Claim Relationships

USPTO Full Text Publication >

3 Independent Claims

1. An apparatus, comprising: a memory associated with an instance of a distributed database at a first compute device configured to be included within a plurality of compute devices that implement the distributed database via a network operatively coupled to the plurality of compute devices; and a processor operatively coupled to the memory, and configured to: define a first group of compute devices from the plurality of compute devices and a second group of compute devices from the plurality of compute devices, based on a deterministic pseudorandom function; receive, from a second compute device from the plurality of compute devices, an event linked to a first set of events defined by a set of compute devices from the plurality of compute devices, the set of compute devices including at least one compute device from the first group of compute devices and at least one compute device from the second group of compute devices; identify an order associated with a second set of events, as a result of a consensus protocol (1) using a value for a parameter of an event from the first set of events that was defined by a compute device from the first group of compute devices, and (2) not using a value for the parameter of an event from the first set of events that was defined by a compute device from the second group of compute devices; identify an order associated with a plurality of transactions indicated in the instance of the distributed database based at least in part on the order associated with the second set of events; and store in the instance of the distributed database the order associated with the plurality of transactions.
8. 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: designate, at a compute device from a plurality of compute devices that implements a distributed database, a first group of compute devices from the plurality of compute devices as lazy compute devices, a second group of compute devices from the plurality of compute devices being non-lazy compute devices, the second group of compute devices being an absolute complement of the first group of compute devices with respect to the plurality of compute devices; receive, from a set of compute devices from the plurality of compute devices, a first set of events, each event from the first set of events defined by a compute device from the plurality of compute devices; identify an order associated with a second set of events as a result of a consensus protocol (1) using a parameter of a first event from the first set of events based on the first event being defined by a compute device from the second group of compute devices, and (2) not using the parameter of a second event from the first set of events based on the second event being defined by a compute device from the first group of compute devices; and store the order associated with the second set of events.
17. A method, comprising: identifying, at a compute device from a plurality of compute devices that implements a distributed database, a first group of compute devices from the plurality of compute devices and a second group of compute devices from the plurality of compute devices, the second group of compute devices being an absolute complement of the first group of compute devices with respect to the plurality of compute devices; receiving, from a set of compute devices from the plurality of compute devices, a first set of events, each event from the first set of events defined by a compute device from the plurality of compute devices; identifying, using a first process, a round number for each event from the first set of events that was defined by a compute device from the first group of compute devices; identifying, using a second process different from the first process, a round number for each event from the first set of events that was defined by a compute device from the second group of compute devices; determining a subset of events from the first set of events based on the round number for each event from the first set of events, each event from the subset of events being defined by a compute device from the second group of compute devices; calculating an order associated with a second set of events as a result of a consensus protocol using the subset of events; and storing the order associated with the second set of events.