Data product right confirmation management method based on block chain evidence storage

Abstract

The invention discloses a data product right confirmation management method based on block chain evidence storage, and relates to the technical field of data product right confirmation management. According to the data product right confirmation management method based on block chain evidence storage, after right confirmation application information sent by an application subject is classified, on-chain initial evidence storage management and asynchronous fragmentation processing are performed, and meanwhile, in the application information acceptance process, the right confirmation application information and corresponding materials are preliminarily processed; and the server is used for performing two-way matching and verification connection of evidence storage information in an on-chain and off-chain synchronization process according to an asynchronous fragmentation processing result, and finally performing off-chain objection information classification marking management based on a block chain evidence storage state corresponding to a determined right confirmation data state in combination with the objection information and a corresponding material. Meanwhile, evidence storage and uplink solidification of the right confirmation data are completed, dynamic adjustment of the downlink and uplink downlink synchronization rhythm of the high-concurrency scene is achieved, and then the problem that in the prior art, the right management efficiency is low is effectively solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data product right management, and in particular to a data product right management method based on blockchain evidence storage. BACKGROUND

[0002] In the digital economy, data product right management faces problems such as ambiguous ownership and difficulty in record synchronization. Blockchain technology solves these problems through targeted data management logic. In the key data chaining link, the core data of the data product right is extracted first, including the ownership subject identity information, the creation timestamp, and the original data source. A unique identifier is generated through a hash algorithm, and then the data is associated by combining a decentralized identity identifier. After ensuring that each type of right data is accurately bound to the subject, the initial state of the data is locked by synchronously writing it into a distributed ledger of the blockchain.

[0003] At the rule preset level, the right data management rules are embedded in the blockchain smart contract, and the data recording standards in the scenarios such as ownership registration, change, and cancellation are clearly defined. For example, when the ownership is changed, the original ownership data hash, the new subject identity data, and the change authorization file hash need to be automatically associated, and the contract automatically executes the data recording operation when the trigger condition is met. In the record tracing stage, the blockchain stores the operation log of each right data in real time, including the operator's identity, operation time, and hash values before and after data change. All records are tamper-proof and fully traceable. When verifying the right data, the complete data link can be retrieved through the on-chain query portal, improving the credibility and management efficiency of the right data.

[0004] For example, the Chinese invention patent with the publication number CN112508707B discloses a new energy data aggregation method and transaction system based on identification and blockchain, which includes: determining the shareable fields of new energy devices managed by the business system through the data directory, and generating the association directory of key new energy devices based on the data directory, so as to determine the shareable fields of the key new energy devices in the managed business system; based on the association directory uploaded to the blockchain platform and the shared field published to the data application system, the shareable field to the data application system is established to establish a shareable field parsing rule and write it into the smart contract of the blockchain platform.

[0005] For example, the Chinese invention patent with the publication number CN117593016A discloses a method for storing knowledge property right evidence using blockchain technology, which includes: authority identity service, evidence storage right service, digital watermark service, digital certificate service, right transaction service, right holder, right receiver, and right protection evidence storage service. The specific steps of property right evidence storage are identity evidence storage, right evidence storage, authorization evidence storage, right protection evidence storage, and evidence storage verification.

[0006] The above-mentioned technology at least has the following technical problems: The prior art focuses on the right management under the conventional data flow at the design stage, and lacks the adaptive capacity for the data flow fluctuation under the scenes of data product transaction peak and batch right application. On the one hand, the fixed node allocation mode is adopted in the on-chain data writing link, and when the right application amount increases sharply into the high concurrency state, the fixed node is difficult to bear the instantaneous surge of the on-chain request, and the node response delay is easy to occur, which causes part of the right data to be accumulated in the to-be-on-chain queue; on the other hand, the on-chain and off-chain data synchronization depends on the static time interval, and the application data stored off-chain continuously accumulates under the high concurrency scene, and the synchronization rhythm cannot be dynamically adjusted, so that there is a time difference between the on-chain storage information and the actual application data off-chain. In this case, the on-chain data needs to be repeatedly called to confirm the consistency, which causes the verification to be blocked, resulting in the whole right management process being blocked, and the time consumption from the application reception to the state confirmation is greatly increased, and there is a problem of low efficiency of right management. SUMMARY

[0007] In order to solve the technical problem of low efficiency of right management existing in the prior art, the embodiment of the present application provides a data product right management method based on block chain storage. The technical scheme is as follows: On the one hand, the data product right management method based on block chain storage is provided, and the method comprises: Step one, based on the right application information sent by the application subject, the initial storage management and asynchronous slicing processing on the chain are carried out, the right application information classification is used to determine the right application information type under the high concurrency application reception scene, the initial storage management on the chain is used to fix the original state of the core information of the right application, to generate a unique association hash and a storage ID on the chain, and the corresponding application information-storage ID mapping relationship, and the asynchronous slicing processing is used to standardize the storage data source format; Step two, in the application information acceptance process, the right application information and the corresponding materials are preliminarily processed, which is used to carry out the bidirectional matching and verification connection of the storage information in the on-chain and off-chain synchronization process according to the result of the asynchronous slicing processing, so as to generate a consistency verification result; Step three, based on the block chain storage state corresponding to the determined right data state, combined with the objection information and the corresponding materials, the objection information classification marking management is carried out, and the storage and on-chain solidification of the right data are completed, so as to realize the closed loop management of the right data from the initial storage on the chain to the off-chain processing and then to the on-chain solidification.

[0008] The technical scheme provided by the embodiment of the present application has at least the following beneficial effects: 1. Through the collaborative design of on-chain initial evidence management and asynchronous sharding processing, the efficiency bottleneck and data integrity problem in high-concurrency right confirmation application scenarios are solved. In high-concurrency scenarios, on-chain initial evidence management can directly fix the core information of right confirmation application, including ownership subject, data product identification, and application type, etc. key content, by generating a unique associated hash and on-chain evidence ID, a dedicated and unambiguous identification basis is established for each application information, avoiding loss or confusion of application information in the transmission and processing process from the source, ensuring accurate positioning of the corresponding application when matching on-chain and off-chain data, reducing redundant operations of information matching, and reducing the need for repeated verification of basic information. By splitting and distributing the received right confirmation application information reasonably, each part of the sharded data can rely on independent processing threads to operate, avoiding processing lag caused by a single thread carrying excessive data.

[0009] 2. Through the evidence information bidirectional matching and verification linkage mechanism of on-chain and off-chain synchronization process, the consistency of right confirmation data and the credibility of right confirmation result are improved. On-chain evidence information retrieval matching is verified by dual verification of associated hash and core field, ensuring the consistency of on-chain evidence record and sharded processing result, accurately judging the matching degree of on-chain and off-chain, avoiding misjudgment of right confirmation due to differences between on-chain data and off-chain application information, and reflecting the matching status and material authenticity of on-chain data and off-chain application. The verification result of each right confirmation application has clear and traceable basis, reducing right confirmation disputes caused by data inconsistency or material problems, and making the right confirmation result more credible in subsequent ownership definition, improving the credibility of the entire data product right confirmation management system.

[0010] 3. Through the explicit right confirmation data state determination process, a full-process closed-loop management from application acceptance to result solidification is established, ensuring the standardization of the right confirmation process and the traceability of each application. By retrieving the core determination indicators in the two-dimensional verification report, the right confirmation data state is accurately divided into categories such as pending announcement, data inconsistency for verification, material supplement, and right confirmation termination, each state corresponds to a clear processing path and standard. The state determination mechanism allows each right confirmation application to follow a clear and standardized path from initial acceptance to final state solidification, and each state change can be traced through the blockchain, avoiding omissions in ownership definition, and ensuring the transparency of the entire right confirmation process, protecting the legal rights and interests of the applicant, and improving the overall standardization of right confirmation management.

[0011] 4. Through the chain off dissent information classification mark management, the precision of dissent processing and the stability of right confirmation process are balanced, the interference of dissent processing on the overall right confirmation progress is avoided, the legal rights and interests of both parties are protected, the overall right confirmation process is not affected, the content to be corrected is clear, the balance between efficiency and precision is realized; in addition, the chain operation of dissent evidence data makes the whole process of dissent processing traceable, the dissent number, classification result and associated on-chain evidence block ID and other information are fixed, the fairness and transparency of dissent processing result are ensured, the dark box operation in the dissent processing process is avoided, the supervision right of the dissent raising party is protected, and clear dissent processing basis is provided for the right confirmation applicant, the precision of dissent processing and the stability of right confirmation process are improved.

[0012] 5. Through the dynamic allocation mechanism of thread resources, the resource utilization efficiency in the right confirmation application processing process is optimized, the data processing rate is always stable in the application quantity fluctuation scenario, the problems of resource overload or idling are avoided; by monitoring the processing time of each data shard in real time, the shard with abnormal processing efficiency is accurately identified, no matter how the data flow fluctuates, the processing rate can remain stable, there will be no processing delay caused by insufficient resources, and there will be no cost waste caused by excess resources, the optimal balance between resource utilization and processing efficiency is realized. BRIEF DESCRIPTION OF DRAWINGS

[0013] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0014] Figure 1 The flowchart of the data product right confirmation management method based on block chain evidence provided by the embodiment of the present application; Figure 2 The flowchart of the initial evidence and asynchronous processing and on-chain and off-chain synchronous matching provided by the embodiment of the present application; Figure 3 The flowchart of the dissent information classification mark provided by the embodiment of the present application. DETAILED DESCRIPTION

[0015] The technical solutions in the present application will be described below with reference to the drawings.

[0016] In the embodiments of the present application, the words such as "example", "for example" are used to represent an example, illustration or description. Any embodiment or design scheme described as "example" in the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the word "example" is intended to present the concept in a specific manner. In addition, in the embodiments of the present application, the meaning expressed by "and / or" can be both, or can be one of the two.

[0017] In order to make the technical problems, technical solutions and advantages to be solved by the present application clearer, the following will be described in detail in combination with the drawings and specific embodiments.

[0018] The embodiments of the present application provide a data product right management method based on blockchain storage, as shown in the flow chart of the data product right management method based on blockchain storage. Figure 1 As shown in the flow chart of the data product right management method based on blockchain storage, the processing flow of the method can include the following steps: step one, based on the right application information classification sent by the application subject (usually including application enterprises, applicants, etc.), chain initial storage management and asynchronous slicing processing are carried out, the right application information classification is used to determine the right application information type in the high-concurrency application receiving scene, the chain initial storage management is used to fix the original state of the right application core information (including the right subject, data product DPID, application type), generate a unique association hash and chain storage ID, and the corresponding application information-storage ID mapping relationship provides a unique identification basis for subsequent chain-on and chain-off data matching, avoids application information receiving congestion in high concurrency, and guarantees data on-chain efficiency and integrity, and the asynchronous slicing processing is used to standardize the storage data source format; step two, in the application information receiving process, the right application information and the corresponding materials are preliminarily processed, which is used to carry out storage information bidirectional matching and verification connection in the chain-on and chain-off synchronization process according to the result of the asynchronous slicing processing, so as to generate a consistency check result; step three, based on the blockchain storage state corresponding to the determined right data state, combined with the objection information and the corresponding materials, chain-off objection information classification marking management is carried out, and the storage and on-chain solidification of the right data are completed, so as to realize the closed-loop management of the right data from the chain initial storage to the chain-off processing and then to the chain solidification, and guarantee the traceability of the right process and the non-missing right ownership definition in the high-concurrency scene.

[0019] In the embodiments, the right application information classification sent by the application subject includes various application information such as first registration, change registration, cancellation registration and objection registration, which guarantees the registration subject and the data product right ownership relationship. The applicant submits the materials, and then the processes such as receiving, examination, certification and persistent storage of the certificate are carried out to ensure the data product right ownership relationship.

[0020] After the formation of the chain initial storage record-chain off-chain processing-chain on solidification storage management closed loop, relying on the recording ability of the blockchain distributed ledger, the key information of the whole process of storage management is completely retained with unique time stamp and block link, and the storage adjustment of the link can be traced back to the operation subject, time and related data, avoiding storage loss and data tampering, improving the transparency and credibility of storage management, making the storage traceability have openness, and the design of asynchronous sharding according to the blockchain storage standard regular data reduces the format adaptation cost of subsequent storage verification and solidification link, shortens the cycle length of storage from initial creation to final solidification, solves the problem of format non-uniformity in storage, and solves the problem of long period.

[0021] As shown in Figure 2 The initial storage and asynchronous processing and chain on-chain off-chain synchronous matching process diagram provided by the embodiment of the application is shown in the figure, the core data field is obtained, the initial storage data packet is sent to the blockchain consensus node cluster, and asynchronous sharding processing is performed, if the processing time of a certain sharding is greater than a preset value in the processing process, the sharding of thread resources is performed again, otherwise chain on-chain off-chain synchronous matching is performed, and a two-dimensional verification report is generated based on the matching result, the matching includes chain on-chain storage information retrieval matching and chain off-chain application information verification connection, the field matching rate is obtained by obtaining the chain on-chain storage initial data packet, if the obtained matching rate is greater than a preset value, it means that the matching is passed, otherwise it is field matching exception; by obtaining the material correlation hash, if the obtained value is greater than a preset value, it means that the material authenticity is passed, otherwise it is determined that the material authenticity has exception.

[0022] Further, the initial on-chain storage management is performed, specifically: obtaining the classified right confirmation application information and extracting the core data field to provide the application information anchor point for the blockchain storage, and the core data field includes the right subject identifier, data product DPID, application type, and submission timestamp; inputting the core data field and the application purpose data field containing the application information into the application data-association hash mapping relationship to generate a unique association hash; at the same time, calling the blockchain storage interface, packaging the core data field and the application purpose data field containing the application information, and the corresponding unique association hash in the form of data compression to generate an initial storage data packet, and the initial storage data packet is attached with an application information unique identifier (generated by the application subject ID and the timestamp); the application data-association hash mapping relationship is a mapping relationship obtained based on the SHA-256 hash algorithm in combination with the application purpose of the application information; the initial 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 passes, the initial storage data packet is written into the blockchain distributed ledger to generate an application information-storage ID mapping relationship and stored in the local associated database to complete the initial on-chain storage management, after the initial on-chain storage management is completed, asynchronous sharding processing is performed; for the initial storage data packet that does not pass the multi-node consistency verification, a preset personnel is prompted for manual verification.

[0023] The specific process of asynchronous sharding processing is: real-time statistics of the total amount of right confirmation application information received in a unit of time (such as 1 minute), denoted as the current application amount, at the same time, a preset application amount-shard number mapping table (such as 5 pieces corresponding to the current application amount≤1000, 10 pieces corresponding to 1000<current application amount≤5000, and 20 pieces corresponding to current application amount>5000) is called, the current application amount is input into the application amount-shard number mapping table to obtain the target shard number, which is used for sharding processing of the total amount of received right confirmation application information according to the target shard number; the hash modulo algorithm is used to distribute the sharding processed right confirmation application information to a preset number of data shards, and each data shard corresponds 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 in each data shard is greater than the preset processing time, the thread resource is re-allocated, otherwise, the on-chain and off-chain synchronization matching is performed.

[0024] It needs to be understood that the process of reallocating thread resources is as follows: the difference between the processing duration of the data slice is taken as the numerator, and the preset processing duration is taken as the denominator to obtain a slice duration score reflecting the current application information data processing duration deviation; the amount of right application information corresponding to the non-sliced processing within the preset processing duration is taken as the numerator, and the total amount of received right application information is taken as the denominator, and the two are compared to obtain a task processing score reflecting the current application information data processing amount deviation; the obtained slice duration score and task processing score are coupled to obtain a thread processing index reflecting the current application information processing rate, and the obtained thread processing index deviation is input into the mapping relationship between thread processing and data slicing to obtain a slice splitting sub-slice number adjustment value and a temporary thread adjustment value, so as to split the corresponding data slice whose processing duration exceeds the current processing duration, and retrieve the temporary thread adjustment value in the standby thread and process it in parallel with the original thread; after all the slice processing is completed, the slice data is summarized to generate an asynchronous slice processing result (including the slice application information list, processing status, and associated hash).

[0025] In the 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 average result of the historical thread processing index in the historical thread resource allocation process, the preset application amount-slice number mapping table is based on the decision tree algorithm, the historical application amount data corresponding slice number and processing effect are taken as training samples, the application amount is taken as the input feature, and the optimal slice number is taken as the output label, a plurality of application amount interval-slice number corresponding rules are generated by recursively dividing the application amount feature space, and the application amount-slice number mapping table is not fixed, in actual application scenarios, the preset personnel can further adjust based on the historical average information amount of the platform; the application data-associated hash mapping relationship is a mapping relationship obtained based on the SHA-256 hash algorithm combined with the application purpose of the application information, which is obtained by inputting the historical application information corresponding to the application purpose into the SHA-256 hash algorithm for training, this mapping relationship can obtain the application purpose contained in the application information, complete the prerequisite for targeted block notarization, give each application information an exclusive and tamper-proof identification, and ensure that the data has uniqueness and traceability from the source; the application information-notarization ID mapping relationship is structured by combining the core unique identification field to form an original input string, and then performing hash operation on the input string by the SHA-256 algorithm to generate a fixed-length hash value as the core part of the notarization ID.

[0026] Specifically, the sharding processing is performed in multiple parallel modes by presetting an application amount-shard number mapping table to process the obtained application information in corresponding data shard forms. The preset processing duration is obtained by summing and averaging the historical processing durations in the historical asynchronous sharding processing. The processing duration is obtained by timing through an internal timer. The right application information is obtained by a counter. The mapping relationship between thread processing and data shard is obtained by training the historical processing data and shard values in the historical asynchronous sharding processing based on a nonlinear fitting algorithm.

[0027] Through the cooperative design of on-chain initial evidence storage and asynchronous sharding processing, multi-dimensional optimization effect is realized in the blockchain right establishment scene, the credibility of data evidence storage, the adaptation ability of high-concurrency scene and the rationality of resource utilization are improved, and an efficient connection foundation is laid for subsequent right establishment processes. In the asynchronous sharding processing link, the sharding processing can flexibly adapt to different application amount scenes. Even in the high-concurrency state of sudden increase of application amount, data accumulation can be avoided by reasonable splitting of application information, and the overall processing efficiency in the high-concurrency scene is improved. The thread allocation of shard data enables each data shard to be processed by independent threads, avoiding processing delay caused by excessive data load of a single thread, and further optimizing the processing speed.

[0028] The mechanism of real-time monitoring of processing duration and dynamic adjustment of thread resources accurately calculates the shard duration deviation and task processing deviation, generates thread processing indicators, and accordingly splits the overtime shard and calls temporary threads, which not only avoids the waste of idle thread resources, but also effectively solves the efficiency bottleneck caused by excessive processing pressure of part of the shards, ensuring that all shards can be efficiently promoted. The final aggregated shard results include a complete application information list, processing status and associated hash, which directly provide a unified format and complete data basis for subsequent on-chain and off-chain synchronization verification.

[0029] Further, the evidence storage information of the on-chain and off-chain synchronization process is bidirectionally matched and verified, specifically including on-chain evidence information retrieval matching and off-chain application information verification connection; the on-chain evidence information retrieval matching is used to confirm the consistency of the associated hash of the on-chain evidence record and the shard processing result and verify the matching degree of the on-chain core data field and the off-chain application information; the off-chain application information verification connection is used to verify the integrity of the off-chain shard processing materials and the associated effectiveness between the on-chain core field corresponding to the off-chain original application information.

[0030] The specific steps of calling and matching the on-chain record information are as follows: based on the asynchronous sharding processing result, the on-chain record ID and the associated hash of the application information are obtained, the corresponding API of the blockchain is inquired, the on-chain record ID is input, and the initial record data packet stored on the chain is called; the associated hash is reversely deduced according to the on-chain record associated hash and the asynchronous sharding processing result, and the on-chain core field and the sharding core field containing the original data are obtained; the on-chain core field and the sharding core field are input into the application data-associated hash mapping relationship, and the on-chain reverse micro-associated hash and the sharding reverse micro-associated hash are obtained; if the obtained on-chain reverse micro-associated hash is the same as the reverse micro-associated hash in the sharding processing result, the field matching link is entered, otherwise it is marked as the associated hash does not match; for the application information with the same reverse micro-associated hash, the on-chain core field and the core field of the off-chain sharding application information are compared field by field, and the field matching rate reflecting the matching degree of the current on-chain and off-chain is counted; if the obtained field matching rate is not less than the preset field matching rate, it is marked as the on-chain and off-chain matching passes, otherwise it is marked as the field matching is abnormal.

[0031] The specific steps of the off-chain application information verification and connection are as follows: the material associated hash in the off-chain sharding application information is obtained, the material associated hash stored in the on-chain initial record data packet is synchronously obtained, and the on-chain material associated hash is obtained; if the off-chain material associated hash is the same as the on-chain material associated hash, it is determined that the material authenticity passes, otherwise it is determined that the material authenticity is abnormal; based on the on-chain and off-chain matching result and the material authenticity verification result, a two-dimensional verification report is generated as the consistency verification result.

[0032] The field matching rate is obtained by comparing the number of current matching fields as the numerator and the total number of core fields as the denominator, the preset field matching rate is represented by the sum average result of the historical field matching rate of the historical on-chain record information calling and matching, and the two-dimensional verification report is generated based on the association between the on-chain and off-chain matching result and the material authenticity verification result. The state update time limit is not a fixed value, and the preset personnel can adjust the value according to the current application scene to meet the application purpose.

[0033] In this embodiment, through the design of on-chain source verification and off-chain material verification, the verification effect of data consistency and material authenticity in the title confirmation process is optimized, providing an accurate and reliable basis for subsequent title confirmation status determination; in the on-chain evidence information retrieval and matching link, relying on the evidence ID associated with the asynchronous sharding processing result and the blockchain query API, the initial on-chain evidence data packet can be quickly located and retrieved, avoiding verification delays caused by the cumbersome on-chain data retrieval; it can accurately identify whether the on-chain data and the sharded data are derived 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.

[0034] In the off-chain application information verification connection link, the material authenticity verification is deeply bound to the tamper-proof feature of the blockchain by directly comparing the off-chain shard material associated hash with the on-chain material associated hash. Since the on-chain material hash is fixed at the time of initial storage, any subsequent modification of the off-chain material will inevitably change its hash value. This verification method does not require manual verification of the material content one by one, and can quickly determine whether the material remains in its original state, reducing the workload and error rate of manual verification, while eliminating the risk of false 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, which clearly integrates the two key information of data consistency and material authenticity, avoiding the judgment bias caused by single-dimensional verification.

[0035] like Figure 3 As shown, it is a flowchart corresponding to the classification mark of objection information provided in the embodiment of the present application, which obtains the reverse micro-association hash and field matching rate, and divides the classification mark management into pending disclosure, data inconsistency pending review and authenticity anomaly. For the latter two, the abnormal tracing process and materials to be supplemented are required respectively, and the applicant is notified and an update time limit is set. If it is supplemented and passed the verification within the preset time, it will be recorded as pending disclosure status, otherwise the right confirmation will be terminated; for the pending disclosure status, if objection information is received, it will be classified into a first-level objection containing a first-level field and a second-level objection containing a second-level field according to the right confirmation meta-field, and after processing, both are linked and solidified to complete the blockchain evidence storage.

[0036] Further, the specific process of off-chain objection information classification and marking management is: the core determination index in the two-dimensional verification report is called, and the core determination index includes the on-chain and off-chain matching result (the same / different associated hash, field matching rate) and the material authenticity verification result (pass / abnormal); if the two-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, the right confirmation data state is recorded as to be announced, the state identifier is generated synchronously, and written into the block chain storage state field; if the two-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 reference value, it is recorded as data inconsistency to be checked, and the abnormal traceability process is triggered to locate the source of the data inconsistency; if the two-dimensional verification report shows that the material authenticity is abnormal, it is recorded as material to be supplemented, and a material supplement list is generated and sent to the applicant to prompt the applicant to supplement the materials corresponding to the application information; for the application information in the state of data inconsistency to be checked and material to be supplemented, a state update time limit (such as 24 hours) is set, if the abnormal processing is completed within the time limit and the re-verification is passed, it is updated to be announced; if it is not processed within the time limit or the re-verification is still abnormal, it is recorded as right confirmation termination, and the abnormal reason and the corresponding associated hash are stored on the chain.

[0037] Among them, the specific process of off-chain objection information classification and marking management is: after receiving the objection information, generate an objection number and call the right confirmation state: if the right confirmation state shows that the right confirmation is terminated, mark the objection as invalid and inform, if the right confirmation state shows to be announced, perform right confirmation element field classification, specifically: obtain the objection information and the corresponding material associated hash, query the field corresponding to the objection information, if the objection information involves the first-level field of the right confirmation element, and the objection material associated hash is the same as the on-chain historical storage material hash field, it is marked as a first-level objection to prioritize processing the right confirmation core information. The first-level field includes the registration subject, the right type, the data source, and the time sequence anchor point of the block chain height and the corresponding timestamp; specifically, the process of the first-level objection is: automatically switching the corresponding application information from the to-be-announced state to the to-be-checked state, suspending the data registration creation process through the API interface, generating an associated hash comparison report, prompting the preset personnel to prioritize processing, and the associated hash comparison report includes the hash difference between the on-chain storage and the objection material.

[0038] If the objection information involves the second-level field of the right confirmation element, the local database original application materials are called to conduct risk assessment, marked as a second-level objection, kept in the current state of public announcement, and the additional information is marked as to be corrected. The second-level field also includes data size, time span, and coverage area. The specific processing flow of the second-level objection is as follows: the objection number, classification result, and associated on-chain storage block ID of the right confirmation element are packaged as objection storage data, written into the blockchain, and an objection storage ID is generated to realize the traceability of the objection processing process. After the classification and marking management, the application subject is sent to complete the storage and on-chain solidification of the right confirmation data In the present embodiment, the generation of the associated hash comparison report is achieved by systematically collecting, verifying, and structuring the hash of the on-chain storage data and objection materials and the corresponding core information, accurately locating the differences between the two, and providing clear evidence for the priority processing of the first-level objection. First, the data source is collected and verified, and the on-chain storage data package associated with the current application information in the blockchain is automatically retrieved, and the core hash information is extracted. Second, multi-dimensional hash and field comparison are performed. Finally, the comparison results are structured and integrated to generate a report. The report is presented in a fixed format: first, the storage ID, objection number, and corresponding right confirmation state of the application information are clearly marked; then, the hash consistency result and difference details are displayed; at the same time, the difference impact explanation is added to prompt the core impact of the difference on the right ownership determination, and finally the corresponding on-chain storage block ID and objection material storage address are associated.

[0039] Through accurate determination of the right confirmation data state and classification and marking management of the off-chain objection information, the standardization, efficiency, and risk control ability of the right confirmation process are optimized, and the traceability of the whole process is strengthened relying on the characteristics of the blockchain. In the right confirmation data state determination link, the application information is accurately divided into layers based on the core indicators of the two-dimensional verification report (on-chain and off-chain matching results, material authenticity), avoiding the disadvantages of single and vague determination. The application that meets the requirements is directly marked as to be announced and written into the blockchain storage state field at the same time, ensuring that the state information is real-time solidified and cannot be tampered with. The application with inconsistent data triggers an abnormal traceability process, which can pinpoint the root cause of the data difference, rather than blindly conducting full-process verification, reducing invalid operations. The application with incomplete materials generates a clear material supplement list, allowing the applicant to clearly know what needs to be supplemented, avoiding repeated submission due to unclear information, and improving user experience.

[0040] In the off-chain objection information classification and labeling management link, invalid objections are avoided from occupying computing power and processing resources; for objections in the pending publication state, further classification is performed according to the involved field level, the application is switched to pending verification and the data registration process is suspended at the first level, and a related hash comparison report is generated to prompt priority processing, so as to prevent core information from being disputed while completing the right confirmation, and to avoid ownership disputes from the source; at the second level, the information to be modified is attached to the pending publication state, which does not hinder the overall right confirmation process, but also clearly indicates the content to be modified, achieving a balance between precise objection processing and process efficiency. The key data in the objection processing process are packaged and chained to generate an objection evidence ID, ensuring the transparency and traceability of the entire objection processing process, which not only guarantees the supervision right of the objection proposer, but also enables the application subject to clearly understand the basis for objection processing.

[0041] The above embodiments can be implemented in whole or in part by software, hardware (such as a circuit), firmware, or any combination thereof. When implemented by software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The 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, the processes or functions according to the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another, for example, the computer instructions can be transferred from one website, computer, server or data center to another website, computer, server or data center by wired (such as infrared, wireless, microwave, etc.) mode. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. containing one or more available medium collections. The available medium can be a magnetic medium (such as a floppy disk, a hard disk, a magnetic tape), an optical medium (such as a DVD), or a semiconductor medium. The semiconductor medium can be a solid state disk.

[0042] It should be understood that the term "and / or" herein merely describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B, which can represent three cases of A alone, A and B together, and B alone, where A and B can be singular or plural. In addition, the character " / " herein generally represents that the front and rear associated objects are in an "or" relationship, but can also represent an "and / or" relationship, which can be understood in the context.

[0043] In the present application, "at least one" means one or more, and "multiple" means two or more. "At least one of the following" or the like means any combination of the items, including a single item or any combination of multiple items. For example, at least one of a, b, or c can mean a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, and c can be single or multiple.

[0044] It should be understood that the size of the sequence number of the above-mentioned processes does not mean the order of execution in various embodiments of the present application. The execution order of the processes should be determined according to their functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0045] Those of ordinary skill in the art can realize that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be realized in electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized 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 implementation should not be considered beyond the scope of the present application.

[0046] Those skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working processes of the above-mentioned devices, apparatuses and units can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

[0047] In several embodiments provided by the present application, 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 schematic, for example, the division of units is only a logical function division, and actual implementation can have another division manner, for example, multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed units can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0048] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, i.e. they can be located in one place or distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the present embodiment.

[0049] In addition, each function unit in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit.

[0050] If the functions are implemented in the form of software function units and sold or used as independent products, the functions can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application or the parts of the present application that essentially contribute to the prior art or the parts of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the embodiments of the present application. The aforementioned storage medium includes a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0051] The above is only a specific embodiment of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical range disclosed by the present application, which should be covered by the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A data product right management method based on blockchain storage, characterized in that, The method comprises the following steps: Step 1: Based on the right application information sent by the application subject, the initial on-chain storage management and asynchronous sharding processing are carried out, the right application information classification is used to determine the type of right application information in the high-concurrency application receiving scene, the initial on-chain storage management is used to fix the original state of the core information of the right application and generate a unique associated hash and on-chain storage ID, and the asynchronous sharding processing is used to standardize the storage data source format; Step 2: 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 on-chain and off-chain synchronization process are carried out based on the results of the asynchronous sharding processing, and a consistency check result is generated; Step 3: Based on the determined right data state corresponding to the on-chain storage state, the on-chain storage and chain-up of the right data are completed by combining the objection information and the corresponding materials, so as to realize the closed-loop management of the right data from the initial on-chain storage to the off-chain processing and then to the chain-up. 2.The data product right management method based on blockchain storage according to claim 1, characterized in that, The initial on-chain storage management is carried out in the following manner: The classified right application information is obtained, and the core data field is extracted to provide an application information anchor point for the on-chain storage; The core data field and the application purpose data field containing the application information are input into an application data-association hash mapping relationship to generate a unique association hash; Meanwhile, the on-chain storage interface is called to generate an initial storage data packet from the core data field, the application purpose data field containing the application information, and the corresponding unique association hash, wherein the initial storage data packet is attached with an application information unique identifier; The initial storage data packet is sent to a blockchain consensus node cluster to trigger multi-node consistency verification, and after the multi-node consistency verification is passed, the initial storage data packet is written into a blockchain distributed ledger to generate an application information-storage ID mapping relationship and stored in a local associated database to complete the initial on-chain storage management, and after the initial on-chain storage management is completed, the asynchronous sharding processing is carried out; If the initial storage data packet does not pass the multi-node consistency verification, a preset personnel is prompted to carry out manual verification. 3.The data product right management method based on blockchain storage according to claim 2, characterized in that, The asynchronous sharding processing has the following specific process: The total amount of right application information received within a unit time is counted in real time and recorded as the current application amount, and a preset application amount-shard number mapping table is called to input the current application amount into the application amount-shard number mapping table to obtain a target shard number, which is used to perform sharded processing on the total amount of received right application information according to the target shard number; The hash modulo algorithm is used to distribute the sharded right application information to a preset number of data shards; The processing time of each data shard is monitored in real time, and if the processing time of any data shard is greater than a preset processing time, thread resources are re-allocated, otherwise, on-chain and off-chain synchronization matching is carried out.

4. The data product right management method based on blockchain storage according to claim 3, characterized in that, The process of re-allocating thread resources is as follows: The processing time difference of the data shard is obtained, and a comparison is made with the preset processing time to obtain a shard time score reflecting the current application information data processing time deviation; Obtain the amount of right-claim information corresponding to the unsharded processing within the preset processing duration, and compare it with the total amount of received right-claim information to obtain a task processing score reflecting the deviation of the current application information data processing amount; Couple the obtained sharding duration score with the task processing score to obtain a thread processing index reflecting the current application information processing rate, and input the obtained thread processing index deviation into the mapping relationship between thread processing and data sharding to obtain a sub-sharding quantity adjustment value and a temporary thread adjustment value to disassemble the corresponding data shard beyond the current processing duration, and simultaneously call the temporary thread adjustment value in the standby thread to process in parallel with the original thread; After all the sharding processing is completed, the sharded data is summarized to generate an asynchronous sharding processing result.

5. The data product right management method based on blockchain storage according to claim 1, characterized in that, The on-chain and off-chain synchronization process is connected with the storage information bidirectional matching and verification, specifically including on-chain storage information retrieval matching and off-chain application information verification connection; The on-chain storage information retrieval matching is used to confirm the association hash consistency of the on-chain storage record and the sharding processing result, and verify the matching degree of the on-chain core data field and the off-chain application information; The off-chain application information verification connection is used to verify the integrity of the off-chain sharding processing materials and the association effectiveness between the on-chain core field corresponding to the off-chain original application information.

6. The data product right management method based on blockchain storage according to claim 5, characterized in that, The specific steps of the on-chain storage information retrieval matching are: Based on the asynchronous sharding processing result, the on-chain storage ID and the association hash of the application information are obtained, the corresponding API is queried through the blockchain, the on-chain storage ID is input, and the initial storage data packet stored on the chain is retrieved; The on-chain core field and the sharding core field containing the original data are obtained by reverse deduction of the association hash of the on-chain storage record and the association hash of the asynchronous sharding processing result; The on-chain core field and the sharding core field are input into the application data-association hash mapping relationship to obtain the on-chain reverse micro association hash and the sharding reverse micro association hash; If the obtained on-chain reverse micro association hash is the same as the reverse micro association hash in the sharding processing result, the field matching link is entered, otherwise it is marked as association hash mismatch; For the application information with the same reverse micro association hash, the on-chain core field and the off-chain sharding application information core field are compared field by field, and the field matching rate reflecting the current on-chain and off-chain matching degree is calculated; 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 passing, otherwise it is marked as field matching exception.

7. The data product right management method based on blockchain storage according to claim 5, characterized in that, The specific steps of the off-chain application information verification connection are: Obtain the material association hash in the off-chain sharding application information to obtain the off-chain material association hash, and synchronously obtain the material association hash stored in the on-chain initial storage data packet 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, it is determined that the material authenticity passes, otherwise it is determined that the material authenticity is abnormal; Based on the on-chain and off-chain matching result and the material authenticity verification result, a two-dimensional verification report is generated as the consistency verification result. 8.The data product right management method based on blockchain storage according to claim 1, characterized in that, The specific process of the off-chain objection information classification marking management is: Retrieve the core judgment indicators in the dual-dimensional verification report, which include on-chain and off-chain matching results and material authenticity verification results; If the two-dimensional verification report shows that the reverse micro-linked hash on the chain is the same as the reverse micro-linked hash off the chain, and the field matching rate is not less than the corresponding reference value, the ownership confirmation data status will be recorded as pending disclosure, and a status identifier will be generated simultaneously and written into the blockchain evidence status field; If the two-dimensional verification report shows that the on-chain reverse micro-correlation hash is different from the off-chain reverse micro-correlation hash, or the field matching rate is lower than the corresponding preset field matching rate, it will be recorded as data inconsistency for verification, and the abnormal 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 recorded as materials to be supplemented, and a supplementary materials list will be generated and sent to the applicant to prompt the applicant to supplement the materials corresponding to the application information; For application information with inconsistent data pending verification or materials pending supplementation, a status update time limit is set. If the exception is handled and re-verified within the time limit, the status will be updated to pending disclosure; If the problem is not resolved within the time limit or the re-verification still fails, it will be recorded as the termination of the ownership confirmation, and the cause of the exception and the corresponding associated hash will be stored on the chain. 9.The data product right management method based on blockchain storage according to claim 1, characterized in that, The specific process of off-chain objection information classification and marking management 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 is terminated, the objection will be marked as invalid and notified. If the confirmation status shows that it is pending, the confirmation meta-fields will be classified as follows: Obtain the objection information and the corresponding material association hash, query the field corresponding to the objection information, and if the objection information involves the first-level field of the title confirmation meta-field, and the objection material association hash is the same as the hash field of the historical evidence material on the chain, mark it as a first-level objection to give priority to the core information related to title confirmation; The process for the first-level objection is as follows: The corresponding application information will be automatically switched from the pending disclosure status to the pending verification status, the creation process corresponding to the data registration will be suspended through the API interface, and an associated hash comparison report will be generated to prompt the preset personnel to handle it first. The associated hash comparison report contains the hash difference between the on-chain evidence and the objection materials.

10. The data product right management method based on blockchain storage according to claim 9, characterized in that, The classification of the title confirmation meta-fields also includes: If the objection information involves the second-level field of the title confirmation element, the original application materials in the local database will be retrieved for risk assessment, marked as a second-level objection, and the current pending public disclosure status will be maintained, with an additional information pending revision label; The specific processing flow for the secondary objection is as follows: the objection number, classification result, and associated on-chain evidence block ID corresponding to the confirmation element are packaged into objection evidence data, written into the blockchain, and an objection evidence ID is generated to achieve traceability of the objection handling process; After classification and marking management, it is sent to the applicant to complete the storage and chain solidification of the ownership data.

Images