CN112529589A - Processing method and device for long time-consuming blockchain transaction and electronic equipment - Google Patents
Processing method and device for long time-consuming blockchain transaction and electronic equipment Download PDFInfo
- Publication number
- CN112529589A CN112529589A CN202110183467.4A CN202110183467A CN112529589A CN 112529589 A CN112529589 A CN 112529589A CN 202110183467 A CN202110183467 A CN 202110183467A CN 112529589 A CN112529589 A CN 112529589A
- Authority
- CN
- China
- Prior art keywords
- block
- transaction
- type
- execution result
- state
- 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.)
- Granted
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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- 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
Abstract
The invention provides a processing method, a device and an electronic device for long time-consuming block chain transaction, which realize the support of a long time-consuming intelligent contract by setting the maximum execution time length (denoted by max _ exec _ time and taking the number of blocks as a unit) of the intelligent contract transaction when the long time-consuming intelligent contract is deployed (or after the deployment), sequentially submitting the transaction to the execution of an asynchronous execution thread created or distributed for the long time-consuming intelligent contract when the transaction of the long time-consuming intelligent contract is executed in the generation and verification process of the x-th block, counting the transaction execution result into a world state when the (x + max _ exec _ time) th block is generated, and verifying the world state containing the transaction execution result when the (x + max _ exec _ time) th block is verified.
Description
Technical Field
The invention relates to a block chain technology, in particular to the technical field of execution of long-time-consuming intelligent contract transactions.
Background
And calling an intelligent contract to execute the blockchain transaction when the blocks are generated and verified. To reduce latency, improve concurrency and throughput performance, the blockchain protocol stack typically sets time limits for block generation, validation, consensus, etc., either directly or indirectly. This also means that the execution of blockchain transactions that affect block generation and verification are also subject to direct or indirect time constraints. Many applications in reality, when implemented in the form of smart contracts on blockchains, may have transaction execution times that, because of their complexity, greatly exceed the direct or indirect time constraints imposed on blockchain protocol stacks for block generation and verification.
The support of the block link protocol stack on the long time-consuming intelligent contract is a precondition that the block link protocol stack is widely adopted in complex reality application.
Disclosure of Invention
In order to solve at least one of the above technical problems, the present invention provides a method, an apparatus, an electronic device and a readable storage medium for processing a long time-consuming blockchain transaction.
In a first aspect of the present invention, a method for processing a long time-consuming blockchain transaction is provided, including:
the first node acquires a first type transaction and a second type transaction corresponding to the first block;
the first node acquires an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the first node generates a first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block;
the first node executes first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the first node writes the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
In an embodiment of the invention, the first type of transaction includes a long time consuming blockchain transaction, and the second type of transaction includes regular transactions other than the long time consuming blockchain transaction.
Optionally, the method further comprises:
the first node creates a first program and a second program which are executed asynchronously;
the first program is used for acquiring a first type transaction and a second type transaction corresponding to a first block, acquiring an execution result of the first type transaction corresponding to the second block from a preset state library, wherein the difference between the first block and the second block is a preset number of blocks, and generating the first block according to the execution result of the second type transaction corresponding to the first block and the execution result of the first type transaction corresponding to the second block;
the second program is used for executing the first type transaction corresponding to the first block in the blocks with the preset number based on the world state of the first block, and writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
Optionally, the block chain comprises: a first intelligent contract and a second intelligent contract; wherein the first program processes the first type of transaction according to the first intelligent contract and the second program processes the second type of transaction according to the second intelligent contract.
Optionally, the preset number is an adjustable number.
In a second aspect of the present invention, there is provided a first node apparatus, including:
the transaction acquisition module is used for acquiring a first type of transaction and a second type of transaction corresponding to the first block;
the state library reading module is used for acquiring an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the block generation module is used for generating a first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block;
the long time-consuming transaction execution module is used for executing first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the state library writing module is used for writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
Optionally, the apparatus further comprises:
a first program processing module and a second program processing module;
the first program processing module comprises the transaction acquisition module, the state library reading module and the block generation module;
the second program processing module comprises the long and time-consuming transaction execution module and the state library writing module.
In a third aspect of the present invention, a method for processing long time-consuming blockchain transactions is provided, including:
the second node acquires a first type transaction and a second type transaction corresponding to the first block;
the second node acquires an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the second node determines the actual corresponding world state of the first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block;
the second node verifies the alleged world state of the first block according to the actual corresponding world state of the first block;
the second node executes first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the second node writes the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
Optionally, the method further comprises:
the second node creates a first program and a second program which are executed asynchronously;
the first program is used for acquiring a first type transaction and a second type transaction corresponding to a first block, acquiring an execution result of the first type transaction corresponding to a second block from a preset state library, wherein the difference between the first block and the second block is a preset number of blocks, determining a world state actually corresponding to the first block according to the execution result of the second type transaction corresponding to the first block and the execution result of the first type transaction corresponding to the second block, and verifying the alleged world state of the first block according to the world state actually corresponding to the first block;
the second program is used for executing the first type transaction corresponding to the first block in the blocks with the preset number based on the world state of the first block, and writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
Optionally, the block chain comprises: a first intelligent contract and a second intelligent contract; wherein the first program processes the first type of transaction according to the first intelligent contract and the second program processes the second type of transaction according to the second intelligent contract.
Optionally, the preset number is an adjustable number.
In a fourth aspect of the present invention, there is provided a second node apparatus, including:
the transaction acquisition module is used for acquiring a first type of transaction and a second type of transaction corresponding to the first block;
the state library reading module is used for acquiring an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the block verification module is used for determining the actual corresponding world state of the first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block; verifying the purported world state of the first block according to the actual corresponding world state of the first block;
the long time-consuming transaction execution module is used for executing first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the state library writing module is used for writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
Optionally, the apparatus further comprises:
a first program processing module and a second program processing module;
the first program processing module comprises the transaction acquisition module, the state library reading module and the block verification module;
the second program processing module comprises the long and time-consuming transaction execution module and the state library writing module.
In a fifth aspect of the invention, there is provided an electronic device comprising a memory and a processor, the memory being configured to store computer instructions for execution by the processor to perform the method according to the first aspect of the invention, or for execution by the processor to perform the method according to the third aspect of the invention.
A sixth aspect of the invention provides a readable storage medium having stored thereon computer instructions which, when executed by a processor, implement the method of the first aspect of the invention or which, when executed by a processor, implement the method of the third aspect of the invention.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description serve to explain the principles of the invention.
FIG. 1 illustrates an overall architecture of the present invention that supports long time consuming intelligent contract transactions.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are for purposes of illustration only and are not to be construed as limitations of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
In addition, the embodiments of the present invention and the features of the embodiments may be combined with each other without conflict. The following detailed description will be made in conjunction with embodiments with reference to the accompanying drawings.
The invention introduces a new parameter, called the maximum execution duration (max _ exec _ time) of the transaction, for the intelligent contract in the blockchain protocol stack, which is expressed in terms of the number of blocks. That is, if the max _ exec _ time parameter of a smart contract is set to m, then the maximum execution time for a transaction of the smart contract is the total time for generation, verification, and consensus of m-1 blocks. If the transaction of the smart contract is triggered to execute at the xth block, its state participates in the consensus at the (x + max _ exec _ time) th block and accounts for the world state of the block chain after confirmation.
The maximum execution time (max _ exec _ time) of the transaction of one intelligent contract is defaulted to be 1 so as to be compatible with the prior intelligent contract transaction execution logic of the invention, namely, the transaction of the intelligent contract is directly executed when the transaction of the intelligent contract participates in block generation, the state is counted, the transaction is executed when the block is verified, and the state is verified.
First, the overall architecture.
As shown in the architectural diagram of fig. 1, each blockchain protocol stack has an explicit or implicit intelligent contract deployment module (block 101) and a block generation and validation module (block 105). The present invention introduces a state of intelligent contract deployment parameters (block 102) in the blockchain world state to preserve a maximum execution duration parameter for the transaction of each deployed long time consuming intelligent contract. The present invention also introduces a long time-consuming intelligent contract transaction execution state library module (block 103), and an asynchronous execution thread for each long time-consuming intelligent contract (block 104). The asynchronous execution thread created or assigned for each long-consuming smart contract executes the transaction for that smart contract that it received from the block generation and verification module and completes execution (or fails timeout) within (max _ exec _ time-1) block generation and consensus times, and then credits the execution results of the transaction to the execution state library module in the long-consuming smart contract transaction (block 103).
And II, executing the process.
The maximum execution time parameter (max _ exec _ time) (of a transaction) for a long-consuming intelligent contract may be set by the owner or deployer of the intelligent contract (block 100) at or after contract deployment and saved to the intelligent contract deployment parameter (block 102) via the intelligent contract deployment module (block 101). In the present invention, the generating logic of the xth block is as follows:
(1) and the block generation node selects the transaction list contained in the block x according to a preset rule. If a transaction is not executed by a long, time-consuming intelligent contract, it is executed immediately. If a transaction is being executed by the long time-consuming smart contract, transaction execution information (transaction ID, block number x) is submitted to the asynchronous execution thread created or assigned for the long time-consuming smart contract (block 104). Here, the asynchronous execution thread of a long time-consuming intelligent contract does not necessarily correspond to an operating system thread, and may be other parallel execution modes such as a process, and may be multiple threads if necessary and allowed.
(2) The block generation node reads all transaction execution states that need to be entered in the x-th block from the long time-consuming intelligent contract transaction execution state library module (block 103), and enters the world state reached by the x-th block together with the execution states of the non-long time-consuming intelligent contract transactions of the block to participate in consensus.
(3) The asynchronous execution thread of the long time-consuming smart contract (block 104) executes all transactions of the long time-consuming smart contract contained in the xth block based on the world state reached by the xth block before the (x + max _ exec _ time) block occurs, and credits the execution result and the target state block (x + max _ exec _ time, i.e., the block that needs to be credited to the result state of the transaction) into the long time-consuming smart contract transaction execution state library block (block 103).
In the present invention, the verification logic of the xth block is as follows:
(1) the block verification node reads the transaction list contained in block x. If a transaction is not executed by a long, time-consuming intelligent contract, it is executed immediately.
(2) The block verification node reads all transaction execution states that need to be accounted in the x-th block from the long time-consuming intelligent contract transaction execution state library module (block 103), reaches a new world state together with the execution state of the non-long time-consuming intelligent contract transactions of the block, and compares it with the purported world state in the x-th block. If not, the verification fails and terminates; if so, continuing:
(3) for each transaction in the transaction list that is executed by the long time-consuming smart contract, transaction execution information (transaction ID, block number x) is submitted to the asynchronous execution thread created or assigned for the long time-consuming smart contract (block 104). Here, the asynchronous execution thread of a long time-consuming intelligent contract does not necessarily correspond to an operating system thread, and may be other parallel execution modes such as a process, and may be multiple threads if necessary and allowed.
(4) The asynchronous execution thread of the long time-consuming smart contract (block 104) executes all transactions of the long time-consuming smart contract contained in the xth block based on the world state reached by the xth block before the (x + max _ exec _ time) block occurs, and credits the execution result and the target state block (x + max _ exec _ time, i.e., the block that needs to be credited to the result state of the transaction) into the long time-consuming smart contract transaction execution state library block (block 103).
By setting the maximum execution time (max _ exec _ time) of the transaction of the long time-consuming intelligent contract as required by the owner (deployer) of the intelligent contract at the time of deployment or after the deployment, and accordingly correcting the modes of block generation, verification and long time-consuming intelligent contract transaction execution, the block chain can really support complex time-consuming real application.
It should be understood that the various techniques described herein may be implemented in connection with hardware or software or, alternatively, with a combination of both. Thus, the methods and apparatus of the present invention, or certain aspects or portions thereof, may take the form of program code (i.e., instructions) embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other machine-readable storage medium, wherein, when the program is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention.
In the case of program code execution on programmable computers, the computing device will generally include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Wherein the memory is configured to store program code; the processor is configured to perform the various methods of the present invention according to instructions in the program code stored in the memory.
By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer-readable media includes both computer storage media and communication media. Computer storage media store information such as computer readable instructions, data structures, program modules or other data. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. Combinations of any of the above are also included within the scope of computer readable media.
Those skilled in the art will appreciate that the modules or units or components of the apparatus in the examples invented herein may be arranged in an apparatus as described in this embodiment or alternatively may be located in one or more apparatuses different from the apparatus in this example. The modules in the foregoing examples may be combined into one module or may be further divided into multiple sub-modules.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features of the invention in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so invented, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature of the invention in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the claims, any of the claimed embodiments may be used in any combination.
As used herein, unless otherwise specified the use of the ordinal adjectives "first", "second", "third", etc., to describe a common object, merely indicate that different instances of like objects are being referred to, and are not intended to imply that the objects so described must be in a given sequence, either temporally, spatially, in ranking, or in any other manner.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this description, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as described herein. Furthermore, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the appended claims. The present invention is to be considered as illustrative and not restrictive in character, with the scope of the invention being indicated by the appended claims.
Claims (14)
1. A method for processing long time consuming blockchain transactions, comprising:
the first node acquires a first type transaction and a second type transaction corresponding to the first block;
the first node acquires an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the first node generates a first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block;
the first node executes first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the first node writes the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
2. The method of claim 1, further comprising:
the first node creates a first program and a second program which are executed asynchronously;
the first program is used for acquiring a first type transaction and a second type transaction corresponding to a first block, acquiring an execution result of the first type transaction corresponding to the second block from a preset state library, wherein the difference between the first block and the second block is a preset number of blocks, and generating the first block according to the execution result of the second type transaction corresponding to the first block and the execution result of the first type transaction corresponding to the second block;
the second program is used for executing the first type transaction corresponding to the first block in the blocks with the preset number based on the world state of the first block, and writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
3. The method of claim 2, wherein the blockchain comprises: a first intelligent contract and a second intelligent contract; wherein the first program processes the first type of transaction according to the first intelligent contract and the second program processes the second type of transaction according to the second intelligent contract.
4. The method of claim 1, wherein said predetermined number is an adjustable number.
5. A first node apparatus, comprising:
the transaction acquisition module is used for acquiring a first type of transaction and a second type of transaction corresponding to the first block;
the state library reading module is used for acquiring an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the block generation module is used for generating a first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block;
the long time-consuming transaction execution module is used for executing first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the state library writing module is used for writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
6. The apparatus of claim 5, further comprising:
a first program processing module and a second program processing module;
the first program processing module comprises the transaction acquisition module, the state library reading module and the block generation module;
the second program processing module comprises the long and time-consuming transaction execution module and the state library writing module.
7. A method for processing long time consuming blockchain transactions, comprising:
the second node acquires a first type transaction and a second type transaction corresponding to the first block;
the second node acquires an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the second node determines the actual corresponding world state of the first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block;
the second node verifies the alleged world state of the first block according to the actual corresponding world state of the first block;
the second node executes first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the second node writes the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
8. The method of claim 7, further comprising:
the second node creates a first program and a second program which are executed asynchronously;
the first program is used for acquiring a first type transaction and a second type transaction corresponding to a first block, acquiring an execution result of the first type transaction corresponding to a second block from a preset state library, wherein the difference between the first block and the second block is a preset number of blocks, determining a world state actually corresponding to the first block according to the execution result of the second type transaction corresponding to the first block and the execution result of the first type transaction corresponding to the second block, and verifying the alleged world state of the first block according to the world state actually corresponding to the first block;
the second program is used for executing the first type transaction corresponding to the first block in the blocks with the preset number based on the world state of the first block, and writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
9. The method of claim 8, wherein the blockchain comprises: a first intelligent contract and a second intelligent contract; wherein the first program processes the first type of transaction according to the first intelligent contract and the second program processes the second type of transaction according to the second intelligent contract.
10. The method of claim 7, wherein said predetermined number is an adjustable number.
11. A second node apparatus, comprising:
the transaction acquisition module is used for acquiring a first type of transaction and a second type of transaction corresponding to the first block;
the state library reading module is used for acquiring an execution result of the first type of transaction corresponding to the second block from a preset state library; the difference between the first block and the second block is a preset number of blocks;
the block verification module is used for determining the actual corresponding world state of the first block according to the execution result of the second type of transaction corresponding to the first block and the execution result of the first type of transaction corresponding to the second block; verifying the purported world state of the first block according to the actual corresponding world state of the first block;
the long time-consuming transaction execution module is used for executing first type transactions corresponding to the first block in the blocks with the preset number based on the world state corresponding to the first block;
and the state library writing module is used for writing the execution result of the first type transaction corresponding to the first block and the information of the first block into the state library.
12. The apparatus of claim 11, further comprising:
a first program processing module and a second program processing module;
the first program processing module comprises the transaction acquisition module, the state library reading module and the block verification module;
the second program processing module comprises the long and time-consuming transaction execution module and the state library writing module.
13. An electronic device comprising a memory and a processor, the memory for storing computer instructions, wherein the computer instructions are executable by the processor to implement the method of any one of claims 1-4, or wherein the computer instructions are executable by the processor to implement the method of any one of claims 7-10.
14. A readable storage medium having stored thereon computer instructions, which when executed by a processor, implement the method of any one of claims 1-4; the computer instructions, when executed by a processor, implement the method of any one of claims 7-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110183467.4A CN112529589B (en) | 2021-02-10 | 2021-02-10 | Processing method and device for long time-consuming blockchain transaction and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110183467.4A CN112529589B (en) | 2021-02-10 | 2021-02-10 | Processing method and device for long time-consuming blockchain transaction and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112529589A true CN112529589A (en) | 2021-03-19 |
| CN112529589B CN112529589B (en) | 2021-07-27 |
Family
ID=74975706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110183467.4A Active CN112529589B (en) | 2021-02-10 | 2021-02-10 | Processing method and device for long time-consuming blockchain transaction and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112529589B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110291550A (en) * | 2018-11-27 | 2019-09-27 | 阿里巴巴集团控股有限公司 | The system and method for improving the safety of intelligent contract on block chain |
| CN110648136A (en) * | 2019-09-10 | 2020-01-03 | 杭州秘猿科技有限公司 | Consensus and transaction synchronous parallel processing method and device and electronic equipment |
| CN111008206A (en) * | 2019-11-21 | 2020-04-14 | 深圳壹账通智能科技有限公司 | Method and device for storing state data of cross-chain transaction and storage medium |
| CN111478827A (en) * | 2020-06-24 | 2020-07-31 | 支付宝(杭州)信息技术有限公司 | Pressure testing method, device and system for block chain network |
| CN111541756A (en) * | 2020-04-17 | 2020-08-14 | 腾讯科技（深圳）有限公司 | Block generation method, block generation device, node equipment and storage medium |
| US10873456B1 (en) * | 2019-05-07 | 2020-12-22 | LedgerDomain, LLC | Neural network classifiers for block chain data structures |
-
2021
- 2021-02-10 CN CN202110183467.4A patent/CN112529589B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110291550A (en) * | 2018-11-27 | 2019-09-27 | 阿里巴巴集团控股有限公司 | The system and method for improving the safety of intelligent contract on block chain |
| US10873456B1 (en) * | 2019-05-07 | 2020-12-22 | LedgerDomain, LLC | Neural network classifiers for block chain data structures |
| CN110648136A (en) * | 2019-09-10 | 2020-01-03 | 杭州秘猿科技有限公司 | Consensus and transaction synchronous parallel processing method and device and electronic equipment |
| CN111008206A (en) * | 2019-11-21 | 2020-04-14 | 深圳壹账通智能科技有限公司 | Method and device for storing state data of cross-chain transaction and storage medium |
| CN111541756A (en) * | 2020-04-17 | 2020-08-14 | 腾讯科技（深圳）有限公司 | Block generation method, block generation device, node equipment and storage medium |
| CN111478827A (en) * | 2020-06-24 | 2020-07-31 | 支付宝(杭州)信息技术有限公司 | Pressure testing method, device and system for block chain network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112529589B (en) | 2021-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210250164A1 (en) | Methods and apparatuses for executing smart contract of blockchain, and electronic devices | |
| CN111241061A (en) | Writing method of state database, data processing device and storage medium | |
| WO2019148721A1 (en) | Electronic device, risk early warning method for internet service system, and storage medium | |
| CN113157710B (en) | Block chain data parallel writing method and device, computer equipment and storage medium | |
| CN110503544A (en) | Collage-credit data reports and submits method, apparatus, system, computer equipment and storage medium | |
| CN113886162A (en) | Computing equipment performance test method, computing equipment and storage medium | |
| US20220067033A1 (en) | Method and apparatus for processing data for a blockchain | |
| CN105225125A (en) | Information calibration method and equipment | |
| CN106060130A (en) | Verification method and system of merchandise inventory | |
| US11361096B2 (en) | Controlled publication of sensitive data within an established timeframe | |
| CN112529589B (en) | Processing method and device for long time-consuming blockchain transaction and electronic equipment | |
| CN108287771A (en) | A kind of data verification method, device and equipment | |
| WO2021129005A1 (en) | Blockchain state change-based transaction tracking method and device | |
| CN110706108B (en) | Method and apparatus for concurrently executing transactions in a blockchain | |
| CN108132811A (en) | A kind of loading method and device of FPGA program datas | |
| WO2024039791A1 (en) | Single step staking for smart contracts and other blockchain transactions | |
| CN112508577A (en) | Block generation and verification method and device, electronic equipment and readable storage medium | |
| KR102637173B1 (en) | System of Blockchain Framework for 5G Mobile Edge Computing, Device and Management Method thereof | |
| CN111083221B (en) | Transaction verification method and device | |
| CN115170312A (en) | Asset state information changing method and device on block chain | |
| CN110347683B (en) | Data table merging processing method and device | |
| CN112508574A (en) | Block chain parallel transaction execution method and device and electronic equipment | |
| CN110310196A (en) | Product demand application method, device, computer equipment and storage medium | |
| CN108804214B (en) | Asynchronous task scheduling method and device and electronic equipment | |
| CN112732367A (en) | Event flow processing method, device and equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |