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

Claim 5:
6. The ledger verifiable pruning system of claim 5, wherein the node integrity verification module is configured to verify whether a hash value Ry or a data block Ty exists in the h-skewed Merkle tree according to the following procedure, and
1) searching a jump link or a link (node) which exists at a most past time among links (nodes) which is the same time as or more future than Ry based on a link (node) within a predetermined distance in a past time direction from a latest root hash value Rhead,
2) searching a jump link or a link (node) which exists at a most past time among links (nodes) which is the same time as or more future than Ry based on a link (node) within a predetermined distance in a past time direction from a hash value of a jump link or a link which exists in the searched most past time,
3) repeating process 2) until reaching the Ry,
4) calculating root hashes directed in a future direction sequentially for a set of the jump link or the link (node) searched repeatedly in processes 2) and 3) by using the Ty, and
5) comparing whether a finally obtained root hash value is equal to the Rhead, and verifying that the hash value Ry or the data block Ty exists in the h-skewed Merkle tree when the finally obtained root hash value is equal to the Rhead as a comparison result.