Segment blockchain: A size reduced storage mechanism for blockchain

63Citations
Citations of this article
101Readers
Mendeley users who have this article in their library.

This article is free to access.

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

Cite

CITATION STYLE

APA

Xu, Y., & Huang, Y. (2020). Segment blockchain: A size reduced storage mechanism for blockchain. IEEE Access, 8, 17434–17441. https://doi.org/10.1109/ACCESS.2020.2966464

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free