ULS-PBFT: An ultra-low storage overhead PBFT consensus for blockchain

Abstract

Since the Practical Byzantine Fault Tolerance (PBFT) consensus mechanism can avoid the performance bottleneck of blockchain systems caused by Proof of Work (PoW), it has been widely used in many scenarios. However, in the blockchain system, each node is required to back up all transactions and block data of the system, which will waste a lot of storage resources. It is difficult to apply to scenarios with limited storage resources such as unmanned aerial vehicle networks and smart security protection; thus, it is often used in small-scale networks. In order to deploy PBFT-based blockchain systems in large-scale network scenarios, we propose an ultra-low storage overhead PBFT consensus (ULS-PBFT), which groups nodes hierarchically to limit the storage overhead within the group. In this paper, we first propose an optimal double-layer PBFT consensus from the perspective of minimizing the storage overhead, and prove that this consensus can significantly reduce the storage overhead. In addition, we also investigate the superiority of ULS-PBFT in terms of communication overhead while setting the security threshold in the presence of the possibility of Byzantine nodes. The simulation results demonstrate the advantages of ULS-PBFT. Then, we extend such grouping idea to the blockchain system with X-layer PBFT and analyze its storage and communication overhead. Finally, the node grouping strategy of double-layer PBFT is studied for four application scenarios when the performance of storage overhead, communication overhead, and security are considered comprehensively.