Segment blockchain: A size reduced storage mechanism for blockchain
Research output: Contribution to journal › Journal article › Research › peer-review
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.
Original language | English |
---|---|
Article number | 8957450 |
Journal | IEEE Access |
Volume | 8 |
Pages (from-to) | 17434-17441 |
Number of pages | 8 |
ISSN | 2169-3536 |
DOIs | |
Publication status | Published - 2020 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:
© 2013 IEEE.
- blockchain, blockchain storage, content distribution networks, distributed management, Distributed processing, edge computing
Research areas
ID: 300914330