CN114138903B - Multi-main-chain cross-chain method, computer device and storage medium - Google Patents
Multi-main-chain cross-chain method, computer device and storage medium Download PDFInfo
- Publication number
- CN114138903B CN114138903B CN202111456551.5A CN202111456551A CN114138903B CN 114138903 B CN114138903 B CN 114138903B CN 202111456551 A CN202111456551 A CN 202111456551A CN 114138903 B CN114138903 B CN 114138903B
- Authority
- CN
- China
- Prior art keywords
- transaction
- main chain
- chain
- zero
- backbone
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000003860 storage Methods 0.000 title claims abstract description 15
- 238000012546 transfer Methods 0.000 claims abstract description 31
- 238000012795 verification Methods 0.000 claims description 27
- 238000004590 computer program Methods 0.000 claims description 9
- 238000005096 rolling process Methods 0.000 claims description 4
- 101500021084 Locusta migratoria 5 kDa peptide Proteins 0.000 description 14
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 241000209202 Bromus secalinus Species 0.000 description 1
- 238000004132 cross linking Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- 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
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Software Systems (AREA)
- Computing Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a multi-main-chain crossing method, a computer device and a storage medium, wherein the method comprises the following steps: when the first main chain is monitored to generate a first main chain block, sequentially synchronizing first transactions requiring transfer type contracts in the first main chain block; the following operations are performed for each first transaction: judging whether the transfer type contract called by the first transaction is a cross-chain transfer contract or not: if not, executing a first transaction to update a first state tree of a first main chain on the two-layer network; if yes, executing a first transaction to update a first state tree of a first main chain on the two-layer network, and a second state tree of a second main chain to be crossed, which is designated by the first transaction; generating zero knowledge proof evidence according to the transaction information of each first transaction in sequence, and generating first proof data according to each first transaction in sequence and the zero knowledge proof evidence; the first attestation data is sent to the first backbone and to the other backbones. The application prevents double flowers on the basis of saving cost.
Description
Technical Field
The application relates to the technical field of blockchain, in particular to a multi-main-chain cross-link method, computer equipment and a storage medium.
Background
Current two-tier network-based cross-link schemes are generally one-to-one, with one two-tier network corresponding to one backbone. The applicant hopes to propose a two-layer network corresponding to a plurality of main chains, which is more cost-effective than the prior art, but also has the double-flower problem.
Disclosure of Invention
In view of the foregoing drawbacks or deficiencies of the prior art, it is desirable to provide a multi-backbone cross-link method, computer device and storage medium that prevents double-bloom on a cost-effective basis.
In a first aspect, the present invention provides a multi-backbone cross-link method applicable to a node of a two-layer network, the two-layer network has state trees corresponding to each backbone, initial root hashes of each state tree are the same, each backbone is configured with a cross-link authentication contract, and a zero knowledge proof circuit for authenticating transaction information is deployed in the cross-link authentication contract, the method includes:
when the first main chain is monitored to generate a first main chain block, sequentially synchronizing first transactions requiring transfer type contracts in the first main chain block; wherein the transfer type contracts include deposit contracts, withdrawal contracts, transfer contracts, and cross-chain transfer contracts;
The following operations are performed for each first transaction:
Judging whether the transfer type contract called by the first transaction is a cross-chain transfer contract or not:
if not, executing a first transaction to update a first state tree of a first main chain on the two-layer network;
If yes, executing a first transaction to update a first state tree of a first main chain on the two-layer network, and a second state tree of a second main chain to be crossed, which is designated by the first transaction;
generating zero knowledge proof evidence according to the transaction information of each first transaction in sequence, and generating first proof data according to each first transaction in sequence and the zero knowledge proof evidence;
transmitting the first attestation data to the first backbone and to the other backbones for backbone nodes of the first backbone:
judging whether the sequence of each first transaction in the first proving data and each first transaction in the first main chain block is the same or not through a cross-chain verification contract:
The same, then the zero-knowledge proof evidence is input into the zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct:
If the verification is correct, ending;
the first proof data is also used for the backbone nodes of the other backbones:
Inputting the zero-knowledge proof evidence into a zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct:
and if the verification is correct, executing each first transaction.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the multi-backbone cross-link method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program, where the computer program causes a computer to execute the multi-backbone cross-linking method provided according to the embodiments of the present invention.
According to the multi-main-chain cross-chain method, the computer equipment and the storage medium provided by the embodiments of the invention, when the first main chain is monitored to generate a first main chain block, the first transactions of transfer type contracts needing to be called in the first main chain block are sequentially synchronized; the following operations are performed for each first transaction: judging whether the transfer type contract called by the first transaction is a cross-chain transfer contract or not: if not, executing a first transaction to update a first state tree of a first main chain on the two-layer network; if yes, executing a first transaction to update a first state tree of a first main chain on the two-layer network, and a second state tree of a second main chain to be crossed, which is designated by the first transaction; generating zero knowledge proof evidence according to the transaction information of each first transaction in sequence, and generating first proof data according to each first transaction in sequence and the zero knowledge proof evidence; the method of transmitting the first certification data to the first backbone and other backbones prevents double flowers on a cost-effective basis.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a multi-backbone cross-link method according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be noted that, for convenience of description, only the portions related to the application are shown in the drawings.
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The application will be described in detail below with reference to the drawings in connection with embodiments.
The applicant hopes to propose a two-tier network cross-link scheme corresponding to multiple backbones, which is more cost-effective than the prior art, but also has the double-flower problem-if the operator cheats the deposit and exchanges assets with the other link, the other link cannot be verified. For example, assume 3 backbones (A, B, C); the A chain is operated with an asset AAA, the B chain is operated with an asset BBB, the C chain is operated with an asset CCC, and the exchange ratio of the AAA to the BBB to the CCC is 1:1:1; assuming that the operator deposits 100AAA privately in the two-tier network and immediately exchanges with the BBB of a user in the two-tier network, this 100AAA is empty and eventually fails authentication on the a-chain, but the operator has redeemed the 100BBB and submitted to the B-chain, jeopardizing the B-chain.
The above problems can be solved by the embodiments of the present application.
Fig. 1 is a flowchart of a multi-backbone cross-link method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a multi-backbone cross-link method applicable to a node of a two-layer network, where the two-layer network has state trees corresponding to each backbone, initial root hashes of each state tree are the same, each backbone is configured with a cross-link verification contract, and a zero knowledge proof circuit for verifying transaction information is deployed in the cross-link verification contract, and the method includes:
S11: when the first main chain is monitored to generate a first main chain block, sequentially synchronizing first transactions requiring transfer type contracts in the first main chain block; wherein the transfer type contracts include deposit contracts, withdrawal contracts, transfer contracts, and cross-chain transfer contracts;
The following operations are performed for each first transaction:
s131: judging whether the transfer type contract called by the first transaction is a cross-chain transfer contract or not:
If not, then step S132 is performed: executing a first transaction to update a first state tree of a first backbone on the two-tier network;
If yes, step S133 is executed: executing a first transaction to update a first state tree of a first backbone on the two-tier network, and a second state tree of a second backbone to be cross-linked specified by the first transaction;
s15: generating zero knowledge proof evidence according to the transaction information of each first transaction in sequence, and generating first proof data according to each first transaction in sequence and the zero knowledge proof evidence;
S17: transmitting the first attestation data to the first backbone and to the other backbones for backbone nodes of the first backbone:
judging whether the sequence of each first transaction in the first proving data and each first transaction in the first main chain block is the same or not through a cross-chain verification contract:
The same, then the zero-knowledge proof evidence is input into the zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct:
If the verification is correct, ending;
the first proof data is also used for the backbone nodes of the other backbones:
Inputting the zero-knowledge proof evidence into a zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct:
and if the verification is correct, executing each first transaction.
Specifically, it is assumed that there are 3 main chains (A chain, B chain, C chain); the A chain is operated with an asset AAA, the B chain is operated with an asset BBB, the C chain is operated with an asset CCC, and the exchange ratio of the AAA to the BBB to the CCC is 1:1:1; the two-layer network is provided with a state tree (TreeA) of a chain and a state tree (TreeB) of a B chain, and the state tree (TreeC) of a C chain has the same initial root hash of TreeA, treeB and TreeC; the first main chain is an A chain, and main chain nodes of the A chain sequentially generate main chain blocks (100) according to tx 1-tx 10, wherein tx1 and tx2 are transactions requiring transfer type contracts, tx1 is a request of a user A for depositing 100 AAA, and tx2 is a request of a user B for withdrawing 10 AAA;
The node of the two-layer network executes step S11, and when the A chain is monitored to generate a block (100), the tx1 and tx2 are synchronized;
Taking tx1 as an example:
Step S131 is executed by the node of the two-layer network, and whether the transfer contract called by tx1 is a cross-link transfer contract is judged:
since the transfer type contract called by tx1 is a deposit contract, step S132 is performed: executing tx1 (i.e., user a status data + 100) to update TreeA on the two-tier network;
tx2 is the same and is not described in detail herein;
step S15 is executed by the nodes of the two-layer network, zero knowledge proof evidence proof1 is generated according to the transaction information of tx1 and tx2, and proof data proofchunk1 is generated according to tx1, tx2 and the zero knowledge proof evidence; those skilled in the art will appreciate that transaction information may be configured according to actual needs, and generally includes a transaction sender address, a transaction receiver address, a transaction type, and an amount;
the node of the two-layer network executes step S17 to send the proving data proofchunk1 to the A chain, the B chain and the C chain;
The main chain node of the A chain verifies whether tx1 and tx2 are in the same sequence as tx1 and tx2 in the block (100) through a cross-chain verification contract;
because of the same, inputting the zero-knowledge proof1 into the zero-knowledge proof circuit to verify whether the transaction information of tx1 and tx2 in the proof data is correct;
Assuming that the verification is correct, it ends.
The main chain nodes of the B chain and the C chain input zero knowledge proof1 into a zero knowledge proof circuit to verify whether the transaction information of tx1 and tx2 in the proof data is correct or not because the main chain nodes of the B chain and the C chain do not have the sequence of each transaction of the block (100):
assuming the verification is correct, tx1, tx2 are performed.
The embodiment ensures that a plurality of backbones maintain a common account book on a two-layer network, thereby saving cost; and the two-layer network can continue to normally run only on the basis of correct transaction sequence and transaction information, so that double flowers are prevented.
Preferably, the method further comprises:
When the sequence is monitored to be different, or verification fails, rolling back the first state tree, or rolling back the first state tree and the second state tree to the state when each first transaction is not executed;
Returning to sequentially synchronize first transactions in the first main chain block that require transfer type contracts to regenerate zero knowledge proof evidence and first proof data;
After receiving the regenerated first proof data, the main chain node of each other main chain verifies whether the transaction information of each first transaction in the first proof data is correct or not, and further comprises:
the backbone of the place is rolled back to a state when each first transaction is not executed.
Specifically, taking block (100) as an example, when the nodes of the two-layer network monitor that the sequence is different, or verification fails, the nodes roll back TreeA and TreeB on the two-layer network to a state when tx1 and tx2 are not executed;
the nodes of the two-layer network return to the step of sequentially synchronizing the first transactions requiring transfer type contracts in the first main chain block; eventually, the nodes of the two-layer network will regenerate proof1 and proofchunk1;
after receiving proofchunk of the regenerated link node of the B chain and the C chain, the main chain node of the C chain needs to roll back the main chain to a state when tx1 and tx2 are not executed before verifying whether the transaction information of tx1 and tx2 in proofchunk is correct.
It will be appreciated by those skilled in the art that taking the B-chain as an example, if the backbone node of the B-chain should also roll back tx3 if tx3 is present (tx 3 is performed with tx1 performed results) after receiving the regenerated first proof data.
Preferably, before executing the step of inputting the zero-knowledge proof evidence into the zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct, each other main chain node further includes:
Receiving a backbone node of a first backbone, or each first transaction sent by a relay server;
inputting zero-knowledge proof evidence into the zero-knowledge proof circuit by other main chain nodes of each main chain to verify whether the transaction information of each first transaction in the first proof data is correct or not comprises:
judging whether the sequence of each first transaction in the first proving data and each first transaction sent by the first main chain node or the relay server is the same or not through a cross-link verification contract:
the same, the zero-knowledge proof evidence is input into the zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct.
Specifically, before executing the "input zero-knowledge proof evidence into the zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct", the main chain nodes of the B chain and the C chain further include:
receiving a main chain node of the A chain or tx1 and tx2 sent by a relay server;
at this time, if the main chain nodes of the B chain and the C chain have the transaction order, the main chain nodes of the B chain and the C chain are the same as the main chain nodes of the a chain, or if the orders of tx1 and tx2 in proofchunk1 and tx2 transmitted by the main chain nodes of the a chain or the relay server are the same may be determined by the cross-chain verification contract.
Preferably, the nodes of the two-layer network pay a plurality of deposit on each main chain, and when the main chain nodes of the first main chain monitor that the sequence is different, or verification fails, the first number of deposit is deducted; the first number of deposit is deducted when the verification fails.
Assuming that all of the main chain nodes of the A chain to the C chain fail verification, the main chain nodes of the A chain to the C chain deduct a first number of deposit of the nodes of the two-layer network.
The above embodiment penalizes the nodes of the two-layer network, further preventing double flowers.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides an apparatus 200 including one or more Central Processing Units (CPUs) 201, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 202 or a program loaded from a storage portion 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data required for the operation of the apparatus 200 are also stored. The CPU201, ROM202, and RAM203 are connected to each other through a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
The following components are connected to the I/O interface 205: an input section 206 including a keyboard, a mouse, and the like; an output portion 207 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 208 including a hard disk or the like; and a communication section 209 including a network interface card such as a LAN card, a modem, and the like. The communication section 209 performs communication processing via a network such as the internet. The drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 210 as needed, so that a computer program read out therefrom is installed into the storage section 208 as needed.
In particular, according to embodiments of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 209, and/or installed from the removable medium 211.
As still another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the apparatus of the above-described embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors to perform the methods described herein.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules involved in the embodiments of the present application may be implemented in software or in hardware. The described units or modules may also be provided in a processor, for example, each of the units may be a software program provided in a computer or a mobile smart device, or may be separately configured hardware devices. Wherein the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The above description is only illustrative of the preferred embodiments of the present application and of the principles of the technology employed. It will be appreciated by persons skilled in the art that the scope of the application referred to in the present application is not limited to the specific combinations of the technical features described above, but also covers other technical features formed by any combination of the technical features described above or their equivalents without departing from the spirit of the application. Such as the above-mentioned features and the technical features disclosed in the present application (but not limited to) having similar functions are replaced with each other.
Claims (6)
1. The multi-main-chain cross-link method is characterized in that a two-layer network is provided with state trees corresponding to the main chains respectively, initial root hashes of the state trees are the same, the main chains are provided with cross-link verification contracts, a zero-knowledge proof circuit for verifying transaction information is deployed in the cross-link verification contracts, the method is suitable for nodes of the two-layer network, and the method comprises the following steps:
When the first main chain is monitored to generate a first main chain block, sequentially synchronizing first transactions requiring transfer type contracts in the first main chain block; wherein the transfer type contracts include deposit contracts, withdrawal contracts, transfer contracts, and cross-chain transfer contracts;
Performing the following operations on each of the first transactions:
Judging whether the transfer type contract called by the first transaction is a cross-chain transfer contract or not:
if not, executing the first transaction to update a first state tree of the first main chain on the two-layer network;
if yes, executing the first transaction to update a first state tree of the first main chain on the two-layer network, and a second state tree of a second main chain to be crossed by the first transaction;
Generating zero knowledge proof evidence according to the transaction information of each first transaction in sequence, and generating first proof data according to each first transaction and the zero knowledge proof evidence in sequence;
transmitting the first attestation data to the first backbone and other backbones for backbone nodes of the first backbone:
judging whether the order of each first transaction in the first proving data and each first transaction in the first main chain block is the same or not through the cross-chain verification contract:
The zero-knowledge proof is input into the zero-knowledge proof circuit to verify whether the transaction information of each of the first transactions in the first proof data is correct:
If the verification is correct, ending;
The first proof data is also used for backbone nodes of other backbones:
Inputting the zero-knowledge proof evidence into the zero-knowledge proof circuit to verify whether the transaction information of each of the first transactions in the first proof data is correct:
and if the verification is correct, executing each first transaction.
2. The method as recited in claim 1, further comprising:
When the sequence is monitored to be different, or verification fails, rolling back the first state tree, or rolling back the first state tree and the second state tree to the state when each first transaction is not executed;
returning to said sequentially synchronizing first transactions in said first backbone block requiring transfer type contracts to regenerate said zero knowledge proof evidence and said first proof data;
after receiving the regenerated first proof data, the main chain node of each other main chain verifies whether the transaction information of each first transaction in the first proof data is correct or not, and further comprises:
Rollback the backbone to a state when each of the first transactions is not performed.
3. The method of claim 1, wherein the other backbone nodes of each backbone, prior to performing said entering the zero-knowledge proof evidence into the zero-knowledge proof circuit to verify whether the transaction information for each of the first transactions in the first proof data is correct, further comprise:
Receiving a backbone node of the first backbone, or each of the first transactions sent by a relay server;
The inputting the zero-knowledge proof evidence into the zero-knowledge proof circuit by the main chain nodes of the other main chains to verify whether the transaction information of each of the first transactions in the first proof data is correct includes:
judging whether the order of each first transaction in the first proving data and each first transaction sent by the first main chain node or the relay server is the same or not through the cross-link verification contract:
And if the first transaction information is the same, inputting the zero-knowledge proof evidence into the zero-knowledge proof circuit to verify whether the transaction information of each first transaction in the first proof data is correct.
4. The method of claim 1, wherein nodes of the two-tier network pay for a number of deposits on each backbone, and wherein backbone nodes of the first backbone deduct a first number of deposits when a different order is detected or verification fails; the first number of deposit is deducted when the verification fails.
5. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
The one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-4.
6. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111456551.5A CN114138903B (en) | 2021-12-02 | 2021-12-02 | Multi-main-chain cross-chain method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111456551.5A CN114138903B (en) | 2021-12-02 | 2021-12-02 | Multi-main-chain cross-chain method, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114138903A CN114138903A (en) | 2022-03-04 |
| CN114138903B true CN114138903B (en) | 2024-10-25 |
Family
ID=80386884
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111456551.5A Active CN114138903B (en) | 2021-12-02 | 2021-12-02 | Multi-main-chain cross-chain method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114138903B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114266665A (en) * | 2021-12-31 | 2022-04-01 | 杭州复杂美科技有限公司 | Contract multi-backbone cross-link method, device and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109857580B (en) * | 2019-03-12 | 2022-06-07 | 深圳市迅雷网络技术有限公司 | Block chain cross-chain contract calling method and device and storage medium |
| CN110443704B (en) * | 2019-06-28 | 2021-02-19 | 创新先进技术有限公司 | Method and device for sending resources in cross-link mode |
| CN111476670B (en) * | 2020-04-08 | 2023-05-30 | 杭州复杂美科技有限公司 | Block chain rollback insurance method, apparatus and storage medium |
-
2021
- 2021-12-02 CN CN202111456551.5A patent/CN114138903B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114266665A (en) * | 2021-12-31 | 2022-04-01 | 杭州复杂美科技有限公司 | Contract multi-backbone cross-link method, device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114138903A (en) | 2022-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109410045B (en) | Parallel chain consensus method, equipment and storage medium | |
| CN110084601B (en) | Parallel chain main chain transaction state synchronization method, equipment and storage medium | |
| CN109377365B (en) | Asset transfer method, device and storage medium | |
| CN111080449A (en) | Cross-chain transaction method of blockchain, management node, blockchain network | |
| CN109981279B (en) | Block chain system, communication method, device, equipment and medium | |
| CN109558454B (en) | Parallel chain mining consensus method, apparatus and storage medium | |
| CN112650764A (en) | Cross-chain data processing method, device, equipment and storage medium | |
| CN109146490A (en) | block generation method, device and system | |
| CN108712491A (en) | Block chain node, exchange information processing method, terminal device and medium | |
| CN110221938A (en) | The method and storage medium of electronic device, block chain common recognition | |
| CN114266665B (en) | Contract multi-main chain crossing method, equipment and storage medium | |
| CN109005208B (en) | Method and device for pushing information | |
| CN112184436B (en) | Data synchronization method, electronic device and readable storage medium | |
| CN114283010B (en) | Multi-main-chain crossing method based on multi-main-chain two-layer network state tree | |
| CN113138880B (en) | Block chain system gray level publishing method, device, equipment and storage medium | |
| CN112087497B (en) | Data synchronization method and device, electronic equipment and readable storage medium | |
| CN111008249B (en) | Parallel chain block synchronization method, device and storage medium | |
| US20230004465A1 (en) | Distributed database system and data disaster backup drilling method | |
| CN114202425B (en) | Oracle multi-main chain cross-chain method, device and storage medium | |
| CN114138903B (en) | Multi-main-chain cross-chain method, computer device and storage medium | |
| CN110780945A (en) | Cross-chain bridging method, equipment and storage medium capable of plugging heterogeneous block chain | |
| CN111523896B (en) | Attack prevention method, apparatus and storage medium | |
| CN112184227A (en) | Parallel chain supervision consensus method, equipment and storage medium | |
| CN112819625B (en) | Parallel chain arbitration consensus method, computer device, and storage medium | |
| US11706295B2 (en) | System and a method implementing a directed acyclic graph (DAG) consensus algorithm via a gossip protocol |
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 |