Abstract

The exponential growth of storage space in blockchain network has become a serious problem to hinder the distribution of blockchain and the expansion of blockchain nodes. In this paper. We propose a security strategy for distributed storage blockchains, which can delete part of blockchains so that nodes only store part of a blockchain. We design a kind of semi-full node between full node and light node according to the requirement of the strategy, besides describe the process of deleting block and synchronizing block, and the running logic of the semi-full node. Finally, we perform comprehensive experiments of the truncated MCMC random algorithm. The results show that in the case of multi-node, the truncated block will not affect the block chain network. Compared with the traditional block design, our storage strategies can reduce storage requirements under most of situation, thus enable blockchains to be deployed on mobile or smaller storage computers.

Highlights

  • With the rapid development of blockchain technology, the scale of various blockchain projects is gradually increasing, and the demand for computer storage is increasing

  • One of the most important technologies in blockchain is tamper-proofing; in short, it is for each node in blockchain network to store the same blockchain data file

  • This distributed storage methods ensure that the blockchain data can not be changed, and the more nodes store data, the more difficult to tamper with the data

Read more

Summary

INTRODUCTION

With the rapid development of blockchain technology, the scale of various blockchain projects is gradually increasing, and the demand for computer storage is increasing. We design a new blockchain storage strategy, which can reduce the block information in different nodes according to the random algorithm. Put forword the conversion model of full node, light node and semi-full node, can greatly reduce the size of blockchain storage capacity, and fair deletion of block information based on MCMC random algorithm. RELEVANT RESEARCH Recently, many scholars have accomplished some research on improving the performance of blockchain, such as weighted model [7], [8], blockchain segmentation [9], [10], consensus mechanism improvement [11]–[13], etc All these methods try to reduce the burden of a single node, to ensure the low storage of the blockchain system and to improve the node performance at the same time.

ENCRYPTION ALGORITHM
EXPERIMENT OF RANDOM PRUNING ALGORITHM
Findings
SUMMARY AND OUTLOOK
Full Text
Paper version not known

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 call

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