An Efficient Data Reduction Method for DAG Blockchain

Compared with the traditional blockchain, the blockchain system based on directed acyclic graph (DAG) has higher throughput and greater storage pressure, and there is also redundancy of transaction data in the block, which is caused by concurrent block sending, that is, the same transaction may appear in different blocks, and different blocks are attached to the DAG at the same time, which aggravates the storage pressure. In this paper, to solve the above problems, we propose a method that can reduce data twice. The first data reduction is aimed at the redundancy in the block, which is in the blockchain system based on DAG. And the second data reduction is based on the user's experience and the first basis. The experimental results show that the proposed method can save 92.18% of the storage space and effectively alleviate the storage pressure.