CN111353884B - Block chain transaction processing method and system - Google Patents
Block chain transaction processing method and system Download PDFInfo
- Publication number
- CN111353884B CN111353884B CN201811564556.8A CN201811564556A CN111353884B CN 111353884 B CN111353884 B CN 111353884B CN 201811564556 A CN201811564556 A CN 201811564556A CN 111353884 B CN111353884 B CN 111353884B
- Authority
- CN
- China
- Prior art keywords
- sub
- fragments
- main
- block
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 21
- 239000012634 fragment Substances 0.000 claims abstract description 140
- 238000012545 processing Methods 0.000 claims abstract description 40
- 238000012856 packing Methods 0.000 claims abstract description 21
- 238000000034 method Methods 0.000 claims abstract description 11
- 238000004806 packaging method and process Methods 0.000 claims abstract description 4
- 238000012795 verification Methods 0.000 abstract description 8
- 230000006872 improvement Effects 0.000 description 5
- 238000013467 fragmentation Methods 0.000 description 4
- 238000006062 fragmentation reaction Methods 0.000 description 4
- 238000011835 investigation Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 206010033799 Paralysis Diseases 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of blockchain and discloses a blockchain transaction processing method and system. In the embodiment of the invention, the blockchain transaction processing method is applied to nodes on a blockchain network, wherein the nodes are provided with main fragments and m sub-fragments; the method comprises the following steps: dividing a plurality of transactions to be processed into A transaction sets by the main fragments, and distributing the A transaction sets to m sub-fragments for processing; wherein A and m are natural numbers greater than 0; the main fragments acquire sub-blocks newly generated by each sub-fragment, and block packing is carried out according to each sub-block; broadcasting the new area block generated by packaging by the main fragments; if the new block passes verification in the blockchain network, the new block is recorded in each node of the blockchain network as a valid block. The embodiment of the invention can increase the transaction amount per second of the blockchain network, so that the transaction throughput of the blockchain network is improved, and the consistency of the blockchain is ensured.
Description
Technical Field
The invention relates to the technical field of blockchain, in particular to a blockchain transaction processing method and a blockchain transaction processing system.
Background
Blockchains are a reliable database maintained by a centralized and de-centralized de-trust entity, and one of the biggest problems faced at present is scalability. All mainstream platform systems are striving to increase the amount of transactions per second. In fact, today's bitcoin network can handle 7-10 transactions on average per second, and the ethernet network can handle 20-30 transactions per second, a number far below that of a centralized payment system such as Visa, which can handle about 8000 transactions on average per second. The slow transaction processing speed creates a major problem for blockchain systems: the large number of outstanding transactions blocks the network, making it difficult for applications such as real-time payments to reach a single-use on the blockchain, and the prolonged time to confirm the payment presents a number of inconveniences to the user, which is one of the main reasons why credit card payment methods such as Visa are still more attractive.
Disclosure of Invention
The invention aims to provide a blockchain transaction processing method and a blockchain transaction processing system, which can increase the transaction amount per second of a blockchain network, so that the transaction throughput of the blockchain network is improved.
In order to solve the above technical problems, according to an aspect of the present invention, there is provided a blockchain transaction processing method applied to a node on a blockchain network, wherein the node has a main shard and m sub-shards; the method comprises the following steps: dividing a plurality of transactions to be processed into A transaction sets by the main fragments, and distributing the A transaction sets to m sub-fragments for processing; wherein, A and m are natural numbers greater than 0; the main fragments acquire sub-blocks newly generated by each sub-fragment, and block packing is carried out according to each sub-block; broadcasting the new area block generated by packaging by the main fragments; if the new block passes verification in the blockchain network, the new block is recorded in each node of the blockchain network as a valid block.
The embodiment of the invention also provides a blockchain transaction processing system, which comprises: a main chip and m sub-chips; the main fragments are used for dividing a plurality of transactions to be processed into A transaction sets, and distributing the A transaction sets to m sub-fragments for processing; wherein A and m are natural numbers greater than 0; the main fragments are used for acquiring sub-blocks newly generated by each sub-fragment and carrying out block packing according to each sub-block; the main fragments are used for broadcasting the new area blocks generated by packing; if the new block passes verification in the blockchain network, the new block is recorded in each node of the blockchain network as a valid block.
Compared with the prior art, the node in the blockchain network comprises a main fragment and a plurality of sub-fragments, wherein the main fragment divides each transaction to be processed into A transaction sets, the divided A transaction sets are distributed to the sub-fragments for processing, and then the main fragment packs blocks according to new sub-blocks generated by the sub-fragments so as to facilitate the broadcasting and uplink of the subsequent new blocks. In this way, the main fragments are utilized to distribute the transaction to be processed, the sub-fragments are utilized to process the transaction, and the main fragments are utilized to carry out overall information and main network communication, so that parallel processing of the transaction is realized, the processing efficiency is improved, the transaction amount per second of the blockchain network is increased under the condition that the consistency and the reliability of the blockchain are ensured, and the transaction throughput of the blockchain network is improved.
Optionally, a is equal to m, and distributing a transaction sets to m subfragments for processing, including: a transaction sets are equally distributed to m subfragments for processing. Therefore, full utilization of sub-fragments is realized, and parallel processing efficiency of transactions is higher.
Optionally, after distributing the a transaction sets to the m sub-fragments for processing, the method further includes: if all the sub-blocks generated in the first preset time period do not correspond to all the transactions to be processed, the main fragments discard all the transactions to be processed and generate an error log. Therefore, the condition that the resource is wasted due to no response of the node for a long time is avoided, and the technical staff can be helped to conduct fault investigation timely.
Optionally, if the number of times that the sub-fragment generating sub-block exceeds the second preset duration exceeds the preset number of times, the sub-fragment fault is determined.
Optionally, the blockchain transaction processing method further includes: if the main fragment fails, the main fragment is removed, and one sub-fragment among the m sub-fragments is selected as a new main fragment. Therefore, new sub-fragments are selected timely to replace the main fault fragments, normal operation of the nodes can be guaranteed, and node paralysis caused by the failure of the main fragments is avoided.
Optionally, if a subfragment fails, the subfragment is removed.
Optionally, the common-knowledge algorithm of the main fragment and the m sub-fragments is the same, so that the consistency of the main fragment and each sub-fragment can be realized, and the stability of the node is effectively ensured.
Optionally, if a node is newly added in the blockchain network, the newly added node acquires and synchronizes the longest blockchain in the blockchain network.
According to another aspect of the present invention, there is provided a blockchain transaction processing device, the device including: a main shard unit and m sub-shard units; the main fragmentation unit is used for dividing a plurality of transactions to be processed into A transaction sets, and distributing the A transaction sets to m sub-fragmentation units for processing; wherein A and m are natural numbers greater than 0; the main fragment unit is used for acquiring sub-blocks newly generated by each sub-fragment unit and carrying out block packing according to each sub-block; the main fragment unit is used for broadcasting the new area block generated by packing; if the new block passes verification in the blockchain network, the new block is recorded in each node of the blockchain network as a valid block.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description will briefly explain the embodiments or the drawings needed in the prior art, and it is obvious that the drawings in the following description are only some embodiments described in the present specification, and other drawings can be obtained according to these drawings without inventive effort to a person skilled in the art.
FIG. 1 is a flow chart of a blockchain transaction processing method provided by an embodiment of the present invention;
FIG. 2 is a schematic diagram of transaction partitioning for a blockchain transaction processing method according to an embodiment of the present invention;
FIG. 3 is a block generation diagram of a blockchain transaction processing method according to an embodiment of the present invention;
FIG. 4 is an overview of a blockchain network provided by an embodiment of the present invention;
FIG. 5 is a detailed view of a blockchain network provided by an embodiment of the present invention;
FIG. 6 is a block chain diagram of a block chain transaction processing method according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the technical solutions in this specification, a clear and complete description of the technical solutions in this specification embodiment will be provided below with reference to the drawings in one or more embodiments of this specification, and it is apparent that the described embodiments are only some embodiments of this specification, but not all embodiments. All other embodiments, which can be made by a person skilled in the art based on the embodiments of the present description without making any creative effort, shall fall within the protection scope of the claims of the present application.
First embodiment
A first embodiment of the invention relates to a blockchain transaction processing method, and a specific flow is shown in FIG. 1. The transaction processing method in the embodiment is applied to nodes on a blockchain network, wherein the nodes have main fragments and m sub-fragments, and m is a natural number greater than 0. The following describes a specific implementation of the block chain transaction processing method in this embodiment, and the steps are as follows:
step 101, the main shard divides a plurality of transactions to be processed into A transaction sets, and distributes the A transaction sets to m sub-shards for processing.
Specifically, the value of a may be preset by a technician and stored in the node. For example, a may be 3. As shown in fig. 2, n pending transactions are given, and the main shard divides the n pending transactions into 3 shares, which are respectively a transaction set [1 st pending transaction, i th pending transaction ], a transaction set [ i+1 st pending transaction, j th pending transaction ], a transaction set [ j+1 th pending transaction, j th pending transaction ] from the 1 st transaction to the i th transaction, a transaction set [ j+1 th pending transaction, n th pending transaction ]. Wherein i and j are natural numbers greater than 0, and the values of i and j can be preset by technicians, namely, the values of i and j are fixed, and can be selected by a main chip according to the number of the transactions to be processed which are divided according to actual needs. For example, assuming that the number of transactions to be processed is n, the main shard may set i=c according to a remainder algorithm n mod 3=c; j=2c.
In this embodiment, the main shard may divide the transaction set according to the number of sub-shards, that is, let a be equal to m. Therefore, the main fragments can equally distribute the divided A transaction sets to m sub-fragments, so that the sub-fragments are fully utilized, and the parallel processing efficiency of the subsequent transactions is improved conveniently. The value of m can be preset by a technician and stored in the node, and can also be selected by the main fragment according to the number n of the actual transactions to be processed. For example, the corresponding relation between the number interval of the transaction to be processed and the value of m is pre-stored in the node, so that the main fragments set up sub fragments with corresponding numbers according to the value interval where the number n of the transaction to be processed is currently located.
Step 102, the main fragments acquire sub-blocks newly generated by each sub-fragment, and block packing is performed according to each sub-block.
Specifically, each sub-fragment processes each transaction to be processed in the assigned transaction set, one or more sub-blocks are generated by packing, the main fragment periodically acquires hash values of each sub-block newly generated by each sub-fragment, and the hash values are recorded in the newly generated block, so that packing of one or more new blocks is realized.
For example, taking the above n transactions to be processed as 3 cases, where one sub-tile generates sub-block 0, one sub-tile generates sub-block 1, and one sub-tile generates sub-block 3, the main tile generates the information of sub-block 0, sub-block 1, and sub-block 2 in the new block 0. For example, the hash values of sub-block 0, sub-block 1 and sub-block 2 may be recorded in block 0, as shown in fig. 3.
And step 103, broadcasting the new area block generated by packaging by the main fragments.
Specifically, the master fragment broadcasts the latest block formed by packing, each node in the blockchain network receives a new block, verifies the new block, if the verification is passed, the new block is recorded by each node as a valid block, and is added into the blockchain, so that the blockchain is continuously lengthened.
Compared with the prior art, the node in the blockchain network comprises a main fragment and a plurality of sub-fragments, wherein the main fragment divides each transaction to be processed into A transaction sets, the divided A transaction sets are distributed to the sub-fragments for processing, and then the main fragment packs blocks according to new sub-blocks generated by the sub-fragments so as to facilitate the broadcasting and uplink of the subsequent new blocks. In this way, the main fragments are utilized to distribute the transaction to be processed, the sub-fragments are utilized to process the transaction, and the main fragments are utilized to carry out overall information and main network communication, so that parallel processing of the transaction is realized, the processing efficiency is improved, the transaction amount per second of the blockchain network is increased under the condition that the consistency and the reliability of the blockchain are ensured, and the transaction throughput of the blockchain network is improved.
It should be noted that, since the blockchain network is a distributed network (as shown in fig. 4) composed of a plurality of nodes, after each transaction is input and initiated by a certain node, it can reach any node through the main network, that is, each node in the blockchain network can learn about the transaction to perform processing calculation. Thus, the node with the main shard and the m sub-shards mentioned in this embodiment may be any node on the blockchain network (as shown in fig. 5). That is, each node on the blockchain network may have a main shard and m sub-shards.
If all nodes in the blockchain network include sub-shards as well as main shards, and all transactions can be processed in the nodes through steps 101-103 described above, the blockchain as shown in fig. 6 will appear. That is, each block includes information of sub-blocks generated by sub-fragments in a node packing the block, and each newly generated block includes information of a previous block. Thus, even if nodes are newly added in the blockchain, the newly added nodes can acquire and synchronize the longest blockchain, so that the information can be synchronized, and the consistency of the blockchains is ensured.
It should be noted that the consensus algorithm of the main shard and each sub-shard associated with the main shard in each node is the same, so that the main shards can communicate with each other, the main shard can communicate with each sub-shard associated with the main shard, and parallel processing of transactions on the node and record synchronization of transactions on the blockchain can be realized.
Second embodiment
A second embodiment of the present invention relates to a blockchain transaction processing method. The second embodiment of the present invention is an improvement over the first embodiment, and the main improvement is that: in a second embodiment of the present invention, if all sub-blocks generated within the first preset time period do not correspond to all pending transactions, the main fragment discards each pending transaction and generates an error log. Therefore, the condition that the resource is wasted due to no response of the node for a long time is avoided, and the technical staff can be helped to conduct fault investigation timely. The following is a specific description:
Specifically, after the main fragments acquire the sub-blocks generated by all the sub-fragments, the new blocks are packed, so that transaction omission is avoided, and the consistency of block chains is ensured. However, if a certain sub-tile fails, the sub-tile cannot generate sub-blocks periodically, which causes the situation that the main tile does not package new blocks all the time and the node does not respond for a long time. Therefore, in order to improve the resource rate of the node and avoid the occurrence of the above situation, when all the sub-blocks generated in the first preset time period do not correspond to all the pending transactions, the main fragments discard all the pending transactions and generate error logs so as to facilitate the technicians to perform fault investigation in time. The first preset duration may be equal to or greater than a duration of the regular generation of the sub-blocks by the sub-fragments.
More specifically, if the number of times that one sub-fragment generating sub-block exceeds the second preset time period exceeds the preset number of times, the sub-fragment is determined to be faulty. At this time, the main shard may reflect the information of the sub-shard in the error log, so that a technician may repair the sub-shard in time, or the main shard may directly remove the sub-shard, so as to ensure the normal operation of the node. The preset times can be preset by a technician, and the second preset time length can be equal to or slightly longer than the time length of the regular generation of the sub-blocks by the sub-fragments. In addition, during actual operation, the second preset duration may be set to be smaller than or equal to the first preset duration.
It should be noted that if the main fragment fails, the main fragment may be removed, and a sub-fragment among the m sub-fragments may be selected as a new main fragment. Therefore, new sub-fragments are selected timely to replace the main fault fragments, normal operation of the nodes can be guaranteed, and node paralysis caused by the failure of the main fragments is avoided.
The above steps of the methods are divided, for clarity of description, and may be combined into one step or split into multiple steps when implemented, so long as they include the same logic relationship, and they are all within the protection scope of this patent; it is within the scope of this patent to add insignificant modifications to the algorithm or flow or introduce insignificant designs, but not to alter the core design of its algorithm and flow.
Third embodiment
A third embodiment of the present invention is directed to a blockchain transaction processing system, comprising: a main chip and m sub-chips; wherein m is a natural number greater than 0. The main fragments are used for dividing a plurality of transactions to be processed into A transaction sets, and distributing the A transaction sets to m sub-fragments for processing; wherein n is a natural number greater than 0. The main fragments are used for acquiring sub-blocks newly generated by each sub-fragment, and carrying out block packing according to each sub-block. The main fragments are used for broadcasting the new area blocks generated by the packing. If the new block passes verification in the blockchain network, the new block is recorded in each node of the blockchain network as a valid block.
Specifically, the value of a may be preset by a technician and stored in the node. For example, a may be 3. As shown in fig. 2, n pending transactions are given, and the main shard divides the n pending transactions into 3 shares, which are respectively a transaction set [1 st pending transaction, i th pending transaction ], a transaction set [ i+1 st pending transaction, j th pending transaction ], a transaction set [ j+1 th pending transaction, j th pending transaction ] from the 1 st transaction to the i th transaction, a transaction set [ j+1 th pending transaction, n th pending transaction ]. Wherein i and j are natural numbers greater than 0, and the values of i and j can be preset by technicians, namely, the values of i and j are fixed, and can be selected by a main chip according to the number of the transactions to be processed which are divided according to actual needs. For example, assuming that the number of transactions to be processed is n, the main shard may set i=c according to a remainder algorithm n mod 3=c; j=2c.
In this embodiment, the main shard may divide the transaction set according to the number of sub-shards, that is, let a be equal to m. Therefore, the main fragments can equally distribute the divided A transaction sets to m sub-fragments, so that the sub-fragments are fully utilized, and the parallel processing efficiency of the subsequent transactions is improved conveniently. The value of m can be preset by a technician and stored in the node, and can also be selected by the main fragment according to the number n of the actual transactions to be processed. For example, the corresponding relation between the number interval of the transaction to be processed and the value of m is pre-stored in the node, so that the main fragments set up sub fragments with corresponding numbers according to the value interval where the number n of the transaction to be processed is currently located.
Specifically, each sub-fragment processes each transaction to be processed in the assigned transaction set, one or more sub-blocks are generated by packing, the main fragment periodically acquires hash values of each sub-block newly generated by each sub-fragment, and the hash values are recorded in the newly generated block, so that packing of one or more new blocks is realized.
For example, taking the above n transactions to be processed as 3 cases, where one sub-tile generates sub-block 0, one sub-tile generates sub-block 1, and one sub-tile generates sub-block 3, the main tile generates the information of sub-block 0, sub-block 1, and sub-block 2 in the new block 0. For example, the hash values of sub-block 0, sub-block 1, and sub-block 2 may be recorded in block 0.
Specifically, the master fragment broadcasts the latest block formed by packing, each node in the blockchain network receives a new block, verifies the new block, if the verification is passed, the new block is recorded by each node as a valid block, and is added into the blockchain, so that the blockchain is continuously lengthened.
More specifically, since the blockchain network is a distributed network composed of a plurality of nodes, after each transaction is input and initiated through a certain node, any node can be reached through the main network, that is, each node in the blockchain network can acquire the transaction to perform processing calculation. Thus, the blockchain transaction processing system referred to in this embodiment may be understood as any node on the blockchain network. That is, each node on the blockchain network may have a main shard and m sub-shards.
It is to be noted that this embodiment is a system embodiment corresponding to the first embodiment, and this embodiment can be implemented in cooperation with the first embodiment. The related technical details mentioned in the first embodiment are still valid in this embodiment, and in order to reduce repetition, they are not described here again. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the first embodiment.
Fourth embodiment
A fourth embodiment of the present invention is directed to a blockchain transaction processing system. The fourth embodiment is an improvement on the third embodiment, and the main improvement is that: in the fourth embodiment of the present invention, if all the sub-blocks generated within the first preset time period do not correspond to all the pending transactions, the main fragment is further configured to discard each pending transaction and generate an error log. Therefore, the condition that the resource is wasted due to no response of the node for a long time is avoided, and the technical staff can be helped to conduct fault investigation timely.
It is to be noted that this embodiment is a system embodiment corresponding to the second embodiment, and this embodiment can be implemented in cooperation with the second embodiment. The related technical details mentioned in the second embodiment are still valid in this embodiment, and in order to reduce repetition, they are not described here again. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the second embodiment.
Fifth embodiment
A fifth embodiment of the present invention provides a blockchain transaction processing device, the device including: a main shard unit and m sub-shard units. The main fragmentation unit is used for dividing a plurality of transactions to be processed into A transaction sets, and distributing the A transaction sets to m sub-fragmentation units for processing; wherein A and m are natural numbers greater than 0; the main fragment unit is used for acquiring sub-blocks newly generated by each sub-fragment unit and carrying out block packing according to each sub-block; the main fragment unit is used for broadcasting the new area block generated by packing; if the new block passes verification in the blockchain network, the new block is recorded in each node of the blockchain network as a valid block.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (5)
1. A blockchain transaction processing method, characterized by being applied to nodes on a blockchain network, wherein the nodes have a main shard and m sub-shards;
The method comprises the following steps:
Dividing a plurality of transactions to be processed into A transaction sets by the main fragments of the nodes, and distributing the A transaction sets to the m sub-fragments for processing; wherein A and m are natural numbers greater than 0;
the main fragments of the nodes acquire sub-fragments of each node to generate sub-blocks newly, and the sub-fragments are packaged according to the sub-blocks, and the main fragments only package new blocks after acquiring the sub-blocks generated by all the sub-fragments;
Broadcasting the new area block generated by packaging by the main fragments of the nodes; wherein if the new block is verified in the blockchain network, the new block is recorded as an effective block in each node of the blockchain network;
After the transaction sets A are distributed to the m sub-fragments for processing, the method further comprises the following steps: if all the sub-blocks generated within the first preset time period do not correspond to all the transactions to be processed, the main fragments abandon all the transactions to be processed and generate an error log;
If the times of the generation of the sub-fragments by one sub-block exceeds the second preset time period exceeds the preset times, the sub-fragments are determined to be faulty;
If the main fragments are failed, removing the main fragments, and selecting one sub-fragment from the m sub-fragments as a new main fragment;
and if one of the sub-fragments fails, removing the sub-fragment.
2. The blockchain transaction processing method of claim 1, wherein a is equal to m, and the allocating a transaction sets to the m subfragments for processing specifically comprises: and averagely distributing A transaction sets to the m sub-fragments for processing.
3. The blockchain transaction processing method of claim 1, wherein the main shard is the same as the consensus algorithm of the m sub-shards.
4. The blockchain transaction processing method of claim 1, wherein,
If a node is newly added in the blockchain network, the newly added node acquires and synchronizes the longest blockchain in the blockchain network.
5. A blockchain transaction processing system for performing the blockchain transaction processing method of any of claims 1 to 4, comprising: a node having a main shard and m sub-shards, and a judgment processing unit;
the main fragments are used for dividing a plurality of transactions to be processed into A transaction sets, and distributing the A transaction sets to the m sub-fragments for processing; wherein A and m are natural numbers greater than 0;
the main fragments are used for acquiring sub-blocks newly generated by all the sub-fragments and carrying out block packing according to the sub-blocks, and the main fragments carry out packing of new blocks after acquiring the sub-blocks generated by all the sub-fragments;
The main fragments are used for broadcasting new area blocks generated by packing; wherein if the new block is verified in the blockchain network, the new block is recorded as an effective block in each node of the blockchain network;
the judging and processing unit is used for judging that if all sub-blocks generated in a first preset duration do not correspond to all the transactions to be processed after the A transaction sets are distributed to the m sub-blocks for processing, the main block is also used for giving up all the transactions to be processed and generating error logs, wherein if the number of times that one sub-block generates the sub-block exceeds a second preset duration exceeds a preset number of times, the sub-block is determined to be faulty; if the main fragments are failed, removing the main fragments, and selecting one sub-fragment from the m sub-fragments as a new main fragment; and if one of the sub-fragments fails, removing the sub-fragment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811564556.8A CN111353884B (en) | 2018-12-20 | 2018-12-20 | Block chain transaction processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811564556.8A CN111353884B (en) | 2018-12-20 | 2018-12-20 | Block chain transaction processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111353884A CN111353884A (en) | 2020-06-30 |
| CN111353884B true CN111353884B (en) | 2024-05-03 |
Family
ID=71195406
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811564556.8A Active CN111353884B (en) | 2018-12-20 | 2018-12-20 | Block chain transaction processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111353884B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH05151159A (en) * | 1991-11-28 | 1993-06-18 | Nec Corp | Transaction schedule system |
| US9298760B1 (en) * | 2012-08-03 | 2016-03-29 | Google Inc. | Method for shard assignment in a large-scale data processing job |
| CN107392611A (en) * | 2017-03-24 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of method and device for sending Transaction Information and common recognition checking |
| CN108053211A (en) * | 2017-12-27 | 2018-05-18 | 北京欧链科技有限公司 | Transaction processing method and device based on block chain |
| CN108256707A (en) * | 2016-12-28 | 2018-07-06 | 平安科技（深圳）有限公司 | Declaration form pays a return visit management method and device |
| CN108269072A (en) * | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| WO2018126858A1 (en) * | 2017-01-06 | 2018-07-12 | 中国银联股份有限公司 | Blockchain technology-based robust atm network system and information processing method therefor |
| CN108564470A (en) * | 2018-04-17 | 2018-09-21 | 北京天德科技有限公司 | The transaction distribution method of block is built in a kind of block chain parallel |
| CN108847925A (en) * | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| CN108881488A (en) * | 2018-08-01 | 2018-11-23 | 夸克链科技（深圳）有限公司 | It is a kind of based on the block chain transaction processing method and network that divide domain |
| CN108881274A (en) * | 2018-07-06 | 2018-11-23 | 众安信息技术服务有限公司 | A kind of block chain sharding method and device based on application |
| CN108960837A (en) * | 2018-06-05 | 2018-12-07 | 上海和数软件有限公司 | Block chain common recognition verification method, device and computer readable storage medium |
| CN108989410A (en) * | 2018-07-04 | 2018-12-11 | 清华大学 | A method of improving block chain throughput efficiency |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101544356B1 (en) * | 2012-10-31 | 2015-08-13 | 삼성에스디에스 주식회사 | Distributed database managing method and composition node thereof supporting dynamic sharding based on the metadata and data transaction quantity |
| US11095432B2 (en) * | 2017-04-05 | 2021-08-17 | Samsung Sds Co., Ltd. | System for processing data based on blockchain and operating method thereof |
| US10397328B2 (en) * | 2017-05-17 | 2019-08-27 | Nec Corporation | Method and system for providing a robust blockchain with an integrated proof of storage |
-
2018
- 2018-12-20 CN CN201811564556.8A patent/CN111353884B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH05151159A (en) * | 1991-11-28 | 1993-06-18 | Nec Corp | Transaction schedule system |
| US9298760B1 (en) * | 2012-08-03 | 2016-03-29 | Google Inc. | Method for shard assignment in a large-scale data processing job |
| CN108256707A (en) * | 2016-12-28 | 2018-07-06 | 平安科技（深圳）有限公司 | Declaration form pays a return visit management method and device |
| CN108269072A (en) * | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| WO2018126858A1 (en) * | 2017-01-06 | 2018-07-12 | 中国银联股份有限公司 | Blockchain technology-based robust atm network system and information processing method therefor |
| CN107392611A (en) * | 2017-03-24 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of method and device for sending Transaction Information and common recognition checking |
| CN108053211A (en) * | 2017-12-27 | 2018-05-18 | 北京欧链科技有限公司 | Transaction processing method and device based on block chain |
| CN108564470A (en) * | 2018-04-17 | 2018-09-21 | 北京天德科技有限公司 | The transaction distribution method of block is built in a kind of block chain parallel |
| CN108960837A (en) * | 2018-06-05 | 2018-12-07 | 上海和数软件有限公司 | Block chain common recognition verification method, device and computer readable storage medium |
| CN108847925A (en) * | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| CN108989410A (en) * | 2018-07-04 | 2018-12-11 | 清华大学 | A method of improving block chain throughput efficiency |
| CN108881274A (en) * | 2018-07-06 | 2018-11-23 | 众安信息技术服务有限公司 | A kind of block chain sharding method and device based on application |
| CN108881488A (en) * | 2018-08-01 | 2018-11-23 | 夸克链科技（深圳）有限公司 | It is a kind of based on the block chain transaction processing method and network that divide domain |
Non-Patent Citations (1)
| Title |
|---|
| Loi Luu等.A Secure Sharding Protocol For Open Blockchains.CCS 2016：Proceedings of the ACM Conference on Computer and Communications Security.2016,17-30. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111353884A (en) | 2020-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106406896B (en) | Block chain block building method based on parallel Pipeline technology | |
| WO2017088517A1 (en) | Method and device for optical transport network to bear flex ethernet service | |
| CN112511590A (en) | Efficient storage reconfiguration method for block chain fragmentation | |
| CN106354865B (en) | Method, device and system for synchronizing master database and slave database | |
| WO2019019056A1 (en) | Method for frontal machine to participate in block chain consensus | |
| CN104113435B (en) | Generate the method and device of mark | |
| CN106571925A (en) | Method of carrying out proof of work on block in block chain system and device thereof | |
| CN109101338A (en) | A kind of block chain processing framework and its method based on the extension of multichannel chip | |
| CN106453625A (en) | Information synchronization method and high-availability cluster system | |
| CN114900480B (en) | Communication safety management and control system based on data platform | |
| JP2017539173A (en) | Crossboard transfer method and apparatus, program, and recording medium | |
| CN104219298A (en) | Cluster system and data backup method thereof | |
| CN114338040A (en) | Grouping multi-chain three-time consensus method for block link points | |
| CN111353884B (en) | Block chain transaction processing method and system | |
| CN108616782B (en) | Frequency spectrum allocation method based on disjoint connection group optimization in elastic optical network | |
| CN103152292A (en) | Device and method for framing XGEM (XGPON Encapsulation Method) in ONU (Optical Network Unit) in XGPON (XG-Passive Optical Network) system | |
| WO2016050022A1 (en) | Method, device, system and computer storage medium for allocating uplink bandwidth | |
| CN103634229B (en) | A kind of Inter-chip communication method and control device | |
| CN111445329A (en) | Block chain transaction processing method and system | |
| CN106294445B (en) | The method and device of data storage based on across computer room Hadoop cluster | |
| CN101848055A (en) | Method and device for correcting data | |
| WO2016101555A1 (en) | Cross scheduling method and device, and storage medium | |
| EP3107234B1 (en) | Method, apparatus and system for transmitting signal in optimal transmission network | |
| CN109446200A (en) | A kind of method and device of data processing | |
| CN113676314B (en) | Quantum key management method, comparison method, output method, device and system |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: He Haiwen Inventor after: He Haiwu Inventor after: Zhou Bing Inventor after: Rao Yulin Inventor after: Wang Wei Inventor before: He Haiwen Inventor before: He Haiwu Inventor before: Zhou Bing Inventor before: Rao Yulin Inventor before: Wang Wei |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |