A method and device for the certification and management of ideological and political education achievements based on blockchain technology

By combining Bloom filters and Merkle tree structures, along with Pedersen commitments and zero-knowledge scope proofs, the problems of data tampering, redundancy, and insufficient privacy protection in the management of ideological and political education outcomes are solved, achieving reliable verification with efficient deduplication, tamper-proofing, and fine-grained access control.

CN123115143APending Publication Date: 2026-11-17HEBEI PETROLEUM VOCATIONAL & TECH UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611369941.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-09-04
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Traditional management of ideological and political education outcomes suffers from problems such as easy data tampering, difficulty in traceability, serious redundancy, insufficient privacy protection, and a single authentication dimension, making it difficult to achieve efficient deduplication, take into account privacy protection, and support fine-grained verification.

Method used

A Bloom filter and a second-order deep hash comparison are used for deduplication, and a Merkle tree structure is combined to ensure the traceability of data history. Pedersen commitments and zero-knowledge scope proofs are used to achieve privacy protection and trusted verification of evaluation values.

Benefits of technology

It achieves efficient deduplication, prevents data tampering, ensures data integrity and traceability, supports fine-grained access control, and performs trusted verification while protecting privacy.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123115143A_ABST
    Figure CN123115143A_ABST
Patent Text Reader

Abstract

This application discloses a method and apparatus for the certification and management of ideological and political education achievements based on blockchain technology, relating to the field of educational informatization management technology. The method includes: initial screening and hash comparison of ideological and political education achievement data to generate valid achievement data packets and hash values; distributed storage to obtain an off-chain index, and recursively calculating the updated root hash value and verification path; generating a Pedersen commitment value, encrypting the off-chain index and verification path, and constructing a transaction proposal containing multi-party information and uploading it to the blockchain; responding to authentication requests from query terminals, verifying attribute certificates and decrypting to obtain target data, and performing Merkel integrity verification; responding to level verification requests, generating a zero-knowledge scope proof and verifying the binding relationship and constraints with the commitment value through a smart contract. This invention achieves tamper-proof storage of ideological and political achievements, fine-grained access control, and privacy protection authentication of evaluation values, while balancing the efficiency of deduplication and the security of data flow.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of educational informatization management technology, and in particular to a method and device for the certification and management of ideological and political education achievements based on blockchain technology. Background Technology

[0002] With the deepening development of educational informatization, the recording, storage, and authentication of the results data of ideological and political education (ideological and political education) are particularly important as a key link in cultivating morality and character. Traditional management of ideological and political education results often adopts centralized databases or paper-based archives, which has the following significant problems: 1) Data is easily tampered with and difficult to trace: Centralized storage faces the risk of single point of failure. Data is easily manipulated or maliciously tampered with by administrators, and it is difficult to achieve reliable data flow across departments and institutions, resulting in cumbersome authentication processes and insufficient credibility.

[0003] 2) Severe data redundancy: Students may repeatedly submit the same achievement materials (such as social practice reports, volunteer service certificates, etc.) on different platforms or at different time periods. There is a lack of efficient deduplication mechanisms, which wastes storage resources.

[0004] 3) Insufficient privacy protection: The outcomes of ideological and political education contain sensitive data such as students' personal identity information and evaluation grades. If these are directly uploaded to the blockchain in plaintext, it will lead to privacy leaks; if they are not disclosed at all, it will be difficult to conduct reliable verification.

[0005] 4) Limited Authentication Dimensions: Existing authentication systems often only prove the existence of data, making it difficult to conduct fine-grained and reliable verification of the quality of results (such as whether the evaluation value reaches the excellent level) while protecting privacy.

[0006] Therefore, there is an urgent need for a management scheme for the certification of ideological and political education achievements that can ensure data immutability, achieve efficient deduplication, protect privacy, and support fine-grained verification. Summary of the Invention

[0007] This invention provides a method and device for the certification and management of ideological and political education achievements based on blockchain technology. It achieves efficient deduplication through Bloom filters and secondary deep hash comparison, ensures the traceability of data history by using Merkle tree structure, and achieves privacy protection and trusted verification of evaluation values ​​by combining Pedersen commitments and zero-knowledge scope proofs.

[0008] In a first aspect, embodiments of the present invention provide a method for the certification and management of ideological and political education achievements based on blockchain technology, the method comprising: The system receives data on ideological and political education achievements submitted by user terminals, parses and obtains achievement attribute information including evaluation values ​​and user identity information, performs initial screening with a Bloom filter and secondary deep hash comparison on the achievement attribute information, and generates valid achievement data packets and achievement data hash values. The valid result data packets are distributed and stored to obtain the off-chain storage index. Using the user's identity information as the index, the historical Merkle tree structure of the user on the blockchain is retrieved. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated. Based on the evaluation value, a Pedersen commitment value is generated. The off-chain storage index and the updated Merkle tree verification path are encrypted to generate a ciphertext data packet. A transaction proposal is constructed, which includes user identity information, updated Merkle tree root hash value, Pedersen commitment value, ciphertext hash value of the ciphertext data packet, and user digital signature. The proposal is broadcast to the blockchain for consensus. After consensus is passed, the transaction proposal is written into the block. In response to the result authentication request initiated by the query terminal, the attribute certificate of the query terminal is parsed. If the corresponding attribute set satisfies the decryption policy, the encrypted data packet is decrypted, the corresponding target chain storage index and target Merkle tree verification path are obtained, and the corresponding target valid result data packet is accessed. In response to the level verification request from the query terminal, a zero-knowledge scope proof is generated, and the smart contract is invoked to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints, and the corresponding authentication result is output.

[0009] The technical solution provided in this application has at least the following beneficial effects: 1) Highly efficient deduplication and anti-tampering: The use of Bloom filters for initial screening greatly reduces the computational load of data comparison. For suspected duplicate data, a secondary deep hash comparison with timestamps is introduced, which effectively distinguishes between false positives and real duplicates, avoids redundant data from being uploaded to the chain, and saves storage resources.

[0010] 2) Data integrity and traceability: A dynamic Merkle tree structure is maintained for each user. New data is inserted as a leaf node and the root hash value is updated. Any modification to historical data will cause the root hash value verification to fail, ensuring the traceability and tamper-proof nature of the user's data throughout its entire lifecycle.

[0011] 3) Fine-grained access control: The encrypted policy attribute encryption technology is adopted, and the decryption policy is embedded in the encrypted text. Only query terminals with specific attribute certificates (such as counselors and supervisors) can decrypt and obtain data indexes, thus realizing flexible access control.

[0012] 4) Trusted verification under privacy protection: By using Pedersen commitments to make cryptographic commitments to the evaluation values ​​and combining them with zero-knowledge scope proof technology, the verifier is allowed to verify whether the evaluation value meets the preset level (such as "excellent" or "good") without knowing the specific evaluation value, effectively protecting the students' privacy data.

[0013] In one optional implementation, a data packet of ideological and political education outcomes submitted by a user terminal is received, parsed to obtain outcome attribute information including evaluation values ​​and user identity information, and after initial screening using a Bloom filter and secondary deep hash comparison of the outcome attribute information, a valid outcome data packet and an outcome data hash value are generated, including: The system receives data on ideological and political education achievements submitted by user terminals, generates raw data packets, uses a JSON parser to parse and obtain achievement attribute information and user identity information from the raw data packets, and extracts evaluation values ​​from the achievement attribute information. The result attribute information is serialized according to a preset lexicographical order, the corresponding feature hash value is calculated, and based on the Bloom filter, several independent hash functions are used to map the feature hash value to obtain several corresponding position indices; The initial screening is performed using a Bloom filter based on the location index. The value of the corresponding position in the bitmap stored locally by the Bloom filter is checked. If any position is 0, it is determined that the data is not duplicated. The values ​​of several positions corresponding to the result attribute information are all set to 1 to obtain valid result data, and the process proceeds to the valid result data package generation step. If all positions are 1, it is determined to be suspected duplicate data, and a second deep hash comparison step is performed; For the attribute information of the results that are identified as suspected duplicate data, a second deep hash comparison is performed to obtain the current submission timestamp. The original data packet is then concatenated with the current submission timestamp, and the corresponding overall deep hash value is calculated. If a record that is completely identical to the overall deep hash value is found in the system's local cache set, it is determined to be a genuine duplicate submission, and the ideological and political education achievement data is directly intercepted, and the process is terminated. Otherwise, it is determined to be a misjudgment of the Bloom filter, the overall deep hash value is written into the system's local cache set, and the process proceeds to the valid achievement data packet generation step. For valid result data that is determined to be non-duplicated, a valid result data package is generated. The valid result data is then standardized and packaged for use by the blockchain, resulting in a valid result data package, and the corresponding result data hash value is calculated.

[0014] In one optional implementation, the outcome attribute information includes the activity name, duration, type, and evaluation value.

[0015] In one optional implementation, valid result data packets are distributed for storage to obtain an off-chain storage index. Using the user's identity information as an index, the user's historical Merkle tree structure on the blockchain is retrieved. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated, including: The system calls the storage interface of the blockchain's distributed file system to upload valid result data packets. It then performs block division and hash calculation on the valid result data packets and constructs a directed acyclic graph to generate a globally unique content addressing identifier, which serves as an off-chain storage index. Using user identity information as an index, retrieve the historical state of the user's exclusive dynamic Merkle tree in the blockchain state database, and extract the historical Merkle tree root hash value and historical Merkle tree verification path. If this is the user's first submission, initialize the historical Merkle tree verification path to an empty value. The hash value of the result data is inserted as a new leaf node into the user's dynamic Merkle tree, and recursively hashed in combination with the historical Merkle tree verification path to generate the updated Merkle tree root hash value and the corresponding updated Merkle tree verification path.

[0016] In one optional implementation, the hash value of the resulting data is inserted as a new leaf node into the user's dynamic Merkle tree, and recursively hashed using historical Merkle tree verification paths to generate an updated Merkle tree root hash value and a corresponding updated Merkle tree verification path, including: If the historical Merkle tree verification path is null, the hash value of the result data is used as the new leaf node, and the updated Merkle tree root hash value is directly assigned. It is then inserted into the user's dynamic Merkle tree, and the corresponding updated Merkle tree verification path with null value is generated. If the historical Merkle tree verification path is not null, the hash value of the result data is used as the new leaf node. A chain-based cumulative hash model is used to concatenate the hash value of the historical Merkle tree root and the hash value of the result data to generate the corresponding updated Merkle tree root hash value. The historical Merkle tree root hash value is then used as the verification node to generate the corresponding updated Merkle tree verification path.

[0017] In one optional implementation, a Pedersen commitment value is generated based on the evaluation value. The off-chain storage index and the updated Merkle tree verification path are encrypted to generate a ciphertext data packet. A transaction proposal is constructed, including user identity information, the updated Merkle tree root hash value, the Pedersen commitment value, the ciphertext hash value of the ciphertext data packet, and the user's digital signature. This proposal is broadcast to the blockchain for consensus. After consensus is reached, the transaction proposal is written into a block, including: Based on the evaluation values ​​extracted from the outcome attribute information, a random blind factor is selected on the elliptic curve group to calculate the Pedersen commitment value. The off-chain storage index and the updated Merkle tree verification path are combined into a plaintext payload. The plaintext payload is then encrypted using a ciphertext policy attribute encryption algorithm under a preset access control policy tree to obtain a ciphertext data packet, and the corresponding ciphertext hash value is calculated. The user identity information, the updated Merkel root hash value, the Pedersen commitment value, and the ciphertext hash value of the ciphertext data packet are assembled into a transaction payload; Using the user's private key, the transaction payload is digitally signed to obtain the corresponding user digital signature. Combined with the transaction payload, a transaction proposal is generated. The transaction proposal is broadcast to the blockchain, and after the network nodes of the blockchain verify the validity of the digital signature of the transaction proposal, PBFT consensus is executed. Once consensus is reached, the transaction proposal is written into a block on the blockchain, and the user's state information is updated in the blockchain state database. The state information includes the updated Merkel root hash value, Pedersen commitment value, ciphertext hash value, and block timestamp.

[0018] In one optional implementation, in response to a result authentication request initiated by the query terminal, the attribute certificate of the query terminal is parsed. If the corresponding attribute set satisfies the decryption strategy, the encrypted data packet is decrypted, the corresponding target off-chain storage index and target Merkle tree verification path are obtained, and the corresponding target valid result data packet is accessed, including: The query terminal initiates a result authentication request for the target user, receives the result authentication request, parses out the identity information of the target user to be queried, verifies the attribute certificate submitted by the query terminal, and extracts the attribute set and attribute private key of the query terminal from the attribute certificate. Using the target user's identity information as an index, retrieve the target user's target state information in the blockchain state database to obtain the corresponding target Merkel root hash value, target ciphertext hash value, and target Pedersen commitment value; Based on the target ciphertext hash value, retrieve the corresponding target ciphertext data packet from off-chain storage or the blockchain ledger; Determine whether the attribute set of the query terminal satisfies the preset access control policy tree. If it does, use the attribute private key to execute the encrypted policy attribute decryption algorithm to obtain the plaintext payload. Based on the plaintext payload, extract the corresponding target off-chain storage index and target Merkle tree verification path. Call the data interface of the blockchain's distributed file system, and download the corresponding target valid result data package from the blockchain according to the target off-chain storage index; Parse the target valid result data package, extract non-sensitive result description information of target result attribute information and hidden target evaluation value, the hidden target evaluation value is not displayed; Calculate the target result hash value of the target valid result data packet, and recursively calculate the expected root hash value by combining the target Merkle tree verification path; Merkel integrity verification is performed. If the expected root hash value matches the target Merkel tree root hash value, the data is determined to be authentic and trustworthy and has not been tampered with. The target valid result data packet is output, and a level verification request is generated. Otherwise, the authentication process is terminated.

[0019] In one optional implementation, in response to a level verification request from a query terminal, a zero-knowledge scope proof is generated, and a smart contract is invoked to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and satisfies the preset evaluation value constraints. The corresponding authentication result is then output, including: After Merkel integrity verification, if the query terminal generates a level verification request, the preset evaluation value constraint is extracted, and the level verification request response process is carried out. Extract the target evaluation value and the corresponding target random blind factor within the local security area, and the query terminal reads the target user's target Pedersen commitment value from the blockchain state database; The query terminal calls the Bulletproofs zero-knowledge proof algorithm to generate a zero-knowledge range proof based on the target evaluation value, the target random blind factor, and the preset evaluation value constraints. The smart contract is invoked to perform on-chain verification of the zero-knowledge scope proof, the evaluation value constraint, and the target Pedersen commitment value. If the zero-knowledge scope proof is bound to the Pedersen commitment value and satisfies the preset evaluation value constraint, the authentication result is output as true; otherwise, the authentication result is output as false. If the authentication result is true, the verification event and its associated block timestamp will be recorded in the blockchain ledger.

[0020] Secondly, embodiments of the present invention provide a blockchain-based device for the certification and management of ideological and political education achievements, used to implement a method for the certification and management of ideological and political education achievements. The device includes: The data preprocessing unit is used to receive ideological and political education achievement data submitted by user terminals, parse and obtain achievement attribute information including evaluation values ​​and user identity information, and generate valid achievement data packets and achievement data hash values ​​after performing Bloom filter initial screening and secondary deep hash comparison on the achievement attribute information. The storage and indexing unit is used to distribute the valid result data packets, obtain the off-chain storage index, and retrieve the user's historical Merkle tree structure on the blockchain using the user's identity information as the index. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated. The privacy-preserving on-chain unit is used to generate a Pedersen commitment value based on the evaluation value, encrypt the off-chain storage index and the updated Merkle tree verification path, generate a ciphertext data packet, and construct a transaction proposal including user identity information, updated Merkle tree root hash value, Pedersen commitment value, ciphertext hash value of the ciphertext data packet, and user digital signature. This proposal is then broadcast to the blockchain for consensus, and once consensus is reached, the transaction proposal is written into the block. The query authentication unit is used to respond to the result authentication request initiated by the query terminal, parse the attribute certificate of the query terminal, and if the corresponding attribute set satisfies the decryption policy, decrypt the encrypted data packet, obtain the corresponding target chain storage index and target Merkle tree verification path, and access the corresponding target valid result data packet. The zero-knowledge verification unit is used to respond to the level verification request from the query terminal, generate a zero-knowledge scope proof, call the smart contract to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints, and output the corresponding authentication result.

[0021] A third aspect of this invention provides an electronic device, which includes: At least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by at least one processor, such that the at least one processor can perform the method proposed in the first aspect of the present invention.

[0022] A fourth aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method as described in the first aspect of the present invention. Attached Figure Description

[0023] Figure 1 This is a schematic diagram of the electronic device structure of the hardware operating environment involved in the embodiments of the present invention; Figure 2 This is a flowchart illustrating the steps of a blockchain-based method for certifying and managing ideological and political education achievements, as provided in this embodiment of the invention. Figure 3 This is a schematic diagram of the functional units of a blockchain-based ideological and political education achievement certification and management device provided in an embodiment of the present invention. Detailed Implementation

[0024] To make the above-mentioned objects, features, and advantages of the present invention more apparent and understandable, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0025] The present invention will be further described below with reference to the accompanying drawings.

[0026] Reference Figure 1 , Figure 1 This is a schematic diagram of the electronic device structure of the hardware operating environment involved in the embodiments of the present invention.

[0027] like Figure 1 As shown, the electronic device may include: a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen or an input unit such as a keyboard; optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be a high-speed random access memory (RAM) or a stable non-volatile memory (NVM), such as a disk drive. The memory 1005 may also optionally be a storage device independent of the aforementioned processor 1001.

[0028] Those skilled in the art will understand that Figure 1 The structure shown does not constitute a limitation on the electronic device and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0029] like Figure 1 As shown, the memory 1005, which serves as a storage medium, may include an operating system, a data storage module, a network communication module, a user interface module, and an electronic program for a blockchain-based ideological and political education achievement certification and management device.

[0030] exist Figure 1In the electronic device shown, the network interface 1004 is mainly used for data communication with the network server; the user interface 1003 is mainly used for data interaction with the user; the processor 1001 and the memory 1005 in the electronic device of the present invention can be set in the electronic device. The electronic device calls the electronic program of the ideological and political education achievement certification management device based on blockchain technology stored in the memory 1005 through the processor 1001, and executes the ideological and political education achievement certification management method based on blockchain technology provided in the embodiment of the present invention.

[0031] Reference Figure 2 The present invention provides a method for the certification and management of ideological and political education achievements based on blockchain technology, the method comprising: S201: Receive the ideological and political education achievement data submitted by the user terminal, parse and obtain achievement attribute information including evaluation value and user identity information, perform Bloom filter initial screening and secondary deep hash comparison on the achievement attribute information, and generate valid achievement data packets and achievement data hash values. S202: Distribute the valid result data packets to obtain the off-chain storage index, and use the user's identity information as the index to retrieve the user's historical Merkle tree structure on the blockchain. Insert the result data hash value as a new leaf node, and recursively calculate the updated Merkle tree root hash value and the updated Merkle tree verification path. S203: Based on the evaluation value, generate a Pedersen commitment value, encrypt the off-chain storage index and the updated Merkle tree verification path, generate a ciphertext data packet, and construct a transaction proposal including user identity information, updated Merkle tree root hash value, Pedersen commitment value, ciphertext hash value of the ciphertext data packet, and user digital signature. Broadcast the proposal to the blockchain for consensus, and write the transaction proposal into the block after consensus is passed. S204: In response to the result authentication request initiated by the query terminal, parse the attribute certificate of the query terminal. If the corresponding attribute set satisfies the decryption policy, decrypt the encrypted data packet, obtain the corresponding target off-chain storage index and target Merkle tree verification path, and access the corresponding target valid result data packet. S205: In response to the level verification request from the query terminal, generate a zero-knowledge scope proof, call the smart contract to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints, and output the corresponding authentication result.

[0032] The technical solution provided in this application has at least the following beneficial effects: 1) Highly efficient deduplication and anti-tampering: The use of Bloom filters for initial screening greatly reduces the computational load of data comparison. For suspected duplicate data, a secondary deep hash comparison with timestamps is introduced, which effectively distinguishes between false positives and real duplicates, avoids redundant data from being uploaded to the chain, and saves storage resources.

[0033] 2) Data integrity and traceability: A dynamic Merkle tree structure is maintained for each user. New data is inserted as a leaf node and the root hash value is updated. Any modification to historical data will cause the root hash value verification to fail, ensuring the traceability and tamper-proof nature of the user's data throughout its entire lifecycle.

[0034] 3) Fine-grained access control: The encrypted policy attribute encryption technology is adopted, and the decryption policy is embedded in the encrypted text. Only query terminals with specific attribute certificates (such as counselors and supervisors) can decrypt and obtain data indexes, thus realizing flexible access control.

[0035] 4) Trusted verification under privacy protection: By using Pedersen commitments to make cryptographic commitments to the evaluation values ​​and combining them with zero-knowledge scope proof technology, the verifier is allowed to verify whether the evaluation value meets the preset level (such as "excellent" or "good") without knowing the specific evaluation value, effectively protecting the students' privacy data.

[0036] In one optional implementation, a data packet of ideological and political education outcomes submitted by a user terminal is received, parsed to obtain outcome attribute information including evaluation values ​​and user identity information, and after initial screening using a Bloom filter and secondary deep hash comparison of the outcome attribute information, a valid outcome data packet and an outcome data hash value are generated, including: S2011: Receives ideological and political education achievement data submitted by user terminals, generates raw data packets, uses a JSON parser to parse and obtain achievement attribute information and user identity information from the raw data packets, and extracts evaluation values ​​from the achievement attribute information. In this embodiment, a JSON parser (such as Fastjson or Gson) is used to extract key fields. Among them, the evaluation value is a numeric type and needs to be converted to an integer or floating-point variable for storage; the user identity information userID is a string type and is used as the primary key for subsequent indexing. The result attribute information is serialized according to a preset lexicographical order, the corresponding feature hash value is calculated, and based on a Bloom filter, several independent hash functions are used to map the feature hash value to obtain several corresponding position indices. The formula is as follows: In the formula, for i The position index of the bitmap obtained after the hash function mapping is used to check the position of the bit in the Bloom filter bit array. Is the value at each position 0 or 1? i This is the index of the hash function; The feature hash value is obtained by calculating the attribute information of the result using SHA-256. The first one used for Bloom filters i A Bloom filter typically requires a set of (a total of) independent hash functions. k To reduce the collision rate, several independent hash functions can be used. In practical engineering, this can be achieved by setting different random seeds (Salt) for the same basic hash function (such as SHA-256) or by performing double hashing. k One function; For the modulo operation, since the output value of the hash function may have a very large range, while the bit array length of the Bloom filter is finite, it is necessary to take the modulo of the hash result and map it to [0, ..., ... m Within the interval [1], ensure that a valid bit array position is located; m The bit array length of the Bloom filter (i.e., the total size of the bitmap, in bits) is approximately 95,850,000 (about 11.5 MB). k The total number of hash functions used for the Bloom filter means that the formula for calculating the position index will be executed cyclically. k Each time, a different hash function is used to calculate... k There are approximately 7 different bitmap positions; Set the expected total number of elements to 10. 7 (Tens of millions of data points) to accommodate the scale of achievement data across the entire university and even the entire province; The acceptable false positive rate is set to 0.01 (i.e., 1%). S2012: Perform initial screening using a Bloom filter based on the location index. Check the value of the corresponding position in the bitmap stored locally by the Bloom filter. If any position is 0, it is determined that the data is not duplicated. Set the values ​​of several positions corresponding to the result attribute information to 1 to obtain valid result data and proceed to the valid result data package generation step. S2013: If all positions are 1, it is determined to be suspected duplicate data, and the second deep hash comparison step is initiated. S2014: For the attribute information of the results that are judged to be suspected duplicate data, perform a second deep hash comparison, obtain the current submission timestamp, concatenate the original data packet with the current submission timestamp, and calculate the corresponding overall deep hash value; S2015: Search the system's local cache set for a record that is completely identical to the overall deep hash value. If it exists, it is determined to be a genuine duplicate submission, and the ideological and political education achievement data is directly intercepted, and the process is terminated. Otherwise, it is determined to be a misjudgment by the Bloom filter, the overall deep hash value is written into the system's local cache set, and the process proceeds to the valid achievement data packet generation step. S2016: For valid result data that is determined to be non-duplicated, generate a valid result data package, standardize and encapsulate the valid result data for use by the blockchain, obtain the valid result data package, and calculate the corresponding result data hash value.

[0037] In one optional implementation, the outcome attribute information includes the activity name, duration, type, and evaluation value.

[0038] In one optional implementation, valid result data packets are distributed for storage to obtain an off-chain storage index. Using the user's identity information as an index, the user's historical Merkle tree structure on the blockchain is retrieved. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated, including: S2021: Call the storage interface of the blockchain's distributed file system to upload the valid result data packet, perform block division and hash calculation on the valid result data packet and construct a directed acyclic graph to generate a globally unique content addressing identifier as an off-chain storage index; In this embodiment, a distributed file system is used for storage: Chunker parameters: Call the Add interface of the distributed file system and set the Chunker parameter to size-262144 (i.e., 256KB per block). For most document-type outputs (such as PDF reports and images), one data block and one link block are usually generated. Content Addressing Identifier (CID) generation: IPFS uses CIDv1 by default. An example of a generated CID is: bafybeigdyrzt5s... This string is the off-chain storage index and is usually 59 characters long. S2022: Using user identity information as an index, retrieve the historical state of the user's exclusive dynamic Merkle tree in the blockchain state database, and extract the historical Merkle tree root hash value and the historical Merkle tree verification path. If this is the user's first submission, initialize the historical Merkle tree verification path to an empty value. S2023: Insert the hash value of the result data as a new leaf node into the user's dynamic Merkle tree, and perform recursive hash calculations in combination with the historical Merkle tree verification path to generate the updated Merkle tree root hash value and the corresponding updated Merkle tree verification path.

[0039] In one optional implementation, the hash value of the resulting data is inserted as a new leaf node into the user's dynamic Merkle tree, and recursively hashed using historical Merkle tree verification paths to generate an updated Merkle tree root hash value and a corresponding updated Merkle tree verification path, including: S20231: If the historical Merkle tree verification path is null, then the hash value of the result data is used as the new leaf node, directly assigned the updated Merkle tree root hash value, inserted into the user's dynamic Merkle tree, and a corresponding updated Merkle tree verification path with null values ​​is generated, using the following formula: In the formula, The updated Merkel tree root hash value; The hash value of the output data; S20232: If the historical Merkle tree verification path is not null, then the hash value of the result data is used as the new leaf node. Using a chain-based cumulative hash model, the historical Merkle tree root hash value and the result data hash value are concatenated and hashed to generate the corresponding updated Merkle tree root hash value. This historical Merkle tree root hash value is then used as the verification node to generate the corresponding updated Merkle tree verification path. The formula is as follows: In the formula, The updated Merkel tree root hash value; The hash value of the output data; The historical Merkel root hash value is the Merkel root that was calculated and uploaded to the blockchain when the user last submitted the result. It contains the aggregated state information of all the user's previous historical results. The SHA-256 secure hash function maps the input concatenated string to a fixed-length (256-bit) hexadecimal hash digest to ensure the immutability and one-way nature of the data.

[0040] In one optional implementation, a Pedersen commitment value is generated based on the evaluation value. The off-chain storage index and the updated Merkle tree verification path are encrypted to generate a ciphertext data packet. A transaction proposal is constructed, including user identity information, the updated Merkle tree root hash value, the Pedersen commitment value, the ciphertext hash value of the ciphertext data packet, and the user's digital signature. This proposal is broadcast to the blockchain for consensus. After consensus is reached, the transaction proposal is written into a block, including: S2031: Based on the evaluation values ​​extracted from the outcome attribute information, a random blinding factor is selected on the elliptic curve group to calculate the Pedersen commitment value, using the following formula: In the formula, The Pedersen commitment value is the coordinates of a point on the elliptic curve, typically compressed and stored as a 33-byte array. The evaluation value is assumed to be 88 (numerical value); For a random blind factor selected on the elliptic curve group, generate a large 256-bit integer using a secure random number generator, for example... =0x8a2f...; Let be the first independent generator on the elliptic curve; It is the second independent generator on the elliptic curve; S2032: Combine the off-chain storage index and the updated Merkle tree verification path into a plaintext payload, encrypt the plaintext payload using the ciphertext policy attribute encryption algorithm under the preset access control policy tree to obtain the ciphertext data packet, and calculate the corresponding ciphertext hash value. The formula is as follows: In the formula, It is a ciphertext data packet, which contains the encrypted plaintext payload and structured encrypted information related to access control policies. Only users who meet the preset attribute conditions can decrypt the data packet. This is the encryption function for the ciphertext policy attribute encryption algorithm. This function implements a fine-grained access control mechanism, embedding the access policy into the ciphertext itself. As a public key, it is generated and publicly released globally by a trusted attribute authority in the ciphertext policy attribute encryption algorithm, and can be used by any data submitter to perform encryption operations; For the access control policy tree, the attribute logic conditions that must be met to decrypt the ciphertext are defined (e.g., (School = University A AND Role = Counselor) OR (Role = Ideological and Political Supervisor)). S2033: Assemble the user identity information, the updated Merkle root hash value, the Pedersen commitment value, and the ciphertext hash value of the ciphertext data packet into a transaction payload; S2034: Use the user's private key to digitally sign the transaction payload, obtain the corresponding user digital signature, and combine it with the transaction payload to generate a transaction proposal. S2035: Broadcast the transaction proposal to the blockchain (such as a consortium blockchain like Hyperledger Fabric), and after verifying the validity of the digital signature of the transaction proposal using the network nodes of the blockchain, execute PBFT consensus; S2036: After consensus is reached, the transaction proposal is written into a block of the blockchain, and the user's state information is updated in the blockchain state database. The state information includes the updated Merkle root hash value, Pedersen commitment value, ciphertext hash value, and block timestamp.

[0041] In one optional implementation, in response to a result authentication request initiated by the query terminal, the attribute certificate of the query terminal is parsed. If the corresponding attribute set satisfies the decryption strategy, the encrypted data packet is decrypted, the corresponding target off-chain storage index and target Merkle tree verification path are obtained, and the corresponding target valid result data packet is accessed, including: S2041: The query terminal initiates a result authentication request for the target user, receives the result authentication request, parses out the identity information of the target user to be queried, verifies the attribute certificate submitted by the query terminal, and extracts the attribute set and attribute private key of the query terminal from the attribute certificate. S2042: Using the target user's identity information as an index, retrieve the target user's target state information in the blockchain state database to obtain the corresponding target Merkle root hash value, target ciphertext hash value, and target Pedersen commitment value. S2043: Based on the target ciphertext hash value, retrieve the corresponding target ciphertext data packet from off-chain storage or the blockchain ledger; S2044: Determine whether the attribute set of the query terminal satisfies the preset access control policy tree. If it does, use the attribute private key to execute the encrypted policy attribute decryption algorithm to obtain the plaintext payload. Based on the plaintext payload, extract the corresponding target off-chain storage index and target Merkle tree verification path, as shown in the formula: In the formula, Plaintext payload; This is the decryption function for the ciphertext policy attribute decryption algorithm; For the target encrypted data packet; For attribute private key; S2045: Call the data interface of the blockchain's distributed file system, and download the corresponding target valid result data package from the blockchain according to the target off-chain storage index; S2046: Parse the target valid result data package, extract non-sensitive result description information of target result attribute information and hidden target evaluation value, the hidden target evaluation value is not displayed; S2047: Calculate the target result hash value of the target valid result data packet, and recursively calculate the expected root hash value in combination with the target Merkle tree verification path; S2048: Perform Merkle integrity verification. If the expected root hash value matches the target Merkle tree root hash value, the data is determined to be authentic and trustworthy and has not been tampered with. Output the target valid result data packet and generate a level verification request. Otherwise, terminate the authentication process.

[0042] In one optional implementation, in response to a level verification request from a query terminal, a zero-knowledge scope proof is generated, and a smart contract is invoked to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and satisfies the preset evaluation value constraints. The corresponding authentication result is then output, including: S2051: After Merkel integrity verification, if the query terminal generates a level verification request, the preset evaluation value constraint (e.g., [80,90] represents the "good" level) is extracted, and the level verification request response process is carried out. S2052: Extract the target evaluation value and the corresponding target random blind factor within the local security area, and the query terminal reads the target user's target Pedersen commitment value from the blockchain state database; S2053: The query terminal calls the Bulletproofs zero-knowledge proof algorithm to generate a zero-knowledge range proof based on the target evaluation value, the target random blind factor, and the preset evaluation value constraints. In this embodiment, the target evaluation value Convert to bit vector form and prove that the target evaluation value ∈ Equivalent to proof Min≥0 and Max ≥0, where Max and Min are the maximum and minimum values ​​of the evaluation value constraint; Using a target random blind factor to generate an inner product vector polynomial constraint system, Pedersen commitment value with target Perform mathematical binding to generate zero-knowledge proof data containing range declarations, using the following formula: In the formula, Proof of zero knowledge scope; This is a proof generation function for the ballistic protection protocol. As a constraint on the evaluation value; The target evaluation value; The target Pedersen commitment value; The target is a random blind factor; S2054: Call the smart contract to perform on-chain verification of the zero-knowledge scope proof, the evaluation value constraint, and the target Pedersen commitment value. If the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraint, the authentication result is true; otherwise, the authentication result is false. In this embodiment, the smart contract triggers a verification algorithm to perform the following verification: Binding verification: Verifies whether the zero-knowledge scope proof is indeed generated for the target Pedersen commitment value (i.e., the prover actually possesses the knowledge to make the zero-knowledge scope proof valid). The established target evaluation value and target random blind factor). Constraint verification: Verify whether the evaluation value of the witness target meets the preset interval constraints. ≥Min∧ ≤Max; The formula is: In the formula, The authentication result is a Boolean value; This is the verification function for the bulletproof protocol; Proof of zero knowledge scope; As a constraint on the evaluation value; The target Pedersen commitment value; S2055: If the authentication result is true, the verification event and its associated block timestamp will be recorded in the blockchain ledger.

[0043] This invention also provides a blockchain-based device for the certification and management of ideological and political education achievements, as described in the embodiments of the present invention. Figure 3 The diagram shows a functional unit diagram of a blockchain-based ideological and political education achievement certification and management device 300 according to the present invention. The device may include the following units: The data preprocessing unit 301 is used to receive the ideological and political education achievement data submitted by the user terminal, parse and obtain achievement attribute information including evaluation value and user identity information, and generate valid achievement data packets and achievement data hash values ​​after performing Bloom filter initial screening and secondary deep hash comparison on the achievement attribute information. Storage and indexing unit 302 is used to perform distributed storage of valid result data packets, obtain off-chain storage index, and retrieve the user's historical Merkle tree structure on the blockchain using user identity information as index. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated. The privacy-preserving on-chain unit 303 is used to generate a Pedersen commitment value based on the evaluation value, encrypt the off-chain storage index and the updated Merkle tree verification path, generate a ciphertext data packet, and construct a transaction proposal including user identity information, updated Merkle tree root hash value, Pedersen commitment value, ciphertext hash value of the ciphertext data packet and user digital signature, broadcast to the blockchain for consensus, and write the transaction proposal into the block after consensus is passed; The query authentication unit 304 is used to respond to the result authentication request initiated by the query terminal, parse the attribute certificate of the query terminal, and if the corresponding attribute set satisfies the decryption policy, decrypt the encrypted data packet, obtain the corresponding target chain storage index and target Merkle tree verification path, and access the corresponding target valid result data packet. The zero-knowledge verification unit 305 is used to respond to the level verification request of the query terminal, generate a zero-knowledge scope proof, call the smart contract to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints, and output the corresponding authentication result.

[0044] Based on the same inventive concept, another embodiment of the present invention provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other through the communication bus. Memory, used to store computer programs; When a processor executes a program stored in memory, it implements the blockchain-based method for the certification and management of ideological and political education achievements of this invention.

[0045] The communication bus mentioned above can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This communication bus can be divided into address bus, data bus, control bus, etc. For ease of representation, only one thick line is used in the diagram, but this does not indicate that there is only one bus or one type of bus. The communication interface is used for communication between the aforementioned terminal and other devices. The memory can include Random Access Memory (RAM) or non-volatile memory, such as at least one disk storage device. Optionally, the memory can also be at least one storage device located remotely from the aforementioned processor.

[0046] The processors mentioned above can be general-purpose processors, including central processing units (CPUs), network processors (NPs), etc.; they can also be digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0047] Furthermore, to achieve the above objectives, embodiments of the present invention also propose a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the blockchain-based method for the certification and management of ideological and political education achievements according to embodiments of the present invention.

[0048] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, apparatus, or computer program products. Therefore, embodiments of the present invention can take the form of entirely hardware embodiments, entirely software embodiments, or embodiments combining software and hardware aspects. Furthermore, embodiments of the present invention can take the form of computer program products implemented on one or more computer-usable hardware devices (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0049] The embodiments of the present invention are described with reference to flowchart illustrations and / or block diagrams of methods, terminal devices (apparatus), and computer program products according to embodiments of the invention. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0050] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing terminal device to operate in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0051] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal equipment, causing a series of operational steps to be performed on the computer or other programmable terminal equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable terminal equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0052] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. "And / or" indicates that either one or both can be chosen. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal device that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or terminal device. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or terminal device that includes the element.

[0053] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in the present invention, and these modifications or substitutions should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for certifying and managing ideological and political education achievements based on blockchain technology, characterized in that, The method includes: The system receives data on ideological and political education achievements submitted by user terminals, parses and obtains achievement attribute information including evaluation values ​​and user identity information, performs initial screening with a Bloom filter and secondary deep hash comparison on the achievement attribute information, and generates valid achievement data packets and achievement data hash values. The valid result data packets are distributed and stored to obtain the off-chain storage index. Using the user's identity information as the index, the historical Merkle tree structure of the user on the blockchain is retrieved. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated. Based on the evaluation value, a Pedersen commitment value is generated. The off-chain storage index and the updated Merkle tree verification path are encrypted to generate a ciphertext data packet. A transaction proposal is constructed, which includes user identity information, updated Merkle tree root hash value, Pedersen commitment value, ciphertext hash value of the ciphertext data packet, and user digital signature. The proposal is broadcast to the blockchain for consensus. After consensus is passed, the transaction proposal is written into the block. In response to the result authentication request initiated by the query terminal, the attribute certificate of the query terminal is parsed. If the corresponding attribute set satisfies the decryption policy, the encrypted data packet is decrypted, the corresponding target chain storage index and target Merkle tree verification path are obtained, and the corresponding target valid result data packet is accessed. In response to the level verification request from the query terminal, a zero-knowledge scope proof is generated, and the smart contract is invoked to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints, and the corresponding authentication result is output.

2. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 1, characterized in that, The system receives data packets of ideological and political education achievements submitted by user terminals, parses them to obtain achievement attribute information including evaluation values ​​and user identity information, performs initial screening using a Bloom filter and secondary deep hash comparison on the achievement attribute information, and generates valid achievement data packets and achievement data hash values, including: The system receives data on ideological and political education achievements submitted by user terminals, generates raw data packets, uses a JSON parser to parse and obtain achievement attribute information and user identity information from the raw data packets, and extracts evaluation values ​​from the achievement attribute information. The result attribute information is serialized according to a preset lexicographical order, the corresponding feature hash value is calculated, and based on the Bloom filter, several independent hash functions are used to map the feature hash value to obtain several corresponding position indices; The initial screening is performed using a Bloom filter based on the location index. The value of the corresponding position in the bitmap stored locally by the Bloom filter is checked. If any position is 0, it is determined that the data is not duplicated. The values ​​of several positions corresponding to the result attribute information are all set to 1 to obtain valid result data, and the process proceeds to the valid result data package generation step. If all positions are 1, it is determined to be suspected duplicate data, and a second deep hash comparison step is performed; For the attribute information of the results that are identified as suspected duplicate data, a second deep hash comparison is performed to obtain the current submission timestamp. The original data packet is then concatenated with the current submission timestamp, and the corresponding overall deep hash value is calculated. If a record that is completely identical to the overall deep hash value is found in the system's local cache set, it is determined to be a genuine duplicate submission, and the ideological and political education achievement data is directly intercepted, and the process is terminated. Otherwise, it is determined to be a misjudgment of the Bloom filter, the overall deep hash value is written into the system's local cache set, and the process proceeds to the valid achievement data packet generation step. For valid result data that is determined to be non-duplicated, a valid result data package is generated. The valid result data is then standardized and packaged for use by the blockchain, resulting in a valid result data package, and the corresponding result data hash value is calculated.

3. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 2, characterized in that, The outcome attribute information includes the activity name, duration, type, and evaluation value.

4. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 3, characterized in that, Valid result data packets are distributed and stored to obtain an off-chain storage index. Using the user's identity information as an index, the user's historical Merkle tree structure on the blockchain is retrieved. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated, including: The system calls the storage interface of the blockchain's distributed file system to upload valid result data packets. It then performs block division and hash calculation on the valid result data packets and constructs a directed acyclic graph to generate a globally unique content addressing identifier, which serves as an off-chain storage index. Using user identity information as an index, retrieve the historical state of the user's exclusive dynamic Merkle tree in the blockchain state database, and extract the historical Merkle tree root hash value and historical Merkle tree verification path. If this is the user's first submission, initialize the historical Merkle tree verification path to an empty value. The hash value of the result data is inserted as a new leaf node into the user's dynamic Merkle tree, and recursively hashed in combination with the historical Merkle tree verification path to generate the updated Merkle tree root hash value and the corresponding updated Merkle tree verification path.

5. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 4, characterized in that, The hash value of the resulting data is inserted as a new leaf node into the user's dynamic Merkle tree. Recursive hash calculations are then performed, combining this with historical Merkle tree verification paths, to generate an updated Merkle tree root hash value and the corresponding updated Merkle tree verification path, including: If the historical Merkle tree verification path is null, the hash value of the result data is used as the new leaf node, and the updated Merkle tree root hash value is directly assigned. It is then inserted into the user's dynamic Merkle tree, and the corresponding updated Merkle tree verification path with null value is generated. If the historical Merkle tree verification path is not null, the hash value of the result data is used as the new leaf node. A chain-based cumulative hash model is used to concatenate the hash value of the historical Merkle tree root and the hash value of the result data to generate the corresponding updated Merkle tree root hash value. The historical Merkle tree root hash value is then used as the verification node to generate the corresponding updated Merkle tree verification path.

6. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 5, characterized in that, Based on the evaluation value, a Pedersen commitment value is generated. The off-chain storage index and the updated Merkle tree verification path are encrypted to generate a ciphertext data packet. A transaction proposal is constructed, including user identity information, the updated Merkle tree root hash value, the Pedersen commitment value, the ciphertext hash value of the ciphertext data packet, and the user's digital signature. This proposal is broadcast to the blockchain for consensus. Once consensus is reached, the transaction proposal is written into a block, including: Based on the evaluation values ​​extracted from the outcome attribute information, a random blind factor is selected on the elliptic curve group to calculate the Pedersen commitment value. The off-chain storage index and the updated Merkle tree verification path are combined into a plaintext payload. The plaintext payload is then encrypted using a ciphertext policy attribute encryption algorithm under a preset access control policy tree to obtain a ciphertext data packet, and the corresponding ciphertext hash value is calculated. The user identity information, the updated Merkel root hash value, the Pedersen commitment value, and the ciphertext hash value of the ciphertext data packet are assembled into a transaction payload; Using the user's private key, the transaction payload is digitally signed to obtain the corresponding user digital signature. Combined with the transaction payload, a transaction proposal is generated. The transaction proposal is broadcast to the blockchain, and after the network nodes of the blockchain verify the validity of the digital signature of the transaction proposal, PBFT consensus is executed. Once consensus is reached, the transaction proposal is written into a block on the blockchain, and the user's state information is updated in the blockchain state database. The state information includes the updated Merkel root hash value, Pedersen commitment value, ciphertext hash value, and block timestamp.

7. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 6, characterized in that, In response to the result authentication request initiated by the query terminal, the attribute certificate of the query terminal is parsed. If the corresponding attribute set satisfies the decryption policy, the encrypted data packet is decrypted, the corresponding target off-chain storage index and target Merkle tree verification path are obtained, and the corresponding target valid result data packet is accessed, including: The query terminal initiates a result authentication request for the target user, receives the result authentication request, parses out the identity information of the target user to be queried, verifies the attribute certificate submitted by the query terminal, and extracts the attribute set and attribute private key of the query terminal from the attribute certificate. Using the target user's identity information as an index, retrieve the target user's target state information in the blockchain state database to obtain the corresponding target Merkel root hash value, target ciphertext hash value, and target Pedersen commitment value; Based on the target ciphertext hash value, retrieve the corresponding target ciphertext data packet from off-chain storage or the blockchain ledger; Determine whether the attribute set of the query terminal satisfies the preset access control policy tree. If it does, use the attribute private key to execute the encrypted policy attribute decryption algorithm to obtain the plaintext payload. Based on the plaintext payload, extract the corresponding target off-chain storage index and target Merkle tree verification path. Call the data interface of the blockchain's distributed file system, and download the corresponding target valid result data package from the blockchain according to the target off-chain storage index; Parse the target valid result data package, extract non-sensitive result description information of target result attribute information and hidden target evaluation value, the hidden target evaluation value is not displayed; Calculate the target result hash value of the target valid result data packet, and recursively calculate the expected root hash value by combining the target Merkle tree verification path; Merkel integrity verification is performed. If the expected root hash value matches the target Merkel tree root hash value, the data is determined to be authentic and trustworthy and has not been tampered with. The target valid result data packet is output, and a level verification request is generated. Otherwise, the authentication process is terminated.

8. The method for certifying and managing ideological and political education achievements based on blockchain technology according to claim 7, characterized in that, In response to the level verification request from the query terminal, a zero-knowledge scope proof is generated, and the smart contract is invoked to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints. The corresponding authentication result is then output, including: After Merkel integrity verification, if the query terminal generates a level verification request, the preset evaluation value constraint is extracted, and the level verification request response process is carried out. Extract the target evaluation value and the corresponding target random blind factor within the local security area, and the query terminal reads the target user's target Pedersen commitment value from the blockchain state database; The query terminal calls the Bulletproofs zero-knowledge proof algorithm to generate a zero-knowledge range proof based on the target evaluation value, the target random blind factor, and the preset evaluation value constraints. The smart contract is invoked to perform on-chain verification of the zero-knowledge scope proof, the evaluation value constraint, and the target Pedersen commitment value. If the zero-knowledge scope proof is bound to the Pedersen commitment value and satisfies the preset evaluation value constraint, the authentication result is output as true; otherwise, the authentication result is output as false. If the authentication result is true, the verification event and its associated block timestamp will be recorded in the blockchain ledger.

9. A blockchain-based device for certifying and managing ideological and political education achievements, used to implement the method for certifying and managing ideological and political education achievements as described in any one of claims 1-8, characterized in that, The device includes: The data preprocessing unit is used to receive ideological and political education achievement data submitted by user terminals, parse and obtain achievement attribute information including evaluation values ​​and user identity information, and generate valid achievement data packets and achievement data hash values ​​after performing Bloom filter initial screening and secondary deep hash comparison on the achievement attribute information. The storage and indexing unit is used to distribute the valid result data packets, obtain the off-chain storage index, and retrieve the user's historical Merkle tree structure on the blockchain using the user's identity information as the index. The result data hash value is inserted as a new leaf node, and the updated Merkle tree root hash value and the updated Merkle tree verification path are recursively calculated. The privacy-preserving on-chain unit is used to generate a Pedersen commitment value based on the evaluation value, encrypt the off-chain storage index and the updated Merkle tree verification path, generate a ciphertext data packet, and construct a transaction proposal including user identity information, updated Merkle tree root hash value, Pedersen commitment value, ciphertext hash value of the ciphertext data packet, and user digital signature. This proposal is then broadcast to the blockchain for consensus, and once consensus is reached, the transaction proposal is written into the block. The query authentication unit is used to respond to the result authentication request initiated by the query terminal, parse the attribute certificate of the query terminal, and if the corresponding attribute set satisfies the decryption policy, decrypt the encrypted data packet, obtain the corresponding target chain storage index and target Merkle tree verification path, and access the corresponding target valid result data packet. The zero-knowledge verification unit is used to respond to the level verification request from the query terminal, generate a zero-knowledge scope proof, call the smart contract to verify that the zero-knowledge scope proof is bound to the Pedersen commitment value and meets the preset evaluation value constraints, and output the corresponding authentication result.