Information processing method and device, electronic equipment and medium

Abstract

The embodiment of the invention discloses an information processing method and device, electronic equipment and a medium. A specific embodiment of the method comprises the following steps: acquiring newly-added article data information of a target supply chain; performing data cleaning processing on the newly added article data information to obtain target article data information; performing verification processing on the target article data information; in response to determining that the target article data information meets a preset verification condition, creating a block storage space corresponding to the target article data information; performing early warning verification processing on the block storage space; in response to determining that the early warning verification information meets a preset early warning verification condition, performing broadcast processing on the block storage space; verifying the block storage space; and adding the block storage space to a target block chain corresponding to the target supply chain. According to the embodiment, the security, the credibility, the traceability and the symmetry of the article data information are improved, the waste of stored data information resources is reduced, and the time consumption of querying the data information of the supply chain is shortened.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of computer technologies, and particularly to information processing methods, apparatuses, electronic devices, and media. Background Art

[0002] Storing data information in the supply chain enables more convenient viewing of the data information of items at each link and tracing of the transfer information of items. Currently, when processing the information of items in the supply chain, the commonly adopted method is to directly store the item data information of each node in the supply chain into the corresponding database for storage processing of the data information of the nodes in the supply chain, and users can query and modify the data in the database, where each node corresponds to a database.

[0003] However, when processing information in the above manner, the following technical problems often exist:

[0004] First, storing the data of each node in the supply chain separately in each database without sharing the data of each node in the supply chain results in poor symmetry and traceability of the data information between each node in the supply chain, leading to a long time-consuming query of the data information of the supply chain; the data stored in the database can be tampered with, resulting in low security of the stored data and low credibility of the data stored in each node of the supply chain.

[0005] Second, directly storing the received data information in the database without cleaning the received data results in a large amount of redundant data stored in the database, leading to waste of a large amount of storage resources.

[0006] Continuing, when processing the item data information in the supply chain by using the blockchain of the present disclosure, the following technical problems further exist:

[0007] Third, when storing the item data information of the supply chain by adding a new block in the blockchain, randomly selecting neighbor nodes to broadcast the new block. If the transmission duration of the randomly selected neighbor nodes is long, the efficiency of broadcasting the new block is low, resulting in a long time-consuming broadcast of the new block.

[0008] The above information disclosed in this background art section is only used to enhance the understanding of the background of the inventive concept, and thus, it may include information that does not form the prior art known to those of ordinary skill in the art in this country. Summary of the Invention

[0009] Part of the content of the present disclosure is used to introduce concepts in a brief form, and these concepts will be described in detail in the following detailed implementation part. The content part of the present disclosure is not intended to identify the key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0010] Some embodiments of the present disclosure provide an information processing method, apparatus, electronic device, and computer-readable medium to solve one or more of the technical problems mentioned in the above background art part.

[0011] In a first aspect, some embodiments of the present disclosure provide an information processing method, the method includes: obtaining new item data information corresponding to a target supply chain, wherein the new item data information represents an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item circulation information set in an item circulation node; for the new item data information, perform the following information processing steps: perform data cleaning processing on the new item data information to obtain the new item data information after data cleaning processing as target item data information; perform verification processing on the target item data information to determine whether the target item data information meets a preset verification condition; in response to determining that the target item data information meets the preset verification condition, create a block storage space corresponding to the target item data information; perform early warning verification processing on the block storage space to obtain early warning verification information corresponding to the block storage space; in response to determining that the early warning verification information meets a preset early warning verification condition, perform broadcast processing on the block storage space; perform verification processing on the block storage space to determine whether the block storage space meets a preset on-chain condition; in response to determining that the block storage space meets the preset on-chain condition, add the created block storage space to the target blockchain corresponding to the target supply chain.

[0012] Second aspect, some embodiments of the present disclosure provide an information processing device, the device comprising: an acquisition unit configured to acquire new item data information corresponding to a target supply chain, wherein the new item data information represents an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item circulation information set in an item circulation node; an execution unit configured to perform the following information processing steps on the new item data information: perform data cleaning processing on the new item data information to obtain the new item data information after data cleaning processing as target item data information; perform verification processing on the target item data information to determine whether the target item data information meets a preset verification condition; in response to determining that the target item data information meets the preset verification condition, create a block storage space corresponding to the target item data information; perform early warning verification processing on the block storage space to obtain early warning verification information corresponding to the block storage space; in response to determining that the early warning verification information meets a preset early warning verification condition, perform broadcast processing on the block storage space; perform verification processing on the block storage space to determine whether the block storage space meets a preset on-chain condition; in response to determining that the block storage space meets the preset on-chain condition, add the created block storage space to the target blockchain corresponding to the target supply chain.

[0013] Third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device having stored thereon one or more programs, which when executed by the one or more processors cause the one or more processors to implement the method described in any implementation manner of the first aspect above.

[0014] Fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the method described in any implementation manner of the first aspect above.

[0015] The above-mentioned various embodiments of the present disclosure have the following beneficial effects: Through the information processing method of some embodiments of the present disclosure, the security, credibility, traceability, and symmetry of the stored item information can be improved, and the time-consuming for querying the data information of the supply chain can be shortened. Specifically, the reasons for the low security, credibility, traceability, and symmetry of the data information of the stored items and the long time-consuming for querying the data information of the supply chain are as follows: The data of each node in the supply chain are stored in each database separately, and the data of each node in the supply chain are not shared, resulting in poor symmetry and traceability of the data information between each node in the supply chain, and thus the long time-consuming for querying the data information of the supply chain; The data stored in the database can be tampered with, resulting in low security of the stored data, and thus low credibility of the data stored in each node of the supply chain. Based on this, in the information processing method of some embodiments of the present disclosure, first, obtain the new item data information corresponding to the target supply chain. Among them, the above-mentioned new item data information represents the set of item material information in the item material providing node, the set of item manufacturing information in the item manufacturing node, the set of item transportation information in the item transportation node, or the set of item transfer information in the item transfer node. Thus, the new item data information newly added to the above-mentioned target supply chain can be obtained. Then, for the above-mentioned new item data information, perform the following information processing steps: First, perform data cleaning processing on the above-mentioned new item data information to obtain the new item data information after data cleaning processing as the target item data information. Thus, the redundant data in the item data information can be cleaned. Then, perform verification processing on the above-mentioned target item data information to determine whether the above-mentioned target item data information meets the preset verification conditions. Thus, it can be determined whether there is still redundant data in the item data information after cleaning processing. After that, in response to determining that the above-mentioned target item data information meets the above-mentioned preset verification conditions, create a block storage space corresponding to the above-mentioned target item data information. Thus, a block corresponding to the above-mentioned target item data information can be created in the target blockchain corresponding to the above-mentioned target supply chain. Next, perform early warning verification processing on the above-mentioned block storage space to obtain the early warning verification information corresponding to the above-mentioned block storage space. Thus, the created block storage space can be verified to determine whether the created block storage space meets the preset early warning verification conditions. Then, in response to determining that the above-mentioned early warning verification information meets the preset early warning verification conditions, perform broadcast processing on the above-mentioned block storage space. Thus, the block storage space that meets the above-mentioned preset early warning verification conditions can be broadcast processed. After that, perform verification processing on the above-mentioned block storage space to determine whether the above-mentioned block storage space meets the preset on-chain conditions. Thus, it can be determined whether the created block storage space can be stored in the target blockchain. Finally, in response to determining that the above-mentioned block storage space meets the above-mentioned preset on-chain conditions, add the created block storage space to the target blockchain corresponding to the above-mentioned target supply chain.Thus, the created block storage space can be stored, so that the newly obtained item data information can be stored in the above-mentioned target blockchain. Also, instead of storing the item data information of each node in the supply chain in the database corresponding to the node, blocks corresponding to each node are created in the blockchain, and the item data information of each node is stored in the created blocks. Moreover, the item data information stored in the blockchain cannot be tampered with, thereby improving the credibility and security of the item data information. And the item data information stored in each block in the blockchain can be shared, thus improving the symmetry of each item data information, reducing the time-consuming for querying item data information, and storing the data of each node in the supply chain in the blockchain, thereby improving the traceability of the data information. Thus, the security, credibility, traceability and symmetry of the information of the stored items can be improved, thereby shortening the time-consuming for querying the data information of the supply chain. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In combination with the accompanying drawings and with reference to the following specific embodiments, the above and other features, advantages and aspects of the various embodiments of the present disclosure will become more apparent. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic and the elements and elements are not necessarily drawn to scale.

[0017] Figure 1 is a flowchart of some embodiments of an information processing method according to the present disclosure;

[0018] Figure 2 is a schematic structural diagram of some embodiments of an information processing apparatus according to the present disclosure;

[0019] Figure 3 is a schematic structural diagram of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0020] The embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0021] It should be further noted that, for the sake of convenience of description, only the parts related to the relevant invention are shown in the drawings. Without conflict, the embodiments in the present disclosure and the features in the embodiments can be combined with each other.

[0022] It should be noted that the concepts such as "first", "second", etc. mentioned in this disclosure are only used to distinguish different devices, page modules or units, and are not used to limit the order of functions performed by these devices, page modules or units or their interdependent relationships.

[0023] It should be noted that the modifications of "one" and "multiple" mentioned in this disclosure are illustrative rather than restrictive. Those skilled in the art should understand that unless otherwise clearly specified in the context, it should be understood as "one or more".

[0024] The names of the messages or information exchanged between multiple devices in the embodiments of this disclosure are only for illustrative purposes and are not used to limit the scope of these messages or information.

[0025] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0026] Figure 1 Flow 100 of some embodiments of an information processing method according to the present disclosure is shown. The information processing method includes the following steps:

[0027] Step 101, obtain the new item data information corresponding to the target supply chain.

[0028] In some embodiments, the execution subject of the information processing method (such as a computing device) may obtain new item data information corresponding to a target supply chain. Among them, the above new item data information may represent an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item circulation information set in an item circulation node. The above new item data information may include various data information. The data information in each of the above data information may represent item acquisition data. For example, the item acquisition data may be the purchase quantity. For example, the target supply chain may be a retail supply chain. The circulation nodes in each of the above may be an item material supply node, an item manufacturing node, an item transportation node, or an item circulation node. The item material supply node may be a link that provides item raw materials. For example, the item material supply node may be a procurement link. The item manufacturing node may represent a link for manufacturing items. For example, the item manufacturing node may be a production link. The item transportation node may represent a link for transporting items. For example, the item transportation node may be a transportation link. The item circulation node may be a link for circulating items. For example, the item circulation node may be a sales link. The item material information in the item material information set may be the material for preparing the item. The item manufacturing information in the item manufacturing information set may represent the data information in the item manufacturing process. For example, the item production information in the item manufacturing information set may be: "Press the apples". The item transportation information in the item transportation information set may represent the data during the item transportation process. For example, the item transportation information in the item transportation information set may include truck transportation and transportation duration. The item circulation information in the item circulation information set may represent the circulation data of the item. For example, the item circulation information may be the monthly sales amount. In practice, in response to detecting the new item data information corresponding to the above target supply chain, the above execution subject may obtain the new item data information corresponding to the target supply chain from each database storing the item data information of the target supply chain.

[0029] Step 102: For the new item data information, perform the following information processing steps.

[0030] Step 1021: Perform data cleaning processing on the new item data information to obtain the new item data information after data cleaning processing as the target item data information.

[0031] In some embodiments, the above-mentioned execution entity may perform data cleaning processing on the above-mentioned newly added item data information to obtain the newly added item data information after data cleaning processing as the target item data information. Among them, the above-mentioned target item data information may be the newly added item data information after cleaning processing. The above-mentioned newly added item data information may include various data information. For example, the data information in each data information may represent the manufacturing data of the item, and the data information may be: "The number of apple sauces manufactured is 20". In practice, the above-mentioned execution entity may perform data cleaning processing on the above-mentioned newly added item data information in various ways to obtain the newly added item data information after data cleaning processing as the target item data information.

[0032] In some optional implementation manners of some embodiments, the above-mentioned execution entity may perform data cleaning processing on the above-mentioned newly added item data information through the following steps to obtain the newly added item data information after data cleaning processing as the target item data information:

[0033] First step, for each data information in the above-mentioned newly added item data information, perform the following steps:

[0034] First sub-step, determine each data information different from the above-mentioned data information in the above-mentioned newly added item data information as each target data information. Among them, the target data information in each of the above-mentioned target data information may represent the data information different from the above-mentioned data information in the above-mentioned newly added item data information.

[0035] Second sub-step, input each target data information in the determined each target data information and the above-mentioned data information into a pre-trained similarity detection model to obtain each similarity. Among them, the above-mentioned similarity detection model may be a model for detecting the similarity between the target data information and the data information. The similarity in each of the above-mentioned similarities may represent the similarity value between the target data information and the above-mentioned data information. For example, the similarity detection model may be a cosine similarity model.

[0036] Third sub-step, according to each of the above-mentioned similarities, perform deletion processing on each target data information in the above-mentioned newly added item data information that meets the preset similarity condition. Among them, the above-mentioned preset similarity condition may be that the similarity between the target data information and the data information is greater than the preset similarity. The specific value of the above-mentioned preset similarity is not specifically limited herein. In practice, the above-mentioned execution entity may delete each target data information in the above-mentioned newly added item data information whose corresponding similarity is greater than the above-mentioned preset similarity.

[0037] In the second step, input the above-mentioned newly added item data information into a pre-trained missing value detection model to obtain a set of missing value information for the newly added item data information after corresponding deletion processing. Among them, the above-mentioned missing value detection model can be a model for detecting the missing values of the above-mentioned newly added item data information. For example, the missing value detection model can be a regression model. The missing value information in the above-mentioned set of missing value information can represent the missing values in the above-mentioned newly added item data information.

[0038] In the third step, in response to determining that the above-mentioned set of missing value information is not empty, perform data filling processing on the above-mentioned newly added item data information according to the above-mentioned set of missing value information. In practice, the above-mentioned execution entity can perform data filling processing on the above-mentioned newly added item data information by the mean filling method.

[0039] In the fourth step, create a tree-shaped data structure information corresponding to the above-mentioned newly added item data information according to the above-mentioned newly added item data information. Among them, the above-mentioned tree-shaped data structure information can represent a K-dimensional tree structure. The data information in the above-mentioned newly added item data information corresponds one-to-one with the nodes in the above-mentioned tree-shaped data structure information. In practice, the above-mentioned execution entity can construct the tree-shaped data structure information corresponding to the above-mentioned newly added item data information by the KD-Tree method.

[0040] In the fifth step, determine the target data point corresponding to the above-mentioned newly added item data information according to the above-mentioned tree-shaped data structure information. Among them, the above-mentioned target data point can represent the center of the above-mentioned K-dimensional tree structure. In practice, the above-mentioned execution entity can determine the target data point corresponding to the above-mentioned newly added item data information according to the median method.

[0041] In the sixth step, determine the nearest neighbor node information corresponding to the above-mentioned target data point according to the above-mentioned tree-shaped data structure information and the above-mentioned target data point. Among them, the above-mentioned nearest neighbor node information can represent at least one nearest neighbor node of the above-mentioned target data point in the above-mentioned tree-shaped data structure information. In practice, the above-mentioned execution entity can determine the nearest neighbor node information corresponding to the above-mentioned target data point in a binary search manner.

[0042] In the seventh step, in response to determining that the above-mentioned nearest neighbor node information meets the preset core point condition, determine the above-mentioned nearest neighbor node information as the core point information. Among them, the above-mentioned preset core point condition can be that the number of nearest neighbor nodes included in the above-mentioned nearest neighbor node information is greater than the preset minimum number of points. Among them, the above-mentioned preset minimum number of points can represent the minimum number of points included in the core point neighborhood. The above-mentioned core point information can represent a core point. For example, the preset minimum number of points can be the DBSCAN minimum number of points; the core point can be the DBSCAN core point.

[0043] In the eighth step, based on the above core point information and the above tree - shaped data structure information, perform clustering processing on the above tree - shaped data structure information to obtain noise point information corresponding to the above newly added item data information. Among them, the above noise point information can represent noise points. The above noise points can represent data points that have not been assigned to any cluster. In practice, the above execution subject can perform clustering processing on the above tree - shaped data structure information according to the DBSCAN algorithm to obtain noise point information.

[0044] In the ninth step, perform deletion processing on the noise point information in the above newly added item data information to obtain the newly added item data information after data cleaning processing as the target item data information.

[0045] The above technical solution, as an inventive point of an embodiment of the present disclosure, solves Technical Problem 2 mentioned in the background art: "Directly storing the received data information in the database without cleaning the received data, resulting in a large amount of redundant data stored in the database and wasting a large amount of storage resources." The factors that lead to a large amount of redundant data stored in the database and waste a large amount of storage resources are usually as follows: directly storing the received data information in the database without cleaning and eliminating redundancy of the received data. If the above factors are solved, the effect of reducing the redundant data stored in the database and reducing the waste of a large amount of storage resources can be achieved. To achieve this effect, the present disclosure first deletes redundant data information through a similarity detection model, and then fills in missing data information. Then create a K - dimensional tree structure corresponding to the above newly added item data information. Then perform clustering processing on the tree - shaped data structure information to obtain noise points. Finally, delete the noise data to denoise the newly added item data information. Thus, the redundant data stored in the database is reduced, and the waste of storage resources is reduced.

[0046] Step 1022, perform verification processing on the target item data information to determine whether the target item data information meets the preset verification conditions.

[0047] In some embodiments, the above execution subject can perform verification processing on the above target item data information to determine whether the above target item data information meets the preset verification conditions. Among them, the above preset verification condition can be that the redundancy of the above target item data information is less than the preset redundancy. The specific value of the above preset redundancy is not specifically limited here. In practice, the above execution subject can use various methods to perform verification processing on the above target item data information to determine whether the above target item data information meets the preset verification conditions.

[0048] In some alternative implementations of some embodiments, the above-mentioned execution entity may perform a verification process on the above-mentioned target item data information through the following steps to determine whether the above-mentioned target item data information meets the preset verification conditions:

[0049] First step, input the above-mentioned target item data information into a pre-trained redundancy detection model to obtain the redundancy corresponding to the above-mentioned target item data information. Among them, the above-mentioned redundancy detection model may be a model for detecting the redundancy of item data information. For example, the redundancy detection model may be a cosine similarity model.

[0050] Second step, in response to detecting that the obtained redundancy meets the preset redundancy condition, determine that the above-mentioned target item data information meets the above-mentioned preset verification condition. Among them, the above-mentioned preset redundancy condition may be that the obtained redundancy is less than the above-mentioned preset redundancy.

[0051] Third step, in response to detecting that the obtained redundancy does not meet the above-mentioned preset redundancy condition, determine that the above-mentioned target item data information does not meet the above-mentioned preset verification condition.

[0052] Step 1023, in response to determining that the target item data information meets the preset verification condition, create a block storage space corresponding to the target item data information.

[0053] In some embodiments, in response to determining that the above-mentioned target item data information meets the above-mentioned preset verification condition, the above-mentioned execution entity may create a block storage space corresponding to the above-mentioned target item data information. Among them, the above-mentioned block storage space may represent the storage space of a block in the blockchain. The above-mentioned block storage space may be used to store the above-mentioned target item data information. In practice, in response to determining that the above-mentioned target item data information meets the above-mentioned preset verification condition, the above-mentioned execution entity may create a block storage space corresponding to the above-mentioned target item data information in various ways.

[0054] In some alternative implementations of some embodiments, in response to determining that the above-mentioned target item data information meets the above-mentioned preset verification condition, the above-mentioned execution entity may determine that the above-mentioned target item data information does not meet the above-mentioned preset verification condition through the following steps:

[0055] First step, select a block storage space that meets the preset end condition from the above-mentioned target blockchain as the forward block storage space. Among them, the above-mentioned preset end condition may be the block storage space at the end of the above-mentioned target blockchain. The above-mentioned forward block storage space may represent the block storage space at the end of the above-mentioned target blockchain.

[0056] Step 2: Obtain the identification information of the selected forward block storage space. Among them, the above identification information can represent the block header and block body of the above forward block storage space. In practice, the above execution entity can traverse the above target blockchain through a linear traversal algorithm to obtain the identification information of the selected forward block storage space.

[0057] Step 3: According to the above identification information and the above target item data information, create a block storage space for the above target item data information to obtain a block storage space corresponding to the above target item data information. In practice, first, the above execution entity can create the block header of the above block storage space through the following steps: First, the version number corresponding to the block storage space can be determined in the way of a static version number. Then, obtain the hash value corresponding to the above forward block storage space from the block header included in the above identification information. After that, construct the Merkle root corresponding to the above target item data information through a recursive construction method. Secondly, convert the above target item data information into a data hash value corresponding to the above block storage space according to a hash function. For example, the hash function can be: "SHA-256". After that, determine the serial number of the above block storage space as the sum of the serial number of the above block storage space and 1. Secondly, perform binary encoding on the serial number of the above block storage space, the hash value of the above forward block storage space, and the above data hash value to obtain encoded information. After that, convert the above encoded information into a block hash value according to the above hash function. Finally, combine the above version number, the hash value corresponding to the above forward block storage space, the above data hash value, the above block hash value, the above Merkle root, and the Nonce field into a block header. Then, the above execution entity can create the block body of the above block storage space through the following steps: Store the above target item data information in the block body according to a preset block format. The specific setting of the above preset block format is not specifically limited here.

[0058] Step 1024: Perform a warning verification process on the block storage space to obtain warning verification information corresponding to the block storage space.

[0059] In some embodiments, the above execution entity can perform a warning verification process on the above block storage space to obtain warning verification information corresponding to the above block storage space. Among them, the above warning verification information can represent the result of the warning verification process on the above block storage space. The above warning verification information can represent that the above block storage space passes the verification or fails the verification. In practice, the above execution entity can perform a warning verification process on the above block storage space in various ways to obtain warning verification information corresponding to the above block storage space.

[0060] In some alternative implementations of some embodiments, the above-mentioned execution entity may perform a warning verification process on the above-mentioned block storage space through the following steps to obtain warning verification information corresponding to the above-mentioned block storage space:

[0061] First, perform a warning detection process on the above-mentioned block storage space to obtain warning information corresponding to the above-mentioned block storage space. Among them, the above-mentioned warning information may indicate whether the above-mentioned block storage space passes the warning detection process. The above-mentioned warning information may be that the above-mentioned block storage space passes the warning detection process or fails to pass the warning detection process. In practice, the above-mentioned execution entity may perform a warning detection process on the above-mentioned block storage space in various ways to obtain warning information corresponding to the above-mentioned block storage space.

[0062] Second, perform a format detection process on the above-mentioned block storage space and the above-mentioned target item data information to obtain format verification information corresponding to the above-mentioned target item data information and the above-mentioned block header as the first verification information. Among them, both the above-mentioned format verification information and the above-mentioned first verification information may indicate the result of the format verification process on the above-mentioned target item data information and the above-mentioned block header. The above-mentioned first verification information may be verification failure or verification success. In practice, the above-mentioned execution entity may perform a format detection process on the block header format of the above-mentioned block storage space and the format of the above-mentioned target item data information through a consensus algorithm.

[0063] Third, perform a validity detection process on the target item data information in the above-mentioned block storage space to obtain validity verification information corresponding to the above-mentioned target item data information as the second verification information. Among them, both the above-mentioned validity verification information and the above-mentioned second verification information may indicate the verification result obtained from the validity detection process on the above-mentioned target item data information. The above-mentioned second verification information may indicate verification failure or verification success. In practice, the above-mentioned execution entity may perform a validity verification on the timestamp and hash value of the above-mentioned block storage space through a consensus algorithm to obtain the verification result corresponding to the above-mentioned target item data information.

[0064] Fourth, perform a verification process on the workload of the above-mentioned block storage space to obtain workload verification information corresponding to the above-mentioned block storage space as the third verification information. The above-mentioned third verification information may indicate verification failure or verification success. In practice, the above-mentioned execution entity may perform a verification process on the workload of the above-mentioned block storage space according to the consensus algorithm based on proof of work to obtain workload verification information corresponding to the above-mentioned block storage space as the third verification information.

[0065] In the fifth step, perform a verification process on the integrity of the above-mentioned block storage space to obtain data integrity verification information corresponding to the above-mentioned block storage space as the fourth verification information. Among them, the above-mentioned fourth verification information can represent verification failure or verification success. In practice, the above-mentioned execution entity can perform a verification process on the data integrity of the block header, the above-mentioned target item data information, and the above-mentioned Merkle root in the above-mentioned block storage space according to the consensus algorithm.

[0066] In the sixth step, determine the warning verification information corresponding to the above-mentioned block storage space according to the above-mentioned warning information, the above-mentioned first verification information, the above-mentioned second verification information, the above-mentioned third verification information, and the above-mentioned fourth verification information. In practice, in response to determining that the above-mentioned warning information, the above-mentioned first verification information, the above-mentioned second verification information, the above-mentioned third verification information, and the above-mentioned fourth verification information all represent verification success, determine verification success as the warning verification information corresponding to the above-mentioned block storage space. In response to determining that the above-mentioned warning information, the above-mentioned first verification information, the above-mentioned second verification information, the above-mentioned third verification information, or the above-mentioned fourth verification information represents verification failure, determine verification failure as the warning verification information corresponding to the above-mentioned block storage space.

[0067] In some optional implementation manners of some embodiments, the above-mentioned execution entity can perform a warning detection process on the above-mentioned block storage space through the following steps to obtain warning information corresponding to the above-mentioned block storage space:

[0068] In the first step, perform a warning detection on the code information of the above-mentioned block storage space to obtain code warning information corresponding to the above-mentioned block storage space as the first warning information. Among them, both the above-mentioned first warning information and the above-mentioned code warning information can represent the result of verifying the code of the above-mentioned block storage space. In practice, the above-mentioned execution entity can verify the code information of the above-mentioned block storage space according to a static analysis tool. For example, the static analysis tool can be Solhint of Ethereum.

[0069] In the second step, perform a warning detection on the performance of the above-mentioned block storage space to obtain performance warning information corresponding to the above-mentioned block storage space as the second warning information. Among them, both the above-mentioned performance warning information and the above-mentioned second warning information can represent information for warning about the performance of the above-mentioned block storage space. In practice, the above-mentioned execution entity can analyze the performance of the above-mentioned block storage space according to a performance analysis tool. For example, the performance analysis tool can be VisualVM.

[0070] In the third step, based on the obtained first warning information and the above-mentioned second warning information, determine the warning information corresponding to the storage space of the above-mentioned block. In practice, in response to determining that both the above-mentioned first warning information and the above-mentioned second warning information indicate successful verification, determine successful verification as the warning information corresponding to the storage space of the above-mentioned block. In response to determining that either the above-mentioned first warning information or the above-mentioned second warning information indicates verification failure, determine verification failure as the warning information corresponding to the storage space of the above-mentioned block.

[0071] Optionally, after step 1024, first, the above-mentioned execution entity may, in response to determining that the warning verification information of the above-mentioned block storage space does not meet the above-mentioned preset warning verification conditions, determine the verification failure factor information corresponding to the above-mentioned block storage space. Among them, the above-mentioned verification failure factor information may indicate the reason for verification failure. In practice, the above-mentioned execution entity may determine the verification information or warning information indicating verification failure as the verification failure factor information.

[0072] Then, in response to determining that the above-mentioned verification failure factor information indicates that the warning information fails the verification, determine the warning processing method information corresponding to the above-mentioned warning information according to the preset warning processing method information set. Among them, the preset warning processing method information in the above-mentioned preset warning processing method information set may include warning information and the warning processing method corresponding to the warning information. The above-mentioned warning processing method information may indicate the processing method for the warning information. For example, the preset warning processing method information may be: "Warning information: The performance verification of the block storage space fails; Warning processing method: Send the warning verification information to the terminal of the preset target user". In practice, the above-mentioned execution entity may determine the preset warning processing method information in the above-mentioned preset warning processing method information set that has the same warning information as the above-mentioned warning information as the target preset warning processing method information. Then, determine the warning processing method in the above-mentioned target preset warning processing method information as the warning processing method information corresponding to the above-mentioned warning information.

[0073] After that, the warning processing of the above-mentioned block storage space may be performed according to the determined warning processing method information. In practice, in response to determining that the above-mentioned warning processing method information indicates sending the warning verification information to the terminal of the preset target user, the above-mentioned execution entity may send the warning verification information corresponding to the above-mentioned block storage space to the terminal device of the preset target user. Among them, the above-mentioned preset target user may be the user preset to receive the warning verification information. For example, the terminal device may be a computer.

[0074] Second, in response to determining that the above verification failure factor information indicates that the above first verification information, the above second verification information, the above third verification information, or the above fourth verification information fails the verification, according to the preset set of verification information processing methods, determine the preset verification information processing method corresponding to the above block storage space. Among them, the preset verification information processing methods in the above preset set of verification information processing methods may include verification information and the verification information processing method corresponding to the verification information. For example, the preset verification information processing method may be: "Verification information: The validity of the target item data information fails the verification; Verification information processing method: Send a warning verification information to the terminal of a preset user." The above preset verification information processing method may indicate the processing method for the verification information. In practice, the above execution entity may determine the preset verification information processing method in the above preset set of verification information processing methods that has the same verification information as the above verification information as the target preset verification information processing method. Then, determine the verification processing method in the above target preset verification information processing method as the verification processing method information corresponding to the above verification information.

[0075] Finally, according to the determined preset verification information processing method, perform a warning process on the above block storage space. In practice, in response to determining that the above preset verification information processing method indicates sending a warning verification information to the terminal of a preset user, the above execution entity may send the warning verification information corresponding to the above block storage space to the terminal device of the preset target user. Among them, the above preset target user may be the user preset to receive the warning verification information. For example, the terminal device may be a computer.

[0076] Step 1025, in response to determining that the warning verification information meets the preset warning verification conditions, perform a broadcast process on the block storage space.

[0077] In some embodiments, in response to determining that the above warning verification information meets the preset warning verification conditions, the above execution entity may perform a broadcast process on the above block storage space. In practice, the above execution entity may perform a broadcast process on the above block storage space in various ways.

[0078] In some optional implementation manners of some embodiments, in response to determining that the above warning verification information meets the preset warning verification conditions, the above execution entity may perform a broadcast process on the above block storage space through the following steps:

[0079] First step, determine the set of neighbor node groups corresponding to each node in the target blockchain. Among them, the neighbor node groups in the set of neighbor node groups can represent a neighbor node chain centered on the target node. For example, when there is a chain structure in the target blockchain: "target node → first neighbor node → second neighbor node → third neighbor node". Then a neighbor node group corresponding to the target node can be: "target node, first neighbor node, second neighbor node, third neighbor node". Among them, the first neighbor node can be a neighbor node of the target node. The second neighbor node can be a neighbor node of the second neighbor node. The third neighbor node can be a neighbor node of the second neighbor node. The target node can represent the node storing the new block.

[0080] Second step, determine the neighbor node group corresponding to the block storage space from the set of neighbor node groups. In practice, first, the execution entity can determine the node storing the block storage space as the block node. Then, the neighbor node group in the set of neighbor node groups whose represented target node is the same as the block node can be determined as the neighbor node group corresponding to the block storage space.

[0081] Third step, determine the node replacement quantity information corresponding to the neighbor node group according to the preset replacement ratio information. Among them, the preset replacement ratio information can be the ratio of replacing the neighbor nodes in the neighbor node group. For example, the preset replacement ratio information can be 20%. The node replacement quantity information can represent the number of neighbor nodes to be replaced in the neighbor node group. In practice, the execution entity can determine the product of the number of neighbor nodes in the neighbor node group and the preset replacement ratio information as the node replacement quantity information.

[0082] Fourth step, obtain each preset candidate node from the preset candidate node set according to the node replacement quantity information. Among them, the preset candidate node information set can represent each candidate node. In practice, the execution entity can randomly obtain the number of preset candidate nodes represented by the node replacement quantity information from the preset candidate node set.

[0083] Step 5: According to the above-mentioned respective preset candidate nodes, perform combination processing on the neighbor nodes in the above-mentioned neighbor node group to obtain respective target neighbor node groups. Among them, the target neighbor node groups in the above-mentioned respective target neighbor node groups can represent the neighbor node groups after combination processing. In practice, first, the above-mentioned execution entity can determine the number of the above-mentioned respective preset candidate nodes as the target number. Then, according to the permutation and combination method, the above-mentioned target number of neighbor nodes in the above-mentioned neighbor node group can be combined into respective sub-neighbor node groups as a set of sub-neighbor node groups. After that, for each sub-neighbor node group in the set of sub-neighbor node groups, the following steps are executed: Replace the above-mentioned sub-neighbor node group with the above-mentioned respective preset candidate nodes, and determine the sub-neighbor node groups that are different from the sub-neighbor node group before replacement in the replaced sub-neighbor node group and the above-mentioned set of sub-neighbor node groups as respective target neighbor node groups.

[0084] Step 6: Obtain the historical broadcast time groups corresponding to each target neighbor node group in the above-mentioned respective target neighbor node groups from the set of historical broadcast time groups, and obtain respective historical broadcast time groups. Among them, the historical broadcast time groups in the above-mentioned set of historical broadcast time groups can represent the respective time consumptions of the target neighbor node groups for preset times of broadcasting blocks. The specific value of the above-mentioned preset times is not specifically limited herein. The historical broadcast time groups in the above-mentioned set of historical broadcast time groups can include the target neighbor node groups and the respective time consumptions corresponding to the target neighbor node groups. In practice, for each neighbor node group in the above-mentioned respective neighbor node groups, the above-mentioned execution entity can obtain the historical broadcast time groups whose included target neighbor node groups are the same as the above-mentioned target neighbor node groups from the above-mentioned set of historical broadcast time groups, and obtain respective historical broadcast time groups.

[0085] Step 7: According to the above-mentioned respective historical broadcast time groups, determine the score information corresponding to each target neighbor node group in the above-mentioned respective target neighbor node groups, and obtain respective score information. Among them, the score information in the above-mentioned respective score information can represent the score for the time consumption of the target neighbor node group for broadcasting blocks. In practice, first, for each target neighbor node group in the above-mentioned respective target neighbor node groups, the following steps are executed: First, obtain the score information of the historical broadcast time group corresponding to the above-mentioned target neighbor node group from the preset score information table. The preset score information in the above-mentioned preset score information table can include the average time consumption of the historical broadcast time group and the score corresponding to the historical broadcast time group. Then, determine the obtained respective preset score information as respective score information.

[0086] In the eighth step, according to the above-mentioned respective score information, select the target neighbor node group that meets the preset combination condition from the above-mentioned respective target neighbor node groups as the broadcast node information set. Among them, the above-mentioned preset combination condition can be that the score of the target neighbor node group is the largest. The above-mentioned broadcast node information set can represent each neighbor node that broadcasts the above-mentioned block storage space. In practice, the above-mentioned execution entity can determine the target neighbor node group with the largest score among the above-mentioned respective target neighbor node groups as the target neighbor node group that meets the preset combination condition.

[0087] In the ninth step, according to the above-mentioned broadcast node information set, perform a broadcast process on the above-mentioned block storage space. In practice, the above-mentioned execution entity can use a broadcast algorithm to perform a broadcast on the above-mentioned block storage space. For example, the broadcast algorithm can be a flooding algorithm.

[0088] As an inventive point of an embodiment of the present disclosure, the above technical solution solves the third technical problem mentioned in the background technology: "When adding a new block in the blockchain to store the item data information of the supply chain, randomly select neighbor nodes to perform a broadcast process on the new block. If the transmission duration of the randomly selected neighbor nodes is relatively long, the efficiency of broadcasting the new block is low, resulting in a relatively long time-consuming for broadcasting the new block." The factors that often lead to a relatively long time-consuming for spreading the new block are as follows: randomly selecting neighbor nodes. If the above factors are solved, the effect of improving the transmission efficiency of the new block and shortening the time-consuming for spreading the new block can be achieved. To achieve this effect, the present disclosure first obtains each neighbor node group corresponding to the above-mentioned block storage space, and then, according to a preset replacement ratio, performs replacement and combination processing on each neighbor node group. After that, according to the transmission block time of each neighbor node group, score each neighbor node group after the replacement and combination processing. Then, determine the neighbor node group with a relatively high average score as the neighbor node group for broadcasting the block storage space. Instead of directly randomly selecting each neighbor node for broadcasting, select the neighbor node group with a short time-consuming for broadcasting the block to broadcast the block storage space, thereby improving the broadcast efficiency of the selected neighbor nodes and shortening the time-consuming for broadcasting the new block.

[0089] Step 1026, perform a verification process on the block storage space to determine whether the block storage space meets the preset on-chain condition.

[0090] In some embodiments, the above-mentioned execution entity may perform a verification process on the above-mentioned block storage space to determine whether the above-mentioned block storage space meets the preset on-chain condition. Among them, the above-mentioned preset on-chain condition may be that the verification result obtained by performing a verification process on the above-mentioned block storage space is a passed verification. In practice, first, the above-mentioned execution entity may control each preset node to verify the above-mentioned block storage space according to the consensus algorithm, and obtain a verification result corresponding to the above-mentioned block storage space. The above-mentioned verification result may represent the result of verifying the above-mentioned block storage space. Then, in response to determining that the obtained verification result represents a passed verification, it is determined that the above-mentioned block storage space meets the above-mentioned preset on-chain condition. After that, in response to determining that the obtained verification result represents a failed verification, it is determined that the above-mentioned block storage space does not meet the above-mentioned preset on-chain condition. Each of the above-mentioned preset nodes may represent each node in the above-mentioned target blockchain that is different from the node that created the above-mentioned block storage space.

[0091] Step 1027, in response to determining that the block storage space meets the preset on-chain condition, add the created block storage space to the target blockchain corresponding to the target supply chain.

[0092] In some embodiments, in response to determining that the above-mentioned block storage space meets the above-mentioned preset on-chain condition, the above-mentioned execution entity may add the created block storage space to the target blockchain corresponding to the above-mentioned target supply chain. In practice, first, the above-mentioned execution entity may control each of the above-mentioned preset nodes to add the above-mentioned block storage space to the corresponding blockchain copy, so as to add the created block storage space to the target blockchain corresponding to the above-mentioned target supply chain. It should be noted that each preset node corresponds to a blockchain copy.

[0093] The above-mentioned various embodiments of the present disclosure have the following beneficial effects: Through the information processing method of some embodiments of the present disclosure, the security, credibility, traceability, and symmetry of the stored item information can be improved, and the time-consuming for querying the data information of the supply chain can be shortened. Specifically, the reasons for the low security, credibility, traceability, and symmetry of the data information of the stored items and the long time-consuming for querying the data information of the supply chain are as follows: The data of each node in the supply chain are stored separately in each database, and the data of each node in the supply chain are not shared, resulting in poor symmetry and traceability of the data information between each node in the supply chain, and thus the time-consuming for querying the data information of the supply chain is long; The data stored in the database can be tampered with, resulting in low security of the stored data and low credibility of the data stored in each node of the supply chain. Based on this, the information processing method of some embodiments of the present disclosure, first, obtains the new item data information corresponding to the target supply chain. Among them, the above-mentioned new item data information represents the set of item material information in the item material providing node, the set of item manufacturing information in the item manufacturing node, the set of item transportation information in the item transportation node, or the set of item transfer information in the item transfer node. Thus, the new item data information newly added to the above-mentioned target supply chain can be obtained. Then, for the above-mentioned new item data information, the following information processing steps are performed: First, perform data cleaning processing on the above-mentioned new item data information to obtain the new item data information after data cleaning processing as the target item data information. Thus, the redundant data in the item data information can be cleaned. Then, perform verification processing on the above-mentioned target item data information to determine whether the above-mentioned target item data information meets the preset verification conditions. Thus, it can be determined whether there is still redundant data in the item data information after cleaning processing. After that, in response to determining that the above-mentioned target item data information meets the above-mentioned preset verification conditions, create a block storage space corresponding to the above-mentioned target item data information. Thus, a block corresponding to the above-mentioned target item data information can be created in the target blockchain corresponding to the above-mentioned target supply chain. Then, perform early warning verification processing on the above-mentioned block storage space to obtain the early warning verification information corresponding to the above-mentioned block storage space. Thus, the created block storage space can be verified to determine whether the created block storage space meets the preset early warning verification conditions. Then, in response to determining that the above-mentioned early warning verification information meets the preset early warning verification conditions, perform broadcast processing on the above-mentioned block storage space. Thus, the block storage space that meets the above-mentioned preset early warning verification conditions can be broadcast. After that, perform verification processing on the above-mentioned block storage space to determine whether the above-mentioned block storage space meets the preset on-chain conditions. Thus, it can be determined whether the created block storage space can be stored in the target blockchain. Finally, in response to determining that the above-mentioned block storage space meets the above-mentioned preset on-chain conditions, add the created block storage space to the target blockchain corresponding to the above-mentioned target supply chain.Thus, the created block storage space can be stored, so that the newly obtained item data information can be stored in the above-mentioned target blockchain. Also, instead of storing the item data information of each node in the supply chain in the database corresponding to the node, blocks corresponding to each node are created in the blockchain, and the item data information of each node is stored in the created blocks. Moreover, the item data information stored in the blockchain cannot be tampered with, thereby improving the credibility and security of the item data information. And the item data information stored in each block in the blockchain can be shared, thereby improving the symmetry of each item data information, reducing the time-consuming for querying item data information, and since the data of each node in the supply chain is stored in the blockchain, the traceability of the data information is improved. Thus, the security, credibility, traceability and symmetry of the information of the stored items can be improved, thereby shortening the time-consuming for querying the data information of the supply chain.

[0094] Further referring to Figure 2 , as an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of an information processing method. These device embodiments correspond to Figure 1 the method embodiments shown, and the device can be specifically applied to various electronic devices.

[0095] As Figure 2 shown, an information processing device 200 in some embodiments includes: an acquisition unit 201 and an execution unit 202. Among them, the acquisition unit 201 is configured to acquire the newly added item data information corresponding to the target supply chain, where the above-mentioned newly added item data information represents the set of item material information in the item material supply node, the set of item manufacturing information in the item manufacturing node, the set of item transportation information in the item transportation node, or the set of item circulation information in the item circulation node; the execution unit 202 is configured to perform the following information processing steps on the above-mentioned newly added item data information: perform data cleaning processing on the above-mentioned newly added item data information to obtain the newly added item data information after data cleaning processing as the target item data information; perform verification processing on the above-mentioned target item data information to determine whether the above-mentioned target item data information meets the preset verification conditions; in response to determining that the above-mentioned target item data information meets the above-mentioned preset verification conditions, create a block storage space corresponding to the above-mentioned target item data information; perform warning verification processing on the above-mentioned block storage space to obtain warning verification information corresponding to the above-mentioned block storage space; in response to determining that the above-mentioned warning verification information meets the preset warning verification conditions, perform broadcast processing on the above-mentioned block storage space; perform verification processing on the above-mentioned block storage space to determine whether the above-mentioned block storage space meets the preset on-chain conditions; in response to determining that the above-mentioned block storage space meets the above-mentioned preset on-chain conditions, add the created block storage space to the target blockchain corresponding to the above-mentioned target supply chain.

[0096] It is understandable that the various units described in the apparatus 200 correspond to the respective steps in the method described in the reference Figure 1 description. Thus, the operations, features, and beneficial effects described above for the method also apply to the apparatus 200 and the units included therein, and will not be elaborated herein.

[0097] Reference is made below to Figure 3 , which shows a schematic structural diagram of an electronic device 300 (such as a computing device) suitable for implementing some embodiments of the present disclosure. Figure 3 The electronic device shown is merely an example and should not impose any limitation on the functions and usage scope of the embodiments of the present disclosure.

[0098] As Figure 3 shown, the electronic device 300 may include a processing device 301 (such as a central processing unit, a graphics processing unit, etc.), which may perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 302 or a program loaded from a storage device 308 into a random access memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the electronic device 300 are also stored. The processing device 301, the ROM 302, and the RAM 303 are connected to each other through a bus 304. An input / output (I / O) interface 305 is also connected to the bus 304.

[0099] Generally, the following devices may be connected to the I / O interface 305: an input device 306 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 307 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 308 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 309. The communication device 309 may allow the electronic device 300 to communicate with other devices wirelessly or wiredly to exchange data. Although Figure 3 shows an electronic device 300 having various devices, it should be understood that it is not required to implement or include all the shown devices. Alternatively, more or fewer devices may be implemented or included. Figure 3 Each block shown in

[0100] In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product that includes a computer program carried on a computer-readable medium, and the computer program contains program codes for executing the methods shown in the flowcharts. In such some embodiments, the computer program can be downloaded and installed from a network through a communication device 309, or installed from a storage device 308, or installed from a ROM 302. When the computer program is executed by a processing device 301, the above functions defined in the methods of some embodiments of the present disclosure are executed.

[0101] It should be noted that the computer-readable medium described in some embodiments of the present disclosure can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the computer-readable storage medium can include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In some embodiments of the present disclosure, the computer-readable storage medium can be any tangible medium that contains or stores a program, and the program can be used by or in combination with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, the computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program codes. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium can also be any computer-readable medium other than the computer-readable storage medium, and the computer-readable signal medium can send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. The program codes contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0102] In some embodiments, the client and the server can communicate using any currently known or future-developed network protocol such as HTTP (HyperText Transfer Protocol), and can be interconnected with digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include local area networks ("LAN"), wide area networks ("WAN"), the Internet (e.g., the Internet), and end-to-end networks (e.g., ad hoc end-to-end networks), as well as any currently known or future-developed networks.

[0103] The above computer-readable medium may be included in the above electronic device; or may exist separately without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device is caused to: obtain new item data information corresponding to a target supply chain, where the new item data information represents an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item circulation information set in an item circulation node; for the new item data information, perform the following information processing steps: perform data cleaning processing on the new item data information to obtain the new item data information after data cleaning processing as target item data information; perform verification processing on the target item data information to determine whether the target item data information meets a preset verification condition; in response to determining that the target item data information meets the preset verification condition, create a block storage space corresponding to the target item data information; perform early warning verification processing on the block storage space to obtain early warning verification information corresponding to the block storage space; in response to determining that the early warning verification information meets a preset early warning verification condition, perform broadcast processing on the block storage space; perform verification processing on the block storage space to determine whether the block storage space meets a preset condition for adding to the blockchain; in response to determining that the block storage space meets the preset condition for adding to the blockchain, add the created block storage space to the target blockchain corresponding to the target supply chain.

[0104] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages or combinations thereof. The programming languages include object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, executed as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0105] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a segment of a program, or a part of code that contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and combinations of blocks in the block diagram and / or flowchart, may be implemented by a dedicated hardware-based system that performs the specified functions or operations, or may be implemented by a combination of dedicated hardware and computer instructions.

[0106] The units described in some embodiments of the present disclosure may be implemented in software or in hardware. The described units may also be provided in a processor. For example, they may be described as an acquisition unit and an execution unit. Among them, the names of these units do not constitute a limitation on the unit itself in some cases. For example, the acquisition unit may also be described as "a unit for acquiring new item data information corresponding to a target supply chain, where the new item data information represents an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item transfer information set in an item transfer node".

[0107] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that can be used include: Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), Systems on a Chip (SOCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0108] The above description is only some preferred embodiments of the present disclosure and an explanation of the applied technical principles. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above inventive concept. For example, the technical solutions formed by mutually replacing the above features with the technical features (but not limited to) having similar functions disclosed in the embodiments of the present disclosure.

Claims

1. An information processing method, comprising: Obtaining new item data information corresponding to a target supply chain, wherein the new item data information represents an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item circulation information set in an item circulation node; For the new item data information, perform the following information processing steps: Perform data cleaning processing on the new item data information to obtain the new item data information after data cleaning processing as target item data information; Perform verification processing on the target item data information to determine whether the target item data information meets a preset verification condition; In response to determining that the target item data information meets the preset verification condition, create a block storage space corresponding to the target item data information; Perform early warning verification processing on the block storage space to obtain early warning verification information corresponding to the block storage space; In response to determining that the early warning verification information meets a preset early warning verification condition, perform broadcast processing on the block storage space; Perform verification processing on the block storage space to determine whether the block storage space meets a preset on-chain condition; In response to determining that the block storage space meets the preset on-chain condition, add the created block storage space to the target blockchain corresponding to the target supply chain.

2. The method according to claim 1, wherein The performing verification processing on the target item data information to determine whether the target item data information meets a preset verification condition includes: Input the target item data information into a pre-trained redundancy detection model to obtain the redundancy corresponding to the target item data information; In response to detecting that the obtained redundancy meets a preset redundancy condition, determine that the target item data information meets the preset verification condition; In response to detecting that the obtained redundancy does not meet the preset redundancy condition, determine that the target item data information does not meet the preset verification condition.

3. The method according to claim 1, wherein The creating a block storage space corresponding to the target item data information in response to determining that the target item data information meets the preset verification condition includes: Select a block storage space that meets a preset end condition from the target blockchain as a forward block storage space; Obtain the identification information of the selected forward block storage space; According to the identification information and the target item data information, perform creation processing on the block storage space of the target item data information to obtain a block storage space corresponding to the target item data information.

4. The method according to claim 1, wherein The performing early warning verification processing on the block storage space to obtain early warning verification information corresponding to the block storage space includes: Perform early warning detection processing on the block storage space to obtain early warning information corresponding to the block storage space; Perform format detection processing on the block storage space and the target item data information to obtain format verification information corresponding to the target item data information and the block header as first verification information; Perform validity detection processing on the target item data information of the block storage space, and obtain validity verification information corresponding to the target item data information as the second verification information; Perform verification processing on the workload of the block storage space, and obtain workload verification information corresponding to the block storage space as the third verification information; Perform verification processing on the integrity of the block storage space, and obtain data integrity verification information corresponding to the block storage space as the fourth verification information; According to the warning information, the first verification information, the second verification information, the third verification information, and the fourth verification information, determine warning verification information corresponding to the block storage space.

5. The method according to claim 4, wherein The warning detection processing on the block storage space to obtain warning information corresponding to the block storage space includes: Perform warning detection on the code information of the block storage space, and obtain code warning information corresponding to the block storage space as the first warning information; Perform warning detection on the performance of the block storage space, and obtain performance warning information corresponding to the block storage space as the second warning information; According to the obtained first warning information and the second warning information, determine warning information corresponding to the block storage space.

6. The method according to claim 4, wherein The method further includes: In response to determining that the warning verification information of the block storage space does not meet the preset warning verification condition, determine verification failure factor information corresponding to the block storage space; In response to determining that the verification failure factor information indicates that the warning information fails the verification, determine warning processing method information corresponding to the warning information according to the preset warning processing method information set; Perform warning processing on the block storage space according to the determined warning processing method information; In response to determining that the verification failure factor information indicates that the first verification information, the second verification information, the third verification information, or the fourth verification information fails the verification, determine the preset verification information processing method corresponding to the block storage space according to the preset verification information processing method set; Perform warning processing on the block storage space according to the determined preset verification information processing method.

7. The method according to claim 6, wherein The performing warning processing on the block storage space according to the determined preset verification information processing method includes: In response to determining that the preset verification information processing method indicates sending warning verification information to the terminal of a preset user, send the warning verification information corresponding to the block storage space to the terminal device of the preset target user.

8. An information processing device, including: An acquisition unit configured to acquire new item data information corresponding to a target supply chain, where the new item data information represents an item material information set in an item material supply node, an item manufacturing information set in an item manufacturing node, an item transportation information set in an item transportation node, or an item circulation information set in an item circulation node; An execution unit is configured to perform the following information processing steps for the newly added item data information: perform data cleaning processing on the newly added item data information to obtain the newly added item data information after data cleaning processing as the target item data information; perform verification processing on the target item data information to determine whether the target item data information meets a preset verification condition; in response to determining that the target item data information meets the preset verification condition, create a block storage space corresponding to the target item data information; perform early warning verification processing on the block storage space to obtain early warning verification information corresponding to the block storage space; in response to determining that the early warning verification information meets a preset early warning verification condition, perform broadcast processing on the block storage space; perform verification processing on the block storage space to determine whether the block storage space meets a preset condition for being added to the blockchain; in response to determining that the block storage space meets the preset condition for being added to the blockchain, add the created block storage space to the target blockchain corresponding to the target supply chain.

9. An electronic device, comprising: One or more processors; A storage device having stored thereon one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-7.

10. A computer-readable medium having a computer program stored thereon, wherein, The computer program, when executed by a processor, implements the method according to any one of claims 1-7.

Images