CN114764709A

CN114764709A - Information processing apparatus, information processing method, and computer program

Info

Publication number: CN114764709A
Application number: CN202110049299.XA
Authority: CN
Inventors: 周恩策; 皮冰锋; 孙俊
Original assignee: Fujitsu Ltd
Current assignee: Fujitsu Ltd
Priority date: 2021-01-14
Filing date: 2021-01-14
Publication date: 2022-07-19
Also published as: JP2022109219A

Abstract

The present disclosure relates to an information processing apparatus and an information processing method for improving the throughput rate of a block chain. The information processing apparatus includes: a pre-verification unit configured to pre-verify validity of the transaction in a sorting node of the blockchain to determine whether the transaction is invalid, and send a pre-verification result to a peer node; and a pipelining unit configured to validate and submit transactions received from the sequencing nodes in a pipelined manner in peer nodes of the blockchain. The peer nodes comprise a VSCC validation module, an MVCC validation module, a submission to an account book module, a submission to a state database module and a submission to a history database module, and the pipelining unit executes the functions of the modules in a pipelining mode. Through the information processing technology according to the disclosure, the verification pressure on the transaction on the subsequent nodes in the blockchain can be reduced, thereby improving the throughput rate of the blockchain.

Description

Information processing apparatus, information processing method, and computer program

Technical Field

The present disclosure relates generally to the field of information processing, and more particularly, to an information processing apparatus and an information processing method for improving throughput of a block chain.

Background

The block chain technique originates in bitcoin. A blockchain may be viewed as a distributed database that operates in a decentralized manner. The blockchain technology realizes decentralized point-to-point transaction, coordination and cooperation by means of data encryption, time stamping, distributed consensus, economic incentive and the like under the condition that transaction nodes in a distributed system do not need to trust each other, so that the problems of high cost, low efficiency, unsafe data storage and the like of a centralized mechanism are solved.

With the development and popularization of bitcoin in recent years, the blockchain has been widely applied to various fields such as finance, economy, science and technology, even politics, and the like as a new form of universal distributed underlying architecture.

However, during a transaction at a node of the blockchain, a conflicting transaction may result because there may be concurrent transactions. Specifically, a conflict transaction refers to a concurrent operation performed on the same block in the block chain during a concurrent execution process by different transactions. For example, two transactions that are concurrent operate on the same tile, where one transaction modifies the data of the tile, resulting in a change to the data of the tile, and the changed data is registered to the blockchain (accounting). During this process, if another transaction also operates on the block to modify the data of the block, there is an inconsistency in the data of the block when the data of the block is verified by the other transaction, and the other transaction is determined to be a conflicting transaction.

Disclosure of Invention

To solve the problems in the prior art, the present disclosure proposes a technique capable of improving the throughput rate of a blockchain in a highly concurrent blockchain application. The information processing technology firstly carries out cross-block transaction relevance analysis in a sequencing node providing sequencing service, so that the validity of the transaction is verified in advance to determine a part of invalid transactions in advance. The tile and transaction correlation analysis results are then sent to the peer node where the transactions that have been determined to be invalid need not be authenticated, thereby reducing the pressure of the peer node's authentication and submission processes. Furthermore, five operations in the validation and submission process are performed in a pipelined manner, namely, Verification of System Chain Code (VSCC) validation, multi-version concurrency control (MVCC) validation, submission to ledgers, submission to state databases, and submission to historians, to take full advantage of system computing power. In particular, the information processing technique further optimizes the MVCC verification operations and commit to state database operations to increase processing speed.

A brief summary of the disclosure is provided below in order to provide a basic understanding of some aspects of the disclosure. It should be understood that this summary is not an exhaustive summary of the disclosure, nor is it intended to identify key or critical elements of the disclosure or to delineate the scope of the disclosure. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is discussed later.

To achieve the object of the present disclosure, according to one aspect of the present disclosure, there is provided an information processing apparatus for improving a throughput rate of a block chain, comprising: a pre-verification unit for pre-verifying the validity of the transaction in the sorting node of the blockchain to determine whether the transaction is invalid and sending the pre-verification result to the peer node; and a pipelining unit for validating and submitting transactions received from the sequencing nodes in a pipelined manner in peer nodes of the blockchain, wherein the peer nodes include a VSCC validation module, an MVCC validation module, a submit to ledger module, a submit to status database module, and a submit to historical database module, and the pipelining unit performs functions of the VSCC validation module, the MVCC validation module, the submit to ledger module, the submit to status database module, and the submit to historical database module in a pipelined manner.

According to another aspect of the present disclosure, there is provided an information processing method for improving throughput of a block chain, comprising the steps of: pre-verifying the validity of the transaction in a sorting node of the blockchain to determine whether the transaction is invalid, and sending a pre-verification result to a peer node; and validating and submitting transactions received from the sequencing node in a pipelined manner in peer nodes of the block chain, wherein the peer nodes comprise a VSCC validation module, an MVCC validation module, a submit to ledger module, a submit to status database module and a submit to historical database module, and the functions of the VSCC validation module, the MVCC validation module, the submit to ledger module, the submit to status database module and the submit to historical database module are executed in a pipelined manner.

According to another aspect of the present disclosure, there is provided a computer program capable of implementing the information processing method described above. Furthermore, a computer program product in the form of at least a computer-readable medium is provided, on which a computer program code for implementing the above-described information processing method is recorded.

According to the information processing technology disclosed by the disclosure, the verification and submission processing speed of the block chain can be greatly increased, so that the throughput rate of the block chain is increased, and the performance of a block chain system is improved.

Drawings

The above and other objects, features and advantages of the present disclosure will be more readily understood by reference to the following description of embodiments of the present disclosure taken in conjunction with the accompanying drawings, in which:

fig. 1 is a block diagram illustrating an information processing apparatus according to an embodiment of the present disclosure;

fig. 2 is a schematic diagram showing a process performed by an information processing apparatus according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram illustrating the pre-authentication unit determining the type of association of a transaction from the read-write set of the transaction;

FIG. 4 is a schematic diagram showing the pre-authentication unit building the associations between transactions across tiles according to intervals;

FIG. 5 is a schematic diagram illustrating a process of a pipelined unit according to an embodiment of the present disclosure;

FIG. 6 is a block diagram illustrating a first embodiment of a pipelined unit in accordance with an embodiment of the present disclosure;

FIG. 7 is a schematic diagram illustrating one exemplary configuration of a first embodiment of a piping unit, according to an embodiment of the present disclosure;

FIG. 8 is a block diagram illustrating one exemplary configuration of a second embodiment of a pipelined unit in accordance with embodiments of the present disclosure;

FIG. 9 is a schematic diagram illustrating one exemplary configuration of a second embodiment of a piping unit, according to an embodiment of the present disclosure;

fig. 10 is a flowchart illustrating an information processing method according to an embodiment of the present disclosure; and

fig. 11 is a block diagram showing a general-purpose machine that can be used to implement the information processing method and the information processing apparatus according to the embodiment of the present disclosure.

Detailed Description

Hereinafter, some embodiments of the present disclosure will be described in detail with reference to the accompanying illustrative drawings. When elements of the drawings are denoted by reference numerals, the same elements will be denoted by the same reference numerals although the same elements are shown in different drawings. Further, in the following description of the present disclosure, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present disclosure unclear.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms are intended to include the plural forms as well, unless the context indicates otherwise. It will be further understood that the terms "comprises," "comprising," and "having," when used in this specification, are intended to specify the presence of stated features, entities, operations, and/or components, but do not preclude the presence or addition of one or more other features, entities, operations, and/or components.

Unless otherwise defined, all terms used herein including technical and scientific terms have the same meaning as commonly understood by one of ordinary skill in the art to which the inventive concept belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. The present disclosure may be practiced without some or all of these specific details. In other instances, to avoid obscuring the disclosure with unnecessary detail, only components that are germane to the scheme according to the disclosure are shown in the drawings, while other details that are not germane to the disclosure are omitted.

When the blockchain is applied to high concurrency applications, there is a problem of low throughput due to the existence of conflicting transactions. Experiments show that the performance bottleneck causing low throughput is the validation and submission process of the blockchain. In the validation and commit process of blockchains, two main factors affect the improvement of the throughput rate of blockchains.

First, during the verification and commit process of the blockchain, blocks are processed one by one, and only when the last block is processed, the processing of the next block is started. Therefore, the system computational power is often underutilized. Furthermore, each tile typically undergoes five operations during the validation and commit process, namely VSCC (verification system chain code) validation, MVCC (multi-version concurrency control) validation, commit to the ledger, commit to the state database, and commit to the historian. Currently, techniques are proposed to optimize VSCC verification and MVCC verification, but these optimizations still cannot significantly improve the throughput of the block chain.

Furthermore, there are excessive read and write operations to store information (e.g., databases) in the validation and commit process of the blockchain, which are time consuming. For example, version verification in MVCC verification operations, committing state values to a state database in committing to state database operations, and the like, all require read and write operations of the state database. In particular, when an external database requiring remote connection is used as the state database, the read-write operation of the state database is more time-consuming. Furthermore, when a block is processed, it needs to be written to a memory (e.g., a hard disk), which is also very time consuming.

Hereinafter, an information processing apparatus and an information processing method for improving the throughput rate of a blockchain according to an embodiment of the present disclosure will be described in detail by taking the superhedger Fabric architecture of the blockchain as an example with reference to the accompanying drawings. However, those skilled in the art will recognize that the inventive concepts of the present disclosure are equally applicable to other blockchain architectures. Further, in accordance with the present disclosure, the blockchain may be any federation chain.

Fig. 1 is a block diagram illustrating an information processing apparatus 100 according to an embodiment of the present disclosure. Fig. 2 is a schematic diagram illustrating a process performed by the information processing apparatus 100 according to an embodiment of the present disclosure.

The block chain is constructed based on a point-to-point (peer) distributed network, and nodes in the distributed network participate in a consensus process together to complete verification and recording of a transaction. For example, FIG. 2 illustrates the transaction process for a blockchain of the HyperLegendr Fabric architecture. As shown in fig. 2, the client submits a transaction to the distributed peer nodes, including parameters required for the transaction. The distributed nodes invoke chain code (via smart contracts) to perform transactions, which results in a read-write set of state data reads and writes. The distributed node then endorses the read-write set and broadcasts the transaction to a ranking node that provides a ranking service. The ordering node orders transactions in the transaction pool based on consensus and packs to tiles to form a tile queue, which is then distributed to individual peer nodes. Each peer node will verify all transactions in the block, including verification endorsement policies and version conflict verifications, and transactions that fail verification will be marked as invalid. And finally, each peer node informs the client of the success or failure of the transaction, so that the transaction is completed. Valid transactions are submitted to the ledger, status database and history database.

The blockchain transaction and accounting processes described above, and the resulting ledgers, are known to those skilled in the art, and therefore further detailed descriptions of their details are omitted herein for the sake of brevity.

As shown in fig. 1, according to an embodiment of the present disclosure, the information processing apparatus 100 may include a pre-authentication unit 101 and a channelization unit 102. The pre-verification unit 101 may pre-verify the validity of the transaction in the sorting node of the blockchain to determine whether the transaction is invalid, and transmit the pre-verification result to the peer node. The pipelining unit 102 may validate and submit transactions received from the sequencing nodes in a pipelined manner among peer nodes of the block chain, where the peer nodes include a VSCC validation module, an MVCC validation module, a submit to ledger module, a submit to status database module, and a submit to historical database module, and the pipelining unit performs functions of the VSCC validation module, the MVCC validation module, the submit to ledger module, the submit to status database module, and the submit to historical database module in a pipelined manner.

The configuration and function of the pre-authentication unit 101 and the channelization unit 102, respectively, are explained in detail below.

Pre-authentication unit 101

As shown in fig. 2, according to an embodiment of the present disclosure, a pre-verification unit 101 may be disposed in a sorting node of a blockchain, for pre-verifying validity of a transaction to determine whether the transaction is invalid, and transmitting a pre-verification result to a peer node.

According to an embodiment of the present disclosure, the pre-verification unit 101 may determine the association between transactions according to the read-write set of transactions, and determine whether the transactions are invalid according to the determined association.

Specifically, the pre-authentication unit 101 may extract the read-write set of the transaction.

The read-write set of transactions of the blockchain is used to verify the validity of the transactions. The read-write set typically includes a Key (Key), a Value (Value), and a Version (Version), and by comparing the Version with the Version of the world state, it can be determined whether the verification of the transaction is valid. In this regard, since the read-write sets of transactions for blockchains are well known to those skilled in the art, further description of the details of the read-write sets of transactions for blockchains is omitted herein for the sake of brevity.

According to the present disclosure, in order to alleviate the pressure of the verification and commit process at the peer node, cross-block transaction correlation (dependency) analysis may be performed in the ordering service process, and a part of invalid transactions may be predetermined in the ordering service process before the verification and commit process using the analysis result.

FIG. 3 is a schematic diagram illustrating the pre-authentication unit determining the type of association of a transaction from the read-write set of the transaction. Fig. 4 is a schematic diagram showing the pre-authentication unit building the correlation between transactions across tiles according to intervals. Fig. 3 and 4 together serve to illustrate that the pre-authentication unit determines whether a transaction is invalid based on the read-write set of the transaction.

According to an embodiment of the present disclosure, the pre-authentication unit 101 may determine a type of association of the transaction from the read-write set of the transaction, and determine whether the transaction is invalid based on the determined type.

According to an embodiment of the present disclosure, the pre-authentication unit 101 may define the following five types of transaction associations according to the read-write set of the transaction. In the following definitions of the first to fifth relevance types, i and j are both natural numbers, and j > i. In addition, in fig. 3, i, j, and k are all natural numbers, and j > i.

A first type of associativity (which may be referred to as Write-Read (W-R) dependency): transaction Ti updates the version (Ver-2) of a certain state (state-1), while transaction Tj reads the version (Ver-1) before the state (state-1);

a second type of association (which may be referred to as a Write-Range _ Query (W-RQ) dependency): transaction Ti updates the version (Ver-2) of a certain state (state-1), and transaction Tj + k uses the version (Ver-1) before the state (state-1) when performing range query;

a third type of association (which may be referred to as Read _ Low-Read _ High (RL-RH) dependency): the version of a certain state (state-1) read by transaction Ti is lower (Ver-1) and the version of that state (state-1) read by transaction Tj is higher (Ver-2);

a fourth dependency type (which may be referred to as Range _ Query _ Low-Read _ High (RQL-RH) dependency): when the transaction Ti carries out range query, the version of a certain state (state-1 or state-3) read by the transaction Ti is lower (Ver-1), and the version of the state (state-1 or state-3) read by the transaction Tj or Tj + k is higher (Ver-2); and

a fifth type of association (which may be referred to as Write-Write (W-W) dependency): both transaction Ti and transaction Tj update the same state.

According to the embodiment of the present disclosure, according to the above definition of the types of transaction relevance, the pre-authentication unit 101 provided in the sorting node may directly determine that some transactions having the first to fourth relevance types are invalid.

Specifically, as shown in (a) of fig. 3, for the first and second association types, since the previous transaction Ti writes (updates) a new version of a certain state, while the subsequent transaction Tj or Tj + k reads an old version of the state, the subsequent transaction Tj or Tj + k may be directly determined as an invalid transaction. At the same time, the previous transaction Ti may be determined to be a valid transaction.

Furthermore, as shown in fig. 3 (B), for the third relevance type, the previous transaction Ti can be directly determined as an invalid transaction because the previous transaction Ti reads an old version of a certain state, and the subsequent transaction Tj reads a new version of the state, which indicates that the read version of the previous transaction Ti has been modified. It should be noted that according to the above analysis, the pre-verification unit 101 can only determine that the previous transaction Ti is an invalid transaction, but cannot verify that the subsequent transaction Tj is a valid transaction. Whether the subsequent transaction Tj is valid or not still requires further verification in the peer node.

Furthermore, as shown in (C) of fig. 3, for the fourth relevance type, since the previous transaction Ti reads an old version of a certain state when performing the range query, and the subsequent transaction Tj or Tj + k reads a new version of the state, which indicates that the read version of the previous transaction Ti has been modified, the previous transaction Ti can be directly determined as an invalid transaction. It should be noted that according to the above analysis, the pre-verification unit 101 can only determine that the previous transaction Ti is an invalid transaction, but cannot verify that the subsequent transaction Tj or Tj + k is a valid transaction. Whether the subsequent transaction Tj or Tj + k is valid still requires further verification in the peer node.

Furthermore, for the fifth type of association, the previous transaction Ti and the subsequent transaction Tj both update (write) the same state, and thus it cannot be determined which transaction is invalid, so the validity of the previous transaction Ti and the subsequent transaction Tj needs to be further verified in the peer node.

According to an embodiment of the present disclosure, the pre-verification unit 101 may analyze the association between the transactions by using the read-write sets of the transactions, so as to determine which transactions are invalid, i.e., pre-verify the validity of the transactions. Subsequently, the sorting node may send the pre-verification result of the pre-verification unit 101 to the peer node, and the peer node may skip performing verification and submission processing on these invalid transactions according to the received pre-verification result, thereby reducing the computation and communication pressure of the peer node and improving the throughput rate of the block chain.

Alternatively, according to an embodiment of the present disclosure, the pre-authentication unit 101 may not send the transaction that is pre-authenticated as invalid to the peer node, thereby reducing the communication pressure between the sorting node and the peer node.

Further, according to an embodiment of the present disclosure, in order to determine the correlation between transactions, the pre-authentication unit 101 may construct a graph representing the correlation between transactions according to the read-write sets of transactions to intuitively understand the correlation between transactions.

An example of a chart of associations between constructed transactions is shown in FIG. 4. By way of example and not limitation, a dependency graph representing associations between transactions is shown in FIG. 4 constructed using read and write sets of transactions (represented by circles) included in

tiles

1, 2, and 3 (represented by boxes).

As can be seen from fig. 4, the pre-verification unit 101 may perform cross-block transaction correlation analysis to predetermine a portion of invalid transactions.

Pipelining unit 102

As shown in fig. 2, according to an embodiment of the present disclosure, a pipelining unit 102 may be disposed in a peer node of a blockchain for validating and submitting transactions received from a sequencing node in a pipelined manner.

As described above, each block typically undergoes five operations during the validation and commit process, namely VSCC (verification system chain code) validation, MVCC (multi-version concurrent control) validation, commit to the ledger, commit to the state database, and commit to the historian. Thus, as shown in fig. 2. The validation and commit process performed in the peer node includes five operations, namely, VSCC validation, MVCC validation, commit to the ledger, commit to the state database, and commit to the historical database, which are represented in fig. 2 as VSCC validation module, MVCC validation module, commit to the ledger module, commit to the state database module, and commit to the historical database module, respectively, in the peer node. Besides, in addition to the block queues, the peer nodes also include ledgers, Gossip protocol for inter-node communication, endorsement module for endorsement processing, status database, history database, and the like. The peer node and the above-mentioned functional modules comprised in the peer node are known to the person skilled in the art, and therefore a further detailed description of their details is omitted herein for the sake of brevity.

According to an example embodiment of the present disclosure, the pipelining unit 102 may perform the functions of a VSCC validation module, an MVCC validation module, a commit to ledger module, a commit to status database module, and a commit to history database module in a pipelined manner.

Fig. 5 is a schematic diagram illustrating the processing of the channelization unit 102 in accordance with an embodiment of the present disclosure. As shown on the left side in fig. 5, in the related art, in the authentication and commit process in the peer node, the blocks are sequentially processed one by one. Meanwhile, in the verification and submission processing process of each block, the VSCC verification module, the MVCC verification module, the account book module, the status database module and the history database module are sequentially arranged to execute corresponding processing functions. This sequential handling of serialization severely limits blockchain performance and does not take full advantage of system computing power. Thus, to leverage system computing power to improve throughput of the block chain, the pipelining unit 102 performs the functions of the VSCC validation module, the MVCC validation module, the submission to the ledger module, the submission to the status database module, and the submission to the historical database module in a pipelined manner. That is, the pipelining unit 102 may create multiple pipelines corresponding to the VSCC validation module, the MVCC validation module, the submission to ledger module, the submission to status database module, and the submission to history database module, respectively, for performing validation and submission processing in a pipelined manner. Specifically, as shown on the right side in fig. 5, each pipe corresponds to one functional module, and each time a block is processed by the previous pipe, the block is sent to the next pipe. In addition, a block queue is provided in each pipe for receiving blocks transmitted by the last pipe. In this way, multiple pipelines can process different blocks simultaneously. In addition, as each pipeline is provided with the block queue, the processing sequence of the blocks is ensured, and the consistency principle of the account book is ensured.

In this regard, in the prior art, the time taken for the validation and commit process for each block in a peer node may be estimated as the sum of the processing time of the VSCC validation module, the MVCC validation module, the commit to the ledger module, the commit to the status database module, and the commit to each of the historical database modules. According to an example embodiment of the present disclosure, through the pipelining process of the pipelining unit 102, the time consumed for the validation and submission process of each block in the peer node may be estimated as the maximum value of the processing times of the VSCC validation module, the MVCC validation module, the submission to the ledger module, the submission to the status database module, and the submission to each module in the history database module, i.e., the processing time consumed by the module with the slowest processing speed. Clearly, this can greatly increase the processing speed of the validation and commit process, thereby increasing the throughput rate of the blockchain.

As described above, the time taken for the validation and commit process by the pipelined transformation depends on the maximum of the processing time of each of the VSCC validation module, the MVCC validation module, the commit to the ledger module, the commit to the status database module, and the commit to the history database module, so these modules can be further optimized to increase the processing speed of the individual modules. Accordingly, this disclosure also proposes techniques for optimizing the MVCC validation module and the submit-to-state database module.

A first embodiment of a pipelining unit 102 for optimizing an MVCC validation module and a second embodiment of a pipelining unit 102 for optimizing a submission to a state database module according to the present disclosure are described below, respectively.

Fig. 6 is a block diagram illustrating a first embodiment of the channelization unit 102 in accordance with an embodiment of the present disclosure. Fig. 7 is a schematic diagram illustrating one exemplary configuration of a first embodiment of the piping unit 102, according to an embodiment of the present disclosure.

As shown in fig. 6, according to an embodiment of the present disclosure, the pipelining unit 102 may include a caching subunit 1021, which is disposed in a peer node, and is used to temporarily store a read set of transactions according to the association between the transactions determined by the pre-verification unit 101.

As shown in fig. 7, in the peer node, each transaction requires reading the state database in the endorsement process to obtain a Version (Version). Furthermore, when the transaction reaches the MVCC verification module for version verification processing, the status database also needs to be read to ensure that the version used for endorsement and the version used for verification are consistent with each other.

According to this embodiment of the present disclosure, considering that the status database needs to be read to obtain the version in both endorsement and MVCC authentication, the cache subunit 1021 may be arranged to temporarily store the version read from the status database in the endorsement process, such that when a transaction reaches the MVCC authentication module, only the version needs to be obtained from the cache subunit 1021 without having to access the status database again. Thus, the reading time of the state database is saved, and the processing speed of the MVCC verification module can be improved.

Therefore, according to this embodiment of the present disclosure, the cache subunit 1021 may be provided in the MVCC verification module to reduce querying of the state database by the MVCC verification module.

In addition, as described above, the pre-verification unit 101 can perform cross-block transaction relevance analysis in the sorting node, so that the relevance between transactions can be known in advance. Since the MVCC verification process in the peer node needs to read the status database to obtain the version, according to this embodiment of the present disclosure, MVCC verification of transactions can be performed in parallel in the peer node according to the association between transactions determined by the pre-verification unit 101. In this regard, since the MVCC verification process in the peer node needs to read the state database, the read set of transactions is temporarily stored in the cache subunit 1021, so that the verification of transactions can be performed in parallel using the correlation between transactions, thereby further increasing the speed of verification and thus increasing the throughput of the block chain.

Fig. 8 is a block diagram illustrating one exemplary configuration of a second embodiment of the channelization unit 102 in accordance with an embodiment of the present disclosure. Fig. 9 is a schematic diagram illustrating one exemplary configuration of a second embodiment of the channelization unit 102 in accordance with an embodiment of the present disclosure.

As shown in fig. 8, according to an embodiment of the present disclosure, the pipelining unit 102 may include a merging sub-unit 1022 disposed in the peer node for merging the blocks according to the relevance determined by the pre-verification unit 101.

In many examples, an external database may be used as the state database, and thus connecting the external database frequently may consume a large amount of time, adversely affecting processing speed. Thus, in accordance with embodiments of the present disclosure, to optimize, i.e., increase the processing speed of, the commit process to the status database module, the queue of blocks committed into the status database module may be analyzed to determine the manner in which the blocks were committed.

As described above, the pre-verification unit 101 can perform cross-block transaction relevance analysis in the sorting node, so that it can be determined that the transactions Ti and Tj have the fifth relevance type (W-W dependency), i.e., both transactions Ti and Tj update the same state. Therefore, according to this embodiment of the present disclosure, the merging subunit 1022 may determine whether there is a transaction between different blocks that updates the same status according to the correlation between the transactions determined by the pre-authentication unit 101.

According to an embodiment of the present disclosure, a merge subunit 1022 may be provided in the commit to status database module to merge the blocks according to the determined associations, and to commit the merged blocks to the status database in parallel.

In particular, as shown in fig. 9, merge subunit 1022 may read the block from the block queue submitted to the status database module and obtain information about the W-W dependencies of the transaction from pre-verification unit 101.

As shown in fig. 9, for different blocks to be committed to the state database, if there is no transaction between the blocks to be committed (e.g., between

blocks

3 and 2 and between blocks 3 and 1) that updates the same state, i.e., there is no transaction with a W-W dependency, the merge subunit 1022 may commit the blocks to the state database in parallel. Thus, multiple connection requests to the state database can be initiated simultaneously per unit time, thereby increasing processing speed and correspondingly increasing throughput of the blockchain. Conversely, if there is a transaction between blocks to be committed (e.g., between blocks 1 and 2) that updates the same state, i.e., there is a transaction with a W-W dependency, then the merge subunit 1022 may merge

blocks

1 and 2 to commit together to the state database. Thus, connection requests to the state database may be reduced, thereby increasing processing speed and correspondingly increasing throughput of the blockchain.

According to the embodiment of the disclosure, the processing speed of the MVCC verification module and the merge subunit 1022 submitted to the status database module can be greatly increased by the cache subunit 1021 provided in the peer node for optimizing the MVCC verification module and/or the merge subunit 1022 provided in the peer node for optimizing the merge subunit submitted to the status database module, so that the throughput of the block chain is increased.

Fig. 10 is a flow chart illustrating an information processing method 1000 according to an embodiment of the present disclosure.

The information processing method 1000 starts at step S1001. Subsequently, in step S1002, the validity of the transaction is pre-verified in the sorting node of the blockchain to determine whether the transaction is invalid, and the pre-verification result is sent to the peer node. According to an embodiment of the present disclosure, the processing in step S1002 may be implemented, for example, by the pre-verification unit 101 according to the description above with reference to fig. 1 to 9, and thus will not be described herein again.

Subsequently, in step S1003, the transaction received from the sequencing node is validated and submitted in a pipelined manner in the peer nodes of the block chain, wherein the peer nodes include the VSCC validation module, the MVCC validation module, the submit to ledger module, the submit to status database module, and the submit to history database module, and the functions of the VSCC validation module, the MVCC validation module, the submit to ledger module, the submit to status database module, and the submit to history database module are executed in a pipelined manner. According to an embodiment of the present disclosure, the processing in step S1003 may be implemented, for example, by the channelization unit 102 described above with reference to fig. 1 to 9, and thus will not be described herein in detail.

Finally, the information processing method 1000 ends in step S1004.

According to the information processing device and the information processing method disclosed by the disclosure, the speed of verification and submission processing of the block chain can be greatly increased, so that the throughput rate of the block chain is increased, and the performance of a block chain system is improved.

Fig. 11 is a block diagram showing a general-purpose machine 1100 that can be used to implement the information processing method and the information processing apparatus according to the embodiment of the present disclosure. General purpose machine 1100 may be, for example, a computer system. It should be noted that the general-purpose machine 1100 is only an example and does not imply limitation to the range of use or functions of the information processing method and the information processing apparatus of the present disclosure. Neither should the general purpose machine 1100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the above-described information processing methods or information processing apparatuses.

In fig. 11, a Central Processing Unit (CPU)1101 performs various processes, such as the various processes described in connection with fig. 1 to 10, in accordance with a program stored in a Read Only Memory (ROM)1102 or a program loaded from a storage section 1108 to a Random Access Memory (RAM) 1003. In the RAM 1103, data necessary when the CPU1101 executes various processes and the like is also stored as necessary. The CPU1101, ROM 1102, and RAM 1103 are connected to each other via a bus 1104. An input/output interface 1105 is also connected to bus 1104.

The following components are also connected to the input/output interface 1105: an input section 1106 (including a keyboard, a mouse, and the like), an output section 1107 (including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker and the like), a storage section 1108 (including a hard disk and the like), a communication section 1109 (including a network interface card such as a LAN card, a modem, and the like). The communication section 1109 performs communication processing via a network such as the internet. The driver 1110 may also be connected to the input/output interface 1105 as needed. A removable medium 1111 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like may be mounted on the drive 1110 as necessary, so that a computer program read out therefrom may be installed into the storage section 1108 as necessary.

In the case where the series of processes described above is implemented by software, a program constituting the software may be installed from a network such as the internet or from a storage medium such as the removable medium 1111.

It should be understood by those skilled in the art that such a storage medium is not limited to the removable medium 1111 shown in fig. 11, in which the program is stored, distributed separately from the apparatus to provide the program to the user. Examples of the removable medium 1111 include a magnetic disk (including a flexible disk), an optical disk (including a compact disc read only memory (CD-ROM) and a Digital Versatile Disc (DVD)), a magneto-optical disk (including a mini-disk (MD) (registered trademark)), and a semiconductor memory. Alternatively, the storage medium may be the ROM 1102, a hard disk included in the storage section 1108, or the like, in which programs are stored and which are distributed to users together with the device including them.

In addition, the present disclosure also provides a program product storing machine-readable instruction codes. The instruction codes are read by a machine and can execute the information processing method according to the disclosure when being executed. Accordingly, various storage media as listed above for carrying such program products are also included within the scope of the present disclosure.

Having described in detail in the foregoing through block diagrams, flowcharts, and/or embodiments, specific embodiments of apparatus and/or methods according to embodiments of the disclosure are set forth. When such block diagrams, flowcharts, and/or implementations contain one or more functions and/or operations, it will be apparent to those skilled in the art that each function and/or operation in such block diagrams, flowcharts, and/or implementations can be implemented, individually and/or collectively, by a variety of hardware, software, firmware, or virtually any combination thereof. In one embodiment, several portions of the subject matter described in this specification can be implemented by Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), Digital Signal Processors (DSPs), or other integrated forms. Those skilled in the art will recognize, however, that some aspects of the embodiments described in this specification can be equivalently implemented, in whole or in part, in the form of one or more computer programs running on one or more computers (e.g., in the form of one or more computer programs running on one or more computer systems), in the form of one or more programs running on one or more processors (e.g., in the form of one or more programs running on one or more microprocessors), in the form of firmware, or in virtually any combination thereof, and, it is well within the ability of those skilled in the art to design circuits and/or write code for use in the present disclosure, based on the disclosure herein, software and/or firmware for the present disclosure.

It should be emphasized that the term "comprises/comprising" when used herein, is taken to specify the presence of stated features, elements, steps or components, but does not preclude the presence or addition of one or more other features, elements, steps or components. The terms "first," "second," and the like, as used in ordinal numbers, do not denote an order of execution or importance of the features, elements, steps, or components defined by the terms, but are used merely for identification among the features, elements, steps, or components for clarity of description.

In summary, in the embodiments according to the present disclosure, the present disclosure provides the following schemes, but is not limited thereto:

an information processing apparatus includes:

a pre-verification unit configured to pre-verify validity of the transaction in a sorting node of the blockchain to determine whether the transaction is invalid and send a pre-verification result to a peer node; and

a pipelining unit configured to validate and submit transactions received from a sequencing node in a pipelined manner in peer nodes of the blockchain,

wherein, the peer node comprises a checking system chain code verification module, a multi-version concurrent control verification module, an account book submitting module, a state database submitting module, a historical database submitting module and an

The pipelining unit executes the functions of the checking system chain code verification module, the multi-version concurrent control verification module, the submission to the account book module, the submission to the state database module and the submission to the historical database module in a pipelining mode.

Scheme 2. the information processing apparatus according to scheme 1, wherein the blockchain is a federation chain.

Scheme 3. the information processing apparatus according to

scheme

1 or 2, wherein the pre-authentication unit is configured to determine an association between transactions according to a read-write set of transactions, determine whether a transaction is invalid according to the determined association, and transmit a pre-authentication result to the peer node.

Scheme 4. the information processing apparatus according to scheme 3, wherein the pre-authentication unit is configured to determine a type of association of the transaction from the read-write set of the transaction, and determine whether the transaction is invalid based on the determined type.

Scheme 5. the information processing apparatus according to scheme 4, wherein the pre-authentication unit is configured to construct a chart representing the association between transactions from the read-write sets of transactions.

Scheme 6. the information processing apparatus according to scheme 3, wherein the pipelining unit includes:

a caching subunit disposed in the peer node and configured to temporarily store a read set of transactions according to the determined associativity.

Scheme 7. the information processing apparatus according to scheme 6, wherein the cache subunit is disposed in the multi-version concurrency control validation module to reduce querying of the state database by the multi-version concurrency control validation module.

Scheme 8. the information processing apparatus according to scheme 6, wherein the pipelining unit includes:

a merging subunit disposed in the peer node and configured to merge the tiles according to the determined association.

Scheme 9. the information processing apparatus according to scheme 8, wherein the merge subunit is provided in the submit-to-status database module to submit the blocks merged according to the determined relevance in parallel to the status database.

An information processing method, comprising the steps of:

pre-verifying the validity of the transaction in a sorting node of the blockchain to determine whether the transaction is invalid, and sending a pre-verification result to a peer node; and

validating and submitting transactions received from a sequencing node in a pipelined manner in peer nodes of the blockchain,

wherein the peer node comprises a checking system chain code verification module, a multi-version concurrent control verification module, an account book submitting module, a state database submitting module, a history database submitting module and an

And the functions of the checking system chain code verification module, the multi-version concurrent control verification module, the submission to the account book module, the submission to the state database module and the submission to the history database module are executed in a pipelined mode.

Scheme 11. the information processing method of scheme 10, wherein the blockchain is a federation chain.

Scheme 12. the information processing method according to scheme 10 or 11, wherein the pre-verification includes determining a correlation between transactions according to a read-write set of the transactions, determining whether the transactions are invalid according to the determined correlation, and transmitting a pre-verification result to the peer node.

Scheme 13. the information processing method according to scheme 12, wherein the pre-verifying includes determining a type of association of the transaction from a read-write set of the transaction, and determining whether the transaction is invalid based on the determined type.

Scheme 14. the information processing method according to scheme 13, wherein the pre-verification includes constructing a graph representing the association between transactions according to the read-write sets of transactions.

Scheme 15. the information processing method according to scheme 12, wherein the pipelining comprises:

temporarily storing the read set of transactions according to the determined associations.

Scheme 16. the information processing method of scheme 15, wherein temporarily storing the read sets of transactions is used to reduce querying of the state database by the multi-version concurrency control validation module.

An information processing method according to claim 15, wherein the pipelining includes:

the blocks are merged according to the determined association.

Scheme 18. the information processing method of scheme 17, wherein merging blocks comprises submitting blocks merged according to the determined associations in parallel to a state database.

A computer-readable storage medium on which a computer program is stored, the program, when executed by the computer, causing the computer to implement an information processing method, the information processing method comprising the steps of:

While the disclosure has been described in terms of specific embodiments thereof, it will be appreciated that those skilled in the art will be able to devise various modifications, improvements, or equivalents of the disclosure within the spirit and scope of the appended claims. Such modifications, improvements and equivalents are also intended to be included within the scope of this disclosure.

Claims

1. An information processing apparatus includes:

a pre-verification unit configured to pre-verify validity of the transaction in a sorting node of the blockchain to determine whether the transaction is invalid, and send a pre-verification result to a peer node; and

2. The information processing apparatus according to claim 1, wherein the block chain is a federation chain.

3. The information processing apparatus according to claim 1 or 2, wherein the pre-authentication unit is configured to determine an association between transactions from a read-write set of transactions, determine whether a transaction is invalid from the determined association, and transmit a pre-authentication result to the peer node.

4. The information processing apparatus according to claim 3, wherein the pre-authentication unit is configured to determine a type of association of the transaction from a read-write set of the transaction, and determine whether the transaction is invalid based on the determined type.

5. The information processing apparatus according to claim 4, wherein the pre-authentication unit is configured to construct a chart representing an association between transactions from a read-write set of transactions.

6. The information processing apparatus according to claim 3, wherein the pipelining unit includes:

7. The information processing apparatus according to claim 6, wherein the cache subunit is provided in the multi-version concurrency control verification module to reduce querying of a status database by the multi-version concurrency control verification module.

8. The information processing apparatus according to claim 6, wherein the pipelining unit includes:

9. The information processing apparatus according to claim 8, wherein the merge subunit is provided in the commit to status database module to commit the blocks merged according to the determined associativity to the status database in parallel.

10. An information processing method comprising the steps of: