Abstract: Blockchain transaction execution methods, blockchain nodes, and systems are provided. In an example method, a first transaction is obtained, where the first transaction invokes a first contract, contract data of the first contract is stored in a blockchain, the contract data includes a first access information table, and the first access information table includes first storage location information of a first state variable requested to be read by the first contract; the first storage location information is read from the blockchain; and a value of the first state variable is read from the blockchain based on the first storage location information, to execute the first transaction.

Abstract: Disclosed are methods, apparatuses, and systems for grouping transactions in a blockchain. In an example method, a plurality of first transactions are obtained from a plurality of transactions that are to be grouped, where the plurality of first transactions invoke the same contract; a set of identifiers corresponding to one or more state variables of the contract that is to be accessed by each of the first transactions is determined, where the set of identifiers includes variable identifiers of the state variables during contract execution, and the variable identifiers are used to determine keys of the state variables in a state database; and the plurality of first transactions are grouped according to the set of identifiers of each of the first transactions.

Abstract: Disclosed are methods for processing resources in a blockchain, and blockchain nodes. In an implementation, a method includes: receiving a transaction, wherein the transaction invokes a contract to invoke a interface provided by a blockchain platform, execute the interface based on the transaction, determining whether a resource corresponding to a first storage key is stored in a contract state of the contract, and storing a first non-fungible token (NFT) resource in the contract state in association with the first storage key if the resource corresponding to the first storage key is not stored in the contract state of the contract.

Abstract: Methods for deploying a contract in a blockchain and blockchain nodes are provided. In an implementation, a method includes: receiving a first transaction for deploying a first contract, where the first transaction invokes a second contract. An incoming parameter for the second contract includes a code identifier of first code and the value of an immutable variable in the first code, the code identifier and the first code are pre-stored in the blockchain, the first code includes a first function for initialize a contract, and the second contract includes a call to the first function. Before executing the first function based on the call in the second contract, obtaining the first function in the first code based on the code identifier when determining that the second contract is a system contract, and storing state data of the first contract in the blockchain by executing the first function.

Abstract: Provided are blockchain transaction execution methods, apparatuses, computer-readable media and systems. An example method includes: receiving a first transaction, where the first transaction includes a first operation and a second operation, the first operation is used to call a first function in a first contract, and the second operation is used to call a second function in a second contract; and executing the first operation and the second operation.

Abstract: Implementations of the present disclosure include setting, by a first consensus node, a timer that runs out before a timeout of a view change; sending, to a second consensus node, a request for one or more consensus messages missing by the first consensus node in response to the timer running out; receiving, from the second consensus node, the one or more consensus messages each digitally signed by a private key of a corresponding consensus node that generates the respective one or more consensus messages; and determining that a block of transactions is valid, if a quantity of commit messages included in the received one or more consensus messages is greater than or equal to 2f+1, where f is a maximum number of faulty nodes that is tolerable by the blockchain based on practical Byzantine fault tolerance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for consensus system downtime recovery. One of the methods includes: obtaining a pre-prepare message from the primary node; multicasting a prepare message indicating an acceptance of the pre-prepare message to at least some of the primary node and the other (N?2) backup nodes; obtaining (Q?1) or more prepare messages respectively from (Q?1) or more of the backup nodes; storing the pre-prepare message and the (Q?1) or more prepare messages; multicasting a commit message to at least some of the primary node and the other backup nodes, the commit message indicating that the one backup node agrees to the (Q?1) or more prepare messages; and obtaining, respectively from Q or more nodes among the primary node and the backup nodes, Q or more commit messages each indicating that the corresponding node agrees to (Q?1) or more prepare messages.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain and performed by a first node of N nodes in a view change protocol. The method includes: multicasting a view change message to at least some of the N nodes; obtaining, respectively from at least Q second nodes of the N nodes, at least Q echo messages each comprising: a consistent current view known to the second node indicating a primary node designated among the N nodes, and a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q echo messages, ending the view change protocol.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for implementing blockchain-based private transactions are provided. One of the methods includes transmitting, at a first blockchain node of a number (N) of blockchain nodes that are involved in a private transaction, the private transaction to each of a plurality of second blockchain nodes of the N blockchain nodes, wherein N is at least four, at least (N?F) signatures certifying the private transaction respectively from at least (N?F) blockchain nodes of the first and second blockchain nodes, wherein F is a largest integer no more than (N?1)/2; and submitting, at the first blockchain node, a hash value of the private transaction in association with the at least (N?F) signatures to one or more blockchain nodes of a public blockchain for adding into the public blockchain.

Abstract: This disclosure relates to blockchain-based transaction processing. In one aspect, a method includes obtaining pieces of transaction data. At least a portion of the pieces of transaction data have a respective group identifier that identifies a node group for the piece of transaction data. Each node group includes multiple blockchain nodes. Pieces of transaction data that have a same first group identifier that identifies a first node group are identified in the obtained pieces of transaction data. The pieces of transaction data are packaged into a first packaging result based on the pieces of transaction data having the same first group identifier. The first packaging result is submitted to a blockchain for storage.

Abstract: Implementations of the present disclosure include setting, by a first consensus node, a timer that runs out before a timeout of a view change; sending, to a second consensus node, a request for one or more consensus messages missing by the first consensus node in response to the timer running out; receiving, from the second consensus node, the one or more consensus messages each digitally signed by a private key of a corresponding consensus node that generates the respective one or more consensus messages; and determining that a block of transactions is valid, if a quantity of commit messages included in the received one or more consensus messages is greater than or equal to 2f+1, where f is a maximum number of faulty nodes that is tolerable by the blockchain based on practical Byzantine fault tolerance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for implementing blockchain-based private transactions are provided. One of the methods includes transmitting, at a first blockchain node of a number (N) of blockchain nodes that are involved in a private transaction, the private transaction to each of a plurality of second blockchain nodes of the N blockchain nodes, wherein N is at least four, at least (N?F) signatures certifying the private transaction respectively from at least (N?F) blockchain nodes of the first and second blockchain nodes, wherein F is a largest integer no more than (N?1)/2; and submitting, at the first blockchain node, a hash value of the private transaction in association with the at least (N?F) signatures to one or more blockchain nodes of a public blockchain for adding into the public blockchain.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain maintained by a number (N) of nodes and performed by a first node of the N nodes that is in a view change protocol. The method includes: obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, wherein the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q first messages, ending the view change protocol.

Abstract: Implementations of the present disclosure include setting, by a first consensus node, a timer that runs out before a timeout of a view change; sending, to a second consensus node, a request for one or more consensus messages missing by the first consensus node in response to the timer running out; receiving, from the second consensus node, the one or more consensus messages each digitally signed by a private key of a corresponding consensus node that generates the respective one or more consensus messages; and determining that a block of transactions is valid, if a quantity of commit messages included in the received one or more consensus messages is greater than or equal to 2f+1, where f is a maximum number of faulty nodes that is tolerable by the blockchain based on practical Byzantine fault tolerance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for consensus system downtime recovery. One of the methods includes: multicasting a pre-prepare message to at least some of the backup nodes; obtaining (Q?1) or more prepare messages respectively from (Q?1) or more of the backup nodes, wherein the prepare messages each indicate an acceptance of the pre-prepare message by the corresponding backup node; storing the pre-prepare message and the (Q?1) or more prepare messages; multicasting a commit message to at least some of the backup nodes, the commit message indicating that the primary node agrees to the (Q?1) or more prepare messages; and obtaining, respectively from Q or more nodes among the primary node and the backup nodes, Q or more commit messages each indicating that the corresponding node agrees to (Q?1) or more prepare messages received by the corresponding node.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for consensus system downtime recovery. One of the methods includes: multicasting a pre-prepare message to at least some of the backup nodes; obtaining (Q-1) or more prepare messages respectively from (Q-1) or more of the backup nodes, wherein the prepare messages each indicate an acceptance of the pre-prepare message by the corresponding backup node; storing the pre-prepare message and the (Q-1) or more prepare messages; multicasting a commit message to at least some of the backup nodes, the commit message indicating that the primary node agrees to the (Q-1) or more prepare messages; and obtaining, respectively from Q or more nodes among the primary node and the backup nodes, Q or more commit messages each indicating that the corresponding node agrees to (Q-1) or more prepare messages received by the corresponding node.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for consensus system downtime recovery. One of the methods includes: obtaining a pre-prepare message from the primary node; multicasting a prepare message indicating an acceptance of the pre-prepare message to at least some of the primary node and the other (N?2) backup nodes; obtaining (Q?1) or more prepare messages respectively from (Q?1) or more of the backup nodes; storing the pre-prepare message and the (Q?1) or more prepare messages; multicasting a commit message to at least some of the primary node and the other backup nodes, the commit message indicating that the one backup node agrees to the (Q?1) or more prepare messages; and obtaining, respectively from Q or more nodes among the primary node and the backup nodes, Q or more commit messages each indicating that the corresponding node agrees to (Q?1) or more prepare messages.

Abstract: Implementations of the present disclosure include setting, by a first consensus node, a timer that runs out before a timeout of a view change; sending, to a second consensus node, a request for one or more consensus messages missing by the first consensus node in response to the timer running out; receiving, from the second consensus node, the one or more consensus messages each digitally signed by a private key of a corresponding consensus node that generates the respective one or more consensus messages; and determining that a block of transactions is valid, if a quantity of commit messages included in the received one or more consensus messages is greater than or equal to 2f+1, where f is a maximum number of faulty nodes that is tolerable by the blockchain based on practical Byzantine fault tolerance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain and performed by a first node of N nodes in a view change protocol. The method includes: multicasting a view change message to at least some of the N nodes; obtaining, respectively from at least Q second nodes of the N nodes, at least Q echo messages each comprising: a consistent current view known to the second node indicating a primary node designated among the N nodes, and a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q echo messages, ending the view change protocol.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for consensus system downtime recovery. One of the methods includes: multicasting a pre-prepare message to at least some of the backup nodes; obtaining (Q?1) or more prepare messages respectively from (Q?1) or more of the backup nodes, wherein the prepare messages each indicate an acceptance of the pre-prepare message by the corresponding backup node; storing the pre-prepare message and the (Q?1) or more prepare messages; multicasting a commit message to at least some of the backup nodes, the commit message indicating that the primary node agrees to the (Q?1) or more prepare messages; and obtaining, respectively from Q or more nodes among the primary node and the backup nodes, Q or more commit messages each indicating that the corresponding node agrees to (Q?1) or more prepare messages received by the corresponding node.