ALGORITHMIZATION OF MUTUAL INFORMATION CONSENT IN SYSTEMS WITH A DISTRIBUTED REGISTRY, BASED ON A BLOCK CHAIN


UDC 004.056.2
DOI:10.26102/2310-6018/2020.29.2.002

S.S.Eskov, O.J.Kravets

The object of research is distributed registry systems based on a chain of blocks. The subject of the research is mathematical and software for distributed data processing in solving the problem of achieving mutual information coordination in distributed registry systems based on a chain of blocks. The purpose of the work is to develop an algorithm for the functioning of a system node with the ability to implement non-standard functions, an algorithm for mutual information matching in a distributed registry system based on a chain of blocks, planning numerical experiments to evaluate the effectiveness of mathematical and software for mutual information matching in distributed registry systems based on a chain of blocks. The study of existing approaches has shown that most studies do not fully take into account the simultaneous implementation of non-standard functions by nodes and changes in the structural and parametric characteristics of the system due to the combination of nodes in groups. As a result, an algorithm for the functioning of the system node is proposed, which takes into account the possibility of implementing non-standard functions: the formation of a branch of the processed data and a temporary blocking attack. A generalized algorithm for the functioning of a distributed registry system based on a chain of blocks when performing an algorithm for mutual information coordination, taking into account the possibility of combining nodes into groups, is presented. The numerical experiment was planned.

Keywords:distributed ledger technology, formalization, algorithm, mutual information agreement, non-standard functions, centralization.

Full text:
EskovKravets_2_20_1.pdf