NFT privacy auction method, computer equipment and storage medium

By configuring a zero-knowledge proof circuit on the blockchain to verify the hash ID and costable checks during the NFT auction process, the problem of NFT auction information being unprivate in the existing technology is solved, and the additional information in addition to the auction amount is realized Complete privacy protection.

CN114817952BActive Publication Date: 2024-11-12HANGZHOU FUZAMEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210370548.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-04-10
Publication Date
2024-11-12
Estimated Expiration
2042-04-10

AI Technical Summary

Technical Problem

The existing NFT auction plan is difficult to ensure complete privacy of other information except for the auction amount during the auction process.

Method used

Configure zero-knowledge proof circuits on the blockchain to verify the legality of information such as the identity, hash ID, and costable checks in addition to the auction amount, and ensure that the paid accounts, spending amounts, and change amounts are additionally paid in addition to the auction amount during the transaction process. All information is completely private.

Benefits of technology

This achieves the NFT privacy auction with complete privacy of other information except for the auction amount during the auction process, ensuring the anonymity and information security of the seller and the bidder.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114817952B_ABST
    Figure CN114817952B_ABST
Patent Text Reader

Abstract

The present invention provides an NFT privacy auction method, computer equipment and storage medium, the method comprising: executing a first NFT anonymous auction sale transaction: inputting a first hash ID and a first proof information into a first verification algorithm; after verification, recording the anonymous auction information on a chain; executing a first NFT anonymous auction bidding transaction: inputting a second hash ID and a second proof information into a second verification algorithm; inputting a first encrypted amount and a third proof information into a third verification algorithm; inputting a second encrypted amount and a fourth proof information into a fourth verification algorithm; verifying whether the difference between the first and second encrypted amounts is equal to the product of the first bid and the first ellipse base point; after verification, adding a first bid; executing a first NFT anonymous auction collection transaction: inputting information such as the fifth proof information into a fifth verification algorithm; after verification, invalidating the expendable check for payment, validating the expendable check for change and collection, and updating the owner of the first NFT. The present invention realizes the privacy NFT auction.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of blockchain technology, and specifically to an NFT privacy auction method, computer equipment and storage medium. Background Art

[0002] The full name of NFT in English is Non-Fungible Token, that is, non-fungible token, which has the characteristics of indivisibility, irreplaceability and uniqueness.

[0003] Correspondingly, a homogeneous token is a token where each token is exactly the same, for example, one game coin and another game coin are exactly the same and there is no difference between them;

[0004] The current application of NFT is that each unique NFT can be used as an ownership mark of a unique digital asset. For example, NFT1 is used as an ownership mark of a digital avatar, NFT2 is used as an ownership mark of a virtual cat in a game, and so on.

[0005] The current NFT auction scheme makes it difficult to achieve an auction that ensures complete privacy of all information except the public bidding amount. Summary of the invention

[0006] In view of the above-mentioned defects or deficiencies in the prior art, it is desired to provide an NFT privacy auction method, computer equipment and storage medium that ensures complete privacy of information other than the auction amount during the auction process.

[0007] In a first aspect, the present invention provides an NFT privacy auction method applicable to a blockchain node, wherein the blockchain is deployed with an NFT privacy auction contract, and the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the valid expendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated expendable check of the change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated expendable check received by the seller, the method comprising:

[0008] Execute the first NFT anonymous auction sale transaction:

[0009] Inputting the first hash ID and the first proof information of the first NFT to be auctioned into the verification algorithm of the first zero-knowledge proof circuit for verification;

[0010] Verify the legitimacy of the first hash value and the auction deadline submitted by the first NFT anonymous auction selling exchange respectively; wherein the first hash value is the hash value of the first random number;

[0011] If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain;

[0012] Execute the first NFT anonymous auction transaction:

[0013] Verify whether the current time is earlier than the auction deadline, and the legitimacy of the first bid submitted by the first NFT anonymous auction bidding exchange;

[0014] Inputting the unvalidated second hash ID and second proof information of the first NFT into the verification algorithm of the second zero-knowledge proof circuit for verification;

[0015] Inputting the first encrypted amount and the third proof information into a verification algorithm of a third zero-knowledge proof circuit for verification; wherein the private input for generating the third proof information includes a third hash ID of the first validated spendable check used for payment;

[0016] Inputting the second encrypted amount and the fourth proof information into a verification algorithm of a fourth zero-knowledge proof circuit for verification; wherein the private input for generating the fourth proof information includes a fourth hash ID of the unvalidated second spendable check used for change;

[0017] Verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and the first ellipse base point;

[0018] If any verification fails, the first NFT anonymous auction transaction will fail.

[0019] If all verifications are passed, the first bid will be added to the anonymous auction information;

[0020] Execute the first NFT anonymous auction payment transaction:

[0021] Verify whether the current time is later than the auction deadline;

[0022] Inputting the first hash value, the second bid that won the auction, the fifth hash ID of the unvalidated third spendable check to be collected, and the fifth proof information into the verification algorithm of the fifth zero-knowledge proof circuit for verification; wherein the private input of the fifth proof information includes the first random number;

[0023] If any verification fails, the first NFT anonymous auction payment transaction will fail;

[0024] If all verifications are passed, the spendable check for payment corresponding to the second bid will be invalidated, the spendable check for change corresponding to the second bid and the third spendable check will be valid, and the owner of the first NFT will be updated to the hash ID of the first NFT corresponding to the second bid.

[0025] Wherein, the first encrypted amount E1 = amount1*G+r*H;

[0026] The second encrypted amount E2 = amount2*G+r*H;

[0027] amount1 is the amount of the first spendable check, amount2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.

[0028] In a second aspect, the present invention provides an NFT privacy auction method applicable to a user end of a seller, wherein a blockchain is deployed with an NFT privacy auction contract, and the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the valid expendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated expendable check of the change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated expendable check received by the seller, the method comprising:

[0029] Generate first proof information according to a first proof algorithm of the first zero-knowledge proof circuit; wherein the public input of the first proof algorithm includes a first hash ID of the first NFT to be auctioned, and the private input of the first proof algorithm includes a first address and a first private key of an owner of the first NFT;

[0030] Calculating a hash value of the first random number to obtain a first hash value;

[0031] The first NFT anonymous auction sale transaction including the first hash ID, the first proof information, the first hash value and the auction deadline is packaged and generated and sent to the blockchain network for execution by the blockchain node:

[0032] Inputting the first hash ID and the first proof information into a verification algorithm of a first zero-knowledge proof circuit for verification;

[0033] Verify the legitimacy of the first hash value and the auction deadline respectively;

[0034] If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain;

[0035] In response to the auction closing, obtaining a second bid that won the auction;

[0036] Generate fifth proof information according to a fifth proof algorithm of a fifth zero-knowledge proof circuit; wherein the public input of the fifth proof algorithm includes the first hash value, the second bid, and the fifth hash ID of the unvalidated third spendable check to be received, and the private input of the fifth proof algorithm includes the first address and the first random number;

[0037] The first NFT anonymous auction payment transaction including the first hash value, the second bid, the fifth hash ID and the fifth proof information is packaged and generated and sent to the blockchain network for execution by the blockchain node:

[0038] Verify whether the current time is later than the auction deadline;

[0039] Inputting the first hash value, the second bid, the fifth hash ID, and the fifth proof information into a verification algorithm of a fifth zero-knowledge proof circuit for verification;

[0040] If any verification fails, the first NFT anonymous auction payment transaction will fail;

[0041] If all verifications are passed, the spendable check for payment corresponding to the second bid will be invalidated, the spendable check for change corresponding to the second bid and the third spendable check will be valid, and the owner of the first NFT will be updated to the hash ID of the first NFT corresponding to the second bid.

[0042] Among them, the blockchain node is also configured to execute the first NFT anonymous auction bidding transaction:

[0043] Verify whether the current time is earlier than the auction deadline, and the legitimacy of the first bid submitted by the first NFT anonymous auction bidding exchange;

[0044] Inputting the unvalidated second hash ID and second proof information of the first NFT into the verification algorithm of the second zero-knowledge proof circuit for verification;

[0045] Inputting the first encrypted amount and the third proof information into a verification algorithm of a third zero-knowledge proof circuit for verification;

[0046] Inputting the second encrypted amount and the fourth proof information into a verification algorithm of a fourth zero-knowledge proof circuit for verification;

[0047] Verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and the first ellipse base point;

[0048] If any verification fails, the first NFT anonymous auction transaction will fail.

[0049] If all verifications are passed, the first bid will be added to the anonymous auction information;

[0050] The private input for generating the third proof information includes a third hash ID of the validated first spendable check for payment, and the private input for generating the fourth proof information includes a fourth hash ID of the unvalidated second spendable check for change;

[0051] Wherein, the first encrypted amount E1 = amount1*G+r*H;

[0052] The second encrypted amount E2 = amount2*G+r*H;

[0053] amount1 is the amount of the first spendable check, amount2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.

[0054] In a third aspect, the present invention also provides an NFT privacy auction method applicable to a user end of a bidder, wherein a blockchain is deployed with an NFT privacy auction contract, and the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the valid expendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated expendable check submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated expendable check received by the seller, the method comprising:

[0055] Generate second proof information according to a second proof algorithm of the second zero-knowledge proof circuit; wherein the public input of the second proof algorithm includes an unvalidated second hash ID of the first NFT being auctioned, and the private input of the second proof algorithm includes a second address of the current bidder;

[0056] Generate third proof information according to a third proof algorithm of a third zero-knowledge proof circuit; wherein the public input of the third proof algorithm includes the first encrypted amount, and the private input of the third proof algorithm includes the third hash ID of the first spendable check that has been validated for payment, the second address and the second private key of the current bidder, and the amount of the first spendable check;

[0057] Generate fourth proof information according to a fourth proof algorithm of a fourth zero-knowledge proof circuit; wherein the public input of the fourth proof algorithm includes the second encrypted amount, and the private input of the fourth proof algorithm includes a fourth hash ID of an unvalidated second spendable check for change, the second address, and the amount of the second spendable check;

[0058] The first NFT anonymous auction bidding transaction including the current bidder's first bid for the first NFT, the second hash ID, the second proof information, the first encrypted amount, the third proof information, the second encrypted amount, and the fourth proof information is packaged and generated and sent to the blockchain network for execution by the blockchain node:

[0059] Verify whether the current time is earlier than the auction deadline, and the legitimacy of the first bid;

[0060] Inputting the second hash ID and the second proof information into a verification algorithm of a second zero-knowledge proof circuit for verification;

[0061] Inputting the first encrypted amount and the third proof information into a verification algorithm of a third zero-knowledge proof circuit for verification;

[0062] Inputting the second encrypted amount and the fourth proof information into a verification algorithm of a fourth zero-knowledge proof circuit for verification;

[0063] Verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and the first ellipse base point;

[0064] If any verification fails, the first NFT anonymous auction transaction will fail.

[0065] If all verifications are passed, the first bid will be added to the anonymous auction information of the first NFT.

[0066] Wherein, the first encrypted amount E1 = amount1*G+r*H;

[0067] The second encrypted amount E2 = amount2*G+r*H;

[0068] amount1 is the amount of the first spendable check, amount2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point;

[0069] The blockchain node is also configured to execute the first NFT anonymous auction sale transaction:

[0070] Inputting the first hash ID and the first proof information of the first NFT into the verification algorithm of the first zero-knowledge proof circuit for verification;

[0071] Verify the legitimacy of the first hash value and the auction deadline submitted by the first NFT anonymous auction selling exchange respectively; wherein the first hash value is the hash value of the first random number;

[0072] If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain;

[0073] The blockchain node is also configured to execute the first NFT anonymous auction payment transaction:

[0074] Verify whether the current time is later than the auction deadline;

[0075] Inputting the first hash value, the second bid that won the auction, the fifth hash ID of the unvalidated third spendable check to be collected, and the fifth proof information into the verification algorithm of the fifth zero-knowledge proof circuit for verification; wherein the private input of the fifth proof information includes the first random number;

[0076] If any verification fails, the first NFT anonymous auction payment transaction will fail;

[0077] If all verifications are passed, the spendable check for payment corresponding to the second bid will be invalidated, the spendable check for change corresponding to the second bid and the third spendable check will be valid, and the owner of the first NFT will be updated to the hash ID of the first NFT corresponding to the second bid.

[0078] In a fourth aspect, the present invention also provides a computer device comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors so that the one or more processors execute the NFT privacy auction method provided according to various embodiments of the present invention.

[0079] In the fifth aspect, the present invention also provides a storage medium storing a computer program, which enables a computer to execute the NFT privacy auction method provided according to various embodiments of the present invention.

[0080] The NFT privacy auction method, computer device and storage medium provided by many embodiments of the present invention ensure that the seller can anonymously place an order for auction by configuring a first zero-knowledge proof circuit on the blockchain to verify whether the seller is the owner of the NFT; by configuring a second zero-knowledge proof circuit to verify the legitimacy of the new hash ID provided by the buyer, it is ensured that the bidder can participate in the auction anonymously; by configuring a third / fourth zero-knowledge proof circuit and designing a specific first encrypted amount and a second encrypted amount therein, the payment account, spending amount, change amount and other information other than the bid amount are completely private during the transaction process; by submitting the first hash value in the first NFT anonymous auction sale transaction and configuring the fifth zero-knowledge proof circuit to verify the fifth proof information generated according to the first random number, it is ensured that the seller can collect the payment anonymously after the auction ends; finally, an NFT privacy auction method is realized that ensures the complete privacy of other information except the bid amount during the auction. BRIEF DESCRIPTION OF THE DRAWINGS

[0081] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:

[0082] Figure 1 A flowchart of an NFT privacy auction method provided for one embodiment of the present invention.

[0083] Figure 2 A flowchart of another NFT privacy transaction method provided for an embodiment of the present invention.

[0084] Figure 3 A flowchart of another NFT privacy transaction method provided for an embodiment of the present invention.

[0085] Figure 4 A schematic diagram of the structure of a computer device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0086] The present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It is also necessary to explain that, for ease of description, only the parts related to the invention are shown in the accompanying drawings.

[0087] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0088] Figure 1 A flowchart of an NFT privacy auction method provided for one embodiment of the present invention.

[0089] like Figure 1 As shown, in this embodiment, the present invention provides an NFT privacy auction method applicable to blockchain nodes, the blockchain is deployed with an NFT privacy auction contract, the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the valid spendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated spendable check of the change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated spendable check received by the seller, the method comprising:

[0090] S11: Execute the first NFT anonymous auction sale transaction:

[0091] S111: inputting the first hash ID and the first proof information of the first NFT to be auctioned into the verification algorithm of the first zero-knowledge proof circuit for verification;

[0092] S113: Verify the legitimacy of the first hash value and the auction deadline submitted by the first NFT anonymous auction selling exchange respectively; wherein the first hash value is the hash value of the first random number;

[0093] If all verifications are passed, step S115 is executed: the anonymous auction information of the first NFT is recorded on the blockchain for the bidder's device to obtain;

[0094] S13: Execute the first NFT anonymous auction transaction:

[0095] S131: Verify whether the current time is earlier than the auction deadline, and the legitimacy of the first bid submitted by the first NFT anonymous auction bidding exchange;

[0096] S132: Inputting the unvalidated second hash ID and second proof information of the first NFT into the verification algorithm of the second zero-knowledge proof circuit for verification;

[0097] S133: Inputting the first encrypted amount and the third proof information into a verification algorithm of a third zero-knowledge proof circuit for verification; wherein the private input for generating the third proof information includes a third hash ID of the first valid spendable check used for payment;

[0098] S134: Inputting the second encrypted amount and the fourth proof information into a verification algorithm of a fourth zero-knowledge proof circuit for verification; wherein the private input for generating the fourth proof information includes a fourth hash ID of the unvalidated second spendable check used for change;

[0099] S135: Verify whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and the first ellipse base point;

[0100] If any verification fails, the first NFT anonymous auction transaction will fail.

[0101] If all verifications are passed, step S136 is executed: adding the first bid to the anonymous auction information;

[0102] S15: Execute the first NFT anonymous auction payment transaction:

[0103] S151: Verify whether the current time is later than the auction deadline;

[0104] S153: inputting the first hash value, the second bid that won the auction, the fifth hash ID of the unvalidated third spendable check to be collected, and the fifth proof information into the verification algorithm of the fifth zero-knowledge proof circuit for verification; wherein the private input of the fifth proof information includes the first random number;

[0105] If any verification fails, the first NFT anonymous auction payment transaction will fail;

[0106] If all verifications are passed, execute step S155: invalidate the expendable check for payment corresponding to the second bid, validate the expendable check for change and the third expendable check corresponding to the second bid, and update the owner of the first NFT to the hash ID of the first NFT corresponding to the second bid.

[0107] Wherein, the first encrypted amount E1 = amount1*G+r*H;

[0108] The second encrypted amount E2 = amount2*G+r*H;

[0109] amount1 is the amount of the first spendable check, amount2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.

[0110] In this application, the verification principles of each zero-knowledge proof circuit are:

[0111] 1. The first zero-knowledge proof circuit is verified based on the following principles:

[0112] HashID1=hash(ownerAddr+r1);

[0113] ownerAddr=Addr(Pub(ownerPrivateKey));

[0114] Among them, HashID1 is the first hash ID, ownerAddr is the first address of the owner of the first NFT, r1 is a random number, ownerPrivateKey is the first private key of the owner of the first NFT, Pub() is the algorithm for generating the public key based on the private key, Addr() is the algorithm for generating the address based on the public key, and hash() is the hash algorithm.

[0115] Among them, those skilled in the art can understand that the random number r1 can be replaced with other (undisclosed) information to achieve the same technical effect.

[0116] 2. The second zero-knowledge proof circuit is verified based on the following principles:

[0117] HashID2=hash(buyerAddr+r2);

[0118] Among them, HashID2 is the second hash ID, buyerAddr is the second address of the bidder, and r2 is a random number. Those skilled in the art can understand that the random number r2 can be replaced with other (undisclosed) information to achieve the same technical effect.

[0119] 3. The third zero-knowledge proof circuit is verified based on the following principles:

[0120] HashID3=hash(buyerAddr+amount1+r3);

[0121] buyerAddr=Addr(Pub(buyerPrivateKey));

[0122] HashID3*merkle_path=merkle_root;

[0123] Among them, HashID3 is the third hash ID, amount1 is the amount of the first spendable check, r3 is a random number, buyerPrivateKey is the second private key of the bidder, merkle_path is the Merkle path corresponding to the first spendable check in the spendable check Merkle tree, and merkle_root is the root of the spendable check Merkle tree.

[0124] Specifically, in this embodiment, the blockchain marks whether the expendable check is valid by recording the hash ID of the valid expendable check into the expendable Merkle tree. The expendable check whose hash ID is not in the expendable Merkle tree is not valid. There is also an invalid Merkle tree for marking that the expendable check has been used and invalidated, which will not be elaborated in detail.

[0125] Those skilled in the art will appreciate that when in other embodiments the blockchain uses other methods commonly used in the art to mark whether a spendable check is valid, the validity of the spendable check can be verified by a corresponding verification method (rather than the above-mentioned verification method of verifying with the Merkle path / tree root).

[0126] Those skilled in the art can also understand that buyerAddr can be replaced with the corresponding public key and other information, and r3 can be replaced with other (undisclosed) information to achieve the same technical effect.

[0127] 4. The fourth zero-knowledge proof circuit is verified based on the following principles:

[0128] HashID4=hash(buyerAddr+amount2+r4);

[0129] buyerAddr=Addr(Pub(buyerPrivateKey));

[0130] Among them, HashID4 is the fourth hash ID, amount2 is the amount of the second spendable check, and r4 is a random number.

[0131] Those skilled in the art can also understand that buyerAddr can be replaced with the corresponding public key and other information, and r4 can be replaced with other (undisclosed) information to achieve the same technical effect.

[0132] 5. The fifth zero-knowledge proof circuit is verified based on the following principles:

[0133] Hash0 = hash(r0);

[0134] HashID5=hash(ownerAddr+bid2+r5);

[0135] Among them, Hash0 is the first hash value, r0 is the first random number, HashID5 is the fifth hash ID, bid2 is the second bid that wins the auction, and r5 is a random number.

[0136] Those skilled in the art can also understand that r5 can be replaced with other (undisclosed) information to achieve the same technical effect.

[0137] Those skilled in the art can understand how to generate a zero-knowledge proof circuit according to the above verification principle in a zero-knowledge proof system, as well as:

[0138] The generated first zero-knowledge proof circuit includes a first proof algorithm Prove1(), a first verification algorithm Verify1(), and may also include a first generation algorithm Setup1();

[0139] The generated second zero-knowledge proof circuit includes a second proof algorithm Prove2(), a second verification algorithm Verify2(), and may also include a second generation algorithm Setup2();

[0140] The generated third zero-knowledge proof circuit includes a third proof algorithm Prove3(), a third verification algorithm Verify3(), and may also include a third generation algorithm Setup3();

[0141] The generated fourth zero-knowledge proof circuit includes a fourth proof algorithm Prove4(), a fourth verification algorithm Verify4(), and may also include a fourth generation algorithm Setup4();

[0142] The generated fifth zero-knowledge proof circuit includes a fifth proof algorithm Prove5(), a fifth verification algorithm Verify5(), and may also include a fifth generation algorithm Setup5();

[0143] The specific process will not be described here.

[0144] In the following example, user A sells NFT3 by auction, user B / C and other users participate in the auction of NFT3, and the blockchain is Figure 1 Take the privacy auction method shown in the figure as an example. Figure 1 An exemplary description is given.

[0145] When user A wants to sell NFT3 by auction, user A's client uses the hash ID of NFT3. NFT3 ) as the public input of the first proof algorithm Prove1(), and use the first address Addr1, the first private key p1, and the random number r1 as the private input of the first proof algorithm Prove1() to generate the first proof information prove1:

[0146] Prove1(HashID NFT3 , Addr1, p1, r1)→prove1;

[0147] At the same time, a first random number r0 is generated, and a hash value of r0 is calculated to obtain a first hash value Hash0=hash(r0);

[0148] Then package and generate including HashID NFT3 , prove1, Hash0 and the first NFT anonymous auction sale transaction tx1 at the auction deadline and send it to the blockchain network.

[0149] In step S11, the blockchain node executes tx1:

[0150] In step S111, the first hash ID (HashID NFT3 ) and the first proof information prove1 are input into the verification algorithm Verify1() of the first zero-knowledge proof circuit for verification:

[0151] Verify1(HashID NFT3 , prove1)→Yes / No;

[0152] When the output result of the first verification algorithm Verify1() is No, the verification fails and tx1 execution fails;

[0153] In step S113, verify whether the first hash value Hash0 submitted by tx1 is a legal hash value, and verify whether the auction deadline submitted by tx1 is legal: if any verification fails, tx1 execution fails;

[0154] If all verifications of steps S111 and S113 are passed, step S115 is executed to record the anonymous auction information of NFT3 on the blockchain for the bidder's device to obtain. Specifically, the anonymous auction information may only include the information of NFT3 and the auction deadline, or may further include any one or more auction-related information that can be understood by those skilled in the art, such as the starting price and the minimum bid increase amount.

[0155] When multiple users such as User B / C see the anonymous auction information of NFT3 and decide to participate in the auction, take User B's participation in the auction as an example:

[0156] User B's client first constructs a new, unvalidated hash ID for NFT3 based on User B's address Addr2:

[0157] HashID NFT3_new = hash(Addr2+r2);

[0158] And with the newly constructed hash ID (HashID NFT3_new ) as the public input of the second proof algorithm Prove2(), and use the second address Addr2 and the random number r2 as the private input of the second proof algorithm Prove2() to generate the second proof information prove2:

[0159] Prove2(HashID NFT3_new , Addr2, r2)→prove2;

[0160] Then obtain the reserve price and the latest bid (may be none, or only the reserve price or only the latest bid, and may also include the minimum bid increment) of the anonymous auction information record of NFT3, so that User B can set a legal first bid, bid1;

[0161] Then search for a spendable check (valid and not invalidated) owned by user B with an amount not less than the first bid bid1 (Note: payment is made through one spendable check as an example here, and in more embodiments, payment can also be made through multiple spendable checks with amounts less than the first bid bid1 and a total amount not less than the first bid bid1). For example, if a first spendable check with an amount of m1 is found, the change amount m1-bid1 (i.e., the amount of the second spendable check) is determined according to the amount m1 of the first spendable check and the first bid bid1, and a first encrypted amount E1 and a second encrypted amount E2 are generated respectively:

[0162] E1=m1*G+r*H;

[0163] E2=(m1-bid1)*G+r*H;

[0164] Take the merkle_root of the spendable check Merkle tree of the first spendable check and the invalid hash of the first spendable check void , the first encrypted amount E1 is used as the public input of the third proof algorithm Prove3(), with the hash ID (HashID Check1 ), the Merkle path merkle_path corresponding to the first spendable check in the spendable check Merkle tree, the second address Addr2, the random number r, the second private key p2, the amount m1 of the first spendable check, and the random number r3 are used as the private input of the third proof algorithm Prove3() to generate the third proof information prove3:

[0165] Prove3(merkle_root, hash void 、E1,HashID Check1 , merkle_path, Addr2, r, m1, r3)→prove3;

[0166] Generate the fourth hash ID of the unvalidated second spendable check to be changed based on the second address Addr2, the change amount m1-bid1, and the random number r4:

[0167] HashID Check2 =hash(Addr2+(m1-bid1)+r4);

[0168] Then use the fourth hash ID (HashID Check2 ), the second encrypted amount E2 is used as the public input of the fourth proof algorithm Prove4(), and the second address Addr2, the change amount m1-bid1, the random number r, and the random number r4 are used as the private input of the fourth proof algorithm Prove4() to generate the fourth proof information prove4:

[0169] Prove4(HashID Check2 , E2, Addr2, m1-bid1, r, r4)→prove4;

[0170] The final package includes the first bid bid1, the second hash ID (HashID NFT3_new ), second proof information prove2, merkle_root, hash void , first encrypted amount E1, third proof information prove3, HashID Check2, the second encrypted amount E2, and the fourth proof information prove4 are used to complete the first NFT anonymous auction bidding transaction tx2 and sent to the blockchain network.

[0171] In step S13, the blockchain node executes tx2:

[0172] In step S131, verify whether the current time is earlier than the auction deadline, and the legality of the first bid bid1 submitted by tx2 (the first bid should be greater than the latest bid recorded in the anonymous auction information, if a minimum bid increase amount is set, the increase between the first bid and the latest bid should not be less than the minimum bid increase amount, etc.): if any verification fails, tx2 fails to execute;

[0173] In step S132, the unvalidated second hash ID (HashID NFT3_new ) and the second proof information prove2 are input into the verification algorithm of the second zero-knowledge proof circuit for verification:

[0174] Verify2(HashID NFT3_new , prove2)→Yes / No;

[0175] When the output result of the second verification algorithm Verify2() is No, the verification fails and tx2 execution fails;

[0176] In step S133, merkle_root, hash void , E1 and prove3 are input into the verification algorithm of the third zero-knowledge proof circuit for verification:

[0177] Verify3(merkle_root, hash void 、E1,prove3)→Yes / No;

[0178] When the output result of the third verification algorithm Verify3() is No, the verification fails and tx2 execution fails;

[0179] In step S134, HashID Check2 , the second encrypted amount E2, and the fourth proof information prove4 are input into the verification algorithm of the fourth zero-knowledge proof circuit for verification:

[0180] Verify4(HashID Check2 、E2,prove4)→Yes / No;

[0181] When the output result of the fourth verification algorithm Verify4() is No, the verification fails and tx2 execution fails;

[0182] In step S135, it is verified whether the difference between the first encrypted amount E1 and the second encrypted amount E2 is equal to the product of the first bid bid1 and the first ellipse base point G: if not, the verification fails and tx2 execution fails;

[0183] When all the verifications of steps S131-S135 are passed, execute step S136 and add the first bid bid1 to the anonymous auction information of NFT3.

[0184] The process of User C and other users participating in the auction is similar to the process of User B participating in the auction mentioned above, and will not be repeated here.

[0185] When the time reaches the auction deadline, the auction ends, and the latest (and highest) bid recorded in the anonymous auction information of NFT3 is the second bid bid2 that wins the auction.

[0186] After user A's client obtains the second bid bid2, it generates the fifth hash ID of the unvalidated third spendable check to be received based on the first address Addr1, the second bid bid2, and the random number r5:

[0187] HashID Check3 = hash(Addr1+bid2+r5);

[0188] With the fifth hash ID (HashID Check3 ), the second bid bid2, and the first hash value hash0 are used as the public input of the fifth proof algorithm Prove5(), and the first address Addr1, the first random number r0, and the random number r5 are used as the private input of the fifth proof algorithm Prove5() to generate the fifth proof information prove5:

[0189] Prove5(HashID Check3 , bid2, hash0, Addr1, r0, r5)→prove5;

[0190] Then package and generate the first hash value hash0, the second bid bid2, and the fifth hash ID (HashID Check3 ) and the first NFT anonymous auction payment transaction tx3 of the fifth proof information prove5 and send it to the blockchain network.

[0191] In step S15, the blockchain node executes tx3:

[0192] In step S151, verify whether the current time is later than the auction deadline: if not, tx3 execution fails;

[0193] In step S153, the first hash value hash0, the second bid bid2, and the fifth hash ID (HashIDCheck3 ) and the fifth proof information prove5 are input into the verification algorithm of the fifth zero-knowledge proof circuit for verification:

[0194] Verify5(HashID Check3 , bid2, hash0, prove5)→Yes / No;

[0195] When the output result of the fifth verification algorithm Verify5() is No, the verification fails and tx3 execution fails;

[0196] When all the verifications of steps S151 and S153 are passed, step S155 is executed to invalidate the spendable check for payment corresponding to the second bid bid2, validate the spendable check for change and the third spendable check corresponding to the second bid, and update the owner of the first NFT to the hash ID of the first NFT corresponding to the second bid.

[0197] In the above example, only the amounts of the bids are public during the transaction.

[0198] The above embodiment ensures that the seller can anonymously place an order for auction by configuring a first zero-knowledge proof circuit on the blockchain to verify whether the seller is the owner of the NFT; ensures that bidders can participate in the auction anonymously by configuring a second zero-knowledge proof circuit to verify the legitimacy of the new hash ID provided by the buyer; ensures that the information such as the payment account, the amount spent, the change amount, etc. other than the bid amount is completely private during the transaction by configuring the third / fourth zero-knowledge proof circuit and designing a specific first encrypted amount and a second encrypted amount therein; ensures that the seller can anonymously collect payment after the auction ends by submitting the first hash value in the first NFT anonymous auction sale transaction and configuring the fifth zero-knowledge proof circuit to verify the fifth proof information generated according to the first random number; finally, an NFT privacy auction method is implemented that ensures that all information other than the bid amount is completely private during the auction.

[0199] Figure 2 A flowchart of another NFT privacy transaction method provided for an embodiment of the present invention. Figure 2 The method shown can be used with Figure 1 The method shown is executed.

[0200] like Figure 2As shown, in this embodiment, the present invention also provides an NFT privacy auction method applicable to the user end of the seller, the blockchain is deployed with an NFT privacy auction contract, the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the valid spendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated spendable check of the change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated spendable check received by the seller, the method comprising:

[0201] S21: Generate first proof information according to a first proof algorithm of the first zero-knowledge proof circuit; wherein the public input of the first proof algorithm includes the first hash ID of the first NFT to be auctioned, and the private input of the first proof algorithm includes the first address and the first private key of the owner of the first NFT;

[0202] S22: Calculate a hash value of the first random number to obtain a first hash value;

[0203] S23: Packaging and generating the first NFT anonymous auction sale transaction including the first hash ID, the first proof information, the first hash value and the auction deadline and sending it to the blockchain network for execution by the blockchain node:

[0204] Inputting the first hash ID and the first proof information into a verification algorithm of a first zero-knowledge proof circuit for verification;

[0205] Verify the legitimacy of the first hash value and the auction deadline respectively;

[0206] If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain;

[0207] S24: In response to the auction closing, obtaining a second bid that wins the auction;

[0208] S25: generating fifth proof information according to a fifth proof algorithm of the fifth zero-knowledge proof circuit; wherein the public input of the fifth proof algorithm includes the first hash value, the second bid, and the fifth hash ID of the unvalidated third spendable check to be received, and the private input of the fifth proof algorithm includes the first address and the first random number;

[0209] S26: Packaging and generating the first NFT anonymous auction payment transaction including the first hash value, the second bid, the fifth hash ID and the fifth proof information and sending it to the blockchain network for execution by the blockchain node:

[0210] Verify whether the current time is later than the auction deadline;

[0211] Inputting the first hash value, the second bid, the fifth hash ID, and the fifth proof information into a verification algorithm of a fifth zero-knowledge proof circuit for verification;

[0212] If any verification fails, the first NFT anonymous auction payment transaction will fail;

[0213] If all verifications are passed, the spendable check for payment corresponding to the second bid will be invalidated, the spendable check for change corresponding to the second bid and the third spendable check will be valid, and the owner of the first NFT will be updated to the hash ID of the first NFT corresponding to the second bid.

[0214] Among them, the blockchain node is also configured to execute the first NFT anonymous auction bidding transaction:

[0215] Verify whether the current time is earlier than the auction deadline, and the legitimacy of the first bid submitted by the first NFT anonymous auction bidding exchange;

[0216] Inputting the unvalidated second hash ID and second proof information of the first NFT into the verification algorithm of the second zero-knowledge proof circuit for verification;

[0217] Inputting the first encrypted amount and the third proof information into a verification algorithm of a third zero-knowledge proof circuit for verification;

[0218] Inputting the second encrypted amount and the fourth proof information into a verification algorithm of a fourth zero-knowledge proof circuit for verification;

[0219] Verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and the first ellipse base point;

[0220] If any verification fails, the first NFT anonymous auction transaction will fail.

[0221] If all verifications are passed, the first bid will be added to the anonymous auction information;

[0222] The private input for generating the third proof information includes a third hash ID of the validated first spendable check for payment, and the private input for generating the fourth proof information includes a fourth hash ID of the unvalidated second spendable check for change;

[0223] Wherein, the first encrypted amount E1 = amount1*G+r*H;

[0224] The second encrypted amount E2 = amount2*G+r*H;

[0225] amount1 is the amount of the first spendable check, amount2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.

[0226] Figure 2 The trading principle of the method shown can be found in Figure 1 The method shown here will not be described in detail.

[0227] Figure 3 A flowchart of another NFT privacy transaction method provided for an embodiment of the present invention. Figure 3 The method shown can be used with Figure 1 , 2 The method shown is executed.

[0228] like Figure 3 As shown, in this embodiment, the present invention also provides an NFT privacy auction method applicable to the user end of the bidder, the blockchain is deployed with an NFT privacy auction contract, the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the valid spendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated spendable check of the change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated spendable check received by the seller, the method comprising:

[0229] S31: Generate second proof information according to a second proof algorithm of the second zero-knowledge proof circuit; wherein the public input of the second proof algorithm includes the unvalidated second hash ID of the first NFT being auctioned, and the private input of the second proof algorithm includes the second address of the current bidder;

[0230] S33: Generate third proof information according to a third proof algorithm of the third zero-knowledge proof circuit; wherein the public input of the third proof algorithm includes the first encrypted amount, and the private input of the third proof algorithm includes the third hash ID of the first spendable check that has been validated for payment, the second address and the second private key of the current bidder, and the amount of the first spendable check;

[0231] S35: Generate fourth proof information according to a fourth proof algorithm of a fourth zero-knowledge proof circuit; wherein the public input of the fourth proof algorithm includes the second encrypted amount, and the private input of the fourth proof algorithm includes the fourth hash ID of the unvalidated second spendable check for change, the second address, and the amount of the second spendable check;

[0232] S37: Packaging and generating the first NFT anonymous auction bidding transaction including the current bidder's first bid for the first NFT, the second hash ID, the second proof information, the first encrypted amount, the third proof information, the second encrypted amount, and the fourth proof information and sending it to the blockchain network for execution by the blockchain node:

[0233] Verify whether the current time is earlier than the auction deadline, and the legitimacy of the first bid;

[0234] Inputting the second hash ID and the second proof information into a verification algorithm of a second zero-knowledge proof circuit for verification;

[0235] Inputting the first encrypted amount and the third proof information into a verification algorithm of a third zero-knowledge proof circuit for verification;

[0236] Inputting the second encrypted amount and the fourth proof information into a verification algorithm of a fourth zero-knowledge proof circuit for verification;

[0237] Verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and the first ellipse base point;

[0238] If any verification fails, the first NFT anonymous auction transaction will fail.

[0239] If all verifications are passed, the first bid will be added to the anonymous auction information of the first NFT.

[0240] Wherein, the first encrypted amount E1 = amount1*G+r*H;

[0241] The second encrypted amount E2 = amount2*G+r*H;

[0242] amount1 is the amount of the first spendable check, amount2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point;

[0243] The blockchain node is also configured to execute the first NFT anonymous auction sale transaction:

[0244] Inputting the first hash ID and the first proof information of the first NFT into the verification algorithm of the first zero-knowledge proof circuit for verification;

[0245] Verify the legitimacy of the first hash value and the auction deadline submitted by the anonymous auction selling exchange of the first NFT respectively; wherein the first hash value is the hash value of the first random number; if all verifications are passed, the anonymous auction information of the first NFT is recorded on the blockchain for the bidder's device to obtain;

[0246] The blockchain node is also configured to execute the first NFT anonymous auction payment transaction:

[0247] Verify whether the current time is later than the auction deadline;

[0248] Inputting the first hash value, the second bid that won the auction, the fifth hash ID of the unvalidated third spendable check to be collected, and the fifth proof information into the verification algorithm of the fifth zero-knowledge proof circuit for verification; wherein the private input of the fifth proof information includes the first random number;

[0249] If any verification fails, the first NFT anonymous auction payment transaction will fail;

[0250] If all verifications are passed, the spendable check for payment corresponding to the second bid will be invalidated, the spendable check for change corresponding to the second bid and the third spendable check will be valid, and the owner of the first NFT will be updated to the hash ID of the first NFT corresponding to the second bid.

[0251] Figure 3 The trading principle of the method shown can also be referred to Figure 1 The method shown here will not be described in detail.

[0252] Figure 4 A schematic diagram of the structure of a computer device provided by an embodiment of the present invention.

[0253] like Figure 4 As shown, as another aspect, the present application also provides a computer device, including one or more central processing units (CPU) 401, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 402 or the program loaded from the storage part 408 to the random access memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the device 400 are also stored. The CPU 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input / output (I / O) interface 405 is also connected to the bus 404.

[0254] The following components are connected to the I / O interface 405: an input section 406 including a keyboard, a mouse, etc.; an output section 407 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 408 including a hard disk, etc.; and a communication section 409 including a network interface card such as a LAN card, a modem, etc. The communication section 409 performs communication processing via a network such as the Internet. A drive 410 is also connected to the I / O interface 405 as needed. A removable medium 411, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 410 as needed, so that a computer program read therefrom is installed into the storage section 408 as needed.

[0255] In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program tangibly contained on a machine-readable medium, and the computer program includes a program code for executing any of the above methods. In such an embodiment, the computer program can be downloaded and installed from a network through the communication part 409, and / or installed from the removable medium 411.

[0256] As another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium included in the apparatus of the above embodiment; or a computer-readable storage medium that exists independently and is not assembled into the device. The computer-readable storage medium stores one or more programs, which are used by one or more processors to execute the method described in the present application.

[0257] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be realized by a dedicated hardware-based system that performs a specified function or operation, or can be realized by a combination of dedicated hardware and computer instructions.

[0258] The units or modules involved in the embodiments described in the present application may be implemented by software or by hardware. The units or modules described may also be provided in a processor. For example, each unit may be a software program provided in a computer or a mobile smart device, or may be a separately configured hardware device. The names of these units or modules do not, in some cases, constitute limitations on the units or modules themselves.

[0259] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the concept of the present application. For example, the above features are replaced with (but not limited to) technical features with similar functions disclosed in the present application.

Claims

1. A method for NFT privacy auction, It is characterized in that The blockchain is deployed with an NFT privacy auction contract, and the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the validated spendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated spendable check for change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated spendable check received by the seller. The method is applicable to a blockchain node, and the method includes: Execute the first NFT anonymous auction sale transaction: Inputting the first hash ID and the first proof information of the first NFT to be auctioned into the verification algorithm of the first zero-knowledge proof circuit for verification; Verify the legitimacy of the first hash value and the auction deadline submitted by the first NFT anonymous auction selling exchange respectively; wherein the first hash value is the hash value of the first random number; If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain; Execute the first NFT anonymous auction transaction: Verify whether the current time is earlier than the bidding deadline, and the legality of the first bid submitted by the first NFT anonymous auction bidding exchange; Inputting the unvalidated second hash ID and second proof information of the first NFT into the verification algorithm of the second zero-knowledge proof circuit for verification; Inputting the first encrypted amount and the third proof information into a verification algorithm of the third zero-knowledge proof circuit for verification; wherein the private input for generating the third proof information includes a third hash ID of the first validated spendable check used for payment; Inputting the second encrypted amount and the fourth proof information into a verification algorithm of the fourth zero-knowledge proof circuit for verification; wherein the private input for generating the fourth proof information includes a fourth hash ID of the unvalidated second spendable check used for change; verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and a first ellipse base point; If any verification fails, the first NFT anonymous auction transaction fails to execute; If all verifications are passed, the first bid is added to the anonymous auction information; the first NFT anonymous auction payment transaction is executed: Verify whether the current time is later than the auction deadline; Inputting the first hash value, the second bid that won the auction, the fifth hash ID of the unvalidated third spendable check to be collected, and fifth proof information into the verification algorithm of the fifth zero-knowledge proof circuit for verification; wherein the private input of the fifth proof information includes the first random number; If any verification fails, the execution of the first NFT anonymous auction payment transaction fails; If all verifications are passed, the spendable check for payment corresponding to the second bid is invalidated, the spendable check for change corresponding to the second bid and the third spendable check are validated, and the owner of the first NFT is updated to the hash ID of the first NFT corresponding to the second bid; Among them, the first encrypted amount E 1 =amount 1 *G+r*H; The second encrypted amount E 2 =amount 2 *G+r*H; amount 1 The amount of the first spendable check, amount 2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.

2. A method for NFT privacy auction, It is characterized in that The blockchain is deployed with an NFT privacy auction contract, and the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the validated spendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated spendable check for change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated spendable check received by the seller. The method is applicable to the user end of the seller, and the method includes: Generate first proof information according to a first proof algorithm of the first zero-knowledge proof circuit; wherein the public input of the first proof algorithm includes a first hash ID of the first NFT to be auctioned, and the private input of the first proof algorithm includes a first address and a first private key of an owner of the first NFT; Calculating a hash value of the first random number to obtain a first hash value; The first NFT anonymous auction sale transaction including the first hash ID, the first proof information, the first hash value and the auction deadline is packaged and generated and sent to the blockchain network for execution by the blockchain node: Inputting the first hash ID and the first proof information into a verification algorithm of the first zero-knowledge proof circuit for verification; Verifying the legitimacy of the first hash value and the auction deadline respectively; If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain; In response to the auction closing, obtaining a second bid that won the auction; generating fifth proof information according to a fifth proof algorithm of the fifth zero-knowledge proof circuit; wherein the public input of the fifth proof algorithm includes the first hash value, the second bid, and a fifth hash ID of the unvalidated third spendable check to be received, and the private input of the fifth proof algorithm includes the first address and the first random number; Packaging and generating a first NFT anonymous auction payment transaction including the first hash value, the second bid, the fifth hash ID, and the fifth proof information and sending it to the blockchain network for execution by the blockchain node: Verify whether the current time is later than the auction deadline; Inputting the first hash value, the second bid, the fifth hash ID and the fifth proof information into a verification algorithm of the fifth zero-knowledge proof circuit for verification; If any verification fails, the execution of the first NFT anonymous auction payment transaction fails; If all verifications are passed, the spendable check for payment corresponding to the second bid is invalidated, the spendable check for change corresponding to the second bid and the third spendable check are validated, and the owner of the first NFT is updated to the hash ID of the first NFT corresponding to the second bid; Among them, the blockchain node is also configured to execute the first NFT anonymous auction bidding transaction: Verify whether the current time is earlier than the bidding deadline, and the legality of the first bid submitted by the first NFT anonymous auction bidding exchange; Inputting the unvalidated second hash ID and second proof information of the first NFT into the verification algorithm of the second zero-knowledge proof circuit for verification; Inputting the first encrypted amount and the third proof information into the verification algorithm of the third zero-knowledge proof circuit for verification; Inputting the second encrypted amount and the fourth proof information into the verification algorithm of the fourth zero-knowledge proof circuit for verification; verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and a first ellipse base point; If any verification fails, the first NFT anonymous auction transaction fails to execute; If all verifications are passed, the first bid is added to the anonymous auction information; The private input for generating the third proof information includes a third hash ID of the validated first spendable check for payment, and the private input for generating the fourth proof information includes a fourth hash ID of the unvalidated second spendable check for change; The first encrypted amount E 1 =amount 1 *G+r*H; The second encrypted amount E 2 =amount 2 *G+r*H; amount 1 The amount of the first spendable check, amount 2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.

3. A method for NFT privacy auction, It is characterized in that The blockchain is deployed with an NFT privacy auction contract, and the NFT privacy auction contract is configured with a first zero-knowledge proof circuit for verifying whether the seller is the owner of the auctioned NFT, a second zero-knowledge proof circuit for verifying the legitimacy of the unvalidated new hash ID of the auctioned NFT submitted by the bidder, a third zero-knowledge proof circuit for verifying the legitimacy of the validated spendable check used by the bidder, a fourth zero-knowledge proof circuit for verifying the legitimacy of the unvalidated spendable check for change submitted by the bidder, and a fifth zero-knowledge proof circuit for verifying the identity of the seller and the legitimacy of the unvalidated spendable check received by the seller. The method is applicable to the user end of the bidder, and the method includes: Generate second proof information according to a second proof algorithm of the second zero-knowledge proof circuit; wherein the public input of the second proof algorithm includes an unvalidated second hash ID of the first NFT being auctioned, and the private input of the second proof algorithm includes the second address of the current bidder; Generating third proof information according to a third proof algorithm of the third zero-knowledge proof circuit; wherein the public input of the third proof algorithm includes the first encrypted amount, and the private input of the third proof algorithm includes the third hash ID of the first spendable check that has been validated for payment, the second address and the second private key of the current bidder, and the amount of the first spendable check; Generate fourth proof information according to a fourth proof algorithm of the fourth zero-knowledge proof circuit; wherein the public input of the fourth proof algorithm includes the second encrypted amount, and the private input of the fourth proof algorithm includes a fourth hash ID of an unvalidated second spendable check for change, the second address, and the amount of the second spendable check; The first NFT anonymous auction bidding transaction including the current bidder's first bid for the first NFT, the second hash ID, the second proof information, the first encrypted amount, the third proof information, the second encrypted amount, and the fourth proof information is packaged and generated and sent to the blockchain network for execution by the blockchain node: Verify whether the current time is earlier than the auction deadline, and the legality of the first bid; Inputting the second hash ID and the second proof information into a verification algorithm of the second zero-knowledge proof circuit for verification; Inputting the first encrypted amount and the third proof information into a verification algorithm of the third zero-knowledge proof circuit for verification; Inputting the second encrypted amount and the fourth proof information into a verification algorithm of the fourth zero-knowledge proof circuit for verification; verifying whether the difference between the first encrypted amount and the second encrypted amount is equal to the product of the first bid and a first ellipse base point; If any verification fails, the first NFT anonymous auction transaction fails to execute; If all verifications are passed, the first bid is added to the anonymous auction information of the first NFT; Among them, the first encrypted amount E 1 =amount 1 *G+r*H; The second encrypted amount E 2 =amount 2 *G+r*H; amount 1 The amount of the first spendable check, amount 2 is the amount of the second spendable check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point; The blockchain node is also configured to execute the first NFT anonymous auction sale transaction: Inputting the first hash ID and the first proof information of the first NFT into the verification algorithm of the first zero-knowledge proof circuit for verification; Verify the legitimacy of the first hash value and the auction deadline submitted by the first NFT anonymous auction selling exchange respectively; wherein the first hash value is the hash value of the first random number; If all verifications are passed, the anonymous auction information of the first NFT will be recorded on the blockchain for the bidder’s device to obtain; The blockchain node is also configured to execute the first NFT anonymous auction payment transaction: Verify whether the current time is later than the auction deadline; Inputting the first hash value, the second bid that won the auction, the fifth hash ID of the unvalidated third spendable check to be collected, and fifth proof information into the verification algorithm of the fifth zero-knowledge proof circuit for verification; wherein the private input of the fifth proof information includes the first random number; If any verification fails, the execution of the first NFT anonymous auction payment transaction fails; If all verifications are passed, the expendable check for payment corresponding to the second bid will be invalidated, the expendable check for change corresponding to the second bid and the third expendable check will be valid, and the owner of the first NFT will be updated to the hash ID of the first NFT corresponding to the second bid.

4. A computer device, It is characterized in that The device comprises: one or more processors; a memory for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors are caused to perform the method according to any one of claims 1 to 3.

5. A storage medium storing a computer program, It is characterized in that When the program is executed by a processor, the method according to any one of claims 1 to 3 is implemented.