CN109410043B - Block chain information efficient storage method and device based on hierarchical tree structure - Google Patents
Block chain information efficient storage method and device based on hierarchical tree structure Download PDFInfo
- Publication number
- CN109410043B CN109410043B CN201810949802.5A CN201810949802A CN109410043B CN 109410043 B CN109410043 B CN 109410043B CN 201810949802 A CN201810949802 A CN 201810949802A CN 109410043 B CN109410043 B CN 109410043B
- Authority
- CN
- China
- Prior art keywords
- account information
- account
- barrel
- hierarchical tree
- information
- 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; 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
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a block chain information high-efficiency storage method based on a hierarchical tree structure, which comprises the following steps: a preset classification of blockchain accounts; partitioning of the barrel store; constructing a hierarchical tree structure; inputting account information; and checking the consistency of the account information. The block chain account storage structure is innovative, on the premise that the characteristics that the block chain information cannot be tampered and the like are guaranteed, the accounts are stored hierarchically according to the transaction frequency, and in the overall view, the accounts with higher transaction frequency are stored in the nodes closer to the root node, so that the integral Hash frequency is reduced.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain information efficient storage method and device based on a hierarchical tree structure.
Background
The block chain is a chain data structure formed by combining data blocks in a sequential connection mode according to a time sequence, and is a novel application mode comprising technologies such as distributed storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. Different from the traditional centralized application, as each node contains complete book information in the block chain, the block chain technology has the characteristic of decentralized, namely, no node has the capability of changing all block chain information. Therefore, the block chain technology has strong characteristics of being not falsifiable and not forged, and the reliability of data is guaranteed.
In order to ensure that data is not tampered with maliciously, taking bitcoin (bitcoin) as an example, the bitcoin adopts a merkel Tree (Merkle Tree) form to store transaction information, the transaction information of the bitcoin is stored on leaf nodes of the Merkle Tree, and according to characteristics of the Merkle Tree, hash (hash) operations are sequentially performed upwards, hash algorithms related in the current bitcoin system include SHA3, SHA256 and the like, and finally hash values of root nodes are stored in blocks. When some transaction information is tampered, due to the characteristics of the hash operation, the hash result is necessarily changed, and finally, the hash value of the root node is also changed. Therefore, the transaction information can be verified whether the transaction information is falsified by only verifying whether the hash value of the root node stored in the block is changed.
As an important block chain application at present, etherworks (Ethereum) and hyper ledgers (hyper ledger) inherit some characteristics of bit coins in an information storage manner, but are innovative. The method of the Merkle Tree is improved by Ethengfang, and the transaction and account information with the same prefix after being coded is stored in the leaf node belonging to the same father node, namely the Merkle Patricia Tree. The super ledger further improves the method of the Merkle Tree, changes the leaf nodes into a barrel structure, and stores the account transaction information in a specified barrel by using a specified function, namely the barrel may contain a plurality of transaction information, which is called Bucket Tree.
At present, the block chain technology is not widely applied, and besides the influence of policy factors and the like, certain problems exist in the self technology. For example, in the prior art, the storage speed of the blockchain transaction is relatively low, and about 7 transactions per second can be processed by taking bitcoin as an example. Visa, by contrast, peaks up to about 14000 pens per second in the speed at which transactions are processed. This results in that the bitcoin cannot be used in a scenario of processing high-frequency transactions, and a large amount of transaction information cannot be packed and stored in the blockchain, which causes congestion of information. Although the improvement of the storage form of the ether house and the super ledger leads the ether house and the super ledger to be improved in the information storage speed compared with the bitcoin, the improvement range is very limited, and the requirement of high-frequency transaction is still difficult to meet.
At present, the block chain transaction speed is too low, for example, bit coins can only process 7 transactions per second, so that a large number of transactions cannot be packed and confirmed in time, and the situation of transaction information congestion occurs, which is difficult to meet the application scenario of high-frequency transactions in a daily payment system, so that the application range of the block chain is greatly limited.
Disclosure of Invention
The invention mainly aims to provide a block chain information high-efficiency storage method based on a hierarchical tree structure, aiming at overcoming the problems.
In order to achieve the above object, the invention provides a block chain information efficient storage method based on a hierarchical tree structure, comprising the following steps:
s10 preset classification of blockchain accounts: according to the needs of a block chain scene, account information is preset and classified into i groups of parameter sets, wherein i is a natural number, the account information comprises the total number N of accounts, the number B of buckets in a hierarchical tree structure, the number x of accounts in each bucket, one or more sub-nodes K of a single node in the hierarchical tree structure, the ratio A of the number of each account and the transaction frequency R of each account;
s20, carrying out simulation calculation on the parameter sets of the multiple groups of account information, and selecting an optimal parameter set according to the simulation result;
s30 construction of hierarchical tree structure: determining a decision function of account information barrel storage, inputting an optimal parameter set and the decision function, establishing a hierarchical tree-shaped barrel structure according to a certain rule and numbering each barrel according to the hierarchical tree-shaped barrel structure, wherein the height of each barrel and the number of the corresponding barrels at each height;
s40 calculating the serial number of the corresponding barrel set by the account through the function of the account information, and storing the account information in the corresponding barrel of the hierarchical tree-shaped barrel structure according to the serial number;
checking the information consistency at S50: when a transaction occurs, account information is changed, the account information in the barrel is spliced firstly, hash operation is carried out for one time, then the hash operation is carried out upwards according to the hierarchical tree-shaped barrel structure, and if the account information in the barrel is not changed, the hash operation is not needed; if the account information in the bucket is changed, performing hash operation again to obtain a new hash value of the root node; and checking whether the hash value of the new root node is consistent with the hash values occupied by other trusted nodes, if so, determining that the account information is not tampered, and if not, determining that the account information is tampered, determining that the node is not trusted, and needing to acquire the account information from other trusted nodes to update.
Preferably, the decision function includes:
(1) according to the formula
Calculating the number of each type of account;
(2) calculating a weight vector
Wherein ω isik＝Pik＝Pi/BiPi is the probability of use of the class i account, PikRepresenting the usage probability of the kth bucket in the ith type account;
(3) increase in weight vector
Zero, becomes ω' ═ 0., (0, ω), where B denotes the number of buckets in the hierarchical tree structure, the element in each weight vector represents a bucket, the height at which each bucket is located is initialized to 1, when k weights are merged, indicating that the k buckets have been determined, the resulting elements are merged, representing the internal nodes of a tree. Each time of combination, the height of the determined barrel is increased by 1;
(4) when the weight number is larger than 1, selecting the minimum weight of k omega', and summing to obtain a new weight;
(5) discarding the k minimum weights, and inserting the generated new weights into ω';
(6) and circularly calculating to obtain the height of each barrel and the number of the corresponding barrels in each height.
Preferably, the certain rule in 30 is: and storing the buckets containing the account information with the same use frequency at the same height of the tree structure, and if the account transaction frequency of the account information in the buckets is higher, determining that the buckets are higher in the layer number.
Preferably, each of the buckets in the S40 stores a plurality of account information.
Preferably, the S10 further includes before:
s01 RLP encodes the account information, and inputs the RLP-encoded account information.
Preferably, the function calculation selects a modulo function or a random function.
Preferably, if the function calculation selects the modulo function, assuming that there are B buckets in the tree structure, the number is from 0 to B-1, regarding the account as an integer a, and letting r be the remainder after modulo B by a, since r is necessarily a number from 0 to B-1, r is the number of the bucket corresponding to account a.
The invention provides an innovative block chain account storage structure, and provides a storage method of a hierarchical tree structure by relying on the existing fact that the transaction frequency of the block chain accounts has great difference, so that the accounts are hierarchically stored according to the transaction frequency on the premise of ensuring the characteristics of non-falsification of block chain information and the like. In general, accounts with higher transaction frequencies will be stored in nodes closer to the root node to reduce the overall Hash number. Experiments prove that the method can obviously reduce the Hash times during account storage, so that the overall storage time is greatly shortened.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the structures shown in the drawings without creative efforts.
FIG. 1 is a block diagram of a method flow of an embodiment of a block chain information efficient storage method based on a hierarchical tree structure according to the present invention;
FIG. 2 is a schematic diagram of a hierarchical tree bucket structure;
FIG. 3 is a graph showing the effect of the present invention compared with conventional Ethereum and Hyperridge Fabric,
the implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
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.
It should be noted that, if directional indications (such as up, down, left, right, front, and back … …) are involved in the embodiment of the present invention, the directional indications are only used to explain the relative positional relationship between the components, the movement situation, and the like in a specific posture (as shown in the drawing), and if the specific posture is changed, the directional indications are changed accordingly.
In addition, if there is a description of "first", "second", etc. in an embodiment of the present invention, the description of "first", "second", etc. is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
As shown in fig. 1-2, the method for efficiently storing blockchain information based on a hierarchical tree structure provided by the present invention includes the following steps:
s10 preset classification of blockchain accounts: according to the needs of a block chain scene, account information is preset and classified into i groups of parameter sets, wherein i is a natural number, the account information comprises the total number N of accounts, the number B of buckets in a hierarchical tree structure, the number x of accounts in each bucket, one or more sub-nodes K of a single node in the hierarchical tree structure, the ratio A of the number of each account and the transaction frequency R of each account;
s20, carrying out simulation calculation on the parameter sets of the multiple groups of account information, and selecting an optimal parameter set according to the simulation result;
s30 construction of hierarchical tree structure: determining a decision function of account information barrel storage, inputting an optimal parameter set and the decision function, establishing a hierarchical tree-shaped barrel structure according to a certain rule and numbering each barrel according to the hierarchical tree-shaped barrel structure, wherein the height of each barrel and the number of the corresponding barrels at each height;
s40 calculating the serial number of the corresponding barrel set by the account through the function of the account information, and storing the account information in the corresponding barrel of the hierarchical tree-shaped barrel structure according to the serial number;
checking the information consistency at S50: when a transaction occurs, account information is changed, the account information in the barrel is spliced firstly, hash operation is carried out for one time, then the hash operation is carried out upwards according to the hierarchical tree-shaped barrel structure, and if the account information in the barrel is not changed, the hash operation is not needed; if the account information in the bucket is changed, performing hash operation again to obtain a new hash value of the root node; and checking whether the hash value of the new root node is consistent with the hash values occupied by other trusted nodes, if so, determining that the account information is not tampered, and if not, determining that the account information is tampered, determining that the node is not trusted, and needing to acquire the account information from other trusted nodes to update.
Preferably, the decision function includes:
(1) according to the formula
Calculating the number of each type of account;
(2) calculating a weight vector
Wherein ω isik＝Pik＝Pi/BiPi is the probability of use of the class i account, PikRepresenting the usage probability of the kth bucket in the ith type account;
(3) increase in weight vector
Zero, becomes ω' ═ (0,. 0, ω), where B denotes the number of buckets in the hierarchical tree structure, each bucket representing a number of buckets in the hierarchical tree structureThe elements in the weight vector represent a bucket, the height of each bucket is initialized to 1, when k weights are combined, the k buckets are determined well, and the combined elements represent the internal nodes of a tree. Each time of combination, the height of the determined barrel is increased by 1;
(4) when the weight number is larger than 1, selecting the minimum weight of k omega', and summing to obtain a new weight;
(5) discarding the k minimum weights, and inserting the generated new weights into ω';
(6) and circularly calculating to obtain the height of each barrel and the number of the corresponding barrels in each height.
Preferably, the certain rule in 30 is: and storing the buckets containing the account information with the same use frequency at the same height of the tree structure, and if the account transaction frequency of the account information in the buckets is higher, determining that the buckets are higher in the layer number.
Preferably, each of the buckets in the S40 stores a plurality of account information.
Preferably, the S10 further includes before:
s01 RLP encodes the account information, and inputs the RLP-encoded account information.
Preferably, the function calculation selects a modulo function or a random function.
Preferably, if the function calculation selects the modulo function, assuming that there are B buckets in the tree structure, the number is from 0 to B-1, regarding the account as an integer a, and letting r be the remainder after modulo B by a, since r is necessarily a number from 0 to B-1, r is the number of the bucket corresponding to account a.
The invention provides an innovative block chain account storage structure, and provides a storage method of a hierarchical tree structure by relying on the existing fact that the transaction frequency of the block chain accounts has great difference, so that the accounts are hierarchically stored according to the transaction frequency on the premise of ensuring the characteristics of non-falsification of block chain information and the like. In general, accounts with higher transaction frequencies will be stored in nodes closer to the root node to reduce the overall Hash number. Experiments prove that the method can obviously reduce the Hash times during account storage, so that the overall storage time is greatly shortened.
The invention has the technical effects that:
(1) the hierarchical tree structure can ensure the reliability of block chain data and can effectively verify whether the information is tampered;
(2) according to simulation experiments, compared with the traditional Ethereum and Hyperhedger Fabric, the block chain information storage method based on the hierarchical tree structure provided by the patent can effectively reduce the times of hash operation, accelerate verification speed and reduce energy consumption. The comparative effect is shown in fig. 3;
(3) the technology can effectively improve the speed of processing the high-frequency transaction by the block chain, and is more suitable for the scene of the high-frequency transaction. Moreover, the higher the transaction frequency is, the more obvious the promotion effect is;
(4) for the technology, the larger the gap of the account transaction frequency is, the greater the advantage is compared with the traditional method. The specific operation flow of the invention is as follows:
1. presetting a plurality of groups of parameter sets according to the needs of a block chain scene, wherein the parameter sets comprise information such as the total amount of accounts, the number of buckets with tree structures, the number of accounts stored in each bucket, account transaction frequency and the like;
2. performing parameter simulation, and selecting a parameter set with excellent performance according to a simulation result;
3. determining a decision function, i.e. the account after RLP coding, in how many buckets it should be placed;
4. calculating the number of each barrel and the height of each barrel according to preset parameters and the proposed algorithm, and numbering the barrels;
5. storing the account information in a corresponding bucket of a hierarchical tree-like bucket structure;
6. and splicing the account information coded in the barrel, performing hash operation upwards in sequence to obtain the hash value of the root node of the tree structure, and storing the hash value of the root node in the block.
7. When the transaction occurs and the account information changes, the hash operation needs to be performed again, and at this time, if no transaction occurs to any account in the bucket, the bucket does not need to perform the hash operation again.
8. And checking whether the hash value of the root node is consistent with the hash values of other trusted nodes, if so, considering that the account information is tampered, and if not, considering that the account information is tampered, judging that the node is not trusted and needing to update the account information from other trusted nodes.
The invention can also use the thought of the hierarchical tree structure of the invention, if the parameter setting in the algorithm initialization process is changed, or a similar generation algorithm is adopted, the effect similar to the method can be produced, and the integral Hash times can be reduced.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention, and all modifications and equivalents of the present invention, which are made by the contents of the present specification and the accompanying drawings, or directly/indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (7)
1. A block chain information high-efficiency storage method based on a hierarchical tree structure is characterized by comprising the following steps:
s10 preset classification of blockchain accounts: according to the needs of a block chain scene, account information is preset and classified into i groups of parameter sets, wherein i is a natural number, the account information comprises the total number N of accounts, the number B of buckets in a hierarchical tree structure, the number x of accounts in each bucket, one or more sub-nodes K of a single node in the hierarchical tree structure, the ratio A of the number of each account and the transaction frequency R of each account;
s20, carrying out simulation calculation on the parameter sets of the multiple groups of account information, and selecting an optimal parameter set according to the simulation result;
s30 construction of hierarchical tree structure: determining a decision function of account information barrel storage, inputting an optimal parameter set and the decision function, establishing a hierarchical tree-shaped barrel structure according to a certain rule and numbering each barrel according to the hierarchical tree-shaped barrel structure, wherein the height of each barrel and the number of the corresponding barrels at each height;
s40 calculating the account information through function to obtain the number of the corresponding barrel set by the account, and storing the account information in the corresponding barrel of the hierarchical tree-shaped barrel structure according to the number;
checking the information consistency at S50: when a transaction occurs, account information is changed, the account information in the barrel is spliced firstly, hash operation is carried out for one time, then the hash operation is carried out upwards according to the hierarchical tree-shaped barrel structure, and if the account information in the barrel is not changed, the hash operation is not needed; if the account information in the bucket is changed, performing hash operation again to obtain a new hash value of the root node; and checking whether the hash value of the new root node is consistent with the hash values of other trusted nodes, if so, determining that the account information is not tampered, and if not, determining that the account information is tampered, determining that the node is not trusted, and needing to acquire the account information from other trusted nodes to update.
2. The method as claimed in claim 1, wherein the decision function comprises:
(1) according to the formula
Calculating the number of each type of account;
(2) calculating a weight vector
Wherein ω isik＝Pik＝Pi/BiPi is the probability of use of the class i account, PikRepresenting the usage probability of the kth bucket in the ith type account;
(3) increase in weight vector
Zero, becomes ω' ═ 0,. 0, ω, where B represents a hierarchical tree junctionThe number of buckets in the structure, elements in each weight vector represent a bucket, the height of each bucket is initialized to 1, when k weights are combined, the k buckets are determined well, and the obtained elements are combined to represent internal nodes of a tree; each time of combination, the height of the determined barrel is increased by 1;
(4) when the weight number is larger than 1, selecting the minimum weight of k omega', and summing to obtain a new weight;
(5) discarding the k minimum weights, and inserting the generated new weights into ω';
(6) and (5) circularly calculating, namely acquiring the height of each barrel and the number of corresponding barrels on each height according to the circular calculation.
3. The method as claimed in claim 1, wherein the certain rule in 30 is: and storing the buckets containing the account information with the same use frequency at the same height of the tree structure, and if the account transaction frequency of the account information in the buckets is higher, determining that the buckets are higher in the layer number.
4. The method as claimed in claim 1, wherein each of the buckets in S40 stores a plurality of account information.
5. The method for efficient storage of blockchain information based on a hierarchical tree structure as claimed in claim 1, wherein said S10 is preceded by:
s01 RLP encodes the account information, and inputs the RLP-encoded account information.
6. The method as claimed in claim 5, wherein the function calculation selects a modulo function or a random function.
7. The method as claimed in claim 6, wherein if the function calculation selects a modulo function, assuming that there are B buckets in the tree structure, the number is from 0 to B-1, the account is regarded as an integer a, and r is the remainder of a modulo B, and since r is necessarily a number from 0 to B-1, r is the number of the bucket corresponding to account a.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810949802.5A CN109410043B (en) | 2018-08-20 | 2018-08-20 | Block chain information efficient storage method and device based on hierarchical tree structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810949802.5A CN109410043B (en) | 2018-08-20 | 2018-08-20 | Block chain information efficient storage method and device based on hierarchical tree structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109410043A CN109410043A (en) | 2019-03-01 |
| CN109410043B true CN109410043B (en) | 2022-02-18 |
Family
ID=65463709
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810949802.5A Active CN109410043B (en) | 2018-08-20 | 2018-08-20 | Block chain information efficient storage method and device based on hierarchical tree structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109410043B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119763B (en) * | 2019-04-16 | 2021-06-29 | 福建天晴数码有限公司 | Logistic regression data optimization method based on merkel tree idea and storage medium |
| CN111340623B (en) * | 2020-02-21 | 2023-10-24 | 度小满科技(北京)有限公司 | Data storage method and device |
| CN111008201B (en) * | 2020-03-09 | 2020-06-26 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for parallel modification and reading of state trees |
| CN112035491B (en) * | 2020-09-30 | 2021-12-28 | 中山大学 | Data storage method based on block chain, electronic integral processing method and system |
| CN112988761B (en) * | 2021-05-07 | 2022-04-08 | 支付宝(杭州)信息技术有限公司 | Block chain data storage method and device and electronic equipment |
| CN113377979B (en) * | 2021-06-09 | 2023-09-19 | 中国国家铁路集团有限公司 | Merck tree-based train running scheme comparison generation optimization method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106406896A (en) * | 2016-09-27 | 2017-02-15 | 北京天德科技有限公司 | Block chain block-building method based on parallel PipeLine technology |
-
2018
- 2018-08-20 CN CN201810949802.5A patent/CN109410043B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106406896A (en) * | 2016-09-27 | 2017-02-15 | 北京天德科技有限公司 | Block chain block-building method based on parallel PipeLine technology |
Non-Patent Citations (1)
| Title |
|---|
| Poster: Efficient Blockchain-based Software Systems via Hierarchical Bucket Tree;weili chen 等;《2018 IEEE/ACM 40th International conference on software Engineering:companion(ICSE-Companion)》;20170603;360-361 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109410043A (en) | 2019-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109410043B (en) | Block chain information efficient storage method and device based on hierarchical tree structure | |
| CN110602148B (en) | Method and device for generating state tree of block and verifying data on chain | |
| JP6955026B2 (en) | Systems and methods for parallel processing blockchain transactions | |
| CN110033243B (en) | Main chain evidence storing method, system and storage medium based on block chain intelligent contract | |
| JP7208989B2 (en) | A system for recording verification keys on the blockchain | |
| CN109033422B (en) | Method and device for generating block chain and block chain | |
| EP4184404A1 (en) | Script-based blockchain interaction | |
| CN111008201B (en) | Method and apparatus for parallel modification and reading of state trees | |
| CN112261159B (en) | Method and system for executing cross-slice transaction, main chain node and target slicing node | |
| Esiner et al. | Flexdpdp: Flexlist-based optimized dynamic provable data possession | |
| CN109272316B (en) | Block implementing method and system based on block chain network | |
| Unterweger et al. | Lessons learned from implementing a privacy-preserving smart contract in ethereum | |
| US10581616B1 (en) | Managing nodes of a cryptographic hash tree in a hash-based digital signature scheme | |
| Xu et al. | EPBC: Efficient public blockchain client for lightweight users | |
| CN112261157B (en) | Method and system for submitting cross-fragment transaction, main chain node and source fragment node | |
| CN112261162B (en) | Method and system for executing cross-slice transaction, main chain node and target slicing node | |
| CN111640018B (en) | Block chain transaction existence verification method and device | |
| Xu et al. | Efficient public blockchain client for lightweight users | |
| CN108460030A (en) | A kind of set element judgment method based on improved Bloom filter | |
| CN114328518A (en) | UTXO model-based low storage consumption method and system | |
| CN116938523A (en) | Blockchain system, operating method, electronic device and storage medium | |
| CN112261161B (en) | Method for locking partitioned blocks in block chain system and block chain system | |
| Zou et al. | Dynamic provable data possession based on ranked merkle hash tree | |
| CN112396422B (en) | Method and system for submitting cross-slice transaction, main chain node and target slicing node | |
| CN112261156B (en) | Method and system for submitting cross-fragment transaction, main chain node and source fragment node |
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 |