CN115098594A

CN115098594A - Method for executing transaction in block chain system, block chain system and node

Info

Publication number: CN115098594A
Application number: CN202210750970.8A
Authority: CN
Inventors: 王江
Original assignee: Ant Blockchain Technology Shanghai Co Ltd
Current assignee: Ant Blockchain Technology Shanghai Co Ltd
Priority date: 2022-06-29
Filing date: 2022-06-29
Publication date: 2022-09-23
Also published as: WO2024001024A1

Abstract

A method, a blockchain system and a node for performing transactions in a blockchain, the blockchain system comprising a master node and a slave node, the method comprising: the main node pre-executes a plurality of transactions to obtain a pre-executed read-write set of each transaction; grouping the multiple transactions according to the pre-execution read-write sets of the multiple transactions to obtain multiple transaction groups, and generating the pre-execution read-write sets of the transaction groups; sending the grouping result and the pre-execution read-write set of each transaction group to the slave node; the slave node verifies the grouping result according to the pre-execution read-write set of the transaction groups; and in the case of passing the verification, executing the multiple transactions in parallel according to the grouping result to obtain an execution read-write set of the transactions included in each transaction group, and verifying the pre-execution read-write set of the transaction group based on the execution read-write set of the transactions included in each transaction group.

Description

Method for executing transaction in block chain system, block chain system and node

Technical Field

The embodiments of the present disclosure relate to the field of blockchain technologies, and in particular, to a method for performing a transaction in a blockchain system, and a node.

Background

The Blockchain (Blockchain) is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. In the block chain system, data blocks are combined into a chain data structure in a sequential connection mode according to a time sequence, and a distributed account book which is not falsifiable and counterfeitable is ensured in a cryptographic mode. Because the blockchain has the characteristics of decentralization, information non-tampering, autonomy and the like, the blockchain is also paid more and more attention and is applied by people. When the block chain node executes a plurality of transactions in the block, the transaction execution speed can be increased by executing the transactions in parallel.

Disclosure of Invention

The invention aims to provide a scheme for executing transaction in a block chain, which can effectively verify whether a main node acts badly.

A first aspect of the specification provides a method of performing a transaction in a blockchain, the blockchain including a master node and a slave node, the method comprising:

the main node pre-executes a plurality of transactions to obtain a pre-executed read-write set of each transaction; grouping the multiple transactions according to the pre-execution read-write sets of the multiple transactions to obtain multiple transaction groups, and generating the pre-execution read-write sets of the transaction groups; sending the grouping result and the pre-execution read-write set of each transaction group to the slave node;

the slave node verifies the grouping result according to the pre-execution read-write set of the transaction groups; and in the case of passing the verification, executing the multiple transactions in parallel according to the grouping result to obtain an execution read-write set of the transactions included in each transaction group, and verifying the pre-execution read-write set of the transaction group based on the execution read-write set of the transactions included in each transaction group.

A second aspect of the specification provides a method of performing a transaction in a blockchain, the blockchain including a master node and a slave node, the method performed by the slave node, comprising:

receiving grouping results obtained by grouping a plurality of transactions and a pre-execution read-write set of each transaction group from the main node, wherein the pre-execution read-write set of the transaction group is generated based on the pre-execution read-write sets of the transactions included in the transaction group;

verifying grouping results according to the pre-execution read-write sets of the transaction groups;

in the case of passing the verification, executing the multiple transactions in parallel according to the grouping result to obtain an execution read-write set of the transactions included in each transaction group;

and verifying the pre-execution read-write set of each transaction group based on the execution read-write set of the transaction included in each transaction group.

A third aspect of the specification provides a slave node of a blockchain, comprising:

a receiving unit, configured to receive, from a master node of the block chain, a grouping result obtained by grouping a plurality of transactions and a pre-execution read-write set of each transaction group, where the pre-execution read-write set of the transaction group is generated based on the pre-execution read-write sets of the transactions included in the transaction group;

the verification unit is used for verifying the grouping result according to the pre-execution read-write sets of the transaction groups;

the execution unit is used for executing the plurality of transactions in parallel according to the grouping result under the condition that the verification is passed, and obtaining an execution read-write set of the transactions included in each transaction group;

the verification unit is further used for verifying the pre-execution read-write set of the transaction group based on the execution read-write set of the transaction included in each transaction group.

A fourth aspect of the present specification provides a blockchain comprising a master node and a slave node,

the master node is configured to: pre-executing a plurality of transactions to obtain a pre-executed read-write set of each transaction; grouping the multiple transactions according to the pre-execution read-write sets of the multiple transactions to obtain multiple transaction groups, and generating the pre-execution read-write sets of the transaction groups; sending the grouping result and the pre-execution read-write set of each transaction group to a slave node;

the slave node is configured to: verifying grouping results according to the pre-execution read-write sets of the transaction groups; and in the case of passing the verification, executing the multiple transactions in parallel according to the grouping result to obtain an execution read-write set of the transactions included in each transaction group, and verifying the pre-execution read-write set of the transaction group based on the execution read-write set of the transactions included in each transaction group.

A fifth aspect of the present specification provides a computer-readable storage medium having stored thereon a computer program which, when executed in a computer, causes the computer to perform the method of the second aspect.

A sixth aspect of the present specification provides a computing device comprising a memory having stored therein executable code and a processor that, when executing the executable code, implements the method of the second aspect.

Through the scheme provided by the embodiment of the specification, the slave node can quickly verify whether the master node is malicious or not, optimize existing time-consuming steps as much as possible, and ensure that the correctness and consistency of the block chain data can be maintained even in the case that the master node is malicious.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments described in the present disclosure, and it is obvious for a person skilled in the art to obtain other drawings based on these drawings without inventive labor.

FIG. 1 is a block chain architecture diagram in an embodiment of the present description;

FIG. 2 is a block chain structure diagram in an embodiment of the present disclosure;

FIG. 3 is a flow diagram of a method of performing a transaction in an embodiment of the present description;

fig. 4 is an architecture diagram of a slave node of a blockchain in an embodiment of the present specification.

Detailed Description

In order to make those skilled in the art better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification without any inventive step should fall within the scope of protection of the present specification.

Fig. 1 shows a block chain architecture diagram in an embodiment of the present specification. As shown in fig. 1, the block chain includes, for example, 6 nodes including a master node 1, a slave node 2, and a slave node 5. The lines between the nodes schematically represent P2P (Peer-to-Peer) connections. All the nodes store the full account book, namely the states of all the blocks and all the accounts. Wherein each node in the blockchain generates the same state in the blockchain by performing the same transaction, each node in the blockchain storing the same state database. In contrast, the master node 1 may be responsible for receiving transactions from clients and initiating consensus proposals to the respective slave nodes, including information such as the number of transactions in the block to be blocked (e.g., block B1) and the order of submission of the respective transactions. After the node in the blockchain successfully agrees on the consensus proposal, the nodes may perform the transactions according to the order of submission in the consensus proposal, thereby generating block B1.

It is to be appreciated that the blockchain shown in fig. 1 is merely exemplary, and that embodiments of the specification are not limited to application to the blockchain shown in fig. 1, and may also be applied to, for example, a blockchain system that includes shards.

In addition, although fig. 1 shows that the blockchain includes 6 nodes, the embodiments of the present specification are not limited thereto, and may include other numbers of nodes. Specifically, the nodes included in the block chain can meet the Byzantine Fault Tolerance (BFT) requirement. The byzantine fault tolerance requirement can be understood as that byzantine nodes can exist in a block chain, and the block chain does not show the byzantine behavior to the outside. Generally, some Byzantine Fault tolerance algorithms require the number of nodes to be greater than 3f +1, where f is the number of Byzantine nodes, such as the practical Byzantine Fault tolerance algorithm pbft (practical Byzantine Fault tolerance).

In the related art, in order to increase a per second execution Transaction (TPS) index in a blockchain, it is necessary to increase the execution speed of a transaction. For this reason, the execution speed of the transaction can be increased by executing the transaction in parallel in the blockchain node. In one embodiment, the blockchain nodes may execute transactions in parallel by multiple processes in a single machine, and in another embodiment, the blockchain nodes may be deployed in a server cluster and execute transactions in parallel by multiple servers. Generally, for transfer transactions, the block link point first divides a plurality of transactions into a plurality of transaction groups according to accounts to which the transactions are accessed, and the same account is not accessed between the respective transaction groups, so that the respective transaction groups can be executed in parallel. However, when a smart contract is invoked in a transaction, the variables accessed in the transaction cannot be predicted prior to execution of the transaction, and thus multiple transactions cannot be efficiently grouped, i.e., transactions cannot be executed in parallel.

In a related technique, in a blockchain including a master node and a plurality of slave nodes, a plurality of transactions may be pre-executed by the master node, a pre-executed read-write set for each of the plurality of transactions is obtained, and the plurality of transactions are divided into a plurality of groups according to the pre-executed read-write set, so that each of the slave nodes may execute the plurality of transactions in parallel according to the plurality of groups. However, in this scheme, there may be situations where the master node intentionally acts badly, such as providing the slave node with an erroneous packet.

Embodiments of the present disclosure provide a scheme for executing transactions in parallel in a blockchain as shown in fig. 1, which can effectively check whether a master node is malicious or not by a slave node, thereby improving system efficiency of the blockchain.

Fig. 2 shows a structure diagram of a master node 1 and a slave node (e.g., slave node 2) of a block chain provided in an embodiment of the present specification. As shown in fig. 2, the master node 1 includes a pre-execution module 11, a collision detection module 12, and a consensus module 13, and the slave node 2 includes a consensus module 22 and a calculation module 23. The master node 1 may for example be connected to a client so that a plurality of transactions may be received from the client. After receiving each transaction, the host node 1 pre-executes the transaction by the pre-execution module 11, resulting in a pre-executed read-write set for the transaction. The pre-execution read-write set includes a pre-execution read set and a pre-execution write set, where the pre-execution read set may specifically be a key-value pair of a read variable generated in the process of pre-execution transaction, and the pre-execution write set may specifically be a key-value pair of a write variable generated in the process of pre-execution transaction. A pre-execution state set may be maintained in the master node 1, and the pre-execution module 11 may read the state values of the variables from the pre-execution state set or the state database when pre-executing the transaction. The pre-execution module 11 may update the pre-execution state set according to the pre-execution read-write set of the transaction after pre-executing the transaction.

As shown in fig. 2, the pre-execution module 11 may include a plurality of pre-execution sub-modules, such as a pre-execution sub-module 111 and a pre-execution sub-module 112, which may pre-execute the transaction in parallel. The conflict detection module 12 comprises a set of pre-execution states and a set of pre-execution transactions, wherein the master node 1 stores the set of pre-execution states and the set of pre-execution transactions, for example, in a memory, for use by the conflict detection module 12. The conflict detection module 12 performs pre-execution conflict detection on each transaction serially. Specifically, the conflict detection module 12 detects whether a conflict exists between the pre-execution read set of the transaction and the write set of the transaction that has been pre-executed, and may determine that a conflict exists if the value of a variable in the pre-execution read set of the transaction is different from the value of the variable in the pre-execution state set. If it is determined that there is no conflict, the conflict detection module 12 updates the state in the pre-execution write set of the transaction to the pre-execution state set and arranges the transaction in order into the pre-execution transaction set.

The consensus module 13 obtains a plurality of transactions recorded in sequence from the pre-execution transaction set, the consensus module 13 includes a grouping submodule 131, the grouping submodule 131 groups the plurality of transactions according to the respective pre-execution read-write sets of the plurality of transactions to obtain a plurality of transaction groups, and no conflict transaction exists between the transaction groups. Among these situations, the situation where there is a conflict transaction between two transaction groups generally includes the following situations: transactions in the first transaction group read the first variable (i.e., the first transaction group reads the first variable), and transactions in the second transaction group write the first variable; the first transaction group writes a first variable, and the second transaction group writes the first variable; the first transaction group reads and writes the first variable, and the second transaction group writes the first variable; the first transaction group reads and writes the first variable, and the second transaction group reads and writes the first variable. Wherein a conflict transaction may also be considered to not exist if two transaction groups read the same variable. Generally, to simplify the scheme, the grouping sub-module 131 may group multiple transactions as required by not having access to the same variables between the various transaction groups.

In addition, the consensus module 13 further generates a pre-execution read-write set of each transaction group according to the pre-execution read-write sets of the multiple transactions. Thereafter, the master node 1 initiates a consensus proposal to a consensus module (e.g., the consensus module 22) of each slave node, wherein the consensus proposal includes the plurality of transactions, the ranking of the plurality of transactions in the set of pre-executed transactions, the grouping result of the plurality of transactions, and the set of pre-executed reads and writes of each transaction group. It will be appreciated that the master node may also broadcast the plurality of transactions to the slave nodes, and thus the plurality of transactions may not be included in the consensus proposal.

After the multiple consensus nodes in the blockchain are successfully identified, the group verification sub-module 221 in the consensus module 22 may verify whether a conflict exists between the groups according to the group read-write sets of the groups, that is, whether the same variable or account is accessed between the groups.

In the case where the verification of the group verification sub-module 221 passes, the calculation module 23 in the slave node may execute the plurality of transactions in parallel by group start. The calculation module 23 of the slave node 2 includes a plurality of execution submodules (the execution submodule 232, the execution submodule 233, and the execution submodule 234 are schematically illustrated in the figure). Each execution submodule may verify correctness of the packet based on the resulting set of executed reads and writes for the transaction during execution of the transaction.

Through the process, the master node 1 sends the pre-execution read-write set of each transaction group to each slave node, and the slave node can effectively verify whether the master node is malicious or not, so that the system efficiency is improved.

The above process will be described in detail below with reference to a flow chart of a method of performing a transaction as shown in fig. 3. In fig. 3, only the flow performed by the master node 1 and the slave node 2 is shown, and it is understood that the other slave nodes in the blockchain perform the same flow as the slave node 2.

Referring to fig. 3, first, in step S301, the master node 1 pre-executes a plurality of transactions, resulting in pre-executed read-write sets for the respective transactions.

The master node 1 may pre-execute a transaction immediately after each receipt of the transaction.

In one embodiment, the master node 1 may serially execute the received plurality of transactions. When a transaction is to be pre-executed, when a value of any variable is read from the pre-execution state set or the state database in fig. 2, the host node 1 records the key-value pair of the read variable in a read cache of the transaction set in the memory, when a value of any variable is written, records the key-value pair of the written variable in a write cache of the transaction, and after the pre-execution is finished, can obtain the pre-execution read-write set of the transaction based on the read cache and the write cache of the transaction.

Specifically, when the master node 1 reads a variable (for example, variable a) in the process of pre-executing the transaction, the master node 1 first determines whether a value of the variable a is stored in a write cache of the transaction, and if the value of the variable a is stored, the value of the variable a may be directly read from the write cache. In the event that it is determined that the value of variable a is not stored in the write cache, it is determined whether the value of variable a is stored in the read cache for the transaction, and if so, the value of variable a may be read from the read cache. In the case where it is determined that the value of the variable a is not stored in the read cache, it is determined whether the value of the variable a is stored in the pre-execution state set, and if the value of the variable a is stored, the value of the variable a may be read from the pre-execution state set. In the event that it is determined that the value of variable a is not stored in the pre-execution state set, the value of variable a may be read from the state database. That is, the master node 1 reads the variable with the priority of: write cache for transaction > read cache for transaction > set of pre-execution states > state database, by which the value of the variable read during pre-execution is guaranteed to be the latest value of the variable.

The master node 1 gets the pre-executed read-write set of the respective transaction after pre-executing each transaction as described above. In one embodiment, the set of pre-executed reads and writes includes a read set and a write set, wherein the read set includes key-value pairs (key-values) of variables read when the transaction is pre-executed, and the write set includes key-value pairs of variables written when the transaction is pre-executed. In another embodiment, the read set of the pre-execution read-write set may include version numbers of variables read when the transaction is pre-executed, and the write set may include version numbers of variables written therein, where, for example, each written value of a variable and a version number corresponding to each written value are stored in the state database, so that the values read and written by the transaction may be determined by including the version numbers of the variables in the read-write set.

In the case of a contract invoked in a transaction, it is possible for a block link point to write a different variable depending on the value of the variable read during execution of the contract invoked for the transaction. For example, when the value of the read variable is 1, 10 is written to the variable a, when the value of the read variable is 2, 20 is written to the variable b, and so on. Thus, for a transaction that invokes a contract, the block link points must execute the transaction to determine the variables read and written for the transaction, and thus the read and write sets for the transaction. To this end, the master node 1 obtains a set of pre-executed reads for each transaction by pre-executing each transaction of a plurality of transactions, the pre-executed process being substantially the same as the process of executing the transaction, except that the pre-execution of the transaction is an execution process performed before consensus and the execution of the transaction is an execution process performed after consensus. And the pre-execution result of the pre-execution transaction is used only to update the set of pre-execution states and not to update the world state, and the execution result of the execution transaction is used to update the world state.

In one embodiment, referring to fig. 2, the master node 1 may pre-execute in parallel a plurality of transactions received simultaneously by a plurality of pre-execution sub-modules. In order to prevent the conflict caused by the plurality of pre-execution sub-modules updating the pre-execution state set in parallel, the master node 1 performs pre-execution conflict detection on each transaction serially after pre-executing each transaction.

Specifically, the master node 1 first determines whether a variable (e.g., variable a) in the pre-execution read set of the transaction Tx1 is included in the pre-execution state set when pre-execution conflict detection is performed for the transaction Tx1 in the plurality of transactions. If not, it is similarly determined whether other variables in the pre-execution read set of transaction Tx1 are included in the pre-execution state set. If all of the variables in the pre-execution read set of the transaction Tx1 are not included in the pre-execution state set, i.e., the transaction that has been previously pre-execution conflict detected has not read or written a variable accessed by the transaction, then it may be determined that the pre-execution read set of the transaction Tx1 does not conflict with the pre-execution state set, i.e., it is determined that the pre-execution of the transaction Tx1 does not conflict with the transaction that has been previously pre-execution conflict detected.

If the main node 1 determines that the value of the variable A is included in the pre-execution state set, whether the value of the variable A in the pre-execution read set is consistent with the value of the variable A in the pre-execution state set is determined, and if so, the value of the variable A read by the transaction is the latest state of the variable A in the pre-execution process. After the master node 1 determines that the read value is the most recent state in the pre-execution process for each variable in the transaction Tx1 pre-execution read set, it may be determined that there is no conflict between the pre-execution read set and the pre-execution state set for the transaction Tx 1.

If the master node 1 determines that the value of the variable a in the pre-execution read set of the transaction Tx1 does not match the value of the variable a in the pre-execution state set, it indicates that the value of the variable a read by the transaction Tx1 is not the most recent state in the pre-execution process, and therefore, it may be determined that the pre-execution read set of the transaction Tx1 conflicts with the pre-execution state set. In the event that a conflict is determined to exist, the master node 1 may re-pre-execute the transaction Tx 1.

And the main node 1 updates the pre-execution state set and the pre-execution transaction set based on the pre-execution read-write set of the transaction when determining that the pre-execution read set of the transaction does not conflict with the pre-execution state set.

Specifically, for example, the master node 1 determines that there is no conflict between the pre-execution read set of the transaction Tx2 in the multiple transactions and the pre-execution state set, and the master node 1 updates the values of the variables read or written in the pre-execution read-write set of the transaction Tx2 to the pre-execution state set, so that the latest state of each variable in the pre-execution process is recorded in the pre-execution state set. Meanwhile, the master node 1 records the transaction sequence into the pre-execution transaction set, for example, records the transaction to the end position (i.e., the last position) of the pre-execution transaction set. That is, the order in which the transactions recorded in the set of pre-executed transactions represent the order of conflict detection for the individual transactions, and the individual transactions recorded do not conflict with previously recorded transactions. Wherein the set of pre-executed transactions is, for example, in the form of a sequence table or in the form of a queue.

In step S303, the master node 1 groups the multiple transactions according to the pre-execution read-write sets of the multiple transactions.

The master node 1 may group the transactions by the grouping submodule 131 based on the key (key) of the read variable and the key of the written variable included in the pre-execution read-write set of each transaction. As described above, the grouping may be such that transactions in different transaction groups do not access the same variable, including read and write operations, and in the event that the grouping condition is met, there will be no conflicting transactions between the transaction groups, and thus the transaction groups may be executed in parallel.

In step S305, the master node 1 generates a pre-execution read-write set for each transaction group.

The grouping submodule 131 may also generate a set of pre-executed reads for each transaction group based on the set of pre-executed reads for each transaction included in each transaction group. In particular, the grouping submodule 131 may generate a pre-execution reading set for a transaction group based on the pre-execution reading set for each transaction, the pre-execution reading set including keys (keys) for variables read for all transactions in the transaction group. For example, a transaction group includes transaction Tx1, transaction Tx2, and transaction Tx3, where the pre-execution reading set of transaction Tx1 includes key-value pairs of variable a and variable b, the pre-execution reading set of transaction Tx2 includes key-value pairs of variable c and variable b, and the pre-execution reading set of transaction Tx3 includes key-value pairs of variable a and variable c, and then the pre-execution reading set of the transaction group is { a, b, c }.

The grouping submodule 131 may generate a pre-execution write set for the transaction group based on a pre-execution write set for each transaction, similar to the pre-execution read set for the transaction group described above, which includes keys for variables written for all transactions in the transaction group.

After the host node 1 completes the pre-execution of the multiple transactions, since the above-mentioned consensus process makes the pre-execution read-write set of the transactions consistent with the execution read-write set, as described above, the host node 1 may directly use the pre-execution results of the multiple transactions as the execution results of the transactions. And updating the state database according to the pre-execution read-write sets of the transactions, and generating a block. The block includes a block head and a block body. The block body includes, for example, data such as a transaction body and a receipt of each of the plurality of transactions. The block header may include data such as a status root, a receipt root, a transaction root, etc.

In step S307, the master node 1 transmits grouping results of the multiple transactions, the pre-execution read-write sets of the respective transaction groups, and the arrangement order of the multiple transactions in the pre-execution transaction sets to the slave nodes (including the slave node 2).

Specifically, the master node 1 may generate a consensus proposal, which may include grouping results of a plurality of transactions, a pre-execution read-write set of each transaction group, an arrangement order of the plurality of transactions in the pre-execution transaction set, and send the consensus proposal to each slave node, so as to agree with each slave node, that is, the plurality of transactions are taken as a plurality of transactions in a block to be generated, and the plurality of transactions are executed based on the arrangement order of the plurality of transactions in the pre-execution transaction set. Wherein the slave node may additionally receive the plurality of transactions from the master node or the client, or the plurality of transactions may be included in the consensus proposal.

By doing so, the host node 1 eliminates conflicts between transactions when performing pre-execution, and each node performs each transaction in the order of arrangement in the pre-execution transaction set when performing transactions, so that the read-write set resulting from performing transactions in the case where the host node does not do harm is necessarily consistent with the pre-execution read-write set of the transaction.

In step S309, the slave node verifies the grouping result according to the pre-execution read-write sets of the respective transaction groups.

Specifically, the slave node 2 may determine whether each of the packets accesses the same variable according to the pre-execution read-write set of each of the transaction groups, and if the same variable is accessed between at least two of the plurality of packets, it indicates that the at least two packets should be classified into one transaction group, so that it may be determined that the grouping result is incorrect, and thus it may be determined that there is malicious behavior in the master node, i.e., the incorrect packet is provided, and therefore the verification fails, the slave node 2 may perform step S315, perform the plurality of transactions in series according to the order in the consensus proposition, i.e., each slave node no longer trusts the grouping result of the master node, but perform the plurality of transactions in series to achieve a consistent execution result.

In the case where the verification in step S309 is passed, the slave node 2 performs step S311, and during the execution of each transaction, verifies the pre-execution read-write set of the group according to the execution read-write set of the transaction.

The slave node 2 may execute the plurality of transactions in parallel by the plurality of execution sub-modules shown in fig. 2 after the validation of the grouping result is passed, for example, each execution sub-module may receive one or more transaction groups from the consensus module 22 to execute the plurality of transactions in each transaction group in series. The execution submodule generates an execution reading set and an execution writing set of each transaction in the process of executing each transaction, wherein the execution reading set comprises key value pairs of variables read in the process of executing the transaction, and the execution writing set comprises key value pairs of variables written in the process of executing the transaction.

The execution submodule may determine whether a variable is included in a pre-execution reading set of a transaction group to which the transaction belongs, each time the variable is read, in the middle of performing the transaction, that is, when the execution of the transaction is not finished, so as to verify the pre-execution reading set of the transaction group. If the variable is not included in the pre-execution reading set of the transaction group, it indicates that the master node provides an incorrect pre-execution reading set, and therefore the grouping result obtained by grouping based on the pre-execution reading set is also an incorrect result, and therefore, the slave node 2 may similarly perform step S315 if the verification in step S311 is not passed. Conversely, if all variables written by a transaction during execution appear in the pre-execution write set of the transaction group, execution of other transactions in the group may proceed.

Similarly, the execution sub-module may also verify the pre-execution write set of the transaction group during the process of executing the transaction, and similarly, may verify whether the variable written during the process of executing the transaction appears in the pre-execution write set of the transaction group, and if not, the verification in step S311 fails, and the slave node may perform step S315. Conversely, if all variables written by a transaction during execution appear in the pre-execution write set of the transaction group, execution of other transactions in the group may proceed.

Upon the verification in step S311 being passed, the slave node may proceed to perform step S313 in fig. 3.

In step S313, the slave node verifies the executing read-write set of the group according to the executing read-write set of the transaction group.

After the slave node 2 executes a plurality of transactions in parallel, the execution read-write set of each transaction group may be generated according to the execution read-write set of the transactions included in each group, and this process may refer to the description of the pre-execution read-write set for generating the transaction group in the foregoing, and is not described herein again.

Then, the slave node 2 may verify whether the execution read-write set of each transaction group is consistent with the pre-execution read-write set of the transaction group, specifically, whether the execution read set of each transaction group is consistent with the pre-execution read set of the transaction group, and whether the execution write set of each transaction group is consistent with the pre-execution write set of the transaction group. If they match, the slave node 2 may update the world state based on the execution results of the plurality of transactions, generating a block, if the verification passes. If the executing read-write set of each transaction group is not consistent with the pre-executing read-write set of the transaction group, the slave node 2 may perform step S315.

After each slave node completes step S315 without passing the verification, it may trigger re-election of the master node, so as to avoid the current master node again doing malicious work.

Fig. 4 is an architecture diagram of a slave node of a blockchain in an embodiment of the present specification, including:

a receiving unit 41, configured to receive, from a master node of the block chain, a grouping result obtained by grouping a plurality of transactions and a pre-execution read-write set of each transaction group, where the pre-execution read-write set of the transaction group is generated based on the pre-execution read-write sets of each transaction included in the transaction group;

the verification unit 42 is used for verifying the grouping result according to the pre-execution read-write set of the transaction groups;

an execution unit 43, configured to execute the multiple transactions in parallel according to the grouping result in the case that the verification passes, so as to obtain an execution read-write set of the transactions included in each transaction group;

the verification unit 42 is further configured to verify the pre-execution read-write set of the transaction group based on the execution read-write set of the transaction included in each transaction group.

In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD) (e.g., a Field Programmable Gate Array (FPGA)) is an integrated circuit whose Logic functions are determined by a user programming the Device. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.

The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium that stores computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and embedded microcontrollers, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.

The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a server system. Of course, this application does not exclude that with future developments in computer technology, the computer implementing the functionality of the above described embodiments may be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device or a combination of any of these devices.

Although one or more embodiments of the present description provide method operation steps as described in the embodiments or flowcharts, more or fewer operation steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or end product executes, it may execute sequentially or in parallel (e.g., parallel processors or multi-threaded environments, or even distributed data processing environments) according to the method shown in the embodiment or the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded. For example, the use of the terms first, second, etc. are used to denote names, but not to denote any particular order.

For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, when implementing one or more of the present description, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of multiple sub-modules or sub-units, etc. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory. The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage, graphene storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

As will be appreciated by one skilled in the art, one or more embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, one or more embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, one or more embodiments of the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.

One or more embodiments of the present description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. One or more embodiments of the present specification can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description of the specification, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the specification. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction. The above description is merely exemplary of one or more embodiments of the present disclosure and is not intended to limit the scope of one or more embodiments of the present disclosure. Various modifications and alterations to one or more embodiments described herein will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement or the like made within the spirit and principle of the present specification should be included in the scope of the claims.

Claims

1. A method of performing transactions in a blockchain system, the blockchain system including a master node and a slave node, the method comprising:

the main node pre-executes a plurality of transactions to obtain a pre-executed read-write set of each transaction; grouping the multiple transactions according to the pre-execution read-write sets of the multiple transactions to obtain multiple transaction groups, and generating the pre-execution read-write sets of the transaction groups; sending the grouping result and the pre-execution read-write set of each transaction group to a slave node;

2. The method of claim 1, the verifying the pre-execution readsets of transaction groups based on the execution readsets of transactions included by each transaction group comprising: during the execution of each transaction, the pre-execution readsets of the transaction group to which the transaction belongs are verified using the execution readsets of the transaction.

3. The method of claim 1 or 2, the verifying the pre-execution read-write set of the transaction group based on the execution read-write set of transactions included by each transaction group comprising: after the parallel execution of the multiple transactions is completed, an execution read-write set of each transaction group is generated according to the execution read-write sets of the transactions included in each transaction group, and the pre-execution read-write sets of each transaction group are verified based on the execution read-write sets of each transaction group.

4. The method of any of claims 1-3, the slave node verifying grouping results from the set of pre-executed reads and writes for the plurality of transaction groups comprising: and the slave node verifies whether the same variable is accessed between the transaction groups in the transaction groups according to the pre-execution read-write sets of the transaction groups.

5. The method of any of claims 1-3, the master node pre-executing a plurality of transactions comprising: the master node pre-executing the plurality of transactions based on a set of pre-execution states, the method further comprising: after pre-executing each transaction, the master node serially processes each transaction as follows: determining whether a pre-execution read set of the transaction conflicts with the pre-execution state set, wherein in the case that no conflict exists for a first transaction after pre-execution, the pre-execution state set is updated based on the pre-execution read set of the first transaction, and the first transaction sequence is recorded into a pre-execution transaction set; and determining the arrangement sequence of the transactions in each transaction group based on the arrangement sequence of the transactions in each transaction group in the pre-execution transaction set.

6. The method of claim 5, further comprising: the master node sends the arranging sequence of the plurality of transactions in the pre-execution transaction set to the slave node, and the slave node executes the plurality of transactions in series according to the arranging sequence of the plurality of transactions in the pre-execution transaction set under the condition that the verification is not passed.

7. The method of claim 5 or 6, wherein the master node pre-executing the plurality of transactions based on a set of pre-execution states comprises the master node determining whether a value of a first variable is stored in any of the set of pre-execution states when the master node reads the first variable in pre-executing any of the transactions, and reading the value of the first variable from a state database in the event that it is determined that the value of the first variable is not stored in the set of pre-execution states.

8. The method of claim 5 or 6, wherein the determining whether the set of pre-execution readings for the transaction conflict with the set of pre-execution state comprises determining whether a second variable in the set of pre-execution state is included, in the event that it is determined that the second variable is included in the set of pre-execution state, determining whether a value of the second variable in the set of pre-execution state matches a value of the second variable in the set of pre-execution state, and if not, determining that the set of pre-execution readings for the transaction conflict with the set of pre-execution state.

9. A method of performing a transaction in a blockchain system including a master node and a slave node, the method performed by the slave node comprising:

executing the plurality of transactions in parallel according to the grouping result under the condition that the verification is passed, and obtaining an execution read-write set of the transactions included in each transaction group;

10. The method of claim 9, the validating the set of pre-execution reads and writes for each transaction group based on the set of execution reads and writes for the transactions included in the transaction group comprising: during the execution of each transaction, the transaction's execution readsets are used to verify the pre-execution readsets of the transaction group to which the transaction belongs.

11. The method of claim 10, the validating the set of pre-execution reads and writes for each transaction group based on the set of execution reads and writes for the transactions included in the transaction group further comprising: after the parallel execution of the multiple transactions is completed, an execution write set of each transaction group is obtained according to the execution read-write sets of the transactions included in each transaction group, and the pre-execution write set of each transaction group is verified based on the execution write set of each transaction group.

12. The method of any of claims 9-11, the verifying grouping results from the set of pre-executed reads and writes for the plurality of transaction groups comprising: and verifying whether the same variable is accessed between the transaction groups in the transaction groups according to the pre-execution read-write sets of the transaction groups.

13. A slave node of a blockchain system, comprising:

a receiving unit, configured to receive, from a master node of the blockchain system, a grouping result obtained by grouping a plurality of transactions and a pre-execution read-write set of each transaction group, where the pre-execution read-write set of the transaction group is generated based on the pre-execution read-write sets of each transaction included in the transaction group;

14. A blockchain system includes a master node and a slave node,

15. A computer-readable storage medium, on which a computer program is stored which, when executed in a computer, causes the computer to carry out the method of any one of claims 9-12.

16. A block link point comprising a memory having stored therein executable code and a processor which, when executing the executable code, implements the method of any one of claims 9-12.