CN114357081A - Block chain construction method of net structure - Google Patents
Block chain construction method of net structure Download PDFInfo
- Publication number
- CN114357081A CN114357081A CN202210004791.XA CN202210004791A CN114357081A CN 114357081 A CN114357081 A CN 114357081A CN 202210004791 A CN202210004791 A CN 202210004791A CN 114357081 A CN114357081 A CN 114357081A
- Authority
- CN
- China
- Prior art keywords
- block
- main
- slave
- master
- tag
- 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.)
- Pending
Links
Images
Classifications
-
- 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
- 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/21—Design, administration or maintenance of databases
- G06F16/211—Schema design and management
-
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
Abstract
The invention relates to a block chain construction method of a reticular structure, which comprises the following steps: constructing a block chain structure, wherein the block chain structure comprises a main block structure, a slave block structure and balanced binary tree nodes; creating a creation master block for representing an initialization node based on a master block structure, and when a node is added into the common identification node set, packaging basic information of the added node into a master block and linking the master block to the tail end of a main chain; establishing a balanced binary tree node through a plurality of main blocks to form a main block interval; and forming a slave block structure by packaging the N transactions, wherein the tag values of the slave block structure are used for collecting and storing the tag values of all nodes in the transactions, and the slave block is added into a corresponding side net to form a net structure. The block chain construction method of the mesh structure effectively solves the problem of low query efficiency of public chains, alliance chains and private chains.
Description
Technical Field
The present invention relates to the field of blockchain technology, and more particularly, to a method for constructing a blockchain with a mesh structure. The method can be applied to public chains, alliance chains and private chains, such as block chain-based electronic financial fund transfer systems, digital copyright management systems, talent management systems, electronic medical record systems and the like.
Background
Each block is composed of a block head and a block body. The block header includes information such as a block index, a time stamp, a hash value of a previous block, a hash value of a current block itself, and a root of a merkel tree. In the block, the information of the transaction is mainly stored. The hash value of the previous block, i.e., the digest information of the previous block, uniquely points to the previous block. If an attacker intends to maliciously tamper with a certain block, more than 51% of the common knowledge nodes must be mastered and this block and all blocks behind the block are modified, which greatly reduces the possibility of maliciously attacking and tampering the block chain, and embodies sufficient security and non-tamper-ability.
However, as blockchain technology evolves, the disadvantages of some blockchains gradually emerge. As more and more nodes participate in the consensus, the redundancy of the block chain becomes very large, and the time required to query and verify the block message increases linearly. The UTXO model proposed by the inventor can reduce the block search and verification time, but the UTXO model can only be applied to financial industries such as money transaction, and lacks scalability. Meanwhile, as new information is continuously linked, the information of the same thing is scattered all over the block chain, and messages are messy and are not easy to arrange into a big pain point of the block chain technology. Therefore, a new type of bottom architecture of the blockchain is needed to improve the query and verification speed of the blockchain and to improve the application scope of the blockchain.
Disclosure of Invention
The invention aims to provide a block chain bottom layer structure with a mesh structure, which solves the problems of poor expandability and low query transaction efficiency of the traditional block chain structure.
In order to achieve the purpose, the invention provides the following scheme:
a block chain construction method of a mesh structure comprises the following steps:
constructing a block chain structure, wherein the block chain structure comprises a main block structure, a slave block structure and balanced binary tree nodes, the main block structure comprises a block head and a block body, and the slave block structure comprises an index, a time stamp, a self index, a Merck tree root, a storage data attribute, a front block hash value set and a front block label set;
creating a created main block based on the main block structure, wherein the created main block is used for representing an initialization node, and when a new node is added into a common node set, packaging the basic information of the added new node into a main block and linking the main block to the tail end of a main chain;
establishing a balanced binary tree node through a plurality of main blocks to form a main block interval;
and forming the slave block structure by packaging N transactions, wherein the tag values of the slave block structure are used for collecting the tag values of all nodes in the stored transactions, and adding the slave block into the corresponding side net to form a net structure.
Preferably, the block header of the main block structure includes an index, a timestamp, a hash value of a previous main block, a self hash value, attributes of a root node of the mercker tree storing the transaction digest, and a tag attribute for identifying the current main block.
Preferably, the hash value of the preceding one of the master chunks uniquely refers to its own hash value of the preceding master chunk, which master chunks form a master chain in succession with the master chunks, wherein it is provided that the tag value of one master chunk is greater than its predecessor tag value and less than its successor tag value.
Preferably, the foundational block does not contain any transaction information, and the tag value in the foundational block can be created according to the creation time or by utilizing the height of the foundational block, so as to ensure that the tag value is the minimum value in all the main block tag values.
Preferably, when a new common node participates in common identification, the basic information of the new node is packaged into a main block, the other common nodes verify the validity of the new node, if the verification is passed, the main block is linked to the tail end of the main chain, and if the verification fails, the uplink is rejected.
Preferably, the content for verification includes: whether the hash value of the previous main block of the main block only points to the self hash value of the previous main block and whether the label value of the main block is larger than the precursor label value of the main block.
Preferably, one balanced binary tree node is dynamically established by every three main blocks, so that every three main blocks form a main block interval, and if the main block interval is less than three main blocks, a balanced binary tree node is established according to the newly established main block in the main block interval.
Preferably, the balanced binary tree node is configured to store a tag value of a latest main block in the main block interval as an index of a block chain, and store a hash value of the main block.
Preferably, the slave block structure is formed by packaging N transactions, and the tag value set of the slave block is used for storing the tag values of all the common nodes in the transactions, wherein the tag value set of the front block hash set stores the tag value corresponding to the latest block self hash value, the other nodes verify the validity of the slave block structure, and if the verification is passed, the slave block is added to the corresponding side net.
Preferably, the verification content of the other node verifying the validity of the slave block structure includes: whether a tag in the slave chunk tag value set corresponds to transaction information, whether a master chunk corresponding to a tag in the slave chunk tag set already exists in the master chain, and whether a hash value in the front chunk hash set correctly points to the front chunk.
Compared with the prior art, the invention has the beneficial effects that:
the block chain construction method of the mesh structure effectively solves the problem of low query efficiency of public chains or private chains and the like. The balanced binary tree is established by utilizing the label attribute of the main block, which interval the main block is positioned in the main chain can be quickly inquired, and the problem of low searching efficiency of the traditional block chain is solved. The slave blocks are linked with the master blocks, and the slave blocks are linked with the slave blocks to form a directed graph, so that stronger connection is generated between the blocks. The content of the consensus node needing to be updated is stored in the slave block, and the problem that node information is too dispersed and is not easy to arrange is solved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
FIG. 1 is a schematic flow chart of a method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a main block structure according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a backbone structure according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a slave block structure according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a side net structure according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
Referring to fig. 1-5, the present invention discloses a method for constructing a blockchain of a mesh structure, which changes a conventional chain structure into a structure of a mesh structure. The invention comprises three structures, namely a main block structure, a slave block structure and a balanced binary tree structure, wherein the main block and the slave block are collectively called as a block. The main block and the main block are linked to form a main chain, and the auxiliary block and the blocks are linked to form a side net.
The main block structure is shown in fig. 2, and includes two parts, namely a block head and a block body, similar to the block structure in the conventional block chain. The block header contains attributes such as an index, a timestamp, a hash value of a previous main block, a self hash value, a root node of a Mercker tree storing the transaction digest, and the like. In contrast, the main block additionally includes a tag attribute for identifying the current main block. The hash value of the previous main block in the main blocks only refers to the self hash value of the previous main block, and the main blocks are sequentially connected to form a main chain. It is specified that the tag value of a master block must be greater than its predecessor and less than its successor. The block body contains information to be stored, and the information is mainly related basic information of nodes in the common node set. The stored information is different for different application scenarios. If the method is applied to a private chain, such as a talent management system of a large-scale company, a main block stores basic information such as company department names, main functions of the departments and the like; if the method is applied to an electronic medical record system in a alliance chain, such as a medical chain, a hospital serves as a node, and basic information of the hospital, departments, doctors and the like is stored in a main block; if the method is applied to a public chain, such as a digital copyright management system, a copyright owner serves as a node, and basic information such as the name, sex, birth year and month, identification number and the like of the copyright owner is stored in the main block.
Because the tag values of the main blocks on the main chain are monotonically increased, in order to quickly find the information of the main blocks, a balanced binary tree node is established every three main blocks, the frame structure of the node is shown in fig. 3, and for convenience of presentation, attributes such as indexes, timestamps, merkel numbers, storage information and the like in the main blocks are omitted in the diagram. Each tree node uses the label value of the main block as a node index and stores the hash value of the corresponding main block. By using the balanced binary tree search, the interval corresponding to the main block to be searched can be quickly searched.
A slave block structure is designed as shown in fig. 4. The legacy chunk contains attributes such as index, timestamp, self-index, mercker tree root, stored data, etc., as well as a set of previous chunk hash values and a set of previous chunk labels. The slave blocks associate different master blocks, and if the current slave block contains messages for multiple nodes at the same time, the master block tag values for these nodes are stored in the previous block tag set. In the previous chunk hash value set, stored is the self hash value of all previous chunks to which the current slave chunk is connected. By using the key value pair technique, the hash value of the front block is in one-to-one correspondence with the tag value in the tag value set, and the hash value is connected to the summary information of the latest block corresponding to the tag value in the system, so as to form a side network structure, and the frame structure is shown in fig. 5.
The framework provided by the invention adds a side net structure and a balanced binary tree structure of the slave block on the basis of the traditional single chain, and a large amount of data required to be stored on the block is stored on the slave block. Because the tag value of each main block on the main chain is larger than the value of the predecessor tag and smaller than the value of the successor tag, every three main blocks establish a balanced binary tree node by using the tag attributes in the main blocks. Each node in the tree stores a tag value of the main block and a corresponding hash value of the main block, the tag value is used as an index of the balanced binary tree, and the interval in which the main block to be queried is located is found through the balanced binary tree. The linking mode between the main blocks is similar to the traditional block chain linking mode, all information in the main blocks is subjected to double SHA256 hash value operation to obtain self hash values, and the latter main block links the two main blocks together according to the self hash value generated by the former main block to form a chain structure. And designing a front block hash value set and a front block label set from the block. In the previous block set, stored is the hash value of all previous blocks currently linked from the block; in the tag set, stored is the main tile tag value corresponding to all the previous tiles to which the current tile is linked. And using a key value pair technology to enable the hash value of the front block to be in one-to-one correspondence with the label value of the main block, and linking the current slave block with the latest block corresponding to the label value to form a side network structure.
The invention provides a block chain construction method of a mesh structure, as shown in fig. 1, comprising the following steps:
s1, creating a founder block to represent initialization.
Creating a created block on a main chain, representing initialization, setting an index to be 1, setting the hash value of the front main block to be null, ensuring that the size of the tag value is the minimum value in a system according to time or the height of the created main block, wherein the main block does not contain any related information, and performing double SHA256 hash operation on all information in the main block to generate the self hash value of the created block.
And S2, when a node is added in the consensus node set, packaging the basic information of the node into a main block and linking the main block to the tail end of the main chain.
When a new node is added to the consensus node set, the node packs the node information of the node into a main block, other nodes verify the validity of the main block, if the label value is larger than the precursor hash value, the hash value of the previous main block points to the hash value of the previous main block, and the like, if the verification is passed, the main block is linked to the tail end of the main chain, otherwise, the link is rejected.
And S3, dynamically establishing a balanced binary tree node every three main blocks to form a main block interval, and if the main block interval is less than three main blocks, establishing a balanced binary tree node according to the latest main block in the main block interval.
And establishing a balanced binary tree node for every three main blocks, enabling every three main blocks to form a main block interval, storing the tag value of the main block in each node as a balanced binary tree index, and simultaneously storing the hash of the main block corresponding to the tag value. If the number of the main blocks in the main block interval is less than three, a balanced binary tree node is established by using the label value of the latest main block in the main block interval and the hash value of the main block.
S4, packaging N transactions to form a slave block, storing the label values of all nodes in the transactions from the label value set of the block, storing the self hash of the latest block corresponding to the label in the hash set of the front block, and adding the slave block to the corresponding side network.
Packaging N transactions, judging whether node information in each transaction is added to a main chain, if so, storing label values of all nodes in the transactions from a label value set of a block, storing a hash of a latest block corresponding to a label in a hash set of a front block, adding the slave block to a corresponding side network, and if not, rejecting an uplink of the slave block.
If the relevant information of a certain node in the consensus node set needs to be inquired, the steps are as follows:
the label value of the node to be queried is entered. Through the balanced binary tree search, a main block interval corresponding to a main block node is quickly searched, and the hash value of the latest main block in the current interval is obtained;
and judging whether the label value of the current main block is the label value of the main block to be inquired or not according to the hash value of the main block. If yes, carrying out the next step; if not, obtaining the last main block connected with the current main block through the hash value of the previous main block of the current main block, and judging whether the tag value of the main block is the tag value to be inquired or not until the main block needing to be inquired is found;
and inquiring self hash values of the latest slave blocks of the current master block label in the side network to obtain the corresponding latest slave blocks, and inquiring self hash values of the last slave blocks corresponding to the master block label values to obtain new slave blocks through the front block set of the slave blocks until the master block is traversed, and finishing the inquiry.
Compared with the prior art, the invention has the advantages that: the block chain architecture of the mesh structure provides a solution to the scalability problem. By improving the structure of the bottom layer block chain, the block chain structure is more flexibly applied. First, taking a public chain as an example, in the case of a conventional blockchain framework, such as a bitcoin system, new blocks need to be continuously linked to the end of the blockchain. When inquiring account information of a certain account address, the sum of all the non-spending trades related to the address needs to be calculated through a non-spending trading output model (UTXO trading model), and the efficiency is low. Taking an electronic medical record system in a medical chain in a alliance chain as an example, if the electronic medical record system is a common block chain, the medical record of a patient is continuously updated, so that the information of the patient is dispersed and is not easy to search. The block chain structure with the mesh structure effectively solves the problem of low query efficiency of public chains or private chains and the like. The main block mainly stores relevant information of nodes, such as medical record systems in a medical chain, and the main block mainly stores basic information of hospital names, departments, doctors and the like. The balanced binary tree is established by utilizing the label attribute of the main block, which interval the main block is positioned in the main chain can be quickly inquired, and the problem of low searching efficiency of the traditional block chain is solved. The slave blocks are linked with the master blocks, and the slave blocks are linked with the slave blocks to form a directed graph, so that stronger connection is generated between the blocks. The content of the consensus node needing to be updated is stored in the slave block, so that the problem that node information is too dispersed and is not easy to arrange is solved.
The above-described embodiments are merely illustrative of the preferred embodiments of the present invention, and do not limit the scope of the present invention, and various modifications and improvements of the technical solutions of the present invention can be made by those skilled in the art without departing from the spirit of the present invention, and the technical solutions of the present invention are within the scope of the present invention defined by the claims.
Claims (10)
1. A method for constructing a block chain of a mesh structure, comprising:
constructing a block chain structure, wherein the block chain structure comprises a main block structure, a slave block structure and balanced binary tree nodes, the main block structure comprises a block head and a block body, and the slave block structure comprises an index, a time stamp, a self index, a Merck tree root, a storage data attribute, a front block hash value set and a front block label set;
creating a created main block based on the main block structure, wherein the created main block is used for representing an initialization node, and when a new node is added into a common node set, packaging the basic information of the added new node into a main block and linking the main block to the tail end of a main chain;
establishing a balanced binary tree node through a plurality of main blocks to form a main block interval;
and forming the slave block structure by packaging N transactions, wherein the tag values of the slave block structure are used for collecting the tag values of all nodes in the stored transactions, and adding the slave block into the corresponding side net to form a net structure.
2. The method of claim 1, wherein the tile header of the master tile structure comprises an index, a timestamp, a hash value of a previous master tile, a self hash value, attributes of a root node of the Mercker tree storing the transaction digest, and a tag attribute for identifying a current master tile.
3. The method of claim 2, wherein the hash value of the previous one of the master tiles uniquely points to its own hash value of the previous master tile, the master tiles being successive to the master tiles to form a master chain, wherein the tag value of a given one of the master tiles is greater than its predecessor tag value and less than its successor tag value.
4. The method as claimed in claim 1, wherein the founder block does not contain any transaction information, and the tag value in the founder block can be created according to the creation time or by using the height of the founder block for ensuring that the tag value is the minimum value among all the tag values of the main blocks.
5. The method of claim 1, wherein when a new node of the common knowledge participates in common knowledge, basic information of the new node is packaged into a master block, other nodes of the common knowledge verify validity of the new node, if the verification is passed, the master block is linked to the end of the master chain, and if the verification fails, uplink is rejected.
6. The method of claim 5, wherein the verifying comprises: whether the hash value of the previous main block of the main block only points to the self hash value of the previous main block and whether the label value of the main block is larger than the precursor label value of the main block.
7. The method of claim 1, wherein a balanced binary tree node is dynamically established by every three main blocks for forming a main block interval by every three main blocks, and if the main block interval is less than three main blocks, a balanced binary tree node is established according to a newly established main block in the main block interval.
8. The method as claimed in claim 7, wherein the balanced binary tree node is configured to store the tag value of the latest main chunk in the main chunk interval as an index of the chunk chain, and store the self-hash value of the main chunk.
9. The method of claim 1, wherein the slave block structure is formed by packing N transactions, and the tag value set of the slave block is used to store the tag values of all the nodes in the transaction, wherein the hash set of the master block stores the tag values corresponding to the hash values of the latest slave block, and the other nodes verify the validity of the slave block structure, and if the verification is passed, the slave block is added to the corresponding side net.
10. The method as claimed in claim 9, wherein the verifying the validity of the slave block structure by the other nodes comprises: whether a tag in the slave chunk tag value set corresponds to transaction information, whether a master chunk corresponding to a tag in the slave chunk tag set already exists in the master chain, and whether a hash value in the front chunk hash set correctly points to the front chunk.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210004791.XA CN114357081A (en) | 2022-01-05 | 2022-01-05 | Block chain construction method of net structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210004791.XA CN114357081A (en) | 2022-01-05 | 2022-01-05 | Block chain construction method of net structure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114357081A true CN114357081A (en) | 2022-04-15 |
Family
ID=81108233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210004791.XA Pending CN114357081A (en) | 2022-01-05 | 2022-01-05 | Block chain construction method of net structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114357081A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200159717A1 (en) * | 2018-11-15 | 2020-05-21 | Nhn Corporation | Method and blockchain for constructing sub blockchain in blockchain system comprising distributed network of plurality of nodes |
| US20200250295A1 (en) * | 2019-01-31 | 2020-08-06 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for protecting consumer data privacy using solid, blockchain and ipfs integration |
| CN112016118A (en) * | 2019-05-31 | 2020-12-01 | 国际商业机器公司 | Anonymous database rating updates |
| CN112559627A (en) * | 2020-12-11 | 2021-03-26 | 东北大学 | Alliance chain-based on-chain-under-chain collaborative electronic medical record data sharing method |
-
2022
- 2022-01-05 CN CN202210004791.XA patent/CN114357081A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200159717A1 (en) * | 2018-11-15 | 2020-05-21 | Nhn Corporation | Method and blockchain for constructing sub blockchain in blockchain system comprising distributed network of plurality of nodes |
| US20200250295A1 (en) * | 2019-01-31 | 2020-08-06 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for protecting consumer data privacy using solid, blockchain and ipfs integration |
| CN112016118A (en) * | 2019-05-31 | 2020-12-01 | 国际商业机器公司 | Anonymous database rating updates |
| CN112559627A (en) * | 2020-12-11 | 2021-03-26 | 东北大学 | Alliance chain-based on-chain-under-chain collaborative electronic medical record data sharing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107528886B (en) | Block chain full-network splitting method and system | |
| US20220414090A1 (en) | Blockchain data index method, blockchain data storage method and device | |
| CN111241114B (en) | Intelligent service transaction block chain credit management method and system combining transaction and consensus | |
| US20200143366A1 (en) | Methods for decentralized digital asset transfer and smart contract state transition | |
| JP2021522710A (en) | Maintenance of blockchain blocks in a divided blockchain network | |
| CN113329031A (en) | Method and device for generating state tree of block | |
| CN110245951B (en) | Tree structure based alliance chain master-slave multi-chain consensus method | |
| CN111630507A (en) | Distributed blockchain data storage under account model | |
| US20230074102A1 (en) | Method and apparatus for processing data based on block chain, device and readable storage medium | |
| CA3152588A1 (en) | Pruning entries in tamper-evident data stores | |
| CN111095218B (en) | Method, system and device for storing shared block chain data based on error correction coding | |
| CN112286963B (en) | Block chain terminal data credible query system and implementation method thereof | |
| CN109034849B (en) | Agricultural product information traceability verification method and system based on block chain | |
| Su et al. | Smartsupply: smart contract based validation for supply chain blockchain | |
| CN109919691B (en) | Data processing system, method and device | |
| Maciel | Use of blockchain for enabling Construction 4.0 | |
| Yu et al. | A scalable and extensible blockchain architecture | |
| CN110309173B (en) | Contract data recording method and device, block chain node and storage medium | |
| CN111033491A (en) | Storing shared blockchain data based on error correction coding | |
| CN111144133B (en) | System and method for modifying and tracing translation manuscript keyword based on block chain | |
| CN111226206A (en) | Taking snapshots of blockchain data | |
| CN102521356A (en) | Regular expression matching equipment and method on basis of deterministic finite automaton | |
| CN109829076B (en) | Method and equipment for generating block chain | |
| CN111414417B (en) | Video copyright management method based on block chain | |
| CN114357081A (en) | Block chain construction method of net structure |
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 |