CN114553896A

CN114553896A - Information processing system, information processing method, and computer-readable storage medium

Info

Publication number: CN114553896A
Application number: CN202011342985.8A
Authority: CN
Inventors: 皮冰锋; 丁越; 潘业达; 孙俊
Original assignee: Fujitsu Ltd
Current assignee: Fujitsu Ltd
Priority date: 2020-11-25
Filing date: 2020-11-25
Publication date: 2022-05-27
Also published as: JP2022083977A

Abstract

An information processing system, an information processing method, and a computer-readable storage medium based on a block chain are disclosed. The information processing system includes: at least one node group, each node group comprising at least one node, each node being configured to store a transaction list of blocks of the node into a data storage and management device communicably connected to the at least one node group, and the data storage and management device comprising at least one storage unit in one-to-one correspondence with the at least one node group, wherein each node group and the storage unit corresponding to the node group contain the same association information, wherein the association information is used to indicate that the source of the transaction list stored by each storage unit is the node group corresponding to the storage unit and is used to verify whether the transaction list has been tampered, and the association information comprises block identifications and authentication parameters of the respective blocks of each node in the corresponding node group and the node identification of each node.

Description

Information processing system, information processing method, and computer-readable storage medium

Technical Field

The present disclosure relates to the field of information processing, and in particular, to an information processing system, an information processing method, and a computer-readable storage medium.

Background

With the maturity of the blockchain technology, the scale of the application gradually expands, and the problem of expandability of blockchain ledger storage is imminent.

For each node in the blockchain network, the same ledger data needs to be saved to achieve data consistency of the whole blockchain network. Unlike traditional distributed networks, the block chain based decentralized network application does not increase the storage size with the addition of new nodes, and each node must expand its storage size. Along with the expansion of transaction scale in application, the size of the block account book is gradually increased, and the storage burden of the node is heavier and heavier. Accordingly, it is desirable to be able to improve the storage of block accounts.

Disclosure of Invention

The following presents a simplified summary of the disclosure in order to provide a basic understanding of some aspects of the disclosure. However, it should be understood that this summary is not an exhaustive overview of the disclosure. It is not 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 of the disclosure in a simplified form as a prelude to the more detailed description that is presented later.

In view of the above problems, it is an object of the present disclosure to provide a solution to one or more of the disadvantages of the prior art. According to an aspect of the present disclosure, there is provided a block chain-based information processing system including: at least one node group, each node group including at least one node, each node configured to store a transaction list of blocks of the node into a data storage and management device communicably connected to the at least one node group, and the data storage and management device including at least one storage unit in one-to-one correspondence with the at least one node group, wherein each node group and the storage unit corresponding to the node group contain the same association information for indicating that a source of the transaction list stored by each storage unit is the node group corresponding to the storage unit and for verifying whether the transaction list has been tampered with, and the association information includes a block identification and an authentication parameter of each block of each node in the corresponding node group and a node identification of each node, and wherein the authentication parameters are generated based on a transaction list of the respective block.

According to another aspect of the present disclosure, there is provided an information processing method including: a transaction list writing step of storing a transaction list of blocks of respective nodes in at least one node group into a data storage and management apparatus communicably connected to the at least one node group, wherein each node group includes at least one node, and the data storage and management apparatus includes at least one storage unit in one-to-one correspondence with the at least one node group; and an associated information generating and storing step of generating associated information and storing the associated information in the at least one node group and the data storage and management device, wherein the associated information is used to indicate that a source of a transaction list stored by each storage unit is a node group corresponding to the storage unit and is used to verify whether the transaction list is tampered, and the associated information includes a block identifier and an authentication parameter of each block of each node in the corresponding node group and a node identifier of each node, wherein each node group and the storage unit corresponding to the node group contain the same associated information, and wherein the authentication parameter is generated based on the transaction list of the corresponding block.

According to other aspects of the present disclosure, there are also provided computer program code and a computer program product for implementing the above-described method according to the present disclosure, and a computer readable storage medium having recorded thereon the computer program code for implementing the above-described method according to the present disclosure.

Additional aspects of the disclosed embodiments are set forth in the description section that follows, wherein the detailed description is presented to fully disclose the preferred embodiments of the disclosed embodiments without imposing limitations thereon.

Drawings

The disclosure may be better understood by reference to the following detailed description taken in conjunction with the accompanying drawings, in which like or similar reference numerals are used throughout the figures to designate like or similar components. The accompanying drawings, which are incorporated in and form a part of the specification, further illustrate preferred embodiments of the present disclosure and explain the principles and advantages of the present disclosure, are incorporated in and form a part of the specification. Wherein:

fig. 1 is a block diagram showing a configuration example of a block chain-based information processing system according to an embodiment of the present disclosure;

FIG. 2 is a block diagram illustrating an example of an architecture for one particular implementation of a blockchain based information handling system according to an embodiment of the present disclosure;

fig. 3 shows an example of data stored in a certain node group and a storage unit corresponding to the node group;

FIG. 4 shows one example of a Merckle Tree (Merkle Tree) created in the example case of using the Merckle Tree to generate authentication parameters and verification parameters;

fig. 5 is a diagram showing an example of signal flow between devices in the case where a client device retrieves a transaction;

FIG. 6 shows an example of data stored in respective storage units and one example of a Merck tree created in the case of an example in which coherent blocks and non-coherent blocks are determined by creating a Merck tree;

fig. 7 is a flowchart showing an example of a flow of an information processing method according to an embodiment of the present disclosure; and

fig. 8 is a block diagram showing an example structure of a personal computer employable in the embodiments of the present disclosure.

Detailed Description

Exemplary embodiments of the present disclosure will be described hereinafter with reference to the accompanying drawings. In the interest of clarity and conciseness, not all features of an actual implementation are described in the specification. It will of course be appreciated that in the development of any such actual embodiment, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which will vary from one implementation to another. Moreover, it will be appreciated that such a development effort might be complex and time-consuming, but would nevertheless be a routine undertaking for those of ordinary skill in the art having the benefit of this disclosure.

Further, in the present specification and the drawings, there are also the following cases: a plurality of components having substantially the same functional configuration are distinguished by attaching different letters after the same reference numeral. For example, the memory cells are divided into memory cells 1042a and 1042b as necessary. However, in the case where it is not necessary to particularly distinguish each of the plurality of components having substantially the same functional configuration, only the same reference numeral is attached. For example, in the case where it is not necessary to particularly distinguish between the memory unit 1042a and the memory unit 1042b, the memory unit 1042a and the memory unit 1042b are simply referred to as the memory unit 1042.

Here, it should be further noted that, in order to avoid obscuring the present disclosure with unnecessary details, only the device structures and/or processing steps closely related to the scheme according to the present disclosure are shown in the drawings, and other details not so relevant to the present disclosure are omitted.

Embodiments according to the present disclosure are described in detail below with reference to the accompanying drawings.

First, an implementation example of a block chain based information processing system according to an embodiment of the present disclosure will be described with reference to fig. 1 and 2. Fig. 1 is a block diagram showing a configuration example of a block chain-based information processing system 100 according to an embodiment of the present disclosure. Fig. 2 is a block diagram illustrating an example of an architecture of one particular implementation of a blockchain-based information processing system according to an embodiment of the present disclosure.

As shown in fig. 1 and 2, a blockchain-based information processing system 100 according to an embodiment of the present disclosure may include at least one node group 102 and a data storage and management apparatus 104 communicably connected to the at least one node group 102.

Each node group 102 may include at least one node, and each node may be configured to store a transaction list of the block of the node to the data storage and management device 104. For example, as shown in FIG. 2, each node group 102 may include the same number of nodes, i.e., nodes P1, P2 … Pn (n is a natural number greater than 0). However, each node group 102 may include a different number of nodes.

The data storage and management device 104 may include at least one storage unit 1042 in one-to-one correspondence with the at least one node group 102. For example, as shown in fig. 2, in the case where the information processing system 100 includes 4 node groups, the data storage and management apparatus 104 may include 4 storage units 1042 corresponding to the 4 node groups one to one.

Each node group 102 and the storage unit 1042 corresponding to the node group contain the same association information. The association information is used to indicate that the source of the transaction list stored by each storage unit 1042 is the node group 102 corresponding to the storage unit 1042 and is used to verify whether the corresponding transaction list is tampered, and the association information includes the block identifier and the authentication parameter of each block of each node in the corresponding node group 102 and the node identifier of each node. Wherein the authentication parameters are generated based on the transaction list of the corresponding block.

As blockchain technology matures and the size of applications gradually expands, the problem of scalability of blockchain ledger (i.e., collection of transaction lists) storage is at a premium. As described above, in the information processing system 100 according to the embodiment of the present disclosure, each node group 102 deposits the transaction list of the block of the node to the data storage and management device 104 communicably connected to each node group 102, so that, for example, the ledger storage burden of the node can be reduced, realizing a lightweight node. Further, in the information processing system 100 according to the embodiment of the present disclosure, whether the corresponding transaction list is falsified is verified by the association information, so that the correctness of the transaction data can be ensured.

In addition, for example, in the information processing system 100 according to the embodiment of the present disclosure, the data storage and management device 104 communicably connected with each node group 102 is easily expandable, so that expandable storage of ledger data can be provided.

By way of illustration and not limitation, blockchain-based information handling system 100 may be a federation chain-based information handling system. In this case, the node groups may correspond one-to-one to organizations (organizations).

For example, according to an embodiment of the present disclosure, the data storage and management device 104 may be further configured to perform the following for each storage unit 1042: for each block, grouping the transaction lists of the block received by the storage unit based on the authentication parameters of the block to obtain at least one transaction list group of the block, wherein all transaction lists in the same transaction list group are the same; and for each transaction list set, storing only one transaction list of the transaction list set in the storage unit, and storing node identifications of nodes from which the respective transaction lists of the transaction list set are received and a set of authentication parameters of the one transaction list in association with the one transaction list in the storage unit. Wherein the set of verification parameters is generated based on the corresponding transaction list.

The above-described operations performed by the data storage and management apparatus 104 on each storage unit 1042 according to the embodiment of the present disclosure will be further explained with reference to fig. 3 in conjunction with a specific example. Fig. 3 shows an example of data stored in a certain node group 102a and a storage unit 1042a corresponding to the node group.

In the example shown in FIG. 3, assume that node group 102a includes n node Peer₁、Peer₂…Peer_n(FIG. 3 shows only the nodes Peer₁) And each node includes m blocks Blk₁、Blk₂…Blk_mWherein n and m are natural numbers greater than 0.

As shown in fig. 3, each node of the node group 102a stores the transaction list of the node in the storage unit 1042a corresponding to the node group 102 a. In an example case where the node group 102a includes n nodes and each node includes m banks, the storage unit 1042a may receive the banks Blk from each of the n nodes from the node group 102a₁、Blk₂…Blk_mThe transaction list of (1). That is, the memory unit 1042a can receive the block Blk₁N transaction lists, Blk₂N transaction lists … block Blk_mN transaction lists.

For example, the data storage and management device 104 may target the block Blk₁Based on block Blk₁Respective authentication parameter Commitment of₁For the block Blk received by the memory unit 1042a₁Are grouped to obtain the block Blk₁Wherein all transaction listings included in the same transaction listing group are the same. For example, assume that the data storage and management device 104 obtains the block Blk₁Two trading list sets GL1 and GL2 (not shown in the figures), wherein GL1 and GL2 respectively comprise f₁And n-f₁A transaction list. Wherein, f₁Is a natural number, and 1 ≦ f₁< n. The data storage and management device 104 may store any one of the f transaction lists (e.g., transaction list L1) included in the transaction list group GL1 in the storage unit 1402a, and any one of the n-f transaction lists (e.g., transaction list L12) included in the transaction list group GL2 in the storage unit 1042 a.

Further, the data storage and management device 104 may identify the node (e.g., node Peer) from which the node of each transaction list in the transaction list set GL1 was received₁Node identification P of₁Sig, node Peer₂Node identification P of₂Sig, etc.) and the verification parameter set proof of the one transaction list L1 are stored in the storage unit 1042a in association with the one transaction list L1. Similarly, the data storage and management device 104 may receive transactions therefromNode identification of nodes (e.g., node Peer) for each transaction listing in listing group GL2_jNode identification P of_jSig, etc., where j is a natural number greater than 0) and the verification parameter set proof of the one transaction list L12 are stored in the storage unit 1042a in association with the one transaction list L12.

In addition, the data storage and management device 104 may target the block Blk₂…Blk_mPerform the above for the block Blk₁The processes performed are similar and will not be described again.

According to the above-described embodiments of the present disclosure, the transaction lists of the respective blocks in the same storage unit are grouped, and only one of the transaction lists is stored for the same transaction list group, so that the block data storage amount can be reduced, for example, as compared with hyper ledger Fabric (hyper ledger) in which all the block data is stored in the ledger database. Further, according to the above-described embodiments of the present disclosure, the set of verification parameters generated based on the transaction list is stored in association with the corresponding transaction list, so that the correctness of the transaction data can be further ensured.

For example, according to embodiments of the present disclosure, each node may be further configured to generate a set of authentication parameters and corresponding set of validation parameters for each transaction block using a merkel tree, an RSA accumulator (see, e.g., Boneh D, bnz B, fish B. locking techniques for accessing transactions with applications to and from transaction blocks [ C ]// Annual International cryptography conference. springer, Cham,2019: 561-.

For example, in a case where a node uses a mercker tree to generate authentication parameters for each block and a set of verification parameters for a corresponding transaction list, the node may create a mercker tree based on each transaction included in the transaction list for each transaction list, and use a root node of the mercker tree as an authentication parameter for the block corresponding to the transaction list; for each transaction, using as a verification parameter for the transaction a set of sibling nodes of the path of the transaction to the root node in the above-mentioned Merck tree; and for each transaction list, using the set of verification parameters for each transaction included in the transaction list as the set of verification parameters for the transaction list.

The above exemplary manner of generating the authentication parameter and the verification parameter set will be further described with reference to fig. 4 in conjunction with a specific example. FIG. 4 shows an example scenario for a block Blk in the case of using the Mercker tree to generate authentication and verification parameters₁Example of the mercker tree created by the transaction list L1. In FIG. 4, assume that transaction List L1 includes 8 transactions Tx₁、Tx₂、Tx₃、Tx₄、Tx₅、Tx₆、Tx₇And Tx₈。

As shown in fig. 4, the Root node Root of the mercker tree created for the transaction list L1 may be used as an authentication parameter for the tile corresponding to the transaction list L1. Further, for transaction Tx₄Tx is to be traded in the Mercker tree₄Set of sibling nodes of the path to Root node Root (i.e., Hash)₃、Hash₁₂And Hash₅₆₇₈) Used as transaction Tx₄The verification parameters of (1). In addition, the node may target the remaining transactions Tx in the transaction list L1₁、Tx₂、Tx₃、Tx₅、Tx₆、Tx₇And Tx₈For transaction Tx as described above₄The verification parameters for the corresponding transactions are obtained in a similar manner as illustrated, and the set of verification parameters for each transaction included in the transaction list L1 is used as the set of verification parameters for the transaction list L1.

For example, according to an embodiment of the present disclosure, each node includes: a query unit for sending a block identification of a query block to the data storage and management device 104, and receiving a transaction list and a set of verification parameters of the query block from the storage unit 1042 corresponding to the node, wherein the query block is a block to which the transaction list is to be queried; and a verification unit, configured to verify the received transaction list of the query block based on the verification parameter set of the query block received from the storage unit 1042 and the authentication parameter of the query block stored in the node.

The functional configuration of the querying unit and the verifying unit is further explained with reference to fig. 5 in conjunction with a specific example. Fig. 5 is a diagram showing an example of signal flow between respective devices in the case where a client device retrieves a transaction.

For example, as shown in FIG. 5, a client device may Peer to one node Peer in the node group 102a₁Information for retrieving the transaction list is sent. For example, the information used to retrieve the transaction list may include an identification of the transaction list to be retrieved and/or an identification of the block associated with the transaction list to be retrieved. Upon receiving information sent from a client device for retrieving a transaction list, a node Peer₁May determine a query block based on the received information for retrieving the transaction list and send a block identification of the query block to the data storage and management device 104 (not shown in fig. 5). The data storage and management device 104 may respond to receipt of the block identification of the query block to be compared with the node Peer₁The transaction list (e.g., consistent transaction list as will be described below) of the query block stored in the corresponding storage unit 1042a and the corresponding set proof of verification parameters are sent to the node Peer₁. Node Peer₁May be based on the verification parameter set proof and the node Peer of the query block received from the storage unit 1042a₁The authentication parameters of the query block stored in (1) are used for verifying the received transaction list of the query block. In the case that the verification unit determines that the received transaction list of the query block is not tampered, the node Peer₁A transaction list of the verified query block may be sent to the client.

For example, in the case where the authentication parameters of the query block and the verification parameter set of the corresponding transaction list are generated based on the mercker tree, the verification unit may determine whether the received verification parameter set proof of the query block is the node Peer₁The authentication parameters of the query block stored inAnd determining that the verification parameter set proof of the received query block is the node Peer₁The verification unit may determine that the received transaction list of the query block is not falsified in case of a member of the authentication parameters of the query block stored in (b), otherwise, determine that the verification parameter set proof of the received query block is not the node Peer₁The verification unit may determine that the received transaction list of the query tile is tampered with in the case of a member of the authentication parameters of the query tile stored therein.

Note that for ease of illustration, only one node Peer of the node group 102 is shown in FIG. 5₁And one storage unit 1042a of the data storage and management device 104, however, the node group 102 may include a plurality of nodes, and accordingly, the data storage and management device 104 may include a plurality of storage units.

For example, according to an embodiment of the present disclosure, the data storage and management device 104 may be further configured to perform the following operations for each storage unit 1042: for each tile, determining the transaction list stored in the storage unit 1042 among the transaction list sets of the tile, wherein the number of the transaction lists in each transaction list set of the tile is greater than a predetermined number, as a consistent transaction list of the tile, wherein the predetermined number is equal to the number of the common nodes in the node set 102 corresponding to the storage unit 1042; and in the case that a new node is added to the node group corresponding to the storage unit 1042, sending the authentication parameters associated with the consistent transaction lists stored in the storage unit 1042 to the new node, and storing the node identification of the new node in the storage unit 1042 in association with each consistent transaction list.

For example, for each node group, the consensus node represents the node in the node group that agreed upon the transaction data. For example, the number of common nodes may be equal to 2/3 × n +1, where n is a natural number greater than 0, indicating the number of nodes included in the corresponding node group.

The above-described operations performed by the data storage and management apparatus 104 for each storage unit 1042 will be further explained with reference to specific examples.

For example, assume that for the node group 102a, the data storage and management device 104 obtains the block Blk₂And the number of transaction lists in the transaction list group GL3 is greater than the number of consensus nodes in the node group 102a, the data storage and management device 104 may determine the transaction list (e.g., the transaction list L2 shown in fig. 2) stored in the storage unit 1042 corresponding to the node group 102a in the transaction list group GL3 as the tile Blk₂To a consistent transaction list. In addition, the data storage and management device 104 may perform the above-described operations for the block Blk for other blocks of the node group 102a₂The processing performed is similar to the processing performed to obtain the consistent transaction list of the corresponding block, which will not be described herein again. Note that some blocks may not have a consistent transaction list.

Further, in the case where a new node 102t (not shown in the drawing) is added to the node group 102a, the data storage and management apparatus 104 may transmit the authentication parameters of the block corresponding to the consistent transaction list stored in the storage unit 1042a corresponding to the node group 102a to the new node 102t, and store the node identification of the new node 102t in the storage unit 1042 in association with each consistent transaction list.

According to the above-described embodiment of the present disclosure, the data storage and management apparatus 104 may determine, for each node group, the consistent transaction lists of the respective blocks, and in a case where a new node is added to the node group, transmit the authentication parameters associated with the consistent transaction lists to the new node, and store the node identification of the new node in association with each consistent transaction list, so that in a case where a new node is added, data synchronization between the newly added node and other nodes in the corresponding node group may be quickly achieved.

For example, in accordance with embodiments of the present disclosure, the data storage and management device 104 may be further configured to determine consistent blocks and non-consistent blocks based on authentication parameters associated with a consistent transaction list stored by each storage unit 1042; and in the case where a new node group is added (for example, in the case where a new organization is added in the example case where the information processing system 100 is a federation chain-based information processing system), a new storage unit is created for the new node group, and the block identification of the coherent block obtained from any one of the storage units, the authentication parameter, the transaction list, and the verification parameter set of the transaction list are stored in the above-mentioned new storage unit, so that it is possible to quickly assist the newly added node group in achieving data synchronization, for example.

For example, the data storage and management device 104 may compare authentication parameters associated with each consistent transaction list stored in each storage unit and determine consistent blocks and non-consistent blocks based on whether the respective authentication parameters are the same. For example, for each memory cell, the uniform block may be the following block: the consistent transaction list of the block stored in the storage unit is the same as the consistent transaction lists corresponding to the block stored in at least a predetermined number of other storage units.

Further, for example, in accordance with an embodiment of the present disclosure, the data storage and management device 104 may be further configured to create a merkel tree for each storage unit 1042 based on authentication parameters associated with respective consistent transaction lists stored by the storage unit 1042, and determine consistent and non-consistent chunks based on the merkel tree for each storage unit 1042. The manner in which the above consistent blocks and non-consistent blocks are determined will be further described with reference to fig. 6 in conjunction with a specific example. Fig. 6 shows an example of data stored in respective storage units and one example of a merkel tree created in the case of an example in which a coherent block and a non-coherent block are determined by creating a merkel tree.

In the example shown in fig. 6, it is assumed that the information processing system 100 includes 3 node groups 102a, 102b, and 102c and storage units 1042a, 1042b, and 1042c corresponding to the three node groups. In addition, as shown in fig. 6, it is assumed that the memory unit 1042a stores a block Blk₁、Blk₂…Blk_m1Consistent transaction list (not shown in fig. 6), block identification Blk₁.ID、Blk₂.ID…Blk_m1ID and corresponding authenticationParameter Commitment₁、Commitment₂…Commitment_m1(ii) a The memory unit 1042b stores a block Blk₁、Blk₂…Blk_m2Consistent transaction list (not shown in fig. 6), block identification Blk₁.ID、Blk₂.ID…Blk_m2ID and corresponding authentication parameter Commitment₁、Commitment₂…Commitment_m2(ii) a The storage unit 1042c stores a block Blk₁、Blk₂…Blk_m3Consistent transaction list (not shown in fig. 6), block identification Blk₁.ID、Blk₂.ID…Blk_m3ID and corresponding authentication parameter Commitment₁、Commitment₂…Commitment_m3. Wherein m1, m2, and m3 are natural numbers greater than 0, and may be the same as or different from each other.

Note that although not shown in fig. 6, the storage units 1042a, 1042b, and 1042c may also store authentication parameter sets, node identifications, and the like of the respective banks, and the storage units 1042a, 1042b, and 1042c may also store transaction lists that are not consistent transaction lists and associated parameters.

For example, as shown in fig. 6, the data storage and management device 104 may create a mercker tree using authentication parameters associated with the respective consistent transaction lists stored in each of the storage units 1042a, 1042b, and 1042c as leaf nodes of the lowest hierarchical level, and determine consistent and non-consistent chunks based on the mercker tree for each storage unit 1042. Note that although it is shown in fig. 6 that the leaf nodes of the adjacent lowest hierarchies are merged to create the merkel tree, the leaf nodes of the lowest hierarchies may also be merged at certain intervals to create the merkel tree. For example, the leaf nodes of the lowest hierarchy that are one leaf node apart may be merged to create a merkel tree. Further, in fig. 6, the consistent patch is identified by a box without padding, and the non-consistent patch is identified by a box filled with gray.

For example, the data storage and management device 104 may determine consistent blocks and non-consistent blocks by determining from the root node whether the root node and corresponding leaf nodes of the three Mercker trees are the same. In a case where it is determined that the respective leaf nodes of a certain hierarchy are the same, for example, in a case where it is determined that leaf nodes L1F11, L1F21, and L1F31 lower by one hierarchy than Root nodes Root1, Root2, and Root3 shown in fig. 6 are the same as each other, then it is determined that the blocks corresponding to leaf nodes L3F11, L3F12, L3F13, L3F14, L3F21, L3F22, L3F23, L3F24, L3F31, L3F32, L3F33, and L3F34 of the lowest hierarchy corresponding to the leaf nodes L1F11, L1F21, and L1F31 are the uniform blocks. Further, in a case where it is determined that the respective leaf nodes of a certain hierarchy are not all the same, for example, in a case where it is determined that the leaf nodes L2F13 of the two lower hierarchies than the Root nodes Root1, Root2, and Root3 shown in fig. 6 are the same as L2F23 but different from L2F33, it is continued to be determined whether the nodes L3F15, L3F25, and L3F35 of the one lower hierarchy than the leaf nodes L2F13, L2F23, and L2F33 are the same as each other and whether the nodes L3F16, L3F26, and L3F36 are the same as each other. For example, in a case where it is determined that node L3F16 is the same as node L3F26 but different from node L3F36, the tile to which node L3F36 corresponds is determined to be a non-uniform tile, and the tiles to which node L3F16 and node L3F26 correspond are determined to be uniform tiles.

By creating a merkel tree based on authentication parameters associated with each consistent transaction list as described above, a consistent block may be quickly determined.

For example, according to an embodiment of the present disclosure, the data storage and management device 104 may further include a faulty block identification and repair unit, which may be configured to determine, for each non-uniform block, whether the transaction list of the non-uniform block is falsified based on the authentication parameters of the non-uniform block and the verification parameter set of the transaction list, acquire the transaction list and the authentication parameters of the non-uniform block from a storage unit other than the storage unit corresponding to the non-uniform block in a case where it is determined that the transaction list of the non-uniform block is falsified, store the acquired transaction list in the storage unit corresponding to the non-uniform block as the transaction list of the non-uniform block, and determine the faulty block identification and repair unit based on the authentication parameters acquired from the storage unit other than the storage unit corresponding to the non-uniform block and the authentication parameters of the non-uniform block stored in the storage unit corresponding to the non-uniform block And storing the acquired authentication parameters in a storage unit corresponding to the non-uniform block as the authentication parameters of the non-uniform block in the case of determining that the non-uniform block is defective.

According to the above-described embodiments of the present disclosure, the data storage and management device 104 may further include a defective block identification and repair unit, so that a defective block may be quickly identified and repaired.

Having described the above block chain based information processing system according to an embodiment of the present disclosure, the present disclosure also provides an embodiment of the following information processing method, corresponding to the above-described embodiment of the information processing system.

Fig. 7 is a flowchart illustrating an example of a flow of an information processing method 700 according to an embodiment of the present disclosure. As shown in fig. 7, the information processing method according to the embodiment of the present disclosure may start at the start step S702 and end at the end step S708. An information processing method according to an embodiment of the present disclosure may include a transaction list writing step S704 and an associated information generating and storing step S708.

In the transaction list writing step S704, the transaction list of the block of each node in the at least one node group may be stored to a data storage and management apparatus communicably connected to the at least one node group. Wherein each node group includes at least one node, and the data storage and management apparatus includes at least one storage unit in one-to-one correspondence with the at least one node group.

In the association information generation and storage step S706, association information may be generated and stored in the at least one node group and the data storage and management device. The association information is used for indicating that the source of the transaction list stored by each storage unit is the node group corresponding to the storage unit and for verifying whether the transaction list is tampered, and the association information comprises the block identification and the authentication parameter of each block of each node in the corresponding node group and the node identification of each node. Wherein each node group and the storage unit corresponding to the node group contain the same association information, and wherein the authentication parameter is generated based on the transaction list of the corresponding block.

With the maturity of the blockchain technology, the application scale gradually expands, and the problem of expandability of blockchain ledger storage is imminent. Similarly to the information processing system 100 according to the embodiment of the present disclosure described above, the information processing method 700 according to the embodiment of the present disclosure deposits the transaction lists of the blocks of the nodes to the data storage and management devices communicably connected to the respective node groups, so that it is possible to, for example, lighten the account book storage burden of the nodes, realizing lightweight nodes. In addition, the information processing method 700 according to the embodiment of the present disclosure verifies whether the corresponding transaction list is tampered with by the association information, so that the correctness of the transaction data can be ensured.

For example, the information processing method 700 may further include a transaction list grouping and storing step according to an embodiment of the present disclosure. In the transaction list grouping step, the following operations may be performed for each storage unit: for each block, grouping the transaction lists of the block received by the storage unit based on the authentication parameters of the block to obtain at least one transaction list group of the block, wherein all transaction lists in the same transaction list group are the same; and for each transaction list set, storing only one transaction list of the transaction list set in the storage unit, and storing node identifications of nodes from which the respective transaction lists of the transaction list set are received and a set of authentication parameters of the one transaction list in association with the one transaction list in the storage unit. Wherein the set of verification parameters is generated based on the corresponding transaction list.

According to the above-described embodiments of the present disclosure, the transaction lists of the respective blocks in the same storage unit are grouped, and only one of the transaction lists is stored for the same transaction list group, so that the block data storage amount can be reduced, for example, as compared to hyperhedger Fabric in which all the block data is stored in the ledger database. Further, according to the above-described embodiments of the present disclosure, the set of verification parameters generated based on the transaction list is stored in association with the corresponding transaction list, so that the correctness of the transaction data can be further ensured.

For example, according to embodiments of the present disclosure, the authentication parameters for each block and the corresponding set of verification parameters for the transaction list may be generated using a merkel tree, RSA accumulator, or polynomial-based vector commitment.

For example, in the case of generating the authentication parameters of each block and the set of verification parameters of the corresponding transaction list using the mercker tree, the mercker tree may be created for each transaction list based on each transaction included in the transaction list, and the root node of the mercker tree may be used as the authentication parameters of the block corresponding to the transaction list; for each transaction, using as a verification parameter for the transaction a set of sibling nodes of the path of the transaction to the root node in the above-mentioned Merck tree; and for each transaction list, using the set of verification parameters for each transaction included in the transaction list as the set of verification parameters for the transaction list.

For example, the information processing method 700 may further include transaction listing query and verification steps according to embodiments of the present disclosure. In the transaction list query and verification step, a block identification of the query block may be transmitted to the data storage and management device, a transaction list and a set of verification parameters of the query block may be received from the corresponding storage unit, and the received transaction list of the query block may be verified based on the set of verification parameters of the query block received from the corresponding storage unit and the authentication parameters of the query block stored in the node. The query block is a block to be queried for the transaction list.

For example, the information processing method 700 may further include a consistent transaction list determination step according to an embodiment of the present disclosure. In the consistent transaction list determination step, the following operations may be performed for each storage unit: for each tile, determining the transaction list stored in the storage unit in the transaction list set of the tile, wherein the number of the transaction lists in each transaction list set of the tile is more than a predetermined number of transaction list sets, as the consistent transaction list of the tile. Wherein the predetermined number is equal to the number of common nodes in the node group corresponding to the storage unit. Further, in a case where a new node is added to the node group corresponding to the storage unit, the authentication parameter associated with the consistent transaction list stored in the storage unit is transmitted to the new node, and the node identification of the new node is stored in the storage unit in association with each consistent transaction list.

According to the embodiment of the present disclosure, for each node group, a consistent transaction list of each block may be determined, and in the case that a new node is added to the node group, the authentication parameters associated with the consistent transaction list are sent to the new node, and the node identification of the new node is stored in association with each consistent transaction list, so that in the case that a new node is added, data synchronization between the newly added node and other nodes in the corresponding node group may be rapidly achieved.

For example, according to an embodiment of the present disclosure, the information processing method 700 may further include a consistent block and a non-consistent block determination step. In the consistent patch and non-consistent patch determining step, the consistent patch and the non-consistent patch may be determined based on authentication parameters associated with a consistent transaction list stored in each storage unit. Further, in the case of adding a new node group, a new storage unit may be created for the new node group, and the block identification of the consistent block obtained from any one of the storage units, the authentication parameter, the transaction list, and the verification parameter set of the transaction list are stored in the new storage unit, so that, for example, data synchronization can be quickly facilitated for the newly added node group.

For example, in the consistent block and non-consistent block determining step, a mercker tree may be created for each storage unit based on authentication parameters associated with the respective consistent transaction lists stored by the storage unit, and consistent blocks and non-consistent blocks may be determined based on the mercker tree for each storage unit.

For example, according to an embodiment of the present disclosure, the information processing method 700 may further include a defective block identification and repair step. In the faulty block identification and repair step, it may be determined, for each non-uniform block, whether a transaction list of the non-uniform block is falsified based on an authentication parameter of the non-uniform block and a verification parameter set of the transaction list, in a case where it is determined that the transaction list of the non-uniform block is falsified, acquire the transaction list and the authentication parameter of the non-uniform block from a storage unit other than a storage unit corresponding to the non-uniform block, store the acquired transaction list in the storage unit corresponding to the non-uniform block as the transaction list of the non-uniform block, and determine whether the non-uniform block is faulty based on the authentication parameter acquired from the storage unit other than the storage unit corresponding to the non-uniform block and the authentication parameter of the non-uniform block stored in the storage unit corresponding to the non-uniform block, and storing the acquired authentication parameters in a storage unit corresponding to the non-uniform block as the authentication parameters of the non-uniform block under the condition that the non-uniform block is determined to be in fault.

According to the above-described embodiment of the present disclosure, the information processing method 700 may further include a defective block identification and repair step, so that a defective block may be quickly identified and repaired.

It should be noted that although the functional configuration and operation of the block chain based information processing system and the information processing method according to the embodiments of the present disclosure are described above, this is merely an example and not a limitation, and a person skilled in the art may modify the above embodiments according to the principle of the present disclosure, for example, functional modules and operations in the respective embodiments may be added, deleted, or combined, and such modifications fall within the scope of the present disclosure.

In addition, it should be further noted that the method embodiments herein correspond to the system embodiments described above, and therefore, the contents that are not described in detail in the method embodiments may refer to the descriptions of the corresponding parts in the system embodiments, and the description is not repeated here.

In addition, the present disclosure also provides a storage medium and a program product. It should be understood that the machine-executable instructions in the storage medium and the program product according to the embodiments of the present disclosure may also be configured to perform the above-described information processing method, and thus, the contents not described in detail herein may refer to the description of the corresponding parts previously, and the description will not be repeated herein.

Accordingly, storage media for carrying the above-described program products comprising machine-executable instructions are also included in the present disclosure. Including, but not limited to, floppy disks, optical disks, magneto-optical disks, memory cards, memory sticks, and the like.

Further, it should be noted that the above series of processes and means may also be implemented by software and/or firmware. In the case of implementation by software and/or firmware, a program constituting the software is installed from a storage medium or a network to a computer having a dedicated hardware structure, such as a general-purpose personal computer 800 shown in fig. 8, which is capable of executing various functions and the like when various programs are installed.

In fig. 8, a Central Processing Unit (CPU)801 executes various processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 to a Random Access Memory (RAM) 803. In the RAM 803, data necessary when the CPU 801 executes various processes and the like is also stored as necessary.

The CPU 801, the ROM802, and the RAM 803 are connected to each other via a bus 804. An input/output interface 805 is also connected to the bus 804.

The following components are connected to the input/output interface 805: an input section 806 including a keyboard, a mouse, and the like; an output section 807 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 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, and the like. The communication section 809 performs communication processing via a network such as the internet.

A drive 810 is also connected to the input/output interface 805 as needed. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is installed in the storage portion 808 as necessary.

In the case where the above-described series of processes is realized by software, a program constituting the software is installed from a network such as the internet or a storage medium such as the removable medium 811.

It will be understood by those skilled in the art that such a storage medium is not limited to the removable medium 811 shown in fig. 8 in which the program is stored, distributed separately from the apparatus to provide the program to the user. Examples of the removable medium 811 include a magnetic disk (including a floppy disk (registered trademark)), an optical disk (including a compact disk read only memory (CD-ROM) and a Digital Versatile Disk (DVD)), a magneto-optical disk (including a Mini Disk (MD) (registered trademark)), and a semiconductor memory. Alternatively, the storage medium may be the ROM802, a hard disk included in the storage section 808, or the like, in which programs are stored and which are distributed to users together with the apparatus including them.

The preferred embodiments of the present disclosure are described above with reference to the drawings, but the present disclosure is of course not limited to the above examples. Various changes and modifications within the scope of the appended claims may be made by those skilled in the art, and it should be understood that these changes and modifications naturally will fall within the technical scope of the present disclosure.

For example, a plurality of functions included in one unit may be implemented by separate devices in the above embodiments. Alternatively, a plurality of functions implemented by a plurality of units in the above embodiments may be implemented by separate devices, respectively. In addition, one of the above functions may be implemented by a plurality of units. Needless to say, such a configuration is included in the technical scope of the present disclosure.

In this specification, the steps described in the flowcharts include not only the processing performed in time series in the described order but also the processing performed in parallel or individually without necessarily being performed in time series. Further, even in the steps processed in time series, needless to say, the order can be changed as appropriate.

In addition, the technique according to the present disclosure can also be configured as follows.

Supplementary note 1. an information processing system based on a block chain, comprising:

at least one node group, each node group including at least one node, each node configured to store a transaction list of the block of the node to a data storage and management device communicatively connected to the at least one node group, and

the data storage and management apparatus including at least one storage unit in one-to-one correspondence with the at least one node group,

wherein each node group and the storage unit corresponding to the node group contain the same association information,

wherein the association information is used for indicating the source of the transaction list stored in each storage unit as the node group corresponding to the storage unit and for verifying whether the transaction list is tampered, and the association information comprises the block identification and authentication parameter of each block of each node in the corresponding node group and the node identification of each node, an

Wherein the authentication parameters are generated based on a transaction list of the corresponding block.

Supplementary note 2. the information processing system according to supplementary note 1, wherein the data storage and management apparatus is further configured to perform the following operations for each storage unit:

for each block, grouping the transaction lists of the block received by the storage unit based on the authentication parameters of the block to obtain at least one transaction list group of the block, wherein all transaction lists in the same transaction list group are the same; and

for each transaction list set, storing only one transaction list of the transaction list set in the storage unit, and storing node identifications of nodes from which the respective transaction lists of the transaction list set are received and a set of authentication parameters of the one transaction list in association with the one transaction list in the storage unit,

wherein the set of validation parameters is generated based on a corresponding transaction statement.

Note 3. according to the information processing system of note 2, each node is further configured to:

authentication parameters for each block and a corresponding set of verification parameters for the transaction list are generated using a merkel tree, RSA accumulator, or polynomial-based vector commitment.

Note 4. the information processing system according to note 2 or 3, wherein each node includes:

a query unit for sending a block identification of a query block to the data storage and management device, and receiving a transaction list and a set of verification parameters for the query block from a storage unit corresponding to the node, wherein the query block is a block for which the transaction list is to be queried; and

and the verification unit is used for verifying the received transaction list of the query block on the basis of the verification parameter set of the query block received from the storage unit and the authentication parameter of the query block stored in the node.

Note 5. the information processing system according to note 2 or 3, wherein the data storage and management device is further configured to perform the following operation for each storage unit:

for each block, determining the transaction lists stored in the storage unit in the transaction list sets of the block, wherein the number of the transaction lists in each transaction list set of the block is greater than a predetermined number of transaction list sets, and the predetermined number is equal to the number of the common identification nodes in the node set corresponding to the storage unit; and

in the case where a new node is added to the node group corresponding to the storage unit, the authentication parameter associated with the consistent transaction list stored in the storage unit is transmitted to the new node, and the node identification of the new node is stored in the storage unit in association with the consistent transaction list.

Supplementary note 6. the information processing system according to supplementary note 5, wherein the data storage and management apparatus is further configured to determine consistent blocks and non-consistent blocks based on authentication parameters associated with a consistent transaction list stored in each storage unit; and

in the case of adding a new node group, a new storage unit is created for the new node group, and the block identification of the coherent block obtained from any one of the storage units, the authentication parameter, the transaction list, and the verification parameter set of the transaction list are stored in the new storage unit.

Supplementary 7. the information processing system according to supplementary 6, wherein the data storage and management device is further configured to create a mercker tree for each storage unit based on authentication parameters associated with the coherent transaction list stored by the storage unit, and determine the coherent chunks and the non-coherent chunks based on the mercker tree for each storage unit.

Note 8 the information processing system according to note 6, wherein the data storage and management apparatus further comprises: a defective block identification and repair unit configured to:

for each non-uniform block, determining whether the transaction list of the non-uniform block is tampered based on the authentication parameters of the non-uniform block and the verification parameter set of the transaction list,

in a case where it is determined that the transaction list of the non-uniform block is falsified, acquiring the transaction list and the authentication parameters of the non-uniform block from the other storage units except the storage unit corresponding to the non-uniform block, storing the acquired transaction list in the storage unit corresponding to the non-uniform block as the transaction list of the non-uniform block, and determining whether the non-uniform block is malfunctioning based on the authentication parameters acquired from the other storage units except the storage unit corresponding to the non-uniform block and the authentication parameters of the non-uniform block stored in the storage unit corresponding to the non-uniform block, and

and under the condition that the non-uniform block is determined to be in fault, storing the acquired authentication parameters in a storage unit corresponding to the non-uniform block as the authentication parameters of the non-uniform block.

Supplementary note 9. an information processing method, comprising:

a transaction list writing step of storing a transaction list of blocks of respective nodes in at least one node group into a data storage and management apparatus communicably connected to the at least one node group, wherein each node group includes at least one node, and the data storage and management apparatus includes at least one storage unit in one-to-one correspondence with the at least one node group; and

an association information generation and storage step of generating association information and storing the association information in the at least one node group and the data storage and management device,

wherein the association information is used for indicating that the source of the transaction list stored in each storage unit is the node group corresponding to the storage unit and for verifying whether the transaction list is tampered, and the association information comprises the block identification and the authentication parameter of each block of each node in the corresponding node group and the node identification of each node,

wherein each node group and the storage unit corresponding to the node group contain the same association information, an

Wherein the authentication parameters are generated based on a transaction list of the corresponding tile.

Supplementary note 10. the information processing method according to supplementary note 9, further comprising a transaction list grouping and storing step for performing the following operation for each storage unit:

Supplementary note 11. the information processing method according to supplementary note 10, wherein the authentication parameters of each block and the verification parameter set of the corresponding transaction list are generated using a merkel tree, an RSA accumulator, or a polynomial-based vector commitment.

Supplementary note 12. the information processing method according to supplementary note 10 or 11, further comprising a transaction list query and verification step for sending a block identification of a query block to the data storage and management device, receiving a transaction list and a verification parameter set of the query block from a storage unit corresponding to the node, and verifying the received transaction list of the query block based on the verification parameter set of the query block received from the storage unit and an authentication parameter of the query block stored in the node, wherein the query block is a block for which the transaction list is to be queried.

Note 13. the information processing method according to note 10 or 11, further comprising a consistent transaction list determination step of performing the following operation for each storage unit:

for each block, determining the transaction list stored in the storage unit in the transaction list set of the block, wherein the number of the transaction lists in each transaction list set of the block is more than a predetermined number of transaction list sets, as a consistent transaction list of the block, wherein the predetermined number is equal to the number of the common identification nodes in the node set corresponding to the storage unit,

wherein, in a case where a new node is added to a node group corresponding to a corresponding storage unit, an authentication parameter associated with a consistent transaction list stored in the storage unit is transmitted to the new node, and a node identification of the new node is stored in the storage unit in association with the consistent transaction list.

Reference 14 the information processing method according to reference 13, further comprising a consistent block and non-consistent block determination step of determining a consistent block and a non-consistent block based on authentication parameters associated with a consistent transaction list stored in each storage unit,

wherein, in the case of adding a new node group, a new storage unit is created for the new node group, and the block identification of the consistent block, the authentication parameter, the transaction list, and the verification parameter set of the transaction list obtained from any one of the storage units are stored in the new storage unit.

Supplementary note 15 the information processing method according to supplementary note 14, wherein in the consistent patch and non-consistent patch determining step, a mercker tree is created for each storage unit based on an authentication parameter associated with a consistent transaction list stored by the storage unit, and the consistent patch and the non-consistent patch are determined based on the mercker tree for each storage unit.

Note 16. the information processing method according to note 14, further comprising a defective block identifying and repairing step for performing the following operations:

17. A computer-readable storage medium storing program instructions for executing the information processing method according to any one of supplementary notes 9 to 16 when the program instructions are executed by a computer.

Claims

1. A blockchain-based information processing system, comprising:

at least one node group, each node group comprising at least one node, each node configured to store a transaction list for the block of the node to a data storage and management device communicatively connected to the at least one node group, and

2. The information handling system of claim 1, wherein the data storage and management device is further configured to, for each storage unit:

3. The information handling system of claim 2, each node further configured to:

4. The information processing system according to claim 2 or 3, wherein each node comprises:

and the verification unit is used for verifying the received transaction list of the query block based on the verification parameter set of the query block received from the storage unit and the authentication parameter of the query block stored in the node.

5. The information handling system of claim 2 or 3, wherein the data storage and management device is further configured to, for each storage unit:

6. The information handling system of claim 5, wherein the data storage and management device is further configured to determine consistent blocks and non-consistent blocks based on authentication parameters associated with a consistent transaction list stored by each storage unit; and

7. The information handling system of claim 6, wherein the data storage and management device is further configured to create a Mercker tree for each storage unit based on authentication parameters associated with a consistent transaction list stored by the storage unit, and determine the consistent and non-consistent blocks based on the Mercker tree for each storage unit.

8. The information handling system of claim 6, wherein the data storage and management device further comprises: a defective block identification and repair unit configured to:

9. An information processing method, comprising:

10. A computer readable storage medium storing program instructions for performing the method of claim 9 when executed by a computer.