File information processing method and system based on digital security

Abstract

The invention discloses an archive information processing method and system based on digital security, and relates to the technical field of computer application, and the method comprises the following steps: S1, constructing a time sequence consistency profile, and collecting the actual arrival time and the corresponding position index of each archive data fragment, a network jitter fingerprint model reflecting instantaneous delay fluctuation characteristics is generated based on multi-round transmission data; s2, in a data inbound process, injecting a unique position label for each archive data fragment, and enabling the position labels and fragment contents to jointly participate in Hash calculation to generate a content Hash and position Hash parallel dual verification baseline; according to the method, sequence verification and correction are realized by constructing a time sequence consistency profile and a dual Hash mechanism, the Hash collision risk is prevented in combination with disturbance verification, result write-back and model updating are introduced, a closed-loop control link is formed, and the safety, accuracy and traceability of file synchronization are remarkably improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of computer application, in particular to an archive information processing method and system based on digital security. BACKGROUND

[0002] The "archive information processing based on digital security" refers to the management and control of data and metadata in the whole life cycle of archives (collection, digitization, storage, management, retrieval, sharing, transfer and destruction) with security as the core constraint: through the decomposition of confidentiality, integrity, availability and traceability targets, identity authentication and minimum permission access control, static and transmission encryption, digital signature and trusted timestamp, hash fingerprint and version solidification (write once, read multiple times), hierarchical classification and desensitization de-identification, fine-grained watermark tracing and leakage protection, whole-process audit tracking and storage chain verification, combined with backup disaster recovery and key escrow, abnormal monitoring and rapid response, the authenticity identification, originality preservation, authorized sharing and compliance retention are embedded into each processing link, so that the long-term security, availability and credibility of electronic and digital archives are ensured without affecting the retrieval efficiency and business collaboration.

[0003] In the prior art, the real-time synchronization of multiple copies of archives in different places usually relies on incremental transmission and hash fingerprint verification mechanism to ensure the consistency and integrity of the content of each copy; however, when the network link appears transient jitter, the order of data fragments may be disturbed, causing the system to combine according to the wrong order when performing hash fingerprint calculation; since the incremental verification mechanism in the prior art usually only performs rapid verification on the updated fragment, and assumes that the order and logical position of the data fragments are completely consistent, this order disorder may still generate a consistent verification value as expected in some cases, thus misjudging the archive content as complete and reliable; this misjudgment will directly release the archive data that has been maliciously tampered with, and the error content will be quickly propagated to all copies in different places in the real-time synchronization process, causing widespread archive pollution in a distributed storage environment, and once the original version is overwritten, it will face high difficulty in tracing and restoring. SUMMARY

[0004] The present application aims to provide an archive information processing method and system based on digital security to solve the technical problems raised in the background art.

[0005] In order to achieve the above-mentioned purpose, the present application provides the following technical solutions: The archive information processing method based on digital security comprises the following steps: S1, a time sequence consistency profile is constructed, the actual arrival time and corresponding position index of each archive data fragment are collected, and a network jitter fingerprint model reflecting the instantaneous delay fluctuation characteristics is generated based on multiple rounds of transmission data; S2, in the data inbound process, inject a unique location tag for each archive data shard, and participate in hash calculation with the location tag and the shard content together, generate double-check baseline of content hash and location hash in parallel; S3, based on the double-check baseline, build a sequential proof chain, organize the sequence number, parent-child reference relationship and timestamp of the archive data shard into a continuous and verifiable ordered chain structure, perform chain structure verification to identify sequential integrity anomalies; S4, after identifying the sequential integrity anomaly, perform time sequence playback and location reorganization of the archive data shard according to the sequential proof chain, and combine the location tag with the corresponding content hash to perform block-by-block consistency comparison and correction; S5, after completing the archive data reorganization and correction, select part of the corrected shards for error disturbance processing, and perform hash verification, if the verification value does not change after disturbance, it is determined that there is a risk of hash collision and the synchronization process is interrupted; S6, after the synchronization process is interrupted or the correction is completed, write the interruption event, abnormal path information and rearrangement correction result to the time sequence consistency profile, and update the network jitter fingerprint model and processing strategy threshold value according to the time sequence consistency profile, complete the closed-loop control process of anomaly detection, sequential repair, risk identification and strategy evolution.

[0006] The following is a further optimization of the technical solution of the present application: Step S1 includes: Divide each complete archive file into multiple shards according to a fixed number of bytes, and assign a unique logical number and generate a sending timestamp to each shard; Encapsulate the logical number and the corresponding sending timestamp into a data structure before sending, and send it to the receiving end through the communication protocol; The receiving end parses the received data structure, extracts the logical number and the sending timestamp, and generates a receiving timestamp at the moment of parsing, forming a structured record containing the logical number, the sending timestamp and the receiving timestamp; Repeat the data transmission for multiple rounds, statistically analyze the records with the same logical number, generate a time delay feature set containing average delay, maximum offset, minimum offset and delay mutation frequency, and arrange them in order of logical number to form a network jitter fingerprint model.

[0007] Further optimization: step S2 includes: Embed a unique logical location number in each archive data shard, the number is incremented in integer form, and the embedding method is to write a fixed-length number field at the start of the shard; Concatenate the number field and the shard content field in order to form a data body containing the number field and the content field; The position binding check value is generated by taking the data body as a whole, and the content check value is generated by taking the content field as an input, and is stored in the encapsulation structure to form double check information; The receiving end reads the number field and the content field, recalculates the two sets of check values in the same way, and compares them with the original values, which are used to identify the dislocation of the fragment position or the tampering of the content.

[0008] Further optimization: step S3 includes: After constructing the double check baseline, set the parent reference field for each archive data fragment, and write the content check value and the position binding check value of the previous fragment into the current fragment; Add a sending timestamp field to each archive data fragment for time offset check in subsequent sequence judgment; The receiving end extracts the logical number, parent reference field and sending timestamp of each fragment, and compares the parent reference field with the corresponding double check value in the previous number fragment in logical number order to determine whether the reference relationship matches; According to the comparison result, construct a sequence linked list to record the breakpoint position and offset information. If all reference relationships are consistent and the time offset is within the threshold range, it is determined to be a complete sequence chain, otherwise it is marked as a sequence abnormal chain.

[0009] Further optimization: the receiving end extracts the logical number, parent reference field and sending timestamp of each fragment, and compares the parent reference field with the corresponding double check value in the previous number fragment in logical number order as follows: After extracting the logical number, parent reference field and sending timestamp of each archive data fragment, retrieve the content check value and position binding check value of the previous number fragment in the local cache in ascending order of logical number, and concatenate the two sets of check values into a set of expected reference values. Then compare the expected reference value with the parent reference field carried by the current number fragment byte by byte. If the comparison result is consistent, it is determined that the parent-child relationship is valid. If it is not consistent, it is determined that the fragment has sequence abnormalities.

[0010] Further optimization: step S4 includes: After identifying the sequence integrity abnormality, extract all archive data fragments in this round, sort them in ascending order of logical number, identify whether the parent reference field and the check value of the previous number fragment are consistent, and mark the break point; Construct a time sequence playback table, taking the logical number as the index, recording the content hash value, position label, reference state and time difference value of each number, forming a basic structure for recombination; Perform consistency comparison of the position label and the number value on the sorted fragments, and combine the original position binding hash value to verify whether there is content tampering; The misplaced fragments that pass the verification are put back in the correct position and the parent reference field is updated to build a continuous chain structure, and the fragments marked as inconsistent in content and position are removed from the reorganization process.

[0011] Further optimization: After identifying the sequence integrity anomaly, during the time sequence playback and position reorganization process of the archive data fragments according to the sequence proof chain, the following steps are included: For each sorted archive data fragment, extract its internally embedded position tag field and compare it with the current number value one by one. If they are inconsistent, it is determined that the fragment has a sequence misplacement. Then extract the content field and position tag field of the fragment to splice into a complete data body, regenerate the position binding hash value, and compare it with the original position binding hash value carried in the fragment. If the hash values are consistent, it is determined that the fragment content has not been tampered with, and only the sequence is wrong. If the hash values are inconsistent, it is determined that the fragment has both content and position anomalies.

[0012] Further optimization: Step S5 includes: Extract samples from the verified fragments at fixed intervals, copy the number field, position tag field, content field, and original hash value to a temporary buffer; Apply a small perturbation to the specified byte position in the content field of each sample, keep the number and position tag unchanged, generate the perturbed data body, and recalculate the perturbed position binding hash value and content hash value; Compare the byte difference between the perturbed and original hash values. If the perturbed hash value is exactly the same as the original value, it is determined that there is a risk of homomorphic collision, and the collision information is recorded and the risk state is marked; If any perturbed sample has a collision risk, interrupt the synchronization process and prevent data from being written, trigger the backup strategy, and if all perturbed samples pass the verification, allow the next synchronization link.

[0013] Further optimization: Step S6 includes: Form a structured exception data list from the synchronization interruption event, broken chain logical number segment, rearrangement mapping relationship, position correction times, perturbation verification failure record, and processing time information; Write the fragment number involved in the exception data list and the corresponding behavior tag field to the time consistency profile, update the time offset value and state tag of the original fragment; Based on the continuous number anomaly frequency in the updated profile, adjust the maximum delay offset value and perturbation trigger condition of the network jitter fingerprint model; Use the adjusted model parameters to update the control strategy of the next round of synchronization tasks, including the maximum out-of-order number, waiting time limit, perturbation trigger mechanism, perturbation proportion, and retry delay threshold.

[0014] The application further provides a digital security-based archive information processing system for implementing the above-mentioned digital security-based archive information processing method, comprising a time sequence profile modeling module, a dual-track hash verification module, a sequential chain construction and verification module, a sequential correction module, an error disturbance verification module, and a strategy updating and closed-loop control module. The time sequence profile modeling module constructs a time sequence consistency profile, collects the actual arrival time and corresponding position index of each archive data slice, and generates a network jitter fingerprint model reflecting the instantaneous delay fluctuation characteristics based on multiple rounds of transmission data. The dual-track hash verification module injects a unique position label into each archive data slice during data inbound, and the position label and the slice content jointly participate in hash calculation to generate a dual-check baseline of content hash and position hash in parallel. The sequential chain construction and verification module constructs a sequential proof chain based on the dual-check baseline, organizes the sequence number, parent-child reference relationship, and timestamp of the archive data slice into a continuous and verifiable ordered chain structure, and performs chain structure verification to identify sequential integrity anomalies. The sequential correction module, after identifying the sequential integrity anomaly, performs time sequence playback and position reorganization of the archive data slice according to the sequential proof chain, and performs consistency comparison and correction block by block combined with the position label and the corresponding content hash. The error disturbance verification module, after completing the archive data reorganization and correction, selects part of the corrected slices for error disturbance processing and performs hash verification, and if the verification value does not change after disturbance, it is determined that there is a risk of hash collision and the synchronization process is interrupted. The strategy updating and closed-loop control module, after the synchronization process is interrupted or the correction is completed, writes the interruption event, abnormal path information, and rearrangement correction result back to the time sequence consistency profile, and updates the network jitter fingerprint model and the processing strategy threshold value accordingly, to complete the closed-loop control process of anomaly detection, sequential repair, risk identification, and strategy evolution.

[0015] The application has at least the following beneficial effects: This invention constructs a temporal consistency profile and a network jitter fingerprint model, enabling the system to detect abnormal transmission behavior in real time. It establishes a sequence verification baseline using both content hashing and location hashing mechanisms. When sequence errors occur, it automatically identifies the abnormal chain structure and performs temporal replay and location reorganization, ensuring that the content and logical consistency of the reorganized archives are not compromised. Furthermore, by combining error disturbance and hash consistency detection mechanisms, it enhances the ability to identify risks of hash homomorphic collisions, preventing tampered data from accidentally passing verification and flowing into the replica chain. Finally, through the write-back of synchronization processing results and adaptive model updates, the entire synchronization process possesses closed-loop control and strategy evolution capabilities, effectively improving the synchronization accuracy, attack resistance, and long-term verifiability of archival data in a distributed, geographically dispersed environment, fundamentally guaranteeing the integrity, reliability, and traceability of digital archives. Attached Figure Description

[0016] Figure 1 This is a flowchart of the processing method in an embodiment of the present invention; Figure 2 This is a schematic diagram of the processing system modules in an embodiment of the present invention. Detailed Implementation

[0017] Exemplary embodiments will now be described more fully with reference to the accompanying drawings; however, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, these exemplary embodiments are provided so that the description of this disclosure will be more complete and fully convey the concept of the exemplary embodiments to those skilled in the art.

[0018] like Figures 1-2 As shown, the method for processing archival information based on digital security includes the following steps: S1. Construct a time-series consistency profile, collect the actual arrival time and corresponding location index of each archive data fragment, and generate a network jitter fingerprint model that reflects the instantaneous delay fluctuation characteristics based on multi-round transmission data.

[0019] To address the issues of disordered order and misjudgment of content consistency in the process of synchronizing archival data across multiple locations via communication networks, a processing method is proposed to identify network transmission fluctuation characteristics and construct a baseline for order integrity verification. This method collects and analyzes the temporal behavior during the actual fragmented transmission of archival data throughout the entire process, generates representative network delay characteristic data, and constructs a reference structure that reflects the fluctuation pattern of the transmission path, thereby providing data support for the order verification mechanism.

[0020] The specific steps of S1 are as follows: In the data preparation phase, each complete archive file is segmented according to the preset logical rules; specifically, a fixed byte number segmentation method can be used, for example, each archive is sequentially divided into units of 128KB to generate a number of consecutive shards; for each shard, a unique logical number is assigned, which is a natural number starting from 0 and increasing; before sending the shard, the system generates a sending timestamp for each shard, which is generated using the local time acquisition method, with a unit of milliseconds; when the sending operation is performed, the system encapsulates the logical number of each shard and the corresponding sending timestamp into a data structure to form a set of data entities containing complete identification information; the data entity is sent to the receiving end through the preset communication protocol.

[0021] In the data receiving phase, when the receiving end receives a certain data entity, it first parses the received content to extract the logical number and sending timestamp information contained therein, and generates a new receiving timestamp at the moment of parsing completion; the receiving timestamp uses the same time unit and generation method as the sending timestamp, thereby ensuring that the time field is comparable; the receiving end stores the logical number, sending timestamp and receiving timestamp of each shard as a set of structured records; each record contains three fields: the logical number field, the sending time field and the receiving time field; in this way, the receiving end can obtain the real time interval experienced by each shard from sending to receiving in the current transmission round.

[0022] After completing the data records of the current round of transmission, the system continuously performs multiple rounds of data transmission processes of the same or similar scale to obtain more extensive sample data for subsequent statistical analysis; in each transmission process, the same logical number allocation method and timestamp recording method are used to ensure that the data of each round has uniform structure and comparability; after the data accumulation reaches a certain number of rounds (such as 10 rounds or 20 rounds), the receiving timestamps and sending timestamps of the same logical number in different rounds are compared to calculate the average transmission delay, maximum delay, minimum delay and mutation frequency within a certain time period; a set of delay characteristic parameter sets is generated for each logical number; for example, the transmission delay of shard number 12 in 10 rounds of transmission is 130ms, 128ms, 132ms, …, the average value, fluctuation range and number of frequent delay changes can be calculated; similarly, all numbers are statistically summarized to obtain a delay fluctuation data set covering all shard numbers.

[0023] Based on the above delay fluctuation data set, the data is arranged in logical number order to form a structured time sequence reference sequence; in the sequence, each record contains logical number, average delay value, maximum offset value, minimum offset value and delay mutation frequency; by sorting these records, the time characteristic information of multiple logical numbers in multiple transmission rounds is combined to form a highly integrated network delay characteristic representation structure; the structure constitutes the network jitter fingerprint model, which can be used as a time reference for sequence judgment in subsequent archive data synchronization process; once the arrival time of a slice in a certain synchronization deviates significantly from the delay characteristics of the corresponding number in the jitter fingerprint model, it can be determined that the slice has abnormal path fluctuation or sequence dislocation, thereby triggering an early warning in the data reorganization and sequence verification process.

[0024] The steps of injecting a position tag for each slice and constructing a double hash check ensure the consistency of data content and logical order, and effectively verify the consistency, thereby solving the problem that the traditional hash check method cannot detect slice sequence disorder; in the prior art, the conventional hash fingerprint calculation is usually only performed on the data content itself, and the logical order of the data is assumed to be unchanged during transmission; however, in the actual network environment, especially in the high-frequency remote synchronization and multi-path transmission scenario, the data slices may be out of order due to link jitter, congestion relief or forwarding strategy of intermediate nodes; at this time, only content hash calculation may result in a false positive check result that the content is correct but the position is wrong, which misjudges the data as complete and reliable; therefore, the step injects a position tag for each slice, such as embedding an immutable sequence number field in the slice structure, so that each slice carries the position identifier corresponding to the slicing; then, in the hash check calculation, the slice content and the position tag are spliced together and uniformly used as input to generate a hash value, thereby constructing a double-track check mechanism in which the content hash and the position hash exist in parallel; the direct technical effect of this is that even if the content of a slice is not tampered with, as long as its logical position changes, the combined input of the position tag and the content after splicing will result in a hash value that is inconsistent with the expected value, thereby discovering and blocking the continued propagation of the abnormal slice in time, effectively avoiding the identification of the error sequence as a legal state in the subsequent process; this way strengthens the structural binding features of the data, so that each data slice has a unique "content-position one-to-one correspondence" in the entire processing process, which constitutes an important technical prerequisite for the subsequent sequence check, anomaly identification and reorganization correction mechanism.

[0025] S2, in the data inbound process, a unique position tag is injected for each archive data slice, and the position tag and the slice content jointly participate in hash calculation to generate a double-check baseline in parallel with the content hash and the position hash.

[0026] After the completion of the archiving data fragmentation processing, transmission time collection and the construction of the timing consistency profile, to solve the problem of incorrect content verification caused by the disorder of data sequence in the actual network transmission process, this step further proposes a dual hash verification mechanism based on position binding. This mechanism binds the original logical position of each archive fragment with its data content and generates two independent but mutually supporting verification values, thereby enhancing the recognition and verification ability of data sequence consistency on the basis of maintaining the original content integrity verification ability, and avoiding the missed detection problem of "correct content but wrong position" existing in the traditional way.

[0027] The specific steps of S2 are as follows: After the content of the archive file is cut, for each archive data fragment generated, a logical position number is assigned according to its order of appearance in the original file; the number exists in the form of an integer, starting from 0 and increasing one by one, for example, the first fragment is numbered 0, the second is numbered 1, and so on, until the last fragment; in order to ensure that the position number has a physical binding relationship with the fragment content, the number is not transmitted as external additional information, but is embedded in the structure of the fragment; specifically, a fixed-length data field is reserved at the starting position of each fragment for storing the logical number of the fragment, for example, a 4-byte unsigned integer field is used to represent the number value; the field is filled when the fragment is written into the cache or ready for encapsulation and transmission, and is fixed in the fragment as an unchangeable component.

[0028] After the logical number is embedded in the fragment, a data structure is constructed for subsequent hash calculation; the data structure consists of two parts, the first part is the aforementioned 4-byte logical number field embedded, and the second part is all content data of the fragment except the number field; the two parts are spliced in order in the physical memory or in the buffer before encapsulation, ensuring that the logical number is in front and the content data is in the back, forming a continuous data body to be processed; when preparing to perform the hash operation, the complete data body is taken as the input, and the data digest operation is performed to generate a set of verification values representing the "content and position binding relationship" of the fragment; here, the position and content are treated as an inseparable entity for unified processing, rather than checking the content data separately, so that any change to the position field or the content field will affect the calculation result of the final verification value.

[0029] To enhance the controllability and reviewability of the check, the application adopts a double-check structure, that is, two independent check values are generated for each fragment; the first group of check values is the content check value, which is generated only with the content part in the fragment as input, and is mainly used to determine whether the fragment data has suffered byte-level tampering or loss in the transmission process; the second group of check values is the position binding check value, which is generated with the complete data body as input, that is, the whole structure containing the number field and the content field, and is used to check whether the fragment maintains its original sequence position; the content check value is used to confirm that the data has not changed, and the position binding check value is used to confirm that the position has not changed, and the two are complementary and cannot be replaced; the two generated check values are stored in the packaging structure of the fragment in the form of fixed-length bytes, and the content check value can be placed at the tail of the packaging body, and the position binding check value is placed after the number field; in this way, any node can directly extract the two groups of check values when receiving the data fragment, and compare them with the received data to determine whether the fragment is complete and correct in position.

[0030] After the above two check values are generated and attached to the fragment packaging body, the fragment is regarded as a data entity with complete check information, with traceability and verification; after the data reaches the receiver, the receiver first reads the number field and content data in the front part of the fragment, then recombines the data body according to the same rule, and performs data digest operation to obtain a recalculated position binding check value; compare the calculated value with the original position binding check value attached in the packaging, if they are consistent, it is considered that the fragment has not experienced sequence dislocation, if they are inconsistent, the fragment is immediately marked as sequence abnormal data; on this basis, the content field is calculated separately to obtain the content check value, and compared with the original value to confirm whether the data content is modified or damaged; if any check value comparison fails, the fragment will not be accepted into the subsequent recombination process, but will be disposed by the abnormal handling link, to prevent it from participating in the splicing or storage of the subsequent data structure, and to ensure that the sequence integrity and content authenticity of the entire archive data are not damaged after recombination.

[0031] The order proof chain is constructed, and the fragment number, parent-child reference relationship and timestamp are organized into a continuous and verifiable ordered linked list. The function is to establish a strong order verifiable structure for the transmission of archive data fragments, and to solve the problem that the fragment order disorder caused by link jitter, out-of-order arrival or malicious tampering cannot be accurately detected and traced in the traditional distributed synchronization process. In the prior art, the integrity of the data is usually verified by the content hash value, but this method only focuses on the content of the fragment itself and cannot determine whether the content is located at the correct logical position or whether it is spliced in the original order. Once an attacker copies a legal fragment and places it in the wrong position, the traditional verification mechanism cannot detect this abnormal behavior, which leads to logical structure errors, semantic confusion and even security vulnerabilities after the archive is reassembled. Therefore, this step constructs an order proof chain, explicitly expresses the logical relationship between each fragment and its previous and next fragments in the form of a data structure, and supplements the timestamp information recorded during the transmission of the fragment to form a linear structure linked list composed of multiple related fragment nodes. In this linked list, the correctness of any node depends not only on the correctness of its own data, but also on whether the order relationship between it and its adjacent nodes is continuous, consistent and verifiable. If any node is missing, out of order, has inconsistent parent-child references or has abnormal timestamps, the entire chain will be interrupted, triggering an order anomaly marker. In this way, the order proof chain not only realizes the structural strong constraint of data order integrity, but also provides a clear basis for subsequent abnormal correction, rearrangement recovery and synchronization control. This structure fundamentally enhances the system's ability to identify order level errors, and is particularly suitable for the strong consistency requirements for the order authenticity and continuity of archive data in multi-source asynchronous writing and cross-regional multi-node synchronization scenarios.

[0032] S3, based on the double-check baseline, constructs an order proof chain, organizes the sequence number, parent-child reference relationship and timestamp of the archive data fragments into a continuous and verifiable ordered chain structure, and performs chain structure verification to identify order integrity anomalies.

[0033] After the aforementioned completion of the logical position number injection of the archive data fragments and the generation of the double-check values (content check value and position binding check value), in order to guarantee the order continuity of the archive data in a multi-fragment, asynchronous arrival environment from a global perspective, this step further proposes a method of linking all fragments in a chain structure, so that each fragment not only has independence in structure, but also must strictly depend on the information of its previous fragment, forming a continuous and verifiable order linked list. The order linked list constitutes an "order proof chain", and through its structure integrity verification, it can effectively identify order integrity anomalies caused by network jitter, out-of-order retransmission or malicious packet insertion, and avoid the incorrect merging or writing of fragments with order disorder into the archive.

[0034] The specific steps of S3 are as follows: Before sending the archive fragments, a direct predecessor reference field of each fragment in logical order is preset based on the double-check baseline; the specific method is: for the fragment numbered N, find the fragment numbered N-1, and extract two hash values from the predecessor fragment, which are content check value and position binding check value; splice the two hash values into a fixed-length binary data as the "parent reference field" embedded in the current fragment numbered N structure; this field is used to identify the predecessor dependency of the current fragment in the structure chain table, to ensure that the data receiver can backtrack the previous fragment information that should be connected by reading the parent reference field; in addition, during the construction of the fragment structure, a "sending timestamp field" is also attached to each fragment, which obtains the current millisecond-level time value through the system time function and writes it into a fixed-length field, ensuring that each fragment carries absolute time information of its sending time, which is used for subsequent network delay and order comparison.

[0035] When the archive data starts to transmit and is received by the receiver, the logical number field, parent reference field and sending timestamp field of each fragment are extracted as it is received; after extraction, the receiver searches for the fragment corresponding to the predecessor number declared by the fragment in the local receiving buffer according to the logical number order; if the corresponding predecessor fragment can be found, the content check value and position binding check value of the fragment can be extracted from the fragment, and the two values are spliced and compared with the parent reference field carried by the current fragment at byte level; if they are completely consistent, it means that the fragment and its declared predecessor fragment have established a real and effective reference relationship; if the corresponding predecessor fragment cannot be found, or the parent reference field is found to be inconsistent with the expected value, the fragment is immediately identified as having structural abnormalities and is not included in the order chain reorganization process.

[0036] After the reference relationship between all received fragments is checked one by one, the entire order chain table structure is constructed; the process starts from the fragment numbered 0, which is the starting point of the chain table (the fragment has no parent reference field), and checks whether the fragments numbered 1, 2, 3, … exist and whether they have successfully passed the reference check of the previous fragment according to the logical number increasing order; each legal reference path will be connected as a ring node in the chain table, and once the corresponding fragment cannot be found at any number, or the parent reference field is found to be inconsistent with the predecessor fragment, the chain table will be interrupted at that number; the chain table interruption position, the reason for the interruption (such as missing, reference inconsistency), the time offset value between the current timestamp and the sending timestamp will be recorded during the construction process, which will be used as the basis for judging the order integrity status; after the entire chain construction is completed, if all numbers are continuous, the reference relationship is verified, and the timestamp interval is within the acceptable range (judged according to the network jitter model threshold), the chain is marked as sequential complete; otherwise, it is marked as a sequential abnormal chain, and enters the subsequent abnormal repair process; After constructing the sequential proof chain structure and performing the verification, the receiver decides the subsequent processing strategy according to the verification result; for a complete sequential chain, all its fragments will be sequentially written into the archive reorganization buffer according to the logical number; for a chain structure with interruptions or inconsistent references, no write operation is performed, but the abnormal fragments are saved to the abnormal data area, and the structure information is recorded for the adaptive rearrangement processing in the next stage; at the same time, the chain construction results of the current round, including the number of fragments, the success rate of sequence, the minimum and maximum time offset values, the number of chain breakpoints, the number of parent reference verification failures, etc., are written into the sequential verification state table to provide a basis for subsequent network model updating and synchronization process strategy adjustment.

[0037] The function of performing jitter adaptive rearrangement and content and position correction is to automatically restore the correct logical order and structural integrity of the data according to the established sequential proof chain and double verification baseline without relying on the original sending order, so as to ensure that the archive content still maintains the original semantics and usability in the reorganization stage; in a multi-copy geographically distributed synchronization environment, data fragments often arrive out of order due to transient jitter in the network link, changes in routing path, adjustment of cache strategy or other transmission abnormalities, even if the content itself has not been tampered with, but the sequence disorder will lead to the entire archive being unable to be correctly restored; traditional technologies often rely on the receiving order or preset buffer time limit for simple sorting, and cannot accurately identify and repair microgranularity disorder phenomena, which is easy to misassemble the content due to sequence errors, and further cause structural damage or security misjudgment; this step performs a playback sorting operation based on the structure information on all received out-of-order fragments after identifying the sequence anomaly, i.e. not according to the arrival order, but rearranging according to the logical number and reference structure; at the same time, after the rearrangement is completed, the position consistency of the rearrangement result is verified by combining the position label and position hash check value bound to each fragment, to ensure that all fragments are not only in order in structure, but also strictly consistent in content and position binding; this process can also repair part of the parent reference breakage caused by out-of-order, and through reordering, the fragments that were mistakenly identified as abnormal due to sequence disorder are reconnected to the chain, thereby maximizing the recovery of misjudgment data; in summary, this step plays a key role in error correction and recovery in the overall synchronization process, and is an indispensable link in ensuring a high-reliability archive synchronization mechanism.

[0038] S4, after identifying the sequence integrity anomaly, performing time sequence playback and position reorganization of the archive data fragments according to the sequential proof chain, and combining the position label and the corresponding content hash for block-by-block consistency comparison and correction.

[0039] In the sequential proof chain verification phase, if there is a sequence interruption, a logical number discontinuity, a parent-child reference field mismatch, or a timestamp jump beyond the expected range, it can be determined that the archive data fragment has a sequential integrity anomaly during transmission. Such anomalies are often caused by link jitter, network retransmission, and out-of-order caching, and if not corrected in time, they can cause archive reorganization failure or content splicing errors. Therefore, an adaptive processing mechanism for sequential anomaly situations is proposed, which includes timing playback based on numbering and reference relationships, structural reorganization combined with position tags, and block-by-block consistency comparison and correction operations based on content and position hash values to ensure structural and content consistency of the archive data.

[0040] The specific implementation steps of S4 are as follows: After the sequence anomaly is identified, all archive data fragments participating in the verification in the current round are extracted from the receiving cache. Each fragment contains a logical number field, a parent reference field, a content field, a position tag field, a sending timestamp field, and a receiving timestamp field. These fragments are sorted in ascending order according to the number field value to form a preliminary logical sequence. After sorting, the parent reference field in each fragment is read in order starting from 0, and an accurate comparison is made with the verification value of the previous fragment corresponding to the number-1. It is determined whether the fragment has an effective reference relationship with the previous sequence. If the hash value referenced by a certain fragment does not match the actual hash value of the previous number fragment, the position is recorded as a break point, and the current fragment is marked as "structurally disconnected state".

[0041] After completing the logical number sorting and identifying the break point, a timing playback table for reorganization is constructed based on the aforementioned number sequence and reference results. The playback table uses logical numbers as indexes and records the content hash value, position tag, reference state, and timestamp difference value corresponding to each number. Based on this table structure, the data content is played back in order starting from number 0, and the theoretical placement position of each fragment is recalculated. For the number positions that have existing breaks, they are placed in a separate repair queue for further verification. For the continuous and normally referenced part, it is assembled into a continuous structure chain in order of numbering to form a basic splicing path for reorganization.

[0042] After the initial path splicing construction, the position verification operation is performed on each numbered position of the fragment; first read the position tag field in the fragment, and compare its value with the current numbered value; if they are consistent, it means that the current position of the fragment is consistent with its declared position; if they are inconsistent, it is determined that the sequence of the fragment has been disordered in the transmission process; for each disordered fragment, extract its content field and position tag field, splice them into a complete data body, regenerate the position binding hash value, and compare it with the original position hash value; if they are consistent, it means that the content has not been tampered with, only the sequence is disordered; if they are inconsistent, it means that the content and position have both changed, and the authenticity cannot be confirmed, the fragment is marked as "content-position inconsistent data" and moved to the exception buffer.

[0043] For all disordered fragments that have passed the position verification and have consistent hash values, the correction operation is performed, which places them in the predetermined position according to the number, and updates the parent reference field after the correction is completed, so that it correctly references the hash value of its new previous fragment; for the part of the structure chain that has restored continuity due to correction, the chain tail check value is refreshed to ensure the integrity of the structure; for the abnormal fragments marked as "content-position inconsistent", they do not participate in the current round of reorganization process, and are waiting for subsequent retransmission or manual intervention processing; after the whole correction is completed, the reorganization state table of the current sequence chain is updated, which includes the numbered range of successful reorganization, the number of corrected fragments, the content verification pass rate, the number of position rearrangements and the final chain closure state.

[0044] After the error disturbance check is performed in the synchronization process, if it is found that there is a risk of hash homomorphism collision, or the sharding sequence correction and rearrangement operation is completed, the abnormal information and processing results generated in this round of synchronization must be written back to the timing consistency profile, and the network jitter fingerprint model and processing strategy threshold are updated to realize the continuous evolution and adaptive optimization of the synchronization control chain; the core role of this step is to establish a dynamic feedback mechanism for the synchronization process, so that the system can continuously optimize the identification ability, processing response strategy and security protection ability for future transmission behavior according to the actual sequence abnormality, correction behavior and potential risk; in the prior art, data synchronization often uses static configuration strategy and preset fault tolerance threshold, lacks the ability to attribute to historical abnormalities and the ability to inherit processing experience, resulting in slow response strategy, high misjudgment rate when facing different network states, distributed node topology changes or attack means; while the closed-loop control step proposed in the present application writes the link breakage times, out-of-order interval range, rearrangement correction times, position dislocation ratio, hash disturbance abnormality occurrence rate and other parameters recorded in each round of synchronization into the timing consistency profile, and updates the current network jitter model accordingly, so that the model can reflect the fluctuation characteristic change trend of the transmission behavior under the current network environment; at the same time, the processing strategy parameters such as the maximum tolerable out-of-order fragment number, correction waiting time limit, disturbance check sample ratio are adaptively adjusted based on historical behavior, realizing fine-grained optimization of the abnormal response mechanism; through this feedback mechanism, the system accumulates the perception accuracy and disposal ability of the actual network behavior round by round, so that the archive information processing not only has static checking ability, but also has long-term evolution ability for dynamic network environment, thereby significantly improving the security, stability and adaptability of the entire digital archive transmission process.

[0045] S5, after the archive data reorganization and correction are completed, part of the corrected shards are selected for error disturbance processing, and hash verification is performed, if the check value after disturbance does not change, it is determined that there is a risk of hash collision and the synchronization process is interrupted.

[0046] After performing sequential playback and position reorganization operations on the aforementioned fragments of the archive data, a set of "corrected valid fragment sets" that have passed the content hash and position hash verification has been obtained. Each fragment in this set has been relocated and restored to its original logical position. However, in actual engineering scenarios, relying solely on hash value comparison to determine whether the content has been tampered with still carries certain risks, especially when facing hash homomorphic collision attacks. Attackers can construct multiple different data inputs that still produce the same hash value after perturbation, thereby bypassing content integrity verification. In this case, even if the content has been tampered with, it may still be misjudged as legitimate data, seriously threatening the security of archive data. To address this, this invention designs a perturbation testing mechanism. By applying small but controllable perturbations to some of the corrected fragments and performing hash verification again, it identifies whether there are potential collision risks in the current hash mechanism and determines whether to terminate the current synchronization round.

[0047] The specific steps for S5 are as follows: After the correction operation is completed, select several fragments that have successfully passed the double hash check from the logical number sequence as perturbation samples. The selection method is to sample at fixed intervals, for example, select one fragment every four logical numbers, while ensuring that at least the first segment, the middle segment and the last segment are covered. Each sample fragment includes: number field, position label field, original content field, original content hash value and original position binding hash value. Copy this information to a temporary data buffer for subsequent perturbation processing operations to avoid affecting the original data structure.

[0048] In the sample data buffer, a round of manual error perturbation is performed on the fragmented content field. The perturbation method involves applying a small change to a specific byte position in the fragmented content, for example, selecting the byte at offset 16 (i.e., the 17th byte) in the content data and incrementing or decrementing the original byte value by 1 (cyclically processing between 0 and 255). The perturbed content data is denoted as... The original content before the disturbance is denoted as After the perturbation is complete, retain the original location label and the number field, and only modify the content field; use the perturbed content. Combined with the original location labels to form the input body Then, recalculate the hash value to generate the perturbed location binding hash value and content hash value.

[0049] The perturbated hash value is compared byte by byte with the original hash value. To facilitate subsequent verification, the following hash comparison offset rate calculation formula can be used for auxiliary verification: in: It is the perturbation hash difference ratio (expressed as a percentage). is the number of bytes in the disturbed hash value that are inconsistent with the original hash value, is the total number of bytes of the hash value, for example, for the SHA-256 hash algorithm, bytes (256 bits); if , that is, all bytes are completely consistent, it means that the disturbed content still generates the same hash value as the original content, and it is determined to be a hash homomorphic collision risk; if , the hash mechanism has the ability to respond to the disturbance, and the current hash structure is acceptable. The above calculation is independently performed on each sample fragment, and a hash sensitivity statistical table is formed for global judgment.

[0050] The disturbance hash difference ratio of all samples is counted; if there is one or more fragments whose disturbed hash value is completely unchanged, that is, it satisfies , the current hash structure is determined to have a homomorphic collision risk; at this time, the current synchronization process is immediately interrupted, the write operation of the batch data to the replica database is stopped, and a risk event report is generated; the report content includes: the number of fragments that have collided, the byte change details before and after the disturbance, the disturbance position, the comparison result of the disturbed hash value with the original hash value, and the final verification state mark; the interruption operation will also trigger the standby strategy, such as switching to a backup hash algorithm, activating a double-factor hash combination mechanism, or requesting to re-initiate the original data synchronization process, to ensure that the system does not accept dangerous data suspected of tampering; on the contrary, if the hash values of all samples change after disturbance, it is considered that the hash structure has anti-collision ability, and the batch data is allowed to enter the next synchronization process, such as archiving storage or off-site replication.

[0051] S6, after the synchronization process is interrupted or corrected, the interruption event, abnormal path information and rearrangement correction result are written back to the time sequence consistency profile, and the network jitter fingerprint model and processing strategy threshold are updated accordingly, completing the closed-loop control process of abnormal detection, sequence repair, risk identification and strategy evolution.

[0052] After completing the sequence rearrangement, position correction and error disturbance verification of the archive data fragments, whether the current synchronization process is terminated due to hash collision risk or all reorganized data is determined to be acceptable after verification, all abnormal information and processing results generated in the current synchronization process should be recorded in a structured manner and written back to the time sequence consistency profile constructed as described above. By recording and writing in this way, the problem events, rearrangement behavior and risk signs in the synchronization behavior are bound to the network transmission characteristics, which helps to dynamically adjust the network jitter fingerprint model and synchronization processing strategy, so as to realize precise adaptation and adaptive optimization control of future synchronization tasks, and build a closed-loop mechanism for archive information processing flow.

[0053] The specific steps of S6 are as follows: The structure of the write-back data is clear; all the abnormal contents involved in the current synchronization process include: synchronization interruption events caused by disturbance verification failure, logical number interval of link breakage, disordered receiving number sequence of fragments before rearrangement, mapping relationship table between original number and rearranged number, total number of position correction and position of occurrence, number of fragments with content hash verification failure, sample number with consistent hash in disturbance verification, and time period of processing completion, etc.; these information is structured into a complete list of abnormal data, each item is clearly marked with the corresponding fragment number, event type, time identifier and disposal status; this data list is stored separately as a separate processing record from the archive data itself, ensuring the independence of the main data structure.

[0054] According to the abnormal data list, the original time sequence consistency profile is updated incrementally; the profile has been established at the initial stage of data fragment reception, and its structure is a two-dimensional time mapping table indexed by fragment logical number, each number corresponds to a data structure containing multiple synchronization records; for the number section with abnormality in this round, a set of fields is added in its corresponding position, including: rearrangement flag (indicating whether to participate in rearrangement), correction success flag (indicating whether it has been successfully corrected), disturbance verification state (indicating whether it passes the disturbance check) and the time offset value of this round (represented by the difference between the sending timestamp and the receiving timestamp); the updated profile not only retains the original arrival characteristics of the fragments, but also introduces the "behavior consequence" field, so that each number can not only reflect the transmission state, but also reflect the frequency of risky behavior.

[0055] Based on the updated profile data, the jitter behavior characteristics under the current network transmission channel are re-evaluated, and the existing network jitter fingerprint model is adjusted in detail; The specific steps are: count the number of abnormal markers added in the profile, if more than three consecutive logical numbers have sequential breakage or content verification failure, mark this section as a high-risk number section; for this number section, adjust its corresponding network jitter parameters, such as maximum offset delay, fluctuation period, head-to-tail delay difference, etc.; for example, if numbers 12 to 18 have rearrangement in three synchronization rounds, the allowed maximum offset value of this section can be increased from the original 300 milliseconds to 500 milliseconds; if the disturbance failure rate is higher than 50%, the disturbance detection trigger frequency of this section can be increased from every 10 fragments to every 5 fragments; such adjustment does not change the model structure, only the specific parameter setting is enhanced, so as to improve the prediction accuracy and intervention timeliness of the model for future synchronization behavior.

[0056] According to the reconstructed network jitter fingerprint model, the strategy parameters of the next round of synchronization task are dynamically updated; the strategy parameters include but are not limited to the following five items: the maximum allowed out-of-order fragment number (for example, increased from 5 to 3 to improve strictness), the maximum time limit for waiting for sequential reorganization (for example, shortened from 800 milliseconds to 500 milliseconds), whether to trigger disturbance checking (such as forced triggering when the number of continuous rearrangements is greater than 2), the disturbance sample selection ratio (for example, increased from 10% to 25%), and the cooling retry time after synchronization failure (such as delaying 10 seconds before retrying); these parameters are generated by the specific performance of abnormal data, written into the synchronization strategy control table immediately after the profile update, and used as a reference for synchronization control execution before the next archive data fragment synchronization operation starts.

[0057] The main role of this step is to build the adaptive evolution ability and closed-loop control mechanism in the digital archive fragment synchronization process. Through the interrupt event, abnormal path information and the write-back operation of the rearrangement correction result in each round of synchronization, the network jitter fingerprint model and the parameter threshold of the processing strategy are dynamically updated, so that the system has the ability of continuous learning, accurate response and risk prefeeding when facing complex network environment or attack behavior; in the actual digital archive management process, the archive content is usually transmitted and synchronized in the form of data fragments among multiple geographically distributed nodes. If there is a lack of dynamic behavior perception ability and strategy adjustment mechanism, the system will only rely on static configuration for verification and judgment, which is easy to misjudge or fail to tolerate when the network state mutates or the data is maliciously tampered with, resulting in the spread and coverage of false data among multiple copies, forming irreversible information pollution; this step establishes a "time sequence consistency profile" based on multi-dimensional joint modeling of time, location and behavior characteristics, records the behavior results of each synchronization process such as the sequence chain break position, the rearrangement correction frequency, the disturbance checking failure distribution, the jitter abnormal time window, and maps them to the transmission number and time sequence, and then corrects the time delay fluctuation threshold, the sequence reorganization tolerance range and the safety detection frequency in the original model; this not only improves the identification accuracy of the system for future high-risk synchronization behavior, but also enables the strategy control parameters to self-optimize according to the historical actual running state, significantly reduces the misjudgment rate and synchronization interruption rate, and fundamentally enhances the stable adaptation ability of the entire digital archive system to complex environments, the data integrity protection ability and the reliable evolution ability of the synchronization process in the long-term running; in short, this step is the key support link for realizing the transformation of archive information processing from static judgment to dynamic regulation, from passive fault tolerance to active defense.

[0058] The application provides a file information processing method based on digital security, which can effectively solve the problems of data fragment sequence disorder, hash misjudgment and file content error propagation caused by network link instantaneous jitter in the prior art, and has the beneficial effects that: by constructing a time sequence consistency profile and a network jitter fingerprint model, the system can realize real-time sensing of transmission abnormal behavior, and establish a sequence verification baseline by means of content hash and position hash dual mechanism, so that when sequence disorder occurs, the abnormal chain structure can be automatically identified and time sequence playback and position reorganization can be performed, and the consistency of the content and logic of the reorganized file is ensured not to be damaged; further combined with the error disturbance and hash consistency detection mechanism, the risk identification ability of hash homomorphism collision is enhanced, and the tampered data is prevented from flowing into the copy chain through the verification; finally, through the write-back of the synchronization processing result and the model adaptive update, the whole synchronization process has the closed loop control ability and the strategy evolution ability, and the synchronization accuracy, the anti-attack ability and the long-term verifiability of the file data in the distributed remote environment are effectively improved, and the integrity, the reliability and the traceability of the digital file are fundamentally guaranteed.

[0059] As shown in Figure 2 The application also provides a file information processing system based on digital security, which is used for realizing the file information processing method based on digital security, and comprises a time sequence profile modeling module, a dual-track hash verification module, a sequence chain construction and verification module, a sequence correction module, an error disturbance verification module and a strategy updating and closed loop control module. The time sequence profile modeling module is used for constructing a time sequence consistency profile, collecting the actual arrival time and the corresponding position index of each file data fragment, and generating a network jitter fingerprint model reflecting the instantaneous delay fluctuation characteristics based on multiple rounds of transmission data; The dual-track hash verification module is used for injecting a unique position label into each file data fragment during data inbound process, and participating in hash calculation together with the position label and the fragment content, so as to generate a dual verification baseline of content hash and position hash in parallel; The sequence chain construction and verification module is used for constructing a sequence proof chain based on the dual verification baseline, organizing the sequence number, the parent-child reference relationship and the timestamp of the file data fragment into a continuous and verifiable ordered chain structure, and identifying the sequence integrity abnormality by executing chain structure verification; The sequence correction module is used for performing time sequence playback and position reorganization of the file data fragment according to the sequence proof chain after identifying the sequence integrity abnormality, and performing consistency comparison and correction of the position label and the corresponding content hash block by block; The error disturbance verification module is used for performing error disturbance processing on part of the corrected fragments after completing the file data reorganization and correction, and performing hash verification, so that if the verification value does not change after disturbance, it is determined that there is a hash collision risk and the synchronization process is interrupted; The policy updating and closed loop control module writes the interrupt event, abnormal path information and rearrangement correction result back to the timing consistency profile after the synchronous flow is interrupted or corrected, and updates the network jitter fingerprint model and processing policy threshold according to the timing consistency profile, so as to complete the closed loop control process of abnormal detection, sequence repair, risk identification and policy evolution.

[0060] The file information processing method based on digital security is implemented by the file information processing system based on digital security, and the specific method and process of the file information processing system based on digital security are described in the above embodiments of the file information processing method based on digital security, which will not be repeated here.

[0061] The above only describes some exemplary embodiments of the present application by way of illustration, and it is needless to say that those skilled in the art can modify the described embodiments in various ways without departing from the spirit and scope of the present application. Therefore, the above drawings and descriptions are illustrative in nature and should not be construed as limiting the scope of the claims of the present application.

Claims

1. A method for processing archival information based on digitized security, characterized by: The method comprises the following steps: S1, constructing a timing consistency profile, collecting the actual arrival time and corresponding position index of each archive data slice, and generating a network jitter fingerprint model reflecting the instantaneous delay fluctuation characteristics based on multiple rounds of transmission data; S2, injecting a unique position label into each archive data slice during data inbound, and participating in hash calculation together with the slice content to generate a dual-check baseline of content hash and position hash in parallel; S3, based on the dual-check baseline, constructing a sequence proof chain, organizing the sequence number, parent-child reference relationship and timestamp of the archive data slice into a continuous and verifiable ordered chain structure, and performing chain structure verification to identify sequence integrity anomalies; S4, after identifying sequence integrity anomalies, performing timing playback and position reorganization of the archive data slice according to the sequence proof chain, and performing consistency comparison and correction block by block combined with the position label and the corresponding content hash; S5, after completing the archive data reorganization and correction, selecting part of the corrected slices for error disturbance processing, and performing hash verification, if the verification value does not change after disturbance, it is determined that there is a risk of hash collision and the synchronization process is interrupted; S6, after the synchronization process is interrupted or the correction is completed, the interruption event, abnormal path information and rearrangement correction result are written back to the timing consistency profile, and the network jitter fingerprint model and processing strategy threshold are updated accordingly, completing the closed-loop control process of anomaly detection, sequence repair, risk identification and strategy evolution.

2. The digitized security based archival information processing method as claimed in claim 1, wherein: Step S1 includes: Divide each complete archive file into multiple slices according to a fixed number of bytes, and assign a unique logical number and generate a sending timestamp to each slice; Encapsulate the logical number and the corresponding sending timestamp into a data structure before sending, and send it to the receiving end through the communication protocol; The receiving end parses the received data structure, extracts the logical number and the sending timestamp, and generates a receiving timestamp at the moment of parsing, forming a structured record containing the logical number, the sending timestamp and the receiving timestamp; Repeat the multiple rounds of data transmission, and perform statistical analysis on the records with the same logical number to generate a delay feature set containing average delay, maximum deviation, minimum deviation and delay mutation frequency, and arrange them in order according to the logical number to form a network jitter fingerprint model.

3. The digitized security based archival information processing method as claimed in claim 1, wherein: Step S2 includes: Embed a unique logical position number in each archive data slice, which is incremented in integer form, and the embedding method is to write a fixed length number field at the beginning of the slice; Concatenate the number field and the content field in order to form a data body containing the number field and the content field; Generate a position binding check value using the data body as input, and generate a content check value using the content field as input, and store them in the encapsulation structure to form dual-check information; The receiving end reads the number field and the content field, recalculates the two sets of check values in the same way, and compares them with the original values to identify slice position dislocation or content tampering.

4. The digitized security based archival information processing method as claimed in claim 1, wherein: Step S3 includes: After constructing the dual-check baseline, set the parent reference field for each archive data slice, and write the content check value and the position binding check value of the previous slice with the same logical number into the current slice; Add a sending timestamp field to each archive data shard for subsequent time offset verification in sequence judgment; The receiving end extracts the logical number, parent reference field and sending timestamp of each shard, and compares the parent reference field with the corresponding double verification value in the previous number shard in sequence according to the logical number, judges whether the reference relationship matches, and records the breakpoint position and offset information according to the comparison result to form a sequence chain table. If all reference relationships are consistent and the time offset is within the threshold range, it is determined to be a complete sequence chain, otherwise it is marked as a sequence abnormal chain.

5. The digitized security based archival information processing method as claimed in claim 4, wherein: The steps of the receiving end extracting the logical number, parent reference field and sending timestamp of each shard, and comparing the parent reference field with the corresponding double verification value in the previous number shard in sequence according to the logical number are as follows: After extracting the logical number, parent reference field and sending timestamp of each archive data shard, the content verification value and position binding verification value of the previous number shard are retrieved in the local cache according to the increasing order of the logical number, and the two sets of verification values are spliced into a set of expected reference values. Then, the expected reference value is compared with the parent reference field carried by the current number shard byte by byte. If the comparison result is consistent, it is determined that the parent-child relationship is valid. If it is not consistent, it is determined that the shard has sequence abnormalities.

6. The digitized security based archival information processing method as claimed in claim 1, wherein: Step S4 includes: After identifying the sequence integrity abnormality, all archive data shards in this round are extracted and sorted in ascending order of logical number, and whether the parent reference field is consistent with the verification value of the previous number shard is identified, and the breakpoint is marked; A time sequence playback table is constructed, which records the content hash value, position label, reference state and time difference value of each number as an index to form a basic structure for recombination; The sorted shards are subjected to consistency comparison of position label and number value, and whether there is content tampering is verified in combination with the original position binding hash value; The misaligned shards that pass the verification are put back in the correct position and the parent reference field is updated to construct a continuous chain structure, and the shards marked as inconsistent in content and position are removed from the recombination process.

7. The digitized security based archival information processing method as claimed in claim 1, wherein: In the time sequence playback and position recombination process of the archive data shards according to the sequence proof chain after identifying the sequence integrity abnormality, the following steps are included: For each sorted archive data shard, extract its internally embedded position label field and compare it with the current number value one by one. If they are not consistent, it is determined that the shard has sequence misalignment. Then, the content field and position label field of the shard are extracted and spliced into a complete data body to regenerate the position binding hash value and compare it with the original position binding hash value carried in the shard. If the hash values are consistent, it is determined that the shard content has not been tampered with, only the sequence is wrong. If the hash values are not consistent, it is determined that the shard has both content and position abnormalities.

8. The digitized security based archival information processing method as claimed in claim 1, wherein: Step S5 includes: Extract samples from the verified shards at fixed intervals, copy the number field, position label field, content field and original hash value to a temporary buffer; Apply a small perturbation to the specified byte position in the content field of each sample, keep the number and position label unchanged, generate a perturbed data body, and recalculate the perturbed position binding hash value and content hash value; Compare the byte difference between the disturbed and original hash values. If the disturbed hash value is identical to the original value, it is determined that there is a risk of homomorphic collision, and the collision information is recorded and the risk state is marked; If any disturbed sample has a collision risk, the synchronization process is interrupted and data writing is prevented, triggering a backup strategy. If all disturbed samples pass the verification, the next synchronization link is allowed.

9. The digitized security based archival information processing method as claimed in claim 1, wherein: Step S6 includes: Form a structured abnormal data list from the synchronization interruption event, the chain break logic number section, the rearrangement mapping relationship, the position correction times, the disturbance verification failure record, and the processing time information; Write the slice number and corresponding behavior tag field involved in the abnormal data list to the time consistency profile, update the time offset value and state label of the original slice; Based on the updated profile, adjust the maximum delay offset value and disturbance trigger condition of the network jitter fingerprint model; Use the adjusted model parameters to update the control strategy for the next round of synchronization task, including the maximum out-of-order number, waiting time limit, disturbance trigger mechanism, disturbance proportion, and retry delay threshold.

10. A digital security-based archive information processing system for implementing the digital security-based archive information processing method according to any one of claims 1 to 9, characterized by: The system includes a time profile modeling module, a dual-track hash verification module, a sequence chain construction and verification module, a sequence correction module, an error disturbance verification module, and a strategy updating and closed-loop control module: The time profile modeling module constructs a time consistency profile, collects the actual arrival time and corresponding position index of each archive data slice, and generates a network jitter fingerprint model reflecting the instantaneous delay fluctuation characteristics based on multiple rounds of transmission data; The dual-track hash verification module injects a unique position tag into each archive data slice during data inbound, and performs hash calculation on the position tag and slice content together to generate a dual-check baseline of content hash and position hash; The sequence chain construction and verification module constructs a sequence proof chain based on the dual-check baseline, organizes the sequence number, parent-child reference relationship, and timestamp of the archive data slice into a continuous and verifiable ordered chain structure, and performs chain structure verification to identify sequence integrity anomalies; The sequence correction module performs time sequence playback and position reorganization of the archive data slice based on the sequence proof chain, and performs consistency comparison and correction block by block based on the position tag and corresponding content hash after identifying sequence integrity anomalies; The error disturbance verification module performs error disturbance processing on part of the corrected slices after the archive data reorganization and correction, and performs hash verification. If the verification value does not change after disturbance, it is determined that there is a risk of hash collision and the synchronization process is interrupted; The strategy updating and closed-loop control module writes the interruption event, abnormal path information, and rearrangement correction result to the time consistency profile after the synchronization process is interrupted or corrected, updates the network jitter fingerprint model and processing strategy threshold based on the profile, and completes the closed-loop control process of abnormal detection, sequence repair, risk identification, and strategy evolution.

Images