@siming-org/core 0.8.3 → 0.8.5

package/dist/index.d.ts

@@ -437,10 +437,16 @@ declare function assertBoundSkillsCompatible(skillRepo: SkillRepo, agentScope: A
  * （`nodeRecords.${nodeId}.checks`），id 含 `.`/`$` 会造成路径注入/错位。
  */
 declare const DagNodePhaseSchema: z.ZodString;
-declare const DagNodeTrackSchema: z.ZodString;
+/**
+ * T202610120005 R7：节点轨道 union 形态——字符串（单轨）或非空字符串数组（多轨节点，
+ * 任一成员被任务匹配集覆盖即激活；含 'all' 成员等价全轨节点）。值域校验（枚举注册表
+ * active 条目）由画布校验/类型校验承载，schema 只做形态与结构必填拦截（空数组拒绝）。
+ * 消费端判定统一走 core/task/track-match.ts 的 effectiveTracks/trackIntersects。
+ */
+declare const DagNodeTrackSchema: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
 /**
  * 内置 phase/track 常量（seed 引用 + 文档化；注册表为运行时权威）。
- * T202608240003：dag_track 另有任务级专用值 mixed/research（注册表 builtin，非节点
+ * T202608240003：dag_track 另有任务级专用值 all/research（注册表 builtin，非节点
  * track 值）——节点 track 不使用这两个值；本常量仅覆盖节点级内置值。
  */
 declare const DAG_PHASES: readonly ["entry", "track", "test", "exit"];
@@ -495,7 +501,7 @@ declare const DagNodeSchema: z.ZodObject<{
     id: z.ZodString;
     label: z.ZodString;
     phase: z.ZodString;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     prompt: z.ZodString;
     skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
     agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -592,7 +598,7 @@ declare const DagTemplateSchema: z.ZodObject<{
         id: z.ZodString;
         label: z.ZodString;
         phase: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
         agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -645,7 +651,7 @@ declare const DagTemplateCreateSchema: z.ZodObject<{
         id: z.ZodString;
         label: z.ZodString;
         phase: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
         agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -699,7 +705,7 @@ declare const DagTemplateUpdateSchema: z.ZodObject<{
         id: z.ZodString;
         label: z.ZodString;
         phase: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
         agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -760,6 +766,50 @@ declare function findDuplicateNodeIds(nodes: ReadonlyArray<{
 declare function assertUniqueNodeIds(nodes: ReadonlyArray<{
     id: string;
 }>): void;
+/** 同轨分叉问题描述（fromNode 对同一目标 track 有多条出边） */
+interface SameTrackForkIssue {
+    /** 分叉源节点 id */
+    nodeId: string;
+    /** 出边指向的目标节点 track（分组键） */
+    targetTrack: string;
+    /** 该组出边条数 */
+    count: number;
+}
+/**
+ * 静态扫描同轨分叉（D6）：对每个节点的出边按【目标节点轨道集合】分组，任一组 > 1 条 → 分叉。
+ *
+ * 三方同语义单源（运行期 advance-engine findNextEdge 分组查重 / 画布 validate D6 规则 /
+ * 本函数写入侧前置拦截）——边本身无 track 字段，目标节点轨道即分组键（与 findNextEdge 一致）。
+ *
+ * 判定口径（与运行期消歧对齐）：
+ * - 1 专属边（目标轨道 ≠ 'all'）+ 1 all 边 → 合法（运行期专属优先消歧）
+ * - 2 异轨专属边（目标轨道不同）→ 合法（跨轨分叉，如 DESIGN→{CODE_BACKEND, CODE_UI}）
+ * - 同组 > 1 条（含 1 专属 + 2 all、2 all）→ 违规（运行期该组消歧必抛错）
+ *
+ * T202610120005 R7：节点轨道 union 形态——分组键 = 轨道集合规范串（数组去重排序
+ * join('+')；含 'all' 成员归一 'all'）。轨道集合相同的节点（如 'backend' 与
+ * ['backend']、['godot','backend'] 与 ['backend','godot']）同组参与查重。静态扫描
+ * 按全量轨道集合分组（不绑定任务 matchSet）——比运行期（按交集分组）宽松：轨道
+ * 集合不同的节点静态异组但某任务下可能同组，由运行期 findNextEdge 最终守卫兜底
+ * （静态拦截是写入侧前置，不可能枚举全部任务轨道组合）。
+ *
+ * 悬挂边（to 指向不存在节点）不在此报——由基础图校验负责，避免双重报错。
+ * 函数级校验而非 schema 级（assertUniqueNodeIds 先例——模板级 schema 禁挂 refine）。
+ */
+declare function findSameTrackForks(nodes: ReadonlyArray<{
+    id: string;
+    track: string | string[];
+}>, edges: ReadonlyArray<{
+    from: string;
+    to: string;
+}>): SameTrackForkIssue[];
+declare function assertNoSameTrackFork(nodes: ReadonlyArray<{
+    id: string;
+    track: string | string[];
+}>, edges: ReadonlyArray<{
+    from: string;
+    to: string;
+}>): void;
 
 type DagTemplateRepo = Repo<DagTemplate> & {
     createDagTemplate(data: DagTemplateCreate): Promise<DagTemplate>;
@@ -999,7 +1049,7 @@ declare const DagInstanceNodeSchema: z.ZodObject<{
     id: z.ZodString;
     label: z.ZodString;
     phase: z.ZodString;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     prompt: z.ZodString;
     skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
     agents: z.ZodDefault<z.ZodArray<z.ZodString>>;
@@ -1020,7 +1070,7 @@ declare const DagInstanceSchema: z.ZodObject<{
         id: z.ZodString;
         label: z.ZodString;
         phase: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
         agents: z.ZodDefault<z.ZodArray<z.ZodString>>;
@@ -1117,7 +1167,7 @@ declare const TaskSchema: z.ZodObject<{
             id: z.ZodString;
             label: z.ZodString;
             phase: z.ZodString;
-            track: z.ZodString;
+            track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
             prompt: z.ZodString;
             skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
             agents: z.ZodDefault<z.ZodArray<z.ZodString>>;
@@ -1155,6 +1205,7 @@ declare const TaskSchema: z.ZodObject<{
     status: z.ZodString;
     pausedAt: z.ZodDefault<z.ZodNullable<z.ZodString>>;
     track: z.ZodString;
+    trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     doc: z.ZodOptional<z.ZodObject<{
         what: z.ZodString;
         why: z.ZodString;
@@ -1254,7 +1305,7 @@ type Task = z.infer<typeof TaskSchema>;
 type TaskPatch = Partial<Task> & Record<string, unknown>;
 declare const TaskCreateInputSchema: z.ZodObject<{
     title: z.ZodString;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     dagTemplateId: z.ZodString;
     skipNodes: z.ZodOptional<z.ZodArray<z.ZodString>>;
     type: z.ZodOptional<z.ZodEnum<{
@@ -1287,12 +1338,13 @@ declare const TaskContextSchema: z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
     currentNode: z.ZodNullable<z.ZodObject<{
         nodeId: z.ZodString;
         label: z.ZodString;
         phase: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodArray<z.ZodString>;
         agents: z.ZodArray<z.ZodString>;
@@ -1419,6 +1471,7 @@ declare const TaskSummarySchema: z.ZodObject<{
     status: z.ZodString;
     pausedAt: z.ZodNullable<z.ZodString>;
     track: z.ZodString;
+    trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     progress: z.ZodObject<{
         completed: z.ZodNumber;
         total: z.ZodNumber;
@@ -1453,7 +1506,10 @@ interface TaskPathUpdate {
 }
 type TaskRepo = Repo<Task> & {
     /** resolvedProjectId 由路由层解析（D2：显式携带校验一致性后传入 / 缺省 = 模板 projectId），repo 不做隐式继承；session 供 convert 组事务透传（T202609150002：任务+关联原子，缺省行为不变） */
-    createTask(input: TaskCreateInput, template: DagTemplate, resolvedProjectId: string, session?: ClientSession): Promise<Task>;
+    createTask(input: TaskCreateInput, template: DagTemplate, resolvedProjectId: string, trackInfo: {
+        trackMembers: string[];
+        trackAnchor: string;
+    }, session?: ClientSession): Promise<Task>;
     getByTaskId(taskId: string): Promise<Task | null>;
     /** N015 F4/F5/F6 + N017 D6：分页 + 排序 + 进度概要投影（剥离 dagInstance/history；total 为过滤后总数） */
     listTasks(filter?: TaskListFilter): Promise<{
@@ -2021,7 +2077,7 @@ declare const NodePresetShapeSchema: z.ZodObject<{
     label: z.ZodString;
     nodeId: z.ZodString;
     phase: z.ZodString;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     prompt: z.ZodString;
     skills: z.ZodArray<z.ZodString>;
     agents: z.ZodArray<z.ZodString>;
@@ -2053,7 +2109,7 @@ declare const NodePresetSchema: z.ZodObject<{
     label: z.ZodString;
     nodeId: z.ZodString;
     phase: z.ZodString;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     prompt: z.ZodString;
     skills: z.ZodArray<z.ZodString>;
     agents: z.ZodArray<z.ZodString>;
@@ -2092,7 +2148,7 @@ declare const NodePresetCreateSchema: z.ZodObject<{
         project: "project";
     }>;
     projectId: z.ZodOptional<z.ZodString>;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     phase: z.ZodString;
     label: z.ZodString;
     prompt: z.ZodString;
@@ -2104,10 +2160,10 @@ declare const NodePresetCreateSchema: z.ZodObject<{
         id: z.ZodString;
         item: z.ZodString;
     }, z.core.$strip>>>;
+    nodeId: z.ZodString;
     source: z.ZodOptional<z.ZodObject<{
         package: z.ZodString;
     }, z.core.$strip>>;
-    nodeId: z.ZodString;
     skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
     agents: z.ZodDefault<z.ZodArray<z.ZodString>>;
     version: z.ZodDefault<z.ZodString>;
@@ -2128,7 +2184,7 @@ declare const NodePresetUpdateSchema: z.ZodObject<{
     projectId: z.ZodOptional<z.ZodOptional<z.ZodString>>;
     skills: z.ZodOptional<z.ZodArray<z.ZodString>>;
     agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
-    track: z.ZodOptional<z.ZodString>;
+    track: z.ZodOptional<z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>>;
     phase: z.ZodOptional<z.ZodString>;
     label: z.ZodOptional<z.ZodString>;
     prompt: z.ZodOptional<z.ZodString>;
@@ -2140,10 +2196,10 @@ declare const NodePresetUpdateSchema: z.ZodObject<{
         id: z.ZodString;
         item: z.ZodString;
     }, z.core.$strip>>>>;
+    nodeId: z.ZodOptional<z.ZodString>;
     source: z.ZodOptional<z.ZodOptional<z.ZodObject<{
         package: z.ZodString;
     }, z.core.$strip>>>;
-    nodeId: z.ZodOptional<z.ZodString>;
     version: z.ZodOptional<z.ZodOptional<z.ZodString>>;
 }, z.core.$strip>;
 type NodePresetUpdate = z.infer<typeof NodePresetUpdateSchema>;
@@ -2742,7 +2798,7 @@ declare const TemplatePayloadSchema: z.ZodObject<{
         id: z.ZodString;
         label: z.ZodString;
         phase: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
         agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -2850,7 +2906,7 @@ declare const ExportBundleSchema: z.ZodObject<{
             id: z.ZodString;
             label: z.ZodString;
             phase: z.ZodString;
-            track: z.ZodString;
+            track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
             prompt: z.ZodString;
             skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
             agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -2948,7 +3004,7 @@ declare const ImportPlanRequestSchema: z.ZodObject<{
                 id: z.ZodString;
                 label: z.ZodString;
                 phase: z.ZodString;
-                track: z.ZodString;
+                track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
                 prompt: z.ZodString;
                 skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
                 agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -3079,7 +3135,7 @@ declare const ImportApplyRequestSchema: z.ZodObject<{
                 id: z.ZodString;
                 label: z.ZodString;
                 phase: z.ZodString;
-                track: z.ZodString;
+                track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
                 prompt: z.ZodString;
                 skills: z.ZodDefault<z.ZodArray<z.ZodString>>;
                 agents: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -3268,6 +3324,14 @@ declare const ImportPlanResponseSchema: z.ZodObject<{
             missing: "missing";
         }>;
     }, z.core.$strip>>;
+    directAgentChecks: z.ZodArray<z.ZodObject<{
+        node: z.ZodString;
+        agent: z.ZodString;
+        status: z.ZodEnum<{
+            ok: "ok";
+            missing: "missing";
+        }>;
+    }, z.core.$strip>>;
     warnings: z.ZodArray<z.ZodString>;
 }, z.core.$strip>;
 type ImportPlanResponse = z.infer<typeof ImportPlanResponseSchema>;
@@ -3357,13 +3421,14 @@ declare const TaskPublicSchema: z.ZodObject<{
     status: z.ZodString;
     pausedAt: z.ZodNullable<z.ZodString>;
     track: z.ZodString;
+    trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
 }, z.core.$strip>;
 type TaskPublic = z.infer<typeof TaskPublicSchema>;
 /** N017 F8：删 gates；upcomingPause 语义改为"完成当前节点后出边上的暂停点描述"（经 findNextEdge 按轨选边） */
 declare const NodeInfoSchema: z.ZodObject<{
     nodeId: z.ZodString;
     label: z.ZodString;
-    track: z.ZodString;
+    track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
     prompt: z.ZodString;
     skills: z.ZodArray<z.ZodString>;
     agents: z.ZodArray<z.ZodString>;
@@ -3396,11 +3461,12 @@ declare const AdvanceResponseSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
     nextNode: z.ZodObject<{
         nodeId: z.ZodString;
         label: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodArray<z.ZodString>;
         agents: z.ZodArray<z.ZodString>;
@@ -3431,6 +3497,7 @@ declare const AdvanceResponseSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
     pausePoint: z.ZodObject<{
         type: z.ZodEnum<{
@@ -3458,6 +3525,7 @@ declare const AdvanceResponseSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
 }, z.core.$strip>], "status">;
 type AdvanceResponse = z.infer<typeof AdvanceResponseSchema>;
@@ -3478,11 +3546,12 @@ declare const ApproveResponseSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
     nextNode: z.ZodObject<{
         nodeId: z.ZodString;
         label: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodArray<z.ZodString>;
         agents: z.ZodArray<z.ZodString>;
@@ -3513,6 +3582,7 @@ declare const ApproveResponseSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
     guidance: z.ZodString;
 }, z.core.$strip>, z.ZodObject<{
@@ -3532,6 +3602,7 @@ declare const ApproveResponseSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     }, z.core.$strip>;
 }, z.core.$strip>], "status">;
 type ApproveResponse = z.infer<typeof ApproveResponseSchema>;
@@ -3605,6 +3676,7 @@ declare const TaskProgressPublicSchema: z.ZodObject<{
     status: z.ZodString;
     pausedAt: z.ZodNullable<z.ZodString>;
     track: z.ZodString;
+    trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
     projectId: z.ZodString;
     progress: z.ZodObject<{
         completed: z.ZodNumber;
@@ -3644,6 +3716,7 @@ declare const WriteAckSchema: z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
         projectId: z.ZodString;
         progress: z.ZodObject<{
             completed: z.ZodNumber;
@@ -3708,6 +3781,7 @@ declare const TaskBatchAckSchema: z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
         projectId: z.ZodString;
         progress: z.ZodObject<{
             completed: z.ZodNumber;
@@ -3734,6 +3808,7 @@ declare const CreateTaskResponseSchema: z.ZodObject<{
         status: z.ZodString;
         pausedAt: z.ZodNullable<z.ZodString>;
         track: z.ZodString;
+        trackMatch: z.ZodOptional<z.ZodArray<z.ZodString>>;
         projectId: z.ZodString;
         progress: z.ZodObject<{
             completed: z.ZodNumber;
@@ -3743,7 +3818,7 @@ declare const CreateTaskResponseSchema: z.ZodObject<{
     firstNode: z.ZodObject<{
         nodeId: z.ZodString;
         label: z.ZodString;
-        track: z.ZodString;
+        track: z.ZodUnion<readonly [z.ZodString, z.ZodArray<z.ZodString>]>;
         prompt: z.ZodString;
         skills: z.ZodArray<z.ZodString>;
         agents: z.ZodArray<z.ZodString>;
@@ -3908,7 +3983,7 @@ declare function parseAuthEnabledEnvValue(raw: string): boolean | undefined;
  * Domain error types — thrown by core business logic, caught by server's app.onError().
  */
 /** N012 语义化业务错误码（可选挂载到 AppError 子类；HTTP 形状向后兼容：error 字段缺省仍为 http 级 code） */
-type BizCode = 'PROJECT_ARCHIVED' | 'TEMPLATE_PROJECT_MISMATCH' | 'TEMPLATE_PROJECT_IMMUTABLE' | 'SCOPE_IMMUTABLE' | 'TASK_PROJECT_IMMUTABLE' | 'DEFAULT_PROJECT_IMMUTABLE' | 'TEMPLATE_NAME_CONFLICT' | 'TEMPLATE_CODE_CONFLICT' | 'TEMPLATE_CODE_IMMUTABLE' | 'PROJECT_NOT_FOUND' | 'AGENT_SKILL_SCOPE_CONFLICT' | 'MODEL_CODE_EXISTS' | 'MODEL_CODE_IMMUTABLE' | 'MODEL_ALIAS_IN_USE' | 'ENUM_ENTRY_BUILTIN' | 'ENUM_ENTRY_IN_USE' | 'ENUM_VALUE_CONFLICT' | 'NAME_SCOPE_CONFLICT' | 'REFERENCE_IN_USE' | 'TASK_DOC_NOT_SET' | 'TASK_DOC_NOT_FOUND' | 'TASK_DOC_SECTION_NOT_FOUND' | 'TASK_AT_PAUSE_POINT' | 'TASK_NOT_AT_PAUSE_POINT' | 'NODE_NOT_IN_INSTANCE' | 'CHECK_NOT_FOUND' | 'NODE_RECORD_NOT_WRITABLE' | 'TASK_TERMINATED' | 'TASK_NOT_TERMINATED' | 'TASK_FINALIZE_CONFIRMATION_REQUIRED' | 'TASK_PRUNE_GRAPH_INVALID' | 'TASK_SKIP_NODE_NOT_FOUND' | 'TASK_TYPE_TRACK_MISMATCH' | 'TEMPLATE_DISABLED' | 'AUTH_REQUIRED' | 'AUTH_TOKEN_INVALID' | 'AUTH_INVALID_CREDENTIALS' | 'AUTH_FORBIDDEN' | 'AUTH_ACCOUNT_EXISTS' | 'BATCH_EMPTY' | 'BATCH_LIMIT_EXCEEDED' | 'BATCH_PAYLOAD_TOO_LARGE' | 'NODE_PRESET_CODE_EXISTS' | 'NODE_PRESET_CODE_IMMUTABLE' | 'NODE_PRESET_VERSION_REQUIRED' | 'TEMPLATE_NODE_ID_DUPLICATE' | 'NODE_LIBRARY_COMPOSITION_NOT_FOUND' | 'UPGRADE_DECISION_REQUIRED' | 'UPGRADE_STALE' | 'FLOW_MANIFEST_INVALID' | 'ISSUE_NOT_FOUND' | 'ISSUE_INVALID_TRANSITION' | 'ISSUE_PROJECT_MISMATCH' | 'ISSUE_BATCH_LIMIT_EXCEEDED';
+type BizCode = 'PROJECT_ARCHIVED' | 'TEMPLATE_PROJECT_MISMATCH' | 'TEMPLATE_PROJECT_IMMUTABLE' | 'SCOPE_IMMUTABLE' | 'TASK_PROJECT_IMMUTABLE' | 'DEFAULT_PROJECT_IMMUTABLE' | 'TEMPLATE_NAME_CONFLICT' | 'TEMPLATE_CODE_CONFLICT' | 'TEMPLATE_CODE_IMMUTABLE' | 'PROJECT_NOT_FOUND' | 'AGENT_SKILL_SCOPE_CONFLICT' | 'MODEL_CODE_EXISTS' | 'MODEL_CODE_IMMUTABLE' | 'MODEL_ALIAS_IN_USE' | 'ENUM_ENTRY_BUILTIN' | 'ENUM_ENTRY_IN_USE' | 'ENUM_VALUE_CONFLICT' | 'NAME_SCOPE_CONFLICT' | 'REFERENCE_IN_USE' | 'TASK_DOC_NOT_SET' | 'TASK_DOC_NOT_FOUND' | 'TASK_DOC_SECTION_NOT_FOUND' | 'TASK_AT_PAUSE_POINT' | 'TASK_NOT_AT_PAUSE_POINT' | 'NODE_NOT_IN_INSTANCE' | 'CHECK_NOT_FOUND' | 'NODE_RECORD_NOT_WRITABLE' | 'TASK_TERMINATED' | 'TASK_NOT_TERMINATED' | 'TASK_FINALIZE_CONFIRMATION_REQUIRED' | 'TASK_PRUNE_GRAPH_INVALID' | 'TASK_SKIP_NODE_NOT_FOUND' | 'TASK_TYPE_TRACK_MISMATCH' | 'TASK_TRACK_MATCH_MISSING' | 'TEMPLATE_DISABLED' | 'AUTH_REQUIRED' | 'AUTH_TOKEN_INVALID' | 'AUTH_INVALID_CREDENTIALS' | 'AUTH_FORBIDDEN' | 'AUTH_ACCOUNT_EXISTS' | 'BATCH_EMPTY' | 'BATCH_LIMIT_EXCEEDED' | 'BATCH_PAYLOAD_TOO_LARGE' | 'NODE_PRESET_CODE_EXISTS' | 'NODE_PRESET_CODE_IMMUTABLE' | 'NODE_PRESET_VERSION_REQUIRED' | 'TEMPLATE_NODE_ID_DUPLICATE' | 'TEMPLATE_SAME_TRACK_FORK' | 'NODE_LIBRARY_COMPOSITION_NOT_FOUND' | 'UPGRADE_DECISION_REQUIRED' | 'UPGRADE_STALE' | 'FLOW_MANIFEST_INVALID' | 'ISSUE_NOT_FOUND' | 'ISSUE_INVALID_TRANSITION' | 'ISSUE_PROJECT_MISMATCH' | 'ISSUE_BATCH_LIMIT_EXCEEDED';
 /** bizCode → 用户可读中文 message（单一真相源，路由层抛错时引用） */
 declare const BIZ_CODE_MESSAGES: Record<BizCode, string>;
 interface AppErrorOptions {
@@ -4281,22 +4356,27 @@ declare function derivePreTerminalState(history: HistoryEntry[]): {
 /**
  * @internal 供单测直接验证的模块私有 helper（非公共 API）
  * N017：findNextNode → findNextEdge——返回边对象（调用方需要 pausePoint）
- * T202608240003：单轨匹配扩展为匹配集（mixed → {backend,ui,all}，trackMatchSet 单源）；
+ * T202608240003：单轨匹配扩展为匹配集（matchSetOf 单源）；
+ * T202610120005：第 4 参 track:string → matchSet:ReadonlySet<string>（调用方经
+ * matchSetOf(task.trackMatch) 构造——快照单源，函数自身不再查 track-match 表）；
+ * 节点轨道 union 形态（R7 多轨节点）：匹配判定与消歧分组均按「有效轨集合」
+ * （effectiveTracks = 节点轨道 ∩ matchSet；数组含 'all' 成员等价 {'all'} 全轨）。
  * 多匹配消歧（判定顺序固定，防止 D6 保护成为不可达分支）：
- *   a. 按目标 track 值分组查重——任一分组 > 1 条 → D6 报错（模板同轨分叉）
- *   b. 存在专属候选边（目标 track ≠ 'all'）→ 全部专属候选中按模板边声明序取第一条
+ *   a. 按目标有效轨集合分组查重——任一分组 > 1 条 → D6 报错（模板同轨分叉；
+ *      多轨节点与同集合字符串节点同键参与查重）
+ *   b. 存在专属候选边（有效轨集合 ≠ {'all'}）→ 全部专属候选中按模板边声明序取第一条
  *   c. 无专属候选 → 取 all 边（唯一性已由 a 的分组查重保证）
  * 单轨任务匹配集合与旧逻辑逐字等价（{track,'all'}）且无多匹配出边 → 行为不变（兼容）。
  * 注意：消歧对单轨同样生效——「同轨专属边 + all 边」混合多匹配时取专属边（D4 意图），
- * 仅「同一 track 值多条边」维持 D6 报错（真分叉模板错误）。
+ * 仅「同一有效轨集合多条边」维持 D6 报错（真分叉模板错误）。
  */
-declare function findNextEdge(edges: DagEdge[], nodes: Pick<DagNode, 'id' | 'track'>[], fromNodeId: string, track: string): DagEdge | null;
+declare function findNextEdge(edges: DagEdge[], nodes: Pick<DagNode, 'id' | 'track'>[], fromNodeId: string, matchSet: ReadonlySet<string>): DagEdge | null;
 /** @internal 供单测直接验证的模块私有 helper（非公共 API） */
 declare function checkTermination(nodes: DagNode[], edges: {
     from: string;
     to: string;
     condition?: string | undefined;
-}[], nodeStates: Record<string, NodeState>, upcomingCompletedState: NodeState, upcomingCompletedNodeId: string, track: string): boolean;
+}[], nodeStates: Record<string, NodeState>, upcomingCompletedState: NodeState, upcomingCompletedNodeId: string, matchSet: ReadonlySet<string>): boolean;
 /** @internal 供单测直接验证的模块私有 helper（非公共 API） */
 declare function toTaskPublic(task: Task): TaskPublic;
 /**
@@ -4325,28 +4405,115 @@ interface PruneResult {
     prunedNodes: string[];
     entryNode: DagNode;
 }
+/** 剪枝核心产物：保留节点 + 保留边（含桥接边） */
+interface PrunedGraph {
+    nodes: DagNode[];
+    edges: DagEdge[];
+}
+/**
+ * 剪枝核心（轨道剔除 ∪ 显式剔除 → 删边 → 桥接）——pruneInstance 与
+ * track-chains 链序模拟共享的单源实现（提取而非复制，防两处口径漂移）。
+ *
+ * T202610120005：第 2 参 taskTrack:string → trackMembers:readonly string[]——
+ * 任务轨道成员快照（matchSetOf 构造匹配集 = 成员并集 + 'all'）；节点保留判定
+ * 走 trackIntersects 交集语义（R7 多轨节点任一成员被覆盖即保留）。
+ *
+ * 不含图校验/引擎路径模拟（那是 pruneInstance 创建期职责）；桥接路径断裂时
+ * 返回 ok:false + reason（调用方各自决定 throw 或描述性输出），其余恒成功。
+ */
+declare function buildPrunedGraph(template: Pick<DagTemplate, 'nodes' | 'edges'>, trackMembers: readonly string[], skipNodeIds?: readonly string[]): {
+    ok: true;
+    graph: PrunedGraph;
+} | {
+    ok: false;
+    reason: string;
+};
 /**
  * 剪枝主函数（技术方案 §2.2 六步）。
  *
  * @param template 模板全量快照（nodes/edges）
- * @param taskTrack 任务轨道（注册表合法值，含 mixed/research）
+ * @param trackMembers 任务轨道成员快照（T202610120005：组合口径——创建入口归一化产物，
+ *   通配（all/mixed 历史）已展开为成员清单；matchSetOf 单源构造匹配集）
  * @param skipNodeIds 显式剔除清单（skill 映射矩阵产物）
  */
-declare function pruneInstance(template: DagTemplate, taskTrack: string, skipNodeIds: string[]): PruneResult;
+declare function pruneInstance(template: DagTemplate, trackMembers: readonly string[], skipNodeIds: string[]): PruneResult;
 
 /**
- * T202608240003：任务轨道 → 实例节点 track 匹配集。
+ * 任务轨道匹配集单源。
+ * T202610120005：词表自由组合改造——轨道词表（枚举注册表 dag_track）只管单轨，
+ * 任务轨道 = 词表成员的组合（创建时解析冻结进 task.trackMatch 快照，运行时
+ * 路由/剪枝/终态判定只读快照不回查注册表——升版/停用不影响在途任务）。
+ * all = 任务级通配（验收反馈 2026-10-13，mixed 退役后由 all 承载）：创建时展开为
+ * 全部 active 节点级单轨冻结（存量任务快照自治——历史 mixed 任务迁移为旧义
+ * [backend,ui]、历史 mixed 锚任务展示走含停用 label 命中，引擎无差别消费快照）。
  * 独立单源模块——prune（剪枝轨道剔除 + 引擎路径可达性校验）与 advance-engine
  * （流转路由 + 终止判定）消费同一语义，防止剪枝与路由口径漂移。
- * T202608280004：web dag-editor validate 规则 4 持有本函数的本地镜像副本——
- * 本函数语义演进须同步该副本。
+ * T202608280004：web dag-editor validate 规则 4 持有本模块的本地镜像副本——
+ * 本模块语义演进须同步该副本。
+ */
+/**
+ * 任务轨道成员快照 → 匹配集（成员并集 + 'all' 哨兵——all 是节点级哨兵，
+ * 任何任务匹配集恒含它；PRD A2 沿用）。
+ * members 为空数组 → fail-loud（任务缺轨道匹配快照，疑似未迁移或脏数据，
+ * 禁止静默兜底成空集——空集会剪空整个实例图）。
+ */
+declare function matchSetOf(members: readonly string[] | undefined): ReadonlySet<string>;
+/**
+ * 节点轨道 ∩ 任务匹配集 → 有效轨集合（消歧分组 / 专属边判定用）。
+ * 节点轨道是 union 形态（T202610120005 R7：字符串=单轨，数组=多轨节点）：
+ * - 字符串 'all' 或数组含 'all' 成员 → {'all'}（全轨节点，等价哨兵形态）
+ * - 其余 = 数组去重 / 字符串单值后，过滤 ∈ matchSet 的成员
+ * 返回空集 = 节点与任务轨道无交集（剪枝剔除）。
  */
+declare function effectiveTracks(nodeTrack: string | string[], matchSet: ReadonlySet<string>): ReadonlySet<string>;
+/**
+ * 节点保留判定：有效轨集合非空（R7 交集语义——多轨节点任一成员被任务覆盖即保留；
+ * 单轨节点等价旧 matchSet.has(track)）。
+ */
+declare function trackIntersects(nodeTrack: string | string[], matchSet: ReadonlySet<string>): boolean;
+
+/**
+ * T202610120004 A2：模板链序模拟——按任务轨道视角模拟「剪枝（含桥接）→ 引擎逐跳路由」，
+ * 输出各轨道的节点链序（entry → … → terminal），供 import --plan / 导入回执展示。
+ *
+ * 与任务创建期 pruneInstance 的差异（刻意）：
+ * - 不做图完整性断言（节点≥2/可达性/terminal 等）——本模拟是「引擎会走什么」的
+ *   描述性展示，不是创建期守卫；不可服务的轨道以 error 字段输出原因
+ * - 只读纯函数：永不 throw（轨道内部错误捕获为 error 项），可安全用于展示层
+ * 入口判定与 pruneInstance 同口径（剪后入度 0）——phase 是节点阶段类别标签，
+ * 生产模板中 'entry' 类别可多点（PRD/ALIGN/DESIGN 并存），phase 判定会对合法
+ * 模板输出多入口噪音（V6 实测暴露），入度判定才是引擎真实起点。
+ */
+/** 单轨道链序模拟结果（error 存在 = 该轨不可服务，chain 为空） */
+interface TrackChainResult {
+    /** 任务轨道（backend/ui/组合视角如 backend+ui/自定义） */
+    track: string;
+    /** 引擎路径节点 id 序列（entry 开头；不可服务时为空数组） */
+    chain: string[];
+    /** 不可服务原因（剪枝断裂/入口缺失/路由消歧失败/环） */
+    error?: string;
+}
+/**
+ * 模拟入口（纯函数）。轨道集合口径：模板节点轨道出现的非 'all' track 全集
+ * （T202610120005 R7：多轨节点逐成员贡献；含 'all' 成员等价全轨节点不贡献），
+ * backend+ui 双轨节点齐备时追加组合视角 'backend+ui'（双链串行模拟，T202610120005
+ * 验收反馈：mixed 退役，组合串即模拟轨名，'+' 分隔逐段解析）。
+ */
+declare function simulateTrackChains(template: Pick<DagTemplate, 'nodes' | 'edges'>): TrackChainResult[];
+/** 结构约束条目（rule=规则陈述；正反例为可执行对照——反例必须被 assertNoSameTrackFork 拒绝） */
+interface TemplateStructureConstraint {
+    id: string;
+    title: string;
+    rule: string;
+    positiveExample: string;
+    negativeExample: string;
+}
 /**
- * - backend/ui/research：匹配本轨道节点 + 'all' 哨兵
- * - mixed：匹配双轨道节点 + 'all'（两链串行，链序由引擎消歧的模板边声明序决定）
- * - 自定义轨道（注册表运行时权威）：匹配本轨道 + 'all'（机械剪枝，语义自洽）
+ * 模板结构约束速查（4 条）——解决「配置者只能读源码才知道模板怎么写」的问题。
+ * 文案与 findSameTrackForks / findNextEdge / buildPrunedGraph 桥接语义同源，
+ * 改动引擎语义时同步更新本表（V5 验收：反例必须被 A1 断言拒绝）。
  */
-declare function trackMatchSet(taskTrack: string): ReadonlySet<string>;
+declare const TEMPLATE_STRUCTURE_CONSTRAINTS: readonly TemplateStructureConstraint[];
 
 /**
  * N020 D1：条目短 id 生成（服务端权威，客户端永不指定）。
@@ -4376,7 +4543,9 @@ interface TemplateTransferDeps {
 /**
  * 导出依赖闭包推导（T202608300002 §2.2，PRD 3.1 规则 1-4，一跳封闭）：
  * 1. SKILL 直接引用集 = 模板所有节点 skills 字段（去重）
- * 2. AGENT 集 = boundSkills 与直接引用集有交集的 agent（查询范围：global 全集 + 源项目 project 全集）
+ * 2. AGENT 集 = boundSkills 与直接引用集有交集的 agent ∪ 节点 agents 直接引用的 agent
+ *    （T202610120001：节点可不经 skill 绑定直接引用 agent——仅按 boundSkills 反查会整层漏收；
+ *     查询范围：global 全集 + 源项目 project 全集）
  * 3. SKILL 全集 = 直接引用 ∪ 被导出 AGENT 的 boundSkills（一跳封闭——新增 SKILL 不反查更多 AGENT）
  * 4. 模型映射集 = 被导出 AGENT 的 model code 对应别名
  *
@@ -4414,4 +4583,4 @@ declare function applyImport(deps: TemplateTransferDeps, targetProjectId: string
 declare const VERSION: string;
 declare function ping(): string;
 
-export { AGENT_MAIN_DOC, ARTIFACT_TYPES, AUTH_COLLECTIONS, type AdvanceDeps, type AdvanceInput, type AdvanceRequest, AdvanceRequestSchema, type AdvanceResponse, AdvanceResponseSchema, type Agent, type AgentCopy, AgentCopySchema, type AgentCreate, AgentCreateSchema, type AgentFunction, AgentFunctionSchema, type AgentPayload, AgentPayloadSchema, type AgentRepo, AgentSchema, type AgentScope, AgentScopeSchema, AgentShapeSchema, type AgentUpdate, AgentUpdateSchema, type AiCheck, AiCheckSchema, AppError, type AppErrorOptions, type ApproveRequest, ApproveRequestSchema, type ApproveResponse, ApproveResponseSchema, type ArchNote, ArchNoteSchema, type Artifact, ArtifactSchema, type ArtifactType, type AssetListOpts, type AssetSetEnabled, AssetSetEnabledSchema, type AuthAccount, type AuthAccountCreate, AuthAccountCreateSchema, AuthAccountSchema, type AuthSession, type AuthStatus, AuthStatusSchema, type AuthToken, type AuthTokenGenResponse, AuthTokenGenResponseSchema, type AuthTokenKind, AuthTokenSchema, type AuthTokenStatus, AuthTokenStatusSchema, type AuthTokenType, AuthTokenTypeSchema, type AuthWhoami, AuthWhoamiSchema, BIZ_CODE_MESSAGES, BadRequestError, type BizCode, CONTEXT_VIEWS, type CancelRequest, CancelRequestSchema, type CheckItem, CheckItemSchema, type Composition, type CompositionEdge, CompositionEdgeSchema, CompositionSchema, type Confirmation, ConfirmationSchema, ConflictError, type ContextView, ContextViewSchema, type ConvertGroupOutcome, type CreateTaskResponse, CreateTaskResponseSchema, DAG_PHASES, DAG_TRACKS, DEFAULT_PROJECT_KEY, DEFAULT_VCS_DOC_PATHS, type DagEdge, DagEdgeSchema, type DagInstance, type DagInstanceNode, DagInstanceNodeSchema, DagInstanceSchema, type DagNode, DagNodePhaseSchema, DagNodeSchema, DagNodeTrackSchema, type DagTemplate, type DagTemplateCopy, DagTemplateCopySchema, type DagTemplateCreate, DagTemplateCreateSchema, type DagTemplateRepo, DagTemplateSchema, type DagTemplateUpdate, DagTemplateUpdateSchema, type Decision, DecisionSchema, type DependencyAction, DependencyActionSchema, type DependencyCheck, DependencyCheckSchema, type DependencyStatus, DependencyStatusSchema, ENTRY_ID_REGEX, EXPORT_FORMAT_VERSION, type EchoItem, EchoItemSchema, type EdgePausePoint, EdgePausePointBaseSchema, EdgePausePointSchema, type EnumEntry, EnumEntrySchema, type EnumRegistry, type EnumRegistryCategory, EnumRegistryCategorySchema, type EnumRegistryRepo, EnumRegistrySchema, type EnumRegistryUpdate, EnumRegistryUpdateSchema, type ExportBundle, ExportBundleSchema, ForbiddenError, HistoryActionSchema, type HistoryEntry, HistoryEntrySchema, ISSUE_ACTIVE_STATUSES, ISSUE_CONVERT_MODES, ISSUE_SOURCES, ISSUE_STATUSES, type ImportApplyRequest, ImportApplyRequestSchema, type ImportApplyResponse, ImportApplyResponseSchema, type ImportDecision, ImportDecisionSchema, type ImportPlanRequest, ImportPlanRequestSchema, type ImportPlanResponse, ImportPlanResponseSchema, type Issue, type IssueConvertMode, IssueConvertModeSchema, type IssueCreate, IssueCreateSchema, type IssueHistoryEntry, IssueHistoryEntrySchema, type IssueListFilter, type IssueProgress, IssueProgressSchema, type IssueRepo, IssueSchema, type IssueSource, IssueSourceSchema, type IssueStatus, type IssueStatusChange, IssueStatusSchema, type IssueTaskSnapshot, type IssueUpdate, IssueUpdateSchema, type IssueWithProgress, type LoginInput, LoginSchema, type ModelAlias, type ModelAliasCreate, ModelAliasCreateSchema, type ModelAliasPayload, ModelAliasPayloadSchema, type ModelAliasRepo, ModelAliasSchema, ModelAliasShapeSchema, type ModelAliasUpdate, ModelAliasUpdateSchema, type ModelAliasWithRefCount, ModelAliasWithRefCountSchema, NODE_CHECKS_MAX, NODE_ID_PATTERN, NODE_PRESET_CODE_PATTERN, NODE_STATUSES, type NodeContentFields, type NodeInfo, NodeInfoSchema, type NodeLibrary, type NodeLibraryRepo, NodeLibrarySchema, type NodeLibraryUpsert, NodeLibraryUpsertSchema, type NodePreset, type NodePresetCopy, NodePresetCopySchema, type NodePresetCreate, NodePresetCreateSchema, type NodePresetListFilter, type NodePresetRepo, NodePresetSchema, NodePresetShapeSchema, type NodePresetUpdate, NodePresetUpdateSchema, type NodeRecord, NodeRecordSchema, type NodeState, NodeStateSchema, NodeStatusSchema, NotFoundError, OBJECT_ID_HEX, type OmitId, PAUSE_POINT_TYPES, type PasswordChange, PasswordChangeSchema, PausePointTypeSchema, type PauseRequest, PauseRequestSchema, type Project, type ProjectCreate, ProjectCreateSchema, type ProjectRepo, ProjectSchema, type ProjectStatus, ProjectStatusSchema, type ProjectUpdate, ProjectUpdateSchema, type PruneResult, REFERENCE_LIMITS, type ReferenceDoc, type ReopenInput, type ReopenRequest, ReopenRequestSchema, type ReopenResponse, type Repo, type ResumeRequest, ResumeRequestSchema, type ReviewSummary, ReviewSummarySchema, SIMING_CODE_REGEX, SIMING_CONFIG_ENV_KEYS, SIMING_CONFIG_KEYS, SKILL_MAIN_DOC, type SimingClient, type SimingConfig, type SimingConfigKey, SimingConfigSchema, SimingLogLevelSchema, type Skill, type SkillCopy, SkillCopySchema, type SkillCreate, SkillCreateSchema, type SkillPayload, SkillPayloadSchema, type SkillRepo, SkillSchema, type SkillScope, SkillScopeSchema, SkillShapeSchema, type SkillUpdate, SkillUpdateSchema, type SourcePreset, SourcePresetSchema, TASK_PHASES, TASK_STATUSES, TASK_TYPES, TEMPLATE_CODE_MAX_LENGTH, TEMPLATE_CODE_REGEX, type Task, type TaskBatchAck, TaskBatchAckSchema, type TaskBatchEntry, TaskBatchEntrySchema, type TaskBatchFailure, TaskBatchFailureSchema, type TaskContext, TaskContextSchema, type TaskCreateInput, TaskCreateInputSchema, type TaskDocContent, TaskDocContentSchema, type TaskIssueView, type TaskLink, TaskLinkSchema, type TaskPatch, TaskPhaseSchema, type TaskProgress, type TaskProgressPublic, TaskProgressPublicSchema, TaskProgressSchema, type TaskPublic, TaskPublicSchema, type TaskRepo, TaskSchema, TaskStatusSchema, type TaskSummary, TaskSummarySchema, type TaskType, type TemplateCandidate, TemplateCandidateSchema, TemplateCodeFieldSchema, type TemplateContentChanges, type TemplateContentDiff, type TemplateContentSource, type TemplatePayload, TemplatePayloadSchema, type TemplateTransferDeps, type TestReport, TestReportSchema, type ToolCheck, ToolCheckSchema, UnauthorizedError, type UpgradeAction, UpgradeActionSchema, type UpgradeApplyOutcome, type UpgradeApplyRequest, UpgradeApplyRequestSchema, type UpgradeApplyResultItem, type UpgradeDecision, type UpgradeDecisionInput, UpgradeDecisionSchema, type UpgradeNodeStatus, UpgradeNodeStatusSchema, type UpgradePlanItem, type UpgradePlanResult, VERSION, ValidationError, type VcsConfig, VcsConfigSchema, WRITE_ACK_ENTRY_KINDS, type WithId, type WriteAck, type WriteAckEntryKind, WriteAckEntryKindSchema, WriteAckSchema, advanceTask, applyImport, applyUpgradeDecisions, approveTask, assertBoundSkillsCompatible, assertModelAliasExists, assertReferenceAggregateLimit, assertReferencesDeletable, assertUniqueAiCheckIds, assertUniqueNodeIds, buildImportPlan, buildTemplateCode, buildUpgradePlan, bumpPatch, bumpPatchOrPassthrough, cancelTask, canonicalizeReferencePath, checkTermination, composeExportBundle, computeNodeContentHash, computeUpgradeStatus, createAgentRepo, createAuthAccountRepo, createAuthSessionRepo, createAuthTokenRepo, createDagTemplateRepo, createEnumRegistryRepo, createIssueRepo, createModelAliasRepo, createMongoClient, createNodeLibraryRepo, createNodePresetRepo, createProjectRepo, createReferencesSchema, createRepo, createSkillRepo, createTaskRepo, decisionKey, derivePreTerminalState, diffTemplateContent, enabledNeFalse, escapeRegExpLiteral, excerpt, findDuplicateNodeIds, findNextEdge, findTemplateByName, generateEntryId, generateProjectKey, generateSessionId, generateToken, hasProjectDefault, hashPassword, hashToken, isLegalTemplateCode, mkHistory, normalizeNameToTemplateCode, parseAuthEnabledEnvValue, pauseTask, ping, pruneInstance, renderPrompt, reopenTask, resumeTask, sumReferenceContentChars, taskProgress, toNodeInfo, toTaskPublic, tokenTypeFromValue, trackMatchSet, verifyPassword, withTransaction };
+export { AGENT_MAIN_DOC, ARTIFACT_TYPES, AUTH_COLLECTIONS, type AdvanceDeps, type AdvanceInput, type AdvanceRequest, AdvanceRequestSchema, type AdvanceResponse, AdvanceResponseSchema, type Agent, type AgentCopy, AgentCopySchema, type AgentCreate, AgentCreateSchema, type AgentFunction, AgentFunctionSchema, type AgentPayload, AgentPayloadSchema, type AgentRepo, AgentSchema, type AgentScope, AgentScopeSchema, AgentShapeSchema, type AgentUpdate, AgentUpdateSchema, type AiCheck, AiCheckSchema, AppError, type AppErrorOptions, type ApproveRequest, ApproveRequestSchema, type ApproveResponse, ApproveResponseSchema, type ArchNote, ArchNoteSchema, type Artifact, ArtifactSchema, type ArtifactType, type AssetListOpts, type AssetSetEnabled, AssetSetEnabledSchema, type AuthAccount, type AuthAccountCreate, AuthAccountCreateSchema, AuthAccountSchema, type AuthSession, type AuthStatus, AuthStatusSchema, type AuthToken, type AuthTokenGenResponse, AuthTokenGenResponseSchema, type AuthTokenKind, AuthTokenSchema, type AuthTokenStatus, AuthTokenStatusSchema, type AuthTokenType, AuthTokenTypeSchema, type AuthWhoami, AuthWhoamiSchema, BIZ_CODE_MESSAGES, BadRequestError, type BizCode, CONTEXT_VIEWS, type CancelRequest, CancelRequestSchema, type CheckItem, CheckItemSchema, type Composition, type CompositionEdge, CompositionEdgeSchema, CompositionSchema, type Confirmation, ConfirmationSchema, ConflictError, type ContextView, ContextViewSchema, type ConvertGroupOutcome, type CreateTaskResponse, CreateTaskResponseSchema, DAG_PHASES, DAG_TRACKS, DEFAULT_PROJECT_KEY, DEFAULT_VCS_DOC_PATHS, type DagEdge, DagEdgeSchema, type DagInstance, type DagInstanceNode, DagInstanceNodeSchema, DagInstanceSchema, type DagNode, DagNodePhaseSchema, DagNodeSchema, DagNodeTrackSchema, type DagTemplate, type DagTemplateCopy, DagTemplateCopySchema, type DagTemplateCreate, DagTemplateCreateSchema, type DagTemplateRepo, DagTemplateSchema, type DagTemplateUpdate, DagTemplateUpdateSchema, type Decision, DecisionSchema, type DependencyAction, DependencyActionSchema, type DependencyCheck, DependencyCheckSchema, type DependencyStatus, DependencyStatusSchema, ENTRY_ID_REGEX, EXPORT_FORMAT_VERSION, type EchoItem, EchoItemSchema, type EdgePausePoint, EdgePausePointBaseSchema, EdgePausePointSchema, type EnumEntry, EnumEntrySchema, type EnumRegistry, type EnumRegistryCategory, EnumRegistryCategorySchema, type EnumRegistryRepo, EnumRegistrySchema, type EnumRegistryUpdate, EnumRegistryUpdateSchema, type ExportBundle, ExportBundleSchema, ForbiddenError, HistoryActionSchema, type HistoryEntry, HistoryEntrySchema, ISSUE_ACTIVE_STATUSES, ISSUE_CONVERT_MODES, ISSUE_SOURCES, ISSUE_STATUSES, type ImportApplyRequest, ImportApplyRequestSchema, type ImportApplyResponse, ImportApplyResponseSchema, type ImportDecision, ImportDecisionSchema, type ImportPlanRequest, ImportPlanRequestSchema, type ImportPlanResponse, ImportPlanResponseSchema, type Issue, type IssueConvertMode, IssueConvertModeSchema, type IssueCreate, IssueCreateSchema, type IssueHistoryEntry, IssueHistoryEntrySchema, type IssueListFilter, type IssueProgress, IssueProgressSchema, type IssueRepo, IssueSchema, type IssueSource, IssueSourceSchema, type IssueStatus, type IssueStatusChange, IssueStatusSchema, type IssueTaskSnapshot, type IssueUpdate, IssueUpdateSchema, type IssueWithProgress, type LoginInput, LoginSchema, type ModelAlias, type ModelAliasCreate, ModelAliasCreateSchema, type ModelAliasPayload, ModelAliasPayloadSchema, type ModelAliasRepo, ModelAliasSchema, ModelAliasShapeSchema, type ModelAliasUpdate, ModelAliasUpdateSchema, type ModelAliasWithRefCount, ModelAliasWithRefCountSchema, NODE_CHECKS_MAX, NODE_ID_PATTERN, NODE_PRESET_CODE_PATTERN, NODE_STATUSES, type NodeContentFields, type NodeInfo, NodeInfoSchema, type NodeLibrary, type NodeLibraryRepo, NodeLibrarySchema, type NodeLibraryUpsert, NodeLibraryUpsertSchema, type NodePreset, type NodePresetCopy, NodePresetCopySchema, type NodePresetCreate, NodePresetCreateSchema, type NodePresetListFilter, type NodePresetRepo, NodePresetSchema, NodePresetShapeSchema, type NodePresetUpdate, NodePresetUpdateSchema, type NodeRecord, NodeRecordSchema, type NodeState, NodeStateSchema, NodeStatusSchema, NotFoundError, OBJECT_ID_HEX, type OmitId, PAUSE_POINT_TYPES, type PasswordChange, PasswordChangeSchema, PausePointTypeSchema, type PauseRequest, PauseRequestSchema, type Project, type ProjectCreate, ProjectCreateSchema, type ProjectRepo, ProjectSchema, type ProjectStatus, ProjectStatusSchema, type ProjectUpdate, ProjectUpdateSchema, type PruneResult, type PrunedGraph, REFERENCE_LIMITS, type ReferenceDoc, type ReopenInput, type ReopenRequest, ReopenRequestSchema, type ReopenResponse, type Repo, type ResumeRequest, ResumeRequestSchema, type ReviewSummary, ReviewSummarySchema, SIMING_CODE_REGEX, SIMING_CONFIG_ENV_KEYS, SIMING_CONFIG_KEYS, SKILL_MAIN_DOC, type SameTrackForkIssue, type SimingClient, type SimingConfig, type SimingConfigKey, SimingConfigSchema, SimingLogLevelSchema, type Skill, type SkillCopy, SkillCopySchema, type SkillCreate, SkillCreateSchema, type SkillPayload, SkillPayloadSchema, type SkillRepo, SkillSchema, type SkillScope, SkillScopeSchema, SkillShapeSchema, type SkillUpdate, SkillUpdateSchema, type SourcePreset, SourcePresetSchema, TASK_PHASES, TASK_STATUSES, TASK_TYPES, TEMPLATE_CODE_MAX_LENGTH, TEMPLATE_CODE_REGEX, TEMPLATE_STRUCTURE_CONSTRAINTS, type Task, type TaskBatchAck, TaskBatchAckSchema, type TaskBatchEntry, TaskBatchEntrySchema, type TaskBatchFailure, TaskBatchFailureSchema, type TaskContext, TaskContextSchema, type TaskCreateInput, TaskCreateInputSchema, type TaskDocContent, TaskDocContentSchema, type TaskIssueView, type TaskLink, TaskLinkSchema, type TaskPatch, TaskPhaseSchema, type TaskProgress, type TaskProgressPublic, TaskProgressPublicSchema, TaskProgressSchema, type TaskPublic, TaskPublicSchema, type TaskRepo, TaskSchema, TaskStatusSchema, type TaskSummary, TaskSummarySchema, type TaskType, type TemplateCandidate, TemplateCandidateSchema, TemplateCodeFieldSchema, type TemplateContentChanges, type TemplateContentDiff, type TemplateContentSource, type TemplatePayload, TemplatePayloadSchema, type TemplateStructureConstraint, type TemplateTransferDeps, type TestReport, TestReportSchema, type ToolCheck, ToolCheckSchema, type TrackChainResult, UnauthorizedError, type UpgradeAction, UpgradeActionSchema, type UpgradeApplyOutcome, type UpgradeApplyRequest, UpgradeApplyRequestSchema, type UpgradeApplyResultItem, type UpgradeDecision, type UpgradeDecisionInput, UpgradeDecisionSchema, type UpgradeNodeStatus, UpgradeNodeStatusSchema, type UpgradePlanItem, type UpgradePlanResult, VERSION, ValidationError, type VcsConfig, VcsConfigSchema, WRITE_ACK_ENTRY_KINDS, type WithId, type WriteAck, type WriteAckEntryKind, WriteAckEntryKindSchema, WriteAckSchema, advanceTask, applyImport, applyUpgradeDecisions, approveTask, assertBoundSkillsCompatible, assertModelAliasExists, assertNoSameTrackFork, assertReferenceAggregateLimit, assertReferencesDeletable, assertUniqueAiCheckIds, assertUniqueNodeIds, buildImportPlan, buildPrunedGraph, buildTemplateCode, buildUpgradePlan, bumpPatch, bumpPatchOrPassthrough, cancelTask, canonicalizeReferencePath, checkTermination, composeExportBundle, computeNodeContentHash, computeUpgradeStatus, createAgentRepo, createAuthAccountRepo, createAuthSessionRepo, createAuthTokenRepo, createDagTemplateRepo, createEnumRegistryRepo, createIssueRepo, createModelAliasRepo, createMongoClient, createNodeLibraryRepo, createNodePresetRepo, createProjectRepo, createReferencesSchema, createRepo, createSkillRepo, createTaskRepo, decisionKey, derivePreTerminalState, diffTemplateContent, effectiveTracks, enabledNeFalse, escapeRegExpLiteral, excerpt, findDuplicateNodeIds, findNextEdge, findSameTrackForks, findTemplateByName, generateEntryId, generateProjectKey, generateSessionId, generateToken, hasProjectDefault, hashPassword, hashToken, isLegalTemplateCode, matchSetOf, mkHistory, normalizeNameToTemplateCode, parseAuthEnabledEnvValue, pauseTask, ping, pruneInstance, renderPrompt, reopenTask, resumeTask, simulateTrackChains, sumReferenceContentChars, taskProgress, toNodeInfo, toTaskPublic, tokenTypeFromValue, trackIntersects, verifyPassword, withTransaction };

package/dist/index.js

@@ -136,6 +136,7 @@ var BIZ_CODE_MESSAGES = {
   TASK_PRUNE_GRAPH_INVALID: "\u526A\u679D\u540E DAG \u56FE\u4E0D\u5B8C\u6574\uFF08\u8282\u70B9\u6E05\u5355\u4E0E\u6A21\u677F\u7ED3\u6784\u4E0D\u517C\u5BB9\uFF0C\u89C1\u9519\u8BEF\u8BE6\u60C5\uFF09",
   TASK_SKIP_NODE_NOT_FOUND: "skip \u6E05\u5355\u542B\u6A21\u677F\u4E0D\u5B58\u5728\u7684\u8282\u70B9 id\uFF08\u89C1\u9519\u8BEF\u8BE6\u60C5\u7684\u5408\u6CD5\u8282\u70B9\u6E05\u5355\uFF09",
   TASK_TYPE_TRACK_MISMATCH: "\u4EFB\u52A1\u7C7B\u578B\u4E0E\u8F68\u9053\u7EC4\u5408\u975E\u6CD5\uFF08research \u8F68\u9053\u4E3A\u8C03\u7814\u7C7B\u578B\u4E13\u7528\u503C\uFF1BUI \u5FAE\u8C03\u4EC5\u9002\u7528 ui \u8F68\u9053\uFF09",
+  TASK_TRACK_MATCH_MISSING: "\u4EFB\u52A1\u7F3A\u5C11\u8F68\u9053\u5339\u914D\u5FEB\u7167\uFF08trackMatch\uFF09\u2014\u2014\u5B58\u91CF\u4EFB\u52A1\u8BF7\u91CD\u8DD1 server \u542F\u52A8\u8FC1\u79FB\uFF08ensureCollections\uFF09",
   // T202608290001：停用模板创建任务守卫（资产启停——停用对创建通道同样不可见）
   TEMPLATE_DISABLED: "\u6A21\u677F\u5DF2\u505C\u7528\uFF0C\u7981\u6B62\u7528\u4E8E\u521B\u5EFA\u4EFB\u52A1\uFF08Web \u7BA1\u7406\u53F0\u53EF\u91CD\u65B0\u542F\u7528\uFF09",
   // T202608310001：鉴权域（错误响应以 error: bizCode 为机器可判键）
@@ -153,6 +154,8 @@ var BIZ_CODE_MESSAGES = {
   NODE_PRESET_CODE_IMMUTABLE: "\u8282\u70B9 code \u521B\u5EFA\u540E\u4E0D\u53EF\u53D8",
   NODE_PRESET_VERSION_REQUIRED: "\u8282\u70B9\u5185\u5BB9\u53D8\u66F4\u5FC5\u987B\u540C\u6B65\u63D0\u5347\u7248\u672C\u53F7\uFF08version \u5B57\u6BB5\uFF09",
   TEMPLATE_NODE_ID_DUPLICATE: "\u6A21\u677F\u5185\u8282\u70B9 id \u91CD\u590D\uFF08\u5148\u5728\u8282\u70B9\u5E93\u4E2D\u590D\u5236\u6539\u540D\u6216\u8C03\u6574\u6A21\u677F\u8282\u70B9\u6807\u8BC6\uFF09",
+  // T202610120004：模板同轨分叉（D6）——写入侧统一文案（含修复指引；详情 issues 由断言函数附加）
+  TEMPLATE_SAME_TRACK_FORK: "\u6A21\u677F\u5B58\u5728\u540C\u8F68\u5206\u53C9\uFF08\u540C\u4E00\u8282\u70B9\u5BF9\u540C\u4E00\u76EE\u6807\u8F68\u9053\u6709\u591A\u6761\u51FA\u8FB9\uFF09\u2014\u2014\u540C\u8F68\u51FA\u8FB9\u4EC5\u5141\u8BB8\u4E00\u6761\uFF1B\u8DF3\u8FC7\u53EF\u9009\u8282\u70B9\u7531\u526A\u679D\u6865\u63A5\u673A\u5236\u81EA\u52A8\u8865\u8FB9\uFF0C\u52FF\u624B\u5DE5\u6DFB\u52A0\u65C1\u8DEF\u76F4\u8FB9",
   NODE_LIBRARY_COMPOSITION_NOT_FOUND: "\u7EC4\u5408\u5B9A\u4E49\u4E0D\u5B58\u5728\uFF08\u591A\u5E93\u540C\u540D\u7EC4\u5408\u9700\u663E\u5F0F\u6307\u5B9A\u6765\u6E90\u5E93\uFF09",
   UPGRADE_DECISION_REQUIRED: "\u672C\u5730\u5DF2\u4FEE\u6539\u7684\u8282\u70B9\u5FC5\u987B\u663E\u5F0F\u51B3\u7B56\uFF08upgrade/keep/skip\uFF09",
   UPGRADE_STALE: "\u6A21\u677F\u72B6\u6001\u4E0E\u5347\u7EA7\u8BA1\u5212\u4E0D\u7B26\uFF08\u8BA1\u5212\u540E\u6A21\u677F\u5DF2\u88AB\u7F16\u8F91\uFF09\uFF0C\u8BF7\u91CD\u65B0\u83B7\u53D6\u5347\u7EA7\u8BA1\u5212",
@@ -712,7 +715,10 @@ var SkillCopySchema = z2.object({
 
 // src/schemas/dag-template.ts
 var DagNodePhaseSchema = z3.string();
-var DagNodeTrackSchema = z3.string();
+var DagNodeTrackSchema = z3.union([
+  z3.string(),
+  z3.array(z3.string()).min(1, "\u8282\u70B9\u8F68\u9053\u6570\u7EC4\u4E0D\u53EF\u4E3A\u7A7A\uFF08\u591A\u8F68\u8282\u70B9\u81F3\u5C11\u58F0\u660E\u4E00\u6761\u8F68\u9053\uFF09")
+]);
 var DAG_PHASES = ["entry", "track", "test", "exit"];
 var DAG_TRACKS = ["backend", "ui", "all"];
 var NODE_ID_PATTERN = /^[A-Za-z0-9_-]+$/;
@@ -868,6 +874,48 @@ function assertUniqueNodeIds(nodes) {
     );
   }
 }
+function findSameTrackForks(nodes, edges) {
+  const trackKeyOf = (track) => {
+    const members = typeof track === "string" ? [track] : track;
+    return members.includes("all") ? "all" : [...new Set(members)].sort().join("+");
+  };
+  const trackById = new Map(nodes.map((n) => [n.id, trackKeyOf(n.track)]));
+  const groupsBySource = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    const targetTrack = trackById.get(edge.to);
+    if (targetTrack === void 0) continue;
+    let groups = groupsBySource.get(edge.from);
+    if (groups === void 0) {
+      groups = /* @__PURE__ */ new Map();
+      groupsBySource.set(edge.from, groups);
+    }
+    groups.set(targetTrack, (groups.get(targetTrack) ?? 0) + 1);
+  }
+  const issues = [];
+  for (const [nodeId, groups] of groupsBySource) {
+    for (const [targetTrack, count] of groups) {
+      if (count > 1) issues.push({ nodeId, targetTrack, count });
+    }
+  }
+  return issues;
+}
+function assertNoSameTrackFork(nodes, edges) {
+  const issues = findSameTrackForks(nodes, edges);
+  if (issues.length > 0) {
+    const detail = issues.map((issue) => `\u8282\u70B9 ${issue.nodeId} \u6709 ${String(issue.count)} \u6761\u6307\u5411 ${issue.targetTrack} \u8F68\u8282\u70B9\u7684\u51FA\u8FB9`).join("\uFF1B");
+    throw new ValidationError(
+      `\u6A21\u677F\u5B58\u5728\u540C\u8F68\u5206\u53C9\uFF08D6\uFF09\uFF1A${detail}`,
+      issues.map((issue) => ({
+        path: ["edges"],
+        message: `\u8282\u70B9 ${issue.nodeId} \u5728 ${issue.targetTrack} \u8F68\u6709 ${String(issue.count)} \u6761\u51FA\u8FB9\uFF08\u540C\u8F68\u5206\u53C9\uFF09\u2014\u2014\u540C\u8F68\u51FA\u8FB9\u4EC5\u5141\u8BB8\u4E00\u6761\uFF1B\u8DF3\u8FC7\u53EF\u9009\u8282\u70B9\u7531\u526A\u679D\u6865\u63A5\u673A\u5236\u81EA\u52A8\u8865\u8FB9\uFF0C\u52FF\u624B\u5DE5\u6DFB\u52A0\u65C1\u8DEF\u76F4\u8FB9`
+      })),
+      {
+        bizCode: "TEMPLATE_SAME_TRACK_FORK",
+        message: `${BIZ_CODE_MESSAGES.TEMPLATE_SAME_TRACK_FORK}\uFF08${detail}\uFF09`
+      }
+    );
+  }
+}
 
 // src/store/repos/dag-template.repo.ts
 function normalizeNameToTemplateCode(name) {
@@ -1141,7 +1189,8 @@ var DagInstanceNodeSchema = z4.object({
   label: z4.string(),
   // N016 F9：枚举放宽（注册表权威）
   phase: z4.string(),
-  track: z4.string(),
+  // T202610120005 R7：节点轨道 union（多轨节点）——实例值拷贝冻结原样形态，模板升版不回溯
+  track: DagNodeTrackSchema,
   prompt: z4.string(),
   skills: z4.array(z4.string()).default([]),
   agents: z4.array(z4.string()).default([]),
@@ -1192,7 +1241,18 @@ var TaskSchema = z4.object({
   status: TaskStatusSchema,
   /** 暂停位置：from 节点 id（暂停点暂停，approve 经 findNextEdge 重推导边）/ null（手动暂停） */
   pausedAt: z4.string().nullable().default(null),
+  /**
+   * 轨道展示锚（存量展示与 ?track= 精确过滤用）：单轨任务=原值、组合任务=成员
+   * join('+') 规范串、all 通配任务='all'（注册表 label 查找键）。
+   */
   track: z4.string(),
+  /**
+   * T202610120005：任务轨道成员快照（创建时解析冻结，不含 'all' 哨兵）——运行时
+   * 路由/剪枝/终态判定的唯一数据源（matchSetOf 单源构造匹配集，不回查注册表：
+   * 词表升版/停用不影响在途任务）。optional 兼容迁移前存量窗口，缺失时引擎
+   * fail-loud（TASK_TRACK_MATCH_MISSING）。
+   */
+  trackMatch: z4.array(z4.string()).optional(),
   /**
    * N020 D1：任务级结构化文档（未写时字段缺省——语义即「未写」，不做 null 占位）。
    * 写入口：PATCH /api/tasks/:id/doc（字段级 $set + acceptance/nonGoals 条目 $push）。
@@ -1212,7 +1272,13 @@ var TaskSchema = z4.object({
 });
 var TaskCreateInputSchema = z4.object({
   title: z4.string(),
-  track: z4.string(),
+  /**
+   * T202610120005：任务轨道 union——字符串（单轨/旧调用兼容）或非空字符串数组
+   * （组合/多选表单产物；['all'] 单元素数组视同字符串 'all' 通配形态）。
+   * 归一化（去重保序/all 展开/值域与类型绑定校验）在 server 入口三段 helper
+   * 完成（track-input.ts），repo 收已归一化 { trackMembers, trackAnchor }。
+   */
+  track: z4.union([z4.string().min(1), z4.array(z4.string().min(1)).min(1)]),
   /**
    * T202609020002：模板引用支持 code|id 双形态——24-hex 直查数据库 id 命中即用
    * （hex 未命中不转 code 检索：code 必含连字符，与 hex 形态天然互斥）；非 hex 在
@@ -1233,9 +1299,30 @@ var TaskCreateInputSchema = z4.object({
 });
 
 // src/task/track-match.ts
-function trackMatchSet(taskTrack) {
-  if (taskTrack === "mixed") return /* @__PURE__ */ new Set(["backend", "ui", "all"]);
-  return /* @__PURE__ */ new Set([taskTrack, "all"]);
+function matchSetOf(members) {
+  if (!members || members.length === 0) {
+    throw new BadRequestError(
+      "task trackMatch snapshot is empty \u2014 task missing track members (run ensureCollections migration or recreate task)",
+      void 0,
+      {
+        bizCode: "TASK_TRACK_MATCH_MISSING",
+        message: "\u4EFB\u52A1\u7F3A\u5C11\u8F68\u9053\u5339\u914D\u5FEB\u7167\uFF08trackMatch\uFF09\u2014\u2014\u7591\u4F3C\u5B58\u91CF\u4EFB\u52A1\u672A\u8FC1\u79FB\uFF0C\u91CD\u8DD1 server \u542F\u52A8\u8FC1\u79FB\uFF08ensureCollections\uFF09\u540E\u91CD\u8BD5"
+      }
+    );
+  }
+  return /* @__PURE__ */ new Set([...members, "all"]);
+}
+function effectiveTracks(nodeTrack, matchSet) {
+  const members = typeof nodeTrack === "string" ? [nodeTrack] : nodeTrack;
+  const result = /* @__PURE__ */ new Set();
+  for (const member of members) {
+    if (member === "all") return /* @__PURE__ */ new Set(["all"]);
+    if (matchSet.has(member)) result.add(member);
+  }
+  return result;
+}
+function trackIntersects(nodeTrack, matchSet) {
+  return effectiveTracks(nodeTrack, matchSet).size > 0;
 }
 
 // src/task/prompt-renderer.ts
@@ -1280,10 +1367,10 @@ async function advanceTask(deps, taskId, input) {
     task.dagInstance.edges,
     task.dagInstance.nodes,
     currentNode.id,
-    task.track
+    matchSetOf(task.trackMatch)
   );
   if (!nextEdge) {
-    if (checkTermination(task.dagInstance.nodes, task.dagInstance.edges, task.dagInstance.nodeStates, completedState, currentNode.id, task.track)) {
+    if (checkTermination(task.dagInstance.nodes, task.dagInstance.edges, task.dagInstance.nodeStates, completedState, currentNode.id, matchSetOf(task.trackMatch))) {
       if (!input?.finalize) {
         throw new BadRequestError(
           `Task is at its final node ('${currentNode.id}'). Confirm all outputs are complete, then advance with finalize=true to complete the task.`,
@@ -1404,7 +1491,7 @@ async function approveTask(deps, taskId, request) {
     task.dagInstance.edges,
     task.dagInstance.nodes,
     pausedNodeId,
-    task.track
+    matchSetOf(task.trackMatch)
   );
   if (!nextEdge) {
     throw new Error(
@@ -1618,41 +1705,43 @@ function derivePreTerminalState(history) {
   }
   throw new Error("invariant violation: no pre-terminal state anchor found before cancelled entry");
 }
-function findNextEdge(edges, nodes, fromNodeId, track) {
+function findNextEdge(edges, nodes, fromNodeId, matchSet) {
   const outEdges = edges.filter((e) => e.from === fromNodeId);
-  const matchSet = trackMatchSet(track);
+  const effectiveKeyOf = (track) => {
+    const effective = effectiveTracks(track, matchSet);
+    return effective.size === 0 ? "" : [...effective].sort().join("+");
+  };
   const matching = outEdges.filter((e) => {
     const target = nodes.find((n) => n.id === e.to);
     if (!target) return false;
-    return matchSet.has(target.track);
+    return trackIntersects(target.track, matchSet);
   });
   if (matching.length > 1) {
     const byTargetTrack = /* @__PURE__ */ new Map();
     for (const edge of matching) {
       const target = nodes.find((n) => n.id === edge.to);
-      const key = target?.track ?? "";
+      const key = target ? effectiveKeyOf(target.track) : "";
       const group = byTargetTrack.get(key) ?? [];
       group.push(edge);
       byTargetTrack.set(key, group);
     }
-    for (const [targetTrack, group] of byTargetTrack) {
+    for (const [targetTrackKey, group] of byTargetTrack) {
       if (group.length > 1) {
         throw new BadRequestError(
-          `Multiple matching edges from node "${fromNodeId}" for track "${track}" \u2014 DAG template has a same-track fork (target track "${targetTrack}")`
+          `Multiple matching edges from node "${fromNodeId}" (effective tracks "${targetTrackKey}") \u2014 DAG template has a same-track fork`
         );
       }
     }
     const dedicated = matching.filter((e) => {
       const target = nodes.find((n) => n.id === e.to);
-      return target?.track !== "all";
+      return target ? effectiveKeyOf(target.track) !== "all" : false;
     });
     return dedicated[0] ?? matching[0];
   }
   return matching[0] ?? null;
 }
-function checkTermination(nodes, edges, nodeStates, upcomingCompletedState, upcomingCompletedNodeId, track) {
-  const matchSet = trackMatchSet(track);
-  const trackFilter = (n) => matchSet.has(n.track);
+function checkTermination(nodes, edges, nodeStates, upcomingCompletedState, upcomingCompletedNodeId, matchSet) {
+  const trackFilter = (n) => trackIntersects(n.track, matchSet);
   const terminalNodes = nodes.filter(
     (n) => trackFilter(n) && !edges.some((e) => e.from === n.id)
   );
@@ -1676,7 +1765,10 @@ function toTaskPublic(task) {
     currentPhase: task.currentPhase,
     status: task.status,
     pausedAt: task.pausedAt,
-    track: task.track
+    track: task.track,
+    // T202610120005：组合任务匹配快照进公共投影（context/advance/approve 写回执出口——
+    // web 展示拼接与 ?track= 过滤的数据承载）
+    ...task.trackMatch !== void 0 ? { trackMatch: task.trackMatch } : {}
   };
 }
 function toNodeInfo(node, task) {
@@ -1684,7 +1776,7 @@ function toNodeInfo(node, task) {
     task.dagInstance.edges,
     task.dagInstance.nodes,
     node.id,
-    task.track
+    matchSetOf(task.trackMatch)
   );
   return {
     nodeId: node.id,
@@ -1722,12 +1814,10 @@ function graphInvalid(reason) {
     { bizCode: "TASK_PRUNE_GRAPH_INVALID", message: `\u526A\u679D\u540E DAG \u56FE\u4E0D\u5B8C\u6574\uFF08${reason}\uFF09\u2014\u2014\u68C0\u67E5 skip \u6E05\u5355\u4E0E\u6A21\u677F\u7ED3\u6784\u517C\u5BB9\u6027` }
   );
 }
-function pruneInstance(template, taskTrack, skipNodeIds) {
-  if (skipNodeIds.length > 0) assertSkipNodesExist(template, skipNodeIds);
+function buildPrunedGraph(template, trackMembers, skipNodeIds = []) {
   const skipSet = new Set(skipNodeIds);
-  const matchSet = trackMatchSet(taskTrack);
-  const keptNodes = template.nodes.filter((n) => !skipSet.has(n.id) && matchSet.has(n.track));
-  const prunedNodes = template.nodes.filter((n) => skipSet.has(n.id) || !matchSet.has(n.track)).map((n) => n.id);
+  const matchSet = matchSetOf(trackMembers);
+  const keptNodes = template.nodes.filter((n) => !skipSet.has(n.id) && trackIntersects(n.track, matchSet));
   const keptIds = new Set(keptNodes.map((n) => n.id));
   const keptEdges = template.edges.filter((e) => keptIds.has(e.from) && keptIds.has(e.to));
   const edges = keptEdges.map((e) => ({ ...e }));
@@ -1741,7 +1831,7 @@ function pruneInstance(template, taskTrack, skipNodeIds) {
     if (templateTerminalIds.has(node.id)) continue;
     const nearestActive = findNearestActiveDescendant(template, node.id, keptIds);
     if (!nearestActive) {
-      graphInvalid(`\u8282\u70B9\u300C${node.id}\u300D\u526A\u679D\u540E\u51FA\u5EA6\u4E3A 0 \u4E14\u6CBF\u6A21\u677F\u540E\u4EE3\u65E0\u6FC0\u6D3B\u8282\u70B9\uFF08\u8DEF\u5F84\u65AD\u88C2\uFF09`);
+      return { ok: false, reason: `\u8282\u70B9\u300C${node.id}\u300D\u526A\u679D\u540E\u51FA\u5EA6\u4E3A 0 \u4E14\u6CBF\u6A21\u677F\u540E\u4EE3\u65E0\u6FC0\u6D3B\u8282\u70B9\uFF08\u8DEF\u5F84\u65AD\u88C2\uFF09` };
     }
     const firstTemplateOutEdge = template.edges.find((e) => e.from === node.id);
     edges.push({
@@ -1750,6 +1840,17 @@ function pruneInstance(template, taskTrack, skipNodeIds) {
       ...firstTemplateOutEdge?.pausePoint ? { pausePoint: { ...firstTemplateOutEdge.pausePoint } } : {}
     });
   }
+  return { ok: true, graph: { nodes: keptNodes, edges } };
+}
+function pruneInstance(template, trackMembers, skipNodeIds) {
+  if (skipNodeIds.length > 0) assertSkipNodesExist(template, skipNodeIds);
+  const skipSetForPruned = new Set(skipNodeIds);
+  const matchSetForPruned = matchSetOf(trackMembers);
+  const prunedNodes = template.nodes.filter((n) => skipSetForPruned.has(n.id) || !trackIntersects(n.track, matchSetForPruned)).map((n) => n.id);
+  const core = buildPrunedGraph(template, trackMembers, skipNodeIds);
+  if (!core.ok) graphInvalid(core.reason);
+  const keptNodes = core.graph.nodes;
+  const edges = core.graph.edges;
   if (keptNodes.length < 2) {
     graphInvalid(`\u526A\u540E\u4EC5\u5269 ${keptNodes.length} \u4E2A\u8282\u70B9\uFF08\u987B \u2265 2\uFF09\u2014\u2014skip \u6E05\u5355/\u8F68\u9053\u5254\u9664\u8FC7\u91CD`);
   }
@@ -1799,7 +1900,7 @@ function pruneInstance(template, taskTrack, skipNodeIds) {
     }
     let nextEdge;
     try {
-      nextEdge = findNextEdge(edges, keptNodes, cursor, taskTrack);
+      nextEdge = findNextEdge(edges, keptNodes, cursor, matchSetOf(trackMembers));
     } catch (err) {
       const reason = err instanceof BadRequestError ? err.message : String(err);
       graphInvalid(`\u5F15\u64CE\u8DEF\u7531\u65E0\u6CD5\u6D88\u6B67\uFF08${reason}\uFF09`);
@@ -1811,7 +1912,7 @@ function pruneInstance(template, taskTrack, skipNodeIds) {
   const unreachableByEngine = keptNodes.filter((n) => !visitedByEngine.has(n.id));
   if (unreachableByEngine.length > 0) {
     graphInvalid(
-      `\u6FC0\u6D3B\u8282\u70B9\u4E0D\u5728\u5F15\u64CE\u8DEF\u5F84\u4E0A\uFF08\u5C06\u6C38\u4E45 pending\uFF0C\u68C0\u67E5\u7C7B\u578B\xD7\u8F68\u9053\u4E0E\u6A21\u677F\u7ED3\u6784\u5339\u914D\u2014\u2014\u5982 mixed \u9700\u6A21\u677F\u542B\u94FE\u95F4\u4E32\u884C\u6865\u8FB9\u3001research \u9700 skip \u6389\u4E0D\u88AB\u884C\u8D70\u7684\u5206\u652F\uFF09\uFF1A${unreachableByEngine.map((n) => n.id).join(", ")}`
+      `\u6FC0\u6D3B\u8282\u70B9\u4E0D\u5728\u5F15\u64CE\u8DEF\u5F84\u4E0A\uFF08\u5C06\u6C38\u4E45 pending\uFF0C\u68C0\u67E5\u7C7B\u578B\xD7\u8F68\u9053\u4E0E\u6A21\u677F\u7ED3\u6784\u5339\u914D\u2014\u2014\u5982\u7EC4\u5408\u4EFB\u52A1\u9700\u6A21\u677F\u542B\u94FE\u95F4\u4E32\u884C\u6865\u8FB9\u3001research \u9700 skip \u6389\u4E0D\u88AB\u884C\u8D70\u7684\u5206\u652F\uFF09\uFF1A${unreachableByEngine.map((n) => n.id).join(", ")}`
     );
   }
   return { nodes: keptNodes, edges, prunedNodes, entryNode: entry };
@@ -1933,6 +2034,8 @@ function createTaskRepo(db) {
             status: task.status,
             pausedAt: task.pausedAt,
             track: task.track,
+            // T202610120005：组合任务展示数据承载（web 列表拼接文案依赖；迁移前存量缺省）
+            ...task.trackMatch !== void 0 ? { trackMatch: task.trackMatch } : {},
             progress: { completed: doc.completedCount, total: doc.totalCount },
             ...task.createdAt ? { createdAt: task.createdAt } : {},
             ...task.updatedAt ? { updatedAt: task.updatedAt } : {}
@@ -1996,11 +2099,11 @@ function createTaskRepo(db) {
       }
       return toEntity(result);
     },
-    async createTask(input, template, resolvedProjectId, session) {
-      if (!input.track) {
+    async createTask(input, template, resolvedProjectId, trackInfo, session) {
+      if (trackInfo.trackMembers.length === 0 || !trackInfo.trackAnchor) {
         throw new BadRequestError(`track is required`);
       }
-      const pruned = pruneInstance(template, input.track, input.skipNodes ?? []);
+      const pruned = pruneInstance(template, trackInfo.trackMembers, input.skipNodes ?? []);
       const firstNode = pruned.entryNode;
       const dagInstance = {
         templateId: template.id ?? "",
@@ -2040,7 +2143,10 @@ function createTaskRepo(db) {
         currentPhase: firstNode.phase,
         status: "active",
         pausedAt: null,
-        track: input.track,
+        // T202610120005：track=展示锚（单轨原值/组合 join('+') 规范串/all 通配锚），
+        // trackMatch=成员快照（运行时路由/剪枝/终态判定的唯一数据源，创建时冻结）
+        track: trackInfo.trackAnchor,
+        trackMatch: trackInfo.trackMembers,
         nodeRecords: {},
         archNotes: [],
         history: [{
@@ -3293,6 +3399,17 @@ var ImportPlanResponseSchema = z9.object({
       status: z9.enum(["ok", "missing"])
     })
   ),
+  /**
+   * K10③：模板节点直接 AGENT 引用完整性逐项核对（node × agent 粒度）——
+   * 与 directSkillChecks 对称；ok = 在 bundle 依赖 ∪ 目标环境可见集；missing = 双侧皆无（引用悬空，non-blocking warning）
+   */
+  directAgentChecks: z9.array(
+    z9.object({
+      node: z9.string(),
+      agent: z9.string(),
+      status: z9.enum(["ok", "missing"])
+    })
+  ),
   /** 非阻断提示（源环境悬空绑定、agent.model 引用缺失、sourcePreset 来源缺失等） */
   warnings: z9.array(z9.string())
 });
@@ -3349,12 +3466,15 @@ var TaskPublicSchema = z10.object({
   currentPhase: z10.string(),
   status: z10.string(),
   pausedAt: z10.string().nullable(),
-  track: z10.string()
+  track: z10.string(),
+  /** T202610120005：组合任务匹配快照（toTaskPublic 投影；迁移前存量缺省） */
+  trackMatch: z10.array(z10.string()).optional()
 });
 var NodeInfoSchema = z10.object({
   nodeId: z10.string(),
   label: z10.string(),
-  track: z10.string(),
+  // T202610120005 R7：节点轨道 union（多轨节点——值拷贝冻结原样形态）
+  track: z10.union([z10.string(), z10.array(z10.string())]),
   prompt: z10.string(),
   skills: z10.array(z10.string()),
   agents: z10.array(z10.string()),
@@ -3428,13 +3548,16 @@ var TaskContextSchema = z11.object({
     currentPhase: z11.string(),
     status: z11.string(),
     pausedAt: z11.string().nullable(),
-    track: z11.string()
+    track: z11.string(),
+    // T202610120005：组合任务匹配快照（与 TaskPublicSchema 同步——context 读取出口）
+    trackMatch: z11.array(z11.string()).optional()
   }),
   currentNode: z11.object({
     nodeId: z11.string(),
     label: z11.string(),
     phase: z11.string(),
-    track: z11.string(),
+    // T202610120005 R7：节点轨道 union（多轨节点）
+    track: z11.union([z11.string(), z11.array(z11.string())]),
     /** renderPrompt 渲染后（AI 推进任务的直接输入） */
     prompt: z11.string(),
     skills: z11.array(z11.string()),
@@ -3486,6 +3609,8 @@ var TaskSummarySchema = z11.object({
   status: z11.string(),
   pausedAt: z11.string().nullable(),
   track: z11.string(),
+  // T202610120005：组合任务展示数据承载（列表页拼接文案依赖；迁移前存量可能缺省）
+  trackMatch: z11.array(z11.string()).optional(),
   progress: z11.object({
     completed: z11.number(),
     total: z11.number()
@@ -3743,7 +3868,8 @@ var NodePresetShapeSchema = z17.object({
   nodeId: z17.string().regex(/^[A-Za-z0-9_-]+$/, "nodeId \u53EA\u5141\u8BB8\u5B57\u6BCD/\u6570\u5B57/\u4E0B\u5212\u7EBF/\u8FDE\u5B57\u7B26"),
   /** 运行时注册表判定（对齐 dag_phase/dag_track 放宽策略——Zod 只做类型级） */
   phase: z17.string(),
-  track: z17.string(),
+  // T202610120005 R7：节点轨道 union（多轨节点，值拷贝冻结原样形态）
+  track: DagNodeTrackSchema,
   prompt: z17.string().min(1),
   /** 绑定技能名单（by-name 引用；版本要求只存在于 npm 分发层 manifest，不侵入运行链路） */
   skills: uniqueNamesSchema,
@@ -4210,6 +4336,102 @@ function applyUpgradeDecisions(template, presetsByCode, decisions) {
   return { nodes, nextVersion: changed ? bumpPatch(template.version) : null, results };
 }
 
+// src/task/track-chains.ts
+function nodeTrackMembers(track) {
+  const members = typeof track === "string" ? [track] : track;
+  if (members.includes("all")) return [];
+  return members;
+}
+function simulateTrackChains(template) {
+  const nodeTracks = /* @__PURE__ */ new Set();
+  for (const node of template.nodes) {
+    for (const member of nodeTrackMembers(node.track)) nodeTracks.add(member);
+  }
+  if (nodeTracks.has("backend") && nodeTracks.has("ui")) nodeTracks.add("backend+ui");
+  const builtinOrder = /* @__PURE__ */ new Map([
+    ["backend", 0],
+    ["ui", 1],
+    ["backend+ui", 2]
+  ]);
+  const firstSeen = /* @__PURE__ */ new Map();
+  for (const node of template.nodes) {
+    for (const member of nodeTrackMembers(node.track)) {
+      if (!firstSeen.has(member)) firstSeen.set(member, firstSeen.size);
+    }
+  }
+  const tracks = [...nodeTracks].sort((a, b) => {
+    const rankA = builtinOrder.get(a) ?? builtinOrder.size;
+    const rankB = builtinOrder.get(b) ?? builtinOrder.size;
+    return rankA !== rankB ? rankA - rankB : (firstSeen.get(a) ?? 0) - (firstSeen.get(b) ?? 0);
+  });
+  return tracks.map((track) => simulateSingleTrack(template, track));
+}
+function simulateSingleTrack(template, track) {
+  const members = track.includes("+") ? track.split("+") : [track];
+  const core = buildPrunedGraph(template, members);
+  if (!core.ok) return { track, chain: [], error: core.reason };
+  const { nodes, edges } = core.graph;
+  const keptIds = new Set(nodes.map((n) => n.id));
+  const hasIncoming = new Set(edges.filter((e) => keptIds.has(e.to)).map((e) => e.to));
+  const entries = nodes.filter((n) => !hasIncoming.has(n.id));
+  if (entries.length === 0) {
+    return { track, chain: [], error: "\u526A\u679D\u540E\u65E0\u5165\u53E3\u8282\u70B9\uFF08\u5165\u5EA6 0 \u7684\u8282\u70B9\u4E0D\u5B58\u5728\uFF09" };
+  }
+  if (entries.length > 1) {
+    return { track, chain: [], error: `\u5165\u53E3\u8282\u70B9 ${String(entries.length)} \u4E2A\uFF08\u987B\u6070\u597D 1 \u4E2A\uFF09\uFF1A${entries.map((n) => n.id).join(", ")}` };
+  }
+  const entry = entries[0];
+  const chain = [entry.id];
+  let cursor = entry.id;
+  const maxHops = nodes.length;
+  for (let hop = 0; hop <= maxHops && cursor !== null; hop++) {
+    if (hop === maxHops) {
+      return { track, chain: [], error: "\u5F15\u64CE\u8DEF\u5F84\u6A21\u62DF\u8D85\u6B65\u6570\u4E0A\u9650\uFF08\u56FE\u4E2D\u5B58\u5728\u73AF\uFF09" };
+    }
+    let nextEdge;
+    try {
+      nextEdge = findNextEdge(edges, nodes, cursor, matchSetOf(members));
+    } catch (err) {
+      const reason = err instanceof Error ? err.message : String(err);
+      return { track, chain: [], error: `\u5F15\u64CE\u8DEF\u7531\u65E0\u6CD5\u6D88\u6B67\uFF08${reason}\uFF09` };
+    }
+    if (nextEdge === null) break;
+    cursor = nextEdge.to;
+    if (!chain.includes(cursor)) chain.push(cursor);
+  }
+  return { track, chain };
+}
+var TEMPLATE_STRUCTURE_CONSTRAINTS = [
+  {
+    id: "single-chain-per-track",
+    title: "\u8F68\u9053\u5185\u5355\u94FE\uFF08D6\uFF09",
+    rule: '\u540C\u4E00\u8282\u70B9\u5BF9\u540C\u4E00\u76EE\u6807\u8F68\u9053\u53EA\u5141\u8BB8\u4E00\u6761\u51FA\u8FB9\uFF08"1 \u6761\u4E13\u5C5E\u8FB9 + 1 \u6761 all \u8FB9" \u5408\u6CD5\uFF1B"1 \u4E13\u5C5E + 2 all"\u3001"2 all"\u3001\u540C\u8F68\u53CC\u4E13\u5C5E\u5747\u8FDD\u89C4\uFF09\u3002\u8DF3\u8FC7\u53EF\u9009\u8282\u70B9\u7531\u526A\u679D\u6865\u63A5\u673A\u5236\u81EA\u52A8\u8865\u8FB9\uFF0C\u4E0D\u9700\u8981\u4E5F\u4E0D\u5E94\u8BE5\u624B\u5DE5\u6DFB\u52A0\u65C1\u8DEF\u76F4\u8FB9',
+    positiveExample: "\u8DE8\u8F68\u5206\u53C9\uFF1ADESIGN\u2192CODE_BACKEND \u4E0E DESIGN\u2192CODE_UI \u5E76\u5B58\uFF08\u76EE\u6807 track \u4E0D\u540C\uFF0C\u4E24\u6761\u8FB9\u5404\u5C5E\u4E00\u7EC4\uFF0C\u5408\u6CD5\uFF09",
+    negativeExample: "\u540C\u8F68\u65C1\u8DEF\u76F4\u8FB9\uFF1AGUT_DEV\u2192INTEGRATION_SCENE \u4E0E GUT_DEV\u2192PLAY_SMOKE\uFF08\u540C\u4E3A godot \u8F68\u51FA\u8FB9\uFF0C\u540C\u7EC4\u5206\u53C9\u2014\u2014\u4FDD\u5B58/\u5BFC\u5165/\u5EFA\u4EFB\u52A1\u4E09\u5C42\u4E00\u81F4\u62D2\u7EDD\uFF09"
+  },
+  {
+    id: "cross-track-disambiguation",
+    title: "\u8DE8\u8F68\u5206\u53C9\u6D88\u6B67",
+    rule: "\u4E00\u4E2A\u8282\u70B9\u6709\u591A\u6761\u5339\u914D\u8FB9\u65F6\uFF1A\u4E13\u5C5E\u8F68\u8FB9\uFF08\u76EE\u6807 track \u2260 all\uFF09\u4F18\u5148\u4E8E all \u8FB9\uFF1B\u591A\u6761\u4E13\u5C5E\u8FB9\u6309\u6A21\u677F\u8FB9\u58F0\u660E\u5E8F\u53D6\u7B2C\u4E00\u6761\u3002\u5BF9\u9F50\u8282\u70B9\u60F3\u540E\u7F6E/\u524D\u7F6E\u67D0\u94FE\uFF0C\u9760\u8FB9\u58F0\u660E\u5E8F\u8868\u8FBE",
+    positiveExample: "\u8FB9\u58F0\u660E\u5E8F [DESIGN\u2192CODE_BACKEND, DESIGN\u2192CODE_UI]\uFF1A\u7EC4\u5408\u4EFB\u52A1\uFF08backend+ui\uFF09\u5148\u8D70 CODE_BACKEND \u540E\u8D70 CODE_UI\uFF08\u58F0\u660E\u5E8F\u53D6\u7B2C\u4E00\uFF09",
+    negativeExample: "\u671F\u671B\u7EC4\u5408\u4EFB\u52A1\u5148\u8D70 UI \u94FE\u5374\u628A DESIGN\u2192CODE_UI \u58F0\u660E\u5728 DESIGN\u2192CODE_BACKEND \u4E4B\u540E\uFF08\u4E13\u5C5E\u8FB9\u53D6\u58F0\u660E\u5E8F\u7B2C\u4E00\u6761\uFF0C\u540E\u58F0\u660E\u7684\u4E0D\u4F1A\u88AB\u4F18\u5148\u9009\u4E2D\uFF09"
+  },
+  {
+    id: "skip-bridging",
+    title: "\u8DF3\u8FC7\u8282\u70B9\u6865\u63A5",
+    rule: "\u526A\u679D\u540E\u51FA\u5EA6 0 \u4E14\u975E\u6A21\u677F\u7EC8\u70B9\u7684\u8282\u70B9\u81EA\u52A8\u6CBF\u6A21\u677F\u540E\u4EE3 BFS \u8865\u8FB9\u5230\u6700\u8FD1\u6FC0\u6D3B\u540E\u4EE3\uFF0C\u6682\u505C\u70B9\u7EE7\u627F\u8BE5\u8282\u70B9\u9996\u6761\u6A21\u677F\u51FA\u8FB9\u2014\u2014\u65C1\u8DEF\u76F4\u8FB9\u65E2\u5197\u4F59\u53C8\u4F1A\u6784\u6210 D6 \u5206\u53C9",
+    positiveExample: "\u6A21\u677F EXIT\u2192ARCH\u2192END\uFF0C\u4EFB\u52A1 skip ARCH\uFF1A\u81EA\u52A8\u6865\u63A5 EXIT\u2192END\uFF0CARCH \u51FA\u8FB9\u7684 human_approval \u7531\u6865\u63A5\u8FB9\u7EE7\u627F\uFF0C\u65E0\u9700\u624B\u5DE5\u52A0\u8FB9",
+    negativeExample: "\u4E3A\u8DF3\u8FC7 ARCH \u624B\u5DE5\u6DFB\u52A0 EXIT\u2192END \u76F4\u8FB9\uFF08\u4E0E\u6865\u63A5\u4EA7\u7269\u5E76\u5B58\u5373\u540C\u8F68\u5206\u53C9\uFF0C\u88AB D6 \u62E6\u622A\uFF09"
+  },
+  {
+    id: "combo-serial-bridge",
+    title: "\u7EC4\u5408\u94FE\u95F4\u4E32\u884C\u6865\u8FB9",
+    rule: "\u7EC4\u5408\u4EFB\u52A1\uFF08\u5982 backend+ui \u53CC\u94FE\uFF09\u9700\u8981\u94FE\u95F4\u4E32\u884C\u6865\u8FB9\uFF08\u5982 CODE_BACKEND\u2192CODE_UI\uFF09\uFF0C\u5426\u5219\u526A\u679D\u6821\u9A8C\u62A5\u300C\u6FC0\u6D3B\u8282\u70B9\u4E0D\u5728\u5F15\u64CE\u8DEF\u5F84\u300D\uFF08\u53E6\u4E00\u94FE\u8282\u70B9\u6C38\u4E45 pending\uFF09",
+    positiveExample: "CODE_BACKEND\u2192CODE_UI \u4E32\u884C\u6865\u8FB9\uFF1A\u7EC4\u5408\u4EFB\u52A1\u5F15\u64CE\u5148\u8D70\u5B8C backend \u94FE\u518D\u8FDB ui \u94FE\uFF0C\u6700\u540E\u5171\u540C\u6C47\u5165 INTEGRATE/ACCEPT",
+    negativeExample: "backend\u3001ui \u4E24\u94FE\u5404\u81EA\u72EC\u7ACB\u6C47\u5408\u5230\u7EC8\u70B9\u800C\u65E0\u94FE\u95F4\u6865\u8FB9\uFF08\u7EC4\u5408\u4EFB\u52A1\u521B\u5EFA\u65F6 422\u300C\u6FC0\u6D3B\u8282\u70B9\u4E0D\u5728\u5F15\u64CE\u8DEF\u5F84\u4E0A\u300D\uFF09"
+  }
+];
+
 // src/template-transfer/payload.ts
 function toTemplatePayload(tpl) {
   const { id: _id, projectId: _projectId, enabled: _enabled, createdAt: _ca, updatedAt: _ua, code: _code, ...rest } = tpl;
@@ -4274,8 +4496,15 @@ async function composeExportBundle(deps, templateId) {
     deps.agentRepo.listAgentsByScopeFilter("project", tpl.projectId, { includeDisabled: true })
   ]);
   const directSet = new Set(directSkillNames);
-  const agents = [...globalAgents, ...projectAgents].filter(
-    (agent) => (agent.boundSkills ?? []).some((name) => directSet.has(name))
+  const directAgentNames = new Set(tpl.nodes.flatMap((node) => node.agents ?? []));
+  const visibleAgents = [...globalAgents, ...projectAgents];
+  for (const name of directAgentNames) {
+    if (!visibleAgents.some((a) => a.name === name)) {
+      warnings.push(`AGENT "${name}" \u88AB\u8282\u70B9\u76F4\u63A5\u5F15\u7528\u4F46\u5728\u6E90\u73AF\u5883\u4E2D\u4E0D\u5B58\u5728\uFF08\u5F15\u7528\u60AC\u7A7A\uFF09\uFF0C\u672A\u5305\u542B\u5728\u5BFC\u51FA\u4F9D\u8D56\u4E2D`);
+    }
+  }
+  const agents = visibleAgents.filter(
+    (agent) => directAgentNames.has(agent.name) || (agent.boundSkills ?? []).some((name) => directSet.has(name))
   );
   const allSkillNames = [.../* @__PURE__ */ new Set([...directSkillNames, ...agents.flatMap((a) => a.boundSkills ?? [])])];
   const skillMap = await deps.skillRepo.listSkillsByNames(allSkillNames, "project", tpl.projectId);
@@ -4415,6 +4644,28 @@ async function buildImportPlan(deps, targetProjectId, bundle) {
       }
     }
   }
+  const directAgentChecks = [];
+  const bundledAgentNames = new Set(bundle.dependencies.agents.map((a) => a.name));
+  const unbundledAgentNames = [
+    ...new Set(bundle.template.nodes.flatMap((n) => n.agents ?? []).filter((a) => !bundledAgentNames.has(a)))
+  ];
+  const envVisibleAgentNames = unbundledAgentNames.length > 0 ? await (async () => {
+    const [envGlobalAgents, envProjectAgents] = await Promise.all([
+      deps.agentRepo.listAgentsByScopeFilter("global", void 0, { includeDisabled: true }),
+      deps.agentRepo.listAgentsByScopeFilter("project", targetProjectId, { includeDisabled: true })
+    ]);
+    return new Set([...envGlobalAgents, ...envProjectAgents].map((a) => a.name));
+  })() : /* @__PURE__ */ new Set();
+  for (const node of bundle.template.nodes) {
+    for (const agentName of node.agents ?? []) {
+      if (bundledAgentNames.has(agentName) || envVisibleAgentNames.has(agentName)) {
+        directAgentChecks.push({ node: node.id, agent: agentName, status: "ok" });
+      } else {
+        directAgentChecks.push({ node: node.id, agent: agentName, status: "missing" });
+        warnings.push(`\u6A21\u677F\u8282\u70B9 ${node.id} \u76F4\u63A5\u5F15\u7528\u4EE3\u7406 "${agentName}" \u4E0D\u5728\u5BFC\u51FA\u5305\u4E2D\u4E14\u76EE\u6807\u73AF\u5883\u4E0D\u5B58\u5728\uFF08\u5F15\u7528\u60AC\u7A7A\uFF09`);
+      }
+    }
+  }
   const presetCodes = [...new Set(bundle.template.nodes.flatMap((n) => n.sourcePreset ? [n.sourcePreset.code] : []))];
   const presetsByCode = presetCodes.length > 0 ? await deps.nodePresetRepo.listByCodes(presetCodes) : /* @__PURE__ */ new Map();
   for (const node of bundle.template.nodes) {
@@ -4434,6 +4685,7 @@ async function buildImportPlan(deps, targetProjectId, bundle) {
     },
     dependencies: [...skillChecks, ...agentChecks, ...aliasChecks],
     directSkillChecks,
+    directAgentChecks,
     warnings
   };
 }
@@ -4463,6 +4715,7 @@ async function applyImport(deps, targetProjectId, bundle, decisions) {
   }
   assertUniqueNodeIds(nodesForWrite);
   assertUniqueAiCheckIds(nodesForWrite);
+  assertNoSameTrackFork(nodesForWrite, tplPayload.edges);
   const contentFields = {
     name: tplPayload.name,
     description: tplPayload.description,
@@ -4787,6 +5040,7 @@ export {
   TASK_TYPES,
   TEMPLATE_CODE_MAX_LENGTH,
   TEMPLATE_CODE_REGEX,
+  TEMPLATE_STRUCTURE_CONSTRAINTS,
   TaskBatchAckSchema,
   TaskBatchEntrySchema,
   TaskBatchFailureSchema,
@@ -4823,11 +5077,13 @@ export {
   approveTask,
   assertBoundSkillsCompatible,
   assertModelAliasExists,
+  assertNoSameTrackFork,
   assertReferenceAggregateLimit,
   assertReferencesDeletable,
   assertUniqueAiCheckIds,
   assertUniqueNodeIds,
   buildImportPlan,
+  buildPrunedGraph,
   buildTemplateCode,
   buildUpgradePlan,
   bumpPatch,
@@ -4857,11 +5113,13 @@ export {
   decisionKey,
   derivePreTerminalState,
   diffTemplateContent,
+  effectiveTracks,
   enabledNeFalse,
   escapeRegExpLiteral,
   excerpt,
   findDuplicateNodeIds,
   findNextEdge,
+  findSameTrackForks,
   findTemplateByName,
   generateEntryId,
   generateProjectKey,
@@ -4871,6 +5129,7 @@ export {
   hashPassword,
   hashToken,
   isLegalTemplateCode,
+  matchSetOf,
   mkHistory,
   normalizeNameToTemplateCode,
   parseAuthEnabledEnvValue,
@@ -4880,12 +5139,13 @@ export {
   renderPrompt,
   reopenTask,
   resumeTask,
+  simulateTrackChains,
   sumReferenceContentChars,
   taskProgress,
   toNodeInfo,
   toTaskPublic,
   tokenTypeFromValue,
-  trackMatchSet,
+  trackIntersects,
   verifyPassword,
   withTransaction
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@siming-org/core",
-  "version": "0.8.3",
+  "version": "0.8.5",
   "license": "MIT",
   "author": "Wuchao",
   "engines": {