Private data processing method for split content verification

By splitting large files or composite files into fragments or sub-files, calculating and comparing hash values, the problem of long-term verification of large files or composite files in the prior art is solved, and fast and accurate data checksum transmission is achieved.

CN120378111APending Publication Date: 2025-07-25SHENZHEN KEXIN DATA TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510217535.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-02-26
Publication Date
2025-07-25

AI Technical Summary

Technical Problem

In the prior art, when processing large files or composite files, it is difficult to efficiently verify data, especially to effectively identify which resource content is incorrect or has changed, and it takes a long time.

Method used

Split large files or composite files into multiple fragments or subfiles, calculate the hash values of each fragment or subfile separately, and combine these hash values into an overall hash value. When downloading, compare the hash values one by one to confirm consistency, discard inconsistent fragments or subfiles until the download is completed.

Benefits of technology

It realizes fast and accurate data verification, avoids the time-consuming process of waiting for the entire file to be downloaded and then verify, improves the verification efficiency and accuracy, supports customized algorithms in different scenarios, and meets the transmission and verification needs of large files and composite files.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120378111A_ABST
    Figure CN120378111A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of data security, in particular to a private data processing method for split content verification. The method comprises the following steps: a hash value generation process: segmenting a single large file into a plurality of fragments, independently calculating each fragment to obtain a first fragment hash value, arranging and serially connecting the plurality of first fragment hash values into a complete body, calculating the complete body to obtain a first whole hash value, and forming a large file containing two layers of hash values for transmission; and a hash value disassembling and checking process: during downloading, calculating a second fragment hash value of each fragment when the fragment is downloaded, comparing whether the second fragment hash value is consistent with the first fragment hash value or not, if so, retaining the downloaded fragment, and if not, abandoning the fragment and re-downloading until all the fragments are consistent through comparison. A method for breaking up the whole into parts to calculate hash is templated, the process serves as metadata, and original data is associated with final data hash to serve as a publicity contract of data verification.
Need to check novelty before this filing date? Find Prior Art