CN112633868A - Cross-chain asset transfer method based on intelligent contract implementation - Google Patents
Cross-chain asset transfer method based on intelligent contract implementation Download PDFInfo
- Publication number
- CN112633868A CN112633868A CN201910951565.0A CN201910951565A CN112633868A CN 112633868 A CN112633868 A CN 112633868A CN 201910951565 A CN201910951565 A CN 201910951565A CN 112633868 A CN112633868 A CN 112633868A
- Authority
- CN
- China
- Prior art keywords
- chain
- sub
- contract
- node
- roll
- 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/08—Payment architectures
- G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
- G06Q20/102—Bill distribution or payments
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Computer Security & Cryptography (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a cross-chain asset transfer method based on intelligent contracts, which comprises the steps of designing a SLife structure of a main chain + a sub-chain, selecting a sub-chain common identification node from super nodes of the SLife main chain by designing Fts variant algorithm, submitting a public key address and a domain name of a sub-chain verification node to a main chain contract by referring to a G.O.D algorithm, acquiring information required by a consistent sub-chain gene document from a contract interface by a user, and polling and signing on-chain states of a sub-chain contract by referring to a DKG algorithm design independent process signing mechanism; the invention realizes the value exchange function of points and the like of different platforms, can realize the trueness and credibility of point exchange of different platforms, and practically realizes distributed service tracing without tampering; by means of the intelligent contract + protocol combination mode, share exchange and transfer among different chains can be achieved under the condition of small resource deployment and consumption, and the intelligent contract + protocol combination mode has good flexibility and expansibility.
Description
Technical Field
The invention relates to the technical field of cross-chain, in particular to a cross-chain asset transfer method based on an intelligent contract.
Background
The block chain crossing means that the value can cross the barriers between chains through a technical means and direct circulation is carried out. It is simple to have information from one chain to another. The easiest to understand is to trade ETH for BTC, simply asset exchange.
Value circulation is a type of blockchain that is a distributed ledger. A block chain is an independent account book, two different chains are two different independent account books, and the two account books are not related. There is essentially no way to transfer value between accounts, but for a particular user, the value that the user stores on one blockchain can become the value on the other chain, which is the circulation of value.
Token: the Chinese character instant certificate is a negotiable certificate, is a representation of digital assets, and has multiple attributes such as use right, income right and the like.
The cross-chain basic requirements are asset exchange and asset transfer, wherein the asset exchange means that A wants to exchange the Token of the Y chain by using the Token of the X chain, B wants to exchange the Token of the X chain by using the currency of the Y chain, and the exchange of the A and the B is successful through system matching; asset transfer refers to a wanting to transfer an X chain asset (Token) to another blockchain, lock on the X chain, and re-cast an equal equivalent coin on the new chain. Because the property of the block chain is particularly obvious, the cross-chain is different from the traditional internet information transfer, the motivation of the participants for lying is enhanced, and meanwhile, the application deployed on the A chain can support the Token of other chains.
The existing chain-crossing technology is not realized by means of intelligent contract + protocol combination, the execution efficiency is not high, the related resources are large, and the common identification scheme in the current industry has the limitation of the processing chain.
Disclosure of Invention
The invention aims to provide a cross-chain asset transfer method based on intelligent contracts, so as to solve the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme: a cross-chain asset transfer method based on intelligent contract implementation comprises the following specific steps:
s1: designing SLife structures of a main chain and a sub chain, respectively adopting a Dpos + PBFT consensus algorithm, and realizing interconnection and intercommunication by adopting a double contract and independent visa mechanism; the main chain ensures the fund safety of the sub-chains, supports the expansion of the sub-chains of different types and caters to commercial application, and the sub-chains have complete and independent application scenes and consensus; the method specifically comprises the following steps:
s11: the contract of the sub-chain locks all funds of the sub-chain, and the contract of the main chain controls the release of the funds of the sub-chain;
s12: the user completes mortgage, locking and roll-out in the main chain contract, then completes unlocking and roll-in on the sub-chain contract, and the user can complete mortgage, locking and roll-out on the sub-chain contract and complete unlocking and roll-in on the main chain contract after having funds on the sub-chain;
s13: a user waits for the confirmation of a visa mechanism of a plurality of node independent processes in the process of transferring in and out on a main chain and a sub chain, visa achieves a movable consensus certificate for the state on the chain based on a contract interface, and carries out group visa on a plurality of fields;
s2: the design Fts variant algorithm selects a child chain consensus node from the super nodes of the SLife main chain, specifically:
s21: combining all the rights and interests into a merkleTree, wherein the form of the merkleTree is that the weight of a non-leaf node is the sum of the weights of the left subtree and the right subtree, and the weight of a leaf node is the rights and interests value of a certain owner;
s22: starting from a root node of the merkleTree, using a random seed as a random source, using a pseudo random number generator to generate a random number smaller than the weight of a current tree node, if the random number is smaller than the weight of a left sub-tree, selecting the left sub-tree to continue traversing, otherwise, selecting a right sub-tree to continue traversing until a certain leaf node is selected;
s3: submitting a public key address and a domain name of a child chain verification node to a main chain contract by referring to a G.O.D algorithm, wherein the public key address and the domain name are used for a user to acquire information required by a consistent child chain genetics file from a contract interface, and the method specifically comprises the following steps:
s31: a submission stage: each node locally generates a random number and broadcasts a corresponding commitment and the random number split by a secret sharing algorithm to other nodes;
s32: an opening stage: after each node receives the promise, broadcasting the random number of the node;
s33: and (3) a recovery stage: the method comprises the steps of using an opening verification promise, broadcasting secret sharing corresponding to the promise if the promise is not opened, collecting the secret sharing to recover corresponding random numbers, and carrying out XOR on the random numbers of all nodes to finally obtain a consistent random number;
s4: an independent process visa mechanism is designed by referring to a DKG algorithm to carry out polling issuance on the on-chain state of a sub-chain contract, and the method specifically comprises the following steps:
s41: deploying protocol contract codes in the A chain and the B chain;
s42: adding a verification node public key and setting conversion proportion information;
s43: acquiring corresponding share token operation on an exchange A chain;
s44: calculating the number of the mortals on the equivalent B chain, making a transfer application and sending an event;
s45: receiving a roll-out event by a certain verification node on the chain A;
s46: monitoring an event, generating a signature by using the user address, the roll-out A share, the roll-out B share, the counter and the timestamp, and submitting the signature to a connector contract for signature verification operation;
s47: the verification nodes on the chain A are synchronously verified and signed through verification, and corresponding contract codes are executed on the chain B to verify the certificate;
s48: after the verification and signing are finished, adding corresponding B asset shares on the B chain address of the user, calculating the share number on the equivalent B chain, making a roll-out application well to send out an event, and finishing well adding synchronization on an A chain address share roll-out counter of the user.
As a preferable scheme of the invention, the variant algorithm of the pseudo-random number generator is realized based on Hash, Base10 encoding and large number modulus.
In a preferred embodiment of the present invention, the signature verification synchronization ratio in step S37 exceeds two thirds.
Compared with the prior art, the invention has the beneficial effects that:
1. the invention realizes the exchange of different point systems or token systems based on two different block chains from the platform A point system to the platform B point system, thereby realizing the exchange function of values such as points of different platforms; compared with the conventional exchange of digital points or tokens of different platforms, the exchange of the points of different platforms can be true and credible by realizing the scheme and combining with an intelligent contract, and the distributed service tracing is realized practically and cannot be tampered.
2. The invention depends on the intelligent contract + protocol combination mode, can realize share exchange and transfer among different chains under the condition of smaller resource deployment and consumption, and the operation can be operated only once, even if an abnormity occurs, the transfer processing can be continuously completed after the abnormity is recovered.
3. The scheme of the invention can be adopted no matter the main chain-the subchain, the main chain-the main chain and the main chain-the side chain are adopted, and the scheme has better flexibility and expansibility.
4. The SLife subchain supports an intelligent contract, pbft deterministic consensus is adopted, double flowers and branches do not exist, a fraud proof does not need to be submitted to a main chain, and the main chain has no limit on a sub-chain structure; similarly, under the condition that the subchain fund is from the main chain, after the application of the SLife subchain fund is quitted, online waiting is not needed, one or two block-out time can be transferred out, and the efficiency is high.
Drawings
FIG. 1 is a flow chart of the SLife structure of the present invention;
FIG. 2 is a schematic diagram showing the structure of merkleTree in the FTS variant algorithm of the present invention;
FIG. 3 is a schematic flow chart of the DKG algorithm of the present invention;
fig. 4 is a schematic flow chart of the g.o.d algorithm of the present invention;
FIG. 5 is an overall flow chart one of the present invention;
FIG. 6 is a second flowchart of the present invention;
fig. 7 is a third overall flowchart of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-7, the present invention provides a technical solution: a cross-chain asset transfer method based on intelligent contract implementation comprises the following specific steps:
s1: designing SLife structures of a main chain and a sub chain, respectively adopting a Dpos + PBFT consensus algorithm, and realizing interconnection and intercommunication by adopting a double contract and independent visa mechanism; the main chain ensures the fund safety of the sub-chains, supports the expansion of the sub-chains of different types and caters to commercial application, and the sub-chains have complete and independent application scenes and consensus; the method specifically comprises the following steps:
s11: the contract of the sub-chain locks all funds of the sub-chain, and the contract of the main chain controls the release of the funds of the sub-chain;
s12: the user completes mortgage, locking and roll-out in the main chain contract, then completes unlocking and roll-in on the sub-chain contract, and the user can complete mortgage, locking and roll-out on the sub-chain contract and complete unlocking and roll-in on the main chain contract after having funds on the sub-chain;
s13: a user waits for the confirmation of a visa mechanism of a plurality of node independent processes in the process of transferring in and out on a main chain and a sub chain, visa achieves a movable consensus certificate for the state on the chain based on a contract interface, and carries out group visa on a plurality of fields; (as shown in FIG. 1)
S2: the design Fts variant algorithm selects a child chain consensus node from the super nodes of the SLife main chain, specifically:
s21: combining all the rights and interests into a merkleTree, wherein the form of the merkleTree is that the weight of a non-leaf node is the sum of the weights of the left subtree and the right subtree, and the weight of a leaf node is the rights and interests value of a certain owner;
s22: starting from a root node of the merkleTree, using a random seed as a random source, using a pseudo random number generator to generate a random number smaller than the weight of a current tree node, if the random number is smaller than the weight of a left sub-tree, selecting the left sub-tree to continue traversing, otherwise, selecting a right sub-tree to continue traversing until a certain leaf node is selected;
(as shown in FIG. 2):
left sub-tree 50, right sub-tree 45, [0,95) generation 65, selecting right sub-tree h 5;
left sub-tree 37, right sub-tree 8, [0,45) generate 20, select left sub-tree h 2;
left sub-tree 27, right sub-tree 10, [0,37 ] generation 15, selecting left sub-tree H (A4);
s3: referring to a g.o.d algorithm (as shown in fig. 4), submitting a child chain verification node public key address and a domain name to a main chain contract, where the child chain verification node public key address and the domain name are used for a user to obtain information required by a consistent child chain genetics file from a contract interface, and the method specifically includes:
s31: a submission stage: each node locally generates a random number and broadcasts a corresponding commitment and the random number split by a secret sharing algorithm to other nodes;
s32: an opening stage: after each node receives the promise, broadcasting the random number of the node;
s33: and (3) a recovery stage: the method comprises the steps of using an opening verification promise, broadcasting secret sharing corresponding to the promise if the promise is not opened, collecting the secret sharing to recover corresponding random numbers, and carrying out XOR on the random numbers of all nodes to finally obtain a consistent random number;
s4: referring to a DKG algorithm (as shown in fig. 3), an independent process visa mechanism is designed to perform polling issuance on the on-link state of a child chain contract, specifically:
s41: deploying protocol contract codes in the A chain and the B chain;
s42: adding a verification node public key and setting conversion proportion information;
s43: acquiring corresponding share token operation on an exchange A chain;
s44: calculating the number of the mortals on the equivalent B chain, making a transfer application and sending an event;
s45: receiving a roll-out event by a certain verification node on the chain A;
s46: monitoring an event, generating a signature by using the user address, the roll-out A share, the roll-out B share, the counter and the timestamp, and submitting the signature to a connector contract for signature verification operation;
s47: the verification nodes on the chain A are synchronously verified and signed through verification, and corresponding contract codes are executed on the chain B to verify the certificate;
s48: after the verification and signing are finished, adding corresponding B asset shares on the B chain address of the user, calculating the share number on the equivalent B chain, making a roll-out application well to send out an event, and finishing well adding synchronization on an A chain address share roll-out counter of the user.
Further, the variant algorithm of the pseudo-random number generator is realized based on Hash, Base10 encoding and large number modulus.
Further, the signature verification synchronization ratio exceeds two thirds in step S37.
The overall flow chart of the present invention is shown in fig. 5-7, wherein the method requires corresponding protocol codes (for signature verification) to be deployed on the a-chain and the B-chain, respectively, and requires a number of verification nodes (a definable number, such as 21) to be generated on the a-chain and the B-chain;
the event mechanism used when the roll-out application is sent out is not limited to a specific technical system and can be monitored. The encryption algorithm for generating the signature is (clear after communication with the chapter)
And generating the signature by using an ECDSA elliptic curve algorithm.
ECDSA signature process:
the key pair of user a comprises its private key dA and public key PA ═ dA ═ G ═ (xA, yA)
Setting the message to be signed as M, and setting the output value of H (hash) of the message M as e:
a1: calculating e ═ h (m);
a2: generating a random number k ∈ [1, n-1] by using a random number generator;
a3: calculating an elliptic curve point (x1, y1) ═ k ] G;
a4: calculating r ═ x1mod n, and if r ═ 0, returning to a 2;
a5: calculating s ═ k-1 · (e + r · dA) mod n, and if s ═ 0, returning to a 2;
a6: r | | s is the signature value, and the signature value changes every time.
The ECDSA label checking process comprises the following steps:
knowing the message M and the signature value (r, s), the signature verification process is as follows:
b1: checking whether r is formed by the element [1, n-1] or not, and if not, verifying that the r is not passed;
b2: checking whether s is formed by the element [1, n-1], if not, verifying that the s is not passed;
b3: calculating e ═ h (m);
b4: calculating w-s-1 mod n, u 1-ew mod n and u 2-rw mod n;
b5: calculating an elliptic curve point (x1, y1) ═ u 1G + u 2 PA;
b6: calculating R-x 1mod n, checking whether R-R is true, and if so, passing the verification; otherwise, the verification is not passed.
The synchronous completion proportion of the verification nodes can be defined, but must exceed 50%, for example, 21 verification nodes, at least 11 nodes are synchronous and can be regarded as a subsequent flow, and the rest nodes can asynchronously complete the synchronization; in the scheme, the counter of the user-specific roll-out is increased in the forward direction and is irreversible, so that one roll-out operation is only processed once. The processing roll-out processing of the scheme can reach within 100ms per stroke on average.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (3)
1. A cross-chain asset transfer method realized based on intelligent contracts is characterized by comprising the following specific steps:
s1: designing SLife structures of a main chain and a sub chain, respectively adopting a Dpos + PBFT consensus algorithm, and realizing interconnection and intercommunication by adopting a double contract and independent visa mechanism; the main chain ensures the fund safety of the sub-chains, supports the expansion of the sub-chains of different types and caters to commercial application, and the sub-chains have complete and independent application scenes and consensus; the method specifically comprises the following steps:
s11: the contract of the sub-chain locks all funds of the sub-chain, and the contract of the main chain controls the release of the funds of the sub-chain;
s12: the user completes mortgage, locking and roll-out in the main chain contract, then completes unlocking and roll-in on the sub-chain contract, and the user can complete mortgage, locking and roll-out on the sub-chain contract and complete unlocking and roll-in on the main chain contract after having funds on the sub-chain;
s13: a user waits for the confirmation of a visa mechanism of a plurality of node independent processes in the process of transferring in and out on a main chain and a sub chain, visa achieves a movable consensus certificate for the state on the chain based on a contract interface, and carries out group visa on a plurality of fields;
s2: the design Fts variant algorithm selects a child chain consensus node from the super nodes of the SLife main chain, specifically:
s21: combining all the rights and interests into a merkleTree, wherein the form of the merkleTree is that the weight of a non-leaf node is the sum of the weights of the left subtree and the right subtree, and the weight of a leaf node is the rights and interests value of a certain owner;
s22: starting from a root node of the merkleTree, using a random seed as a random source, using a pseudo random number generator to generate a random number smaller than the weight of a current tree node, if the random number is smaller than the weight of a left sub-tree, selecting the left sub-tree to continue traversing, otherwise, selecting a right sub-tree to continue traversing until a certain leaf node is selected;
s3: submitting a public key address and a domain name of a child chain verification node to a main chain contract by referring to a G.O.D algorithm, wherein the public key address and the domain name are used for a user to acquire information required by a consistent child chain genetics file from a contract interface, and the method specifically comprises the following steps:
s31: a submission stage: each node locally generates a random number and broadcasts a corresponding commitment and the random number split by a secret sharing algorithm to other nodes;
s32: an opening stage: after each node receives the promise, broadcasting the random number of the node;
s33: and (3) a recovery stage: the method comprises the steps of using an opening verification promise, broadcasting secret sharing corresponding to the promise if the promise is not opened, collecting the secret sharing to recover corresponding random numbers, and carrying out XOR on the random numbers of all nodes to finally obtain a consistent random number;
s4: an independent process visa mechanism is designed by referring to a DKG algorithm to carry out polling issuance on the on-chain state of a sub-chain contract, and the method specifically comprises the following steps:
s41: deploying protocol contract codes in the A chain and the B chain;
s42: adding a verification node public key and setting conversion proportion information;
s43: acquiring corresponding share token operation on an exchange A chain;
s44: calculating the number of the mortals on the equivalent B chain, making a transfer application and sending an event;
s45: receiving a roll-out event by a certain verification node on the chain A;
s46: monitoring an event, generating a signature by using the user address, the roll-out A share, the roll-out B share, the counter and the timestamp, and submitting the signature to a connector contract for signature verification operation;
s47: the verification nodes on the chain A are synchronously verified and signed through verification, and corresponding contract codes are executed on the chain B to verify the certificate;
s48: after the verification and signing are finished, adding corresponding B asset shares on the B chain address of the user, calculating the share number on the equivalent B chain, making a roll-out application well to send out an event, and finishing well adding synchronization on an A chain address share roll-out counter of the user.
2. The method for intelligent contract-based cross-chain asset transfer according to claim 1, wherein: the variant algorithm of the pseudo-random number generator is realized based on Hash, Base10 encoding and large number modulus.
3. The method for intelligent contract-based cross-chain asset transfer according to claim 1, wherein: in step S37, the signature verification synchronization ratio exceeds two-thirds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910951565.0A CN112633868B (en) | 2019-10-08 | 2019-10-08 | Cross-chain asset transfer method based on intelligent contract implementation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910951565.0A CN112633868B (en) | 2019-10-08 | 2019-10-08 | Cross-chain asset transfer method based on intelligent contract implementation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112633868A true CN112633868A (en) | 2021-04-09 |
| CN112633868B CN112633868B (en) | 2023-04-14 |
Family
ID=75283571
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910951565.0A Active CN112633868B (en) | 2019-10-08 | 2019-10-08 | Cross-chain asset transfer method based on intelligent contract implementation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112633868B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113822763A (en) * | 2021-10-11 | 2021-12-21 | 上海万向区块链股份公司 | Block chain integral chain-crossing method and system based on intelligent contract |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909369A (en) * | 2017-10-13 | 2018-04-13 | 布比（北京）网络技术有限公司 | Based on the common recognition method, apparatus merchandised across chain and storage medium |
| CN108009811A (en) * | 2017-11-30 | 2018-05-08 | 中国人民解放军国防科技大学 | Inter-cloud computing environment value exchange-oriented cross-chain communication method |
| CN108768659A (en) * | 2018-05-24 | 2018-11-06 | 深圳前海益链网络科技有限公司 | Across the chain tra nsfer system of Token assets between a kind of different blocks chain network |
| CN109472572A (en) * | 2018-11-21 | 2019-03-15 | 北京蓝石环球区块链科技有限公司 | Contract deployment and transaction based on the more subchains of block chain main chain adduction row |
| CN110020860A (en) * | 2019-04-09 | 2019-07-16 | 湖南天河国云科技有限公司 | Across the chain assets transfer method of one kind, system and computer readable storage medium |
| CN110033243A (en) * | 2019-03-06 | 2019-07-19 | 华南师范大学 | Main chain based on block chain intelligence contract deposits card method, system and storage medium |
-
2019
- 2019-10-08 CN CN201910951565.0A patent/CN112633868B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909369A (en) * | 2017-10-13 | 2018-04-13 | 布比（北京）网络技术有限公司 | Based on the common recognition method, apparatus merchandised across chain and storage medium |
| CN108009811A (en) * | 2017-11-30 | 2018-05-08 | 中国人民解放军国防科技大学 | Inter-cloud computing environment value exchange-oriented cross-chain communication method |
| CN108768659A (en) * | 2018-05-24 | 2018-11-06 | 深圳前海益链网络科技有限公司 | Across the chain tra nsfer system of Token assets between a kind of different blocks chain network |
| CN109472572A (en) * | 2018-11-21 | 2019-03-15 | 北京蓝石环球区块链科技有限公司 | Contract deployment and transaction based on the more subchains of block chain main chain adduction row |
| CN110033243A (en) * | 2019-03-06 | 2019-07-19 | 华南师范大学 | Main chain based on block chain intelligence contract deposits card method, system and storage medium |
| CN110020860A (en) * | 2019-04-09 | 2019-07-16 | 湖南天河国云科技有限公司 | Across the chain assets transfer method of one kind, system and computer readable storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 李芳，等.: "区块链跨链技术进展研究", 《软件学报》 * |
| 郑敏，等.: "区块链共识算法研究综述", 《技术研究》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113822763A (en) * | 2021-10-11 | 2021-12-21 | 上海万向区块链股份公司 | Block chain integral chain-crossing method and system based on intelligent contract |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112633868B (en) | 2023-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109964242B (en) | Block chain consensus method based on trust relationship | |
| Robinson et al. | Atomic crosschain transactions for ethereum private sidechains | |
| CN111464518B (en) | Method and device for sending and verifying cross-link communication data | |
| CN108711052B (en) | Information verification system based on block chain | |
| AU2018349940B2 (en) | System and method for information protection | |
| CN113508409A (en) | Computer-implemented system and method for effecting transfers over blockchain networks | |
| CN106452768B (en) | Message authenticity guard method in the blind label of quantum | |
| CN111723406A (en) | Consensus algorithm and system of block chain | |
| CN112329051A (en) | Safe and efficient consensus mechanism implementation method and system | |
| CN111008863A (en) | Lottery drawing method and system based on block chain | |
| CN111615810A (en) | Computer-implemented method and system for acquiring digitally signed data | |
| CN111652618A (en) | Decentralized unlinked cross-chain atomic transaction method | |
| CN111738857B (en) | Generation and verification method and device of concealed payment certificate applied to block chain | |
| CN112470423A (en) | Computer-implemented system and method for asset blending | |
| EP3750129A1 (en) | System and method for transferring resources using a blockchain | |
| CN115174570A (en) | Cross-chain consensus method and system based on dynamic committee | |
| CN112633868B (en) | Cross-chain asset transfer method based on intelligent contract implementation | |
| CN109685659B (en) | Method for supporting offline transaction of block chain hard wallet and hard wallet | |
| Blum et al. | Superlight–A permissionless, light-client only blockchain with self-contained proofs and BLS signatures | |
| US11811866B2 (en) | Computer-implemented system and method for controlling processing steps of a distributed system | |
| Wang et al. | Consensus algorithm based on verifiable randomness | |
| Yang et al. | Multi-party semi-quantum secure direct communication using Greenberger–Horne–Zeilinger states | |
| RU2686818C1 (en) | Method for scaling distributed information system | |
| Deng et al. | PSSC: Practical and Secure Sidechains Construction for Heterogeneous Blockchains Orienting IoT | |
| Oh et al. | Graph learning BFT: A design of consensus system for distributed ledgers |
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 |