An Effective Sharding Consensus Algorithm for Blockchain Systems
Runyu Chen, Lunwen Wang, Chuang Peng, Rangang Zhu
Abstract
Sharding is the widely used approach to the trilemma of simultaneously achieving decentralization, security, and scalability in traditional blockchain systems. However, existing schemes generally involve problems such as uneven shard arithmetic power and insecure cross-shard transaction processing. In this study, we used the Practical Byzantine Fault Tolerance (PBFT) as the intra-shard consensus and, here, we propose a new sharding consensus mechanism. Firstly, we combined a jump consistent hash algorithm with signature Anchorhash to minimize the mapping of the node assignment. Then, we improved the process of the cross-shard transaction and used the activity of nodes participating in intra-shard transactions as the criterion for the shard reconfiguration, which ensured the security of the blockchain system. Meanwhile, we analyzed the motivation mechanism from two perspectives. Finally, through theoretical analysis and related experiments, we not only verified that the algorithm can ensure the security of the entire system, but also further clarified the necessary conditions to ensure the effectiveness of the shards and the system on the original basis.