CN115730936A

CN115730936A - Data processing method and device for block chain network, computer equipment and medium

Info

Publication number: CN115730936A
Application number: CN202111014850.3A
Authority: CN
Inventors: 郭英杰; 王宗友; 刘攀
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2021-08-31
Filing date: 2021-08-31
Publication date: 2023-03-03

Abstract

The application discloses a data processing method, a device, computer equipment and a medium of a block chain network, wherein the method comprises the following steps: acquiring M pieces of fragment data of service data and a transmission block chain node of each piece of fragment data; the data volume of the service data is greater than the data volume threshold; the transmission block link node of the fragment data is selected from N-1 block link nodes of N block link points except for the first block link node; each piece of fragment data is sent to a corresponding transmission block chain node; according to the data pulling information of the transmission block chain link dot packing data of the fragment data; broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating the N-1 block chain link points to pull the acquired fragment data mutually so as to restore the service data; and performing service processing on the service data among the N block chain nodes. By adopting the method and the device, the efficiency of service processing on the service data can be improved, and the service data can be the data such as the message synchronized by the terminal.

Description

Data processing method and device for block chain network, computer equipment and medium

Technical Field

The present application relates to the field of blockchain technologies, and in particular, to a data processing method and apparatus for a blockchain network, a computer device, and a medium.

Background

The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block.

In the existing application, when a certain block needs to be uplink-linked, the block needs to be packed by the main common node first, and then the packed block is sent to each of the other common nodes in the common network by the main common node at the same time.

Disclosure of Invention

The application provides a data processing method, a data processing device, computer equipment and a medium for a block chain network, which can improve the speed of transmitting service data and further improve the efficiency of processing the service of the service data.

One aspect of the present application provides a data processing method for a blockchain network, where the blockchain network includes N blockchain link points, where N is a positive integer, and the method is applied to a first blockchain node, where the first blockchain node is any one of the N blockchain nodes, and the method includes:

acquiring M pieces of fragment data of service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is greater than the data volume threshold; the transmission block chain node corresponding to each piece of fragment data is selected from N-1 block chain link points except for the first block chain link point of the N block chain link points;

respectively sending each piece of fragment data to a corresponding transmission block chain node;

packing data pulling information of the M pieces of fragment data according to the transmission block chain link point corresponding to each piece of fragment data;

broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data;

and performing service processing on the service data among the N block link points.

In one aspect, the present application provides a data processing method for a blockchain network, where the blockchain network includes N blockchain link points, where N is a positive integer, the method is applied to a second blockchain node, where the second blockchain node is any one of the N blockchain nodes, and the method includes:

acquiring data pulling information sent by a first block chain node; the first block link point belongs to N block link nodes, the first block link node and the second block link node are different block link nodes, data pulling information is obtained by packaging the first block link point according to transmission block link points corresponding to M pieces of fragment data of service data, the data volume of the service data is larger than a data volume threshold value, the transmission block link node corresponding to each piece of fragment data is selected from N-1 block link points except the first block link point of the N block link points, and each piece of fragment data is sent to the corresponding transmission block link node by the first block link point; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data;

acquiring M pieces of fragment data according to the data pulling information, and restoring to obtain service data;

An aspect of the present application provides a data processing apparatus of a blockchain network, the blockchain network including N blockchain link points, N being a positive integer, the apparatus being applied to a first blockchain node, the first blockchain node being any one of the N blockchain nodes, the apparatus including:

the system comprises an acquisition module, a transmission module and a processing module, wherein the acquisition module is used for acquiring M fragment data of service data and a transmission block chain node corresponding to each fragment data, and M is a positive integer; the data volume of the service data is larger than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points;

the sending module is used for sending each piece of fragment data to the corresponding transmission block chain node respectively;

the packaging module is used for packaging data pulling information of the M pieces of fragment data according to the corresponding transmission block chain link point of each piece of fragment data;

the broadcasting module is used for broadcasting the data pulling information to the N-1 block chain nodes; the data pulling information is used for indicating the N-1 block link points to pull the acquired fragment data mutually and restoring the service data;

and the service processing module is used for carrying out service processing on the service data among the N block chain link points.

Optionally, any one of the M pieces of fragmented data is represented as an ith piece of fragmented data, where i is a positive integer less than or equal to M, and the ith piece of fragmented data carries a fragmented number; the fragment number carried by the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the mode that the sending module sends each piece of fragmented data to the corresponding transmission block chain node respectively comprises the following steps:

and sending the ith fragment data carrying the fragment number to a transmission block chain node corresponding to the ith fragment data.

Optionally, the manner of packing the data pulling information of the M sliced data by the packing module according to the transmission block link point corresponding to each sliced data includes:

respectively generating data pulling sub-information of each piece of fragmented data according to the transmission block chain node corresponding to each piece of fragmented data;

and packaging the data pulling sub-information of each piece of fragmented data to obtain the data pulling information.

Optionally, the mode that the packing module generates the data pulling sub-information of each piece of fragmented data according to the transmission block chain node corresponding to each piece of fragmented data respectively includes:

acquiring a node identifier of a transmission block chain node corresponding to the ith fragment data;

acquiring a data hash value of the ith fragment data;

and generating data pulling sub-information of the ith fragmented data according to the node identifier, the data hash value of the ith fragmented data and the fragmented number carried by the ith fragmented data.

Optionally, the apparatus is further configured to:

acquiring a fragment data volume threshold;

fragmenting the service data according to a fragment data quantity threshold to obtain M fragment data; the data amount of one piece of sliced data is less than or equal to the sliced data amount threshold.

Optionally, the block chain network is a consensus network, the N block chain link points are consensus nodes, the first block chain node is a master consensus node among the N block chain nodes, and the service data is a service block packed by the master consensus node;

the mode that the service processing module carries out service processing on the service data among the chain link points of the N blocks comprises the following steps:

performing block consensus processing on the service blocks among the N block link points;

and when the service block consensus passes, performing uplink processing on the service block.

Optionally, the apparatus is further configured to:

acquiring a data certificate storage request submitted by a service client; the data certificate storing request comprises service data;

the mode that the business processing module carries out business processing on business data among the N block chain link points comprises the following steps:

and carrying out data storage and verification processing on the service data among the N block link points.

An aspect of the present application provides a data processing apparatus for a blockchain network, where the blockchain network includes N blockchain link points, where N is a positive integer, the apparatus is applied to a second blockchain node, and the second blockchain node is any one of the N blockchain nodes, and the apparatus includes:

the information acquisition module is used for acquiring data pulling information sent by a first block chain node; the first block link point belongs to N block link nodes, the first block link node and the second block link node are different block link nodes, data pulling information is obtained by packaging the first block link point according to transmission block link points corresponding to M pieces of fragment data of service data, the data volume of the service data is larger than a data volume threshold value, the transmission block link node corresponding to each piece of fragment data is selected from N-1 block link points except the first block link point of the N block link points, and each piece of fragment data is sent to the corresponding transmission block link node by the first block link point; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data;

the restoring module is used for acquiring M pieces of fragment data according to the data pulling information and restoring to obtain service data;

and the data processing module is used for carrying out service processing on the service data among the N block link points.

Optionally, any one of the M pieces of sliced data is represented as the ith piece of sliced data, where i is a positive integer less than or equal to M; the ith fragment data carries a fragment number; the fragment number carried by the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the above apparatus is also for:

if the transmission block chain node corresponding to the ith fragmented data is a second block chain node, acquiring a first data pulling request sent by a third block chain node according to the data pulling information; the first data pulling request carries a data hash value of the ith fragment data and a fragment number of the ith fragment data; the third block link node belongs to block link points of the N-1 block link nodes except the second block link point;

searching the ith fragment data carrying the data number in the first data pulling request, and calculating the data hash value of the searched ith fragment data;

and if the calculated data hash value is the same as the data hash value in the first data pulling request, sending the retrieved ith fragmented data to a third block chain node.

Optionally, any one of the M pieces of sliced data is represented as the ith piece of sliced data, where i is a positive integer less than or equal to M; the data pulling information comprises a data hash value of the ith fragment data, a node identifier of a transmission block chain node corresponding to the ith fragment data and a fragment number of the ith fragment data; the fragment number of the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the above-mentioned process that the reduction module obtains ith piece data according to the data pulling information includes:

if the transmission block chain node corresponding to the ith fragment data is not the second block chain node, sending a second data pulling request to the block chain node to which the node identifier belongs; the second data pulling request comprises a data hash value and a fragment number of the ith fragment data;

and acquiring the ith fragmented data returned by the block chain node to which the node identifier belongs according to the data hash value and the fragmentation number of the ith fragmented data.

Optionally, the apparatus is further configured to:

if the ith fragment data returned by the block chain node to which the node identifier belongs is not acquired, sending a third data pulling request to the first block chain node; the third data pulling request comprises a data hash value and a fragment number of the ith fragment data;

and acquiring the ith piece of sliced data returned by the first block link point according to the data hash value and the piece number of the ith piece of sliced data.

Optionally, the data pulling information includes a real data hash value of the service data;

the method for restoring the service data by the restoring module comprises the following steps:

assembling M pieces of fragment data acquired according to the data pulling information to obtain initial service data;

calculating a data hash value of the initial service data as a verification data hash value;

and if the verification data hash value is the same as the real data hash value, determining the initial service data as the service data obtained by reduction.

An aspect of the application provides a computer device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the method of an aspect of the application.

An aspect of the application provides a computer-readable storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of the above aspect.

According to an aspect of the application, a computer program product or computer program is provided, comprising computer instructions, the computer instructions being stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the method provided in the various alternatives of the aspect described above.

The method and the device can acquire M fragment data of the service data and a transmission block chain node corresponding to each fragment data, wherein M is a positive integer; the data volume of the service data is greater than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points; respectively sending each piece of fragment data to a corresponding transmission block chain node; packing data pulling information of the M pieces of fragment data according to the transmission block chain link point corresponding to each piece of fragment data; broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating the N-1 block link points to pull the acquired fragment data mutually and restoring the service data; and performing service processing on the service data among the N block link points. Therefore, if the data volume of the service data is larger than the data volume threshold value, the method can transmit the service data after being fragmented, so that the efficiency of transmitting the service data is improved, and the single-point transmission pressure between the block chain nodes in the block chain network is reduced because the service data does not need to be transmitted to N-1 block chain link points simultaneously.

Drawings

In order to more clearly illustrate the technical solutions in the present application or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic structural diagram of a network architecture according to an embodiment of the present application;

fig. 2 is a schematic view of a service data processing scenario provided in the present application;

fig. 3 is a schematic flowchart of a data processing method of a blockchain network according to the present application;

FIG. 4 is a schematic diagram of a structure of data pull information provided in the present application;

fig. 5 is a schematic diagram of a data transmission scenario provided in the present application;

FIG. 6 is a schematic diagram of a data pull scenario provided in the present application;

fig. 7 is a flowchart illustrating a data processing method of a blockchain network according to the present application;

FIG. 8 is a schematic diagram of a data processing scenario provided herein;

FIG. 9 is a block chain network of a data processing apparatus according to the present application;

fig. 10 is a schematic structural diagram of a data processing apparatus of a blockchain network according to the present application;

fig. 11 is a schematic structural diagram of a computer device provided in the present application.

Detailed Description

The technical solutions in the present application will be described clearly and completely with reference to the accompanying drawings in the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

The present application relates to the field of block chaining. The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product services layer, and an application services layer. The Block chain comprises a series of blocks (blocks) which are mutually connected according to the generated chronological order, once a new Block is added into the Block chain, the new Block cannot be removed any more, and the blocks record the record data submitted by the nodes in the Block chain system.

Referring to fig. 1, fig. 1 is a schematic structural diagram of a network architecture according to an embodiment of the present disclosure. As shown in fig. 1, the network architecture may include a blockchain network, which may include a plurality of blockchain nodes, where the plurality of blockchain nodes may include a blockchain link point 100a, a blockchain link point 101a, a blockchain link point 102a, a blockchain link point 103a, a blockchain link point 104a, and a blockchain link point 105a, and the plurality of blockchains have network connections therebetween and may perform network communication with each other. One blockchain node may be formed by a computer device, and the computer device may be a terminal device or a server, which is not limited specifically. It is to be understood that, here, the above-mentioned blockchain network includes 6 blockchain nodes as an example, and the specific number of blockchain nodes in the blockchain network is determined according to an actual application scenario, which is not limited herein. The block link point 100a may be a block link point used for acquiring service data and for fragmenting the service data to be transmitted to other block link nodes in the block link network, where the service data acquired by the block link point 100a may be sent by a terminal device, and the terminal device may include a service client, and the service data may be generated by the service client in the terminal device.

The server mentioned in fig. 1 may be an independent physical server, may also be a server cluster or a distributed system formed by a plurality of physical servers, and may also be a cloud server providing basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a network service, cloud communication, a middleware service, a domain name service, a security service, a CDN, and a big data and artificial intelligence platform. The terminal devices include, but are not limited to, mobile phones, computers, intelligent voice interaction devices, intelligent household appliances, vehicle-mounted terminals, and the like.

Referring to fig. 2, fig. 2 is a schematic view of a service data processing scenario provided in the present application. As shown in fig. 2, when the data amount of the service data is greater than the data amount threshold, the block link point 100a may slice the service data to obtain a plurality of sliced data of the service data (as shown in a block 100 b).

Furthermore, the block link point 100a may select a transmission block link node corresponding to each piece of sliced data of the service data from other block link nodes (as shown in a block 101 b), where the transmission block link node corresponding to one piece of sliced data is the block link point to which the sliced data needs to be sent (including the block link node 101a, the block link point 102a, the block link point 103a, the block link point 104a, and the block link point 105 a).

Therefore, as shown in block 102b, the block link point 100a may respectively send each piece of fragmented data to the corresponding transmission block link node, and may broadcast data pulling information corresponding to each piece of fragmented data to other block link nodes (including the block link node 101a, the block link point 102a, the block link point 103a, the block link point 104a, and the block link point 105 a), where the data pulling information indicates a fragment position of each piece of fragmented data, where the piece of fragmented data is sent, that is, where the data pulling information indicates to which block link node or nodes each piece of fragmented data is sent by the block link point 100 a. Therefore, the acquired segment data can be mutually pulled among the patch link point 101a, the patch link point 102a, the patch link point 103a, the patch link point 104a, and the patch link point 105a according to the data pulling information (as indicated by block 103 b).

Further, as shown in block 104b, the block link point 101a, the block link point 102a, the block link point 103a, the block link point 104a, and the block link point 105a may restore the service data according to the pulled fragment data and/or the fragment data sent by the block link point 100a, so that all the block link nodes in the block chain network acquire the service data, and each block link node in the block chain network may perform service processing on the service data together. For example, if the service data is a service block to be uplink, performing service processing on the service data may refer to performing consensus processing on the service block.

By adopting the method provided by the application, if the data volume of the service data is greater than the data volume threshold value, the service data can be transmitted after being fragmented, so that the efficiency of transmitting the service data is improved, and because the block link point 100a does not need to transmit the service data to other block link points at the same time, the single-point transmission pressure between the block link points in the block link network is also reduced.

Referring to fig. 3, fig. 3 is a schematic flowchart illustrating a data processing method of a blockchain network according to the present application. As shown in fig. 3, the method may include:

step S101, obtaining M pieces of fragment data of service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is larger than the data volume threshold; the transmission block link node corresponding to each piece of sliced data is selected from N-1 block link points except the first block link point of the N block link points.

Optionally, the blockchain network may include N blockchain nodes, an execution main body in this embodiment of the present application may be any one of the N blockchain nodes, one blockchain node may be formed by one or more computer devices, and the computer device may be a server or a terminal device. Here, the block link point as the execution subject in the embodiment of the present application is referred to as a first block link node.

The first block link point may acquire M pieces of fragment data of the service data. The M pieces of fragmented data may be obtained by fragmenting the service data when the first blockchain node acquires the service data and detects that the data volume of the service data is greater than the data volume threshold, where the data volume threshold may be set according to an actual application scenario, for example, the data volume threshold may be determined according to a network bandwidth of a blockchain network, and the higher the network bandwidth is, the larger the data volume threshold may be, and conversely, the lower the network bandwidth is, the smaller the data volume threshold may be. For example, the service data may be divided into M parts of data, that is, M pieces of fragment data of the service data may be obtained, and one part of data corresponds to one piece of fragment data, that is, the service data includes the M pieces of fragment data, but the service data is divided into M pieces. The single data transmission amount can be reduced by transmitting the service data after being fragmented, so as to reduce the single point transmission pressure (e.g., one-to-one transmission pressure) in the blockchain network, which can be specifically described in the following description.

Optionally, if the blockchain network is a consensus network, the N blockchain nodes are N consensus nodes, and the first blockchain node may be a main consensus node of the N consensus nodes, where the main consensus node is used to package and uplink blocks, so that the service data may be a service block obtained by packaging a plurality of transaction data by the main consensus node, that is, the service block may include a plurality of (one or more) transaction data.

Optionally, the blockchain network may also be any blockchain network (may be a consensus network or may not be a consensus network), the first blockchain link point may be any blockchain node (may be a consensus node or may not be a consensus node), and at this time, the service data may be any data that needs to be verified.

Optionally, the process of fragmenting the service data by the first block link point may be: the first block link point may obtain a fragment data amount threshold, where the fragment data amount threshold is the maximum data amount that one fragment data can have. Furthermore, the first block link point may segment the service data according to the segment data amount threshold, that is, M segment data of the service data may be obtained, where the data amount of one segment data is less than or equal to the segment data amount threshold. For example, the data volume of the first M-1 pieces of sliced data for service data may be equal to the sliced data volume threshold, and the data volume of the last piece of sliced data for service data may be less than or equal to the sliced data volume threshold.

More, the first block link point may also obtain transmission block link nodes corresponding to each piece of fragmented data, where a transmission block link point corresponding to one piece of fragmented data is a transmission object of the first block link point for the piece of fragmented data. The number of transmission block chain nodes corresponding to one piece of fragmented data may be multiple (e.g., two or more, but not too many, if not more than 4), that is, a first block chain node sends one piece of fragmented data to multiple block chain nodes, so that the multiple block chain nodes can backup the piece of fragmented data, and if a certain block chain node fails, the piece of fragmented data cannot be acquired, and other block chain nodes can also acquire the piece of fragmented data.

The transmission block link point corresponding to each fragmented data may be selected from N-1 block link nodes, where the N-1 block link nodes are block link points of the N block link nodes except for the first block link point. For example, M is equal to 3, there are 3 pieces of sliced data, the 3 pieces of sliced data are sequentially sliced data 1, sliced data 2, and sliced data 3, N-1 block link points have a numbering sequence, and the N-1 block link points may include a block chain node 1, a block link point 2, a block link point 3, a block link point 4, a block link point 5, a block link point 6, a block link point 7, and a block chain node 8, that is, N-1 is equal to 8. If two transmission block chain nodes are selected for one piece of fragmented data, then the block chain nodes 1 and the block chain nodes 2 may be sequentially used as the transmission block chain nodes of the piece of fragmented data 1, the block chain link points 3 and the block chain link points 4 may be used as the transmission block chain nodes of the piece of fragmented data 2, and the block chain link nodes 5 and the block chain link points 6 may be used as the transmission block chain nodes of the piece of fragmented data 3 according to the numbering sequence of the N-1 block chain nodes. The method for determining the transmission blockchain node of the fragmented data is only an example, and may also be other methods, which are not limited in this respect.

It is understood that all tbs corresponding to all sliced data may be some or all of the N-1 tbs.

And step S102, respectively sending each piece of fragment data to the corresponding transmission block chain node.

Optionally, the first block link point may send each piece of fragmented data to the transmission block link node corresponding to each piece of fragmented data, respectively. When the first block chain node fragments the service data to obtain the M fragment data, a fragment number may be added to each fragment data, that is, each fragment data may carry a fragment number, and the fragment number of one fragment data is used to indicate the fragment position of the fragment data in the service data.

For example, M pieces of fragment data obtained by fragmenting service data include fragment data 1, fragment data 2, and fragment data 3, where fragment data 1 may carry fragment number 1, fragment data 2 may carry fragment number 2, and fragment data 3 may carry fragment number 3. The fragment number 1 is used to indicate that the fragment data 1 is the 1 st fragment in the service data, and is located at the start position of the service data; the fragment number 2 is used to indicate that the fragment data 2 is the 2 nd fragment in the service data and is located behind the 1 st fragment (i.e. the fragment data 1) of the service data; the fragment number 3 is used to indicate that the fragment data 3 is the 3 rd fragment in the service data and is located behind the 2 nd fragment (i.e. the fragment data 2) of the service data.

Therefore, when the first blockchain node sends each piece of fragment data to the corresponding transmission blockchain node, each piece of fragment data carrying the fragment number may be sent to the corresponding transmission blockchain node.

For example, any one of the M pieces of sliced data may be represented as the ith piece of sliced data, where i is a positive integer less than or equal to M. The first block link point may send the ith fragment data carrying the fragment number to a transmission block link node corresponding to the ith fragment data.

Step S103, packing data pulling information of M pieces of sliced data according to the transmission block chain link point corresponding to each piece of sliced data.

Optionally, the first block link point may generate data pulling sub-information of each piece of fragmented data according to the transmission block link node corresponding to each piece of fragmented data; packing the data pulling sub-information of each piece of fragmented data to obtain data pulling information: here, taking the example of obtaining the data pulling sub-information of the ith fragmented data as an example, the first block link point may obtain a node identifier of a transmission block link node corresponding to the ith fragmented data, one block link node may have one node identifier, and the node identifier of one block link node is used to uniquely identify the block link point. The first block link point may further obtain a data hash value of the ith fragmented data, and if the hash operation may be performed on the ith fragmented data, the data hash value of the ith fragmented data may be obtained. The first block link point may generate data pulling sub-information of the ith fragmented data according to the node identifier of the transmission block link node corresponding to the ith fragmented data, the data hash value of the ith fragmented data, and the fragmented number carried by the ith fragmented data, where the data pulling sub-information of the ith fragmented data includes the node identifier of the transmission block link node corresponding to the ith fragmented data, the data hash value of the ith fragmented data, and the fragmented number carried by the ith fragmented data.

Furthermore, the first block link point may pack the data pulling sub information of each piece of sliced data, and may obtain the data pulling information, where the data pulling information includes the data pulling sub information of each piece of sliced data. More, the data pulling information may further include a data hash value of the service data, and the first block link point may perform hash operation on the service data, so as to obtain the data hash value of the service data.

Please refer to fig. 4, fig. 4 is a schematic structural diagram of data pull information provided in the present application. As shown in fig. 4, the M pieces of fragmented data of the service data may include a piece of fragmented data 1, a piece of fragmented data 2, and a piece of fragmented data 3, and therefore, the data pulling information may include the data pulling sub-information 1 of the piece of fragmented data 1, the data pulling sub-information 2 of the piece of fragmented data 2, the data pulling sub-information 3 of the piece of fragmented data 3, and a data hash value (which may be referred to as a hash value for short) of the service data.

The data pulling sub-information 1 may include a node identifier of a transmission block chain node 1 corresponding to the fragmented data 1, a data hash value (may be referred to as a hash value for short) of the fragmented data 1, and a fragment number of the fragmented data 1; the data pulling sub-information 2 may include a node identifier of the transmission block chain node 2 corresponding to the fragmented data 2, a data hash value (may be referred to as a hash value for short) of the fragmented data 2, and a fragment number of the fragmented data 2; the data pulling sub-information 3 may include a node identifier of the transmission block chain node 3 corresponding to the fragmented data 3, a data hash value (may be referred to as a hash value for short) of the fragmented data 3, and a fragment number of the fragmented data 3.

Step S104, broadcasting data pulling information to N-1 block chain nodes; and the data pulling information is used for indicating the N-1 block link points to mutually pull the acquired fragment data and restore the service data.

Optionally, the first block link point may broadcast the data pulling information to each block link node in the N-1 block link nodes, and each block link point may pull the acquired fragment data according to the data pulling information, that is, each block link point may pull the fragment data that is not available to itself to other block link points, and each block link point may restore the service data according to the pulled fragment data and/or the fragment data sent by the first block link node, and if each fragment data is assembled according to the fragment number of each fragment data, the service data may be restored and obtained.

Referring to fig. 5, fig. 5 is a schematic view of a data transmission scenario provided in the present application. As shown in fig. 5, the blockchain network may be a consensus network, the N-1 blockchain nodes may include a consensus node 1, a consensus node 2, a consensus node 3, a consensus node 4, a consensus node 5, and a consensus node 6, the first blockchain node may be a main consensus node, and the M pieces of fragmented data of the service data may include a fragmented data 1, a fragmented data 2, and a fragmented data 3. The transmission block chain node of the fragmented data 1 may include a consensus node 1 and a consensus node 2; the transmission block link points of the fragmented data 2 may include a common node 3 and a common node 4; the transport block chain nodes of the fragmented data 3 may include a consensus node 5 and a consensus node 6.

Therefore, the main consensus node may send the fragmentation data 1 to the consensus nodes 1 and 2, send the fragmentation data 2 to the consensus nodes 3 and 4, and send the fragmentation data 3 to the consensus nodes 5 and 5.

Please refer to fig. 6 in conjunction with fig. 5, fig. 6 is a schematic view of a data pull scenario provided in the present application. As shown in fig. 6, the consensus node 1 acquires the fragment data 1 sent by the main consensus node, so that the consensus node 1 may request to pull the fragment data 2 from the consensus node 3 and may request to pull the fragment data 3 from the consensus node 6, and then the consensus node 1 acquires all 3 pieces of fragment data (including the fragment data 1, the fragment data 2, and the fragment data 3), and then the consensus node 1 may restore the service data through the 3 pieces of fragment data.

The consensus node 2 acquires the fragment data 1 sent by the main consensus node, so that the consensus node 2 can request to pull the fragment data 2 from the consensus node 4 and can request to pull the fragment data 3 from the consensus node 6, the consensus node 2 acquires all 3 pieces of fragment data (including the fragment data 1, the fragment data 2 and the fragment data 3), and the consensus node 2 can restore the 3 pieces of fragment data to obtain service data.

The consensus node 3 acquires the fragment data 2 sent by the main consensus node, so that the consensus node 3 can request to pull the fragment data 1 from the consensus node 1 and can request to pull the fragment data 3 from the consensus node 6, and then the consensus node 3 acquires all 3 fragment data (including the fragment data 1, the fragment data 2 and the fragment data 3), and then the consensus node 3 can restore the 3 fragment data to obtain the service data.

The common identification node 4 acquires the fragment data 2 sent by the main common identification node, so that the common identification node 4 can request to pull the fragment data 1 from the common identification node 2 and can request to pull the fragment data 3 from the common identification node 5, and then the common identification node 4 acquires all 3 fragment data (including the fragment data 1, the fragment data 2 and the fragment data 3), and then the common identification node 4 can restore the 3 fragment data to obtain the service data.

The consensus node 5 acquires the fragment data 3 sent by the main consensus node, so that the consensus node 5 can request to pull the fragment data 1 from the consensus node 2 and can request to pull the fragment data 2 from the consensus node 4, the consensus node 5 acquires all 3 pieces of fragment data (including the fragment data 1, the fragment data 2 and the fragment data 3), and the consensus node 5 can restore the service data through the 3 pieces of fragment data.

The consensus node 6 acquires the fragment data 3 sent by the main consensus node, so that the consensus node 6 can request to pull the fragment data 1 from the consensus node 1 and can request to pull the fragment data 2 from the consensus node 4, the consensus node 6 acquires all 3 fragment data (including the fragment data 1, the fragment data 2 and the fragment data 3), and the consensus node 6 can restore the 3 fragment data to obtain the service data.

Step S105, performing service processing on the service data among the N block link points.

Optionally, through the above process, it may be considered that all the N block link points have acquired the service data, and then the service data may be processed between the N block link points.

For example, if the service data is a service block obtained by bundling by the primary common node, performing service processing on the service data among N block chain nodes may refer to performing block common identification processing on the service block among the N block chain nodes (i.e., performing common identification on the service block), and when the service block common identification passes (e.g., more than 2/3 of the N block chain nodes agree to perform uplink processing on the service block), performing uplink processing on the service block, that is, adding the service block to the block chain.

For another example, the service data acquired by the first block link point may be sent by the service client, and if the first block link point can acquire a data evidence storing request sent by the service client, the data evidence storing request may include the service data, and the data evidence storing request is used to request for storing the service data, that is, the service data refers to any data that needs to be stored. At this time, performing service processing on the service data among the N block link points may refer to that after the N block link points perform validity verification on the service data, each block link node may uplink the service data, so as to achieve the purpose of storing the service data.

By the method, when the data volume of the service data is larger than the data volume threshold value, the first block chain node can fragment the service data and then send the service data to other part or all of the block chain nodes in the block chain network, and the complete service data does not need to be sent to each other block chain node, so that the pressure for one-to-one data transmission (namely single-point transmission pressure) is reduced, the speed for sending the service data is increased, the efficiency for obtaining the service data by each block chain node is improved, and the efficiency for processing the service of the service data is further improved.

The method and the device can acquire M pieces of fragment data of the service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is larger than the data volume threshold; the transmission block chain node corresponding to each piece of fragment data is selected from N-1 block chain link points except for the first block chain link point of the N block chain link points; respectively sending each piece of fragment data to a corresponding transmission block chain node; packing data pulling information of the M pieces of fragment data according to the transmission block chain link point corresponding to each piece of fragment data; broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data; and performing service processing on the service data among the N block link points. Therefore, if the data volume of the service data is larger than the data volume threshold value, the method can transmit the service data after being fragmented, so that the efficiency of transmitting the service data is improved, and the single-point transmission pressure between the block chain nodes in the block chain network is reduced because the service data does not need to be transmitted to N-1 block chain link points simultaneously.

Referring to fig. 7, fig. 7 is a flowchart illustrating a data processing method of a blockchain network according to the present application. The content in the embodiment of the present application may be combined with the content described in the embodiment corresponding to fig. 3, and as shown in fig. 7, the method may include:

step S201, acquiring data pulling information sent by a first block chain node; the first block chain link point belongs to N block chain nodes, the first block chain node and the second block chain node are different block chain nodes, the data pulling information is obtained by packaging the first block chain link point according to transmission block chain link points corresponding to M pieces of fragment data of the service data respectively, the data volume of the service data is larger than a data volume threshold value, the transmission block chain node corresponding to each piece of fragment data is selected from N-1 block chain link points of the N block chain link points except the first block chain link point, and each piece of fragment data is sent to the corresponding transmission block chain node by the first block chain link point respectively; and the data pulling information is used for indicating the N-1 block link points to mutually pull the acquired fragment data and restore the service data.

Optionally, the execution main body in this embodiment of the present application may refer to any one of N block chain nodes, and the block link point serving as the execution main body in this embodiment of the present application may be referred to as a second block chain node, where the second block chain node is not the same as the first block chain node in the above embodiment corresponding to fig. 3, and therefore, more specifically, the second block chain node may refer to any one of N-1 block chain nodes. The N-1 blockchain nodes include other blockchain nodes of the N blockchain nodes except for the first blockchain link node. N is a positive integer, and the details of N are determined according to the actual application scenario, which is not limited herein.

The first block chain node sends data pulling information to each block chain link point in the N-1 block chain nodes, and therefore the second block chain link point can obtain the data pulling information sent by the first block chain node. The process of generating the data pulling information by the first block link point may refer to the specific description in the embodiment corresponding to fig. 3, and is not described herein again.

Step S202, obtaining M pieces of fragment data according to the data pulling information, and restoring to obtain service data.

Optionally, any one of the M pieces of fragment data may be represented as an ith piece of fragment data, where i is a positive integer less than or equal to M, the ith piece of fragment data carries a fragment number, and the fragment number carried by the ith piece of fragment data is used to indicate a fragment position of the ith piece of fragment data in the service data.

Therefore, if the transmission block chain node corresponding to the ith piece of fragmented data is the second block chain node, the second block chain node may acquire the ith piece of fragmented data sent by the first block chain node, and the second block chain node does not need to pull the ith piece of fragmented data to other block chain nodes, but other block chain nodes (e.g., block chain nodes other than the second block chain node in the N-1 block chain nodes) may pull the ith piece of fragmented data to the second block chain node, which may be:

taking the example that the third block link node pulls the ith fragment data to the second block link point as an example, the third block link node may be any one of the block link nodes except for the second block link point in the N-1 block link nodes. The second block link point may acquire a data pulling request sent by the third block link node according to the data pulling information, and may refer to the data pulling request as a first data pulling request, where the first data pulling request may include a data hash value of the ith piece of fragmented data and a piece number of the ith piece of fragmented data, and the data hash value and the piece number in the first data pulling request may be taken by the third block link node from the data pulling information acquired by the third block link node.

And then the second block chain node can retrieve the ith piece of fragment data carrying the data number in the first data pulling request in the storage space of the second block chain node, and can calculate the data hash value of the retrieved ith piece of fragment data, if the second block chain node detects that the calculated data hash value is the same as the data hash value in the first data pulling request, the second block chain node can send the retrieved ith piece of fragment data to the third block chain node, and the ith piece of fragment data is successfully pulled from the second block chain node to the third block chain node. On the contrary, if the second block link point detects that the calculated data hash value is different from the data hash value in the first data pulling request, the second block link point may return a data pulling failure prompt message to the third block link node, so as to prompt the third block link node that the ith fragmented data pulling failure occurs.

More, if the transmission block chain node corresponding to the ith fragmented data is not the second block chain node, the second block chain node may pull the ith fragmented data to the transmission block chain node corresponding to the ith fragmented data, and the process may be:

the data pulling information acquired by the second block link point may include a data hash value of the ith fragment data, a fragment number carried by the ith fragment data, and a node identifier of a transmission block link node corresponding to the ith fragment data, so that the second block link point may generate a second data pulling request according to the data hash value and the fragment number of the ith fragment data in the data pulling information, and the second data pulling request may include the data hash value and the fragment number of the ith fragment data.

Furthermore, the second block link point may send the second data pulling request to a block link node to which a node identifier of a transmission block link node corresponding to the ith fragmented data in the data pulling information belongs (the block link point is the transmission block link node corresponding to the ith fragmented data), and then the block link node to which the node identifier belongs may return the ith fragmented data to the second block link point according to the data hash value and the fragment number in the second data pulling request, and the second block link point may obtain the ith fragmented data returned by the block link node to which the node identifier belongs, so that the second block link point may successfully pull the ith fragmented data to the block link node to which the node identifier belongs.

More, if the second chunk link point does not successfully pull the ith chunk data to the transmission chunk link point corresponding to the ith chunk data according to the second data pull request, the second chunk link point may further send a third data pull request to the first chunk link node (i.e., the original node to which the service data belongs), so as to pull the ith chunk data to the first chunk link point through the third data pull request, where the third data pull request may include a data hash value and a chunk number of the ith chunk data. And then the second block chain node can acquire the ith piece data returned by the first block chain link point.

Through the above description, the second block link point may acquire M pieces of fragment data of the service data through the data pulling information, all the M pieces of fragment data acquired by the second block link point may be pulled to other block link points through the data pulling information (indicating that the second block link point is not a transmission block link node corresponding to any piece of fragment data), or part of the M pieces of fragment data acquired by the second block link point may be pulled to other block link points through the data pulling information, and part of the M pieces of fragment data may be sent as the first block link node acquired by the transmission block link point.

Furthermore, the second block link point may assemble the M pieces of fragment data according to the fragment numbers carried by the M pieces of fragment data, and may restore the M pieces of fragment data to obtain the service data. In fact, any one block link point in the N-1 block link nodes can be restored to obtain the service data through the process of restoring the service data by the second block link point.

More, the second block link point may further use data obtained by assembling and restoring the M pieces of fragmented data as initial service data, and may calculate a data hash value of the initial service data, where the data hash value may be referred to as a verification data hash value, and the data hash value of the service data in the data pulling information acquired by the second block link point may be referred to as a true data hash value. Therefore, the second block link point may compare the verification data hash value with the real data hash value, if the verification data hash value is the same as the real data hash value, the initial service data obtained by the reduction may be used as the service data obtained by the final reduction, otherwise, if the verification data hash value is different from the real data hash value, the M pieces of fragment data need to be obtained again to reduce the service data, or the service data needs to be directly pulled to the first block link point.

Step S203, performing service processing on the service data among the N block link points.

Through the embodiment of the application, the N-1 block link points can gradually pull the fragment data to other block link points in a fragment mode without acquiring the service data with large data volume sent by the first block link point at one time, so that the single-point transmission pressure is reduced. In addition, if the service data is a service block, after the second block link node pulls the one or more fragmented data, the transaction data included in the one or more fragmented data can be verified first, and the verification of all transaction data included in the service data is not performed after the whole service data is obtained by restoration, so that the efficiency of verifying the transaction data in the service block is improved, and the efficiency of commonly identifying the service block is improved.

Referring to fig. 8, fig. 8 is a schematic view of a data processing scenario provided in the present application. As shown in fig. 8, the consensus node 1 may be any one of the N-1 blockchain nodes, the M pieces of fragmented data may include a piece of fragmented data 1, a piece of fragmented data 2, and a piece of fragmented data 3, and the piece of fragmented data 1, the piece of fragmented data 2, and the piece of fragmented data 3 form a service block. The fragmented data 1 may be sent by the primary common node (i.e., the first blockchain node) to the common node 1, that is, the common node 1 may be a transmission blockchain node corresponding to the fragmented data 1. Therefore, the common node 1 can pull the fragment data 2 and the fragment data 3 to other block link points. Moreover, the consensus node 1 can effectively verify the transaction data in the acquired fragment data at the time of acquiring the fragment data 1, the fragment data 2, or the fragment data 3, and does not need to wait until the whole service block is acquired to verify the transaction in the service block.

When the common identification node 1 acquires the fragment data 1, the pulled fragment data 2 and the pulled fragment data 3 sent by the main common identification node, the fragment data 1, the fragment data 2 and the fragment data 3 may be assembled (the initial service data may be obtained after the assembly), integrity of the assembled data is verified (it may refer to whether the hash value of the verification data of the initial service data is the same as the hash value of the real data of the service data, if so, the integrity verification passes), and after the integrity verification passes, a subsequent vote on the assembled service block may be performed, that is, the common identification is performed, that is, whether to uplink the service block is performed.

The method and the device can acquire M pieces of fragment data of the service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is greater than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points; respectively sending each piece of fragment data to a corresponding transmission block chain node; packing data pulling information of the M pieces of fragment data according to the transmission block chain link point corresponding to each piece of fragment data; broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating the N-1 block link points to pull the acquired fragment data mutually and restoring the service data; and performing service processing on the service data among the N block link points. Therefore, if the data volume of the service data is larger than the data volume threshold value, the method can transmit the service data after being fragmented, so that the efficiency of transmitting the service data is improved, and the single-point transmission pressure between the block chain nodes in the block chain network is reduced because the service data does not need to be transmitted to N-1 block chain link points simultaneously.

Referring to fig. 9, fig. 9 is a schematic structural diagram of a data processing apparatus of a blockchain network according to the present application. The data processing apparatus of the blockchain network may be a computer program (including program code) running in a computer device, for example, the data processing apparatus of the blockchain network is an application software, the data processing apparatus of the blockchain network may be configured to execute corresponding steps in the method provided by the embodiment of the present application, and the data processing apparatus of the blockchain network may be applied to the first blockchain node. As shown in fig. 9, the data processing apparatus 1 of the block chain network may include: the system comprises an acquisition module 11, a sending module 12, a packaging module 13, a broadcasting module 14 and a service processing module 15;

an obtaining module 11, configured to obtain M pieces of fragment data of service data and a transmission block link node corresponding to each piece of fragment data, where M is a positive integer; the data volume of the service data is greater than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points;

a sending module 12, configured to send each piece of fragmented data to a corresponding transmission block link node respectively;

the packing module 13 is configured to pack data pulling information of the M pieces of fragmented data according to the transmission block link point corresponding to each piece of fragmented data;

the broadcasting module 14 is configured to broadcast the data pulling information to N-1 block link nodes; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data;

and the service processing module 15 is configured to perform service processing on the service data among the N block link points.

Optionally, any one of the M pieces of sliced data is represented as the ith piece of sliced data, where i is a positive integer less than or equal to M, and the ith piece of sliced data carries a sliced number; the fragment number carried by the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the mode that the sending module 12 sends each piece of fragment data to the corresponding transmission block link node respectively includes:

Optionally, the manner of packing the data pulling information of the M pieces of fragmented data by the packing module 13 according to the transmission block link point corresponding to each piece of fragmented data includes:

respectively generating data pulling sub-information of each fragment data according to the transmission block chain node corresponding to each fragment data;

Optionally, the packing module 13 generates a data pulling sub-information manner of each piece of fragmented data according to the transmission block link node corresponding to each piece of fragmented data, respectively, where the data pulling sub-information manner includes:

acquiring a node identifier of a transmission block link node corresponding to the ith fragment data;

acquiring a data hash value of the ith fragment data;

and generating data pulling sub-information of the ith fragmented data according to the node identification, the data hash value of the ith fragmented data and the fragmented number carried by the ith fragmented data.

Optionally, the apparatus 1 is further configured to:

acquiring a fragment data volume threshold;

fragmenting the service data according to a fragmentation data volume threshold to obtain M fragmentation data; the data volume of one piece of sliced data is less than or equal to the sliced data volume threshold.

Optionally, the block chain network is a consensus network, the N block chain link points are all consensus nodes, the first block chain node is a master consensus node among the N block chain nodes, and the service data is a service block packed by the master consensus node;

the service processing module 15 performs service processing on the service data among the N block link points, and the method includes:

Optionally, the apparatus 1 is further configured to:

and performing data storage and certification processing on the service data among the N block link points.

According to an embodiment of the present application, the steps involved in the data processing method of the blockchain network shown in fig. 3 may be performed by respective modules in the data processing apparatus 1 of the blockchain network shown in fig. 9. For example, step S101 shown in fig. 3 may be performed by the obtaining module 11 in fig. 9, and step S102 shown in fig. 3 may be performed by the sending module 12 in fig. 9; step S103 shown in fig. 3 may be performed by the packetizing module 13 in fig. 9, step S104 shown in fig. 3 may be performed by the broadcasting module 14 in fig. 9, and step S105 shown in fig. 3 may be performed by the service processing module 15 in fig. 9.

The method and the device can acquire M pieces of fragment data of the service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is greater than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points; respectively sending each piece of fragment data to a corresponding transmission block chain node; packing data pulling information of the M pieces of fragment data according to the transmission block chain link point corresponding to each piece of fragment data; broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data; and performing service processing on the service data among the N block chain nodes. Therefore, if the data volume of the service data is larger than the data volume threshold value, the device provided by the application can transmit the service data after being fragmented, so that the efficiency of transmitting the service data is improved, and the single-point transmission pressure between the block chain nodes in the block chain network is reduced because the service data does not need to be transmitted to N-1 block chain link points simultaneously.

According to an embodiment of the present application, each module in the data processing apparatus 1 of the blockchain network shown in fig. 9 may be respectively or completely combined into one or several units to form the structure, or some unit(s) may be further split into multiple sub-units with smaller functions, which may implement the same operation without affecting implementation of technical effects of the embodiment of the present application. The modules are divided based on logic functions, and in practical application, the functions of one module can be realized by a plurality of units, or the functions of a plurality of modules can be realized by one unit. In other embodiments of the present application, the data processing apparatus 1 of the blockchain network may also include other units, and in practical applications, these functions may also be implemented by assistance of other units, and may be implemented by cooperation of a plurality of units.

According to an embodiment of the present application, the data processing apparatus 1 of the blockchain network as shown in fig. 9 may be constructed by running a computer program (including program codes) capable of executing the steps involved in the corresponding method as shown in fig. 3 on a general-purpose computer device such as a computer including a Central Processing Unit (CPU), a random access storage medium (RAM), a read-only storage medium (ROM), and the like processing elements and storage elements, and the data processing method of the blockchain network of the embodiment of the present application may be implemented. The computer program may be recorded on a computer-readable recording medium, for example, and loaded into and executed by the computing apparatus via the computer-readable recording medium.

Referring to fig. 10, fig. 10 is a schematic structural diagram of a data processing apparatus of a blockchain network according to the present application. The data processing apparatus of the blockchain network may be a computer program (including program code) running in a computer device, for example, the data processing apparatus of the blockchain network is an application software, the data processing apparatus of the blockchain network may be configured to execute corresponding steps in the method provided by the embodiment of the present application, and the data processing apparatus of the blockchain network may be applied to the second blockchain node. As shown in fig. 10, the data processing apparatus 2 of the block chain network may include: the information acquisition module 21, the restoration module 22 and the data processing module 23;

the information obtaining module 21 is configured to obtain data pulling information sent by a first block chain node; the first block chain link point belongs to N block chain nodes, the first block chain node and the second block chain node are different block chain nodes, the data pulling information is obtained by packaging the first block chain link point according to transmission block chain link points corresponding to M pieces of fragment data of the service data respectively, the data volume of the service data is larger than a data volume threshold value, the transmission block chain node corresponding to each piece of fragment data is selected from N-1 block chain link points of the N block chain link points except the first block chain link point, and each piece of fragment data is sent to the corresponding transmission block chain node by the first block chain link point respectively; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data;

the restoring module 22 is configured to obtain M pieces of fragment data according to the data pulling information, and restore the M pieces of fragment data to obtain service data;

and the data processing module 23 is configured to perform service processing on the service data among the N block link points.

the above device 2 is also configured to:

the process of obtaining the ith fragment data by the restoring module 22 according to the data pulling information includes:

Optionally, the apparatus 1 is further configured to:

and acquiring the ith piece of fragment data returned by the first block chain link point according to the data hash value and the fragment number of the ith piece of fragment data.

the method for restoring the service data by the restoring module 22 includes:

According to an embodiment of the present application, the steps involved in the data processing method of the blockchain network shown in fig. 7 may be performed by respective modules in the data processing apparatus 2 of the blockchain network shown in fig. 10. For example, step S201 shown in fig. 7 may be performed by the information obtaining module 21 in fig. 10, and step S202 shown in fig. 7 may be performed by the restoring module 22 in fig. 10; step S203 shown in fig. 7 may be performed by the data processing module 23 in fig. 10.

The method and the device can acquire M pieces of fragment data of the service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is larger than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points; respectively sending each piece of fragment data to a corresponding transmission block chain node; packing data pulling information of M pieces of fragment data according to the link points of the transmission block corresponding to each piece of fragment data; broadcasting data pulling information to N-1 block chain nodes; the data pulling information is used for indicating N-1 block link points to mutually pull the acquired fragment data and restore the service data; and performing service processing on the service data among the N block link points. Therefore, if the data volume of the service data is larger than the data volume threshold value, the device provided by the application can transmit the service data after being fragmented, so that the efficiency of transmitting the service data is improved, and the single-point transmission pressure between the block chain nodes in the block chain network is reduced because the service data does not need to be transmitted to N-1 block chain link points simultaneously.

According to an embodiment of the present application, each module in the data processing apparatus 2 of the blockchain network shown in fig. 10 may be respectively or entirely combined into one or several units to form the blockchain network, or some unit(s) therein may be further split into multiple sub-units with smaller functions, which may implement the same operation without affecting implementation of technical effects of the embodiment of the present application. The modules are divided based on logic functions, and in practical application, the functions of one module can be realized by a plurality of units, or the functions of a plurality of modules can be realized by one unit. In other embodiments of the present application, the data processing apparatus 1 of the blockchain network may also include other units, and in practical applications, these functions may also be implemented by assistance of other units, and may be implemented by cooperation of a plurality of units.

According to an embodiment of the present application, the data processing apparatus 1 of the blockchain network as shown in fig. 10 may be constructed by running a computer program (including program codes) capable of executing the steps involved in the corresponding method as shown in fig. 7 on a general-purpose computer device such as a computer including a Central Processing Unit (CPU), a random access storage medium (RAM), a read-only storage medium (ROM), and the like processing elements and storage elements, and the data processing method of the blockchain network of the embodiment of the present application may be implemented. The computer program may be recorded on a computer-readable recording medium, for example, and loaded into and executed by the computing apparatus via the computer-readable recording medium.

Referring to fig. 11, fig. 11 is a schematic structural diagram of a computer device provided in the present application. As shown in fig. 11, the computer device 1000 may include: the processor 1001, the network interface 1004, and the memory 1005, and the computer device 1000 may further include: a user interface 1003, and at least one communication bus 1002. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display) and a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a standard wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (non-volatile memory), such as at least one disk memory. The memory 1005 may alternatively be at least one memory device located remotely from the processor 1001. As shown in fig. 11, a memory 1005, which is a kind of computer storage medium, may include therein an operating system, a network communication module, a user interface module, and a device control application program.

In the computer device 1000 shown in fig. 11, the network interface 1004 may provide a network communication function; the user interface 1003 is an interface for providing a user with input; and the processor 1001 may be used to invoke a device control application stored in the memory 1005 to implement:

acquiring M pieces of fragment data of service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is greater than the data volume threshold; the transmission block link node corresponding to each piece of partitioned data is selected from N-1 block link points except the first block link point of the N block link points;

packing data pulling information of M pieces of fragment data according to the link points of the transmission block corresponding to each piece of fragment data;

and performing service processing on the service data among the N block chain nodes.

Optionally, the processor 1001 may be further configured to call a device control application stored in the memory 1005 to implement:

acquiring data pulling information sent by a first block chain node; the first block link point belongs to N block link nodes, the first block link node and the second block link node are different block link nodes, data pulling information is obtained by packaging the first block link point according to transmission block link points corresponding to M pieces of fragment data of service data, the data volume of the service data is larger than a data volume threshold value, the transmission block link node corresponding to each piece of fragment data is selected from N-1 block link points except the first block link point of the N block link points, and each piece of fragment data is sent to the corresponding transmission block link node by the first block link point; the data pulling information is used for indicating the N-1 block link points to pull the acquired fragment data mutually and restoring the service data;

It should be understood that the computer device 1000 described in this embodiment may perform the description of the data processing method of the blockchain network in the embodiment corresponding to fig. 3 or fig. 7, and may also perform the description of the data processing device 1 of the blockchain network in the embodiment corresponding to fig. 9 and the description of the data processing device 2 of the blockchain network in the embodiment corresponding to fig. 10, which are not described again here. In addition, the beneficial effects of the same method are not described in detail.

Furthermore, it is to be noted here that: the present application further provides a computer-readable storage medium, where the aforementioned computer programs executed by the data processing apparatus 1 of the blockchain network and the data processing apparatus 2 of the blockchain network are stored in the computer-readable storage medium, and the computer programs include program instructions, and when the processor executes the program instructions, the description of the data processing method of the blockchain network in the embodiment corresponding to fig. 3 or fig. 7 can be performed, and therefore, the description thereof will not be repeated here. In addition, the beneficial effects of the same method are not described in detail. For technical details not disclosed in the embodiments of the computer storage medium referred to in the present application, reference is made to the description of the embodiments of the method of the present application.

As an example, the program instructions described above may be executed on one computer device, or on multiple computer devices located at one site, or on multiple computer devices distributed over multiple sites and interconnected by a communication network, which may constitute a blockchain network.

The computer readable storage medium may be a data processing apparatus of the blockchain network provided in any of the foregoing embodiments or an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. The computer readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a Smart Memory Card (SMC), a Secure Digital (SD) card, a flash memory card (flash card), and the like provided on the computer device. Further, the computer-readable storage medium may also include both an internal storage unit and an external storage device of the computer device. The computer-readable storage medium is used for storing the computer program and other programs and data required by the computer device. The computer readable storage medium may also be used to temporarily store data that has been output or is to be output.

A computer program product or computer program is provided that includes computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instruction from the computer-readable storage medium, and the processor executes the computer instruction, so that the computer device performs the description of the data processing method of the blockchain network in the embodiment corresponding to fig. 3 or fig. 7, which will not be described again here. In addition, the beneficial effects of the same method are not described in detail. For technical details not disclosed in embodiments of the computer-readable storage medium referred to in the present application, reference is made to the description of embodiments of the method of the present application.

The terms "first," "second," and the like in the description and claims of embodiments of the present application and in the drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "comprises" and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, apparatus, product, or apparatus that comprises a list of steps or elements is not limited to the listed steps or modules, but may alternatively include other steps or modules not listed or inherent to such process, method, apparatus, product, or apparatus.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

The method and the related apparatus provided by the embodiments of the present application are described with reference to the flowchart and/or the structural diagram of the method provided by the embodiments of the present application, and each flow and/or block of the flowchart and/or the structural diagram of the method, and the combination of the flow and/or block in the flowchart and/or the block diagram can be specifically implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block or blocks of the block diagram. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block or blocks of the block diagram. 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 such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

The above disclosure is only for the purpose of illustrating the preferred embodiments of the present application and should not be taken as limiting the scope of the present application, so that the present application will be covered by the appended claims.

Claims

1. A data processing method for a blockchain network, the blockchain network including N blockchain link points, N being a positive integer, the method being applied to a first blockchain node, the first blockchain node being any one of the N blockchain nodes, the method comprising:

acquiring M pieces of fragment data of service data and a transmission block chain node corresponding to each piece of fragment data, wherein M is a positive integer; the data volume of the service data is greater than a data volume threshold; the transmission block link node corresponding to each piece of sliced data is selected from N-1 block link points of the N block link points except the first block link point;

packing the data pulling information of the M pieces of fragment data according to the transmission block chain node corresponding to each piece of fragment data;

broadcasting the data pulling information to the N-1 block chain nodes; the data pulling information is used for indicating the N-1 block chain link points to mutually pull the acquired fragment data and restore the service data;

2. The method according to claim 1, wherein any one of the M pieces of sliced data is represented as ith piece of sliced data, i is a positive integer less than or equal to M, and the ith piece of sliced data carries a slice number; the fragment number carried by the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the sending each piece of sliced data to a corresponding transmission block chain node respectively includes:

3. The method according to claim 2, wherein said packing the data pulling information of the M fragmented data according to the transport block chain node corresponding to each fragmented data includes:

4. The method according to claim 3, wherein the generating the data pulling sub information of each piece of fragmented data according to the transmission block chain node corresponding to each piece of fragmented data respectively comprises:

acquiring a data hash value of the ith fragment data;

5. The method of claim 1, further comprising:

acquiring a fragment data volume threshold;

fragmenting the service data according to the fragmentation data volume threshold to obtain the M fragmentation data; the data volume of one piece of sliced data is less than or equal to the sliced data volume threshold.

6. The method of claim 1, wherein the blockchain network is a consensus network, wherein the N blockchain nodes are all consensus nodes, wherein the first blockchain node is a master consensus node of the N blockchain nodes, and wherein the service data is a service block bundled by the master consensus node;

the performing service processing on the service data among the N block link points includes:

and when the service block common identification passes, performing uplink processing on the service block.

7. The method of claim 1, further comprising:

acquiring a data certificate storage request submitted by a service client; the data authentication request comprises the service data;

and carrying out data storage and certification processing on the service data among the N block chain link points.

8. A data processing method for a blockchain network comprising N blockchain link points, N being a positive integer, the method being applied to a second blockchain node being any one of the N blockchain nodes, the method comprising:

acquiring data pulling information sent by a first block chain node; the first block link point belongs to the N block link points, the first block link node and the second block link node are different block link nodes, the data pulling information is obtained by packaging the first block link point according to transmission block link points corresponding to M fragmented data of service data, the data volume of the service data is greater than a data volume threshold value, the transmission block link node corresponding to each fragmented data is selected from N-1 block link points of the N block link points except the first block link point, and each fragmented data is sent to the corresponding transmission block link node by the first block link point; the data pulling information is used for indicating the N-1 block chain link points to mutually pull the acquired fragment data and restore the service data;

acquiring the M pieces of fragmented data according to the data pulling information, and restoring to obtain the service data;

9. The method according to claim 8, wherein any one of the M sliced data is represented as ith sliced data, i being a positive integer less than or equal to M; the ith fragment data carries a fragment number; the fragment number carried by the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the method further comprises the following steps:

if the transmission block chain node corresponding to the ith fragmented data is the second block chain node, acquiring a first data pulling request sent by a third block chain node according to the data pulling information; the first data pulling request carries a data hash value of the ith fragment data and a fragment number of the ith fragment data; the third block link node belongs to block link points of the N-1 block link nodes other than the second block link point;

retrieving the ith fragment data carrying the data number in the first data pulling request, and calculating a data hash value of the retrieved ith fragment data;

and if the calculated data hash value is the same as the data hash value in the first data pulling request, sending the retrieved ith fragmented data to the third blockchain node.

10. The method according to claim 8, wherein any one of the M sliced data is represented as ith sliced data, i being a positive integer less than or equal to M; the data pulling information comprises a data hash value of the ith fragment data, a node identifier of a transmission block chain node corresponding to the ith fragment data and a fragment number of the ith fragment data; the fragment number of the ith fragment data is used for indicating the fragment position of the ith fragment data in the service data;

the process of obtaining the ith fragment data according to the data pulling information includes:

and acquiring the ith fragment data returned by the block chain node to which the node identifier belongs according to the data hash value and the fragment number of the ith fragment data.

11. The method of claim 10, further comprising:

12. The method of claim 8, wherein the data pull information comprises a true data hash value of the traffic data;

the recovering to obtain the service data includes:

assembling the M pieces of fragment data acquired according to the data pulling information to obtain initial service data;

13. A data processing apparatus of a blockchain network, the blockchain network including N blockchain link points, N being a positive integer, the apparatus being applied to a first blockchain node, the first blockchain node being any one of the N blockchain nodes, the apparatus comprising:

the system comprises an acquisition module, a transmission module and a processing module, wherein the acquisition module is used for acquiring M fragment data of service data and a transmission block chain node corresponding to each fragment data, and M is a positive integer; the data volume of the service data is greater than a data volume threshold value; the transmission block link node corresponding to each piece of sliced data is selected from N-1 block link points of the N block link points except the first block link point;

a sending module, configured to send each piece of sliced data to a corresponding transmission block link node;

a packing module, configured to pack the data pulling information of the M fragmented data according to the transmission block chain node corresponding to each fragmented data;

a broadcasting module, configured to broadcast the data pulling information to the N-1 blockchain nodes; the data pulling information is used for indicating the N-1 block link points to pull the acquired fragment data mutually and restore the service data;

and the service processing module is used for performing service processing on the service data among the N block chain link points.

14. A data processing apparatus of a blockchain network, the blockchain network including N blockchain link points, N being a positive integer, the apparatus being applied to a second blockchain node, the second blockchain node being any one of the N blockchain nodes, the apparatus comprising:

the information acquisition module is used for acquiring data pulling information sent by a first block chain node; the first block link point belongs to the N block link nodes, the first block link node and the second block link node are different block link nodes, the data pulling information is obtained by packaging the first block link point according to transmission block link points corresponding to M fragmented data of service data, the data volume of the service data is greater than a data volume threshold value, the transmission block link node corresponding to each fragmented data is obtained by selecting from N-1 block link points of the N block link points except the first block link point, and each fragmented data is sent to the corresponding transmission block link node by the first block link point; the data pulling information is used for indicating the N-1 block link points to pull the acquired fragment data mutually and restore the service data;

the restoring module is used for acquiring the M pieces of fragment data according to the data pulling information and restoring to obtain the service data;

and the data processing module is used for carrying out service processing on the service data among the N block chain link points.

15. A computer program product comprising computer programs/instructions which, when executed by a processor, implement the steps of the method of claims 1-12.

16. A computer arrangement comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to carry out the steps of the method according to any one of claims 1-12.

17. 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 to perform the method of any of claims 1-12.