Testing and Comparative Analysis of the F-BFT-based DLT Solution

Consensus algorithm is a crucial part of a blockchain system. In particular, in any blockchain-based Distributed Ledger Technology (DLT) solution the consensus algorithm plays the key role in maintaining consistency of databases. The choice of consensus type during design of the distributed system will inevitably and significantly affect such characteristics as throughput and network load what in turn can impose serious restrictions on functionality or applicability of the whole system. In this research paper we overview the most commonly used algorithms and approaches, the highest attention is paid to those based on the solution of the Byzantine Fault Tolerance problem (BFT). One of the best-known algorithms of that type is the Practical Byzantine Fault Tolerance (PBFT) which has become the basis and the benchmark for a plenty of different BFT algorithms. The focus of this paper is sharpened on a particular PBFT modification known as the Federalized BFT. The aim of this study is to investigate a particular F-BFT-based DLT solution, to compare it with the other systems of that type and to determine areas of its applicability.