Business data processing method, related device, equipment, system and storage medium

Through parallel chaining between node clusters and local blockchain management in blockchain in blockchain in blockchain technology, the problem of low transaction efficiency in alliance nodes is solved, and efficient resource utilization and data security are achieved.

CN119030992APending Publication Date: 2024-11-26安徽省大数据中心
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410901668.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-05
Publication Date
2024-11-26

Smart Images

  • Figure CN119030992A_ABST
    Figure CN119030992A_ABST
Patent Text Reader

Abstract

The invention discloses a service data processing method, a related device, equipment, a system and a storage medium, and the method comprises the steps: receiving a data storage certificate broadcasted by each service node in different node clusters; wherein the service node generates a data block based on service data acquired from a service system, links the data block to a local data chain of a node cluster where the data block is located, and generates a data storage certificate of a corresponding service type based on existing service data about the same service type; and linking the daemon block generated based on the data storage to the first daemon chain, and issuing the daemon block to each node cluster so as to synchronize the daemon block to a local second daemon chain of each node cluster. According to the scheme, the uplink efficiency and the data security can be improved on the premise of reducing resource waste and repeated construction as much as possible.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a business data processing method and related devices, equipment, systems and storage media. Background Art

[0002] Blockchain technology has the characteristics of decentralization and immutability. It is suitable for uploading large amounts of business data to the chain in government affairs, business and other environments, thereby ensuring the authenticity of the business data.

[0003] At present, in the existing technology, multiple alliance nodes maintain a blockchain, and transactions on the chain need to be executed serially, which has low execution efficiency. In order to improve the efficiency of chaining, nodes are repeatedly built, which will cause waste of resources and duplication of construction. In view of this, how to improve the efficiency of chaining and data security while minimizing the waste of resources and duplication of construction has become an urgent problem to be solved. Summary of the invention

[0004] The main technical problem solved by this application is to provide a business data processing method and related devices, equipment, systems and storage media, which can improve chain efficiency and data security while minimizing resource waste and duplication of construction.

[0005] In order to solve the above technical problems, the first aspect of the present application provides a business data processing method, including: receiving data evidence broadcast by each business node in different node clusters; wherein the business node generates a data block based on the business data obtained from the business system, and links the data block to the data chain local to the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type; links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each node cluster to synchronize it to the second guard chain local to each node cluster.

[0006] In order to solve the above-mentioned technical problems, the second aspect of the present application provides a business data processing method, including: linking the data block generated by the business data obtained from the business system to the data chain local to the node cluster, and generating data evidence of the corresponding business type based on the existing business data of the same business type; broadcasting the data evidence to the management node in the management cluster; wherein the management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each node cluster; receiving the guard block broadcasted by the management cluster, and synchronizing it to the second guard chain local to the node cluster.

[0007] In order to solve the above-mentioned technical problems, the third aspect of the present application provides a business data processing device, including: an evidence receiving module and an up-chain and down-chain module; the evidence receiving module is used to receive the data evidence broadcasted by each business node in different node clusters; wherein the business node generates a data block based on the business data obtained from the business system, and links the data block to the local data chain of the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type; the up-chain and down-chain module is used to link the guard block generated based on the data evidence to the first guard chain, and send the guard block to each node cluster to synchronize it to the second guard chain local to each node cluster.

[0008] In order to solve the above-mentioned technical problems, the fourth aspect of the present application provides a business data processing device, including: an on-chain generation module, an evidence broadcast module and a receiving synchronization module. The on-chain generation module is used to link the data block generated by the business data obtained from the business system to the local data chain of the node cluster, and generate data evidence of the corresponding business type based on the existing business data of the same business type; the evidence broadcast module is used to broadcast the data evidence to the management node in the management cluster; wherein the management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each node cluster; the receiving synchronization module is used to receive the guard block broadcasted by the management cluster, and synchronize it to the second guard chain local to the node cluster.

[0009] In order to solve the above-mentioned technical problems, the fifth aspect of the present application provides a node device, including a communication circuit, a memory and a processor, the communication circuit and the memory are respectively coupled to the processor, the memory stores program instructions, and the processor is used to execute the program instructions to implement the business data processing method of the first aspect or the second aspect.

[0010] In order to solve the above-mentioned technical problems, the sixth aspect of the present application provides a business data processing system, including a management cluster and several node clusters communicatively connected to the management cluster; wherein, the management nodes in the management cluster are used to execute the business data processing method of the above-mentioned first aspect, and the business nodes in the node cluster are used to execute the business data processing method of the above-mentioned second aspect.

[0011] In order to solve the above technical problems, the seventh aspect of the present application provides a computer-readable storage medium, which stores program instructions that can be executed by a processor, and the program instructions are used to implement the business data processing method of the first aspect or the second aspect.

[0012] The above scheme receives the data evidence broadcasted by each business node in different node clusters, and the business node generates data blocks based on the business data obtained from the business system, and links the data blocks to the local data chain of the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type. On this basis, the guard block generated based on the data evidence is linked to the first guard chain, and the guard block is sent to each node cluster to be synchronized to the second guard chain of each node cluster. On the one hand, since different node clusters maintain their own data chains locally, they can achieve parallel chaining of business data, which helps to improve chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve chaining efficiency and data security while minimizing resource waste and duplication. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] Figure 1 It is a flowchart of an embodiment of a business data processing method of the present application;

[0014] Figure 2 is a schematic diagram of an embodiment of an MMR tree generation process;

[0015] Figure 3 It is a flowchart of another embodiment of the business data processing method of the present application;

[0016] Figure 4 It is a schematic diagram of the framework of an embodiment of a business data processing device of the present application;

[0017] Figure 5 It is a schematic diagram of the framework of another embodiment of the business data processing device of the present application;

[0018] Figure 6 It is a schematic diagram of the framework of an embodiment of a node device of the present application;

[0019] Figure 7 It is a schematic diagram of the framework of an embodiment of the business data processing system of the present application;

[0020] Figure 8 It is a schematic diagram of a framework of an embodiment of a computer-readable storage medium of the present application. DETAILED DESCRIPTION

[0021] The scheme of the embodiment of the present application is described in detail below in conjunction with the drawings of the specification.

[0022] In the following description, for the purpose of explanation rather than limitation, specific details such as specific system structures, interfaces, and technologies are provided to facilitate a thorough understanding of the present application.

[0023] The terms "system" and "network" are often used interchangeably in this article. The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship. In addition, "many" in this article means two or more than two.

[0024] See also Figure 1 , Figure 1 1 is a flow chart of an embodiment of the business data processing method of the present application. It should be noted that the embodiment of the present disclosure can be executed by a management node in a management cluster. In addition, the business data processing system may include a node cluster and a management cluster. For details, please refer to the following business data processing system embodiment, which will not be repeated here. Specifically, the embodiment of the present disclosure may include the following steps:

[0025] Step S11: Receive data evidence broadcasted by each business node in different node clusters.

[0026] In the disclosed embodiments, the business node generates a data block based on the business data obtained from the business system, and links the data block to the local data chain of the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type. It should be noted that the relevant descriptions such as "business node", "management node", "local node" in the disclosed embodiments of this application all represent node devices, that is, physical devices, rather than virtual concepts. In addition, the "data chain", "first guard chain" and "second guard chain" in the disclosed embodiments of this application are essentially blockchains, and the main difference lies in the different functions, such as the "data chain" is mainly used for decentralized storage of business-related data, while the "first guard chain" and "second guard chain" are mainly used for decentralized storage of evidence-related data. For details, please refer to the following relevant descriptions, which will not be repeated here.

[0027] In an implementation scenario, a business data processing system can be provided with multiple node clusters as needed, and each node cluster can be managed by a management cluster. For example, taking the government affairs scenario as an example, a similar institution in a province (such as institutions responsible for Category A affairs) can form a node cluster, and each business node in the node cluster corresponds to each institution of this category. Another similar institution in the province (such as institutions responsible for Category B affairs) can form a node cluster, and each business node in the node cluster corresponds to each institution of this category. The provincial-level institutions in the province can form a management cluster, and so on. Examples are not given one by one here. Or, taking the business scenario as an example, each business entity in charge of a certain type of affairs under a business group (such as suppliers of raw materials) can form a node cluster, then Each business node in the node cluster corresponds to each business entity responsible for this type of affairs. Each business entity under the business group that is responsible for another type of affairs (such as a manufacturer responsible for processing) can form a node cluster. Each business node in the node cluster corresponds to each business entity responsible for this type of affairs. Each business entity under the business group that is responsible for one type of affairs (such as a distributor responsible for channels) can form a node cluster. Each business node in the node cluster corresponds to each business entity responsible for this type of affairs. The functional departments of the business group (such as the secretariat, etc.) can form a management cluster, and so on. Examples are not given one by one here. Of course, the above are just a few possible examples of node clusters and management clusters in government and business scenarios. Other scenarios can be deduced by analogy, and examples are not given one by one here.

[0028] In an implementation scenario, each node cluster can be connected to at least one business, such as only one business, or multiple different businesses. For example, taking a business scenario as an example, the node cluster formed by various suppliers responsible for raw materials can be connected to include but not limited to: raw material bidding business, raw material sales business, etc.; or, taking a government scenario as an example, the node cluster formed by various agencies responsible for environmental protection can be connected to include but not limited to: environmental impact assessment bidding business, emission review business, etc. Of course, the above are just a few possible examples of node cluster business connection in government and business scenarios, and other scenarios can be inferred by analogy, so I will not give examples one by one here.

[0029] In one implementation scenario, based on the topic subscription method, the business nodes in the node cluster can subscribe to the corresponding business data to obtain business data from the business system. Still taking the business scenario as an example, as mentioned above, the node cluster formed by various suppliers responsible for raw materials can be connected to include but not limited to: raw material bidding business, raw material sales business, etc., then a certain business node in the node cluster can subscribe to business data related to the raw material bidding business, another business node can subscribe to business data related to the raw material sales business, and another business node can subscribe to business data related to the raw material bidding business and business data related to the raw material sales business at the same time. In government affairs and other scenarios, this can be deduced by analogy, and examples will not be given one by one here.

[0030] In an implementation scenario, for each business node, after obtaining business data from the business system, the business node can generate data blocks according to the chronological order, and link them to the local data chain of the node cluster where the business node is located in sequence. That is to say, on the one hand, each node cluster can achieve parallel chaining based on its own local data chain, and on the other hand, for each node cluster, its local data chain can store the data related to the subscribed business. It should be noted that the generation process of data blocks can refer to the relevant description of block generation in the blockchain, which will not be repeated here.

[0031] In an implementation scenario, for each business node, data evidence of the corresponding business type can be generated based on the existing business data of the same business type. Exemplarily, the business node can periodically generate an MMR (Merkle Mountain Range) tree of the corresponding business type based on the business data of different business types it receives, and use the root nodes of the MMR trees of different business types as data evidence of different business types. Of course, the above-mentioned implementation method of generating data evidence with the MMR tree is only a possible example in the actual application process, and is not limited to using other methods to generate data evidence, and will not be given one by one here.

[0032] In a specific implementation scenario, taking four types of services including a, b, c, and d as an example, for each service node, an MMR tree corresponding to the a-type service can be generated according to the acquired a-type service data, an MMR tree corresponding to the b-type service can be generated according to the acquired b-type service data, an MMR tree corresponding to the c-type service can be generated according to the acquired c-type service data, and an MMR tree corresponding to the d-type service can be generated according to the acquired d-type service data. Other situations can be deduced by analogy, and no examples are given here one by one.

[0033] In a specific implementation scenario, take the use of MMR tree to generate data evidence as an example. Figure 2 , Figure 2 FIG. 1 is a schematic diagram of an embodiment of an MMR tree generation process. Figure 2 As shown, taking business type a as an example, the hash value of each business data of business type a can be calculated. For example, the hash value of business data a1 can be recorded as H(a1), that is, hash(a1), and the calculated hash value is used as the leaf node of the MMR tree and added to the bottom of the MMR tree, that is, each leaf node corresponds to the hash value of a business data. When a new leaf node is inserted, if there is no subtree of the same height, you only need to superimpose the root node of the new leaf node (or new subtree) and the previous MMR tree to obtain the root node of the new MMR tree; or, if there are subtrees of the same height, you can first merge the subtrees of the same height, and then recalculate the root node of the new MMR tree based on the merged MMR tree. For example, after obtaining the business data a3, the MMR tree generated in the previous step (such as Figure 2 ) and the root node root1 = H(H(a1), H(a2)) (as shown in the leftmost MMR tree) Figure 2 ), generate a new MMR tree (as shown in the leftmost MMR tree in Figure 2 Afterwards, when the service data a4 is obtained, a new MMR tree and root node root3 = H(H(H(a1), H(a2)), H(H(a3), H(a4))) can be generated based on the MMR tree and root node root2 generated in the previous step, as shown in the middle MMR tree) and root node root2 = H(H(H(a1), H(a2)), H(a3), H(a4))), as shown in the figure. Figure 2 As shown in the MMR tree on the far right. That is to say, for each business node, as the acquired business data continues to increase, the MMR tree and the root node will also be continuously updated. It can be seen that when appending new business data, it is only necessary to update the root node of the MMR tree, and there is no need to recalculate and update the intermediate nodes of the entire tree. The data is always appended, which can be better compatible with the expanded node cluster and the first guard chain maintained by the management cluster, and is more in line with the multi-level data scenario. Of course, Figure 2 The above example is only a possible example in practical application and does not limit other possible situations.

[0034] Step S12: Link the guard block generated based on data notarization to the first guard chain, and send the guard block to each node cluster to synchronize it to the second guard chain local to each node cluster.

[0035] In one implementation scenario, after receiving the data evidence broadcasted by the business nodes in each node cluster, the management node in the management cluster can collect and generate the guard block. After the guard block is generated, it can be linked to the first guard chain. It should be noted that, as mentioned above, the guard chain is essentially a blockchain, so the generation process of the guard block can also refer to the technical details of the blockchain, which will not be repeated here.

[0036] In an implementation scenario, after generating the guard block, the management node in the management cluster can further send the generated guard block to each node cluster, so that the node cluster can synchronize the received guard block to the local second guard chain. It should be noted that the second guard chain is different from the first guard chain. The second guard chain is maintained locally by the node cluster, while the first guard chain is maintained by the management cluster. In addition, for each node cluster, its local data chain and the second guard chain are logically linked to each other to form a directed acyclic structure, which can reduce the coupling of each business, that is, compared with the serial execution of business data according to a single chain structure, each business data in the embodiment of the present application is executed concurrently, while ensuring that the data cannot be tampered with as much as possible, and improving the parallel processing capability of multiple businesses. At the same time, the node clusters built by each user can dynamically adjust the performance according to the amount of subscribed business data to meet the needs of dynamic expansion.

[0037] In one implementation scenario, in order to further achieve horizontal expansion, in response to receiving an expansion request for a new cluster, the new cluster can be used as a new node cluster, and the steps of receiving data evidence broadcast by each business node in different node clusters and subsequent steps are performed on the new node cluster and the existing node clusters outside the new node cluster to meet the horizontal expansion requirements, and enable the new node cluster to maintain its data chain and second guard chain locally, and the data evidence formed by the business data obtained by the new node cluster can also be linked to the first guard chain after the corresponding guard block is generated.

[0038] In a specific implementation scenario, the newly created cluster may be newly created based on a completely newly added service node.

[0039] In another specific implementation scenario, the newly created cluster may also be newly created based on a service node separated from at least one node cluster.

[0040] In yet another specific implementation scenario, the newly created cluster may also be newly created based on completely newly added service nodes and service nodes separated from at least one node cluster.

[0041] It should be noted that the above examples are only several possible implementation methods of the new cluster. In the actual application process, you can choose according to actual needs, and there is no limitation here. For example, taking the business scenario as an example, for a node cluster formed by a manufacturer responsible for processing under a certain business group, because some manufacturers responsible for processing adjust their business and are responsible for raw material warehousing and transportation, the business nodes corresponding to these manufacturers can be separated from the node cluster, and together with the business nodes corresponding to the newly added business entity responsible for raw material warehousing and transportation under the business group, a new cluster is formed. Of course, the above example is only a possible example in the actual application process, and other possible situations are not limited thereto.

[0042] In one implementation scenario, in order to achieve business data sharing, a data request sent by a requesting node can also be received, and the requesting node is any business node. The data request can be sent because the target data cannot be obtained on the local data chain of the node cluster where the requesting node is located, and then the data request is forwarded to the candidate cluster, and the candidate cluster is each node cluster other than the node cluster where the business node sending the data request is located, so that the target data sent by the target cluster and its existence proof can be received, and the target cluster is any candidate cluster, and the target data is stored on the local data chain, and then the target data and its existence proof can be forwarded to the requesting node. The requesting node then verifies the authenticity of the target data based on the existence proof, and links the data block generated based on the target data to the local data chain of the node cluster where the requesting node is located, so as to achieve business data sharing between the requesting node and the requested node.

[0043] In a specific implementation scenario, different from the aforementioned application scenario of business data sharing, if the target data (corresponding data block) exists on the data chain of the node cluster where the requesting node is located, the requesting node can directly obtain the target data from the local data chain of the node cluster, that is, there is no need to forward it by the management cluster.

[0044] In a specific implementation scenario, as mentioned above, as a possible example, the data proof can be the root node of the MMR tree, and the business node can construct the MMR tree of the corresponding business type based on the existing business data of the same business type. The hash value of the business data is the leaf node of the MMR tree, and the existence proof can include: the root node of the MMR corresponding to the target data and the sibling nodes of each node on the path from the hash value of the target data to the root node. Please refer to Figure 2 , taking the target data as business data a2 as an example, business data a2 corresponds to the latest MMR tree (i.e. Figure 2 On the rightmost MMR tree), start from the hash value H(a2) of the target data a2 to the root node (i.e. Figure 2The sibling nodes of each node on the path of root3) on the rightmost MMR tree may include H(a1) and H(H(a3), H(a4)), so the existence proof can be recorded as {H(a1), H(H(a3), H(a4)), root3}. Of course, the above example is only one possible situation in the actual application process. In other scenarios, the existence proof can be deduced by analogy, and examples are not given one by one here. In addition, the specific process of business data sharing can be referred to the following public embodiments, which will not be repeated here.

[0045] The above scheme receives the data evidence broadcasted by each business node in different node clusters, and the business node generates data blocks based on the business data obtained from the business system, and links the data blocks to the local data chain of the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type. On this basis, the guard block generated based on the data evidence is linked to the first guard chain, and the guard block is sent to each node cluster to be synchronized to the second guard chain of each node cluster. On the one hand, since different node clusters maintain their own data chains locally, they can achieve parallel chaining of business data, which helps to improve chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve chaining efficiency and data security while minimizing resource waste and duplication.

[0046] See also Figure 3 , Figure 3 1 is a flow chart of another embodiment of the business data processing method. It should be noted that the embodiment of the present disclosure can be executed by a business node in a node cluster. In addition, the business data processing system may include a node cluster and a management cluster. For details, please refer to the following business data processing system embodiment, which will not be repeated here. Specifically, the embodiment of the present disclosure may include the following steps:

[0047] Step S31: Link the data block generated by the business data obtained from the business system to the local data chain of the node cluster, and generate data evidence of the corresponding business type based on the existing business data of the same business type.

[0048] For details, please refer to the relevant description in the aforementioned disclosed embodiments, which will not be repeated here.

[0049] Step S32: Broadcast data evidence to management nodes in the management cluster.

[0050] In the embodiment of the present disclosure, the management node links the guard block generated based on the data notarization to the first guard chain, and sends the guard block to each node cluster. For details, please refer to the relevant description in the aforementioned public embodiment, which will not be repeated here.

[0051] Step S33: Receive the guard block broadcasted by the management cluster and synchronize it to the second guard chain of the local node cluster.

[0052] In one implementation scenario, each node cluster can receive the guard block broadcast by the management cluster and synchronize it to the second guard chain local to the node cluster, so that the second guard chain local to each node cluster can be synchronized with the first guard chain maintained by the management cluster, that is, the second guard chains local to each node cluster are essentially the same.

[0053] In an implementation scenario, as described in the aforementioned disclosed embodiment, in order to achieve horizontal expansion, an expansion request can also be sent to a management node in the management cluster, and the expansion request is sent by the newly created cluster, and the management node responds to the expansion request and uses the newly created cluster as a new node cluster. In addition, the newly created cluster is newly created based on at least one of a completely newly added business node and a business node separated from at least one existing node cluster. It should be noted that the specific process of horizontal expansion can be referred to the relevant description in the aforementioned disclosed embodiment, and will not be repeated here.

[0054] In an implementation scenario, as described in the aforementioned disclosed embodiment, in order to realize business data sharing, for the requesting node of business data, in response to the inability to obtain the target data on the local data chain of the node cluster where the local node is located, a data request can be sent to the management cluster, and the management cluster can forward the data request to the candidate cluster, which is each node cluster other than the node cluster where the business node sending the data request is located. On this basis, the target data of the target cluster forwarded by the management cluster and its existence proof can be received, and the target cluster is any candidate cluster, and the target cluster has the target data stored on the local data chain. Then, when the target data (i.e. the received target data) is verified to be true based on the existence proof, the data block generated based on the target data can be linked to the local data chain of the node cluster where the local node is located, thereby realizing the secure sharing of business data between the requesting node and the requested node.

[0055] In a specific implementation scenario, as described in the aforementioned public embodiments, as a possible example, the data evidence can be the root node of the MMR tree, and the business node can construct the MMR tree of the corresponding business type based on the existing business data of the same business type. The hash value of the business data is the leaf node of the MMR tree, and the existence proof includes: the root node of the MMR corresponding to the target data and the sibling nodes of each node on the path from the hash value of the target data to the root node. For details, please refer to the relevant description in the aforementioned public embodiments, which will not be repeated here.

[0056] In a specific implementation scenario, when the root node of the MMR tree is used as data evidence and the existence proof includes the above content, after receiving the target data forwarded by the management cluster, the requesting node can calculate based on the received target data to obtain a first hash value, and then infer the root node of the MMR tree based on the first hash value and the hash value represented by the brother node in the existence proof to obtain a second hash value, so that the target data can be verified to be authentic based on the comparison result between the second hash value and the hash value represented by the root node in the existence proof. Please refer to Figure 2 , taking the request business data a2 as an example, as described in the above-mentioned public embodiment, the existence proof can be recorded as {H(a1), H(H(a3), H(a4)), root3}, so after the requesting node receives the target data (recorded as a2'), it can be calculated based on it to obtain the first hash value H(a2'), and then the root node root3' is inferred based on the first hash value H(a2') and the hash values ​​H(a1), H(H(a3), H(a4)) represented by the brother nodes in the existence proof to obtain the second hash value:

[0057] root3'=H(H(H(a1), H(a2')), H(H(a3), H(a4)))......(1)

[0058] On this basis, it is possible to determine whether the received target data is verified to be authentic based on the comparison result between the second hash value root3' and the hash value root3 represented by the root node in the proof of existence. For example, if the second hash value is the same as the hash value represented by the root node in the proof of existence, it can be confirmed that the received target data is verified to be authentic; otherwise, it can be confirmed that the received target data is verified to be false. In addition, in the actual application process, in order to further ensure the secure sharing of business data, considering that the second guard chains local to each node cluster are essentially the same, the second guard chain can be used to first verify whether the proof of existence is authentic. Specifically, after receiving the proof of existence, the proof of existence can be matched with the second guard chain local to the node cluster where the requesting node is located. If a match is found, the proof of existence can be confirmed to be authentic, and then the received target data can be verified to be authentic; otherwise, it can be confirmed that the proof of existence is false. In this case, there is no need to verify whether the received target data is authentic. Please continue to refer to Figure 2 , still taking the request for business data a2 as an example, if the received proof of existence is {H(a1), H(H(a3), H(a4)), root3}, and according to the local second guard chain of the node cluster where the requesting node is located, the proof of existence can indeed match, so it can be confirmed that the proof of existence is verified to be true. On the contrary, if the received proof of existence is {H(a0), H(H(a3), H(a4)), root3}, since it cannot match the local second guard chain of the node cluster where the requesting node is located, it can be confirmed that the proof of existence is verified to be false. Of course, the above example is only a possible example in the actual application process, and does not limit other possible situations.

[0059] In an implementation scenario, as described in the aforementioned disclosed embodiment, in order to realize business data sharing, for the requested node of business data, a data request forwarded by the management cluster from the requesting node can be received, and the requesting node can be any business node, and the data request can be sent because the target data cannot be obtained on the local data chain of the node cluster where the requesting node is located, and then in response to the target data being stored on the local data chain of the node cluster where the local node (i.e., the requested node) is located, the target data and its existence proof are obtained, and then the target data and its existence proof are sent to the management cluster, and the management cluster forwards the target data and its existence proof to the requesting node, so that when the target data is verified to be authentic based on the existence proof, the data block generated based on the target data is linked to the local data chain of the node cluster where the requesting node is located. The specific process can be referred to the aforementioned related description, which will not be repeated here.

[0060] The above scheme links the data block generated by the business data obtained from the business system to the data chain local to the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type, and broadcasts the data evidence to the management node in the management cluster. The management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each node cluster, and then receives the guard block broadcast by the management cluster and synchronizes it to the second guard chain local to the node cluster. On the one hand, since different node clusters maintain their own data chains locally, they can achieve parallel chaining of business data, which helps to improve chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve chaining efficiency and data security while minimizing resource waste and duplication.

[0061] See also Figure 4 , Figure 4 It is a schematic diagram of the framework of an embodiment of a business data processing device 40 of the present application. The business data processing device 40 includes: an evidence receiving module 41 and an up-chain sending module 42; the evidence receiving module 41 is used to receive the data evidence broadcasted by each business node in different node clusters; wherein the business node generates a data block based on the business data obtained from the business system, and links the data block to the local data chain of the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type; the up-chain sending module 42 is used to link the guard block generated based on the data evidence to the first guard chain, and send the guard block to each node cluster to synchronize it to the local second guard chain of each node cluster.

[0062] In the above scheme, the business data processing device 40 receives the data evidence broadcasted by each business node in different node clusters, and the business node generates a data block based on the business data obtained from the business system, and links the data block to the local data chain of the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type. On this basis, the guard block generated based on the data evidence is linked to the first guard chain, and the guard block is sent to each node cluster to be synchronized to the local second guard chain of each node cluster. On the one hand, since different node clusters maintain their own data chains locally, they can achieve parallel chaining of business data, which helps to improve chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve chaining efficiency and data security while minimizing resource waste and duplication.

[0063] In some disclosed embodiments, the business data processing device 40 includes a cluster expansion module, which is used to respond to receiving an expansion request for a new cluster, treat the new cluster as a new node cluster, and perform data notarization for the new node cluster and existing node clusters outside the new node cluster, respectively receiving data broadcast by each business node in different node clusters.

[0064] In some disclosed embodiments, the newly created cluster is newly created based on at least one of a completely newly added service node and a service node separated from at least one node cluster.

[0065] In some public embodiments, the business data processing device 40 includes a request receiving module for receiving a data request sent by a requesting node; wherein the requesting node is any business node, and the data request is sent by the requesting node because the target data cannot be obtained on the local data link of the node cluster where it is located; the business data processing device 40 includes a request forwarding module for forwarding the data request to a candidate cluster; wherein the candidate cluster is each node cluster other than the node cluster where the business node sending the data request is located; the business data processing device 40 includes a data receiving module for receiving the target data and its existence proof sent by the target cluster; wherein the target cluster is any candidate cluster, and the target data is stored on the local data link; the business data processing device 40 includes a data forwarding module for forwarding the target data and its existence proof to the requesting node; wherein, when the requesting node verifies the authenticity of the target data based on the existence proof, it links the data block generated based on the target data to the local data link of the node cluster where it is located.

[0066] In some public embodiments, data is stored as the root node of the MMR tree. The business node constructs the MMR tree of the corresponding business type based on the existing business data of the same business type. The hash value of the business data is the leaf node of the MMR tree, and the existence proof includes: the root node of the MMR corresponding to the target data and the sibling nodes of each node on the path from the hash value of the target data to the root node.

[0067] See also Figure 5 , Figure 5 It is a schematic diagram of the framework of an embodiment of a business data processing device 50 of the present application. The business data processing device 50 includes: an on-chain generation module 51, an evidence broadcast module 52 and a receiving synchronization module 53. The on-chain generation module 51 is used to link the data block generated by the business data obtained from the business system to the local data chain of the node cluster, and generate data evidence of the corresponding business type based on the existing business data of the same business type; the evidence broadcast module 52 is used to broadcast the data evidence to the management node in the management cluster; wherein the management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each node cluster; the receiving synchronization module 53 is used to receive the guard block broadcasted by the management cluster, and synchronize it to the local second guard chain of the node cluster.

[0068] In the above scheme, the business data processing device 50 links the data block generated by the business data obtained from the business system to the data chain local to the node cluster, and generates data evidence of the corresponding business type based on the existing business data of the same business type, and broadcasts the data evidence to the management node in the management cluster, and the management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each node cluster, and then receives the guard block broadcast by the management cluster, and synchronizes it to the second guard chain local to the node cluster. On the one hand, since different node clusters maintain their own data chains locally, they can achieve parallel chaining of business data, which helps to improve chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve chaining efficiency and data security while minimizing resource waste and duplication.

[0069] In some disclosed embodiments, the business data processing device 50 includes a cluster expansion module for sending an expansion request to a management node in a management cluster; wherein the expansion request is sent by a newly created cluster, and the management node uses the newly created cluster as a new node cluster in response to the expansion request.

[0070] In some disclosed embodiments, the newly created cluster is newly created based on at least one of a completely newly added service node and a service node separated from at least one existing node cluster.

[0071] In some disclosed embodiments, the business data processing device 50 includes a request sending module for sending a data request to a management cluster in response to a local node being unable to obtain target data on a data link local to the node cluster where it is located; wherein the management cluster forwards the data request to a candidate cluster, and the candidate cluster is each node cluster other than the node cluster where the business node sending the data request is located; the business data processing device 50 includes a data receiving module for receiving target data and a proof of existence thereof forwarded by the management cluster from a target cluster; wherein the target cluster is any candidate cluster, and the target data is stored on a data link local to the target cluster; the business data processing device 50 includes a data verification module for linking a data block generated based on the target data to a data link local to the node cluster where the local node is located, when the authenticity of the target data is verified based on the proof of existence.

[0072] In some disclosed embodiments, data is stored as the root node of an MMR tree, and a business node constructs an MMR tree of a corresponding business type based on existing business data of the same business type. The hash value of the business data is a leaf node of the MMR tree, and the existence proof includes: the root node of the MMR corresponding to the target data and the sibling nodes of each node on the path from the hash value of the target data to the root node. The data verification module includes a first calculation submodule, which is used to perform calculations based on the received target data to obtain a first hash value; the data verification module includes a second calculation submodule, which is used to infer the root node of the MMR tree based on the first hash value and the hash value represented by the sibling node in the existence proof to obtain a second hash value; the data verification module includes a true verification submodule, which is used to determine whether the target data is verified to be true based on the comparison result between the second hash value and the hash value represented by the root node in the existence proof.

[0073] In some disclosed embodiments, the business data processing device 50 includes a request receiving module for receiving a data request forwarded from a requesting node by a management cluster; wherein the requesting node is any business node, and the data request is sent by the requesting node because it cannot obtain the target data on the local data link of the node cluster where it is located; the business data processing device 50 includes a data acquisition module for obtaining the target data and its existence proof in response to the target data being stored on the local data link of the node cluster where the local node is located; the business data processing device 50 includes a data sending module for sending the target data and its existence proof to the management cluster; wherein the management cluster forwards the target data and its existence proof to the requesting node, so that when the authenticity of the target data is verified based on the existence proof, the data block generated based on the target data is linked to the local data link of the node cluster where the requesting node is located.

[0074] See also Figure 6 , Figure 6 It is a schematic diagram of the framework of an embodiment of a node device 60 of the present application. The node device 60 includes a communication circuit 61, a memory 62 and a processor 63. The communication circuit 61 and the memory 62 are respectively coupled to the processor 63. The memory 62 stores program instructions. The processor 63 is used to execute the program instructions to implement the steps in any of the above-mentioned business data processing method embodiments. Specifically, the node device 60 may include but is not limited to a server, etc., which is not limited here. In addition, the node device 60 can be a business node or a management node. The specific meaning can be found in the relevant description in the aforementioned public implementation, or in the relevant description in the following public embodiment.

[0075] Specifically, the processor 63 is used to control itself and the communication circuit 61 and the memory 62 to implement the steps in any of the above-mentioned business data processing method embodiments. The processor 63 may also be referred to as a CPU (Central Processing Unit). The processor 63 may be an integrated circuit chip having the ability to process signals. The processor 63 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. In addition, the processor 63 may be implemented by an integrated circuit chip.

[0076] In the above scheme, the node device 60 implements any of the above business data processing method embodiments. On the one hand, since different node clusters maintain their own data chains locally, they can realize parallel chaining of business data, which helps to improve the chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the second guard chain of each node cluster, that is, the second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage the evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve the chaining efficiency and data security under the premise of minimizing resource waste and duplication.

[0077] See also Figure 7 , Figure 7 1 is a schematic diagram of a framework of an embodiment of a business data processing system 70 of the present application. The business data processing system 70 includes a management cluster 71 and a plurality of node clusters 72 in communication connection with the management cluster 71. The management node 711 in the management cluster 71 is used to implement the embodiment of the business data processing method of the first aspect, and the business node 721 in the node cluster 72 is used to implement the embodiment of the business data processing method of the second aspect. For details, please refer to the aforementioned disclosed embodiments, which will not be repeated here.

[0078] In the above scheme, the business data processing system 70 includes a management cluster 71 and several node clusters 72 that are connected to the management cluster 71 in communication. The management node 711 in the management cluster 71 is used to implement the first aspect of the business data processing method embodiment, and the business node 721 in the node cluster 72 is used to implement the second aspect of the business data processing method embodiment. On the one hand, since different node clusters maintain their own data chains locally, the business data can be uploaded to the chain in parallel, which helps to improve the efficiency of the chain. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, the guard blocks generated by the data evidence of each business node in different node clusters are all uploaded to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the local second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage the evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve the efficiency of the chain and data security under the premise of minimizing resource waste and duplication.

[0079] See also Figure 8 , Figure 8 The figure is a schematic diagram of a framework of an embodiment of a computer-readable storage medium 80 of the present application. The computer-readable storage medium 80 stores program instructions 81 that can be executed by a processor, and the program instructions 81 are used to implement the steps in any of the above business data processing embodiments.

[0080] In the above scheme, the computer-readable storage medium 80 implements any of the above business data processing method embodiments. On the one hand, since different node clusters maintain their own data chains locally, they can realize parallel chaining of business data, which helps to improve the chaining efficiency. On the other hand, since the same node cluster only maintains the local blockchain and does not repeatedly build nodes, it can minimize resource waste and duplication. On the other hand, since the guard blocks generated by the data evidence of each business node in different node clusters are all chained to the first guard chain, and the guard blocks are sent to each node cluster to be synchronized to the local second guard chain of each node cluster, that is, the local second guard chain of each node cluster is synchronized with the first guard chain, and then each node cluster can manage the evidence based on the local second guard chain, which helps to improve data security. Therefore, it is possible to improve the chaining efficiency and data security under the premise of minimizing resource waste and duplication.

[0081] In some embodiments, the functions or modules included in the device provided by the embodiments of the present disclosure can be used to execute the method described in the above method embodiments. The specific implementation can refer to the description of the above method embodiments, and for the sake of brevity, it will not be repeated here.

[0082] The above description of various embodiments tends to emphasize the differences between the various embodiments. The same or similar aspects can be referenced to each other, and for the sake of brevity, they will not be repeated herein.

[0083] In the several embodiments provided in the present application, it should be understood that the disclosed methods and devices can be implemented in other ways. For example, the device implementation described above is only schematic. For example, the division of modules or units is only a logical function division. There may be other division methods in actual implementation, 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, and the indirect coupling or communication connection of devices or units can be electrical, mechanical or other forms.

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

[0085] In addition, each functional unit in each embodiment 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-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0086] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) or a processor (processor) to perform all or part of the steps of each implementation method of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program code.

[0087] If the technical solution of this application involves personal information, the product using the technical solution of this application has clearly informed the personal information processing rules and obtained the individual's voluntary consent before processing the personal information. If the technical solution of this application involves sensitive personal information, the product using the technical solution of this application has obtained the individual's separate consent before processing the sensitive personal information, and at the same time meets the "explicit consent" requirement. For example, on personal information collection devices such as cameras, clear and prominent signs are set to inform that the personal information collection scope has been entered and personal information will be collected. If the individual voluntarily enters the collection scope, it is deemed that he or she agrees to the collection of his or her personal information; or on the device that processes personal information, the personal information processing rules are notified by obvious signs / information, and the individual's authorization is obtained through pop-up information or by asking the individual to upload his or her personal information; among them, the personal information processing rules may include information such as the personal information processor, the purpose of personal information processing, the processing method, and the type of personal information processed.

Claims

1. A business data processing method, characterized in that: include: Receive data evidence broadcasted by each business node in different node clusters; wherein the business node generates a data block based on the business data obtained from the business system, and links the data block to the local data chain of the node cluster, and generates data evidence corresponding to the business type based on the existing business data of the same business type; The guard block generated based on the data notarization is linked to the first guard chain, and the guard block is sent down to each of the node clusters to be synchronized to the second guard chain local to each of the node clusters.

2. The method according to claim 1, characterized in that The method further comprises: In response to receiving an expansion request for a newly created cluster, the newly created cluster is used as a new node cluster, and the data notarization received from each business node in different node clusters is performed on the new node cluster and existing node clusters outside the new node cluster.

3. The method according to claim 2, characterized in that The newly created cluster is newly created based on at least one of a completely newly added service node and a service node separated from at least one of the node clusters.

4. The method according to claim 1, characterized in that The method further comprises: Receiving a data request sent by a requesting node; wherein the requesting node is any of the service nodes, and the data request is sent by the requesting node because the requesting node cannot obtain the target data on the local data link of the node cluster; Forwarding the data request to a candidate cluster; wherein the candidate cluster is each of the node clusters other than the node cluster where the service node sending the data request is located; Receive target data and proof of existence sent by a target cluster; wherein the target cluster is any of the candidate clusters, and the target data is stored in a local data link; Forward the target data and its existence proof to the requesting node; wherein, when the requesting node verifies the authenticity of the target data based on the existence proof, the data block generated based on the target data is linked to the data chain local to the node cluster.

5. The method according to claim 4, characterized in that The data evidence is the root node of the MMR tree, and the business node constructs an MMR tree corresponding to the business type based on the existing business data of the same business type. The hash value of the business data is the leaf node of the MMR tree, and the existence proof includes: the target data corresponds to the root node of the MMR and the sibling nodes of each node on the path from the hash value of the target data to the root node.

6. A business data processing method, characterized in that: include: Link the data blocks generated by the business data obtained from the business system to the local data chain of the node cluster, and generate data evidence corresponding to the business type based on the existing business data of the same business type; Broadcasting the data evidence to the management nodes in the management cluster; wherein the management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each of the node clusters; Receive the guard block broadcasted by the management cluster and synchronize it to the second guard chain local to the node cluster.

7. The method according to claim 6, characterized in that The method further comprises: Sending an expansion request to the management node in the management cluster; wherein the expansion request is sent by the newly created cluster, and the management node uses the newly created cluster as a new node cluster in response to the expansion request.

8. The method according to claim 7, characterized in that The newly created cluster is newly created based on at least one of a completely newly added service node and a service node separated from at least one existing node cluster.

9. The method according to claim 6, characterized in that The method further comprises: In response to the local node being unable to obtain target data on the local data link of the node cluster, sending a data request to the management cluster; wherein the management cluster forwards the data request to a candidate cluster, and the candidate cluster is each of the node clusters other than the node cluster where the service node sending the data request is located; Receiving target data and proof of existence forwarded by the management cluster from a target cluster; wherein the target cluster is any of the candidate clusters, and the target data is stored in a local data link of the target cluster; When the target data is verified to be authentic based on the existence proof, the data block generated based on the target data is linked to the data chain of the node cluster where the local node is located.

10. The method according to claim 9, characterized in that The data evidence is the root node of the MMR tree, the business node constructs an MMR tree corresponding to the business type based on the existing business data of the same business type, the hash value of the business data is the leaf node of the MMR tree, and the existence proof includes: the target data corresponds to the root node of the MMR and the sibling nodes of each node on the path from the hash value of the target data to the root node, and the verification steps of the target data include: Perform calculation based on the received target data to obtain a first hash value; Inferring the root node of the MMR tree based on the first hash value and the hash value represented by the brother node in the existence proof to obtain a second hash value; Based on a comparison result between the second hash value and the hash value represented by the root node in the existence proof, it is determined whether the target data is verified to be authentic.

11. The method according to claim 6, characterized in that The method further comprises: Receiving a data request forwarded by the management cluster from a requesting node; wherein the requesting node is a service node in any of the node clusters, and the data request is sent by the requesting node because the requesting node cannot obtain target data on a local data link of the node cluster; In response to the target data being stored in a data chain local to the node cluster where the local node is located, acquiring the target data and proof of its existence; Send the target data and its existence proof to the management cluster; wherein the management cluster forwards the target data and its existence proof to the requesting node, so as to verify the authenticity of the target data based on the existence proof and link the data block generated based on the target data to the data chain local to the node cluster where the requesting node is located.

12. A business data processing device, characterized in that: include: The evidence receiving module is used to receive the data evidence broadcasted by each business node in different node clusters; wherein the business node generates a data block based on the business data obtained from the business system, and links the data block to the local data chain of the node cluster, and generates data evidence corresponding to the business type based on the existing business data of the same business type; The up-chain and down-chain module is used to link the guard block generated based on the data storage to the first guard chain, and to send the guard block to each of the node clusters to synchronize it to the second guard chain local to each of the node clusters.

13. A business data processing device, characterized in that: include: The on-chain generation module is used to link the data blocks generated by the business data obtained from the business system to the local data chain of the node cluster, and generate data evidence corresponding to the business type based on the existing business data of the same business type; The evidence broadcast module is used to broadcast the data evidence to the management nodes in the management cluster; wherein the management node links the guard block generated based on the data evidence to the first guard chain, and sends the guard block to each of the node clusters; The receiving synchronization module is used to receive the guardian block broadcasted by the management cluster and synchronize it to the second guardian chain local to the node cluster.

14. A node device, characterized in that: It includes a communication circuit, a memory and a processor, wherein the communication circuit and the memory are respectively coupled to the processor, the memory stores program instructions, and the processor is used to execute the program instructions to implement the business data processing method described in any one of claims 1 to 11.

15. A business data processing system, characterized in that: It includes a management cluster and several node clusters that are communicatively connected to the management cluster; The management node in the management cluster is used to execute the business data processing method described in any one of claims 1 to 5, and the business node in the node cluster is used to execute the business data processing method described in any one of claims 6 to 11.

16. A computer-readable storage medium, characterized in that: Program instructions that can be executed by a processor are stored, and the program instructions are used to implement the business data processing method described in any one of claims 1 to 11.