论文标题
细分区块链：大小降低区块链的存储机构
Segment blockchain: A size reduced storage mechanism for blockchain
论文作者
论文摘要
区块链规模的指数增长已成为阻碍区块链分散及其在数据繁重应用中的潜在实现的主要因素。在本文中，我们提出了细分区块链，这种方法可以分割区块链并使节点只能存储一个区块链段的副本。我们将\ emph {pow}用作会员阈值来限制对手所采集的节点的数量 - 当对手在$ n $ nodes网络中最多只能获得$ n/2 $的节点，当它具有$ 50 \％的计算能力时（Nakamoto Blockchain Blockchain Blockchain Security Threashold）。当对手存储一个细分市场的所有副本时，细分区块链系统会失败，因为对手可以离开系统，从而导致该细分市场的永久损失。从理论上讲，当对手具有不超过$ ad $ $ $ $的节点时，细分区块链可以维持$（ad/n）^m $失败概率，并且每个细分市场都由$ m $ $ $ $ $ $。与传统设计相比，该存储要求大多是缩小的，因此使区块链更适合于数据繁多的应用程序。
The exponential growth of the blockchain size has become a major contributing factor that hinders the decentralisation of blockchain and its potential implementations in data-heavy applications. In this paper, we propose segment blockchain, an approach that segmentises blockchain and enables nodes to only store a copy of one blockchain segment. We use \emph{PoW} as a membership threshold to limit the number of nodes taken by an Adversary---the Adversary can only gain at most $n/2$ of nodes in a network of $n$ nodes when it has $50\%$ of the calculation power in the system (the Nakamoto blockchain security threshold). A segment blockchain system fails when an Adversary stores all copies of a segment, because the Adversary can then leave the system, causing a permanent loss of the segment. We theoretically prove that segment blockchain can sustain a $(AD/n)^m$ failure probability when the Adversary has no more than $AD$ number of nodes and every segment is stored by $m$ number of nodes. The storage requirement is mostly shrunken compared to the traditional design and therefore making the blockchain more suitable for data-heavy applications.
