VERIFIABLE REGISTRY TRUNCATION SYSTEM Russian patent published in 2023 - IPC H04L9/32 

FIELD: data processing.

SUBSTANCE: invention relates to data processing field. According to the linked list scheme, the R_n-1 root hash value of the previous subtree is included in the T_n data block. The T_n data block, in which the R_n-1 root hash value is included, is hashed, which results in yielding h(T_n). The resulting h(T_n) and the R_n-1 root hash value of the previous subtree are combined and then hashed yielding h(h(T_n)|R_n-1). The yielding h(h(T_n)|R_n-1) is sequentially added to the corresponding nodes of the Merkle binary tree structure, which allows configuring the skewed Merkle tree creation module to unfold/create a skewed Merkle tree.

EFFECT: invention provides a verifiable registry truncation system, in which the registry structure is configured as a skewed Merkle tree.

5 cl, 10 dwg