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.

中文翻译：

---

一个 n/2 拜占庭节点容忍区块链分片方法

传统的区块链分片方法最多只能容忍 n/3 个节点成为对手，因为它们依赖于超几何分布来使失败（对手在全局范围内没有 n/3 个节点但可以操纵分片的共识）难以发生。系统必须保持较大的 Shard 大小（Shard 内的节点数）以维持低故障概率，以便仅存在少量 Shard。在本文中，我们提出了一种新的区块链分片方法，该方法可以承受多达 n/2 个节点的损坏。我们将节点分为不同的类，每个 Shard 都有固定数量的不同类的节点。我们证明这种设计比传统模型（只有一个类）安全得多，并且可以显着减小 Shard 大小。这样，可以存在更多的分片，并且交易吞吐量可以大大增加。改进后的区块链分片方法有望成为去中心化自治组织和去中心化数据库的基础。