CN112600875B - Distributed electric quantity transaction blockchain storage method and device based on merck tree - Google Patents

Distributed electric quantity transaction blockchain storage method and device based on merck tree Download PDF

Info

Publication number
CN112600875B
CN112600875B CN202011339817.3A CN202011339817A CN112600875B CN 112600875 B CN112600875 B CN 112600875B CN 202011339817 A CN202011339817 A CN 202011339817A CN 112600875 B CN112600875 B CN 112600875B
Authority
CN
China
Prior art keywords
hash value
new
blockchain network
transaction
key element
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011339817.3A
Other languages
Chinese (zh)
Other versions
CN112600875A (en
Inventor
张圣楠
张显
嵇士杰
刘永辉
顾宇轩
陈启鑫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Power Exchange Center Co ltd
Tsinghua University
Original Assignee
Beijing Power Exchange Center Co ltd
Tsinghua University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Power Exchange Center Co ltd, Tsinghua University filed Critical Beijing Power Exchange Center Co ltd
Priority to CN202011339817.3A priority Critical patent/CN112600875B/en
Publication of CN112600875A publication Critical patent/CN112600875A/en
Application granted granted Critical
Publication of CN112600875B publication Critical patent/CN112600875B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Electricity, gas or water supply
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Abstract

The application provides a distributed electric quantity transaction blockchain storage method and device based on a merck tree, and relates to the technical field of blockchains, wherein the method comprises the following steps: extracting key element fields from the acquired transaction information; establishing a Merker tree according to the key element field, and calculating a first hash value of a tree root; broadcasting key element fields and first hash values in a block chain network at the same time, updating the first hash values into blocks after forming consensus, and storing transaction information by a master node locally; establishing a new merck tree according to the actual delivery information and the transaction information, and calculating a second hash value of the new tree root; broadcasting the new key element field and the second hash value simultaneously in the blockchain network; after forming the consensus, the second hash value is updated into the block, and the master node locally stores the actual delivery information. Therefore, the storage technology based on the merck tree reduces the scale of the uplink data, and reduces the complexity of information storage and updating in the matching, settlement and checking stages of transactions on the premise of ensuring the safety and traceability.

Description

Distributed electric quantity transaction blockchain storage method and device based on merck tree
Technical Field
The present disclosure relates to the field of blockchain applications in distributed power transactions, and in particular, to a method and apparatus for storing a blockchain for distributed power transactions based on a merck tree.
Background
In recent years, with the increasing ratio of various distributed power generation resources and energy storage resources on the distribution network side, users at the end of a power grid are changing from single energy consumers into flexible bodies integrating energy production and marketing roles, thereby bringing urgent demands for peer-to-peer distributed electric quantity transaction. Through distributed power transactions at point-to-point, energy-rich users can obtain economic benefits by selling energy to energy-lean users, who can then obtain energy at a lower cost. Because both parties to the point-to-point transaction are usually under the same distribution network, the overall energy transportation cost and loss are also greatly reduced. Point-to-point distributed power transactions have also presented new challenges while releasing social benefits. As the application of blockchain technology in various transaction scenarios continues to emerge, the significance of blockchain technology to point-to-point distributed power transactions is also being widely recognized.
Compared with the traditional centralized transaction platform, the transaction platform based on the blockchain has the following advantages: firstly, the block chain is not tamperable, transaction data is stored, and supervision and check are facilitated; secondly, the transaction process is automatically executed by utilizing the intelligent contract of the blockchain, so that the efficiency is improved; thirdly, the common mechanism of the block chain is utilized to realize the uplink, namely settlement, and the settlement cost is reduced.
Currently, using blockchain technology for point-to-point distributed power transactions has become a hotspot for industry research. Studies have shown that the block chain technology applied to point-to-point distributed electric quantity transaction can fully exert the advantages of the block chain technology, and solve the problem that the traditional centralized transaction platform cannot solve.
However, because the number of power users is huge and the behavior is unpredictable, the point-to-point distributed electric quantity transaction has the characteristics of mass, high frequency, randomness, uncertain actual delivery conditions and the like. The blockchain needs to store each transaction information, so that high requirements are put on the storage capacity of nodes in the blockchain network, and the running cost of the system is increased. In addition, the agreement reached by the distributed electric quantity transaction often generates various deviations due to the physical characteristics of the power grid when the agreement is executed, so that the actual delivery result is inconsistent with the agreement result, which means that each transaction needs to be recorded again in the settlement stage, and the result is updated. The two factors are overlapped, so that the data storage pressure of the blockchain network in a distributed electric quantity transaction scene is greatly improved.
Disclosure of Invention
The present application aims to solve, at least to some extent, one of the technical problems in the related art.
Therefore, the first objective of the present application is to provide a merck tree-based distributed electric quantity transaction blockchain storage method, which considers the characteristics of mass, high frequency, high default rate, insufficient terminal computing power and the like of point-to-point distributed electric quantity transaction, reduces the scale of uplink data through a merck tree-based storage technology, reduces the complexity of matching, settlement and checking stage information storage and updating of transactions on the premise of ensuring safety and traceability, improves the operation efficiency and the light weight degree of a blockchain network, and improves the market efficiency. The method can effectively use the blockchain technology for point-to-point distributed electric quantity transaction, and solves the problems of huge data storage burden and redundant blocks caused to nodes during point-to-point distributed electric quantity transaction.
A second object of the present application is to propose a distributed power transaction blockchain storage device based on the merck tree.
To achieve the above object, an embodiment of a first aspect of the present application provides a distributed electric quantity transaction blockchain storage method based on a merck tree, including:
in the transaction reporting stage, any node of a blockchain network acquires transaction information and extracts key element fields from the transaction information;
Establishing a merck tree according to the key element field, and calculating a first hash value of the root of the merck tree;
the key element field and the first hash value are broadcast by any node in the blockchain network at the same time;
after all nodes in the blockchain network form a consensus, updating the first hash value into the blockchain network, and storing the transaction information locally by a master node in the blockchain network;
in a transaction settlement stage, any node of the blockchain network acquires actual delivery information, the first hash value and the transaction information; extracting new key element fields from the actual delivery information, the first hash value, and the transaction information;
establishing a new merck tree according to the new key element field, and calculating a second hash value of the new merck tree root;
broadcasting the new key element field and a second hash value simultaneously in the blockchain network;
after all nodes in the blockchain network form a consensus, updating the second hash value into the blockchain network, and storing the actual delivery information locally by a master node in the blockchain network.
According to the merck tree-based distributed electric quantity transaction blockchain storage method, transaction information is acquired by any node of a blockchain network in a transaction reporting stage, key element fields are extracted from the transaction information, a merck tree is built according to the key element fields, and a first hash value of a merck tree root is calculated; any node broadcasts a key element field and the first hash value in a blockchain network at the same time; after forming a consensus among all nodes in the blockchain network, updating a first hash value into the blockchain network, and storing transaction information locally by a master node in the blockchain network; any node of the blockchain network acquires actual delivery information, a first hash value and the transaction information; extracting new key element fields from the actual delivery information, the first hash value and the transaction information; establishing a new merck tree according to the new key element field, and calculating a second hash value of the root of the new merck tree; broadcasting the new key element field and the second hash value simultaneously in the blockchain network; after all nodes in the blockchain network form a consensus, the second hash value is updated into the blockchain network, and the master node in the blockchain network stores the actual delivery information locally. Therefore, the characteristics of mass, high frequency, high default rate, insufficient terminal computing power and the like of the point-to-point distributed electric quantity exchange are considered, the scale of uplink data is reduced through the memory technology based on the merck tree, the complexity of information storage and updating in the matching, settlement and checking stages of the exchange is reduced on the premise of ensuring the safety and traceability, and the market efficiency is improved. The method can effectively use the blockchain technology for the distributed electric quantity transaction of the point-to-point.
In one embodiment of the present application, building a merck tree from the key element fields includes:
converting the key element fields into a plurality of character strings formed by letters and numbers;
and building the merck tree according to the character strings.
In one embodiment of the present application, the calculating the first hash value of the merck tree root includes:
respectively calculating hash values of each character string to obtain a plurality of hash values;
and performing packet splicing on the hash values, and then calculating the hash value until a target hash value is obtained as a first hash value of the Merker tree root.
In one embodiment of the present application, the building a new merck tree according to the new key element field includes:
converting the new key element fields into a plurality of new character strings composed of letters and numbers;
and establishing the new merck tree according to the plurality of new character strings.
In one embodiment of the present application, the calculating the second hash value of the new merck tree root includes:
respectively calculating hash values of each new character string to obtain a plurality of new hash values;
and performing packet splicing on the plurality of new hash values, and then calculating a new hash value until a target new hash value is obtained and used as a second hash value of the new merck tree root.
To achieve the above object, in a second aspect of the present invention, there is provided a distributed power transaction blockchain storage device based on a merck tree, including:
the first acquisition and extraction module is used for acquiring transaction information from any node of the blockchain network in a transaction reporting stage and extracting key element fields from the transaction information;
the first building module is used for building a merck tree according to the key element field;
the first calculation module is used for calculating a first hash value of the merck tree root;
a first broadcasting module, configured to broadcast the key element field and the first hash value in the blockchain network at the same time by the any node;
a first storage module, configured to update the first hash value into the blockchain network after all nodes in the blockchain network form a consensus, and a master node in the blockchain network stores the transaction information locally;
the second acquisition and extraction module is used for acquiring actual delivery information, the first hash value and the transaction information by any node of the blockchain network in a transaction settlement stage; extracting new key element fields from the actual delivery information, the first hash value, and the transaction information;
The second building module is used for building a new merck tree according to the new key element field;
a second calculation module, configured to calculate a second hash value of the new merck tree root;
a second broadcasting module for broadcasting the new key element field and a second hash value simultaneously in the blockchain network;
and the second storage module is used for updating the second hash value into the blockchain network after all nodes in the blockchain network form a consensus, and the master node in the blockchain network stores the actual delivery information locally.
According to the distributed electric quantity transaction blockchain storage device based on the merck tree, transaction information is obtained by any node of a blockchain network in a transaction reporting stage, key element fields are extracted from the transaction information, the merck tree is built according to the key element fields, and a first hash value of the root of the merck tree is calculated; any node broadcasts a key element field and the first hash value in a blockchain network at the same time; after forming a consensus among all nodes in the blockchain network, updating a first hash value into the blockchain network, and storing transaction information locally by a master node in the blockchain network; any node of the blockchain network acquires actual delivery information, a first hash value and the transaction information; extracting new key element fields from the actual delivery information, the first hash value and the transaction information; establishing a new merck tree according to the new key element field, and calculating a second hash value of the root of the new merck tree; broadcasting the new key element field and the second hash value simultaneously in the blockchain network; after all nodes in the blockchain network form a consensus, the second hash value is updated into the blockchain network, and the master node in the blockchain network stores the actual delivery information locally. Therefore, the characteristics of mass, high frequency, high default rate, insufficient terminal computing power and the like of the point-to-point distributed electric quantity exchange are considered, the scale of uplink data is reduced through the memory technology based on the merck tree, the complexity of information storage and updating in the matching, settlement and checking stages of the exchange is reduced on the premise of ensuring the safety and traceability, and the market efficiency is improved. The method can effectively use the blockchain technology for the distributed electric quantity transaction of the point-to-point.
In one embodiment of the present application, the first establishing module is specifically configured to:
converting the key element fields into a plurality of character strings formed by letters and numbers;
and building the merck tree according to the character strings.
In one embodiment of the present application, the first computing module is specifically configured to:
respectively calculating hash values of each character string to obtain a plurality of hash values;
and performing packet splicing on the hash values, and then calculating the hash value until a target hash value is obtained as a first hash value of the Merker tree root.
In one embodiment of the present application, the second establishing module is specifically configured to:
converting the new key element fields into a plurality of new character strings composed of letters and numbers;
and establishing the new merck tree according to the plurality of new character strings.
In one embodiment of the present application, the second computing module is specifically configured to:
respectively calculating hash values of each new character string to obtain a plurality of new hash values;
and performing packet splicing on the plurality of new hash values, and then calculating a new hash value until a target new hash value is obtained and used as a second hash value of the new merck tree root.
Additional aspects and advantages of the application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the application.
Drawings
The foregoing and/or additional aspects and advantages of the present application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings, in which:
fig. 1 is a flowchart of a distributed power transaction blockchain storage method based on a merck tree according to an embodiment of the present disclosure;
FIG. 2 is an exemplary diagram of a distributed Merck tree-based power transaction blockchain store provided in accordance with an embodiment of the present application;
fig. 3 is a schematic structural diagram of a distributed power transaction blockchain storage device based on a merck tree according to an embodiment of the present application.
Detailed Description
Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary and intended for the purpose of explaining the present application and are not to be construed as limiting the present application.
The following describes a method and an apparatus for storing a distributed electric quantity transaction blockchain based on a merck tree according to an embodiment of the present application with reference to the accompanying drawings.
For the description of the background art, in order to make the blockchain technology better applied to the distributed electric quantity transaction of point-to-point, the storage technology of transaction data needs to be designed, and the storage efficiency is improved on the premise of ensuring traceability and non-tamper property.
The merck tree in the embodiment of the present application is a data structure of a binary tree, and is composed of a set of leaf nodes, a set of intermediate nodes and a root node. The leaf nodes are hash values obtained after hash operation is carried out on basic data, after the hash values of two adjacent leaf nodes are combined into a character string, the hash of the character string is calculated, namely, the middle node of one layer on the two leaf nodes is obtained, and the root node is finally obtained, so that the special structure of the merck tree determines that the hash value of the root node is changed as long as the data of any leaf node is tampered.
The hash value in the embodiments of the present application is a digital digest technique that maps any string of strings or other types of data to an integer of fixed length through a hash function (also known as a hash function). The method is characterized in that firstly, hash values corresponding to two character strings with only slight differences are completely different; second, the content of the original text cannot be inversely pushed by the hash value. These two characteristics determine whether the two strings are identical by comparing the hash values of the two strings, and the inconsistency in the two strings cannot be modified by the comparison of the hash values.
Aiming at the problems of huge data storage burden and redundant blocks caused to nodes when the block chain technology is directly used for point-to-point distributed electric quantity transaction, the distributed electric quantity transaction block chain storage method based on the merck tree in the embodiment of the application improves the operation efficiency and the light weight degree of a block chain network.
More specifically, according to the characteristics of the distributed electric quantity transaction, the transaction period is divided into two stages of transaction reporting and transaction settlement. And extracting key element information of transaction data generated in two stages, and converting the key element information into a character string format. And constructing a Merck tree based on the key element information, and compressing the complete transaction information into a hash character string with a fixed length through the data structure of the Merck tree and the property of a hash function. The block chain network only stores the hash character string, the complete transaction information is stored in the local of a master node in the block chain network, when other nodes need to acquire the complete transaction information, the data is only required to be requested to the master node, and whether the transaction data is real or not can be checked through verifying the hash character string stored on the chain.
Fig. 1 is a flowchart of a distributed power transaction blockchain storage method based on a merck tree according to an embodiment of the present application.
As shown in fig. 1, the merck tree-based distributed power transaction blockchain storage method includes the following steps:
step 101, in the transaction reporting stage, any node of the blockchain network acquires transaction information and extracts key element fields from the transaction information.
In the embodiment of the application, in the transaction reporting stage, the transaction parties submit complete transaction information to nodes in the blockchain network in a text form, so that any node in the blockchain network acquires the transaction information.
In the embodiment of the present application, key element fields are extracted from transaction information, for example, 6 key element fields are extracted from transaction information, and correspond to: "buyer", "seller", "time to delivery", "transaction amount", "transaction price", "transaction time".
Step 102, establishing a merck tree according to the key element field, and calculating a first hash value of the root of the merck tree, wherein any node broadcasts the key element field and the first hash value in the blockchain network at the same time.
Step 103, after all nodes in the blockchain network form a consensus, updating the first hash value into the blockchain network, and storing transaction information locally by a master node in the blockchain network.
In the embodiment of the application, the key element field is converted into a plurality of character strings composed of letters and numbers, a merck tree is established according to the plurality of character strings, hash values of each character string are calculated respectively, a plurality of hash values are obtained, the hash values are calculated after the plurality of hash values are spliced in groups, and the hash values are obtained until a target hash value is obtained as a first hash value of the merck tree root.
In the embodiment of the present application, taking the above key element fields as an example, the merck tree is built based on 6 strings of "buyer", "seller", "proposed delivery time", "transaction electricity", "transaction price" and "transaction time", and the specific process is as follows: calculating hash values of 6 character strings, and recording the hash value of the 'buyer' character string as x 1 The hash value of the "vendor" string is x 2 The hash value of the "quasi-delivery time" string is x 3 The hash value of the transaction electric quantity character string is x 4 The hash value of the "trade price" string is x 5 The hash value of the "transaction time" string is x 6 The method comprises the steps of carrying out a first treatment on the surface of the Will x 1 And x 2 、x 3 And x 4 、x 5 And x 6 After splicing, calculating a hash value, and recording as x 12 、x 34 、x 56 The method comprises the steps of carrying out a first treatment on the surface of the Will x 12 And x 34 After splicing, calculating a hash value, and recording as x 1234 The method comprises the steps of carrying out a first treatment on the surface of the Will x 1234 And x 56 After splicing, calculating a hash value, and recording as x 123456 The value is the first hash value of the merck root.
Further, the node broadcasts the first hash value x of the key element field and the merck tree root of 6 character strings in the blockchain network simultaneously 123456 After forming consensus, only the first hash value x of the tree root 123456 Updating the block, storing the complete transaction information locally, and not recording the block; first hash value x to be written into block 123456 And sending the data to both transaction parties for storage.
In the embodiment of the present application, the common mode is a common mode implementation of a blockchain, which is not described in detail herein.
Step 104, in the transaction settlement stage, any node of the blockchain network acquires actual delivery information, a first hash value and transaction information; new key element fields are extracted from the actual delivery information, the first hash value, and the transaction information.
In the embodiment of the application, the transaction both sides submit the first hash value of the merck tree root and complete actual delivery information, including the actual delivery power, delivery time and delivery price, to any node in the blockchain network.
Further, the node stores the complete transaction information in a local master node to request the complete transaction information, thus acquiring actual transaction information, a first hash value and transaction information, and extracting new key element fields from the actual transaction information, the first hash value and the transaction information.
Step 105, after the transaction information is checked according to the first hash value, a new merck tree is established according to the new key element field, and a second hash value of the root of the new merck tree is calculated, and the new key element field and the second hash value are broadcast in the blockchain network at the same time.
In the embodiment of the application, the new key element field is converted into a plurality of new character strings formed by letters and numbers, a new merck tree is established according to the plurality of new character strings, hash values of each new character string are calculated respectively, a plurality of new hash values are obtained, and after the plurality of new hash values are spliced in groups, the new hash values are calculated until a target new hash value is obtained as a second hash value of a tree root of the new merck tree.
Specifically, the obtained first hash value of the merck tree root of the complete transaction information is compared with the hash value submitted by both transaction parties, and if the hash value is consistent with the hash value, the verification is passed.
For example, the node extracts 6 fields from the obtained complete transaction information and the actual transaction information submitted by both transaction parties, which correspond to: "buyer", "seller", "actual delivery quantity", "delivery time", "delivery price", "merck formed in transaction reporting stage The first hash value of the mercer tree root converts 6 fields into a character string format consisting of letters and numbers only, wherein the character string corresponding to the hash value of the mercer tree root formed in the transaction reporting stage is x, namely, the character string corresponding to the hash value of the mercer tree root is the data of the buyer, the seller, the actual delivery electric quantity, the delivery time, the delivery price and the transaction reporting stage 123456 The Merck tree is built on the basis of 6 character strings, the process is the same as the above description, and the second hash value of the new Merck tree root is recorded as y 123456 。
Step 106, after all nodes in the blockchain network form a consensus, updating the second hash value into the blockchain network, and storing the actual delivery information locally by the master node in the blockchain network.
In the embodiment of the application, the node broadcasts 6 character strings in the blockchain network simultaneously, namely a new key element field and a second hash value y of a new merck tree root 123456 After forming consensus, only the second hash value y of the tree root is used 123456 Updating the block, wherein the master node complete delivery information is stored locally and is not recorded in the block; hash value y to be written into block 123456 And sending the data to both transaction parties for storage.
To further clarify the above process, reference is made to fig. 2 for illustration.
Specifically, as shown in fig. 2, 1) a transaction reporting stage, wherein both parties of a transaction submit complete transaction information to nodes in a blockchain network; the node extracts 6 fields from the complete transaction information, which correspond to the following key elements of ' buyer ', ' seller ', ' quasi-delivery time ', ' transaction electric quantity ', ' transaction price ', ' transaction time ', ' respectively; converting the 6 fields into a character string format consisting of letters and numbers only; building a merck tree based on the character strings, and calculating hash values of tree roots; the node broadcasts the hash value of the character string and the tree root in the block chain network at the same time, after forming consensus, the hash value of the tree root is updated into a block, the complete transaction information is not uplink, and the main node is stored locally; the specific process comprises the following steps:
1.1 The transaction parties submit the complete transaction information in text form to nodes in the blockchain network.
1.2 Node extracts 6 fields from the transaction information, corresponding to: "buyer", "seller", "time to delivery", "transaction amount", "transaction price", "transaction time".
1.3 1.2) converting 6 fields into a character string format consisting of letters and numbers only; the character strings corresponding to the "buyer" and the "seller" are the numbers of the two parties, the character string corresponding to the "quasi-delivery time" is formed by splicing the digital character strings corresponding to the start time and the end time of the electric quantity of the agreement (for example, 202010010800202010011000 represents that the quasi-delivery time is 2020, 10 months, 1, 8, 00 and 10, 00), the character string corresponding to the "transaction electric quantity" is a number in kilowatt-hour, the character string corresponding to the "transaction price" is a number in element, and the "transaction time" is a digital character string corresponding to the time when the agreement is achieved (for example, 202009300800 represents that the agreement is achieved in 2020, 9 months, 30, 8, 00).
1.4 A merck tree is built based on 6 strings in 1.3), as follows: calculating hash values of 6 character strings, and recording the hash value of the 'buyer' character string as x 1 The hash value of the "vendor" string is x 2 The hash value of the "quasi-delivery time" string is x 3 The hash value of the transaction electric quantity character string is x 4 The hash value of the "trade price" string is x 5 The hash value of the "transaction time" string is x 6 The method comprises the steps of carrying out a first treatment on the surface of the Will x 1 And x 2 、x 3 And x 4 、x 5 And x 6 After splicing, calculating a hash value, and recording as x 12 、x 34 、x 56 The method comprises the steps of carrying out a first treatment on the surface of the Will x 12 And x 34 After splicing, calculating a hash value, and recording as x 1234 The method comprises the steps of carrying out a first treatment on the surface of the Will x 1234 And x 56 After splicing, calculating a hash value, and recording as x 123456 The value is the hash value of the root of the merck tree.
1.5 Node simultaneously broadcasting the hash value x of 6 strings and the root of the merck tree in 1.3) in the blockchain network 123456 After forming consensus, only hash value x of tree root 123456 Updating the block.
1.6 The node stores the complete transaction information in 1.1) locally without writing into the block; hash value x to be written into block 123456 And sending the data to both transaction parties for storage.
2) In the transaction settlement stage, the transaction two parties submit the hash value of the Merker tree root in 1), the actual delivery electric quantity, the delivery time and the delivery price to nodes in the blockchain network; the node requests the complete transaction information stored locally from the master node according to the hash value of the Merker tree root; the node checks the complete transaction information; the node extracts 6 fields from the complete transaction information and the new information reported by both transaction parties, and the 6 fields correspond to the following key elements respectively: "buyer", "seller", "actual delivery power", "delivery time", "delivery price", "hash value of the merck tree root formed in the transaction reporting stage"; building a merck tree based on the 6 fields, and calculating a hash value of a tree root; the node broadcasts the 6 fields and the hash value of the tree root in the block chain network at the same time, after forming consensus, the hash value of the tree root is updated into the block, the original field is not uplink, and the original field is stored locally by the master node; the specific process comprises the following steps:
2.1 Settlement stage after the completion of the delivery, the transaction parties will 1.4) hash value x of the Merker tree root 123456 Complete delivery information, including actual delivery power, delivery time, and delivery price, is submitted to nodes in the blockchain network.
2.2 Node requests complete transaction information from the node storing the complete transaction information locally in 1.6).
2.3 Node calculates the hash value of the merck tree root of the complete transaction information obtained in 2.2) according to 1.2) and 1.4) steps, and x submitted by both transaction sides in 2.1) 123456 And comparing, and if the two types of data are consistent, verifying to pass.
2.4 The node extracts 6 fields from the complete transaction information obtained in 2.2) and the delivery information submitted by the two transaction parties in 2.1), and the fields correspond to each other respectively: "buyer", "seller", "actual delivery amount", "delivery time", "delivery price", "hash value of the merck tree root formed in the transaction reporting stage).
2.5 The conversion mode of the 'buyer', 'seller', 'actual delivery power', 'delivery time', 'delivery price' is the same as 1.3), and the character string corresponding to the 'hash value of the merck tree root formed in the transaction reporting stage' is x 123456 。
2.6 2.5) building a merck tree based on 6 strings of 2.5), the same procedure as 1.4), and recording the hash value of the new merck tree root as y 123456 。
2.7 Simultaneously broadcasting 6 strings in 2.5) and hash value y of the merck root in the blockchain network by the node 123456 After forming consensus, only hash value y of tree root 123456 Updating the block.
2.8 The node stores the complete delivery information in 2.1) locally without writing into the block; hash value y to be written into block 123456 And sending the data to both transaction parties for storage.
In summary, in the merck tree-based distributed electric quantity transaction blockchain storage method, in the transaction reporting stage, any node of the blockchain network acquires transaction information, extracts key element fields from the transaction information, establishes a merck tree according to the key element fields, and calculates a first hash value of a root of the merck tree; any node broadcasts a key element field and the first hash value in a blockchain network at the same time; after forming a consensus among all nodes in the blockchain network, updating a first hash value into the blockchain network, and storing transaction information locally by a master node in the blockchain network; any node of the blockchain network acquires actual delivery information, a first hash value and the transaction information; extracting new key element fields from the actual delivery information, the first hash value and the transaction information; establishing a new merck tree according to the new key element field, and calculating a second hash value of the root of the new merck tree; broadcasting the new key element field and the second hash value simultaneously in the blockchain network; after all nodes in the blockchain network form a consensus, the second hash value is updated into the blockchain network, and the master node in the blockchain network stores the actual delivery information locally. Therefore, the characteristics of mass, high frequency, high default rate, insufficient terminal computing power and the like of the point-to-point distributed electric quantity exchange are considered, the scale of uplink data is reduced through the memory technology based on the merck tree, the complexity of information storage and updating in the matching, settlement and checking stages of the exchange is reduced on the premise of ensuring the safety and traceability, and the market efficiency is improved. The method can effectively use the blockchain technology for the distributed electric quantity transaction of the point-to-point.
In order to implement the above embodiment, the present application further proposes a distributed power transaction blockchain storage device based on the merck tree.
Fig. 3 is a schematic structural diagram of a distributed power transaction blockchain storage device based on the merck tree according to an embodiment of the present application.
As shown in fig. 3, the merck tree-based distributed power transaction blockchain storage device includes: a first acquisition extraction module 301, a first setup module 302, a first calculation module 303, a first broadcast module 304, a first storage module 305, a second acquisition extraction module 306, a second setup module 307, a second calculation module 308, a second broadcast module 309, and a second storage module 310.
The first acquiring and extracting module 301 is configured to acquire transaction information from any node of the blockchain network and extract key element fields from the transaction information in a transaction reporting stage.
A first building module 302 is configured to build a merck tree according to the key element fields.
A first calculation module 303, configured to calculate a first hash value of the root of the merck tree.
A first broadcasting module 304, configured to broadcast the key element field and the first hash value simultaneously in the blockchain network by any node.
A first storage module 305, configured to update the first hash value into the blockchain network after all nodes in the blockchain network form a consensus, and a master node in the blockchain network stores the transaction information locally.
A second obtaining and extracting module 306, configured to obtain, at a transaction settlement stage, actual delivery information, the first hash value, and the transaction information by any node of the blockchain network; new key element fields are extracted from the actual delivery information, the first hash value, and the transaction information.
A second establishing module 307, configured to establish a new merck tree according to the new key element field after the transaction information is verified according to the first hash value.
A second calculation module 308 is configured to calculate a second hash value of the new merck tree root.
A second broadcasting module 309 is configured to broadcast the new key element field and the second hash value simultaneously in the blockchain network.
A second storage module 310, configured to update the second hash value into the blockchain network after all nodes in the blockchain network form a consensus, and store the actual delivery information locally by a master node in the blockchain network.
In one embodiment of the present application, the first establishing module 302 is specifically configured to: converting the key element fields into a plurality of character strings formed by letters and numbers; and building the merck tree according to the character strings.
In one embodiment of the present application, the first calculating module 303 is specifically configured to: respectively calculating hash values of each character string to obtain a plurality of hash values; and performing packet splicing on the hash values, and then calculating the hash value until a target hash value is obtained as a first hash value of the Merker tree root.
In one embodiment of the present application, the second establishing module 307 is specifically configured to: converting the new key element fields into a plurality of new character strings composed of letters and numbers; and establishing the new merck tree according to the plurality of new character strings.
In one embodiment of the present application, the second calculation module 308 is specifically configured to: respectively calculating hash values of each new character string to obtain a plurality of new hash values; and performing packet splicing on the plurality of new hash values, and then calculating a new hash value until a target new hash value is obtained and used as a second hash value of the new merck tree root.
According to the distributed electric quantity transaction blockchain storage device based on the merck tree, transaction information is obtained by any node of a blockchain network in a transaction reporting stage, key element fields are extracted from the transaction information, the merck tree is built according to the key element fields, and a first hash value of the root of the merck tree is calculated; any node broadcasts a key element field and the first hash value in a blockchain network at the same time; after forming a consensus among all nodes in the blockchain network, updating a first hash value into the blockchain network, and storing transaction information locally by a master node in the blockchain network; any node of the blockchain network acquires actual delivery information, a first hash value and the transaction information; extracting new key element fields from the actual delivery information, the first hash value and the transaction information; establishing a new merck tree according to the new key element field, and calculating a second hash value of the root of the new merck tree; broadcasting the new key element field and the second hash value simultaneously in the blockchain network; after all nodes in the blockchain network form a consensus, the second hash value is updated into the blockchain network, and the master node in the blockchain network stores the actual delivery information locally. Therefore, the characteristics of mass, high frequency, high default rate, insufficient terminal computing power and the like of the point-to-point distributed electric quantity exchange are considered, the scale of uplink data is reduced through the memory technology based on the merck tree, the complexity of information storage and updating in the matching, settlement and checking stages of the exchange is reduced on the premise of ensuring the safety and traceability, and the market efficiency is improved. The method can effectively use the blockchain technology for the distributed electric quantity transaction of the point-to-point.
It should be noted that the foregoing explanation of the embodiments of the merck tree-based distributed power transaction blockchain storage method is also applicable to the merck tree-based distributed power transaction blockchain storage device of the embodiments, and is not repeated herein.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present application, the meaning of "plurality" is at least two, such as two, three, etc., unless explicitly defined otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and additional implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present application.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
It is to be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. As with the other embodiments, if implemented in hardware, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like. Although embodiments of the present application have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the application, and that variations, modifications, alternatives, and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the application.

Claims (8)

1. The distributed electric quantity transaction blockchain storage method based on the merck tree is characterized by comprising the following steps of:
in a transaction reporting stage, any node of a blockchain network acquires transaction information, and extracts key element fields from the transaction information, wherein the transaction information is complete transaction information submitted to the nodes in the blockchain network in a text form by both transaction parties;
converting the key element field into a plurality of character strings formed by letters and numbers, and establishing a merck tree according to the character strings;
respectively calculating hash values of each character string to obtain a plurality of hash values, splicing the plurality of hash values, calculating the hash values, and taking the calculated spliced hash values as a first hash value of the merck tree root;
The key element field and the first hash value are broadcast by any node in the blockchain network at the same time;
after all nodes in the blockchain network form a consensus, updating the first hash value into the blockchain network, and storing the transaction information locally by a master node in the blockchain network;
in a transaction settlement stage, any node of the blockchain network acquires actual delivery information, the first hash value and the transaction information; extracting new key element fields from the actual delivery information, the first hash value, and the transaction information;
after the transaction information is checked according to the first hash value, a new merck tree is established according to the new key element field, and a second hash value of the root of the new merck tree is calculated;
broadcasting the new key element field and a second hash value simultaneously in the blockchain network;
after all nodes in the blockchain network form a consensus, updating the second hash value into the blockchain network, and storing the actual delivery information locally by a master node in the blockchain network.
2. The method of claim 1, wherein the post-splice hash value is determined using a packet splice calculation.
3. The method of claim 1, wherein the building a new merck tree from the new key element field comprises:
converting the new key element fields into a plurality of new character strings composed of letters and numbers;
and establishing the new merck tree according to the plurality of new character strings.
4. The method of claim 3, wherein the computing a second hash value of the new merck tree root comprises:
respectively calculating hash values of each new character string to obtain a plurality of new hash values;
and performing packet splicing on the plurality of new hash values, and then calculating a new hash value until a target new hash value is obtained and used as a second hash value of the new merck tree root.
5. A merck tree based distributed power transaction blockchain storage device, comprising the steps of:
the system comprises a first acquisition and extraction module, a second acquisition and extraction module and a processing module, wherein the first acquisition and extraction module is used for acquiring transaction information from any node of a blockchain network in a transaction reporting stage and extracting key element fields from the transaction information, wherein the transaction information is complete transaction information submitted to the node in the blockchain network by both transaction parties in a text form;
The first building module is used for converting the key element fields into a plurality of character strings formed by letters and numbers, and building a merck tree according to the character strings;
the first calculation module is used for respectively calculating the hash value of each character string to obtain a plurality of hash values, calculating the hash value after the hash values are spliced, and taking the spliced hash value obtained by calculation as a first hash value of the merck tree root;
a first broadcasting module, configured to broadcast the key element field and the first hash value in the blockchain network at the same time by the any node;
a first storage module, configured to update the first hash value into the blockchain network after all nodes in the blockchain network form a consensus, and a master node in the blockchain network stores the transaction information locally;
the second acquisition and extraction module is used for acquiring actual delivery information, the first hash value and the transaction information by any node of the blockchain network in a transaction settlement stage; extracting new key element fields from the actual delivery information, the first hash value, and the transaction information;
The second establishing module is used for establishing a new merck tree according to the new key element field after the transaction information is verified according to the first hash value;
a second calculation module, configured to calculate a second hash value of the new merck tree root;
a second broadcasting module for broadcasting the new key element field and a second hash value simultaneously in the blockchain network;
and the second storage module is used for updating the second hash value into the blockchain network after all nodes in the blockchain network form a consensus, and the master node in the blockchain network stores the actual delivery information locally.
6. The apparatus of claim 5, wherein the first computing module is specifically configured to: and determining the hash value after splicing by adopting a packet splicing calculation mode.
7. The apparatus of claim 5, wherein the second setup module is specifically configured to:
converting the new key element fields into a plurality of new character strings composed of letters and numbers;
and establishing the new merck tree according to the plurality of new character strings.
8. The apparatus of claim 7, wherein the second computing module is specifically configured to:
Respectively calculating hash values of each new character string to obtain a plurality of new hash values;
and performing packet splicing on the plurality of new hash values, and then calculating a new hash value until a target new hash value is obtained and used as a second hash value of the new merck tree root.
CN202011339817.3A 2020-11-25 2020-11-25 Distributed electric quantity transaction blockchain storage method and device based on merck tree Active CN112600875B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011339817.3A CN112600875B (en) 2020-11-25 2020-11-25 Distributed electric quantity transaction blockchain storage method and device based on merck tree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011339817.3A CN112600875B (en) 2020-11-25 2020-11-25 Distributed electric quantity transaction blockchain storage method and device based on merck tree

Publications (2)

Publication Number Publication Date
CN112600875A CN112600875A (en) 2021-04-02
CN112600875B true CN112600875B (en) 2023-06-30

Family

ID=75184040

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011339817.3A Active CN112600875B (en) 2020-11-25 2020-11-25 Distributed electric quantity transaction blockchain storage method and device based on merck tree

Country Status (1)

Country Link
CN (1) CN112600875B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113177227A (en) * 2021-04-26 2021-07-27 中国联合网络通信集团有限公司 Information verification method and device based on block chain
CN114401091B (en) * 2021-12-16 2023-10-24 北京航空航天大学 Device cross-domain authentication management method and device based on block chain
CN114860730A (en) * 2022-05-17 2022-08-05 北京新五好农业科技有限公司 Land data storage method, system and storage medium based on block chain
CN114881654B (en) * 2022-05-18 2023-04-11 天津大学 Efficient block chain transaction query technology based on radix estimation method
CN115378715A (en) * 2022-08-24 2022-11-22 河北中废通网络技术有限公司 Block chain-based chain type information encryption transmission method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019078623A1 (en) * 2017-10-17 2019-04-25 주식회사 코인플러그 Blockchain-based payment method, and payment server using same
CN110175840A (en) * 2019-04-19 2019-08-27 华中科技大学 Method, client, alliance's chain and the system of light wallet mechanism are realized in alliance's chain
CN111915301A (en) * 2020-08-05 2020-11-10 腾讯科技（深圳）有限公司 Data processing method and device based on block chain, electronic equipment and readable medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019078623A1 (en) * 2017-10-17 2019-04-25 주식회사 코인플러그 Blockchain-based payment method, and payment server using same
CN110175840A (en) * 2019-04-19 2019-08-27 华中科技大学 Method, client, alliance's chain and the system of light wallet mechanism are realized in alliance's chain
CN111915301A (en) * 2020-08-05 2020-11-10 腾讯科技（深圳）有限公司 Data processing method and device based on block chain, electronic equipment and readable medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于完整性的区块链电子存证方法研究;李振汕;《计算机时代》;20191213;第1-4页 *

Also Published As

Publication number Publication date
CN112600875A (en) 2021-04-02

Similar Documents

Publication Publication Date Title
CN112600875B (en) Distributed electric quantity transaction blockchain storage method and device based on merck tree
CN109033422B (en) Method and device for generating block chain and block chain
CN112270550A (en) New energy electric power source tracing method and system based on block chain
CN111949395A (en) Block chain-based shared computing power data processing method, system and storage medium
CN108038184A (en) A kind of date storage method and system based on block chain, a kind of intelligent block chain
CN110958109A (en) Light dynamic data integrity auditing method based on hierarchical Mercker Hash tree
Lumbreras et al. Large‐scale transmission expansion planning: from zonal results to a nodal expansion plan
CN111640018B (en) Block chain transaction existence verification method and device
CN109194444A (en) A kind of balanced binary tree restorative procedure based on network topology
CN110598007B (en) Bill file processing method, device, medium and electronic equipment
CN114781007A (en) Tree-based document batch signature and signature verification method and system
CN113362068B (en) Method for verifying block chain state transfer by light node
CN109685657B (en) Method and node device for processing transactions in a blockchain network and storage medium
CN114066456A (en) ERC 1155-based cross-chain NFT transfer and settlement system
CN113326500B (en) Information verification method combining edge computing and cloud edge fusion and central cloud platform
CN115085947B (en) Data security inspection method and system in digital twin
CN110704372B (en) Data recovery method and device
CN110099117B (en) Method and device for issuing full amount of multi-version DNS zone files
CN113810185A (en) Anti-trapdoor leakage on-chain data restoration system and method
CN113688418A (en) Engineering order settlement method and system based on block chain data storage
CN111506916A (en) Construction project electronic file evidence storage method and system based on block chain technology
CN113541973B (en) Electronic signature packaging method
CN110414975A (en) User management method, device, equipment and storage medium
CN112738801B (en) Management method suitable for intelligent communication gateway
WO2022088184A1 (en) Data storage method, electronic device and computer-readable storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant