Using a tree structure to segment and distribute records across one or more decentralized, acyclic graphs of cryptographic hash pointers

A tangible, non-transitory, machine-readable medium storing instructions that when executed by one or more processors effectuate operations configured to expedite retrieval of records written to persistent storage, the operations comprising:

• receiving, with one or more processors, a request to read a record from a computing entity, the request including an identifier of a root content node, wherein the record is a file, the identifier distinguishes the root content node from other content nodes of a content graph;
• retrieving, with one or more processors and using the identifier, the root content node from a verification graph, wherein:
• the verification graph comprises a plurality of verification nodes,
• the content nodes and content edges are stored as content of the verification nodes,
• respective pairs of the verification nodes are connected by respective directed verification edges, and
• the verification graph is configured to indicate tampering with any of a plurality of records stored in the verification graph;
• traversing, with one or more processors, the content graph from the root content node to retrieve content nodes of the content graph from the verification graph, wherein at least some of the content nodes are retrieved concurrently, wherein the verification graph includes a plurality of directed acyclic graphs of cryptographic hash pointers and different portions of the content graph are stored as content of verification nodes of the directed acyclic graphs of cryptographic hash pointers;
• verifying, with one or more processors, that each segment of a plurality of segments stored in the every content node are consistent with the verification graph;
• and
• returning, with one or more processors and in response to the verifying that the segments are consistent with the verification graph, the record according to the request.