Blockchains have revolutionized the storage of data in an immutable, transparent and non-centralized way. However, public blockchain systems like the Bitcoin system face a problem of scalability, primarily due to the significant and growing size of its blockchain. This paper introduces a method, termed block summarization, which reduces blockchain storage overhead for systems having transferable transactions. The proposed method allows resource-restricted light nodes to store a form of the blockchain such that it can validate the transactions independently which ultimately reduce dependency on full nodes. This way, we can achieve a middle ground between Simplified Payment Verification (SPV) nodes which can only verify the membership of a transaction in the blockchain, and full nodes with pruning enabled which can only support pruning provided they have an infrastructure of full nodes. We implemented our algorithm for a custom blockchain using Bitcoin blocks and were able to achieve a compression ratio of 0.54.
[1]
Ghassan O. Karame,et al.
On the privacy provisions of Bloom filters in lightweight bitcoin clients
,
2014,
IACR Cryptol. ePrint Arch..
[2]
Srinivas Devadas,et al.
Catena: Preventing Lies with Bitcoin
,
2016,
IACR Cryptol. ePrint Arch..
[3]
Zibin Zheng,et al.
Blockchain challenges and opportunities: a survey
,
2018,
Int. J. Web Grid Serv..
[4]
M. Frans Kaashoek,et al.
VerSum: Verifiable Computations over Large Public Logs
,
2014,
CCS.
[5]
J. D. Bruce.
The Mini-Blockchain Scheme
,
2014
.