Patent ID: 11949801
Assignee: BLOOM TECHNOLOGY CORPORATION
Field: Digital communication (Electrical engineering)
Classification: CPC H | IPC H

Claim 2:
3. A ledger verifiable pruning system comprising:
a hierarchical (h)-skewed Merkle tree production module in which according to a linked list scheme, root hash value Rn−1 of a previous sub-tree is included in data block Tn, data block Tn in which root has value Rn−1 is included is hashed, thereby obtaining h(Tn), obtained h(Tn) and root hash value Rn−1 of the previous sub-tree and a jump link Rn−(base{circumflex over ( )}offset) are summated and then hashed, thereby obtaining h(h(Tn)|Rn−1|Rn−(base{circumflex over ( )}offset)), and obtained h(h(Tn)|Rn−1|Rn−(base{circumflex over ( )}offset)) is successively added to respective nodes of a binary Merkle tree structure to expand and produce an h-skewed Merkle tree,
the jump link Rn−(base{circumflex over ( )}offset) is a root hash value on a node at a predetermined past time on the h-skewed Merkle tree,
the base is a shortest distance of a predetermined jump link in order to allocate the jump link at a predetermined interval,
the offset is a location n % base of a current node, and
a distance of the jump link is configured to be obtained by a baseoffset value.