Blockchain data processing

By identifying the node sets that have recently created blocks to cooperate as verification node sets and performing distributed verification, the malicious node destruction and data integrity problems of transaction data processing in the blockchain network are solved, and the security and integrity of the blockchain are improved. .

CN118985118APending Publication Date: 2024-11-19THE BLOCKHOUSE TECHNOLOGY LIMITED
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380028784.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-03-23
Filing Date
2023-03-22
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

The existing blockchain network lacks an effective verification mechanism when processing transaction data, resulting in potential malicious node destruction and data integrity problems.

Method used

By identifying the node sets of recently created blocks as verification node sets, distributed verification is performed to ensure that candidate blocks meet a series of verification standards before being included in the blockchain, and using consensus mechanisms to select trusted arbitrators to improve network security.

Benefits of technology

It realizes more efficient and secure transaction data processing of the blockchain network, enhances the integrity and robustness of the blockchain, and reduces the possibility of malicious behavior.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118985118A_ABST
    Figure CN118985118A_ABST
Patent Text Reader

Abstract

A method of processing transaction data to incorporate it into a blockchain (3) comprises creating candidate blocks (6) of transaction data, determining a set of verification nodes (5) from a plurality of nodes (2a-2i) of a blockchain network (1), and sending the candidate blocks to each verification node (5) for verification. A verification node (5) is identified by identifying nodes (2a-2i) that each create a respective block (4a-4f) that has been incorporated into the block chain (3) within a predetermined period prior to creation of the candidate block (6).
Need to check novelty before this filing date? Find Prior Art

Description

Background of the Invention

[0002] The present invention relates to a transaction data processing method and device in a blockchain network.

[0003] A key feature of many blockchain networks is the lack of a central controller responsible for storing and maintaining the data on the blockchain. Instead, the blockchain is a decentralized distributed ledger, with multiple nodes in the blockchain network maintaining a copy of the blockchain. Block creator nodes create new candidate blocks to be included in the blockchain. Other block creator nodes receive and verify these candidate blocks, and once the candidate blocks are verified, they are included in their local copy of the blockchain.

[0004] Consensus mechanisms provide a way for nodes in a blockchain network to agree on whether a block should be included in the blockchain. They limit the potential for malicious nodes to damage the blockchain, for example, by attempting to reverse the blockchain to double-spend tokens. Common consensus mechanisms are based on Proof of Work (PoW) or Proof of Stake (PoS) and provide procedures for processing transaction data for inclusion in the blockchain, designed to dissuade or prevent malicious behavior by nodes.

[0005] However, the present invention aims to provide an improved method for efficiently processing transaction data for inclusion in a blockchain, thereby further improving the integrity of the blockchain. Summary of the invention

[0006] In a first aspect, the present invention provides a method for processing transaction data, for incorporating transaction data into a blockchain hosted by a blockchain network consisting of multiple nodes, the method comprising:

[0007] Create candidate blocks of transaction data;

[0008] Determining a set of validating nodes by identifying nodes in the blockchain network, each of which has created a corresponding block that has been included in the blockchain within a predetermined period before the candidate block is created; and

[0009] Send the candidate block to each verification node for verification.

[0010] Therefore, it can be understood that embodiments of the present invention provide a novel method for processing transaction data for inclusion in a blockchain, wherein a subset of block creation nodes, that is, all recently created blocks of the blockchain, are provided with subsequent candidate blocks for verification. These "verification" nodes can be considered more trustworthy than other nodes of the blockchain network (including other block creation nodes) because they have recently created (e.g., proof of work or proof of stake calculations) blocks that have been successfully included in the blockchain, indicating that they are interested in the blockchain in the near future and abide by the rules of the blockchain network. This makes it less likely that these nodes will collude to destroy the blockchain. Since the set of verification nodes is determined based on the recency of the node's block creation activity, the set of verification nodes can be considered to be the latest representation of trusted nodes in the blockchain network. This method can also draw on and benefit from the efforts made by traditional consensus protocols to select a representative and reasonably trustworthy set of nodes as block creators. These efforts can also be further supplemented by requiring that the blocks created by the nodes provide evidence that the verification criteria are met before they are included in the blockchain, that is, before considering the node to be included in the latest block creation node set. Entrusting the verification of blocks to a selected subset of block creation nodes is an effective way to ensure network security.

[0011] Therefore, blockchain networks configured to implement this approach can achieve a more efficient method of reaching consensus by fairly selecting a set of committed arbitrators (i.e., the closest block creator nodes). They can also provide a mechanism for determining when these arbitrators have made a credible decision; in most practical cases, this is almost always the case, so an efficient decision-making mechanism can be provided.

[0012] The plurality of nodes may include block creation nodes and optionally non-block creation nodes. For example, such non-block creation nodes may create transaction data and send it to block creation nodes for inclusion in the blockchain. Each block creation node may store a version of the blockchain in the node's memory, i.e., a local copy. The network may include block creation nodes that are not in the set of validating nodes, and typically will be.

[0013] In some embodiments, the blockchain is configured to store tokens. In some embodiments, the blockchain is configured to store smart contracts.

[0014] Preferably, the method comprises verifying that each node in the set of nodes receives a candidate block of transaction data. The transaction data may be related to a token transaction, a smart contract transaction, or both. Preferably, the candidate block is created from a pool of unverified transaction data.

[0015] The validating nodes may use a common protocol to determine the validity of each candidate block—for example, to decide whether it is good, bad, or undetermined. Preferably, the method includes each validating node validating a candidate block by determining whether the candidate block meets one or more validation criteria. Validation criteria may include that the block must be formatted correctly; and / or not contain double spending of tokens; and / or contain required endorsements; and / or provide evidence that the node that created the block had the authority to do so (e.g., related to winning a lottery). In a preferred embodiment, any or all of these criteria may be members of a set of primary validation criteria, as described in more detail below. Validation criteria may include that the block should meet one or more time deadlines; and / or contain certain non-critical information. In a preferred embodiment, any or all of these criteria may be members of a set of secondary criteria, as described in more detail below.

[0016] In some embodiments, each verification node is configured to communicate with at least one (preferably all) other verification nodes. Preferably, the method includes determining whether to include a candidate block in the blockchain. For a particular candidate block, this may include allowing the candidate block. The method may include determining whether to reject the candidate block from being included in the blockchain. For a particular candidate block, this may include rejecting the candidate block. Preferably, these decisions are made based on the decisions made by each verification node when verifying the candidate block. Although such a decision can be made by a central authority, it is preferably made in a distributed manner by a group of verification nodes. It can make a decision based on a consensus protocol, as described below.

[0017] Preferably, the method comprises, in response to determining that at least one node in the set of verification nodes determines that the candidate block does not meet the verification criteria, rejecting the candidate block.

[0018] A verification node can communicate with other verification nodes by outputting verification data. Preferably, the verification data can be read by each of the multiple verification nodes; preferably, any failure to meet the primary verification criteria can be proved based on the candidate block and its predecessor block. The verification data can be sent to each verification node (e.g., directly pushed); it can be sent by unicast, multicast, or broadcast. However, in some embodiments, at least some of the verification data output by the verification node is published to a data server (e.g., a bulletin board) hosted by the verification node. Some verification data may be sent to data servers hosted by other nodes in the network (e.g., other verification nodes). Preferably, one or each data server can be read by each verification node. One or each data server can be read by all multiple block creation nodes in the blockchain network, and optionally by some or all non-block creation nodes in the network.

[0019] Outputting some or all of the verification data to other verification nodes and / or data servers that are readable by other nodes in the network, allowing other nodes to determine and check each verification node's verification of the candidate block.

[0020] Preferably, the verification data indicates whether the verification node determines that the candidate block meets the verification criteria. Therefore, preferably, the method includes outputting verification data indicating whether each verification node has determined that the candidate block meets the verification criteria. The verification data corresponding to each verification node output may include evidence data, which indicates the reason why the corresponding verification node determines whether the candidate block meets the verification criteria. The evidence data may include some or all of the data used by the verification node to determine whether the candidate block meets the verification criteria. In some embodiments, when the verification node determines that the candidate block does not meet the verification criteria, the verification node is configured to output the evidence data.

[0021] In some embodiments, the verification node is configured to output evidence data to a data server (e.g., a public bulletin board hosted by the verification node), which the verification node then uses to determine whether a candidate block meets the verification criteria. This may mean that other nodes may clearly know what information the verification node used to make its decision. Therefore, it may be easier to determine whether the verification node is operating maliciously or carelessly.

[0022] As disclosed in more detail below, in some embodiments, validating the candidate block includes each validating node assigning a category to the candidate block. Preferably, the category depends on the respective validating node's determination of whether the candidate block satisfies a validation criterion. Preferably, the validation data output by the validating node includes data representing the category assigned by the validating node to the candidate block. Preferably, the validation data output by the validating node includes data representing one or more validation criteria that the validating node determined the candidate block did not satisfy.

[0023] Preferably, the validation criteria include one or more primary validation criteria, preferably corresponding to one or more requirements that a candidate block must satisfy in order for the candidate block to be included in the blockchain. Preferably, the validation criteria include one or more secondary validation criteria, preferably corresponding to non-essential requirements that a candidate block is expected to satisfy but is not required to satisfy.

[0024] Each verification node may classify the candidate blocks into one of two categories: a first category ("pass"), indicating that each verification node has determined that the candidate blocks meet the verification criteria; or a second category ("fail"), indicating that each verification node has determined that the candidate blocks do not meet the verification criteria. However, preferably, the method includes each verification node classifying the candidate blocks into one of three categories: a first category ("green"), indicating that the candidate blocks meet one or more of a set of primary verification criteria (as described above), and a set of secondary verification criteria (as described above); a second category ("yellow"), indicating that the candidate blocks meet all of the primary verification criteria, but do not meet all of the secondary verification criteria; or a third category ("red"), indicating that the candidate blocks do not meet all of the primary verification criteria.

[0025] Preferably, the method includes: in response to a majority of validation nodes determining that the candidate block satisfies all primary validation criteria (i.e., classifying the candidate block as "green" or "yellow"), and no validation node determining that the candidate block does not satisfy all primary validation criteria (i.e., "red"), allowing the candidate block to be added to the blockchain and / or adding the candidate block to the blockchain. Allowing the candidate block to be added to the blockchain may include each of the plurality of block creation nodes adding the block to a respective local copy of the blockchain (i.e., stored by the node). One or more of the nodes may output an updated copy of the blockchain to other nodes (e.g., non-block creation nodes) in the blockchain network.

[0026] Mandating such a verification process before a block is included in the blockchain may help further increase trust in nodes that are selected as part of the set of recent block creators, as block creators can only be included after successfully verifying them.

[0027] Preferably, the method includes, in response to a majority of validating nodes determining that the candidate block does not meet one or more primary validation criteria, refusing to include the candidate block in the blockchain. This may include each node or at least a majority of nodes receiving the candidate block not including the corresponding local copy of the blockchain. If one or more nodes still include the candidate block in their local copies, the network may detect and remove these copies, for example by implementing anti-fork techniques such as the longest chain rule or in the applicant's earlier patent application WO 2021 / 204181-

[0028] The method described in “Method and device for preventing blockchain forks”.

[0029] In some embodiments, disagreements between sets of validating nodes (i.e., conflicts in the classification of candidate blocks) can be resolved by a validating node accessing verification data output by one or more other validating nodes and using that verification data to reclassify the candidate blocks. As described below, this can allow a node to take advantage of additional information that may only be available to certain validating nodes during initial verification.

[0030] Alternatively or additionally, in some embodiments, disagreements can be resolved by sending candidate blocks to a wider set of nodes for validation. This means that even in the event that a majority set of validating nodes is compromised and maliciously sabotages the blockchain, even a single uncompromised validating node could potentially prevent an attack on the blockchain by issuing a "red" classification, thereby causing the candidate block to be reviewed by a wider set of nodes. This can significantly increase the robustness of the blockchain. Essentially, in some embodiments, the blockchain can be configured to accept blocks that the current set of validating nodes considers good and reject blocks that the current set of validating nodes considers bad, while decisions about other blocks (e.g., pending blocks) are made by a larger secondary validation pool.

[0031] Therefore, preferably, the method comprises: in response to determining that i) a majority of verification nodes have determined that the candidate block satisfies all primary verification criteria; and ii) at least one verification node has determined that the candidate block does not satisfy one or more primary verification criteria, one or each verification node sends the candidate block to one or more other nodes for further verification.

[0032] The one or more other nodes (i.e., a broader set of nodes) may be all nodes in the blockchain network (i.e., all active nodes) or a subset of all nodes. The one or more other nodes may be randomly selected from a plurality of nodes by the network (e.g., by a set of verification nodes). The one or more other nodes may be determined by identifying nodes in the blockchain network that have each created a corresponding block that has been included in the blockchain within a second predetermined period before the creation of the candidate block, wherein the second predetermined period is longer than the first predetermined period. In some embodiments, the one or more other nodes may include or be selected from nodes in the network that have at least a minimum level of security deposit or equity.

[0033] Preferably, the method includes identifying one or more dissenting verification nodes, wherein a dissenting verification node refers to a verification node that makes a different decision from the majority of verification nodes on whether the candidate block meets the verification criteria. In other words, the one or more dissenting verification nodes are verification nodes that hold an opposite opinion from the consensus of the set of verification nodes. For example, when the majority of verification nodes determine that the candidate block meets the verification criteria, the one or more dissenting verification nodes are those verification nodes that determine that the candidate block does not meet the verification criteria. Conversely, when the majority of verification nodes determine that the candidate block does not meet the verification criteria, the one or more dissenting verification nodes are those verification nodes that determine that the candidate block meets the verification criteria.

[0034] Preferably, after identifying a dissenting validator, each of the other validators uses the evidence data output by the dissenting validator to check the decision made by the node. This can more directly resolve disagreements within the set of validators. Therefore, preferably, the method includes, in response to identifying a dissenting validator, some or all of the other validators using the evidence data output by the dissenting validator to determine whether the candidate block meets the validation criteria.

[0035] The one or more validating nodes may be configured to send the candidate block to one or more other nodes for further verification after attempting to use the evidence data to determine whether the candidate block meets the verification criteria. Thus, if the validating nodes cannot reach consensus alone, using a wider set of nodes can provide a fallback procedure.

[0036] Preferably, the one or more other nodes are configured to verify the candidate block in substantially the same manner as the preferred embodiment described above. The one or more other nodes may be configured to vote on the correctness of the decision made by one or more dissenting verification nodes. The vote may be weighted according to the corresponding level of security deposit or equity (e.g., token) of each node in the network. If there is a substantially consistent consensus in the one or more other nodes that allows the candidate block, the candidate block may be allowed. If there is no substantially consistent consensus in the one or more other nodes that allows the candidate block, the candidate block may be rejected. In some embodiments, if there is no substantially consistent consensus in the one or more other nodes that allows the block, the candidate block is sent to each node of the network for verification. Here, substantially consistent may refer to greater than 50% or greater than 80% or greater than 90%.

[0037] In some embodiments, the predetermined period (Pt) is calculated from the time (t) when the candidate block was created. However, in some embodiments, the predetermined period (Pt) is calculated from the end of a predetermined confirmation period (Ct) which is calculated from the time (t) when the candidate block was created. Preferably, the predetermined confirmation period should last for a time equal to the length of time a block must exist in the blockchain before it is considered unalterable. For example, if the confirmation period is defined as two blocks, then the block is considered unalterable only if two other blocks are added to the blockchain after the block.

[0038] The length (i.e., duration) of the predetermined period (Pt) and / or the length (i.e., duration) of the predetermined confirmation period (Ct) may be measured in astronomical time or in block creation units (i.e., the number of blocks added to the blockchain). For example, the predetermined period may correspond to a constant number of block creations (e.g., five blocks in the blockchain). The blockchain network may schedule the creation of blocks at fixed intervals, in which case there will be a fixed correspondence between astronomical time and block creation, but this is not required. In some embodiments, each block includes a timestamp indicating the time when the block was created. The node may be configured to identify the verification node based on the timestamp of the block in the blockchain or based on the position of the block in the blockchain. When the time is determined in block creation units, the predetermined period extends from the block created r blocks ago (i.e., before the current candidate block) to the block created R blocks ago (including), where r and R are integers and r is less than R. The value of r-1 may be the duration of the confirmation period (in blocks). In an embodiment without a confirmation period, then r=1, and R is the length of the predetermined period (in blocks).

[0039] Preferably, the predetermined period defines a maximum number of nodes in the set of validating nodes. The maximum number of nodes may be between 5 and 500 nodes, such as between 50 and 250 nodes, such as about 100 nodes. The maximum value may be determined by risk assessment and may evolve over the history of the blockchain.

[0040] In a preferred embodiment, the predetermined period is a rolling period of constant duration that changes each time a candidate block is created. In some embodiments, when a corresponding candidate node is created, the corresponding node in the set of validating nodes is no longer part of the set of validating nodes. This may occur when the last time this "former validating" node created a block included in the blockchain is no longer within the rolling predetermined period. Therefore, in some embodiments, the method includes validating each candidate block in the set of validating nodes that receives transaction data, and at least one of the set of validating nodes subsequently no longer receives one or more subsequent candidate blocks of transaction data for verification. The former validating node may not permanently stop receiving subsequent candidate blocks because the former validating node can create other candidate blocks that are included in the blockchain and can therefore become a validating node again. In some embodiments, the former validating node may still be selected as a node to receive other candidate blocks to resolve disagreements after detecting a dissenting node, as described above.

[0041] The blockchain network may implement a penalty system in which a security deposit paid by a node of the network is temporarily withheld until at least one or more conditions for the return of the security deposit are met. In some embodiments, a node may be required to pay a creator security deposit to create a candidate block. The creator security deposit may be a certain number of tokens or any other appropriate form of equity or holding in the blockchain. Paying the creator security deposit may allow the node to participate in the block creation lottery. The method may include selecting a node that wins the lottery to create a candidate block. The network may be arranged to reject candidate blocks created by some or all non-winning nodes. Preferably, the set of verification nodes is configured to select the winning node.

[0042] In some embodiments, multiple candidate blocks may be created simultaneously (e.g., within a common block creation time interval). For example, the method may include selecting a winner and one or more runners-up in a block creation lottery, and each of the winner and runners-up may be configured to create candidate blocks simultaneously. The candidate blocks may be sent to a set of verification nodes for verification according to at least two different priorities. In some embodiments, candidate blocks may be conditionally received due to the verification results of the set of verification nodes, for example, under the condition that a higher priority candidate block is rejected. However, in other embodiments, only one candidate block may be created per time slot, and a rejected block may only result in an empty time slot. Preferably, the method includes: the network rejects a candidate block of transaction data from a block creation node at least before the block creation node pays a creator deposit; the block creation node pays a creator deposit; and the block creation node creates a candidate block of transaction data.

[0043] Preferably, the method comprises: in response to determining that a candidate block created by a block creation node has been rejected for inclusion in the blockchain, withholding part or all of the creator deposit of the block creation node.

[0044] In some embodiments, a node may need to pay a behavior deposit to become a validating node. Since the block creation node may become a validating node in the future, the behavior deposit may become part of the creator's deposit. The method may include: the network preventing the block creation node from becoming a validating node at least before the block creation node pays the behavior deposit; the block creation node pays the behavior deposit; and the block creation node creates a candidate block of transaction data.

[0045] The behavior bond may be withheld due to malicious or careless behavior of the node. For example, if the validating node fails to determine that an inappropriate candidate block should be rejected, or fails to determine that a valid candidate block should be approved, the behavior bond of the validating node may be withheld. This withholding is determined based on the consensus reached by the validating node set or one or more other nodes.

[0046] Therefore, preferably, the method includes: the node paying a behavior deposit; the node determining that a candidate block meets the verification criteria; the network determining that the candidate block has been rejected; and the network withholding part or all of the behavior deposit from the node. The method may include: the node paying a behavior deposit; the node determining that a candidate block does not meet the verification criteria; the network determining that the candidate block has been allowed; and the network withholding part or all of the behavior deposit from the node.

[0047] A validator node may be penalized for failing to validate a candidate block and / or failing to validate correctly. Therefore, in some embodiments, upon determining that a validator node has not determined whether a candidate block meets the validation criteria and / or upon determining that a recent block creation node has not correctly determined whether a candidate block meets the validation criteria, a portion or all of the security deposit is withheld.

[0048] In some embodiments, the identity of the node whose deposit is withheld is published on the data server of the network. The identity may be output (e.g., published) by one or more (e.g., all) verification nodes. The identity may be output by each node in the set of verification nodes to their respective data servers.

[0049] Nodes whose deposits are withheld may be banned from further participation in the network. Nodes may be banned immediately after being penalized, or after accumulating a predetermined number of penalties.

[0050] Withholding node deposits helps to deter nodes from acting maliciously or carelessly, thereby improving the robustness of the blockchain. This is especially true for validating nodes, which are responsible for verifying candidate blocks and including them in the blockchain, so it is naturally more necessary for validating nodes to take appropriate actions than other nodes in the network.

[0051] Preferably, the steps of creating a candidate block, determining a set of verification nodes, and sending the candidate block to each verification node for verification are performed by one of the plurality of nodes. Each block creation node in the network may be configured to perform these steps.

[0052] Preferably, the network is decentralized. Operations performed by the network may be performed collectively by some or all of the nodes in the network. Operations of the network may also be performed collectively by some or all of the nodes in the network. Each node may have an individual identity in the network - for example, bound to a cryptographic key pair of a node operator. Each node may include a processor for executing software instructions. Each node may operate according to a common blockchain protocol. A node may have a single network connection to the blockchain network and / or a single network address, although this is not required - for example, it may be implemented by multiple distributed hardware devices.

[0053] In a second aspect, the present invention provides a processing system for a blockchain network node, wherein the processing system is configured to:

[0054] Creating candidate blocks of transaction data for inclusion in a blockchain hosted by a blockchain network;

[0055] A set of verification nodes is determined by identifying nodes in the blockchain network that have each created a corresponding block that has been included in the blockchain within a predetermined period before the candidate block is created; and the candidate block is sent to each verification node for verification.

[0056] The processing system may be implemented by a single physical device (e.g., a single block creation device). However, in some embodiments, the processing system may be distributed across multiple networked devices, which may be physically distant from each other and may have different connections to the underlying physical network. The processing system may act as only a single node of the blockchain network, although it may also perform operations on behalf of multiple nodes of the blockchain network.

[0057] The blockchain network may include multiple nodes, each of which may include such a processing system. Each processing system may include one or more processors. The processing system may be a server.

[0058] Preferably, the processing system includes a memory for storing a local copy of the blockchain. Preferably, the processing system is configured to maintain a local copy of the blockchain, for example, by updating a header of the blockchain. Preferably, the memory stores software, for example, for maintaining, sharing or updating a local copy of the blockchain. The software may include instructions that, when executed by the processor, cause the node to send the local copy of the blockchain stored in the memory to other nodes in the blockchain network. The software may include instructions that, when executed by the processor, cause the node to retrieve blockchain updates shared by one or more other nodes in the blockchain network.

[0059] The processing system may include a trusted execution environment (TEE). The trusted execution environment may be a secure processing device, which may be part of a larger processing device or processor, such as a central processing unit (CPU). Preferably, data stored and / or processed in the trusted execution environment is prohibited from communicating outside the trusted execution environment. In other words, preferably, the data can be securely retained in the trusted execution environment. The TEE may store data in an encrypted area of ​​a memory. Preferably, the trusted execution environment is configured to securely prove itself to users and / or other processing systems outside the TEE. One or more of the multiple nodes may be configured to process data related to the blockchain in a respective trusted execution environment of such a processing system. In particular, the node may be configured to create a candidate block and determine a set of verification nodes within the node's TEE.

[0060] It should be understood that each local copy of the blockchain is not necessarily an identical copy. The copy may differ from one or more (e.g., the latest) blocks.

[0061] The blockchain can be configured to store tokens. In some embodiments, the blockchain can be configured to store smart contracts.

[0062] Preferably, each of the plurality of nodes is configured to communicate with one or more other nodes of the plurality of nodes, for example via a network such as the Internet. The nodes may be configured to communicate with each other via a wired or wireless network connection. The mutual communication allows the nodes to share and update their respective locally stored copies of the blockchain. Preferably, one or more nodes are configured to timestamp communications sent from the node, for example, to one or more other nodes of the blockchain network. Thus, the processing system may include a clock, or may be configured to receive a clock signal from an external clock source. The set of verification nodes may be configured to maintain a timing record of events recorded on the blockchain. The timing record may be used to verify one or more verification criteria of a candidate block.

[0063] The nodes may be configured to publish communications using a data server (e.g., a bulletin board) hosted by the node or elsewhere in the blockchain network. The nodes may be configured to output their communications to a data server hosted by each node itself. Preferably, the nodes are configured to timestamp communications uploaded by the node to the data server.

[0064] Preferably, the node is configured to sign communications output by the node. Thus, in some embodiments, creating a candidate block of transaction data comprises signing the candidate block using a unique signature. Preferably, the unique signature allows identification of the node responsible for creating the candidate block. Thus, preferably, the unique signature corresponds to the node that created the block.

[0065] In some embodiments, the processing system is configured to create transaction data, for example, to include in a pool of unverified transaction data.

[0066] The processing system may be configured to determine the set of validating nodes by checking a local copy of the blockchain to determine which nodes have created blocks that have been included in the blockchain within a predetermined period. In a preferred embodiment, the processing system is configured to determine the set of validating nodes by reading signatures of blocks that have been included in the blockchain within a predetermined period.

[0067] In some embodiments, the node that creates the candidate block may (already) be a validating node itself. This may happen if the node has created two blocks that have been included in the blockchain within a predetermined period. In this case, it should be understood that the set of validating nodes to which the node sends the candidate block does not necessarily include the node itself.

[0068] The processing system may be configured to send the candidate block as an output candidate block. The candidate block may be sent directly to other nodes, or the processing system may send it through a proxy or proxy server. The processing system may be configured to receive incoming candidate blocks (i.e., when the processing system is a validating node).

[0069] In a third aspect, the present invention provides a blockchain network comprising a plurality of nodes, wherein the blockchain network hosts a blockchain and is configured to:

[0070] Create candidate blocks of their respective transaction data for inclusion in the blockchain;

[0071] Determine respective sets of verification nodes by identifying nodes in the blockchain network that have each created a corresponding block included in the blockchain within a predetermined period before the candidate block was created; and

[0072] Send each candidate block to each verification node in the respective verification node set for verification.

[0073] Where appropriate, features of any aspect or embodiment described herein may be used in any other aspect or embodiment described herein. When referring to different embodiments or groups of embodiments, it should be understood that they are not necessarily independent of each other and there may be overlap.

[0074] BRIEF DESCRIPTION OF THE DRAWINGS

[0075] Some embodiments of the invention will now be described, by way of non-limiting example only, with reference to the accompanying drawings, in which:

[0076] Figure 1 is a schematic diagram of a blockchain network embodying the transaction data processing method of the present invention;

[0077] Figure 2 yes Figure 1 A schematic diagram of a blockchain data structure maintained by a blockchain network in; and

[0078] Figure 3 yes Figure 1 A flowchart of the steps executed by the nodes of the blockchain network in; and

[0079] Figure 4 yes Figure 1 Flowchart of the steps executed by a verification node in a blockchain network. DETAILED DESCRIPTION

[0080] Figure 1A schematic diagram of a blockchain network 1 for implementing a transaction data processing method according to an embodiment of the present invention is shown. The blockchain network 1 includes a plurality of nodes 2a-2i that communicate with each other via the Internet to maintain a distributed blockchain 3. Each node is a separate processing system, such as a server, comprising a memory and one or more processors that execute software for maintaining the blockchain 3. Each node stores a local version (i.e., a copy) of the blockchain 3 in its memory. At any time, the individual copies of the blockchain 3 should be almost identical, but they may differ slightly in terms of the latest entries. Although Figure 1 Only nine exemplary nodes 2a-2i are shown, but the network 1 may include a large number of nodes. Nodes may join or leave over time.

[0081] A subset of nodes 2a-2g are block creation nodes, which are configured to create candidate blocks based on transactions selected from the pool of unconfirmed transactions for inclusion in the blockchain 3. There may be other nodes 2h, 2i that do not perform block creation activities but still maintain a local copy of the blockchain 3. The blockchain network 1 implements a trust-based consensus mechanism and may also contain some elements of a proof-of-stake consensus mechanism.

[0082] Figure 2 A representation of a consensus blockchain 3 at a given time t=T is shown. It shows the six most recently approved blocks of transaction data 4a-4f. In this example, these blocks were created by six different block creation nodes 2a-2f, but it is possible that the same node could have created multiple recent blocks. Blocks 4a-4f have been added to the blockchain 3 and have fully passed the consensus check and are therefore considered unchangeable.

[0083] In some embodiments, including Figure 2 In the example shown, a block may be considered immutable once it has been added to the blockchain 3. However, in some other embodiments, a temporary block may need to exist in the blockchain 3 for a period of time C exceeding the confirmation period Ct before it can be considered immutable. For example, this confirmation period may be defined as a number of blocks that must be added after the expected block (e.g., three more blocks, C=3). At any particular moment, some nodes may hold a copy of the blockchain 3 containing one or more temporary blocks, which may be reversed, for example, if a short-lived fork of the blockchain occurs and is later resolved by voting or the longest chain rule.

[0084] Figure 2Shows the history of blockchain 3 over time, with time flowing from left to right. Here, time is measured in block creation intervals, which can be regular or irregular. Alternatively, time can be measured in astronomical time, and in some embodiments, the two may be approximately the same (e.g., if network 1 creates a new block every fixed number of seconds). At time T, the most recently permitted block 4f in blockchain 3 is shown on the Figure 2 right side. All older blocks in blockchain 3 extend to the left in Figure 2 .

[0085] Within the Pt period before the current time t = T, five blocks 4b, 4c, 4d, 4e, 4f are added to blockchain 3. This predetermined "trust" period Pt is a rolling period of fixed length, with a duration of P, calculated forward from a reference time. It can be measured by the number of committed blocks or astronomical time or any other suitable means.

[0086] It can be calculated forward from the current time t (e.g., starting from the creation time of the most recently added block to the blockchain). However, in embodiments with a rolling confirmation period Ct with a duration of C, the trust period Pt may be calculated forward from time t–C, i.e., the trust period Pt may cover the blocks created within the period from t–(P + C) to t–C. Any node that created a block that is irrevocably included in blockchain 3 within the current trust period Pt is defined as constituting the set 5 of current "verifying" nodes. Thus, when the period is measured by the number of blocks, let C = r–1 blocks and P = R–r + 1 blocks, where r and R are fixed integers and r < R, then the verifying nodes are those that created any block between r and R. In embodiments where no confirmation period is applied, r = 1.

[0087] Although Figure 2 the example in

[0088] only shows five verifying nodes, the trust period may cover more blocks, e.g., one hundred or more blocks, so that the set of verifying nodes can contain up to one hundred or more members (e.g., if a five-block confirmation period is implemented, r = 6 and R = 105).

[0089] In Figure 2In the example of , the trust period PT corresponds to the period (i.e., r=1, R=5) in which the five most recent blocks 4b-4f are (unchangeably) added to the blockchain 3. These blocks 4b-4f are created by five block creation nodes 2b-2f, respectively. Therefore, according to the present invention, at time T, these five block creation nodes 2b-2f are regarded as verification nodes 5. Before the current trust period PT, the sixth oldest block 4a was created by block creation node 2a at time T-6, so node 2a will be deleted from the set of verification nodes 5 shortly before time T, and the trust period Pt at this time changes from PT-1 to PT.

[0090] Each block creation node in the network 1 maintains a local copy of the blockchain 3 and is configured as follows:

[0091] Create transactions when requested by node owners while ensuring that these transactions are legitimate;

[0092] Submit bids to create blocks (if these are not done automatically);

[0093] Monitor when blocks are chosen for creation;

[0094] Always ready to conduct extension checks to help resolve disagreements between validators;

[0095] Perform general storage and communication functions; and

[0096] By monitoring validating nodes and the wider protocol, the records at the head of the blockchain are updated as needed.

[0097] In addition to performing all the above operations, verification node 5 also needs to:

[0098] Maintaining a time record of events recorded on the blockchain 3;

[0099] Calculate the winners of the block creation lottery;

[0100] Verify whether the candidate block meets the verification criteria set by the blockchain network 1;

[0101] Implement a consensus protocol that involves sharing its validation results and collecting validation results from other nodes; and

[0102] Communicate with other validating nodes to ensure that messages broadcast by the block-creating node are clear and unambiguous (for example, to detect whether malicious actors are causing different nodes to receive conflicting blocks).

[0103] Between time T and a later time T+1, other block creation nodes 2g of the blockchain network 1 create candidate blocks 6 of transaction data. The node 2g is selected in a lottery managed by the verification node 5 to create the next block.

[0104] The node 2g identifies the validating nodes 5 by checking its copy of the blockchain 3 to determine which nodes have created (irrevocably) blocks included in the latest trust period Pt. It then sends a copy of the candidate block 6 to each validating node 5 for verification.

[0105] The verification process performed by verification node 5 will be referred to below Figure 4 A more detailed description is given.

[0106] At time T+1, if candidate block 6 is approved by verification node 5, candidate block 6 will be added to blockchain 3. Therefore, at time T+1, block creation node 2g will meet the requirements to become verification node 5 because it successfully created block 6 that has been added to blockchain 3 (and has existed in blockchain 3 for more than the confirmation period), and it was completed within the trust period PT immediately before time T+1.

[0107] Furthermore, at time t=T+1, the block creation node 2b responsible for creating the permissioned block 4b will no longer be considered a validating node 5. This is because the rolling time period Pt will no longer include the time when the block 4b was added to the blockchain 3 at time T+1.

[0108] Figure 3 A flowchart showing the steps executed by nodes in blockchain network 1, e.g. Figure 1 The blocks in the block creation nodes 2a-2g.

[0109] In step S100, the node qualifies as a block creation node. In some exemplary networks 1, the node attempts to qualify as a block creation node by paying a creator deposit written as a transaction to the blockchain 3. The creator deposit serves as a ticket to enter the lottery for the privilege of creating a candidate block. The winner of the lottery for each time interval is randomly determined by a set of verification nodes 5. The amount of the creator deposit includes at least the maximum amount of reward that the node can receive for creating a single block, and may also include the sum of any other deposits paid. The node can be configured to repeatedly pay the creator deposit over time to qualify as a block creation node.

[0110] Once a node qualifies as a block creation node, it selects a set of transaction data from the unconfirmed transaction pool, i.e., transactions that have not yet been included in the blockchain 3 (step S101). The unconfirmed transaction pool is distributed among the nodes of the blockchain network 1 using known techniques and stored in the memory of the node. The transaction data set selected by the block creation node can be selected based on any suitable or desired criteria, such as the age or value of each unconfirmed transaction.

[0111] In step S102, the block creation node performs operations on the selected transaction data set to create candidate blocks for inclusion in the blockchain 3, for example using methods known in the art. Each transaction data block written to the blockchain 3 contains the hash value of the previous block of the blockchain 3. It also identifies the block creation node responsible for verifying the transaction data and creating the block (for example, through cryptographic signatures). In step S103, the block creation node identifies the current set of verification nodes 5 from the blocks of the blockchain 3 within the current trust period Pt.

[0112] In step S104, the candidate block created by the block creation node is transmitted to all verification nodes 5 for verification (if the block creation node itself also creates an early block during the trust period, it will not be transmitted to the verifier set). At this stage, the candidate block will not be transmitted to any node that does not belong to the verification node 5 set.

[0113] Figure 4 A flowchart showing the steps performed by each verification node 5.

[0114] In step S200, a transaction data block created by a block creation node in the blockchain network (which may or may not already be in the set of verification nodes 5) is included in the blockchain 3. After the block exists in the blockchain 3 for any fixed confirmation period, which is the time for which the block is considered unchangeable, or immediately if no confirmation period is required, the block creation node responsible for creating the block is considered a verification node by other nodes of the network 1 (step S201). The block creation node will then be considered a verification node for the fixed trust period.

[0115] After becoming a verification node 5, the node needs to pay a behavior deposit. Once the node is no longer a verification node 5, the behavior deposit will be returned to the node, unless the deposit cannot be returned due to the node's "bad behavior", the specific details of which will be explained in detail below.

[0116] In step S202, the block creation node (now the verification node) receives the candidate blocks created by other block creation nodes of the blockchain network 1. Figure 3 As shown, the candidate block is sent to each verification node 5.

[0117] In step S203, each verification node 5 checks the candidate block to verify whether it meets the requirements for inclusion in the blockchain 3, that is, whether it meets one or more verification criteria. The criteria include primary criteria, that is, basic requirements that the candidate block must meet before it can be included in the blockchain 3; and secondary criteria, that is, preferred but not required requirements, such as requirements related to time limits.

[0118] Each verification node 5 classifies the candidate block as "green", "yellow" or "red". A classification of "green" indicates that the candidate block meets all verification criteria for inclusion in the blockchain 3. A classification of "yellow" indicates that the candidate block meets all primary criteria for inclusion in the blockchain 3, but the verification node believes that one or more secondary criteria are not met. If the candidate block fails to meet one or more primary criteria, it is classified as "red".

[0119] Key criteria may include that the block must:

[0120] is properly formatted; and / or

[0121] Does not involve “double spending” of tokens; and / or

[0122] contains certain endorsements; and / or

[0123] Providing proof that the node that created the block in question had the authority to do so (related to winning a signature).

[0124] Secondary criteria could include that the block must:

[0125] meet certain time limits; and / or

[0126] Contains certain non-critical information.

[0127] In step S204, each verification node 5 broadcasts its classification of the candidate block to other verification nodes 5 to determine whether a consensus has been reached on whether the candidate block is verified to meet the requirements for inclusion in the blockchain 3 (step S205).

[0128] If a validating node 5 classifies a candidate block as "red", the validating node broadcasts this classification along with a checkable reason (i.e., proof) to other validating nodes 5. The checkable reason is posted on a bulletin board hosted by the node 5 and is readable by all other nodes of the blockchain network 1. This makes it more straightforward for other nodes to check the classification.

[0129] If the majority of verification nodes 5 classify the candidate block as "green" and no verification node 5 classifies the candidate block as "red", the candidate block passes verification. In this case, each verification node 5 adds the candidate block to the version of the blockchain 3 they store and broadcasts the updated blockchain 3 to other nodes in the blockchain 3 network 1 (step S206a).

[0130] If the majority of verification nodes 5 classify the candidate block as "yellow" or "red", the candidate block is rejected (step 206b). This means that the candidate block will not be broadcast to other nodes in the blockchain network 1.

[0131] If a majority of the validating nodes 5 classify a candidate block as “green”, but one or more validating nodes classify the candidate block as “red”, the validating nodes 5 may be asked to re-evaluate the block based on evidence posted on a bulletin board of nodes classified as “red”. If consensus is still not reached, the candidate block will be broadcast to a wider set of nodes in the blockchain network 1 to attempt to resolve the disagreement. The wider set of nodes may be a subset of all nodes, randomly selected by the network 1 (e.g., by the validating nodes 5), or it may include or be selected from each node in the network 1 with the lowest security deposit or stake level (e.g., having a non-zero token holding). If the set is randomly selected, it should be done in an unpredictable manner when a dispute arises. The nodes of the wider set check the “red” classification of the candidate block; as part of the check, these nodes may access and analyze the reasons for the initial “red” classification. These checking nodes may publish similar classifications, or may vote on the correctness of the “red” classification. In some embodiments, their votes may be weighted according to the security deposit or stake level. If the wider set fails to reach a substantial consensus (e.g., more than 80% confirmed as “red” or more than 80% not classified as “red”), the candidate block is sent to each available node, and all nodes check the classification to reach a final consensus on whether the candidate block should be accepted and included (step S206a) or rejected (step S206b).

[0132] Once consensus is reached on the candidate block (steps S206a and S206b), if the block is rejected, the block creation node that created the block will be punished and part or all of its creator deposit will be confiscated.

[0133] This approach makes Blockchain 3 extremely robust against malicious actors by conducting a wider investigation of blocks even if only one validating node classifies it as “red”. Even if a majority of validating nodes are compromised and maliciously compromise the blockchain, this is still not enough to compromise Blockchain 3, as even a single uncompromised validating node could potentially prevent the attack by involving a wider range of nodes in reviewing candidate blocks.

[0134] If one or more validating nodes are incorrectly determined by a larger group of nodes to classify an accepted candidate block as "red", the validating node will be penalized. The penalty is implemented by withholding some or all of the behavior deposit that the node paid when becoming a validating node 5. In some embodiments, if a validating node classifies a block as "green" (or "green" or "yellow" in some embodiments), and the block is ultimately rejected by a larger subset of nodes or all available nodes, the validating node can also be penalized for ignoring the error.

[0135] The identities of the punished block creation nodes or verification nodes are published on the bulletin board of blockchain network 1, and these nodes may be immediately banned from participating in network 1 or banned from participating in network 1 after receiving a certain number of penalties.

[0136] These deposits and publicity penalties discourage nodes, especially validators, from acting carelessly or maliciously. In this way, disagreements between validators should be rare.

[0137] Unless it is banned from participating in the network in rare circumstances 1, a validator will continue to receive further blocks for validation until the time of the last block it created exceeds the current trust period Pt. If it is selected to create other blocks before then, its time as a member of the validator set can be extended.

[0138] In step S207, if the block creation node is still considered a verification node (i.e., because the current trust period Pt still covers the time when the block calculated by proof of work or proof of stake is added to the blockchain 3), the process loops back to step S202, and the block creation node receives other candidate blocks for verification together with other nodes in the verification node set 5 (the membership of the verification node set may change over time). However, if the block creation node is no longer considered a verification node, the process continues to step S208. In step S208, the block creation node no longer receives other candidate blocks for verification. This is because candidate blocks are usually only sent to the verification node 5, and the block creation node is now no longer a verification node. The block creation node will no longer receive other candidate blocks until it creates other transaction data blocks that are irreversibly incorporated into the blockchain 3, at which point Figure 4 The process will restart from step S200.

[0139] In some embodiments, all nodes in the network are required to have accurate clocks and include timestamps in the messages they send. In particular, all information published by a node on its bulletin board should be timestamped. All bulletin board announcements also come with a hash value, for example as part of a signature. When a node recognizes that it needs some information for some purpose, such as supporting a classification decision, it first publishes said information on its own bulletin board and only then uses it. Therefore, it is always clear to other nodes what information the validating node used in making its decision. This helps to clarify situations where there are discrepancies.

[0140] This enables validators to:

[0141] Check that it has obtained all relevant information from all or at least most of the other validators;

[0142] Find missing information by copying from other validators’ bulletin boards; and identify misbehavior caused by inconsistent information between validators.

[0143] Thus, during validation and checking of a candidate block, when a preliminary verdict is collected from validating nodes, the block may be immediately approved, or there may be one or more "red" classifications with evidence (e.g., reasons for the "red" classification) that require checking, in which case the validating nodes recheck based on these evidences (perhaps some of the main criteria require evidence to detect non-satisfaction of the criteria, and these evidences may not be provided to all validating nodes during the initial validation). Thereafter, a dominant majority decision may be made to determine the acceptance or rejection of the block, and if no consensus is reached, the blockchain network may initiate an alternate decision-making procedure based on the collected evidence, for example, by consulting a wider set of nodes as described above.

[0144] If the winner and runner-up of the block creation lottery propose multiple blocks, a block can be conditionally approved if a given set of blocks are rejected. Such a block will be given a rating that clearly indicates the status it would have if higher priority blocks were rejected. Another option is to consider such blocks only after higher priority blocks have been rejected.

[0145] The protocol implemented by Network 1 is ideally such that within the time interval allowed for each new block to be included in the blockchain, there is at least time for a majority of validating nodes to initially evaluate the candidate block, publish information using the bulletin board, re-evaluate in the event of disagreement, and select an alternative block. Therefore, all validating nodes and the node selected to create the next block should be able to see the verification results before the next block is created.

[0146] Therefore, the network 1 aims to make the dominant validation nodes 5 reach a consensus on the validation decision based on the same information. Such a decision is binding. If such consensus cannot be reached, more nodes will be introduced, but there may be some delay. If the decision issued by the validation node is seriously inconsistent with the decision of the dominant majority of validation nodes, the node may be punished.

[0147] In this way, the blockchain network 1 can utilize a rolling set of validating nodes 5 that have recently staked in the blockchain to perform secure and efficient candidate block validation.

Claims

1. A method for processing transaction data, for incorporating transaction data into a blockchain hosted by a blockchain network consisting of multiple nodes, the method comprising: Create candidate blocks of transaction data; Determining a set of verification nodes by identifying nodes in the blockchain network, each of which has created a corresponding block that has been included in the blockchain within a predetermined period before the candidate block is created; as well as Send the candidate block to each verification node for verification.

2. The method according to claim 1 includes using the block position in the blockchain, or the timestamp in the blockchain block, to identify the nodes in the blockchain network that have each created a corresponding block included in the blockchain within a predetermined period.

3. The method according to claim 1 or 2 includes verifying that each node in the node set receives a candidate block of transaction data.

4. The method of claim 3 , comprising each verification node verifying the candidate block by determining whether the candidate block satisfies one or more verification criteria.

5. The method according to claim 4, comprising: In response to determining that at least one node in the set of verification nodes determines that the candidate block does not meet the verification criteria, reject the candidate block.

6. The method according to claim 4 or 5 includes each verification node outputting verification data indicating whether each verification node has determined that the candidate block meets the verification criteria.

7. A method according to claim 6, wherein the verification data is readable by each verification node.

8. The method of claim 7, comprising each verification node outputting verification data to a data server.

9. The method of claim 8, wherein the data server is readable by one or more other nodes in the network in addition to the verification node.

10. The method of claims 4 to 9, wherein the one or more verification criteria include: One or more primary validation criteria, corresponding to one or more requirements that a candidate block must meet in order to be included in the blockchain; as well as One or more secondary validation criteria, corresponding to one or more non-essential requirements that a candidate block is expected to meet but is not required to meet.

11. The method of claim 10, comprising having each verification node classify candidate blocks into one of the following three categories: The first category means that the candidate block meets all the primary validation criteria and all the secondary validation criteria; The second category means that the candidate block meets all the primary validation criteria but does not meet all the secondary validation criteria; or The third category indicates that the candidate block does not meet all the main verification criteria.

12. The method of claim 10 or 11, comprising, in response to a majority of verification nodes determining that the candidate block satisfies all primary verification criteria and no verification node determining that the candidate block does not satisfy all primary verification criteria, allowing the candidate block to be included in the blockchain.

13. The method according to claims 10 to 12, comprising: Responsive to a majority of validating nodes determining that the candidate block does not satisfy one or more primary validation criteria, rejecting the candidate block for inclusion in the blockchain.

14. The method according to claims 10 to 13 includes, in response to determining that i) a majority of verification nodes have determined that the candidate block satisfies all primary verification criteria, and ii) at least one verification node has determined that the candidate block does not satisfy one or more primary verification criteria, one or each of the verification nodes sends the candidate block to one or more other nodes of the plurality of nodes for further verification.

15. The method of claim 14, wherein the one or more other nodes are randomly selected from the plurality of nodes.

16. The method according to claims 4 to 15, comprising: identifying one or more dissenting validators that have made a decision different from a majority of validators regarding whether a candidate block satisfies the validation criteria; as well as In response to identifying a dissenting validation node, some or all of the other validation nodes use the evidence data output by the dissenting validation node to determine whether the candidate block satisfies the validation data.

17. The method of claim 16, wherein the evidence data output by the dissenting verification node indicates the reason why the dissenting verification node determines whether the candidate block meets the verification criteria.

18. The method of claim 16 or 17, comprising, after attempting to use the evidence data output by the dissenting verification node to determine whether the candidate block meets the verification criteria, one or more verification nodes sending the candidate block to one or more other nodes of the plurality of nodes for further verification.

19. A method according to any preceding claim, wherein the predetermined period is calculated from the time when the candidate block is created, or is calculated from the end time of a predetermined confirmation period, and the predetermined confirmation period is calculated from the time when the candidate block is created.

20. A method according to any preceding claim, wherein the predetermined period corresponds to a constant number of block creations.

21. A method according to any of the preceding claims, comprising each node in the verification node set receiving a candidate block of transaction data, and at least one node in the verification node set subsequently no longer receiving one or more subsequent candidate blocks of transaction data for verification.

22. A method according to any preceding claim, comprising: The network rejects candidate blocks of transaction data from a block creator node among multiple nodes, at least until the block creator node pays the creator bond; The block creation node pays the creator a deposit; as well as The block creation node creates candidate blocks of transaction data.

23. The method of claim 22, comprising withholding part or all of the creator deposit of the block creation node in response to determining that a candidate block created by the block creation node has been rejected for inclusion in the blockchain.

24. A method according to any preceding claim, comprising: The network prevents the block creator from becoming a validator among multiple nodes, at least until the block creator pays the behavior bond; The block creation node pays the behavior deposit; as well as The block creation node creates candidate blocks of transaction data.

25. The method according to claim 24, comprising: Node payment behavior deposit; The node determines that the candidate block meets the verification criteria; The network determines that the candidate block has been rejected; as well as The network withholds some or all of the node's behavior deposit.

26. A processing system for a blockchain network node, the processing system being configured to: Creating candidate blocks of transaction data for inclusion in a blockchain hosted by a blockchain network; Determining a set of validating nodes by identifying nodes in the blockchain network, each of which has created a corresponding block that has been included in the blockchain within a predetermined period before the candidate block is created; and Send the candidate block to each verification node for verification.

27. The processing system of claim 26, wherein the processing system is configured to determine the set of validating nodes by examining the copies of the blockchain stored by the nodes to determine which nodes created blocks that have been included in the blockchain within a predetermined period.

28. A blockchain network comprising a plurality of nodes, wherein the blockchain network hosts a blockchain and is configured to perform the method of claims 1 to 25.