CN109286685A - The system architecture of the more subchains of main chain adduction row of subchain can be expanded - Google Patents
The system architecture of the more subchains of main chain adduction row of subchain can be expanded Download PDFInfo
- Publication number
- CN109286685A CN109286685A CN201811392140.2A CN201811392140A CN109286685A CN 109286685 A CN109286685 A CN 109286685A CN 201811392140 A CN201811392140 A CN 201811392140A CN 109286685 A CN109286685 A CN 109286685A
- Authority
- CN
- China
- Prior art keywords
- subchain
- chain
- node
- main chain
- nodes
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
Abstract
One kind of the present invention can expand the system architecture of the more subchains of main chain adduction row of subchain, contain a main chain and a plurality of parallel subchain, and each node stores main chain data, and by the total data of one subchain of system original allocation；Whether minimum nodes number and maximum node number is arranged in main chain data, and the corresponding node number of subchain can just come into force not less than minimum nodes number, and subchain number of nodes is no more than maximum node number, also come into force comprising subchain in main chain data；When register node, chain linked to owner system contract submits registration request, and system judges whether there is the subchain that number of nodes is less than maximum node number, if so, just node is assigned in the least subchain of number of nodes, otherwise, a new subchain is just expanded, but the subchain does not come into force also；After Node registry, the number of nodes of corresponding subchain is not less than minimum nodes number for the first time, and new subchain is made to come into force, and subchain number and system capability are extendables, and participation node is more, and subchain is more, and system capability is stronger.
Description
Technical field
The present invention relates to block chain technologies, especially propose a kind of system architecture of more subchains of main chain adduction row, especially
A kind of system architecture of the more subchains of main chain adduction row that expanding subchain, improves the scalability and performance of block chain.
Background technique
Each ordinary node in present block chain will: 1, storage institute is stateful；2, All Activity is serially executed；3, with
Other all machines are reached common understanding.
Extension basic ideas for existing block chain are: 1, individual node storage section state；2, individual node
It trades processing part；3, part of nodes is only allowed to participate in common recognition.
Refering to Figure 1, it is the schematic diagram by user's fragment.If pressing user's fragment, it is difficult to handle different points
Transferring accounts between piece user, contract are also difficult to dispose, if be deployed on all fragments, contract state can not be consistent, if
It is only deployed on some fragment, and the request of other fragmented users can not be handled.
It please refers to shown in Fig. 2, for by the schematic diagram of contract fragment.If pressing contract fragment, each contract requires energy
The transaction of all users is handled, and every transaction can all check/modify that the account status of user (for example, for ether mill, owns
Transaction all will modify account balance because of consumption gas, for EOS, modify CPU/ bandwidth/storage quota of account), contract is simultaneously
What row executed, it not can guarantee the consistency of User Status, in addition, often calling mutually between contract, if being distributed in different points
On piece, and can not call.
And third extends thinking, part of nodes participates in common recognition, can cause 1% attack, that is, suppose there is 100 fragments, attack
The person of hitting only needs to control 1% node, can fully control a fragment.
Existing expansion scheme mainly have ether mill sharding, ether mill plasma, Cosmos Network,
Polkadot, Lisk, A Xilian, Zilliqa, VBFT, DPOS, Algorand, Dfinity etc..
Ether mill sharding: long-range solution ether mill scaling problem.Main at present to consider 1% attack, fragment chain cannot
Transaction is executed, is had from practical application relatively remote.
Ether mill plasma: being contract fragment by application, and part contract stores and executes on side chain, token can be turned
To side chain, subsequent transaction carries out on side chain, even if side chain is insincere, token can also be gone back to safely to main chain, represent and realize
There is the game chain of Loom network.Limitation is that side chain must go back to token consumption using UTXO model, practical application narrow limits
When it is too long, need at least 7 days.
Cosmos Network, Polkadot: by fragment is applied, there is a main chain, each using the side chain of oneself,
Main chain/side chain interaction protocol is defined, while providing underlying platform and tool facilitates third party to develop customized side chain.Limitation is
Subchain is opaque to user, and subchain has 1% attack problem, and all in exploitation, shortage is discussed in detail two projects.
Lisk, A Xilian: by fragment is applied, the ease for use of creation side chain is laid particular emphasis on.Limitation is that subchain is opaque to user,
Subchain has 1% attack problem, compares Cosmos/Polkadot, and side chain customizes weak.
Zilliqa: pressing user's fragment, and transaction (i.e. user and contract are in the same fragment) can be simultaneously in the chain of different subchains
Row executes.Limitation is to be unable to complete parallel, does not have state fragment, across chain communication, in exploitation, shortage is discussed in detail.
VBFT, DPOS, Algorand, Dfinity: part of nodes participates in common recognition, while avoiding 1% attack, and DPOS is to throw
It votes for lifting node, VBFT/Algorand/Dfinity, which is used, can verify that random selection common recognition node.Limitation is still to be limited to list
Machine storage/processing/network capabilities.
In summary, scalability is still a difficult point at present, and being extended by fragment and multichain is one basic
Resolving ideas, but critical issue is how to carry out fragment? multichain how is set externally to be rendered as a chain? how safety is being guaranteed
Under the premise of, lower across chain expense is kept, realize linear expansion? this is also exactly that the present invention will be studied and be solved the problems, such as.
Summary of the invention
It is an object of the invention to not sacrificing security and it is distributed under the premise of, solve current block chain scalability
Problem, especially can constantly expanding node and subchain, the ability of system it is unrestricted.
The present invention provides a kind of system architecture of more subchains of main chain adduction row that can expand subchain, it includes a main chain and
The parallel subchain of N item, wherein n=1 ... .X, wherein each node stores main chain data, each node is stored by system original allocation
The total data of one subchain；
Two systems configuration parameter is arranged in the main chain data, first is that minimum nodes number min Nodes, another is maximum section
Count max Nodes, and the corresponding node number of subchain can just come into force not less than minimum nodes number, and subchain number of nodes is no more than maximum
Number of nodes, the status data also whether to come into force comprising subchain in main chain data；
When register node, chain linked to owner system contract submits registration request, and system judges whether there is number of nodes less than max
Otherwise the subchain of Nodes, just expands a new subchain if so, just node is assigned in the least subchain of number of nodes,
But the subchain does not come into force also；If after Node registry, the number of nodes of corresponding subchain is not less than min Nodes for the first time, then make new son
Chain comes into force.
Subchain number and system capability are extendables in this programme, and participation node is more, and subchain is more, system capability
It is stronger.In addition, system structure of the invention has following features:
1, versatility: not only may be implemented to transfer accounts across chain, can also realize any across chain message transmission.
2, reliability: similar with Transmission Control Protocol, communication is that reliably, it is not one-way transmission that request, which centainly has response,.
3, safety: any node has main chain information, namely has the subchain build of all subchains, can be used as all sons
The SPV client of chain can verify the request/response of any subchain by Merkle Proof, directly connect without trusting
The subchain node connect.
Across chain communication be also efficiently and it is expansible, this is embodied in:
1, across the chain communication details of subchain are not sent to main chain, also not propagated in main chain P2P Internet communication, main chain
There is new request/response notification information.
2, across the chain communication notifications message of subchain is that All Activity summarizes in subchain block, is submitted to subchain build
Main chain, not additional communication overhead.
3, there is no particular transactions on main chain, the transaction number in a main chain block is only related with subchain number, at one
Know together the period in, only one node of each subchain submit transaction arrive main chain, transaction content be main chain modification, subchain build and
Across the chain notification information summarized, so the transaction of main chain, network communication, storage etc. are not bottlenecks.
4, subchain node disjoint application main chain block is directly connected to other neighbouring subchain node acquisition request/response details,
This process be it is parallel, distributed, no node is bottleneck.
In summary, although across chain communication is via main chain, the load of main chain is very low, is not bottleneck, the son that can be accommodated
The number of deals that may include in chain number and main chain block is related, is calculated with block size 1MB, single transaction 1KB, can accommodate 1024
A subchain, before subchain number reaches the value, whole system processing capacity can increase and linear expansion with subchain number.
Detailed description of the invention
Fig. 1 is to expand schematic diagram by the block chain of user's fragment in the prior art.
Fig. 2 is to expand schematic diagram by the block chain of contract fragment in the prior art.
Fig. 3 is the system logic figure that the more subchains of main chain adduction row are used in the present invention.
Fig. 4 is the architecture diagram based on the individual node under the more subchain logics of chain adduction row in the present invention.
Fig. 5 is the multipoint architecture scheme disposed in the present invention based on single-point in Fig. 4.
Fig. 6 is the flow chart of main chain and subchain interaction.
Fig. 7 is to obtain node link information according to transaction Hash txhash and block Hash blockhash and trade detailed with block
The flow chart of feelings.
Fig. 8 is to initiate to prove that (Merkle Proof) carries out data by Merkel between the node and destination node of transaction
The flow chart of verifying.
Fig. 9 is the storage of node and subchain in main chain data.
Figure 10 is Node registry and the basic flow chart that subchain is expanded.
Specific embodiment
It please refers to shown in Fig. 3, the system logic figure of parallel subchain is added for main chain proposed by the present invention.The present invention includes
1 main chain and the parallel subchain of n item, wherein n=1 ... .X, each node stores main chain data, and stores certain by system original allocation
The total data of subchain, each node also includes across the chain message queue of subchain.Wherein, the main chain data do not store specific friendship
Easily, storage system global information includes at least: subchain number, subchain build, the mapping relations of account and subchain, contract with
The mapping relations of subchain, the mapping relations of back end and subchain, mapping relations, across the chain request/sound for verifying node and subchain
Answer whether notification information, all contract codes, subchain load, subchain come into force.Wherein, across the chain notification message is and subchain
The corresponding notification message of service management in across chain message queue.Each subchain has a subchain id, each node
With a node i d, subchain information herein refers to subchain id, and subchain position includes subchain id and the corresponding subchain section of source subchain
Point link information, the subchain node link information are stored in back end<->subchain mapping table, are mainly located at comprising a subchain
On those nodes, the IP address of these nodes and port.
Wherein, each node includes the account of corresponding subchain, contract by the total data of the initially allocated subchain of system
And transaction.Contract in the total data of the subchain is removed comprising contract code, also the complete informations such as state comprising contract.Its
In, across the chain message queue of subchain includes two classes, and one kind is across chain request queue, and each target subchain creates one, storage
The request message details of target subchain are sent to, different target subchains is divided into different queues；Another kind of is across chain response queue,
Each source chain creation one, storage are sent to the response message details of source chain, and different source chains is divided into different queues.
Each node is realized above-mentioned architectural schemes, in network layer, is removed by the point-to-point access of P2P network implementations
It also include subchain P2P outside comprising main chain P2P, main chain P2P network submits data (subchain build, subchain pair for subchain chain linked to owner
The modification information of main chain, across chain notification information), propagate main chain data, (across chain notification information is in each node for across chain communication-cooperation
Between communication).Subchain P2P is divided into two classes: subchain data P 2 P and subchain verifying P2P again.Store the total data of certain subchain
Each node by subchain data P 2 P Network Synchronization subchain trade and block.It is responsible for each section of the same subchain transaction of verifying
Point verifies P2P by subchain and transaction and block is verified and signed.For some node, it may be some subchain number
According to storage person, participate in subchain data P 2 P network, while may be the same subchain or the verifier of other subchains, participate in son
Chain verifies P2P network.The subchain role of node is that system is initially allocated, and storage person role is relatively constant, and is responsible for which strip
The verifying of chain is then that dynamic random adjusts, and each block period is different out, this is to guarantee peace while realizing expansible
Entirely, the method for 1% attack is avoided.
It please refers to shown in Fig. 4, for the architecture diagram of individual node in the present invention.Each node storage main chain data are divided
Across the chain message queue of the subchain data and the subchain matched.Please refer to shown in Fig. 5, for based under Fig. 4 interior joint framework
Multinode deployment scheme.It is exemplary in the program to list 6 nodes A, B, C, D, E, F.Each node is stored with main chain
Data, interior joint A, B and C form the data P 2 P network of subchain x by the data of system original allocation storage subchain x.Node
D, E and F forms the data P 2 P network of subchain y by the data of system original allocation storage subchain y.The scheme packet shown in the figure
Containing a main chain and 2 parallel x, y subchain.The moment in figure, node A, D and E are responsible for the verifying of subchain x data, node B, C
It is responsible for the verifying of subchain y data with F.
It please refers to shown in Fig. 6, is the interaction of main chain and subchain under the more subchain system architectures of main chain adduction row.Subchain goes out block
It afterwards, can be by main chain P2P Web broadcast subchain build, subchain to the modification of main chain and across chain request/response notification information
Subchain collection.The submission of all subchains will form main chain block, be broadcast to all nodes.Each node, can more after receiving main chain block
New local main chain is notified with keeping the main chain of all nodes consistent according to across the chain request/response notification message in main chain build
Other subchain information of acquisition request or the current subchain of response, are directly connected to other subchain node acquisition request/response details simultaneously
It is handled.
Under this framework, main chain build can be used and verify the transaction of other subchains.Under this framework, each node is because be
System original allocation stores the total data of a certain subchain, is its full node for corresponding to subchain, while each node stores
Main chain data, are the light nodes of other all subchains, and each node is the full node of main chain.Merkel proves: referring to one light section
O'clock to a full node initiate it is primary prove request, inquire in the complete Merkel tree of full node, if specified there are one
Data or transaction；Full node, which returns to a Gadamer gram to light node, proves path, is calculated by light node, and verifying exists
Property.
In the present solution, Merkel proves to can be used for checking request/response details.
It please refers to shown in Fig. 7, to obtain node link information according to transaction Hash txhash and block Hash blockhash
And the flow chart of transaction and block details.Subchain id value is embedded in hash, inquiry is parsed from transaction hash and block hash
Source subchain id and/or reception subchain id, and subchain node link information is inquired according to subchain id, the subchain node link information
It is stored in the back end of main chain data and the mapping relations of subchain, is mainly located on those nodes comprising a subchain, this
The IP address of a little nodes and port.
It being made of inside this system main chain and a plurality of subchain, each node has main chain information, but only subchain
Information.However, from the user's point of view, the concept of subchain is simultaneously not present, each node only has a chain, all about this chain
Complete information, its all interactions can be completed by the node.The trading function of traditional main chain switchs to coordination function, by it
Parallel subchain is specifically traded to handle each pen, since each node stores main chain data, each user and some section
When point interaction, final transaction can be realized by the system global information recorded in main chain data.
It please refers to shown in Fig. 8, is the process across chain request/response, between the node and destination node to initiate transaction
Prove that (Merkle Proof) carries out the flow chart of data verification by Merkel.The present invention is based on how sub above-mentioned main chain adduction row is
Chain framework proposes across a catenary system contract, and being somebody's turn to do the external interface of across catenary system contract is send method, its parameter source address
SrcAddr, target subchain destChain, address destAddr, payment amount bill and request message reqMsg are received.Across chain
There is an address across catenary system contract, which is the fixed value of a not no private key, which is in generation in system contract
It is being fixed in code, disclosed, as long as the address is correctly, to receive address and the amount of money is also correctly, to transfer accounts across chain and exactly pacify
Complete.
In figure, chain A is source subchain, and A node is user's subchain node, and chain B is to receive subchain, and B node is intended recipient section
Point, the transaction of each node by subchain where it carry out data submission, verifying, out block with it is synchronous etc., chain A node contains
The concept of node also contain where chain concept, text in and figure in simplify common recognition process, use a node as representative.
User pays across the catenary system contract of chain A first, and the source subchain A node where user receives request message details
After reqMsg, it can be put into local for across the chain request queue for receiving subchain destChain.After in source, subchain A goes out block, source
Chain A node can submit source chain A build information by main chain P2P network chain linked to owner, submit in the block also converged in information and own
Across the chain request notification information of transaction, such as the request [req, A- > B] of chain A directed chain B, but without request details.Each subchain
The transaction that chain linked to owner is submitted will form main chain block, and comprising across chain notification information therein, pass through main chain P2P Web broadcast to institute
There is node.
When reception subchain B node receives main chain block, discovery wherein has chain A to notify to the request of chain B, is just directly connected to chain A
Node, acquisition request details, and the Merkel of request prove (Merkle Proof) data.Chain B node is according to local main chain
The chain A build for including in information and Merkel prove the solicited message of (Merkle Proof) data verification chain A node, and verifying is used
After family is paid really, processing request pays destination address, generates across chain response detail information, be stored in and update across chain sound
Answer quene state.When chain B node submits build information by main chain P2P network chain linked to owner, across chain response notice letter can be submitted
Breath, such as the response of chain B directed chain A, but without response details.
When the submission of chain B is incorporated into main chain block and is synchronized to chain A node, chain A node is directly connected to chain B section
Point, obtains response details, and the Merkel including response proves (Merkle Proof) data.Chain A node is according to local main chain
The chain B build for including in information and Merkel prove the response of (Merkle Proof) data verification chain B node, are verified
Afterwards, request queue is updated, possible failure rollback is handled, if chain B payment failure, gives user's reimbursement, finally call user
The call back function of offer.
It please refers to shown in Fig. 9, is the storage of node and subchain, also sets up two systems configuration parameter in main chain data,
First is that minimum nodes number-min Nodes and it is another be maximum node number-max Nodes, the corresponding node number of subchain is not less than
Minimum nodes number-min Nodes can just come into force, and subchain number of nodes is no more than maximum node number-max Nodes.
Referring to Fig. 10, chain linked to owner system contract submits registration request when register node, system judges whether there is node
Otherwise subchain of the number less than max Nodes, just expands one if so, just node is assigned in the least subchain of number of nodes
The new subchain of item, but the subchain does not come into force also.If after Node registry, the number of nodes of corresponding subchain is not less than min Nodes for the first time,
New subchain is then set to come into force.Subchain number and system capability are dynamic expansions in this programme, and participation node is more, and subchain is more,
System capability is also stronger.
Above scheme, real trade are not completed by main chain, and main chain only records the summary info of subchain, greatlys improve
The performance of block chain, randomly selects the verifying node of subchain, can substantially increase security performance to avoid 1% attack.
Claims (7)
1. the system architecture of the more subchains of main chain adduction row of subchain can be expanded, it is characterised in that: parallel comprising a main chain and N item
Subchain, wherein n=1 ... .X, wherein each node stores main chain data, each node stores a subchain by system original allocation
Total data；
Two systems configuration parameter is arranged in the main chain data, first is that minimum nodes number min Nodes, another is maximum node number
Max Nodes, the corresponding node number of subchain can just come into force not less than minimum nodes number, and subchain number of nodes is no more than maximum node
It counts, the status data also whether to come into force comprising subchain in main chain data；
When register node, chain linked to owner system contract submits registration request, and system judges whether there is number of nodes less than max Nodes
Subchain otherwise, just expand a new subchain, but the son if so, just node is assigned in the least subchain of number of nodes
Chain does not come into force also；If after Node registry, the number of nodes of corresponding subchain is not less than min Nodes for the first time, then new subchain is made to come into force.
2. the system architecture of the more subchains of main chain adduction row of subchain can be expanded as described in claim 1, it is characterised in that:
The main chain data also include subchain load, and this system also includes account distribution and migration, and the account is distributed and migration
Process are as follows:
S1: account is initially allocated in subchain most lightly loaded；
S2: go out block node and periodically account trading is analyzed, on dynamic migration to the most frequent subchain of interaction, created contract
Account cannot migrate, do not need to analyze, detailed process is:
S2-1: to each account, the number of deals of transaction and other each subchain transaction in its chain is analyzed, each subchain is obtained and hands over
Easy frequency；
S2-2: judging whether to migrate, and migrates to which subchain；
S2-3: if necessary to migrate, submit account migration transaction, which includes two parts, first is that modification main chain on account with
The mapping relations of subchain, because being account of the same name, do not need account signature second is that transferring accounts across chain to target subchain account of the same name；
The node of other same subchain is migrated according to same proof of algorithm and is traded, and after verifying block, is submitted to main chain, main chain goes out
It is synchronized to all nodes after block, modifies the mapping relations on main chain.
3. the system architecture of the more subchains of main chain adduction row of subchain can be expanded as claimed in claim 2, it is characterised in that:
The total data for the subchain that each node is stored by system original allocation includes account, contract and the friendship of corresponding subchain
Easily；
Each node also includes across the chain message queue of subchain, across the chain message queue of subchain include two kinds, one kind be across
Chain request queue, each target subchain create one, and storage is sent to the request message details of target subchain, different target subchains
It is divided into different queues.Another kind of is across chain response queue, each source chain creation one, and the response message that storage is sent to source chain is detailed
Feelings, different source chains are divided into different queues；
Wherein, the main chain data do not store particular transactions, and storage system global information, include at least: subchain number, subchain
Build, the mapping relations of account and subchain, contract and the mapping relations of subchain, the mapping relations of back end and subchain, verifying
The mapping relations of node and subchain, across chain request/response notification information, all contract codes；Across the chain request/response notice
Information corresponds to the notice of across chain request/response queue, is free of details；
Each meshed network layer, includes main chain P2P network, and subchain data P 2 P network and subchain verify P2P network；
Wherein, main chain P2P network submits data, propagation main chain data, across chain communication-cooperation for subchain chain linked to owner；
Wherein, each node for storing the total data of certain subchain passes through the transaction of subchain data P 2 P Network Synchronization subchain and area
Block；
Wherein, each node for being responsible for the same subchain transaction of verifying is verified P2P network by subchain and is tested transaction and block
It demonstrate,proves and signs；
The data of the submission of all subchains will form main chain block, be broadcast to all nodes, each node is after receiving main chain block, meeting
Local main chain is updated, to keep the main chain of all nodes consistent.
4. the system architecture of the more subchains of main chain adduction row of subchain can be expanded as claimed in claim 3, it is characterised in that:
After subchain goes out block, subchain build can be submitted by main chain P2P Web broadcast chain linked to owner, subchain to the modification information of main chain,
Across chain request/response notification information；
The submission of all subchains will form main chain block, be broadcast to all nodes；
Each node will be updated local main chain after receiving main chain block, to keep the main chain data of all nodes consistent；
Present node according to across the chain request/response notification information acquisition request or the current subchain of response in main chain data other
Subchain information directly connects other subchain node acquisition requests or response message details and is handled.
5. the system architecture of the more subchains of main chain adduction row of subchain can be expanded as claimed in claim 4, it is characterised in that:
When present node obtains across chain request or response message details, request Merkel's proof data together, destination node according to
The current subchain build for including in local main chain information and Merkel prove the solicited message of data verification present node, verifying
By rear, processing request.
6. the system architecture of the more subchains of main chain adduction row of subchain can be expanded as claimed in claim 5, it is characterised in that:
Also comprising a kind of across catenary system contract, the external interface of the contract is send method, its parameter source address, target
Chain receives address, payment amount and/or request message, has an address across catenary system contract in across the catenary system contract,
The address is the fixed value of a not no private key, which is fixed, disclosed in code；
The workflow across catenary system contract are as follows:
User pays across the catenary system contract of source subchain first, and it is detailed that source subchain user's subchain node at place receives request message
After feelings, it can be put into local across the chain request queue for reception subchain, and after in source, subchain goes out block, source subchain node can pass through master
Chain P2P network chain linked to owner submits source chain build information, submits across the chain request of All Activity in the block also converged in information logical
Know information；The transaction that each subchain chain linked to owner is submitted will form main chain block, and comprising across chain notification information therein, pass through main chain
P2P Web broadcast is to all nodes；
When reception subchain destination node receives main chain block, wherein active subchain is notified to across the chain request for receiving subchain for discovery,
The Merkel for being just directly connected to chain user's subchain node, acquisition request message details, and request proves data；Receive subchain target
Node proves asking for data verification user subchain node according to the source subchain build and Merkel that include in local main chain information
Information is sought, is verified after user pays really, processing request pays destination address, generates across chain response detail information, is stored in
And update across chain response queue's state；When receiving subchain destination node by main chain P2P network chain linked to owner submission build information,
Across chain response notification information can be submitted；
When the submission for receiving subchain is incorporated into main chain block and is synchronized to user's subchain node, user's subchain node is direct
Connection receives subchain destination node, obtains response details, and the Merkel including response demonstrate,proves data；User's subchain node is according to local
Main chain information in include reception subchain build and Merkel prove data verification chain destination node response, be verified
Afterwards, request queue is updated, possible failure rollback is handled, if receiving subchain payment failure, user's reimbursement is given, finally calls
The call back function that user provides.
7. the system architecture of the more subchains of main chain adduction row of subchain can be expanded as claimed in claim 6, it is characterised in that: node returns
Any transaction or when block hash, is embedded in subchain id value, inquiry is parsed from transaction hash and block hash in hash
Source subchain id and/or reception subchain id out, and subchain node link information is inquired according to subchain id, subchain node connection letter
Breath is stored in the back end of main chain data and the mapping relations of subchain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811392140.2A CN109286685A (en) | 2018-11-21 | 2018-11-21 | The system architecture of the more subchains of main chain adduction row of subchain can be expanded |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811392140.2A CN109286685A (en) | 2018-11-21 | 2018-11-21 | The system architecture of the more subchains of main chain adduction row of subchain can be expanded |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109286685A true CN109286685A (en) | 2019-01-29 |
Family
ID=65172834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811392140.2A Pending CN109286685A (en) | 2018-11-21 | 2018-11-21 | The system architecture of the more subchains of main chain adduction row of subchain can be expanded |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109286685A (en) |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109559234A (en) * | 2019-01-31 | 2019-04-02 | 杭州复杂美科技有限公司 | A kind of storage method, equipment and the storage medium of block chain status data |
| CN109829718A (en) * | 2019-01-30 | 2019-05-31 | 缀初网络技术(上海)有限公司 | A kind of block chain multi-layer framework and its operation method based on storage application scenarios |
| CN109919615A (en) * | 2019-03-01 | 2019-06-21 | 上海分布信息科技有限公司 | Across chain data interactive method and across chain data interaction system based on block chain |
| CN110083661A (en) * | 2019-04-30 | 2019-08-02 | 翟红鹰 | A kind of expansion method of block catenary system, block catenary system, terminal device and storage medium |
| CN110233802A (en) * | 2019-05-14 | 2019-09-13 | 天津大学 | A method of the block chain framework of the building more side chains of one main chain |
| CN110287196A (en) * | 2019-06-29 | 2019-09-27 | 杭州复杂美科技有限公司 | Block storage method, parallel chain transaction acquisition methods, equipment and storage medium |
| CN110417911A (en) * | 2019-08-08 | 2019-11-05 | 北京芯际科技有限公司 | A kind of duplex structure about block chain |
| CN111026511A (en) * | 2019-11-20 | 2020-04-17 | 中国科学院计算技术研究所 | Block chain parallel system and method based on transaction data partition-inter-chain fusion |
| CN111046437A (en) * | 2019-10-31 | 2020-04-21 | 中国科学院计算技术研究所 | Block chain parallel transaction processing method and system based on isomorphic multi-chain and terminal |
| CN112261156A (en) * | 2020-12-21 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Method and system for submitting cross-fragment transaction, main chain node and source fragment node |
| CN111428275B (en) * | 2020-03-13 | 2021-03-26 | 华东师范大学 | Alliance chain-oriented service non-stop fragment increasing method |
| CN112907367A (en) * | 2019-12-03 | 2021-06-04 | 微观(天津)科技发展有限公司 | Cross-border trade data management method and device based on block chain and storage medium |
| CN113067772A (en) * | 2021-06-02 | 2021-07-02 | 支付宝(杭州)信息技术有限公司 | Transaction forwarding method between block chain networks |
| CN113067838A (en) * | 2021-06-02 | 2021-07-02 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259456A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259454A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259453A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259460A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259237A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Transaction forwarding method between block chain networks |
| CN113259463A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and block chain system |
| CN113342888A (en) * | 2021-05-19 | 2021-09-03 | 中国科学院计算技术研究所 | Method and system for vertical extension of hyper account book Fabric |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107040384A (en) * | 2017-05-08 | 2017-08-11 | 飞天诚信科技股份有限公司 | A kind of authorizing information method and device based on block chain |
| CN107045518A (en) * | 2016-10-18 | 2017-08-15 | 北京天德科技有限公司 | A kind of extension design method of block chain |
| CN107464112A (en) * | 2017-07-20 | 2017-12-12 | 捷德（中国）信息科技有限公司 | Exchange management method and system based on block chain |
| CN107464106A (en) * | 2017-07-25 | 2017-12-12 | 北京果仁宝科技有限公司 | The method and system merchandised between block chain main chain and side chain |
| CN107528886A (en) * | 2017-07-25 | 2017-12-29 | 中国科学院计算技术研究所 | Block chain the whole network method for splitting and system |
| CN107729471A (en) * | 2017-10-13 | 2018-02-23 | 上海策赢网络科技有限公司 | A kind of block chain and its generation method and equipment |
| CN107742210A (en) * | 2017-10-13 | 2018-02-27 | 布比（北京）网络技术有限公司 | Across the chain fund transfer system and method for a kind of different blocks interchain |
| CN107862216A (en) * | 2017-10-13 | 2018-03-30 | 布比（北京）网络技术有限公司 | Method for secret protection, device and the storage medium merchandised for anonymity across chain |
| CN107888562A (en) * | 2017-10-13 | 2018-04-06 | 布比（北京）网络技术有限公司 | Interconnect serobila architecture |
| CN108769264A (en) * | 2018-07-09 | 2018-11-06 | 中国联合网络通信集团有限公司 | A kind of block chain divides domain method |
| CN109493051A (en) * | 2018-11-21 | 2019-03-19 | 北京蓝石环球区块链科技有限公司 | The more subchain system architectures of main chain adduction row of account distribution and migration can dynamically be carried out |
-
2018
- 2018-11-21 CN CN201811392140.2A patent/CN109286685A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107045518A (en) * | 2016-10-18 | 2017-08-15 | 北京天德科技有限公司 | A kind of extension design method of block chain |
| CN107040384A (en) * | 2017-05-08 | 2017-08-11 | 飞天诚信科技股份有限公司 | A kind of authorizing information method and device based on block chain |
| CN107464112A (en) * | 2017-07-20 | 2017-12-12 | 捷德（中国）信息科技有限公司 | Exchange management method and system based on block chain |
| CN107464106A (en) * | 2017-07-25 | 2017-12-12 | 北京果仁宝科技有限公司 | The method and system merchandised between block chain main chain and side chain |
| CN107528886A (en) * | 2017-07-25 | 2017-12-29 | 中国科学院计算技术研究所 | Block chain the whole network method for splitting and system |
| CN107729471A (en) * | 2017-10-13 | 2018-02-23 | 上海策赢网络科技有限公司 | A kind of block chain and its generation method and equipment |
| CN107742210A (en) * | 2017-10-13 | 2018-02-27 | 布比（北京）网络技术有限公司 | Across the chain fund transfer system and method for a kind of different blocks interchain |
| CN107862216A (en) * | 2017-10-13 | 2018-03-30 | 布比（北京）网络技术有限公司 | Method for secret protection, device and the storage medium merchandised for anonymity across chain |
| CN107888562A (en) * | 2017-10-13 | 2018-04-06 | 布比（北京）网络技术有限公司 | Interconnect serobila architecture |
| CN108769264A (en) * | 2018-07-09 | 2018-11-06 | 中国联合网络通信集团有限公司 | A kind of block chain divides domain method |
| CN109493051A (en) * | 2018-11-21 | 2019-03-19 | 北京蓝石环球区块链科技有限公司 | The more subchain system architectures of main chain adduction row of account distribution and migration can dynamically be carried out |
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109829718A (en) * | 2019-01-30 | 2019-05-31 | 缀初网络技术(上海)有限公司 | A kind of block chain multi-layer framework and its operation method based on storage application scenarios |
| CN109829718B (en) * | 2019-01-30 | 2022-12-23 | 缀初网络技术(上海)有限公司 | Block chain multi-level framework based on storage application scene and operation method thereof |
| CN109559234A (en) * | 2019-01-31 | 2019-04-02 | 杭州复杂美科技有限公司 | A kind of storage method, equipment and the storage medium of block chain status data |
| CN109919615B (en) * | 2019-03-01 | 2021-04-02 | 上海分布信息科技有限公司 | Cross-chain data interaction method and system based on block chain |
| CN109919615A (en) * | 2019-03-01 | 2019-06-21 | 上海分布信息科技有限公司 | Across chain data interactive method and across chain data interaction system based on block chain |
| CN110083661A (en) * | 2019-04-30 | 2019-08-02 | 翟红鹰 | A kind of expansion method of block catenary system, block catenary system, terminal device and storage medium |
| CN110083661B (en) * | 2019-04-30 | 2022-12-06 | 山东特亿宝互联网科技有限公司 | Capacity expansion method of block chain system, terminal device and storage medium |
| CN110233802A (en) * | 2019-05-14 | 2019-09-13 | 天津大学 | A method of the block chain framework of the building more side chains of one main chain |
| CN110287196A (en) * | 2019-06-29 | 2019-09-27 | 杭州复杂美科技有限公司 | Block storage method, parallel chain transaction acquisition methods, equipment and storage medium |
| CN110417911A (en) * | 2019-08-08 | 2019-11-05 | 北京芯际科技有限公司 | A kind of duplex structure about block chain |
| CN111046437A (en) * | 2019-10-31 | 2020-04-21 | 中国科学院计算技术研究所 | Block chain parallel transaction processing method and system based on isomorphic multi-chain and terminal |
| CN111026511B (en) * | 2019-11-20 | 2023-08-08 | 中国科学院计算技术研究所 | Block chain parallel system and method based on transaction data partition-chain fusion |
| CN111026511A (en) * | 2019-11-20 | 2020-04-17 | 中国科学院计算技术研究所 | Block chain parallel system and method based on transaction data partition-inter-chain fusion |
| CN112907367A (en) * | 2019-12-03 | 2021-06-04 | 微观(天津)科技发展有限公司 | Cross-border trade data management method and device based on block chain and storage medium |
| CN111428275B (en) * | 2020-03-13 | 2021-03-26 | 华东师范大学 | Alliance chain-oriented service non-stop fragment increasing method |
| CN112261156A (en) * | 2020-12-21 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Method and system for submitting cross-fragment transaction, main chain node and source fragment node |
| CN113342888A (en) * | 2021-05-19 | 2021-09-03 | 中国科学院计算技术研究所 | Method and system for vertical extension of hyper account book Fabric |
| CN113342888B (en) * | 2021-05-19 | 2022-12-06 | 中国科学院计算技术研究所 | Method and system for longitudinally expanding super account book Fabric |
| CN113259456A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259460A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259237A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Transaction forwarding method between block chain networks |
| CN113259463A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and block chain system |
| CN113259453A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259237B (en) * | 2021-06-02 | 2021-09-24 | 支付宝(杭州)信息技术有限公司 | Transaction forwarding method between block chain networks |
| CN113259453B (en) * | 2021-06-02 | 2021-10-15 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113259463B (en) * | 2021-06-02 | 2021-11-02 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and block chain system |
| CN113922971A (en) * | 2021-06-02 | 2022-01-11 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113923228A (en) * | 2021-06-02 | 2022-01-11 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN114095507A (en) * | 2021-06-02 | 2022-02-25 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and block chain system |
| CN113259454A (en) * | 2021-06-02 | 2021-08-13 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113067772B (en) * | 2021-06-02 | 2021-07-30 | 支付宝(杭州)信息技术有限公司 | Transaction forwarding method between block chain networks |
| CN113067838A (en) * | 2021-06-02 | 2021-07-02 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN113067772A (en) * | 2021-06-02 | 2021-07-02 | 支付宝(杭州)信息技术有限公司 | Transaction forwarding method between block chain networks |
| CN113922971B (en) * | 2021-06-02 | 2023-10-27 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and device |
| CN114095507B (en) * | 2021-06-02 | 2024-04-02 | 支付宝(杭州)信息技术有限公司 | Cross-chain interaction method and block chain system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109286685A (en) | The system architecture of the more subchains of main chain adduction row of subchain can be expanded | |
| CN109471744A (en) | The more subchain system architectures of main chain adduction row based on block chain | |
| CN109493050A (en) | Transfer process based on the more subchains of block chain main chain adduction row | |
| CN109472572A (en) | Contract deployment and transaction based on the more subchains of block chain main chain adduction row | |
| CN109493051A (en) | The more subchain system architectures of main chain adduction row of account distribution and migration can dynamically be carried out | |
| US20240064014A9 (en) | Methods and systems implemented in a network architecture with nodes capable of performing message-based transactions | |
| CN107301536B (en) | Resource transfers method and device | |
| CN109493052A (en) | Across catenary system contract and its transfer process based on the more subchains of main chain adduction row | |
| CN109522362A (en) | Incomplete markets synchronous method, system and equipment based on block chain data | |
| CN102685203B (en) | The method and apparatus of transmitting data resources | |
| CN109345387A (en) | Across the chain method of commerce of block chain, across chain communication device and storage medium | |
| CN111598566A (en) | Network payment system based on mixed cross-chain | |
| CN109118214A (en) | The method and apparatus for running intelligent contract | |
| CN108650182A (en) | Network communication method, system, device, equipment and storage medium | |
| CN113347164B (en) | Block chain-based distributed consensus system, method, device and storage medium | |
| CN105337923B (en) | Data distributing method and system and data sending device and data sink | |
| CN106453625B (en) | Information synchronization method and high availability cluster system | |
| CN112119620B (en) | System and method for propagating data packets in a network of nodes | |
| CN109493072A (en) | A method of the privacy contract protection based on alliance's block chain | |
| CN110555079B (en) | Data processing method, device, equipment and storage medium | |
| CN110298657A (en) | A kind of block chain common recognition method, relevant apparatus and system | |
| CN110347689A (en) | Date storage method, equipment and computer readable storage medium | |
| Tsai et al. | Lessons learned from developing permissioned blockchains | |
| CN113409047B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN110380898B (en) | Hyperhedger Fabric-based multi-operator edge service chain arrangement strategy |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190129 |
|
| WD01 | Invention patent application deemed withdrawn after publication |