Relay chain-based cyanide-free process circuit board life cycle management system and method

Abstract

The invention discloses a relay chain-based cyanide-free process circuit board life cycle management system and method, and particularly relates to the technical field of circuit board green manufacturing and full life cycle digital thread management. Comprising the following steps: acquiring a plate identifier, a link identifier, process data, detection data and circulation data formed by a target plate in the processes of raw material entering, cyanide-free copper plating and cyanide-free plating processes, resin brushing for protection, etching, forming, detection, storage, transportation and recovery treatment, writing data segments of corresponding links according to an acquisition sequence, and outputting a front segment set; a candidate thread fragment chain is constructed for data of each link, admission judgment is executed according to an undertaking result of a subsequent adjacent link on a front segment, the segment subjected to undertaking verification is written into a main thread, and the segment which does not pass undertaking verification is written into a circumstantial evidence record, so that a life cycle digital thread containing the main thread and the circumstantial evidence record is generated.

Description

A Relay-Based Lifecycle Management System and Method for Cyanide-Free Process Circuit Boards Technical Field

[0001] This invention relates to the field of green manufacturing and full lifecycle digital thread management technology for circuit boards. More specifically, this invention relates to a lifecycle management system and method for cyanide-free process circuit boards based on relay chains. Background Technology

[0002] In the lifecycle management of cyanide-free process circuit boards, existing solutions mainly focus on how to connect the data generated at each stage—from raw material entry, cyanide-free copper plating, resin protection, etching, molding, testing, warehousing, transportation, and recycling—to facilitate subsequent status queries and accountability. The typical approach involves each process's equipment, testing station, and business system recording material identification, process parameters, test results, and flow information. These records are then written into a traceability platform, business database, or chain storage structure in chronological order, forming a lifecycle record for the corresponding board or batch. For example, in continuous production scenarios of multi-variety, small-batch cyanide-free process circuit boards, the same board may undergo re-plating, re-etching, re-inspection and machine change, manual re-judgment, and cross-shift continuation during processing. Simultaneously, it requires complete retention of green manufacturing responsibility evidence, continuous connection between preceding and subsequent processes, allowance for delayed feedback of test results, and the ability to verify the status of previous processes. Under these application conditions… Under current processing methods, a recurring issue arises where transient parameter fluctuations, short-term equipment offsets, or single-reassessment results collected in previous processes are directly written into the lifecycle master record without subsequent verification. While this creates a seemingly continuous traceability chain, subsequent anomaly attribution, responsibility identification, or compliance checks reveal discrepancies between previous and subsequent records, multiple contradictory interpretations of the same board, and the retention of temporary process information as formal lifecycle facts. This is because existing methods assume that data collected from the previous stage can be entered into the master record immediately, lacking a mechanism for formally approving the data based on the results of subsequent stages. The technical problem this application aims to solve is: how to avoid directly writing temporary data from the previous stage, which has not yet been verified by subsequent stages, into the master thread during the construction of a digital thread for the lifecycle of cyanide-free process circuit boards based on a relay chain, thus preventing distortion of the lifecycle master record. Summary of the Invention

[0003] To overcome the aforementioned deficiencies of the prior art, embodiments of the present invention provide a lifecycle management system and method for cyanide-free process circuit boards based on a relay chain. By constructing a candidate thread fragment chain from the data of each stage, and performing an admission determination based on the acceptance results of the previous fragments by subsequent adjacent stages, the verified fragments are written into the main thread, and the fragments that fail the acceptance verification are written into the circumstantial record, thereby generating a lifecycle digital thread containing the main thread and the circumstantial record, thus solving the problems mentioned in the background art.

[0004] To achieve the above objectives, the present invention provides the following technical solution: a lifecycle management method for cyanide-free process circuit boards based on a relay chain, comprising: S1, collecting board identifiers, process identifiers, process data, test data, and flow data generated during the raw material entry, cyanide-free copper plating, cyanide-free plating process, resin protection, etching, molding, testing, warehousing, transportation, and recycling of the target board, and writing the data segments of the corresponding segments in the order of collection, and outputting the front-end segment set; S2, using relay chain nodes to add a preceding segment identifier and a current segment identifier to each front-end segment in the front-end segment set, forming a candidate thread segment chain according to the connection relationship between the preceding segment identifier and the current segment identifier, and marking the current segment that has not obtained the subsequent segment inheritance result as a segment to be verified. S3. Read each segment to be certified and compare the board identifier, process identifier, process data, test data and flow data in the segment to be certified with the corresponding data in the newly formed subsequent segments of the adjacent process. When the processing result, test result or flow result formed by the segment to be certified is identified in the subsequent segment, the corresponding segment to be certified is determined as the admitted segment, and the admitted segment set and the non-admitted segment set are output; S4. Write each admitted segment in the admitted segment set into the main thread according to the connection relationship, and write each non-admitted segment in the non-admitted segment set into the lateral evidence record according to the segment identifier of the corresponding admitted segment, so as to generate the life cycle digital thread of the target board and output the life cycle main thread and the lateral evidence record set.

[0005] In a preferred embodiment, it further includes: S5, performing association expansion based on the lifecycle main thread and the circumstantial record set, outputting the full process record of the target board in the order of the segments in the lifecycle main thread, and synchronously retrieving the corresponding circumstantial record when reading any main thread segment, and outputting the traceability result, responsibility location result, anomaly attribution result and compliance verification result in the form of lifecycle digital thread.

[0006] In a preferred embodiment, S1 includes: S1-1, reading the board identifier, process identifier, process data, inspection data, and flow data of the target board in the current stage, assembling them according to the fixed field order of board identifier, process identifier, data category identifier, and acquisition time identifier, and outputting the original record of the current stage; S1-2, sorting each data item in the original record of the current stage according to the acquisition time identifier, and arranging data items with the same acquisition time according to the fixed order of data category identifier to form the data item sequence of the current stage, and outputting the current stage segment body; S1-3, sequentially splicing the current stage segment body with the previous stage segments of the target board that have been acquired according to the stage sequence to generate the previous segment set of the target board.

[0007] In a preferred embodiment, S2 includes: S2-1, based on each preceding segment in the preceding segment set, extracting the segment identifier of the previous preceding segment as the preceding segment identifier according to the adjacent order of each preceding segment in the preceding segment set, and extracting the segment identifier of the current preceding segment as the current segment identifier, and outputting a segment connection pair set; S2-2, performing sequential concatenation on each segment connection pair in the segment connection pair set according to the head-to-tail correspondence between the preceding segment identifier and the current segment identifier, generating a candidate thread segment chain formed by sequentially connecting multiple preceding segments, and outputting a candidate thread segment chain set; S2-3, based on the chain tail preceding segment in the candidate thread segment chain set, checking one by one whether the chain tail preceding segment has formed a corresponding following segment with the subsequent adjacent links, marking the chain tail preceding segment that has not formed a corresponding following segment as a segment to be verified, and outputting a candidate thread segment chain and a segment to be verified set.

[0008] In a preferred embodiment, S3 includes: S3-1, reading each segment to be certified from the segment to be certified set and each segment from the subsequent segment set, and according to the fixed field order of board identifier, process identifier, process data, test data, and transfer data, splitting each segment to be certified and each segment from the subsequent segment into a numerical field vector and a code value field vector, and generating an initial segment pair set based on the following retention conditions: identical board identifiers, adjacent process identifiers, and the same transfer destination code value in the segment to be certified and the same transfer source code value in the segment from the subsequent segment; and outputting a field alignment table and the initial segment pair set; S3 -2. For each initial fragment pair in the initial fragment pair set, subtract the corresponding numerical field vectors one by one according to the field alignment table to form a process difference matrix. Encode the corresponding detection data one by one into consistent values, reverse values, and missing values ​​to form a detection relationship matrix. Perform head-to-tail continuation judgment on the corresponding flow code values ​​one by one to form a flow continuation matrix. Then perform singular value decomposition on the process difference matrix and extract the singular vector group corresponding to the non-zero singular values. Perform projection reconstruction on the singular vector group of the process difference matrix to obtain a stable difference vector. Output the stable difference vector, detection relationship matrix, and flow continuation matrix corresponding to each initial fragment pair.

[0009] In a preferred embodiment, S3 further includes: S3-3, calculating the field position sequence in the stable difference vector, the number of reversed values ​​and missing values ​​in the detection relation matrix, and the number of breakpoints in the flow continuation matrix for each initial segment pair; and forming an edge cost sequence by arranging the field position sequence, the number of reversed values, the number of missing values, and the number of breakpoints in chronological order; constructing a bipartite connection graph with the segment to be verified and the subsequent segment as the two side nodes and each initial segment pair as the connecting edge; performing lexicographical sorting under the constraint that each segment to be verified is connected to only one subsequent segment and each subsequent segment is connected to only one segment to be verified; and then sorting according to the sorted edge cost sequence. Next, select the connecting edges corresponding to the unoccupied segments to be certified and the unoccupied subsequent segments to form a provisional set of accepting edges. When there are connecting edges with the same edge cost sequence, write the corresponding connecting edges back to the candidate thread segment chain respectively, and perform dynamic programming sequence alignment on the previous segment identifier, the current segment identifier, and the subsequent segment identifier. Retain connecting edges with fewer broken chain bits and output a stable set of accepting edges. S3-4, determine the segments to be certified with connecting edges in the stable set of accepting edges as admitted segments and write them into the admitted segment set. Determine the segments to be certified without connecting edges in the stable set of accepting edges as unadmitted segments and write them into the unadmitted segment set. Output the admitted segment set and the unadmitted segment set.

[0010] In a preferred embodiment, S4 includes: S4-1, reading each admission fragment in the admission fragment set, its preceding fragment identifier, current fragment identifier, and connection relationship; constructing an admission directed graph with admission fragments as nodes and connection relationships as directed edges; forming an adjacency matrix according to the corresponding column of the preceding fragment identifier and the corresponding row of the current fragment identifier; performing transitive closure expansion on the adjacency matrix to obtain a reachability matrix; deleting the corresponding return edge when there is a return position from the same node to itself in the reachability matrix and re-performing the transitive closure expansion until the adjacency matrices obtained in two consecutive rounds are consistent; and outputting a stable connection graph and a stable adjacency matrix; S4-2, reading the incoming edges of each admission fragment based on the stable connection graph. For segments with more than one incoming edge, perform a triple sorting based on the order of appearance of the preceding segments in the previous segment set, the order of the links, and the order of the segment identifiers, and retain the incoming edge corresponding to the first position in the sorting. For segments with more than one outgoing edge, perform a triple sorting based on the order of appearance of the current segment in the subsequent segment set, the order of the links, and the order of the segment identifiers, and retain the outgoing edge corresponding to the first position in the sorting. Then, write the retained connecting edges back to the stable adjacency matrix and perform dynamic programming accumulation of the prefix path length table and the suffix path length table. When the same node corresponds to multiple prefix paths and multiple suffix paths, retain the connecting edge whose sum of prefix path length and suffix path length is at the first position in the sorting. Output the main thread connecting edge set.

[0011] In a preferred embodiment, S4 further includes: S4-3, performing concatenation of the beginning and end of each admitted segment according to the main thread connection edge set to form a lifecycle main thread, and calculating the prefix hash value, connection hash value, and suffix hash value for adjacent admitted segments in the lifecycle main thread, wherein the prefix hash value is generated by concatenating the segment identifier of the previous admitted segment with the previous connection hash value, the connection hash value is generated by concatenating the segment identifier of the current admitted segment, the previous segment identifier, and the current segment identifier, and the suffix hash value is generated by concatenating the segment identifier of the next admitted segment with the connection hash value, and then writing the prefix hash value, connection hash value, and suffix hash value into the corresponding admitted segment, and outputting the generated lifecycle main thread. Lifecycle main thread; S4-4, Read each unapproved fragment in the unapproved fragment set and each approved fragment in the lifecycle main thread, generate circumstantial candidate pairs according to the consistency of board identifier, the adjacent or identical sequence of links, and the correspondence between the source and destination of the flow. Calculate the fragment identifier editing steps, the number of link intervals, and the number of flow breakpoints for each circumstantial candidate pair, and form a circumstantial cost sequence in chronological order. Then, select the first approved fragment in the sorting order of the circumstantial cost sequence as the corresponding approved fragment for each unapproved fragment. Write the fragment identifier of the unapproved fragment, the fragment identifier of the corresponding approved fragment, the circumstantial cost sequence, and the content of the unapproved fragment into the circumstantial record, and output the circumstantial record set.

[0012] In a preferred embodiment, S5 includes: S5-1, based on each main thread segment in the lifecycle main thread and each supporting record in the supporting record set, expanding each main thread segment according to the segment identifier, the preceding segment identifier, and the current segment identifier in the main thread segment, and correspondingly matching the corresponding admission segment identifier in each supporting record with the expanded main thread segment identifier to form a full process record sequence and a segment supporting record correspondence table; S5-2, for each main thread segment in the full process record sequence, synchronously retrieving the corresponding supporting record according to the segment supporting record correspondence table, and performing ternary association expansion according to the order of main thread segment, corresponding supporting record, and next main thread segment to generate thread expansion units corresponding to each main thread segment, and outputting the thread expansion sequence; S5-3, sequentially splicing each thread expansion unit in the thread expansion sequence according to the segment order, and generating traceability results, responsibility location results, anomaly attribution results, and compliance verification results according to the main thread segment content and the corresponding supporting record content in the thread expansion unit, and outputting the lifecycle digital thread result of the target board.

[0013] The relay chain-based cyanide-free process circuit board lifecycle management system includes a data acquisition module, a candidate thread segment construction module, an acceptance and admission module, a thread generation module, and a thread application module. The data acquisition module collects board identifiers, process identifiers, process data, test data, and flow data generated during the raw material entry, cyanide-free copper plating, cyanide-free plating process, resin protection, etching, molding, testing, warehousing, transportation, and recycling processes of the target board. It writes these data segments into the corresponding stages according to the acquisition order and outputs a set of preceding segments. The candidate thread segment construction module uses relay chain nodes to add preceding segment identifiers and current segment identifiers to each preceding segment in the preceding segment set. It forms a candidate thread segment chain based on the connection relationship between the preceding and current segment identifiers, and marks the current segment that has not obtained subsequent stage acceptance results as a segment to be verified. It outputs a candidate thread segment chain and a set of segments to be verified. The acceptance and admission module reads each segment to be verified and assigns the board identifier, process identifier, process identifier, test data, and flow data to the segment. The process data, testing data, and circulation data are compared item by item with the corresponding data in the newly formed subsequent segments of adjacent stages. When the processing results, testing results, or circulation results formed by the segment to be certified are identified in the subsequent segments, the corresponding segment to be certified is determined as the admission segment, and the set of admission segments and the set of non-admission segments are output. The thread generation module is used to write each admission segment in the admission segment set into the main thread according to the connection relationship, and write each non-admission segment in the non-admission segment set into the lateral evidence record according to the segment identifier of the corresponding admission segment, so as to generate the life cycle digital thread of the target board, and output the life cycle main thread and the lateral evidence record set. The thread application module performs association expansion based on the life cycle main thread and the lateral evidence record set, outputs the whole process record of the target board according to the segment order in the life cycle main thread, and synchronously retrieves the corresponding lateral evidence record when reading any main thread segment, and outputs the traceability results, responsibility location results, anomaly attribution results, and compliance verification results in the form of life cycle digital thread.

[0014] The technical effects and advantages of this invention are as follows: 1. This solution sets up a mechanism for determining the segment to be verified, the subsequent segment, and the entry segment writing, ensuring that the preceding data undergoes acceptance verification in subsequent stages before entering the main thread. This relatively suppresses the distortion of the lifecycle main record caused by instantaneous fluctuations, short-term offsets, and direct writing of single-reassessment results into the main record. 2. The preceding segments are formed into a candidate thread segment chain based on their connection relationships, and the processing results, detection results, or flow results of subsequent adjacent stages are combined to perform item-by-item acceptance identification, ensuring that the segments in the main thread have a causal correspondence, thereby relatively improving the situation where the preceding record and the subsequent result are difficult to correspond. 3. The segment to be verified is divided into entry segments and non-entry segments, and the non-entry segments are written into the circumstantial record instead of being directly deleted. This allows the formal lifecycle facts and the process information that has not been accepted and verified to be retained in a layered manner, thereby relatively alleviating the problem of multiple contradictory process interpretations for the same board. 4. 5. Construct a stable connection graph for the access fragments, a main thread connection edge set, and a lifecycle main thread to ensure that the lifecycle digital threads form a consistent structure in terms of fragment connection, feedback elimination, and unique connection retention, thereby relatively improving the link stability and thread expansion consistency during continuous tracing across links; 6. Establish a set of supporting evidence records outside the lifecycle main thread, and synchronously associate the main thread fragments and corresponding supporting evidence records when expanding the results, so that abnormal fragments, re-judged fragments, and non-access fragments can still be retrieved and verified, thereby improving the completeness of the basis for responsibility positioning, anomaly attribution, and compliance verification to a certain extent. Attached Figure Description

[0015] Figure 1 is a flowchart of the method steps of the present invention; Figure 2 is a schematic diagram of the system module structure of the present invention. Detailed Implementation

[0016] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0017] Referring to Figures 1-2 in the specification, the lifecycle management method for cyanide-free process circuit boards based on relay chains of the present invention includes: S1, collecting board identification, process identification, process data, test data, and flow data generated during the raw material entry, cyanide-free copper plating, cyanide-free plating process, resin protection, etching, molding, testing, warehousing, transportation, and recycling of the target board, and writing them into the corresponding data segments according to the collection order, and outputting the front-end segment set; This embodiment is used to illustrate the formation process of the front-end segment set, the purpose of which is to organize the scattered data generated by the target board in a single stage into a segment segment with fixed field order, clear time order, and traceable stage position, and on this basis, continuously connect it with the previous stage segment segment, so as to connect and support subsequent segments. The system provides a unified input for judgment and main thread generation. Its basic principle is: first, standardize and assemble data fields within the current stage; then, sort data items and generate fragments within the current stage; finally, connect the fragments of the current stage to the existing fragment link of the target board according to the stage sequence. This implementation process includes the following steps: S1-1 aims to organize the original collected content formed in the current stage into original records of the current stage with fixed field positions, so as to eliminate the impact of inconsistent output formats from different acquisition ends on subsequent sorting and splicing. The input quantities are the board identifier, stage identifier, process data, inspection data, and flow data formed by the target board in the current stage. The board identifier is used to uniquely indicate the target board, and the stage identifier is used to indicate the current stage. In the predetermined sequence of steps, process data includes process parameter name, parameter value, parameter unit, acquisition time, and workstation identifier; inspection data includes inspection item name, inspection value, inspection conclusion, inspection time, and inspection equipment identifier; and flow data includes source step, destination step, handover time, handover batch, and handover operation identifier. The processing action is performed according to the fixed field sequence of part identifier, step identifier, data category identifier, and acquisition time identifier. The data category identifier is fixedly divided into process, inspection, and flow categories. The acquisition time identifier uses the timestamp written by the current step's acquisition terminal. During assembly, the part identifier and step identifier are written first, followed by the data category identifier, data item name, data item content, and acquisition time identifier in sequence. This ensures that different categories of data have fixed field positions within the same record structure; the output is the original record of the current stage, which is written to the current stage buffer for S1-2 to read; exception or missing data handling is as follows: when the board identifier is missing, the data assembly is terminated and written to the missing record table; when the stage identifier is missing, the stage identifier is filled in according to the preset stage mapping table corresponding to the workstation of the acquisition end; when the data item content is missing, the field position is retained and a null value mark is written to avoid subsequent field position misalignment; the purpose of S1-2 is to organize the discrete data items in the original record of the current stage into a uniquely ordered fragment body of the current stage, so as to ensure that the data sequence and category arrangement relationship within the same stage are fixed; the input is the original record of the current stage output by S1-1;The processing involves two levels of sorting: First, the data items in the original records of the current stage are sorted according to their acquisition time, with earlier acquisition times listed first and later acquisition times listed last. Then, data items with the same acquisition time are sorted in a fixed order according to their data category, with process categories first, inspection categories second, and circulation categories last. After sorting, the sorted data items are concatenated into a data item sequence, with the segment identifier of the current stage written at the beginning of the sequence. This segment identifier is formed by concatenating the board identifier, stage identifier, and current stage segment number in a fixed order, with the current stage segment number increasing sequentially according to the order in which the segments of the target board were generated within that stage. The output is the current stage... The current segment body is written into the segment segment table for S1-3 to read; the handling of anomalies or missing data is as follows: when two data items are collected at the same time and have the same data category identifier, they are arranged according to the order in which they were written in the original record of the current segment; when the same target board is reworked or re-inspected in the current segment, different current segment bodies are formed and different current segment sequence numbers are assigned to them; the purpose of S1-3 is to connect the current segment body into the segment link already formed by the target board to generate the front segment set for subsequent connection processing; the input is the current segment body output by S1-2 and the front segment segments of the target board that have been collected, where the front segment segments are stored in the front segment table. The system reads the target board's board identifier from the storage area. The processing involves first determining the current segment's position according to the process sequence table, then arranging the preceding segment segments in sequence and sequentially splicing them with the current segment. The process sequence table is fixed as follows: raw material entry, cyanide-free copper plating, resin protection, etching, molding, testing, storage, transportation, and recycling. When the acquisition sequence conflicts with the process sequence, the process sequence takes precedence, while within the same process, the order of data items formed by S1-2 is retained. After splicing, each segment is written into the same preceding segment set according to its position, and the positional relationship between adjacent segments is recorded. The output is the preceding segment set of the target board. The data is written to the preceding segment set storage area for S2 to read. Abnormal or missing data is handled as follows: if the current target board does not have a preceding segment, the current segment body is used as the starting segment of the preceding segment set and written directly; if there are duplicate segments in the read preceding segment, they are distinguished by rework round number or re-inspection round number before being joined together to avoid overlapping segments of the same segment; through the above processing, the data formed by the current segment is first organized into the current segment's original record with a fixed field order, then organized into the current segment body with a unique order, and finally written into the preceding segment set containing preceding segment segments. This ensures that the target board has a unified field structure, unified segment identifier, and unified segment order before entering the subsequent relay chain connection process.This processing directly defines the input boundaries of subsequent candidate thread fragment chains, avoiding biases in the acceptance judgment caused by field misalignment, disordered time sequence, or unclear stage position. In practical applications: for example, a target board sequentially generates records of chemical composition, current parameters, thickness detection, and transfer records during the cyanide-free copper plating and cyanide-free plating processes. The acquisition end first writes these data, along with the board identifier and stage identifier, into the original record of the current stage. Then, it forms a copper plating stage fragment body according to the acquisition time and data category. Subsequently, this copper plating stage fragment body is appended to the raw material entry stage fragment, forming a front-end fragment set containing the raw material entry stage fragment and the cyanide-free copper plating and cyanide-free plating process fragment, for subsequent steps to continue generating candidate thread fragment chains.

[0018] S2. Using relay chain nodes, add a preceding segment identifier and a current segment identifier to each preceding segment in the preceding segment set. Form a candidate thread segment chain based on the connection relationship between the preceding segment identifier and the current segment identifier. Mark the current segment that has not obtained subsequent link succession results as a segment to be verified, and output the candidate thread segment chain and the segment set to be verified. This implementation describes the generation process of the candidate thread segment chain and the segment set to be verified. Its purpose is to organize the discrete link segments in the preceding segment set into candidate links with clear beginning and end connections, and to identify the chain tail segments that have not yet obtained subsequent link succession results, as direct input for subsequent admission determination. Its basic principle is: first, extract the connection relationship between adjacent segments from within the preceding segment set, and then form a... Multiple candidate thread segment chains are used, and the tail segment is used as the verification object to determine whether its corresponding subsequent adjacent links have formed a subsequent segment, thereby outputting the segment set to be verified. The implementation process includes the following steps: The purpose of S2-1 is to provide a unified segment connection basis for subsequent thread concatenation. Its working mechanism is to convert two adjacent front segments in the front segment set into connection pairs with fixed directions. The input is the front segment set of the target board, where each front segment in the front segment set has a segment identifier and a link identifier, and the front segments have been written in link order. The processing action is to traverse each front segment in the adjacent order of the front segment set one by one. For the first front segment, an empty identifier is written into its preceding segment identifier field, and the empty identifier is written into the preceding segment identifier field. The fragment identifier of the first preceding segment is extracted as the current fragment identifier. For the remaining preceding segments, the fragment identifier of the previous preceding segment is extracted as the preceding segment identifier, and the fragment identifier of the current preceding segment is extracted as the current fragment identifier. Then, the preceding segment identifier and the current fragment identifier are written into a fragment join pair record in a fixed field order. The output is a set of fragment join pairs, which is written to the join pair buffer for S2-2 to read. Anomaly or missing information is handled as follows: when the current segment set contains only one preceding segment, a single fragment join pair is directly generated with the preceding segment identifier as the null identifier and the current fragment identifier as the fragment identifier of that preceding segment. When a preceding segment has a missing fragment identifier, it does not participate in the fragment join pair generation, and the preceding segment is written into the missing fragment list. The table is used to avoid the formation of broken connections later. The purpose of S2-2 is to transform the local connection relationship in the fragment connection pair set into a continuously expandable candidate thread fragment chain. Its working mechanism is to complete the sequential concatenation of fragment connection pairs based on the head-to-tail correspondence between the previous fragment identifier and the current fragment identifier. The input is the fragment connection pair set output by S2-1. The processing action is to start with the fragment connection pair with the previous fragment identifier being empty as the first connection pair of the chain. Then, in the remaining fragment connection pairs, the next connection pair whose previous fragment identifier is the same as the current fragment identifier in the current tail connection pair is searched. The next connection pair is attached to the current tail and the same search continues until there is no next connection pair with the head-to-tail correspondence, thus forming a candidate thread fragment chain.When multiple connection pairs with empty preceding segment identifiers exist in the fragment connection pair set, or when there are remaining connection pairs that have not been absorbed by the current candidate thread fragment chain, other candidate thread fragment chains are generated in the same way, thus allowing a target board to form multiple candidate thread fragment chains simultaneously; the output is a set of candidate thread fragment chains, which is written to the candidate chain storage area for S2-3 to read; exception or missing handling is as follows: if two connection pairs have the same beginning and end identifiers but their link order is not continuous during the concatenation process, concatenation is not performed, and the latter connection pair is retained as a candidate for the starting point of the new chain; if the same current segment identifier corresponds to multiple subsequent connection pairs, all of them are retained and added to the candidate thread fragment chain set, and no further concatenation is performed. In this step, the corresponding relationship is deleted and will be processed again in the subsequent admission determination step. The purpose of S2-3 is to determine the tail segment of the candidate thread segment chain that has not yet obtained the subsequent acceptance result. Its working mechanism is to perform a subsequent segment formation status check on the tail segment of each candidate thread segment chain. The input is the candidate thread segment chain set and the subsequent adjacent link segment index table output by S2-2. The subsequent adjacent link segment index table is established by the subsequent adjacent link segments that have been generated according to the board identifier, link identifier and flow source code value. The processing action is to extract the tail segment of each candidate thread segment chain, read the board identifier, link identifier and flow destination code value of the tail segment, and then according to the preset link order. The sequence table determines the identifier of its subsequent adjacent links, and searches the subsequent adjacent link segment index table for subsequent segments that simultaneously satisfy the following conditions: consistent board identifier, consistent subsequent adjacent link identifier, and consistent flow source code value in the subsequent segment and flow destination code value in the preceding segment of the chain tail. When a corresponding subsequent segment is found, it is determined that the preceding segment of the chain tail has obtained the subsequent succession result and is not written into the segment set to be verified. When no corresponding subsequent segment is found, the preceding segment of the chain tail is marked as a segment to be verified and written into the segment set to be verified. The output is the candidate thread segment chain and the segment set to be verified, which are written into the candidate chain result table and the segment set to be verified, respectively, for S3 to read. The exception or missing handling is as follows: when the flow destination code value of the preceding segment of the chain tail is missing, the chain is directly removed. The preceding segment is written into the segment set to be verified and marked as missing in the verification mark; when there is no subsequent adjacent segment of the segment identifier in the segment sequence table, the preceding segment of the chain tail is identified as the chain tail termination segment and is not written into the segment set to be verified; through the above processing, the preceding segment set is first organized into a segment connection pair set, then expanded into one or more candidate thread segment chains, and finally the preceding segment of the chain tail that has not yet formed a subsequent succession relationship is identified from each candidate thread segment chain and written into the segment set to be verified. This makes the subsequent succession determination step only perform calculations on the chain tail segments that really need to be verified, avoids repeated processing of segments that have formed a subsequent succession relationship, and at the same time retains the multi-candidate chain structure in rework, re-inspection or parallel flow scenarios;In practical applications: For example, if a target board has already formed a raw material entry segment, a cyanide-free copper plating / cyanide-free process segment, and an etching segment, the system first extracts two segment pairs in adjacent order: "raw material entry segment, cyanide-free copper plating / cyanide-free process segment" and "cyanide-free copper plating / cyanide-free process segment, etching segment". These are then concatenated to form a candidate thread segment chain of "raw material entry, cyanide-free copper plating / cyanide-free process, resin protection brushing, etching". Subsequently, using the etching segment as the chain tail, the system searches the forming stage segment index table. If no subsequent segment with the same board identifier, forming stage, and source code value matching the etching segment's destination code value is found, the etching segment is marked as a segment to be verified and written into the segment set for subsequent steps to determine whether it can enter the main thread.

[0019] S3. Read each segment to be certified, and compare the board identifier, process identifier, process data, inspection data, and flow data in the segment to be certified with the corresponding data in the newly formed subsequent segments of the adjacent process. When the processing result, inspection result, or flow result formed by the segment to be certified is identified in the subsequent segment, the corresponding segment to be certified is determined as an admission segment, and the admission segment set and the non-admission segment set are output. This implementation method is used to illustrate the acceptance determination process of the segment to be certified. Its purpose is to identify which segments have been truly accepted by the subsequent adjacent process from the tail segment of the candidate thread segment chain, and to divide the segment to be certified into admission segments and non-admission segments accordingly. Its basic principle is: first, establish a field between the segment to be certified and the subsequent segment. The corresponding relationships and initial segment pairs are then used to construct differential results and continuation results from three perspectives: process data, inspection data, and flow data. The calculation results from these three perspectives are then uniformly converted into connection edge costs and a unique connection solution is performed within the two-part connection diagram. Finally, based on the solution results, admission and non-admission writing are completed. This implementation process includes the following steps: S3-1 aims to establish a unified segment pair input boundary for subsequent connection calculations. Its mechanism is to first complete field splitting and field alignment, and then filter out segment combinations allowed to participate in the connection calculation based on object consistency and link continuation relationships. The input quantities are each segment to be certified in the segment set to be certified and each segment in the subsequent segment set, wherein both the segment to be certified and the subsequent segment contain plates. The data includes component identifier, process identifier, process data, inspection data, and transfer data. Continuous parameter values ​​in the process data and numerical test values ​​in the inspection data are used as numerical fields, while component identifier, process identifier, inspection conclusion code, transfer source code, and transfer destination code are used as code value fields. The processing steps are as follows: First, a field bit mapping table is established according to a fixed field order. In the field bit mapping table, process items, inspection items, and transfer items with the same name are assigned the same field bit. Then, each segment to be certified and each subsequent segment are split into numerical field vectors and code value field vectors, respectively. Subsequently, the subsequent segments are traversed based on the segment to be certified, and retention checks are performed on the component identifier, process identifier, and transfer code. Among these, the consistency of the component identifier is used as the object consistency condition, and adjacent process identifiers are used as the condition. The judgment is based on a pre-set sequence table. The flow destination code value in the segment to be certified is the same as the flow source code value in the subsequent segment as the start and end continuation condition. When all three conditions are met, an initial segment pair record is generated. The output is a field alignment table and an initial segment pair set, which are written to the field bit mapping area and the initial segment pair buffer area respectively for S3-2 to read. The abnormal or missing handling is as follows: when a certain detection item or process item in the segment to be certified or the subsequent segment is missing, only the field bit is retained in the field bit mapping table and a blank mark is written in the corresponding vector position. The segment pair is not directly removed. When there is no subsequent segment that meets the three retention conditions for the segment to be certified, no initial segment pair is generated. The segment to be certified directly enters the unapproved candidate table after the end of this round of calculation.The purpose of S3-2 is to calculate the degree of connection between the segment to be certified and the subsequent segment from three dimensions: process change, detection correspondence, and flow continuation. Its working mechanism is to unify different types of data into comparable matrix and vector results, providing a unified calculation basis for subsequent connection edge screening. The input is the field alignment table and initial segment pair set output by S3-1. The processing action includes three parts: First, for each initial segment pair, the corresponding numerical field vector is subtracted item by item to form a process difference matrix, where the rows of the matrix correspond to process items, and the columns correspond to the numerical field positions under the corresponding process item. The matrix elements are obtained by subtracting the corresponding numerical value of the segment to be certified from the corresponding numerical value of the subsequent segment. Missing field positions are left empty and do not participate in the subtraction. Second, for each The detection data of the initial fragment pairs are encoded item by item to form a detection relationship matrix. The same detection item with the same detection conclusion code in both the fragment to be verified and the subsequent fragment is recorded as a consistent value; opposite detection conclusion codes are recorded as a reverse value; and the presence of the detection item on only one side is recorded as a missing value. Third, the corresponding flow code values ​​of each initial fragment pair are sequentially determined to form a flow continuation matrix. The flow destination code value in the fragment to be verified is the same as the flow source code value in the subsequent fragment, recorded as a continuation bit; otherwise, it is recorded as a breakpoint bit. After constructing the three types of matrices, singular value decomposition is performed on the process difference matrix. Singular values ​​corresponding to all-zero vectors in the decomposition result are removed, and the singular vector groups corresponding to the singular values ​​of the non-all-zero vectors are retained. The process difference matrix is ​​then projected onto this matrix. The singular vector group is reconstructed to obtain a stable difference vector. Each bit in the stable difference vector corresponds to the difference value of a field bit retained after reconstruction. The output includes the stable difference vector, detection relation matrix, and flow continuation matrix corresponding to each initial fragment pair, and is written to the calculation result table for S3-3 to read. The handling of anomalies or missing values ​​is as follows: when all elements in the process difference matrix are empty or zero, the stable difference vector is written as a vector of all zeros; when only missing values ​​exist in the detection relation matrix, the matrix is ​​retained for subsequent statistics and is not deleted in this step; when there are breakpoints in the flow continuation matrix, the initial fragment pair is still retained for subsequent sorting and is uniformly processed by S3-3. The purpose of S3-3 is to obtain each fragment to be verified from multiple candidate initial fragment pairs. The corresponding unique receiving edge works by first converting the calculation results of process, inspection, and flow into a unified edge cost sequence, then selecting the connecting edge under one-to-one constraints, and performing link write-back verification on the parallel connecting edges. The input quantities are the stable difference vector, detection relation matrix, and flow continuation matrix output by S3-2, and the candidate thread fragment chain formed by S2. The processing action is to first count four types of quantities for each initial fragment pair: first, sorting each field in the stable difference vector from largest to smallest according to its absolute value to form a field position sequence, and arranging fields with the same absolute value in a fixed order; second, counting the number of reverse values ​​in the detection relation matrix; third, counting the number of missing values ​​in the detection relation matrix; and fourth, counting the number of breakpoints in the flow continuation matrix.Then, the field position sequence, the number of reversed values, the number of missing values, and the number of breakpoints are arranged in order to form an edge cost sequence. Next, a bipartite connection graph is constructed with the segment to be verified and the subsequent segment as the two side nodes and each initial segment pair as the connecting edge. Under the constraint that "each segment to be verified connects to only one subsequent segment and each subsequent segment connects to only one segment to be verified," all connecting edges are sorted lexicographically according to the edge cost sequence. During sorting, the field position sequence is compared first, then the number of reversed values, then the number of missing values, and finally the number of breakpoints. After sorting, connecting edges are read sequentially from the first to the last element. When the segment to be verified and the subsequent segment corresponding to a connecting edge are both unoccupied, the edge is considered valid. Write the connecting edge into the provisional accepting edge set until the end of the sorting is reached. If there are connecting edges with the same edge cost sequence, write the parallel connecting edges back to the corresponding candidate thread segment chain. Then, form a triplet identifier sequence with the previous segment identifier, current segment identifier, and subsequent segment identifier. Perform dynamic programming sequence alignment with the triplet identifier sequence at the expected position in the candidate thread segment chain. Count the number of inconsistent bits as the number of broken links, and retain connecting edges with fewer broken links. The output is a stable accepting edge set, which is written to the accepting edge result table for S3-4 to read. The exception or missing edge handling is as follows: if no connecting edge enters the provisional accepting edge set for a segment to be verified, mark the segment to be verified. The state is one without any supporting edges; if the number of broken links is the same after writing back parallel connecting edges, the connecting edge with the earlier link is retained according to its lexicographical order. The purpose of S3-4 is to complete the final classification of the fragments to be verified based on the stable supporting edge set. Its mechanism is to transfer the fragments to be verified with valid supporting edges to the main thread admission channel, and transfer the fragments to be verified without valid supporting edges to the non-admission retention channel. The input is the stable supporting edge set and the fragment set to be verified output by S3-3. The processing action is to traverse the fragment set to be verified one by one, and for each fragment to be verified, search the stable supporting edge set to see if there is a connecting edge starting from the fragment to be verified. When a connecting edge is found, the fragment to be verified is determined as admitted. The fragment to be verified, its corresponding subsequent fragment identifier, and the connecting edge identifier are written into the admitted fragment set. If no connecting edge is found, the fragment to be verified is identified as an unapproved fragment, and its identifier and the state of having no connecting edge are written into the unapproved fragment set. The output consists of the admitted fragment set and the unapproved fragment set, which are written into the main thread's admitted area and the circumstantial evidence candidate area for S4 to read, respectively. The exception or missing information is handled as follows: when the same fragment to be verified has multiple connecting edges in the stable circumstantial edge set, only the unique connecting edge retained by S3-3 is read. After the fragment to be verified is written into the unapproved fragment set in this round, the original fragment content is not directly deleted, but is retained for use in the generation of subsequent circumstantial evidence records.Through the above processing, the segment to be certified first establishes field alignment relationships and initial segment pairs with the subsequent segments, then calculates the process difference matrix, detection relationship matrix, and flow continuation matrix respectively, and extracts stable difference vectors using singular value decomposition and projection reconstruction. Subsequently, the three types of results are unified into an edge cost sequence, and one-to-one acceptance edge selection is completed within the two-part acceptance graph. Finally, the set of admitted segments and the set of rejected segments are output. This not only fixes the field range, calculation order, and unique output rules for acceptance judgment, but also incorporates process changes, detection conclusions, and flow continuation into the acceptance judgment, avoiding direct admission judgment based solely on the consistency of a single field. In practical applications: for example, if the etched segment of a target board is used as the segment to be certified, the system retrieves two candidate subsequent segments with the same board identification and adjacent stages in the subsequent segment set of the forming stage. The two sets of segment pairs are then processed. A process difference matrix, a detection relationship matrix, and a flow continuation matrix are constructed respectively. Singular value decomposition is then performed on the process difference matrix to obtain a stable difference vector. Subsequently, the field position sequence, number of inverted values, number of missing values, and number of breakpoints for two sets of fragment pairs are counted to form the edge cost sequence of the two connecting edges. If the edge cost sequences of the two connecting edges are different, the connecting edge with the higher ranking is retained directly in lexicographical order. If the edge cost sequences of the two connecting edges are the same, they are written back to the candidate thread fragment chains of "raw material entry, cyanide-free copper plating, cyanide-free process, resin brushing protection, and etching" for sequence alignment. The connection edge that produces fewer broken chain bits after being connected to the molding fragment is compared, and a unique connecting edge is retained accordingly. Finally, etched fragments with unique connecting edges are written into the admitted fragment set, while fragments to be verified without connecting edges are written into the disapproved fragment set.

[0020] S4. Write each admitted fragment in the admitted fragment set into the main thread according to the connection relationship, and write each non-admitted fragment in the non-admitted fragment set into the circumstantial record according to the fragment identifier of the corresponding admitted fragment, so as to generate the life cycle digital thread of the target board and output the life cycle main thread and the circumstantial record set; This implementation method is used to illustrate the generation process of the life cycle main thread and the circumstantial record set. Its purpose is to organize the effective connection relationship in the admitted fragment set into a unique main thread connection structure, and write the non-admitted fragments into the circumstantial record according to the corresponding relationship, so that the life cycle digital thread of the target board has both the main fact chain and the circumstantial retention chain; Its basic principle is: first, form a stable connection graph based on the connection relationship between the admitted fragments and clear the return relationship, then Within the stable connectivity graph, unique edges under one-in-one-out constraints are retained. Then, the retained edges are concatenated to generate a lifecycle main thread and written into a hash chain. Finally, a corroborating correspondence is established between the unadmitted segments and the admitted segments in the main thread and written into a corroborating record. This implementation process includes the following steps: S4-1 aims to extract stable connectivity structures without return edges from the local connectivity relationships between admitted segments. Its mechanism is to first graphically represent the connectivity relationships, and then use adjacency and reachability matrices to identify and delete return edges. The input consists of each admitted segment in the admitted segment set, its preceding segment identifier, the current segment identifier, and the connectivity relationships. Each admitted segment corresponds to a unique segment identifier, and the connectivity relationships are determined by the preceding segment identifier and the current segment identifier. The results of the connection between the identifiers are given. The processing steps are as follows: First, construct an admission directed graph with each admission segment as a node and each connection relationship as a directed edge. Then, form an adjacency matrix according to the column corresponding to the previous segment identifier and the row corresponding to the current segment identifier. If there is a connection relationship between a column and a row in the adjacency matrix, write a connection value; otherwise, write an empty value. Then, perform transitive closure expansion on the adjacency matrix to obtain a reachability matrix. When a node in the reachability matrix has a reachable position from itself, it means that the corresponding path forms a return relationship. At this time, backtrack the connection edges that form the return path in reverse order of their appearance in the path, delete the incoming edge closest to the current node, and then reconstruct the adjacency matrix and perform transitive closure expansion again. Each deletion and recalculation is performed in turn. This is considered one round. The process stops when the adjacency matrices obtained in two consecutive rounds are completely identical. The output consists of a stable connection graph and a stable adjacency matrix, which are written to the connection graph storage area for S4-2 to read. The handling of exceptions or missing segments is as follows: Incoming segments with an empty preceding segment identifier are only written as starting nodes and do not participate in the back-end edge deletion judgment; when there are no connections between incoming segments, each incoming segment is retained as an independent node and directly written to the stable connection graph. The purpose of S4-2 is to uniquely retain multiple incoming and multiple outgoing edges within the stable connection graph and form a set of connection edges that can be directly used for main thread concatenation. Its mechanism is to first resolve incoming and outgoing edge conflicts in a fixed order, and then use the accumulated path length to resolve the remaining conflicts.The input consists of the stable connection graph and stable adjacency matrix output by S4-1, as well as the occurrence order and segment order information of each segment in the preceding and following segment sets. The processing involves two layers: The first layer reads the number of incoming and outgoing edges for each admitted segment. For the current segment with more than one incoming edge, it performs a triple sort based on the occurrence order, segment order, and segment identifier order of the corresponding preceding segment in the preceding segment set. The incoming edge at the top of the sorted sequence is retained, and the remaining incoming edges are deleted. For the preceding segment with more than one outgoing edge, it performs a triple sort based on the occurrence order, segment order, and segment identifier order of the corresponding current segment in the following segment set. The first outgoing edge is retained, and the rest are deleted. When the triple sorting fields are completely identical, the first-written edges are retained according to their order of being written in the stable connection graph. In the second layer, the retained edges are written back to the stable adjacency matrix to generate an updated adjacency matrix. Based on the updated adjacency matrix, a prefix path length table and a suffix path length table are established. The entry segment with zero incoming edges is used as the prefix starting point, and its prefix path length is initialized to 1. The entry segment with zero outgoing edges is used as the suffix ending point, and its suffix path length is initialized to 1. The path length of the remaining nodes is accumulated successively along the connection direction. When the same node corresponds to multiple prefixes... When a path has multiple suffix paths, calculate the sum of the prefix path length and the suffix path length corresponding to each candidate connection edge. Sort the edges by this sum in descending order. If the sums are the same, sort them by prefix path length in descending order. If they are still the same, sort them by segment identifier order. Keep the connection edge corresponding to the first element in the sorted order. The output is the main thread connection edge set, which is written to the main thread connection edge table for S4-3 to read. The exception or missing edge handling is as follows: if a certain admission segment has no incoming edges and no outgoing edges after deleting conflicting edges, the admission segment is kept as an independent main thread candidate segment and is not eliminated in this step. The purpose of S4-3 is to form a connection edge set based on the main thread connection edge set. A continuous lifecycle main thread is used, and the connection relationship between adjacent admission segments in the main thread is written into a hash chain. Its working mechanism is to concatenate admission segments in the order of connection edges, and convert the connection information of each segment with the adjacent segments before and after into a hash input with a fixed concatenation order. The input is the main thread connection edge set output by S4-2 and the corresponding admission segment. The processing action is to start from the admission segment with the previous segment identifier being empty or the number of incoming edges being zero, and read the subsequent admission segments one by one according to the connection direction of the main thread connection edge set, and perform the first and last concatenation until there are no subsequent admission segments, forming one or more lifecycle main threads.Subsequently, prefix hash values, connection hash values, and suffix hash values ​​are calculated for adjacent admitted segments in the lifecycle main thread. The prefix hash value is input by concatenating the previous admitted segment identifier and the previous connection hash value in a fixed order. The connection hash value is input by concatenating the current admitted segment identifier, the preceding segment identifier, and the current segment identifier in a fixed order. The suffix hash value is input by concatenating the next admitted segment identifier and the connection hash value in a fixed order. A hash operation is performed on each concatenation result to obtain the corresponding hash value. The prefix hash value, connection hash value, and suffix hash value are then written into the hash field of the current admitted segment. The output is the lifecycle main thread, which is written to the main thread storage area for use by S4-4 and S5. The reading process, including exception or missing data handling, is as follows: When the first segment of the lifecycle main thread does not have a preceding admitted segment, its prefix hash value is generated by concatenating the null identifier with the null value of the previous connection hash; when the last segment does not have a subsequent admitted segment, its suffix hash value is generated by concatenating the null identifier with the connection hash value. The purpose of S4-4 is to attach the disadmitted segments to the corresponding main thread segments to form circumstantial records. Its mechanism is to first generate circumstantial candidate pairs between disadmitted segments and main thread segments, and then select a unique corresponding admitted segment for each disadmitted segment based on the circumstantial cost sequence. The input consists of each disadmitted segment in the disadmitted segment set and each admitted segment in the lifecycle main thread output by S4-3. The processing action is to first traverse based on the disadmitted segments. In the main thread, each admitted segment generates supporting evidence candidate pairs based on conditions such as consistent board identifiers, identical or adjacent process sequences, and corresponding flow sources and flow destinations. Priority is given to supporting evidence candidate pairs with identical process sequences; if no identical process candidate pairs exist, then adjacent process candidate pairs are retained. For each supporting evidence candidate pair, the number of segment identifier editing steps, process intervals, and flow breakpoints are calculated. The number of segment identifier editing steps is calculated by comparing each segment segment (board identifier, process identifier, and segment sequence number), with each change to a segment counting as one editing step. The number of process intervals is calculated based on the positional difference in the process sequence table. The number of flow breakpoints is calculated by comparing the flow destination of the unadmitted segment with the flow source of the admitted segment, and by comparing the flow source of the unadmitted segment with the admitted segment. The flow destinations in the segments are compared item by item; then, the number of editing steps, the number of stage intervals, and the number of flow breakpoints of the segment identifier are arranged in chronological order to form a supporting evidence cost sequence, and the supporting evidence candidate pairs corresponding to the same non-admitted segment are sorted according to the supporting evidence cost sequence, and the admitted segment at the top of the sort is selected as the corresponding admitted segment for the non-admitted segment; finally, the segment identifier of the non-admitted segment, the segment identifier of the corresponding admitted segment, the supporting evidence cost sequence, and the content of the non-admitted segment are written into the supporting evidence record; the output is the supporting evidence record set, which is written into the supporting evidence record storage area for S5 to read; the abnormal or missing handling is as follows: when there is no supporting evidence candidate pair that meets the generation conditions for a certain non-admitted segment, the corresponding admitted segment identifier of the non-admitted segment is written as an empty identifier and written separately into the isolated supporting evidence table;When the circumstantial cost sequences of multiple candidate pairs of circumstantial evidence are completely identical, the earlier circumstantial evidence is retained according to the order of appearance of the corresponding admission fragment in the lifecycle main thread. Through the above processing, the local connection relationships between admission fragments are first organized into a stable connection graph with no return path, and then the main thread connection edge set is formed through three layers of processing: incoming edge, outgoing edge, and path length. Subsequently, a lifecycle main thread with a hash chain is generated based on this. Finally, the non-admitted fragments are associated with the corresponding admission fragments and written into the circumstantial evidence record set, thereby completing the construction of the main thread and circumstantial evidence of the target board's lifecycle digital thread. This processing not only fixes the unique formation rule of the main thread, but also fixes the attachment rule of non-admitted fragments, so that the formal lifecycle facts and the circumstantial evidence facts that have not entered the main thread can be read simultaneously when the association is expanded. In practical applications: for example, the admission fragment set of a target board includes raw material entry fragments, cyanide-free copper plating and cyanide-free plating process fragments, etching fragments, and forming fragments, among which the etching fragments are the same as Upon receiving two incoming edges from different preceding segments, the system first constructs an admission directed graph and deletes the connecting edges that form return relationships through transitive closure. Then, it performs a triple sorting of the multiple incoming edges of the etching segment according to the order of appearance of the preceding segments, the order of the process, and the order of the segment identifier, retaining only the first incoming edge in the sorted order. Subsequently, based on the retained main thread connecting edge set, the raw material entry segment, the cyanide-free copper plating and cyanide-free plating process segment, the etching segment, and the forming segment are concatenated to form the lifecycle main thread, and prefix hash values, connection hash values, and suffix hash values ​​are written for adjacent segments. For re-inspection segments among the non-admitted segments, the system searches for admitted segments with the same board identifier and the same process order in the lifecycle main thread, calculates the number of segment identifier editing steps, the number of process intervals, and the number of flow breakpoints, and selects the first admitted segment in the sorted order as the corresponding admitted segment. The content of the re-inspection segment is written into the supporting evidence record under this admitted segment for subsequent steps to expand into a complete lifecycle digital thread.

[0021] S5. Based on the lifecycle main thread and the supporting evidence record set, perform association expansion, output the full process record of the target board in the order of the segments in the lifecycle main thread, and synchronously retrieve the corresponding supporting evidence record when reading any main thread segment, outputting the traceability result, responsibility location result, anomaly attribution result, and compliance verification result in the form of a lifecycle digital thread; This implementation method is used to illustrate the expansion process of the lifecycle digital thread result, the purpose of which is to expand the main thread segments in the lifecycle main thread and the corresponding supporting evidence records in the supporting evidence record set in a unified order into a directly readable full process record, and on this basis, form the traceability result, responsibility location result, anomaly attribution result, and compliance verification result respectively; its basic principle is: first, according to the main thread connection order The main thread segment is expanded into a complete record sequence, and a correspondence is established between the main thread segment and the supporting evidence record. Then, the corresponding supporting evidence record is synchronously attached to each main thread segment to form a thread expansion unit. Finally, four types of results are generated according to the main thread content and supporting evidence content in the thread expansion unit. The implementation process includes the following steps: S5-1 aims to form the main thread sequence and supporting evidence attachment relationship required for subsequent thread expansion. Its mechanism is to first expand the main thread execution sequence from the start to the end of the life cycle, and then map the supporting evidence record to the expanded main thread segment one by one. The input quantities are each main thread segment in the life cycle main thread and each supporting evidence record in the supporting evidence record set. Among them, the main thread segment includes a segment identifier, a preceding segment identifier, and a supporting evidence record. The current fragment identifier and supporting evidence records include the fragment identifier of the unadmitted fragment, the corresponding admitted fragment identifier, the supporting evidence cost sequence, and the content of the unadmitted fragment. The processing steps are as follows: starting with the main thread fragment whose preceding fragment identifier is empty, the subsequent main thread fragments are read sequentially according to the beginning-end correspondence between the current fragment identifier and the preceding fragment identifier of the next main thread fragment, until no subsequent main thread fragment is read, forming a complete process record sequence. Then, supporting evidence records are read one by one, and the corresponding admitted fragment identifier in each supporting evidence record is compared item by item with the main thread fragment identifier in the complete process record sequence. If they match, a fragment supporting evidence correspondence is established. When one main thread fragment corresponds to multiple supporting evidence records, they are written sequentially according to the sorting result of the supporting evidence cost sequence in the supporting evidence records. The output consists of a list of supporting evidence for each thread segment; the output is a sequence of complete process records and a table of supporting evidence for each segment, which are written to the complete process record area and the supporting evidence area respectively for S5-2 to read; the handling of exceptions or missing information is as follows: when there are multiple independent main threads in the lifecycle main thread, they are expanded from their respective main thread starting points and then spliced ​​together according to the segment order of the starting segment to form a complete process record sequence; when the corresponding admission segment identifier in the supporting evidence record is an empty identifier, it is not written to the segment supporting evidence table, but is written to the isolated supporting evidence table separately; the purpose of S5-2 is to expand the main thread segments and corresponding supporting evidence records according to a unified unit structure. Its working mechanism is to take the main thread segment as the main position, the supporting evidence record as the appended position, and the subsequent main thread segment as the connection position to form a thread expansion unit that can be continuously spliced.The input consists of the entire process record sequence and the segment evidence correspondence table output by S5-1. The processing involves reading each main thread segment sequentially according to the segment order in the entire process record sequence, synchronously retrieving the evidence record group corresponding to the current main thread segment based on the segment evidence correspondence table, and then reading the next main thread segment in the entire process record sequence. The "current main thread segment, corresponding evidence record group, and next main thread segment" are written into the same thread expansion unit in a fixed order, where multiple evidence records within the corresponding evidence record group maintain their order according to the sorting result in S5-1. When the current main thread segment does not have a corresponding evidence record, the corresponding evidence record group is written as an empty group. When the current main thread segment is the last segment of the entire process record sequence... When the next main thread segment is written as an empty flag, the output is the thread expansion sequence, which is written to the expansion result area for S5-3 to read. Exception or missing information handling is as follows: when the supporting evidence record corresponding to the current main thread segment is missing, the position of the supporting evidence record in the corresponding supporting evidence record group is retained and a content missing flag is written to avoid disrupting the corresponding order within the thread expansion unit; when the main thread segment is missing in the entire recording sequence, the segment position is not skipped, but a segment missing flag is written and thread expansion units continue to be formed; the purpose of S5-3 is to convert the thread expansion sequence into a lifecycle digital thread result that can be directly read by the management side. Its mechanism is to first concatenate each thread expansion unit according to the segment order, and then, based on the main thread content and... The supporting evidence generates four types of results; the input is the thread expansion sequence output by S5-2; the processing action is to first concatenate each thread expansion unit in the thread expansion sequence according to the fragment order of the main thread segment to obtain the complete thread expansion result of the target board; then, based on the main thread fragment content in the thread expansion unit, a traceability result is generated, in which the traceability result outputs the process corresponding to each main thread segment according to the step order in the whole process record sequence; based on the step identifier, workstation identifier, flow relationship in the main thread segment and the unapproved fragment content in the corresponding supporting evidence record, a responsibility positioning result is generated, in which the responsibility positioning result specifies the responsible step and associated supporting evidence for each main thread segment; based on the unapproved fragment content in the corresponding supporting evidence record and the current main thread... The system generates anomaly attribution results by comparing the content of the process segment with the content of the next main thread segment. These results specify the reason for non-access, the associated main thread position, and the subsequent acceptance status. Compliance verification results are generated based on the process data, testing data, and flow data in the corresponding thread expansion units for raw material entry, cyanide-free copper plating, cyanide-free plating processes, resin brushing protection, testing, warehousing, transportation, and recycling. These results list verification items and content by stage. The output is the target board's lifecycle numerical thread result, written to the lifecycle result area for terminal display and subsequent querying. Anomaly or missing information handling is as follows: when a thread expansion unit lacks supporting documentation, the responsibility location result and anomaly attribution result are generated solely based on the main thread segment content.When a certain step is not present in the full-process record sequence, the compliance verification result will indicate that the corresponding step was not recorded. Through the above processing, the main thread segment in the lifecycle main thread is first expanded into a full-process record sequence, then a segment-by-segment correspondence is established with the supporting evidence records in the supporting evidence record set. This forms a thread expansion unit organized as "main thread segment, supporting evidence record group, next main thread segment," and finally outputs the tracing results, responsibility location results, anomaly attribution results, and compliance verification results respectively. This unifies the main thread and supporting evidence records into directly readable lifecycle digital thread results. This processing fixes the expansion start point, expansion end point, one-to-many connection relationship of supporting evidence records, and the generation criteria for the four types of results, ensuring that subsequent display, auditing, and responsibility verification are all based on the same expansion structure. In practical applications: For example, the main lifecycle thread of a target board includes the raw material arrival segment, the cyanide-free copper plating and cyanide-free plating process segment, the etching segment, and the forming segment. The system first unfolds the entire process record sequence starting from the raw material arrival segment. Then, it attaches two supporting records corresponding to the etching segment and one supporting record corresponding to the forming segment to the corresponding main thread segment, forming multiple thread unfolding units. These thread unfolding units are then assembled in segment order to output the traceability results of the target board from arrival to forming. Based on the etching segment and its supporting records, it generates responsibility location results and anomaly attribution results. Based on the process data, inspection data, and flow data in the raw material arrival segment, the cyanide-free copper plating and cyanide-free plating process segment, the etching segment, and the forming segment, it generates compliance verification results, ultimately forming the complete lifecycle digital thread result of the target board.

[0022] Furthermore, the present invention also includes a cyanide-free process circuit board lifecycle management system based on a relay chain. The system includes a data acquisition module, a candidate thread chain construction module, a receiving and admission module, a thread generation module, and a thread application module. The data acquisition module is used to collect board identifiers, process identifiers, process data, test data, and flow data generated during the raw material entry, cyanide-free copper plating, cyanide-free plating process, resin protection, etching, molding, testing, warehousing, transportation, and recycling processes of the target board. It writes the data fragments of the corresponding processes according to the acquisition order and outputs a set of preceding fragments. The candidate thread chain construction module uses relay chain nodes to add a preceding fragment identifier and a current fragment identifier to each preceding fragment in the preceding fragment set. It forms a candidate thread fragment chain based on the connection relationship between the preceding fragment identifier and the current fragment identifier, and marks the current fragment that has not obtained subsequent process acceptance results as a fragment to be verified. It outputs a candidate thread fragment chain and a set of fragments to be verified. The receiving and admission module reads each fragment to be verified and assigns the board identifier, process identifier, process data, test data, and flow data to the fragment to be verified. The process identification, process data, inspection data, and flow data are compared item by item with the corresponding data in the newly formed subsequent segments of adjacent processes. When the processing result, inspection result, or flow result formed by the segment to be certified is identified in the subsequent segment, the corresponding segment to be certified is determined as the admission segment, and the set of admission segments and the set of non-admission segments are output. The thread generation module is used to write each admission segment in the admission segment set into the main thread according to the connection relationship, and write each non-admission segment in the non-admission segment set into the lateral evidence record according to the segment identifier of the corresponding admission segment, so as to generate the life cycle digital thread of the target board, and output the life cycle main thread and the lateral evidence record set. The thread application module performs association expansion based on the life cycle main thread and the lateral evidence record set, outputs the whole process record of the target board according to the segment order in the life cycle main thread, and synchronously retrieves the corresponding lateral evidence record when reading any main thread segment, and outputs the traceability result, responsibility location result, anomaly attribution result, and compliance verification result in the form of life cycle digital thread.

[0023] Working Principle: This solution first organizes the data generated by the circuit board at each stage into segments, and then connects these segments according to the process sequence. Next, the system does not directly treat the previously collected data as the final history, but checks whether subsequent stages connect and match. Matching segments are entered into the main thread as formal lifecycle records, while mismatched segments are retained as supporting evidence. After this processing, the system obtains a clear main thread and verifiable supporting evidence for the lifecycle, which can then be used to output the entire process record, responsible location, source of anomalies, and compliance status. For example, one... A cyanide-free circuit board undergoes a series of processes, including raw material intake, copper plating, etching, forming, and testing. The system first records the data from each stage as segments, then checks whether the etching segments are truly supported by the subsequent forming and testing results. If they are supported, the etching segment is placed in the main thread; otherwise, it is temporarily placed in the circumstantial evidence. In this way, when reviewing the history of the board, what you see is a main process that has been verified by subsequent results. If there are any abnormalities, rework, or conflict records in the middle, you can also see the corresponding circumstantial evidence. Therefore, you can trace how the entire board was made and also see where the problem occurred.

[0024] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A lifecycle management method for cyanide-free process circuit boards based on relay chains, characterized in that, include: S1. Collect the board identification, process identification, process data, test data, and flow data generated during the raw material entry, cyanide-free copper plating, resin protection, etching, molding, testing, storage, transportation, and recycling processes of the target board. Write the data segments of the corresponding processes in the order of collection and output the front-end segment set. S2. Use the relay chain nodes to add the preceding segment identifier and the current segment identifier to each front-end segment in the front-end segment set. Form a candidate thread segment chain according to the connection relationship between the preceding segment identifier and the current segment identifier. Mark the current segment that has not obtained the subsequent process result as the segment to be verified. Output the candidate thread segment chain and the segment to be verified set. S3. Read each The process involves identifying the segments to be certified and comparing the panel identifier, process identifier, process data, inspection data, and transfer data in the segments with the corresponding data in the newly formed segments of the adjacent processes. When a processing result, inspection result, or transfer result formed by the segment to be certified is identified in the subsequent segment, the corresponding segment to be certified is determined as an admission segment, and the set of admission segments and the set of non-admission segments are output. S4: Each admission segment in the set of admission segments is written into the main thread according to the connection relationship, and each non-admission segment in the set of non-admission segments is written into the lateral evidence record according to the segment identifier of the corresponding admission segment, so as to generate the life cycle digital thread of the target panel and output the life cycle main thread and the lateral evidence record set.

2. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 1, characterized in that: Also includes: S5. Based on the lifecycle main thread and the set of supporting evidence records, perform associated expansion, output the full process record of the target board in the order of the segments in the lifecycle main thread, and synchronously retrieve the corresponding supporting evidence records when reading any main thread segment, and output the traceability results, responsibility location results, anomaly attribution results and compliance verification results in the form of lifecycle digital threads.

3. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 2, characterized in that: S1 includes: S1-1, reading the board identifier, process identifier, process data, inspection data, and flow data of the target board in the current stage, assembling them according to the fixed field order of board identifier, process identifier, data category identifier, and acquisition time identifier, and outputting the original record of the current stage; S1-2, sorting each data item in the original record of the current stage according to the acquisition time identifier, and arranging data items with the same acquisition time according to the fixed order of data category identifier to form the data item sequence of the current stage, and outputting the current stage fragment body; S1-3, sequentially splicing the current stage fragment body with the previous stage fragments of the target board that have been acquired according to the stage sequence to generate the previous stage fragment set of the target board.

4. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 3, characterized in that: S2 includes: S2-1. Based on each preceding segment in the preceding segment set, extract the segment identifier of the previous preceding segment as the preceding segment identifier according to the adjacent order of each preceding segment in the preceding segment set, and extract the segment identifier of the current preceding segment as the current segment identifier, and output the segment connection pair set; S2-2. Perform sequential concatenation on each segment connection pair in the segment connection pair set according to the head-to-tail correspondence between the preceding segment identifier and the current segment identifier, generate a candidate thread segment chain formed by sequentially connecting multiple preceding segments, and output the candidate thread segment chain set; S2-3. Based on the chain tail preceding segment in the candidate thread segment chain set, check whether the chain tail preceding segment has formed a corresponding following segment with the subsequent adjacent links one by one, mark the chain tail preceding segment that has not formed a corresponding following segment as a segment to be verified, and output the candidate thread segment chain and the segment to be verified set.

5. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 4, characterized in that: S3 includes: S3-1, reading each segment to be certified from the segment set to be certified and each segment from the subsequent segment set to be certified, and splitting each segment to be certified and each segment from the subsequent segment set into numerical field vectors and code value field vectors according to the fixed field order of board identifier, process identifier, process data, test data, and flow data, and generating an initial segment pair set, and outputting the field alignment table and the initial segment pair set; S3-2, for the initial segment pair set to be certified. For each initial fragment pair in the fragment pair set, the corresponding numerical field vectors are subtracted item by item according to the field alignment table to form a process difference matrix. The corresponding detection data is encoded item by item into consistent values, reverse values, and missing values ​​to form a detection relation matrix. The start and end continuation judgment is performed on the corresponding flow code values ​​to form a flow continuation matrix. Then, singular value decomposition is performed on the process difference matrix and the singular vector group corresponding to the non-zero singular values ​​is extracted. The process difference matrix is ​​projected and reconstructed on the singular vector group to obtain a stable difference vector. The stable difference vector, detection relation matrix, and flow continuation matrix corresponding to each initial fragment pair are output.

6. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 5, characterized in that: S3 also includes: S3-3, calculating the field position sequence in the stable difference vector, the number of reversed values ​​and missing values ​​in the detection relation matrix, and the number of breakpoints in the flow continuation matrix for each initial fragment pair. The field position sequence, the number of reversed values, the number of missing values, and the number of breakpoints are then arranged in chronological order to form an edge cost sequence. A bipartite connection graph is constructed with the fragment to be verified and the subsequent fragment as the two side nodes and each initial fragment pair as the connecting edge. Lexicographical sorting is performed under the constraint that each fragment to be verified connects to only one subsequent fragment and each subsequent fragment connects to only one fragment to be verified. Unoccupied fragments are then selected sequentially according to the sorted edge cost sequence. The connecting edges corresponding to the segments to be certified and the segments not occupied in the subsequent segment form a provisional set of receiving edges. When there are connecting edges with the same edge cost sequence, the corresponding connecting edges are written back to the candidate thread segment chain respectively, and dynamic programming sequence alignment is performed on the previous segment identifier, the current segment identifier, and the subsequent segment identifier. Connecting edges with fewer broken chain bits are retained, and a stable set of receiving edges is output. S3-4, the segments to be certified that have connecting edges in the stable set of receiving edges are determined as admitted segments and written into the admitted segment set. The segments to be certified that do not have connecting edges in the stable set of receiving edges are determined as unadmitted segments and written into the unadmitted segment set. The admitted segment set and the unadmitted segment set are output.

7. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 6, characterized in that: S4 includes: S4-1, reading each admission fragment in the admission fragment set, along with its predecessor fragment identifier, current fragment identifier, and connection relationships; constructing a directed admission graph with admission fragments as nodes and connection relationships as directed edges; forming an adjacency matrix according to the corresponding column of the predecessor fragment identifier and the corresponding row of the current fragment identifier; performing transitive closure expansion on the adjacency matrix to obtain the reachability matrix; deleting the corresponding return edge when there is a return position from the same node to itself in the reachability matrix and re-performing the transitive closure expansion, until the adjacency matrices obtained in two consecutive rounds are consistent; and outputting a stable connection graph and a stable adjacency matrix; S4-2, reading the number of incoming edges and outgoing edges of each admission fragment based on the stable connection graph. For the current segment with more than one incoming edge, perform a triple sorting based on the order of appearance of the preceding segment in the previous segment set, the order of the links, and the order of the segment identifiers, and retain the incoming edge corresponding to the first position in the sorting. For the preceding segment with more than one outgoing edge, perform a triple sorting based on the order of appearance of the current segment in the subsequent segment set, the order of the links, and the order of the segment identifiers, and retain the outgoing edge corresponding to the first position in the sorting. Then, write the retained connection edges back to the stable adjacency matrix and perform dynamic programming accumulation of the prefix path length table and the suffix path length table. When the same node corresponds to multiple prefix paths and multiple suffix paths, retain the connection edge whose sum of prefix path length and suffix path length is at the first position in the sorting. Output the connection edge set of the main thread.

8. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 7, characterized in that: S4 also includes: S4-3, performing concatenation of the beginning and end of each admitted segment according to the main thread connection edge set to form the lifecycle main thread, and calculating the prefix hash value, connection hash value, and suffix hash value for adjacent admitted segments in the lifecycle main thread. The prefix hash value is generated by concatenating the segment identifier of the previous admitted segment with the previous connection hash value; the connection hash value is generated by concatenating the segment identifier of the current admitted segment, the identifier of the preceding segment, and the current segment identifier; and the suffix hash value is generated by concatenating the segment identifier of the next admitted segment with the connection hash value. Finally, the prefix hash value, connection hash value, and suffix hash value are written to the corresponding admitted segment, and the lifecycle main thread is output. S4-4. Read each unapproved fragment in the unapproved fragment set and each approved fragment in the lifecycle main thread. Generate supporting evidence candidate pairs according to the consistency of board identifier, the adjacent or identical sequence of links, and the correspondence between the source and destination of the flow. Calculate the fragment identifier editing steps, the number of link intervals, and the number of flow breakpoints for each supporting evidence candidate pair and form a supporting evidence cost sequence in chronological order. Then, select the first approved fragment in the sorting order of the supporting evidence cost sequence as the corresponding approved fragment for each unapproved fragment. Write the fragment identifier of the unapproved fragment, the fragment identifier of the corresponding approved fragment, the supporting evidence cost sequence, and the content of the unapproved fragment into the supporting evidence record and output the supporting evidence record set.

9. The lifecycle management method for cyanide-free process circuit boards based on relay chains according to claim 8, characterized in that: S5 includes: S5-1. Based on each main thread segment in the lifecycle main thread and each supporting evidence record in the supporting evidence record set, expand each main thread segment according to the segment identifier, the preceding segment identifier, and the current segment identifier in the main thread segment, and match the corresponding admission segment identifier in each supporting evidence record with the expanded main thread segment identifier item by item to form a full process record sequence and a segment supporting evidence correspondence table; S5-2. For each main thread segment in the full process record sequence, synchronously retrieve the corresponding supporting evidence record according to the segment supporting evidence correspondence table, and perform ternary association expansion according to the order of main thread segment, corresponding supporting evidence record, and next main thread segment to generate thread expansion units corresponding to each main thread segment, and output the thread expansion sequence; S5-3. Perform sequential splicing of each thread expansion unit in the thread expansion sequence according to the segment order, and generate traceability results, responsibility location results, anomaly attribution results, and compliance verification results according to the main thread segment content and the corresponding supporting evidence record content in the thread expansion unit, and output the lifecycle digital thread result of the target board.

10. A relay-chain-based lifecycle management system for cyanide-free process circuit boards, used to implement the relay-chain-based lifecycle management method for cyanide-free process circuit boards according to any one of claims 1-9, the system comprising a data acquisition module, a queue chain construction module, an acceptance and admission module, a thread generation module, and a thread application module, characterized in that: The data acquisition module collects board identifiers, process identifiers, process data, test data, and flow data generated during the raw material entry, cyanide-free copper plating, resin protection, etching, molding, testing, warehousing, transportation, and recycling processes of the target board. It then writes these data into the corresponding data segments according to the acquisition order and outputs the front-end segment set. The candidate thread segment construction module uses relay chain nodes to add preceding segment identifiers and current segment identifiers to each front-end segment in the front-end segment set. It forms a candidate thread segment chain based on the connection relationship between the preceding and current segment identifiers, and marks the current segment that has not yet received a subsequent stage acceptance result as a segment to be verified. It outputs the candidate thread segment chain and the segment set to be verified. The acceptance and admission module reads each segment to be verified and connects the board identifier, process identifier, process data, test data, and flow data in the segment to the newly formed subsequent segments in adjacent stages. The corresponding data is compared item by item. When the processing result, test result or circulation result formed by the segment to be certified is identified in the later segment, the corresponding segment to be certified is determined as the admission segment, and the set of admission segments and the set of non-admission segments are output. The thread generation module is used to write each admission segment in the set of admission segments into the main thread according to the connection relationship, and write each non-admission segment in the set of non-admission segments into the circumstantial record according to the segment identifier of the corresponding admission segment, so as to generate the life cycle digital thread of the target board and output the life cycle main thread and the set of circumstantial records. The thread application module performs association expansion based on the life cycle main thread and the set of circumstantial records, outputs the whole process record of the target board according to the segment order in the life cycle main thread, and synchronously retrieves the corresponding circumstantial record when reading any main thread segment, and outputs the traceability result, responsibility location result, anomaly attribution result and compliance verification result in the form of life cycle digital thread.

Images