WO2022095779A1

WO2022095779A1 - Pow-based blockchain consensus method and apparatus

Info

Publication number: WO2022095779A1
Application number: PCT/CN2021/126991
Authority: WO
Inventors: 黄晨宇; 张俊麒; 胡朝新; 苏小康; 张开翔; 范瑞彬; 张黔
Original assignee: 深圳前海微众银行股份有限公司; 香港科技大学
Priority date: 2020-11-06
Filing date: 2021-10-28
Publication date: 2022-05-12
Also published as: CN112436944B; WO2022095779A9; CN112436944A

Abstract

Disclosed are a POW-based blockchain consensus method and apparatus. The method comprises: if it is determined that a first anonymous node meets a preset condition, the first anonymous node generates a first consensus zero-knowledge proof; the first anonymous node generates a first block at least according to the first consensus zero-knowledge proof, consensus verification information, content of a block to be outputted, first anonymous identity information and a first attribute value commitment, and takes the first block as a consensus block; and the first anonymous node sends the first block to each second anonymous node. When the described method is applied to financial technology (Fintech), block consensus can be carried out without disclosing actual identity information, so the nodes that have higher attribute values are not vulnerable to targeted malicious attacks.

Description

A POW-based blockchain consensus method and device

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the priority of the Chinese patent application with the application number 202011231832.6 and the application name "A POW-based blockchain consensus method and device" filed with the Chinese Patent Office on November 06, 2020, the entire contents of which are by reference Incorporated in this application.

technical field

The present invention relates to the field of blockchain (blockchain) in the field of financial technology (Fintech), in particular to a method and device for consensus on a blockchain based on POW.

Background technique

With the development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually transforming into financial technology (Fintech). requirements. At present, the field of financial technology and the field of blockchain are closely related. The blockchain based on the Proof-of-Work (PoW) consensus algorithm is a relatively common blockchain. In the consensus process of the blockchain based on the PoW consensus algorithm, the consensus block is disclosed to the users of the blockchain.

However, some information is relatively sensitive information, such as which blockchain node produced the consensus block, which often represents the attribute value of the blockchain node. If it is leaked, it may cause the attacker to lock the target with high attribute value. This brings a certain privacy risk to the blockchain. Since then, the blockchain nodes that often produce blocks are vulnerable to malicious attacks, thereby dragging down the performance of the entire blockchain. This is an urgent problem to be solved.

SUMMARY OF THE INVENTION

The present invention provides a blockchain consensus method and device based on POW, which solves the problem in the prior art that the blockchain nodes that often produce blocks are vulnerable to malicious attacks.

In a first aspect, the present invention provides a blockchain consensus method based on POW, including: if a first anonymous node determines that the first anonymous node satisfies a preset condition, generating a first consensus zero-knowledge proof; the first The consensus zero-knowledge proof is at least used to verify the correctness of the following information: consensus verification information, first attribute value commitment and first anonymous identity information; the first attribute value commitment is the hidden information obtained at least according to the first actual attribute value; The first anonymous identity information is obtained at least according to the first actual identity information of the first anonymous node; the preset condition is set according to the characteristics of the PoW consensus algorithm; the first anonymous node is at least based on the The first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information, and the first attribute value commitment, generate the first block, and assign the first block to the first block. The block is used as a consensus block; the first anonymous node sends the first block to each second anonymous node.

In the above manner, since the first block is based on at least the first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information and the first attribute value Promise generated, through the first consensus zero-knowledge proof, the first block can be verified without revealing the actual identity information and the actual attribute value, so that the block consensus can be performed without revealing the actual identity information , then nodes with higher attribute values are not vulnerable to targeted malicious attacks.

Optionally, the first anonymous node determines that the first anonymous node satisfies a preset condition in the following manner: the first anonymous node determines the first mining value of the first anonymous node according to the first actual attribute value. Mining difficulty value; the first anonymous node continuously updates the mining factor within a preset number field, and determines whether the first anonymous node satisfies the preset condition according to the first mining difficulty value and the mining factor; The preset condition is set based on the first mining difficulty value; the probability that the mining factor satisfies the preset condition is positively correlated with the first actual attribute value.

In the above method, in the above method, the preset conditions are set on the basis of following the POW consensus algorithm, and the node that produces the block is adaptively selected in the blockchain, which improves the efficiency of selecting the node that produces the block.

Optionally, the determining whether the first anonymous node satisfies a preset condition according to the first mining difficulty value and the mining factor includes: the first anonymous node according to the mining factor and the mining factor. Describe the content of the block to be produced, and generate a first hash value; if the first anonymous node determines that the first hash value is less than the first mining difficulty value, then determine that the first anonymous node satisfies the preset condition .

In the above method, by setting a first mining difficulty value in each block, and adaptively selecting a consensus block based on the first mining difficulty value, the efficiency of selecting a block producing node is improved.

Optionally, in the process that the first anonymous node continuously updates the mining factor within the preset number range, during the period when the generated mining factor does not make the first anonymous node meet the preset condition, if the The first anonymous node receives the second block of any second anonymous node among the second anonymous nodes, and the first anonymous node verifies the second block; if the verification passes, the first anonymous node verifies the second block. The anonymous node regards the second block as a consensus block.

In the above method, during the period when the generated mining factor does not make the first anonymous node meet the preset conditions, it is determined whether it is a consensus block through the verification of the second block, so that it can be independently maintained. Update the mining factor. If there is a second block that passes the verification, it is not necessary to generate the first block, thus improving the consensus efficiency of the consensus block.

Optionally, the first block is the block to be agreed upon between the third block and the fourth block in the i-th period of the blockchain; the third block is the blockchain The first block to be consensus in the ith period of the blockchain; the fourth block is the last block to be consensus in the ith period of the blockchain; the first anonymous identity information is the Anonymous identity information of an anonymous node in the ith period of the blockchain; the first attribute value commitment is the attribute value commitment of the first anonymous node in the ith period of the blockchain.

In the above method, the anonymous identity information and attribute value commitments are bound by setting different periods, and are generated in a specific way between the first block, the third block and the fourth block, thereby further increasing the easy access. The difficulty of cracking the block node.

Optionally, after the end of the i-th period of the blockchain, the method further includes: the first anonymous node generates second anonymous identity information as the first anonymous node in the i+th period of the blockchain. Anonymous identity information of period 1; the first anonymous node generates a second attribute value commitment as the attribute value commitment of the first anonymous node in the i+1th period of the blockchain.

In the above manner, after the i-th period of the blockchain is over, new anonymous identity information and attribute value commitments in the i+1-th period are generated, thereby further increasing the difficulty of cracking the easy-to-block node.

Optionally, the third block is generated by the first anonymous node, and the first anonymous node generates the third block in the following manner: the first anonymous node according to the first consensus zero-knowledge Proof, the consensus verification information, the first anonymous identity information, and the first attribute value commitment to generate a third block.

In the above manner, in the first block, only the necessary identity verification information such as the first consensus zero-knowledge proof is filled, thereby saving the space of the third block.

Optionally, the fourth block is generated by the first anonymous node, and the first anonymous node generates the fourth block in the following manner: the first anonymous node according to the first consensus zero-knowledge Proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information, the first attribute value commitment, the third anonymous identity information and the third attribute value commitment to generate the fourth block ; the third anonymous identity information is the anonymous identity information of the anonymous node to be added in the i+1th period of the blockchain; the third attribute value commitment is at least according to the anonymous node to be added in the The hidden information obtained from the actual attribute value in the i+1th epoch of the blockchain.

In the above method, for the anonymous nodes to be added in the i+1 period, the consensus is directly completed in the last block of the i period to declare the legitimacy of the participating blocks in the i+1 period, thereby increasing the number of blocks. chain efficiency.

In a second aspect, the present invention provides a blockchain consensus device based on POW, including: a consensus module for generating a first consensus zero-knowledge proof if it is determined that the first anonymous node satisfies a preset condition; the first consensus The zero-knowledge proof is at least used to verify the correctness of the following information: consensus verification information, first attribute value commitment and first anonymous identity information; the first attribute value commitment is the hidden information obtained at least according to the first actual attribute value; so The first anonymous identity information is obtained at least according to the first actual identity information of the first anonymous node; the preset condition is set according to the characteristics of the PoW consensus algorithm; and at least according to the first consensus zero-knowledge proof, The consensus verification information, the content of the block to be produced, the first anonymous identity information and the first attribute value commitment, generate a first block, and use the first block as a consensus block; data transmission module. for sending the first block to each second anonymous node.

Optionally, the consensus module is specifically configured to: determine the first mining difficulty value of the first anonymous node according to the first actual attribute value; continuously update the mining factor within a preset number field, and The first mining difficulty value and the mining factor determine whether the first anonymous node satisfies a preset condition; the preset condition is set based on the first mining difficulty value; the mining factor satisfies The probability of the preset condition is positively correlated with the first actual attribute value.

Optionally, the consensus module is specifically configured to: generate a first hash value according to the mining factor and the content of the block to be produced; if it is determined that the first hash value is less than the first mining difficulty value, it is determined that the first anonymous node satisfies the preset condition.

Optionally, the consensus module is further configured to: in the process of continuously updating the mining factor in the preset number field, during the period when the generated mining factor does not make the first anonymous node meet the preset condition, if The data transmission module receives the second block of any second anonymous node among the second anonymous nodes, and then verifies the second block; if the verification is passed, the second block is used as a consensus block.

Optionally, after the i-th period of the blockchain ends, the consensus module is further configured to: generate second anonymous identity information as the first anonymous node in the i+1-th period of the blockchain. Anonymous identity information of the period; generating a second attribute value commitment as the attribute value commitment of the first anonymous node in the i+1th period of the blockchain.

Optionally, the third block is generated by the first anonymous node, and the consensus module is further configured to: generate the third block in the following manner: according to the first consensus zero-knowledge proof, the Consensus verification information, the first anonymous identity information, and the first attribute value promise to generate a third block.

Optionally, the fourth block is generated by the first anonymous node, and the consensus module is further configured to: generate the fourth block in the following manner: according to the first consensus zero-knowledge proof, the Consensus verification information, the content of the block to be produced, the first anonymous identity information, the first attribute value commitment, the third anonymous identity information and the third attribute value commitment to generate the fourth block; The third anonymous identity information is the anonymous identity information of the anonymous node to be added in the i+1th period of the blockchain; the third attribute value commitment is at least according to the anonymous node to be added in the blockchain. The hidden information obtained from the actual attribute value in the i+1th period.

For the beneficial effects of the foregoing second aspect and each optional device in the second aspect, reference may be made to the foregoing first aspect and the beneficial effects of each optional method in the first aspect, which will not be repeated here.

In a third aspect, the present invention provides a computer device, including a program or an instruction, which, when the program or instruction is executed, is used to execute the above-mentioned first aspect and each optional method of the first aspect.

In a fourth aspect, the present invention provides a storage medium, including a program or an instruction, which, when the program or instruction is executed, is used to execute the above-mentioned first aspect and each optional method of the first aspect.

These and other aspects of the invention will be more clearly understood from the description of the following embodiments.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present invention more clearly, the following briefly introduces the accompanying drawings used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without any creative effort.

FIG. 1 is a schematic flowchart corresponding to a POW-based blockchain consensus method provided by an embodiment of the present invention;

2 is a schematic diagram of the system architecture of a POW-based blockchain consensus system provided by an embodiment of the present invention;

FIG. 3 is a schematic diagram of a specific flow corresponding to a POW-based blockchain consensus method provided by an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a POW-based blockchain consensus device provided by an embodiment of the present invention.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

First, the terms and definitions appearing in this application are given below.

ZKP (Zero-Knowledge Proof, zero-knowledge proof): The prover can convince the verifier that an assertion is correct without providing any useful information to the verifier.

zk-SNARK (zero-knowledge succinct non-interactive argument of knowledge, concise non-interactive computing reliable zero-knowledge proof): is an implementation of zero-knowledge proof, which allows users to provide proofs in a non-interactive manner , and the proof can be verified in a short time. Applied to anonymous electronic currencies such as Zcash.

(Pedersen) Pedersen Commitment: A Cryptographic Commitment. It consists of two stages: in the commitment stage, it allows the promiser to send the message positive integer m in the form of ciphertext to a random positive integer through the promise function COMM(m,r), which can ensure that the promiser will not modify the message at the same time The message itself is hidden from others; in the open phase, the committer can disclose the message, and the receiver uses this to verify whether the message is consistent with the commitment phase. Pedersen promises to satisfy Hiding, Binding and homomorphic. We will mainly use the homomorphism among them, namely COMM(a,b)+COMM(c,d)=COMM(a+c,b+d).

Customers: Users who use the blockchain for bookkeeping.

Validator: A node that performs transaction verification and packages the authenticated transaction into the blockchain.

ID (Identity, ID number): represents the identification number of the verifier.

PoW (Proof-of-Work, Proof of Work): It is an economic countermeasure against abuse of services and resources, or denial of service attacks. Generally, users are required to perform some complex operations that are time-consuming and appropriate, and the answers can be quickly checked by the service provider. The time, equipment and energy consumed are used as guarantee costs to ensure that services and resources are used by real needs. Commonly used in public chains in blockchains.

Financial institutions (banking institutions, insurance institutions or securities institutions) are closely related to the blockchain field in the process of conducting business (such as bank loan business, deposit business, etc.). In the blockchain of the PoW consensus algorithm, the consensus block is disclosed to the users of the blockchain. However, some information is relatively sensitive information, and if it is leaked, it may cause the attacker to lock the target with high attribute value. This brings certain privacy risks to the blockchain. This situation does not meet the needs of financial institutions such as banks, and cannot guarantee the efficient operation of various businesses of financial institutions. To this end, as shown in Figure 1, the present application provides a POW-based blockchain consensus method.

Step 101: If the first anonymous node determines that the first anonymous node satisfies the preset condition, a first consensus zero-knowledge proof is generated.

Step 102 : The first anonymous node generates a value based on at least the first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information and the first attribute value commitment. the first block, and use the first block as a consensus block.

Step 103: The first anonymous node sends the first block to each second anonymous node.

In steps 101 to 103, the first consensus zero-knowledge proof is at least used to verify the correctness of the following information: consensus verification information, first attribute value commitment and first anonymous identity information; the first attribute value commitment is at least The hidden information obtained according to the first actual attribute value; the first anonymous identity information is obtained according to at least the first actual identity information of the first anonymous node; the preset condition is set according to the characteristics of the PoW consensus algorithm of.

In an optional implementation (hereinafter referred to as the implementation of the period), a period can be introduced, and the first block is the block between the third block and the fourth block in the i-th period of the blockchain. The block to be consensus; the third block is the first block to be consensus in the i-th period of the blockchain; the fourth block is the last block in the i-th period of the blockchain A block to be agreed upon.

The first anonymous identity information is the anonymous identity information of the first anonymous node in the i-th period of the blockchain; the first attribute value promises to be the first anonymous node in the blockchain. The attribute value promise for the ith period.

In the above method, the anonymous identity information and attribute value commitment are bound by setting different periods, and in the first block between the first block, the third block, and the last block, the fourth block, use It is generated in a specific way, thereby further increasing the difficulty of cracking the easy-to-block node.

It should be noted that, after the method shown in Fig. 1 is introduced into the period, it can be specifically implemented through the system architecture shown in Fig. 2 . The system architecture shown in Figure 2 includes three modules: a privacy-protected attribute value commitment and value operation module, a privacy-protected attribute-based consensus module, and a privacy-protected identity and attribute value commitment replacement module. The specific workflow is shown in FIG. 2 , and a period can be introduced in the method of steps 101 to 103 through the system architecture shown in FIG. 2 .

Specifically, the time is divided into different periods, and each period (such as the ith period, which is a certain period) only allows authenticated anonymous nodes (in this application, also called verifiers) to join the blockchain. Before the start of each epoch, when a validator joins the blockchain, it will have anonymous identity information and attribute value commitments through privacy-preserving identity and attribute value commitment replacement modules (eg, attribute value commitments are Pedersen commitments).

Anonymous nodes (validators) will mutually confirm the anonymous identity information and attribute value commitments of all validators participating in this period. After the epoch starts, each verifier observes the behavior of other verifiers and updates each verifier's attribute value commitment through privacy-preserving attribute value commitment and value manipulation modules.

After a period of time (for example, after each new consensus block is added), if the verifier is the leader node, the transaction and the attribute value commitments updated by all verifiers will be packaged into the block and released, and all verifiers will pass the privacy protection. The consensus module verifies and confirms the correct block and adds the consensus block to the final blockchain.

When the period ends, the verifier can choose to replace his anonymous identity information and attribute value commitment through the privacy-protected identity and attribute value commitment replacement module, after which the verifier can enter the next period to verify the blockchain and maintenance; validators can also opt out of the blockchain.

Based on the epoch implementation, the third block can be generated as follows:

The first anonymous node generates a third block according to the first consensus zero-knowledge proof, the consensus verification information, the first anonymous identity information and the first attribute value commitment.

Based on the epoch implementation, the fourth block can be generated as follows:

The first anonymous node is based on the first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information, the first attribute value commitment, and the third anonymous The identity information and the third attribute value promise to generate a fourth block; the third anonymous identity information is the anonymous identity information of the anonymous node to be added in the i+1th period of the blockchain.

The third attribute value commitment is hidden information obtained at least according to the actual attribute value of the anonymous node to be added in the i+1th period of the blockchain.

Based on the implementation of the period, the following steps can also be performed:

The first anonymous node generates second anonymous identity information as the anonymous identity information of the first anonymous node in the i+1th period of the blockchain; the first anonymous node generates a second attribute value commitment, As the attribute value commitment of the first anonymous node in the i+1th period of the blockchain.

Specifically, in the working process of the anonymous node (validator), it will observe the behavior of the validator and score other validators accordingly, and other validators will also supervise and score the behavior of the validator. In the commitment-based BFT consensus, the behavior of the verifier can be defined as a vote for transaction authentication, and the commitment value it obtains from each transaction authentication is S*V where V is the transaction amount (positive integer), and S is the reward coefficient (integer).

When the verifier and the transaction verification result on the final block are consistent, the reward coefficient is 1. When the authentication result is inconsistent, it is a negative number -10, which means that the verifier did not perform his responsibilities correctly or did evil to the system, so a certain score is deducted. This scheme mainly focuses on privacy protection, not how to calculate the commitment value through behavior, so it does not limit the method of commitment value calculation and can be applied to protect the privacy of various commitment value schemes.

For example, the validator's score in two blocks is the integer ΔR, and other validators can add COMM(ΔR,0) to

Come up to get the correct commitment value commitment. Homomorphism promised by Pedersen is available

Therefore, the addition of commitments can correctly add the obtained score to the unrevealed commitment value R.

In an optional implementation manner, in step 101, it may be determined in the following manner (hereinafter referred to as the implementation of the mining factor) that the first anonymous node satisfies the preset condition:

The first anonymous node determines the first mining difficulty value of the first anonymous node according to the first actual attribute value; the first anonymous node continuously updates the mining factor within a preset number field, and according to the The first mining difficulty value and the mining factor determine whether the first anonymous node satisfies a preset condition.

The preset condition is set based on the first mining difficulty value; the probability that the mining factor satisfies the preset condition is positively correlated with the first actual attribute value.

For example, according to the first actual attribute value R, the relationship between the first mining difficulty value D of the first anonymous node is determined as R=10*R-1, and the first actual attribute value R is 10, then the first A mining difficulty value D is 99. The mining factor is nonce, the preset number field is [1, 10000], the nonce is randomly selected in the preset number field, and the value range of the preset number field mapped according to the preset mapping relationship is [1, 200], the preset mapping The relationship can be set as a non-monotonic functional relationship to prevent the first anonymous node from taking random values. The preset condition is that the value obtained by the nonce mapping is within the interval [1,2*D]. Obviously, the larger the R is and the larger the D is, the greater the probability that the mining factor satisfies the preset condition is.

In the implementation of the mining factor, specifically, the specific process of determining whether the first anonymous node meets the preset conditions according to the first mining difficulty value and the mining factor may be as follows:

The first anonymous node generates a first hash value according to the mining factor and the content of the block to be produced; if the first anonymous node determines that the first hash value is less than the first mining difficulty value, it is determined that the first anonymous node satisfies the preset condition.

The above-mentioned embodiments can be implemented through a privacy-preserving consensus module, which allows anonymous nodes (verifiers) to mine the difficulty in consensus and attribute values. Verifiers can prove their legitimacy through zk-SNARK without revealing their attribute values to other verifiers. Other verifiers can quickly verify the proof without knowing the verifier's attribute values.

The flow of this module is shown in Figure 3 below.

(1) The verifier determines the positive integer D of the difficulty of mining by himself through his own attribute value. For example, when its own attribute is between the positive integer _Li and the positive integer _Hi , the hash value of the block it mines needs to be smaller than the positive integer _Di ;

(2) The verifier will increase the positive integer count value N(nonce) from 0, and each time it is added, it will judge whether the hash value of the block containing N satisfies the mining difficulty D, that is, H(B||N)<D , where B is the block content except the consensus proof domain.

In the implementation of the mining factor, specifically, the following situations may also occur:

In the process that the first anonymous node continuously updates the mining factor within the preset number range, during the period when the generated mining factor does not make the first anonymous node meet the preset condition, if the first anonymous node After receiving the second block of any second anonymous node among the second anonymous nodes, the first anonymous node verifies the second block; if the verification is passed, the first anonymous node will The second block is used as the consensus block.

The steps of the above-described embodiment in FIG. 3 are as follows:

(3) If the correct N is found, the verifier generates Z1 with zk-SNARK and puts it on the consensus proof field of the block. Z1 contains proof of the following information: 1)

The ID is generated according to the correct formula. 2) The difficulty D corresponding to the attribute value R is correct. 3) H(B||N)<D, where B is the block content except the formula proof field. The validator sends the correct block to other validators and mines the next round of blocks.

(4) If the verifier has not found the correct N, it will verify π1 after receiving the block sent by other verifiers, and if it is correct, add the block to the blockchain. If it is not correct, continue to find N.

As shown in FIG. 4 , the present invention provides a POW-based blockchain consensus device, including: a consensus module 401 for generating a first consensus zero-knowledge proof if it is determined that the first anonymous node satisfies a preset condition; the The first consensus zero-knowledge proof is at least used to verify the correctness of the following information: consensus verification information, first attribute value commitment, and first anonymous identity information; the first attribute value commitment is a concealment obtained at least according to the first actual attribute value information; the first anonymous identity information is obtained at least according to the first actual identity information of the first anonymous node; the preset condition is set according to the characteristics of the PoW consensus algorithm; and at least according to the first consensus zero Knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information and the first attribute value commitment, generate the first block, and use the first block as a consensus block ; Data transmission module 402. For sending the first block to each second anonymous node.

Optionally, the consensus module 401 is specifically configured to: determine the first mining difficulty value of the first anonymous node according to the first actual attribute value; continuously update the mining factor within the preset number range, The first mining difficulty value and the mining factor determine whether the first anonymous node satisfies a preset condition; the preset condition is set based on the first mining difficulty value; the mining factor The probability of satisfying the preset condition is positively correlated with the first actual attribute value.

Optionally, the consensus module 401 is specifically configured to: generate a first hash value according to the mining factor and the content of the block to be produced; if it is determined that the first hash value is smaller than the first mining value difficulty value, it is determined that the first anonymous node satisfies the preset condition.

Optionally, the consensus module 401 is further configured to: in the process of continuously updating the mining factor in the preset number field, during the period when the generated mining factor does not make the first anonymous node meet the preset condition, If the data transmission module 402 receives the second block of any second anonymous node among the second anonymous nodes, the second block is verified; if the verification is passed, the second block is as a consensus block.

Optionally, after the i-th period of the blockchain ends, the consensus module 401 is further configured to: generate second anonymous identity information as the first anonymous node in the i+th period of the blockchain Anonymous identity information of period 1; generate a second attribute value commitment as the attribute value commitment of the first anonymous node in the i+1th period of the blockchain.

Optionally, the third block is generated by the first anonymous node, and the consensus module 401 is further configured to: generate the third block in the following manner: according to the first consensus zero-knowledge proof, all The consensus verification information, the first anonymous identity information and the first attribute value commitment are generated to generate a third block.

Optionally, the fourth block is generated by the first anonymous node, and the consensus module 401 is further configured to: generate the fourth block in the following manner: according to the first consensus zero-knowledge proof, all The consensus verification information, the content of the block to be produced, the first anonymous identity information, the first attribute value commitment, the third anonymous identity information and the third attribute value commitment are used to generate the fourth block; the The third anonymous identity information is the anonymous identity information of the anonymous node to be added in the i+1th period of the blockchain; the third attribute value commitment is at least according to the anonymous node to be added in the blockchain The hidden information obtained from the actual attribute values in the i+1th epoch.

Based on the same inventive concept, an embodiment of the present invention also provides a computer device, including a program or an instruction, when the program or instruction is executed, such as the POW-based blockchain consensus method provided by the embodiment of the present invention and any Optional methods are executed.

Based on the same inventive concept, embodiments of the present invention also provide a computer-readable storage medium, including programs or instructions, when the programs or instructions are executed, the POW-based blockchain consensus method provided by the embodiments of the present invention and any optional methods are executed.

Although preferred embodiments of the present invention have been described, additional changes and modifications to these embodiments may occur to those skilled in the art once the basic inventive concepts are known. Therefore, the appended claims are intended to be construed to include the preferred embodiment and all changes and modifications that fall within the scope of the present invention.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit and scope of the invention. Thus, provided that these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

A POW-based blockchain consensus method, characterized in that it includes:

If the first anonymous node determines that the first anonymous node satisfies the preset conditions, it generates a first consensus zero-knowledge proof; the first consensus zero-knowledge proof is at least used to verify the correctness of the following information: consensus verification information, first consensus zero-knowledge proof attribute value commitment and first anonymous identity information; the first attribute value commitment is concealed information obtained at least according to the first actual attribute value; the first anonymous identity information is at least based on the first actual attribute value of the first anonymous node The identity information is obtained; the preset conditions are set according to the characteristics of the PoW consensus algorithm;

The first anonymous node generates a first zone according to at least the first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information and the first attribute value commitment. block, and use the first block as a consensus block;

The first anonymous node sends the first block to each second anonymous node.
The method of claim 1, wherein the first anonymous node determines that the first anonymous node satisfies a preset condition in the following manner:

The first anonymous node determines the first mining difficulty value of the first anonymous node according to the first actual attribute value;

The first anonymous node continuously updates the mining factor within a preset number range, and determines whether the first anonymous node satisfies the preset condition according to the first mining difficulty value and the mining factor; the preset The condition is set based on the first mining difficulty value; the probability that the mining factor satisfies the preset condition is positively correlated with the first actual attribute value.
The method according to claim 2, wherein the determining whether the first anonymous node satisfies a preset condition according to the first mining difficulty value and the mining factor comprises:

The first anonymous node generates a first hash value according to the mining factor and the content of the block to be produced;

If the first anonymous node determines that the first hash value is smaller than the first mining difficulty value, it is determined that the first anonymous node satisfies the preset condition.
The method of claim 2, further comprising:

In the process that the first anonymous node continuously updates the mining factor within the preset number range, during the period when the generated mining factor does not make the first anonymous node meet the preset condition, if the first anonymous node After receiving the second block of any second anonymous node among the second anonymous nodes, the first anonymous node verifies the second block;

If the verification is passed, the first anonymous node regards the second block as a consensus block.
The method according to any one of claims 1 to 4, wherein the first block is a consensus area between the third block and the fourth block in the i-th period of the blockchain block; the third block is the first block to be consensus in the ith period of the blockchain; the fourth block is the last block to be consensus in the ith period of the blockchain block; the first anonymous identity information is the anonymous identity information of the first anonymous node in the i-th period of the blockchain; the first attribute value promises that the first anonymous node is in the block Attribute value commitment for the ith epoch of the blockchain.
The method of claim 5, further comprising: after the i-th period of the blockchain ends:

The first anonymous node generates second anonymous identity information as the anonymous identity information of the first anonymous node in the i+1th period of the blockchain;

The first anonymous node generates a second attribute value commitment as the attribute value commitment of the first anonymous node in the i+1th period of the blockchain.
The method of claim 5, wherein the third block is generated by the first anonymous node, and the first anonymous node generates the third block in the following manner:

The first anonymous node generates a third block according to the first consensus zero-knowledge proof, the consensus verification information, the first anonymous identity information and the first attribute value commitment.
The method of claim 5, wherein the fourth block is generated by the first anonymous node, and the first anonymous node generates the fourth block in the following manner:

The first anonymous node is based on the first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information, the first attribute value commitment, and the third anonymous Identity information and the third attribute value commitment to generate the fourth block;

The third anonymous identity information is the anonymous identity information of the anonymous node to be added in the i+1th period of the blockchain; the third attribute value commitment is at least according to the anonymous node to be added in the area. The hidden information obtained from the actual attribute value in the i+1th epoch of the blockchain.
A POW-based blockchain consensus device, characterized in that it includes:

The consensus module is used to generate a first consensus zero-knowledge proof if it is determined that the first anonymous node satisfies the preset conditions; the first consensus zero-knowledge proof is at least used to verify the correctness of the following information: consensus verification information, first attribute value commitment and first anonymous identity information; the first attribute value commitment is concealed information obtained at least according to the first actual attribute value; the first anonymous identity information is at least based on the first actual identity of the first anonymous node information; the preset conditions are set according to the characteristics of the PoW consensus algorithm; and

Generate a first block based on at least the first consensus zero-knowledge proof, the consensus verification information, the content of the block to be produced, the first anonymous identity information and the first attribute value commitment, and the The first block is used as a consensus block;

A data transmission module, configured to send the first block to each second anonymous node.
A computer device, characterized by comprising a program or an instruction, when the program or the instruction is executed, the method according to any one of claims 1 to 8 is performed.