ANALYSIS OF THE EFFECTIVENESS OF CONSENSUS-BUILDING ALGORITHMS IN DISTRIBUTED DATA PROCESSING SYSTEMS BASED ON BLOCKCHAIN TECHNOLOGY

Abstract

The authors of the article consider consensus-building algorithms that are central to the life cycle of transactional exchange between nodes of a DDPS (Distributed Data Processing System) based on blockchain technology. The term under consideration is formally defined. It is proved that when developing these algorithms, it is necessary to choose the main indicators and methods for calculating them, which can be used to evaluate their effectiveness. The process of false forking is described in detail, and the probability of its occurrence is calculated in order to assess the security of data stored in the distributed ledger. When analyzing existing consensus-building algorithms based on statistical data, it is shown that the Byzantine Fault Tolerance Delegated Proof-of-Stake (BFT-DPoS) algorithm has a higher level of efficiency not only in terms of security, but also in terms of performance compared to other algorithms. There is a lack of comprehensive evaluation of candidates for winning Registrar nodes that generate (mining) blocks and distribute them to verifier nodes. It is concluded that the elimination of the above-mentioned drawback would provide a more correct construction of the distributed ledger, since most of the existing algorithms are focused on applicability only in cryptocurrency systems and are not universal. To solve this problem, we propose the need to synthesize the BFT-DPoS and Proof-of-Importance algorithms in order to make it applicable to any type of DDPS using distributed ledger technology (blockchain).