TY - JOUR

T1 - Segment blockchain

T2 - A size reduced storage mechanism for blockchain

AU - Xu, Yibin

AU - Huang, Yangyu

N1 - Publisher Copyright: © 2013 IEEE.

PY - 2020

Y1 - 2020

N2 - 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 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.

AB - 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 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.

KW - blockchain

KW - blockchain storage

KW - content distribution networks

KW - distributed management

KW - Distributed processing

KW - edge computing

UR - http://www.scopus.com/inward/record.url?scp=85079799094&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2020.2966464

DO - 10.1109/ACCESS.2020.2966464

M3 - Journal article

AN - SCOPUS:85079799094

VL - 8

SP - 17434

EP - 17441

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8957450

ER -