Abstract
With the development of blockchain technology, participants need to have huge storage volumes to deal with the growing blockchain ledger size over time. This requirement leads to the conditional participation and verification of participants, thus weakening the decentralization of a blockchain system. Several compression schemes have been proposed to mitigate this storage problem by compressing a blockchain ledger based on redundancy, modular functions, and hash functions. However, these schemes have the limitation of accumulating the compression results to validate the retained blocks. The accumulation gradually reduces the storage volume for the blockchain ledger within the storage volume of nodes with limited resources, thus reducing the verification capability of the nodes. In this paper, a selective compression scheme using a checkpoint-chain is proposed to prevent the accumulation of compression results. The checkpoint-chain is a second blockchain that stores the checkpoints compressing existing blocks through a block Merkle tree. An update process is also proposed to prevent the accumulation of checkpoints by combining them. As numerous blocks can be verified with only a few updated checkpoints, blockchain nodes with limited resources can reduce the storage volume for the blockchain ledger and achieve high verification capabilities. Finally, compared with the existing compression schemes, the proposed scheme can achieve an average reduction in the storage overhead and an average increase in the verification capability of 76.02% and 13.90%, respectively. Moreover, the corresponding performance improvements are 86.14% and 15.44% when the update process is performed, respectively.
Highlights
Blockchain technology has emerged as a major approach for implementing distributed systems [1]
The main contributions of this paper are as follows: 1) We propose a selective compression scheme, called SELCOM, to solve the storage problem for blockchain nodes with limited resources
MATHEMATICAL ANALYSIS AND RESULTS the proposed and existing schemes are compared in terms of storage efficiency and verification capability by the numerical results based on the analyses
Summary
Blockchain technology has emerged as a major approach for implementing distributed systems [1]. The key aspect of compression schemes is that smaller-sized compression results can replace blockchain data, and the results are used to recover or validate the data They address the storage problem and enable independent verification of each block or transaction. We propose a selective compression (SELCOM) scheme using a block Merkle tree (BMT) to solve the storage problem and achieve a higher verification capability without accumulations. The main contributions of this paper are as follows: 1) We propose a selective compression scheme, called SELCOM, to solve the storage problem for blockchain nodes with limited resources. 2) We design an update process in SELCOM to mitigate the limitation of reduced verification capability due to the accumulation of compression results in existing compression schemes.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
