Data interaction processing method, block building node, terminal device and storage medium

Abstract

Disclosed in the present application are a data interaction processing method, a block building node, a terminal device and a storage medium. The data interaction processing method comprises: on the basis of node connection relationships in a preset node relationship graph, determining the number of nodes connected to each node, wherein each node corresponds to a data interaction combination in a blockchain network system, the data interaction combination comprises a plurality of pieces of data pending interaction, and each node connection relationship is used for representing a conflict relationship between data interaction combinations; on the basis of the number of nodes connected to each node and the value of the corresponding data interaction combination, determining retained nodes; and packaging data interaction combinations corresponding to the retained nodes into a block, and adding the block to the blockchain network system. The solution enhances the value of blockchain data interaction processing, meets the timeliness requirement for blockchain data interaction, and also reduces the technical requirements for smart contracts and the underlying architecture of blockchains.

Description

Data interaction processing method, block construction node, terminal device and storage medium

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on March 21, 2024, with application number 202410325681.2 and invention name “Data interaction processing method, block construction node, terminal device and storage medium”, the entire content of which is incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of blockchain technology, and specifically to a data interaction processing method, a block construction node, a terminal device, and a storage medium. Background Art

[0003] Blockchain is a distributed database technology characterized by decentralized data storage and immutability, making data interaction more secure, transparent and trustworthy. Blockchain data interaction refers to the process of data transmission and sharing between nodes in the blockchain network. Packaging multiple interactive data forms a data interaction combination. The value of data interaction can be quantified by the degree of impact it can bring to the data interacting parties or the amount of information contained in the data itself.

[0004] However, with the continuous expansion of blockchain networks and the increase in data volume, data interaction combinations are becoming increasingly complex, potentially involving multiple on-chain and off-chain data sources. Furthermore, conflicting relationships between interaction data may exist, preventing simultaneous execution. Therefore, the processing of interaction data within a data interaction combination typically involves filtering out the higher-value interaction data for processing, ensuring that data value is maximized within limited processing resources. Current technology typically processes conflicting data interaction combinations by performing a large number of simulations to select the optimal multiple interaction data sets, ensuring that the selected interaction data sets do not conflict with each other. However, these large simulations, on the one hand, cannot meet the timeliness requirements of blockchain data interaction, and on the other hand, the excessive amount of data processing places higher demands on the design of blockchain smart contracts and the configuration of blockchain processing performance. Furthermore, this can make the underlying blockchain architecture overly bloated, resulting in numerous deficiencies. Technical issues

[0005] One of the purposes of the embodiments of the present application is to provide a data interaction processing method, a block construction node, a terminal device and a storage medium. Technical Solutions

[0006] The technical solution adopted in the embodiment of this application is:

[0007] In a first aspect, a data interaction processing method is provided. The data interaction processing method is executed by a block construction node, and the data interaction processing method includes:

[0008] The number of node connections of each node is determined based on the node connection relationship in a preset node relationship graph; each node corresponds to a data interaction combination in the blockchain network system; the data interaction combination includes multiple pieces of data to be interacted; each node connection relationship is used to represent a conflict relationship of the data interaction combination;

[0009] Determine the nodes to be retained based on the number of node connections of each node and the value of the corresponding data interaction combination;

[0010] The data interactions corresponding to the retained nodes are packaged into blocks, and the blocks are added to the blockchain network system.

[0011] In a second aspect, a block construction node is provided, the block construction node comprising:

[0012] A first execution module is configured to determine the number of node connections for each node based on a node connection relationship in a preset node relationship graph; each node corresponds to a data interaction combination in the blockchain network system; the data interaction combination includes a plurality of data to be interacted; and each node connection relationship is used to represent a conflict relationship of the data interaction combination;

[0013] A second execution module is used to determine the nodes to be retained based on the number of node connections of each node and the value of the corresponding data interaction combination;

[0014] The third execution module is used to package the data interaction combinations corresponding to the retained nodes into blocks, and add the blocks to the blockchain network system.

[0015] In a third aspect, a terminal device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method described in the first aspect when executing the computer program.

[0016] In a fourth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method described in the first aspect is implemented.

[0017] In a fifth aspect, a computer program product is provided. When the computer program product is run on a terminal device, the terminal device executes the method described in the first aspect. Beneficial effects

[0018] The embodiments of the present application provide a data interaction processing method, a block construction node, a terminal device and a storage medium. By visually representing the conflict relationship between each data interaction combination through a node connection relationship and embodying it in a node relationship diagram, the conflict relationship between each data interaction combination and other data interaction combinations can be determined by determining the number of node connections of each node, and then the nodes that need to be retained are determined in combination with the value of each data interaction combination. In this way, while resolving data interaction conflicts, the data interaction value is optimized to the greatest extent possible, that is, a data interaction combination with a better data interaction value is obtained. Compared with the prior art, which requires a large number of comparative calculations to obtain a data interaction combination corresponding to a better data interaction value, the data interaction processing method of the present application eliminates a large amount of calculations, and at the same time intuitively and effectively improves the blockchain data interaction processing value, meets the timeliness requirements of blockchain data interaction, and at the same time, because it does not involve a large amount of calculation verification, it reduces the technical requirements for the underlying architecture of smart contracts and blockchains. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the embodiments or exemplary technical descriptions. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0020] FIG1 is a flowchart of a data interaction processing method according to an embodiment of the present application;

[0021] FIG2 is a preset node relationship diagram provided in an embodiment of the present application;

[0022] FIG3 is a second flowchart of a data interaction processing method provided in an embodiment of the present application;

[0023] FIG4 is one of the node relationship diagrams provided in an embodiment of the present application;

[0024] FIG5 is a second node relationship diagram provided in an embodiment of the present application;

[0025] FIG6 is a third node relationship diagram provided in an embodiment of the present application;

[0026] FIG7 is a third flowchart of a data interaction processing method provided in an embodiment of the present application;

[0027] FIG8 is a fourth flowchart of a data interaction processing method provided in an embodiment of the present application;

[0028] FIG9 is a schematic diagram of the structure of a block construction node provided in an embodiment of the present application;

[0029] FIG10 is a schematic structural diagram of a terminal device provided in an embodiment of the present application. Modes for Carrying Out the Invention

[0030] In order to make the purpose, technical solutions and advantages of this application more clearly understood, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit this application.

[0031] It should be noted that the term "comprising" indicates the presence of the described features, entities, steps, operations, elements, and / or components, but does not exclude the presence or addition of one or more other features, entities, steps, operations, elements, components, and / or combinations thereof. It should also be understood that the term "and / or" as used in this specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, including such combinations. The term "if" can be interpreted as meaning "when..." or "upon..." or "in response to determining..." or "in response to detecting," depending on the context. Similarly, the phrases "if it is determined" or "if [the described condition or event] is detected" can be interpreted as meaning "upon determination," "in response to determining," or "upon detecting [the described condition or event]," or "in response to detecting [the described condition or event]," depending on the context. The terms "first" and "second" are used for descriptive purposes only and should not be construed to indicate or imply relative importance or implicitly specify the number of technical features. "Multiple" means two or more, unless otherwise specifically defined.

[0032] As blockchain networks continue to expand and data volumes increase, data interactions become increasingly complex, and conflicts may arise between interacting data, preventing them from being executed simultaneously. Current technologies typically handle conflicting data interactions by performing extensive simulations to select optimal, conflict-free interaction data. However, these extensive simulations fail to meet the timeliness requirements of blockchain data interactions and, due to the sheer volume of data being processed, place higher demands on the design of blockchain smart contracts and the performance of blockchain processing. Furthermore, they can lead to bloated underlying blockchain architectures and numerous shortcomings.

[0033] In this regard, the present application proposes a data interaction processing method, a block construction node, a terminal device and a storage medium. The inventors have discovered through demonstration that each data interaction combination can be set to correspond to a node, and the conflict relationship between the data interaction combinations can be concretely represented through the node connection relationship. By setting a node screening method and combining the value of each data interaction combination, the nodes with conflicting relationships are eliminated, and finally the nodes that need to be retained are determined. In this way, the data interaction value is optimized to the greatest extent while resolving data interaction conflicts, and the timeliness requirements of blockchain data interaction are met. At the same time, since it does not involve a large amount of computational verification, the requirements for the underlying architecture of smart contracts and blockchains are reduced.

[0034] The aforementioned data interaction processing method is executed by a block building node. It should be noted that a block building node is a node in a blockchain network system responsible for packaging and verifying interaction data and generating new blocks. The main functions of a block building node include verifying the validity of interaction data, ensuring that data interactions comply with pre-set rules and protocols, packaging verified transactions into new blocks, and participating in the blockchain network's consensus mechanism to add the blocks to the blockchain network system.

[0035] In order to illustrate the technical solution of the present application, specific embodiments are provided below.

[0036] FIG1 shows a flow chart of a data interaction processing method provided in an embodiment of the present application. Referring to FIG1 , a data interaction processing method provided in an embodiment of the present application includes the following steps:

[0037] Step S101: Determine the number of node connections for each node based on the node connection relationship in a preset node relationship graph; each node corresponds to a data interaction combination in the blockchain network system; the data interaction combination includes multiple pieces of data to be interacted; each node connection relationship is used to represent a conflict relationship of the data interaction combination;

[0038] Step S102: determining the nodes to be retained based on the number of node connections of each node and the value of the corresponding data interaction combination;

[0039] Step S103: Packing the data interactions corresponding to the retained nodes into blocks, and adding the blocks to the blockchain network system.

[0040] It can be seen that in step S101 of this embodiment of the present application, each node is set to correspond to a data interaction combination in the blockchain network system, and each node connection relationship is used to represent the conflict relationship of the data interaction combination. Therefore, by determining the node connection number of each node in the preset node relationship diagram through step S101, the association between the nodes can be clearly understood, and the conflict relationship corresponding to each node can be determined, which provides a basis for subsequent node screening operations. Then, through step S102, the node connection number and the value of the data interaction combination are combined to screen out nodes that are beneficial to the overall value, and eliminate nodes with more complex conflict relationships, so as to optimize the efficiency and value of data interaction. Finally, through step S103, the screened and determined data interaction combinations are added to the blocks of the blockchain network to ensure that these data interaction combinations can be securely stored, executed and transmitted, thereby ensuring that data interaction processing is effective.

[0041] It should be noted that there are multiple data interaction combinations in the blockchain network system. A data interaction combination refers to a data combination that needs to interact in the blockchain network, including multiple pieces of data to be interacted. For example, there are two parties A and B interacting with data. A transmits data x to B, and B transmits data y to A. Then a two-way data interaction is completed between A and B. In addition, one-way data interaction is also possible. For example, A transmits data x to B, but B does not transmit data. These data may involve information transmission, exchange or sharing between the two parties interacting with data.

[0042] It should be noted that the node relationship diagram is composed of nodes and connecting line segments, where each node corresponds to a data interaction combination in the blockchain network system. If there is a conflict relationship between the data interaction combinations corresponding to the nodes, there will be a connecting line segment between the two nodes, and the connection relationship between the two nodes indicates that there is a conflict relationship.

[0043] It should be noted that the number of node connections refers to the number of connection relationships between each node and other nodes. If there is a conflict relationship between two data interaction combinations, there is a connection relationship between the nodes corresponding to the two data interaction combinations. By determining the number of node connections of a node, the number of nodes that have a conflict relationship with the node can be determined.

[0044] In addition, it should be noted that the conflict relationship refers to the possible contradictory or competitive relationship between data interaction combinations, indicating the mutual exclusion or incompatibility between certain data interaction combinations in the blockchain network. For example, the conflict relationship includes the inability to execute atomically between two or more data interaction combinations at the same time.

[0045] The existing technology generally processes data interaction combinations with conflicting relationships by selecting the optimal multiple interaction data through a large number of simulation calculations. For example, in data interaction group A, there are interaction data: a1, a2, a3, a4, a5, and a6. The existing technology calculates the value of a1 to a6 through a large number of simulation verifications combined with empirical data verification, and then provides the data with the highest value among a1 to a6 according to the required number of interaction data. For example, among a1 to a6, a2 and a5 have the highest value. At this time, it can be determined through simulation calculations that there is no conflict relationship between a2 and a5, so a2 and a5 are selected for processing. This process consumes a lot of computing power and the calculation time is too long, which reduces the data processing efficiency of the blockchain. Compared with the existing technology, this application meets the timeliness requirements of blockchain data interaction. At the same time, because it does not involve a large amount of calculation verification, it reduces the requirements for the underlying architecture of smart contracts and blockchain.

[0046] The core concept of the present application is described in detail below with reference to FIG2 . FIG2 shows a preset node relationship diagram, and FIG2 is used as an example for description.

[0047] Referring to Figure 2, there are data interaction combinations A, B, and C, which correspond to nodes 1, 2, and 3 respectively. Step S101 is executed. Node 2 is connected to nodes 1 and 3 respectively. It can be determined that the number of connections of node 1 is 1, the number of connections of node 2 is 2, and the number of connections of node 3 is 1. Step S102 is executed. Node 2 has the largest number of connections, indicating that it has the largest number of corresponding conflict relationships. Therefore, node 2 is eliminated, and node 1 and node 3 are retained. Step S103 is executed to add the data interaction combinations A and C corresponding to the retained nodes 1 and 3 respectively to the blocks summarized by the blockchain network system.

[0048] As a possible embodiment, in order to maximize the optimization of data interaction value while resolving data interaction conflicts, it is necessary to effectively determine the nodes that should be retained in the node connection graph. Accordingly, referring to FIG. 3 , step S102 may specifically adopt the following steps:

[0049] Step S201: executing a first determination step, wherein the first determination step includes determining at least one node with the largest number of currently connected nodes based on the number of node connections of each node;

[0050] Step S202: executing a second determination step, the second determination step including removing the node with the lowest value from the at least one determined node according to the value of the data interaction combination corresponding to each node, and updating the node relationship graph;

[0051] Step S203: Repeat the first determining step and the second determining step until all nodes in the updated node relationship graph have no connection relationship, and output the retained nodes.

[0052] Specifically, the first determination step in step S201 includes determining the node with the most connections based on the number of connections of each node. In this way, since each connection relationship of the node represents a conflict relationship, the node with the most node connections represents the node with the most conflicts with other nodes. Then in step S202, the second determination step is executed to find the node with the most node connections and eliminate the node with the lowest value. Finally, the first determination step and the second determination step are repeated to ensure that what is finally retained is a node combination with no conflict relationship between nodes and a relatively high node value.

[0053] It should be noted that the value of the data interaction of the present application is a reflection of the degree of impact of the data interaction on each party, or the data value can be reflected by the amount of information contained in the data. For example, in terms of the degree of impact, a sends data x to b, and because b receives data x, the priority and importance of b are significantly improved compared to b without data x. Therefore, the degree of impact can be quantified according to the preset degree of impact setting, or for an embodiment in which the data value is a reflection of the amount of information, the amount of information contained in the x data is nMB, then its value is set to n, that is, the amount of information and the value are directly proportional.

[0054] The node relationship diagram shown in FIG4 is used as an example for explanation.

[0055] Executing step S201, it can be obtained that there are nodes 1, 2, 3, and 4 in FIG3. The node connection number corresponding to node 1 is 1 and the value is 1; the node connection number corresponding to node 2 is 2 and the value is 2; the node connection number corresponding to node 3 is 2 and the value is 3; the node connection number corresponding to node 4 is 1 and the value is 4; nodes 2 and 3 have the most node connections;

[0056] By executing step S202, it can be found that the value of node 2 is lower than that of node 3, so node 2 is removed, and the updated node relationship diagram is shown in FIG5;

[0057] Executing step S203 reveals that Figure 5 contains nodes 1, 3, and 4. Node 1 has a node connection count of 0 and a value of 1; node 3 has a node connection count of 1 and a value of 3; and node 4 has a node connection count of 1 and a value of 4. Nodes 3 and 4 have the most node connections, but node 3 has a lower value than node 4. Therefore, node 3 is removed and the node relationship diagram is updated as shown in Figure 6. Referring to Figure 5, it can be seen that there is no connection between nodes 1 and 4 in Figure 5, so nodes 1 and 4 are retained.

[0058] The above-mentioned embodiments of the present application screen out the retained nodes based on the number of node connections and the value of the data interaction combination, thereby resolving data interaction conflicts and maximizing the value of data interaction.

[0059] As a possible embodiment, before executing the above step S101, it is necessary to first construct a node relationship graph to ensure the smooth execution of the subsequent step S101. The corresponding construction steps include:

[0060] The node relationship graph is constructed according to the conflict relationship and value of each data interaction combination.

[0061] Specifically, each node corresponds to a data interaction combination in the blockchain network system. Each data interaction combination can obtain corresponding value data after evaluation and corresponding calculation. The connection method between nodes is used to intuitively represent the conflict relationship between each data interaction combination. Each node is assigned the value of its corresponding data interaction combination, thereby constructing a node relationship diagram.

[0062] In an embodiment that can be implemented in the present application, the node relationship graph is constructed based on the conflict relationship and value of each data interaction combination. Specifically, the following operation steps can be used:

[0063] Assign each data interaction combination and corresponding value to a node;

[0064] The nodes corresponding to the data sets with conflicting relationships are connected to form the node relationship graph.

[0065] For example, referring to Figure 4, there are 4 data interaction combinations A, B, C, and D. The transaction set of A is {1, 2}, with a value of 1; the transaction set of B is {2, 3}, with a value of 2; the transaction set of C is {3, 4}, with a value of 3; and the transaction set of D is {4, 5}, with a value of 4. The 4 data interaction combinations A, B, C, and D and their corresponding values ​​are each assigned to a node, and A corresponds to node 1, B corresponds to node 2, C corresponds to node 3, and D corresponds to node 4. Since there is a conflict relationship between A and B, a conflict relationship between B and C, and a conflict relationship between C and D, node 1 is connected to node 2, node 2 is connected to node 3, and node 3 is connected to node 4, and finally a node relationship graph is formed.

[0066] By establishing the connection relationship between the nodes, the conflict relationship between the nodes can be clearly understood, which is convenient for subsequent data interaction processing.

[0067] 7 , in one embodiment that can be implemented in the present application, before determining the number of node connections of each node according to the node relationship graph, the data interaction processing method further includes:

[0068] Step S301: receiving data interaction requests input by multiple users, wherein the data interaction requests include the data interaction combination and the block time range;

[0069] Step S302: determining a current list of prepared interaction requests and a list of currently processed running interaction requests according to the block time range corresponding to each data interaction request;

[0070] Step S303: For each data interaction request in the preliminary interaction request list, if the current block time reaches the corresponding block time range, the data interaction request is transferred from the preliminary interaction request list to the running interaction request list; wherein, each node corresponds to a data interaction combination in the blockchain network system, specifically: each node corresponds to one of the data interaction combinations included in the running interaction request list.

[0071] Specifically, step S301 receives data interaction requests from multiple users, that is, receives corresponding data interaction combinations and block time ranges, so that subsequent operations can be performed to classify data according to the block time range; step S302 classifies the data interaction combinations into a preliminary interaction request list and an operating interaction request list according to the pre-received block time range, the preliminary interaction request list includes data interaction requests for preparation for processing, and the operating interaction request list includes data interaction requests for processing in progress; step S303 processes the data interaction requests in the preliminary interaction request list, and when the current block time reaches the preset block time range, transfers the corresponding data transaction request from the preliminary interaction request list to the operating interaction request list. In this way, the data interaction requests input by the user can be effectively managed and executed, and the execution of the requests can be dynamically scheduled according to the block time range, thereby realizing the automated management of data interaction combination management and scheduling of data interaction requests in the blockchain network system.

[0072] Exemplarily, step S301 is executed to receive data interaction requests input by multiple users, and the block construction node provides a data interface to receive the data interaction requests.

[0073] Then, step S302 is executed. After receiving data interaction requests input by multiple users, the block construction node divides the requests into two categories according to the block time range specified by each data interaction request: a preparation interaction request list and a running interaction request list.

[0074] Finally, step S303 is executed. For each data interaction request in the preliminary interaction request list, if the current block time reaches the corresponding block time range, the data interaction request is transferred from the preliminary interaction request list to the running interaction request list.

[0075] This embodiment of the present application can effectively manage and execute data interaction requests input by users, dynamically schedule the execution of requests according to the block time range, and realize the automated management of data interaction combination management and scheduling of data interaction requests in the blockchain network system.

[0076] 8 , as a possible embodiment, the specific list determination steps include:

[0077] Step S401: For each data interaction request, if the current block time in the blockchain network system has not yet reached the block time range, the data interaction request is placed in the preliminary interaction request list;

[0078] Step S402: For each data interaction request, if the current block time in the blockchain network system is within the block time range, the data interaction request is placed in the running interaction request list;

[0079] Step S403: For each data interaction request, if the current block time in the blockchain network system exceeds the block time range, the data interaction request is abandoned.

[0080] Exemplarily, the block time range is between the earliest valid time (minTimestamp) and the latest valid time (maxTimestamp). A bundle refers to a data interaction combination. Step S401 is executed to determine whether the current block time is between minTimestamp and maxTimestamp. If the current block time is earlier than minTimestamp, the bundle is placed in the prepare_back_bundle list of interaction requests. This continues until blocks are continuously generated and the current block time is greater than or equal to minTimestamp. Step S402 is then executed to move the bundle into the run_back_bundle list of interaction requests. If the current time is later than maxTimestamp, step S403 is executed to abandon the bundle and return an error message to the user stating: "bundle too late."

[0081] As a possible embodiment, after determining the current preliminary interaction request list and the currently processed running interaction request list, the data interaction processing method of the present application further includes:

[0082] Each data interaction combination in the preliminary interaction request list and the running interaction request list is simulated and executed to obtain the value of each data interaction combination.

[0083] Exemplarily, the block construction node first executes all data interaction combinations in sequence based on its own data interaction combination sorting algorithm, saves the current blockchain state, and then separately executes all data interaction combinations in the running interaction request list on the current blockchain state to obtain the value of each data interaction combination under the current block execution.

[0084] It should be noted that the value of the data interaction of the present application is a reflection of the degree of impact of the data interaction on each party, or can be reflected by the amount of information contained in the data.

[0085] This embodiment of the present application obtains the value of each data interaction combination through pre-simulation execution reception, so as to assist subsequent node screening operations.

[0086] FIG9 is a schematic structural diagram of a block construction node provided in an embodiment of the present application. For ease of explanation, only the parts related to the embodiment of the present application are shown.

[0087] Block building nodes can specifically include the following modules:

[0088] A first execution module M1 is configured to determine the number of node connections for each node based on a node connection relationship in a preset node relationship graph; each node corresponds to a data interaction combination in the blockchain network system; the data interaction combination includes multiple pieces of data to be interacted; and each node connection relationship is used to represent a conflict relationship of the data interaction combination;

[0089] A second execution module M2 is used to determine the nodes to be retained based on the number of node connections of each node and the value of the corresponding data interaction combination;

[0090] The third execution module M3 is used to package the data interaction combinations corresponding to the retained nodes into blocks, and add the blocks to the blockchain network system.

[0091] In this embodiment of the present application, the first execution module M1 determines the node connection number of each node based on the node connection relationship in a preset node relationship diagram, thereby clearly understanding the relationship between the nodes. The second execution module M2 combines the node connection number of each node and the value of the data interaction combination to screen out nodes that are beneficial to the overall system, thereby optimizing the efficiency and value of data interaction. The third execution module M3 adds the screened and determined data interaction combinations to the blocks of the blockchain network to ensure that these data interaction combinations can be securely stored, executed and transmitted, thereby ensuring that data interaction processing is effective.

[0092] This application uses the first execution module M1, the second execution module M2 and the third execution module M3 to visualize the conflict relationship between each data interaction combination through the node connection relationship, and embodies it in the node relationship diagram. By determining the number of node connections of each node, the conflict relationship between each data interaction combination and other data interaction combinations can be determined, and then the nodes that need to be retained are determined in combination with the value of each data interaction combination, thereby achieving the maximum optimization of data interaction value while resolving data interaction conflicts.

[0093] Based on the same inventive concept, the second execution module in the embodiment of the present application includes:

[0094] a first determining step execution module, the first determining step execution module being configured to determine, based on the number of node connections of each node, at least one node with the largest number of current node connections;

[0095] a second determining step execution module, configured to remove a node with the lowest value from the at least one determined node based on the value of the data interaction combination corresponding to each node, and update the node relationship graph;

[0096] A repeated execution module is used to repeatedly execute the first determination step and the second determination step until all nodes in the updated node relationship graph have no connection relationship, and output the retained nodes.

[0097] Based on the same inventive concept, the block construction node in the embodiment of the present application further includes:

[0098] A construction module is used to construct the node relationship graph according to the conflict relationship and value of each data interaction combination.

[0099] Based on the same inventive concept, the building blocks in the embodiment of the present application further include:

[0100] A first construction submodule, the first construction submodule is used to assign each data interaction combination and the corresponding value to a node;

[0101] The second construction submodule is used to connect the nodes corresponding to the data interaction combinations with conflict handling relationships to form the node relationship graph.

[0102] Based on the same inventive concept, the block construction node in the embodiment of the present application further includes:

[0103] a receiving module, configured to receive data interaction requests input by multiple users, wherein the data interaction requests include the data interaction combination and a block time range;

[0104] a determination module, configured to determine a current list of preliminary interaction requests and a list of currently processed running interaction requests according to the block time range corresponding to each data interaction request;

[0105] A judgment module is configured to transfer, for each data interaction request in the preliminary interaction request list, the data interaction request from the preliminary interaction request list to the running interaction request list if the current block time reaches the corresponding block time range; wherein each node corresponds to a data interaction combination in the blockchain network system, specifically: each node corresponds to one of the data interaction combinations included in the running interaction request list.

[0106] Based on the same inventive concept, the determination module in the embodiment of the present application includes:

[0107] A classification module, wherein the classification module is configured to place each data interaction request into the prepared interaction request list if the current block time in the blockchain network system has not yet reached the block time range; place each data interaction request into the running interaction request list if the current block time in the blockchain network system is within the block time range; and abandon each data interaction request if the current block time in the blockchain network system exceeds the block time range.

[0108] Based on the same inventive concept, the block construction node in the embodiment of the present application further includes:

[0109] A simulation execution module is used to simulate the execution of each data interaction combination in the preliminary interaction request list and the running interaction request list to obtain the value of each data interaction combination.

[0110] Figure 10 is a schematic diagram of the structure of a terminal device provided in an embodiment of the present application. The terminal device E1 includes: at least one processor E2 (only one is shown in Figure 10 ), a memory E3, and a computer program E4 stored in the memory E3 and executable on the at least one processor E2. When the processor E2 executes the computer program E4, the steps of the above method embodiment are implemented.

[0111] The terminal device E1 can be a computing device such as a desktop computer, laptop, PDA, or cloud server. The terminal device may include, but is not limited to, a processor E2 and a memory E3. Those skilled in the art will appreciate that FIG10 is merely an example of the terminal device E1 and does not limit the terminal device E1. The terminal device E1 may include more or fewer components than shown, or may combine certain components or different components. For example, it may also include input / output devices, network access devices, etc.

[0112] The processor E2 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. A general-purpose processor may be a microprocessor or any conventional processor.

[0113] In some embodiments, the memory E3 may be an internal storage unit of the terminal device E1, such as a hard drive or memory of the terminal device E1. In other embodiments, the memory E3 may also be an external storage device of the terminal device E1, such as a plug-in hard drive, a Smart Media Card (SMC), a Secure Digital (SD) card, a flash memory card, etc. equipped on the terminal device E1. The memory E3 may also include both an internal storage unit of the terminal device E1 and an external storage device. The memory E3 is used to store an operating system, application programs, a boot loader, data, and other programs, such as the program code of the computer program. The memory E3 may also be used to temporarily store data that has been output or is about to be output.

[0114] Those skilled in the art can clearly understand that, for the convenience and brevity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In actual applications, the above-mentioned functions can be distributed and completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated into one processing unit, or each unit can exist physically alone, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0115] In the above embodiments, the description of each embodiment has different emphases. If a rated part is not described or recorded in detail in a certain embodiment, reference may be made to the relevant descriptions of other embodiments.

[0116] An embodiment of the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.

[0117] An embodiment of the present application provides a computer program product. When the computer program product is run on a mobile terminal, the mobile terminal can implement the steps in the above-mentioned various method embodiments when executing the computer program product.

[0118] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0119] In the embodiments provided in this application, it should be understood that the disclosed devices / network equipment and methods can be implemented in other ways. For example, the device / network equipment embodiments described above are merely illustrative. For example, the division of the modules or units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0120] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0121] In addition, the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above units may be implemented in the form of hardware or software.

[0122] If the integrated module / unit is implemented as a software functional unit and sold or used as a standalone product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application can implement all or part of the process steps in the above-mentioned method embodiments by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When executed by a processor, the computer program can implement the steps of each of the above-mentioned method embodiments. The computer program includes computer program code, which can be in source code form, object code form, executable file, or some intermediate form. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal, and software distribution medium. It should be noted that the content of the computer-readable medium can be appropriately increased or decreased based on the requirements of legislation and patent practice in a jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media does not include electric carrier signals and telecommunication signals.

[0123] The present application implements all or part of the processes in the above-mentioned embodiment method, and can also be completed through a computer program product. When the computer program product is run on a terminal device, the terminal device can implement the steps in the above-mentioned method embodiments when executing.

[0124] The above are merely optional embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included within the scope of the claims of the present application.

Claims

1. A data interaction processing method, characterized in that: The data interaction processing method is executed by a block construction node, and the data interaction processing method includes: The node connection number of each node is determined based on the node connection relationship in the preset node relationship diagram; each node corresponds to a data interaction combination in the blockchain network system; the data interaction combination includes multiple pieces of data to be interacted; each node connection relationship is used to represent the conflict relationship of the data interaction combination; Determine the nodes to be retained based on the number of node connections of each node and the value of the corresponding data interaction combination; The data interactions corresponding to the retained nodes are packaged into blocks, and the blocks are added to the blockchain network system.

2. The data interaction processing method according to claim 1, characterized in that: The determination of the retained nodes based on the number of node connections of each node and the value of the corresponding data interaction combination includes: Performing a first determining step, the first determining step comprising determining at least one node having the largest number of current node connections based on the number of node connections of each node; executing a second determining step, the second determining step comprising removing a node with the lowest value from the at least one determined node according to the value of the data interaction combination corresponding to each node, and updating the node relationship graph; The first determining step and the second determining step are repeatedly performed until all nodes in the updated node relationship graph have no connection relationship, and the retained nodes are output.

3. The data interaction processing method according to claim 1, characterized in that: Before determining the number of node connections of each node according to the node connection relationship in a preset node relationship graph, the data interaction processing method further includes: The node relationship graph is constructed according to the conflict relationship and value of each data interaction combination.

4. The data interaction processing method according to claim 3, characterized in that: The step of constructing the node relationship graph according to the conflict handling relationship and value of each data interaction combination includes: Assign each data interaction combination and corresponding value to a node; The nodes corresponding to the data interaction combinations with conflict handling relationships are connected to form the node relationship graph.

5. The data interaction processing method according to claim 1, characterized in that: Before determining the number of node connections of each node according to the node connection relationship in a preset node relationship graph, the data interaction processing method further includes: receiving data interaction requests input by multiple users, wherein the data interaction requests include the data interaction combination and the block time range; Determine a current list of preliminary interaction requests and a list of currently processed running interaction requests according to the block time range corresponding to each data interaction request; For each data interaction request in the preliminary interaction request list, if the current block time reaches the corresponding block time range, the data interaction request is transferred from the preliminary interaction request list to the running interaction request list; wherein, each node corresponds to a data interaction combination in the blockchain network system, specifically: each node corresponds to one of the data interaction combinations included in the running interaction request list.

6. The data interaction processing method according to claim 5, characterized in that: Determining a current list of preliminary interaction requests and a list of currently processed running interaction requests based on the block time range corresponding to each data interaction request includes: For each data interaction request, if the current block time in the blockchain network system has not yet reached the block time range, the data interaction request is placed in the preliminary interaction request list; For each data interaction request, if the current block time in the blockchain network system is within the block time range, the data interaction request is placed in the running interaction request list; For each data interaction request, if the current block time in the blockchain network system exceeds the block time range, the data interaction request is abandoned.

7. The data interaction processing method according to claim 5, characterized in that: After determining the current preliminary interaction request list and the currently processed running interaction request list according to the block time range corresponding to each data interaction request, the data interaction processing method further includes: Each data interaction combination in the preliminary interaction request list and the running interaction request list is simulated and executed to obtain the value of each data interaction combination.

8. A block construction node, characterized in that: The block building node includes: A first execution module is configured to determine the number of node connections for each node based on a node connection relationship in a preset node relationship graph; each node corresponds to a data interaction combination in the blockchain network system; the data interaction combination includes a plurality of data to be interacted; and each node connection relationship is used to represent a conflict relationship of the data interaction combination; A second execution module is used to determine the nodes to be retained based on the number of node connections of each node and the value of the corresponding data interaction combination; The third execution module is used to package the data interaction combinations corresponding to the retained nodes into blocks, and add the blocks to the blockchain network system.

9. The block building node according to claim 8, characterized in that: The second execution module includes: a first determining step execution module, the first determining step execution module being configured to determine, based on the number of node connections of each node, at least one node with the largest number of current node connections; a second determining step execution module, configured to remove a node with the lowest value from the at least one determined node based on the value of the data interaction combination corresponding to each node, and update the node relationship graph; A repeated execution module is used to repeatedly execute the first determination step and the second determination step until all nodes in the updated node relationship graph have no connection relationship, and output the retained nodes.

10. The block building node according to claim 8, characterized in that: The block construction node also includes: A construction module is used to construct the node relationship graph according to the conflict relationship and value of each data interaction combination.

11. The block building node according to claim 10, characterized in that: The building blocks include: A first construction submodule, the first construction submodule is used to assign each data interaction combination and the corresponding value to a node; The second construction submodule is used to connect the nodes corresponding to the data interaction combinations with conflict handling relationships to form the node relationship graph.

12. The block building node according to claim 8, characterized in that: The block construction node also includes: a receiving module, configured to receive data interaction requests input by multiple users, wherein the data interaction requests include the data interaction combination and a block time range; a determination module, configured to determine a current list of preliminary interaction requests and a list of currently processed running interaction requests according to the block time range corresponding to each data interaction request; A judgment module is configured to transfer, for each data interaction request in the preliminary interaction request list, the data interaction request from the preliminary interaction request list to the running interaction request list if the current block time reaches the corresponding block time range; wherein each node corresponds to a data interaction combination in the blockchain network system, specifically: each node corresponds to one of the data interaction combinations included in the running interaction request list.

13. The block building node according to claim 12, characterized in that: The determination module includes: A classification module, wherein the classification module is configured to place each data interaction request into the prepared interaction request list if the current block time in the blockchain network system has not yet reached the block time range; place each data interaction request into the running interaction request list if the current block time in the blockchain network system is within the block time range; and abandon each data interaction request if the current block time in the blockchain network system exceeds the block time range.

14. The block building node according to claim 12, characterized in that: The block construction node also includes: A simulation execution module is used to simulate the execution of each data interaction combination in the preliminary interaction request list and the running interaction request list to obtain the value of each data interaction combination.

15. A terminal device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method according to any one of claims 1 to 7 is implemented.

16. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images