CN108616363A - A kind of book keeping operation power confirmation method, device and computer storage media - Google Patents

Abstract

The example of the invention discloses a method, device and computer storage medium for confirming bookkeeping rights, which can effectively save resources and improve the fairness of bookkeeping right distribution. The method includes: in the case of generating a new block, determining the challenge value; sending control information to the second node participating in the competition for accounting rights, and the control information is used to instruct the second node to generate a random key corresponding to a random key based on a preset one-way function. After the mapping value is stored in the idle storage space with a corresponding relationship, the second node determines the random key corresponding to the random mapping value with the smallest distance from the challenge value from the idle storage space; After the competition information fed back by the second node, based on the M competition information, the target node is determined from the M second nodes, and the target node is determined to obtain the accounting right of the new block. Each competition information includes at least the idle time of the second node to which it belongs. The random key corresponding to the random mapping value with the smallest distance from the challenge value in the storage space.

Description

Method, device and computer storage medium for confirming bookkeeping right

technical field

The present invention relates to the technical field of block chains, in particular to a method, device and computer storage medium for confirming bookkeeping rights.

Background technique

Blockchain is the current hot spot and leading the future trend. Blockchain technology, also known as distributed ledger technology, is an Internet database technology. Because of its decentralization, openness and transparency, everyone can participate The characteristics of database records and information that cannot be forged and tampered are very suitable for the field of modern information management. In the blockchain, decentralization is to obtain the bookkeeping rights of new blocks by participating in the competition of the nodes of the whole network. In the existing technology, the consensus mechanism of the blockchain is usually adopted, including: POW (Proof of Work, proof of work), POS (Proof of Work) of Stake, DPOS (Delegated Proof of Stake, delegated Proof of Stake) and other methods to confirm the ownership of bookkeeping rights, POW consumes more resources, and POS and DPOS have the problem of unfair distribution of bookkeeping rights. Therefore, the existing There are problems of waste of resources or unfair distribution in the way of confirmation of bookkeeping rights in technology.

Contents of the invention

In view of the above problems, the present invention is proposed to provide an accounting right confirmation method, device and computer storage medium that overcome the above problems or at least partially solve the above problems.

In the first aspect, this application provides a method for confirming bookkeeping rights, which is applied to the first node, including:

In the case of generating a new block, determine the challenge value;

Send control information to the second node participating in the competition for accounting rights, the control information is used to instruct the second node to generate a random mapping value corresponding to the random keyword based on a preset one-way function, and store it in the corresponding relationship in the The free storage space of the second node, so that after the free storage space of the second node is filled, the second node determines from the free storage space that the random mapping value with the smallest distance from the challenge value corresponds to random keywords for ;

After obtaining the competition information fed back by the M second nodes participating in the competing bookkeeping rights in the entire network based on the challenge value, a total of M competition information is obtained, and based on the M competition information, from the M second nodes Determine the target node, determine that the target node obtains the bookkeeping right of the new block, wherein each of the M pieces of competition information includes at least the challenge value in the idle storage space of the second node to which it belongs The random key corresponding to the random mapping value with the smallest distance, M is an integer greater than 1.

Optionally, the length of the mapping value generated by the preset one-way function is a first preset length, the length of the defined random key is a second preset length, and the control information is used to indicate that the second node The quotient obtained by dividing the storage amount of the idle storage space by the sum of the first preset length and the second preset length is N, and then generating N random keywords, and using the preset one-way function to generate The N random mapping values corresponding to the N random keywords one by one, storing the N random keywords and the N random mapping values according to the corresponding relationship, and the N random keywords and the N Randomly mapped values can fill up free storage space of the second node.

Optionally, each of the N random keywords includes identification information of the node to which it belongs, a random value, and a preset character string.

Optionally, the determination of the challenge value includes:

determining the block hash value of the new block as the challenge value; or

Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function.

Optionally, each of the competition information includes only the random key corresponding to the random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs, and based on the M pieces of competition information, from Determining the target node among the M second nodes includes:

Based on the preset one-way function, generate a random mapping value corresponding to a random keyword in each competition information, a total of M random mapping values;

A first random mapping value with the smallest distance from the challenge value is determined from the M random mapping values, and a second node to which the first random keyword corresponding to the first random mapping value belongs is determined as the target node.

Optionally, each piece of competition information includes a random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs and a random key corresponding to the random mapping value, and the M The competition information, determining the target node from the M second nodes, includes:

A second random mapping value with the smallest distance to the challenge value is determined from the M random mapping values corresponding to the M pieces of competition information one-to-one, and the second node to which the second random mapping value belongs is determined as the target node.

Optionally, the determining that the second node to which the second random mapping value belongs is the target node includes:

Verifying the second random mapping value based on a second random key corresponding to the second random mapping value;

If the verification passes, it is determined that the second node to which the second random mapping value belongs is the target node.

Optionally, the verifying the second random mapping value based on the second random key corresponding to the second random mapping value includes:

generating a mapping value to be verified corresponding to the second random keyword based on the preset one-way function;

If the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

Optionally, the determining that the target node obtains the bookkeeping right of the new block includes:

Based on the preset consensus algorithm, obtain feedback from the nodes of the entire network to the target node;

If the obtained feedback satisfies the preset condition, it is determined that the target node obtains the bookkeeping right of the new block.

In a second aspect, the present application provides an accounting right confirmation device, which is applied to the first node, and the device includes:

The first determination unit is used to determine the challenge value when a new block is generated;

A sending unit, configured to send control information to a second node participating in the competition for accounting rights, where the control information is used to instruct the second node to generate a random mapping value corresponding to a random keyword based on a preset one-way function, and then use the corresponding The relationship is saved in the idle storage space of the second node, so that after the idle storage space of the second node is filled, the second node determines from the idle storage space that the distance from the challenge value is the smallest The random key corresponding to the random mapping value of ;

The second determining unit is configured to obtain a total of M pieces of competition information based on the competition information fed back by the M second nodes participating in the competing bookkeeping rights of the entire network based on the challenge value, and based on the M pieces of competition information, from all Determine the target node among the M second nodes, and determine that the target node obtains the accounting right of the new block, wherein each of the M competition information includes at least the idle memory of the second node to which it belongs. The random key corresponding to the random mapping value with the smallest distance from the challenge value in the space, M is an integer greater than 1.

Optionally, the length of the mapping value generated by the preset one-way function is a first preset length, the length of the defined random key is a second preset length, and the control information is used to indicate that the second node The quotient obtained by dividing the storage amount of the idle storage space by the sum of the first preset length and the second preset length is N, and then generating N random keywords, and using the preset one-way function to generate The N random mapping values corresponding to the N random keywords one by one, storing the N random keywords and the N random mapping values according to the corresponding relationship, and the N random keywords and the N Randomly mapped values can fill up free storage space of the second node.

Optionally, each of the N random keywords includes identification information of the node to which it belongs, a random value, and a preset character string.

Optionally, the determination of the challenge value includes:

determining the block hash value of the new block as the challenge value; or

Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function.

Optionally, each piece of competition information only includes a random key corresponding to the random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs, and the second determining unit includes:

The first generation module is configured to generate a random mapping value corresponding to a random keyword in each competition information based on the preset one-way function, a total of M random mapping values;

The first determining module is configured to determine the first random mapping value with the smallest distance from the challenge value from the M random mapping values, and determine the first random mapping value to which the first random key corresponding to the first random mapping value belongs. The second node is the target node.

Optionally, each piece of competition information includes a random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs and a random key corresponding to the random mapping value, and the second determination unit includes :

The second determining module is configured to determine the second random mapping value with the smallest distance from the challenge value from the M random mapping values corresponding to the M pieces of competition information one-to-one, and determine the location to which the second random mapping value belongs. The second node is the target node.

Optionally, the second determination module includes:

A verification submodule, configured to verify the second random mapping value based on the second random key corresponding to the second random mapping value;

The determining submodule is configured to determine that the second node to which the second random mapping value belongs is the target node if the verification is passed.

Optionally, the verification submodule is specifically used for:

generating a mapping value to be verified corresponding to the second random keyword based on the preset one-way function;

If the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

Optionally, the second determination unit includes:

An acquisition module, configured to acquire feedback from nodes on the entire network to the target node based on a preset consensus algorithm;

The third determining module is configured to determine that the target node obtains the bookkeeping right of the new block if the obtained feedback satisfies a preset condition.

In a third aspect, the present application provides a billing right confirmation device, which is applied to a first node, and the device includes a processor and a memory: the memory is used to store a program for executing the billing right confirmation method described in the aforementioned first aspect ; the processor is configured to execute the program stored in the memory.

In a fourth aspect, the present application provides a computer storage medium for storing computer software instructions used by the above-mentioned accounting right confirmation device, which includes a program designed for executing the above-mentioned aspect for the accounting right confirmation device.

The above one or more technical solutions in the embodiments of the present application have at least one or more of the following technical effects:

In the technical solution of the embodiment of the present invention, by providing a bookkeeping right confirmation method, it is applied to the first node, and in the case of generating a new block, the challenge value is determined, and then the control information is sent to the second node participating in the competition for the bookkeeping right. node, the control information is used to instruct the second node to generate the random mapping value corresponding to the random keyword based on the preset one-way function, and store it in the idle storage space of the second node with a corresponding relationship, so that the idle storage space of the second node is After filling up, the second node determines the random key corresponding to the random mapping value with the smallest distance from the challenge value from the idle storage space; the M second nodes that have obtained the right to participate in the competition bookkeeping of the whole network compete based on the challenge value feedback After information, a total of M competition information is obtained, based on the M competition information, the target node is determined from the M second nodes, and the target node is determined to obtain the accounting right of the new block, wherein each of the M competition information At least including the random key corresponding to the random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs. In this way, if the free storage space of the second node is larger, the more random keywords and corresponding random mapping values are stored, the greater the probability of finding the random mapping value with the smallest distance from the challenge value, and the more May become a bookkeeping node. Therefore, compared with POW, all nodes in the entire network do not have to perform hash challenges with new blocks, which can effectively save resources. Compared with POS and DPOS, the larger the idle storage space, the more likely it is to obtain the right to bookkeeping, and the idle The storage space will change with time, so the node to which the bookkeeping right belongs changes with time, which is more fair for the distribution of bookkeeping rights.

Description of drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiment. The drawings are only for the purpose of illustrating a preferred embodiment and are not to be considered as limiting the invention. Also throughout the drawings, the same reference numerals are used to designate the same components. In the attached picture:

Fig. 1 is a flow chart of a method for confirming bookkeeping rights in the first embodiment of the present invention;

FIG. 2 is a schematic diagram of an accounting right confirmation device in a second embodiment of the present invention;

Fig. 3 is a schematic diagram of an accounting right confirmation device in a third embodiment of the present invention.

Detailed ways

This embodiment discloses a method, device, and computer storage medium for confirming bookkeeping rights, which can reduce resources consumed when determining bookkeeping rights and improve the fairness of bookkeeping right distribution. The method includes: in the case of generating a new block, determining a challenge value; sending control information to a second node participating in the competition for accounting rights, the control information is used to instruct the second node to generate a random key based on a preset one-way function After the random mapping value corresponding to the word, save it in the idle storage space of the second node with a corresponding relationship, so that after the idle storage space of the second node is filled, the second node starts from the idle storage space Determine the random key corresponding to the random mapping value with the smallest distance from the challenge value; after obtaining the competition information fed back by the M second nodes participating in the competition for bookkeeping rights in the entire network, a total of M Competition information, based on the M pieces of competition information, determine a target node from the M second nodes, and determine that the target node obtains the accounting right of the new block, wherein each of the M pieces of competition information The competition information at least includes a random key corresponding to the random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs, and M is an integer greater than 1.

The technical solutions of the present invention will be described in detail below through the drawings and specific examples. It should be understood that the embodiments of the present application and the specific features in the examples are detailed descriptions of the technical solutions of the present application, rather than limitations on the technical solutions of the present application. In the case of no conflict, the embodiments of the present application and the technical features in the embodiments may be combined with each other.

The term "and/or" in this article is just an association relationship describing associated objects, which means that there can be three relationships, for example, A and/or B can mean: A exists alone, A and B exist simultaneously, and there exists alone B these three situations. In addition, the character "/" in this article generally indicates that the contextual objects are an "or" relationship.

Example

The first embodiment of the present invention provides a method for confirming bookkeeping rights. The flow chart of the method is shown in Figure 1. The method for confirming bookkeeping rights is applied to the first node. The method for confirming bookkeeping rights includes the following steps:

S101: In the case of generating a new block, determine the challenge value;

S102: Send control information to the second node participating in the competition for accounting rights, the control information is used to instruct the second node to generate the random mapping value corresponding to the random key based on the preset one-way function, and store it in the corresponding relationship The free storage space of the second node, so that after the free storage space of the second node is filled, the second node determines a random mapping with the smallest distance from the challenge value from the free storage space The random key corresponding to the value;

S103: After obtaining the competition information fed back based on the challenge value by the M second nodes participating in the competing bookkeeping rights of the entire network, a total of M competition information is obtained, and based on the M competition information, from the M second nodes Determine the target node among the nodes, and determine that the target node obtains the bookkeeping right of the new block, wherein each of the M pieces of competition information includes at least the information in the idle storage space of the second node to which it belongs and the The random keyword corresponding to the random mapping value with the smallest challenge value distance, M is an integer greater than 1.

Specifically, in this embodiment, the bookkeeping right confirmation method is mainly applied to the nodes in the block chain, which includes multiple nodes, and the nodes can specifically be user computers, user mobile phones, routing devices, servers, etc., of course , can also be other types of equipment, which is not limited in this application. The first node in this embodiment is a central node, and the central node is a node trusted by nodes in the entire network in the area chain, such as a server. Of course, it can also be any node in the blockchain, which is not limited in this application. The second node can be any node in the entire network participating in the competition for bookkeeping rights.

When a new block is generated in the blockchain system, the first node will broadcast the relevant information of the new block to all nodes in the entire network. The first node also determines a challenge value through step S101, which is used to determine the ownership of the bookkeeping right of the new block based on the challenge value. Specifically, the block hash value of the new block can be the challenge value; or based on the data of the historical block, the challenge value can be generated by using the preset one-way function. The preset function may be a hash function, and of course, it may also be other one-way functions that convert data into a fixed length, which is not limited in this application.

Taking the preset one-way function as the hash function as an example, the relevant data of the new block can be obtained, converted into the block hash value by using the hash function, and the block hash value of the new block is used as the challenge value. Of course, when a new block is generated, the new block records the block hash value of the previous block, and the block hash value of the previous block can also be used as the challenge value. Of course, it is also possible to obtain the relevant data information of the R historical blocks closest to the current moment, use a hash function to convert it into a hash value, and use the hash value as the challenge value. In a specific implementation process, the manner of determining the challenge value may be set according to actual needs, which is not limited in this application.

When the nodes of the whole network know that a new block is generated, they apply to the first node to compete for the accounting right of the new block. When the first node learns that there are M second nodes participating in the competition for the bookkeeping right in the whole network, it sends control information to the second node through step S102, which is used to instruct the second node participating in the competition for the bookkeeping right to Free storage space fills up.

Wherein, the length of the mapping value generated by the preset one-way function is the first preset length, the length of the defined random key is the second preset length, and the control information is used to instruct the second node to obtain an idle N random keywords are generated after dividing the storage capacity of the storage space by the sum of the first preset length and the second preset length to N, and using the preset one-way function to generate N random mapping values corresponding to the N random keywords one-to-one, save the N random keywords and the N random mapping values according to the corresponding relationship, and store the N random keywords and the N random mapping values The value can fill up the free storage space of the second node.

Specifically, in this embodiment, the first node specifies that the second node needs to use a preset one-way function to generate a random mapping value corresponding to a random keyword. If the storage capacity of the idle storage space of the second node is Q, the first node sets the random key to occupy P bytes, and the mapping value generated by the preset one-way function occupies K bytes, then N=Q/(P +K), it is determined that N random keywords occupying P bytes need to be generated, and the second node can be instructed to use the preset one-way function to produce N mapping values corresponding to N random keywords one-to-one. In this way, N The storage space occupied by random keywords and N mapping values is exactly Q. By instructing the second node to generate N mapping values and saving N random keywords and N mapping values, the idle storage space of the second node is exactly fill up.

In this embodiment, the preset one-way function may use a hash function, and the generated mapping value is a binary hash value with a first preset length. Certainly, other one-way functions capable of generating a fixed-length character string may also be used, and this application does not make a limitation here. Taking the preset one-way function as a hash function as an example, the second section has 1T of free storage space. The first node stipulates that the random key occupies 8 bytes, and the hash value generated by the hash function occupies 32 bytes, so it is determined that 1T/(32+8) random keys need to be generated.

Furthermore, when the second node generates random keywords, it can be realized in but not limited to the following two ways:

The first way: obtain the identification information of the second node; generate N random values, and the N random values are different from each other; determine that each random key in the N random keys includes the identification information, the N A random value among random values and a preset character string, and each random keyword includes a different random value.

Specifically, in this embodiment, the second node can generate N random values, and the random values can be numbers, characters or character strings, which can be set according to actual needs during the specific implementation process. Here, this application does not limit. The control information sent by the first node received by the second node includes a preset character string, and it can be determined that each random keyword in the N random keywords includes its own ID, a random value in the N random values, and a preset character string. String, each random key includes a different random value. In a specific implementation process, the preset character string is a fixed character string, which can be set according to actual needs, which is not limited in this application. For example, if the second node generates N random values 1, 2, ..., N, the ID of the node is known, and the default character string is A, then the N random keywords can be: ID+1+A , ID+2+A, ..., ID+N+A. It should be noted that the length of each keyword in the N random keywords is a second preset length (for example: 8 bytes).

The second way: generate N random values, and the N random values are different from each other; determine the N random values as N random keywords.

Specifically, in this embodiment, N random values can be generated, and the random values can be numbers, characters or character strings, which can be set according to actual needs during specific implementation, and this application does not make limitations here. The first node may directly use the generated N random values as N random keys. For example, if the first node generates N random values 1, 2, ..., N, then the N random keys may be 1, 2, ..., N.

Since there are two methods for generating the N random keywords above, and the generated N random keywords have different composition forms, the following is divided into two situations.

In the first case, N random keywords are determined by the first method above, and the second node directly uses the preset one-way function to convert the N random keywords. Taking the preset one-way function as a hash function as an example, Following the foregoing example, the N random keywords may be: ID+1+A, ID+2+A, . . . , ID+N+A. Then the random keyword ID+1+A gets the corresponding hash value through the hash function.

(ID+1+A), the random keyword ID+2+A gets the corresponding hash value through the hash function

(ID+2+A), and so on, the random keyword ID+N+A is obtained through the hash function and the corresponding hash value is hash(ID+N+A). When the second node converts the hash value corresponding to each random keyword, it will save the random keyword and the corresponding hash value, such as: save the random keyword ID+1+A and hash(ID+1 +A), random keyword ID+2+A and hash(ID+2+A), ..., random keyword ID+N+A and hash(ID+1+A).

In the second case, N random keywords are determined by the second method above, and the control information also includes a preset character string, and the second node is based on the random keyword, the preset character string and the identification information of the second node Determine N combined random keys, and generate a one-to-one mapping value corresponding to each combined random key in the N combined random keys according to the preset one-way function, wherein each of the combined random keys The word includes the identification information, one random keyword among the N random keywords, and the preset character string, and the random keywords included in each combined random keyword are different.

Specifically, in this embodiment, the second node determines N random keywords, for example, the N random keywords in the preceding example may be 1, 2, . . . , N. The control information may also include a preset character string, which is a fixed character string and can be set according to actual needs, which is not limited in this application. The second node generates N combined random keys, and each combined random key includes the ID of the second node, a random key and the preset character string. Furthermore, the second node uses a preset one-way function to convert the N combined random keywords to obtain the mapping values corresponding to the N combined random keywords, and saves the N random keywords and the N combined random keywords according to the corresponding relationship The corresponding mapping value.

For example, taking the default one-way function as a hash function as an example, following the previous example, if the second node generates N random keywords as 1, 2, ..., N, and the default string is A, then you can Get N combined random keywords as ID+1+A, ID+2+A, ..., ID+N+A, then the combined random keyword ID+1+A gets the corresponding hash value through the hash function hash(ID+1+A), combine random keyword ID+2+A to get the corresponding hash value through hash function hash(ID+2+A), and so on, combine random keyword ID+N+ A obtains the corresponding hash value as hash(ID+N+A) through the hash function. When the second node converts the hash value corresponding to each combined random key, it will save the random key corresponding to the combined random key and the hash value corresponding to the obtained combined random key, such as: save the random key Keyword 1 and hash (ID+1+A), random keyword 2 and hash (ID+2+A), ..., random keyword N and hash (ID+1+A).

After each second node participating in the competition for bookkeeping rights fills up its own idle storage space according to the control information instruction, the control information will also instruct each second node to determine from the random mapping value stored in its own idle storage space A random mapping value with the smallest distance from the challenge value, since the random mapping value and the random key are stored in a corresponding relationship, the random key corresponding to the random mapping value will also be obtained.

For example, after the second node (i) fills up its free storage space in the manner indicated by the control information, it obtains the value with the smallest distance from the challenge value H(T) from the random mapping values stored in its free storage space A random mapping value H(i), the random key corresponding to the random mapping value H(i) is K(i).

Each second node will feed back a competition information to the first node, and the competition information includes at least the random key corresponding to the random mapping value with the smallest distance to the challenge value in the free storage space of the second node to which it belongs. Furthermore, through step S103, competition information fed back by M second nodes participating in the competition for accounting rights in the entire network is received, and a total of M competition information is obtained. Based on the M competition information, from the M second nodes A target node is determined, and it is determined that the target node obtains the bookkeeping right of the new block.

Since the contents of the competition information fed back by the second node are different, the methods of determining the target node are different. Specifically, in this embodiment, the following two situations are described in detail:

The first case: each competition information only includes the random key corresponding to the random mapping value with the smallest distance from the challenge value in the free storage space of the second node, and based on the preset one-way function, generate The random mapping value corresponding to the random keyword in each competition information, a total of M random mapping values; determine the first random mapping value with the smallest distance from the challenge value from the M random mapping values, and determine the The second node to which the first random key corresponding to the first random mapping value belongs is the target node.

Specifically, in this embodiment, the competition information fed back by the second node only includes the random key corresponding to the random mapping value with the smallest distance from the challenge value in the idle storage space of the node, and the first node will also , using a preset one-way function to generate a random mapping value corresponding to each random keyword. Since there are M second nodes, there are a total of M random mapping values. Then determine the first random mapping value with the smallest distance from the challenge value from the M random mapping values, and determine the second node to which the first random key corresponding to the first random mapping value belongs as the target node.

For example, taking the default one-way function as a hash function as an example, following the previous example, the first node receives M random keywords fed back by M second nodes, including: K(1), K(2), ..., K(i), ..., K(M). K(i) is a random keyword fed back by the i-th second node.

If the second node uses the aforementioned first method to generate random keywords, the first node obtains the hash values of the M random keywords fed back by the above-mentioned M second nodes through the hash function, including: hash[K(1) ], hash[K(2)], ..., hash[K(i)], ..., hash[K(M)]. Furthermore, the first node confirms that the distance between hash[K(j)] (the random mapping value of the jth second node) and the challenge value H(T) among the M random mapping values is the smallest, then the jth second node as the target node.

If the second node uses the aforementioned second method to generate a random keyword, and the default character string is A, then the first node needs to obtain a combined random keyword according to the same rules, following the previous example, including: ID(1)+K( 1)+A, ID(2)+K(2)+A, ..., ID(i)+K(i)+A, ..., ID(M)+K(M)+A. ID(i) is the identifier of the i-th second node. Furthermore, the hash values of the above M combinations of random keywords are obtained through a hash function, including: hash[ID(1)+K(1)+A], hash[ID(2)+K(2)+A] ,..., hash[ID(i)+K(i)+A],..., hash[ID(M)+K(M)+A]. Furthermore, the first node confirms that hash[ID(j)+K(j)+A] (the random mapping value of the jth second node) among the M random mapping values has the smallest distance from the challenge value H(T), then Take the jth second node as the target node.

If the free storage space of the second node is larger, the more random keywords and corresponding random mapping values are stored, the greater the probability of finding the random mapping value with the smallest distance from the challenge value, and the more likely it is to become a bookkeeping node .

Case 2: Each competition information includes the random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs and the random key corresponding to the random mapping value. A second random mapping value with the smallest distance to the challenge value is determined from the M random mapping values corresponding to the information one-to-one, and the second node to which the second random mapping value belongs is determined as the target node.

Specifically, in this embodiment, the competition information fed back by the second node includes the random mapping value corresponding to the random mapping value with the smallest distance from the challenge value in the idle storage space of the node and the random key corresponding to the random mapping value, A total of M random mapping values are obtained. The first node directly determines a second random mapping value with the smallest distance from the challenge value from the M random mapping values, and determines that the second node to which the second random mapping value belongs is the target node.

For example, taking the default one-way function as a hash function as an example, following the previous example, the first node receives M random keys and M random mapping values fed back by M second nodes, including: K(1) and H(1), K(2) and H(2), ..., K(i) and H(i), ..., K(M) and H(M). K(i) is a random key fed back by the i-th second node, and H(i) is a random mapping value corresponding to K(i) fed back by the i-th second node. Furthermore, the first node confirms that the distance between H(j) (the random mapping value of the jth second node) and the challenge value H(T) among the M random mapping values is the smallest, then the jth second node is used as the target node .

Due to this method, there may be cases where the second node cheats. For example, when the malicious second node knows the challenge value, it may forge a random mapping value. The distance between the forged random mapping value and the challenge value is small, so that , the probability that the second node will win the bookkeeping right will be greater. In order to avoid this situation, the first node will also verify the determined target node, and the verification can be achieved through the following steps:

Verifying the second random mapping value based on the second random key corresponding to the second random mapping value; if the verification is passed, determining that the second node to which the second random mapping value belongs is the target node. Wherein, the verifying the second random mapping value based on the second random key corresponding to the second random mapping value includes: generating a key corresponding to the second random key based on the preset one-way function The mapping value to be verified corresponding to the word; if the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

Specifically, in this embodiment, since each second node directly feeds back the random mapping value and the corresponding random key, a malicious second node can easily forge the random mapping value, but the random key corresponding to the random mapping value does not It cannot be easily forged, because the random mapping value is generated according to the preset one-way function indicated by the first node, and it is difficult to restore the forged random mapping value to obtain the correct random key. Therefore, after determining the second random mapping value with the smallest distance from the challenge value, obtain the corresponding second random key fed back by the second node to which the second random mapping value belongs, based on the aforementioned preset one-way function, A mapping value to be verified corresponding to the second random keyword is generated, and if the mapping value to be verified is consistent with the second random mapping value, it is determined that the second random mapping value is not forged, and it is determined that the verification is passed. The second node to which the second random mapping value belongs is the target node.

For example, taking the preset one-way function as a hash function as an example, following the previous example, the first node confirms that H(j) (the random mapping value of the jth second node) among the M random mapping values is the same as the challenge After the value H(T) has the smallest distance, the random key to obtain feedback from the jth second node is K(j).

If the second node uses the aforementioned first method to generate a random keyword, then the first node obtains the hash value of K(j) through the hash function as hash[K(j)], if H(j) and hash[K (j)] consistent, it indicates that H(j) is not forged, it is determined that the verification is passed, and the jth second node is used as the target node.

If the second node generates a random key in the aforementioned second way, the first node first obtains the random key corresponding to the combination of random key ID(j)+K(j)+A according to the same rule, where ID (j) is the identification information of the jth second node, and the default character string is A. Then the first node obtains the hash value of the combined random key ID(j)+K(j)+A through the hash function as hash[ID(j)+K(j)+A], if H(j) If it is consistent with hash[ID(j)+K(j)+A], it indicates that H(j) is not forged, it is determined that the verification is passed, and the jth second node is taken as the target node.

Further, after the target node is determined from the M second nodes through step S103, it is also determined whether to assign the accounting right to the target node based on the opinions of the nodes in the entire network. Specifically, it can be achieved through the following steps:

Based on the preset consensus algorithm, the feedback opinions of the nodes of the whole network to the target node are obtained; if the obtained feedback meets the preset conditions, it is determined that the target node obtains the bookkeeping right of the new block.

Specifically, in this embodiment, after the first node determines the target node, based on the preset consensus algorithm, the feedback opinions of the nodes in the entire network on the target node are obtained. The preset consensus algorithm can be PBFT (Practical Byzantine Fault Tolerance, standard Byzantine Fault Tolerance), SBFT (Simple Byzantine Fault Tolerance, Simple Byzantine Fault Tolerance), etc. Of course, it can also be other consensus algorithms, and this application does not limit it here. Taking PBFT as an example, PBFT can ensure the security and stability of the consensus process, the consensus delay is short, the consensus efficiency is high, and it can meet the needs of high-frequency trading volume. Then through the PBFT algorithm, first determine the target node as the leader node, and the leader node provides proof information, such as: computing power proof, sends the proof information to other nodes in the entire network, and other nodes give feedback (voting) to the target node. The feedback received by a node meets the preset conditions, such as: the number of votes for the target node to obtain the bookkeeping right is greater than the preset percentage of the total number of votes, and the target node is determined to obtain the bookkeeping right of the new block.

In this way, if the free storage space of the second node participating in the bookkeeping right competition is larger, the more random keywords and corresponding random mapping values are stored, and the method of finding the random mapping value with the smallest distance from the challenge value is The greater the probability, the more likely it is to become a bookkeeping node. Therefore, compared with POW, all nodes in the entire network do not have to perform hash challenges with new blocks, which can effectively save resources. Compared with POS and DPOS, the larger the idle storage space, the more likely it is to obtain the right to bookkeeping, and the idle The storage space will change with time, so the node to which the bookkeeping right belongs changes with time, which is more fair for the distribution of bookkeeping rights.

Please refer to FIG. 2, the second embodiment of the present invention also provides a billing right confirmation device, which is applied to the first node, and the device includes:

The first determination unit 201 is configured to determine the challenge value when a new block is generated;

The sending unit 202 is configured to send control information to the second node participating in the competition for the accounting right, the control information is used to instruct the second node to generate a random mapping value corresponding to the random keyword based on a preset one-way function, and to The corresponding relationship is stored in the idle storage space of the second node, so that after the idle storage space of the second node is filled, the second node determines the distance from the idle storage space to the challenge value The random key corresponding to the smallest random mapping value;

The second determining unit 203 is configured to obtain a total of M competition information after obtaining the competition information fed back by the M second nodes participating in the competition bookkeeping right of the entire network based on the challenge value, and based on the M competition information, from Determining a target node among the M second nodes, determining that the target node obtains the accounting right of the new block, wherein each of the M competition information includes at least the idle status of the second node to which it belongs. The random key corresponding to the random mapping value with the smallest distance from the challenge value in the storage space, M is an integer greater than 1.

As an optional embodiment, the length of the mapping value generated by the preset one-way function is the first preset length, the length of the defined random key is the second preset length, and the control information is used to indicate The second node generates N random keywords after dividing the storage capacity of the idle storage space by the sum of the first preset length and the second preset length to N, and uses the preset Let the one-way function generate N random mapping values corresponding to the N random keywords one by one, save the N random keywords and the N random mapping values according to the corresponding relationship, and the N random keywords The free storage space of the second node can be filled with the N random mapping values.

As an optional embodiment, each of the N random keywords includes identification information of the node it belongs to, a random value, and a preset character string.

As an optional embodiment, the determination of the challenge value includes:

determining the block hash value of the new block as the challenge value; or

Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function.

As an optional embodiment, each piece of competition information only includes a random key corresponding to a random mapping value with the smallest distance from the challenge value in the free storage space of the second node to which it belongs, and the second determining unit include:

The first generation module is configured to generate a random mapping value corresponding to a random keyword in each competition information based on the preset one-way function, a total of M random mapping values;

The first determining module is configured to determine the first random mapping value with the smallest distance from the challenge value from the M random mapping values, and determine the first random mapping value to which the first random key corresponding to the first random mapping value belongs. The second node is the target node.

As an optional embodiment, each competition information includes a random mapping value with the smallest distance from the challenge value in the free memory space of the second node to which it belongs and a random key corresponding to the random mapping value, the The second determination unit includes:

The second determining module is configured to determine the second random mapping value with the smallest distance from the challenge value from the M random mapping values corresponding to the M pieces of competition information one-to-one, and determine the location to which the second random mapping value belongs. The second node is the target node.

As an optional embodiment, the second determination module includes:

A verification submodule, configured to verify the second random mapping value based on the second random key corresponding to the second random mapping value;

The determining submodule is configured to determine that the second node to which the second random mapping value belongs is the target node if the verification is passed.

As an optional embodiment, the verification submodule is specifically used for:

generating a mapping value to be verified corresponding to the second random keyword based on the preset one-way function;

If the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

As an optional embodiment, the second determining unit includes:

An acquisition module, configured to acquire feedback from nodes on the entire network to the target node based on a preset consensus algorithm;

The third determining module is configured to determine that the target node obtains the bookkeeping right of the new block if the obtained feedback satisfies a preset condition.

The third embodiment of the present invention also provides a billing right confirmation device, please refer to Figure 3, for the convenience of description, only the parts related to the embodiment of the present invention are shown, for specific technical details not disclosed, please refer to the present invention Examples Methods Section.

Fig. 3 is a schematic diagram showing a partial structure of the accounting right confirmation device provided by the embodiment of the present invention. The device for confirming the accounting right includes a memory 301, and the memory 301 is used for storing a program for executing the method for confirming the accounting right in the aforementioned first embodiment. The accounting right confirmation device further includes a processor 302 connected to the memory 301 , and the processor 302 is configured to execute a program stored in the memory 301 .

When the processor 302 executes the computer program, the steps in the method for confirming the accounting right in the above-mentioned first embodiment are realized. Alternatively, when the processor executes the computer program, the functions of each module/unit in the device for confirming the accounting right in the second embodiment above are realized.

Exemplarily, the computer program may be divided into one or more modules/units, and the one or more modules/units are stored in the memory and executed by the processor to complete the present invention. The one or more modules/units may be a series of computer program instruction segments capable of accomplishing specific functions, and the instruction segments are used to describe the execution process of the computer program in the computer device. For example, the computer program can be divided into the functions of the first determination unit, the sending unit, and the second determination unit, and the specific functions of each unit are as follows:

The first determination unit is used to determine the challenge value when a new block is generated;

A sending unit, configured to send control information to a second node participating in the competition for accounting rights, where the control information is used to instruct the second node to generate a random mapping value corresponding to a random keyword based on a preset one-way function, and then use the corresponding The relationship is saved in the idle storage space of the second node, so that after the idle storage space of the second node is filled, the second node determines from the idle storage space that the distance from the challenge value is the smallest The random key corresponding to the random mapping value of ;

The second determining unit is configured to obtain a total of M pieces of competition information based on the competition information fed back by the M second nodes participating in the competing bookkeeping rights of the entire network based on the challenge value, and based on the M pieces of competition information, from all Determine the target node among the M second nodes, and determine that the target node obtains the accounting right of the new block, wherein each of the M competition information includes at least the idle memory of the second node to which it belongs. The random key corresponding to the random mapping value with the smallest distance from the challenge value in the space, M is an integer greater than 1.

The electronic device may include, but is not limited to, a processor, a memory. Those skilled in the art can understand that the schematic diagram 3 is only an exemplary diagram of the functional components of the billing right confirmation device, and does not constitute a limitation to the billing right confirmation device, and may include more or less components than those shown in the figure, Or combine certain components, or different components, for example, the billing right confirmation device may also include input and output devices, network access devices, buses, and the like.

The so-called processor 302 may be a central processing unit (Central Processing Unit, CPU), and may also be other general-purpose processors, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), Off-the-shelf programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc., and the processor is the control center of the computer device, using various interfaces and lines to connect various parts of the entire computer device.

The memory 301 can be used to store the computer programs and/or modules, and the processor realizes the Various functions of computer equipment. The memory may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, at least one application program required by a function (such as a sound playback function, an image playback function, etc.) and the like; the storage data area may store Data (such as audio data, video data, etc.) etc. created in accordance with the use of the accounting right confirmation device. In addition, the memory may include a high-speed random access memory, and may also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (SecureDigital, SD) card, A flash memory card (Flash Card), at least one magnetic disk storage device, flash memory device, or other volatile solid state storage devices.

In the embodiment of the present invention, the length of the mapping value generated by the preset one-way function is the first preset length, the length of the defined random key is the second preset length, and the control information is used to indicate the The second node generates N random keywords after dividing the storage capacity of the idle storage space by the sum of the first preset length and the second preset length to N, and uses the preset order Generate N random mapping values corresponding to the N random keywords one by one to the function, store the N random keywords and the N random mapping values according to the corresponding relationship, and store the N random keywords and the N random mapping values according to the corresponding relationship. The N random mapping values can fill up the idle storage space of the second node.

In the embodiment of the present invention, each of the N random keys includes identification information of the node to which it belongs, a random value, and a preset character string.

In the embodiment of the present invention, the processor 302 also has the following functions:

determining the block hash value of the new block as the challenge value; or

Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function.

In the embodiment of the present invention, the processor 302 also has the following functions:

In the embodiment of the present invention, each competition information only includes the random key corresponding to the random mapping value with the smallest distance from the challenge value in the free memory space of the second node to which it belongs, and the processor 302 also has the following functions :

Based on the preset one-way function, generate a random mapping value corresponding to a random keyword in each competition information, a total of M random mapping values;

A first random mapping value with the smallest distance from the challenge value is determined from the M random mapping values, and a second node to which the first random keyword corresponding to the first random mapping value belongs is determined as the target node.

In the embodiment of the present invention, each competition information includes a random mapping value with the smallest distance from the challenge value in the free memory space of the second node to which it belongs and a random key corresponding to the random mapping value, and the processor 302 Also has the following functions:

A second random mapping value with the smallest distance to the challenge value is determined from the M random mapping values corresponding to the M pieces of competition information one-to-one, and the second node to which the second random mapping value belongs is determined as the target node.

In the embodiment of the present invention, the processor 302 also has the following functions:

Verifying the second random mapping value based on a second random key corresponding to the second random mapping value;

If the verification passes, it is determined that the second node to which the second random mapping value belongs is the target node.

In the embodiment of the present invention, the processor 302 also has the following functions:

generating a mapping value to be verified corresponding to the second random keyword based on the preset one-way function;

If the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

In the embodiment of the present invention, the processor 302 also has the following functions:

Based on the preset consensus algorithm, obtain feedback from the nodes of the entire network to the target node;

If the obtained feedback satisfies the preset condition, it is determined that the target node obtains the bookkeeping right of the new block.

The fourth embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored. If the integrated functional units of the accounting right confirmation device in the second embodiment of the present invention are implemented in the form of software functional units And when sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the present invention realizes all or part of the process in the method for confirming the accounting right in the first embodiment above, and can also be completed by instructing related hardware through a computer program, and the computer program can be stored in a computer. When the computer program is read from the storage medium, the computer program can realize the steps of the above-mentioned various method embodiments when executed by the processor. Wherein, the computer program includes computer program code, and the computer program code may be in the form of source code, object code, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, medium, U disk, removable hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), Random access memory (RAM, Random Access Memory), electrical carrier signal, telecommunication signal, and software distribution medium, etc. It should be noted that the content contained in the computer-readable medium may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, computer-readable media Excludes electrical carrier signals and telecommunication signals.

While preferred embodiments of the invention have been described, additional changes and modifications to these embodiments can be made by those skilled in the art once the basic inventive concept is appreciated. Therefore, it is intended that the appended claims be construed to cover the preferred embodiment as well as all changes and modifications which fall within the scope of the invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention also intends to include these modifications and variations.

The present invention also discloses A1, a method for confirming bookkeeping rights, which is applied to the first node in the blockchain, including:

In the case of generating a new block, determine the challenge value;

Send control information to the second node participating in the competition for accounting rights, the control information is used to instruct the second node to generate a random mapping value corresponding to the random keyword based on a preset one-way function, and store it in the corresponding relationship in the The free storage space of the second node, so that after the free storage space of the second node is filled, the second node determines from the free storage space that the random mapping value with the smallest distance from the challenge value corresponds to random keywords for ;

After obtaining the competition information fed back by the M second nodes participating in the competing bookkeeping rights in the entire network based on the challenge value, a total of M competition information is obtained, and based on the M competition information, from the M second nodes Determine the target node, determine that the target node obtains the bookkeeping right of the new block, wherein each of the M pieces of competition information includes at least the challenge value in the idle storage space of the second node to which it belongs The random key corresponding to the random mapping value with the smallest distance, M is an integer greater than 1.

A2. The method as described in A1, the length of the mapping value generated by the preset one-way function is the first preset length, the length of the defined random keyword is the second preset length, and the control information is used to indicate The second node generates N random keywords after dividing the storage capacity of the idle storage space by the sum of the first preset length and the second preset length to N, and uses the preset Let the one-way function generate N random mapping values corresponding to the N random keywords one by one, save the N random keywords and the N random mapping values according to the corresponding relationship, and the N random keywords The free storage space of the second node can be filled with the N random mapping values.

A3. The method described in A2, wherein each of the N random keywords includes identification information of the node to which it belongs, a random value, and a preset character string.

A4. The method as described in A1, the determination of the challenge value includes:

determining the block hash value of the new block as the challenge value; or

Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function.

A5. The method as described in A1, each of the competition information includes only the random key corresponding to the random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs, and the M competition information, determining the target node from the M second nodes, including:

Based on the preset one-way function, generate a random mapping value corresponding to a random keyword in each competition information, a total of M random mapping values;

A first random mapping value with the smallest distance from the challenge value is determined from the M random mapping values, and a second node to which the first random keyword corresponding to the first random mapping value belongs is determined as the target node.

A6. The method as described in A1, each of the competition information includes the random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs and the random key corresponding to the random mapping value, the Determining a target node from the M second nodes based on the M pieces of competition information includes:

A second random mapping value with the smallest distance to the challenge value is determined from the M random mapping values corresponding to the M pieces of competition information one-to-one, and the second node to which the second random mapping value belongs is determined as the target node.

A7. The method as described in A6, determining that the second node to which the second random mapping value belongs is the target node, including:

Verifying the second random mapping value based on a second random key corresponding to the second random mapping value;

If the verification passes, it is determined that the second node to which the second random mapping value belongs is the target node.

A8. The method as described in A7, wherein the verification of the second random mapping value based on the second random keyword corresponding to the second random mapping value includes:

generating a mapping value to be verified corresponding to the second random keyword based on the preset one-way function;

If the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

A9. The method as described in A1, the determining that the target node obtains the bookkeeping right of the new block includes:

Based on the preset consensus algorithm, obtain feedback from the nodes of the entire network to the target node;

If the obtained feedback satisfies the preset condition, it is determined that the target node obtains the bookkeeping right of the new block.

B10, a billing right confirmation device, applied to the first node, said device comprising:

The first determination unit is used to determine the challenge value when a new block is generated;

A sending unit, configured to send control information to a second node participating in the competition for accounting rights, where the control information is used to instruct the second node to generate a random mapping value corresponding to a random keyword based on a preset one-way function, and then use the corresponding The relationship is saved in the idle storage space of the second node, so that after the idle storage space of the second node is filled, the second node determines from the idle storage space that the distance from the challenge value is the smallest The random key corresponding to the random mapping value of ;

The second determining unit is configured to obtain a total of M pieces of competition information based on the competition information fed back by the M second nodes participating in the competing bookkeeping rights of the entire network based on the challenge value, and based on the M pieces of competition information, from all Determine the target node among the M second nodes, and determine that the target node obtains the accounting right of the new block, wherein each of the M competition information includes at least the idle memory of the second node to which it belongs. The random key corresponding to the random mapping value with the smallest distance from the challenge value in the space, M is an integer greater than 1.

B11, the device as described in B10, the length of the mapping value generated by the preset one-way function is the first preset length, the length of the defined random key is the second preset length, and the control information is used to indicate The second node generates N random keywords after dividing the storage capacity of the idle storage space by the sum of the first preset length and the second preset length to N, and uses the preset Let the one-way function generate N random mapping values corresponding to the N random keywords one by one, save the N random keywords and the N random mapping values according to the corresponding relationship, and the N random keywords The free storage space of the second node can be filled with the N random mapping values.

B12. The device according to B11, wherein each of the N random keys includes identification information of the node to which it belongs, a random value, and a preset character string.

B13. The device as described in B10, the determination of the challenge value includes:

determining the block hash value of the new block as the challenge value; or

Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function.

B14. The device as described in B10, each of the competition information includes only the random key corresponding to the random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs, and the second determination unit include:

The first generation module is configured to generate a random mapping value corresponding to a random keyword in each competition information based on the preset one-way function, a total of M random mapping values;

The first determining module is configured to determine the first random mapping value with the smallest distance from the challenge value from the M random mapping values, and determine the first random mapping value to which the first random key corresponding to the first random mapping value belongs. The second node is the target node.

B15. The device as described in B10, each of the competition information includes a random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs and a random key corresponding to the random mapping value, the The second determination unit includes:

The second determining module is configured to determine the second random mapping value with the smallest distance from the challenge value from the M random mapping values corresponding to the M pieces of competition information one-to-one, and determine the location to which the second random mapping value belongs. The second node is the target node.

B16, the device as described in B15, the second determination module includes:

A verification submodule, configured to verify the second random mapping value based on the second random key corresponding to the second random mapping value;

The determining submodule is configured to determine that the second node to which the second random mapping value belongs is the target node if the verification is passed.

B17. The device as described in B16, the verification submodule is specifically used for:

generating a mapping value to be verified corresponding to the second random keyword based on the preset one-way function;

If the mapping value to be verified is consistent with the second random mapping value, it is determined that the verification is passed.

B18. The device as described in B10, the second determination unit includes:

An acquisition module, configured to acquire feedback from nodes on the entire network to the target node based on a preset consensus algorithm;

The third determining module is configured to determine that the target node obtains the bookkeeping right of the new block if the obtained feedback satisfies a preset condition.

C19. A device for confirming bookkeeping rights, applied to the first node, including:

A memory, the memory is used to store a program for executing any one of the methods described in A1 to A9;

A processor, connected to the memory, configured to execute programs stored in the memory.

D20. A computer storage medium for storing computer software instructions used by the above-mentioned billing right confirmation device, which includes the program designed for the billing right confirmation device for executing the above aspects.

Claims (10)

1. A method for confirming bookkeeping rights, applied to the first node in the block chain, characterized in that, comprising: In the case of generating a new block, determine the challenge value; Send control information to the second node participating in the competition for accounting rights, the control information is used to instruct the second node to generate a random mapping value corresponding to the random keyword based on a preset one-way function, and store it in the corresponding relationship in the The free storage space of the second node, so that after the free storage space of the second node is filled, the second node determines from the free storage space that the random mapping value with the smallest distance from the challenge value corresponds to random keywords for ; After obtaining the competition information fed back by the M second nodes participating in the competing bookkeeping rights in the entire network based on the challenge value, a total of M competition information is obtained, and based on the M competition information, from the M second nodes Determine the target node, determine that the target node obtains the bookkeeping right of the new block, wherein each of the M pieces of competition information includes at least the challenge value in the idle storage space of the second node to which it belongs The random key corresponding to the random mapping value with the smallest distance, M is an integer greater than 1. 2. The method according to claim 1, wherein the length of the mapping value generated by the preset one-way function is a first preset length, and the length of the defined random key is a second preset length, so The control information is used to instruct the second node to generate N random keys after dividing the storage amount of the idle storage space obtained by the second node by the sum of the first preset length and the second preset length to be N. , and use the preset one-way function to generate N random mapping values corresponding to the N random keywords one-to-one, and save the N random keywords and the N random mapping values according to the corresponding relationship, so The N random keys and the N random mapping values can fill up the idle storage space of the second node. 3. The method according to claim 2, wherein each of the N random keywords includes identification information of the node to which it belongs, a random value and a preset character string. 4. The method according to claim 1, wherein said determining the challenge value comprises: determining the block hash value of the new block as the challenge value; or Based on the data of the historical blocks, the challenge value is generated by using the preset one-way function. 5. The method according to claim 1, wherein each competition information only includes a random key corresponding to the random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs, The determining the target node from the M second nodes based on the M pieces of competition information includes: Based on the preset one-way function, generate a random mapping value corresponding to a random keyword in each competition information, a total of M random mapping values; A first random mapping value with the smallest distance from the challenge value is determined from the M random mapping values, and a second node to which the first random keyword corresponding to the first random mapping value belongs is determined as the target node. 6. The method according to claim 1, wherein each competition information includes the random mapping value with the smallest distance from the challenge value in the idle storage space of the second node to which it belongs and the corresponding The random key, determining the target node from the M second nodes based on the M pieces of competition information includes: A second random mapping value with the smallest distance to the challenge value is determined from the M random mapping values corresponding to the M pieces of competition information one-to-one, and the second node to which the second random mapping value belongs is determined as the target node. 7. The method according to claim 6, wherein the determining that the second node to which the second random mapping value belongs is a target node comprises: Verifying the second random mapping value based on a second random key corresponding to the second random mapping value; If the verification passes, it is determined that the second node to which the second random mapping value belongs is the target node. 8. A billing right confirmation device, characterized in that it is applied to the first node, and the device comprises: The first determination unit is used to determine the challenge value when a new block is generated; A sending unit, configured to send control information to a second node participating in the competition for accounting rights, where the control information is used to instruct the second node to generate a random mapping value corresponding to a random keyword based on a preset one-way function, and then use the corresponding The relationship is saved in the idle storage space of the second node, so that after the idle storage space of the second node is filled, the second node determines from the idle storage space that the distance from the challenge value is the smallest The random key corresponding to the random mapping value of ; The second determining unit is configured to obtain a total of M pieces of competition information based on the competition information fed back by the M second nodes participating in the competing bookkeeping rights of the entire network based on the challenge value, and based on the M pieces of competition information, from all Determine the target node among the M second nodes, and determine that the target node obtains the accounting right of the new block, wherein each of the M competition information includes at least the idle memory of the second node to which it belongs. The random key corresponding to the random mapping value with the smallest distance from the challenge value in the space, M is an integer greater than 1. 9. A device for confirming bookkeeping rights, applied to the first node, characterized in that it includes: a memory, the memory is used to store a program for executing the method according to any one of claims 1 to 7; A processor, connected to the memory, configured to execute programs stored in the memory. 10. A computer storage medium, characterized in that it is used for storing computer software instructions used by the above-mentioned accounting right confirmation device, which includes a program designed for the above-mentioned aspect to be used for the bookkeeping right confirmation device.