CN110808838A - Alliance chain-oriented fragmentation method - Google Patents
Alliance chain-oriented fragmentation method Download PDFInfo
- Publication number
- CN110808838A CN110808838A CN201911017425.2A CN201911017425A CN110808838A CN 110808838 A CN110808838 A CN 110808838A CN 201911017425 A CN201911017425 A CN 201911017425A CN 110808838 A CN110808838 A CN 110808838A
- Authority
- CN
- China
- Prior art keywords
- fragment
- fragmentation
- node
- fragments
- transaction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- 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
-
- 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
- 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/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- 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
- H04L9/3239—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 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
-
- 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
Abstract
The invention discloses a federation chain-oriented fragmentation method which comprises three parts of fragmentation division, fragmentation reorganization and cross-fragmentation transaction processing. In the process of fragment division, the nodes in the alliance chain are divided into an execution fragment, a verification fragment and a storage fragment according to the logic role, and the overall throughput of the alliance chain is improved by decoupling the execution and the verification. And only when the execution fragment and the verification fragment are not safe, the system is not safe as a whole. In the process of fragment reorganization, a large amount of data movement is avoided in the mode of dynamic fragment splitting during fragment reorganization, and the problem that service is unavailable in the process of fragment reorganization is solved. In the process of cross-fragment transaction, the cross-fragment transaction atomicity and safety are ensured through a Byzantine fault-tolerant cross-fragment submission protocol. The invention can be applied to a alliance chain, and improves the throughput rate and the expandability on the premise of ensuring the overall safety of the system after fragmentation.
Description
Technical Field
The invention belongs to the technical field of block chains, particularly relates to a fragmentation (sharing) technology, and particularly relates to a fragmentation method facing a alliance chain.
Background
The block chain is a distributed account book which is maintained by multiple parties facing to non-credible environments, and has the characteristics of decentralization, no tampering, traceability and the like. However, as a decentralized Byzantine fault-tolerant distributed system, the block chain system has poor expandability in terms of calculation and storage, severely restricts the system throughput, and is difficult to meet the high throughput requirement of enterprise-level applications.
The fragmentation is based on the concept of divide-and-conquer, and is a typical method for improving the scalability of system computation and storage in the traditional distributed database. The method decomposes the calculation and storage tasks into a plurality of relatively independent units, and distributes the units to different servers, thereby improving the concurrent processing capacity and ensuring that the overall calculation and storage of the system are expandable.
By the slicing technology, the overall performance of the block chain can be improved. The blockchain fragmentation technology is subdivided into three levels of state fragmentation, transaction fragmentation and network fragmentation based on three dimensions of storage, calculation and transmission. Network fragmentation and transaction fragmentation are relatively easy, while state fragmentation is the most challenging. At present, the academic community provides some fragmentation schemes for an unlicensed public chain, and for a licensed alliance chain, one scheme is that the Byzantine fault tolerance rate of a single fragment is increased to 50% by using a trusted hardware SGX, and the fragment safety can be guaranteed under the condition that the fragment size is small. But there is no federation chain-oriented, universal fragmentation scheme that does not rely on tee (trusted Execution environment).
Therefore, in order to improve the overall performance of the alliance chain, it is necessary to provide a safe, reliable and hardware-independent general fragmentation technology facing the alliance chain.
Disclosure of Invention
The invention aims to improve the throughput rate and the expandability of a alliance chain, and provides a alliance chain-oriented fragmentation method aiming at the defects of the prior art, which comprises three parts of fragmentation division, fragmentation reorganization and cross-fragmentation transaction processing. In the process of fragment division, the nodes in the alliance chain are divided into an execution fragment, a verification fragment and a storage fragment according to the logic role, and the overall throughput of the alliance chain is improved by decoupling the execution and the verification. And only when the execution fragment and the verification fragment are not safe, the system is not safe as a whole. In the process of fragment reorganization, a large amount of data movement is avoided in the mode of dynamic fragment splitting during fragment reorganization, and the problem that service is unavailable in the process of fragment reorganization is solved. In the process of cross-fragment transaction, the cross-fragment transaction atomicity and safety are ensured through a Byzantine fault-tolerant cross-fragment submission protocol. The invention can be applied to a alliance chain, and improves the throughput rate and the expandability on the premise of ensuring the overall safety of the system after fragmentation.
The specific technical scheme for realizing the purpose of the invention is as follows:
a fragmentation method facing to a alliance chain comprises the following specific steps:
step 1: on the basis of having a main chain, dividing nodes in a alliance chain into different fragments according to logic roles;
the method specifically comprises the following steps:
step A1: the existing main chain in the alliance chain completes the evidence storage and audit and the coordination work of all cross-piece transactions;
step A2: nodes in a federation chain are logically divided into three classes: the method comprises the steps that an execution node, a verification node and a light storage node are connected;
step A3: a node may assume a variety of logical roles as described in step a 2;
step A4: dividing the nodes into K corresponding fragments according to the logic roles borne by the nodes;
step A5: each fragment independently processes the transaction in the alliance chain in parallel;
step 2: determining the tasks born by different fragments and the interaction logic among the different fragments; the method specifically comprises the following steps:
step B1: dividing the whole process of transaction processing into three stages of consensus, verification and storage;
step B2: the method comprises the steps of executing a sharding responsible consensus stage, verifying a sharding responsible verification stage and storing a sharding responsible storage stage;
step B3: the execution fragments and the verification fragments are respectively interacted with the storage fragments;
step B4: the execution and verification stages are executed concurrently through the pipeline;
the step B2 specifically includes:
step B21: the execution fragments are responsible for carrying out consensus and then packaging the blocks, carrying out transactions in the blocks in parallel, and storing a scheduling log which is provided with a read-write set and represented by a transaction dependency graph into the storage fragments;
step B22: the verification fragment reads the scheduling log from the memory fragment, and quickly plays back the execution and verification execution results;
step B23: storing the scheduling log and the verified transaction by the memory slice;
and step 3: when a new node is added into the fragments, the fragments are reorganized in a splitting mode; the method specifically comprises the following steps:
step C1: when a new node is added, the execution fragmentation and the verification fragmentation generate a new fragmentation by regrouping the nodes in the fragmentation;
step C2: when a new node is added, the storage fragment generates a new fragment in a splitting mode; the method specifically comprises the following steps:
step C21: assuming that the lower bound of the number of nodes in each slice is m and the upper bound is 2 m;
step C22: if the new node adds a certain fragment and the number of the nodes of the fragment does not break through the upper bound, the new node becomes the full node of the added fragment;
step C23: if the number of the fragmentation nodes exceeds the upper bound due to the addition of the new node, splitting the current fragmentation into two fragments with equal size, so that the scale of each fragment is between m and 2 m;
step C24: when a node is added, a transaction for identifying the node addition is sent to the fragment, and when the corresponding transaction is executed, a new node is added to the fragment;
and 4, step 4: migrating corresponding data based on a fragmentation splitting mode; the method specifically comprises the following steps:
step D1: all nodes in the original fragment generate a distributed random number, and the random number is used as a seed to re-fragment all nodes;
step D2: after re-fragmentation, the original node temporarily does not delete the fragmented data which does not belong to the original node, provides the service of receiving transaction and query for the outside, but does not recognize the block;
step D3: performing mutual recognition inside each of the two split sub-fragments, and broadcasting a mutual recognition result to the whole network;
step D4: after confirming that the sub-fragments are identified, the original node deletes the fragment data which does not belong to the original node, and re-routes the transaction received during the splitting period to a new sub-fragment;
step D5: the new sub-fragment starts to recognize the block;
and 5: processing a cross-slice transaction through an atomicity submission protocol; the method specifically comprises the following steps:
step E1: the main chain of the alliance chain undertakes a coordinator submitted in two stages, and the block is subjected to legality checking, consensus, distribution, submission and evidence storage;
step E2: after the main chain consensus is completed, the transaction in the block is sent to the corresponding fragment for execution and verification; the method specifically comprises the following steps:
step E21: the main chain sends a prepare message (prepare) to the fragments involved in the cross-fragment transaction;
step E22: replying a main chain agreement (agree) message after the intra-chip node agrees with the current block, and locking the corresponding data item;
step E23: after the main chain collects the agreement (agree) information of each fragment, the main chain initiates consensus again to carry out consensus on the submitted cross-fragment transaction information;
step E24: after consensus, the main chain sends a commit (commit) message to the related shards, stores shard commit updates, and unlocks the locked related data items in step E21;
step E25: if a certain fragment fails to execute the sub-transaction, when the main chain receives a disagreement (disagrece) message of the fragment, a rollback (rollback) message is sent to the related fragment again, all the fragments related to the transaction in the block cancel related data modification, the verification of the current block is stopped, and the main chain stopping (abort) message is replied after the cancel operation is completed.
The beneficial effects of the invention include:
the task is split based on a main chain and a plurality of sub-chain structures formed by the fragments, and the nodes are divided into the execution, verification and storage fragments according to the logic roles, so that the fragments can independently process respective transactions in parallel.
Under the multi-segment framework, the number of malicious nodes in each segment is ensured not to exceed the upper limit of the consensus algorithm by randomly selecting the segment nodes. Only when the execution fragment and the verification fragment are not safe, the whole system is not safe, and the fragment safety in the alliance chain is improved. And by decoupling execution and verification, the execution and verification can be completely pipelined and parallel, and the system throughput rate is further improved. And executing the fragment and concurrently executing all transactions in the current block, transmitting a concurrent scheduling log to a verification node, and executing and verifying the transactions by efficiently playing back the concurrent scheduling log by the verification fragment, and triggering audit if the verification fails, thereby further ensuring the safety of the fragment.
The dynamically split fragmentation reorganization mode solves the problems of state change and data migration when a new node is added into the fragmentation, ensures smooth transition of data access service in the fragmentation reorganization process, and overcomes the problem that data service is unavailable in a short time.
The backbone-coordinated cross-chip transaction guarantees atomicity and safety of the cross-chip transaction through a two-phase commit protocol.
Drawings
FIG. 1 is a schematic diagram of a federation chain-oriented backbone-and multi-slice-based system architecture to which the present invention relates;
FIG. 2 is a schematic flow chart of the fragmentation splitting process when the fragmentation reorganization is performed, and the newly added node does not cause the number of the nodes of the fragmentation to break through the upper bound;
FIG. 3 is a schematic flow chart of the fragmentation splitting process when a new node is added to cause the number of nodes of the fragmentation to break through the upper bound when the fragmentation is reorganized;
FIG. 4 is a schematic flow chart of the splitting embodiment of the present invention;
FIG. 5 is a schematic flow chart of the present invention for a main chain to coordinate cross-slice transactions and for successful submission of the cross-slice transactions;
FIG. 6 is a flow chart illustrating the main chain coordinating the cross-chip transaction and the failure and abort of the cross-chip transaction according to the present invention.
Detailed Description
The present invention will be described in further detail with reference to the following specific examples and the accompanying drawings. The procedures, conditions, experimental methods and the like for carrying out the present invention are general knowledge and common general knowledge in the art except for the contents specifically mentioned below, and the present invention is not particularly limited.
Examples
The embodiment is a fragmentation method implemented in a federation chain system.
Fig. 1 is a system architecture proposed by the present invention. The figure depicts the interaction between the backbone and the fragments. The main chain mainly completes the coordination work of evidence storage, audit and all cross-chip transactions, and the sub-chains (namely the chips) independently process the respective transactions in parallel. And in fig. 1, the nodes belonging to the child chain are logically divided into three classes including an execution node, an authentication node and an online light storage node, and the execution node, the authentication node and the online light storage node are respectively and independently divided. Wherein the executing node and the verifying node are stateless and interact through the online light storage node. And the execution node undertakes the tasks of execution and consensus, executes the transactions in the block in parallel, and writes the concurrent execution scheduling log with the certificate after the consensus signature into the online light node for storage. And the verification node reads the scheduling log from the online light storage node for quick playback and verifies, if the verification is passed, the final result is written back to the online light storage node, and if the verification is not passed, audit is triggered.
It should be noted that the execution fragment and the verification fragment need to be identified independently, and since data reading can be verified by the signature certificate written before, the identification of the storage fragments can be completed asynchronously, and after the asynchronous identification of the online light storage node is finished, the consistency check point is stored in the main chain storage certificate, which is convenient for data reading of upper-layer application. And once the verification of the verification fragment passes, the final state data is confirmed, and the read-write set on the online storage fragment can be deleted.
The data passing the verification in the light storage nodes are asynchronously written into the persistent storage engine at the bottommost layer, the persistent storage engine adopts erasure codes to carry out coding and fragmentation storage, and each single node can logically recover all data of the whole chain, so that the scalable storage engine is a Byzantine fault-tolerant scalable storage engine. Logically, the persistent storage engine stores two types of block chain data, one type is a sub-chain maintained by each fragment, and each sub-chain data is independent; another category is backbone data, which includes administrative information such as configuration, audit and evidence storage.
The fragmentation reorganization adopts a scheme of splitting the storage fragments to generate new fragments. The lower bound of the number of nodes in each slice is m and the upper bound is 2 m. The value of m in fig. 2 and 3 is 2.
Fig. 2 illustrates that when a new node adds a certain fragment and the number of nodes of the fragment does not exceed the upper bound, the new node becomes a full node of the added fragment without any operation.
Fig. 3 illustrates that when a new node adds a certain fragment, resulting in the number of nodes of the fragment exceeding the upper bound, the current fragment is split into two equally large fragments, such that the size of each fragment is between m and 2m, and the size of each fragment after splitting in fig. 3 is between 2 and 4 nodes.
It should be noted that each node joining needs to send a transaction identifying the node joining to the segment, and when the corresponding transaction is executed, a new node is added to the segment. The block height is similar to a logic clock, and each node is added with a new node at the same block height.
The specific splitting process includes steps S301-S304 as shown in fig. 4:
s301, all nodes in the original fragment generate a distributed random number, and the random number is used as a seed to re-fragment all nodes.
S302, the split state is also fragmented, in order to ensure the safety of the state fragmentation, the original node after the fragmentation does not delete the fragmented data which does not belong to the original node, and still provides the service of receiving transaction and query externally, but does not recognize the block.
And S303, performing mutual recognition inside each of the two sub-fragments, and broadcasting a mutual recognition result to the whole network to inform that the sub-fragments confirm the state of each node and can work independently.
S304, when the sub-fragment confirms that the other sub-fragments are identified together, the original node deletes the data which is not in the original fragment and belongs to the current sub-fragment, and then routes the transaction received during the splitting period to the new sub-fragment, and the new sub-fragment can start to identify the block together.
It should be noted that S302 may ensure a smooth transition of the data access service during the re-fragmentation process, so as to overcome the problem that the data access service is not available for a short time.
Fig. 5 describes a process of successful submission of a cross-slice transaction, in which a main chain sends a prepare (prepare) message to slices involved in the cross-slice transaction, nodes in the slices reply to the main chain agree (agree) message after agreeing with a current block, lock corresponding data items, after the main chain has agreed the agree (agree) messages of the slices, initiate consensus again, agree the submitted cross-slice transaction message, after the consensus, the main chain sends a submit (commit) message to the involved slices, store slice submission updates, and unlock the locked related data items.
Fig. 6 describes a process of suspending a cross-slice transaction failure, in which a main chain sends a prepare (prepare) message to slices involved in the cross-slice transaction, at this time, if a certain slice fails to execute a sub-transaction, when the main chain receives a disagreement (disagrere) message of the slice, the main chain sends a rollback (rollback) message to the involved slice again, all slices involved in the transaction in the block cancel related data modification, the authentication of the current block is suspended, and after the cancel operation is completed, the main chain is replied to suspend (abort) the message
It should be noted that the main chain is used to bear the coordinator of the two-phase commit, and the node failure problem in the conventional two-phase commit does not occur in the architecture of the present invention, that is, neither the coordinator nor other participants are down or broken, because each fragment is secured by the consensus algorithm. Cross-chip transactions require validity checking, consensus, distribution, submission and evidence preservation through the backbone. After the main chain consensus is completed, the transaction related to the cross-slice is sent to the corresponding slice for execution and verification.
The protection of the present invention is not limited to the above embodiments. Variations and advantages that may occur to those skilled in the art may be incorporated into the invention without departing from the spirit and scope of the inventive concept, and the scope of the appended claims is intended to be protected.
Claims (9)
1. A fragmentation method facing alliance chain is characterized by comprising the following specific steps:
step 1: on the basis of having a main chain, dividing nodes in a alliance chain into different fragments according to logic roles;
step 2: determining the tasks born by different fragments and the interaction logic among the different fragments;
and step 3: when a new node is added into the fragments, the fragments are reorganized in a splitting mode;
and 4, step 4: migrating corresponding data based on a fragmentation splitting mode;
and 5: cross-slice transactions are processed through an atomicity submission protocol.
2. The federation chain-oriented fragmentation method of claim 1, wherein the step 1 specifically comprises:
step A1: the existing main chain in the alliance chain completes the evidence storage and audit and the coordination work of all cross-piece transactions;
step A2: nodes in a federation chain are logically divided into three classes: the method comprises the steps that an execution node, a verification node and a light storage node are connected;
step A3: a node may assume a variety of logical roles as described in step a 2;
step A4: dividing the nodes into K corresponding fragments according to the logic roles borne by the nodes;
step A5: each fragment independently processes transactions in the federation chain in parallel.
3. The federation chain-oriented fragmentation method of claim 1, wherein the step 2 specifically comprises:
step B1: dividing the whole process of transaction processing into three stages of consensus, verification and storage;
step B2: the method comprises the steps of executing a sharding responsible consensus stage, verifying a sharding responsible verification stage and storing a sharding responsible storage stage;
step B3: the execution fragments and the verification fragments are respectively interacted with the storage fragments;
step B4: the execution and validation stages are executed concurrently through the pipeline.
4. The federation chain-oriented sharding method of claim 2, wherein the step B2 specifically includes:
step B21: the execution fragments are responsible for carrying out consensus and then packaging the blocks, carrying out transactions in the blocks in parallel, and storing a scheduling log which is provided with a read-write set and represented by a transaction dependency graph into the storage fragments;
step B22: the verification fragment reads the scheduling log from the memory fragment, and quickly plays back the execution and verification execution results;
step B23: the memory slice stores the dispatch log and the verified transaction.
5. The federation chain-oriented fragmentation method of claim 1, wherein the step 3 specifically comprises:
step C1: when a new node is added, the execution fragmentation and the verification fragmentation generate a new fragmentation by regrouping the nodes in the fragmentation;
step C2: when a new node is added, the storage fragment generates a new fragment in a splitting mode.
6. The federation chain-oriented sharding method of claim 5, wherein the step C2 specifically includes:
step C21: assuming that the lower bound of the number of nodes in each slice is m and the upper bound is 2 m;
step C22: if the new node adds a certain fragment and the number of the nodes of the fragment does not break through the upper bound, the new node becomes the full node of the added fragment;
step C23: if the number of the fragmentation nodes exceeds the upper bound due to the addition of the new node, splitting the current fragmentation into two fragments with equal size, so that the scale of each fragment is between m and 2 m;
step C24: when a node is added, a transaction for identifying the node addition is sent to the fragment, and when the corresponding transaction is executed, a new node is added to the fragment.
7. The federation chain-oriented fragmentation method of claim 1, wherein the step 4 specifically comprises:
step D1: all nodes in the original fragment generate a distributed random number, and the random number is used as a seed to re-fragment all nodes;
step D2: after re-fragmentation, the original node temporarily does not delete the fragmented data which does not belong to the original node, provides the service of receiving transaction and query for the outside, but does not recognize the block;
step D3: performing mutual recognition inside each of the two split sub-fragments, and broadcasting a mutual recognition result to the whole network;
step D4: after confirming that the sub-fragments are identified, the original node deletes the fragment data which does not belong to the original node, and re-routes the transaction received during the splitting period to a new sub-fragment;
step D5: the new sub-slice starts to recognize the block.
8. The federation chain-oriented fragmentation method of claim 1, wherein the step 5 specifically comprises:
step E1: the main chain of the alliance chain undertakes a coordinator submitted in two stages, and the block is subjected to legality checking, consensus, distribution, submission and evidence storage;
step E2: after the main chain consensus is completed, the transaction in the block is sent to the corresponding fragment for execution and verification.
9. The federation chain-oriented sharding method of claim 8, wherein the step E2 specifically includes:
step E21: the main chain sends a preparation message to the fragments involved in the cross-fragment transaction;
step E22: after the intra-chip node agrees with the current block, replying a main chain agreement message and locking a corresponding data item;
step E23: after the main chain collects the agreement information of each fragment, the main chain initiates consensus again to carry out consensus on the submitted cross-fragment transaction information;
step E24: after consensus is passed, the main chain sends a commit message to the related fragments, stores the fragment commit updates, and unlocks the locked related data items in step E21;
step E25: if a certain fragment fails to execute the sub-transaction, when the main chain receives a disagreement message of the fragment, a rollback message is sent to the related fragment again, all the fragments related to the transaction in the block cancel the related data modification, the verification of the current block is stopped, and the main chain stopping message is replied after the canceling operation is completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911017425.2A CN110808838B (en) | 2019-10-24 | 2019-10-24 | Alliance chain-oriented fragmentation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911017425.2A CN110808838B (en) | 2019-10-24 | 2019-10-24 | Alliance chain-oriented fragmentation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110808838A true CN110808838A (en) | 2020-02-18 |
| CN110808838B CN110808838B (en) | 2020-09-22 |
Family
ID=69489131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911017425.2A Active CN110808838B (en) | 2019-10-24 | 2019-10-24 | Alliance chain-oriented fragmentation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110808838B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111324613A (en) * | 2020-03-13 | 2020-06-23 | 华东师范大学 | Intra-fragment data organization and management method for alliance chain |
| CN111563740A (en) * | 2020-04-26 | 2020-08-21 | 中国工商银行股份有限公司 | Transaction processing method and system of alliance chain |
| CN111639090A (en) * | 2020-06-03 | 2020-09-08 | 山东汇贸电子口岸有限公司 | Data consistency control method and system in data extraction process |
| CN111680050A (en) * | 2020-05-25 | 2020-09-18 | 杭州趣链科技有限公司 | Fragmentation processing method, device and storage medium for alliance link data |
| CN111769946A (en) * | 2020-05-08 | 2020-10-13 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Large-scale node capacity expansion method for alliance chain |
| CN111858771A (en) * | 2020-07-30 | 2020-10-30 | 杭州复杂美科技有限公司 | Distributed data storage method, device and storage medium |
| CN112261160A (en) * | 2020-12-21 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Method and system for quitting cross-slice transaction in block chain system containing slices |
| CN112261162A (en) * | 2020-12-21 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Method and system for executing cross-slice transaction, main chain node and target slicing node |
| CN112396422A (en) * | 2020-12-21 | 2021-02-23 | 支付宝(杭州)信息技术有限公司 | Method and system for submitting cross-slice transaction, main chain node and target slicing node |
| CN111428275B (en) * | 2020-03-13 | 2021-03-26 | 华东师范大学 | Alliance chain-oriented service non-stop fragment increasing method |
| CN113064764A (en) * | 2021-04-19 | 2021-07-02 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for performing blocks in a blockchain system |
| CN113205417A (en) * | 2021-04-27 | 2021-08-03 | 华东师范大学 | Alliance chain oriented transaction parallel processing method and system |
| CN113362067A (en) * | 2021-08-10 | 2021-09-07 | 国网区块链科技(北京)有限公司 | Asynchronous consensus-based electric power transaction matching method and system |
| CN113746637A (en) * | 2021-09-03 | 2021-12-03 | 华东师范大学 | SEGBFT consensus algorithm applicable to alliance chain and having high expandability |
| CN113923093A (en) * | 2021-10-29 | 2022-01-11 | 博雅正链(北京)科技有限公司 | Novel Byzantine fault-tolerant consensus method based on trusted execution environment |
| CN114298713A (en) * | 2022-03-03 | 2022-04-08 | 浙商银行股份有限公司 | Alliance chain fragmentation method and device and storage medium |
| CN114520812A (en) * | 2021-08-16 | 2022-05-20 | 西安电子科技大学 | Storage rotation method, system, equipment and application for block chain fragmentation system |
| CN115002106A (en) * | 2022-04-22 | 2022-09-02 | 中国农业银行股份有限公司 | Block chain verification method, device, equipment and medium |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106936589A (en) * | 2017-04-21 | 2017-07-07 | 杭州秘猿科技有限公司 | A kind of acentric the license parallel sharding method of chain and method of commerce |
| CN107085810A (en) * | 2017-04-19 | 2017-08-22 | 朱皞罡 | Across the chain operating method and block chain management system of a kind of block chain |
| CN107528886A (en) * | 2017-07-25 | 2017-12-29 | 中国科学院计算技术研究所 | Block chain the whole network method for splitting and system |
| CN108847925A (en) * | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| CN108846749A (en) * | 2018-05-31 | 2018-11-20 | 杭州秘猿科技有限公司 | A kind of sliced transaction execution system and method based on block chain technology |
| CN108900321A (en) * | 2018-06-06 | 2018-11-27 | 广州链块科技有限公司 | The method that a kind of block chain by stages carries out real-time atom transaction |
| CN109086139A (en) * | 2018-08-15 | 2018-12-25 | 昧来网络科技（上海）有限公司 | Dynamic Program Slicing method, equipment and computer storage medium |
| CN109191287A (en) * | 2018-06-27 | 2019-01-11 | 浙江超脑时空科技有限公司 | A kind of sharding method, device and the electronic equipment of block chain intelligence contract |
| CN109327512A (en) * | 2018-09-19 | 2019-02-12 | 广东微链科技有限公司 | Game data subregion storage method based on block chain hash addressing and re-encryption |
| CN109510876A (en) * | 2018-12-20 | 2019-03-22 | 弗洛格（武汉）信息科技有限公司 | A kind of alliance's chain sharding method and corresponding alliance's chain based on PBFT |
| CN109949160A (en) * | 2019-03-27 | 2019-06-28 | 上海优扬新媒信息技术有限公司 | A kind of sharding method and device of block chain |
| US20190258971A1 (en) * | 2018-02-20 | 2019-08-22 | Tyson York Winarski | Blockchain project management with process feedback control |
-
2019
- 2019-10-24 CN CN201911017425.2A patent/CN110808838B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107085810A (en) * | 2017-04-19 | 2017-08-22 | 朱皞罡 | Across the chain operating method and block chain management system of a kind of block chain |
| CN106936589A (en) * | 2017-04-21 | 2017-07-07 | 杭州秘猿科技有限公司 | A kind of acentric the license parallel sharding method of chain and method of commerce |
| CN107528886A (en) * | 2017-07-25 | 2017-12-29 | 中国科学院计算技术研究所 | Block chain the whole network method for splitting and system |
| US20190258971A1 (en) * | 2018-02-20 | 2019-08-22 | Tyson York Winarski | Blockchain project management with process feedback control |
| CN108846749A (en) * | 2018-05-31 | 2018-11-20 | 杭州秘猿科技有限公司 | A kind of sliced transaction execution system and method based on block chain technology |
| CN108900321A (en) * | 2018-06-06 | 2018-11-27 | 广州链块科技有限公司 | The method that a kind of block chain by stages carries out real-time atom transaction |
| CN108847925A (en) * | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| CN109191287A (en) * | 2018-06-27 | 2019-01-11 | 浙江超脑时空科技有限公司 | A kind of sharding method, device and the electronic equipment of block chain intelligence contract |
| CN109086139A (en) * | 2018-08-15 | 2018-12-25 | 昧来网络科技（上海）有限公司 | Dynamic Program Slicing method, equipment and computer storage medium |
| CN109327512A (en) * | 2018-09-19 | 2019-02-12 | 广东微链科技有限公司 | Game data subregion storage method based on block chain hash addressing and re-encryption |
| CN109510876A (en) * | 2018-12-20 | 2019-03-22 | 弗洛格（武汉）信息科技有限公司 | A kind of alliance's chain sharding method and corresponding alliance's chain based on PBFT |
| CN109949160A (en) * | 2019-03-27 | 2019-06-28 | 上海优扬新媒信息技术有限公司 | A kind of sharding method and device of block chain |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111428275B (en) * | 2020-03-13 | 2021-03-26 | 华东师范大学 | Alliance chain-oriented service non-stop fragment increasing method |
| CN111324613A (en) * | 2020-03-13 | 2020-06-23 | 华东师范大学 | Intra-fragment data organization and management method for alliance chain |
| CN111324613B (en) * | 2020-03-13 | 2021-03-26 | 华东师范大学 | Intra-fragment data organization and management method for alliance chain |
| CN111563740A (en) * | 2020-04-26 | 2020-08-21 | 中国工商银行股份有限公司 | Transaction processing method and system of alliance chain |
| CN111769946A (en) * | 2020-05-08 | 2020-10-13 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Large-scale node capacity expansion method for alliance chain |
| CN111769946B (en) * | 2020-05-08 | 2022-08-19 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Large-scale node capacity expansion method for alliance chain |
| CN111680050A (en) * | 2020-05-25 | 2020-09-18 | 杭州趣链科技有限公司 | Fragmentation processing method, device and storage medium for alliance link data |
| CN111680050B (en) * | 2020-05-25 | 2023-09-26 | 杭州趣链科技有限公司 | Fragment processing method, device and storage medium for alliance chain data |
| CN111639090A (en) * | 2020-06-03 | 2020-09-08 | 山东汇贸电子口岸有限公司 | Data consistency control method and system in data extraction process |
| CN111858771A (en) * | 2020-07-30 | 2020-10-30 | 杭州复杂美科技有限公司 | Distributed data storage method, device and storage medium |
| CN112396422A (en) * | 2020-12-21 | 2021-02-23 | 支付宝(杭州)信息技术有限公司 | Method and system for submitting cross-slice transaction, main chain node and target slicing node |
| CN112261162B (en) * | 2020-12-21 | 2021-03-26 | 支付宝(杭州)信息技术有限公司 | Method and system for executing cross-slice transaction, main chain node and target slicing node |
| CN112396422B (en) * | 2020-12-21 | 2021-04-06 | 支付宝(杭州)信息技术有限公司 | Method and system for submitting cross-slice transaction, main chain node and target slicing node |
| CN112261162A (en) * | 2020-12-21 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Method and system for executing cross-slice transaction, main chain node and target slicing node |
| CN112261160A (en) * | 2020-12-21 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Method and system for quitting cross-slice transaction in block chain system containing slices |
| CN113064764A (en) * | 2021-04-19 | 2021-07-02 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for performing blocks in a blockchain system |
| CN113064764B (en) * | 2021-04-19 | 2023-10-27 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for executing blocks in a blockchain system |
| CN113205417A (en) * | 2021-04-27 | 2021-08-03 | 华东师范大学 | Alliance chain oriented transaction parallel processing method and system |
| CN113205417B (en) * | 2021-04-27 | 2022-10-25 | 华东师范大学 | Alliance chain oriented transaction parallel processing method and system |
| CN113362067A (en) * | 2021-08-10 | 2021-09-07 | 国网区块链科技(北京)有限公司 | Asynchronous consensus-based electric power transaction matching method and system |
| CN113362067B (en) * | 2021-08-10 | 2022-03-11 | 国网区块链科技(北京)有限公司 | Asynchronous consensus-based electric power transaction matching method and system |
| CN114520812A (en) * | 2021-08-16 | 2022-05-20 | 西安电子科技大学 | Storage rotation method, system, equipment and application for block chain fragmentation system |
| CN114520812B (en) * | 2021-08-16 | 2023-02-14 | 西安电子科技大学 | Memory rotation method, system, equipment and application for block chain fragmentation system |
| CN113746637A (en) * | 2021-09-03 | 2021-12-03 | 华东师范大学 | SEGBFT consensus algorithm applicable to alliance chain and having high expandability |
| CN113746637B (en) * | 2021-09-03 | 2024-02-27 | 华东师范大学 | SEGBFT consensus algorithm applicable to alliance chains and high in expandability |
| CN113923093A (en) * | 2021-10-29 | 2022-01-11 | 博雅正链(北京)科技有限公司 | Novel Byzantine fault-tolerant consensus method based on trusted execution environment |
| CN113923093B (en) * | 2021-10-29 | 2024-02-06 | 博雅正链(北京)科技有限公司 | Novel Bayesian-preemption fault-tolerant consensus method based on trusted execution environment |
| CN114298713B (en) * | 2022-03-03 | 2022-07-08 | 浙商银行股份有限公司 | Alliance chain fragmentation method and device and storage medium |
| CN114298713A (en) * | 2022-03-03 | 2022-04-08 | 浙商银行股份有限公司 | Alliance chain fragmentation method and device and storage medium |
| CN115002106A (en) * | 2022-04-22 | 2022-09-02 | 中国农业银行股份有限公司 | Block chain verification method, device, equipment and medium |
| CN115002106B (en) * | 2022-04-22 | 2024-04-12 | 中国农业银行股份有限公司 | Block chain verification method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110808838B (en) | 2020-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110808838B (en) | Alliance chain-oriented fragmentation method | |
| JP7114629B2 (en) | System and method for parallel verification of blockchain transactions | |
| CN109493050B (en) | Transfer method based on block chain main chain and parallel multiple sub-chains | |
| CN110990408A (en) | Block chain-based business information cooperation method, business system and alliance chain | |
| EP3848844A1 (en) | Method and apparatus for data synchronization of multiple nodes, and computer device | |
| Zhang et al. | Skychain: A deep reinforcement learning-empowered dynamic blockchain sharding system | |
| CN111311414A (en) | Block chain multi-party consensus method based on consistent hash algorithm | |
| CN109493052B (en) | Cross-chain contract system based on main chain and parallel multiple sub-chains | |
| EP4332870A1 (en) | Transaction data processing method and apparatus, computer device and storage medium | |
| CN112039860B (en) | Method and device for realizing joint consensus fragmentation in alliance chain | |
| CN112862490B (en) | Output consensus method under asynchronous network | |
| CN111199481A (en) | Distributed transaction network based on asynchronous directed acyclic graph | |
| CN110287205A (en) | A kind of across the fragment transaction data processing method of block chain and device | |
| CN113064764B (en) | Method and apparatus for executing blocks in a blockchain system | |
| CN111683043A (en) | Intelligent contract concurrent execution method facing alliance chain and based on trusted execution environment | |
| Verdian et al. | Quant overledger whitepaper | |
| Innerbichler et al. | Federated byzantine agreement to ensure trustworthiness of digital manufacturing platforms | |
| WO2023045617A1 (en) | Transaction data processing method and apparatus, device and medium | |
| CN113837758A (en) | Consensus method and device for block chain system | |
| CN110766410B (en) | Trusted cross-chain event construction and verification method and device based on Merker tree | |
| CN114298713A (en) | Alliance chain fragmentation method and device and storage medium | |
| CN113037824B (en) | Cloud computing-oriented high-performance block chain construction method | |
| CN113807851B (en) | Block chain expandability realization method and system based on slicing | |
| CN116009940A (en) | Method, device, computer equipment and medium for changing consensus cluster | |
| CN110689435B (en) | Data processing method and data processing system based on block chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |