Hierarchical chain-based data processing method, apparatus, device, and medium

Abstract

Disclosed in embodiments of the present application are a hierarchical chain-based data processing method, an apparatus, a device, and a medium, applicable to the technical field of blockchains. The method comprises: when obtaining a pending block comprising N services, calling a service summary process to execute each service in the pending block, to obtain an execution result and a service execution proof of each service; calling the service summary process to perform optimization processing on a block execution result, to obtain a block optimization result and an optimization proof; on the basis of the block optimization result, a result hash of the block execution result, a service hash of the N services, the service execution proof, the optimization proof, and a block header of the pending block, obtaining a return service; and returning the return service to a local consensus node. By using the embodiments of the present application, privacy and security of sensitive data in each service can be improved.

Description

Data processing method, device, equipment and medium based on layered chain

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on April 21, 2023, with application number 2023104587038 and application name “Data processing method, device, equipment and medium based on layered chain”, all contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of blockchain technology, and in particular to a data processing method, device, equipment and medium based on a layered chain. Background Art

[0003] In a two-layer chain network consisting of a business layer and a consensus layer (also known as a blockchain network layered structure), a local consensus network for handling local business can be deployed in the business layer, and a global consensus network for handling global business can be deployed in the consensus layer. Currently, when business nodes deployed in the business layer send business (i.e., business) associated with the local business to local consensus nodes in the local consensus network, they send the business in plaintext. This allows the local consensus nodes to receive the plaintext data of the business, allowing them to subsequently package the plaintext data of the business into blocks, thereby writing the blocks packaged with the plaintext data to the blockchain maintained by the local consensus network. The blockchain deployed in the business layer is a local consensus subchain. In addition, when local consensus nodes are used to handle local business, in order to reduce the processing pressure on the global consensus nodes in the global consensus network to handle global business, they do not forward the plaintext business data related to the local business to the global consensus nodes. Instead, they aggregate the business data in the blocks packaged with the plaintext data and then upload the resulting aggregated information to the global consensus network.

[0004] However, the inventors have found in practice that for local consensus nodes under the above-mentioned blockchain network hierarchical structure, although the business decoupling between local business processed in the local consensus network and global business processed in the global consensus network can be ensured by data aggregation, for local consensus nodes deployed in the local consensus network, after the block packaged with plaintext data is written to the local consensus sub-chain, the plaintext data written in the block on the local consensus sub-chain will still be synchronized by the business nodes in the same business layer. Then, once the plaintext data in the block written on the local consensus sub-chain is sensitive data, it will lead to the local openness and transparency of the sensitive data on the local consensus sub-chain maintained by the local consensus network. This means that every business node in the same business layer that interacts with the local consensus network will indiscriminately synchronize sensitive data from the local consensus sub-chain. Therefore, how to ensure the privacy and security of sensitive data in the entire local consensus network is a technical problem that needs to be solved urgently.

[0005] Summary of the Invention

[0006] The embodiments of the present application provide a data processing method, apparatus, device and medium based on a layered chain, which can deploy business processing nodes in a layered blockchain network corresponding to the layered blockchain, and can deploy a business aggregation process in the business processing nodes to execute each business carrying sensitive data and optimize the sensitive data carried in the business execution results of each business. This means that the business data carried in the return business submitted by the subsequent business processing node to the local consensus node may include the optimized business execution results, that is, the embodiments of the present application can improve the privacy and security of sensitive data through the return business returned by the business processing node.

[0007] On the one hand, the embodiment of the present application provides a data processing method based on a layered chain.

[0008] The layered chain network corresponding to the layered chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer. The business layer is deployed with local consensus nodes and business processing nodes; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; the method is executed by the business processing node; the method includes:

[0009] When N businesses are aggregated and packaged into a block to be processed, the business aggregation process is called to execute the block to be processed, and the business execution result of each business and the business execution certificate associated with each business are obtained; N is a positive integer; each business refers to a sensitive business carrying sensitive data sent by a business node associated with the local consensus node; the business execution certificate is evidence used to indicate that each business is correctly executed;

[0010] Determining the business execution result of each of the businesses as the block execution result of the block to be processed, calling the business summary process to optimize the block execution result, and obtaining a block optimization result and an optimization certificate associated with the block execution result; the optimization process refers to hiding or obfuscating the sensitive data in the business execution result of each of the businesses; the block optimization result refers to the block execution result after optimization; and the optimization certificate is evidence used to indicate that the block execution result has been optimized;

[0011] Based on the block optimization result, the result hash of the block execution result, the business hash of each business, the business execution proof, the optimization proof, and the block header of the block to be processed, obtaining a return business for transmission back to the local consensus node;

[0012] The return business is transmitted back to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the business summary process, performs business verification on the return business, and obtains a business verification result for returning to the business node; the business verification refers to verifying and confirming that the block optimization result is obtained by correct execution and optimization processing through the circuit proof in the return business; the circuit proof includes the business execution proof and the optimization proof.

[0013] On the one hand, the embodiment of the present application provides a data processing method based on a layered chain.

[0014] The layered chain network corresponding to the layered chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer. The business layer is deployed with local consensus nodes and business processing nodes. The local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network. The local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node. The method is executed by the local consensus nodes, and the method includes:

[0015] Receive the return service sent by the service processing node, the return service is obtained based on the block optimization result, the result hash of the block execution result, the business hash of each of the N businesses contained in the block to be processed, the business execution certificate, the optimization certificate, and the block header of the block to be processed; N is a positive integer; each of the businesses refers to a sensitive business carrying sensitive data sent by the business node associated with the local consensus node; the business execution certificate is evidence used to indicate that each of the businesses is executed correctly; the block execution result is determined based on the business execution result of each business; the business execution result and the business execution certificate of each business are obtained by the business processing node calling the business summary process to execute the block to be processed; the block optimization result and the optimization certificate are obtained by the business processing node calling the business summary process to optimize the block execution result;

[0016] Call the verification processing data corresponding to the business aggregation process, perform business verification on the backhaul business, obtain a business verification result, and return the business verification result to the business node; the business verification refers to verifying and confirming through the circuit proof in the backhaul business that the block optimization result is obtained by correct execution and optimization processing; the circuit proof includes the business execution proof and the optimization proof.

[0017] On the one hand, an embodiment of the present application provides a data processing device based on a hierarchical chain, wherein the hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in a business layer and a global consensus network deployed in a consensus layer, wherein local consensus nodes and business processing nodes are deployed in the business layer; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when determining that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; the device runs on the business processing node; the device includes:

[0018] An execution module is configured to, when N services are aggregated and packaged into a block to be processed, call the service aggregation process to execute the block to be processed, and obtain a service execution result for each service and a service execution certificate associated with each service; N is a positive integer; each service refers to a sensitive service carrying sensitive data sent by a service node associated with the local consensus node; and the service execution certificate is evidence indicating that each service has been correctly executed;

[0019] an optimization module, configured to determine the business execution result of each of the businesses as the block execution result of the block to be processed, invoke the business summary process to perform optimization processing on the block execution result, and obtain a block optimization result and an optimization certificate associated with the block execution result; the optimization processing refers to hiding or obfuscating the sensitive data in the business execution result of each of the businesses; the block optimization result refers to the block execution result after optimization processing; and the optimization certificate is evidence used to indicate that the block execution result has been optimized;

[0020] A processing module, configured to obtain a return service for transmission back to the local consensus node based on a block optimization result, a result hash of the block execution result, a business hash of each business, the business execution certificate, the optimization certificate, and a block header of the block to be processed;

[0021] An information sending module is used to transmit the return business back to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the business summary process, performs business verification on the return business, and obtains a business verification result for return to the business node; the business verification refers to verifying and confirming that the block optimization result is correctly executed and optimized through the circuit proof in the return business; the circuit proof includes the business execution proof and the optimization proof.

[0022] On the one hand, an embodiment of the present application provides a data processing device based on a hierarchical chain, wherein the hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in a business layer and a global consensus network deployed in a consensus layer, wherein local consensus nodes and business processing nodes are deployed in the business layer; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when determining that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; the device runs on the local consensus node, and the device includes:

[0023] A receiving module, configured to receive a return service sent by the service processing node, wherein the return service is obtained based on the block optimization result, the result hash of the block execution result, the service hash of each of the N services contained in the block to be processed, the service execution certificate, the optimization certificate, and the block header of the block to be processed; N is a positive integer; each of the services refers to a sensitive service carrying sensitive data sent by a service node associated with the local consensus node; the service execution certificate is evidence indicating that each of the services is correctly executed; the block execution result is determined based on the service execution result of each service; the service execution result and the service execution certificate of each service are obtained by the service processing node calling the service summary process to execute the block to be processed; the block optimization result and the optimization certificate are obtained by the service processing node calling the service summary process to optimize the block execution result;

[0024] A verification module is used to call the verification processing data corresponding to the business aggregation process, perform business verification on the backhaul business, obtain a business verification result, and return the business verification result to the business node; the business verification refers to verifying and confirming that the block optimization result is correctly executed and optimized through the circuit proof in the backhaul business; the circuit proof includes the business execution proof and the optimization proof.

[0025] On the one hand, an embodiment of the present application provides a computer device, including a memory and a processor; the memory is connected to the processor, the memory is used to store a computer program, and the processor is used to call the computer program so that the computer device executes the method provided by the embodiment of the present application.

[0026] On the one hand, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program. The computer program is suitable for being loaded and executed by a processor so that a computer device having the processor executes the method provided by the embodiment of the present application.

[0027] In one aspect, embodiments of the present application provide a computer program product or computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the method provided in the embodiments of the present application.

[0028] In an embodiment of the present application, in the infrastructure of a hierarchical chain network (global consensus network and local consensus network), the local consensus network can be deployed in the business layer, and the global consensus network can be deployed in the consensus layer. In addition, in order to facilitate the protection of the business privacy and security of certain businesses (e.g., sensitive businesses) associated with the local consensus network. The embodiment of the present application proposes that a business processing node independent of the local consensus node can be deployed in the business layer of the hierarchical chain network. The local consensus node here can be used to authorize the business processing node to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node. It can be understood that the business processing node involved in the embodiment of the present application can further call the business aggregation process to execute the N businesses in the block to be processed when obtaining a block to be processed containing N businesses, so as to obtain the business execution results of each business in the N businesses and the business execution certificate associated with each business. It should be noted that the business execution certificate here can be used to indicate evidence of the correct execution of each business. Then, the business processing node can call the business summary process to optimize the block execution results determined based on each business execution result in units of blocks to obtain block optimization results and optimization proofs. In this way, the business processing node can construct a return business for transmission back to the local consensus node based on all the results obtained by calling the business summary process (for example, the block optimization result, the result hash of the block execution result, the business hash of each of the businesses, the business execution proof, the optimization proof, and the block header of the block to be processed), and transmit the return business back to the local consensus node, so that the verification processing data corresponding to the business summary process can be called to perform business verification on the local consensus node to obtain the optimized business execution result of each business after data optimization processing of the business execution result. That is, the embodiment of the present application can ensure the privacy and security of business data in sensitive businesses related to local consensus nodes through data interaction between global consensus nodes, local consensus nodes and business processing nodes. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] FIG1 is a schematic diagram of a hierarchical structure of a blockchain network provided in an embodiment of the present application;

[0030] FIG2 is a schematic diagram of the structure of a hierarchical chain network provided in an embodiment of the present application;

[0031] FIG3 is a schematic diagram of the structure of a hierarchical chain network providing a service aggregation process according to an embodiment of the present application;

[0032] FIG4 is a flow chart of a data processing method based on a hierarchical chain according to an embodiment of the present application;

[0033] FIG5 is a schematic diagram of a process for obtaining a backhaul service according to an embodiment of the present application;

[0034] FIG6 is a flowchart of a data processing method based on a layered chain according to an embodiment of the present application;

[0035] FIG7 is an interactive diagram of a data processing method based on a layered chain provided in an embodiment of the present application;

[0036] FIG8 is an interactive diagram of a data processing method based on a hierarchical chain provided in an embodiment of the present application;

[0037] FIG9 is a schematic diagram of a processing flow of a hierarchical chain network provided in an embodiment of the present application;

[0038] FIG10 is a first structural diagram of a data processing device based on a hierarchical chain provided in an embodiment of the present application;

[0039] FIG11 is a second structural diagram of a data processing device based on a layered chain provided in an embodiment of the present application;

[0040] FIG12 is a schematic structural diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0041] Please refer to Figure 1, which is a schematic diagram of a blockchain network hierarchical structure provided by an embodiment of the present application. The blockchain network hierarchical structure can be applied to a blockchain electronic invoice system. In the blockchain network corresponding to the blockchain electronic invoice system, a business network deployed in a public network and a consensus network (also known as a witness network) deployed in a private cloud can be included. The business network here can be the business network 100a shown in Figure 1, and the consensus network here can be the consensus network 200a shown in Figure 1. The blockchain network hierarchical structure specifically refers to a hierarchical structure composed of a business layer and a consensus layer. In the blockchain network, in order to achieve network isolation between the business network and the consensus network, the embodiment of the present application can deploy the business network in the business layer of the hierarchical structure and deploy the consensus network in the consensus layer of the hierarchical structure.

[0042] In the business network 100a shown in Figure 1, multiple business nodes are deployed. Specifically, the multiple business nodes may include business nodes 110a, 110b, 110c, 110d, 110e, 110f, 110g, ..., 110n shown in Figure 1. It should be noted that there is no limit on the number of business nodes deployed in business network 100a. As shown in Figure 1, each business node operating in business network 100a can exchange data with consensus nodes in the consensus network.

[0043] For example, in the hierarchical structure of the blockchain network, a business node can submit a certain business (e.g., electronic invoice issuance business) to a consensus node in the consensus network in the form of a business. In this way, after the consensus node packages this business (e.g., electronic invoice issuance business) into a certain block and links the block containing this business to the blockchain maintained by the consensus network, it can authorize this business node to clear and synchronize the business related to itself (e.g., electronic invoice issuance business) from the blockchain maintained by the consensus network. In addition, it should be understood that when the business node clears and synchronizes the business related to itself from the blockchain, it can also clear and synchronize the business data of the business. For example, the business data can specifically refer to the electronic invoice issued by the consensus node for the above-mentioned electronic invoice issuance business.

[0044] It should be understood that in the consensus network 200a shown in Figure 1, multiple consensus nodes are deployed. The multiple consensus nodes here can specifically include consensus node 11a, consensus node 11b, consensus node 11c, and consensus node 11d shown in Figure 1. It should be noted that there is no limit on the number of consensus nodes deployed in the consensus network 200a. In addition, as shown in Figure 1, for the multiple consensus nodes running in the consensus network 200a, the blockchain they jointly maintain is specifically blockchain 11e shown in Figure 1.

[0045] Understandably, in the aforementioned blockchain electronic invoice system, the business network and consensus can interact through routing boundaries. Because the consensus network resides in a relatively secure private cloud, mutual access is inherently secure thanks to the consensus mechanism, eliminating the need for additional identity management and network controls. However, business nodes reside in public networks and may be accessed by other, unidentified network terminals. Therefore, the access of business nodes and other potential nodes to the consensus network requires strict control.

[0046] It should be understood that the blockchain involved in the embodiments of this application (such as the global consensus chain and local consensus subchains described above) is a new application model of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanisms, and encryption algorithms. It is mainly used to organize data in chronological order and encrypt it into a ledger to make it tamper-proof and forgeable, while also enabling data verification, storage, and updates. Blockchain is essentially a decentralized database in which each node stores an identical blockchain.

[0047] In the above-mentioned blockchain electronic bill system, the consensus node can be responsible for the consensus in the consensus network (e.g., consensus network 200a) where the blockchain (e.g., blockchain 11e) is located. For the above-mentioned consensus network 200a, the specific process of writing the business (for example, electronic invoice issuance business) submitted to the consensus network 200a into the corresponding blockchain ledger (for example, a distributed database) through the consensus node can be: the user client sends the business (for example, electronic invoice issuance business) to a certain business node, and then the business (for example, electronic invoice issuance business) is passed between the business nodes in the business network within the above-mentioned blockchain network in a relay manner until the consensus node in the consensus network 200a deployed in the above-mentioned blockchain network (for example, consensus node 11b in consensus network 200a) receives the business (for example, electronic invoice issuance business). At this time, the consensus node (for example, consensus node 11b in consensus network 200a) packages the business (for example, electronic invoice issuance business) into a block, so that the block currently packaged can be subsequently used for block consensus with other consensus nodes. Therefore, after the block consensus is passed, the block that passes the consensus can be written into the distributed database of the consensus network (for example, consensus network 200a) where it is located.

[0048] It is understood that in the aforementioned blockchain electronic invoice system, a smart contract can be deployed on the blockchain 11e of the consensus network 200a. In the blockchain electronic invoice system, the smart contract can be understood as a code executed by each consensus node, which can execute arbitrary logic and obtain results. For example, if a user needs to perform a certain business, they can access and call the smart contract deployed on the blockchain (e.g., the blockchain 11e) maintained by the consensus network (e.g., the consensus network 200a) by initiating a business request for the business through the user client.

[0049] Specifically, the business node in the business network can send the business request to the consensus node in the consensus network 200a (for example, the consensus node 11a shown in Figure 1) to authenticate the identity of the user sending the business request through the chain entrance of the consensus network 200a, and when the identity authentication is successful, the business request sent by the user is allowed to be sent to other consensus nodes in the consensus network 200a (for example, the consensus node 11b shown in Figure 1), and then the smart contract can be run in these consensus nodes (for example, the consensus node 11a and the consensus node 11b shown in Figure 1) to execute the business requested by the user.

[0050] It should be understood that one or more smart contracts (the smart contract here is essentially an executable business processing data) can be deployed on the blockchain (for example, the above-mentioned blockchain 11e) maintained by the above-mentioned consensus network (for example, the above-mentioned consensus network 200a). These smart contracts can be distinguished by the contract call address, contract identification number (Identity document, ID) or contract name, and the business request initiated by the user client can also carry the contract call address or contract identification number or contract name of the smart contract to specify the smart contract to be run.

[0051] It should be understood that in the aforementioned blockchain electronic invoice system, any two blockchain nodes in the consensus network (e.g., consensus network 200a) can form a peer-to-peer (P2P) network. This peer-to-peer network can utilize the P2P protocol, which is an application layer protocol running on top of the Transmission Control Protocol (TCP). In a distributed system, any device, such as a server or terminal, can join and become a blockchain node. Each blockchain node can include a hardware layer, an intermediate layer, an operating system layer, and an application layer.

[0052] In addition, it can be understood that in the blockchain electronic bill system, in order to ensure the business privacy, isolation and security of the electronic bill derivative business associated with the business nodes in different regions (e.g., provinces) deployed in the business network, the embodiment of the present application can be based on the region (e.g., province) as a unit. In the business layer where the business network is located, different consensus networks are deployed for the business nodes in different regions (e.g., provinces), and then the electronic bill derivative business for different regions (e.g., provinces) can be carried out respectively through the consensus nodes in the different consensus networks deployed in the business layer. For example, in the business layer, one region (e.g., province) can correspond to one consensus network. For ease of understanding, the embodiment of the present application takes the number of consensus networks deployed in the business layer as one as an example, so that the consensus networks deployed in the business layer can be collectively referred to as local consensus networks, and the consensus networks deployed in the consensus layer can be collectively referred to as global consensus networks, and then the consensus nodes in the local consensus network can be referred to as local consensus nodes, and the consensus nodes in the global consensus network can be referred to as global consensus nodes. Based on this, in the embodiments of the present application, the blockchain maintained by the local consensus nodes in the local consensus network can also be referred to as the local consensus subchain, and the blockchain maintained by the global consensus nodes in the global consensus network can be referred to as the global consensus chain. It should be understood that the blockchains in this hierarchical structure (e.g., the global consensus chain and the local consensus subchains) can be collectively referred to as hierarchical chains.

[0053] Among them, the global consensus nodes in the global consensus network can be used to execute global businesses associated with electronic bills (that is, bill businesses with global business attributes, such as electronic bill issuance business, electronic bill circulation business, electronic bill reimbursement business, etc.), and the local consensus nodes in the local consensus network can be used to execute local businesses associated with the electronic bills (that is, other bill businesses with regional business attributes, for example, some electronic bill derivative businesses associated with electronic bills, such as credit inquiry business and bill redemption business conducted for issued electronic invoices, etc.).

[0054] Furthermore, based on the above-mentioned blockchain network hierarchical structure, the embodiment of the present application also provides an improved hierarchical chain network, which includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer. The global consensus network is independent of the local consensus network. For ease of understanding, the embodiment of the present application may collectively refer to the blockchain maintained by the local consensus network deployed in the business layer as a local consensus subchain, and the blockchain maintained by the global consensus network deployed in the consensus layer as a global consensus chain. In addition, the embodiment of the present application may collectively refer to the consensus nodes in the local consensus network as local consensus nodes, and the consensus nodes in the global consensus network as global consensus nodes.

[0055] It should be understood that in the business network 100a under the above-mentioned hierarchical structure, the embodiment of the present application can be divided into regions, and a network for correspondingly processing regional business can be configured or deployed for each region. These configured or deployed networks for correspondingly processing regional business are local consensus networks, and the consensus nodes in these local consensus networks are all located in the above-mentioned business network 100a. In this way, the blockchain network corresponding to the above-mentioned improved hierarchical structure can be constructed through these local consensus networks configured in the business layer and the above-mentioned consensus network configured in the consensus layer (i.e., the global consensus network).

[0056] It should be understood that the consensus nodes in the local consensus network deployed in the business layer are essentially business nodes (i.e., SPV nodes) running a local consensus protocol. For example, for ease of understanding, taking the above-mentioned division unit as a province as an example, a local consensus network 201 as shown in Figure 2 below can be configured for a certain province. The local consensus nodes in this local consensus network are provincial-level SPV nodes running a local consensus protocol. These provincial-level SPV nodes running a local consensus protocol can be collectively referred to as provincial-level SPV local consensus nodes. The blockchain maintained by these provincial-level SPV local consensus nodes is the above-mentioned local consensus subchain.

[0057] It is understood that a local consensus network is a network used to handle regional business. The consensus network 200a in the above hierarchical structure can be the global consensus network 202 shown in Figure 2 below. The blockchain maintained by the consensus nodes in the global consensus network 202 is the above-mentioned global consensus chain. The global consensus chain here can also be referred to as the global chain, the global consensus main chain, etc.

[0058] It is understandable that, in the embodiment of the present application, when a global consensus network for processing global business has been deployed in the consensus layer, one or more networks for processing regional business can be further deployed in the business layer through the business nodes in the above-mentioned business network 100a. For ease of understanding, in the embodiment of the present application, one or more networks deployed in the business layer for processing regional business can be referred to as local consensus networks under the global consensus network, that is, the number of local consensus networks under the global consensus network can be one or more. It should be understood that when a local consensus network is used to maintain a local consensus sub-chain, the number of local consensus sub-chains maintained by the local consensus network deployed in the business layer can also be one or more. Among them, the local consensus network under the global consensus network is used to describe that the business processing level of the global consensus network deployed in the consensus layer is higher than the business processing level of the local consensus network deployed in the business layer, so the local consensus network with a low business processing level can be referred to as a local consensus network under the global consensus network.

[0059] Among them, a local consensus network can be used to process the business submitted by the business nodes in a region. Therefore, when there are multiple local consensus networks deployed in the business layer, different local consensus networks can be used to process the business submitted by the business nodes in different regions. Under this improved hierarchical structure, the global consensus network here can be used not only to process some global business, but also to process the summary information business submitted by the local consensus nodes in each local consensus network after summarizing some regional businesses on the local consensus sub-chain. The blockchain network corresponding to this improved hierarchical structure is a hierarchical chain network, and the hierarchical chains maintained by this hierarchical chain network can specifically include the above-mentioned local consensus sub-chains and the global consensus chain.

[0060] It should be understood that within the hierarchical chains maintained by this hierarchical chain network, the services associated with service nodes in different regions can be stored on different local consensus sub-chains via local consensus nodes in the local consensus network within the corresponding region. For example, in the aforementioned blockchain electronic bill system, the global services executed by the global consensus nodes in the global consensus network can specifically be bill services with global business attributes within the global region, while the local services executed by the local consensus nodes in the local consensus networks can specifically be other bill services with regional business attributes within each region within the global region.

[0061] For example, the embodiment of the present application can deploy a local consensus network for each region under the global region (such as multiple provincial and ministerial regions under the global region), and each local consensus network can be used to interact with the business nodes in the corresponding region (for example, the business SPV nodes in the provincial and ministerial regions shown in Figure 2) to perform data processing to achieve business processing in the corresponding region. For example, when the local consensus nodes in each local consensus network are used to process local business in the corresponding region, they can specifically be used to process credit inquiry business, bill redemption business, etc. in the corresponding region. Based on this, the local consensus network used to process business within the provincial and ministerial regions can also be called a provincial local consensus network, and the local consensus subchain maintained by the provincial local consensus network can be called a provincial local consensus subchain.

[0062] Similarly, under the provincial local consensus network, it can be further subdivided into more fine-grained regional local consensus networks. For example, under the provincial local consensus network, local consensus networks for more subdivided regions (such as district-level regions under provincial and ministerial regions) can be deployed. The local consensus networks corresponding to district-level regions under provincial and ministerial regions can then be called district-level local consensus networks. Each district-level local consensus network is used to maintain the corresponding district-level local consensus subchain. Each district-level local consensus network can be used to exchange data with business nodes within the district-level region to implement business processing within the district-level region (such as bill business processing).

[0063] For ease of understanding, please refer to Figure 2, which is a structural diagram of a hierarchical chain network provided by an embodiment of the present application. As shown in Figure 2, the hierarchical chain network may include a local consensus network 201 and a global consensus network 202. Among them, the local consensus network 201 can be used to maintain the local consensus sub-chain and perform business processing on the business nodes in the corresponding area (for example, local business, where the local business can be specifically the above-mentioned regional business), that is, the local consensus network 201 is a network deployed in the above-mentioned business layer for processing regional business in the corresponding area, such as the provincial local consensus network for processing business in the provincial and ministerial regions. The provincial local consensus network can be deployed by the provincial institutional departments in the blockchain electronic bill system. When the local consensus network shown in Figure 2 is a provincial local consensus network, each consensus node in the provincial local consensus network is a local consensus node, and the local consensus node here can be specifically a provincial SPV local consensus node. For example, each provincial SPV local consensus node here can include but is not limited to the provincial SPV local consensus node 21a, provincial SPV local consensus node 21b, ..., provincial SPV local consensus node 21e shown in Figure 2.

[0064] It is understood that in this hierarchical chain network, one or more local consensus networks can be deployed under the global consensus network to process the business of the corresponding area. For ease of understanding, only the local consensus network deployed under the global consensus network is described as the local consensus network 201 shown in Figure 2 as an example. The local consensus networks corresponding to other regions can refer to the relevant description of the local consensus network 201, which is not repeated here.

[0065] The global consensus network 202 shown in FIG2 can be used to maintain the global consensus chain in the hierarchical chain and can perform business processing on global businesses submitted by business nodes in the business network, such as business processing on bill businesses with global business attributes within the global region. As shown in FIG2 , each consensus node in the global consensus network 202 is a global consensus node, and the global consensus nodes here can include but are not limited to the global consensus node 22a, global consensus node 22b, and global consensus node 22c shown in FIG2 .

[0066] It is understandable that when deploying a local consensus sub-chain in the local consensus network 201, the local consensus sub-chain subsequently maintained by the local consensus network 201 needs to be pre-registered on the global consensus chain maintained by the global consensus network 202, and then the local consensus sub-chain can be run in the local consensus network 201 when the sub-chain registration is successful.

[0067] It is understood that the specific process of registering a local consensus subchain on the global consensus chain can be described as follows: the business object can send a registration service and a configuration service for the local consensus subchain to the global consensus node, so that the global consensus node can activate the local consensus network based on the received registration service, and when executing the configuration service on the global consensus node, the chain identifier for the local consensus subchain and the genesis information for the genesis block in the local consensus subchain can be configured, and the chain identifier and genesis information of the configured local consensus subchain can be used as the configuration information of the configuration service. In this way, when the local consensus node subsequently obtains the configuration information, it can further obtain the genesis information for the genesis block in the local consensus subchain carried in the configuration information, and then create the genesis block in the local consensus subchain based on the genesis information to start the local consensus subchain, thereby completing the creation of the local consensus network and the local consensus subchain.

[0068] Among them, the local consensus nodes in the local consensus network can synchronously write the target consensus block with the registration business from the global consensus chain. The registration business refers to the business submitted by the business object to the global consensus node through a business node to request the registration of the local consensus sub-chain. The registration business refers to the business submitted by the business object to the global consensus node through a business node to request the configuration of the genesis block of the local consensus sub-chain.

[0069] It is understood that the target consensus block also includes the configuration service corresponding to the registration service. The configuration information corresponding to the configuration service carries the chain identifier configured by the global consensus node for the local consensus subchain (e.g., the chain identifier of the local consensus subchain is L1) and the genesis information configured by the global consensus node for the genesis block on the local consensus subchain. Then, when the local consensus node obtains the configuration information corresponding to the above-mentioned configuration service from the target consensus block, it can obtain the genesis information of the genesis block used to create on the local consensus subchain from the configuration information. After successfully verifying the genesis information, it can create a genesis block for starting the local consensus subchain in the local consensus network based on the genesis information, and can start the local consensus subchain based on the genesis block. It is understood that the genesis block here refers to the first block written to the local consensus subchain by the local consensus node in the local consensus network after the local consensus subchain is started.

[0070] It should be understood that when a local consensus subchain is started for the first time in a local consensus network, it is necessary to verify whether the genesis information in the genesis block created in the local consensus network is consistent with the genesis information of the local consensus subchain registered as a subchain on the global consensus chain (such as the local consensus subchain with chain identifier L1), and start the local consensus subchain when the verification is consistent.

[0071] Furthermore, it is understandable that in the embodiment of the present application, when a district-level local consensus network is deployed under a provincial-level local consensus network, other local consensus sub-chains for processing more subdivided businesses can be registered on the local consensus sub-chain maintained by the provincial-level local consensus network.

[0072] It is understandable that the local consensus network 201 can exchange data with the global consensus network 202, thereby constructing a secure and efficient business flow system under the premise of mutual cooperation between the local consensus network 201 and the global consensus network 202. It is understandable that for the blockchain electronic invoice system using this improved hierarchical structure, it can not only help to implement the business governance of various types of businesses related to electronic invoices in a hierarchical manner, but also ensure that each region can operate its own regional-level business relatively independently, and there is no need to aggregate the entire business alliance's traffic into the global consensus chain. In this way, not only can data isolation, business privacy isolation, and legal compliance be achieved for businesses in different regions, but it can also ensure that the global consensus network does not need to carry a large number of segmented businesses, and can thus focus more on the global governance of global businesses (for example, electronic invoice issuance business related to electronic invoices).

[0073] The local consensus nodes in the local consensus network can essentially be lightweight nodes (SPV nodes, Simplified Payment Verification) in the above-mentioned business network. In other words, the local consensus nodes in the local consensus network 201 can synchronize and clear the business data of the global business associated with themselves (such as local consensus network 201) from the global consensus chain maintained by the global consensus network 202. They do not need to synchronize all block data on the global consensus chain, but need to maintain all block data on the local consensus subchain. Therefore, if the local consensus network is a provincial local consensus network, the local consensus nodes in the provincial local consensus network can also be called provincial SPV local consensus nodes.

[0074] Among them, it can be understood that the provincial local consensus network can synchronize the business data of the global business related to itself from the global consensus chain through the provincial main chain SPV node. For example, in the embodiment of the present application, when processing local business, the local consensus network can refer to the business data of the global business synchronized from the global consensus chain. The business data of the global business can specifically be the read value set (Read Key-Value Set) in the business status data of the smart contract (i.e., the above-mentioned business processing data) used when the global consensus node executes the global business in the block. For example, when the business node corresponding to the business object obtains the electronic bill related to itself from the global consensus chain, it can further submit the lottery business for the electronic bill to the local consensus node in the local consensus network. At this time, the local consensus node can determine the relevant data required for executing the lottery business from other data associated with the lottery of the electronic bill synchronized from the global consensus chain, such as the list of companies participating in the lottery and the proportion of participating in the lottery, and then execute the lottery business based on these relevant data.

[0075] It is understandable that the business submitted to the local consensus network 201 will not be forwarded to the global consensus network, but only needs to be locally packaged and block-produced in the local consensus network, and the blocks after consensus are chained to the local consensus subchain. Optionally, if necessary, the block information in the blocks on the local consensus subchain maintained by the local consensus network can be aggregated, so that the aggregated information can be uploaded to the global consensus network in the form of business (i.e., global business). For example, the local consensus node (21a as shown in Figure 2) in the local consensus network 201 can receive the lottery business (the lottery business here is a local business) submitted by the business node in the corresponding area. After that, it will not forward each lottery business received directly to the global consensus network, but will autonomously execute the lottery business in the local consensus network 201 and chain the lottery results after executing these lottery businesses to the local consensus subchain. Then, after completing a cycle of lottery business, the local consensus node (21a as shown in Figure 2) in the local consensus network 201 can obtain the lottery results within this cycle from the block information of the block on the local consensus sub-chain, and summarize the information on the lottery results within this cycle, such as summarizing the cumulative number of times each prize was drawn within this cycle. Then, the local consensus node can encapsulate the summarized information obtained by summarization into a summary business, and then submit the summary business to the global consensus node in the global consensus network 202 in the form of a business.

[0076] It is understood that in the blockchain electronic invoice system corresponding to the layered chain network, the business nodes (SPV nodes) used for data exchange between the local consensus network 201 and the global consensus network 202 are referred to as provincial main chain SPV nodes. As shown in Figure 2, the number of provincial main chain SPV nodes used for data exchange between the local consensus network 201 and the global consensus network 202 can be multiple. In this case, the multiple provincial main chain SPV nodes can specifically include but are not limited to the provincial main chain SPV node 23a and the provincial main chain SPV node 23b shown in Figure 2. It should be understood that the roles, data, and permissions of each provincial main chain SPV node used for data exchange between the local consensus network 201 and the global consensus network 202 are exactly the same.

[0077] As shown in Figure 2, the two provincial main chain SPV nodes used for data exchange between the global consensus network and the local consensus network can represent active-active services. For example, any of the two provincial main chain SPV nodes can synchronize the ledger data of the global consensus chain maintained by 202 in the global consensus network to the local consensus node in the local consensus network, so that the local consensus node can perform other local business (e.g., the aforementioned lottery business, credit inquiry business, etc.) based on the ledger data of the global consensus chain.

[0078] It is understood that the provincial main-chain SPV nodes are essentially service nodes within the business network used to synchronize ledgers with the global consensus network. Therefore, in one or more implementations, the provincial main-chain SPV nodes can also be used to receive global services submitted by various business entities through user clients (e.g., archiving configuration services for archiving local consensus data on local consensus subchains).

[0079] Specifically, when a business object needs to archive a local consensus sub-chain, it can submit the global business (for example, an archiving configuration business for archiving local consensus data on the local consensus sub-chain) to the above-mentioned provincial main chain SPV node, and then the provincial main chain SPV node can forward the received global business (for example, an archiving configuration business for archiving local consensus data on the local consensus sub-chain) to the network entrance of the global consensus network (for example, the global consensus network entrance 205 shown in Figure 2), so that the global consensus network entrance 205 can forward the received global business to the global consensus node, such as the global consensus node 22a, the global consensus node 22b, the global consensus node 22c, etc. in Figure 2.

[0080] Optionally, in one or more implementations, the provincial main chain SPV node here can also receive global services (e.g., the above-mentioned aggregated services) sent by the local consensus node, and can forward the global services (e.g., the above-mentioned aggregated services) sent by the local consensus node to the global consensus network portal 205. For example, the local consensus node can aggregate the business data of the services of a certain business type on the local consensus sub-chain, generate the above-mentioned aggregated services, and then send the aggregated services to the provincial main chain SPV node. At this time, when the provincial main chain SPV node receives the aggregated services sent by the local consensus node (such as the provincial SPV local consensus node 21a), it can further forward the aggregated services to the global consensus network portal 205, so that the global consensus network portal 205 can forward the received aggregated services to the global consensus nodes in the global consensus network, so that these global consensus nodes can subsequently upload the aggregated services to the global consensus chain.

[0081] It is understood that the business nodes in this hierarchical chain network may include the business nodes for synchronizing the ledger data of the global consensus chain (for example, the provincial main chain SPV nodes mentioned above), and may also include business nodes for synchronizing the ledger data of the local consensus subchain. These business nodes for synchronizing the ledger data of the local consensus subchain may be business SPV nodes. It should be understood that in the embodiment of the present application, the business SPV node that interacts with the local consensus network for data is mainly responsible for submitting local transactions to the local consensus network and synchronizing the ledger data of each block on the local consensus subchain. For example, the business SPV nodes here may include but are not limited to the business SPV node 24a, business SPV node 24b, and business SPV node 24c shown in Figure 2.

[0082] For ease of understanding, in this embodiment of the application, the business nodes used to synchronize the ledger data of the global consensus chain (for example, the provincial main chain SPV nodes mentioned above) may be collectively referred to as global business nodes. The global business nodes here may specifically include, but are not limited to, cross-chain relays that exchange data between the local consensus network and the global consensus network. In other words, the cross-chain relays here are essentially SPV nodes deployed in the business layer. Similarly, in this embodiment of the application, the business nodes used to synchronize the ledger data of the local consensus subchains (for example, the business SPV nodes mentioned above) may be collectively referred to as local business nodes. The business submitted by the global business node to the global consensus node is the global business, while the business submitted by the local business node to the local consensus node is the local business. For ease of understanding, in this embodiment of the application, the global business node used to submit global business and the local business node used to submit local business may be collectively referred to as business nodes. Based on this, in this embodiment of the application, the local business nodes here may be referred to as the next-level business nodes of the global business node.

[0083] As shown in FIG2 , the business SPV node may be a business node in the region corresponding to the local consensus network 201, and may interact with the local consensus network 201. For example, a provincial-level SPV local consensus node (21a as shown in FIG2 ) may receive local business for a local consensus subchain sent by a business SPV node (business SPV node 24a as shown in FIG2 ), and then the provincial-level SPV local consensus node (21a as shown in FIG2 ) verifies the legitimacy of the received local business, and performs package consensus on the verified local business, so as to package the local business and upload it to the provincial-level local consensus subchain (i.e., the above-mentioned local consensus subchain) maintained by the provincial-level SPV local consensus node.

[0084] It is understandable that, in addition to the provincial local consensus network, there may be a next-level local consensus network (e.g., a provincial local consensus network may also include a district-level local consensus network) and a next-level business node (i.e., the next local business node, for example, the next-level business SPV node of the above-mentioned local business node) used to interact with the next-level local consensus network for data. Although these next-level business nodes will not directly synchronize the ledger data of the global consensus chain, they can synchronize the ledger data of the provincial local consensus sub-chain maintained by the provincial local consensus network, and thus synchronize the ledger data related to themselves from the provincial local consensus sub-chain. This means that when the provincial local consensus network synchronizes business data related to a certain local business from the global consensus chain through the above-mentioned provincial main chain SPV node, the next-level business node can indirectly obtain the business data related to a certain local business synchronized from the global consensus chain through the provincial local consensus network. In addition, it is understandable that these next-level business nodes can also be used to synchronize the ledger data of the local consensus network 201 (for example, the provincial local consensus network), and also obtain the ledger data related to themselves (such as the district-level local consensus network, business SPV nodes) in a secure SPV data clearing manner.

[0085] It's understood that SPV nodes typically set a Bloom filter in their connections with neighboring nodes. For example, the neighbors of a provincial mainchain SPV node are global consensus nodes in the global consensus network, while the neighbors of a business SPV node are local consensus nodes in the local consensus network. When a neighboring node sees a business that meets the SPV node's Bloom filter condition, it sends a block to the SPV node using a merkleblock message. This merkleblock message contains a blockheader and a Merkle path connecting to the business's Merkle root. The SPV node uses this merkle path to connect the business to the block containing it, and uses the blockheader to verify that the block containing the business is on the blockchain and has received confirmations. These two verifications prove the existence of the business on the blockchain, allowing the SPV node to synchronize the corresponding business data from its neighboring nodes.

[0086] For example, when an SPV node is a provincial main chain SPV node, it can synchronize business data related to its global business from neighboring nodes (i.e., global consensus nodes). Alternatively, when an SPV node is a business SPV node, it can synchronize business data related to its local business from neighboring nodes (e.g., local consensus nodes).

[0087] It is understandable that when the local consensus network obtains a certain business (for example, a local business) submitted in plain text by the business node, it will perform business processing on the business data in the business (for example, a local business) submitted in plain text. If there is some sensitive data in the business data, the privacy and security of the sensitive data involved cannot be guaranteed. Based on this, the embodiment of the present application deploys a business processing node related to the local consensus network in the hierarchical chain network corresponding to the above-mentioned improved hierarchical structure. The business aggregation process running on the business processing node can be a target data rollup service or a target data second-layer service for data optimization of sensitive data.

[0088] For example, the business summary process deployed on the business processing node can be used to directly receive business related to sensitive data submitted by a certain business node. Optionally, the business summary process deployed on the business processing node can also be used to indirectly receive business related to sensitive data submitted to the local consensus network by other business nodes, so that the sensitive data in the acquired business can be further optimized, and based on the sensitive data after data optimization, a return business for transmission back to the local consensus node in the local consensus network can be generated. In this way, when the subsequent local consensus node links the return data to the local consensus sub-chain, since the business data in the return business is optimized data after data optimization of the sensitive data in the above-mentioned business, the embodiment of the present application can ensure that the original data of the sensitive data will not be linked to the local consensus sub-chain, and ensure that other business nodes in the same area as the local consensus network will not obtain the original data of the sensitive data, thereby ensuring the data isolation between different business nodes in the same area while also improving the privacy and security of sensitive data.

[0089] Further, please refer to Figure 3, which is a schematic diagram of the structure of a hierarchical chain network that provides a business aggregation process according to an embodiment of the present application. As shown in Figure 3, the hierarchical chain network may include a global consensus network 301 and a local consensus network 302. Among them, the local consensus network 301 can be the local consensus network 201 in the embodiment corresponding to Figure 2 above. The local consensus network 301 shown in Figure 3 may include multiple local consensus nodes for maintaining local consensus sub-chains. The multiple local consensus nodes here may include but are not limited to the consensus nodes 31a, 31b, 31c, and 31d shown in Figure 3. Similarly, the global consensus network 302 can be the global consensus network 202 in the embodiment corresponding to Figure 2 above. The global consensus network 302 shown in Figure 3 may include multiple global consensus nodes for maintaining the global consensus chain. The multiple global consensus nodes here may include but are not limited to the consensus nodes 32a, 32b, 32c, and 32d shown in Figure 3. The hierarchical chain network may also include multiple business nodes associated with the local consensus network. The multiple business nodes here may specifically include but are not limited to the business node 33a (for example, business SPV node 1), business node 33b (for example, business SPV node 2) and business node 33c (for example, business SPV node 3) shown in Figure 3.

[0090] It is understandable that in a network for processing regional business, in addition to the local consensus nodes for maintaining the local consensus sub-chain, a business processing node for providing a business summary process may also be included. The business processing node here may be the business processing node 34a shown in Figure 3. It is understandable that one or more business summary processes can be started for the same local consensus network, and the one or more business summary processes here can run on one business processing node. Optionally, different business processing nodes can be deployed for different local consensus networks, and then different business summary processes for different local consensus networks can be deployed in different business processing nodes. For ease of understanding, the embodiment of the present application takes the example of starting a business summary process for the same local consensus network. Then, the business summary process will run on a business processing node in the same network as the local consensus network.

[0091] It is understandable that the business processing node (such as business processing node 34a) can be used to process the above-mentioned business involving sensitive data submitted in plain text, that is, the sensitive data here is essentially the business data in the business (for example, the above-mentioned local business) submitted in plain text. Among them, the embodiment of the present application can collectively refer to the local business associated with sensitive data as business or sensitive business, and can collectively refer to the sensitive business or sensitive data in the business as target data. The target data here can specifically be an object identifier of a business object (for example, a user) (that is, an identifier used to uniquely characterize the user), personnel information of an enterprise or organization, customer information of an enterprise or organization, etc., which is not limited here.

[0092] For example, the business or sensitive business may be a tax refund service for tax refunds. The tax refund service may carry the identification information of the business object requiring the tax refund, and the identification information of the business object is the sensitive data described above. Another example is a credit investigation service for credit information inquiries. The credit investigation service may carry the identification information of the business object requiring credit information inquiries, and the identification information of the business object is the sensitive data described above.

[0093] It is understandable that when a business aggregation process is deployed on the business processing node 34a, the business processing node 34a can call the business aggregation process to execute the above-mentioned business, and can further optimize the business execution results obtained by executing the business, thereby making it possible for the sensitive data involved in the business to no longer be transmitted back to the local consensus node in plain text. In this way, the phenomenon that the local consensus node uploads the sensitive data involved in the business in plain text to the local consensus sub-chain can be solved, thereby ensuring the privacy and security of sensitive data, and making the relevant data uploaded to the local consensus sub-chain be data after data optimization processing. Among them, data optimization processing (also known as desensitization processing) refers to the ability to hide or blur sensitive data, thereby avoiding the leakage of sensitive data and ensuring the security and privacy of sensitive data.

[0094] For example, the business summary process can be used to process a tax refund business, which can carry the identification information of the business object that needs to be refunded, and the identification information of the business object is sensitive data. At this time, when the business processing node receives the tax refund business, it can obtain the tax voucher from the global consensus chain or the local consensus subchain based on the identification information of the business object in the tax refund business, and then process the tax refund based on the tax voucher. Then, after the business processing node completes the tax refund business through the business summary process, it can further optimize the data that needs to be returned to the local consensus node (such as the business execution result of the tax refund business) through the business summary process (such as hiding the object identification of the business object involved in the tax refund business), and then return the data after data optimization to the local consensus node in the form of business, thereby ensuring the privacy and security of the object identification of the business object.

[0095] It is understandable that a business involving sensitive data (also called sensitive business) can be processed by a business aggregation process, that is, each independent sensitive business can have its own corresponding business logic and execution circuit, so that the business isolation between sensitive businesses can be effectively completed. It is understandable that if it is necessary to process multiple types of sensitive businesses, multiple business aggregation processes can be deployed in the network used to process regional businesses. Here, one of the business aggregation processes is used as an example to illustrate. In addition, the global consistency capability of the layered chain network can be jointly guaranteed by the zero-knowledge proof circuit corresponding to the business aggregation process, the cross-chain backhaul capability of the local consensus sub-chain (such as the ability to send the aggregated information to the global consensus network in the form of business), and the global circuit management capability of the global consensus network (that is, the circuit processing process provided by the power processing process shown in Figure 3), and the correctness of the sensitive business can be guaranteed on a trustless basis.

[0096] It is understandable that the business processing nodes here can be deployed in the data service network, and the data service network here can be independent of the global consensus network and the local consensus network, that is, the business processing nodes in the data service network belong neither to the global consensus network nor to the local consensus network.

[0097] It should be understood that in the embodiment of the present application, a local consensus network can deploy a business processing node, so the network composed of different business processing nodes can be the above-mentioned data service network. The data service network can include one or more business processing nodes.

[0098] Optionally, in one or more implementations, a service processing node deployed in a data service network can maintain a privacy chain. It should be noted that the privacy chain here essentially refers to a distributed storage database implemented based on factors such as network balance. This distributed storage database can be used to distribute data after optimizing sensitive data related to privacy services in different regions. In other words, the privacy chain here is essentially a data chain that does not require block consensus. For example, when a service processing node receives N services, it can aggregate these N services, package them into a block (i.e., an aggregated block), and call a service aggregation process to execute the services in the block (i.e., the aggregated block). The resulting aggregated block (i.e., the aggregated block) can then be stored in the data chain maintained by the service processing node.

[0099] It is understandable that the business summary process can be a service process that has been registered and audited on the global consensus chain. Before each business summary process is started, its corresponding computing logic must remain private, so it is not open to the entire network, but it needs to be registered and audited on the global consensus node in the global consensus network. In this way, after the global consensus node registers and audits the business summary process, it can call the circuit processing process shown in Figure 3 to store the zero-knowledge proof circuit corresponding to the business summary process. This means that the embodiment of the present application can ensure that the business summary process is managed by the global consensus network, and further ensure the security and reliability of the business summary process registered on the global consensus chain through the global consensus protocol run by these global consensus nodes in the global consensus network, thereby avoiding the creation and startup of malicious business summary processes.

[0100] Among them, it can be understood that the global consensus network can call the circuit processing process 307 to store the zero-knowledge proof circuit corresponding to the business summary process after registration and review. For example, the zero-knowledge proof circuit 37a corresponding to the business summary process shown in Figure 3 can be stored, and then when other business objects question the execution logic of the business summary process, the circuit processing process 307 can be called through the global consensus node to obtain the zero-knowledge proof circuit 37a corresponding to the business summary process, and then the obtained zero-knowledge proof circuit 37a can be returned to other business objects that raise questions, so as to facilitate verification and review by other business objects that raise questions.

[0101] It can be understood that when a business processing node starts a business summary process, the local consensus node in the local consensus network can verify whether it has been registered and reviewed on the global consensus chain. If it is verified that the business summary process to be started is registered and reviewed on the global consensus chain, the business processing node can be allowed (i.e., authorized) to start the business summary process. If it is verified that the business summary process to be started has not been registered and reviewed on the global consensus chain, the business processing node is not allowed to start the business summary process.

[0102] It is understandable that the business summary process is a self-organizing block architecture, and there is no need to reach a consensus on the blocks packaged by the business summary process. This means that the correct execution of the blocks and businesses packaged by the business summary process is guaranteed by a zero-knowledge proof circuit. It is understandable that the zero-knowledge proof circuit here includes a zero-knowledge proof execution circuit and a zero-knowledge proof desensitization circuit. For example, when the packaged block is given to the zero-knowledge proof execution circuit, the block and each business in the block can be executed by the zero-knowledge proof execution circuit, and then the business execution proof obtained after executing the block and the business execution result of each business obtained when executing each business can be recorded. The business execution result of each business here can be equivalent to the block execution result of the block. Furthermore, the embodiment of the present application can further give the block execution result of the block to the zero-knowledge proof desensitization circuit, and then the block execution result of the block can be desensitized (i.e., optimized) by the zero-knowledge proof desensitization circuit to obtain the block optimization result (also referred to as the block desensitization processing result) and optimization proof corresponding to the block execution result. It is understood that the desensitization process (i.e., optimization process) here refers to blurring or hiding the sensitive data in plain text in the execution result of the block. It should be understood that in the embodiment of the present application, the above-mentioned business execution proof and optimization proof are both zero-knowledge proofs (i.e., ZK proofs).

[0103] Among them, zero-knowledge proofs (ZK proofs) use cryptography to allow someone (the prover) to prove to someone else (the verifier) ​​that a fact is 100% true, without revealing any additional information beyond the specific statement of truth. Essentially, a ZK proof allows someone to prove they know or possess something without revealing any information about what they know or possess. Currently, ZK proofs have two primary uses: 1. Privacy, which is used to minimize the amount of data publicly available when conducting activities on a blockchain. For example, transactions related to Zcash (a digital collectible) need to be published to a public blockchain, but Zcash offers confidential transactions and financial privacy options. Therefore, zero-knowledge proofs can be used to verify transactions without revealing the sender, recipient, or transaction amount. 2. Scalability: This allows intensive computations to be performed off-chain, making them more cost-effective, and then creates a concise proof that the computation was performed honestly, which can be published on-chain. On-chain and off-chain operations each perform their respective functions, becoming specialized and focusing on what they do best. This allows for a large number of transactions to be processed quickly and efficiently using a centralized, high-performance, off-chain system, while still using a decentralized, immutable, trustless blockchain as the ultimate source of truth for who owns what. Understandably, ZK proofs are computationally insignificant compared to the validity proofs of all the off-chain transactions, and they are also incredibly fast to verify. This is thanks to an almost magical property: once they create a proof saying, "Yes, these billions of calculations are 100% proven correct," validators can confirm that the proof is correct without having to perform billions of calculations themselves.

[0104] It can be understood that after the local consensus network writes the return business returned by the business processing node through the business aggregation process into the local consensus sub-chain, the local consensus node (such as consensus node 31a) can further summarize the information of the optimized business execution results of the business within a certain period of time, and encapsulate the summarized information according to the business encapsulation format to encapsulate the summarized business, so as to upload the summarized business to the global consensus node through the cross-chain relay 305 shown in Figure 3.

[0105] Specifically, when a local consensus node (such as consensus node 31a) can obtain the aggregated business, it can send the aggregated business to the global consensus network entrance 306 through the cross-chain relay 305, so that the global consensus network entrance 306 can forward the aggregated business to the global consensus network 302, so that the global consensus node in the global consensus network (such as consensus node 32a) can write the aggregated business into the global consensus chain.

[0106] Based on the above description, the embodiment of the present application proposes a data processing solution based on a hierarchical chain, which can deploy a business summary process for the local consensus network in the infrastructure of the hierarchical chain network (global consensus network and local consensus network), and then the business processing node can call the business summary process to execute N businesses in the block to be processed, obtain N business execution results and business execution proofs corresponding to the N businesses, and then call the business summary process to optimize the block execution results determined based on the N business execution results, obtain the block optimization results and optimization proofs, and then obtain the return business for returning to the local consensus node, and return the return business to the local consensus node, so that the data returned to the local consensus node is the corresponding business execution results in the block execution result after optimization processing, so that the privacy and security of the business data in the return business on the local consensus subchain can be ensured. In addition, since the above-mentioned target data processing solution relies on the above-mentioned hierarchical chain network, each region can correspond to a network for processing regional businesses, thereby ensuring the business isolation between regional businesses in different regions. In addition, since the business aggregation process deployed on the business processing node is registered and reviewed on the global consensus node, the global consensus protocol on the global consensus node can be used to ensure the security and reliability of the business aggregation process on the global consensus chain.

[0107] Among them, it can be understood that the nodes involved in the embodiments of the present application (such as the above-mentioned business processing nodes, local consensus nodes, and global consensus nodes) can be servers, terminal devices, or other devices for data processing, which are not limited here. Among them, the server can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms and other basic cloud computing services, which are not limited here. The above-mentioned terminal devices include but are not limited to mobile phones, computers, intelligent voice interaction devices, smart home appliances, vehicle-mounted terminals, aircraft, smart speakers, smart home appliances, etc.

[0108] It should be noted that when the node in the embodiment of the present application obtains data (such as the above-mentioned object identification, the enterprise's personnel information, the enterprise's customer information, etc.) of the business object (for example, the above-mentioned individual, enterprise or institution), a prompt interface or pop-up window can be displayed. The prompt interface or pop-up window is used to prompt the business object that it is currently collecting data such as the object identification, the enterprise's personnel information, the enterprise's customer information, etc. Only after the business object issues a confirmation operation on the prompt interface or pop-up window, the relevant steps of data acquisition are started, otherwise it ends.

[0109] In addition, it can be understood that in the specific implementation of this application, business data of business objects such as users, enterprises, and institutions may be involved (for example, the tax receipts involved in the above-mentioned tax refund business for tax refunds or the credit information involved in the above-mentioned credit inquiry business, etc.). When the above embodiments of this application are applied to specific products or technologies, it is necessary to obtain the permission or consent of business objects such as users, enterprises, and institutions, and the collection, use and processing of relevant data need to comply with relevant laws, regulations and standards of the relevant regions.

[0110] Further, please refer to Figure 4, which is a flow chart of a data processing method based on a hierarchical chain provided in an embodiment of the present application. The hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer; local consensus nodes and business processing nodes are deployed in the business layer; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; the method is executed by the business processing node that has started the business aggregation process. In other words, the startup of the business aggregation process corresponding to the business processing node is jointly determined by the local consensus node in the local consensus network and the global consensus node in the global consensus network. The data processing method based on the hierarchical chain may include steps S401-S404.

[0111] S401: When N businesses are aggregated and packaged into a block to be processed, a business aggregation process is called to execute the block to be processed, and a business execution result of each business and a business execution certificate associated with each business are obtained;

[0112] Where N is a positive integer; each of the services refers to a local service carrying sensitive data sent by a service node associated with the local consensus node; and the service execution result of each service is recorded when executing each service in the block to be processed. In other words, in this embodiment of the application, a service is sent by a service node associated with the local consensus node; and a service can correspond to a service execution result.

[0113] Among them, it can be understood that the block to be processed can be obtained by block packaging of the N currently acquired businesses, which means that the above-mentioned aggregation and packaging refers to the operation when the business processing node calls the business aggregation process to package the N businesses into a block (i.e., the block to be processed). As mentioned above, the business can be a sensitive business with target data (i.e., the above-mentioned sensitive data) submitted by a business node in the same area as the business processing node and received by the business processing node. The sensitive business here essentially belongs to the above-mentioned local business. For example, the business can be a tax refund business for a business object. It can be understood that a business aggregation process can be used to process a sensitive business (i.e., used to process a business type of business). If multiple types of business need to be processed, multiple business aggregation processes associated with the local consensus network in the area can be deployed in the network used to process regional business. Here, one of the business aggregation processes is used as an example for explanation.

[0114] It is understandable that the block to be processed involving N businesses involved in the embodiment of the present application can specifically be obtained by packaging the N businesses to be processed in the business pool when the business pool corresponding to the data link maintained by the business processing node meets the business packaging conditions. It is understandable that the business pool can be used to store each business to be processed (i.e., to be privacy-processed) received by the business processing node, that is, the business processing node can store each business in the business pool when receiving each business, and then when the business pool meets the business packaging conditions, take out the N businesses when the business packaging conditions are triggered in the business pool, and aggregate and package the taken out N businesses into the block to be processed. It is understandable that the business packaging condition can be that the timestamp corresponding to the business pool reaches a certain time threshold, or that the number of businesses to be processed in the business pool reaches a certain number threshold, which is not limited here. For example, services in a service pool can be packaged every 10 minutes. When the timestamp corresponding to the service pool reaches 10 minutes after the last package, the service pool is confirmed to have met the package conditions. At this time, the service pool includes N services, and the N services can be packaged to obtain a block to be processed. For another example, when the number of services in the service pool reaches N, the services in the service pool can be packaged. When the number of services in the service pool reaches N, the service pool is confirmed to have met the package conditions. At this time, the N services in the service pool can be packaged to obtain a block to be processed.

[0115] It is understandable that a business node can be a general term for nodes used to initiate business (such as the above-mentioned privacy business carrying sensitive data and local business or global business that does not carry sensitive data, etc.). It is understandable that among the N businesses in the block to be processed, each business can be initiated by a business node respectively, or a business node can initiate one or more businesses. The number of businesses submitted to the business processing node by each business node is not limited here. It is understandable that the business node associated with a local consensus node can be a business node belonging to the area where the corresponding local consensus network is located. For example, the local consensus network to which a local consensus node belongs is used to process the business of area A, and the business node associated with the local consensus node can be a business node under area A.

[0116] It can be understood that the N services may include services sent directly by the service node to the service processing node (for example, the second service), and may also include services sent by the service node to the local consensus node and then forwarded by the local consensus node to the service processing node (for example, the first service).

[0117] Specifically, the business node includes a first business node deployed in a hierarchical chain network; the business sent by the first business node to the local consensus node is the first business; then, an embodiment of the present application includes: receiving the first business forwarded by the local consensus node, and treating the first business as a business among N businesses; the business type corresponding to the first business is consistent with the business type of each business in the N businesses.

[0118] It is understandable that the first service node can be any service node in the hierarchical chain network, and the first service node can send services to the corresponding local consensus node. In other words, the first service node here is a node in the service network of the hierarchical chain network used to send services to the local consensus node, and the service sent by the first service node to the local consensus node is the first service.

[0119] Thus, it can be seen that the first business can be sent by the first business node to the local consensus node and forwarded by the local consensus node to the business processing node. Then, the business processing node can receive the first business forwarded by the local consensus node and use the first business as one of the N businesses mentioned above. In other words, the business processing node can put the first business forwarded by the local consensus node into the business pool, and then, when the business pool meets the business packaging conditions, it can determine the N businesses mentioned above based on the first business and other businesses in the business pool, so as to perform business packaging processing on the N businesses and obtain a block to be processed.

[0120] It can be understood that the business aggregation process here can be used to process the above-mentioned sensitive businesses. At this time, the business types of the sensitive businesses received by the business processing nodes deployed with the business aggregation process are all the same business type (for example, the above-mentioned sensitive business types for tax refunds). For example, the N businesses in the above-mentioned block to be processed can all be the same business type, that is, the business type of the first business is consistent with the business type of each of the N businesses.

[0121] Optionally, in one or more optional implementations, the service node may further include a second service node deployed in a hierarchical chain network; the second service node here is a node in the service network of the hierarchical chain network that is used to directly send services to the service processing node. Then, an embodiment of the present application further includes: the service processing node may receive a second service sent by the second service node, and use the received second service as a service in the N services; the service type corresponding to the second service is consistent with the service type of each service in the N services.

[0122] It is understood that the second service node can be any service node in the hierarchical chain network, and the second service node can be a service node that directly sends services to the service aggregation process. It is also understood that the second service node and the first service node can be the same service node in the service network or different service nodes, and this is not limited here.

[0123] The second service may be a service sent directly from the second service node to the service processing node. Specifically, the service processing node may receive the second service sent directly from the second service node and include the second service in the N services. In other words, the service processing node may place the second service sent directly from the second service node into a service pool. When the service pool meets the service packaging conditions, the service processing node may determine the N services based on the second service and other services in the service pool, and then perform service packaging processing on the N services to obtain a block to be processed.

[0124] It can be understood that, as described above, the correct execution of the business and the optimization of the business execution results by the business processing node calling the business summary process are guaranteed by the zero-knowledge proof circuit. The zero-knowledge proof circuit can be used to execute N businesses in the block to be processed, and obtain the business execution results of each business. Then, the business execution nodes of each business obtained can be collectively referred to as the block execution results of the block to be processed in units of blocks. Then, when optimizing the block execution results of the block to be processed, the business execution results of each business in the block execution results can be further optimized to obtain the business execution results of each business after data optimization. Then, the business execution results of each business after data optimization are used as block optimization results to achieve optimization of the block execution results of the block to be processed. It can be understood that the embodiments of the present application can collectively refer to the optimized block execution results as obtained block optimization results.

[0125] It can be understood that zero-knowledge proof is a cryptographic proof concept. The prover (i.e., the business processing node here) and the verifier (i.e., the local consensus node) jointly agree on a rule. Under this rule, the prover provides a string of ciphertext (i.e., a circuit proof generated based on the zero-knowledge proof circuit) to the verifier without exposing its own private evidence. The verifier can verify the ciphertext and, when the verification is successful, can be sure that the prover has the corresponding proof content, but the verifier cannot know the specific proof content. That is, the circuit proof generated by the zero-knowledge proof circuit can make the verifier believe that the prover has the ability to correctly execute the business and optimize the business execution results, but the verifier does not need to know how the prover is implemented.

[0126] It is understood that the zero-knowledge proof circuit corresponding to the business aggregation process may include a zero-knowledge proof execution circuit and a zero-knowledge proof optimization circuit. The zero-knowledge proof execution circuit can be used to execute N businesses in the pending block, obtaining business execution results and business execution proofs for the N businesses. The zero-knowledge proof optimization circuit can be used to optimize the block execution result determined based on the N business execution results, obtaining a block optimization result and an optimization proof.

[0127] It is understood that the business execution result of each business refers to the record recorded when the business summary process is called to execute each business. It is understood that one business can correspond to one business execution result.

[0128] Among them, the business execution proof can be used to indicate the correct execution of each of the N businesses, that is, in the relevant description of the above-mentioned zero-knowledge proof, the prover needs to provide a string of ciphertexts for verification to the verifier, and then the subsequent verifier (that is, the local consensus node) can verify whether the business is executed correctly through the business execution proof without knowing the specific execution process of the business.

[0129] Specifically, the business processing node can call the business summary process to execute N businesses in the block to be processed, and obtain N business execution results corresponding to the N businesses and business execution proofs associated with the N businesses. For example, the business processing node can obtain the zero-knowledge proof execution circuit associated with the block to be processed from the zero-knowledge proof circuit corresponding to the business summary process, and call the zero-knowledge proof execution circuit to execute the N businesses in the block to be processed, and obtain N business execution results corresponding to the N businesses and business execution proofs associated with the N businesses.

[0130] It can be understood that the zero-knowledge proof execution circuit can be used to execute N businesses in the block to be processed, obtain the business execution results of each of the N businesses, and generate a business execution certificate associated with each business, that is, the business execution certificate here can be used as evidence to indicate the correct execution of each business.

[0131] For example, the business summary process can be used to process the above-mentioned tax refund business. That is, the tax refund business received by the business processing node may involve some sensitive data. The sensitive data here includes but is not limited to: the object information of the business object that needs to be refunded (such as the object identifier). Then, when the business processing node executes the tax refund business through the business summary process, it can perform the tax refund business processing on the business object based on the object information of the business object. For example, the business processing node can obtain the tax receipt of the business object from the global consensus chain or the local consensus subchain based on the object information of the business object, and then perform the tax refund processing based on the tax receipt of the business object. As a result, the business execution result recorded by executing the tax refund business can be obtained. In this case, the business execution result may include information such as whether the tax refund for the business object is successful, the refund amount, and the refund time. It is understandable that the business execution result may also involve the aforementioned sensitive data (such as the object information of the business object). For this, the business processing node needs to further optimize the sensitive data contained in the business execution result to obtain the business execution result of the tax refund business after data optimization.

[0132] It is understandable that when the business object initiates the sensitive business of tax refund, it is necessary to obtain the object information of the business object (such as the object ID). Then, a prompt interface or pop-up window can be displayed to remind the business object that its object ID is currently being collected. Only after the business object confirms the prompt interface or pop-up window, the relevant steps of data acquisition are started, otherwise the process ends. In addition, the tax refund vouchers required in the process of handling tax refund business also need to obtain the permission or consent of business objects such as users, enterprises, and institutions, and the collection, use and processing of relevant data must comply with the relevant laws, regulations and standards of the relevant regions.

[0133] S402: Determine the business execution result of each business as the block execution result of the block to be processed, call the business summary process to optimize the block execution result, and obtain a block optimization result and an optimization certificate associated with the block execution result.

[0134] The optimization process refers to hiding or obfuscating the sensitive data in the business execution results of each business; the block optimization result refers to the block execution result after optimization; and the optimization proof is evidence used to indicate that the block execution result has been optimized. In other words, the optimization proof here can specifically refer to evidence provided to the verifier (i.e., the local consensus node deployed with the verification processing data) that can indicate that the block execution result has been optimized.

[0135] It can be understood that the block execution result may be the execution result corresponding to the block to be processed, and the block execution result may include N business execution results.

[0136] It can be understood that optimizing the block execution result means that the target data (i.e., the above-mentioned sensitive data, such as the object identifier of the business object) in the block execution result can be hidden or blurred, so that the block optimization result can be obtained. For the convenience of description, the optimized block execution result can be referred to as the block optimization result. For example, if the business execution result of each business in the block execution result includes sensitive data (e.g., the object identifier of the business object corresponding to the corresponding business), the business summary process can be further called to perform data optimization processing on the sensitive data in each business execution result (e.g., the object identifier of the business object), that is, the key characters in the object identifier of the business object can be hidden. For example, if the object identifier of the business object is 12345, the key characters in the object identifier of the business object are hidden by "*", and the object identifier of the business object after data optimization processing is 123**, thereby achieving data optimization processing of the sensitive data in the business execution result of each business in the block execution result, so that the business execution results of each business after processing optimization processing can be collectively referred to as the above-mentioned block optimization result.

[0137] Among them, it can be understood that the optimization proof can be used as evidence to indicate that the block execution result is optimized, that is, in the relevant description of the above-mentioned zero-knowledge proof, the prover needs to provide a string of ciphertexts for verification to the verifier, and then the subsequent verifier (that is, the local consensus node) can use the optimization proof to verify whether the block execution result is correctly optimized without knowing the specific optimization process.

[0138] Specifically, the business processing node can call the business summary process to optimize the block execution result, obtaining the block optimization result and an optimization proof associated with the block optimization result. For example, the business processing node can obtain the zero-knowledge proof optimization circuit associated with the block execution result from the zero-knowledge proof circuit corresponding to the business summary process, call the zero-knowledge proof optimization circuit to optimize the block execution result, and obtain the block optimization result and an optimization proof associated with the block optimization result.

[0139] It can be understood that the zero-knowledge proof optimization circuit can be used to optimize the block execution result to obtain the block optimization result, and the zero-knowledge proof optimization circuit can also generate an optimization proof for providing to the local consensus node to verify whether the block execution result is correctly optimized.

[0140] S403. Based on the block optimization result, the result hash of the block execution result, the business hash of each business, the business execution proof, the optimization proof, and the block header of the block to be processed, a return business for transmission back to the local consensus node is obtained.

[0141] It is understood that the return service can be a service for returning to the verifier (i.e., the local consensus node where the verification processing data is deployed). In other words, when the block optimization results and circuit proof (i.e., business execution proof, optimization proof) and other auxiliary proofs (i.e., the result hash for the block execution result, the business hash of N businesses) are returned to the local consensus node, they can be returned in the form of a business.

[0142] It is understandable that the result hash of the block execution result can be a hash value obtained by performing a hash calculation on the block execution result. The business hash of each of the N businesses can be a hash value obtained by performing a hash calculation on each business, that is, one business can correspond to one business hash. The block header of the block to be processed may include the block hash value of the block to be processed, the block hash value of the previous block of the block to be processed on the data chain, and a timestamp and other information, which are not limited here. Among them, the block hash value of the block to be processed is the root hash value of the current block, and the root hash value here refers to the hash value finally obtained after performing a hash calculation on the N businesses in the block body of the block to be processed.

[0143] It can be understood that the block optimization result, the result hash of the block execution result, the business hash of each business, the business execution certificate, the optimization certificate, and the block header of the block to be processed can be used as the business parameters in the return business, and then these business parameters in the return business can be further assembled based on the business encapsulation format associated with the local consensus network to assemble the return business for transmission to the local consensus node.

[0144] Further, please refer to Figure 5, which is a schematic diagram of a process for obtaining a backhaul service provided in an embodiment of the present application. As shown in Figure 5, the block to be processed obtained by the service processing node may be the block to be processed 501 shown in Figure 5, and the block to be processed 501 may include the above-mentioned N services. Further, as shown in Figure 5, the service processing node may call the zero-knowledge proof execution circuit 502 to execute the block to be processed 501 to obtain a block execution result 503a and a service execution proof 503b of the block to be processed 501 in units of blocks, wherein the block execution result 503a may be determined by the service processing node based on the service execution result of each of the N services.

[0145] Furthermore, as shown in FIG5 , the business processing node can input the block execution result 503a into the zero-knowledge proof optimization circuit 504 to call the zero-knowledge proof optimization circuit 504 to optimize the block execution result 503a (specifically, the zero-knowledge proof optimization circuit 504 can be called to perform data optimization processing on each business execution result in the block execution result 503a), thereby obtaining the block optimization result and optimization proof 505 shown in FIG5 ; and, other information that needs to be returned to the local consensus node can be obtained, namely, the result hash of the block execution result, the business hash of each business, and the block header 506 of the block to be processed, and then based on the block optimization result and optimization proof 505, the business execution proof 503b, and the result hash of the block execution result, the business hash of each business, and the block header 506 of the block to be processed, the return business 507 shown in FIG5 can be constructed.

[0146] S404: The returned service is transmitted back to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the service aggregation process, performs service verification on the returned service, and obtains a service verification result for returning to the service node.

[0147] It is understandable that the local consensus node can perform business verification on the backhaul business, which is equivalent to verifying whether the block optimization result (i.e., the block execution result after optimization processing) carried in the business parameters of the backhaul business is the result of correct execution of each business and data optimization processing of each business execution result in the block execution result. It is understandable that, with reference to the above description, the local consensus node is equivalent to the verifier in the zero-knowledge proof, and performs business verification on the backhaul business, that is, verification based on the circuit proof (i.e., business execution proof, optimization proof) in the backhaul business to confirm that the block optimization result of the backhaul business is obtained by correct execution and optimization processing. In other words, in an embodiment of the present application, the business verification here refers to verifying and confirming that the block optimization result is obtained by correct execution and optimization processing through the circuit proof in the backhaul business; the circuit proof includes the business execution proof and the optimization proof.

[0148] The verification processing data may be a smart contract used to verify the backhaul service. The verification processing data is deployed on the local consensus subchain maintained by the local consensus node, and the local consensus node can then call the verification processing data to verify the backhaul service. The service verification result may be the result obtained from the service verification of the backhaul service, that is, it can be used to indicate the success or failure of the backhaul service verification.

[0149] It is understandable that after obtaining the business verification result, the business verification result can be returned to the business node that sent the corresponding business, so that the business node can know whether the business execution result of the business is successfully verified by the local consensus node.

[0150] It is understood that when a service (i.e., a second service) is sent directly from a service node to a service processing node, the service processing node may also return the service execution result of the second service directly to the corresponding service node (i.e., the second service node). This is because, when a service (e.g., a second service) is configured to be sent directly from a service node to a service processing node, secure communication can be established between the service node and the service processing node, allowing the service node to directly obtain the service execution result of the second service. It is understood that the service execution result of the second service is recorded when executing the second service in the block to be processed.

[0151] It can be seen from this that for the business processing node, the business processing node can return the business execution result of the second business directly to the second business node, or the business processing node can also return the business execution result of the data after optimization processing corresponding to the second business (that is, the optimized business execution result of the second business) directly to the second business node, or the business processing node can also return the business execution result of the second business and the business execution result of the data after optimization processing corresponding to the second business (that is, the optimized business execution result) directly to the second business node, without limitation here. Among them, the timing of returning the business execution result of the second business directly to the second business node can be after obtaining the block execution result, or after obtaining the block optimization result, without limitation here. For example, the timing of returning the business execution result of the data after optimization processing corresponding to the second business (that is, the optimized business execution result) to the second business node can be after obtaining the block optimization result.

[0152] Specifically, the block execution result includes the business execution result of the second business; the business execution result of the second business is recorded when executing the second business in the block to be processed; then, the embodiment of the present application also includes: the business processing node can return the business execution result of the second business to the second business node.

[0153] It is understandable that, as described above, the second business can be a business sent directly from the second business node to the business processing node. It is understandable that the block execution result may include the business execution result of each of the N businesses, and the business execution result of each business is obtained by executing the corresponding business, such as the second business execution result is obtained by executing the second business. It is understandable that the business processing node can return the business execution result of the second business to the second business node. This is because the second business is sent directly from the second business node to the business processing node, and the second business node itself knows the target data involved in the second business (i.e., the above-mentioned sensitive data), and the second business node and the business processing node have established secure communication, so the business execution result containing sensitive data can be directly returned to the second business node.

[0154] Specifically, the block optimization result includes the optimized business execution result of the second business; the optimized business execution result of the second business is obtained after data optimization processing is performed on the business execution result of the second business when the block execution result is optimized; then, the embodiment of the present application also includes: the business processing node can return the optimized business execution result of the second business to the second business node.

[0155] It can be understood that the block execution results can be optimized by performing data optimization processing on each business execution result in the block execution results to obtain the optimized business execution results corresponding to each business. The block optimization results can include the optimized business execution results corresponding to each business, and the optimized business execution results of each business can be returned to the corresponding business node.

[0156] It can be understood that the business processing node can be used to maintain a data chain. Then, after calling the business aggregation process to execute the block to be processed, the executed block to be processed can be written into the data chain.

[0157] Specifically, the data service network corresponding to the business processing node is independent of the global consensus network and the local consensus network; the data chain corresponding to the data service network is constructed based on the business types of N businesses; then, the embodiment of the present application may also include: when the business processing node obtains the block optimization result, it uses the block to be processed as the target block for uploading to the data chain, and then can write the target block into the data chain based on the data uploading strategy indicated by the business summary process.

[0158] It is understandable that the data chain is constructed based on the business types of N businesses. In other words, the business type of each business in each block on the data chain is the business type of the N businesses. For example, if the business processing node is used to process type 1 business, then the business type of the N businesses in the block to be processed is all type 1. Therefore, the business type of each business in each block on the data chain is type 1.

[0159] It is understandable that the target block can be a block for being linked to the data chain. It is understandable that the data linking strategy can be a strategy for directly writing the target block to the data chain when the correct execution of each of the said businesses is confirmed by the zero-knowledge proof circuit in the business aggregation process. Different from writing blocks to the blockchain based on the consensus mechanism, in the embodiment of the present application, block consensus will not be performed on the target block written to the data chain. That is, the data linking strategy corresponding to the business aggregation process refers to the correct execution of the business that the business processing node can ensure through the zero-knowledge proof circuit, which means that the business processing node here can directly write the target block to the data chain.

[0160] It is understood that the data service network may include only the business processing node, or it may include the business processing node and other data backup nodes for backing up the data chain. If the data service network includes a data backup node, then when the business processing node uses the block to be processed as the target block for uplinking to the data chain, it can send the target block to the data backup node, so that the data backup node can perform block backup processing on the target block written to the data chain. It is understood that, generally speaking, the data service network is a lightweight network, that is, the data service network only includes a small number of nodes. For example, the number of nodes in the data service network can be less than a certain threshold.

[0161] Specifically, the data service network may include business processing nodes and data backup nodes; the data on-chain strategy is used to indicate that the business processing node is the primary service node in the data service network, and the data on-chain strategy is used to indicate that the data backup node is a slave service node in the data service network other than the business processing node; wherein the data backup node is used to perform block backup processing on the target block written to the data chain. In this way, when the business processing node writes the target block to the data chain, it can send the target block to the data backup node, so that the data backup node can perform block backup processing on the target block.

[0162] It is understandable that when the data service network includes service processing nodes and data backup nodes, the number of service processing nodes included in the data service network can be one, and the number of data backup nodes can be one or more, which is not limited here.

[0163] It is understood that the master service node can be the primary service node used to invoke the service aggregation process. The aforementioned processes of packaging services to obtain pending blocks, invoking the service aggregation process to execute the services in the pending blocks, and optimizing the service execution results can all be implemented on the service processing node currently serving as the master service node. The slave service node can be a subordinate service node used to invoke the service aggregation process, primarily responsible for backing up the target blocks. It is understood that the master and slave service nodes in a data service network can be determined through pre-negotiation or based on node load, and this is not a limitation here.

[0164] In an embodiment of the present application, the layered chain network corresponding to the layered chain may include a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer, wherein local consensus nodes and business processing nodes are deployed in the business layer; the local consensus node here is the consensus node in the local consensus network, wherein the global consensus node deployed in the consensus layer is the consensus node in the global consensus network; it can be understood that in an embodiment of the present application, the local consensus node can be used to authorize the business processing node to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; in this way, when the business aggregation process is started and run on the business processing node, N businesses can be aggregated into a block through the business aggregation process, and the currently packaged block can be called a pending block. It should be understood that the business types of the N businesses here can all be the same business type.Furthermore, the business processing node may call the business summary process to execute the block to be processed (for example, the business summary process may be specifically called to execute each business in the block to be processed) to obtain the business execution result of each business and the business execution certificate associated with each business; wherein N here is a positive integer; each business here refers to a sensitive business carrying sensitive data sent by a business node associated with the local consensus node; in addition, it can be understood that the business execution certificate may specifically be evidence for indicating the correct execution of each business; further, the business processing node may determine the business execution result of each business as the block execution result of the block to be processed, and then may call the business summary process to optimize the block execution result to obtain a block optimization result and an optimization certificate associated with the block execution result; wherein, it can be understood that the optimization processing here refers to hiding or modding the sensitive data in the business execution result of each business. Fuzzy; based on this, the block optimization result here refers to the block execution result after optimization processing; it should be understood that the optimization proof can specifically be evidence for indicating that the block execution result is optimized; further, the business processing node can obtain the return business for returning to the local consensus node based on the block optimization result, the result hash of the block execution result, the business hash of each of the businesses, the business execution proof, the optimization proof, and the block header of the block to be processed; further, the business processing node can return the return business to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the business summary process, performs business verification on the return business, and obtains a business verification result for returning to the business node; wherein, the business verification refers to verifying and confirming through the circuit proof in the return business that the block optimization result is obtained by correct execution and optimization processing; the circuit proof here can specifically include the business execution proof and the optimization proof.

[0165] Thus, it can be seen that the embodiment of the present application can obtain sensitive business carrying sensitive data transmitted by any business node associated with the local consensus network through the business summary process started and run in the business processing node, and when the N businesses containing the sensitive business are aggregated and packaged into a block to be processed, the business summary process can be further called to execute the block to be processed in units of blocks to obtain the block execution result and business execution certificate of the block to be processed. In this way, when the block execution result of the block to be processed also contains the aforementioned sensitive data that needs to be desensitized, the business summary process can be further called to optimize the block execution result in units of blocks to obtain the block optimization result and optimization certificate. Then, when the business processing node obtains other auxiliary certificates (for example, the result hash of the block execution result, the business hash of each of the business, and the block header of the block to be processed), it can further construct a return service for returning to the local consensus node based on the block optimization result, optimization certificate, and other auxiliary certificates (for example, the result hash of the block execution result, the business hash of each of the business, and the block header of the block to be processed). It should be understood that the business parameters in the return business here are all parameters that have been desensitized. In this way, for the local consensus node, what is obtained is the result hash of the block execution result after the block execution result is desensitized, and the individual business execution results containing sensitive data in the block execution result will not be obtained. Similarly, the local consensus node here obtains the business hash of the sensitive business after desensitization, rather than the sensitive business containing sensitive data. In this way, when the subsequent real-time local consensus node links the return business to the local consensus sub-chain, it can also ensure the business privacy and on-demand nature of these businesses linked to the local consensus sub-chain. In addition, for the local consensus node, when obtaining the return business, it directly calls the verification processing data corresponding to the business summary process to perform business verification on the return business, that is, it only needs to verify and confirm through the circuit proof in the return business (for example, business execution proof and optimization proof) whether the block optimization results obtained on the business processing node side are correctly executed and optimized, without the need to know the specific execution process of a large number of business executions and the specific optimization process of data optimization processing of a large number of business execution results. In this way, the computational overhead of a large number of business executions and the computational overhead of data optimization processing of a large number of business execution results can be reduced from the root on the local consensus node side.Finally, in an embodiment of the present application, the local consensus node can further summarize the optimized business execution results of the business within a certain period of time, and then upload the summarized information (i.e., summary information) to the global consensus node in the form of a transaction, so that the global consensus node in the global consensus network can grasp the current local consensus network's summary of certain local businesses without having to obtain all business data in the local consensus network. This can ensure the business privacy and security of local businesses on the local consensus sub-chain while reducing the resource usage and load of the global consensus node.

[0166] Based on the above description, an embodiment of the present application proposes a data processing method based on a hierarchical chain. Please refer to Figure 6, which is a flow chart of a data processing method based on a hierarchical chain provided by an embodiment of the present application. The hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer, wherein local consensus nodes and business processing nodes are deployed in the business layer; the local consensus node is a consensus node in the local consensus network, and the global consensus node deployed in the consensus layer is a consensus node in the global consensus network; the local consensus node is used to authorize the business processing node to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; the method is executed by the local consensus node. The data processing method based on the hierarchical chain may include steps S601-S602.

[0167] S601, receiving a backhaul service sent by a service processing node;

[0168] Among them, the backhaul business is obtained by the business processing node based on the block optimization result, the result hash of the block execution result, the business hash of each of the N businesses contained in the block to be processed, the business execution certificate, the optimization certificate, and the block header of the block to be processed; each of the said businesses refers to a sensitive business carrying sensitive data sent by the business node associated with the said local consensus node; the said business execution certificate is evidence used to indicate the correct execution of each of the said businesses; the block execution result is determined based on the business execution result of each business; the business execution result and business execution certificate of each business are obtained by the business processing node calling the business summary process to execute the block to be processed; the block optimization result and optimization certificate are obtained by the business processing node calling the business summary process to optimize the block execution result.

[0169] It is understandable that the method of generating the backhaul service can refer to the above-mentioned related description and will not be elaborated here.

[0170] It can be understood that, as mentioned above, the business among the N businesses can be the first business sent by the first business node to the local consensus node, and then forwarded by the local consensus node to the business processing node, and then the optimized business execution result of the first business can be returned to the first business node by the local consensus node.

[0171] Specifically, the service node includes a first service node deployed in a hierarchical chain network; then, the embodiment of the present application also includes: receiving a first service sent by the first service node, and forwarding the first service to a service processing node.

[0172] It can be understood that the relevant description of the first service and the first service node can refer to the above description and will not be repeated here.

[0173] It can be understood that, as mentioned above, when the business aggregation process corresponding to the business processing node is started, it needs to be verified on the local consensus node to verify whether the business aggregation process has completed registration and review in the global consensus network. If it is verified that the business aggregation process to be started is a service that has been registered and reviewed in the global consensus network, it can be allowed to start. If it is verified that the business aggregation process to be started has not been registered and reviewed in the global consensus network, it will not be allowed to start.

[0174] Specifically, the embodiment of the present application may further include the following steps: upon receiving a start-up service for a business aggregation process corresponding to a business processing node, calling the process verification processing data deployed on the local consensus sub-chain to perform verification processing on the business aggregation process to obtain a verification processing result; further, if the verification processing result indicates that the business aggregation process is a registered aggregation process after registration and review in the global consensus network, then deploying the verification processing data corresponding to the business aggregation process on the local consensus sub-chain, and allowing the business processing node to start the business aggregation process.

[0175] It is understood that the startup service can be a service for starting a business aggregation process on a business processing node, and the startup service can be sent by a management node for managing the business aggregation process. The process verification processing data can be a smart contract deployed on the local consensus subchain for process management of the business aggregation process. For example, when an object needs to start a business aggregation process on a business processing node, the local consensus node can determine whether the business aggregation process currently to be started is a registered aggregation process that has been registered and reviewed on the global consensus chain based on the startup service, thereby implementing verification processing for the business aggregation process. The registered aggregation process can be a business aggregation process that has been registered and reviewed in the global consensus network.

[0176] It is understandable that the verification processing result can be used to indicate that the business aggregation process is a registration aggregation process that has undergone registration and review in the global consensus network, or the verification processing result can be used to indicate that the business aggregation process is not a registration aggregation process that has undergone registration and review in the global consensus network. If the verification processing result is used to indicate that the business aggregation process is a registration aggregation process that has undergone registration and review in the global consensus network, it means that the business aggregation process has undergone registration and review in the global consensus network. If the verification processing result is used to indicate that the business aggregation process is not a registration aggregation process that has undergone registration and review in the global consensus network, it means that the business aggregation process has not undergone registration and review in the global consensus network.

[0177] It is understandable that the verification processing data is deployed for the business aggregation process that has successfully verified (i.e., verified that the business aggregation process has been registered and audited in the global consensus network). It is understandable that the embodiment of the present application can deploy verification processing data corresponding to different business aggregation processes on the local consensus node for different business aggregation processes. It is understandable that the business aggregation process can only be successfully started when the local consensus node allows (i.e., authorizes) the business processing node to start the business aggregation process.

[0178] Optionally, if the verification result indicates that the business summary process is not a registered summary process after registration review in the global consensus network, the business processing node is not allowed to start the business summary process.

[0179] Specifically, before calling the process verification processing data deployed on the local consensus sub-chain to verify the business aggregation process, the embodiment of the present application may also include the following steps: receiving the summary service registration information after the global consensus node performs registration review on the business aggregation process; the summary service registration information includes the service identifier of the business aggregation process and the circuit summary information of the zero-knowledge proof circuit corresponding to the business aggregation process; further, writing the summary service registration information into the process verification processing data.

[0180] It is understood that the aggregated service registration information may be information about the business aggregation process after registration review, such as the service identifier of the aforementioned business aggregation process and the circuit summary information of the zero-knowledge proof circuit corresponding to the business aggregation process. The service identifier may be a unique identifier for a business aggregation process, with one service identifier corresponding to one business aggregation process. The circuit summary information of the zero-knowledge proof circuit may include the circuit summary information of the aforementioned zero-knowledge proof execution circuit and the zero-knowledge proof optimization circuit.

[0181] It can be understood that the global consensus node can receive the registration service for the business aggregation process, and then the global consensus node can execute the registration service, that is, perform registration review on the business aggregation process indicated by the registration service, and then the global consensus node will write the summary service registration information of the business aggregation process that has completed the registration review into the global consensus chain, and synchronize the summary service registration information to the local consensus node, so that the local consensus node can write the summary service registration information into the process verification processing data.

[0182] It is understandable that when the process verification processing data is called to verify the business aggregation process, if the summary service registration information of the business aggregation process is written into the process verification processing data, then the business aggregation process can be successfully verified, that is, the verification processing result indicates that the business aggregation process is a registered aggregation process after registration and review in the global consensus network; on the contrary, if the summary service registration information of the business aggregation process is not written into the process verification processing data, then the business aggregation process verification is unsuccessful, that is, the verification processing result indicates that the business aggregation process is not a registered aggregation process after registration and review in the global consensus network. It is understandable that only the business aggregation process that has been registered and reviewed in the global consensus network (that is, completed registration in the circuit processing process) can deploy the corresponding verification processing data on the local consensus subchain when it is subsequently started, and then its corresponding return business can be verified in the local consensus network.

[0183] It is understandable that the global consensus network can be used to register and audit the business aggregation process, and the global consensus network can store the zero-knowledge proof circuit corresponding to the registered and audited business aggregation process in the circuit processing process. Furthermore, if a certain object questions the business execution result successfully verified by the local consensus node (that is, doubts the reliability of the zero-knowledge proof circuit corresponding to the business aggregation process), the local consensus node can obtain the corresponding zero-knowledge proof circuit from the circuit processing process in the global consensus node, so that the object that questions the business execution result can obtain the zero-knowledge proof circuit and realize the re-verification and review of the execution result of the business that has been verified on the local consensus sub-chain.

[0184] S602: Call the verification processing data corresponding to the service aggregation process, perform service verification on the returned service, obtain a service verification result, and return the service verification result to the service node.

[0185] Among them, the business verification refers to verifying and confirming that the block optimization result is obtained through correct execution and optimization processing through circuit proof in the backhaul business; the circuit proof includes the business execution proof and the optimization proof.

[0186] It is understood that, as described above, the verification processing data can be a smart contract used to verify the backhaul service. The verification processing data is deployed on the local consensus subchain maintained by the local consensus node, and the local consensus node can then call the verification processing data to verify the backhaul service. The service verification result can be the result obtained from the service verification of the backhaul service, that is, it can be used to indicate the success or failure of the backhaul service verification.

[0187] It is understood that when a local consensus node receives a return service, it can store the return service in the local service pool corresponding to the local consensus subchain and treat the return service as a local service. Then, when the local service pool meets the service packaging conditions corresponding to the local service pool (such as when the timestamp corresponding to the local service pool reaches a certain time threshold, or when the number of services to be processed in the local service pool reaches a certain number threshold), the local services in the local service pool can be packaged and processed to obtain the corresponding block. Then, block consensus can be performed on the local services in the block. When block consensus is reached, the block containing the local services can be written to the local consensus subchain. It is understood that executing the return service means calling the verification processing data to verify the return service.

[0188] Specifically, calling the verification processing data corresponding to the business summary process, performing business verification on the return business, and obtaining a business verification result may include the following steps: calling the first verification function in the verification processing data to perform function verification on the business hash and business execution proof of each business, and obtaining an execution service verification result for the block execution result; further, calling the second verification function in the verification processing data to perform function verification on the result hash and optimization proof of the block execution result, and obtaining an optimization service verification result for the block optimization result; further, when the execution service verification result indicates that the block execution result verification is successful, and the optimization service verification result indicates that the block optimization result verification is successful, the business verification result is determined to be a verification result indicating that the return business verification is successful.

[0189] It can be understood that the verification of the result obtained by the zero-knowledge proof circuit by the verification processing data can be obtained by performing function verification on the hash value of the input parameter of the zero-knowledge proof circuit and the corresponding circuit proof.

[0190] The result obtained by the zero-knowledge proof execution circuit (i.e., the block execution result) is verified (i.e., the correct execution of each business is verified). Specifically, the hash value of the input parameter of the zero-knowledge proof execution circuit (i.e., the business hash of each business in the N businesses) and the corresponding circuit proof (i.e., the business execution proof) can be verified;

[0191] Among them, the result obtained by the zero-knowledge proof optimization circuit (i.e., the block optimization result) is verified (i.e., the optimization of the block execution result is verified), specifically, the hash value of the input parameter of the zero-knowledge proof optimization circuit (i.e., the result hash of the block execution result) and the corresponding circuit proof (i.e., the optimization proof) can be verified.

[0192] It is understood that the first verification function can be used to verify whether the block execution result is based on the correct zero-knowledge proof execution circuit. The execution service verification result can be a verification result for the block execution result. The execution service verification result can be used to indicate whether the block execution result verification is successful or unsuccessful.

[0193] The second verification function can be used to verify whether the block optimization result is based on the correct zero-knowledge proof optimization circuit for data optimization processing. The optimization service verification result can be a verification result for the block optimization result. The optimization service verification result can be used to indicate whether the block optimization result verification is successful or unsuccessful.

[0194] It is understandable that the service verification result is confirmed to indicate that the backhaul service verification is successful only when both the execution service verification result and the optimization service verification result are successfully verified.

[0195] Specifically, calling the verification processing data corresponding to the business aggregation process, performing business verification on the returned business, and obtaining a business verification result for returning to the business node may also include the following steps: calling the first verification function in the verification processing data to perform contract verification processing on the business hash and business execution proof of N businesses, and obtaining an execution service verification result for the block execution result; further, calling the second verification function in the verification processing data to perform contract verification processing on the result hash and optimization proof of the block execution result, and obtaining an optimization service verification result for the block optimization result; further, when the execution service verification result indicates that the block execution result verification is unsuccessful, or the optimization service verification result indicates that the block optimization result verification is unsuccessful, determining the business verification result to indicate that the returned business verification is unsuccessful.

[0196] It can be understood that when any one of the execution service verification result and the optimization service verification result indicates that the verification is unsuccessful, the confirmation service verification result is used to indicate that the verification of the backhaul service is unsuccessful.

[0197] Optionally, the business processing node is used to maintain the data chain, and the height confirmation block on the data chain is determined by the local consensus node after the block height of the block on the data chain is highly confirmed; the block generation timestamp of the height confirmation block is greater than the block generation timestamp of the block to be processed; then, the embodiment of the present application may also include the following steps: when the business verification result is used to indicate that the backhaul business verification is successful, determine the block height of the block to be processed indicated by the block header of the block to be processed on the data chain, and use the block height of the block to be processed as the height to be confirmed; further, obtain the maximum block confirmation height from the block height of the height confirmation block, update the maximum block confirmation height based on the height to be confirmed, and use the block corresponding to the confirmation height between the maximum block confirmation height before the update and the maximum block confirmation height after the update as the height confirmed block, and update the height confirmation block based on the height confirmed block.

[0198] It is understood that a highly confirmed block is a block that has been highly confirmed by a local consensus node for the block height of a block on the data chain. Each block on the data chain can have a corresponding block generation timestamp, also known as a block timestamp, which is used to indicate the time information of the block generation.

[0199] It is understandable that the maximum block confirmation height may be the block height with the largest height value among the block heights of the height confirmation blocks.

[0200] It is understood that updating the maximum block confirmation height based on the pending confirmation height can be done by determining the pending confirmation height as the maximum block confirmation height. For example, if the maximum block confirmation height before the update is 50 and the pending confirmation height (i.e., the block height of the block to be processed) is 51, then the maximum block confirmation height after the update is 51.

[0201] It is understood that the blocks corresponding to the confirmation height between the maximum block confirmation height before the update and the maximum block confirmation height after the update may include the blocks corresponding to the maximum block confirmation height after the update, but do not include the blocks corresponding to the maximum block confirmation height before the update. It is understood that the local consensus node can update the maximum block confirmation height and the height confirmation block each time the business verification result is used to indicate that the return business verification is successful, or the local consensus node can update the maximum block confirmation height and the height confirmation block only when the business verification results of a certain number of return business are accumulated to indicate that the return business verification is successful. This is not limited here. For example, if the maximum block confirmation height before the update is 50, then the maximum block confirmation height after the update is 51, then the height confirmed block can be the block with a confirmation height of 51, that is, the height confirmed block after the update can include the block with a confirmation height of 51 and the height confirmed block before the update. For another example, if the maximum block confirmation height before the update is 46, then the maximum block confirmation height after the update is 51. The height confirmed blocks can be blocks with confirmation heights of 47, 48, 49, 50, and 51, that is, the height confirmed blocks after the update can include blocks with confirmation heights of 47, 48, 49, 50, and 51 as well as the height confirmed blocks before the update.

[0202] It is understood that by continuously updating the height confirmation block and the maximum block confirmation height, the local consensus node can manage the growth rate of blocks on the data chain. For example, when the updated maximum block confirmation height is greater than the preset expected value, it means that the block height on the data chain is growing too fast, and the local consensus node can then notify the management node to suspend the corresponding business aggregation process.

[0203] Optionally, when the business verification result is used to indicate that the backhaul business verification is successful, it can be determined that the status of the updated highly confirmed block is effective, and subsequently the outside world (such as business nodes, global consensus nodes, etc.) can read the optimized block execution result of the block with effective status from the local consensus node.

[0204] Optionally, if the service verification result is a verification result indicating that the backhaul service verification is unsuccessful, the service processing node is notified to regenerate the backhaul service.

[0205] It is understandable that notifying the service processing node to regenerate the backhaul service can avoid verification failures caused by errors in the data format of the backhaul service or the service format of the service.

[0206] It is understandable that the business verification result is used to indicate that the verification of the return business was unsuccessful. This may be because the wrong zero-knowledge proof circuit was used, the wrong business hash of the business was used during verification, malicious personnel were doing evil, the data format of the return business was wrong, or the business format of the business was wrong, etc., the wrong zero-knowledge proof circuit was used, etc., and there is no restriction here. In simple terms, it is that the system implementation is incorrect, and then the corresponding error can be checked based on some error checking mechanisms, or it can be handled based on some management mechanisms, and there is no restriction here. Optionally, in the absence of malicious personnel doing evil, if the return business verification is unsuccessful, it may be that there is a problem with the system of the business aggregation process. The data chain at this time can also be canceled and reset, or the business processing node can be notified to roll back the block of the data chain that failed to be verified, or it can be handled in some other way, and there is no restriction here.

[0207] It is understandable that, as described above, if a service is sent from a service node to a local consensus node, and then forwarded by the local consensus node to a service processing node, then after verifying the return service corresponding to the service, the local consensus node can return the service execution result and service verification result of the service after data optimization processing to the corresponding service node. It is understandable that since the service execution results in the return service received by the local consensus node are all service execution results after data optimization processing, the service execution results returned by the local consensus node to the service node can only be service execution results after data optimization processing, thereby ensuring the privacy and security of the data.

[0208] Optionally, the block execution result includes the business execution result of the first business; the business execution result of the first business is obtained by executing the first business in the block to be processed; the block optimization result includes the optimized business execution result of the first business; the optimized business execution result of the first business is obtained after data optimization processing of the business execution result of the first business; then, the embodiment of the present application also includes: when obtaining the business verification result for returning to the business node, the optimized business execution result of the first business in the return business that has passed the business verification is determined as the optimized business feedback result, and the optimized business feedback result is returned to the first business node.

[0209] It is understandable that the optimized business feedback result can be a result returned to the business node. As mentioned above, if a business is sent by the business node to the local consensus node, and then forwarded by the local consensus node to the business processing node, the local consensus node can verify the return business corresponding to the business. After that, the business execution result (i.e., the optimized business execution result) and the business verification result of the business after data optimization processing are returned to the corresponding business node. It is understandable that since the business execution results in the return business received by the local consensus node are all business execution results after data optimization processing, the business execution results returned by the local consensus node to the business node are also business execution results after data optimization processing, thereby ensuring the privacy and security of the data.

[0210] Specifically, the block execution result includes the business execution result of the first business; the business execution result of the first business is obtained by executing the first business in the block to be processed; the block optimization result includes the optimized business execution result of the first business; the optimized business execution result of the first business is obtained after data optimization processing of the business execution result of the first business; then, the embodiment of the present application also includes: when obtaining the business verification result for returning to the business node, the optimized business execution result of the first business in the return business that has passed the business verification is determined as the optimized business feedback result, and the optimized business feedback result is returned to the first business node.

[0211] It is understood that the first service can be a service sent by the first service node to the local consensus node, and the local consensus node can forward it to the service processing node. It is understood that the block execution result can include the service execution result of each of the N services, and the service execution result of each service is obtained by executing the corresponding service. The block optimization result can include the optimized service execution result of each of the N services, and the optimized service execution result of each service is obtained by performing data optimization processing on the corresponding service execution result. For example, the service execution result of the first service is obtained by executing the first service, and the optimized service execution result of the first service is obtained by performing data optimization processing on the service execution result of the first service. It is understood that the local consensus node can return the service execution result of the first service to the first service node, and the local consensus node can also return the service verification result of the first service to the first service node. It is understood that the local consensus node can send the optimized service execution result and service verification result of the first service to the first service node together, or the local consensus node can send the service execution result and service verification result of the first service to the first service node separately, without limitation here.

[0212] It can be understood that, as mentioned above, if a business is directly from a business node to a business processing node, the local consensus node can only return the business verification result of the business to the corresponding business node after verifying the return business corresponding to the business, because the business execution result of the business is returned directly to the corresponding business node by the business processing node.

[0213] It is understandable that a business node can also confirm that the business sent by the business node has been confirmed by the local consensus subchain at a certain block height by synchronizing the state of the local consensus subchain, thereby confirming the finality of the result of the business, so that subsequent business queries can be performed on the business. For example, when the block where business A is located is written to the data chain, the block height value is X. The return business corresponding to business A is sent to the local consensus node, and the local consensus node verifies the return business on the block with a block height value of Y on the local consensus subchain. The business node can also confirm that the block height of business A sent by the business node at a block height value of X on the data chain has been confirmed by the local consensus subchain by synchronizing the state of the local consensus subchain.

[0214] It is understandable that after the local consensus sub-chain writes the return business corresponding to some businesses, the local consensus node can summarize the optimized business execution results of the business within a certain period of time, and upload the summarized information (i.e., summary information) to the global consensus node, so that the global consensus node in the global consensus network can grasp the current local consensus network's summary of certain local businesses without having to obtain all business data in the local consensus network, thereby reducing the resource occupation and load of the global consensus node.

[0215] Specifically, the embodiments of the present application may further include the following steps: based on the business verification results, determining the business optimization summary information associated with each business; further, adding the business optimization summary information associated with each business to the optimization information summary pool, and obtaining a summary timestamp for summarizing the business optimization summary information in the optimization information summary pool; further, when the summary timestamp reaches the summary time threshold, summarizing the business optimization summary information in the optimization information summary pool to obtain summary information associated with each business; further, sending the summary business corresponding to the summary information to the global consensus node in the global consensus network through the cross-chain relay associated with the local consensus node, so that the global consensus node can upload the summary business to the global consensus chain maintained by the global consensus node.

[0216] It is understandable that the business optimization summary information can be the information of the dimension required to refer to the summary information of the uploaded global consensus node. It is understandable that the business optimization summary information of each business can be determined based on the optimized business execution results of each business in the backhaul business. For example, if the business is a tax refund business for tax refunds, that is, the summary information that needs to be summarized to the global consensus node is the number of objects for which tax refunds have been completed within each tax refund amount range within a certain time period, then the determined business optimization summary information may include information such as whether the tax refund has been completed and the tax refund amount.

[0217] It is understood that if the service verification result indicates that the backhaul service verification is successful, service optimization summary information for each service associated with the backhaul service is determined. If the service verification result indicates that the backhaul service verification is unsuccessful, it is not necessary to determine the service optimization summary information for each service associated with the backhaul service. In other words, the summarized information is determined based on the service optimization summary information for the services associated with the successfully verified backhaul service.

[0218] It is understandable that the optimization information summary pool can be used to store the business optimization summary information corresponding to each business. The summary timestamp can be the time information corresponding to the information summary of the business optimization summary information in the optimization information summary pool. The summary time threshold can be the time threshold that the summary timestamp needs to reach when summarizing the business optimization summary information in the optimization information summary pool. For example, the business optimization summary information in the optimization information summary pool can be summarized once at 0:00 every day. When the summary timestamp corresponding to the optimization information summary pool reaches 0:00 of the day, the business optimization summary information in the optimization information summary pool is summarized to obtain business summary information. For example, the business summary information can be the number of objects for which tax refunds are completed within each tax refund amount range within the time period corresponding to the summary time threshold (such as within one day).

[0219] Among them, the cross-chain relay can be a device for realizing cross-chain interaction between local consensus nodes and global consensus nodes, such as the provincial main chain SPV node mentioned above. The summary business can be a business constructed based on the summary information. It is understandable that when sending the summary information to the global consensus node, the summary information needs to be sent in the form of a business, that is, the summary information can be assembled into a business to obtain a summary business. Then, the local consensus node can send the summary business to the global consensus node, so that the global consensus node can upload the summary business to the global consensus chain maintained by the global consensus node.

[0220] It is understandable that when the global consensus node receives the summary business, it can store the summary business in the global business pool corresponding to the global consensus chain, and use the summary business as the global business. Then, when the global business pool reaches the business packaging condition corresponding to the global business pool (such as the timestamp corresponding to the global business pool reaches a certain time threshold, or the number of pending businesses in the global business pool reaches a certain number threshold), the global consensus node can package the global businesses in the global business pool to obtain the corresponding blocks, and then perform block consensus on the global businesses in the blocks. When the block consensus is reached, the block can be written into the global consensus chain, that is, the global consensus node uploads the summary business to the global consensus chain maintained by the global consensus node, that is, to upload the summary information to the global consensus node.

[0221] Thus, it can be seen that the embodiment of the present application can obtain sensitive business carrying sensitive data transmitted by any business node associated with the local consensus network through the business aggregation process started and run in the business processing node, and when the N businesses containing the sensitive business are aggregated and packaged into a block to be processed, the business aggregation process can be further called to execute the block to be processed in units of blocks to obtain the block execution result and business execution certificate of the block to be processed. In this way, when the block execution result of the block to be processed also contains the aforementioned sensitive data that needs to be desensitized, the business aggregation process can be further called to optimize the block execution result in units of blocks to obtain the block optimization result and optimization certificate. Then, when the business processing node obtains other auxiliary proofs (for example, the result hash of the block execution result, the business hash of each of the business, and the block header of the block to be processed), it can further construct a return business for returning to the local consensus node based on the block optimization result, optimization certificate, and other auxiliary proofs (for example, the result hash of the block execution result, the business hash of each of the business, and the block header of the block to be processed). It should be understood that the business parameters in the return business here are all parameters that have been desensitized. In this way, for the local consensus node, what is obtained is the result hash of the block execution result after the block execution result is desensitized, and the individual business execution results containing sensitive data in the block execution result will not be obtained. Similarly, the local consensus node here obtains the business hash of the sensitive business after desensitization, rather than the sensitive business containing sensitive data. In this way, when the subsequent real-time local consensus node links the return business to the local consensus sub-chain, it can also ensure the business privacy and on-demand nature of these businesses linked to the local consensus sub-chain. In addition, for the local consensus node, when obtaining the return business, it directly calls the verification processing data corresponding to the business summary process to perform business verification on the return business, that is, it only needs to verify and confirm through the circuit proof in the return business (for example, business execution proof and optimization proof) whether the block optimization results obtained on the business processing node side are correctly executed and optimized, without the need to know the specific execution process of a large number of business executions and the specific optimization process of data optimization processing of a large number of business execution results. In this way, the computational overhead of a large number of business executions and the computational overhead of data optimization processing of a large number of business execution results can be reduced from the root on the local consensus node side.

[0222] Here, the entire data processing process is explained in conjunction with the diagram. Please refer to Figure 7, which is an interactive diagram of a data processing method based on a layered chain provided by an embodiment of the present application. As shown in Figure 7, the data processing method involves a business processing node, a local consensus node in a local consensus network, a global consensus node in a global consensus network, and a second business node. Among them, the business aggregation process corresponding to the business processing node needs to be registered and reviewed in the global consensus network, and the business aggregation process is authorized after verification processing by the local consensus node when it is started.

[0223] Specifically, the second service node sends the second service to the service processing node (step S701). The service processing node aggregates and packages the N services including the second service to obtain a block to be processed, invokes the service aggregation process to execute the block to be processed, obtains the block execution result, and optimizes the block execution result to ultimately obtain the backhaul service (step S702). The specific process for obtaining the backhaul service can be found in the description of the embodiment corresponding to FIG. 4 above and will not be further described here.

[0224] Then, the business processing node can return the business execution result of the second business to the second business node (step S703), wherein the business execution result of the second business returned to the second business node can be the business execution result of the second business in the block execution result. At this time, the business execution result of the second business is the business execution result of the second business without data optimization processing. Optionally, after optimizing the block execution result, the embodiment of the present application can further return the optimized business execution result of the second business obtained by data optimization processing in the optimized block execution result (i.e., the above-mentioned block optimization result) to the second business node, or the embodiment of the present application can also return the business execution results of the second business obtained in the above two situations, which are not limited here. As shown in Figure 7, the business processing node can also send the backhaul business to the local consensus node (step S704), and the local consensus node can call the verification processing data to perform business verification on the backhaul business to obtain the business verification result (step S705). Then, the local consensus node can return the business verification result to the second business node (step S706).

[0225] Furthermore, when the summary timestamp reaches the summary time threshold, the local consensus node can summarize the business optimization summary information in the optimization information summary pool to obtain summary information (step S707), and then the local consensus node sends the summary business corresponding to the summary information to the global consensus node (step S708), and then the global consensus node can write the summary business into the global consensus chain (step S709).

[0226] Here, another data processing process is explained in conjunction with the diagram. Please refer to Figure 8, which is an interactive diagram of a data processing method based on a layered chain provided by an embodiment of the present application. As shown in Figure 8, the data processing method involves a business processing node, a local consensus node in a local consensus network, a global consensus node in a global consensus network, and a first business node. Among them, the business aggregation process corresponding to the business processing node needs to be registered and reviewed in the global consensus network, and the business aggregation process is authorized after verification processing by the local consensus node when it is started.

[0227] Specifically, the first business node sends the first business to the local consensus node (step S801), and the local consensus node forwards the first business to the business processing node (step S802). The business processing node performs business packaging processing on the N businesses including the first business to obtain a block to be processed, and calls the business summary process to execute the block to be processed, obtains the block execution result, and optimizes the block execution result to finally obtain the return business (step S803). Then the business processing node sends the return business to the local consensus node (step S804). The local consensus node can call the verification processing data to perform business verification on the return business and obtain the business verification result (step S805). Then the local consensus node returns the business verification result and the optimized business execution result of the first business to the first business node (step S806). Furthermore, when the summary timestamp reaches the summary time threshold, the local consensus node can summarize the business optimization summary information in the optimization information summary pool to obtain summary information (step S807), and then the local consensus node sends the summary business corresponding to the summary information to the global consensus node (step S808), and then the global consensus node writes the summary business into the global consensus chain (step S809).

[0228] Here, the data processing process of the entire layered chain network is described in conjunction with a scenario diagram. Please refer to Figure 9, which is a schematic diagram of the processing process flow of a layered chain network provided by an embodiment of the present application. As shown in Figure 9, in the layered chain network, business aggregation processes such as business aggregation process 1 (i.e., shown in 94a) and business aggregation process 2 (i.e., shown in 94b) are deployed based on the local consensus network. Business aggregation process 1 (i.e., shown in 94a) and business aggregation process 2 (i.e., shown in 94b) can be used to process sensitive services of different business types. Among them, the business processing node running by business aggregation process 1 can correspond to a data service network. It should be understood that the data service network may include one or more business processing nodes for processing sensitive services of the same business type; the business processing node running by business aggregation process 2 may correspond to another data service network, which may include one or more business processing nodes for processing sensitive services of another business type. This means that in the layered chain network, the business processing node corresponding to business aggregation process 1 and the business processing node corresponding to business aggregation process 2 are different nodes.

[0229] In an embodiment of the present application, a business processing node running a business aggregation process may receive sensitive business of the corresponding business type forwarded by a local consensus node (such as consensus node 91a, consensus node 91b, and consensus node 91c), or may receive sensitive business of the corresponding business type directly sent by a business SPV node (such as (business SPV node 93c), without limitation herein. It is understandable that when a business processing node running a business aggregation process receives sensitive business forwarded by a local consensus node (such as consensus node 91a, consensus node 91b, and consensus node 91c), the interaction process between each node may refer to the relevant description of FIG8 above. Optionally, when a business processing node running a business aggregation process receives sensitive business directly sent by a business SPV node (such as (business SPV node 93c), the interaction process between each node may refer to the relevant description of FIG7 above, and no further description is given here.

[0230] For ease of understanding, the business aggregation process 2 shown in Figure 9 is taken as an example. The processing process of the business aggregation process 2 can refer to the business processing process shown in 900a, wherein the specific details of the business processing process shown in 900a can refer to the relevant description of Figure 5 above, that is, the business processing node can obtain the block to be processed 941 shown in Figure 9, and then call the zero-knowledge proof execution circuit 942 to execute the block to be processed to obtain a block execution result 943a and a business execution proof 943b. The block execution result 943a can then be input into the zero-knowledge proof optimization circuit 944 to call the zero-knowledge proof optimization circuit to optimize the block execution result 943a to obtain a block optimization result and an optimization proof 945. Then, based on the block optimization result and optimization proof 945, the business execution proof 943b, the result hash of the block execution result, the business hash of each business in the N businesses, and the block header 946 of the block to be processed, the backhaul business 947 shown in Figure 9 can be constructed.

[0231] It is understandable that when it is necessary to summarize the business execution results of the business associated with the backhaul business on the local consensus subchain, the local consensus node can summarize the summary information, and then the local consensus node can send the summary business corresponding to the summary information to the global consensus network 902 through the cross-chain relay 905. Specifically, the summary business corresponding to the business summary information can be sent to the global consensus network entrance 906 through the cross-chain relay 905, and then the global consensus network entrance 906 sends the summary business to the global consensus network 902. Then the global consensus nodes in the global consensus network (such as consensus node 92a, consensus node 92b, consensus node 92c, public node 92d, etc.) can write the summary business into the global consensus chain. Among them, the data interaction process between the local consensus network 901 and the global consensus network 902 can refer to the relevant description of Figures 7 and 8 above, and will not be repeated here.

[0232] It can be understood that both business aggregation process 1 and business aggregation process 2 can be service processes that have been registered and reviewed in the global consensus network, and after the global consensus node registers and reviews the business aggregation process, it can store the zero-knowledge proof circuit corresponding to the registered and reviewed business aggregation process in the circuit processing process 907, such as the zero-knowledge proof circuit 1 (i.e., 97a) and zero-knowledge proof circuit 2 (i.e., 97b) included in the circuit processing process 907.

[0233] It can be seen that the embodiment of the present application can deploy the local consensus network in the business layer and the global consensus network in the consensus layer in the infrastructure of the layered chain network (global consensus network and local consensus network). In addition, in order to ensure the business privacy and security of certain businesses (for example, sensitive businesses) associated with the local consensus network. The embodiment of the present application proposes that a business processing node independent of the local consensus node can be deployed in the business layer of the layered chain network. The local consensus node here can be used to authorize the business processing node to start the business aggregation process when it is determined that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node. It can be understood that the business processing node involved in the embodiment of the present application can further call the business aggregation process to execute the N businesses in the block to be processed when obtaining a block to be processed containing N businesses, so as to obtain the business execution results of each business in the N businesses and the business execution certificate associated with each business. It should be noted that the business execution certificate here can be used to indicate evidence of the correct execution of each business. Then, the business processing node can call the business summary process to optimize the block execution results determined based on each business execution result in units of blocks to obtain block optimization results and optimization proofs. In this way, the business processing node can construct a return business for transmission back to the local consensus node based on all the results obtained by calling the business summary process (for example, the block optimization result, the result hash of the block execution result, the business hash of each of the businesses, the business execution proof, the optimization proof, and the block header of the block to be processed), and transmit the return business back to the local consensus node, so that the verification processing data corresponding to the business summary process can be called to perform business verification on the local consensus node to obtain the optimized business execution result of each business after data optimization processing of the business execution result. That is, the embodiment of the present application can ensure the privacy and security of business data in sensitive businesses related to local consensus nodes through data interaction between global consensus nodes, local consensus nodes and business processing nodes.

[0234] Please refer to Figure 10, which is a structural schematic diagram of a data processing device based on a hierarchical chain provided in an embodiment of the present application. As shown in Figure 10, the data processing device 1 based on a hierarchical chain can be a computer program (including program code) running on a business processing node. For example, the data processing device 1 based on a hierarchical chain is an application software. It can be understood that the data processing device 1 based on a hierarchical chain can be used to execute the corresponding steps in the data processing method based on a hierarchical chain provided in an embodiment of the present application. As shown in Figure 10, the data processing device 1 based on a hierarchical chain can include: an execution module 11, an optimization module 12, a processing module 13 and an information sending module 14;

[0235] An execution module 11 is configured to, when N services are aggregated and packaged into a block to be processed, call the service aggregation process to execute the block to be processed, and obtain a service execution result for each service and a service execution certificate associated with each service; N is a positive integer; each service refers to a sensitive service carrying sensitive data sent by a service node associated with the local consensus node; and the service execution certificate is evidence indicating that each service has been correctly executed;

[0236] The optimization module 12 is configured to determine the business execution result of each business as the block execution result of the block to be processed, call the business summary process to optimize the block execution result, and obtain a block optimization result and an optimization certificate associated with the block execution result; the optimization process refers to hiding or obfuscating the sensitive data in the business execution result of each business; the block optimization result refers to the block execution result after optimization; and the optimization certificate is evidence used to indicate that the block execution result has been optimized;

[0237] The processing module 13 is configured to obtain a return service for transmission back to the local consensus node based on the block optimization result, the result hash of the block execution result, the business hash of each business, the business execution certificate, the optimization certificate, and the block header of the block to be processed;

[0238] The information sending module 14 is used to transmit the backhaul business back to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the business summary process, performs business verification on the backhaul business, and obtains a business verification result for returning to the business node; the business verification refers to verifying and confirming that the block optimization result is correctly executed and optimized through the circuit proof in the backhaul business; the circuit proof includes the business execution proof and the optimization proof.

[0239] The execution module 11 includes: an execution circuit unit 111;

[0240] The execution circuit unit 111 is used to obtain the zero-knowledge proof execution circuit associated with the block to be processed from the zero-knowledge proof circuit corresponding to the business summary process, call the zero-knowledge proof execution circuit to execute each of the businesses in the block to be processed, and obtain N business execution results of each of the businesses and the business execution proof associated with each of the businesses.

[0241] The optimization module 12 includes: an optimization circuit unit 121;

[0242] The optimization circuit unit 121 is used to obtain a zero-knowledge proof optimization circuit associated with the block execution result from the zero-knowledge proof circuit corresponding to the business summary process, call the zero-knowledge proof optimization circuit to perform data optimization processing on the block execution result, and obtain a block optimization result and an optimization proof associated with the block optimization result.

[0243] The service node includes a first service node deployed in the hierarchical chain network; the first service node is a node in the service network of the hierarchical chain network used to send services to the local consensus node, and the service sent by the first service node to the local consensus node is a first service;

[0244] The data processing device 1 based on the hierarchical chain further includes: a service receiving module 15;

[0245] The service receiving module 15 is used to receive the first service forwarded by the local consensus node and take the first service as one of the N services; the service type of the first service is consistent with the service type of each service.

[0246] The service node includes a second service node deployed in the hierarchical chain network; the second service node is a node in the service network of the hierarchical chain network for directly sending services to the service processing node;

[0247] The service receiving module 15 is further configured to receive a second service sent by the second service node, and use the received second service as a service in the N services; the service type corresponding to the second service is consistent with the service type of each service in the N services.

[0248] The block execution result includes a business execution result of the second business; the business execution result of the second business is recorded when executing the second business in the block to be processed;

[0249] The information sending module 14 includes a result feedback unit 141;

[0250] The result feedback unit 141 is configured to return the service execution result of the second service to the second service node.

[0251] The block optimization result includes the optimized service execution result of the second service; the optimized service execution result of the second service is obtained after performing data optimization processing on the service execution result of the second service when optimizing the block execution result;

[0252] The result feedback unit 141 is further configured to return the optimized service execution result of the second service to the second service node.

[0253] The data service network corresponding to the business processing node is independent of the global consensus network and the local consensus network; the data chain corresponding to the data service network is constructed based on the business types of N businesses;

[0254] The processing module 13 is further configured to use the block to be processed as a target block for uplinking to the data chain when obtaining the block optimization result;

[0255] The processing module 13 is further used to write the target block into the data chain based on the data chain strategy indicated by the business summary process; the data chain strategy refers to a strategy of directly writing the target block into the data chain when it is confirmed that each of the businesses is correctly executed through the zero-knowledge proof circuit in the business summary process.

[0256] The data service network includes slave service nodes other than the business processing nodes; the slave service nodes are data backup nodes for performing block backup processing on the target blocks;

[0257] The processing module 13 is further configured to send the target block to the data backup node when writing the target block into the data chain, so that the data backup node performs block backup processing on the target block.

[0258] Please refer to Figure 11, which is a second structural diagram of a data processing device based on a layered chain provided in an embodiment of the present application. As shown in Figure 11, the data processing device 2 based on a layered chain can be a computer program (including program code) running on a local consensus node. For example, the data processing device 2 based on a layered chain is an application software. It can be understood that the data processing device 2 based on a layered chain can be used to execute the corresponding steps in the data processing method based on a layered chain provided in an embodiment of the present application. As shown in Figure 11, the data processing device 2 based on a layered chain can include: a receiving module 21 and a verification module 22;

[0259] The receiving module 21 is used to receive the return service sent by the business processing node, where the return service is obtained based on the block optimization result, the result hash of the block execution result, the business hash of each of the N businesses contained in the block to be processed, the business execution certificate, the optimization certificate, and the block header of the block to be processed; N is a positive integer; each of the businesses refers to a sensitive business carrying sensitive data sent by the business node associated with the local consensus node; the business execution certificate is evidence used to indicate that each of the businesses is correctly executed; the block execution result is determined based on the business execution result of each business; the business execution result and the business execution certificate of each business are obtained by the business processing node calling the business summary process to execute the block to be processed; the block optimization result and the optimization certificate are obtained by the business processing node calling the business summary process to optimize the block execution result;

[0260] The verification module 22 is used to call the verification processing data corresponding to the business aggregation process, perform business verification on the backhaul business, obtain a business verification result, and return the business verification result to the business node; the business verification refers to verifying and confirming through the circuit proof in the backhaul business that the block optimization result is obtained by correct execution and optimization processing; the circuit proof includes the business execution proof and the optimization proof.

[0261] Wherein, the service node includes a first service node deployed in the hierarchical chain network;

[0262] The receiving module 21 is further configured to receive a first service sent by the first service node, and forward the first service to the service processing node.

[0263] The block execution result includes the business execution result of the first business; the business execution result of the first business is obtained by executing the first business in the block to be processed; the block optimization result includes the optimized business execution result of the first business; the optimized business execution result of the first business is obtained after data optimization processing is performed on the business execution result of the first business;

[0264] The data processing device 2 based on the layered chain further includes an information sending module 23;

[0265] The information sending module 23 is used to determine the optimized service execution result of the first service in the backhaul service that has undergone service verification as the optimized service feedback result when obtaining the service verification result for returning to the service node, and return the optimized service feedback result to the first service node.

[0266] The verification module 22 includes: a first function calling unit 221, a second function calling unit 222 and a result determining unit 223;

[0267] A first function calling unit 221 is configured to call the first verification function in the verification processing data to perform function verification on the business hash and the business execution certificate of each business, and obtain an execution service verification result for the block execution result;

[0268] A second function calling unit 222 is configured to call a second verification function in the verification processing data to perform function verification on the result hash of the block execution result and the optimization proof, thereby obtaining an optimization service verification result for the block optimization result;

[0269] The result determination unit 223 is configured to determine that the service verification result is a verification result indicating that the backhaul service verification is successful when the execution service verification result indicates that the block execution result verification is successful and the optimization service verification result indicates that the block optimization result verification is successful.

[0270] The first function calling unit 221 is further configured to call the first verification function in the verification processing data to perform contract verification processing on the business hash and business execution proof of each business, thereby obtaining an execution service verification result for the block execution result;

[0271] The second function calling unit 222 is further configured to call the second verification function in the verification processing data to perform contract verification processing on the result hash of the block execution result and the optimization proof, thereby obtaining an optimization service verification result for the block optimization result;

[0272] The result determination unit 223 is further configured to determine the service verification result as a verification result indicating that the backhaul service verification is unsuccessful when the execution service verification result indicates that the block execution result verification is unsuccessful or the optimization service verification result indicates that the block optimization result verification is unsuccessful.

[0273] The business processing node is used to maintain the data chain, and the height confirmation block on the data chain is determined by the local consensus node after the block height of the block on the data chain is highly confirmed; the block generation timestamp of the height confirmation block is greater than the block generation timestamp of the block to be processed;

[0274] The verification module 22 further includes: a first verification result processing unit 224;

[0275] A first verification result processing unit 224 is configured to determine the block height of the block to be processed on the data chain indicated by the block header of the block to be processed, and use the block height of the block to be processed as the height to be confirmed;

[0276] The first verification result processing unit 224 is further configured to obtain a maximum block confirmation height from the block height of the height confirmation block, update the maximum block confirmation height based on the height to be confirmed, and use a block corresponding to a confirmation height between the maximum block confirmation height before the update and the maximum block confirmation height after the update as a height confirmed block, and update the height confirmed block based on the height confirmed block.

[0277] The verification module 22 further includes: a second verification result processing unit 225;

[0278] The second verification result processing unit 225 is configured to notify the service processing node to regenerate the backhaul service when the service verification result indicates that the backhaul service verification is unsuccessful.

[0279] The data processing device 2 based on the hierarchical chain includes: an information aggregation module 24; the information aggregation module 24 includes: an aggregation unit 241, and an aggregation information sending unit 242;

[0280] A summarizing unit 241 is configured to determine service optimization summary information associated with each service based on the service verification result;

[0281] The summarizing unit 241 is further configured to add the service optimization summary information associated with each of the services to the optimization information summary pool, and obtain a summary timestamp for summarizing the service optimization summary information in the optimization information summary pool;

[0282] The summarizing unit 241 is further configured to summarize the service optimization summary information in the optimization information summary pool when the summary timestamp reaches a summary time threshold, to obtain summary information associated with each of the services;

[0283] The summary information sending unit 242 is used to send the summary business corresponding to the summary information to the global consensus node in the global consensus network through the cross-chain relay associated with the local consensus node, so that the global consensus node uploads the summary business to the global consensus chain maintained by the global consensus node.

[0284] The verification module 22 includes: a service verification unit 226;

[0285] The service verification unit 226 is configured to, upon receiving the startup service for the service aggregation process sent by the service processing node, call the process verification processing data deployed on the local consensus subchain to perform verification processing on the service aggregation process and obtain a verification processing result;

[0286] The service verification unit 226 is further used to deploy the verification processing data corresponding to the business aggregation process on the local consensus subchain if the verification processing result indicates that the business aggregation process is a registered aggregation process after registration review in the global consensus network, and authorize the business processing node to start the business aggregation process.

[0287] The service verification unit 226 is further configured to receive the aggregated service registration information after the global consensus node performs registration review on the business aggregation process; the aggregated service registration information includes the service identifier of the business aggregation process and the circuit summary information of the zero-knowledge proof circuit corresponding to the business aggregation process;

[0288] The service verification unit 226 is further configured to write the aggregated service registration information into the process verification processing data.

[0289] Please refer to Figure 12, which is a structural diagram of a computer device provided in an embodiment of the present application. As shown in Figure 12, the computer device 1000 may include: a processor 1001, a network interface 1004 and a memory 1005. In addition, the above-mentioned computer device 1000 may also include: a user interface 1003, and at least one communication bus 1002. Among them, the communication bus 1002 is used to realize the connection and communication between these components. Among them, the user interface 1003 may include a display screen (Display), a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (non-volatile memory), such as at least one disk storage. The memory 1005 may also be at least one storage device located away from the aforementioned processor 1001. As shown in Figure 12, the memory 1005 as a computer-readable storage medium may include an operating system, a network communication module, a user interface module and a device control application.

[0290] In the computer device 1000 shown in FIG12 , the network interface 1004 can provide network communication functions; the user interface 1003 is primarily used to provide an interface for user input; and the processor 1001 can be used to call the device control application stored in the memory 1005 to execute the description of the data processing method in any of the corresponding embodiments above, which will not be repeated here. In addition, the description of the beneficial effects of using the same method will not be repeated here.

[0291] In addition, it should be pointed out here that: the embodiment of the present application also provides a computer-readable storage medium, and the computer-readable storage medium stores the computer program executed by the aforementioned hierarchical chain-based data processing device 1 and the hierarchical chain-based data processing device 2, and the computer program includes program instructions. When the processor executes the program instructions, it can execute the description of the hierarchical chain-based data processing method in the above embodiment, so it will not be repeated here. In addition, the description of the beneficial effects of using the same method will not be repeated. For technical details not disclosed in the computer-readable storage medium embodiment involved in this application, please refer to the description of the method embodiment of this application.

[0292] The computer-readable storage medium may be the data processing device based on the hierarchical chain provided in any of the aforementioned embodiments or the internal storage unit of the computer device, such as the hard disk or memory of the computer device. The computer-readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the computer device. Furthermore, the computer-readable storage medium may also include both the internal storage unit of the computer device and an external storage device. The computer-readable storage medium is used to store the computer program and other programs and data required by the computer device. The computer-readable storage medium may also be used to temporarily store data that has been output or is to be output.

[0293] In addition, it should be noted that the embodiments of the present application also provide a computer program product or computer program, which includes computer instructions stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the method provided by any of the corresponding embodiments above. In addition, the description of the beneficial effects of using the same method will not be repeated. For technical details not disclosed in the computer program product or computer program embodiments involved in this application, please refer to the description of the method embodiments of this application.

[0294] 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, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. 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 to be beyond the scope of this application.

[0295] The above disclosure is only a preferred embodiment of the present application, and certainly cannot be used to limit the scope of rights of the present application. Therefore, equivalent changes made according to the claims of the present application are still within the scope covered by the present application.

Claims

1. A data processing method based on hierarchical chain, characterized in that: The hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer, wherein the business layer is deployed with local consensus nodes and business processing nodes; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when determining that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; The method is performed by the service processing node; The method comprises: When N services are aggregated and packaged into a block to be processed, the service aggregation process is called to execute the block to be processed, and the service execution result of each service and the service execution proof associated with each service are obtained; N is a positive integer; each service refers to a sensitive service carrying sensitive data sent by a service node associated with the local consensus node; the service execution proof is evidence used to indicate that each service is correctly executed; Determine the business execution result of each of the businesses as the block execution result of the block to be processed, call the business summary process to optimize the block execution result, and obtain a block optimization result and an optimization certificate associated with the block execution result; the optimization process refers to hiding or blurring the sensitive data in the business execution result of each of the businesses; the block optimization result refers to the block execution result after optimization processing; and the optimization certificate is evidence for indicating that the block execution result is optimized; Based on the block optimization result, the result hash of the block execution result, the business hash of each of the businesses, the business execution proof, the optimization proof, and the block header of the block to be processed, a return business for returning to the local consensus node is obtained; The return service is returned to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the service summary process, performs service verification on the return service, and obtains a service verification result for returning to the service node; the service verification refers to verifying and confirming through the circuit proof in the return service that the block optimization result is obtained by correct execution and optimization processing; the circuit proof includes the service execution proof and the optimization proof.

2. The method according to claim 1, characterized in that The calling of the business summary process to execute the N businesses in the to-be-processed block, and obtaining N business execution results corresponding to the N businesses and business execution certificates associated with the N businesses, includes: From the zero-knowledge proof circuit corresponding to the business aggregation process, obtain the zero-knowledge proof execution circuit associated with the block to be processed, call the zero-knowledge proof execution circuit to execute each of the businesses in the block to be processed, and obtain N business execution results of each of the businesses and the business execution proof associated with each of the businesses.

3. The method according to claims 1-2, characterized in that: The calling of the business summary process to perform data optimization processing on the block execution result to obtain the block optimization result and the optimization certificate associated with the block optimization result includes: A zero-knowledge proof optimization circuit associated with the block execution result is obtained from the zero-knowledge proof circuit corresponding to the business aggregation process, and the zero-knowledge proof optimization circuit is called to perform data optimization processing on the block execution result to obtain a block optimization result and an optimization proof associated with the block optimization result.

4. The method according to claims 1-3, characterized in that: The service node includes a first service node deployed in the hierarchical chain network; the first service node is a node in the service network of the hierarchical chain network used to send services to the local consensus node, and the service sent by the first service node to the local consensus node is a first service; The method further comprises: Receive the first business forwarded by the local consensus node, and use the first business as a business among the N businesses; the business type of the first business is consistent with the business type of each of the businesses.

5. The method according to claims 1-3, characterized in that: The service node includes a second service node deployed in the hierarchical chain network; the second service node is a node in the service network of the hierarchical chain network used to directly send services to the service processing node; The method further comprises: A second service sent by the second service node is received, and the received second service is used as a service in the N services; a service type corresponding to the second service is consistent with a service type of each service in the N services.

6. The method according to claim 5, characterized in that The block execution result includes a business execution result of the second business; the business execution result of the second business is recorded when the second business in the block to be processed is executed; The method further comprises: Return the service execution result of the second service to the second service node.

7. The method according to claim 6, characterized in that The block optimization result includes the optimized service execution result of the second service; the optimized service execution result of the second service is obtained after data optimization processing is performed on the service execution result of the second service when the block execution result is optimized; The method further comprises: Return the optimized service execution result of the second service to the second service node.

8. The method according to any one of claims 1 to 7, characterized in that: The data service network corresponding to the business processing node is independent of the global consensus network and the local consensus network; the data chain corresponding to the data service network is constructed based on the business types of N businesses; The method further comprises: When the block optimization result is obtained, the block to be processed is used as a target block for uplinking to the data chain; The target block is written into the data chain based on the data chain strategy indicated by the business summary process; the data chain strategy refers to a strategy of directly writing the target block into the data chain when each of the businesses is confirmed to be correctly executed through the zero-knowledge proof circuit in the business summary process.

9. The method according to claim 8, characterized in that The data service network includes a slave service node other than the business processing node; the slave service node is a data backup node for performing block backup processing on the target block; The method further comprises: When the target block is written into the data chain, the target block is sent to the data backup node, so that the data backup node performs block backup processing on the target block.

10. A data processing method based on hierarchical chain, characterized in that: The hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer, wherein the business layer is deployed with local consensus nodes and business processing nodes; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when determining that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; The method is performed by the local consensus node, and the method includes: Receive the return service sent by the service processing node, the return service is obtained based on the block optimization result, the result hash of the block execution result, the business hash of each of the N services contained in the block to be processed, the business execution proof, the optimization proof, and the block header of the block to be processed; N is a positive integer; each of the services refers to a sensitive service carrying sensitive data sent by a service node associated with the local consensus node; the business execution proof is evidence used to indicate that each of the services is correctly executed; the block execution result is determined based on the business execution result of each of the services; the business execution result and the business execution proof of each of the services are obtained by the business processing node calling the business summary process to execute the block to be processed; the block optimization result and the optimization proof are obtained by the business processing node calling the business summary process to optimize the block execution result; Call the verification processing data corresponding to the business aggregation process, perform business verification on the backhaul business, obtain a business verification result, and return the business verification result to the business node; the business verification refers to verifying and confirming through the circuit proof in the backhaul business that the block optimization result is obtained by correct execution and optimization processing; the circuit proof includes the business execution proof and the optimization proof.

11. The method according to claim 10, characterized in that The service node includes a first service node deployed in the hierarchical chain network; the method further includes: Receive a first service sent by the first service node, and forward the first service to the service processing node.

12. The method according to claim 11, characterized in that The block execution result includes the business execution result of the first business; the business execution result of the first business is obtained by executing the first business in the block to be processed; the block optimization result includes the optimized business execution result of the first business; The optimized service execution result of the first service is obtained after data optimization processing is performed on the service execution result of the first service; The method further comprises: When the service verification result for returning to the service node is obtained, the optimized service execution result of the first service in the backhaul service that has undergone service verification is determined as the optimized service feedback result, and the optimized service feedback result is returned to the first service node.

13. The method according to any one of claims 10 to 12, characterized in that: The calling of the verification processing data corresponding to the business aggregation process, performing business verification on the return business, and obtaining a business verification result includes: Calling the first verification function in the verification processing data to perform function verification on the business hash and the business execution proof of each of the businesses, and obtaining an execution service verification result for the block execution result; Calling the second verification function in the verification processing data to perform function verification on the result hash of the block execution result and the optimization proof to obtain an optimization service verification result for the block optimization result; When the execution service verification result indicates that the block execution result verification is successful, and the optimization service verification result indicates that the block optimization result verification is successful, the business verification result is determined to be a verification result indicating that the return business verification is successful.

14. The method according to any one of claims 10 to 13, characterized in that: The business processing node is used to maintain the data chain, and the height confirmation block on the data chain is determined by the local consensus node after highly confirming the block height of the block on the data chain; The block generation timestamp of the highly confirmed block is greater than the block generation timestamp of the block to be processed; The method further comprises: Determine the block height of the block to be processed on the data chain indicated by the block header of the block to be processed, and use the block height of the block to be processed as the height to be confirmed; The maximum block confirmation height is obtained from the block height of the height confirmation block, and the maximum block confirmation height is updated based on the height to be confirmed, and the block corresponding to the confirmation height between the maximum block confirmation height before the update and the maximum block confirmation height after the update is used as the height confirmed block, and the height confirmation block is updated based on the height confirmed block.

15. The method according to any one of claims 10 to 14, characterized in that: The method further comprises: Based on the business verification results, determining business optimization summary information associated with each of the businesses; Adding the service optimization summary information associated with each of the services to an optimization information summary pool, and obtaining a summary timestamp for summarizing the service optimization summary information in the optimization information summary pool; When the summary timestamp reaches the summary time threshold, summarizing the service optimization summary information in the optimization information summary pool to obtain summary information associated with each of the services; The summary business corresponding to the summary information is sent to the global consensus node in the global consensus network through the cross-chain relay associated with the local consensus node, so that the global consensus node links the summary business to the global consensus chain maintained by the global consensus node.

16. The method according to any one of claims 10 to 15, characterized in that: The method further comprises: Upon receiving the startup service for the service aggregation process sent by the service processing node, calling the process verification processing data deployed on the local consensus subchain to perform verification processing on the service aggregation process to obtain a verification processing result; If the verification processing result indicates that the business summary process is a registered summary process after registration review in the global consensus network, the verification processing data corresponding to the business summary process is deployed on the local consensus subchain, and the business processing node is authorized to start the business summary process.

17. The method according to claim 16, characterized in that Before calling the process verification processing data deployed on the local consensus subchain to verify the business summary process, the method further includes: Receive the aggregate service registration information after the global consensus node performs registration review on the business aggregation process; the aggregate service registration information includes the service identifier of the business aggregation process and the circuit summary information of the zero-knowledge proof circuit corresponding to the business aggregation process; The aggregate service registration information is written into the process verification processing data.

18. A data processing device based on a hierarchical chain, characterized in that: The hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer, wherein the business layer is deployed with local consensus nodes and business processing nodes; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when determining that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; The device runs on a service processing node; the device comprises: An execution module is used to call the business summary process to execute the block to be processed when N businesses are aggregated and packaged into the block to be processed, and obtain the business execution result of each business and the business execution proof associated with each business; N is a positive integer; each business refers to a sensitive business carrying sensitive data sent by a business node associated with the local consensus node; the business execution proof is evidence used to indicate that each business is correctly executed; An optimization module, used to determine the business execution result of each of the businesses as the block execution result of the block to be processed, call the business summary process to optimize the block execution result, and obtain the block optimization result and the optimization certificate associated with the block execution result; the optimization process refers to hiding or blurring the sensitive data in the business execution result of each of the businesses; the block optimization result refers to the block execution result after optimization processing; the optimization certificate is evidence used to indicate that the block execution result is optimized; A processing module, configured to obtain a return service for transmission back to the local consensus node based on a block optimization result, a result hash of the block execution result, a business hash of each of the businesses, the business execution proof, the optimization proof, and a block header of the block to be processed; An information sending module is used to transmit the backhaul service back to the local consensus node, so that the local consensus node calls the verification processing data corresponding to the service aggregation process, performs service verification on the backhaul service, and obtains a service verification result for returning to the service node; the service verification refers to verifying and confirming through the circuit proof in the backhaul service that the block optimization result is obtained by correct execution and optimization processing; the circuit proof includes the service execution proof and the optimization proof.

19. A data processing device based on a hierarchical chain, characterized in that: The hierarchical chain network corresponding to the hierarchical chain includes a local consensus network deployed in the business layer and a global consensus network deployed in the consensus layer, wherein the business layer is deployed with local consensus nodes and business processing nodes; the local consensus nodes are consensus nodes in the local consensus network, and the global consensus nodes deployed in the consensus layer are consensus nodes in the global consensus network; the local consensus nodes are used to authorize the business processing nodes to start the business aggregation process when determining that the business aggregation process in the business processing node has been registered and reviewed on the global consensus node; The device runs on the local consensus node, and the device includes: A receiving module, used for receiving a return service sent by the service processing node, wherein the return service is obtained based on the block optimization result, the result hash of the block execution result, the business hash of each of the N services contained in the block to be processed, the business execution proof, the optimization proof, and the block header of the block to be processed; N is a positive integer; each of the services refers to a sensitive service carrying sensitive data sent by a service node associated with the local consensus node; the business execution proof is evidence used to indicate that each of the services is correctly executed; the block execution result is determined based on the business execution result of each of the services; the business execution result and the business execution proof of each of the services are obtained by the business processing node calling the business summary process to execute the block to be processed; the block optimization result and the optimization proof are obtained by the business processing node calling the business summary process to optimize the block execution result; A verification module is used to call the verification processing data corresponding to the business aggregation process, perform business verification on the backhaul business, obtain a business verification result, and return the business verification result to the business node; the business verification refers to verifying and confirming through the circuit proof in the backhaul business that the block optimization result is obtained by correct execution and optimization processing; the circuit proof includes the business execution proof and the optimization proof.

20. A computer device, characterized in that: including memory and processor; The memory is connected to the processor, the memory is used to store a computer program, and the processor is used to call the computer program so that the computer device executes the method according to any one of claims 1 to 17.

21. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is suitable for being loaded and executed by a processor, so that a computer device having the processor executes the method according to any one of claims 1 to 17.

22. [Corrected 01.12.2023 in accordance with Rule 91] A computer program product, characterized in that The method comprises a computer program / instruction, which implements the method according to any one of claims 1 to 17 when executed by a processor.

Images