论文标题
$ p/2 $抗体电力阻力区块链碎片方法
A $p/2$ Adversary Power Resistant Blockchain Sharding Approach
论文作者
论文摘要
区块链碎片是一种区块链性能增强方法。通过将区块链分成几个并行运营的委员会（碎片），它有助于增加交易吞吐量，减少所需的计算资源并增加对参与者的奖励期望。最近，已经提出了几种可以忍受$ n/2 $ byzantine节点（$ n/2 $安全级别）的灵活碎片方法。但是，这些方法具有三个主要缺点。首先，在非碎片区块链中，节点可以具有不同的权重（功率或损失）来建立共识，因此，对手需要控制整体重量的一半以操纵系统（$ p/2 $安全级别）。在区块链碎片中，所有节点都具有相同的重量。因此，只有假设诚实的参与者创建了尽可能多的节点，即$ n/2 $安全级别的区块链碎片达到$ p/2 $安全级别。其次，当某些节点离开系统时，需要经常重新分配其他节点，从碎片到碎片，以维持安全级别。这对系统性能产生不利影响。第三，尽管一些$ N/2 $方法可以保持数据完整性，最多可N/2 $拜占庭节点，但它们的系统可以停止使用少量拜占庭节点。在本文中，我们提出了$ p/2 $安全级别的区块链碎片方法，该方法不需要诚实的参与者创建多个节点，当某些节点离开系统时需要更少的节点重新分配，并且可以防止系统停止。我们的实验表明，在安全性，交易吞吐量和灵活性方面，我们的新方法优于现有的区块链碎片方法。
Blockchain Sharding is a blockchain performance enhancement approach. By splitting a blockchain into several parallel-run committees (shards), it helps increase transaction throughput, reduce computational resources required, and increase reward expectation for participants. Recently, several flexible sharding methods that can tolerate up to $n/2$ Byzantine nodes ($n/2$ security level) have been proposed. However, these methods suffer from three main drawbacks. First, in a non-sharding blockchain, nodes can have different weight (power or stake) to create a consensus, and as such an adversary needs to control half of the overall weight in order to manipulate the system ($p/2$ security level). In blockchain sharding, all nodes carry the same weight. Thus, it is only under the assumption that honest participants create as many nodes as they should that a $n/2$ security level blockchain sharding reaches the $p/2$ security level. Second, when some nodes leave the system, other nodes need to be reassigned, frequently, from shard to shard in order to maintain the security level. This has an adverse effect on system performance. Third, while some $n/2$ approaches can maintain data integrity with up to $n/2$ Byzantine nodes, their systems can halt with a smaller number of Byzantine nodes. In this paper, we present a $p/2$ security level blockchain sharding approach that does not require honest participants to create multiple nodes, requires less node reassignment when some nodes leave the system, and can prevent the system from halting. Our experiments show that our new approach outperforms existing blockchain sharding approaches in terms of security, transaction throughput and flexibility.
