Patent Application
20220358119
The present application relates to blockchain technologies, and particularly to a blockchain consensus method, an apparatus and a device.
With the development of blockchain technologies, more and more data begin to use a blockchain for storing and interacting. The blockchain is also referred to as distributed ledger, and is essentially a decentralized distributed internet database.
In the blockchain technologies, a consensus mechanism is an important method for achieving trust establishment among different nodes in a blockchain network. Specifically, a consensus node receives several pieces of transaction information and puts the information into a transaction pool, and the consensus node obtains a batch of transactions from the transaction pool and perform consensus on the batch of transactions. After the consensus on the batch of transactions is completed, a next batch of transactions are obtained from the transaction pool for performing consensus, and the above-mentioned processes are repeatedly performed.
The present application provides a blockchain consensus method, an apparatus and a device, so as to increase consensus efficiency of blockchains.
In a first aspect, the present application provides a blockchain consensus method, applied to a consensus node in a blockchain system, and the method includes:
dividing transaction information in a transaction pool into N transaction information sets, where N is a natural number greater than 1;
performing consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set; and
determining, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to an i-th transaction information set, where i takes 1, 2, . . . , N-1 and N in sequence.
In a possible implementation, the determining, according to the first consensus result corresponding to the first i transaction information set, the second consensus result corresponding to the i-th transaction information set includes:
judging whether a first consensus result corresponding to the i-th transaction information set is a consensus success;
if yes, determining that the second consensus result corresponding to the i-th transaction information set is a consensus success when i is equal to 1; and determining a second consensus result corresponding to the (i−1)-th transaction information set as the second consensus result corresponding to the i-th transaction information set when i is greater than 1;
if no, determining that the second consensus result corresponding to the i-th transaction information set is a consensus failure.
In a possible implementation, after the determining, according to the first consensus result corresponding to the first i transaction information set, the second consensus result corresponding to the i-th transaction information set, further includes:
judging whether the second consensus result corresponding to the i-th transaction information set is a consensus success;
if yes, executing transaction information in the i-th transaction information set.
In a possible implementation, before the executing the transaction information in the i-th transaction information set, further includes:
grouping, according to an association relationship among the transaction information in the i-th transaction information set, multiple pieces of transaction information in the i-th transaction information set, to obtain M transaction information groups corresponding to the i-th transaction information set, where transaction information having an association relationship is located in a same transaction information group, and M is a natural number greater than 1; and the executing the transaction information in the i-th transaction information set includes:
executing the transaction information in the M transaction information groups corresponding to the i-th transaction information set in parallel.
In a possible implementation, the transaction information includes: a transaction identifier and a pre-transaction identifier; and the grouping, according to the association relationship among the transaction information in the i-th transaction information set, the multiple pieces of transaction information in the i-th transaction information set, to obtain the M transaction information groups corresponding to the i-th transaction information set includes:
judging whether a first transaction information group is existed in a created transaction information group, where the first transaction information group includes a pre-transaction identifier corresponding to a transaction identifier of a j-th piece of transaction information in the i-th transaction information set;
if yes, adding the j-th piece of transaction information to the first transaction information group;
if no, adding the j-th piece of transaction information to a second transaction information group, where the second transaction information group is any one of the created transaction information group or a newly created transaction information group; j takes 1, 2, . . . , K in sequence, K is an number of the transaction information included in the i-th transaction information set, and the transaction information in the i-th transaction information set is arranged in an ascending order of transaction time.
In a possible implementation, the adding the j-th piece of transaction information to the second transaction information group includes:
judging whether a number of the created transaction information group is greater than a first threshold;
if yes, determining the second transaction information group in the created transaction information group, and adding the j-th piece of transaction information to the second transaction information group;
if no, creating a new transaction information group, and adding the j-th piece of transaction information to the new transaction information group, where the new transaction information group is the second transaction information group.
In a possible implementation, the determining the second transaction information group in the created transaction information group includes:
obtaining an amount of transaction information existing in respective created transaction information group; and
determining, according to the amount of the transaction information existing in respective created transaction information group, the second transaction information group in the created transaction information groups, where an amount of transaction information existing in the second transaction information group is less than a second threshold.
In a second aspect, the present application provides a blockchain consensus apparatus, including:
a dividing module, configured to divide transaction information in a transaction pool into N transaction information sets, where N is a natural number greater than 1;
a processing module, configured to perform consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set;
the processing module is further configured to determine, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to an i-th transaction information set, where i takes 1, 2, . . . , N-1 and N in sequence.
In a possible implementation, the processing module is specifically configured to:
judge whether a first consensus result corresponding to the i-th transaction information set is a consensus success;
if yes, determine that the second consensus result corresponding to the i-th transaction information set is a consensus success when i is equal to 1; and determine a second consensus result corresponding to the (i−1)-th transaction information set as the second consensus result corresponding to the i-th transaction information set when i is greater than 1;
if no, determine that the second consensus result corresponding to the i-th transaction information set is a consensus failure.
In a possible implementation, the processing module is further configured to:
judge whether the second consensus result corresponding to the i-th transaction information set is a consensus success;
if yes, execute transaction information in the i-th transaction information set.
In a possible implementation, the processing module is further configured to: group, according to an association relationship among the transaction information in the i-th transaction information set, multiple pieces of transaction information in the i-th transaction information set, to obtain M transaction information groups corresponding to the i-th transaction information set, where transaction information having an association relationship is located in a same transaction information group, and M is a natural number greater than 1; and
execute the transaction information in the M transaction information groups corresponding to the i-th transaction information set in parallel.
In a possible implementation, the transaction information includes: a transaction identifier and a pre-transaction identifier; and the processing module is specifically configured to:
judge whether a first transaction information group is existed in a created transaction information group, where the first transaction information group includes a pre-transaction identifier corresponding to a transaction identifier of a j-th piece of transaction information in the i-th transaction information set;
if yes, add the j-th piece of transaction information to the first transaction information group;
if no, add the j-th piece of transaction information to a second transaction information group, where the second transaction information group is any one of the created transaction information group or a newly created transaction information group; j takes 1, 2, . . . , and K in sequence, K is a number of the transaction information included in the i-th transaction information set, and the transaction information in the i-th transaction information set is arranged in an ascending order of transaction time.
In a possible implementation, the processing module is specifically configured to:
judge whether a number of the created transaction information group is greater than a first threshold;
if yes, determine the second transaction information group in the created transaction information group, and add the j-th piece of transaction information to the second transaction information group;
if no, create a new transaction information group, and add the j-th piece of transaction information to the new transaction information group, where the new transaction information group is the second transaction information group.
In a possible implementation, the processing module is specifically configured to:
obtain an amount of transaction information existing in respective created transaction information group;
determine, according to the amount of the transaction information existing in respective created transaction information group, the second transaction information group in the created transaction information groups, where an amount of the transaction information existing in the second transaction information group is less than a second threshold.
In a third aspect, the present application provides a consensus device, including: a memory, a processor and a computer program, where the computer program is stored in the memory, and the processor runs the computer program to execute the method according to any one of the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium including a computer program, the method according to any one of the first aspect is implemented when the computer program is executed by a processor.
In a fifth aspect, the present application provides a computer program product which can be executed by a processor, the method according to any one of the first aspect is implemented when the computer program product is executed.
In a sixth aspect, the present application provides a chip, including: a memory, a processor and a computer program, where the computer program is stored in the memory, and the processor runs the computer program to execute the method according to any one of the first aspect.
In the blockchain consensus method, the apparatus and the device provided by the present application, the method includes: dividing, by a consensus node, transaction information in a transaction pool into N transaction information sets; performing consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set; and determining, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to an i-th transaction information set, where i takes 1, 2, . . . , N-1 and N in sequence. Since the second consensus result corresponding to the i-th transaction information set is determined according to the first consensus result corresponding to the first i transaction information set, the accuracy of the consensus results thus can be ensured. Moreover, under the premise of ensuring the accuracy of the consensus results, performing consensus on the N transaction information sets in the transaction pool in parallel is realized, consensus efficiency is increased, and thereby an overall performance of a blockchain network can be improved.
In order to more clearly illustrate technical solutions in embodiments of the present application or in the prior art, drawings that need to be used in description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are merely some embodiments of the present application, and for those of ordinary skill in the art, other drawings can be obtained according to these drawings without paying creative labor.
Technical solutions in embodiments of the present application will be clearly and completely described below in conjunction with drawings in the embodiments of the present application, it is obvious that the described embodiments are merely a part of embodiments of the present application, rather than all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without paying creative labor shall fall within protection scope of the present application.
Terms “first”, “second”, “third”, “fourth”, etc. (if any) in the Description, the Claims and the above-mentioned drawings of the present application are used for distinguishing similar objects, and do not necessarily being used to describe a specific order or sequence. It should be understood that data used in this way may be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can, for example, be implemented in an order other than those illustrated or described herein. In addition, terms “include”, “have” and any variations thereof are intended to cover a non-exclusive inclusion, for example, processes, methods, systems, products or devices including a series of steps or units do not necessarily being limited to those steps or units clearly listed, but can include other steps or units that are not clearly listed or are inherent to these processes, methods, products or devices.
In blockchain technologies, a consensus mechanism is an important method for achieving trust establishment among different nodes in a blockchain network. Consensus mechanisms used by different blockchain networks may be different, and the consensus mechanisms include, but are not limited to: proof of work (POW), proof of stake (POS), delegated proof of stake (DPOS), practical byzantine fault tolerance (PBFT), proof of importance (POI), proof of participation (POP), etc. However, the consensus mechanisms have a similar consensus process, and are all based on a serialized consensus manner.
Since there are time orders among the transaction information in the transaction pool, for example, transaction 1 is performed before transaction 2, there may be a dependency relationship between transaction 2 and transaction 1. When performing consensus on the transactions, the consensus node needs to perform consensus on the transactions in order. Assuming that the number of transactions on which the consensus node performs a round of consensus is k, then a first batch of transactions that the consensus node obtains from the transaction pool is transaction 1, transaction 2, . . . , transaction k. The consensus node performs a first round of consensus on the first batch of transactions, to obtain a consensus result of the first round of consensus. After the first round of consensus is completed, the consensus node obtains a second batch of transactions from the transaction pool, for example, transaction k+1, transaction k+2, transaction 2k. The consensus node performs a second round of consensus on the second batch of transactions, to obtain a consensus result of the second round of consensus. After the second round of consensus is completed, the consensus node obtains a third batch of transactions from the transaction pool, for example, transaction 2k+1, transaction 2k+2, . . . , transaction 3k. The consensus node performs a third round of consensus on the third batch of transactions, to obtain a consensus result of the third round of consensus. Then, subsequent consensus processes are performed continuously, and it is understandable that the subsequent consensus processes are similar to the above-mentioned process, and will not be repeated herein.
It should be noted that consensus processes corresponding to different consensus mechanisms may be slightly different, for example, an agreement may be made on the number of transactions for each round of consensus, or an agreement may be made on time intervals between each round of consensus.
It can be seen from
In order to solve the above-mentioned problems, the present application provides a blockchain consensus method, and in a process of performing consensus on transactions, the consensus node adopts a parallelized consensus manner, which increases consensus efficiency without affecting accuracy of consensus results, and thereby improves an overall performance of a blockchain network.
The technical solutions of the present application are described in detail below by way of specific embodiments. The following several specific embodiments can be combined with each other, and same or similar concepts or processes may not be repeated in some embodiments.
The consensus node refers to a device used for performing consensus on transactions in a blockchain. Exemplarily, the consensus node may be a personal computer, a computer cluster, a mobile phone, a tablet computer, a smart wearable device, a vehicle-mounted device, etc.
As shown in
S201: dividing transaction information in a transaction pool into N transaction information sets, where N is a natural number greater than 1.
S202: performing consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set.
S203: determining, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to an i-th transaction information set, where i takes 1, 2, . . . , N-1 and N in sequence.
In the present embodiment, the transaction pool refers to a buffer pool used for caching transaction information. The transaction information sent by a transaction submission node to the consensus node is put into the transaction pool for caching. Each transaction information in the transaction pool is stored in time order of the transactions. Among them, the transaction submission node refers to a node that generates the transaction information, for example, it may be a user terminal, may also be other nodes except the consensus node in the blockchain system.
In S201, there may be various implementations for the consensus node to divide the transaction information in the transaction pool into N transaction information sets. In a possible implementation, the division is carried out in accordance with a preset amount, for example, every k pieces of transaction information may be divided into one set in accordance with the order of the transaction information in the transaction pool, and in the light of this kind of division manner, the amount of the transaction information in each set is k. In another possible implementation, the division can by carried out in accordance with time ranges within which the transaction information is located. For example, the transaction information within time period 1 is taken as set 1, the transaction information within time period 2 is taken as set 2, and in the light of this kind of division manner, the amount of transaction information in different sets may be different.
It is understandable that for different consensus mechanisms, manners for dividing transaction information in the transaction pool may be different. In an implementation, the division can be made according to the maximum number of transaction information in each round of consensus specified by the transaction mechanisms. For different division manners, values of N may also be different, the present embodiment does not limit the value of N, and it can be selected according to practical application scenes.
In S202, after dividing the transaction information in the transaction pool into N transaction information sets, the consensus node can perform consensus on the N transaction information sets in parallel. In other words, for each transaction information set, a round of consensus is performed, and these N rounds of consensus are performed in parallel.
Exemplarily, in conjunction with the example shown in
The first consensus result in the present embodiment refers to a result obtained by performing consensus on the transaction information in the transaction information set corresponding to the current round of consensus. In other words, the first consensus result does not consider a consensus result of transaction information before the current round of consensus. Referring to
It should be noted that the present embodiment does not specifically limit execution processes of each round of consensus, and consensus can be performed on transaction information in a set according to existing consensus algorithms. Consensus execution processes corresponding to different consensus algorithms may also be different. It is understandable that the first consensus result of each round of consensus is determined by using a consensus algorithm.
In practical applications, transactions 101-200 of the second round of consensus may depend on transactions 1-100 of the first round of consensus, in this way, a final consensus result of the second round of consensus actually depends on the consensus result of the first round of consensus. Therefore, in the present embodiment, by adopting S203, after performing consensus on the N transaction information sets in parallel, to obtain the first consensus results of the N transaction information sets, second consensus results of the N transaction information sets are obtained according to the first consensus results of the N transaction information sets and taking into consideration of dependency relationships among the N transaction information sets. Among them, the second consensus result refers to a consensus result obtained after considering dependency relationships among the transactions. In other words, the second consensus result indicates a final consensus result obtained after performing an overall consensus on the transaction information in the transaction pool.
It is understandable that a second consensus result of the i-th transaction information set is related to the first consensus results of the first i transaction information sets. In other words, the second consensus result corresponding to the i-th transaction information set can be determined according to the first consensus results corresponding to the first i transaction information sets. Among them, i is a natural number less than or equal to N.
The following takes the i-th transaction information set as an example, to describe a process of determining the second consensus result corresponding to the i-th transaction information set. At first, judging whether the first consensus result corresponding to the i-th transaction information set is a consensus success; if yes, determining that the second consensus result corresponding to the i-th transaction information set is a consensus success when i is equal to 1; and determining the second consensus result corresponding to the (i−1)-th transaction information set as the second consensus result corresponding to the i-th transaction information set when i is greater than 1; if no, determining that the second consensus result corresponding to the i-th information transaction set is a consensus failure.
In other words, when i=1 (that is, for the first transaction information set), the first consensus result of the first transaction information set is directly taken as the second consensus result of the first transaction information set. For example, if the first consensus result of the first transaction information set is a success, then it is determined that the second consensus result of the first transaction information set is a success; and if the first consensus result of the first transaction information set is a failure, then it is determined that the second consensus result of the first transaction information set is a failure. When i>1, if the first consensus result of the i-th transaction information set is a failure, then it is determined that the second consensus result of the i-th transaction information set is a failure. If the first consensus result of the i-th transaction information set is a success, then the second consensus result of the (i−1)-th transaction information set is taken as the second consensus result of the i-th transaction information set (that is, if the second consensus result of the (i−1)-th transaction information set is a success, then it is determined that the second consensus result of the i-th transaction information set is a success; and if the second consensus result of the (i−1)-th transaction information set is a failure, then it is determined that the second consensus result of the i-th transaction information set is a failure).
In conjunction with
In a possible implementation, as shown in
In a possible implementation, for each round of consensus in N rounds of consensus, for example, for the i-th round of consensus, if the second consensus result of the i-th round of consensus is a success, then the transaction information in the transaction information set corresponding to the i-th round of consensus is executed. As shown in
The blockchain consensus method provided in the present embodiment includes: dividing transaction information in a transaction pool into N transaction information sets; performing consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set; and determining, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to an i-th transaction information set, where i takes 1, 2, . . . , N-1 and N in sequence. Since the second consensus result of the i-th transaction information set is determined according to the first consensus result of the first i transaction information set, the accuracy of the consensus results thus can be ensured. Moreover, under the premise of ensuring the accuracy of the consensus results, performing consensus on the N transaction information sets in the transaction pool in parallel is realized, consensus efficiency is increased, and thereby an overall performance of a blockchain network can be improved.
On a basis of the above-mentioned embodiments, for each transaction information set, if the second consensus result of the transaction information set is a consensus success, the transaction information in the transaction information set needs to be executed, so that the transaction information in the transaction information set is written into a block. It should be noted that in practical applications, transaction information in each transaction information set can be written into one block, and may also be written into multiple blocks, which is not limited in the present embodiment. In the present embodiment, in order to further increase execution efficiency of transaction information, the transaction information in each transaction information set may also be further divided into multiple transaction information groups. In this way, when transaction information in the transaction information set is executed, multiple transaction information groups can be executed in parallel, thereby execution efficiency is increased. A detailed description will be given below in conjunction with the embodiment shown in
S401: dividing transaction information in a transaction pool into N transaction information sets, where N is a natural number greater than 1.
For specific implementation of S401 in the present embodiment, reference may be made to detailed description of S201, which will not be repeated herein.
S402: for each transaction information set, grouping, according to an association relationship among transaction information in the transaction information set, multiple pieces of transaction information in the transaction information set, to obtain M transaction information groups corresponding to the transaction information set, where transaction information having an association relationship is located in a same transaction information group.
The association relationship may refer to a dependency relationship between transaction information. For example: transaction 1 is a transfer of 100CNY from A to B, and transaction 2 is a transfer of 100CNY from B to C. Then transaction 2 must be executed after transaction 1 is executed, that is, transaction 1 is a pre-transaction of transaction 2, and in this case, it is believed that there is a dependency relationship between transaction 1 and transaction 2. It is obvious that the association relationship may also refer to other relationships between transaction information, which is not specifically limited in the present embodiment. In the following examples, the dependency relationship between transaction information is taken as an example for description.
In the present embodiment, when grouping, according to the association relationship among the transaction information, multiple pieces of transaction information in the transaction information set, transaction information having an association relationship is divided into one group, and transaction information having no association relationship can be divide into different groups.
In the present embodiment, the number M of transaction information groups divided for each transaction information set is not specifically limited. The number of transaction information groups divided for different transaction information sets may be the same, and may also be different.
S403: performing consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set.
The specific implementation of S403 in the present embodiment is similar to S202 in the embodiment shown in
S404: for an i-th transaction information set in the N transaction information sets, determining, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to the i-th transaction information set; and if the second consensus result corresponding to the i-th transaction information set is a success, then executing the transaction information in the M transaction information groups corresponding to the i-th transaction information set in parallel. Said i takes 1, 2, . . . , N-1 and N in sequence.
In the present embodiment, the process of determining the second consensus result of the i-th transaction information set is similar to that of the embodiment shown in
It is understandable that in the present embodiment, each transaction information set is divided to obtain M transaction information groups, and after the above-mentioned grouping, since transaction information having an association relationship is located in a same transaction information group and transaction information among different transaction information groups does not have an association relationship, executing transactions for multiple transaction information groups in parallel can ensure the accuracy of execution results. Exemplarily, the consensus node can adopt multiple independent modules or threads to execute transactions on M transaction information groups in parallel, and thereby write the transaction information in the M transaction information groups into a block. Among them, the transaction information in the M transaction information groups can be written into a same block, and may also be written into different blocks, which can be specifically determined according to blocking rules of different blockchain networks.
It should be noted that execution processes for transaction information in each transaction information group is similar to that of the prior art, that is, for each transaction information group, transaction information thereof can be executed in sequence in a serial manner, to ensure accuracy of transaction execution results.
In the present embodiment, not only a parallel consensus on N transaction information sets is realized in a consensus phase, which increases consensus efficiency, but also a parallel execution of M transaction information groups in each transaction information set is realized in a transaction execution phase, which increases transaction execution efficiency, thereby further improves an overall performance of a blockchain network.
The process of grouping multiple pieces of transaction information in each transaction information set in S402 is described in detail below in conjunction with a specific embodiment.
As shown in
S501: obtaining a transaction identifier of the j-th piece of transaction information in a transaction information set and a pre-transaction identifier corresponding to the transaction identifier.
Each transaction information includes: a transaction identifier and a pre-transaction identifier corresponding to the transaction identifier. Among them, the pre-transaction refers to a transaction that must be carried out before the present transaction. The pre-transaction can also be referred to as dependency transaction.
The transaction identifier in the present embodiment refers to any identifier that can uniquely indicate the present transaction. For example, an output of an unspent transaction output (UTXO) model can be used as a transaction identifier, and keys of other specified rules can also be used as transaction identifiers.
S502: judging whether a first transaction information group is existed in a created transaction information group, where the first transaction information group includes the pre-transaction identifier corresponding to the transaction identifier of j-th piece of transaction information. If yes, going to S503; if no, going to S504.
S503: adding the j-th piece of transaction information to the first transaction information group.
S504: adding the j-th piece of transaction information to a second transaction information group, where the second transaction information group is any one of the created transaction information group or a newly created transaction information group.
In the present embodiment, before grouping, an empty transaction information group can be created at first. Then, each piece of transaction information in a transaction information set is traversed to execute the above-mentioned S501 to S504. The pre-transaction identifier corresponding to the transaction identifier of the transaction information is obtained. The created transaction information group is traversed to judge whether the pre-transaction identifier is existed in each created transaction information group. If the pre-transaction identifier does not exist in all of the created transaction information groups, then the transaction information is added to any transaction information group of the created transaction information groups, or a new transaction information group is created and the transaction information is added to the new transaction information group. If the pre-transaction identifier is existed in one of the transaction information groups, then the transaction information is added to the transaction information group within which the pre-transaction identifier is located.
In practical applications, for most business scenes, there are no strict requirements for a blocking (packaging transactions into blocks) behavior (e.g., how many transactions are packed into one block, or transactions within how much time are packed into one block). Therefore, for the above-mentioned transaction grouping processes, the present embodiment does not specifically limit on how many transactions are divided into one group and how many groups are divided. In practical applications, the number of groups may be appropriately increased and the number of transactions in each group may be appropriately decreased according to practical situations, in this way, parallelism of each round of consensus is increased, and consensus efficiency is increased.
In a possible implementation, the consensus node can adopt a configuration strategy to configure a first threshold and a second threshold in advance. Among them, the first threshold is used to indicate the maximum number of transaction information groups, and the second threshold is used to indicate the maximum number of transaction information in each transaction information group. It is understandable that the specific values of the first threshold and the second threshold can be flexibly adjusted according to practical application scenes.
In a possible implementation, if the pre-transaction identifier corresponding to the transaction identifier of the current transaction information is not existed in all of the created transaction information groups, in S504, whether the number of the created transaction information groups being greater than or equal to the first threshold may be judged at first; if no, then it means that the number of the transaction information groups has not reached the maximum number of groups; and in order to increase parallelism, a new transaction information group can be created, and the transaction information can be added to the new transaction information group. If yes, then it means that the number of transaction information groups has reached the maximum number of groups, therefore, no new transaction information group is created, but a second transaction information group is determined in the created transaction information groups, and the transaction information is added to the second transaction information group. It is understandable that since the transaction information does not have a pre-transaction, that is, there is no association relationship between the transaction information and other transaction information, therefore, adding the transaction information to any transaction information group will not affect transaction execution results.
Furthermore, when determining the second transaction information group in the created transaction information groups, the second transaction information group may also be determined according to the amount of transaction information in each transaction information group. Exemplarily, the amount of transaction information existing in respective created transaction information group is obtained, candidate transaction information groups whose amount of existing transaction information being less than the second threshold are found out, and one of the candidate transaction information groups is selected as the second transaction information group. In this way, it can be ensured that the amount of transaction information in each transaction information group does not exceed the maximum threshold, and the amount of transaction information in each transaction information group can also be balanced as much as possible.
In accordance with the above-mentioned method, after traversing all the transaction information in the transaction information set, all the transaction information is divided into different transaction information groups. Exemplarily,
It should be noted that in the present embodiment, the number of transaction information groups divided for each transaction information set may be the same or different.
In the blockchain consensus method provided in the present embodiment, within a possible range, consensus on some single transactions are not performed, but transactions are grouped and consensus are performed in batches as much as possible. When a batch of transactions meets a consensus condition, these transactions are grouped, and transactions having a dependency relationship are grouped into one group, in this way, multiple groups are formed. Since there is no dependency relationship among groups, the consensus node can perform consensus on the multiple groups in parallel, which increases the consensus efficiency.
The blockchain consensus method provided in the present embodiment not only realizes a parallel consensus processing among different transaction information sets, but also realizes a parallel transaction execution processing for each transaction information set by grouping each transaction information set, which further improves an overall performance of a blockchain network.
The dividing module 801 is configured to divide transaction information in a transaction pool into N transaction information sets, where N is a natural number greater than 1;
the processing module 802 is configured to perform consensus on the N transaction information sets in parallel, to obtain a first consensus result corresponding to each transaction information set;
the processing module 802 is further configured to determine, according to a first consensus result corresponding to a first i transaction information set, a second consensus result corresponding to an i-th transaction information set, where i takes 1, 2, . . . , N-1 and N in sequence.
In a possible implementation, the processing module 802 is specifically configured to:
judge whether a first consensus result corresponding to the i-th transaction information set is a consensus success;
if yes, determine that the second consensus result corresponding to the i-th transaction information set is a consensus success when i is equal to 1; and determine a second consensus result corresponding to the (i−1)-th transaction information set as the second consensus result corresponding to the i-th transaction information set when i is greater than 1;
if no, determine that the second consensus result corresponding to the i-th transaction information set is a consensus failure.
In a possible implementation, the processing module 802 is further configured to:
judge whether the second consensus result corresponding to the i-th transaction information set is a consensus success;
if yes, execute transaction information in the i-th transaction information set.
In a possible implementation, the processing module 802 is further configured to: group, according to an association relationship among the transaction information in the i-th transaction information set, multiple pieces of transaction information in the i-th transaction information set, to obtain M transaction information groups corresponding to the i-th transaction information set, where transaction information having an association relationship is located in a same transaction information group, and M is a natural number greater than 1; and
execute the transaction information in the M transaction information groups corresponding to the i-th transaction information set in parallel.
In a possible implementation, the transaction information includes: a transaction identifier and a pre-transaction identifier; and the processing module 802 is specifically configured to:
judge whether a first transaction information group is existed in a created transaction information group, where the first transaction information group includes a pre-transaction identifier corresponding to a transaction identifier of a j-th piece of transaction information in the i-th transaction information set;
if yes, then add the j-th piece of transaction information to the first transaction information group;
if no, add the j-th piece of transaction information to a second transaction information group, where the second transaction information group is any one of the created transaction information group or a newly created transaction information group; j takes 1, 2, . . . , K in sequence, K is the number of transaction information included in the i-th transaction information set, and the transaction information in the i-th transaction information set is arranged in an ascending order of transaction time.
In a possible implementation, the processing module 802 is specifically configured to:
judge whether the number of the created transaction information group is greater than a first threshold;
if yes, then determine the second transaction information group in the created transaction information group, and add the j-th piece of transaction information to the second transaction information group;
if no, then create a new transaction information group, and add the j-th piece of transaction information to the new transaction information group, where the new transaction information group is the second transaction information group.
In a possible implementation, the processing module 802 is specifically configured to:
obtain an amount of transaction information existing in respective created transaction information group;
determine, according to the amount of the transaction information existing in respective created transaction information group, the second transaction information group in the created transaction information groups, where an amount of transaction information existing in the second transaction information group is less than a second threshold.
The blockchain consensus apparatus provided in the present embodiment can be used to execute technical solutions of any one of the above-mentioned method embodiments, implementation principles and technical effects thereof are similar, and will not be repeated herein.
In an implementation, the memory 902 may be independent, and may also be integrated with the processor 901.
When the memory 902 is a device independent of the processor 901, the consensus device 900 may also include: a bus 903 which is configured to connect the memory 902 and the processor 901.
The consensus device provided in the present embodiment can be used to execute the blockchain consensus method in any one of the above-mentioned method embodiments, implementation principles and technical effects thereof are similar, and will not be repeated here in the present embodiment.
An embodiment of the present application also provides a computer-readable storage medium including a computer program, and the computer program is configured to implement technical solutions in any one of the above-mentioned method embodiments.
An embodiment of the present application can also provide a computer program product which can be executed by a processor, technical solutions in any one of the above-mentioned method embodiments can be implemented when the computer program product is executed. Implementation principles and technical effects thereof are similar, and will not be repeated herein.
An embodiment of the present application also provides a chip, including a memory, a processor and a computer program, where the computer program is stored in the memory, and the processor runs the computer programs to execute technical solutions of any one of the above-mentioned method embodiments. Implementation principles and technical effects thereof are similar, and will not be repeated herein.
In several embodiments provided in the present application, it should be understood that the disclosed device and method may be implemented in other ways. For example, the device embodiments described above are merely illustrative, for example, a division of modules is merely a logical functional division, and there may be other division manners in practical implementations, for example, multiple modules may be combined, or may be integrated to another system, or some features may be ignored, or not be executed. In addition, the displayed or discussed mutual couplings or direct couplings or communicating connections may be indirect couplings or communicating connections through some interfaces, apparatuses or modules, and may be in electrical, mechanical or other forms.
Modules described as separate components may or may not be physically separated, and components displayed as modules may or may not be physical units, that is, they may be located in one place, or they may be distributed over multiple network units. Some or all of the modules may be selected according to practical needs to achieve objectives of solutions of the present embodiments.
In addition, each functional module in various embodiments of the present application may be integrated into one processing unit, each module may also exist alone physically, and two or more modules may also be integrated into one unit. Units formed by the above-mentioned modules may be implemented in a form of hardware, or in a form of a hardware plus software functional unit.
The above-mentioned integrated module implemented in a form of a software functional module may be stored in a computer readable storage medium. The above software functional module is stored in a storage medium, and includes several instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor to execute part steps of the methods of various embodiments of the present application.
It should be understood that the above processor may be a central processing unit (CPU), and may also be other general-purpose processors, digital signal processors (DSP), and application specific integrated circuits (ASIC), etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. Steps of methods disclosed in conjunction with the present application may be directly embodied as to be executed by a hardware processor, or executed by a combination of hardware and software modules in a processor.
The memory may include a high-speed RAM memory, and may also include a non-volatile storage NVM, for example at least one magnetic disk storage, and may also be a USB disk, a mobile hard disk, a read-only memory, a magnetic disk, or an optical disk, etc.
The bus may be an industry standard architecture (ISA) bus, a peripheral component interconnect (PCI) bus, or an extended industry standard architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, the bus in drawings of the present application is not limited to merely one bus or one type of bus.
The above storage medium may be realized by any type of volatile or non-volatile storage device or combination thereof, such as a static random access memory (SRAM), an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a programmable read-only memory (PROM), a read-only memory (ROM), a magnetic memory, a flash memory, a magnetic disk or an optical disk. The storage medium may be any available medium that may be accessed by a general-purpose or special-purpose computer.
An exemplary storage medium is coupled to a processor, so that the processor may read information from the storage medium and write information to the storage medium. It is obvious that the storage medium may also be an integral part of a processor. The processor and the storage medium may be located in an application specific integrated circuit (ASIC). It is obvious that the processor and the storage medium may also exist as discrete components in an electronic device or a main control device.
A person of ordinary skill in the art may understand that all or part of the steps in the above-mentioned method embodiments may be implemented by program instruction relevant hardware. The foregoing program may be stored in a computer readable storage medium. When the program is executed, steps including the above-mentioned method embodiments are performed; while the foregoing storage medium includes: various medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk, etc.
Finally, it should be noted that the above various embodiments are merely used for illustrating technical solutions of the present application, and not for making limitation on them; although the present application has been described in detail with reference to the foregoing various embodiments, those of ordinary skill in the art should understand that: then may still make modifications to the technical solutions described in the foregoing embodiments, or make equivalently replacements on some or all of technical features thereof; while these modifications or replacements do not make essences of corresponding technical solutions deviate from scopes of the technical solutions of various embodiments of the present application.
| Number | Date | Country | Kind |
|---|---|---|---|
| 201910875855.1 | Sep 2019 | CN | national |
The present application is a national stage of International Application No. PCT/CN2020/082919, filed on Apr. 2, 2020, which claims priority to Chinese Patent Application No. 2019108758551, filed on Sep. 17, 2019, both of the aforementioned applications are incorporated herein by reference in their entireties.
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/CN2020/082919 | 4/2/2020 | WO |
