FIELD: physics.
SUBSTANCE: invention relates to a method of processing data sets for storage and tracking in a specific network, which implements a thinned Merkle tree. Method comprises steps of: cryptographically hashing data sets to obtain hash values of data sets; when applicable, cryptographically hashing successive hash values of data sets to obtain combined hash values of the first stage; when applicable, cryptographically hashing the combined hash values of the previous stage to obtain the combined hash values of the next stage until a root hash value is obtained, at that, dividing at least one of the hash values into several sections containing keys of levels of the hierarchy of Merkle trees (eye keys) of a given bit depth; determining the leaves of the thinned Merkle tree, corresponding to the archived data in the distributed hash table (leaf eye keys), and branching nodes of the thinned Merkle tree, which support the creation of a subtree (parent ring keys); and creating a subtree on each parent ring-key, wherein at least one subtree comprises more than two branches.
EFFECT: optimization of transaction data storage.
12 cl, 7 dwg
