Data product right management method based on blockchain storage

Abstract

The application discloses a data product right management method based on blockchain storage, and relates to the technical field of data product right management. The data product right management method based on blockchain storage is based on the classified right application information sent by an application subject, and performs initial storage management and asynchronous sharding processing on the chain. In the application information acceptance process, the right application information and the corresponding materials are preliminarily processed, the storage information bidirectional matching and verification connection of the chain-on and chain-off synchronization process are performed according to the asynchronous sharding processing result, and finally, the chain-off objection information classification marking management is performed based on the determined right data state corresponding to the blockchain storage state, combined with the objection information and the corresponding materials, and the right data storage and chain-up solidification are completed, so that the dynamic adjustment of the chain-on and chain-off synchronization rhythm in a high-concurrency scene is realized, and the problem of low right management efficiency in the prior art is effectively solved.

Description

Technical Field

[0001] This invention relates to the field of data product ownership management technology, and in particular to a data product ownership management method based on blockchain-based evidence storage. Background Technology

[0002] In the digital economy, data product ownership verification faces challenges such as ambiguous ownership and difficulties in synchronizing records. Blockchain technology addresses these pain points through targeted data management logic. In the critical data on-chaining process, core data for data product ownership verification is extracted first, including the identity information of the ownership entity, creation timestamp, and original data source. A unique identifier is generated using a hash algorithm, and then combined with a decentralized identity identifier to complete data association. This ensures that each type of ownership verification data is accurately bound to the entity before being synchronously written into the blockchain distributed ledger, locking in the initial state of the data.

[0003] At the rule-setting level, data management rules for ownership confirmation are embedded in blockchain smart contracts, clarifying data recording standards for scenarios such as ownership registration, modification, and cancellation. For example, when ownership changes, the original ownership data hash, the new entity's identity data, and the hash of the change authorization document must be automatically associated. When the triggering conditions are met, the contract automatically executes the data recording operation. In the record and traceability phase, the blockchain retains a real-time log of every ownership confirmation data operation, including the operator's identity, operation time, and hash values ​​before and after the data change. All records are immutable and fully traceable. When verification of ownership confirmation data is required, the complete data chain can be retrieved through the on-chain query portal, improving the credibility and management efficiency of ownership confirmation data.

[0004] For example, Chinese invention patent CN112508707B discloses a new energy data aggregation method and trading system based on identifiers and blockchain, including: determining the shared fields of new energy equipment managed by the business system through a data catalog, and generating an association catalog of key new energy equipment based on the data catalog, thereby determining the shareable fields of key new energy equipment in the managed business system; establishing shareable fields in the data application system based on the association catalog uploaded to the blockchain platform for storage and the published shared fields, and writing the shareable field parsing rules into the smart contract of the blockchain platform.

[0005] For example, Chinese invention patent with publication number CN117593016A discloses a method for intellectual property evidence preservation using blockchain technology, including: authoritative identity service, evidence preservation and confirmation service, digital watermarking service, digital certificate service, rights transaction service, rights holder, rights recipient and rights protection evidence preservation service; the specific steps of intellectual property evidence preservation are identity preservation, rights confirmation preservation, authorization preservation, rights protection preservation and evidence verification.

[0006] The above-mentioned technology has at least the following technical problems:

[0007] Existing technologies are primarily designed for rights management under normal data traffic conditions, lacking adaptability to data traffic fluctuations during peak data product transactions and batch rights application periods. On one hand, the on-chain data writing process uses a fixed node allocation model. When the number of rights applications surges into a high-concurrency state, the fixed nodes struggle to handle the sudden increase in on-chain requests, leading to node response delays and causing some rights data to accumulate in the queue awaiting on-chain processing. On the other hand, on-chain and off-chain data synchronization relies on static time intervals. In high-concurrency scenarios, the application data temporarily stored off-chain continuously accumulates, and the synchronization rhythm cannot be dynamically adjusted. This results in a time difference between on-chain evidence information and actual off-chain application data. In this situation, repeated retrieval of on-chain data to confirm consistency is necessary, causing verification bottlenecks and hindering the overall rights management process. The time taken from application receipt to status confirmation increases significantly, resulting in inefficient rights management. Summary of the Invention

[0008] To address the problem of low efficiency in rights confirmation management in existing technologies, this invention provides a method for managing data product rights confirmation based on blockchain-based evidence storage. The technical solution is as follows:

[0009] On the one hand, a method for managing the ownership of data products based on blockchain-based evidence storage is provided, which includes:

[0010] Step 1: Based on the classification of the rights confirmation application information sent by the applicant, perform initial on-chain evidence storage management and asynchronous sharding processing. The classification of rights confirmation application information is used to determine the type of rights confirmation application information in high-concurrency application reception scenarios. Initial on-chain evidence storage management is used to fix the original state of the core information of the rights confirmation application, generate a unique association hash and on-chain evidence storage ID, and establish the corresponding application information-evidence storage ID mapping relationship. Asynchronous sharding processing is used to standardize the data source format of the evidence storage data. Step 2: During the application information acceptance process, the rights confirmation application information and corresponding materials are preliminarily processed. This is used to perform bidirectional matching and verification of evidence storage information in the on-chain and off-chain synchronization process based on the results of asynchronous sharding processing, in order to generate a consistency verification result. Step 3: Based on the blockchain evidence storage state corresponding to the determined rights confirmation data state, combined with the objection information and corresponding materials, perform off-chain objection information classification and marking management. Simultaneously, complete the evidence storage and on-chain solidification of the rights confirmation data to achieve closed-loop management of the rights confirmation data from initial on-chain evidence storage to off-chain processing and then to on-chain solidification.

[0011] The beneficial effects of the technical solutions provided in the embodiments of the present invention include at least the following:

[0012] 1. Through the collaborative design of on-chain initial evidence management and asynchronous sharding processing, the efficiency bottleneck and data integrity issues in high-concurrency rights confirmation application scenarios are solved. In high-concurrency scenarios, on-chain initial evidence management can directly fix the core information of rights confirmation applications, including key content such as ownership subject, data product identifier and application type. By generating a unique association hash and on-chain evidence ID, a unique and unambiguous identification basis is established for each application information, which avoids the loss or disorder of application information during transmission and processing from the source. This ensures that the corresponding application can be accurately located when matching on-chain and off-chain data in the future, without the need to repeatedly verify basic information, reducing redundant operations in information matching. By reasonably splitting and distributing the received rights confirmation application information, each shard of data can be operated on by an independent processing thread, avoiding processing lag caused by a single thread carrying too much data.

[0013] 2. By linking the two-way matching and verification mechanism of evidence storage information in the on-chain and off-chain synchronization process, the consistency of the rights confirmation data and the credibility of the rights confirmation results are improved. The on-chain evidence storage information retrieval and matching is verified by the association hash and core fields to ensure the consistency between the on-chain evidence storage records and the sharding processing results. It accurately judges the matching degree between the on-chain and off-chain information, avoiding misjudgments in rights confirmation caused by differences between on-chain data and off-chain application information. It can comprehensively reflect the matching status of on-chain data and off-chain applications and the authenticity of materials, so that the verification results of each rights confirmation application have clear and traceable evidence. This not only reduces rights confirmation disputes caused by data inconsistency or material problems, but also makes the rights confirmation results more credible in the subsequent ownership determination process, thereby improving the credibility of the entire data product rights confirmation management system.

[0014] 3. By establishing a clear process for determining the status of ownership confirmation data, a closed-loop management system has been constructed, covering the entire process from application acceptance to result consolidation. This ensures the standardization of the ownership confirmation process and the traceability of each application. By retrieving core indicators from the dual-dimensional verification reports, the ownership confirmation data status is precisely categorized into categories such as pending public announcement, data inconsistency pending verification, materials pending supplementation, and termination of ownership confirmation. Each status corresponds to a clear processing path and standard. The status determination mechanism allows each ownership confirmation application to proceed along a clear and standardized path. From initial acceptance to final status consolidation, changes in status at each stage can be traced through blockchain. This avoids omissions in ownership definition, ensures a high degree of transparency in the entire ownership confirmation process, protects the legitimate rights and interests of the applicant, and improves the overall standardization of ownership confirmation management.

[0015] 4. By classifying and labeling off-chain objection information, a balance is achieved between the precision of objection handling and the stability of the rights confirmation process. This avoids interference with the overall rights confirmation progress and protects the legitimate rights and interests of both parties involved in the objection. It does not affect the progress of the overall rights confirmation process and clarifies the content that needs to be corrected, achieving a balance between efficiency and accuracy. In addition, the on-chain operation of objection evidence data makes the entire objection handling process traceable. Information such as objection number, classification result, and associated on-chain evidence block ID are all solidified, ensuring the fairness and transparency of the objection handling results and avoiding opaque operations in the objection handling process. This not only protects the supervisory right of the objector but also provides the rights confirmation applicant with clear objection handling basis, thus improving the overall precision of objection handling and the stability of the rights confirmation process.

[0016] 5. By using a dynamic allocation mechanism for thread resources, the resource utilization efficiency in the rights confirmation application process is optimized, ensuring that the data processing rate remains stable even under fluctuating application volume, thus avoiding resource overload or idleness. By monitoring the processing time of each data shard in real time, shards with abnormal processing efficiency are accurately identified. Regardless of data traffic fluctuations, the processing rate remains stable, preventing processing delays due to insufficient resources or cost waste due to excess resources, achieving an optimal balance between resource utilization and processing efficiency. Attached Figure Description

[0017] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0018] Figure 1 A flowchart illustrating the data product ownership management method based on blockchain-based evidence storage provided in this application embodiment;

[0019] Figure 2 A flowchart illustrating the initial evidence preservation and asynchronous processing, as well as the on-chain and off-chain synchronization matching, provided for embodiments of this application;

[0020] Figure 3 A flowchart showing the classification and labeling of objection information provided in the embodiments of this application. Detailed Implementation

[0021] The technical solution of the present invention will now be described with reference to the accompanying drawings.

[0022] In embodiments of the present invention, words such as "exemplarily," "for example," etc., are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" in the present invention should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the word "exemplary" is intended to present the concept in a concrete manner. Furthermore, in embodiments of the present invention, the meaning expressed by "and / or" can be both, or either one.

[0023] To make the technical problems, technical solutions and advantages of the present invention clearer, a detailed description will be given below in conjunction with the accompanying drawings and specific embodiments.

[0024] This invention provides a method for managing the ownership of data products based on blockchain-based evidence storage, such as... Figure 1 The flowchart shown is for a data product ownership management method based on blockchain-based evidence storage. The process can include the following steps: Step 1: Based on the classification of ownership application information sent by the applicant (usually including the applicant company, applicant, etc.), perform initial on-chain evidence storage management and asynchronous sharding processing. The classification of ownership application information is used to determine the type of ownership application information in high-concurrency application reception scenarios. Initial on-chain evidence storage management is used to fix the original state of the core information of the ownership application (including the ownership entity, data product DPID, and application type), generating a unique association hash and on-chain evidence storage ID. The corresponding application information-evidence storage ID mapping relationship provides a unique identifier for subsequent on-chain and off-chain data matching, avoiding congestion in application information reception under high concurrency. Step 1: To ensure the efficiency and integrity of data on-chain, asynchronous sharding is used to standardize the source format of evidence data. Step 2: During the application information acceptance process, the rights confirmation application information and corresponding materials are initially processed to perform bidirectional matching and verification of evidence information in the on-chain and off-chain synchronization process based on the results of asynchronous sharding, so as to generate a consistency verification result. Step 3: Based on the blockchain evidence status corresponding to the determined rights confirmation data status, combined with the objection information and corresponding materials, the off-chain objection information is classified and marked for management. At the same time, the evidence of rights confirmation data is not only stored on-chain but also solidified on-chain, so as to realize the closed-loop management of rights confirmation data from initial on-chain evidence storage to off-chain processing and then to on-chain solidification, ensuring that the rights confirmation process is traceable and the ownership definition is complete in high-concurrency scenarios.

[0025] In this embodiment, the information submitted by the applicant for confirmation of rights includes various types of application information such as initial registration, change registration, cancellation registration, and objection registration. This ensures the ownership relationship between the registration entity and the data product. The applicant submits the materials, and then the ownership relationship of the data product is ensured through processes such as acceptance, review, issuance of certificates, and persistent storage of certificates.

[0026] After forming a closed loop of evidence management consisting of initial on-chain evidence storage, off-chain processing, and on-chain solidification, key information throughout the entire evidence management process is completely retained and accompanied by a unique timestamp and blockchain endpoint, thanks to the recording capabilities of the blockchain's distributed ledger. Any adjustments to the evidence storage at each stage can be traced back to the operating entity, time, and related data, preventing evidence loss and data tampering, improving the transparency and credibility of evidence management, and making evidence traceability public. The asynchronous sharding design, which organizes data according to blockchain evidence storage standards, reduces the format adaptation costs of subsequent evidence verification and solidification stages, shortens the cycle time from initial creation to final solidification, and solves the problems of connection bottlenecks and lengthy cycles caused by inconsistent formats in evidence storage.

[0027] like Figure 2 The diagram shows the flowchart of the initial evidence storage, asynchronous processing, and on-chain / off-chain synchronous matching provided in this application embodiment. By obtaining core data fields, the initial evidence storage data packet is sent to the blockchain consensus node cluster and asynchronously sharded. During processing, if the processing time of a certain shard exceeds a preset value, thread resources are re-sharded; otherwise, on-chain / off-chain synchronous matching is performed. A two-dimensional verification report is generated based on the matching results. The matching includes on-chain evidence storage information retrieval matching and off-chain application information verification. The field matching rate is obtained by acquiring the initial on-chain evidence storage data packet. If the obtained matching rate is greater than a preset value, the matching is successful; otherwise, the field matching is abnormal. The associated hash of the off-chain materials is obtained. If the obtained value is greater than a preset value, the authenticity of the materials is verified; otherwise, the authenticity of the materials is abnormal.

[0028] Further, initial on-chain evidence management is performed, specifically as follows: The categorized rights confirmation application information is obtained and core data fields are extracted to provide application information anchors for blockchain evidence storage. These core data fields include the ownership entity identifier, data product DPID, application type, and submission timestamp. The core data fields and the application purpose data field containing application information are input into the application data-associative hash mapping relationship to generate a unique associative hash. Simultaneously, the blockchain evidence storage interface is called to package the core data fields, the application purpose data field containing application information, and the corresponding unique associative hash in compressed form to generate an initial evidence storage data package. This initial evidence storage data package includes a unique identifier for the application information (obtained by the applicant). The application data-associative hash mapping relationship is based on the SHA-256 hash algorithm and combined with the application purpose of the application information. The initial evidence storage data packet is sent to the blockchain consensus node cluster to trigger multi-node consistency verification (at least 3 nodes pass the verification). After the multi-node consistency verification is passed, the initial evidence storage data packet is written to the blockchain distributed ledger, generating the application information-evidence ID mapping relationship, and stored in the local associated database to complete the on-chain initial evidence storage management. After the on-chain initial evidence storage management is completed, asynchronous sharding processing is performed. For initial evidence storage data packets that fail the multi-node consistency verification, preset personnel are prompted to perform manual verification.

[0029] The specific process of asynchronous sharding is as follows: The total number of rights confirmation application information received per unit time (e.g., 1 minute) is counted in real time and recorded as the current application quantity. Simultaneously, a preset application quantity-sharding quantity mapping table is retrieved (e.g., current application quantity ≤ 1000 corresponds to 5 shards, 1000 < current application quantity ≤ 5000 corresponds to 10 shards, current application quantity > 5000 corresponds to 20 shards). The current application quantity is input into the application quantity-sharding quantity mapping table to obtain the target sharding quantity, which is used to shard the total number of received rights confirmation application information according to the target sharding quantity. A hash modulo algorithm is used to distribute the sharded rights confirmation application information to a preset number of data shards, with each data shard corresponding to an independent asynchronous processing thread. The processing time of each data shard is monitored in real time. If the processing time of any data shard exceeds the preset processing time, thread resources are reallocated; otherwise, on-chain and off-chain synchronization matching is performed.

[0030] It is important to understand that the process of reallocating thread resources is as follows: The difference in processing time between data shards is used as the numerator, and the preset processing time is used as the denominator. These are compared to obtain a shard time score reflecting the deviation in processing time for the current application information data. The amount of rights confirmation application information that has not been processed in a sharded manner within the preset processing time is used as the numerator, and the total amount of rights confirmation application information received is used as the denominator. These two are compared to obtain a task processing score reflecting the deviation in the current application information data processing volume. The obtained shard time score and task processing score are coupled to obtain a thread processing index reflecting the current application information processing rate. Simultaneously, the obtained thread processing index deviation is input into the thread processing-data shard mapping relationship to obtain the sharding sub-shard number adjustment value and the temporary thread adjustment value. This is used to shard the data shards whose processing time exceeds the corresponding processing time. At the same time, the temporary thread adjustment value is retrieved in the standby thread and processed in parallel with the original thread. After all shard processing is completed, the shard data is summarized to generate asynchronous shard processing results (including a list of application information for each shard, processing status, and associated hash).

[0031] In this embodiment, the thread processing index deviation represents the difference between the obtained thread processing index and the preset thread processing index. The preset thread processing index is represented by the summation and averaging of historical thread processing indices during the historical thread resource allocation process. The preset application quantity-shard quantity mapping table is based on the decision tree algorithm. It uses the shard quantity and processing effect corresponding to the historical application quantity data as training samples, takes the application quantity as the input feature, and the optimal shard quantity as the output label. By recursively dividing the application quantity feature space, multiple sets of corresponding rules between application quantity intervals and shard quantity are generated. Moreover, the application quantity-shard quantity mapping table is not static. In actual application scenarios, the preset personnel can further fine-tune it based on the historical average information of the platform. The application data-associative hash mapping relationship is based on the SHA-256 hash algorithm and is obtained by combining the application purpose of the application information. It is obtained by training the SHA-256 hash algorithm with the application purpose corresponding to the historical application information. This mapping relationship can obtain the application purpose contained in the application information, complete the premise of targeted block notarization, and give each application information an immutable unique identifier to ensure that the data has uniqueness and traceability from the source. The application information-notarization ID mapping relationship is formed by structurally combining the core unique identifier field to form the original input string, and then hashing the input string using the SHA-256 algorithm to generate a fixed-length hash value as the core part of the notarization ID.

[0032] Specifically, the sharded processing uses a preset mapping table of application quantity to shard quantity to process the number of obtained application information in parallel in the form of corresponding data shards. The preset processing time is represented by the sum and average of the historical processing times in the historical asynchronous sharding process. The processing time is obtained by timing with a built-in timer. The amount of rights confirmation application information is obtained by a counter. The mapping relationship between thread processing and data shards is based on a nonlinear fitting algorithm and is obtained by training with historical processing data and shard values ​​in the historical asynchronous sharding process.

[0033] Through the collaborative design of on-chain initial evidence storage and asynchronous sharding processing, multi-dimensional optimization effects have been achieved in blockchain rights confirmation scenarios. This has improved the credibility of data evidence storage, the adaptability to high-concurrency scenarios, and the rationality of resource utilization, while laying an efficient foundation for subsequent rights confirmation processes. In the asynchronous sharding processing stage, sharding processing can flexibly adapt to different application volume scenarios. Even under high concurrency conditions with a sudden increase in application volume, data backlog can be avoided by reasonably splitting application information, thus improving the overall processing efficiency in high-concurrency scenarios. The thread allocation of sharded data allows each data shard to be processed by an independent thread, avoiding processing delays caused by a single thread handling excessive data, and further optimizing processing speed.

[0034] The mechanism for real-time monitoring of processing time and dynamic adjustment of thread resources generates thread processing metrics by accurately calculating the deviation of sharding time and task processing. Based on this, timed-out shards are broken down and temporary threads are called up. This not only avoids the waste of idle thread resources, but also effectively solves the efficiency bottleneck caused by excessive processing pressure in some shards, ensuring that all shards can be promoted efficiently. The final sharding results include a complete list of application information, processing status and associated hashes, which directly provides a unified and complete data foundation for subsequent on-chain and off-chain synchronous verification.

[0035] Furthermore, the bidirectional matching and verification of evidence storage information during the on-chain and off-chain synchronization process specifically includes the connection between on-chain evidence storage information retrieval and matching and off-chain application information verification; on-chain evidence storage information retrieval and matching is used to confirm the consistency of the association hash between on-chain evidence storage records and sharding processing results and to verify the matching degree between on-chain core data fields and off-chain application information; off-chain application information verification is used to verify the completeness of off-chain sharding processing materials and the validity of the association between the on-chain core fields corresponding to the original off-chain application information.

[0036] The specific steps for retrieving and matching on-chain evidence storage information are as follows: Based on the asynchronous sharding processing results, obtain the on-chain evidence storage ID and associated hash of the application information. Simultaneously, query the corresponding API through the blockchain and input the on-chain evidence storage ID to retrieve the initial evidence storage data packet stored on-chain. Perform reverse derivation of the associated hash based on the on-chain evidence storage record associated hash and the asynchronous sharding processing results to obtain the on-chain core fields and shard core fields containing the original data. Input the on-chain core fields and shard core fields into the application data-associated hash mapping relationship to obtain the on-chain reverse micro-associated hash and the shard reverse micro-associated hash. If the obtained on-chain reverse micro-associated hash is the same as the reverse micro-associated hash in the sharding processing results, proceed to the field matching stage; otherwise, mark it as an associated hash mismatch. For application information with the same reverse micro-associated hash, compare the on-chain core fields with the core fields of the off-chain sharding application information field by field, and calculate the field matching rate to reflect the current on-chain and off-chain matching degree. If the obtained field matching rate is not less than the preset field matching rate, mark it as on-chain and off-chain matching passed; otherwise, mark it as field matching abnormal.

[0037] The specific steps for verifying off-chain application information are as follows: obtain the material association hash corresponding to the off-chain shard application information to obtain the off-chain material association hash; simultaneously obtain the material association hash stored in the on-chain initial evidence storage data package to obtain the on-chain material association hash; if the off-chain material association hash is the same as the on-chain material association hash, the material authenticity is determined to be passed; otherwise, the material authenticity is determined to be abnormal; based on the on-chain and off-chain matching results and the material authenticity verification results, a two-dimensional verification report is generated as the consistency verification result.

[0038] The field matching rate is obtained by comparing the current number of matched fields as the numerator and the total number of core fields as the denominator. The preset field matching rate is represented by the sum and average of the historical field matching rates retrieved from the historical on-chain evidence information. Based on the on-chain and off-chain matching results and the material authenticity verification results, a two-dimensional verification report is generated. The relationship between the two is processed by the Drools rule engine algorithm. The status update time limit is not a fixed value. The preset personnel can make fine adjustments to the value according to the current application scenario to meet the application purpose.

[0039] In this embodiment, the design of on-chain source verification and off-chain material verification optimizes the verification effect of data consistency and material authenticity during the rights confirmation process, providing an accurate and reliable basis for subsequent rights confirmation status determination. In the on-chain evidence storage information retrieval and matching stage, relying on the evidence storage ID associated with the asynchronous sharding processing results and the blockchain query API, the initial on-chain evidence storage data package can be quickly located and retrieved, avoiding verification delays caused by cumbersome on-chain data retrieval. It can accurately identify whether on-chain data and sharded data originate from the same original information, eliminating the possibility of data tampering or replacement from the source, and improving the depth and accuracy of data consistency verification.

[0040] In the off-chain application information verification process, the authenticity verification of materials is deeply bound to the immutability of the blockchain by directly comparing the association hash of off-chain sharded materials with the association hash of materials stored on-chain. Since the hash of on-chain materials is fixed during the initial notarization, any subsequent modifications to off-chain materials will inevitably change its hash value. This verification method eliminates the need for manual verification of each material's content, quickly determining whether the materials remain in their original state, reducing the workload and error rate of manual verification, and preventing the risk of counterfeit materials. Finally, a two-dimensional verification report is generated by combining the on-chain and off-chain matching results with the material authenticity verification results, clearly integrating the two key information aspects of data consistency and material authenticity, avoiding judgment bias caused by single-dimensional verification.

[0041] like Figure 3 The flowchart shown is a process for classifying and marking objection information according to an embodiment of this application. The reverse micro-association hash and field matching rate are obtained. The classification and marking management is divided into three categories: pending public announcement, data inconsistency pending review, and authenticity anomaly. For the latter two, an anomaly tracing process and supplementary materials are required, and the applicant is notified. An update time limit is set. If the supplementary materials are provided and verified within the preset time, the status is recorded as pending public announcement; otherwise, the confirmation of rights is terminated. For the pending public announcement status, if objection information is received, it is classified into first-level objection containing first-level fields and second-level objection containing second-level fields according to the confirmation of rights fields. After processing, both are uploaded and solidified to complete blockchain evidence storage.

[0042] Furthermore, the specific process for classifying and marking off-chain objection information is as follows: Retrieve the core judgment indicators from the dual-dimensional verification report. These indicators include on-chain and off-chain matching results (identical / dissimilar association hashes, field matching rate) and material authenticity verification results (pass / abnormal). If the dual-dimensional verification report shows that the on-chain reverse micro-association hash is the same as the off-chain reverse micro-association hash, and the field matching rate is not less than the corresponding reference value, then the confirmation data status is recorded as pending public disclosure, a status identifier is generated synchronously, and written into the blockchain evidence storage status field. If the dual-dimensional verification report shows that the on-chain reverse micro-association hash is different from the off-chain reverse micro-association hash, or the field matching rate is not less than the corresponding reference value, then the rights confirmation data status is recorded as pending public disclosure, a status identifier is generated synchronously, and written into the blockchain evidence storage status field. If the rate is less than the corresponding reference value, it is recorded as data inconsistency pending verification, and an anomaly tracing process is triggered to locate the root cause of the data discrepancy. If the dual-dimensional verification report shows an anomaly in the authenticity of the materials, it is recorded as materials to be supplemented, and a supplementary materials list is generated and sent to the applicant to remind the applicant to supplement the materials corresponding to the application information. For application information in the data inconsistency pending verification or materials to be supplemented status, a status update time limit (e.g., 24 hours) is set. If the anomaly is handled and re-verification is passed within the time limit, it is updated to pending public announcement. If it is not handled within the time limit or the re-verification is still abnormal, it is recorded as termination of rights confirmation, and the reason for the anomaly and the corresponding associated hash are stored on the blockchain for evidence.

[0043] The specific process for classifying and marking off-chain objection information is as follows: After receiving objection information, an objection number is generated and the confirmation status is retrieved. If the confirmation status shows that the confirmation has been terminated, the objection is marked as invalid and notified. If the confirmation status shows that it is pending public announcement, the confirmation meta-fields are classified. Specifically, the objection information and the corresponding material association hash are obtained, and the fields corresponding to the objection information are queried. If the objection information involves the first-level fields of the confirmation meta-fields, and the hash of the objection material is the same as the hash field of the historical evidence material on the chain, it is marked as a first-level objection so as to give priority to the core information of the confirmation. The first-level fields include the registration subject, the type of right, the data source, and the time-series anchor point of the blockchain height and the corresponding timestamp. Specifically, the process for a first-level objection is as follows: the corresponding application information is automatically switched from the pending public announcement status to the pending verification status. The creation process corresponding to the data registration is suspended through the API interface. An association hash comparison report is generated, and the preset personnel are prompted to handle it first. The association hash comparison report includes the hash difference between the on-chain evidence and the objection material.

[0044] If the objection information involves a secondary field of the rights confirmation element, the original application materials in the local database are retrieved for risk assessment, marked as a secondary objection, and kept in the current pending public announcement state, with an additional "information to be corrected" label. Secondary fields also include data scale, time span, and coverage area. The specific processing flow for secondary objections is as follows: the objection number, classification result, and associated on-chain evidence storage block ID corresponding to the rights confirmation element are packaged into objection evidence storage data, written to the blockchain, and an objection evidence storage ID is generated to ensure traceability of the objection processing process. After classification and marking management, the data is sent to the applicant to complete the evidence storage and on-chain solidification of the rights confirmation data.

[0045] In this embodiment, generating a correlated hash comparison report involves systematically collecting, verifying, and structurally presenting the hashes and corresponding core information of on-chain evidence storage data and objection materials. This accurately identifies the differences between the two, providing a clear basis for prioritizing the handling of first-level objections. First, data source collection and verification are performed, automatically retrieving on-chain evidence storage data packets associated with the current application information from the blockchain and extracting the core hash information. Second, multi-dimensional hash and field comparisons are performed. Finally, the comparison results are structured and integrated to generate a report. The report is presented in a fixed format: first, the evidence storage ID, objection number, and corresponding ownership status of the application information are clearly marked; then, the hash consistency results and difference details are displayed; simultaneously, an explanation of the impact of the difference is added, highlighting its core impact on ownership definition; finally, the corresponding on-chain evidence storage block ID and objection material storage address are associated.

[0046] By accurately determining the status of ownership confirmation data and classifying and managing off-chain objection information, the standardization, efficiency, and risk control capabilities of the ownership confirmation process have been optimized. Simultaneously, leveraging the characteristics of blockchain, the traceability of the entire process has been strengthened. In the ownership confirmation data status determination stage, application information is precisely categorized based on core indicators of the dual-dimensional verification report (on-chain and off-chain matching results, and material authenticity), avoiding the drawbacks of a single, vague judgment. Applications that meet the requirements are directly marked as pending public announcement and simultaneously written into the blockchain's notarization status field, ensuring that the status information is solidified in real time and cannot be tampered with. Applications with inconsistent data trigger an anomaly tracing process, enabling targeted identification of the root cause of data discrepancies rather than blindly conducting full-process verification, reducing ineffective operations. Applications with incomplete materials generate a clear list of supplementary materials, allowing applicants to clearly understand what needs to be supplemented, avoiding repeated submissions due to unclear information, and improving user experience.

[0047] In the off-chain objection information classification and labeling management process, invalid objections are prevented from consuming computing power and processing resources. For objections in the pending public announcement stage, they are further classified according to the level of the fields involved. At the first level, the application is switched to pending verification and the data registration process is suspended. At the same time, a correlation hash comparison report is generated to prompt priority processing, preventing the completion of ownership confirmation when core information is disputed, thus avoiding ownership disputes from the source. At the second level, while maintaining the pending public announcement stage, an information correction label is attached. This does not hinder the overall ownership confirmation process, but clarifies the content that needs to be corrected, achieving a balance between accurate handling of objections and ensuring process efficiency. Moreover, key data in the objection processing process is packaged and uploaded to the blockchain to generate objection evidence IDs, ensuring that the entire objection processing process is transparent and traceable. This not only protects the supervisory rights of the objector, but also allows the applicant to clearly understand the basis for objection processing.

[0048] The above embodiments can be implemented, in whole or in part, by software, hardware (such as circuits), firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. A computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the flow or function according to the embodiments of the present invention is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. Computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., infrared, wireless, microwave, etc.) means. A computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. Available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media. Semiconductor media can be solid-state drives.

[0049] It should be understood that the term "and / or" in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. A and B can be singular or plural. Additionally, the character " / " in this article generally indicates an "or" relationship between the preceding and following related objects, but it can also represent an "and / or" relationship. Please refer to the context for a more accurate understanding.

[0050] In this invention, "at least one" means one or more, and "more than one" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of a single item or a plurality of items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be a single item or multiple items.

[0051] It should be understood that, in various embodiments of the present invention, the order of the above-mentioned process numbers does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0052] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0053] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the devices, apparatuses, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0054] In the embodiments provided by this invention, it should be understood that the disclosed devices, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0055] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0056] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0057] If a function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0058] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included 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 managing the ownership of data products based on blockchain-based evidence storage, characterized in that: Includes the following steps: Step 1: Based on the classification of the rights confirmation application information sent by the applicant, perform on-chain initial evidence storage management and asynchronous sharding processing. The classification of rights confirmation application information is used to determine the type of rights confirmation application information in high-concurrency application receiving scenarios. The on-chain initial evidence storage management is used to fix the original state of the core information of the rights confirmation application and generate a unique association hash and on-chain evidence storage ID. The asynchronous sharding processing is used to standardize the data source format of the evidence storage data. Step 2: During the application information acceptance process, the rights confirmation application information and corresponding materials are preliminarily processed. This is used for bidirectional matching and verification of the evidence storage information in the on-chain and off-chain synchronization process based on the results of asynchronous sharding processing, so as to generate a consistency verification result. Step 3: Based on the blockchain storage status corresponding to the confirmed ownership data status, and in conjunction with the objection information and corresponding materials, classify and mark the off-chain objection information for management. At the same time, complete the storage and on-chain solidification of the ownership data to achieve closed-loop management of ownership data from initial on-chain storage to off-chain processing and then to on-chain solidification. The bidirectional matching and verification of evidence storage information in the on-chain and off-chain synchronization process specifically includes the connection between on-chain evidence storage information retrieval and matching and off-chain application information verification. The on-chain evidence storage information retrieval and matching is used to confirm the consistency of the association hash between the on-chain evidence storage record and the sharding processing result, and to verify the matching degree between the on-chain core data fields and the off-chain application information. The off-chain application information verification link is used to verify the integrity of the off-chain sharding processing materials and the validity of the association between the on-chain core fields corresponding to the original off-chain application information.

2. The data product ownership management method based on blockchain-based evidence storage as described in claim 1, characterized in that, The initial on-chain evidence storage management is specifically as follows: Obtain the classified rights confirmation application information and extract core data fields to provide application information anchors for blockchain evidence storage; Input the core data fields and the application purpose data field containing application information into the application data-association hash mapping relationship to generate a unique association hash; Simultaneously, the blockchain evidence storage interface is invoked to generate an initial evidence storage data package by combining the core data fields with the application purpose data field containing application information and the corresponding unique association hash. The initial evidence storage data package includes a unique identifier for the application information. The initial evidence storage data packet is sent to the blockchain consensus node cluster to trigger multi-node consistency verification. After the multi-node consistency verification is passed, the initial evidence storage data packet is written into the blockchain distributed ledger to generate the application information-evidence ID mapping relationship and store it in the local associated database to complete the on-chain initial evidence storage management. After the on-chain initial evidence storage management is completed, asynchronous sharding processing is performed. For initial evidence data packets that fail the multi-node consistency check, a designated person is prompted to perform manual verification.

3. The data product ownership management method based on blockchain-based evidence storage as described in claim 2, characterized in that, The asynchronous sharding process is as follows: The total number of rights confirmation application information received per unit time is counted in real time and recorded as the current application quantity. At the same time, the preset application quantity-fragment number mapping table is retrieved, and the current application quantity is input into the application quantity-fragment number mapping table to obtain the target fragment number, which is used to fragment the total number of received rights confirmation application information according to the target fragment number. The hash modulo algorithm is used to distribute the fragmented rights confirmation application information to a preset number of data fragments; The processing time of each data shard is monitored in real time. If the processing time of any data shard exceeds the preset processing time, thread resources are reallocated; otherwise, on-chain and off-chain synchronization matching is performed.

4. The data product ownership management method based on blockchain-based evidence storage as described in claim 3, characterized in that, The process of reallocating thread resources is as follows: The processing time difference of the data fragments is obtained and compared with the preset processing time to obtain the fragment time score, which reflects the deviation of the current application information data processing time. The amount of rights confirmation application information that has not been processed in a fragmented manner within the preset processing time is obtained and compared with the total amount of rights confirmation application information received to obtain a task processing score that reflects the deviation of the current application information data processing volume. The obtained shard duration score and task processing score are coupled to obtain a thread processing index that reflects the current processing rate of the requested information. The obtained thread processing index deviation is input into the thread processing-data shard mapping relationship to obtain the sub-shard number adjustment value and temporary thread adjustment value, so as to decompose the data shards whose current processing time exceeds the corresponding data shards. At the same time, the temporary thread adjustment value is retrieved in the standby thread and processed in parallel with the original thread. After all sharding is processed, the sharding data is aggregated to generate asynchronous sharding processing results.

5. The data product ownership management method based on blockchain-based evidence storage as described in claim 1, characterized in that, The specific steps for retrieving and matching the on-chain evidence storage information are as follows: Based on the asynchronous sharding processing results, obtain the on-chain evidence storage ID and associated hash of the application information, and at the same time query the corresponding API through the blockchain and enter the on-chain evidence storage ID to retrieve the initial evidence storage data packet stored on the chain. Based on the association hash of the on-chain evidence storage record and the asynchronous sharding processing result, the association hash is reversed to obtain the on-chain core field and sharding core field containing the original data; Input the on-chain core fields and shard core fields into the application data-associative hash mapping relationship to obtain the on-chain reverse micro-associative hash and the shard reverse micro-associative hash; If the obtained on-chain reverse micro-association hash is the same as the reverse micro-association hash in the sharding processing result, then proceed to the field matching stage; otherwise, mark it as an association hash mismatch. For application information with the same reverse micro-associative hash, compare the core fields on the chain with the core fields of the off-chain sharding application information field by field, and calculate the field matching rate to reflect the current degree of matching between the on-chain and off-chain information. If the obtained field matching rate is not less than the preset field matching rate, it is marked as on-chain and off-chain matching passed; otherwise, it is marked as field matching abnormal.

6. The data product ownership management method based on blockchain-based evidence storage as described in claim 1, characterized in that, The specific steps for verifying and connecting the off-chain application information are as follows: Obtain the off-chain material association hash from the corresponding material association hash in the off-chain sharding application information, and simultaneously obtain the corresponding material association hash stored in the on-chain initial evidence storage data packet to obtain the on-chain material association hash; If the hash associated with the off-chain material is the same as the hash associated with the on-chain material, the authenticity of the material is deemed to be verified; otherwise, the authenticity of the material is deemed to be abnormal. Based on the on-chain and off-chain matching results and the material authenticity verification results, a two-dimensional verification report is generated as the consistency verification result.

7. The data product ownership management method based on blockchain-based evidence storage as described in claim 1, characterized in that, The specific process for managing the classification and labeling of off-chain objection information is as follows: Retrieve the core judgment indicators from the dual-dimensional verification report. The core judgment indicators include on-chain and off-chain matching results and material authenticity verification results. If the dual-dimensional verification report shows that the on-chain reverse micro-association hash is the same as the off-chain reverse micro-association hash, and the field matching rate is not less than the corresponding reference value, then the status of the confirmation data will be recorded as pending public disclosure, a status identifier will be generated synchronously, and written into the blockchain evidence storage status field. If the dual-dimensional verification report shows that the on-chain reverse micro-association hash is different from the off-chain reverse micro-association hash, or the field matching rate is less than the corresponding preset field matching rate, it will be recorded as data inconsistency pending verification, and the anomaly tracing process will be triggered to locate the root cause of the data inconsistency. If the dual-dimensional verification report shows that the authenticity of the materials is abnormal, it will be marked as materials to be supplemented, and a list of materials to be supplemented will be generated and sent to the applicant to remind the applicant to supplement the materials corresponding to the application information. For application information in the status of data inconsistency pending verification and / or materials pending supplementation, a status update time limit is set. If the exception is handled and the re-verification is passed within the time limit, the status is updated to pending public announcement. If the process is not completed within the time limit or the re-verification still results in an anomaly, it will be recorded as a termination of the rights confirmation process, and the reason for the anomaly and the corresponding associated hash will be recorded on the blockchain for evidence storage.

8. The data product ownership management method based on blockchain-based evidence storage as described in claim 1, characterized in that, The specific process for managing the classification and labeling of off-chain objection information is as follows: After receiving the objection information, generate an objection number and retrieve the confirmation status: If the confirmation status shows that the confirmation process has been terminated, the objection will be marked as invalid and a notification will be issued. If the confirmation status shows that the process is pending public announcement, the confirmation meta-fields will be categorized as follows: Obtain the objection information and the corresponding material association hash, query the fields corresponding to the objection information, and if the objection information involves the first-level field of the confirmation element and the objection material association hash is the same as the hash field of the on-chain historical evidence material, mark it as a first-level objection so as to give priority to the core information involving the confirmation of rights. The procedure for the first-level objection is as follows: The system automatically switches the corresponding application information from the pending public announcement state to the pending verification state, pauses the creation process corresponding to the data registration through the API interface, generates an associated hash comparison report, and prompts the preset personnel to handle it first. The associated hash comparison report includes the hash difference between on-chain evidence and objection materials.

9. The data product ownership management method based on blockchain-based evidence storage as described in claim 8, characterized in that, The classification of the ownership confirmation element fields also includes: If the objection information involves a second-level field of the confirmation of rights, the original application materials in the local database will be retrieved for risk assessment, marked as a second-level objection, and kept in the current pending public announcement state, with an additional "information to be corrected" label attached. The specific processing flow for the second-level objection is as follows: the objection number, classification result and associated on-chain evidence storage block ID corresponding to the confirmed rights element are packaged into objection evidence storage data, written into the blockchain and an objection evidence storage ID is generated, so as to realize the traceability of the objection processing process. After classification and labeling management, the data is sent to the applicant to complete the notarization and on-chain solidification of the ownership data.

Images