Data processing method and device of blockchain network, computer device and medium

Abstract

The application discloses a data processing method and device of a blockchain network, computer equipment and a medium. The method comprises the following steps: the blockchain network comprises N service nodes which are mapped into a same ring-shaped hash space, any service node has a node mapping position in the ring-shaped hash space, the blockchain network provides service systems with service, M service systems are mapped into the ring-shaped hash space, any service system has a system mapping position in the ring-shaped hash space, a first service node of the N service nodes determines a first service system which the first service node is responsible for pushing; the first service system comprises one or more service systems which are adjacent to the node mapping position of the first service node; the first service node acquires first service data to be pushed to the first service system, and pushes the first service data to the first service system. By using the application, the stability of the data pushing service of the blockchain network can be improved.

Description

Technical Field

[0001] This application relates to the field of blockchain technology, and in particular to a data processing method, apparatus, computer equipment, and medium for a blockchain network. Background Technology

[0002] Blockchain is a new application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanisms, and encryption algorithms. Essentially, a blockchain is a decentralized database, a chain of data blocks linked together using cryptographic methods. Each data block contains information about a batch of network transactions, used to verify the validity of the information (anti-counterfeiting) and to generate the next block.

[0003] In the blockchain network, business nodes can provide data push services to business systems. Since there are usually several business nodes and several business systems, accurately determining the push correspondence between business nodes and business systems has become an urgent problem to be solved. Summary of the Invention

[0004] This application provides a data processing method, apparatus, computer equipment, and medium for a blockchain network, which can improve the stability of data push services in a blockchain network.

[0005] This application provides a data processing method for a blockchain network. The blockchain network comprises N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space, and each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space, and each business system has a system mapping position in the ring hash space. This method is applied to the first business node among the N business nodes, and the method includes:

[0006] Identify the first business system that the first business node is responsible for pushing; the first business system includes one or more business systems among M business systems whose system mapping position is adjacent to the node mapping position of the first business node;

[0007] Obtain the first business data generated in the blockchain network that is to be pushed to the first business system;

[0008] Push the first business data to the first business system.

[0009] This application provides a data processing device for a blockchain network. The blockchain network includes N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space, and each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space, and each business system has a system mapping position in the ring hash space. This device is applied to the first business node among the N business nodes. The device includes:

[0010] The determination module is used to determine the first business system that the first business node is responsible for pushing; the first business system includes one or more business systems among M business systems whose system mapping position is adjacent to the node mapping position of the first business node;

[0011] The acquisition module is used to acquire the first business data generated in the blockchain network that is to be pushed to the first business system.

[0012] The push module is used to push the first business data to the first business system.

[0013] Optionally, the blockchain network includes consensus nodes; the above-mentioned device is also used for:

[0014] Send a push registration request to the consensus node so that the consensus node can generate a data push credential for the first business node after successfully verifying the node identity of the first business node based on the push registration request.

[0015] Obtain the data push credential returned by the consensus node; the data push credential is used to indicate that the first business node has the data push permission for the business system.

[0016] Optionally, the push module may push the first business data to the first business system in the following ways:

[0017] The data push credentials and the first business data are pushed to the first business system so that the first business system can receive the first business data pushed by the first business system after the data push credentials are verified.

[0018] Optionally, the blockchain network includes consensus nodes. N business nodes are mapped to a ring hash space based on their respective node hash values. The node hash value of any business node is obtained by hashing the node domain name of that business node.

[0019] M business systems are mapped to a ring hash space based on their system hash values. The system hash value of any business system is obtained by hashing the business identifier of that business system. The business identifier is assigned to the business system by the consensus node when the business system registers the data push service with the consensus node.

[0020] Optionally, the blockchain network includes consensus nodes; the acquisition module acquires the first business data generated in the blockchain network to be pushed to the first business system in the following ways:

[0021] Synchronize newly added business data belonging to the first business system in the blockchain network from the consensus node;

[0022] The business data of the first business system that is synchronized is used as the first business data.

[0023] Optionally, the push module may push the first business data to the first business system in the following ways:

[0024] Obtain the system address of the first business system, and establish a communication connection with the first business system based on the system address;

[0025] Based on the communication connection with the first business system, the first business data is pushed to the first business system.

[0026] Optionally, the push module may push the first business data to the first business system in the following ways:

[0027] Push the first business data and the target node address to the first business system;

[0028] The target node address refers to the node address of the second business node. The node mapping position adjacent to the node mapping position of the first business node in the clockwise direction of the ring hash space is the node address of the second business node. The first business system is used to instruct the second business node to push the first business data to the first business system according to the target node address when it fails to obtain the first business data pushed by the first business node.

[0029] Optionally, the M business systems include a third business node. The node mapping position adjacent to the node mapping position of the third business node in the clockwise direction of the ring hash space is the node mapping position of the first business node. The third business node is used to provide business services to the second business system in the M business systems. The node mapping position adjacent to the system mapping position of the second business system in the clockwise direction of the ring hash space is the node mapping position of the third business node. The first business node and the third business node maintain a continuous connection.

[0030] The above-mentioned device is also used for:

[0031] If the first business node fails to connect to the third business node, then the second business data generated in the blockchain network and to be pushed to the second business system is obtained.

[0032] Push the second business data to the second business system.

[0033] Optionally, the N business nodes include a fourth business node, which is not the same business node as the first business node. During the process of the first business system receiving the first business data pushed by the first business node, if the first business system detects a push behavior for business data initiated by the fourth business node, the first business system will reject the push behavior initiated by the fourth business node.

[0034] Optionally, the acquisition module may acquire the first business data generated in the blockchain network that is to be pushed to the first business system in the following ways:

[0035] Obtain block transaction data generated by the first business system in the blockchain network;

[0036] Extract the invoice data from the first business system from the block transaction data, and use the invoice data as the first business data.

[0037] This application provides a computer device, including a memory and a processor. The memory stores a computer program, and when the computer program is executed by the processor, the processor performs the method of this application.

[0038] This application provides a computer-readable storage medium storing a computer program, the computer program including program instructions that, when executed by a processor, cause the processor to perform the method described above.

[0039] According to one aspect of this application, a computer program product or computer program is provided, comprising 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 methods provided in the various alternative embodiments described above.

[0040] In this application, the blockchain network can contain N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space, and each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space, and each business system has a system mapping position in the ring hash space. The first business node among the N business nodes can determine the first business system that the first business node is responsible for pushing. The first business system includes one or more business systems among the M business systems whose system mapping position is adjacent to the node mapping position of the first business node. The first business node can also obtain the first business data generated in the blockchain network that is to be pushed to the first business system, and can push the first business data to the first business system. Therefore, the method proposed in this application maps business systems and business nodes to the same ring hash space. Based on the mapping position of each business system and each business node in the ring hash space, the business system responsible for data push by each business node can be determined. This can ensure the correct correspondence between each business node and the business system responsible for push. At the same time, by pushing data to different business systems through different business nodes, the task of data push service can also be distributed, thereby improving the stability of data push service. Attached Figure Description

[0041] To more clearly illustrate the technical solutions in this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0042] Figure 1 This is a schematic diagram of a network architecture for business processing provided in this application;

[0043] Figure 2 This is a schematic diagram illustrating a data push scenario provided in this application;

[0044] Figure 3 This is a flowchart illustrating a data processing method for a blockchain network provided in this application;

[0045] Figure 4 This is a schematic diagram of a hash mapping scenario provided in this application;

[0046] Figure 5 This is a schematic diagram illustrating a scenario for determining a second business node provided in this application;

[0047] Figure 6This is a schematic diagram illustrating a scenario for determining a third business node, as provided in this application.

[0048] Figure 7 This is a schematic diagram illustrating a data push scenario provided in this application;

[0049] Figure 8 This is a schematic diagram of a data interaction scenario provided in this application;

[0050] Figure 9 This is a schematic diagram of the structure of a data processing device for a blockchain network provided in this application;

[0051] Figure 10 This is a schematic diagram of the structure of a computer device provided in this application. Detailed Implementation

[0052] The technical solutions of this application will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0053] This application relates to blockchain-related technologies. Blockchain is a novel application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanisms, and cryptographic algorithms. Essentially, a blockchain is a decentralized database, a chain of data blocks linked using cryptographic methods. Each data block contains information about a batch of network transactions, used to verify the validity of the information (anti-counterfeiting) and generate the next block. A blockchain can include an underlying blockchain platform, a platform product service layer, and an application service layer. A blockchain consists of a series of blocks sequentially generated in chronological order. Once a new block is added to the blockchain, it cannot be removed. Each block records the data submitted by nodes in the blockchain system. The blockchain technology involved in this application primarily refers to how to provide data push services to business systems through business nodes in a blockchain network.

[0054] This application also relates to cloud technology. Cloud technology refers to a managed technology that unifies a series of resources such as hardware, software, and networks within a wide area network or local area network to realize the computing, storage, processing, and sharing of data.

[0055] Cloud technology is a collective term for network technology, information technology, integration technology, management platform technology, and application technology applied to the cloud computing business model. It can form resource pools, providing flexible and convenient on-demand access. Cloud computing technology will become a crucial support. Backend services of technical network systems require substantial computing and storage resources, such as video websites, image websites, and many portal websites. With the rapid development and application of the internet industry, every item may have its own identification mark in the future, requiring transmission to backend systems for logical processing. Data at different levels will be processed separately, and various industry data will all require robust system support, which can only be achieved through cloud computing.

[0056] The cloud technology involved in this application mainly refers to the data interaction between business nodes and business systems via the "cloud".

[0057] Please see Figure 1 , Figure 1 This is a schematic diagram of a network architecture for service processing provided in this application. For example... Figure 1 As shown, this network architecture can include a business network and a consensus network. The business network can include multiple business nodes, and the consensus network can include multiple consensus nodes. These two networks constitute a layered blockchain network, meaning they are not in the same network environment to protect the security of the consensus network. This network architecture can also include several business systems that can interact with the business nodes in the business network.

[0058] Both business nodes and consensus nodes can consist of one or more servers. These servers can be independent physical servers, server clusters or distributed systems composed of multiple physical servers, or cloud servers providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The business system can reside in terminal devices, which can be smart terminals such as smartphones, tablets, laptops, desktop computers, smart TVs, and in-vehicle terminals.

[0059] Please see also Figure 2 , Figure 2 This is a schematic diagram illustrating a data push scenario provided in this application. For example... Figure 2 As shown, in this application, each business system (including business system 1 to business system 4) and each business node (including business node 1 to business node 3) can be mapped to a ring hash space, which can be composed of 0 to 2. 32The ring hash space, composed of hash values ​​of -1, contains corresponding mapping positions for each business node and each business system. The mapping position of a business system in the ring hash space can be called the system mapping position, and the mapping position of a business node in the ring hash space can be called the node mapping position.

[0060] Optionally, the business system responsible for pushing data to each business node can be determined according to the clockwise direction in the ring hash space. For example, to first determine the business node responsible for pushing data to business system 1, the system mapping position of business system 1 can be moved clockwise in the ring hash space, and the first business node moved to is taken as the business node responsible for pushing data to business system 1. Here, the business node responsible for pushing data to business system 1 is business node 1. Starting from the system mapping position of business system 1, the node mapping position adjacent to the system mapping position of business system 1 in the clockwise direction in the ring hash space is the node mapping position of business node 1.

[0061] Next, the business node responsible for pushing data to business system 2 is determined. This can be done by moving the system mapping position of business system 2 clockwise within the ring hash space. The first business node moved to this position is designated as the business node responsible for pushing data to business system 2. Here, business node 2 is the business node responsible for pushing data to business system 2. Starting from the system mapping position of business system 2, the node mapping position adjacent to the system mapping position of business system 2 in the clockwise direction within the ring hash space is the node mapping position of business node 2.

[0062] Next, the business node responsible for pushing data to business system 3 is determined. This can be done by moving the system mapping position of business system 3 clockwise within the ring hash space. The first business node moved to this position is designated as the business node responsible for pushing data to business system 3. Here, business node 2 is responsible for pushing data to business system 3. Starting from the system mapping position of business system 3, the node mapping position adjacent to the system mapping position of business system 3 in the clockwise direction within the ring hash space is the node mapping position of business node 2.

[0063] Similarly, to determine the business node responsible for pushing data to business system 4, the system mapping position of business system 4 can be moved clockwise within the ring hash space. The first business node moved to this position is designated as the business node responsible for pushing data to business system 4. Here, business node 3 is responsible for pushing data to business system 4. Starting from the system mapping position of business system 4, the node mapping position adjacent to the system mapping position of business system 4 in the clockwise direction of the ring hash space is the node mapping position of business node 3.

[0064] Therefore, based on the above description, it can be determined that the business system pushed by business node 1 includes business system 1, the business systems pushed by business node 2 include business system 2 and business system 3, and the business system pushed by business node 3 includes business system 4. The business data pushed by the business nodes to the business systems can be business data that has passed consensus provided by consensus nodes in the consensus network.

[0065] By using the method provided in this application, both business nodes and business systems can be mapped to a consistent hash space (i.e., the aforementioned ring hash space), which can ensure an accurate correspondence between business nodes and the business systems they are responsible for pushing data. This also makes it easier to add or remove business nodes that push data, thus improving the fault tolerance of the system.

[0066] Please see Figure 3 , Figure 3 This is a flowchart illustrating a data processing method for a blockchain network provided in this application. Figure 3 As shown, the method may include:

[0067] Step S101: Determine the first business system that the first business node is responsible for pushing; the first business system includes one or more business systems among M business systems whose system mapping position is adjacent to the node mapping position of the first business node.

[0068] Optionally, the blockchain network in this application may include N business nodes, where N is a positive integer, and the specific value of N is determined according to the actual application scenario. Any business node may consist of one or more computer devices, which may be servers or terminal devices.

[0069] These N business nodes are mapped to the same ring hash space, which can be a hash space with a hash range of 0 to 2. 32The hash range of this ring hash space, which is a space of -1, can also be determined to other ranges according to the actual application scenario. There are no restrictions on this range. This ring hash space can also be called a consistent hash space. Each business node has a corresponding mapping position in this ring hash space, and the mapping position of the business node in the ring hash space can be called the node mapping position.

[0070] Optionally, each business node can be mapped to the ring hash space using its domain name (which can be called the node domain name). This process can be as follows: First, a hash algorithm for mapping can be obtained. The range of hash values ​​obtained by the hash algorithm constitutes the spatial range of the ring hash space. That is, the hash algorithm can be set according to the actual required spatial range of the ring hash space.

[0071] Any one of the N business nodes mentioned above can be represented as the first business node. Here, we take mapping any business node (such as the first business node) to the ring hash space as an example. The node domain name of the first business node can be hashed using the hash algorithm mentioned above to obtain a hash value of the node domain name of the first business node. This hash value can be called the node hash value of the first business node. Then, the first business node can be mapped to the ring hash space through the node hash value of the first business node. The node mapping position of the first business node is the position indicated by the node hash value of the first business node in the ring hash space.

[0072] Through the above process, the node hash value corresponding to each business node can be obtained, and then each business node can be mapped to the ring hash space through the node hash value corresponding to each business node.

[0073] Optionally, the aforementioned blockchain network also includes consensus nodes. The number of consensus nodes is determined based on the actual application scenario and is not limited. Each consensus node may include a data push contract (a type of smart contract). The consensus node can maintain this data push contract, which instructs business nodes on how to push business data to the business system.

[0074] First, each business node can register a data push contract with the consensus node, that is, register as a business node that can push data to the business system. Therefore, the process of mapping each business node to the ring hash space can also be as follows: Taking the mapping of the first business node to the ring hash space as an example, the first business node can send a push registration request to the consensus node. After receiving the push registration request, the consensus node can determine the request object (i.e., the first business node) based on the push registration request. Then, the consensus node can verify the node identity of the first business node, such as verifying whether the node identity of the first business node is legitimate and whether the first business node can push data. If the identity verification of the first business node is successful (such as verifying that the node identity of the first business node is legitimate and that the first business node can be used as a data push node), the consensus node can generate a data push credential for the first business node. This data push credential is used to indicate that the first business node has the data push permission to the business system.

[0075] The aforementioned data push credentials may include a token (which proves that the first business node has been registered, may have a limited period, and may be generated by the first business node's private key) and a signature of the management private key (the private key in the contract, used to authenticate the registered business node) in the contract (i.e., the data push contract) (i.e., the signature of the contract authentication, which can be called the contract signature).

[0076] The consensus node can return the generated data push credential to the first business node, which can then use the credential to push data to the business system.

[0077] After each business node registers its data push contract with the consensus node as described above, each business node can synchronize the node information of all registered business nodes (such as the N business nodes mentioned above) from the consensus node. This node information can include the node domain name of each business node. Therefore, each business node knows which business nodes need to be mapped to the ring hash space (i.e., the business nodes that can push data). Thus, each business node can construct a consistent hash structure based on the node information pulled from the consensus node (such as mapping each business node to the ring hash space based on its node domain name as described above). This consistent hash structure is the structure formed by each business node in the ring hash space after all business nodes are mapped to the ring hash space (it can also be understood as the distribution structure between business nodes).

[0078] The aforementioned blockchain network can provide business services to M business systems. These business services can be data push services, where M is a positive integer. The specific value of M can be determined based on the actual application scenario and is not restricted. These M business systems can also be mapped to the aforementioned ring hash space. Each business system has a corresponding mapping position in this ring hash space, which can be referred to as the system mapping position.

[0079] In this context, the business system can be understood as the front-end client that needs to obtain business data, while the blockchain network can be understood as the back-end network of the business system. For example, the business system can be the system of an enterprise.

[0080] The process of mapping each business system to the ring hash space can include: Similarly, each business system can register for data push service with the data push contract in the consensus node (e.g., the business system can also send a registration request to the consensus node), and provide its own callback address (i.e., the system address, which is used to receive the business data pushed on the chain after the business system has successfully registered; the system address can be the external address of the business system).

[0081] Furthermore, after the consensus node successfully authenticates the requested business system (e.g., verifies the system's legitimacy and that it belongs to a business system that can push business data), it can assign a business identifier to the requested business system. This business identifier can be a unique business number assigned to the business system, and a business system can have one business number. After authenticating the requested business system, the consensus node can also return an on-chain callback commitment to the requested business system. This on-chain callback commitment can be understood as a credential of successful business system registration.

[0082] In addition, business systems can also implement their own callback interfaces according to the interface specifications for subsequent on-chain data pushes (such as the specifications indicated by the on-chain interface format data protocol). This ensures that the callback interface can receive data according to the specifications indicated by the interface format data protocol. The callback interface is the interface used to receive the pushed business data.

[0083] Subsequently, each business system can be mapped to the aforementioned ring hash space by assigning a business number to each system. For example, each registered business node (such as the N business nodes mentioned above) can synchronize the business identifier and system address of each registered business system to the consensus node. Then, the aforementioned hash algorithm can be used to perform hash operations on the business identifiers of each business system, resulting in a hash value for each system's business identifier. This hash value can be called the system hash value. Each business system can correspond to one system hash value. Each business node can then map each business system to the ring hash space using its respective system hash value. The system mapping position of each business system in the ring hash space is the position indicated by the corresponding system hash value within that ring hash space.

[0084] Therefore, it is understood that this application can maintain the registration of data push services (such as the registration of business systems and business nodes) and the allocation of execution nodes (such as the N business nodes that can provide data push services as mentioned above) through the core network (i.e., the consensus network, which contains consensus nodes).

[0085] Through the above process, N business nodes and M business systems are mapped to the same ring hash space, and each business node knows its mapping position within the ring hash space. Furthermore, by using the mapping positions of each business node and each business system in the ring hash space, it can be determined which business systems each business node is responsible for pushing business data to, as described below.

[0086] First, the business system responsible for pushing data to each business node can be determined by following a clockwise direction within the ring hash space. For example, starting from the system mapping position of each business system within the ring hash space and moving clockwise, the first business node reached can be designated as the business node responsible for pushing data to the corresponding business system. Therefore, it can be understood that the node mapping position of a business node and the system mapping position of the business system it is responsible for pushing data to are adjacent in the ring hash space (here, adjacent means adjacent between the node mapping position of the business node and the system mapping position of the business system).

[0087] For example, the process of identifying the business system responsible for push notifications by the first business node can be as follows: The system mapping positions of each business system can be moved clockwise through the ring hash space. The business system whose corresponding system mapping position is moved to the first node mapping position among the M business systems is the one belonging to the first business node, and this is designated as the business system responsible for push notifications by the first business node. The business system responsible for push notifications by the first business node can be referred to as the first business system. There can be one or more first business systems; the specific number of first business systems can be determined based on the actual application scenario and is not limited thereto.

[0088] In other words, starting from the system mapping position of the first business system, the node mapping position adjacent to the system mapping position of the first business system in the sequential direction of the ring hash space is the node mapping position of the first business node.

[0089] Therefore, it can be understood that the execution subject in this application embodiment can be the first business node mentioned above, that is, the execution subject in this application embodiment can be any business node.

[0090] Therefore, when the first business node pushes data, it can determine the first business system it is responsible for pushing. The first business system that the first business node is responsible for pushing can be predetermined (e.g., determined when mapping N business nodes and M business systems into a ring hash space).

[0091] Please see Figure 4 , Figure 4 This is a schematic diagram illustrating a hash mapping scenario provided in this application. For example... Figure 4 As shown, the above N business nodes may include business node 1, business node 2 and business node 3, and the above M business systems may include business system 1, business system 2, business system 3, business system 4 and business system 5.

[0092] Specifically, the node hash value of business node 1 can be node hash value 1, the node hash value of business node 2 can be node hash value 2, and the node hash value of business node 3 can be node hash value 3; the system hash value of business system 1 can be system hash value 1, the system hash value of business system 2 can be system hash value 2, the system hash value of business system 3 can be system hash value 3, the system hash value of business system 4 can be system hash value 4, and the system hash value of business system 5 can be system hash value 5.

[0093] Here, the ring hash space is a space with a hash range of 0 to W. The value of W can be determined according to the actual application scenario, such as W being 2. 32-1. Therefore, each business node can be mapped to a ring hash space based on its node hash value, and each business node has a corresponding node mapping position in the ring hash space. For example, here, the node mapping position 1 of business node 1 is the position of node hash value 1 in the ring hash space, the node mapping position 2 of business node 2 is the position of node hash value 2 in the ring hash space, and the node mapping position 3 of business node 3 is the position of node hash value 3 in the ring hash space.

[0094] Similarly, each business system can be mapped to a ring hash space based on its system hash value, with each system having a corresponding system mapping position within the ring hash space. For example, system mapping position 1 for business system 1 is the position of system hash value 1 in the ring hash space; system mapping position 2 for business system 2 is the position of system hash value 2 in the ring hash space; system mapping position 3 for business system 3 is the position of system hash value 3 in the ring hash space; system mapping position 4 for business system 4 is the position of system hash value 4 in the ring hash space; and system mapping position 5 for business system 5 is the position of system hash value 5 in the ring hash space.

[0095] Therefore, in the clockwise direction of the ring hash space, the node mapping position adjacent to system mapping position 1 is node mapping position 2, the node mapping position adjacent to system mapping position 2 is node mapping position 2, the node mapping position adjacent to system mapping position 3 is node mapping position 1, the node mapping position adjacent to system mapping position 4 is node mapping position 3, and the node mapping position adjacent to system mapping position 5 is node mapping position 3.

[0096] In the clockwise direction of the ring hash space, the node mapping position adjacent to system mapping position 1 and system mapping position 2 is node mapping position 2; the node mapping position adjacent to system mapping position 4 and system mapping position 5 is node mapping position 3; and the node mapping position adjacent to system mapping position 3 is node mapping position 1. Therefore, the business node responsible for pushing data to business system 1 is business node 2; the business node responsible for pushing data to business system 2 is business node 2; the business node responsible for pushing data to business system 3 is business node 1; the business node responsible for pushing data to business system 4 is business node 3; and the business node responsible for pushing data to business system 5 is business node 3.

[0097] Step S102: Obtain the first business data generated in the blockchain network that is to be pushed to the first business system.

[0098] Optionally, the first business node can obtain business data generated in the blockchain network that is to be pushed to the first business system. This business data generated in the blockchain network and to be pushed to the first business system can be referred to as the first business data. For example, if the first business system is the business system of a certain enterprise, then the first business data can be the invoice data of that enterprise that has just been consensus-agreed and uploaded to the blockchain network.

[0099] In practice, each business node can access (e.g., pull) business data from the blockchain network to be pushed to each business system. However, during the actual push process, each business node typically only needs to retrieve the business data from the business system it is responsible for pushing, rather than retrieving all the business data that needs to be pushed to all business systems. Thus, the first business node usually only needs to retrieve the business data from the first business system it is responsible for pushing. This reduces the pressure on business nodes in acquiring, storing, and pushing business data.

[0100] The process by which the first business node obtains the first business data of the first business system can be as follows: The first business node can synchronize newly added business data belonging to the first business system from the aforementioned consensus node in the blockchain network, and use the synchronized business data as the first business data to be sent back to the first business system. In other words, whenever new business data (such as invoice data belonging to the first business system) is generated in the blockchain network, the first business node can push the newly added business data of the first business system generated in the blockchain network to the first business system.

[0101] Step S103: Push the first business data to the first business system.

[0102] Optionally, the first business node can push the acquired first business data to the first business system.

[0103] Optionally, when the first business node pushes the first business data to the first business system, it can also push the data push credential returned to the first business node by the consensus node to the first business system at the same time. This allows the first business system to receive the first business data pushed by the first business system when it successfully verifies the data push credential through the callback interface. For example, if it verifies that the data push credential is a credential authenticated by the data registration contract (e.g., the token in the data push credential is successfully verified by the management public key of the data push contract, and the contract signature in the data push credential is successfully verified by the system public key of the first business system), the first business system can receive the first business data pushed by the first business system.

[0104] Optionally, the first service node can obtain the system address of the first service system. This system address can be the callback address of the first service system synchronized by the first service node from the consensus node, or it can be the address of the callback interface of the first service system. Therefore, the first service node can establish a communication connection with the first service system through this system address, and then push the obtained first service data to the first service system through the communication connection.

[0105] Optionally, when the first business node pushes the first business data to the first business system, it may also push the target node address to the first business system at the same time. The target node address refers to the node address of the business node whose node mapping position is adjacent to the node mapping position of the first business node among N business nodes. The business node to which the target node address belongs can be referred to as the second business node.

[0106] Therefore, when the first business system fails to retrieve the first business data pushed by the first business node, it can instruct the second business node to push the first business data to itself based on the target node address. Alternatively, when the first business system subsequently fails to retrieve the business data pushed by the first business node (e.g., after a long delay in receiving the business data pushed by the first business node, or when the first business node fails to push the business data), it can use the target node address pushed by the first business node when pushing the first business data to instruct the second business node to push the business data to itself (i.e., the first business system). Then, the second business node can retrieve the business data to be pushed to the first business system and push the retrieved business data to the first business system.

[0107] In other words, in this application, when a business node pushes business data to the business system, it can simultaneously push the node addresses of business nodes whose node mapping positions are adjacent to its own. This allows the business system to push business data to adjacent business nodes of the currently pushing business node when it fails to obtain business data (e.g., due to a business node malfunction causing the data push to fail). Here, adjacent business nodes (e.g., a second business node adjacent to a first business node) can refer to other business nodes whose node mapping positions are adjacent to the current business node's node mapping position in a clockwise direction within the ring hash space, starting from the current business node's node mapping position.

[0108] Please see Figure 5 , Figure 5 This is a schematic diagram illustrating a scenario for determining a second service node, as provided in this application. Figure 5As shown, the aforementioned N business nodes may include business nodes 1 to 3. In this application, if business node 2 is taken as the first business node, then starting from business node 2, in the clockwise direction of the ring hash space, the node mapping position adjacent to the node mapping position of business node 2 is the node mapping position of business node 3. Therefore, business node 3 can be taken as the aforementioned second business node, that is, the second business node can be the next business node after the first business node in the clockwise direction of the ring hash space. That is, when the first business system fails to obtain the business data pushed by business node 2, it can instruct business node 3 to push the business data for itself.

[0109] Furthermore, the aforementioned M business systems may include a third business node. Starting from the node mapping position of this third business node in a clockwise direction within the ring hash space, the node mapping position adjacent to the node mapping position of this third business node is the node mapping position of the first business node. The business system that this third business node is responsible for pushing data to can be referred to as the second business system; that is, the third business node is responsible for providing business services (i.e., data push services) to the second business system. Specifically, starting from the system mapping position of this second business system in a clockwise direction within the ring hash space, the node mapping position adjacent to the system mapping position of the second business system can be the node mapping position of the third business node.

[0110] Optionally, in this application, a business node can maintain a continuous connection with its adjacent (maybe clockwise adjacent) business nodes, such as a continuous connection between the first business node and the third business node. Therefore, when the third business node fails, causing the first business node to fail to connect to the second business node (i.e., the connection between the first and second business nodes is interrupted), the first business node can assume the push service of the third business node; that is, the first business node can push data to the business system responsible for push services by the third business node. Therefore, if the first business node fails to connect to the third business node, the first business node can obtain business data generated in the blockchain network that is to be pushed to the second business system. This business data can be referred to as the second business data, and the first business node can then push the obtained second business data to the second business system.

[0111] In other words, in this application, when a business node fails and cannot push data to the business system it is responsible for, the adjacent business node (which may be a business node whose node mapping position is adjacent in the clockwise direction of the ring hash space) can take over the data push service (belonging to the business service) of the business system that the business node is responsible for pushing.

[0112] Please see Figure 6 , Figure 6 This is a schematic diagram illustrating a scenario for determining a third business node, as provided in this application. The aforementioned N business nodes may include business node 1 to business node 3. In this application, if business node 2 is taken as the first business node, then starting from business node 1, in the clockwise direction of the ring hash space, the node mapping position adjacent to the node mapping position of business node 1 is the node mapping position of business node 2 (i.e., the first business node). Therefore, business node 1 can be taken as the aforementioned third business node; that is, the third business node can be the business node preceding the first business node in the clockwise direction of the ring hash space. In other words, when business node 1 fails, the adjacent business node of business node 1 in the clockwise direction of the ring hash space (i.e., business node 2) can take over the push service handled by business node 1.

[0113] Optionally, the N business nodes may also include a fourth business node. This fourth business node can be any of the N business nodes other than the first business node (such as the second or third business node mentioned above). Therefore, during the process of the first business system receiving the first business data pushed by the first business node, if it detects that the fourth business node has also initiated a push action for business data to itself (i.e., the first business system), the first business system can refuse the push action initiated by the fourth business node. In other words, the first business system can refuse the fourth business node from pushing business data to itself. In this way, it is possible to avoid two business nodes simultaneously pushing business data to the business system, thereby avoiding the business system from repeatedly receiving pushed business data.

[0114] In other words, in this application, any business system can only receive data push services from one business node at a time, that is, any business system can only receive business data pushed to it by one business node at the same time, so as to ensure the normal operation of the data push service.

[0115] Furthermore, in this application, the business data pushed by the business node to the business system can be the invoice data of the business system. Therefore, the process by which the first business node obtains the first business data generated in the blockchain network to be pushed to the first business system can also be as follows: The first business node can obtain the block transaction data of the first business system generated in the blockchain network. This block transaction data is in block format and contains the invoice data of the first business system. Therefore, the first business node can extract the invoice data of the first business system from the block transaction data and can use the extracted invoice data as the first business data to be pushed to the first business system, and then push the first business data to the first business system. Here, the first business system can be the enterprise's system, and the first business data can be the enterprise's invoice data.

[0116] Please see Figure 7 , Figure 7 This is a schematic diagram of a data push scenario provided in this application. The execution node here refers to the business node that performs the data push, and the aforementioned N business nodes include execution node 1 to execution node 4.

[0117] The aforementioned execution nodes 1 through 4 are all mapped to a ring hash space. Each execution node can push business data to the business system responsible for pushing, and the pushed business data can refer to the callback data that the execution node has.

[0118] The business data pushed by each execution node to the business system can be provided by several consensus nodes in the consensus network. Each consensus node contains a data push contract, and each consensus node can maintain the data push contract to manage the data push service provided by the execution node to the business system.

[0119] Please see Figure 8 , Figure 8 This is a schematic diagram illustrating a data interaction scenario provided in this application. For example... Figure 8 As shown, a routing proxy network can separate the business network from the core network (i.e., the consensus network), and the network environments of the business network, core network, and routing proxy network can be isolated from each other. The business network contains several business nodes, the core network contains several core nodes (i.e., consensus nodes), and the routing proxy network contains several proxy nodes.

[0120] The business network can interface with the front-end business systems to exchange data and execute corresponding business operations (such as business nodes pushing business data to the business system). The core network, on the other hand, performs consensus on data that needs to be uploaded to the blockchain. To ensure the security of the core network, it typically does not directly interface with the front-end business systems. The business network and the core network can communicate and interact through proxy nodes in a routing proxy network, which further enhances the security of the core network.

[0121] Using the method provided in this application, a blockchain data push architecture based on a consistent hash structure is designed. The consistent hash structure is bound to the on-chain commitment callback management contract (such as the data push contract mentioned above), which realizes the stability and fault tolerance of the data push service, and can guarantee the accurate binding relationship (i.e., correspondence) between business nodes and the business systems responsible for push. That is, business nodes can have a binding relationship with the business systems they are responsible for pushing, and this binding relationship is a data push binding relationship.

[0122] Furthermore, in this application, even if it is necessary to add or delete business nodes that push data in the blockchain network, the business nodes responsible for pushing data to various business systems can be quickly identified after the addition or deletion of business nodes. In addition, by mapping each business system and each business node to a ring hash space in this application, when a business node is added, it is only necessary to change the business push service of the business system whose system mapping position in the ring hash space is before the added business node (here, the adjacent business system in the counterclockwise direction), such as changing it to be responsible for pushing data to the business system by the newly added business node; similarly, when a business node is deleted (i.e., removed), it is only necessary to change the business push service of the business system that the deleted business node is responsible for pushing data to, such as changing it to be responsible for pushing data to the business system that the deleted business node is adjacent to in the clockwise direction in the ring hash space. Therefore, the fault tolerance of the system is improved, and it is also easier to adjust for the addition or deletion of business nodes.

[0123] In this application, the blockchain network can contain N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space, and each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space, and each business system has a system mapping position in the ring hash space. The first business node among the N business nodes can determine the first business system that the first business node is responsible for pushing. The first business system includes one or more business systems among the M business systems whose system mapping position is adjacent to the node mapping position of the first business node. The first business node can also obtain the first business data generated in the blockchain network that is to be pushed to the first business system, and can push the first business data to the first business system. Therefore, the method proposed in this application maps business systems and business nodes to the same ring hash space. Based on the mapping position of each business system and each business node in the ring hash space, the business system responsible for data push by each business node can be determined. This can ensure the correct correspondence between each business node and the business system responsible for push. At the same time, by pushing data to different business systems through different business nodes, the task of data push service can also be distributed, thereby improving the stability of data push service.

[0124] Please see Figure 9 , Figure 9This is a schematic diagram of the structure of a data processing device for a blockchain network provided in this application. The data processing device for the blockchain network can be a computer program (including program code) running on a computer device; for example, the data processing device for the blockchain network is an application software. The data processing device for the blockchain network can be used to execute the corresponding steps in the methods provided in the embodiments of this application.

[0125] like Figure 9 As shown, the blockchain network contains N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space. Each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space. Each business system has a system mapping position in the ring hash space. The data processing device 1 of the blockchain network can be applied to the first business node among the N business nodes. The data processing device 1 of the blockchain network may include: a determination module 11, an acquisition module 12, and a push module 13.

[0126] The determination module 11 is used to determine the first business system that the first business node is responsible for pushing; the first business system includes one or more business systems among M business systems whose system mapping position is adjacent to the node mapping position of the first business node;

[0127] Module 12 is used to acquire first business data generated in the blockchain network that is to be pushed to the first business system;

[0128] The push module 13 is used to push the first business data to the first business system.

[0129] Optionally, the blockchain network includes consensus nodes; the aforementioned device 1 is also used for:

[0130] Send a push registration request to the consensus node so that the consensus node can generate a data push credential for the first business node after successfully verifying the node identity of the first business node based on the push registration request.

[0131] Obtain the data push credential returned by the consensus node; the data push credential is used to indicate that the first business node has the data push permission for the business system.

[0132] Optionally, the push module 13 may push the first business data to the first business system in the following ways:

[0133] The data push credentials and the first business data are pushed to the first business system so that the first business system can receive the first business data pushed by the first business system after the data push credentials are verified.

[0134] Optionally, the blockchain network includes consensus nodes. N business nodes are mapped to a ring hash space based on their respective node hash values. The node hash value of any business node is obtained by hashing the node domain name of that business node.

[0135] M business systems are mapped to a ring hash space based on their system hash values. The system hash value of any business system is obtained by hashing the business identifier of that business system. The business identifier is assigned to the business system by the consensus node when the business system registers the data push service with the consensus node.

[0136] Optionally, the blockchain network includes consensus nodes; the acquisition module 12 acquires the first business data generated in the blockchain network to be pushed to the first business system in the following ways:

[0137] Synchronize newly added business data belonging to the first business system in the blockchain network from the consensus node;

[0138] The business data of the first business system that is synchronized is used as the first business data.

[0139] Optionally, the push module 13 may push the first business data to the first business system in the following ways:

[0140] Obtain the system address of the first business system, and establish a communication connection with the first business system based on the system address;

[0141] Based on the communication connection with the first business system, the first business data is pushed to the first business system.

[0142] Optionally, the push module 13 may push the first business data to the first business system in the following ways:

[0143] Push the first business data and the target node address to the first business system;

[0144] The target node address refers to the node address of the second business node. The node mapping position adjacent to the node mapping position of the first business node in the clockwise direction of the ring hash space is the node address of the second business node. The first business system is used to instruct the second business node to push the first business data to the first business system according to the target node address when it fails to obtain the first business data pushed by the first business node.

[0145] Optionally, the M business systems include a third business node. The node mapping position adjacent to the node mapping position of the third business node in the clockwise direction of the ring hash space is the node mapping position of the first business node. The third business node is used to provide business services to the second business system in the M business systems. The system mapping position of the second business system is adjacent to the node mapping position of the third business node in the clockwise direction of the ring hash space. The first business node and the third business node maintain a continuous connection.

[0146] The aforementioned device 1 is also used for:

[0147] If the first business node fails to connect to the third business node, then the second business data generated in the blockchain network and to be pushed to the second business system is obtained.

[0148] Push the second business data to the second business system.

[0149] Optionally, the N business nodes include a fourth business node, which is not the same business node as the first business node. During the process of the first business system receiving the first business data pushed by the first business node, if the first business system detects a push behavior for business data initiated by the fourth business node, the first business system will reject the push behavior initiated by the fourth business node.

[0150] Optionally, the acquisition module 12 may acquire the first business data generated in the blockchain network that is to be pushed to the first business system in the following ways:

[0151] Obtain block transaction data generated by the first business system in the blockchain network;

[0152] Extract the invoice data from the first business system from the block transaction data, and use the invoice data as the first business data.

[0153] According to one embodiment of this application, Figure 3 The steps involved in the data processing method of the blockchain network shown can be derived from... Figure 9 The data processing unit 1 of the blockchain network shown is used to execute this process. For example, Figure 3 Step S101 shown can be performed by Figure 9 The determination module 11 in the middle is used to execute, Figure 3 Step S102 shown can be performed by Figure 9 The acquisition module 12 in the middle is used to execute; Figure 3 Step S103 shown can be performed by Figure 9 The push module 13 in the middle is used to execute it.

[0154] In this application, the blockchain network can contain N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space, and each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space, and each business system has a system mapping position in the ring hash space. The first business node among the N business nodes can determine the first business system that the first business node is responsible for pushing. The first business system includes one or more business systems among the M business systems whose system mapping position is adjacent to the node mapping position of the first business node. The first business node can also obtain the first business data generated in the blockchain network that is to be pushed to the first business system, and can push the first business data to the first business system. Therefore, the device proposed in this application maps business systems and business nodes to the same ring hash space. Based on the mapping position of each business system and each business node in the ring hash space, it determines the business system responsible for data push by each business node. This ensures the correct correspondence between each business node and the business system responsible for push. At the same time, by pushing data to different business systems through different business nodes, the task of data push service can be distributed, thereby improving the stability of data push service.

[0155] According to one embodiment of this application, Figure 9 The modules in the data processing device 1 of the blockchain network shown can be individually or entirely merged into one or more units, or some of these units can be further divided into multiple functionally smaller sub-units to achieve the same operation without affecting the technical effects of the embodiments of this application. The above modules are based on logical function division. In practical applications, the function of one module can be implemented by multiple units, or the function of multiple modules can be implemented by one unit. In other embodiments of this application, the data processing device 1 of the blockchain network may also include other units. In practical applications, these functions can also be implemented with the assistance of other units, and can be implemented collaboratively by multiple units.

[0156] According to one embodiment of this application, a general-purpose computer device, such as a computer, which includes processing elements and storage elements such as a central processing unit (CPU), random access memory (RAM), and read-only memory (ROM), can perform operations such as... Figure 3 The computer program (including program code) for each step involved in the corresponding method shown, to construct such... Figure 9The data processing apparatus 1 of the blockchain network shown herein, and the data processing method for implementing the blockchain network according to the embodiments of this application. The computer program described above may be recorded on, for example, a computer-readable recording medium, loaded onto the computing device via the computer-readable recording medium, and run therein.

[0157] Please see Figure 10 , Figure 10 This is a schematic diagram of the structure of a computer device provided in this application. For example... Figure 10 As shown, the computer device 1000 may include a processor 1001, a network interface 1004, and a memory 1005. Furthermore, the computer device 1000 may also include a user interface 1003 and at least one communication bus 1002. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and a keyboard; optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be high-speed RAM or non-volatile memory, such as at least one disk storage device. Optionally, the memory 1005 may also be at least one storage device located remotely from the aforementioned processor 1001. Figure 10 As shown, the memory 1005, which serves as a computer storage medium, may include an operating system, a network communication module, a user interface module, and a device control application program.

[0158] exist Figure 10 In the computer device 1000 shown, the network interface 1004 provides network communication functions; while the user interface 1003 is mainly used to provide an input interface for users. In this application, the blockchain network contains N business nodes, where N is a positive integer. The N business nodes are mapped to the same ring hash space, and each business node has a node mapping position in the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. The M business systems are mapped to the ring hash space, and each business system has a system mapping position in the ring hash space. The aforementioned computer device can be applied to the first business node among the N business nodes. Therefore, the processor 1001 can be used to call the device control application stored in the memory 1005 to achieve:

[0159] Identify the first business system that the first business node is responsible for pushing; the first business system includes one or more business systems among M business systems whose system mapping position is adjacent to the node mapping position of the first business node;

[0160] Obtain the first business data generated in the blockchain network that is to be pushed to the first business system;

[0161] Push the first business data to the first business system.

[0162] In one feasible implementation, the blockchain network includes consensus nodes; the processor 1001 can also be used to invoke a device control application stored in the memory 1005 to achieve:

[0163] Send a push registration request to the consensus node so that the consensus node can generate a data push credential for the first business node after successfully verifying the node identity of the first business node based on the push registration request.

[0164] Obtain the data push credential returned by the consensus node; the data push credential is used to indicate that the first business node has the data push permission for the business system.

[0165] In one feasible implementation, the processor 1001 can also be used to invoke a device control application stored in the memory 1005 to achieve:

[0166] The data push credentials and the first business data are pushed to the first business system so that the first business system can receive the first business data pushed by the first business system after the data push credentials are verified.

[0167] In one feasible implementation, the blockchain network includes consensus nodes, and N business nodes are mapped to a ring hash space based on their respective node hash values. The node hash value of any business node is obtained by hashing the node domain name of that business node.

[0168] M business systems are mapped to a ring hash space based on their system hash values. The system hash value of any business system is obtained by hashing the business identifier of that business system. The business identifier is assigned to the business system by the consensus node when the business system registers the data push service with the consensus node.

[0169] In one feasible implementation, the blockchain network includes consensus nodes; the processor 1001 can also be used to invoke a device control application stored in the memory 1005 to achieve:

[0170] Synchronize newly added business data belonging to the first business system in the blockchain network from the consensus node;

[0171] The business data of the first business system that is synchronized is used as the first business data.

[0172] In one feasible implementation, the processor 1001 can also be used to invoke a device control application stored in the memory 1005 to achieve:

[0173] Obtain the system address of the first business system, and establish a communication connection with the first business system based on the system address;

[0174] Based on the communication connection with the first business system, the first business data is pushed to the first business system.

[0175] In one feasible implementation, the processor 1001 can also be used to invoke a device control application stored in the memory 1005 to achieve:

[0176] Push the first business data and the target node address to the first business system;

[0177] The target node address refers to the node address of the second business node. The node mapping position adjacent to the node mapping position of the first business node in the clockwise direction of the ring hash space is the node address of the second business node. The first business system is used to instruct the second business node to push the first business data to the first business system according to the target node address when it fails to obtain the first business data pushed by the first business node.

[0178] In one feasible implementation, the M business systems include a third business node. The node mapping position adjacent to the node mapping position of the third business node in the clockwise direction of the ring hash space is the node mapping position of the first business node. The third business node provides business services to the second business system among the M business systems. The node mapping position adjacent to the system mapping position of the second business system in the clockwise direction of the ring hash space is the node mapping position of the third business node. A continuous connection is maintained between the first business node and the third business node.

[0179] Processor 1001 can also be used to call device control applications stored in memory 1005 to achieve:

[0180] If the first business node fails to connect to the third business node, then the second business data generated in the blockchain network and to be pushed to the second business system is obtained.

[0181] Push the second business data to the second business system.

[0182] In one feasible implementation, the N service nodes include a fourth service node, which is not the same as the first service node; during the process of the first service system receiving the first service data pushed by the first service node, if the first service system detects a push behavior for the service data initiated by the fourth service node, the first service system rejects the push behavior initiated by the fourth service node.

[0183] In one feasible implementation, the processor 1001 can also be used to invoke a device control application stored in the memory 1005 to achieve:

[0184] Obtain block transaction data generated by the first business system in the blockchain network;

[0185] Extract the invoice data from the first business system from the block transaction data, and use the invoice data as the first business data.

[0186] It should be understood that the computer device 1000 described in the embodiments of this application can execute the foregoing text. Figure 3 The description of the data processing method for the blockchain network in the corresponding embodiments can also be performed as described above. Figure 9 The description of the data processing device 1 of the blockchain network in the corresponding embodiments will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated here.

[0187] Furthermore, it should be noted that this application also provides a computer-readable storage medium storing a computer program executed by the data processing device 1 of the aforementioned blockchain network. The computer program includes program instructions, which, when executed by the processor, enable the execution of the aforementioned... Figure 3 The description of the data processing method for the blockchain network in the corresponding embodiments is therefore not repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the computer storage medium embodiments related to this application, please refer to the description of the method embodiments of this application.

[0188] As an example, the above program instructions can be deployed and executed on a single computer device, or deployed and executed on multiple computer devices located in one location, or executed on multiple computer devices distributed across multiple locations and interconnected via a communication network. Multiple computer devices distributed across multiple locations and interconnected via a communication network can form a blockchain network.

[0189] The aforementioned computer-readable storage medium can be a data processing device of the blockchain network provided in any of the foregoing embodiments, or an internal storage unit of the aforementioned computer device, such as a hard drive or memory of the computer device. The computer-readable storage medium can also be an external storage device of the computer device, such as a plug-in hard drive, smart media card (SMC), secure digital (SD) card, flash card, etc., provided on the computer device. Furthermore, the computer-readable storage medium can include both internal storage units and external storage devices of the computer 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 can also be used to temporarily store data that has been output or will be output.

[0190] This application provides a computer program product or computer program including 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 aforementioned... Figure 3 The data processing method for the blockchain network described in the corresponding embodiments will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the computer-readable storage medium embodiments related to this application, please refer to the description of the method embodiments of this application.

[0191] The terms "first," "second," etc., in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the term "comprising," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, apparatus, product, or device that includes a series of steps or units is not limited to the listed steps or modules, but may optionally include steps or modules not listed, or may optionally include other step units inherent to these processes, methods, apparatuses, products, or devices.

[0192] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this application.

[0193] The methods and related apparatuses provided in this application are described with reference to the method flowcharts and / or structural diagrams provided in this application. Specifically, each block of the method flowchart and / or structural diagram, as well as combinations of blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing device to create a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing device, generate instructions for implementing the process. Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The functions specified in one or more boxes. These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable apparatus for implementing the process. Figure 1 A process or multiple processes and / or structures illustrate the steps of the functions specified in one or more boxes.

[0194] The above-disclosed embodiments are merely preferred embodiments of this application and should not be construed as limiting the scope of this application. Therefore, any equivalent variations made in accordance with the claims of this application shall still fall within the scope of this application.

Claims

1. A data processing method for a blockchain network, characterized in that, The blockchain network comprises N business nodes, where N is a positive integer. These N business nodes are mapped to the same ring hash space, and each business node has a node mapping position within the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. These M business systems are mapped to the ring hash space, and each business system has a system mapping position within the ring hash space. The method is applied to the first business node among the N business nodes, and the method includes: The first business system responsible for pushing information is determined by the first business node; the first business system includes one or more business systems among the M business systems whose system mapping position is adjacent to the node mapping position of the first business node. Obtain the first business data generated in the blockchain network that is to be pushed to the first business system; The first business data is pushed to the first business system.

2. The method according to claim 1, characterized in that, The blockchain network includes consensus nodes; the method further includes: Send a push registration request to the consensus node so that after the consensus node verifies the node identity of the first business node according to the push registration request, it generates a data push credential for the first business node. Obtain the data push credential returned by the consensus node; the data push credential is used to indicate that the first business node has data push permissions for the business system.

3. The method according to claim 2, characterized in that, The step of pushing the first business data to the first business system includes: The data push credential and the first business data are pushed to the first business system so that the first business system can receive the first business data pushed by the first business system after the data push credential is verified.

4. The method according to claim 1, characterized in that, The blockchain network includes consensus nodes. The N business nodes are mapped to the ring hash space based on their respective node hash values. The node hash value of any business node is obtained by hashing the node domain name of that business node. The M business systems are mapped to the ring hash space based on their system hash values. The system hash value of any business system is obtained by hashing the business identifier of that business system. The business identifier is assigned to the business system by the consensus node when the business system registers the data push service with the consensus node.

5. The method according to claim 1, characterized in that, The blockchain network includes consensus nodes; the step of obtaining the first business data generated in the blockchain network to be pushed to the first business system includes: Synchronize the newly added business data belonging to the first business system in the blockchain network from the consensus node; The synchronized business data of the first business system is used as the first business data.

6. The method according to claim 1, characterized in that, The step of pushing the first business data to the first business system includes: Obtain the system address of the first business system, and establish a communication connection with the first business system based on the system address; The first business data is pushed to the first business system based on the communication connection with the first business system.

7. The method according to claim 1, characterized in that, The step of pushing the first business data to the first business system includes: Push the first business data and the target node address to the first business system; Wherein, the target node address refers to the node address of the second business node, and the node mapping position adjacent to the node mapping position of the first business node in the clockwise direction of the ring hash space is the node address of the second business node; the first business system is used to instruct the second business node to push the first business data to the first business system according to the target node address when it fails to obtain the first business data pushed by the first business node.

8. The method according to claim 1, characterized in that, The M business systems include a third business node. The node mapping position adjacent to the node mapping position of the third business node in the clockwise direction of the ring hash space is the node mapping position of the first business node. The third business node is used to provide business services to the second business system in the M business systems. The node mapping position adjacent to the system mapping position of the second business system in the clockwise direction of the ring hash space is the node mapping position of the third business node. The first service node and the third service node maintain a continuous connection. The method further includes: If the first business node fails to connect to the third business node, then the second business data generated in the blockchain network and to be pushed to the second business system is obtained. The second business data is pushed to the second business system.

9. The method according to claim 1, characterized in that, The N service nodes include a fourth service node, which is not the same as the first service node. During the process of the first service system receiving the first service data pushed by the first service node, if the first service system detects a push behavior for the service data initiated by the fourth service node, the first service system is used to reject the push behavior initiated by the fourth service node.

10. The method according to claim 1, characterized in that, The step of obtaining the first business data generated in the blockchain network and to be pushed to the first business system includes: Obtain the block transaction data of the first business system generated in the blockchain network; The invoice data of the first business system is extracted from the block transaction data, and the invoice data is used as the first business data.

11. A data processing device for a blockchain network, characterized in that, The blockchain network comprises N business nodes, where N is a positive integer. These N business nodes are mapped to the same ring hash space, and each business node has a node mapping position within the ring hash space. The blockchain network is used to provide business services to M business systems, where M is a positive integer. These M business systems are mapped to the ring hash space, and each business system has a system mapping position within the ring hash space. The device is applied to the first business node among the N business nodes, and the device includes: The determination module is used to determine the first business system that the first business node is responsible for pushing; the first business system includes one or more business systems among the M business systems whose system mapping position is adjacent to the node mapping position of the first business node; The acquisition module is used to acquire the first business data generated in the blockchain network that is to be pushed to the first business system; The push module is used to push the first business data to the first business system.

12. The apparatus according to claim 11, characterized in that, The N service nodes include a third service node, which is not the same as the first service node. During the process of the first service system receiving the first service data pushed by the first service node, if the first service system detects a push behavior for the service data initiated by the third service node, the first service system is used to reject the push behavior initiated by the third service node.

13. A computer program product comprising a computer program / instructions that, when executed by a processor, implement the steps of the method according to any one of claims 1-10.

14. A computer device, characterized in that, It includes a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform the steps of the method according to any one of claims 1-10.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program adapted to be loaded by a processor and executed as described in any one of claims 1-10.

Images