Optimization Of Efficient Transaction Verification Storage Structure Based On Blockchain

Blockchain technology is one of the most popular research fields in recent years.This technology can provide a new security solution for data transmission and storage in a trustless environment.The transaction is the most important part of the blockchain system.The blockchain system needs to ensure that the stored transaction is not tampered with,so the generated transactions need to be verified during the process of generating a new block.With the development of blockchain technology,transactions continue to increase in the blockchain system,resulting in increasing pressure for nodes to verify in the blockchain network.The Merkle tree storage structure is designed for the verification of the transaction,which can ensure data integrity and security,and is mainly used to maintain data in large databases.In some real scenarios,only a few important transactions will be frequently verified,and the verification cost of all transactions is the same.To solve this problem,this dissertation seeks new solutions from the storage structure of the transaction in the blockchain system.This dissertation studies the lightweight verification mechanism for transactions and proposes a new Merkle tree storage structure to achieve efficient verification of transactions.In the blockchain system,most network devices are constrained by resources.They do not have enough computing resources to withstand the large amount of data transmission over the network.In the application field supported by the trusted blockchain,this method can improve the efficiency of data transmission and verify transactions of distributed network equipment.The main contributions of this dissertation are listed as follows:(1)This dissertation gives a general introduction to the application of blockchain technology in various fields,analyzes the composition and transaction principles of the blockchain,and establishes a model for verification of blockchain transaction information.We analyze to verify the transaction by different Merkle tree and analyze the using scenarios of Merkle tree and the feasibility of the scheme in this work.(2)In this dissertation,an improved Merkle tree is proposed to achieve rapidly verify the transaction.It will speed up the generation of new blocks and achieve the purpose of maintaining the stability of the blockchain.The scheme is based on the traditional Merkle tree.The important transaction can be stored in the top node of the Merkle tree to improve the efficiency of verification and reduce unnecessary resources to consume.(3)This dissertation proposes an imbalanced tree transaction information verification method based on the improved Merkle tree.The proposed high-efficiency transaction verification scheme was experimentally verified,and experimental data of different Merkle tree were compared.The experiment shows that the efficiently verify transaction scheme proposed in this work can reduce the transmitted hash codes in the blockchain system,the hash computations and the verification time to a certain extent,and achieve the purpose of improving the efficiently verify the transaction of the blockchain system.