CN107301600A - A kind of core algorithm for the block chain the Internet model merchandised across chain - Google Patents
A kind of core algorithm for the block chain the Internet model merchandised across chain Download PDFInfo
- Publication number
- CN107301600A CN107301600A CN201710483789.4A CN201710483789A CN107301600A CN 107301600 A CN107301600 A CN 107301600A CN 201710483789 A CN201710483789 A CN 201710483789A CN 107301600 A CN107301600 A CN 107301600A
- Authority
- CN
- China
- Prior art keywords
- chain
- transaction
- icc1
- node
- ppc2
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
Abstract
The present invention develops a kind of core algorithm for the block chain the Internet model (spun gold monkey model) merchandised across chain, and the model is completely distributed, the multichain network architecture, is more easy to extend than conventional center framework, extends, fault-tolerant.Each chain safeguards self confidence, and chain is maintained with interchain uniformity by fully distributed mechanism, breaks the limitation of centralization model, and all chains can be run parallel, improves trading efficiency and network operation speed.The model is a kind of new financial market framework, and expansible, financial unit can be easily added or leave at any time, supports large scale network and high transaction volume.The model includes participating in chain, intermediate chain, can be a Jia Huoyizu financial institutions, across chain transaction can be achieved.The core algorithm that the present invention merchandises for chain with interchain, particularly intermediate chain assist the two or more protocol algorithms for participating in chain mutual dealing, and the uniformity of whole network is maintained without center mechanism.
Description
Technical field
The present invention relates to the block chain Internet technical field for financial system, especially with distributed block chain
The Internet architecture.
Background technology
((Blockchain, BC) is distributed data base system to block chain, it will be understood that to be safeguarded jointly by multiple nodes
Distributed account book technology (Distributed Ledger Technology, DLT), be characterized in being difficult distorting, be difficult puppet
Make, can review.(Internet of Blockchians) is a kind of value network built based on block chain for block chain internet
Network, must have high-performance, security, privacy, scalability, intercommunity, alterability, fault-tolerance, manageability and complete
Property.
Existing block chain internet, such as universe net (Cosmos), the mostly structure of centralization, its intermediate chain are in one
Concentric mechanism, then the calculating of intermediate chain and communication link easily turn into the bottleneck of block chain internet.In addition, its each chain is required for
Maintain the uniformity of oneself, and intermediate chain be also required to dynamic maintain and each participation chain between uniformity, and then one across
Chain transaction needs a plurality of participation chain to be maintained jointly with intermediate chain so that the speed of service of block chain slows down.
The content of the invention
In order to overcome the problem of above-mentioned existing link network (such as Cosmos) efficiency applied to financial system is slower, this hair
It is bright to provide a kind of core algorithm for the block chain the Internet model merchandised across chain, it is possible to achieve concurrent operation, improve system
Operational efficiency and transactions velocity, while ensureing system conformance.
The technical solution adopted in the present invention is a kind of core algorithm for the block chain the Internet model merchandised across chain, and it is special
Levy and be the model as shown in figure 1, comprising consisting of part：
(1) chain (Participant Blockchain, PPC) is participated in, one or more financial institutions is represented or finance is single
Position, can be included by one or more node；
(2) intermediate chain (Inter-chain Blockchain, ICC), represents an intermediary agency, itself is also one
Financial institution, can also play CCP (Central Counterparty, central analogue) effect, intermediate chain is with participating in chain
There are two to more common nodes, intermediate chain is traded using common node with participating in chain；
(3) one or more intermediate chain can be connected between every two participation chains, every intermediate chain can connect two to a plurality of
Chain is participated in, and the transaction between two or more pieces participation chain is completed by intermediate chain, it includes two kinds of trade modes, with suitable for not
Same demand (completing transaction, or non real-time but efficient transaction immediately)：
(3a) real-time deal (real-time transaction)：Two extremely a plurality of participation chain can pass through an intermediate chain
Carry out real-time deal, each transaction of the execution of intermediate chain immediately；
(3b) Multi-Lateral Netting settles accounts (multilateral netting)：Every intermediate chain is at the end of each billing cycle
Multi-Lateral Netting clearing are carried out, many transaction (tentative transaction) undetermined are handled together, plays a part of CCP, subtracts
Few transaction count, improves trading efficiency；
(4) some multiple financial institutions constitute a distributed network, every chain in the form of participating in chain and intermediate chain
The uniformity of oneself is safeguarded, the uniformity between chain and chain does not need central tissue to manage, and is able to run parallel, improve transaction
Efficiency and network operation speed；New financial unit can be easily added or leave at any time network, with scalability, support big
Scale network and high transaction volume.
It is preferred that, for part (1), the link network comprising it is some participate in chains, each participation chain represent one or
Multiple financial units, can include some multinodes, each node store full detail of the financial unit；Participate in the complete of chain
Portion or part of nodes have franchise, and (whole nodes and part of nodes may participate in ballot both of which and are applied to this specially
Profit), concurrent Byzantine failure tolerance agreement (CBFT, Concurrent Byzantine Fault are used between each node
Tolerance) or practical Byzantine failure tolerance agreement (PBFT, Practical Byzantine Fault Tolerance) or
The algorithm of other Byzantium (Byzantine) common recognition agreements or database things uniformity is (as used database things one
The algorithm of cause property, then can not investigate the node lied, so that being the consistency algorithm of a reduction), to ensure each node
Between information uniformity and the difficulty property altered, it is ensured that every participation chain uniformity of itself.
It is preferred that, for part (2), the link network includes some many intermediate chains, and each intermediate chain is represented in one
Between mechanism, itself be also a financial institution, CCP (Central Counterparty, central analogue) can also be played
Effect, intermediate chain with participate in chain have two to more common nodes, its schematic diagram is shown in Fig. 2 and Fig. 3.Intermediate chain includes multiple sections
Point, its all or part of node has franchise, and (whole nodes and part of nodes may participate in ballot both of which and are applied to
This patent).Each node is ensured using Byzantine failure tolerance agreement (or database things agreement of reduction) between each node
Between information uniformity and the difficulty property altered.
It is preferred that, intermediate chain is traded using common node with participating in chain.If some node on the intermediate chain
For the common node of n bar chains, as shown in Figure 5 and 7, then the memory space of the node is divided into n+1 part, respectively A1,
A2 ..., An, are responsible for the information of storage nth bar chain, and C (connection, connection) part, are responsible for information from Ai
Part passes to Aj parts (i, j=1,2 ..., n), as shown in Fig. 4, Fig. 6 and Fig. 8.Below using the common node of two chains as
Example illustrates the core algorithm of the model, as shown in figure 4, the memory space of each common node is divided into L (left, left), R
(right, right), C (connection, connection) three parts.L portion stores the information of chain on the left of the common node, R-portion storage
The information of chain on the right side of the common node node.The content of L portion and R-portion cannot be linked up directly, it is necessary to by C portion
Enter row information and be sent to R-portion from L portion, or be sent to from R-portion the information transmission of L portion.
It is preferred that, for part (3), in the link network, one can be connected between every two participation chains in a plurality of
Between chain, interchain can connect two to a plurality of participation chains in the middle of every, and complete two or more pieces by intermediate chain and participate between chain
Transaction, the link network can realize two kinds of different trade modes, complete to merchandise immediately to meet, and non real-time but efficiently merchandise this
Two kinds of different demands：
(1) real-time deal：Two can carry out real-time deal to a plurality of participation chains by intermediate chain, and intermediate chain is instant
Each transaction is performed, real-time settle accounts calculation is realized；
(2) Multi-Lateral Netting is settled accounts：Every intermediate chain carries out many at the end of each billing cycle (one hour or one day etc.)
Side netting, handles many transaction (tentative transaction) undetermined, reduces the number of times of settle accounts calculation, improve together
Trading efficiency, because a settle accounts calculation can solve large quantities of transaction, but this method can not realize real-time settle accounts calculation.
It is preferred that, for (1) real-time deal, the core process of such a trade mode is as shown in Fig. 9 and Figure 13.The transaction mould
Comprising procedure below, (the following high-level for step is described formula, and detailed description is shown in《Specification》In《Embodiment》In
Arthmetic statement and false code), its flow is as shown in Figure 10 and Figure 14.
(1) chain 1 (PPC1) is participated in initiate to merchandise to intermediate chain 1 (ICC1)；
Following process (2) is divided into both of which：
Mould formula (I), is shown in Fig. 9：
(2) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction of process (1) is initiated successfully, after process (2) is finished, by the stateful transaction labeled as undetermined
(tentative)；
Mould formula (II), is shown in Figure 13：
Procedure below (2a) is performed simultaneously with process (2b)；
(2a) intermediate chain 1 (ICC1) returns to the information of the transaction request success or not to chain 1 (PPC1) is participated in；
(2b) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction of process (1) is initiated successfully, after process (2a) is finished with process (2b), the stateful transaction is marked
For (tentative) undetermined；
It is finished in above-mentioned mould formula (II) after (2a), other operations can be carried out by participating in chain 1 (PPC1), be realized clog-free
Operation.
(3) participate in chain 2 (PPC2) and send whether the transaction request succeeds by participation chain 2 (PPC2) to intermediate chain 1 (ICC1)
The message of receiving, if it is, the proof of the transaction can be received by sending the participation chain 2 (PPC2) to intermediate chain 1 (ICC1)；
Procedure below (4a) is performed simultaneously with process (4b)；
(4a) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 1 (PPC1) is participated in, and can perform；
(4b) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 2 (PPC2) is participated in, and can perform；
Two participation chains are received after intermediate chain 1 (ICC1) message, are immediately performed the intermediate chain 1 (ICC1) with participating in chain 1
(PPC1) and undetermined transaction of the intermediate chain 1 (ICC1) with participating in chain 2 (PPC2), until it is whole run succeeded untill, that is, complete
Merchandise (commit).
It is preferred that, plant trade mode, Multi-Lateral Netting clearing, core process such as Figure 11 of such a trade mode for (2)
With shown in Figure 15.Comprising procedure below, (the following high-level for step is described the trade mode, and detailed description is shown in《Specification》In
《Embodiment》In arthmetic statement and false code), its flow is as shown in Figure 12 and Figure 16.
(1) chain 1 (PPC1) is participated in initiate to merchandise to intermediate chain 1 (ICC1)；
Following process (2) is divided into both of which：
Mould formula (I), is shown in Figure 11：
(2) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction of process (1) is initiated successfully, after process (2) is finished, by the stateful transaction labeled as pre- undetermined
(pre-tentative)；
Mould formula (II), is shown in Figure 15：
Procedure below (2a) is performed simultaneously with process (2b)；
(2a) intermediate chain 1 (ICC1) returns to the information of the transaction request success or not to chain 1 (PPC1) is participated in；
(2b) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction of process (1) is initiated successfully, after process (2a) is finished with process (2b), the stateful transaction is marked
For pre- (pre-tentative) undetermined；
It is finished in above-mentioned mould formula (II) after (2a), other operations can be carried out by participating in chain 1 (PPC1), be realized clog-free
Operation.
(3) participate in chain 2 (PPC2) and send whether the transaction request succeeds by participation chain 2 (PPC2) to intermediate chain 1 (ICC1)
The message of receiving, if it is, the proof of the transaction can be received by sending the participation chain 2 (PPC2) to intermediate chain 1 (ICC1)；
If the request is successfully received, the stateful transaction is labeled as (tentative) undetermined；
Procedure below (4a) is performed simultaneously with process (4b)；
(4a) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 1 (PPC1) is participated in, and can perform；
(4b) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 2 (PPC2) is participated in, and can perform；
At the end of the transaction waits the billing cycle, implementation procedure (5)；
(5) now the billing cycle terminates, and stops all transaction and transaction undetermined that will starting or initialize,
Complete the transaction that is carrying out, and it is undetermined to being marked as within all billing cycles by intermediate chain 1 (ICC1)
(tentative) transaction carries out Multi-Lateral Netting clearing, is merchandised (commit) stage into completion.
It is preferred that, when a chain is to another chain transmission information, its transfer mode is transmission in bulk, such as Figure 17 and Figure 18
It is shown, each node of a chain respectively to each node transmission information of another chain, with prevent some or certain it is several
Node is practised fraud and influences the correctness of whole transmitting procedure.When participation chain 1 (PPC1) is sent to intermediate chain 1 (ICC1) asks,
If participating in chain 1 (PPC1) has m node, respectively P1, P2 ..., Pm, TBC1 has a n node, respectively T1, T2 ...,
Tn, then by Pi, (i=1,2 ..., n) send request, all nodes send m*n request altogether to T1, T2 ..., Tn respectively.Example
Such as, as shown in figure 17, when participating in chain 1 (PPC1) to during intermediate chain 1 (ICC1) transmission request, node 1 is with node 2 respectively to centre
Each node of chain 1 (ICC1) sends solicited message；In another example, please to intermediate chain 1 (ICC1) transmission when participating in chain 2 (PPC2)
When asking, node 3 sends solicited message to each node of intermediate chain 1 (ICC1) respectively with node 4.
It is preferred that, carried out below to two participation chains, to participate in chain 1 (PPC 1) with participating in chain 2 (PPC2) by intermediate chain
Transaction, for the brief description of process (1) to each step of (4), detailed description is shown in《Specification》In《Specific embodiment party
Formula》In arthmetic statement and false code.
(1) chain 1 (PPC1) is participated in initiate to merchandise to intermediate chain 1 (ICC1)：
(1.1) participate in chain 1 (PPC1) (financial institution) and initiate transaction：Participate in ballot (CBFT or PBFT of the chain inside
Deng Byzantine failure tolerance common recognition agreement or database things agreement) decide whether to initiate transaction, if so, participating in chain 1 (PPC1) to this
Certification (using digital signature etc.) is encrypted in Transaction Information, participates in chain 1 (PPC1) by common recognition, itself and intermediate chain 1 (ICC1)
The L portion of common node (in illustration 9 for node 1 with node 2) obtain the full detail of the participation chain 1 (PPC1).With
Afterwards, L portion by C portion by the content relevant with this transaction and participate in chain 1 (PPC1) all nodes digital signature
R-portion is transmitted to Deng the information for checking.These Transaction Informations for encrypt certification are broadcasted (broadcast) by R-portion again
To each node of intermediate chain 1 (ICC1), as shown in figure 17；If it is not, error message is returned to chain 1 (PPC1) is participated in, and will
The process markup is failure (failure)；
(1.2) intermediate chain 1 (ICC1) checking information：Intermediate chain (ICC1) is received after these Transaction Informations, to Transaction Information
(using digital signature etc.) is verified, if being proved to be successful, each node carries out ballot to the transaction and builds block, and this is handed over
Easily it is (pending) state undetermined；If authentication failed, error message is returned, and preceding step is marked is
(failure)。
Following process (2) is divided into both of which：
Mould formula (I)：
(2) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in：
(2.1) intermediate chain (ICC1) transmission transaction：(CBFT or PBFT etc., which are visitd, to be accounted for for ballot of the intermediate chain (ICC1) inside
The fault-tolerant common recognition agreement in front yard or database things agreement) decide whether to chain 2 (PPC2) transmission transaction is participated in, if so, then intermediate chain
(ICC1) certification (using digital signature etc.) transaction is encrypted, intermediate chain 1 (ICC1) is by common recognition, and it is with participating in chain 2
(PPC2) L portion of common node (being node 3 and node 4 in illustration 9) obtains whole letters of the intermediate chain 1 (ICC1)
Breath.Then, L portion by C portion by the numeral of all nodes of the content and intermediate chain 1 (ICC1) relevant with this transaction
Signature etc. is transmitted to R-portion for the information of checking.R-portion again broadcasts these Transaction Informations for encrypt certification
(broadcast) each node of chain 2 (ICC2) is participated in, as shown in figure 18；If it is not, error message is then returned, and will above
Step is marked as (failure)；
(2.2) chain 2 (PPC2) checking information is participated in：The transaction for participating in the request of the chain 2 (PPC2) to receiving is verified
(using digital signature etc.), if being verified, participates in chain 2 (PPC2) and then carries out inside chooses whether receive the transaction in a vote；
If authentication failed, failure information is returned, and preceding step is marked as (failure).
Mould formula (II)：
(2a) intermediate chain 1 (ICC1) returns to the information of transaction success or not undetermined to chain 1 (PPC1) is participated in：
When the participation chain 1 (PPC1) have received the intermediate chain 1 (ICC1) be proved to be successful and the transaction be marked as it is undetermined
(pending) information, the participation chain need not be continued waiting for, and can go to carry out other transaction.
Process (2) of (2b) process with mould formula (I).
(3) participate in chain 2 (PPC2) and send whether the transaction request succeeds by participation chain 2 (PPC2) to intermediate chain 1 (ICC1)
The message of receiving, if it is, the proof of the transaction can be received by sending the participation chain 2 (PPC2) to intermediate chain 1 (ICC1)：
(3.1) voted successfully if participating in chain 2 (PPC2), agreement receives the transaction, then is returned successfully to intermediate chain 1 (ICC1)
Information, and carry out (3.2)；Otherwise, then failure information is returned to intermediate chain 1 (ICC1), and preceding step is marked is
(failure)；
(3.2) participation chain 2 (PPC2) sends the participation chain 2 (PPC2) to intermediate chain 1 (ICC1) can receive the transaction
Prove, such as participating in chain 2 (PPC2) there are enough related resources to complete this transaction, and intermediate chain 1 (ICC1) is with participating in chain 2
(PPC2) transaction is set to (pending) state undetermined.
(4) intermediate chain checking participates in the information that chain 2 (PPC2) is returned, and determines whether the transaction meets execution condition, if
It is then to carry out (4a) and (4b)；Whether cancel transaction undetermined if it is not, then being chosen in a vote, and preceding step marked for
Failure (failure).
(4a) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 1 (PPC1) is participated in, and can perform；
(4b) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 2 (PPC2) is participated in, and can perform.
In order to improve it is existing for financial system design link network result can not parallel work-flow, efficiency is slow the problem of, mesh
The distributed new chain net structure model of preceding design, has the following advantages that：
(1) parallel work-flow is supported：The model is due to being a fully distributed framework, and all chains are on this model
It can parallel run, improve the speed of service of whole financial system：Because different participation chains can be from different intermediate chains
Be traded, and the transaction handled by different participation chain can be carried out simultaneously, without every transaction all by one it is total in
Mechanism is entreated, the trading volume and load capacity of each intermediary agency all mitigate significantly, it is possible to carry out parallel work-flow, and then improve friendship
Easy efficiency, has speeded the speed of transaction.
(2) Multi-Lateral Netting is settled accounts：Two or a plurality of participation chain by an intermediate chain when being traded, and intermediate chain is to multiple
Transaction carries out mutual offset netting, reduces the treating capacity of clearing, also mitigates the difficulty of large-scale transaction, improves the speed of transaction
Degree, improves market efficiency.
(3) scalability：Any number of financial institution and intermediary agency can be easily added the chain net structure at any time,
And connected the new financial unit that will be added with existing intermediary agency by TBC, this allows the link network to expand
Open and adapt to catenet and high transaction volume.
(4) supervision is supported：The account book record being difficult to tamper with, have recorded real process of exchange, facilitates government department to supervise
Check account.
(5) basic principle of link network is ensure that, including：(a) high-performance, complete distributed frame supports each intermediary agency
Parallel operation, improves the trading efficiency of network；(b) data reliability (being difficult to tamper with property, security), each node is used to visit and accounted for
Front yard protocol for error tolerance come ensure each node uniformity and being difficult to tamper with property；(c) protect the information inside privacy, each chain can not
By outside acquisition；(f) scalability, any financial institution can be easily added the link network at any time, and due to concurrent operation, increase
Plus new financial institution does not result in communication obstruction；(e) completeness, every chain can follow the trail of its completeness, once a section
Point cheating, its completeness will be reduced, it is possible to be tracked and checked.
According to the accompanying drawings to the detailed description of specific embodiments of the present invention, those skilled in the art will be more
Plus understand above-mentioned and other purpose, optimization and the feature of the present invention.
Brief description of the drawings
Some specific embodiments of the present invention are described in detail by way of example, and not by way of limitation with reference to the accompanying drawings hereinafter.
Identical reference denotes same or similar part or part in accompanying drawing.It should be appreciated by those skilled in the art that these
What accompanying drawing was not necessarily drawn to scale.The target and feature of the present invention is considered to will be apparent from below in conjunction with the description of accompanying drawing.
In accompanying drawing:
Fig. 1 is a kind of block chain the Internet model (spun gold monkey model) merchandised across chain according to the preferred embodiment of the invention
Overall schematic；
Fig. 2 is that may have two common nodes according to the intermediate chain (ICC) and participation chain (PPC) of the preferred embodiment of the invention
Schematic diagram；
Fig. 3 is that may have three common nodes according to the intermediate chain (ICC) and participation chain (PPC) of the preferred embodiment of the invention
Schematic diagram；
Fig. 4 is the structural representation of the common node of two chains of link according to the preferred embodiment of the invention；
Fig. 5 is to pass through common node three participation chains of link according to an intermediate chain (ICC) of the preferred embodiment of the invention
(PPC) schematic diagram；
Fig. 6 is the structural representation of the common node of three chains of link according to the preferred embodiment of the invention；
Fig. 7 is to pass through common node four participation chains of link according to an intermediate chain (ICC) of the preferred embodiment of the invention
(PPC) schematic diagram；
Fig. 8 is the structural representation of the common node of four chains of link according to the preferred embodiment of the invention；
Fig. 9 be the real-time deal process of the mould formula (I) according to the preferred embodiment of the invention schematic diagram (PPC for participate in chain,
ICC is intermediate chain)；
Figure 10 is the flow chart according to each process of the mould formula (I) real-time deal of the preferred embodiment of the invention；
Figure 11 is the signal of the process of exchange of the multi-party netting of use according to the mould formula (I) of the preferred embodiment of the invention
Figure (to participate in chain, ICC is intermediate chain to PPC)；
Figure 12 is the flow of the process of exchange of the multi-party netting of use according to the mould formula (I) of the preferred embodiment of the invention
Figure；
Figure 13 be the real-time deal process of the mould formula (II) according to the preferred embodiment of the invention schematic diagram (PPC for participate in
Chain, ICC is intermediate chain)；
Figure 14 is the flow chart according to each process of the mould formula (II) real-time deal of the preferred embodiment of the invention；
Figure 15 is showing for the process of exchange of the multi-party netting of use according to the mould formula (II) of the preferred embodiment of the invention
It is intended to (to participate in chain, ICC is intermediate chain to PPC)；
Figure 16 is the stream of the process of exchange of the multi-party netting of use according to the mould formula (II) of the preferred embodiment of the invention
Cheng Tu；
Figure 17 is common node showing to intermediate chain (ICC) transmission information in the process 1 according to the preferred embodiment of the invention
It is intended to (PPC is participation chain)；
Figure 18 be the mould formula (I) according to the preferred embodiment of the invention process 2 (or process 2b of mould formula (II)) in it is public
Node participates in the schematic diagram of chain 2 (PPC2) transmission information to sending (to participate in chain, ICC is intermediate chain to PPC).
Embodiment
In order to be better understood from technical scheme provided in an embodiment of the present invention, also technology preferably with the embodiment of the present invention
Scheme is contrasted, and by algorithm and false code combination accompanying drawing, the present invention is further described first below.
This kind without waiting for across chain merchandise block chain the Internet model (spun gold monkey model) embodiment master
To include following three part：
(1) whole network, which is started from scratch, builds；
(2) merchandise：One participation chain is traded by an intermediate chain with another participation chain；
(3) new chain adds network.
Start from scratch for (1) whole network and build, its input includes some a plurality of intermediate chain (Inter-chain
Represented in Blockchain, false code by ICC), some a plurality of participation chains are (in Participant Blockchain, false code
Represented by PPC), and each bar participate between chain and intermediate chain whether the relation that should be connected, detailed process is as follows.
(1), will be all for so the chain of the network will be added, all participation chains are put into a participation chain set
Intermediate chain be put into an intermediate chain set；
(2) for each intermediate chain in intermediate chain set, and every two participation chains in chain set are participated in, utilized
The chain that will reach and the relation of interchain of the known network, judge：If the intermediate chain will connect with this two participation chains
Connect, then two participation chains of the intermediate chain and this are set up respectively is connected；Otherwise, other chains are continued with.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 0, sets up network.
" consensus protocol " (common recognition agreement) expressions " CBFT or PBFT or in following false code
other Byzantine consensus protocol or database consistency”。
For (2) transaction：One participation chain is traded by an intermediate chain with another participation chain, and schematic diagram is visible
Fig. 2.It, which is inputted, includes intermediate chain 1 (ICC1), participates in chain 1 (PPC1) with participating in chain 2 (PPC2).Participate in chain 1 (PPC1) and be responsible for hair
Transaction is played, and is traded by intermediate chain 1, is responsible for receiving the transaction by participation chain 2 (PPC2).For example, participate in chain 1 (PPC1) to
The transaction that chain 2 (PPC2) carries out convertibility of dollar into gold is participated in, chain 1 (PPC1) is participated in and initiates to provide dollar and exchange the friendship of gold for
Easily there is provided the certain number of amount of money, process of exchange is performed by intermediate chain 1, is responsible for receiving this dollar simultaneously by participation chain 2 (PPC2)
Gold is provided.
For merchandising each time, contain real-time deal and settle accounts two kinds of situations with Multi-Lateral Netting, its particular transactions process is such as
Under.
(1) participation chain 1 (PPC1) is voted by each node to its inside (uses CBFT or PBFT or other
Byzantium's common recognition agreement or database things agreement) decide whether to initiate this transaction, if voted successfully, into the
(2) step；If ballot failure, returns to error message；
(2) call algorithm 2, participate in chain 1 (PPC1) and send transaction request (using participating in chain 1 to intermediate chain 1 (ICC1)
(PPC1) with the common node of intermediate chain 1 (ICC1)), as process (1)；
(3) algorithm 3 is called, (using electronic signature etc.) is verified to the transaction request by intermediate chain 1 (ICC1), if
It is proved to be successful, then into (4) portion；If authentication failed, error message is returned to chain 1 (PPC1) is participated in；
(4) intermediate chain 1 is voted each node of its inside (is known together using CBFT or PBFT or other Byzantium
Agreement or database things agreement) decide whether that the transaction can be performed, if voted successfully, into (5) step；Such as
Fruit ballot failure, then return to the information for failure of voting to participation chain 1 (PPC1), and by steps all before labeled as " mistake
Lose "；
(5) stateful transaction participated between chain 1 (PPC1) and intermediate chain 1 (ICC1) is set to " undetermined " (pending)；
(6) if necessary to real-time deal, then the stateful transaction is labeled as " undetermined " (tentative)；If necessary to many
Side netting, then be labeled as " pre- undetermined " (pre-tentative) by the stateful transaction；
(7) if mould formula (I), then algorithm 4 is called, center chain 1 (ICC1) begins preparing for initiating to participation chain 2 (PPC2)
Transaction request, as process (2)；If process (2) return center chain 1 (ICC1) to participate in chain 2 (PPC2) transaction request into
Work(, then into (8) step, otherwise, " failure " is labeled as by steps all before, and calls algorithm 7, by intermediate chain 1
(ICC1) known together with participating in chain 1 (PPC1) and participating in chain 2 (PPC2), decide whether to cancel intermediate chain 1 (ICC1) with participating in
The transaction undetermined of chain 1 (PPC1), and return to error message；If mould formula (II), then algorithm 2 is called, intermediate chain 1 (ICC1) is accused
Know and participate in the current stateful transaction of chain 1 (PPC1), as process (2a), and the process 2 entered simultaneously in row mode (I)；
(8) algorithm 2 is called, chain 2 (PPC2) is participated in and informs whether current participation chain 2 (PPC2) is same to intermediate chain 1 (ICC1)
Anticipate the transaction, sent if agreeing to intermediate chain 1 (ICC1) and participate in chain 2 (PPC2) and prove that the information of the transaction can be carried out,
For intermediate chain 1 (ICC1) checking, as process (3)；
(9) intermediate chain 1 (ICC1) is verified to the information, if the verification passes, then into (10) step, otherwise by it
Preceding all steps are labeled as " failure ", and call algorithm 7, by intermediate chain 1 (ICC1) with participating in chain 1 (PPC1) and participating in chain 2
(PPC2) known together, decide whether to cancel intermediate chain 1 (ICC1) and participate in the transaction undetermined of chain 1 (PPC1), and return to mistake
Information；
(10) stateful transaction between intermediate chain 1 (ICC1) and participation chain 2 (PPC2) is labeled as (pending) undetermined,
And algorithm 2 is called, it is to participate in chain 2 (PPC2) to inform that the transaction meets transaction bar from intermediate chain 1 (ICC1) to chain 1 (PPC1) is participated in
Part, can be performed, as process (4a) and process (4b)；
(11) if within certain time (Time1), participating in chain 1 (PPC1) and failing to receive the notice that transaction can be performed, then
Intermediate chain (ICC1) is known together with participating in chain 1 (PPC1) and participating in chain 2 (PPC2), decides whether to cancel the transaction, if it is,
Then enter (12) step, otherwise into (13) step；
(12) steps all before is labeled as " failure ", and cancels intermediate chain (ICC1) with participating in chain 1 (PPC1)
Transaction undetermined, and cancel intermediate chain (ICC1) with participate in chain 2 (PPC2) transaction undetermined, subsequent intermediate chain 1 (ICC1) again with
Participate in chain 1 (PPC1) and participation chain 2 (PPC2) is known together, and return to failure information；
(13) if necessary to real-time deal, then algorithm 5 is called to perform real-time deal；If necessary to Multi-Lateral Netting clearing,
The stateful transaction is then labeled as " undetermined " (tentative), and calls algorithm 6 to carry out Multi-Lateral Netting clearing (in algorithm 6
In, need to wait until that the billing cycle terminates first).
For the algorithm 2 called in algorithm 1, another chain is carried the information to from a chain, it, which is inputted, includes a hair
Deliver letters the chain and a chain for receiving information of breath.Its detailed process is as follows.
(1) common node of this two chains is put into a set；
(2) for each node in the set, information required for the node is sent to the chain for receiving information.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 2, is carried the information to separately from a chain
One chain.
For the algorithm 3 called in algorithm 1, digital signature authentication Transaction Information is used, it, which is inputted, includes requestor, checking
Person and the transaction of request.Its detailed process is as follows.
(1) verifier is verified using digital signature to requestor, if be proved to be successful, into (2) step；If
Authentication failed, then return to the information that authentication failed is returned to requestor；
(2) verifier checks whether requestor has related resource to carry out the transaction of its request, if so, then entering
(3) step；Otherwise, the failure information without related resource is returned to requestor；
(3) verifier checks the transaction whether requestor has the resource or remaining sum of sufficient amount to complete the request, if so,
Then return to the information being proved to be successful；Otherwise, the failure information of inadequate resource is returned to requestor.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 3, is merchandised and believed with digital signature authentication
Breath.
For the algorithm 4 called in algorithm 1：Center chain 1 (ICC1) begins preparing for initiating transaction to participation chain 2 (PPC2)
Request, it, which is inputted, includes intermediate chain 1 (ICC1) and participation chain 2 (PPC2).Its detailed process is as follows.
(1) intermediate chain 1 is voted its each node (using common recognition association of CBFT or PBFT or other Byzantium
View or database things agreement), to decide whether to perform it with participating in the transaction of chain 2 (PPC2), if voted successfully, enter
Enter (2) step；If ballot failure, returns to failure information；
(2) algorithm 2 is called, intermediate chain 1 (ICC1) sends transaction request, as process (2b) to chain 2 (PPC2) is participated in；
(3) algorithm 3 is called, (using electronic signature etc.) is verified to the transaction request by participation chain 2 (PPC2), if
It is proved to be successful, then into (4) step；If authentication failed, error message is returned to, and steps all before is labeled as
" failure "；
(4) participation chain 2 (PPC2), which is voted each node of its inside, (is visitd using CBFT or PBFT or others and accounted for
Front yard knows together agreement or database things agreement) decide whether to receive the transaction, if voted successfully, return success；
If ballot failure, the information of ballot failure is returned to, and steps all before is labeled as " failure ".
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 4, and center chain 1 starts to participation chain 2
The transaction request of initiation.
For the algorithm 5 called in algorithm 1, intermediate chain performs real-time deal, when participation chain 1 (PPC1) is with participating in chain 2
(PPC2) receive after the information that the confirmations transaction of intermediate chain transmission can occur, i.e., complete process (4a) with after (4b), centre
Chain is with participating in chain 1 (PPC1) and intermediate chain with participating in the transaction for being marked as (pending) undetermined of chain 2 (PPC2) in the mistake
It is immediately performed in journey, reaches completion transaction (commit).Its detailed process is as follows.
(1) perform intermediate chain with participate in chain 1 (PPC1) and intermediate chain with participation chain 2 (PPC2) be marked as it is undetermined
(pending) transaction, until the participation chain 1 (PPC1) is successfully completed to the transaction for participating in chain 2 (PPC2).
(2) algorithm 2 is called, intermediate chain informs that participation chain 1 (PPC1) is completed with participating in chain 2 (PPC2) transaction.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 5, and intermediate chain performs real-time deal.
For the algorithm 6 called in algorithm 1, intermediate chain carries out Multi-Lateral Netting clearing, when intermediate chain completes certain time
Measure (a billing cycle：One hour, one day or one week etc.) transaction book keeping operation (each bar participates in friendship of the chain in the time quantum
It is easy to remember in the intermediate chain), intermediate chain carry out Multi-Lateral Netting clearing.Its detailed process is as follows.
When a billing cycle terminates, then intermediate chain carries out following operation；
(1) stop initialization or start any new transaction, and complete all ongoing transaction or undetermined
(tentative) merchandise；
(2) intermediate chain finds out all participation chains for carrying out attempting to merchandise with the intermediate chain in previous billing cycle, and
These participation chains are put into a set；
(3) intermediate chain finds out all transaction records in previous billing cycle；
(4) for each participation chain, intermediate chain to its All Activity in a upper billing cycle dealing with should
Receipts fund or resource carry out offset netting, and the net value according to obtained by netting is accepted to the participation chain.
(5) whether correct the multi-party net value checkout result is examined：Judge after offset netting is carried out, in the billing cycle
Whether the summation of the transaction turnover for all participation chains being traded by the intermediate chain is 0, is such as 0, then it is assumed that correct, such as
Fruit is not 0, then mistake；
(6) if correct, intermediate chain participates in chain to each bar according to checkout result and performs final transaction；If incorrect,
Re-start multi-party net value clearing or manually verified.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 6, and intermediate chain carries out Multi-Lateral Netting knot
Calculate.
For the algorithm 7 called in algorithm 1, cancel intermediate chain (ICC) and participate in the friendship undetermined between chain 1 (PPC1)
Easily, it is required for being known together with all participation chains for participating in this transaction by intermediate chain before carrying out cancellation operation every time, comes
Decide whether to cancel the transaction undetermined.If eliminating the transaction undetermined, intermediate chain needs to be known together again to inform
There is the participation chain for participating in this transaction.Its detailed process is as follows.
(1) intermediate chain (ICC) is known together with participating in chain 1 (PPC1) and participating in chain 2 (PPC2), to decide whether to cancel ginseng
(pending) undetermined transaction between chain 1 (PPC1) and intermediate chain (ICC)；
(2) if it is, the transaction undetermined is cancelled, and intermediate chain (ICC) is with participating in chain 1 (PPC1) and participating in chain 2
(PPC2) known together, to inform that the transaction undetermined has been cancelled.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 7, cancels intermediate chain with participating in chain 1
(PPC1) transaction undetermined between.
Network is added for (3) new chain, is divided into two kinds of situations：(A) new participation chain adds network；(B) new intermediate chain
Add network.Two kinds of situations are discussed respectively below.
For situation (A), new participation chain adds network, and it inputs that the new participation chain of the network will be added, with
And the network (including other participation chains and intermediate chain in the network).When a new participation chain will add network, the ginseng
With chain oneself there may be one or a plurality of intermediate chain, and the intermediate chain of these new generations and exist in the network
Other participation chain necklaces, meanwhile, the participation chain may also be connected with other intermediate chains existed in the network；The participation
Chain oneself may not also produce intermediate chain, then the participation chain must link one or more intermediate chains existed.Its
Specific process is as follows.
(1) in the case where the participation chain needs oneself to produce new intermediate chain, procedure below is performed, until the participation chain
Untill no longer needing oneself to produce new intermediate chain：
(a) the participation chain produces a new intermediate chain；
(b) by calling algorithm 10, this intermediate chain is connected with the participation chain；
(c) find out it is every other the need for the participation chain existed that is connected with this intermediate chain (each intermediate chain is needed
Connect two and the above participate in chain), and be put into an other participation chain set；
(d) for each participation chain in other participation chain set of gained, by calling algorithm 10, by this participation
Chain is connected with this intermediate chain；
Then, perform：
(2) judge whether the participation chain needs to be connected with the intermediate chain existed in the network, if it is, into
(3) step；
(3) find out the participation chain in need need to be traded therewith other participate in chains, and find out it is all and these
Participate in the connected intermediate chain of chain；
(4) in the case where ensureing that all participation chains being found in previous step are all included, found out from last
An intermediate chain subset is found out in all intermediate chains, this is due to that each participation chain can be connected with a plurality of intermediate chain, so
An intermediate chain oneself can be found out ensure it is all the need for participation chain be all connected with these intermediate chains；
(5) for each intermediate chain in intermediate chain subset, by calling algorithm 10 by the participation chain and this
Between chain be connected.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 8, and new participation chain adds network.
For situation (B), new intermediate chain adds network, and it inputs that the new intermediate chain of the network will be added, with
And the network (including other participation chains and intermediate chain in the network).Its specific process is as follows.
(1) the participation chain existed in all networks for needing to be connected with the new intermediate chain that this will be added is found；
(2) if without or only one participation chain will be connected with the intermediate chain, to the intermediate chain return mistake letter
Breath, because every intermediate chain needs to be connected with two and above bar participation chain；If two or more bars participation chains will
To be connected with the intermediate chain, then into (3) step；
(3) these participation chains that will be connected with the intermediate chain are put into a set, by calling algorithm 10, by this
Each participation chain in set is connected with the intermediate chain.
The main algorithm of the process is presented below in the form of false code, is designated as algorithm 9, and new intermediate chain adds network.
For the algorithm 10 called in algorithm 8 and algorithm 9：One participation chain is connected with an intermediate chain, and it is inputted
Including a participation chain and an intermediate chain.Its detailed process is as follows.
(1) the participation chain is voted by each node to its inside and (visitd using CBFT or PBFT or others
Account for front yard common recognition agreement or database things agreement) decide whether to be connected with the intermediate chain, if voted successfully, into the
(2) step；If ballot failure, returns to error message；
(2) the participation chain sends checking information (such as digital signature) to the intermediate chain；
(3) checking information (using digital signature etc.) that intermediate chain checking is received, if be proved to be successful, into the
(4) step, otherwise, returns to error message；
(4) intermediate chain is voted by each node to its inside and (visitd using CBFT or PBFT or others
Account for front yard common recognition agreement or database things agreement) decide whether to be connected with the participation chain, if agreement, into (5)
Step, otherwise, returns to error message；
(5) selected in the quantity of the common node required for determining, and all nodes from the participation chain with the intermediate chain
The common node of these quantity；
(6) in these nodes selected, being put into an intermediate chain common node set of intermediate chain will be belonged to, will be belonged to
In being put into another participation chain common node set for participation chain；
(7) for each node in intermediate chain common node set, by the node and each node for participating in chain
It is connected；For participating in each node in chain common node set, the node is connected with each node of intermediate chain.
The main algorithm of the process is presented below in the form of false code, is designated as in algorithm 10, a participation chain and one
Between chain be connected.
Although the present invention is described by reference to specific illustrative embodiment, will not be by these embodiments
Restriction and only limited by accessory claim.It should be understood by those skilled in the art that can be without departing from the present invention's
Embodiments of the invention can be modified and be changed in the case of protection domain and spirit.
Claims (10)
1. a kind of core algorithm for the block chain the Internet model merchandised across chain, it is characterised in that：The model is as shown in figure 1, bag
Part containing consisting of：
(1) chain (Participant Blockchain, PPC) is participated in, one or more financial institutions or financial unit is represented, can
Comprising by one or more node；
(2) intermediate chain (Inter-chain Blockchain, ICC), represents an intermediary agency, itself is also a finance
Mechanism, can also play the effect of CCP (CentralCounterparty, central analogue), and intermediate chain has two with participating in chain
To multiple common nodes, intermediate chain is traded using common node with participating in chain；
(3) one or more intermediate chain can be connected between every two participation chains, every intermediate chain can connect two and be participated in a plurality of
Chain, and the transaction between two or more pieces participation chain is completed by intermediate chain, it includes two kinds of trade modes, with suitable for different
Demand (completes transaction, or non real-time but efficient transaction) immediately；
(3a) real-time deal (real-time transaction)：Two extremely a plurality of participation chains, which can pass through an intermediate chain, to be carried out
Real-time deal, each transaction of the execution of intermediate chain immediately；
(3b) Multi-Lateral Netting settles accounts (multilateral netting)：Every intermediate chain is carried out at the end of each billing cycle
Multi-Lateral Netting is settled accounts, and many transaction (tentative transaction) undetermined are handled together, plays a part of CCP, reduces and hand over
Easy number of times, improves trading efficiency；
(4) some multiple financial institutions constitute a distributed network in the form of participating in chain and intermediate chain, and every chain is safeguarded
The uniformity of oneself, the uniformity between chain and chain does not need central tissue to manage, and is able to run parallel, improves trading efficiency
With network operation speed；New financial unit can be easily added or leave at any time network, with scalability, support extensive
Network and high transaction volume.
2. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 1, it is characterised in that：
The part (1), the link network includes some many participation chains, and each participation chain represents one or more financial units, can
Comprising some multinodes, each node store full detail of the financial unit；Participate in all or part of node tool of chain
Have and adopted between franchise (whole nodes and part of nodes may participate in ballot both of which and are applied to this patent), each node
With concurrent Byzantine failure tolerance agreement (CBFT, Concurrent Byzantine Fault Tolerance) or practical Byzantium
Protocol for error tolerance (PBFT, Practical Byzantine Fault Tolerance) or other Byzantium (Byzantine) are altogether
Knowing the algorithm of agreement or database things uniformity (such as the algorithm using database things uniformity, then can not investigate
The node of lie, so that being the consistency algorithm of a reduction), to ensure that the uniformity of information between each node is altered with difficulty
Property, it is ensured that every participation chain uniformity of itself.
3. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 1, it is characterised in that：
The part (2), the link network includes some many intermediate chains, and each intermediate chain represents an intermediary agency, itself
Be a financial institution, can also play CCP (Central Counterparty, central analogue) effect, intermediate chain with
Participating in chain has two to more common nodes, and its schematic diagram is shown in Fig. 2 and Fig. 3.Intermediate chain includes multiple nodes, its all or part
Node has franchise (whole nodes and part of nodes may participate in ballot both of which and are applied to this patent).Each node
Between ensure the uniformity of information between each node using the Byzantine failure tolerance agreement database things agreement of reduction (or)
With the difficulty property altered.
4. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 3, it is characterised in that：
Intermediate chain is traded using common node with participating in chain.If some node on the intermediate chain is the public section of n bar chains
Point, as shown in Figure 5 and 7, then the memory space of the node is divided into n+1 part, respectively A1, and A2 ..., An are responsible for storage
The information of nth bar chain, and C (connection, a connection) part, are responsible for information passing to Aj parts from Ai parts
(i, j=1,2 ..., n), as shown in Fig. 4, Fig. 6 and Fig. 8.The core of the model is illustrated by taking the common node of two chains as an example below
Center algorithm, as shown in figure 4, the memory space of each common node is divided into L (left, left), R (right, right), C
(connection, connection) three parts.L portion stores the information of chain on the left of the common node, and R-portion stores the common node section
The information of point right side chain.The content of L portion and R-portion cannot be linked up directly, it is necessary to enter row information from L by C portion
R-portion is partially transferred to, or is sent to from R-portion the information transmission of L portion.
5. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 1, it is characterised in that：
The part (3), in the link network, can be connected with one to a plurality of intermediate chain, every intermediate chain between every two participation chains
Between can connect two to a plurality of participation chains, and two or more pieces completed by intermediate chain participate in transaction between chain, the link network can be with
Two kinds of different trade modes are realized, complete to merchandise immediately to meet, and non real-time but both different demands of efficiently merchandising：
(1) real-time deal：Two extremely a plurality of participation chains can pass through an intermediate chain and carry out real-time deal, the execution of intermediate chain immediately
Each transaction, realizes real-time settle accounts calculation；
(2) Multi-Lateral Netting is settled accounts：Every intermediate chain carries out polygon net at the end of each billing cycle (one hour or one day etc.)
Volume is settled accounts, and many transaction (tentativetransaction) undetermined are handled together, the number of times of settle accounts calculation is reduced, transaction effect is improved
Rate, because a settle accounts calculation can solve large quantities of transaction, but this method can not realize real-time settle accounts calculation.
6. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 5, it is characterised in that：
For (1) real-time deal, the core process of such a trade mode is as shown in Fig. 9 and Figure 13.The trade mode includes procedure below
(the following high-level for step is described, and detailed description is shown in《Specification》In《Embodiment》In arthmetic statement and pseudo- generation
Code), its flow is as shown in Figure 10 and Figure 14.
(1) chain 1 (PPC1) is participated in initiate to merchandise to intermediate chain 1 (ICC1)；
Following process (2) is divided into both of which：
Mould formula (I), is shown in Fig. 9：
(2) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction of process (1) is initiated successfully, after process (2) is finished, by the stateful transaction labeled as undetermined
(tentative)；
Mould formula (II), is shown in Figure 13：
Procedure below (2a) is performed simultaneously with process (2b)；
(2a) intermediate chain 1 (ICC1) returns to the information of the transaction request success or not to chain 1 (PPC1) is participated in；
(2b) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction of process (1) is initiated successfully, after process (2a) is finished with process (2b), the stateful transaction is labeled as to treat
Fixed (tentative)；
It is finished in above-mentioned mould formula (II) after (2a), other operations can be carried out by participating in chain 1 (PPC1), realize clog-free fortune
OK.
(3) participate in chain 2 (PPC2) and send whether the transaction request succeeds by participation chain 2 (PPC2) receiving to intermediate chain 1 (ICC1)
Message, if it is, the proof of the transaction can be received by sending the participation chain 2 (PPC2) to intermediate chain 1 (ICC1)；
Procedure below (4a) is performed simultaneously with process (4b)；
(4a) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 1 (PPC1) is participated in, and can perform；
(4b) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 2 (PPC2) is participated in, and can perform；
Two participation chains are received after intermediate chain 1 (ICC1) message, are immediately performed the intermediate chain 1 (ICC1) with participating in chain 1
(PPC1) and undetermined transaction of the intermediate chain 1 (ICC1) with participating in chain 2 (PPC2), until it is whole run succeeded untill, that is, complete
Merchandise (commit).
7. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 5, it is characterised in that：
Trade mode is planted for (2), Multi-Lateral Netting is settled accounts, the core process of such a trade mode is as shown in Figure 11 and Figure 15.The friendship
Easy pattern comprises the steps of that (the following high-level for step is described, and detailed description is shown in《Specification》In《Embodiment》
In arthmetic statement and false code), its flow is as shown in Figure 12 and Figure 16.
(1) chain 1 (PPC1) is participated in initiate to merchandise to intermediate chain 1 (ICC1)；
Following process (2) is divided into both of which：
Mould formula (I), is shown in Figure 11：
(2) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction is initiated successfully, after process (2) is finished, the stateful transaction is labeled as pre- (pre- undetermined
tentative)；
Mould formula (II), is shown in Figure 15：
Procedure below (2a) is performed simultaneously with process (2b)；
(2a) intermediate chain 1 (ICC1) returns to the information of the transaction request success or not to chain 1 (PPC1) is participated in；
(2b) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in；
If the transaction is initiated successfully, after process (2a) is finished with process (2b), by the stateful transaction labeled as pre- undetermined
(pre-tentative)；
It is finished in above-mentioned mould formula (II) after (2a), other operations can be carried out by participating in chain 1 (PPC1), realize clog-free fortune
OK.
(3) participate in chain 2 (PPC2) and send whether the transaction request succeeds by participation chain 2 (PPC2) receiving to intermediate chain 1 (ICC1)
Message, if it is, the proof of the transaction can be received by sending the participation chain 2 (PPC2) to intermediate chain 1 (ICC1)；
If the request is successfully received, the stateful transaction is labeled as (tentative) undetermined；
Procedure below (4a) is performed simultaneously with process (4b)；
(4a) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 1 (PPC1) is participated in, and can perform；
(4b) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 2 (PPC2) is participated in, and can perform；
At the end of the transaction waits the billing cycle, implementation procedure (5)；
(5) now the billing cycle terminates, and stops all transaction and transaction undetermined that will starting or initialize, completes
The transaction being carrying out, and by intermediate chain 1 (ICC1) to being marked as (tentative) undetermined within all billing cycles
Transaction carry out Multi-Lateral Netting clearing, into complete merchandise (commit) stage.
8. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 5, it is characterised in that：
One intermediate chain is as shown in Figure 4 with participating in the process that the common node of chain is traded by it.Below with a chain to another
Illustrate the effect of common node exemplified by chain transmission transaction request：One chain carries out common recognition ballot to each node first, and decision is
No to initiate to merchandise, the L portion of this chain and each common node of another chain obtains the transaction of other nodes of this chain
The content related to this transaction is passed to R-portion by information, the node by its C portion, then by each common node
R-portion, the transaction request relevant with the transaction is sent to each node of another chain, to prevent some or several sections
Point is practised fraud and causes system mistake or failure.
9. a kind of core of block chain the Internet model merchandised across chain double-chain in real time according to claim 8 is calculated
Method, it is characterised in that：When a chain is to another chain transmission information, its transfer mode is transmission in bulk, such as Figure 17 and Figure 18
It is shown, each node of a chain respectively to each node transmission information of another chain, with prevent some or certain it is several
Node is practised fraud and influences the correctness of whole transmitting procedure.When participation chain 1 (PPC1) is sent to intermediate chain 1 (ICC1) asks,
If participating in chain 1 (PPC1) has m node, respectively P1, P2 ..., Pm, TBC1 has a n node, respectively T1, T2 ...,
Tn, then by Pi, (i=1,2 ..., n) send request, all nodes send m*n request altogether to T1, T2 ..., Tn respectively.Example
Such as, as shown in figure 17, when participating in chain 1 (PPC1) to during intermediate chain 1 (ICC1) transmission request, node 1 is with node 2 respectively to centre
Each node of chain 1 (ICC1) sends solicited message；In another example, please to intermediate chain 1 (ICC1) transmission when participating in chain 2 (PPC2)
When asking, node 3 sends solicited message to each node of intermediate chain 1 (ICC1) respectively with node 4.
10. a kind of core algorithm of block chain the Internet model merchandised across chain according to claim 5, its feature exists
In：It is, to two participation chains, to participate in chain 1 (PPC1) and be traded with participating in chain 2 (PPC2) by intermediate chain, for process below
(1) to (4) each step brief description, detailed description is shown in《Specification》In《Embodiment》In arthmetic statement
With false code.
(1) chain 1 (PPC1) is participated in initiate to merchandise to intermediate chain 1 (ICC1)：
(1.1) participate in chain 1 (PPC1) (financial institution) and initiate transaction：Participating in ballot of the chain inside, (CBFT or PBFT etc. are visitd
Account for the fault-tolerant common recognition agreement in front yard or database things agreement) decide whether to initiate transaction, if so, participating in chain 1 (PPC1) to the transaction
Certification (using digital signature etc.) is encrypted in information, participates in chain 1 (PPC1) by common recognition, its public affairs with intermediate chain 1 (ICC1)
The L portion of conode (being node 1 and node 2 in illustration 9) obtains the full detail of the participation chain 1 (PPC1).Then, L
Part is supplied content relevant with this transaction and the digital signature of all nodes for participating in chain 1 (PPC1) etc. by C portion
The information of checking is transmitted to R-portion.During R-portion again gives these Transaction Information broadcast (broadcast) for having carried out encryption certification
Between chain 1 (ICC1) each node, as shown in figure 17；If it is not, error message is returned to chain 1 (PPC1) is participated in, and by the mistake
Journey is labeled as failure (failure)；
(1.2) intermediate chain 1 (ICC1) checking information：Intermediate chain (ICC1) is received after these Transaction Informations, and Transaction Information is carried out
Checking (uses digital signature etc.), if being proved to be successful, and each node carries out ballot to the transaction and builds block, and is by the transaction
(pending) state undetermined；If authentication failed, error message is returned, and preceding step is marked is
(failure)。
Following process (2) is divided into both of which：
Mould formula (I)：
(2) intermediate chain 1 (ICC1) sends transaction request to chain 2 (PPC2) is participated in：
(2.1) intermediate chain (ICC1) transmission transaction：(Byzantium such as CBFT or PBFT holds for ballot of the intermediate chain (ICC1) inside
Mistake common recognition agreement or database things agreement) decide whether to chain 2 (PPC2) transmission transaction is participated in, if so, then intermediate chain
(ICC1) certification (using digital signature etc.) transaction is encrypted, intermediate chain 1 (ICC1) is by common recognition, and it is with participating in chain 2
(PPC2) L portion of common node (being node 3 and node 4 in illustration 9) obtains whole letters of the intermediate chain 1 (ICC1)
Breath.Then, L portion by C portion by the numeral of all nodes of the content and intermediate chain 1 (ICC1) relevant with this transaction
Signature etc. is transmitted to R-portion for the information of checking.R-portion again broadcasts these Transaction Informations for encrypt certification
(broadcast) each node of chain 2 (ICC2) is participated in, as shown in figure 18；If it is not, error message is then returned, and will above
Step is marked as (failure)；
(2.2) chain 2 (PPC2) checking information is participated in：The transaction of the request of the participation chain 2 (PPC2) to receiving, which is verified, (to be used
Digital signature etc.), if being verified, participate in chain 2 (PPC2) and then carry out inside chooses whether receive the transaction in a vote；If checking
Failure, then return to failure information, and preceding step is marked as (failure).
Mould formula (II)：
(2a) intermediate chain 1 (ICC1) returns to the information of transaction success or not undetermined to chain 1 (PPC1) is participated in：
When the participation chain 1 (PPC1) have received the intermediate chain 1 (ICC1) be proved to be successful and the transaction be marked as it is undetermined
(pending) information, the participation chain need not be continued waiting for, and can go to carry out other transaction.
Process (2) of (2b) process with mould formula (I).
(3) participate in chain 2 (PPC2) and send whether the transaction request succeeds by participation chain 2 (PPC2) receiving to intermediate chain 1 (ICC1)
Message, if it is, the proof of the transaction can be received by sending the participation chain 2 (PPC2) to intermediate chain 1 (ICC1)：
(3.1) voted successfully if participating in chain 2 (PPC2), agreement receives the transaction, then returns and successfully believe to intermediate chain 1 (ICC1)
Breath, and carry out (3.2)；Otherwise, then failure information is returned to intermediate chain 1 (ICC1), and preceding step is marked is
(failure)；
(3.2) participation chain 2 (PPC2) sends the participation chain 2 (PPC2) to intermediate chain 1 (ICC1) can receive the proof of the transaction,
Such as participating in chain 2 (PPC2) has enough related resources to complete this transaction, and intermediate chain 1 (ICC1) is with participating in chain 2 (PPC2)
Transaction is set to (pending) state undetermined.
(4) intermediate chain checking participates in the information that chain 2 (PPC2) is returned, and determines whether the transaction meets execution condition, if so, then
Carry out (4a) and (4b)；Whether cancel transaction undetermined if it is not, then being chosen in a vote, and preceding step is marked be
(failure).(4a) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 1 (PPC1) is participated in, and can perform；
(4b) intermediate chain 1 (ICC1) informs that the transaction meets execution condition to chain 2 (PPC2) is participated in, and can perform.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710483789.4A CN107301600B (en) | 2017-06-23 | 2017-06-23 | Core construction method of block chain Internet model for cross-chain transaction |
| PCT/CA2018/000130 WO2018232494A1 (en) | 2017-06-23 | 2018-06-22 | A network of blockchains capable of cross-chain transactions |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710483789.4A CN107301600B (en) | 2017-06-23 | 2017-06-23 | Core construction method of block chain Internet model for cross-chain transaction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107301600A true CN107301600A (en) | 2017-10-27 |
| CN107301600B CN107301600B (en) | 2021-07-20 |
Family
ID=60136512
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710483789.4A Active CN107301600B (en) | 2017-06-23 | 2017-06-23 | Core construction method of block chain Internet model for cross-chain transaction |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107301600B (en) |
| WO (1) | WO2018232494A1 (en) |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107248076A (en) * | 2017-06-24 | 2017-10-13 | 北京天德科技有限公司 | A kind of core algorithm of the double-chain block chain the Internet model merchandised across chain |
| CN108600301A (en) * | 2018-03-08 | 2018-09-28 | 青岛墨客区块链有限公司 | A kind of across chain method between block chain and main block chain |
| CN108764875A (en) * | 2018-05-17 | 2018-11-06 | 深圳前海微众银行股份有限公司 | Transfer account method, device, system and the computer readable storage medium of block chain |
| CN108959621A (en) * | 2018-07-18 | 2018-12-07 | 百度在线网络技术（北京）有限公司 | A kind of implementation method, device, equipment and the storage medium of block chain network |
| CN109002527A (en) * | 2018-07-13 | 2018-12-14 | 江苏开放大学（江苏城市职业学院） | A method of its management online exam of network test system and utilization based on block chain |
| CN109035012A (en) * | 2018-06-11 | 2018-12-18 | 西安纸贵互联网科技有限公司 | A kind of across the chain processing method and computer readable storage medium of block catenary system |
| CN109035016A (en) * | 2018-06-28 | 2018-12-18 | 杭州复杂美科技有限公司 | A kind of multichain concurrent transaction method |
| CN109067832A (en) * | 2018-06-27 | 2018-12-21 | 南京百市通数字科技有限公司 | A kind of block chain transmission of transaction data method |
| CN109165945A (en) * | 2018-09-07 | 2019-01-08 | 腾讯科技（深圳）有限公司 | Represent node device electoral machinery, device, computer equipment and storage medium |
| CN109191298A (en) * | 2018-08-31 | 2019-01-11 | 深圳市有钱科技有限公司 | A kind of patent right transaction system |
| CN109299338A (en) * | 2018-10-31 | 2019-02-01 | 山东云息网络科技有限公司 | Transregional piece of chain data management system of one kind and method |
| CN110033271A (en) * | 2019-03-22 | 2019-07-19 | 湖南天河国云科技有限公司 | Across the chain method of commerce of one kind, system and computer readable storage medium |
| WO2019072263A3 (en) * | 2018-11-07 | 2019-08-29 | Alibaba Group Holding Limited | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| CN110288344A (en) * | 2019-06-25 | 2019-09-27 | 中国工商银行股份有限公司 | The assets transfer method and device of transregional piece of chain |
| WO2019211225A1 (en) * | 2018-05-01 | 2019-11-07 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| CN110727712A (en) * | 2019-10-15 | 2020-01-24 | 腾讯科技（深圳）有限公司 | Data processing method and device based on block chain network, electronic equipment and storage medium |
| US10554413B2 (en) | 2018-04-03 | 2020-02-04 | Alibaba Group Holding Limited | Cross-blockchain authentication method and apparatus, and electronic device |
| WO2020042936A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Parallel chain-based cross-chain transaction method and apparatus, and block chain system |
| WO2020042928A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Block chain network system |
| WO2020042931A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Public chain-based transaction method and blockchain system |
| WO2020042934A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Non-repudiation cross-chain transaction method and blockchain system |
| CN110866826A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Transaction method based on parallel chain and block chain system |
| US10628454B2 (en) | 2018-03-13 | 2020-04-21 | Blockpoint Systems Inc. | Relational blockchain database |
| CN111183622A (en) * | 2018-08-31 | 2020-05-19 | 重庆小雨点小额贷款有限公司 | Block chain system, information sharing method and related equipment |
| CN111666325A (en) * | 2020-05-18 | 2020-09-15 | 国网浙江省电力有限公司信息通信分公司 | Validity verification method for cross-link port calling |
| CN112491959A (en) * | 2020-10-28 | 2021-03-12 | 杭州趣链科技有限公司 | Cross-link resource exchange method, device and system based on relay link |
| US11030217B2 (en) | 2018-05-01 | 2021-06-08 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| US11194837B2 (en) | 2018-05-01 | 2021-12-07 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| CN115632791A (en) * | 2022-10-12 | 2023-01-20 | 南京航空航天大学 | Dynamic cross-chain data consistency decentralized verification method |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019055585A1 (en) * | 2017-09-12 | 2019-03-21 | Kadena Llc | Parallel-chain architecture for blockchain systems |
| US20210182966A1 (en) | 2019-03-01 | 2021-06-17 | Broadridge Fixed Income Liquidity Solutions, LLC | Computer platforms configured to implement a specialized communication session protocol for electronic execution of electronic transactions and methods of use thereof |
| WO2020180739A1 (en) * | 2019-03-01 | 2020-09-10 | Broadridge Fixed Income Liquidity Solutions, LLC | Computer platforms designed for improved electronic execution of electronic transactions and methods of use thereof |
| KR102365793B1 (en) | 2019-03-18 | 2022-02-21 | 어드밴스드 뉴 테크놀로지스 씨오., 엘티디. | Consensus system downtime recovery |
| US10938750B2 (en) | 2019-03-18 | 2021-03-02 | Advanced New Technologies Co., Ltd. | Consensus system downtime recovery |
| KR102230829B1 (en) | 2019-03-18 | 2021-03-23 | 어드밴스드 뉴 테크놀로지스 씨오., 엘티디. | Consensus system downtime recovery |
| US20200349564A1 (en) * | 2019-04-30 | 2020-11-05 | Salesforce.Com, Inc. | System and method of providing interoperable distributed and decentralized ledgers using consensus on consensus and delegated consensus |
| WO2021018048A1 (en) | 2019-07-26 | 2021-02-04 | 华为技术有限公司 | Cross-chain transaction method and apparatus |
| US20220284011A1 (en) * | 2019-08-06 | 2022-09-08 | Zeu Technologies, Inc. | Distributed blockchain transaction system |
| CN110505091B (en) * | 2019-08-23 | 2021-09-10 | 昆明理工大学 | Improved consensus method based on PBFT |
| CN113128998B (en) * | 2019-12-31 | 2024-04-12 | 航天信息股份有限公司 | Service processing method, device and system of block chain system |
| US11664973B2 (en) | 2020-04-21 | 2023-05-30 | International Business Machines Corporation | Trust-varied relationship between blockchain networks |
| CN111652617B (en) * | 2020-07-07 | 2023-09-22 | 中国银行股份有限公司 | Service processing system of cross-block chain platform |
| CN112202863B (en) * | 2020-09-24 | 2022-09-20 | 成都质数斯达克科技有限公司 | Data synchronization method and device, electronic equipment and readable storage medium |
| CN112600874B (en) * | 2020-11-24 | 2023-03-31 | 成都质数斯达克科技有限公司 | Node joining method and device, electronic equipment and readable storage medium |
| US11943360B2 (en) * | 2021-06-22 | 2024-03-26 | International Business Machines Corporation | Generative cryptogram for blockchain data management |
| US11695573B2 (en) | 2021-07-23 | 2023-07-04 | International Business Machines Corporation | Blockchain controlled cross-domain data transfer |
| CN113987077B (en) * | 2021-12-23 | 2022-03-29 | 太极计算机股份有限公司 | Data sensing and cross-link scheduling method and device based on chain code mechanism |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105488722A (en) * | 2015-11-30 | 2016-04-13 | 布比（北京）网络技术有限公司 | Asset data processing method and device based on derivation chain |
| CN106445711A (en) * | 2016-08-28 | 2017-02-22 | 杭州云象网络技术有限公司 | Byzantine-fault-tolerant consensus method applied to block chain |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10475030B2 (en) * | 2016-02-22 | 2019-11-12 | Bank Of America Corporation | System for implementing a distributed ledger across multiple network nodes |
| US10157295B2 (en) * | 2016-10-07 | 2018-12-18 | Acronis International Gmbh | System and method for file authenticity certification using blockchain network |
| CN107248076A (en) * | 2017-06-24 | 2017-10-13 | 北京天德科技有限公司 | A kind of core algorithm of the double-chain block chain the Internet model merchandised across chain |
-
2017
- 2017-06-23 CN CN201710483789.4A patent/CN107301600B/en active Active
-
2018
- 2018-06-22 WO PCT/CA2018/000130 patent/WO2018232494A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105488722A (en) * | 2015-11-30 | 2016-04-13 | 布比（北京）网络技术有限公司 | Asset data processing method and device based on derivation chain |
| CN106445711A (en) * | 2016-08-28 | 2017-02-22 | 杭州云象网络技术有限公司 | Byzantine-fault-tolerant consensus method applied to block chain |
Non-Patent Citations (2)
| Title |
|---|
| 孙国茂: "区块链技术的本质特征及在证券业的应用", 《上海证券报》 * |
| 高志豪: "区块链之跨链技术介绍", 《金卡工程》 * |
Cited By (54)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107248076A (en) * | 2017-06-24 | 2017-10-13 | 北京天德科技有限公司 | A kind of core algorithm of the double-chain block chain the Internet model merchandised across chain |
| CN108600301B (en) * | 2018-03-08 | 2021-05-18 | 青岛墨一客区块链有限公司 | Cross-link method between block chains and main block chain |
| CN108600301A (en) * | 2018-03-08 | 2018-09-28 | 青岛墨客区块链有限公司 | A kind of across chain method between block chain and main block chain |
| US10628454B2 (en) | 2018-03-13 | 2020-04-21 | Blockpoint Systems Inc. | Relational blockchain database |
| TWI690184B (en) * | 2018-04-03 | 2020-04-01 | 香港商阿里巴巴集團服務有限公司 | Cross-blockchain authentication method and device, and electronic equipment |
| US10554413B2 (en) | 2018-04-03 | 2020-02-04 | Alibaba Group Holding Limited | Cross-blockchain authentication method and apparatus, and electronic device |
| WO2019211225A1 (en) * | 2018-05-01 | 2019-11-07 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| CN112005264A (en) * | 2018-05-01 | 2020-11-27 | 国际商业机器公司 | Blockchain implementing cross-chain transactions |
| JP7324222B2 (en) | 2018-05-01 | 2023-08-09 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Computing system, method and computer program for managing blockchain |
| US11194837B2 (en) | 2018-05-01 | 2021-12-07 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| JP2021520539A (en) * | 2018-05-01 | 2021-08-19 | インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ | Computing systems, methods, and computer programs for managing the blockchain |
| US11030217B2 (en) | 2018-05-01 | 2021-06-08 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| CN108764875B (en) * | 2018-05-17 | 2021-07-06 | 深圳前海微众银行股份有限公司 | Block chain transfer method, device, system and computer readable storage medium |
| CN108764875A (en) * | 2018-05-17 | 2018-11-06 | 深圳前海微众银行股份有限公司 | Transfer account method, device, system and the computer readable storage medium of block chain |
| CN109035012B (en) * | 2018-06-11 | 2020-11-17 | 西安纸贵互联网科技有限公司 | Cross-chain processing method of block chain system and computer readable storage medium |
| CN109035012A (en) * | 2018-06-11 | 2018-12-18 | 西安纸贵互联网科技有限公司 | A kind of across the chain processing method and computer readable storage medium of block catenary system |
| CN109067832A (en) * | 2018-06-27 | 2018-12-21 | 南京百市通数字科技有限公司 | A kind of block chain transmission of transaction data method |
| CN109035016B (en) * | 2018-06-28 | 2020-10-23 | 杭州复杂美科技有限公司 | Multi-chain concurrent transaction method |
| CN109035016A (en) * | 2018-06-28 | 2018-12-18 | 杭州复杂美科技有限公司 | A kind of multichain concurrent transaction method |
| CN109002527A (en) * | 2018-07-13 | 2018-12-14 | 江苏开放大学（江苏城市职业学院） | A method of its management online exam of network test system and utilization based on block chain |
| CN108959621A (en) * | 2018-07-18 | 2018-12-07 | 百度在线网络技术（北京）有限公司 | A kind of implementation method, device, equipment and the storage medium of block chain network |
| CN110868441A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Block chain public link maintenance method and device, node and block chain public link |
| CN110868438B (en) * | 2018-08-28 | 2022-01-07 | 傲为信息技术(江苏)有限公司 | Block chain network system |
| CN110866823A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Public link-based transaction method and block chain system |
| CN110868438A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Block chain network system |
| WO2020042934A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Non-repudiation cross-chain transaction method and blockchain system |
| CN110868440A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Block chain male chain |
| WO2020042931A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Public chain-based transaction method and blockchain system |
| WO2020042928A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Block chain network system |
| CN110866826A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Transaction method based on parallel chain and block chain system |
| CN110868440B (en) * | 2018-08-28 | 2021-03-16 | 傲为信息技术(江苏)有限公司 | Block chain male chain |
| CN110868441B (en) * | 2018-08-28 | 2021-03-16 | 傲为信息技术(江苏)有限公司 | Block chain public link maintenance method and device, node and block chain public link |
| WO2020042936A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Parallel chain-based cross-chain transaction method and apparatus, and block chain system |
| CN110866826B (en) * | 2018-08-28 | 2022-10-11 | 傲为有限公司 | Transaction method based on parallel chain and block chain system |
| CN109191298A (en) * | 2018-08-31 | 2019-01-11 | 深圳市有钱科技有限公司 | A kind of patent right transaction system |
| CN111183622B (en) * | 2018-08-31 | 2022-11-15 | 重庆小雨点小额贷款有限公司 | Block chain system, information sharing method and related equipment |
| CN111183622A (en) * | 2018-08-31 | 2020-05-19 | 重庆小雨点小额贷款有限公司 | Block chain system, information sharing method and related equipment |
| CN109165945A (en) * | 2018-09-07 | 2019-01-08 | 腾讯科技（深圳）有限公司 | Represent node device electoral machinery, device, computer equipment and storage medium |
| CN109299338A (en) * | 2018-10-31 | 2019-02-01 | 山东云息网络科技有限公司 | Transregional piece of chain data management system of one kind and method |
| CN109299338B (en) * | 2018-10-31 | 2019-08-06 | 山东云溪网络科技有限公司 | Transregional piece of chain data management system of one kind and method |
| WO2019072263A3 (en) * | 2018-11-07 | 2019-08-29 | Alibaba Group Holding Limited | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| US10803052B2 (en) | 2018-11-07 | 2020-10-13 | Alibaba Group Holding Limited | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| US11036721B2 (en) | 2018-11-07 | 2021-06-15 | Advanced New Technologies Co., Ltd. | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| US11397725B2 (en) | 2018-11-07 | 2022-07-26 | Advanced New Technologies Co., Ltd. | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| CN110033271B (en) * | 2019-03-22 | 2023-12-22 | 湖南天河国云科技有限公司 | Cross-chain transaction method, system and computer readable storage medium |
| CN110033271A (en) * | 2019-03-22 | 2019-07-19 | 湖南天河国云科技有限公司 | Across the chain method of commerce of one kind, system and computer readable storage medium |
| CN110288344A (en) * | 2019-06-25 | 2019-09-27 | 中国工商银行股份有限公司 | The assets transfer method and device of transregional piece of chain |
| CN110727712A (en) * | 2019-10-15 | 2020-01-24 | 腾讯科技（深圳）有限公司 | Data processing method and device based on block chain network, electronic equipment and storage medium |
| CN111666325A (en) * | 2020-05-18 | 2020-09-15 | 国网浙江省电力有限公司信息通信分公司 | Validity verification method for cross-link port calling |
| CN111666325B (en) * | 2020-05-18 | 2024-04-19 | 国网浙江省电力有限公司 | Cross-link-port calling validity verification method |
| CN112491959B (en) * | 2020-10-28 | 2023-03-24 | 杭州趣链科技有限公司 | Cross-link resource exchange method, device and system based on relay link |
| CN112491959A (en) * | 2020-10-28 | 2021-03-12 | 杭州趣链科技有限公司 | Cross-link resource exchange method, device and system based on relay link |
| CN115632791A (en) * | 2022-10-12 | 2023-01-20 | 南京航空航天大学 | Dynamic cross-chain data consistency decentralized verification method |
| CN115632791B (en) * | 2022-10-12 | 2024-03-19 | 南京航空航天大学 | Dynamic cross-chain data consistency decentration verification method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107301600B (en) | 2021-07-20 |
| WO2018232494A1 (en) | 2018-12-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107301600A (en) | A kind of core algorithm for the block chain the Internet model merchandised across chain | |
| CN107248076A (en) | A kind of core algorithm of the double-chain block chain the Internet model merchandised across chain | |
| CN107392584B (en) | Cross-border payment system and cross-border payment method based on block chain payment system | |
| CN107239940A (en) | Network trading method and device based on block catenary system | |
| CN110689434B (en) | Cross-block chain interaction method based on notary group | |
| CN107147735A (en) | A kind of distributed account book system based on hierarchy | |
| CN105488675B (en) | Block chain distributed shared general ledger construction method | |
| CN106504094A (en) | Transaction match method and system based on the distributed general ledger system of block chain technology | |
| WO2020220746A1 (en) | Block chain-based settlement method and apparatus, and electronic device | |
| CN110852734A (en) | Scenic spot service settlement method and system based on block chain and electronic equipment | |
| CN111369730B (en) | Voting processing method and device based on block chain | |
| CN111612453A (en) | Decentralized transaction method and device based on block chain and electronic equipment | |
| CN108009818A (en) | A kind of on-line payment method and system based on distributed network | |
| CN107909440A (en) | A kind of distribution general ledger system transaction synchronization liquidation method and system | |
| CN111461889A (en) | Cross-chain transaction system, method and storage medium for alliance blockchain | |
| CN111127120B (en) | Service data processing system, relevant nodes and method based on block chain technology | |
| CN109304033A (en) | A kind of computer game system and method, equipment and storage medium | |
| CN108762895A (en) | Handle the method and device of distributed transaction | |
| CN107330775A (en) | A kind of first valency sealing method of commerce based on bit coin agreement | |
| CN116415955A (en) | Cross-chain transaction method and system based on combination of hash locking and notary | |
| US20200175562A1 (en) | Gem trade and exchange system and previous-block verification method for block chain transactions | |
| KR20210053774A (en) | System and method for trading based on party trust using blockchain | |
| CN114154980B (en) | Multi-party bidding digital asset transaction system and method based on intelligent contract | |
| CN108596763A (en) | A kind of method of commerce and device based on block chain | |
| Mayer et al. | BatPay: a gas efficient protocol for the recurrent micropayment of ERC20 tokens |
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 |