Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Data compression method and system for account tree of MPT structure

A technology of data compression and account tree, which is applied in digital transmission systems, transmission systems, data processing applications, etc., can solve the problems of large computing pressure and time cost of nodes, and achieve the reduction of memory and storage space overhead, small storage space, The effect of reducing overhead

Active Publication Date: 2021-03-16
上海简苏网络科技有限公司
View PDF10 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This will cause the account data to have to be repeatedly migrated and replaced in the memory and hard disk when the blockchain executes transactions, which will bring huge computing pressure and time costs to the nodes.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data compression method and system for account tree of MPT structure
  • Data compression method and system for account tree of MPT structure
  • Data compression method and system for account tree of MPT structure

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0050] Such as figure 1 As shown, this embodiment provides a data compression method for an account tree with an MPT structure, including the following steps:

[0051] S1: Create an account address for the user node according to the account address creation request initiated by the user node.

[0052] Specifically, when a user node needs to participate in blockchain transactions, it first needs to use the public key in the pre-created public-private key pair to initiate an address creation request to the chain node used to create the account address. When the chain node receives the request to create an account address initiated by the user node, it creates an account address for the user node according to the preset creation rules and returns it to the user node. At the same time, a node on the account tree using the MPT structure represents the current Create the user node corresponding to the account address, so that the user node can participate in the blockchain transact...

no. 2 example

[0078] This embodiment provides a specific embodiment of executing blockchain transactions according to the account tree of the MPT structure created in the first embodiment, specifically:

[0079] Firstly, the account address involved in the blockchain transaction is obtained, and the address brevity is reversely intercepted according to the preset splicing algorithm. Wherein, the preset splicing algorithm is the algorithm for splicing the preliminary address and the address simple code in the first embodiment. In this step, the process of splicing is opposite, and the address simple code is reversely intercepted.

[0080] Secondly, obtain the valid digits of the address brevity code as the key value. Specifically, because only valid digits are stored in the account tree, and the address shortcode is a fixed-length address, it is necessary to obtain the valid digits in the address shortcode before searching through the key value.

[0081] Finally, perform operations on the a...

no. 3 example

[0083] Such as image 3 As shown, this embodiment provides a chain node 1, including:

[0084] The address brevity code creation module 11 is used for creating the account address request initiated by the user node, after creating the account address for the user node, obtaining the creation serial number of the created account address, and preprocessing the creation serial number to form the The fixed-length address brevity code corresponding to the user node;

[0085] The account tree construction module 12 is used to obtain the effective bits of the address simplification, and use the effective bits to construct an account tree with an MPT structure.

[0086] The transaction execution module 13 is configured to execute the blockchain transaction according to the constructed account tree of the MPT structure, specifically: obtain the account address involved in the blockchain transaction, and reverse intercept according to the preset splicing algorithm Output the address b...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to the technical field of block chains, and provides a data compression method and system for an account tree of an MPT structure, and the method comprises the steps: building anaccount address for a user node according to an account address building request initiated by the user node; obtaining a creation serial number of the created account address, and forming a fixed-length address brief code corresponding to the user node after preprocessing the creation serial number; and obtaining a significant bit of the address brief code, and constructing an account tree of anMPT structure by using the significant bit. According to the method, the account tree of the MPT structure is compressed, and the intermediate node of the account tree is fully utilized, so that the account is also stored on the intermediate node, the waste of resources is avoided, and the storage space of the account tree is reduced. And meanwhile, the storage space of the account tree is reduced, so that the account tree can reside in the memory, repeated migration and replacement of the account data in the memory and the hard disk are avoided, and the calculation pressure and time cost of the blockchain during transaction execution are reduced.

Description

technical field [0001] The present invention relates to the technical field of blockchain, in particular to the technical field of account tree optimization, and in particular to a data compression method and system for an MPT-structured account tree. Background technique [0002] The MPT tree is the most commonly used data structure for organizing account access in blockchains using the account model. This structure has both Merkel properties and Patricia trie properties. The Merkle attribute means that each node on the tree records the summed hashes of all its child nodes. The Patricia attribute is a compressed dictionary tree attribute. The dictionary attribute refers to the key value of a node, which is its path on the tree. The process of comparing the key value is the process of addressing on the tree. This structure makes the account tree particularly sensitive to data changes, and can quickly compare whether the two trees are identical and quickly find the differen...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08H04L29/06G06Q40/04
CPCH04L67/1097H04L69/04G06Q40/04H04L9/50
Inventor 丁有振王顺利欧阳希陈博
Owner 上海简苏网络科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products