	US 12,301,724 B2
	Using a tree structure to segment and distribute records across one or more decentralized, acyclic graphs of cryptographic hash pointers
Christopher Edward Struttmann, Indialantic, FL (US); and James Douglas Beecham, Austin, TX (US)
Assigned to ALTR Solutions, Inc., Austin, TX (US)
Filed by ALTR Solutions, Inc., Austin, TX (US)
Filed on Mar. 7, 2023, as Appl. No. 18/180,078.
Application 18/180,078 is a continuation of application No. 17/584,088, filed on Jan. 25, 2022, granted, now 11,637,706.
Application 17/584,088 is a continuation of application No. 17/143,009, filed on Jan. 6, 2021, granted, now 11,265,171, issued on Mar. 1, 2022.
Application 17/143,009 is a continuation of application No. 16/669,337, filed on Oct. 30, 2019, granted, now 10,911,241, issued on Feb. 2, 2021.
Application 16/669,337 is a continuation of application No. 16/211,057, filed on Dec. 5, 2018, granted, now 10,505,740, issued on Dec. 10, 2019.
Application 16/211,057 is a continuation of application No. 15/917,616, filed on Mar. 10, 2018, granted, now 10,193,696, issued on Jan. 29, 2019.
Application 15/917,616 is a continuation in part of application No. 15/675,519, filed on Aug. 11, 2017, granted, now 10,121,019, issued on Nov. 6, 2018.
Application 15/675,519 is a continuation in part of application No. 15/171,347, filed on Jun. 2, 2016, granted, now 10,581,977, issued on Mar. 3, 2020.
Claims priority of provisional application 62/469,742, filed on Mar. 10, 2017.
Claims priority of provisional application 62/374,307, filed on Aug. 12, 2016.
Claims priority of provisional application 62/169,823, filed on Jun. 2, 2015.
Prior Publication US 2023/0336357 A1, Oct. 19, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 29/06 (2006.01); G06F 16/901 (2019.01); G06F 21/60 (2013.01); G06F 21/64 (2013.01); G06F 21/78 (2013.01); H04L 9/06 (2006.01); H04L 9/32 (2006.01); H04L 9/00 (2022.01)

CPC H04L 9/3242 (2013.01) [G06F 16/9024 (2019.01); G06F 21/602 (2013.01); G06F 21/64 (2013.01); G06F 21/78 (2013.01); H04L 9/0637 (2013.01); H04L 9/3239 (2013.01); H04L 9/50 (2022.05)]

38 Claims

1. 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 first request to store a record from a computing entity;

encoding, with one or more processors, the record in a first plurality of segments;

arranging, with one or more processors, the first plurality of segments in respective content nodes of a first content graph, wherein:

each segment is stored in a different content node of the first content graph;

directed content edges of the first content graph connect respective pairs of the content nodes of the first content graph;

the directed content edges define a plurality of directed paths through the first content graph by which each of the segments is reachable from a first root content node of the first content graph; and

at least some content nodes of the first content graph have two or more directed content edges of the first content graph pointing to two or more respective other content nodes of the first content graph;

storing, with one or more processors, the content nodes of the first content graph in a verification graph, wherein:

the verification graph comprises a plurality of verification nodes;

the content nodes and the directed content edges are stored as content of the verification nodes; and

respective pairs of the verification nodes are connected by respective directed verification edges; and

returning, with one or more processors, a first identifier of the first root content node to the computing entity, wherein the first identifier identifies a verification node of the verification graph storing the first root content node.