Research On Information Pruning Method For Blockchain Distributed Ledger

In recent years,with the rapid development of blockchain distributed ledgers,the information on the blockchain has grown rapidly.In the blockchain network,in order to ensure decentralization,each node must independently store all blockchain data.The ever-increasing blockchain information has increased the storage requirements of nodes in the blockchain network,and at the same time,it also brings a lot of synchronization and verification burdens to newly added nodes.This will lead to fewer nodes that store blockchain information.The decentralization of blockchain has a negative impact and is not conducive to the development of blockchain networks.Therefore,more and more researches focus on how to optimize blockchain information storage.In order to alleviate the storage pressure of the growing blockchain information on nodes,many current researches are based on pruning blockchain information.This paper will conduct research on information pruning in blockchain distributed ledgers.The main work of this paper includes the following:1.Strictly define the historical redundant transaction information that can be pruned in the blockchain distributed ledger without affecting the function of the blockchain.Through the description and research of the transaction information in the blockchain distributed ledger,the historical redundant transaction information is defined,and it is demonstrated that the redundant transaction information can be pruned without affecting the transaction of the blockchain distributed ledger under certain conditions.Function,simple payment verification function,generating UTXO set function.2.Based on the definition of historical redundant transaction information,a method BPM is proposed to reduce the storage of node blockchain information by pruning historical redundant information.The innovation of the BPM method is to propose static compression and delete redundant transaction information on the basis of the RDS method so that the pruning results of each node in the network remain the same;through the establishment of a mechanism,the nodes in the network reach a consensus on the pruning results,so that the nodes which pruned do not lose the ability to synchronize block information;by setting up a periodic pruning mechanism,the periodic pruning of blockchain information reduces the periodicity of the storage of blockchain information.3.Based on the BPM method,a method suitable for pruning the historical redundant information in the DAG blockchain is proposed.By analyzing the characteristics of the DAGtype blockchain and improving the BPM method in a targeted manner,the redundant transaction information in the DAG-type blockchain can be periodically pruned to reduce the node blockchain information storage.4.Through experiments,the pruning efficiency and characteristics of the BPM method are verified.Through a series of experiments,the pruning efficiency of the BPM method and the reduction of synchronization and verification time were verified,the factors affecting the pruning efficiency were analyzed,and the cutting effect on the DAG blockchain was analyzed.Finally,the pruning was compared with the previous method.Efficiency comparison and method characteristic analysis illustrate the superiority of BPM method.With the development of blockchain distributed ledgers,the growth rate of blockchain information will become faster and faster.The BPM method periodically prune the historical redundant transaction information in the blockchain,which can make the blockchain smaller The storage of information does not increase linearly,which effectively reduces the information storage requirements of nodes.