Mathematical Analysis of Parametric Characteristics of the Consensus Algorithms Operation with the Choice of the Most Priority One for Implementation in the Financial Sphere

Blockchain is one of the leading data transfer technologies that eliminate the need for centralized management through consensus algorithms. This article describes the consensus algorithms, their benefits, and their applications within a micropayment system in the financial sector. Preliminary studi...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Olga A. Safaryan, Kirill S. Lemeshko, Alexey N. Beskopylny, Larissa V. Cherckesova, Denis A. Korochentsev
Formato: article
Lenguaje:EN
Publicado: MDPI AG 2021
Materias:
Acceso en línea:https://doaj.org/article/1c39fc1811ac4aa59aa0a2987cd82268
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Blockchain is one of the leading data transfer technologies that eliminate the need for centralized management through consensus algorithms. This article describes the consensus algorithms, their benefits, and their applications within a micropayment system in the financial sector. Preliminary studies have shown that the performance of distributed databases largely depends on the chosen consensus algorithm. The main task of the study is to create a mathematical model to assess their performance. The most popular crypto projects and the consensus algorithms are analyzed to determine their performance. The obtained model was tested by calculating the parameters of the distributed register based on the directed acyclic graph algorithm and calculating the parameters of other algorithms used. The result is a mathematical model for evaluating the parametric characteristics of the work of consensus algorithms with the choice of the most priority one for implementation in the financial sector. The analysis focuses on the mathematical steps taken by each consensus algorithm. The data obtained using the developed mathematical model demonstrates that PoW, PoS, and DAG algorithms depend on various resources, such as computing power, the number of connected nodes, and the speed of receiving transactions.