CN109815372B - Scrypt algorithm workload proof method and device - Google Patents

Abstract

The present disclosure relates to a Scrypt algorithm workload proof method and device, the method includes multiple workload proof tasks, the tasks include a first stage and a second stage, the method includes: in the first stage of each task, extracting part of the data from the first data as storage data for storage, the amount of storage data is less than the amount of first data; in the second stage of each task, each task is respectively corresponded to a different first time slot in the first cycle, in the first time slot corresponding to the target task, the corresponding first data is determined according to the storage data of the target task, and the second data is generated according to the corresponding first data, the target task includes any task, the first cycle includes multiple first time slots, and the number of first time slots is greater than or equal to the number of tasks. The embodiment of the present disclosure can save storage space and improve the execution efficiency of multiple tasks.

Description

Scrypt algorithm workload proof method and device

Technical Field

The present disclosure relates to the field of blockchain technology, and in particular to a Scrypt algorithm workload proof method and device.

Background Art

In the proof-of-work method of blockchain technology, the first stage of the Scrypt algorithm proof-of-work method generates a set amount of first data, and in the second stage, the first data is randomly used to generate second data. The amount of first data is large, occupying a large storage space, making the chip implementing the Scrypt algorithm proof-of-work method larger in size, which is not conducive to reducing the size of related equipment.

Summary of the invention

In view of this, the present disclosure proposes a Scrypt algorithm workload proof method and device to solve the problem that the Scrypt algorithm workload proof method occupies a large storage space and cannot reduce the size of the related chip.

According to one aspect of the present disclosure, a Scrypt algorithm workload proof method is provided, the method comprising a plurality of workload proof tasks, the tasks comprising a first stage and a second stage, the method comprising:

In the first stage of each task, part of the data is extracted from the first data and stored as storage data, and the amount of the storage data is less than the amount of the first data;

In the second stage of each task, each task is respectively corresponded to a different first time slot in the first cycle. In the first time slot corresponding to the target task, the corresponding first data is determined according to the storage data of the target task, and the second data is generated according to the corresponding first data. The target task includes any of the tasks, and the first cycle includes multiple first time slots, and the number of the first time slots is greater than or equal to the number of tasks.

In a possible implementation, in the first stage of each task, extracting part of the first data as storage data for storage includes:

In the first phase of each task, each task is mapped to a different second time slot in the second cycle.

In a second time slot corresponding to the target task, first data is generated, and part of the first data is extracted and written into a memory as storage data, wherein the second cycle includes a plurality of second time slots, and the number of the second time slots is greater than or equal to the number of the tasks.

In a possible implementation, determining corresponding first data according to the stored data of the target task, and generating second data according to the corresponding first data includes:

Searching the stored data of the target task for first data corresponding to the current second data;

When the first data corresponding to the current second data cannot be found in the stored data, determining the first data corresponding to the current second data according to the closest stored data;

The next second data of the current second data is obtained according to the first data corresponding to the current second data and the current second data.

In a possible implementation, the first data is an ordered sequence, and extracting part of the first data as storage data for storage includes:

Determining a storage address of the stored data according to a serial number of the stored data;

Searching the stored data of the target task for first data corresponding to the current second data includes:

An index address is generated according to data at a preset digit in the current second data of the target task, the index address is searched in the storage address, and the first data corresponding to the current second data is determined according to the search result.

In a possible implementation, determining, according to the closest stored data, first data corresponding to the current second data includes:

determining a difference between the closest storage address and the index address;

According to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address.

In a possible implementation, extracting part of the data from the first data as storage data for storage includes any of the following:

Extracting and storing the stored data in the first data according to a preset extraction interval;

Extracting and storing the stored data in the first data according to a preset sequence number range;

A preset number of storage data are randomly selected from the first data for storage.

In a possible implementation, the storage data of each task is stored in different storage spaces of a memory, and the number of the storage spaces is greater than or equal to the number of the tasks.

In a possible implementation, each of the tasks is executed in an execution cycle consisting of the second cycle in front and the first cycle in the back.

In a possible implementation manner, the first cycle further includes idle time slots, and the number or duration of the idle time slots is determined according to the delay of the memory.

In a possible implementation manner, the first cycle and the second cycle are performed in parallel.

In a possible implementation, the method further includes:

When at least one of the multiple tasks is completed, a first time slot corresponding to the completed task is allocated to a new task.

According to another aspect of the present disclosure, a Scrypt algorithm workload proof device is provided, the device is used to perform multiple workload proof tasks, the tasks include a first stage and a second stage, the device includes:

An extraction module, used for extracting part of the data from the first data as storage data for storage in the first stage of each task, wherein the amount of the storage data is less than the amount of the first data;

The first cycle execution module is used to correspond each task to a different first time slot in the first cycle in the second stage of each task, determine the corresponding first data according to the storage data of the target task in the first time slot corresponding to the target task, and generate second data according to the corresponding first data, the target task includes any of the tasks, the first cycle includes multiple first time slots, and the number of the first time slots is greater than or equal to the number of the tasks.

In a possible implementation, the extraction module includes:

The second cycle execution submodule is used to correspond each task to a different second time slot in the second cycle in the first stage of each task, generate first data in the second time slot corresponding to the target task, and extract part of the first data and write it into the memory as storage data. The second cycle includes multiple second time slots, and the number of the second time slots is greater than or equal to the number of tasks.

In a possible implementation, the first cycle execution module includes:

A corresponding data search submodule, used to search the stored data of the target task for first data corresponding to the current second data;

A corresponding data determination submodule, for determining the first data corresponding to the current second data according to the closest stored data when the first data corresponding to the current second data cannot be found in the stored data;

The second data acquisition submodule is used to obtain the next second data of the current second data according to the first data corresponding to the current second data and the current second data.

In a possible implementation, the first data is an ordered sequence, and the extraction module includes:

A storage address submodule, used to determine the storage address of the storage data according to the serial number of the storage data;

The corresponding data search submodule is used to:

An index address is generated according to data at a preset digit in the current second data of the target task, the index address is searched in the storage address, and the first data corresponding to the current second data is determined according to the search result.

In a possible implementation, the corresponding data determination submodule is used to:

determining a difference between the closest storage address and the index address;

According to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address.

In a possible implementation, extracting part of the data from the first data as storage data for storage includes any of the following:

Extracting and storing the stored data in the first data according to a preset extraction interval;

Extracting and storing the stored data in the first data according to a preset sequence number range;

A preset number of storage data are randomly selected from the first data for storage.

In a possible implementation, the storage data of each task is stored in different storage spaces of a memory, and the number of the storage spaces is greater than or equal to the number of the tasks.

In a possible implementation, each of the tasks is executed in an execution cycle consisting of the second cycle in front and the first cycle in the back.

In a possible implementation manner, the first cycle further includes idle time slots, and the number or duration of the idle time slots is determined according to the delay of the memory.

In a possible implementation manner, the first cycle and the second cycle are performed in parallel.

In the disclosed embodiment, in the first stage of the Scrypt algorithm workload proof, part of the data is extracted from the first data and stored as storage data, which can save storage space. Multiple tasks are respectively mapped to different first time slots in the first cycle, and second data is generated in the first time slot corresponding to each task, which can improve the execution efficiency of multiple tasks.

Further features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments with reference to the attached drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate exemplary embodiments, features, and aspects of the disclosure and, together with the description, serve to explain the principles of the disclosure.

FIG1 is a flowchart of a Scrypt algorithm workload proof method according to an embodiment of the present disclosure;

FIG2 shows a flow chart of a Scrypt algorithm workload proof method according to an embodiment of the present disclosure;

FIG3 shows a flow chart of a Scrypt algorithm workload proof method according to an embodiment of the present disclosure;

FIG4 shows a block diagram of a Scrypt algorithm workload proof device according to an embodiment of the present disclosure.

DETAILED DESCRIPTION

Various exemplary embodiments, features and aspects of the present disclosure will be described in detail below with reference to the accompanying drawings. The same reference numerals in the accompanying drawings represent elements with the same or similar functions. Although various aspects of the embodiments are shown in the accompanying drawings, the drawings are not necessarily drawn to scale unless otherwise specified.

The word “exemplary” is used exclusively herein to mean “serving as an example, example, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.

In addition, in order to better illustrate the present disclosure, numerous specific details are given in the following specific embodiments. It should be understood by those skilled in the art that the present disclosure can also be implemented without certain specific details. In some examples, methods, means, components and circuits well known to those skilled in the art are not described in detail in order to highlight the subject matter of the present disclosure.

FIG. 1 shows a flow chart of a Scrypt algorithm workload proof method according to an embodiment of the present disclosure. As shown in FIG. 1 , the method includes:

Step S10, the first stage of each task, extracts part of the data from the first data as storage data for storage, and the amount of the storage data is less than the amount of the first data.

In one possible implementation, proof of work is an important mechanism for achieving system consistency. Proof of work requires participants to pay a certain amount of computing resources to prove that they have completed a certain amount of work. In the Scrypt algorithm, proof of work includes a first stage and a second stage. In the first stage, the random number can be operated using a HASH function to obtain multiple first data. There is a cascade relationship between the first data, and a sequence can be formed. For example, in the first stage, the first first data can be obtained by operating the random number 1 using a HASH function. The first first data can be operated using a HASH function to obtain the second first data. A preset number of first data can be obtained after multiple operations using the HASH function. Each first data can be stored. In order to save storage space, this embodiment can extract part of the data from the first data as storage data for storage, which can save storage space.

In a possible implementation, the amount of stored data is less than the amount of first data, because the second data needs to use the first data randomly. When the first data required for calculating the second data is not stored, it needs to be calculated based on the stored data, thereby consuming certain computing resources and reducing computing efficiency. The amount of stored data can be determined based on the two requirements of saving storage space and ensuring computing efficiency.

In a possible implementation, extracting part of the data from the first data as storage data for storage includes any of the following:

Extracting and storing the stored data in the first data according to a preset extraction interval;

Extracting and storing the stored data in the first data according to a preset sequence number range;

A preset number of storage data are randomly selected from the first data for storage.

In a possible implementation, an extraction interval may be preset. For example, the preset extraction interval may be three first data. Then the first first data, the fourth first data, the eighth first data, and so on may be extracted, until the last stored data is extracted for storage. In the calculation process of the second data, the first data will be used randomly, and the storage columns extracted according to the extraction interval can extract the stored data more evenly in the first data, so that the probability of the stored data being used is equivalent.

In a possible implementation, there is a cascade relationship between each first data, and each first data can form a sequence. The sequence number between each first data can be determined according to the generation order of the first data. The storage data can be extracted from the first data according to a preset sequence number range. For example, there are 1024 first data in total, and the first data with sequence number ranges of 1-50, 100-150, 200-250... can be extracted as storage data. The storage data can be extracted according to multiple sequence number ranges, or it can be extracted according to one sequence number range. The present disclosure does not limit the number of sequence number ranges, nor does it limit the length of each sequence number range.

In a possible implementation, a preset number of storage data may be randomly selected from the first data for storage. For example, 256 storage data may be randomly selected from a total of 1024 first data, and the first, fifth, fifteenth first data, etc. may be randomly selected as storage data.

Step S20, in the second stage of each task, each task is respectively corresponded to a different first time slot in the first cycle, in the first time slot corresponding to the target task, the corresponding first data is determined according to the storage data of the target task, and the second data is generated according to the corresponding first data, the target task includes any task, the first cycle includes multiple first time slots, and the number of first time slots is greater than or equal to the number of tasks.

In a possible implementation, in the second stage, the second data can be obtained by using a HASH function to calculate based on the first data and the random number. For example, in the second stage, the first second data can be obtained by using a HASH function to calculate based on the last first data or based on the random number 2. The first second data can be calculated using a HASH function to obtain the calculation result of the first second data, the first data corresponding to the first second data can be determined, and the first data corresponding to the first second data and the calculation result of the first second data can be XORed to obtain the second second data. The second data can be calculated using a HASH function to obtain the calculation result of the second second data, a first data corresponding to the second second data can be determined, and the first data corresponding to the second second data and the calculation result of the second second data can be XORed to obtain the third second data. And so on, until a preset number of second data is obtained.

In a possible implementation, the first data corresponding to the current second data can be obtained according to the data on the set digits in the current second data and the preset data conversion rule. The data conversion rule can be determined according to the demand, and the present disclosure does not limit this. Since there is a cascade relationship between the first data, the first data corresponding to any second data can be obtained by calculation according to any first data. The first data corresponding to each second data can be obtained according to the stored data.

In a possible implementation, the second data have a cascade relationship. Using the method in the embodiment of the present disclosure, the last second data is calculated, and the calculated last second data is output to other operation steps of the proof-of-work part in the Scrypt algorithm to complete the proof-of-work in the Scrypt algorithm. It can be understood by those skilled in the art that the specific second data is output to other steps in the Scrypt algorithm to complete the relevant description of the proof-of-work of the Scrypt algorithm can refer to the prior art.

In one possible implementation, in the second stage of each task, in the process of determining the first data corresponding to the current second data, there is a situation where the corresponding first data is not the stored data, and it is necessary to obtain the first data corresponding to the current second data after calculation based on the stored data, and then obtain the next second data based on the first data corresponding to the current second data obtained by calculation. In each task, the hit rate of the first data corresponding to the current second data in the stored data is different, the number of iterations of obtaining the corresponding first data based on the stored data calculation is different, and the calculation time is also different, resulting in different durations required for the second stage of each task. In the traditional proof-of-work method, when multiple proof-of-work tasks are executed simultaneously, it is necessary to wait for the current second data of all tasks to be generated before the next second data generation process can be carried out, and the execution efficiency of each task is low.

In a possible implementation, in the second phase of each task, each task can be respectively corresponded to a different first time slot in the first cycle, and the first cycle includes multiple first time slots, and the number of first time slots is greater than or equal to the number of tasks. For example, the first cycle is T1, and T1 includes 10 first time slots, which can correspond to 10 different tasks respectively. The first first time slot corresponds to task 1, the second first time slot corresponds to task 2, and the third first time slot corresponds to task 3.... Within the duration corresponding to the first first time slot, the second phase of task 1 is executed, and within the duration corresponding to the second first time slot, the second phase of task 2 is executed, and so on, until the first cycle is completed and the next first cycle is executed.

In a possible implementation, when at least one of the multiple tasks is completed, the first time slot corresponding to the completed task can be allocated to a new task. For example, among 10 tasks, task 3 is completed. The third first time slot corresponding to task 3 can be allocated to a new task 11, thereby improving the efficiency of multi-task execution.

In this embodiment, in the first stage of the Scrypt algorithm workload proof, part of the data is extracted from the first data and stored as storage data, which can save storage space. Multiple tasks are respectively mapped to different first time slots in the first cycle, and second data is generated in the first time slot corresponding to each task, which can improve the execution efficiency of multiple tasks.

FIG2 shows a flow chart of a Scrypt algorithm workload proof method according to an embodiment of the present disclosure. As shown in FIG2 , the method includes: step S11 and step S20, wherein step S20 may refer to the relevant description in FIG1 above, and step S11 includes:

Step S11, in the first stage of each task, each task is respectively corresponded to a different second time slot in the second cycle, and in the second time slot corresponding to the target task, the first data is generated, and part of the data is extracted from the first data and written into the memory as storage data. The second cycle includes multiple second time slots, and the number of second time slots is greater than or equal to the number of tasks.

In a possible implementation, each task can be respectively mapped to a different second time slot in the second cycle, and in the second time slot corresponding to the target task, the first stage of the target task is executed to generate first data, and part of the data in the first data is extracted and written into the memory as storage data. Since the execution time of the second stage of each task is different, after each task is respectively mapped to the first cycle, when one of the tasks is completed, the first time slot corresponding to it can be released, and the released first time slot can be used for a new task. Accordingly, the second time slot corresponding to the second cycle corresponding to the completed task can also be released, and the released second time slot can also be allocated to the new task to improve the execution efficiency of multiple tasks.

In a possible implementation, the sequence number of the first time slot corresponding to each task in the first cycle may be the same as or different from the sequence number of the second time slot corresponding to each task in the second cycle.

In this embodiment, in the first stage of each task, each task is respectively mapped to a different second time slot in the second cycle, and in the second time slot corresponding to the target task, first data is generated, and part of the first data is extracted and written into the memory as storage data. The first stage of each task is also completed in the corresponding first time slot, which can further improve the execution efficiency of multiple tasks.

FIG3 shows a flow chart of a Scrypt algorithm workload proof method according to an embodiment of the present disclosure. As shown in FIG3 , the method includes: step S10, step S21, step S22, and step S23, wherein step S10 may refer to the relevant description in FIG1 above, and step S21, step S22, and step S23 include:

Step S21, searching the storage data of the target task for the first data corresponding to the current second data.

In a possible implementation, the stored data is part of the first data. The first data corresponding to the current second data may be the stored data or may not be the stored data. When the first data corresponding to the current second data is the stored data, it can be extracted from the stored data and used for calculating the current second data.

Step S22: when the first data corresponding to the current second data cannot be found in the stored data, the first data corresponding to the current second data is determined according to the closest stored data.

In a possible implementation, when the first data corresponding to the current second data cannot be found in the stored data, the first data corresponding to the current second data can be determined after calculation using the HASH function based on the closest stored data. For example, the sequence number of the first data corresponding to the current second data is 14, and the sequence numbers of the first data in the stored data are 1, 6, 11, 16, etc. The first data corresponding to the current second data with a sequence number of 14 can be obtained by performing a cascade calculation using the HASH function based on the 16th first data closest to the sequence number 14.

In a possible implementation, the closest stored data with a sequence number smaller than the sequence number of the first data corresponding to the current second data may be determined as the closest stored data. For example, among the sequence numbers smaller than 14, the first data with the closest sequence number of 11 may be cascaded using a HASH function to obtain the first data with a sequence number of 14 corresponding to the current second data.

Step S23, obtaining the next second data of the current second data according to the first data corresponding to the current second data and the current second data.

In a possible implementation, the current second data may be operated using a HASH function to obtain an operation result, and the first data corresponding to the current second data and the operation result may be XORed to obtain the next second data of the current second data.

In this embodiment, when the first data corresponding to the current second data cannot be found in each stored data, the first data corresponding to the current second data is determined based on the closest stored data, and the next second data of the current second data is obtained based on the first data corresponding to the current second data and the current second data. The second data can be calculated based on the stored data, reducing the storage space required for the first data.

In a possible implementation, the first data is an ordered sequence, and step S10 in the method includes:

The storage address of the stored data is determined according to the serial number of the stored data.

In a possible implementation, the sequence number of the stored data can be determined according to the sequence number of the first data. For example, when the first data with sequence numbers 1, 10, 15, and 20 are used as the stored data, the sequence numbers of the stored data are also 1, 10, 15, and 20. The sequence number of the stored data can be used as the storage address of the stored data. That is, the storage addresses of each stored data are 1, 10, 15, and 20.

Step S21 includes: generating an index address according to data at a preset digit in the current second data of the target task, searching for the index address in the storage address, and determining the first data corresponding to the current second data according to the search result.

In a possible implementation, the index address of the current second data can be generated by taking 2 as the base and the data at the preset digits in the current second data as the index. For example, the number of first data is 1024. 1024 results can be obtained by taking 2 as the base and the data at the last 10 digits in the second data as the index, which can correspond to 1024 first data. The number and position of the preset digits can be determined according to requirements.

In one possible implementation, the index address may be searched in the storage address. If the index address is found in the storage address, the storage data at the same storage address as the index address may be determined as the first data corresponding to the current second data. If the index address is not found in the storage address, the storage data at the storage address closest to the index address may be searched in the storage addresses less than the index address, and the first data corresponding to the current second data may be obtained through cascade calculation. For example, if the index address is 14 and the storage addresses are 1, 5, 10, and 15, the first data at the storage address 14 may be obtained through cascade calculation based on the storage data at the storage address 10.

In this embodiment, the storage address of the stored data is determined according to the serial number of the stored data, the index address is generated according to the data at the preset digit in the current second data, the index address is searched in the storage address, and the first data corresponding to the current second data is determined according to the search result. Through the storage address and the index address, the search process of the first data corresponding to the current second data can be made simple and reliable.

In a possible implementation, determining first data corresponding to current second data according to the closest stored data includes:

The difference between the closest storage address and the index address is determined.

According to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address.

In a possible implementation, the storage address closest to the index address can be determined among the storage addresses smaller than the index address. The difference between the closest storage address and the index address can be calculated. For example, the index address is 14, and the storage addresses of the storage data are 1, 5, 10, 15, 20, ... The storage address 10 can be determined as the closest storage address, and the difference is determined to be 14-10=4.

In a possible implementation, since the first data have a cascade relationship, the storage data in the closest storage address can be iteratively calculated according to the difference to obtain the first data corresponding to the index address. For example, if the difference is 4, the storage data in the closest storage address can be iteratively calculated four times using the HASH function to obtain the first data corresponding to the index address.

In this implementation, the difference between the closest storage address and the index address can be determined; according to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address. By determining the number of iterations according to the difference, the first data corresponding to the current second data can be conveniently calculated according to the storage data.

In a possible implementation, the method further includes:

The storage data of each task is stored in different storage spaces of the memory, and the number of storage spaces is greater than or equal to the number of tasks.

In a possible implementation, the memory may be divided into different storage spaces. The number of storage spaces may be determined according to the number of tasks. For example, corresponding to 10 tasks, the memory may be divided into 10 storage spaces, each storage space corresponding to one task. Each task may store storage data in a corresponding storage space, and extract the storage data in the corresponding storage space to calculate and obtain the second data.

In this embodiment, by dividing the memory into different storage spaces, each task reads and writes data in the corresponding storage space, which can improve the data reading and writing efficiency and improve the execution efficiency of multiple tasks.

In a possible implementation, each task is executed in an execution cycle consisting of a first cycle in front and a second cycle in the back.

In a possible implementation, a chip for executing the Scrypt algorithm workload proof method of the embodiment of the present disclosure may be read-only or write-only at the same time. When the method of the embodiment of the present disclosure is applied to a chip that is read-only or write-only at the same time, each task may be executed in an execution cycle consisting of the second cycle in front and the first cycle in the back.

For example, the second cycle duration is T2, the first cycle duration is T1, and T3=T1+T2 is the duration of the execution cycle. In the execution cycle, the second cycle T2 is executed first and then the first cycle T1 is executed. Each task is executed in sequence in the execution cycle T3. During the duration T2 in T3, the first stage of each task is executed. During the duration T1 in T3, the second stage of each task is executed.

In this embodiment, each task is executed in an execution cycle consisting of the second cycle in front and the first cycle in the back, which can meet the use environment of the chip that is only read or only write at the same time, and improve the applicability of the embodiment of the present disclosure.

In a possible implementation, the first cycle further includes idle time slots, and the number or duration of the idle time slots is determined according to a delay of the memory.

In a possible implementation, since the second phase of each task takes longer than the first phase, the first cycle may further include an idle time slot. The duration of the first cycle including the idle time slot may be longer than the duration of the second cycle. The number or duration of the idle time slot may be determined according to the delay characteristics of the memory. The idle time slot may be used to correspond to the duration required for the computational overhead of each task, so that the first time slot in the first cycle can be aligned with each task.

In this embodiment, the first cycle may further include idle time slots. The idle time slots are used to correspond to the duration required for the computational overhead of each task, and each first time slot in the first cycle is aligned with each task to improve the execution efficiency of each task.

In a possible implementation, the first cycle and the second cycle are performed in parallel.

In a possible implementation, a chip for executing the Scrypt algorithm workload proof method of the embodiment of the present disclosure can read and write at the same time. When the method in the embodiment of the present disclosure is applied to a chip that can read and write at the same time, the first cycle can be parallel to the second cycle.

In this embodiment, the first cycle and the second cycle are carried out in parallel to meet the use environment of the chip that can read and write at the same time, thereby improving the applicability of the embodiment of the present disclosure.

FIG4 shows a block diagram of a Scrypt algorithm workload proof device according to an embodiment of the present disclosure. As shown in FIG4 , the device is used to perform multiple workload proof tasks, the tasks include a first stage and a second stage, and the device includes:

An extraction module 10 is used to extract part of the data from the first data and store it as storage data in the first stage of each task, and the amount of the storage data is less than the amount of the first data;

The first cycle execution module 20 is used to correspond each task to a different first time slot in the first cycle in the second stage of each task, determine the corresponding first data according to the storage data of the target task in the first time slot corresponding to the target task, and generate second data according to the corresponding first data. The target task includes any task, and the first cycle includes multiple first time slots, and the number of first time slots is greater than or equal to the number of tasks.

In a possible implementation, the extraction module 10 includes:

The second cycle execution submodule is used to correspond each task to a different second time slot in the second cycle in the first stage of each task, generate first data in the second time slot corresponding to the target task, and extract part of the first data and write it into the memory as storage data. The second cycle includes multiple second time slots, and the number of second time slots is greater than or equal to the number of tasks.

In a possible implementation, the first cycle execution module 20 includes:

A corresponding data search submodule, used to search the stored data of the target task for the first data corresponding to the current second data;

A corresponding data determination submodule, for determining the first data corresponding to the current second data according to the closest stored data when the first data corresponding to the current second data cannot be found in the stored data;

The second data acquisition submodule is used to obtain the next second data of the current second data according to the first data corresponding to the current second data and the current second data.

In a possible implementation, the first data is an ordered sequence, and the extraction module 10 includes:

A storage address submodule, used to determine the storage address of the stored data according to the serial number of the stored data;

The corresponding data search submodule is used for:

An index address is generated according to data at a preset digit in the current second data of the target task, the index address is searched in the storage address, and the first data corresponding to the current second data is determined according to the search result.

In a possible implementation, the corresponding data determination submodule is used to:

determining the difference between the closest storage address and the index address;

According to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address.

In a possible implementation, extracting part of the data from the first data as storage data for storage includes any of the following:

Extracting and storing the stored data in the first data according to a preset extraction interval;

Extracting and storing the stored data in the first data according to a preset sequence number range;

A preset number of storage data are randomly selected from the first data for storage.

In a possible implementation, the storage data of each task is stored in different storage spaces of the memory, and the number of the storage spaces is greater than or equal to the number of tasks.

In a possible implementation, each task is executed in an execution cycle consisting of a second cycle in front and a first cycle in the back.

In a possible implementation, the first cycle further includes idle time slots, and the number or duration of the idle time slots is determined according to a delay of the memory.

In a possible implementation, the first cycle and the second cycle are performed in parallel.

In a possible implementation, the device further includes: an allocation module, configured to allocate a first time slot corresponding to the completed task to a new task when at least one of the multiple tasks is completed.

The embodiments of the present disclosure have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The selection of terms used herein is intended to best explain the principles of the embodiments, practical applications, or technical improvements to the technology in the market, or to enable other persons of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (16)

1. A Scrypt algorithm workload proof method, characterized in that the method includes multiple workload proof tasks, the tasks include a first stage and a second stage, and the method includes: In the first stage of each task, some data are randomly selected from the first data and stored as storage data, and the storage address of the storage data is determined according to the sequence number of the first data in the ordered sequence, and the amount of the storage data is less than the amount of the first data; in the first stage of each task, each task is respectively corresponded to a different second time slot in the second cycle; In the second stage of each task, each task is respectively corresponded to a different first time slot in the first cycle; in the first time slot corresponding to the target task, an index address is generated according to the data on the preset digit in the current second data of the target task, the index address is searched in the storage address, and the first data corresponding to the current second data is determined according to the search result; when the first data corresponding to the current second data cannot be found in the storage data, the first data corresponding to the current second data is determined by cascading calculation using a HASH function according to the closest storage data whose serial number is less than the serial number of the first data corresponding to the current second data; the next second data of the current second data is obtained according to the first data corresponding to the current second data and the current second data; the target task includes any of the tasks, the first cycle includes multiple first time slots, the number of the first time slots is greater than or equal to the number of the tasks, and the first cycle and the second cycle are parallel. 2. The method according to claim 1, characterized in that, in the first stage of each task, extracting part of the first data as storage data for storage, comprises: In a second time slot corresponding to the target task, first data is generated, and part of the first data is extracted and written into a memory as storage data, wherein the second cycle includes a plurality of second time slots, and the number of the second time slots is greater than or equal to the number of the tasks. 3. The method according to claim 1, wherein determining the first data corresponding to the current second data according to the closest stored data comprises: determining a difference between the closest storage address and the index address; According to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address. 4. The method according to claim 1, characterized in that extracting part of the data from the first data as storage data for storage comprises any one of the following: Extracting and storing the stored data in the first data according to a preset extraction interval; Extracting and storing the stored data in the first data according to a preset sequence number range; A preset number of storage data are randomly selected from the first data for storage. 5 . The method according to claim 2 , wherein the storage data of each task is stored in different storage spaces of the memory, and the number of the storage spaces is greater than or equal to the number of the tasks. 6 . The method according to claim 2 , wherein each of the tasks is executed in an execution cycle consisting of the second cycle in front and the first cycle in the back. 7. The method according to claim 1 is characterized in that the first cycle also includes idle time slots, and the number or duration of the idle time slots is determined according to the delay of the memory. 8. The method according to claim 1, characterized in that the method further comprises: When at least one of the multiple tasks is completed, a first time slot corresponding to the completed task is allocated to a new task. 9. A Scrypt algorithm workload proof device, characterized in that the device is used to perform multiple workload proof tasks, the tasks include a first stage and a second stage, and the device includes: an extraction module, configured to randomly extract part of the first data as storage data for storage in the first stage of each task, and determine the storage address of the storage data according to the sequence number of the first data in the ordered sequence, wherein the amount of the storage data is less than the amount of the first data; A first cycle execution module is used to correspond each task to a different first time slot in the first cycle in the second stage of each task, generate an index address in the first time slot corresponding to the target task according to the data on the preset digit in the current second data of the target task, search the index address in the storage address, and determine the first data corresponding to the current second data according to the search result; when the first data corresponding to the current second data cannot be found in the storage data, perform cascade calculation using a HASH function according to the closest storage data whose sequence number is less than the sequence number of the first data corresponding to the current second data, and determine the first data corresponding to the current second data; obtain the next second data of the current second data according to the first data corresponding to the current second data and the current second data; the target task includes any of the tasks, and the first cycle includes a plurality of first time slots, and the number of the first time slots is greater than or equal to the number of the tasks; The second cycle execution submodule is used to correspond each task to a different second time slot in a second cycle in the first stage of each task, and the first cycle and the second cycle are parallel. 10. The device according to claim 9, characterized in that the extraction module comprises: The second cycle execution submodule is used to generate first data in a second time slot corresponding to the target task, and extract part of the first data as storage data and write it into the memory, the second cycle includes multiple second time slots, and the number of the second time slots is greater than or equal to the number of tasks. 11. The device according to claim 9, characterized in that the corresponding data determination submodule is used to: determining a difference between the closest storage address and the index address; According to the number of iterations determined by the difference, the storage data in the closest storage address is iteratively calculated to obtain the first data corresponding to the index address. 12. The device according to claim 9, wherein extracting part of the first data as storage data for storage comprises any one of the following: Extracting and storing the stored data in the first data according to a preset extraction interval; Extracting and storing the stored data in the first data according to a preset sequence number range; A preset number of storage data are randomly selected from the first data for storage. 13. The device according to claim 10, characterized in that the storage data of each task is stored in different storage spaces of the memory, and the number of the storage spaces is greater than or equal to the number of the tasks. 14. The device according to claim 10, characterized in that each of the tasks is executed in an execution cycle consisting of the second cycle in front and the first cycle in the back. 15. The device according to claim 9, characterized in that the first cycle also includes idle time slots, and the number or duration of the idle time slots is determined according to the delay of the memory. 16. The device according to claim 9, characterized in that the device further comprises: The allocation module is used to allocate the first time slot corresponding to the completed task to a new task when at least one of the multiple tasks is completed.