WO2019157740A1

WO2019157740A1 - Method for processing data, apparatus for processing data and device for processing data

Info

Publication number: WO2019157740A1
Application number: PCT/CN2018/076882
Authority: WO
Inventors: 冯淑兰; 常俊仁; 张向东; 张亮亮
Original assignee: 华为技术有限公司
Priority date: 2018-02-14
Filing date: 2018-02-14
Publication date: 2019-08-22
Also published as: CN111713088B; CN111713088A

Abstract

Provided are a method and apparatus for processing data. The method comprises: a first node determining a first credit value of the first node, wherein the first node is a node in a blockchain network; and where the first node determines that the first credit value is greater than a first pre-set threshold value, calculating proof of work based on a first target value, the first target value being a target value corresponding to a first difficulty, wherein the first difficulty is less than a second difficulty corresponding to calculation of proof of work based on a pre-set target value. The method for processing data of the embodiments of the present application can reduce the difficulty of a consensus algorithm in a blockchain network.

Description

Method for processing data, device for processing data, and device for processing data

Technical field

The present application relates to the field of communications, and more particularly to a method of processing data, an apparatus for processing data, and an apparatus for processing data in the field of communications.

Background technique

In the blockchain network, a consensus mechanism is introduced to solve the problem that the public node agrees to a certain information and updates it to the total shared ledger. A typical consensus mechanism is Proof of work (PoW).

At present, the PoW algorithm is a computing power of each node in a blockchain network, and calculating the value of a random number (Nonce) is a process that consumes resources extremely. Therefore, how to reduce the difficulty of the PoW algorithm in the blockchain network is an urgent problem to be solved.

Summary of the invention

The present application provides a method for processing data, an apparatus for processing data, and a device for processing data, which can reduce the difficulty of the PoW algorithm in the blockchain network.

In a first aspect, a method of processing data is provided, the method comprising: a first node determining a first credit value of the first node, wherein the first node is a node in a blockchain network. If the first node determines that the first credit value is greater than a first preset threshold, the first node performs a workload proof calculation based on the first target value, where the first target value corresponds to the first a target value of the difficulty, wherein the first difficulty is less than a second difficulty corresponding to the workload proof calculation based on the preset target value.

According to the method for processing data according to the embodiment of the present application, the node in the blockchain first determines the size of its current credit value. When the credit value exceeds the first preset threshold, the calculation may be performed when the workload proof calculation is performed. The first target value is the calculation of the completed workload proof, and the difficulty of calculating the first target value is less than the difficulty of calculating the preset target value, then, when the credit value of the node satisfies the preset requirement, the calculation of the node workload proof can be reduced. Difficulty, which can save the node's power consumption in the proof of workload calculation.

In conjunction with the first aspect, in an implementation manner of the first aspect, the method further includes: the first node determining a second credit value of the first node. The first node, when determining that the second credit value is less than or equal to the first preset threshold, performs, by the first node, a workload proof calculation based on the preset target value.

According to the method for processing data according to the embodiment of the present application, the node in the blockchain first determines the size of its current credit value. When the credit value does not exceed the first preset threshold, when calculating the workload proof, the calculation is performed. The preset target value is the proof of completion workload, then, when the node credit value does not meet the preset requirement, the workload verification is performed based on the existing workload proof calculation difficulty, and the above second credit value and the first credit are determined. It can be done at different times and can be compatible with existing workload proof calculation methods.

With reference to the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the method further includes: the first node determining a third credit value, where the third credit value is a credit of the second node a value, wherein the second node is any one of the blockchain networks except the first node. Determining, by the first node, a fourth credit value, where the fourth credit value is a credit value of a third node, wherein the third node is in the blockchain network except the first node and the Any node other than the second node. The first node sends transaction information to the second node if it is determined that the third credit value is higher than the fourth credit value.

According to the method for processing data in the embodiment of the present application, the first node in the blockchain may calculate the credit value of each node in the blockchain, and when the size of the credit value of the second node meets the second preset threshold, the third node When the size of the credit value satisfies the second preset threshold, the first node may consider the second node to be a trusted node, and may send the transaction only to the trusted second node when the first node has a transaction to issue. , can reduce the workload to prove the calculated power consumption.

With reference to the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the method further includes: the first node determining a third credit value, where the third credit value is a credit of the second node a value, wherein the second node is any one of the blockchain networks except the first node. Determining, by the first node, a fourth credit value, where the fourth credit value is a credit value of a third node, wherein the third node is in the blockchain network except the first node and the Any node other than the second node. The first node, after determining that the third credit value is higher than the fourth credit value, sending transaction information to the second node, and after transmitting the transaction information to the second node, Transmitting the transaction information to the third node.

According to the method for processing data in the embodiment of the present application, the first node in the blockchain may calculate the credit value of each node in the blockchain, and when the size of the credit value of the second node meets the second preset threshold, the third node When the size of the credit value satisfies the second preset threshold, the first node may consider the second node to be a trusted node, and may send the transaction to the trusted second node first when there is a transaction to be sent by the first node. The transaction is sent to the third node after the transaction is sent to the second node, which can reduce the power consumption of the workload proof calculation. For example, the transaction information is sent to the second node at the fourth time, the transaction information is sent to the third node at the fifth time, and the fifth time is later than the fourth time.

Optionally, the second preset threshold may be a value that is equal to the first preset threshold specified by the system, or may be a value that is different from the first preset threshold that is set by the system.

In conjunction with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, before the determining, by the first node, the first credit value, the method further includes: the first node to the area The X nodes in the blockchain network send a join request message, the join request message includes credit information, and the credit information is used to indicate the latest credit value of the first node, where X is an integer greater than or equal to 1.

According to the method for processing data according to the embodiment of the present application, when the first node is not a node in the blockchain network, the first request to send a join request message to the blockchain network, where, optionally, the first The join request message of the node may be broadcasted in the blockchain network, and the join request message of the first node includes credit information, and the node in the blockchain network may authenticate the join request message of the first node. Judging the credibility of the credit value provided by the first node increases the security of the blockchain network.

With reference to the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the method further includes: the first node receiving an authentication confirmation message sent by at least one of the X nodes and Adding to the blockchain network, the authentication confirmation message is used to indicate that the first node can join the blockchain network; or the first node queries the authentication confirmation from the blockchain network The message joins the blockchain network, and the authentication confirmation message is used to confirm that the first node can join the blockchain network.

According to the method for processing data according to the embodiment of the present application, the node that authenticates the join request message of the first node may be the X nodes in the blockchain network, and the authentication confirmation message sent by at least one of the X nodes. Or, the first node may query the authentication acknowledgement message in the blockchain network, and join the blockchain network, so that the first node joins the blockchain network and carries its current credit information, It is advantageous for the first node to perform workload verification based on the credit value.

In conjunction with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the method further includes: the first node sending credit statistics information to a node in a credit statistic blockchain network.

According to the method for processing data according to the embodiment of the present application, the first node may first send the credit statistics information to the credit statistic blockchain network, which facilitates the acquisition of subsequent credit values.

In conjunction with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the first node performs a workload proof calculation based on the first target value, including: the first node is based on the first target value The workload proof calculation is used to obtain the consensus confirmation right. The first node generates a target block.

According to the method for processing data according to the embodiment of the present application, the first node may obtain the consensus confirmation right after performing the workload proof calculation based on the first target value, and generate a target block, which can reduce the power consumption of the first node workload proof calculation. .

In conjunction with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the method further includes: the first node determining a fifth credit value; the target block including the fifth credit a value; the first node determines that the fifth credit value is the first credit value minus a preset credit consumption value.

According to the method for processing data according to the embodiment of the present application, after the first node performs the workload confirmation calculation based on the first target value to obtain the consensus confirmation right, the first node re-determines the current credit value, and the current credit value is larger than the first node. The first credit value is small, and the credit consumption value calculated by the first node for the workload proof calculation is subtracted, which can prevent the first node from performing the workload proof calculation based on a target value for a plurality of times to affect the security of the blockchain network.

In another implementation manner of the first aspect, the preset credit consumption value is that when the The credit value consumed.

According to the method for processing data according to the embodiment of the present application, the credit value consumed by the first node when obtaining the consensus confirmation right by performing the workload proof calculation based on the first target value is subtracted from the consumed credit value when the credit value is re-determined, Accurately determine the latest credit value of the first node.

In combination with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the target block further includes a height difference, where the height difference is used to indicate that the first node is based on the first A target value obtains a block height difference between the block in which the consensus confirmation right is obtained and the block in which the consensus confirmation right is obtained based on the first target value.

According to the method for processing data according to the embodiment of the present application, the block generated by the first node further includes: the first node calculates the first target value, obtains the consensus confirmation right, and currently calculates the first target value to obtain a consensus confirmation right. The number of times the workload proof calculation is performed, so that other nodes in the blockchain network can know whether the first node has the right to calculate the first target value to obtain the consensus confirmation right.

In conjunction with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the method further includes: the first node receiving first transaction information, where the first transaction information includes a credit demand value Information, the credit demand information is used to indicate a credit value required for the first transaction to be confirmed by the blockchain node for consensus confirmation.

According to the method for processing data according to the embodiment of the present application, the first node receives the first transaction information in the blockchain network before performing the workload proof calculation, and the first node acquires the credit demand value required to perform the first transaction, Judging whether the credit value of the self meets the credit demand value required for the first transaction can improve the completion speed of the transaction in the blockchain network.

In conjunction with the first aspect and the foregoing implementation manner, in another implementation manner of the first aspect, the first node performs a workload verification calculation based on the first target value, and further includes:

Optionally, after the first node performs the workload proof calculation based on the first target value to obtain the consensus confirmation right, the first node determines that the competition of the consensus confirmation right of the next N blocks is no longer based on the first The target value is used to calculate the workload;

Optionally, after the first node performs the workload proof calculation based on the first target value to obtain the consensus confirmation right, the first node determines that the competition of the consensus confirmation right of the block in the subsequent Y time units is not Performing a workload proof calculation based on the first target value;

Optionally, after the first node performs the workload proof calculation to obtain the consensus confirmation right based on the first target value, the first node determines that the competition of the consensus confirmation right of the subsequent N blocks is based on the preset target value. Or the second target value is subjected to the workload proof calculation, the second target value is a target value corresponding to the third difficulty, and the third difficulty is less than the second difficulty and greater than the first difficulty;

Optionally, after the first node performs the workload proof calculation to obtain the consensus confirmation right based on the first target value, the first node determines, according to the pre-competition of the consensus confirmation right in the subsequent Y time units. Setting a target value or the second target value to perform a workload proof calculation; wherein the N and the Y are positive integers.

According to the method for processing data according to the embodiment of the present application, the blockchain network specifies that the first node performs transaction processing in the next N times or Y time units after performing the workload verification calculation based on the first target value to obtain the consensus confirmation right. The workload proof calculation cannot be performed again based on the first target value, and the first node can be prevented from performing the workload verification calculation based on the first target value multiple times to obtain the consensus confirmation right to reduce the security of the blockchain network.

It should be understood that the first node described above may be any one of the blockchain networks, for example, a computer or server interconnected in the network.

A second aspect provides a method for processing data, the method comprising: receiving, by a second node, a join request message sent by a first node, where the join request message includes credit information, where the credit information is used to indicate the first The credit value of the node in the first blockchain network, the second node is a node in the second blockchain network, and the first node is a node in the first blockchain network. And obtaining, by the second node, a credit value of the first node in the first blockchain network according to the credit information.

According to the method for processing data according to the embodiment of the present application, the second node receives the request information sent by the first node, and determines the latest credit value of the first node, and can obtain the current credit value when the first node joins the blockchain network. The information is beneficial to the first node to perform workload proof calculation based on the credit value.

With reference to the second aspect, in an implementation manner of the second aspect, the acquiring, by the second node, the credit value of the first node in the first blockchain network according to the credit information includes:

The credit information is a credit value of the first node in the first blockchain network, and the second node acquires the credit value according to the credit information.

According to the method for processing data according to the embodiment of the present application, the first node may directly include the credit value of the first node in the first blockchain network in the join request message and send the message to the second node, where the second node receives After the join request message, the credit value of the first node in the first blockchain network can be obtained.

With reference to the second aspect and the foregoing implementation manner, in another implementation manner of the second aspect, the second node acquires, according to the credit information, the first node in the first blockchain network. The credit value includes: the credit information includes target block information in the target blockchain network that records the credit value. And the second node sends a query request message to the target blockchain network according to the target block information, where the query request message is used to request to acquire the credit value. The second node receives the query response information sent by the third node, where the query response information includes the credit value, and the third node is a node in the target blockchain network.

According to the method for processing data according to the embodiment of the present application, the second node may query the credit value information of the first node from the target blockchain network, and increase the method for obtaining the credit value of the first node.

Optionally, in some embodiments, the target blockchain network may be the first blockchain network to which the first node belongs, that is, the join request message sent by the first node includes the first node in the first block to which the first node belongs. The block information of the credit value in the chain network, the second node queries the credit value according to the block information, and the third node in the first blockchain network includes the credit value in the query response information, and sends Give the second node.

Optionally, in other embodiments, the target blockchain network may be a credit statistic blockchain network, that is, the join request message sent by the first node includes the first node in the first blockchain network to which the first node belongs. The credit value is located in the block information of the credit statistic blockchain network, and the second node queries the credit value according to the block information, and the third node in the credit statistic blockchain network includes the credit value in the query response information. , sent to the second node.

In a third aspect, a method for processing data is provided, the method comprising: receiving, by a third node, credit statistics information sent by a first node, where the third node is a node in a network of credit statistics blockchains; The three nodes determine the credit value of the first node according to the credit statistical information.

According to the method for processing data according to the embodiment of the present application, the third node may be used as a node for calculating the latest credit value of the first node in the credit statistic blockchain network, and calculate the credit value of the first node, which can be the latest of the subsequent first node. The credit value inquiry is convenient.

With reference to the third aspect, in an implementation manner of the third aspect, the method further includes: the third node receiving the query request information sent by the second node, where the query request information is used to request to acquire the first node The credit value, the second node is a node in the first blockchain network. The third node sends query feedback information to the second node, where the query feedback information includes a credit value of the first node.

According to the method for processing data according to the embodiment of the present application, the third node may feed back the latest credit value of the first node to the second node that queries the latest credit value of the first node, and increase the second node to acquire the credit value of the first node. method.

A fourth aspect provides a method for processing data, the method comprising: a first node acquiring a credit value of N nodes in a first blockchain network, wherein the first node is the first blockchain Any node in the network. Determining, according to the credit value of the N nodes in the first blockchain network, the first node to perform workload proof calculation or using the second scheme to perform workload proof calculation, where The first solution performs the workload proof calculation to perform the workload proof calculation based on the first target value, wherein the first target value is a target value corresponding to the first difficulty, and the second scenario is used to perform the The workload proof is calculated to perform the workload proof calculation based on the preset target value, wherein the preset target value is a target value corresponding to the second difficulty, and the first difficulty is less than the second difficulty.

According to the method for processing data according to an embodiment of the present application, the first node may calculate the credit value of the N nodes in the blockchain network before performing the workload proof calculation, wherein the N nodes may be in the blockchain network. All the nodes judge the calculation method of the workload proof according to the calculated N node credit value, and can provide the method for reducing the power consumption of the N nodes in the blockchain network to perform the workload proof calculation.

With reference to the fourth aspect, in an implementation manner of the fourth aspect, the first node determines, according to the credit value of the N nodes in the first blockchain network, the first solution to perform workload verification calculation or The second scenario is used to perform the workload verification calculation, including: determining, by the first node, that the credit value of the N nodes in the first blockchain network is greater than a first preset threshold, The first scheme performs the workload proof calculation. Determining, by the first node, that the workload is proved by using the second scheme, if the first node determines that a credit value of the M nodes in the first blockchain network is less than or equal to the first preset threshold. The calculation, wherein the M is a positive integer greater than or equal to 0 and less than or equal to N.

According to the method for processing data according to the embodiment of the present application, when the credit values of the N nodes in the blockchain network are greater than the first preset value, the N nodes can reduce the difficulty and perform the workload proof calculation. Can reduce the power consumption of the entire network.

With reference to the fourth aspect and the foregoing implementation manner, in another implementation manner of the fourth aspect, the first node determines, according to the credit value of the N nodes in the first blockchain network, that the first solution is adopted. Performing a workload proof calculation or performing a workload proof calculation by using the second scheme, including: determining, by the first node, a number of nodes whose credit value in the first blockchain network is greater than a second preset value, and the number If the ratio of the number of all nodes in the blockchain network is greater than the third preset value, or determining that the number of nodes in the first blockchain network is greater than the second preset value is greater than the fourth pre- In the case of setting a value, it is determined that the workload proof calculation is performed using the first scheme. The ratio of the number of nodes determining that the credit value in the first blockchain network is greater than the second preset value to the total number of nodes in the first blockchain network is less than or equal to the third pre-determination In the case of setting the value, or determining that the number of nodes in the first blockchain network that is greater than the second preset value is less than or equal to the fourth preset value, determining to adopt the second scheme The workload is calculated.

According to the method for processing data according to the embodiment of the present application, when a part of the nodes in the blockchain network has a credit value greater than a first preset value, all nodes or nodes whose credit value is greater than the first preset value Both can reduce the difficulty to carry out the workload proof calculation, and can reduce the power consumption of the whole network.

A fifth aspect, an apparatus for processing data, wherein the apparatus for processing data may be configured as a first node in a first aspect or may be configured as a first node for a plurality of computer devices, including The first aspect and the units of the steps of the method of processing data in each implementation of the first aspect.

In a sixth aspect, an apparatus for processing data is provided, wherein the apparatus for processing data may be configured as a second node in the second aspect or may be configured as a second node for the plurality of computer devices, including The second aspect and the units of the steps of the method of processing data in each implementation of the second aspect.

In a seventh aspect, an apparatus for processing data is provided, wherein the apparatus for processing data may be configured as a third node in the third aspect or may be configured as a third node for the plurality of computer devices, including The third aspect and the units of the steps of the method of processing data in each implementation of the third aspect.

In an eighth aspect, an apparatus for processing data is provided, wherein the apparatus for processing data may be configured as a first node in the fourth aspect or may be configured as a first node for a plurality of computer devices, including A unit of each step of the method of processing data in the fourth aspect and the respective implementations of the fourth aspect.

In a ninth aspect, there is provided an apparatus for processing data, the apparatus having the functions of implementing each of the first to fourth aspects and various ones of the various implementations described above. This function can be implemented in hardware or in hardware by executing the corresponding software. The hardware or software includes one or more modules corresponding to the functions described above.

In a tenth aspect, a server is provided, the processor comprising a processor. The processor is configured to support a server to perform the functions of any of the above first to fourth aspects and various implementations thereof. In one possible design, the server may further include a transceiver for supporting the server Receive or send a message. In one possible design, the server may also include a memory for coupling with the processor to store the necessary program instructions and data for the server. Alternatively, the server includes a memory and a processor for storing a computer program for calling and running the computer program from the memory, such that the server performs any of the above first to fourth aspects and A method of processing data in any of various implementations.

In an eleventh aspect, a computer readable storage medium storing a program causing a server to perform any of the above first to fourth aspects and various implementations thereof Any of the methods of processing data. Alternatively, the computer readable storage medium is for storing computer software instructions for use in the server described above, comprising a program designed to perform the method of the first aspect described above.

In a twelfth aspect, a chip system is provided, the chip system comprising a processor for supporting a server to implement the functions involved in any of the first to fourth aspects described above and various implementations thereof.

Therefore, the method for processing data, the device for processing data, and the device for processing data proposed by the present application can reduce the difficulty of the consensus algorithm in the blockchain network when the credit value of the node satisfies a preset value.

DRAWINGS

1 is a schematic diagram showing an example of a blockchain network of a method and apparatus for processing data according to an embodiment of the present application;

Figure 2 is a schematic flow chart of proof of workload;

3 is a schematic diagram of a data processing method according to an embodiment of the present application;

4 is a schematic diagram of another data processing method provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of another data processing method according to an embodiment of the present application; FIG.

6 is a schematic diagram of another data processing method provided by an embodiment of the present application;

FIG. 7 is a schematic diagram of another data processing method provided by an embodiment of the present application; FIG.

8 is a schematic block diagram of an example of a data processing device according to an embodiment of the present application;

9 is a schematic block diagram of another example of a data processing device according to an embodiment of the present application;

FIG. 10 is a schematic block diagram of another example of the data processing device of the embodiment of the present application.

Detailed ways

The technical solutions in the present application will be described below with reference to the accompanying drawings.

The method for caching data provided by the embodiment of the present application can be applied to a computer, which includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer.

The hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and a memory (also referred to as main memory).

The operating system may be any one or more computer operating systems that implement business processing through a process, such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a Windows operating system.

The application layer includes applications such as browsers, contacts, word processing software, and instant messaging software. Moreover, the specific structure of the execution body of the method provided by the embodiment of the present application is not particularly limited as long as the program of the code of the method provided by the embodiment of the present application can be run by using the program according to the present application. The method can be communicated. For example, the execution body of the method provided by the embodiment of the present application may be a computer device or a functional module of the computer device capable of calling a program and executing the program.

In addition, in the embodiment of the present application, the computer device may be a handheld device such as a smart phone, or may be a terminal device such as a personal computer, or the computer may be a server. The code of the method of processing the data of the embodiment of the present application is run, and the data is processed by the method of processing data according to the embodiment of the present application.

Among them, the server, also called the server, is a device that provides computing services. Since the server needs to respond to service requests and process them, the server should generally have the ability to take on the service and secure the service. The server consists of a processor, a hard disk, a memory, a system bus, etc., similar to a general-purpose computer architecture, but because of the need to provide highly reliable services, processing power, stability, reliability, security, scalability, and Management and other aspects are more demanding. The execution subject of the path detection in the embodiment of the present application may be a computer device or a functional module in the computer device capable of calling a program and executing the program.

The nodes described in this document are basic units capable of performing consensus operations, storing data, forwarding data, verifying data, etc., and may be composed of one or more computer devices, for example, computers, portable computers, servers, wearable devices. Wait.

In the embodiment of the present application, the blockchain network 100 includes an architecture of a blockchain network device for performing a consensus mechanism, as shown in FIG. 1.

The blockchain network 100 includes a node 130 as shown in FIG.

The node 130 (including the node 130a-node 130e shown in FIG. 1), the node 130 in the figure can be simply understood as a computer or a server, but is not limited to a computer or a server.

In the embodiment of the present application, each node 130 is in communication connection with each other.

Thus, each node 130 can make a decision based on a negotiation mechanism based on the communication connection.

For example, a portion (eg, at least two) or all of the nodes 130 in the blockchain network 100 can negotiate a decision initiated by one or more nodes to determine the outcome of the determination.

For example, in the embodiment of the present application, each node participating in the negotiation may determine a certain event based on a preset determination rule, so that each node participating in the negotiation may respectively obtain a determination result for the event, for example, the The determination result can be "yes" or "no". Here, it should be noted that the determination rules used by the nodes participating in the negotiation may be the same or different, and the present application is not particularly limited.

Thereafter, communication between the nodes participating in the negotiation may be performed to determine the determination result of each node participating in the negotiation. Thereby, the final determination result for the event made by the blockchain network 100 can be determined based on the distribution of the determination results of the respective nodes participating in the negotiation. By way of example and not limitation, the blockchain network 100 may implement the above-described negotiation mechanism based on blockchain techniques.

The blockchain network 100, the blockchain network 100 is constituted by the above-mentioned node 130. It can be seen from FIG. 1 that each node is equal, and no node is a central node, that is, not in the blockchain network. Need to be centralized. A blockchain is a decentralized database blockchain network consisting of a data layer, a network layer, a consensus layer, an incentive layer, a contract layer, and an application layer. The data layer encapsulates the underlying data block and related data encryption and time stamping technologies. The network layer includes a distributed networking mechanism, a data propagation mechanism, and a data verification mechanism. The consensus layer encapsulates various types of consensus of network nodes. The algorithm, the incentive layer integrates economic factors into the blockchain technology system, mainly including the issuance mechanism and distribution mechanism of economic incentives. The contract layer mainly encapsulates various scripts, algorithms and smart contracts, and is the basis of the blockchain programmable features; the application layer encapsulates various application scenarios and cases of the blockchain. In this model, the time-stamp-based chain block structure, the consensus mechanism of distributed nodes, the economic incentives based on consensus computing capabilities, and the flexible and programmable smart contracts are the most representative innovations of blockchain technology.

It should be understood that the blockchain network 100 shown in FIG. 1 is constituted by the above-mentioned node 130 as an example of only one blockchain network. In other embodiments, the number of nodes constituting the blockchain network may be the same as that in FIG. The difference is shown.

The blockchain network is generally divided into a public chain, an alliance chain, and a proprietary chain according to different application scenarios and design systems. among them:

Each node of the public chain can freely join and exit the network, and participate in the reading and writing of data on the chain. The runtime is interconnected in a flat topology, and there is no centralized server node in the network.

Each node of the alliance chain usually has an organization corresponding to it, and can only join and exit the network after authorization. Each organization organizes an interest-based alliance to jointly maintain the healthy operation of the blockchain.

The write permission of each node of the proprietary chain is controlled internally, and the read permission is selectively open to the public. The proprietary chain still has a common structure for multi-node operation of the blockchain, which is suitable for internal data management and auditing of specific organizations.

Blockchain technology is not a single-item technology, but a system that integrates applications as a point-to-point transmission, consensus mechanism, distributed data storage, and cryptography principles. The system has full-featured and tamper-proof technical features.

First, point-to-point transmission: the nodes participating in the blockchain are independent and peer-to-peer, and the nodes and nodes synchronize data and information through point-to-point transmission technology. Nodes can be different physical machines or different instances of the cloud.

Second, the consensus mechanism: the consensus mechanism of the blockchain refers to the process in which the nodes participating in the multi-party participate in the agreement of specific data and information through the interaction between the nodes under the preset logic rules. The consensus mechanism needs to rely on well-designed algorithms, so different consensus mechanism performance (such as Transaction Per Second (TPS) transactions / sec, consensus delay, costly computing resources, costly transmission resources, etc. There are certain differences.

Third, distributed data storage: Distributed storage in the blockchain is that each node participating in the blockchain has independent and complete data, which ensures that the data is stored in the entire node. Unlike traditional distributed data storage, traditional distributed data storage divides data into multiple copies for backup or synchronous storage according to certain rules, while blockchain distributed data storage relies on peer-to-peer in the blockchain. A consensus between independent nodes to achieve highly consistent data storage.

Fourth, the principle of cryptography: blockchain is usually based on asymmetric encryption technology to achieve reliable information dissemination, verification and so on.

The concept of "block" is to organize one or more data records in the form of "blocks". The size of "blocks" can be customized according to the actual application scenario; and "chain" is a data structure, the data structure The "tiles" that store the data records are chronologically connected and connected by Hash technology. In the blockchain, each "block" contains two parts, "block header" and "block body", where "block body" contains transaction records packed into "blocks"; "block headers" contain " The root HASH of all transactions in the block and the HASH of the previous "block". The data structure of the blockchain ensures that the data stored on the blockchain has non-tamperable characteristics.

The composition of the blockchain in the present application is not limited. For example, the present application can be applied to the above-mentioned public chain, alliance chain or proprietary chain. The present application mainly relates to the above-mentioned consensus mechanism in the blockchain. Let's first introduce the consensus mechanism in the blockchain.

Blockchain should become a decentralized, open, non-tamperable data record decentralized honest and trustworthy system, which needs to be as secure, clear and irreversible as possible in the shortest possible time. Solid and decentralized system. In practice, the process is divided into two areas:

(1) Select a unique node to generate a block;

(2) Make distributed data records irreversible.

The core of the technology to achieve the above process is: consensus mechanism. The consensus mechanism is a mechanism in which the blockchain nodes reach a consensus on the whole network for the block information, which can ensure that the latest block is accurately added to the blockchain, and the blockchain information stored by the node is consistent and non-forked and can also resist malicious attacks.

The current mainstream consensus mechanisms include: workload proof, equity certificate, workload proof and equity certificate mix, share authorization certificate, and Ruibo consensus agreement.

Let's take the workload proof as an example, and briefly introduce the consensus mechanism in the current blockchain with Figure 2.

Figure 2 is a schematic flow chart of the proof of workload. The schematic includes S210-S240.

The basic principle of workload proof: The main feature of the workload proof system is that the client (node) needs to do a certain difficulty to get a result, but the verifier can easily check whether the client has done the corresponding work through the result. A core feature of this approach is asymmetry: work is moderate for the requester and easy to verify for the verifier. Unlike the verification code, the verification code is designed to be easily solved by humans and not easily solved by computers. The four steps of S210-S240 are described in detail below.

S210. The node acquires a data record.

In the blockchain, each node listens to the entire network data record and temporarily stores the data record verified by the basic legality.

S220, the node calculates a target value.

The node consumes its own computing power to try different random numbers (Nonce), performs the specified hash calculation, and repeats the process until a reasonable random number is found, for example, a given basic string "Hello, world!" The workload requirement given by the blockchain network is that you can add an integer value called Nonce after the string, and perform a SHA256 hash on the changed (added Nonce) string if the resulting target value is a hash result. (in hexadecimal form) starting with "0000", the verification is passed. In order to achieve the goal of this workload proof, the node performing the workload proof calculation needs to continuously change the Nonce value and perform a SHA256 hash operation on the obtained new string. According to this rule, we need to calculate 4251 times to find a hash hash with the first 4 digits being 0.

S230. The node generates block information.

After the node finds a reasonable random number, it generates block information. Generating the block information includes: inputting the block header information, and inputting the block record information into the generated block information. The block header information includes the version number, the hash value of the previous block, and the like. The block record information includes a list of transactions appended to the block header information.

S240. The node broadcasts block information.

After the node generates the block information, the block information is broadcasted in the blockchain network. After the other nodes in the blockchain network verify that the block information is passed, the block information is connected to the blockchain, and the height of the main chain is increased by one, and then all the nodes in the blockchain network are switched to the new blockchain to continue. The workload proof calculation produces new block information.

The proof of workload is reflected in S220. Nodes need to continuously consume computing power and perform hash calculation to find the desired random number. If two nodes broadcast block information at the same time, the nodes in the blockchain network will determine which block constructs the final blockchain according to the block information generation of the subsequent nodes, and how to choose this application without limitation. .

The workload is mainly reflected in: a random number of blocks that meet the requirements is composed of N leading zeros, and the number of zeros depends on the difficulty value of the network. To get a reasonable random number requires a lot of trial calculations, the calculation time depends on the speed of the machine's hash operation. When a node provides a reasonable random value, the node does undergo a lot of trial calculations.

According to the consensus mechanism shown in Figure 2, each node needs to calculate the above random value by the competing computing power, which is a process of consuming resources. With the evolution of blockchain technology, more and more organizations have begun to pay attention to and participate in the exploration of blockchain technology. From the original open source community of public chain projects such as Bitcoin and Ethereum, to various types of blockchain startups, venture capital funds, financial institutions, information technology (IT) companies and regulators, blockchain The development ecology is gradually developing and enriching. When the blockchain technology is applied to the Internet of Things, since the device itself in the Internet of Things is very sensitive to power consumption, the above-mentioned workload proof mechanism restricts the development of the blockchain Internet of Things. In response to the above problems, the present application proposes a consensus mechanism capable of reducing resource consumption.

FIG. 3 is a schematic diagram of a data processing method according to an embodiment of the present application. The schematic diagram includes S310 and S320, which are described in detail below.

S310. The first node determines a first credit value of the first node.

Optionally, the first node determines, according to the consensus authentication record in the first blockchain network to which the first node belongs, the first credit value of the first node, where the first credit value is the first node at the first moment. The first time may be the time at which the credit value is currently calculated, or may be any time in a time period during which the first credit value of the first node is the same size.

Optionally, in some embodiments, the determining, by the first node, the first credit value includes: determining, by the first node, an accumulation algorithm of the first credit value according to an accumulation mechanism of a consensus mechanism in the first blockchain network that belongs to the current node, and then The first credit value is calculated according to an accumulation algorithm of the first credit value.

Optionally, in some embodiments, the first node calculates the first credit value according to the amount of transaction amount authenticated by the first node.

Optionally, in other embodiments, the first node determines, according to the transaction rate of the first node authentication, a credit value that the first node can accumulate, and accumulates the first credit value according to the credit value that can be accumulated.

Optionally, when the first node determines the credit value that the first node can accumulate according to the amount of the verified transaction volume or the transaction rate, the first node may perform the high-rate transaction, the medium-cost transaction, or the low according to the first node history authentication transaction. The proportion of the expense transaction is used as the weight of its accumulated calculated credit value to encourage nodes in the blockchain network to handle small transactions with low fees.

For example, when the first node calculates the first credit value according to the authentication record, in the historical authentication transaction, the weight of the authentication high-rate transaction is calculated by accumulating the first credit value to be 1/6, and the fee transaction in the authentication is cumulatively calculating the first credit. The weight of the value is 1/3, and the weight of the certified low-cost transaction in calculating the first credit value is 1/2, so that when the credit value is calculated according to the historical authentication transaction, the low-cost transaction accounts for a relatively large amount, which can encourage the node to handle the low cost. Small transactions, because this is heavily weighted when the credit value is subsequently calculated.

It should be understood that the foregoing first node calculates the first credit value according to the authentication record, which is only an exemplary form, and cannot limit the protection scope of the present application. Other methods capable of confirming the size of the first credit value are also within the protection scope of the present application.

Optionally, the first node determines that the first credit value may be performed periodically, or may be a time in the blockchain network that specifies each node to calculate the credit value, which is not limited in this application.

S320, the first node performs workload proof calculation.

After the first node determines the first credit value, the first node determines the size of the first credit value and the first preset threshold.

Optionally, in some embodiments, the first preset threshold may be a system-defined threshold.

Optionally, in other embodiments, the first preset threshold may be a threshold agreed by each node in the blockchain network.

Optionally, in some embodiments, the first credit value is greater than the first preset threshold. In this case, the first node performs a workload proof calculation based on the first target value, where the first target value is a target value corresponding to the first difficulty, wherein the first difficulty is less than working based on the preset target value. The quantity proof calculates the corresponding second difficulty.

For example, if the first credit value is 11, and the first preset threshold is 10, the first credit value is greater than the first preset threshold. Assuming that the first node performs the workload proof calculation based on the preset target value, if the hash result calculated by the first node starts with "0000", the verification is passed. The hash result starting with "0000" is the preset target value. Then, if the first node performs the workload proof calculation based on the first target value, if the hash result calculated by the first node starts with "000", the workload proof can be obtained by verification. The result starting with "000" is the first target value.

Optionally, the first node receives the first transaction information, where the first transaction information includes credit demand value information, where the first node information is used to indicate the first transaction. The information is determined by the nodes in the blockchain network to confirm the required credit value, wherein the first transaction information may be the number of transactions included in the entire blockchain, and the first transaction information is included in the block header in the blockchain. The first node is capable of acquiring the first transaction information according to the block header.

Optionally, the first node determines that the first credit value is greater than or equal to a credit value included in the first transaction information, and the first node may compete with other nodes in the blockchain network for the first transaction information. The consensus confirmation right, and the first transaction information is included in the generated block after obtaining the consensus confirmation right.

Optionally, in some embodiments, the first credit value is less than or equal to the first preset threshold. In this case, the first node performs a workload proof calculation based on the preset target value, and the preset target value is a target value corresponding to the second difficulty.

For example, if the first credit value is 9, and the first preset threshold is 10, the first credit value is less than the first preset threshold. Assuming that the first node performs the workload proof calculation based on the preset target value, if the hash result calculated by the first node starts with "0000", the verification is passed. The hash result starting with "0000" is the preset target value. Then, in the case that the first node performs the workload proof calculation based on the preset target value, the hash result needs to start with "0000", and the workload proof can be obtained through verification.

The difficulty of calculating the hash result starting with "0000" by the first node is higher than the difficulty of calculating the hash result starting with "000". Therefore, the difficulty of the first node performing the workload proof calculation based on the first target value is lower than the difficulty of the first node performing the workload proof calculation based on the preset target value. Therefore, when the first node performs the workload proof calculation based on the first target value, the number of calculations may be less than the number of times the first node performs the workload proof calculation based on the preset target value.

Optionally, in some embodiments, before the first node performs the workload proof calculation based on the first target value, the first node determines that the first node continuously performs the workload proof calculation based on the first target value less than N times Where N is an integer greater than zero.

For example, after the first node continuously uses the workload verification calculation based on the first target value twice, the system provides that the first node is again based on the first target value even if the first credit value of the first node is greater than the first preset threshold value. The block information broadcast after the workload proof calculation is obtained with the consensus confirmation right will not be accepted by other nodes in the blockchain network.

Optionally, in other embodiments, before the first node performs the workload proof calculation based on the first target value, the first node determines that the first node continuously performs the workload proof calculation based on the preset target value by more than M. Times, where M is an integer greater than zero.

For example, after the first node continuously uses the workload proof calculation based on the preset target value twice, if the first credit value of the first node is greater than the first preset threshold, the first node may perform the first target value based on the first target value. The workload proof calculation is subject to consensus confirmation.

Optionally, before the first node performs the workload proof calculation based on the first target value, the first node determines that the first node performs the workload proof calculation based on the preset target value or the second target value in the Y time units, where The difficulty of the second target value for performing the workload proof calculation is less than the difficulty of performing the workload proof calculation based on the preset target value and greater than the difficulty of the workload proof calculation based on the first target value, where Y is an integer greater than 0. A time unit may be 1 ms, 0.5 ms, 2 ms, 5 ms, etc., and the specific length of the time unit is not limited in the embodiment of the present application. For example, with 1 ms as a time unit, it can be determined that the first node can perform the workload proof calculation based on the first target value after the first node is performing the workload proof calculation based on the preset target value or the second target value within 2 ms.

For example, after performing the workload proof calculation based on the first target value in two consecutive time units of the first node, the system specifies that the first node is based on the first target again even if the first credit value of the first node is greater than the first preset threshold. The value of the workload proof that the block information broadcast after obtaining the consensus confirmation right will not be accepted by other nodes in the blockchain network.

Specifically, taking the blockchain network in FIG. 1 as an example, the node 130a has been successively twice, or when the workload proof calculation is performed in two consecutive time units, the obtained calculation result is that the first three digits are 0. In the hash, after the node 130a performs the workload proof calculation, the block information is generated and the block information is broadcasted. Then, the node 130a performs the workload proof calculation again with the hash result of the first 3 digits being 0. And the block information is broadcast, and other nodes in FIG. 1 (node 130b-node 130n as shown in FIG. 1) will not accept the block information broadcast by node 130a.

Optionally, in order to prevent the first node from continuously performing the workload proof calculation based on the first target value, after the first node performs the workload proof calculation based on the first target value for the first time, the first credit value is subtracted A corresponding amount, get a new credit value.

Optionally, in some embodiments, the size of the corresponding quantity may be a preset credit consumption value specified by the blockchain network.

Optionally, in some embodiments, the size of the corresponding quantity may be a predetermined preset credit consumption value between respective nodes in the blockchain network.

Optionally, in some embodiments, the size of the corresponding quantity may be a credit value that is consumed when the first node performs a workload verification calculation based on the first target value to obtain a consensus confirmation right.

Optionally, the first node may include the information of the new credit value in the broadcasted block information, so that other nodes in the blockchain network can learn the new credit value of the first node, and the first node works again. Before the calculation of the quantity proof, the new credit value and the size of the first preset threshold are determined, and the workload proof calculation is similar to the method after determining the first credit value, and details are not described herein again.

Optionally, after obtaining the consensus confirmation right to generate the block information, the first node broadcasts the first credit value in the associated blockchain network, for example, adding the first credit value to the generated block information.

Optionally, in some embodiments, the adding, by the first node, the first credit value in the generated block information may be that the credit value is recorded in the new area each time the consensus confirmation right is generated to generate new block information. In the block information, update your own credit value.

Optionally, in some embodiments, the adding, by the first node, the foregoing first credit value in the generated block information may also be performed by using a preset control mechanism, such as periodically or satisfying a credit value accumulation threshold. Credit value, this application does not limit this.

After the first node broadcasts the first credit value, the other nodes in the blockchain network to which the first node belongs may perform consensus authentication on the first credit value broadcast by the first node, that is, whether the first node can be based on the first credit. The value carries out the workload proof. If the consensus authentication is passed, the whole network node accepts the block generated by the first node based on the first credit value for the workload proof.

It should be understood that the first node may be any one of the node chains 130 in the blockchain network shown in FIG. 1, and the scope of protection of the present application is not limited.

FIG. 4 is a schematic diagram of another data processing method provided by an embodiment of the present application. The schematic includes S410-S420, which are described in detail below.

S410. The first node determines a third credit value and a fourth credit value.

Determining, by the first node, a third credit value, where the third credit value is a credit value of the second node, where the second node is other than the first node in the blockchain network Any one node;

Determining, by the first node, a fourth credit value, where the fourth credit value is a credit value of a third node, wherein the third node is in the blockchain network except the first node and the Any node other than the second node.

S420. The first node sends the transaction information.

Optionally, in some embodiments, the first node sends transaction information to the second node, for example, the first node, if the third credit value is determined to be higher than the fourth credit value. Determining that the third credit value of the second node is 2, and the first node determines that the fourth credit value of the third node is 1, the first node may only send the transaction information to the second node.

Optionally, in some embodiments, the first node sends transaction information to the second node, where the third credit value is higher than the fourth credit value, and sends the After the transaction information is sent to the second node, the transaction information is sent to the third node, for example, the first node determines that the third credit value of the second node is 2, and the first node determines the fourth credit of the third node. A value of 1, the first node may send transaction information to the second node and then send the transaction information to the third node.

FIG. 5 is a schematic diagram of another data processing method provided by an embodiment of the present application. The schematic diagram includes S510-S520, which are described in detail below.

S510. The first node sends a join request message to the second node.

When the first node wishes to join the new blockchain (the second blockchain network), the first node sends a join request message to the second node, where the first node belongs to the first blockchain network, and the second node Belongs to the second blockchain network.

Optionally, in some embodiments, the first node sends the join request message to the second node.

Optionally, in some embodiments, the first node sends the foregoing join request message to multiple nodes in the second blockchain network, and the second node obtains the consensus confirmation right of the join request message.

Optionally, in some embodiments, the first node broadcasts the foregoing join request message in a second blockchain network to which the second node belongs, and the second node obtains a consensus confirmation right of the join request message.

Optionally, in some embodiments, the first node increases the credit value of the first node in the first blockchain network (ie, the blockchain to which the first node currently belongs) in the join request message.

Optionally, in some embodiments, the first node provides the block information in the first blockchain network where the current credit value of the first node is located in the join request message. The block information is used by the second node in the second blockchain to perform the query of the first node credit value.

Optionally, in some embodiments, the first node provides the block information in the credit statistic blockchain network where the current credit value of the first node is located in the join request message. The block information is used by the second node in the second blockchain to perform the query of the first node credit value.

Optionally, in some embodiments, when the first node requests to join the second blockchain network, the first node may pay the join request message fee to the second blockchain network.

Optionally, in some embodiments, the manner in which the first node pays the foregoing fee may be that the fee is included in the join request message, where the request fee may be an actual fee or an indirect fee, and the actual fee may be How much bitcoin or Ethereum is used as the transaction fee, and the indirect cost can be a certain period of time. When the first node joins the second blockchain network, part of the obtained certification fee is distributed to the current party according to a certain proportion. An authentication node in a second blockchain network that requests a message for consensus authentication.

S520. The second node acquires a credit value of the first node.

Optionally, in some embodiments, the join request message sent by the first node includes a credit value of the first node, and the second node may obtain the credit value of the first node when receiving the join request message.

Optionally, in another embodiment, the second node includes, according to the block information in the join request message that the first node records the credit value in the first blockchain network, to the first node. A blockchain network sends a query request message, and the fourth node may send query response information to the second node, where the query response information includes the credit value, and the second node acquires the credit of the first node according to the query response information. a value, the fourth node is any one of the first blockchain networks except the first node.

Optionally, in another embodiment, the second node sends, according to the block information in the join request message that the first node records the credit value in the credit statistic blockchain network, to the credit statistic blockchain network. Querying the request message, the third node in the credit statistic blockchain network sends the query response information, the query response information includes the credit value, and the second node acquires the credit value of the first node according to the query response information, the third The node is any node in the credit statistics blockchain network.

Optionally, before obtaining the credit value of the first node, the second node acquires the consensus confirmation right of the join request message of the first node, including:

Optionally, in some embodiments, the first node broadcasts the foregoing join request message in a second blockchain network to which the second node belongs, and all nodes in the second blockchain network learn the first The join request message of the node.

Optionally, in another embodiment, the first node sends the foregoing join request message to multiple nodes in the second blockchain network, and the multiple nodes all know the join request message of the first node.

Then, when all nodes or multiple nodes in the second blockchain network perform consensus authentication on the join request message of the first node, the authentication competition mode between all nodes or multiple nodes in the second blockchain may be According to the method shown in FIG. 3, the node with high credit value performs low-hardness proof calculation, and obtains the join request message authentication of the first node, for example, the current credit value of the second node in the second blockchain is compared. High, obtain the first node's join request message consensus authentication right.

Optionally, in some embodiments, the second node may also obtain the consensus authentication right without competition. For example, the first node sends a join request message only to the second node, and the second node confirms the join request message consensus.

Optionally, after the second node receives the consensus confirmation of the join request message of the first node, the second node sends an authentication confirmation message to the first node.

Optionally, in some embodiments, the second node sends an authentication confirmation message to the first node, and confirms that the first node can join the second blockchain network to which the second node belongs.

Optionally, in another embodiment, the second node broadcasts the authentication confirmation message in the second blockchain network, and the first node queries the authentication confirmation message in the second blockchain network, and confirms to join the second Blockchain network.

Optionally, after completing the join request message of the first node, the second node needs to notify the other nodes in the second blockchain network of the authentication result.

Optionally, in some embodiments, the second node may add the acquired credit value of the first node in the generated block information, and broadcast the block information in the second blockchain network. The other nodes in the second block chain may determine that the second node has completed authentication of the first node in the case of determining that the block information broadcast by the second node is received.

Optionally, in other embodiments, the second node determines the credit value of the first node, and the information is input in the block information generated by the second node and broadcasted. The other nodes in the second blockchain may determine, according to the block information, that the first node joins the second blockchain network. Optionally, in other embodiments, the second block There may be X nodes in the chain network for authenticating the join request message of the first node. The second node is one of the nodes of the X.

Optionally, in some embodiments, only each of the X nodes sends an authentication confirmation message before the first node can confirm the join.

Optionally, in other embodiments, a node greater than or equal to a specific ratio (eg, 51%) of the X nodes in the second blockchain network sends an authentication confirmation message, and the first node can confirm the join, where , X is an integer greater than or equal to 1.

Optionally, in other embodiments, several of the X nodes in the second blockchain network are sequentially confirmed, and then the last node sends an authentication confirmation message, for example, assuming a second blockchain network. There are 3 nodes, node 1 confirms that it can join, then node 2 confirms, node 2 confirms that it can join, and then node 3 confirms that node 3 confirms that it can join and then node 3 sends an authentication confirmation message. If node 1 confirms that it cannot join, node 2 does not need to confirm.

Optionally, in other embodiments, the foregoing authentication confirmation message may be a majority of the X nodes in the second blockchain and the X nodes in the second blockchain network. Several nodes of the X nodes in the node or the second blockchain network are sequentially confirmed, and then the last node is broadcasted in the second blockchain network, and the first node can be authenticated from the second blockchain network. Confirm the message.

Optionally, in some embodiments, the authentication confirmation message may be by each of the X nodes in the second blockchain, most of the X nodes in the second blockchain network, or Several of the X nodes in the second blockchain network are sequentially confirmed, and then the last node is directly sent to the first node.

Optionally, after the first node obtains the authentication confirmation message, the first node join request message is successfully authenticated, and the first node may join the second blockchain network as a new blockchain node, after initial After the credit value is calculated, the first node determines the initial credit value of the current self in the second blockchain.

Optionally, in some embodiments, the foregoing first node initial credit value calculation may be an initial credit value determined by averaging or accumulating credit values provided by each node that sends the authentication confirmation message in the X times consensus authentication.

Optionally, the first node determines, according to the initial credit value, whether the Nonce value calculation difficulty can be reduced to obtain a block consensus confirmation right in the second blockchain network. Specifically, the first node may provide the method according to FIG. The consensus confirmation right in the second blockchain network is determined, and details are not described herein again.

Optionally, in some embodiments, the first node may directly join the second blockchain network after sending the join request message.

FIG. 6 is a schematic diagram of another data processing method provided by an embodiment of the present application. The schematic includes S610-S640, which are described in detail below.

S610. The first node sends a join request message to the second node.

The join request message is used to request to join the second blockchain network, and the second node receives the join request message sent by the first node. The join request message includes credit information for indicating a credit value of the first node in a first blockchain network, wherein the second node is a node in a second blockchain network The first node is a node in the first blockchain network. And obtaining, by the second node, a credit value of the first node in the first blockchain network according to the credit information.

Optionally, in some embodiments, the foregoing join request message includes a credit value of the first node in the first blockchain network.

Optionally, in another embodiment, the foregoing join request message includes the block information of the first node in the first blockchain network to record the credit value, and the second node may be according to the target block. The information sends a query request message to the first blockchain network, the query request message being used to request to acquire the credit value.

S620. The first node sends credit statistics information to the third node.

The credit statistic information is used to calculate a credit value of the first node. The third node is any one of the credit statistics blockchain networks.

The third node determines a credit value of the first node according to the credit statistics information.

For example, the credit statistic blockchain may require the first node to provide some information, such as the transaction cost of the first node, the number of authenticated blocks, and the number of transactions in the authenticated block. The first node may send request information of the credit statistic blockchain to a node in the credit statistic blockchain. The request information provided by the credit statistic blockchain is the credit statistic information.

Optionally, in some embodiments, the first node may periodically send the credit statistics information to nodes in the credit statistic blockchain.

Optionally, in other embodiments, the first node may send the credit statistics information to a node in the credit statistic block chain according to an event trigger.

For example, the first node sends the credit statistics information to the third node if it is determined that the authenticated transaction increases by more than a certain number. For another example, the first node may send the credit statistics information to the third node after obtaining the consensus confirmation right. For another example, the first node may send the credit statistics information to the third node if it is determined that the credit value of the first node is higher than a preset threshold.

Optionally, in some embodiments, the first node may broadcast the credit statistics information to the credit statistic blockchain by means of a broadcast.

Optionally, in other embodiments, the first node may send the credit statistics directly to one or more nodes in the credit statistics broadcast, and then the one or more nodes may be in the The credit statistics information is broadcast in the credit statistics blockchain.

The node in the credit statistic blockchain that receives the credit statistic information sent by the first node may perform consensus authentication based on the credit statistic information and its own credit value to compete for the credit statistic information. The consensus confirmation right, optionally, may compete in the manner of the workload proof calculation shown in FIG. 3, and is not described here again, for example, where the third node in the credit statistic blockchain is to obtain the consensus confirmation right. node.

The third node may determine, according to the preset algorithm, the credit degree of the first node in the credit statistic blockchain according to the credit statistic information, and perform consensus authentication and maintenance. The preset algorithm may be a set of accumulation mechanism that is consistent with the credit statistic block chain itself, for example, determining the credit degree of the node according to the number of authenticated transaction quantities of a node. As another example, the credit rating of the node can be determined based on the transaction rate of a node.

S630. The second node sends a query request message to the third node.

The query request message is used to query the credit value of the first node. The second node in the second blockchain network obtains the consensus confirmation right, and authenticates the join request message of the first node.

Optionally, in another embodiment, the second node sends, according to the block information in the join request message that the first node records the credit value in the credit statistic blockchain network, to the credit statistic blockchain network. Querying the request message, the third node in the credit statistic blockchain network sends the query response information, the query response information includes the credit value, and the second node acquires the credit value of the first node according to the query response information, and the third The node is any node in the credit statistics blockchain network.

Optionally, in some embodiments, the second node may pay a query fee to the credit statistic blockchain or the first blockchain network. When the second node queries the credit of the first node, the second node confirms the join request message of the first node, and adds the indication information that the first node join request message is authenticated in the newly broadcasted block.

Optionally, the second node sending the query request message may be broadcasted in the credit statistic blockchain network or the first blockchain network, and then the node pair query in the credit statistic blockchain network or the first blockchain network The request message is used for consensus authentication. For example, the third node in the credit statistic blockchain network or the first blockchain network obtains the consensus confirmation right of the second node to send the query request message.

Optionally, the third node directly sends the current credit value information of the first node to the second node, or the third node broadcasts the current credit value information of the first node, and the second node is in the credit statistics blockchain network. The current credit value of the first node is obtained by querying in a blockchain network.

The second node receives the first node sending a join request message, sends a query request message to the third node, and receives the current credit value of the first node sent by the third node. ) A consensus certification process can be completed.

Optionally, in some embodiments, the first node may perform the foregoing consensus authentication process with other nodes in the second blockchain network. The first node may perform a total of X consensus authentication processes with nodes in the second blockchain. It can be understood that the X-time consensus authentication process is completed by X different nodes in the second blockchain.

S640. The first node acquires an authentication confirmation message.

Optionally, in some embodiments, the second node sends an authentication confirmation message to the first node. The join confirmation message is used to confirm that the first node can join the blockchain network.

Optionally, in some other embodiments, the second node broadcasts the authentication confirmation message in a second blockchain network to which the second node belongs. The first node may query the authentication confirmation message in the second blockchain network.

Optionally, in some embodiments, in the case that the first node and the X nodes in the second block chain perform X-time consensus authentication, the node that sends the confirmation message to the first node is The last node to perform consensus authentication. Obviously, in the embodiment shown in FIG. 6, the second node is used as the node of the last consensus authentication in the case of performing X times of consensus authentication.

Optionally, in another embodiment, if the first node only performs consensus authentication with one of the nodes in the second blockchain network, the authentication confirmation message is sent by a node that performs consensus authentication. .

Optionally, the first node may periodically count the transaction authentication records in the old and new blockchains, and send them to the credit statistics blockchain for credit confirmation and recording.

Optionally, when a node sends transaction data in the blockchain network for blockchain authentication, the node may assist the “credit value” demand indication in the transaction data, indicating that the related transaction is performed by the blockchain network node. Certified credit value requirements.

FIG. 7 is a schematic diagram of another data processing method provided by an embodiment of the present application. The schematic diagram includes S710-S720, which are described in detail below.

S710. The blockchain network determines a credit value of multiple nodes.

Optionally, in some embodiments, the blockchain network determines a credit value of the plurality of nodes, including: the first node acquires a credit value of the N nodes in the blockchain network, wherein the first node is the Any one of the nodes in the blockchain network, wherein the credit value of the N nodes is a credit value respectively acquired by the first node, and the N is a positive integer. For example, there are 10 nodes in the blockchain network, and the first node obtains 5 nodes of 10 nodes with credit values of 1, 2, 3, 4, and 5, respectively. The first node is any one of the blockchain networks. In other words, any node in the blockchain network needs to perform the actions performed by the first node.

Optionally, in other embodiments, the blockchain network determines the credit values of the multiple nodes, including: the M nodes in the blockchain network acquire the credit values of the N nodes in the blockchain network, where The M node is any M nodes in the blockchain network, wherein the credit value of the N nodes is an average value of M credits acquired by M nodes, or the N nodes are The credit value is the maximum value of the M credits obtained by the M nodes, and M and N are positive integers. For example, the blockchain network has 10 nodes, and the first node obtains 5 nodes of 10 nodes, and the credit values are 1, 2, 3, 4, and 5, respectively, and the second node obtains 10 nodes. The credit values of the five nodes are 2, 3, 4, 5, and 6, respectively, and the credit values of the five nodes are 1.5, 2.5, 3.5, 4.5, 5.5, respectively, or the credit values of the five nodes are respectively 2 , 3, 4, 5, 6.

It should be understood that the form of 5 nodes among the above 10 nodes is an exemplary form, and the credit values of all nodes in the blockchain network can be obtained according to the above method.

S720, determining a workload proof calculation algorithm.

Optionally, the current credit value of all nodes in the blockchain network is greater than a first preset threshold, wherein the credit value of all the nodes may be determined in S710, and the blockchain network determines the first credit. The value is greater than the first preset threshold, for example, there are 10 nodes in the blockchain network, and the current credit value of each of the 10 nodes is greater than a first preset threshold, and the blockchain network determines that the first credit value is greater than The first preset threshold.

Optionally, the current credit value of the part of the node in the blockchain network is greater than a first preset threshold, where the credit value of the partial node may be determined in S710, and the blockchain network determines the first credit. The value is greater than the first preset threshold, wherein some of the nodes may be more than half of the nodes specified by the system. For example, there are 10 nodes in the blockchain network, and the current credit value of the six nodes is greater than the first preset. a threshold, the blockchain network determining that the first credit value is greater than a first predetermined threshold.

Optionally, in a case where the ratio of the number of nodes whose current credit value is greater than the first preset threshold in the blockchain network to the total number of nodes in the blockchain network is greater than the third preset value, the blockchain The network determines that the first credit value is greater than the first preset threshold. For example, there are 10 nodes in the blockchain network, wherein the current credit value of the six nodes is greater than the first preset threshold, and the ratio is 0.6, which can be determined. When the ratio is greater than 0.5, it is determined that the first credit value is greater than the first preset threshold.

Optionally, in some embodiments, when the blockchain network determines that the first credit value is greater than the first preset threshold, optionally, a one-time reduction of the complexity of the network-wide workload proof calculation algorithm may be performed.

Optionally, in other embodiments, when the blockchain network determines that the first credit value is greater than the first preset threshold, only the node whose credit is higher than the first preset threshold may perform a network-wide workload proof calculation algorithm. A decrease in complexity. After the subsequent difficulty recovery, the blockchain network begins to accept the participation of new low-credit nodes.

It should be understood that the first node in Figures 3 through 7 may be the same node or one of the blockchain networks capable of performing the actions of the first node of Figures 3-7.

FIG. 8 shows a schematic block diagram of a data processing apparatus 500 of an embodiment of the present application. The apparatus shown in Figure 8 can be applied to a blockchain network, which can include a plurality of devices 500, each of which can be comprised of one or more of the devices 500, The device 500 includes a sending module 501, a receiving module 502, and a processing module 503.

The sending module 501 is configured to send information.

For example, the first node sends a join request message to the blockchain network to which the second node belongs, or is used for the first node to send credit statistics information to the credit statistic blockchain network, or for the second node to credit The statistical blockchain network sends the query request information, or is used by the second node to send/receive the authentication confirmation message to the associated node chain network, or for the third node to send/in the second node to the second node Credit statistics blockchain network broadcast query feedback information.

The receiving module 502 is configured to receive information.

For example, for the first node to receive/query the authentication confirmation message in the blockchain network, or for the second node to receive/query the query feedback information in the blockchain network, or for the third node to receive/in the third node The credit statistic blockchain network queries the credit statistic information of the first node, or is used by the third node to receive/query the second node to send a query request message in the credit statistic blockchain network.

The processing module 503 includes a determining unit, a calculating unit, a generating unit, and the like for processing information.

For example, the determining unit is configured to determine, by the first node, a first credit value of the first node, or for determining, by the first node, a credit value of other nodes in the associated blockchain network, or for determining, by the first node, The first credit value is greater than or equal to the credit value included in the first transaction information, or is used by the first node to determine N blocks/Y time units after the workload proof calculation based on the first target value In the competition of the consensus confirmation right, the workload proof calculation is no longer performed based on the first target value; and the second node determines the credit value of the first node according to the credit information sent by the first node. And determining, by the third node, the credit value of the first node according to the credit statistics information sent by the first node.

For example, the calculating unit is configured to: when the first credit value is greater than the first preset threshold, the first node performs a workload proof calculation based on the first target value or the second credit value is less than or equal to the In the case of the first preset threshold, the first node performs workload proof calculation based on the preset target value, or is used for the second node or the third node to perform workload proof calculation.

For example, the generating unit is configured to generate new block information for the first node, the second node, or the third node, and broadcast to the associated blockchain network.

FIG. 9 shows a schematic block diagram of a data processing apparatus 600 of an embodiment of the present application. The apparatus 600 shown in FIG. 9 may include a processing unit 601 and a communication unit 602.

Optionally, in some embodiments, the device 600 may be the first node described by the foregoing processing method. For example, the device 600 may be configured as the first node. As another example, device 600 is itself the first node. As another example, the first node can be configured in the device 600. Apparatus 600 can perform the various actions or processes performed by the first node in the method described above. Here, in order to avoid redundancy, a detailed description thereof will be omitted.

Optionally, in other embodiments, the device 600 may be the first node described by the foregoing processing method. For example, the device 600 may be configured as the second node. As another example, device 600 is itself the second node. As another example, the second node can be configured in the device 600. Apparatus 600 can perform the various actions or processes performed by the second node in the method described above. Here, in order to avoid redundancy, a detailed description thereof will be omitted.

The device 600 may be a third node described by the above processing method, for example, the device 600 may be configured as the first node. As another example, device 600 is itself the third node. As another example, the first node can be configured in the device 600. Apparatus 600 can perform the various actions or processes performed by the third node in the method described above. Here, in order to avoid redundancy, a detailed description thereof will be omitted.

Optionally, the device 600 further includes a storage unit communicatively coupled to the processing unit. The data processing apparatus of the embodiment of the present application will be further described below with reference to FIG.

FIG. 10 is a structural block diagram of another data processing apparatus according to an embodiment of the present application. The data processing device 700 shown in FIG. 10 includes a memory 701 and a processor 702.

The memory 701 is configured to store a program.

The processor 702 is configured to execute a program stored in the memory 701. When the program is executed, the switching device 700 can implement the method provided in the foregoing embodiments of FIG. 2-7.

Some or all of the methods shown in Figures 2-7 can be implemented by software using switching device 700.

Memory 701 can be a physically separate unit or can be integrated with processor 702.

Optionally, when some or all of the methods shown in FIG. 2-7 are implemented by software, the switching device 700 may also include only the processor 702. The memory 701 for storing programs is located outside the device 700, and the processor 702 is connected to the memory 701 through circuits/wires for reading and executing programs stored in the memory 701.

The processor 702 can be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP.

Processor 702 can also further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a general array logic (GAL), or any combination thereof.

The memory 701 may include a volatile memory such as a random-access memory (RAM); the memory 701 may also include a non-volatile memory such as a flash memory (flash) Memory), hard disk drive (HDD) or solid-state drive (SSD); the memory 701 may also include a combination of the above types of memories.

Yet another aspect of the present application provides a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method illustrated in Figures 3-8 above The various steps performed by the first node.

Yet another aspect of the present application provides a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method illustrated in Figures 4-6 above The various steps performed by the second node.

Yet another aspect of the present application provides a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the third of the methods illustrated in FIG. 6 above The various steps performed by the node.

Yet another aspect of the present application provides a computer program product comprising instructions which, when executed on a computer, cause the computer to perform the various steps performed by the first node in the method illustrated in Figures 3-7.

Yet another aspect of the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the various steps performed by the second node in the method illustrated in Figures 4-6.

Yet another aspect of the present application provides a computer program product comprising instructions that, when executed on a computer, cause the computer to perform the various steps performed by the third node in the method illustrated in FIG.

It should be noted that the above method embodiments may be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the foregoing method embodiment may be completed by an integrated logic circuit of hardware in a processor or an instruction in a form of software. The processor may be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a Field Programmable Gate Array (FPGA), or the like. Programming logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps, and logical block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present application may be directly implemented by the hardware decoding processor, or may be performed by a combination of hardware and software modules in the decoding processor. The software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in the memory, and the processor reads the information in the memory and combines the hardware to complete the steps of the above method.

It is to be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory may be a read-only memory (ROM), a programmable read only memory (PROM), an erasable programmable read only memory (Erasable PROM, EPROM), or an electric Erase programmable read only memory (EEPROM) or flash memory. The volatile memory can be a Random Access Memory (RAM) that acts as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (Synchronous DRAM). SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Synchronous Connection Dynamic Random Access Memory (Synchlink DRAM, SLDRAM) ) and direct memory bus random access memory (DR RAM). It should be noted that the memories of the systems and methods described herein are intended to comprise, without being limited to, these and any other suitable types of memory.

It should be understood that the term "and/or" herein is merely an association relationship describing an associated object, indicating that there may be three relationships, for example, A and/or B, which may indicate that A exists separately, and A and B exist simultaneously. There are three cases of B alone. In addition, the character "/" in this article generally indicates that the contextual object is an "or" relationship.

It should be understood that, in various embodiments of the embodiments of the present application, the size of the sequence numbers of the foregoing processes does not mean the order of execution sequence, and the execution order of each process should be determined by its function and internal logic, and should not be applied to this application. The implementation of the embodiments constitutes any limitation.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.

A person skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.

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

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

The functions may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a standalone product. Based on such understanding, the technical solution of the present application, which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including The instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .

The foregoing is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present application. It should be covered by the scope of protection of this application. Therefore, the scope of protection of the present application should be determined by the scope of the claims.

Claims

A method of processing data, the method comprising:

Determining, by the first node, a first credit value of the first node, where the first node is a node in a blockchain network;

And determining, by the first node, that the first credit value is greater than the first preset threshold, performing a workload proof calculation based on the first target value, where the first target value is a target value corresponding to the first difficulty, The first difficulty is less than the second difficulty corresponding to the workload proof calculation based on the preset target value.
The method of claim 1 wherein the method further comprises:

The first node determines a second credit value of the first node;

The first node performs a workload proof calculation based on the preset target value if it is determined that the second credit value is less than or equal to the first preset threshold.
The method of claim 1 or 2, wherein the method further comprises:

Determining, by the first node, a third credit value, where the third credit value is a credit value of the second node, where the second node is other than the first node in the blockchain network Any one node;

Determining, by the first node, a fourth credit value, where the fourth credit value is a credit value of a third node, wherein the third node is in the blockchain network except the first node and the Any node other than the second node;

The first node sends transaction information to the second node if it is determined that the third credit value is higher than the fourth credit value.
The method of claim 1 or 2, wherein the method further comprises:

Determining, by the first node, a third credit value, where the third credit value is a credit value of the second node, where the second node is other than the first node in the blockchain network Any one node;

Determining, by the first node, a fourth credit value, where the fourth credit value is a credit value of a third node, wherein the third node is in the blockchain network except the first node and the Any node other than the second node;

The first node, after determining that the third credit value is higher than the fourth credit value, sending transaction information to the second node, and after transmitting the transaction information to the second node, Transmitting the transaction information to the third node.
The method according to any one of claims 1 to 4, wherein before the first node determines the first credit value, the method further comprises:

The first node sends a join request message to the X nodes in the blockchain network, where the join request message includes credit information, where the credit information is used to indicate the latest credit value of the first node, where X is an integer greater than or equal to 1.
The method of claim 5, wherein the method further comprises:

The first node receives an authentication confirmation message sent by at least one of the X nodes and joins the blockchain network, where the authentication confirmation message is used to indicate that the first node can join the blockchain Network; or,

The first node queries the authentication acknowledgement message from the blockchain network and joins the blockchain network, and the authentication confirmation message is used to confirm that the first node can join the blockchain network.
The method of any of claims 1 to 6, wherein the method further comprises:

The first node sends credit statistics information to nodes in the credit statistic blockchain network.
The method according to any one of claims 1 to 7, wherein the first node performs a workload proof calculation based on the first target value, comprising:

The first node performs a workload proof calculation based on the first target value to obtain a consensus confirmation right;

The first node generates a target block.
The method of claim 8 wherein said target block comprises a fifth credit value and said fifth credit value is a difference between said first credit value and a predetermined credit consumption value.
The method according to claim 9, wherein the preset credit consumption value is a preset credit value consumed by the first node based on the first target value to perform a workload proof calculation to obtain a consensus confirmation right.
The method according to any one of claims 8 to 10, wherein the target block further comprises a height difference, the height difference is used to indicate that the first node is last obtained based on the first target value The block height difference between the block of the consensus confirmation right and the block that obtained the consensus confirmation right based on the first target value.
The method of any of claims 1 to 11, wherein the method further comprises:

Receiving, by the first node, first transaction information in the blockchain network, where the first transaction information includes credit demand value information, where the credit demand information is used to indicate that the first transaction information is used by the area The blockchain node performs a consensus confirmation of the required credit value.
The method of claim 12, wherein the method further comprises:

Determining, by the first node, that the first credit value is greater than or equal to a credit value required for the first transaction information to be confirmed by the blockchain node for consensus confirmation;

The first node determines to include the first transaction information in the generated block.
The method according to any one of claims 1 to 13, wherein the method further comprises:

After the first node performs the workload verification calculation to obtain the consensus confirmation right based on the first target value, the first node determines that the competition of the consensus confirmation right of the subsequent N blocks is no longer based on the first target value. Quantity proof calculation; or,

After the first node performs the workload proof calculation based on the first target value to obtain the consensus confirmation right, the first node determines that the competition of the consensus confirmation right of the block in the subsequent Y time units is no longer based on the first The target value is calculated for the workload; or,

After the first node performs the workload proof calculation based on the first target value to obtain the consensus confirmation right, the first node determines that the competition of the consensus confirmation right of the next N blocks is based on the preset target value or the second target. The value performs a workload proof calculation, the second target value is a target value corresponding to the third difficulty, and the third difficulty is less than the second difficulty and greater than the first difficulty; or

After the first node performs the workload proof calculation based on the first target value to obtain the consensus confirmation right, the first node determines that the competition of the consensus confirmation right in the subsequent Y time units is based on the preset target value or The second target value performs a workload proof calculation; wherein the N and the Y are positive integers.
A method of processing data, the method comprising:

Receiving, by the second node, a join request message sent by the first node, where the join request message includes credit information, where the credit information is used to indicate a credit value of the first node in the first blockchain network, and the second The node is a node in the second blockchain network, and the first node is a node in the first blockchain network;

And obtaining, by the second node, a credit value of the first node in the first blockchain network according to the credit information.
The method according to claim 15, wherein the credit information is a credit value of the first node in a first blockchain network, and the second node acquires the first information according to the credit information. The credit value of a node in the first blockchain network includes:

The second node acquires the credit value according to the credit information.
The method according to claim 15, wherein the credit information includes target block information in the target blockchain network that records the credit value, and the second node acquires the information according to the credit information. The credit value of the first node in the first blockchain network includes:

Sending, by the second node, a query request message to the target blockchain network according to the target block information, where the query request message is used to request to acquire the credit value;

The second node receives the query response information sent by the third node, where the query response information includes the credit value, and the third node is a node in the target blockchain network.
A method of processing data, the method comprising:

The third node receives the credit statistics information sent by the first node, and the third node is a node in the credit statistics blockchain network;

The third node determines a credit value of the first node according to the credit statistics information.
The method of claim 18, wherein the method further comprises:

The third node receives a query request message sent by the second node, where the query request message is used to request to acquire the credit value of the first node, and the second node is a node in the second blockchain network;

The third node sends query feedback information to the second node, where the query feedback information includes a credit value of the first node.
A method of processing data, the method comprising:

The first node acquires a credit value of N nodes in the first blockchain network, where the first node is any one of the first blockchain networks, and the N is a positive integer;

Determining, according to the credit value of the N nodes in the first blockchain network, the first node to perform workload proof calculation or using the second scheme to perform workload proof calculation, where The first solution performs the workload proof calculation to perform the workload proof calculation based on the first target value, wherein the first target value is a target value corresponding to the first difficulty, and the second scenario is used to perform the The workload proof is calculated to perform the workload proof calculation based on the preset target value, wherein the preset target value is a target value corresponding to the second difficulty, and the first difficulty is less than the second difficulty.
The method according to claim 20, wherein the first node determines, according to the credit value of the N nodes in the first blockchain network, the workload calculation using the first scheme or adopts The second option performs workload proof calculations, including:

Determining, by the first node, that the workload verification calculation is performed by using the first solution, if the first node determines that the credit values of the N nodes in the first blockchain network are greater than a first preset threshold. ;

Determining, by the first node, that the workload is proved by using the second scheme, if the first node determines that a credit value of the M nodes in the first blockchain network is less than or equal to the first preset threshold. The calculation, wherein the M is a positive integer greater than or equal to 0 and less than or equal to N.
The method according to claim 21, wherein the first node determines, according to the credit value of the N nodes in the first blockchain network, the first solution to perform workload proof calculation or adopts the second The program performs workload proof calculations, including:

The ratio of the number of nodes determining that the credit value in the first blockchain network is greater than the first preset threshold and the number of all nodes in the first blockchain network is greater than a third preset value; Or determining, in the case that the number of nodes in the first blockchain network that the credit value is greater than the first preset threshold is greater than the fourth preset value, determining that the workload is performed by using the first solution. Proof calculation

The ratio of the number of nodes determining that the credit value in the first blockchain network is greater than the first preset threshold and the number of all nodes in the first blockchain network is less than or equal to the third pre-determination In the case of setting the value, or determining that the number of nodes in the first blockchain network with the credit value greater than the first preset threshold is less than or equal to the fourth preset value, determining to adopt the second scheme The workload is calculated.
An apparatus for processing data, characterized in that the apparatus is a first node in a blockchain network, and the apparatus is a unit for performing the method of processing data according to any one of claims 1 to 14. .
An apparatus for processing data, characterized in that the apparatus is a second node in a blockchain network, and the apparatus is a unit for performing the method of processing data according to any one of claims 15 to 17. .
An apparatus for processing data, characterized in that said apparatus is a third node in a credit statistic blockchain network, said apparatus for executing a unit of a method of processing data as claimed in claim 18 or 19.
An apparatus for processing data, characterized in that the apparatus is a first node in a blockchain network, and the apparatus is a unit for performing the method of processing data according to any one of claims 20 to 22. .
A device for processing data, comprising:

a memory for storing a computer program;

A processor for executing a computer program stored in the memory to cause the device to perform the method of processing data according to any one of claims 1 to 22.
A computer readable storage medium comprising a computer program, when executed on a computer, causing the computer to perform the method of processing data as claimed in any one of claims 1 to 22.