CN113672686B - Block data distribution and storage method and system - Google Patents
Block data distribution and storage method and systemDownload PDFInfo
- Publication number
- CN113672686B CN113672686BCN202111229708.0ACN202111229708ACN113672686BCN 113672686 BCN113672686 BCN 113672686BCN 202111229708 ACN202111229708 ACN 202111229708ACN 113672686 BCN113672686 BCN 113672686B
- Authority
- CN
- China
- Prior art keywords
- transaction
- node
- key
- tree
- nodes
- 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
Links
Images
Classifications
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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 OR CALCULATING; 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
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Computer Security & Cryptography (AREA)
- Business, Economics & Management (AREA)
- Finance (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Data Mining & Analysis (AREA)
- Accounting & Taxation (AREA)
- Computing Systems (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Technical Field
The present invention relates to the field of block chain technology, and in particular, to a method and a system for allocating and storing block data.
Background
The block chain technology is expected to provide core technical support for the next generation of trusted internet technology, and at present, the main bottleneck is that besides the low consensus efficiency and the low system throughput, the high demand of the system on the storage space caused by the increase of the chain data structure is also one of the key problems.
The block chain data are divided into different nodes according to a certain rule for storage, so that the storage pressure of a single node is reduced. The side chain technology commonly adopted in the industry at present can reduce the overall storage pressure of the system to a certain extent. However, different side chains can be added to the same node at the same time, and different side chains are generally stored only by partial nodes, so that the situation of information islanding exists, and some nodes can initiate double-flower attack by using information difference, so that the data consistency of the system is influenced, and the transaction cannot be carried out.
To ensure that there is no possibility of a double-flower attack, the honest nodes must spend a lot of time interacting with the nodes of the whole network to determine the latest state of the nodes of the other party before initiating a transaction, which in turn counteracts the benefits of distributed storage.
Therefore, a block allocation storage method is needed to solve the technical problem in the prior art that transaction data cannot be efficiently, safely and reliably stored.
Disclosure of Invention
The invention aims to provide a block data distribution and storage method and a block data distribution and storage system, which are used for solving the technical problem that transaction data cannot be efficiently, safely and reliably stored in the prior art.
The purpose of the invention can be realized by the following technical scheme:
a method for distributing and storing block data comprises the following steps:
the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm;
the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network;
and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
Optionally, before the receiving the transaction and determining whether the transaction is a critical transaction, the receiving a transaction by a transaction receiving node further includes:
all nodes in the whole network elect a packaging node through a consensus algorithm, and the packaging node packages an index array and a signature array into a creation block; the elements of the index array are the serial numbers of the nodes and the public keys of the nodes, and the elements of the signature array are the digital signatures of the nodes on the index array.
Optionally, the general transaction tree and the key transaction tree are both mercker prefix trees.
Optionally, determining the target node according to the transaction and the public key of the transaction sending node includes:
and calculating the hash value of the transaction by taking the public keys of the transaction and the transaction sending node as parameters and taking a hash function as a function, and obtaining the serial number of the target node by taking the hash value modulo the number of the nodes in the whole network.
Optionally, the encapsulating node acquiring the transaction includes:
and the transaction receiving node sends the transaction to the target node, and the target node sends the transaction to the packaging node after verifying the validity of the transaction.
The invention also provides a block data distribution and storage system, which comprises a plurality of nodes, wherein:
the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm;
the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network;
and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
Optionally, before the receiving the transaction and determining whether the transaction is a critical transaction, the receiving a transaction by a transaction receiving node further includes:
all nodes in the whole network elect a packaging node through a consensus algorithm, and the packaging node packages an index array and a signature array into a creation block; the elements of the index array are the serial numbers of the nodes and the public keys of the nodes, and the elements of the signature array are the digital signatures of the nodes on the index array.
Optionally, the general transaction tree and the key transaction tree are both mercker prefix trees.
Optionally, determining the target node according to the transaction and the public key of the transaction sending node includes:
and calculating the hash value of the transaction by taking the public keys of the transaction and the transaction sending node as parameters and taking a hash function as a function, and obtaining the serial number of the target node by taking the hash value modulo the number of the nodes in the whole network.
Optionally, the encapsulating node acquiring the transaction includes:
and the transaction receiving node sends the transaction to the target node, and the target node sends the transaction to the packaging node after verifying the validity of the transaction.
The invention provides a method and a system for distributing and storing block data, wherein the method comprises the following steps: the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm; the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network; and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
The block data allocation storage method and system provided by the invention have the following beneficial effects:
the invention divides the transaction into key transaction and general transaction, the transaction receiving node receives the transaction and judges whether the transaction is the key transaction, if the transaction is the key transaction, the transaction is packaged into a key transaction tree by the packaging node, otherwise, the target node is determined, and the transaction is packaged into the general transaction tree corresponding to the target node. The nodes of the whole network store the key transaction trees together, and each node only needs to store a general transaction tree corresponding to the node of the node, so that the storage space can be effectively reduced; meanwhile, the key transactions can be stored by the nodes of the whole network together, and the general transactions are only stored in the unique specific general transaction tree, so that double-flower attack can be prevented, and the transaction data can be conveniently and quickly searched.
Drawings
FIG. 1 is a flow chart illustrating a method for allocating storage according to the present invention;
FIG. 2 is a schematic diagram of the basic topology of a prior art side-chain approach;
FIG. 3 is a block chain organization diagram according to the present invention.
Detailed Description
The embodiment of the invention provides a block data distribution and storage method and system, which aim to solve the technical problem that transaction data cannot be efficiently, safely and reliably stored in the prior art.
To facilitate an understanding of the invention, the invention will now be described more fully with reference to the accompanying drawings. Preferred embodiments of the present invention are shown in the drawings. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
The block chain technology is expected to provide core technical support for the next generation of trusted internet technology, and at present, the main bottleneck is that besides the low consensus efficiency and the low system throughput, the high demand of the system on the storage space caused by the increase of the chain data structure is also one of the key problems. The block chain data are divided into different nodes according to a certain rule for storage, so that the storage pressure of a single node is reduced. The biggest problem with this approach is that if a node loses some of the block data for which it is responsible for some reason, the block chains will be difficult to chain together, resulting in reduced reliability of the data throughout the network. Finding a dynamic block allocation and exception emergency handling algorithm is the key to solving this problem.
At present, the distributed storage of block chain data is generally realized by adopting a 'fragmentation' or 'side chain' technology in the industry, and the basic strategy is that part of nodes form a small group at first, transaction is carried out in the small group, and the final result is uploaded to a main chain, so that the system throughput is improved, and the storage overhead of the whole system is indirectly reduced.
Referring to fig. 2, the side chain technique reduces the storage overhead of the whole system by storing different side chains in respective related nodes, and storing no unrelated nodes. The existing side chain technology can reduce the overall storage pressure of the system to a certain extent. However, different side chains can be added to the same node at the same time, and different side chains are generally stored only by partial nodes, so that the situation of information islanding exists, and some nodes can initiate double-flower attack by using information difference, so that the data consistency of the system is influenced, and the transaction cannot be carried out.
To ensure that there is no chance of a double-flower attack, the honest nodes must spend a lot of time interacting with the nodes of the whole network to determine the latest state of the nodes of the other party before initiating a transaction, which in turn counteracts the benefit of reduced storage.
Referring to fig. 1, an embodiment of a method for allocating and storing block data according to the present invention includes the following steps:
s100: the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm;
s200: the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network;
s300: and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
In this embodiment, the number of nodes in the whole network is N, and the nodes in the whole network are numbered from 1 to N, PiThe public key of the node with the number of i is shown, wherein i is a natural number, and i is more than or equal to 1 and less than or equal to N. The serial number of the node and the public key of the node are used as the elements of the index Array, namely the elements of the Array are (i, P)i）。
Each node of the whole network respectively carries out digital signature on the index element group Array, and the number of the node iThe signature is SiWherein i is a natural number, i is more than or equal to 1 and less than or equal to N, and signing the digital signature SiAnd (5) broadcasting in the whole network. It should be noted that the role of the digital signature is mainly to let all nodes in the whole network acknowledge the above numbering scheme, so as to fix the serial number of each node in an undeniable manner for the convenience of the following calculation.
After each node receives the digital signatures of other nodes, the digital signatures of all the nodes are combined into a signature array S, namely S = { S = { S =1,S2,…, Si, …,SNAnd i is a natural number, i is more than or equal to 1 and less than or equal to N, and then the index Array and the signature Array S are packaged into the creation block.
It should be noted that, since the encapsulation rule of the created blocks and the required data are consistent throughout the network, each node in the network can generate the same created blocks locally. The creation block has N +1 fields for storing the hash value of the root node of the tree of the key transaction branch and the general transaction branch. Since there are no transactions at first, all trees are empty trees and the hash values of all tree roots are filled with 0 s.
Referring to fig. 3, in all blocks following the created block, in addition to one field for recording the hash value of the previous block, there must be N +1 fields in the block, where one field records the critical transaction tree Branch1The remaining N fields record the general transaction tree Branch2The hash value of the root. Both the key transaction tree and the general transaction tree may adopt a Merkel Prefix Tree (MPT) structure.
It should be noted that the hash value of the block is calculated by using all fields of the block as parameters and using a common hash function (such as SHA) as a function.
The whole network node selects the encapsulation node of each block by a common consensus algorithm (such as PBFT), and the number of the encapsulation nodes selected by different consensus algorithms may be different.
Before each transaction tx is sent, each transaction sending node first determines whether the transaction tx is a critical transaction or a general transaction. The basic principle of the determination is that a field is arranged in the transaction tx for marking whether the transaction is a key transaction or a general transaction, and the transaction sending node assigns a value to the field as the key transaction or the general transaction before sending out the transaction tx. The key transaction refers to transaction information which is all concerned by nodes of the whole network, for example, the transaction "node a transfers 50 yuan to node B", because the transaction affects the balance of the transaction sending node a and the transaction receiving node B, and further affects the amount of money which the node A, B can transfer to other nodes of the whole network, the nodes of the whole network all want to know whether the transaction is successful at last, and the transaction "node a transfers 50 yuan to node B" is the key transaction. A general transaction refers to a transaction related to only a few nodes, and other nodes are not concerned with the transaction except for the nodes.
When any node of the whole network receives a transaction tx, judging whether the transaction tx is a key transaction, if so, directly sending the transaction to an adjacent node or directly sending the transaction to the adjacent node by a transaction receiving node or directly sending the transaction to the adjacent node by the whole network broadcast, so that the communication pressure between networks can be reduced, but the speed of reaching consensus can be delayed; the network-wide broadcasting will increase the network pressure, but may increase the speed of reaching the consensus, which needs to be selected according to the actual situation. Meanwhile, the transaction receiving node sends the transaction tx to the current block packaging node, and the packaging node packages the transaction into a key transaction tree Branch1And updating the root of the key transaction tree according to the updating algorithm (the existing mature algorithm) of the whole tree of the MPT tree.
If the transaction tx is a general transaction, calculating a hash value hash of the transaction tx by taking the transaction tx and a public key of a sending node of the transaction as parameters and a common hash function (such as SHA) as a function; and then calculating the number of the target node according to the formula index = hash% N, and sending the transaction tx to the target node index by the transaction receiving node. The target node index checks the transaction content field and the corresponding signature field in the transaction tx to see whether the transaction content field and the corresponding signature field are consistent with the public key of the transaction sending node, and after the validity of the transaction tx is verified to be correct, the target node index sends the transaction tx to the current block packaging node, and the packaging node adds the transaction tx to a general transaction tree corresponding to the target node index and updates the root of the general transaction tree.
It is worth noting that both the general transaction tree and the key transaction tree are Mercker prefix trees (i.e., MPTs). The MPT tree is divided into layers, the number of layers of which is related to the length of the hash value of the transaction (typically the number of layers = hash length + 2). For example, the length of the hash value of all transactions is 4, the first layer of the MPT tree is the tree root, and the second layer to the penultimate layer store the values of the hash on each bit in sequence. For example, if the hash value of the first transaction is "5831", the second layer stores "5", the third layer stores "8", the fourth layer stores "3", the fifth layer stores "1", and the last layer stores the details of the entire transaction tx. If the hash value for the second transaction is "5432," it shares the second level of "5" with the first transaction. If the hash value of the third transaction is "7831", although the following "831" is the same as the first transaction, the highest bit of the hash value is 7, which is different from the "5" of the highest bit of the hash value of the first transaction, and therefore, a branch in the tree needs to be opened again to store the hash value "7831" of the third transaction.
In this embodiment, the key transaction tree and the general transaction tree are both MPT trees, the key transaction is encapsulated in the key transaction tree, and the general transaction is encapsulated in the general transaction tree corresponding to the target node. If the specific content of a certain transaction needs to be searched, the leaf nodes of the tree are found all the time only by searching downwards along the tree root according to the hash value of the specific content, and the specific content of the transaction is stored in the leaf nodes.
If the block packaging node has packaged a certain amount of transactions or a preset time has elapsed since the last block packaging, in a preferred embodiment, the preset time is 5 seconds, the block packaging node may end the packaging of the block, and at the same time, hash values of the roots of the key transaction tree and all general transaction trees are calculated, the hash value of the root of each tree is stored in a corresponding field of the new block, then the value of each field in the new block is used as a parameter, and a common signature algorithm (such as RSA) is used to perform a signature operation on the new block by using a private key of the packaging node, and the new block (including each field and signature therein) and newly added transactions in each tree are broadcast over the internet.
After receiving the broadcast, each node of the whole network carries out signature verification operation on the new block by using the public key of the packaging node, after the verification is passed, the key transaction tree and the general transaction tree corresponding to the node of the node are updated, the newly added transaction in the key transaction tree is updated to a local database, meanwhile, only the general transaction tree corresponding to the node of the node is updated, only the newly added transaction in the general transaction tree corresponding to the node of the node.
In the embodiment, different transaction storage modes are determined according to the nature of the transaction (key transaction or general transaction), the whole network nodes store the concerned key transaction together, the general transaction is only stored in a unique specific target node, and all nodes actually reach a consensus in the cooperative storage process.
In this embodiment, each block is associated with each tree only by the hash value of its root, and a complete blockchain includes the above blocks (i.e., the fields in the block) and the trees (the key transaction tree and all the general transaction trees) connected to the newest block.
The embodiment divides the transaction into a key transaction and a general transaction, the transaction receiving node receives the transaction and judges whether the transaction is the key transaction, if the transaction is the key transaction, the transaction is packaged into a key transaction tree by the packaging node, otherwise, the target node is determined, and the transaction is packaged into the general transaction tree corresponding to the target node. The nodes of the whole network store the key transaction trees together, and each node only needs to store a general transaction tree corresponding to the node of the node, so that the storage space can be effectively reduced; meanwhile, the key transactions can be stored by the nodes of the whole network together, and the general transactions are only stored in the unique specific general transaction tree, so that double-flower attack can be prevented, and the transaction data can be conveniently and quickly searched.
In the prior art, the reduction of the storage space and the prevention of double-flower attack cannot be considered at the same time, and once a side chain technology is adopted, the probability of successful attack of the malicious node is greatly increased. In the embodiment, each transaction can be clearly determined on which branch, if the transaction is a critical transaction, the transaction is on the critical transaction branch, and if the transaction is a general transaction, the transaction is on the only specific general transaction branch, and the double-flower attack is difficult.
In the prior art, the transaction on each side chain is a private transaction of a small-range node, a supervision vulnerability exists, all transaction branches in the embodiment are disclosed, and only different general transaction branches are stored by corresponding nodes, so that the supervision is easy.
In the prior art, when a transaction is searched, if a specific transaction exists on a side chain, it is difficult to quickly find related contents of the transaction except traversing all side chains.
The embodiment of the invention adopts a block storage allocation strategy with distinct primary and secondary, so that the storage space can be optimized; meanwhile, each transaction can be uniquely determined on a certain general transaction branch, double possibility does not exist, any transaction can be quickly searched, the searching time is reduced, and the efficiency of transaction searching is improved.
The invention also provides an embodiment of a block data allocation storage system, which comprises a plurality of nodes, wherein:
the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm;
the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network;
and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
In this embodiment, before the transaction receiving node receives a transaction and determines whether the transaction is a critical transaction, the method further includes:
the whole network node elects a packaging node through a consensus algorithm, and packages the index array and the signature array into the creation block; the elements of the index array are the serial numbers of the nodes and the public keys of the nodes, and the elements of the signature array are the digital signatures of the nodes on the index array.
Optionally, the general transaction tree and the key transaction tree are both mercker prefix trees.
Optionally, determining the target node according to the transaction and the public key of the transaction sending node includes:
and calculating the hash value of the transaction by taking the public keys of the transaction and the transaction sending node as parameters and taking a hash function as a function, and obtaining the serial number of the target node by taking the hash value modulo the number of the nodes in the whole network.
Optionally, the encapsulating node acquiring the transaction includes:
and the transaction receiving node sends the transaction to the target node, and the target node sends the transaction to the packaging node after verifying the validity of the transaction.
The embodiment divides the transaction into a key transaction and a general transaction, the transaction receiving node receives the transaction and judges whether the transaction is the key transaction, if the transaction is the key transaction, the transaction is packaged into a key transaction tree by the packaging node, otherwise, the target node is determined, and the transaction is packaged into the general transaction tree corresponding to the target node. The nodes of the whole network store the key transaction trees together, and each node only needs to store a general transaction tree corresponding to the node of the node, so that the storage space can be effectively reduced; meanwhile, the key transactions can be stored by the nodes of the whole network together, and the general transactions are only stored in the unique specific general transaction tree, so that double-flower attack can be prevented, and the transaction data can be conveniently and quickly searched.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A method for allocating and storing block data is characterized by comprising the following steps:
the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm;
the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network;
and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
2. The method as claimed in claim 1, wherein before the transaction receiving node receives the transaction and determines whether the transaction is a critical transaction, the method further comprises:
all nodes in the whole network elect a packaging node through a consensus algorithm, and the packaging node packages an index array and a signature array into a creation block; the elements of the index array are the serial numbers of the nodes and the public keys of the nodes, and the elements of the signature array are the digital signatures of the nodes on the index array.
3. A method as claimed in claim 1, wherein said general transaction tree and said key transaction tree are both mercker prefix trees.
4. The method of claim 1, wherein determining the target node according to the public key of the transaction and the transaction sending node comprises:
and calculating the hash value of the transaction by taking the public keys of the transaction and the transaction sending node as parameters and taking a hash function as a function, and obtaining the serial number of the target node by taking the hash value modulo the number of the nodes in the whole network.
5. A method for distributed storage of block data according to claim 1, wherein said encapsulating node obtaining said transaction comprises:
and the transaction receiving node sends the transaction to the target node, and the target node sends the transaction to the packaging node after verifying the validity of the transaction.
6. A system for allocating and storing block data, comprising a plurality of nodes, wherein:
the transaction receiving node receives the transaction and judges whether the transaction is a key transaction, if so, the transaction is broadcasted in the whole network, and the encapsulation node encapsulates the transaction into a key transaction tree; if not, the transaction receiving node determines a target node according to the public key of the transaction and the transaction sending node, and the packaging node acquires the transaction and packages the transaction into a general transaction tree corresponding to the target node; the key transaction is a transaction concerned by all network nodes, and the packaging node is selected by all network nodes through a consensus algorithm;
the packaging node calculates the hash values of the roots of the key transaction tree and all the general transaction trees, stores the hash values into a new block, and broadcasts the new block and the newly added transactions in a whole network;
and each node of the whole network updates the key transaction tree and the general transaction tree corresponding to the node to the local.
7. The system of claim 6, wherein the transaction receiving node receives the transaction and determines whether the transaction is a critical transaction further comprises:
all nodes in the whole network elect a packaging node through a consensus algorithm, and the packaging node packages an index array and a signature array into a creation block; the elements of the index array are the serial numbers of the nodes and the public keys of the nodes, and the elements of the signature array are the digital signatures of the nodes on the index array.
8. A block data allocation storage system according to claim 6, wherein said general transaction tree and said key transaction tree are both mercker prefix trees.
9. The system of claim 6, wherein determining the target node according to the public key of the transaction and the transaction sending node comprises:
and calculating the hash value of the transaction by taking the public keys of the transaction and the transaction sending node as parameters and taking a hash function as a function, and obtaining the serial number of the target node by taking the hash value modulo the number of the nodes in the whole network.
10. A block data allocation storage system according to claim 6, wherein said encapsulation node obtaining said transaction comprises:
and the transaction receiving node sends the transaction to the target node, and the target node sends the transaction to the packaging node after verifying the validity of the transaction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111229708.0ACN113672686B (en) | 2021-10-21 | 2021-10-21 | Block data distribution and storage method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111229708.0ACN113672686B (en) | 2021-10-21 | 2021-10-21 | Block data distribution and storage method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113672686A CN113672686A (en) | 2021-11-19 |
| CN113672686Btrue CN113672686B (en) | 2022-01-07 |
Family
ID=78550786
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111229708.0AActiveCN113672686B (en) | 2021-10-21 | 2021-10-21 | Block data distribution and storage method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113672686B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086351A (en)* | 2022-04-27 | 2022-09-20 | 欧冶云商股份有限公司 | Message publishing method, system and message acquiring method for block chain transaction data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111047324A (en)* | 2020-03-16 | 2020-04-21 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for updating a set of public keys at a blockchain node |
| CN112598514A (en)* | 2020-12-09 | 2021-04-02 | 杭州趣链科技有限公司 | Block chain-based cross-chain transaction management method, cross-chain platform and medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10460118B2 (en)* | 2016-08-30 | 2019-10-29 | Workday, Inc. | Secure storage audit verification system |
- 2021
- 2021-10-21CNCN202111229708.0Apatent/CN113672686B/enactiveActive
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111047324A (en)* | 2020-03-16 | 2020-04-21 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for updating a set of public keys at a blockchain node |
| CN112598514A (en)* | 2020-12-09 | 2021-04-02 | 杭州趣链科技有限公司 | Block chain-based cross-chain transaction management method, cross-chain platform and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113672686A (en) | 2021-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110474986B (en) | A consensus method, device and system based on blockchain system | |
| CN112926982B (en) | Transaction data processing method, device, equipment and storage medium | |
| CN111698094B (en) | Common identification method based on block chain system and block chain system | |
| CN113329031A (en) | Method and device for generating state tree of block | |
| US11275564B2 (en) | Decentralized random number generator | |
| US20240163121A1 (en) | Blockchain consensus method, apparatus, and device, and storage medium | |
| CN114385756B (en) | Method for executing transaction in block chain and block chain link point | |
| US20200226113A1 (en) | Pruning of authentication trees | |
| CN113079026B (en) | Block chain system and block chain network resource management method | |
| CN102710419A (en) | User authentication method and device | |
| CN110738472A (en) | Block chain storage method and block chain node | |
| CN114202422B (en) | A blockchain sharding method, blockchain system and cross-sharding transaction processing method | |
| CN119675935B (en) | Extensible blockchain identity authentication method and system for distributed resource aggregation scene | |
| CN115996151A (en) | Electronic medical data sharing method, system, equipment and medium | |
| CN113672686B (en) | Block data distribution and storage method and system | |
| CN111432009A (en) | Method and device for synchronizing block chain data, electronic equipment and storage medium | |
| CN117150564B (en) | A blockchain-based pharmaceutical logistics data traceability method | |
| CN114244523B (en) | Data processing method, device and adapter | |
| CN114461730A (en) | Adaptive block data compression method based on remainder system | |
| CN116361383A (en) | Block generation method, block chain system, storage medium and related equipment | |
| CN113691632A (en) | Dynamic scheduling method and system for block chain computing resources | |
| CN114238430B (en) | True storage method and system based on verifiable steganone filter | |
| CN116055064B (en) | Method, system, medium and equipment for multi-block simultaneous consensus in block chain segmentation | |
| CN114679466B (en) | Consensus processing method, device, computer equipment and medium for block chain network | |
| CN113378237B (en) | Block chain data storage method and device based on aggregated signature and isolated witness |
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 |