Big data blockchains with Merkle trees
OwnerTyson York Winarskiinventor
Life of this patent
Estimating the term…
Abstract
A non-transitory computer tangible medium is disclosed containing instructions for securing a large data set with a blockchained Merkle B-Tree. These instructions provide for accessing a large data set stored within a digital storage device, assigning each object of the large data set to a node of a Merkle B-Tree, and generating vertical blockchains that begin with a root node of the Merkle B-Tree and extend outward toward leaf nodes of the Merkle B-Tree based on data within each object. As a result, vertically blockchained Merkle B-Tree for containing the large data set as data are formed.
Claims20
A non-transitory computer tangible medium containing instructions for securing a large data set with a blockchained Merkle Tree, comprising:
- storing each data object of a large data set within a separate node of a Merkle Tree including within a root node, leaf nodes, and nodes interconnecting the root node to the leaf nodes;
- and
- blockchaining the nodes of the Merkle Tree together into blockchains, wherein each of the blockchains begin with a first blockchain block that includes the root node as data and end with a final blockchain block that includes one of the leaf nodes as data.
A non-transitory computer tangible medium containing instructions for securing a large data set with a blockchained Merkle Tree, comprising:
- mapping a large data set onto a Merkle Tree for storage and storing portions of the large data set within the Merkle Tree's root node, leaf nodes, and nodes interconnecting the root node to the leaf nodes;
- and
- blockchaining the root node, leaf nodes and interconnecting nodes together into blockchains with interlinking hashes.
A non-transitory computer tangible medium containing instructions for securing a large data set with a blockchained Merkle Tree, comprising:
- storing portions of a large data set within the Merkle Tree's root node, leaf nodes, and nodes interconnecting the root node to the leaf nodes;
- creating a first blockchain block storing the root node as data;
- and
- creating additional blockchain blocks to store nodes that branch from the root node as data, wherein the additional blockchain blocks include a hash based in part on the root node.
Dependencies are inferred from the claim text.