US 11,750,392 B1
Authenticated index data structure with back-pointers
Jude Nelson, New Brunswick, NJ (US); and Aaron Blankstein, Chicago, IL (US)
Assigned to Hiro Systems PBC, New York, NY (US)
Filed by Blockstack PBC, New York, NY (US)
Filed on Nov. 25, 2020, as Appl. No. 17/105,207.
Claims priority of provisional application 62/946,229, filed on Dec. 10, 2019.
Int. Cl. H04L 29/06 (2006.01); H04L 9/32 (2006.01); H04L 9/00 (2022.01)
CPC H04L 9/3236 (2013.01) [H04L 9/50 (2022.05); H04L 2209/34 (2013.01)] 17 Claims
OG exemplary drawing
 
1. A computing device of a decentralized network comprising:
a network interface configured to couple the computing device to the decentralized network;
a hardware processor; and
a non-transitory computer readable storage medium storing program instructions for execution by the hardware processor in order to cause the computing device to:
detect an addition of a first block in a fork of a blockchain via the decentralized network, wherein the first block stores a plurality of transactions, and wherein the fork comprises a prior block;
generate an adaptive radix trie (ART) for the first block, wherein the ART comprises a root node;
determine that a first transaction in the plurality of transactions corresponds to a first key and a first value;
determine a path based on a hash of the first key;
determine that the path shares a prefix with a second path corresponding to a second node in a second ART for the prior block;
modify the ART for the first block to include a child of the root node that is a back-pointer that references the second node in the second ART for the prior block;
copy the second node; and
replace the back-pointer with the copy of the second node, wherein the copy of the second node is a child node of the root node.