Segment blockchain: a size reduced storage mechanism for blockchain

Xu, Yibin and Huang, Yangyu 2020. Segment blockchain: a size reduced storage mechanism for blockchain. IEEE Access 8 , pp. 17434-17441. 10.1109/ACCESS.2020.2966464

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (6MB) | Preview

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.

Item Type:	Article
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Publisher:	IEEE
ISSN:	2169-3536
Related URLs:	Publisher
Date of First Compliant Deposit:	25 March 2020
Date of Acceptance:	5 January 2020
Last Modified:	05 May 2023 04:06
URI:	https://orca.cardiff.ac.uk/id/eprint/130522

Citation Data

Cited 20 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item