【Author】
Chen, Runyu; Wang, Lunwen; Peng, Chuang; Zhu, Rangang
【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.
【Keywords】blockchain; sharding; Practical Byzantine Fault Tolerance; consensus mechanism; jump consistent hash algorithm; Anchorhash; timestamp
【摘要】分片是解决在传统区块链系统中同时实现去中心化、安全性和可扩展性的三难困境的广泛使用的方法。然而，现有方案普遍存在分片算力不均、跨分片交易处理不安全等问题。在这项研究中，我们使用实用拜占庭容错（PBFT）作为分片内共识，在这里，我们提出了一种新的分片共识机制。首先，我们将跳跃一致性哈希算法与签名 Anchorhash 相结合，以最小化节点分配的映射。然后，我们改进了跨分片交易的流程，以参与分片内交易的节点的活跃度作为分片重构的标准，保证了区块链系统的安全性。同时，我们从两个角度分析了激励机制。最后，通过理论分析和相关实验，我们不仅验证了该算法能够保证整个系统的安全性，而且在原有基础上进一步明确了保证分片和系统有效性的必要条件。
【关键词】区块链；分片；实用的拜占庭容错；共识机制；跳转一致性哈希算法；锚哈希；时间戳
评论