US 11,778,024 B2Granted

Decentralized computation system architecture based on node specialization

AssigneeDapper Labs Inc.

InventorsDietrich Theodore Shirley, Fabiano Pereira Soriani, Christopher Patrick Scott, Layne Lafrance

Life of this patent

Estimating the term…

Loading patent…

Abstract

Described are systems, methods, and media for providing secure and scalable decentralized computation for one or more decentralized applications. Features include a blockchain, and a plurality of nodes that are separated into at least a first specialized node type and a second specialized node type. Nodes of the first specialized node type can be assigned non-deterministic tasks to perform, and each of the nodes of the second specialized node type can be assigned deterministic tasks to perform. Thus, the disclosed systems and methods can achieve improvements in speed and cost that scale with hardware capacity without compromising decentralization.

Claims9

Dependent claims

A decentralized computation system for providing decentralized computation for one or more decentralized applications, the system comprising:

a blockchain;
and
a plurality of nodes, wherein the plurality of nodes are separated into at least a first specialized node type and a second specialized node type;
wherein the nodes of the first specialized node type are configured to perform deterministic tasks comprising:
a) generating a candidate block comprising the one or more signed hashes;
b) finalizing the candidate block by performing a Byzantine fault tolerance (BFT) consensus algorithm to validate that a threshold number of access nodes determined that the one or more transactions were well-formed based on the one or more signed hashes;
and
c) providing the finalized block to the nodes of the first specialized node type;
and
wherein the nodes of the second specialized node type are configured to perform non-deterministic tasks comprising:
a) receiving one or more transactions from at least one client, the one or more transactions each comprising transaction text and credentials;
b) cryptographically signing a hash for each of the transaction text of the one or more transactions based on a determination that the one or more transactions are well-formed;
c) providing the one or more signed hashes to the security node for validation;
d) providing a state response to the at least one client, the state response determined based on an output for a finalized block;
e) receiving the transaction text for each of the one or more transactions based on a query provided, the query determined according to the finalized block;
f) presenting a hashed commitment of the output for the finalized block, the output for the finalized block determined based on the transaction text for each of the one or more transactions;
and
g) revealing the output when each of the other nodes of the second specialized node type has presented the output for the finalized block.

15 more elements

A decentralized computation system for providing decentralized computation for one or more decentralized applications, the system comprising:

a plurality of nodes;
a blockchain, wherein an architecture of the blockchain is divided by task into at least two specialization groups based on tasks associated with functions of the blockchain, the specialization groups comprising:
a first specialization group of tasks being assigned to a first subset of the plurality of nodes to perform, and
a second specialization group of tasks being assigned to a second subset of the plurality of nodes to perform, the second subset of the plurality of nodes including different nodes than the first subset of the plurality nodes,
wherein the first specialization group of tasks include deterministic tasks comprising:
a) generating a candidate block comprising the one or more signed hashes;
b) finalizing the candidate block by performing a Byzantine fault tolerance (BFT) consensus algorithm to validate that a threshold number of access nodes determined that the one or more transactions were well-formed based on the one or more signed hashes;
and
c) providing the finalized block to a subset of the plurality of nodes;
and
wherein the second specialization group of tasks include non-deterministic tasks comprising:
a) receiving one or more transactions from at least one client, the one or more transactions each comprising transaction text and credentials;
b) cryptographically signing a hash for each of the transaction text of the one or more transactions based on a determination that the one or more transactions are well-formed;
c) providing the one or more signed hashes to a security node of the plurality of nodes for validation;
d) providing a state response to the at least one client, the state response determined based on an output for a finalized block;
e) receiving the transaction text for each of the one or more transactions based on a query provided, the query determined according to the finalized block;
f) presenting a hashed commitment of the output for the finalized block, the output for the finalized block determined based on the transaction text for each of the one or more transactions;
and
g) revealing the output when each of the nodes has presented the output for the finalized block.

16 more elements

A decentralized computation system for providing decentralized computation for one or more decentralized applications, the system comprising:

a blockchain;
and
a plurality of nodes, wherein the plurality of nodes are separated into at least a first specialized node type and a second specialized node type, each of the nodes of the first specialized node type assigned non-deterministic tasks to perform and each of the nodes of the second specialized node type assigned deterministic tasks to perform, each of the plurality of nodes performing either deterministic tasks or non-deterministic tasks, an architecture of the blockchain being divided by tasks into the first specialized node type performing the non-deterministic tasks and the second specialized node type performing the deterministic tasks,
the deterministic tasks comprising:
a) generating a candidate block comprising the one or more signed hashes;
b) finalizing the candidate block by performing a Byzantine fault tolerance (BFT) consensus algorithm to validate that a threshold number of access nodes determined that the one or more transactions were well-formed based on the one or more signed hashes;
and
c) providing the finalized block to the nodes of the first specialized node type;
and
the non-deterministic tasks comprising:
a) receiving one or more transactions from at least one client, the one or more transactions each comprising transaction text and credentials;
b) cryptographically signing a hash for each of the transaction text of the one or more transactions based on a determination that the one or more transactions are well-formed;
c) providing the one or more signed hashes to the security node for validation;
d) providing a state response to the at least one client, the state response determined based on an output for a finalized block;
e) receiving the transaction text for each of the one or more transactions based on a query provided, the query determined according to the finalized block;
f) presenting a hashed commitment of the output for the finalized block, the output for the finalized block determined based on the transaction text for each of the one or more transactions;
and
g) revealing the output when each of the other nodes of the second specialized node type has presented the output for the finalized block.

15 more elements

Dependencies are inferred from the claim text.

Facts

Application: 17/532,425Filed 22 Nov 2021 · continuation
Priority: 24 May 2018
Published: US 2022/0159069 A119 May 2022
Granted: 3 Oct 2023
Term ends: Not estimatedThe source records don’t support an estimate.

Classification14 codes

G06Q 20/3827
Insuring higher security of transaction: use of message hashing
H04L 67/1093
Using cross-functional networking aspects: some peer nodes performing special functions
H04L 9/3239
Using cryptographic hash functions: involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
H04L 9/3242
Using cryptographic hash functions: involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC

Family

Application62/676,131Us provisional application · filed 24 May 2018
Application16/421,222Parent of this continuation-in-part · filed 23 May 2019
Application17/321,239Parent of this continuation · filed 14 May 2021
US 11,139,956 B2Parent of this continuation-in-part · filed 5 Oct 2021
US 2022/0159069 A1Pre-grant publication · published 19 May 2022
US 11,184,437 B2Parent of this continuation
Application17/321,239Parent of this continuation-in-part
US 2019/0363874 A1Published application
US 2021/0273993 A1Published application
US 11,778,024 B2This patent

From the US filing history. Foreign family members aren’t listed.