WO2021114889A1

WO2021114889A1 - Computational task processing method and device, storage medium, and processor

Info

Publication number: WO2021114889A1
Application number: PCT/CN2020/122886
Authority: WO
Inventors: 李振宇; 张奥萌; 王蒙; 曹文财; 郑汉城; 王健
Original assignee: 深圳数字生命研究院; 深圳碳云智能数字生命健康管理有限公司
Priority date: 2019-12-13
Filing date: 2020-10-22
Publication date: 2021-06-17
Also published as: CN111881147A; CN111881147B

Abstract

A computational task processing method and device, a storage medium, and a processor. The method comprises: a first computing node on a blockchain receiving a computational task set, and, upon completing the computational task set, broadcasting a computational result set to a verification node in the blockchain (S102), wherein the verification node is any computing node on the blockchain; randomly selecting part of a computational result that has been broadcasted by the first computing node (S104); performing recomputation with respect to a corresponding computational task that has generated the partial computational result, so as to perform verification for the randomly selected partial computational result (S106); and if a verification result obtained by the recomputation is consistent with the broadcasted computational result, determining that the computational result published by the first computing node has passed the verification (S108).

Description

Computing task processing method and device, storage medium and processor

Technical field

This application relates to the field of blockchain technology, and specifically to a method and device for processing computing tasks, a storage medium, and a processor.

Background technique

The blockchain is a distributed ledger. The decentralized protocol between the nodes of the blockchain network maintains a continuously growing data chain composed of ordered data blocks, and each data block has a timestamp And a pointer to the previous block, which can safely store transaction data such as digital currency or equity, debt, copyright, etc. The information in the block cannot be forged and tampered with.

In the process of completing computing tasks, there are three main factors: input data, applications, and computing resources. Among them, the application program plays a very important role. It often determines how to use computing resources and what operations are performed on input data. Therefore, in order to ensure the security of computing tasks and avoid data leakage or intrusion of computing resources, it is necessary to have certain requirements on the security of applications.

After a node in the blockchain broadcasts to other nodes that it has generated a new block, other nodes need to verify the amount of work it has completed to ensure that the node has indeed completed all input data using the specified application The processing produced real calculation results, rather than falsified calculation results.

The traditional blockchain proof-of-work method is to solve a complex mathematical problem, such as calculating a number that meets certain specific conditions through a hash function. In the end, the first one to solve this problem, and the nodes that have been verified by most of the nodes in the blockchain get the right to generate new blocks and receive certain rewards. However, this approach leads to a lot of waste of computing resources.

In view of the large number of calculation tasks in the blockchain in the prior art, there is a problem that the calculation results cannot be quickly verified during the processing of the calculation tasks, and no effective solution has been proposed yet.

Summary of the invention

The embodiments of the present application provide a computing task processing method and device, storage medium, and processor to at least solve the large number of computing tasks in the blockchain in the prior art. In the processing of computing tasks, there are calculations. Technical issues that cannot be quickly verified as a result.

According to one aspect of the embodiments of the present application, a method for processing computing tasks is provided, including: a first computing node on a blockchain receives a computing task set, and when the computing task set is completed, the first computing node will The calculation result set is broadcast to the verification node in the blockchain, where the verification node is any calculation node or part of the calculation node on the blockchain; part of the calculation results that have been broadcast on the first calculation node is randomly selected; The calculation task corresponding to the calculation result is recalculated, and the randomly selected part of the calculation result is verified; if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast, it is determined that the calculation result issued by the first computing node is verified.

Optionally, by recalculating the calculation task that produces the partial calculation result, to verify the randomly selected partial calculation result, including: obtaining the input data received by the application program used to process the target calculation task, and the verification node Randomly generated reference data, in which the target calculation task is the calculation task that has generated part of the calculation result; the verification node uses the application program to calculate the input data and reference data to obtain the verification result; the verification result is compared with the corresponding one on the first calculation node The calculation results generated by the calculation task are compared to complete the verification.

Optionally, the reference data is generated based on the random number generation function, and the reference data is used to characterize the correspondence between the verified calculation result and the corresponding calculation task on the first calculation node.

Optionally, in the case where the number of computing nodes to be verified on the blockchain exceeds a preset threshold, the verification results of a predetermined number of computing nodes are randomly selected as a subset to form the overall verification result of the blockchain.

Optionally, the predetermined number is used to determine the number of verification nodes, wherein the number of verification nodes is determined based on the problem complexity m and the length of each verification n.

Optionally, in the process of verifying the set of computing tasks on the blockchain, the method further includes: acquiring an application program for processing computing tasks on any computing node; acquiring historical information on the blockchain, where , The historical information includes at least: the credit rating of the program publishing object that releases the application, the credit rating of the task publishing object that publishes the computing task; determine the review level based on the credit rating of the program publishing object and/or the credit rating of the task publishing object; based on Review the level and determine the verification mode, where the verification mode is used to verify the calculation results released by the computing node.

Optionally, the credit rating of the program publishing object is determined based on the historical information of the publishing application, and the credit rating of the task publishing object is determined based on the historical pass rate of the publishing calculation task.

Optionally, the credit rating of the program publishing object is updated based on changes in the number of publishing applications, the program pass rate, and the number of uses of the published application in the history.

Optionally, the credit rating of the task issuance object is updated based on changes in the number of issuances of the calculation task, the number of passes, the number of completions of the task, and the completion rate of the task in the history.

Optionally, a verification mode is determined based on the review level, where the verification mode includes at least one of the following:

No fragment verification and no data set verification;

No fragment verification and data set verification;

Reduce the multiple of fragment verification and perform fragment verification, and perform data set verification.

Optionally, the security of the platform that publishes the application program is verified by any one of the following methods: detecting the open source code of the application program, verifying the application program using security verification software, and verifying the application program using a security test program.

Optionally, the computing task includes: program information of an application program used to process the computing task, data information of input data corresponding to the computing task, and virtual resources obtained by completing the computing task.

Optionally, while receiving the set of calculation tasks, the first computing node receives the calculation workload of the calculation task and the verification workload of verifying the set of calculation results according to a preset algorithm, wherein the calculation workload is based on the amount of input data and the application The complexity of the algorithm used by the program is determined, and the verification workload is determined based on the preset total workload and calculation workload.

Optionally, randomly extract part of the calculation results that have been broadcast on the first computing node for multiple times, and verify the part of the calculation results randomly selected each time, if the verification results obtained after multiple recalculations are consistent with the calculation results that have been broadcast , It is determined that the calculation result published by the first computing node passes the verification.

Optionally, when each computing node on the blockchain passes the verification, it is determined that the updated block is a new block.

According to another aspect of the embodiments of the present application, a method for processing computing tasks is also provided, including: when the first computing node on the blockchain receives the computing task set, and the computing tasks in the computing task set are completed , The first computing node broadcasts the set of calculation results to the verification node in the blockchain, where the verification node is any computing node or part of the computing node on the blockchain; acquiring historical information on the blockchain, where history The information includes at least: the credit rating of the program publishing object that publishes the application, the credit rating of the task publishing object that publishes the computing task, the application is on any computing node and is used to process the computing task; based on the credit rating of the program publishing object and / Or the credit rating of the task release object, determine the review level; based on the review level, determine the verification mode, where the verification mode is used to verify the calculation results published by the computing node; randomly select part of the calculation results that have been broadcast on the first computing node; pass The calculation tasks corresponding to the partial calculation results are recalculated, and the randomly selected partial calculation results are verified.

Optionally, the verification mode is determined based on the review level, where the verification mode includes at least one of the following: no fragment verification and data set verification, no fragment verification and data set verification, reduction of the multiple of fragment verification, and fragment verification And data set verification.

Optionally, by recalculating the calculation task corresponding to the part of the calculation result, verifying the randomly selected part of the calculation result includes: obtaining input data received by the application program for processing the target calculation task, and verifying the node Randomly generated reference data, where the target calculation task is a calculation task that has produced partial calculation results: the verification node uses the application program to calculate the input data and reference data to obtain the verification result; the verification result is compared with the corresponding one on the first calculation node The calculation results generated by the calculation task are compared to complete the verification.

Optionally, reference data is generated based on a random number generation function, and the reference data is used to characterize the correspondence between the verified calculation result and the corresponding calculation task on the first calculation node.

Optionally, when the number of verification computing nodes on the blockchain exceeds a threshold, the verification results of the verification computing nodes are used as a subset to form the overall verification result of the blockchain.

According to another aspect of the embodiments of the present application, there is provided a computing task processing device, including:

The broadcast module is set to receive the set of calculation tasks through the first computing node on the blockchain, and when the set of computing tasks is completed, broadcast the set of calculation results to the verification node in the blockchain through the first computing node, where , The verification node is any computing node or part of the computing node on the blockchain;

The extraction module is set to randomly extract part of the calculation results that have been broadcast on the first computing node;

The verification module is set to recalculate the calculation tasks corresponding to the partial calculation results, and is used to verify the randomly selected partial calculation results;

The first determining module is configured to determine that the calculation result issued by the first computing node passes the verification if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast.

According to another aspect of the embodiments of the present application, a storage medium is also provided. The storage medium includes a stored program, wherein when the program is running, the device where the storage medium is located is controlled to execute the processing method of the foregoing calculation task.

According to another aspect of the embodiments of the present application, there is also provided a processor, which is configured to run a program, wherein the above-mentioned processing method for computing tasks is executed when the program is running.

In the embodiment of the present application, after the first node on the blockchain receives the calculation task set, it will use the corresponding application to calculate the calculation task set, obtain the calculation result set, and broadcast the calculation result set to the verification node. The verification node can randomly extract part of the calculation results, recalculate the calculation tasks corresponding to the partial calculation results, and compare the consistency of the verification results obtained by the recalculation with the calculation results that have been broadcast, so as to determine the calculation issued by the first calculation node Whether the result is verified. Compared with related technologies, since each node only extracts part of the calculation results for verification, the verification speed is faster. Moreover, each verification node adopts a method of randomly verifying part of the calculation results. The first calculation node participating in the calculation task cannot predict which calculation results will be verified, so it is impossible to generate only these possible verification calculation results and forge other calculation results. , The difficulty of cheating by computing nodes is increased, and a large number of computing tasks in the blockchain in the prior art are solved. In the processing of computing tasks, there is a technical problem that the calculation results cannot be quickly verified.

Description of the drawings

The drawings described here are used to provide a further understanding of the application and constitute a part of the application. The exemplary embodiments and descriptions of the application are provided to explain the application, and do not constitute an improper limitation of the application. In the attached picture:

Fig. 1 is a flowchart of a method for processing a computing task according to an embodiment of the present application;

Fig. 2 is a flowchart of an optional processing method for computing tasks according to an embodiment of the present application;

Fig. 3 is a flowchart of another method for processing a computing task according to an embodiment of the present application;

Fig. 4 is a schematic diagram of a processing device for computing tasks according to an embodiment of the present application; and

Fig. 5 is a schematic diagram of another computing task processing device according to an embodiment of the present application.

Detailed ways

In order to enable those skilled in the art to better understand the solutions of the application, the technical solutions in the embodiments of the application will be clearly and completely described below in conjunction with the drawings in the embodiments of the application. Obviously, the described embodiments are only These are a part of the embodiments of this application, but not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work should fall within the protection scope of this application.

It should be noted that the terms “first” and “second” in the specification and claims of the application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific sequence or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in a sequence other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations of them are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those clearly listed. Those steps or units may include other steps or units that are not clearly listed or are inherent to these processes, methods, products, or equipment.

First, the technical names or technical terms appearing in the embodiments of this application are explained as follows:

Blockchain: A distributed ledger. The decentralized agreement between blockchain network nodes maintains a continuously growing data chain composed of ordered data blocks, and each data block has a timestamp And a pointer to the previous block. It can safely store transaction data such as digital currency or equity, debt, copyright, etc. The information in the block cannot be forged or tampered with. The block chain is also an open ledger, which is permanent. , Which records the transactions between the two efficiently and retrospectively. This ledger can also use programmable scripts to automatically trigger transactions. Blockchain solves the Byzantine general problem, which can greatly reduce the cost of trust in society and reshape The mechanism of Internet value transmission.

Proof of Work: Proof Of Work, POW for short. Prove the completion of the corresponding workload by certifying the results of the work.

Hash function, also known as hash function, given an input x, it will calculate the corresponding output H(x).

Example 1

According to an embodiment of the present application, a method for processing computing tasks is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. The logical sequence is shown in the flowchart, but in some cases, the steps shown or described may be performed in a different order than here.

Fig. 1 is a flowchart of a method for processing a computing task according to an embodiment of the present application. As shown in Fig. 1, the method includes the following steps:

Step S102, the first computing node on the blockchain receives the computing task set, and when the computing task set is completed, the first computing node broadcasts the computing result set to the verification node in the blockchain, where the verification node is Any computing node or part of computing nodes on the blockchain;

As shown in Figure 2, any node with computing needs on the blockchain can publish computing tasks and become a task publishing node. Among them, computing tasks include: program information of applications used to process computing tasks, data information of input data corresponding to computing tasks, and virtual resources obtained by completing computing tasks. Virtual resources can exist on the Internet and can be The resources to be transferred and used, specifically, can be points, gifts, or online goods, but are not limited to this. When a node publishes a computing task, it can provide the following information: the number and version number of the application that needs to be used; the method of obtaining input data (including web crawler acquisition, personal collection, public data, etc.) and the amount of data; for this calculation task Remuneration paid. In addition, the calculation task will also attach the release time and the signature of the release node.

It should be noted that the applications used by each computing node in the blockchain have a name, number, and version number. Among them, the number of each application is unique, and the number can be automatically generated in the order in which the application is released. Yes, the number can consist of letters and numbers. When each application is released or upgraded, it will generate a verification code (such as a hash value) that can verify whether the application has been modified. Moreover, each application program has a corresponding publisher, and whenever an application program is successfully used for a computing task, the publisher of the application program can obtain revenue.

A task management center is deployed on a specific node on the blockchain, which is responsible for receiving computing tasks issued by each node on the blockchain. As shown in Figure 2, in a transaction cycle, multiple computing tasks are packaged into a computing task set and broadcast to the entire network.

After any node on the blockchain receives the set of calculation tasks, if it decides to perform task calculation, then this node becomes the first calculation node. First, all transactions in the transaction period are packaged, and then task calculation is started. As shown in Figure 2, after the node has completed the workload, the nodes participating in the calculation will generate an updated block based on the access method of the calculation result and the packaged transaction, and broadcast it to the entire network or verification nodes. Among them, the calculation result may include the expected time length and the actual time length to complete the published calculation task.

The verification node can be determined in two ways. In an optional scheme, any node on the blockchain is a verification node. When a node receives the set of calculation results broadcast by other nodes, it first verifies whether the traditional proof of work is passed, and if it passes, then verifies the authenticity of the result of the calculation task. To verify the authenticity of the traditional proof of work and verify the result of the calculation task, the verification can be performed at the same time or the order of verification can be exchanged. The traditional workload is selected first because the verification is fast, and the minimum workload is used to determine whether it is necessary Proceed to the next verification. The prerequisite for propagating a new block is that both verifications pass. In another optional solution, the verification node can be a subset of the entire node, called a verification node set, which can form a verification chain. The selection methods of this collection include but are not limited to:

1. Random selection:

a) A node pool is composed of all valid nodes. The valid nodes must be survivable (the active nodes are the surviving nodes). In a preferred embodiment, the valid nodes are also limited by the node's credit level, for example, the credit level It needs to reach a certain predetermined level or above; in other preferred embodiments, the validity of the node can also include other restrictive factors such as the computing power and historical information of the computing node on the premise that it is survivable, as detailed here Not limited

b) In the verification phase, a required number of nodes are randomly selected from the node pool as verification nodes to form a verification node set. The method of random selection can be to number the nodes in sequence, and then use a set of random numbers for extraction.

2. Campaign:

b) In the verification phase, all valid nodes declare the resources that can be used to perform calculations this time, and determine whether they are selected as verification nodes according to the amount of resources that can be used to perform calculations. For example, when the number of resources that can be used to perform calculations is greater than or equal to the predetermined The threshold can be selected for this verification;

c) After the verification is completed, the verification node that completes the task can also invest in execution computing resources and provide corresponding virtual resources.

Each verification node first verifies whether the traditional proof of work is passed, and if it passes, it verifies the authenticity of the result of the calculation task.

Step S104, randomly extract part of the calculation results that have been broadcast on the first computing node;

It should be noted that for the same input data, the calculation results obtained by using the same application program should be the same. On this basis, as shown in Figure 2, when the verification node verifies the authenticity of the calculation result, it can randomly extract a part of the calculation result for each calculation task according to the access method of the calculation result in the updated block. Verify its authenticity.

It should be noted that in order to achieve the above purpose, the randomness requires that the calculation task can be divided into several parts at will, and each part can be calculated independently without relying on the results of other parts.

Step S106, by recalculating the calculation tasks corresponding to the partial calculation results, verifying the randomly selected partial calculation results;

In step S108, if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast, it is determined that the calculation result issued by the first computing node passes the verification.

The verification node can recalculate the input data that produces this part of the calculation result, and compare the recalculation result (that is, the verification result above) and the consistency of the calculation result that has been broadcast to determine whether the first calculation node that initiated the broadcast Completed the calculation task. As shown in Figure 2, if the two calculation results are consistent, it is determined that the first computing node has completed the calculation task, and the calculation result passes the verification.

Using the above-mentioned embodiment of this application, after the first node on the blockchain receives the calculation task set, it will use the corresponding application to calculate the calculation task set, obtain the calculation result set, and broadcast the calculation result set to the verification node. The verification node can randomly extract part of the calculation results, recalculate the calculation tasks corresponding to the partial calculation results, and compare the consistency of the verification results obtained by the recalculation with the calculation results that have been broadcast, so as to determine the calculation issued by the first calculation node Whether the result is verified. Compared with related technologies, since each node only extracts part of the calculation results for verification, the verification speed is faster. Moreover, each verification node adopts a method of randomly verifying part of the calculation results. The first calculation node participating in the calculation task cannot predict which calculation results will be verified, so it is impossible to generate only these possible verification calculation results and forge other calculation results. , The difficulty of cheating by computing nodes is increased, and a large number of computing tasks in the blockchain in the prior art are solved. In the processing of computing tasks, there is a technical problem that the calculation results cannot be quickly verified.

Optionally, in the above-mentioned embodiment of the present application, by recalculating the calculation task corresponding to the partial calculation result, verifying the randomly selected partial calculation result includes: obtaining the received application program for processing the target calculation task The input data and the reference data randomly generated by the verification node. The input data and reference data are used to determine the target calculation task. The target calculation task is the calculation task that has generated part of the calculation result; the verification node uses the application program to compare the input data and reference The calculation task determined by the data is calculated to obtain a verification result; the verification result is compared with the calculation result generated by the corresponding calculation task on the first computing node to complete the verification.

The embodiment of this application does not make any limitation on the task type of the computing task. In this embodiment, taking genome mutation detection as the computing task as an example, the foregoing embodiment of the present application will be described in detail. The input data of the application program used for the calculation task is the result file and the index file of the comparison of the short sequence obtained by the genome sequencing to the reference genome sequence. The result file includes the alignment of each short sequence, such as whether it can be aligned, if so, which position on the reference genome, the quality of the alignment, and the bases included in the short sequence. What are the specific differences between the bases on the reference genome, and so on. And the result file is sorted according to the alignment position of the short sequence in the reference genome, for example, from chromosome 1 to chromosome 22, followed by X chromosome, Y chromosome (male specific), and mitochondrial chromosome. The index file allows the application to extract the comparison result of a specific position in the reference genome from the comparison result file.

Therefore, when verifying the authenticity of the results of the calculation task, it is only necessary to randomly generate some reference genome position coordinates, and then provide these position coordinates, the comparison result file and its index file to the application program, and then these positions can be calculated. The result of mutation detection is compared with the calculation result released by the computing node. If the results are consistent, it proves that the calculation results published by the computing node are true.

In an optional embodiment, reference data may be generated based on a random number generation function, and the reference data is used to characterize the correspondence between the verified calculation result and the corresponding calculation task on the first calculation node.

The aforementioned random number generation function can be a combination of the srand() function and the rand() function in the C language, but it is not limited to this. First pass a parameter to the srand() function, generate a random seed, and then run the rand() function multiple times to obtain multiple random numbers, and then convert the multiple random numbers into positions on the reference genome. For example, in order to randomly obtain positions on 100 reference genome sequences, you can first obtain 200 random numbers; then randomly group, for example, you can group according to the following grouping methods: (1, 2), (3, 4)... (199, 200) method to divide 200 random numbers into 100 groups; then use the first number in each group to take the remainder of 25, and the obtained remainder is converted into the chromosome number on the reference genome sequence of the group (the remainder 0 corresponds to 1 Chromosome 1 corresponds to chromosome 2, and so on, the remainder 22 corresponds to chromosome X, 23 corresponds to chromosome Y, and 24 corresponds to mitochondria); then use the second number in each group of the base pair of the group of chromosomes Take the remainder of the length to obtain the position on the chromosome. In order to obtain better randomness, it is best to make the parameters passed to the srand() function by different verification nodes different. For example, the system time of the node (the number of seconds elapsed from 0:00:00 on January 1, 1970, UTC to the current time) of the node can be used to perform a remainder operation on the process id of the current verification task. The result of the operation is used as the parameter of the srand() function.

Since the process IDs of different nodes for verification tasks are basically different, the parameters passed by different nodes to the srand() function are also basically different, which eventually leads to different random numbers generated by the rand() function, so different nodes During verification, the randomly generated position coordinates are basically different. It is also impossible for a computing node to know the position coordinates randomly generated by other nodes, so it is impossible to take a cheating behavior that only calculates these position coordinates without calculating other position coordinates.

It should be noted that in order to prevent malicious verification or cheating, the random number seed used when selecting the result should be hidden, and the same seed should be distributed to multiple nodes to avoid cheating and malicious verification. For maliciously verified or cheating nodes, the probability of selection is reduced.

Optionally, in the above-mentioned embodiment of the present application, when the number of verification nodes on the blockchain exceeds a preset threshold, the verification results of a predetermined number of calculation nodes are randomly selected as a subset to form the whole of the blockchain Validation results.

Specifically, the above-mentioned preset threshold can be set according to actual use, which is not specifically limited in this application. The predetermined number is used to determine the number of verification nodes, where the number of verification nodes is determined based on the problem complexity m and the length of each verification n.

Since the random verification result subsets of different nodes are basically different, when there are a large number of nodes to verify, the set of the result subsets of these node verifications can effectively cover the entire calculation result.

In an optional scheme, the number of verification nodes is determined by the problem complexity m and the length of each verification n. The calculation formula is as follows: Q=(mk+ν ₀ )n+ν ₁ , where k is the complexity of the problem The weight of m, ν ₀ , ν ₁ are deviations, and the value range can be determined according to the longest length and maximum complexity. When 0<Q<(m _max k+ν ₀ )n _max +ν ₁ is satisfied, the solution Take any solution in space. The interval complete coverage algorithm or other algorithms can be used to find the minimum number of verification nodes P. The value range of P is limited by the specific conditions of the blockchain, for example, the limit is at least 101. The specific principle is: no more than the summary points, no less 1, and according to the requirements issued by the task issuer.

Optionally, in the above-mentioned embodiment of the present application, part of the calculation result that has been broadcast on the first computing node is randomly selected multiple times, and the part of the calculation result randomly selected each time is verified. If the verification result obtained by recalculating multiple times If they are consistent with the calculation results that have been broadcast, it is determined that the calculation results published by the first computing node pass the verification.

In an optional embodiment, for each verification node, V times may be randomly selected for each computing task for verification, where V is greater than or equal to 2 to ensure verification coverage. For example, you can extract 10 times, each time 0.01% of the calculation result is extracted, and then the calculation task of the extracted calculation result is verified. If all V verifications are passed, then a single computing task is verified.

Optionally, in the above-mentioned embodiment of the present application, when each computing node on the blockchain passes the verification, it is determined that the updated block is a new block.

In an optional embodiment, if the authenticity of the results of all calculation tasks is verified, the verification node approves the calculation results of the calculation node. The verification node broadcasts the verification result in the set. If the verification node set passes, the verification is passed, the block is added to the blockchain of its own record, and a verification node is selected from the verification set to package the transaction cycle The task record generates a new block.

It should be noted that if the verification fails, the block is rejected as a new block. In an alternative embodiment, if the verification fails, the task will continue to be in an incomplete state without modification.

Optionally, in the foregoing embodiment of the present application, in the process of verifying the set of computing tasks on the blockchain, the method further includes: acquiring an application program for processing computing tasks on any computing node; Historical information on the blockchain, where the historical information includes at least: the credit rating of the program publishing object that publishes the application, the credit rating of the task publishing object that publishes the computing task; the credit rating based on the program publishing object and/or the task publishing object The credit rating determines the review level; based on the review level, determines the verification mode, where the verification mode is used to verify the calculation results issued by the computing node.

In the embodiment of the present application, an application center is deployed on a specific node of the blockchain, and the application can be a virtual center, which is mainly responsible for security review and verification of the application to be chained and serves as a program warehouse. For querying and calling applications. The application center is also provided with an analysis module of related historical information. This module is the basic component of the application center and is also in the program list of the application center. It can perform the analysis and calculation tasks of the application center on the programs and nodes on the chain, which is used to analyze and calculate the application and node task release behavior/participation in verification behavior and other operations. The result can be used as the safety/efficiency/frequency of the application, etc. Evaluation reference in all aspects. In addition, check the local state of the program (existence state, version check code, integrity check code) when the node initializes or releases/receives tasks.

It should be noted that the application center has security. In order to ensure the security of the application (the review of security, including but not limited to malicious infringement of resources, tampering with data on the chain, attacking other nodes, etc.), the methods that can be used include but not limited to:

Optionally, in the foregoing embodiment of the present application, the credit rating of the program publishing object is determined based on the historical information of the publishing application, and the credit rating of the task publishing object is determined based on the historical pass rate of the publishing calculation task.

In an optional embodiment, the analysis module can define the credit rating of the application publisher/task publisher according to the pass rate of historical publishing application information/posting tasks. Those with a high credit rating will appropriately simplify the procedures. The review process and lower the review threshold.

Optionally, in the foregoing embodiment of the present application, the credit rating of the program publishing object is updated based on changes in the number of publishing applications, the program pass rate, and the number of uses in the history of publishing applications.

In an optional embodiment, for the program issuer, the credit rating is divided into four levels, namely A, B, C, and D. The credit rating will dynamically change with the number of times the program is passed and the number of times the program is used. And displayed in the program center. For level A, the number of programs issued exceeds 200 times, the program pass rate reaches 90%, the cumulative number of program uses reaches 5000 times, and the cumulative number of uses of a single program reaches more than 50%. For level B, the number of programs issued exceeds 50 times, the program pass rate reaches 80%, the cumulative number of program uses reaches 500 times, and the cumulative number of uses of a single program reaches more than 30%. For level C, the number of issued procedures exceeds 10 times, the procedure pass rate reaches 80%, and the cumulative number of procedures used reaches 50 times. Grade D is the default rating.

Optionally, in the foregoing embodiment of the present application, the credit rating of the task issuance object is updated based on changes in the number of issuances of the calculation task, the number of passes, the number of task completions, and the task completion rate in history.

In an optional embodiment, for the task issuer, the credit rating is divided into four levels, namely A, B, C, and D. The credit rating will dynamically change as the number of passes and the number of task completions change, and Shown in the task center. For level A, the number of missions issued exceeds 5000 times, the mission pass rate reaches 90%, and the mission completion rate reaches 70%. For level B, the number of missions issued exceeds 500 times, the mission pass rate reaches 80%, and the mission completion rate reaches 60%. For the C level, the number of missions issued exceeds 50 times, the mission pass rate reaches 80%, and the mission completion rate reaches 60%. Grade D is the default rating.

Optionally, in the above-mentioned embodiment of the present application, the verification mode is determined based on the review level, where the verification mode includes at least one of the following: fragment verification is not performed, and, data set verification is not performed; fragment verification is not performed, and, Perform data set verification; reduce the multiple of fragment verification and perform fragment verification, and, perform data set verification.

In an alternative embodiment, the rights and interests enjoyed by a single program or task will be based on the credit rating of the issuing party during the review by the Application Center. For level A, the rights and interests enjoyed by the review program will be exempted from fragment verification and demo data. verification. For level B, when the right to enjoy is the review procedure, the task segment verification is exempted. For level C, when the rights it enjoys are review procedures, segment verification is reduced to 2.5 times the amount of demo data/time. For Class D, no rights are enjoyed.

Among them, for the program publisher, demo data set verification: the publisher needs to provide an appropriate amount of demo data set as verification to verify the safety of the program; task fragment verification: verification 8 times (other multiples are also possible, usually more than twice) The random task data in the demo data set/time is used as a sampling verification to verify the safety of the program. For the task publisher, demo data set verification: the publisher needs to provide an appropriate amount of demo data set as verification to verify the safety of the task and the accuracy of the estimated workload; Fragment verification: verification 8 times (other multiples are also possible, usually More than two times is ok) Real data in the demo data set/time is used as verification, the safety of the verifier and the accuracy of the estimated workload of the evaluation.

Optionally, in the above-mentioned embodiment of the present application, the security of the platform that publishes the application program is verified by any of the following methods: detecting the open source code of the application program, using the security verification software to verify the application program, and using the security test program to verify the application program .

In an optional embodiment, the security policy of the program publisher is as follows: open source review of the application; general computer software security verification; logical verification, which logically evaluates whether the program has malicious infringement of resources and tampering from the open source code Chain data, attack other nodes, etc. The above three-step verification is passed, and then demo data verification and fragment verification are selected according to the credit rating.

Optionally, in the foregoing embodiment of the present application, the first computing node receives the computing workload of the computing task and the verification workload of verifying the computing result set according to a preset algorithm while receiving the computing task set, where the computing workload Based on the amount of input data and the complexity of the algorithm used by the application, the verification workload is determined based on the preset total workload and calculation workload.

Specifically, the foregoing preset algorithm may be a hash algorithm, but is not limited to this, and the preset total workload may be an expected total workload.

In the embodiment of the present application, when the data volume of the input data of a computing task is determined, the workload of the computing task can be estimated. When the algorithm used by the application is determined (it is not allowed to publish tasks when uncertain), the algorithm complexity can be calculated. For example, if the complexity of an algorithm is O(n) (that is, time complexity), it can be considered that the workload of using the application to complete the calculation task is proportional to the amount of input data. The application can be accompanied by some test cases for the third party to verify the algorithm complexity given by it, or standard data can be produced from classic problems in the field (such as loop algorithm and recursive algorithm) to test the time complexity of the application.

The total workload consists of the workload of traditional proof of work (predictable) (for example, calculating the hash function) and the workload of the set of computing tasks published on the blockchain (calculation and composition). In order to maintain the stability of the total workload and to ensure that the block generation speed of the blockchain meets certain conditions, the difficulty of the traditional workload proof problem can be automatically adjusted according to the workload of the computing task set. When the workload of the computational task set is large, the difficulty of the traditional workload proof problem is reduced. When the workload of the computational task set is very small, the difficulty of the traditional workload proof problem increases.

Specifically, assuming that the expected speed of the blockchain to generate new blocks is N minutes/block, if the published calculation task is expected to take X minutes to complete, it is expected that the traditional proof of work will take (NX) minutes to complete. The formula for calculating the difficulty is: reference difficulty value*(NX)/N. The benchmark difficulty value is the difficulty value of the traditional proof of work when there is no published calculation task. The benchmark difficulty value is adjusted every B blocks, and its calculation method is similar to the difficulty value in Bitcoin's proof of work: new benchmark difficulty value = old benchmark difficulty value * (the traditional proof of work completed in the past B blocks The sum of the actual length of time used + the sum of the actual length of the calculation task completed in the past B blocks-the sum of the expected time length of the calculation task completed in the past B blocks) / the traditional workload completed in the past B blocks The sum of the expected duration of the proof.

Among them, the value range of B is any number, depending on the total number of blockchains. Specifically, it is appropriate to range from 5% of the total number of blockchains to the total number of blockchains.

In an alternative embodiment, the task management center may use the expected total workload minus the workload of the calculation task set to obtain the workload (difficulty value) of the traditional workload proof. As shown in Figure 2, finally the set of computing tasks (including its workload) and the difficulty value of the traditional workload proof are packaged and broadcast to the entire network.

It should be noted that, as shown in Figure 2, the computing node will also perform traditional workload verification during task calculation, and the calculation result also includes the expected duration and actual duration of completing the traditional workload verification.

Through the above steps, a blockchain-based workload proof system is provided, a method for quickly verifying the authenticity of the results given by the nodes participating in the computing task is proposed, and the security of the issued computing task is clearly proposed. method. While achieving the purpose of proof-of-work, some practical computing tasks (such as computing tasks in the field of biological information) can be completed, thereby improving the efficiency of computing resources.

Example 2

According to an embodiment of the present application, a method for processing computing tasks is provided.

Fig. 3 is a flowchart of another method for processing a computing task according to an embodiment of the present application. As shown in Fig. 3, the method includes the following steps:

In step S302, the first computing node on the blockchain receives the computing task set, and when the computing tasks in the computing task set are completed, the first computing node broadcasts the calculation result set to the verification node in the blockchain, where , The verification node is any computing node or part of the computing node on the blockchain;

Step S304: Obtain historical information on the blockchain, where the historical information includes at least: the credit level of the program publishing object that publishes the application, the credit level of the task publishing object that publishes the computing task, and the application is on any computing node, And used to process computing tasks;

Step S306: Determine the review level based on the credit level of the program release object and/or the credit level of the task release object;

Step S308: Determine a verification mode based on the review level, where the verification mode is used to verify the calculation results issued by the computing node;

Step S310: randomly extract part of the calculation results that have been broadcast on the first computing node;

Step S312, by recalculating the calculation tasks corresponding to the partial calculation results, and verifying the randomly selected partial calculation results.

Using the above-mentioned embodiment of this application, after the first node on the blockchain receives the calculation task set, it will use the corresponding application to calculate the calculation task set, obtain the calculation result set, and broadcast the calculation result set to the verification node. The verification node can randomly extract part of the calculation results, recalculate the calculation tasks corresponding to the partial calculation results, and compare the consistency of the verification results obtained by the recalculation with the calculation results that have been broadcast, so as to determine the calculation issued by the first calculation node Whether the result is verified. Compared with related technologies, since each node only extracts part of the calculation results for verification, the verification speed is faster. Moreover, each verification node adopts a method of randomly verifying part of the calculation results. The first calculation node participating in the calculation task cannot predict which calculation results will be verified, so it is impossible to generate only these possible verification calculation results and forge other calculation results. , The difficulty of cheating by computing nodes is increased, and a large number of computing tasks in the blockchain in the prior art are solved. In the processing of computing tasks, there is a technical problem that the calculation results cannot be quickly verified. In addition, the review level is determined through the historical information on the blockchain, and the verification mode is further determined to ensure the security of the application (for security review, including but not limited to malicious infringement of resources, tampering with data on the chain, attacking other nodes, etc. ).

Optionally, in the foregoing embodiment of the present application, the credit rating of the program publishing object is updated based on changes in the number of publishing applications, the program pass rate, and the number of uses in the history.

Optionally, in the foregoing embodiment of the present application, the credit rating of the task issuance object is updated based on changes in the number of issuances, the number of task passes, the number of task completions, and the task completion rate of the calculation tasks issued in the history.

Optionally, in the above-mentioned embodiment of the present application, the verification mode is determined based on the review level, where the verification mode includes at least one of the following: no fragment verification, and, no data set verification; no fragment verification, and, Data set verification; reduce the multiple of fragment verification and perform fragment verification, and, perform data set verification.

Optionally, in the above-mentioned embodiment of the present application, by recalculating the calculation task corresponding to the partial calculation result, verifying the randomly selected partial calculation result includes: obtaining the received application program for processing the target calculation task The input data and the reference data randomly generated by the verification node. Among them, the target calculation task is the calculation task that produces part of the calculation result: the verification node uses the application program to calculate the input data and reference data to obtain the verification result; compare the verification result with The calculation results generated by the corresponding calculation tasks on the first calculation node are compared to complete the verification.

Optionally, in the foregoing embodiment of the present application, reference data is generated based on a random number generation function, and the reference data is used to characterize the correspondence between the verified calculation result and the corresponding calculation task on the first calculation node.

Optionally, in the foregoing embodiment of the present application, when the number of verification computing nodes on the blockchain exceeds a threshold, the verification result of the verification computing node is used as a subset to form the overall verification result of the blockchain.

It should be noted that the preferred embodiments or technical solutions in the embodiments of the present application are the same as those in Embodiment 1, and will not be repeated here.

Example 3

According to an embodiment of the present application, a processing device for computing tasks is provided.

Fig. 4 is a schematic diagram of a computing task processing device according to an embodiment of the present application. As shown in Fig. 4, the device includes:

The broadcasting module 42 is configured to receive the set of calculation tasks through the first calculation node on the blockchain, and when the set of calculation tasks is completed, broadcast the set of calculation results to the verification node in the blockchain through the first calculation node, Among them, the verification node is any computing node or part of the computing node on the blockchain;

The extraction module 44 is configured to randomly extract part of the calculation results that have been broadcast on the first computing node;

The verification module 46 is configured to verify the randomly selected part of the calculation result by recalculating the calculation task corresponding to the part of the calculation result;

The determining module 48 is configured to determine that the calculation result issued by the first computing node passes the verification if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast.

It should be noted here that the above-mentioned broadcasting module 42, extraction module 44, verification module 46, and determination module 48 can be run in a computer terminal as a part of the device, and the functions implemented by the above modules can be executed by the processor in the computer terminal. The computer terminal can also be a smart phone (such as an Android phone, an IOS phone, etc.), a tablet computer, a handheld computer, and a mobile Internet device (Mobile Internet Devices, MID), PAD and other terminal devices.

Optionally, in the foregoing embodiment of the present application, the verification module includes: an acquisition unit configured to acquire input data received by an application program for processing the target computing task, and reference data randomly generated by the verification node, wherein the target computing The task is a calculation task that produces a partial calculation result; the calculation unit is set to use the application to calculate the input data and reference data to obtain the verification result; the comparison unit is set to compare the verification result with the corresponding calculation on the first calculation node The calculation results generated by the task are compared to complete the verification.

It should be noted here that the above-mentioned acquisition unit, calculation unit, and comparison unit can be run in a computer terminal as part of the device, and the functions implemented by the above-mentioned modules can be executed by the processor in the computer terminal, and the computer terminal can also be a smart device. Mobile phones (such as Android phones, IOS phones, etc.), tablet computers, handheld computers, and terminal devices such as MID and PAD.

Optionally, in the foregoing embodiment of the present application, the extraction module is further configured to generate reference data based on a random number generation function, and the reference data is used to characterize the correspondence between the verified calculation result and the corresponding calculation task on the first calculation node.

Optionally, in the above-mentioned embodiment of the present application, the extraction module is further configured to randomly extract the verification results of a predetermined number of computing nodes as the subset constituent area when the number of computing nodes for verification on the blockchain exceeds a preset threshold. The overall verification result of the block chain.

Optionally, in the above-mentioned embodiment of the present application, the extraction module is further configured to randomly extract part of the calculation results that have been broadcast on the first computing node multiple times; the verification module is further configured to verify the part of the calculation results randomly extracted each time; The determining module is further configured to determine that the calculation result published by the first computing node passes the verification if the verification results obtained by multiple recalculations are consistent with the calculation results that have been broadcast.

Optionally, in the foregoing embodiment of the present application, the determining module is further configured to determine that the updated block is a new block when each computing node on the blockchain passes the verification.

Optionally, in the above-mentioned embodiment of the present application, the device further includes: a first acquisition module configured to acquire an application program used to process computing tasks on any computing node; a second acquisition module configured to acquire a blockchain The historical information, where the historical information includes at least: the credit rating of the program publishing object that publishes the application, and the credit rating of the task publishing object that publishes the computing task; the first determining module is set based on the credit rating of the program publishing object and/ Or the credit rating of the task release object determines the review level; the second determining module is set to determine the verification mode based on the review level, where the verification mode is used to verify the calculation results released by the computing node.

It should be noted here that the above-mentioned first acquisition module, second acquisition module, first determination module, and second determination module may be run in a computer terminal as part of the device, and the above modules may be executed by a processor in the computer terminal. For the realized functions, the computer terminal can also be a smart phone (such as an Android phone, an IOS phone, etc.), a tablet computer, a palmtop computer, and a terminal device such as MID and PAD.

Optionally, in the foregoing embodiment of the present application, the second determining module is further configured to determine the credit level of the program publishing object based on the historical information of the publishing application, and determine the credit level of the task publishing object based on the historical pass rate of the publishing calculation task.

Optionally, in the above-mentioned embodiment of the present application, the verification module is also set to verify the security of the platform that publishes the application by any of the following methods: detecting the open source code of the application, using security verification software to verify the application, and using security The test program verifies the application.

Optionally, in the above-mentioned embodiment of the present application, the device further includes: a receiving module configured to receive the calculation workload of the calculation task and verify the calculation result set according to a preset algorithm when the first computing node receives the calculation task set The verification workload is determined based on the amount of input data and the complexity of the algorithm used by the application, and the verification workload is determined based on the preset total workload and calculation workload.

It should be noted that, for the preferred embodiments or technical solutions in the embodiments of the present application, reference may be made to Embodiment 1, which will not be repeated here.

Example 4

Fig. 5 is a schematic diagram of another computing task processing device according to an embodiment of the present application. As shown in Fig. 5, the device includes:

The broadcast module 52 is configured to be configured to the first computing node on the blockchain to receive the computing task set, and in the case that the computing tasks in the computing task set are completed, the first computing node broadcasts the calculation result set to the blockchain for verification Nodes, where the verification node is any computing node or part of the computing node on the blockchain;

The obtaining module 54 is configured to obtain historical information on the blockchain, where the historical information includes at least: the credit rating of the program publishing object that publishes the application, the credit rating of the task publishing object that publishes the computing task, and the application calculates at any one On the node, and used to process computing tasks;

The first determining module 56 is configured to determine the review level based on the credit level of the program release object and/or the credit level of the task release object;

The second determining module 58 is configured to determine a verification mode based on the review level, where the verification mode is used to verify the calculation results issued by the computing node;

The extraction module 510 is configured to randomly extract part of the calculation results that have been broadcast on the first computing node;

The verification module 512 is configured to verify the randomly selected part of the calculation result by recalculating the calculation task corresponding to the generated part of the calculation result.

It should be noted here that the above-mentioned broadcast module 52, acquisition module 54, first determination module 56, second determination module 58, extraction module 510, and verification module 512 can be run in a computer terminal as a part of the device, and can be run through the computer terminal. The processor in the computer performs the functions realized by the above modules, and the computer terminal can also be a smart phone (such as an Android phone, an IOS phone, etc.), a tablet computer, a palmtop computer, and terminal devices such as MID and PAD.

Optionally, in the foregoing embodiment of the present application, the verification module includes: an acquisition unit configured to acquire input data received by an application program for processing the target computing task, and reference data randomly generated by the verification node, wherein the target computing The task is a calculation task that produces a partial calculation result: the calculation unit is set to use the application program to calculate the input data and reference data to obtain the verification result; the comparison unit is set to compare the verification result with the corresponding calculation on the first calculation node The calculation results generated by the task are compared to complete the verification.

It should be noted here that the above-mentioned acquisition unit, calculation unit, and comparison unit 2 can be run in a computer terminal as a part of the device, and the functions implemented by the above-mentioned modules can be executed by the processor in the computer terminal, and the computer terminal can also be Smart phones (such as Android phones, IOS phones, etc.), tablet computers, handheld computers, and terminal devices such as MID and PAD.

Optionally, in the foregoing embodiment of the present application, the device further includes: a third determining module configured to determine that the updated block is a new block when each computing node on the blockchain passes the verification.

It should be noted here that the above-mentioned third determining module can be run in a computer terminal as a part of the device, and the functions realized by the above-mentioned module can be executed by the processor in the computer terminal. The computer terminal can also be a smart phone (such as an Android phone). , IOS mobile phones, etc.), tablet computers, handheld computers, and MID, PAD and other terminal devices.

Example 5

According to an embodiment of the present application, a storage medium is provided, and the storage medium includes a stored program, wherein the device where the storage medium is located is controlled to execute the processing method of the calculation task in the foregoing Embodiments 1 and 2 when the program is running.

Optionally, in this embodiment, the foregoing storage medium may be located in any computer terminal in a computer terminal group in a computer network, or located in any mobile terminal in a mobile terminal group.

Optionally, in this embodiment, the storage medium is configured to store program code for executing the following steps: the first computing node on the blockchain receives the computing task set, and when the computing task set is completed, the first computing node A computing node broadcasts a set of calculation results to a verification node in the blockchain, where the verification node is any computing node or part of the computing node on the blockchain; and a part of the calculation result that has been broadcast on the first computing node is randomly selected; By recalculating the calculation task corresponding to the partial calculation result, the randomly selected partial calculation result is verified; if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast, it is determined that the calculation result issued by the first calculation node is passed verification.

Optionally, in this embodiment, the storage medium is configured to store program code for executing the following steps: the first computing node on the blockchain receives the computing task set, and the computing tasks in the computing task set are completed In this case, the first computing node broadcasts the set of calculation results to the verification node in the blockchain, where the verification node is any computing node or part of the computing node on the blockchain; obtaining historical information on the blockchain, where , The historical information includes at least: the credit rating of the program publishing object that publishes the application, the credit rating of the task publishing object that publishes the computing task, the application is on any computing node and is used to process the computing task; based on the credit of the program publishing object The level and/or the credit level of the task release object to determine the review level; based on the review level, determine the verification mode, where the verification mode is used to verify the calculation results published by the computing node; randomly select part of the calculation results that have been broadcast on the first computing node ; By recalculating the calculation tasks corresponding to the partial calculation results, the randomly selected partial calculation results are verified.

Optionally, in this embodiment, the storage medium may also be configured to store the program codes of various preferred or optional method steps provided by the processing method of the computing task.

Example 6

According to an embodiment of the present application, a processor is provided, and the processor is configured to run a program, wherein the processing method of the calculation task in the foregoing embodiments 1 and 2 is executed when the program is running.

Optionally, in this embodiment, the above-mentioned processor may be located in any computer terminal in a computer terminal group in a computer network, or located in any mobile terminal in a mobile terminal group.

Optionally, in this embodiment, the processor is configured to perform the following steps: the first computing node on the blockchain receives the computing task set, and when the computing task set is completed, the first computing node will calculate the result Collectively broadcast to verification nodes in the blockchain, where the verification node is any computing node or part of the computing node on the blockchain; randomly select part of the calculation results that have been broadcast on the first computing node; generate partial calculation results by pairing The corresponding calculation task is recalculated, and the randomly selected partial calculation results are verified; if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast, it is determined that the calculation result issued by the first calculation node is verified.

Optionally, in this embodiment, the processor is configured to perform the following steps: when the first computing node on the blockchain receives the computing task set, and the computing tasks in the computing task set are completed, the first computing The node broadcasts the set of calculation results to the verification node in the blockchain, where the verification node is any computing node or part of the computing node on the blockchain; acquiring historical information on the blockchain, where the historical information includes at least: The credit rating of the program publishing object that publishes the application, the credit rating of the task publishing object that publishes the computing task, the application is on any computing node and is used to process computing tasks; based on the credit rating and/or task publishing of the program publishing object The credit rating of the object determines the review level; based on the review level, the verification mode is determined, where the verification mode is used to verify the calculation results published by the computing node; randomly select part of the calculation results that have been broadcast on the first computing node; The calculation task corresponding to the result is recalculated, and the randomly selected part of the calculation result is verified.

Optionally, in this embodiment, the processor may also be configured to perform various preferred or optional method steps provided by the processing method of the computing task.

The functional units provided in the embodiments of the present application may run in a mobile terminal, a computer terminal or a similar computing device, or may be stored as a part of a storage medium.

Thus, the embodiments of the present invention can provide a computer terminal, and the computer terminal can be any computer terminal device in a computer terminal group. Optionally, in this embodiment, the above-mentioned computer terminal may also be replaced with a terminal device such as a mobile terminal.

Optionally, in this embodiment, the above-mentioned computer terminal may be located in at least one network device among a plurality of network devices in the computer network.

In this embodiment, the above-mentioned computer terminal can execute the program code of the following steps in the computing task processing method: the first computing node on the blockchain receives the computing task set, and when the computing task set is completed, the first computing The node broadcasts the set of calculation results to the verification node in the blockchain, where the verification node is any calculation node or part of the calculation node on the blockchain; randomly selects part of the calculation results that have been broadcast on the first calculation node; The calculation task corresponding to the partial calculation result is recalculated, and the randomly selected partial calculation result is verified; if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast, it is determined that the calculation result issued by the first calculation node is verified.

In this embodiment, the above-mentioned computer terminal may also execute the program code of the following steps in the method for processing computing tasks: the first computing node on the blockchain receives the computing task set, and the computing tasks in the computing task set are completed Next, the first computing node broadcasts the set of calculation results to the verification node in the blockchain, where the verification node is any computing node or part of the computing node on the blockchain; obtaining historical information on the blockchain, where, The historical information includes at least: the credit rating of the program publishing object that publishes the application, the credit rating of the task publishing object that publishes the computing task, the application is on any computing node and is used to process the computing task; based on the credit rating of the program publishing object And/or the credit level of the task release object, determine the review level; determine the verification mode based on the review level, where the verification mode is used to verify the calculation results published by the computing node; randomly select part of the calculation results that have been broadcast on the first computing node; By recalculating the calculation tasks corresponding to the partial calculation results, the randomly selected partial calculation results are verified.

Optionally, the computer terminal may include: one or more processors, memories, and transmission devices.

The memory can be used to store software programs and modules, such as the program instructions/modules corresponding to the computing task processing method and device in the embodiment of the present invention. The processor executes various programs and modules by running the software programs and modules stored in the memory. Functional application and data processing, that is, the processing method for realizing the above-mentioned computing tasks. The memory may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory may further include a memory remotely provided with respect to the processor, and these remote memories may be connected to the terminal through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

The aforementioned transmission device is used to receive or send data via a network. The above-mentioned specific examples of the network may include a wired network and a wireless network. In one example, the transmission device includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices and routers through a network cable so as to communicate with the Internet or a local area network. In one example, the transmission device is a radio frequency (RF) module, which is used to communicate with the Internet in a wireless manner.

Among them, specifically, the memory is used to store a set of calculation tasks, a set of calculation results, reference data and historical information, and application programs.

The processor may call the information and application programs stored in the memory through the transmission device to execute the program code of the method steps of each optional or preferred embodiment in the foregoing method embodiments.

Those of ordinary skill in the art can understand that the computer terminal may also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, and terminal devices such as MID and PAD.

The sequence numbers of the above-mentioned embodiments of the present invention are only for description, and do not represent the advantages and disadvantages of the embodiments.

In the above-mentioned embodiments of the present application, the description of each embodiment has its own focus. For a part that is not described in detail in an embodiment, reference may be made to related descriptions of other embodiments.

In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. The device embodiments described above are only illustrative. For example, the division of the units may be a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or may be Integrate into another system, or some features can be ignored or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, units or modules, and may be in electrical or other forms.

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, they may be located in one place, or they may be distributed on multiple units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.

In addition, the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or software functional unit.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the technical solution of the present application essentially or the part that contributes to the existing technology or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , Including several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage media include: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program code .

The above are only the preferred embodiments of this application. It should be pointed out that for those of ordinary skill in the art, without departing from the principle of this application, several improvements and modifications can be made, and these improvements and modifications are also Should be regarded as the scope of protection of this application.

Industrial applicability

The solutions provided in the embodiments of this application can be applied to blockchain technology. Based on the solution provided by the embodiments of the present application, since each node only extracts part of the calculation results for verification, the verification speed is relatively fast. Moreover, each verification node adopts a method of randomly verifying part of the calculation results. The first calculation node participating in the calculation task cannot predict which calculation results will be verified, so it is impossible to generate only these possible verification calculation results and forge other calculation results. , The difficulty of cheating by computing nodes is increased, and a large number of computing tasks in the blockchain in the prior art are solved. In the processing of computing tasks, there is a technical problem that the calculation results cannot be quickly verified.

Claims

A method for processing calculation tasks, including:

The first computing node on the blockchain receives the set of computing tasks, and when the set of computing tasks is completed, the first computing node broadcasts the set of calculation results to the verification node in the blockchain, where: The verification node is any computing node or part of the computing node on the blockchain;

Randomly extract part of the calculation results that have been broadcast on the first computing node;

Verifying the randomly selected partial calculation result by recalculating the calculation task corresponding to the partial calculation result;

If the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast, it is determined that the calculation result issued by the first computing node passes the verification.
The method according to claim 1, wherein the verification of the randomly selected partial calculation result by recalculating the calculation task corresponding to the partial calculation result generation includes:

Acquiring input data received by an application program for processing a target computing task, and reference data randomly generated by the verification node, wherein the target computing task is a computing task that generates the partial calculation result;

The verification node uses the application program to calculate the input data and the reference data to obtain the verification result;

The verification result is compared with the calculation result generated by the corresponding calculation task on the first computing node to complete the verification.
The method according to claim 2, wherein the reference data is generated based on a random number generation function, and the reference data is used to characterize the correspondence between the verified calculation result and the corresponding calculation task on the first calculation node .
The method according to claim 1, wherein when the number of verification nodes on the blockchain exceeds a preset threshold, the verification results of a predetermined number of calculation nodes are randomly selected as a subset to form the block The overall verification result of the chain.
The method according to claim 4, wherein the predetermined number is used to determine the number of verification nodes, wherein the number of verification nodes is determined based on the problem complexity m and the length of each verification n.
The method according to any one of claims 1 to 5, wherein, in the process of verifying the set of computing tasks on the blockchain, the method further comprises:

Acquiring an application program used to process the computing task on any one of the computing nodes;

Acquiring historical information on the blockchain, where the historical information includes at least: the credit rating of the program publishing object that publishes the application, and the credit rating of the task publishing object that publishes the computing task;

Determine the review level based on the credit level of the program release object and/or the credit level of the task release object;

Based on the review level, a verification mode is determined, where the verification mode is used to verify the calculation result issued by the computing node.
7. The method according to claim 6, wherein the credit rating of the program publishing object is determined based on the historical information of publishing the application program, and the credit rating of the task publishing object is determined based on the historical pass rate of the publishing calculation task.
8. The method according to claim 7, wherein the credit rating of the program publishing object is updated based on changes in the number of publishing applications, the program pass rate, and the number of uses in the history of publishing applications; and/or the credit of the task publishing object The level is updated based on the changes in the number of issued calculation tasks, the number of tasks passed, the number of task completions, and the task completion rate in the history.
The method according to claim 6, wherein a verification mode is determined based on the review level, wherein the verification mode includes at least one of the following:

No fragment verification and no data set verification;

No fragment verification and data set verification;

Reduce the multiple of fragment verification and perform fragment verification, and perform data set verification.
The method according to claim 6, wherein the security of the platform that publishes the application is verified by any one of the following methods: detecting the open source code of the application, using security verification software to verify the application, and using security The test program verifies the application.
The method according to claim 1, wherein the calculation task comprises: program information of an application program used to process the calculation task, data information of input data corresponding to the calculation task, and the calculation task required to complete the calculation task. Virtual resources obtained.
The method according to claim 11, wherein when the first computing node receives the set of computing tasks, it receives the computing workload of the computing tasks and verifies the verification work of the set of computing results according to a preset algorithm. The calculation workload is determined based on the data amount of the input data and the complexity of the algorithm used by the application program, and the verification workload is determined based on the preset total workload and the calculation workload.
The method according to claim 1, wherein the partial calculation results that have been broadcast on the first computing node are randomly selected multiple times, and the partial calculation results randomly selected each time are verified, if the verification obtained by recalculating multiple times If the results are consistent with the calculation results that have been broadcast, then the calculation results published by the first computing node pass the verification.
The method according to claim 1, wherein, in the case that each computing node on the blockchain passes the verification, it is determined that the updated block is a new block.
A processing device for computing tasks includes:

The broadcast module is configured to receive a set of calculation tasks through the first computing node on the blockchain, and when the set of calculation tasks is completed, broadcast the set of calculation results to the blockchain through the first computing node The verification node in, wherein the verification node is any computing node or part of the computing node on the blockchain;

An extraction module, configured to randomly extract part of the calculation results that have been broadcast on the first computing node;

A verification module, configured to recalculate the calculation task corresponding to the partial calculation result to be used to verify the randomly selected partial calculation result;

The first determining module is configured to determine that the calculation result issued by the first computing node passes the verification if the verification result obtained by the recalculation is consistent with the calculation result that has been broadcast.
The apparatus according to claim 15, wherein the verification module comprises:

The obtaining unit is configured to obtain input data received by an application program for processing a target calculation task and reference data randomly generated by the verification node, wherein the target calculation task is a calculation that generates the partial calculation result task;

A calculation unit configured to use the application program to calculate the input data and the reference data to obtain the verification result;

The comparison unit is configured to compare the verification result with the calculation result generated by the corresponding calculation task on the first computing node to complete the verification.
The device according to claim 16, wherein the extraction module is further configured to generate the reference data based on a random number generation function, and the reference data is used to characterize the verification calculation result corresponding to the first calculation node Calculate the correspondence between tasks.
The device according to claim 15, wherein the extraction module is further configured to randomly extract the verification results of a predetermined number of computing nodes as the verification result of a predetermined number of computing nodes in the case that the number of verification nodes on the blockchain exceeds a preset threshold The subset constitutes the overall verification result of the blockchain.
The apparatus according to claim 18, wherein the predetermined number is used to determine the number of verification nodes, wherein the number of verification nodes is determined based on the complexity of the problem m and the length of each verification n.
The device according to any one of claims 15 to 19, wherein the device further comprises:

The first obtaining module is configured to obtain an application program used to process the computing task on any one of the computing nodes in the process of verifying the set of computing tasks on the blockchain;

The second acquisition module is configured to acquire historical information on the blockchain, where the historical information includes at least: the credit rating of the program publishing object that publishes the application, and the task publishing object that publishes the computing task. Credit rating

The second determining module is configured to determine the review level based on the credit level of the program release object and/or the credit level of the task release object;

The third determining module is configured to determine a verification mode based on the review level, wherein the verification mode is used to verify the calculation result issued by the computing node.
The device according to claim 20, wherein the second determining module is further configured to determine the credit rating of the program publishing object based on the historical information of publishing the application program, and determine the credit rating of the program publishing object based on the historical pass rate of the publishing calculation task. The credit rating of the task posting object.
21. The device according to claim 21, wherein the credit rating of the program release object is updated based on changes in the number of releases, the program pass rate, and the number of uses of the released application in the history; the credit rating of the task release object is based on the history It is updated with the changes in the number of times the task is issued, the number of tasks passed, the number of task completions, and the task completion rate.
The apparatus according to claim 20, wherein the verification mode comprises at least one of the following: no fragment verification, and, no data set verification; no fragment verification, and, data set verification; reduced fragment verification Multiple and perform fragment verification, and, perform data set verification.
The device according to claim 20, wherein the verification module is further configured to verify the security of the platform that publishes the application program by any one of the following methods: detecting the open source code of the application program, and verifying by using security verification software The application program uses a security test program to verify the application program.
The device according to claim 15, wherein the computing task comprises: program information of an application program used to process the computing task, data information of input data corresponding to the computing task, and the calculation task required to complete the computing task. Virtual resources obtained.
The device according to claim 25, wherein the device further comprises:

The receiving module is configured to receive the calculation workload of the calculation task and the verification workload of verifying the calculation result set according to a preset algorithm at the same time when the first computing node receives the set of calculation tasks, wherein the The calculation workload is determined based on the data amount of the input data and the complexity of the algorithm used by the application program, and the verification workload is determined based on a preset total workload and the calculation workload.
The device according to claim 15, wherein:

The extraction module is further configured to randomly extract part of the calculation results that have been broadcast on the first computing node multiple times;

The verification module is also configured to verify a part of the calculation results randomly drawn each time;

The determining module is further configured to pass the verification if the verification results obtained by multiple recalculations are consistent with the already broadcasted calculation results.
The device according to claim 15, wherein the determining module is further configured to determine that the updated block is a new block when each computing node on the blockchain passes the verification.
A storage medium, the storage medium including a stored program, wherein, when the program is running, the device where the storage medium is located is controlled to execute the computing task processing method according to any one of claims 1 to 14.
A processor configured to run a program, wherein the method for processing a computing task according to any one of claims 1 to 14 is executed when the program is running.