Алгоритмизация взаимного информационного согласия в системах с распределенным реестром на основе цепочки блоков
Работая с нашим сайтом, вы даете свое согласие на использование файлов cookie. Это необходимо для нормального функционирования сайта, показа целевой рекламы и анализа трафика. Статистика использования сайта отправляется в «Яндекс» и «Google»
Научный журнал Моделирование, оптимизация и информационные технологииThe scientific journal Modeling, Optimization and Information Technology
Online media
issn 2310-6018

Algorithmization of mutual information consent in systems with a distributed registry, based on a block chain

Yeskov S.S.   idKravets O.Y.

UDC 004.056.2
DOI: 10.26102/2310-6018/2020.29.2.002

  • Abstract
  • List of references
  • About authors

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.

1. Nakamoto S. Bitcoin: A Peer-to-Peer Electronic Cash System. 2009. https://bitcoin.org/bitcoin.pdf.

2. Rosenfeld M. Analysis of hashrate-based double-spending. arXiv:1402.2009. 2014

3. Pinzón C., Rocha C. Double-spend Attack Models with Time Advantange for Bitcoin. Electronic Notes in Theoretical Computer Science. 2016;329:79-103 https://doi.org/10.1016/j.entcs.2016.12.006.

4. https://bitinfocharts.com/ru/bitcoin

5. https://www.blockchain.com/charts/pools

6. Lychkina N.N. Simulation of economic processes. http://simulation.su/uploads/files/default/2005-uch-posob-lychkina-1.pdf

7. Buslenko V.N. Automation of complex systems simulation. – M.: Science, 1977.

Yeskov Stanislav Sergeevich

Email: csit@bk.ru

Voronezh State Technical University

Voronezh, Russian Federation

Kravets Oleg Yakovlevich
Doctor of Technical Sciences Professor
Email: csit@bk.ru

ORCID |

Voronezh State Technical University

Voronezh, Russian Federation

Keywords: distributed ledger technology, formalization, algorithm, mutual information agreement, nonstandard functions, centralization

For citation: Yeskov S.S. Kravets O.Y. Algorithmization of mutual information consent in systems with a distributed registry, based on a block chain. Modeling, Optimization and Information Technology. 2020;8(2). Available from: https://moit.vivt.ru/wp-content/uploads/2020/05/EskovKravets_2_20_1.pdf DOI: 10.26102/2310-6018/2020.29.2.002 (In Russ).

561

Full text in PDF