论文标题
N/2拜占庭节点耐受区块链碎片方法
An n/2 Byzantine node tolerate Blockchain Sharding approach
论文作者
论文摘要
传统的区块链碎片方法只能忍受多达N/3的节点是对手的，因为它们依赖于超小几幅分布来使失败（对手在全球范围内没有N/3的节点，但可以操纵很难实现碎片的共识）。该系统必须保持较大的碎片尺寸（碎片中的节点数量），以维持低故障概率，以便只有少量的碎片存在。在本文中，我们提出了一种新的区块链碎片方法，该方法可以承受高达N/2的节点不好的方法。我们将节点分为不同的类别，每个碎片都有来自不同类别的固定节点。我们证明，这种设计比传统型号（只有一个类）要安全得多，并且可以大大降低碎片尺寸。这样，可以存在更多的碎片，并且可以大大增加交易吞吐量。改进的区块链碎片方法有望成为分散自治组织和分散数据库的基础。
Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hypergeometric distribution to make a failure (an adversary does not have n/3 of nodes globally but can manipulate the consensus of a Shard) hard to happen. The system must maintain a large Shard size (the number of nodes inside a Shard) to sustain the low failure probability so that only a small number of Shards may exist. In this paper, we present a new approach of Blockchain Sharding that can withstand up to n/2 of nodes being bad. We categorise the nodes into different classes, and every Shard has a fixed number of nodes from different classes. We prove that this design is much more secure than the traditional models (only have one class) and the Shard size can be reduced significantly. In this way, many more Shards can exist, and the transaction throughput can be largely increased. The improved Blockchain Sharding approach is promising to serve as the foundation for decentralised autonomous organisations and decentralised database.
