Search All Applications in Z-ARCHIVE-Cryptocurrency
Application US20190363874
Published 2019-11-28
Decentralized Computation System Architecture Based On Node Specialization
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 comprising a plurality of each of three specialized node types, the specialized node types comprising access nodes, security nodes, and execution nodes.
Much More than Average Length Specification
View the Patent Matrix® Diagram to Explore the Claim Relationships
USPTO Full Text Publication >
- 1. A decentralized computation system for providing secure and scalable decentralized computation for one or more decentralized applications, the system comprising:
a blockchain; and a plurality of nodes comprising a plurality of each of three specialized node types, the specialized node types comprising access nodes, security nodes, and execution nodes; the access nodes configured to perform at least: 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; and d) providing a state response to the at least one client, the state response determined based on an output for a finalized block; the security nodes configured to perform at least: 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 execution nodes; and the execution nodes configured to perform at least: a) receiving, from the access nodes, the transaction text for each of the one or more transactions based on a query provided to the access nodes, the query determined according to the finalized block; b) presenting a hashed commitment of the output for the finalized block to the other execution nodes, the output for the finalized block determined based on the transaction text for each of the one or more transactions; and c) revealing the output to the access nodes when each of the other execution nodes has presented the output for the finalized block.
- 19. A decentralized computation system for adding a block to a blockchain comprising:
a) access nodes configured to receive, from a client, one or more transactions, determine that the one or more transactions are well-formed, and provide responses to queries related to a canonical state for the blockchain; b) security nodes configured to provide a guarantee for the block through a Byzantine fault tolerance (BFT) consensus algorithm employed to finalize the one or more transactions; and c) execution nodes configured to determine a result for each of the one or more transactions, once finalized, and store the canonical state of the blockchain.
- 20. A computer-implemented method of adding a block to a blockchain comprising:
a) receiving, through a plurality of access nodes, one or more transactions from a client; b) determine, through the access nodes, that the one or more transactions are well-formed; c) providing, through a plurality of security nodes, a guarantee for the block through a Byzantine fault tolerance (BFT) consensus algorithm employed to finalize the block; d) determining, through a plurality execution nodes, a result for each of the one or more transactions, once the block is finalized; e) storing, through the execution nodes, a canonical state of the blockchain; and f) providing, through the access nodes, responses to queries related the canonical state for the blockchain.
