Byzantine Fault Tolerance Based Multi-Block Consensus Algorithm for Throughput Scalability

Blockchain is a distributed, reliable, and secure ledger that maintains data by consensus among network participants. The consensus algorithms provide data reliability but increase the data processing time. In this paper, we propose the multi-block consensus algorithm based on Byzantine Fault Tolerance to enhance throughput. The key point of the proposed algorithm is that the primary propagates the disjoint-transaction sets to other replicas. After receiving the propagated blocks, the replicas verify the propagation part and the content part of the blocks. As sharing the verifying result, the replicas could add the valid blocks to the blockchain at a time. We evaluate the performance of the proposed algorithm comparing to the Practical Byzantine Fault Tolerance algorithm which is the most ordinary Byzantine Fault Tolerance based algorithm. By the simulation results, throughput increases as the number of users increases.

I. Introduction

Blockchain is one of the decentralized data storage technologies which creates a distributed ledger by sharing data in the form of blocks to network participants. This structure is the chain of blocks, so each node in the blockchain network cannot arbitrarily change data. Thus, it ensures consistency and reliability of data.