Abstract
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.
Highlights
In the anonymous and autonomous society like a blockchain system, every record should be re-derivable
THE JURY HYPOTHESIS AND ITS USAGE IN SEGMENT BLOCKCHAIN We proposed the Jury Hypothesis as an analogy of an n/2 Byzantine-node tolerate blockchain sharding approach in [18], which turns the blockchain into multiple committees that run in parallel
We can use equation 14 to calculate the maximum number of shards s1 required for the n/2 blockchain sharding approach to function securely and the maximum number of segments s0 the Segment blockchain embedded to the system can have in order to maintain the same security threshold Prmax
Summary
In the anonymous and autonomous society like a blockchain system, every record should be re-derivable. Parallel to the growth of blockchain size, the storage cost of being a full node (the node which stores all the blocks of the mainchain) in the Bitcoin network is grown in exponential. DPoS has excellent performance because the representative nodes usually have a superpower regarding calculation ability, storage, and network bandwidth These models are commonly used in many blockchain-powered IoT systems [21], [22], where lightweight nodes are at the edge, or the nodes contribute their stakes to DPoS to function the system. The nodes keep the latest state so that they can verify the new transactions They need to keep a segment assigned by the system to participate in the mining game. We will show the data requirement compared to the traditional Nakamoto blockchain (Bitcoin)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
