agentic-flow-kit 1.8.1 → 1.8.7

package/templates/_agents/scripts/mechanism-retire-watch.test.mjs

@@ -0,0 +1,114 @@
+#!/usr/bin/env node
+// mechanism-retire-watch.test.mjs — 1b 机制退役催办纯函数套件（2026-10-14 L5 自举接线 1b）
+// parseRegistry / ruleNamesOf / zeroMonthsOf / evaluate 进程内断言。
+import { parseRegistry, ruleNamesOf, zeroMonthsOf, evaluate } from './mechanism-retire-watch.mjs';
+
+let pass = 0;
+let fail = 0;
+const check = (desc, cond, detail = '') => {
+  if (cond) { pass++; console.log(`PASS  ${desc}`); }
+  else { fail++; console.log(`FAIL  ${desc}${detail ? '\n      ' + detail : ''}`); }
+};
+
+// ---- S1 parseRegistry ----
+{
+  const text = [
+    '| 机制 | 门禁位置 | 触发统计口径 | 退役阈值 | 最近触发 | 状态 | 处置期限 |',
+    '|---|---|---|---|---|---|---|',
+    '| 甲门 | check-loop §1 | WARN「甲规则」计数（月） | 连续 6 月 = 0 → 评估退役 | 2026-10 在用 | 现役 | — |',
+    '| 乙门 | check-loop §2 | hard 计数 | 不退役（主干） | 2026-10 | 现役 | — |',
+    '| 丙门 | check-loop §3 | WARN 计数 | 连续 6 月 = 0 | 2026-10 | 待退役 | 2026-01-01 |',
+    '| 坏行 | 少列 |',
+  ].join('\n');
+  const rows = parseRegistry(text);
+  check('S1 只取 7 列数据行（表头/分隔/坏行剔除）', rows.length === 3, String(rows.length));
+  check('S1 列序正确', rows[0].name === '甲门' && rows[0].status === '现役' && rows[0].deadline === '—', JSON.stringify(rows[0]));
+  check('S1 待退役行期限解析', rows[2].status === '待退役' && rows[2].deadline === '2026-01-01');
+}
+
+// ---- S2 ruleNamesOf ----
+check('S2 单规则名', ruleNamesOf('WARN「模板未填」计数（月）').join(',') === '模板未填');
+check('S2 斜杠分隔多规则', ruleNamesOf('WARN「预判类型不符/预判级别不符/预判字段不可解析」计数').join(',') === '预判类型不符,预判级别不符,预判字段不可解析');
+check('S2 无「」→ 空', ruleNamesOf('hard/WARN 计数（月）').length === 0);
+
+// ---- S3 zeroMonthsOf ----
+check('S3 连续 6 月 = 0', zeroMonthsOf('连续 6 月 = 0 → 评估退役') === 6);
+check('S3 带前缀仍解析', zeroMonthsOf('WARN 命中连续 6 月 = 0 且新增预判字段停滞 → 评估退役') === 6);
+check('S3 非零阈值形态 → null', zeroMonthsOf('不退役（防伪主干）') === null);
+check('S3 使用率型 → null', zeroMonthsOf('<10% 且无新增 → 退役双协议') === null);
+
+// ---- S4 evaluate：阈值触达 ----
+{
+  const reg = [{ name: '甲门', criterion: 'WARN「甲规则」计数', threshold: '连续 2 月 = 0 → 评估退役', status: '现役', deadline: '—' }];
+  const j = [
+    { ts: '2026-08-01T00:00:00Z', rules: [{ rule: '甲规则', level: 'WARN', count: 0 }] },
+    { ts: '2026-09-01T00:00:00Z', rules: [] },
+  ];
+  const r = evaluate(reg, j, new Date('2026-10-14'));
+  check('S4 连续 2 月零触发 → 动作项', r.actions.length === 1 && r.actions[0].kind === 'threshold', JSON.stringify(r.actions));
+  check('S4 动作项含窗口与规则名', /2026-08 \/ 2026-09/.test(r.actions[0].detail) && /甲规则/.test(r.actions[0].detail), r.actions[0].detail);
+}
+
+// ---- S5 evaluate：窗口内有触发 → 不产动作项 ----
+{
+  const reg = [{ name: '甲门', criterion: 'WARN「甲规则」计数', threshold: '连续 2 月 = 0', status: '现役', deadline: '—' }];
+  const j = [
+    { ts: '2026-08-01T00:00:00Z', rules: [{ rule: '甲规则', level: 'WARN', count: 1 }] },
+    { ts: '2026-09-01T00:00:00Z', rules: [] },
+  ];
+  const r = evaluate(reg, j, new Date('2026-10-14'));
+  check('S5 窗口内命中 → 无动作项', r.actions.length === 0, JSON.stringify(r.actions));
+}
+
+// ---- S6 evaluate：数据不足 / 无规则名 → notAuto ----
+{
+  const reg = [
+    { name: '甲门', criterion: 'WARN「甲规则」计数', threshold: '连续 6 月 = 0', status: '现役', deadline: '—' },
+    { name: '乙门', criterion: 'hard 计数', threshold: '连续 6 月 = 0', status: '现役', deadline: '—' },
+    { name: '丙门', criterion: 'WARN「丙规则」计数', threshold: '不退役（主干）', status: '现役', deadline: '—' },
+  ];
+  const j = [{ ts: '2026-09-01T00:00:00Z', rules: [] }];
+  const r = evaluate(reg, j, new Date('2026-10-14'));
+  check('S6 数据不足 → notAuto', r.notAuto.some((x) => x.name === '甲门' && /数据不足/.test(x.reason)), JSON.stringify(r.notAuto));
+  check('S6 无规则名 → notAuto', r.notAuto.some((x) => x.name === '乙门' && /未列规则名/.test(x.reason)));
+  check('S6 非零阈值形态 → notAuto', r.notAuto.some((x) => x.name === '丙门' && /非「连续/.test(x.reason)));
+  check('S6 无动作项', r.actions.length === 0);
+}
+
+// ---- S7 evaluate：待退役逾期 / 缺期限 ----
+{
+  const reg = [
+    { name: '甲门', criterion: '', threshold: '', status: '待退役', deadline: '2026-01-01' },
+    { name: '乙门', criterion: '', threshold: '', status: '待退役', deadline: '下批次' },
+    { name: '丙门', criterion: '', threshold: '', status: '已退役', deadline: '—' },
+  ];
+  const r = evaluate(reg, [], new Date('2026-10-14'));
+  check('S7 逾期 → overdue', r.actions.some((a) => a.kind === 'overdue' && a.name === '甲门'), JSON.stringify(r.actions));
+  check('S7 非日期期限 → no-deadline', r.actions.some((a) => a.kind === 'no-deadline' && a.name === '乙门'));
+  check('S7 已退役行跳过', !r.actions.some((a) => a.name === '丙门'));
+}
+// ---- S7b：期限当天不逾期（本地日，不当天 08:00 后提前催）----
+{
+  const reg = [{ name: '甲门', criterion: '', threshold: '', status: '待退役', deadline: '2026-10-14' }];
+  const now = new Date(2026, 9, 14, 9, 0, 0);
+  const r = evaluate(reg, [], now);
+  check('S7b 期限当天本地 09:00 不逾期', r.actions.length === 0, JSON.stringify(r.actions));
+}
+// ---- S4b：有数据月不连续 → 缺月不算零命中 ----
+{
+  const reg = [{ name: '甲门', criterion: 'WARN「甲规则」计数', threshold: '连续 2 月 = 0 → 评估退役', status: '现役', deadline: '—' }];
+  const j = [
+    { ts: '2026-08-01T00:00:00Z', rules: [] },
+    { ts: '2026-10-01T00:00:00Z', rules: [] },
+  ];
+  const r = evaluate(reg, j, new Date('2026-10-14T00:00:00Z'));
+  check('S4b 8 月与 10 月之间缺 9 月 → 不产退役动作', r.actions.length === 0, JSON.stringify(r.actions));
+  check('S4b 缺月记入 notAuto', r.notAuto.some((x) => x.name === '甲门' && /缺月/.test(x.reason) && /2026-09/.test(x.reason)), JSON.stringify(r.notAuto));
+}
+
+// ---- S8 空入参 ----
+check('S8 空台账 → 无动作项', evaluate([], [], new Date()).actions.length === 0);
+check('S8 null judgments 不 throw', evaluate([], null, new Date()).actions.length === 0);
+
+console.log(`\n合计: PASS ${pass} / FAIL ${fail}`);
+process.exit(fail ? 1 : 0);

package/templates/_agents/scripts/pre-push.test.mjs

@@ -1,10 +1,12 @@
 #!/usr/bin/env node
-// pre-push.test.mjs — 加固门目标分支判定 fixture 套件（2026-10-01 v09-review-defects）
-// 真仓端到端：临时仓库挂载真实 pre-push，.agents/scripts/check-loop.sh 以桩脚本记录 argv。
+// pre-push.test.mjs — 加固门目标分支判定 + 构建门 fixture 套件
+// （2026-10-01 v09-review-defects 建；2026-10-16 随 pre-push node 化更新：桩改 .agents/scripts/check-loop.mjs
+// 直调，补 commit-check 构建门桩与 --range 断言——自源仓 2ff869a9 回灌面）
+// 真仓端到端：临时仓库挂载真实 pre-push，check-loop.mjs 与 commit-check.cjs 以桩记录 argv。
 // 断言三态 refspec：
-//   main→main                  → argv 含 --hardening（加固门）
-//   experiment/x→main         → argv 含 --hardening（修复回归：直推漏口）
-//   experiment/y→experiment/y → argv 不含 --hardening（advisory）
+//   main→main                  → argv 含 --hardening（加固门）；构建门 --range 新分支首推=全量零 sha
+//   experiment/x→main         → argv 含 --hardening（修复回归：直推漏口）；构建门 old 为远端实 sha
+//   experiment/y→experiment/y → argv 不含 --hardening（advisory）；构建门仍按范围跑（advisory 不阻断）
 import fs from 'node:fs';
 import os from 'node:os';
 import path from 'node:path';
@@ -34,11 +36,15 @@ const setup = () => {
   const remote = path.join(root, 'remote.git');
   fs.mkdirSync(path.join(root, '.githooks'), { recursive: true });
   fs.mkdirSync(path.join(root, '.agents', 'scripts'), { recursive: true });
-  // 挂载真实 pre-push（装户同款），stub 替换 check-loop 记录 argv
+  fs.mkdirSync(path.join(root, '.agents', 'hooks'), { recursive: true });
+  // 挂载真实 pre-push（装户同款），stub 替换 check-loop 与 commit-check 记录 argv
   fs.copyFileSync(PRE_PUSH, path.join(root, '.githooks', 'pre-push'));
-  // Linux：git 静默跳过不可执行钩子（推送照常成功、桩无记录）——挂载后必须设执行位；桩经 sh 调用无须 +x
+  // Linux：git 静默跳过不可执行钩子（推送照常成功、桩无记录）——挂载后必须设执行位；桩经 node 调用无须 +x
   fs.chmodSync(path.join(root, '.githooks', 'pre-push'), 0o755);
-  fs.writeFileSync(path.join(root, '.agents', 'scripts', 'check-loop.sh'), '#!/bin/sh\necho "$@" >> .stub-args\nexit 0\n');
+  fs.writeFileSync(path.join(root, '.agents', 'scripts', 'check-loop.mjs'),
+    'import fs from "node:fs";\nfs.appendFileSync(".stub-args", process.argv.slice(2).join(" ") + "\\n");\n');
+  fs.writeFileSync(path.join(root, '.agents', 'hooks', 'commit-check.cjs'),
+    'const fs = require("node:fs");\nfs.appendFileSync(".stub-args-cc", process.argv.slice(2).join(" ") + "\\n");\n');
   fs.writeFileSync(path.join(root, 'a.txt'), 'a\n');
   git(root, ['init', '-q']);
   git(root, ['config', 'user.email', 't@t']);
@@ -54,15 +60,21 @@ const stubArgs = (root) => {
   const p = path.join(root, '.stub-args');
   return fs.existsSync(p) ? fs.readFileSync(p, 'utf8').split(/\n/).filter(Boolean) : [];
 };
+const ccArgs = (root) => {
+  const p = path.join(root, '.stub-args-cc');
+  return fs.existsSync(p) ? fs.readFileSync(p, 'utf8').split(/\n/).filter(Boolean) : [];
+};
 
 const root = setup();
 const w = (f, c) => fs.writeFileSync(path.join(root, f), c);
 
-// 1) main → main：应含 --hardening
+// 1) main → main：应含 --hardening；构建门首推 = 全量零 sha
 git(root, ['checkout', '-q', '-b', 'main']);
 let r = run(root, ['push', 'origin', 'HEAD:main']);
 check('main→main 推送成功', r.status === 0, `${r.stdout}${r.stderr}`);
 check('main→main argv 含 --hardening', (stubArgs(root)[0] || '').includes('--hardening'), stubArgs(root).join('|'));
+check('main→main 构建门 --range 新分支首推=全量零 sha（2026-10-16 构建门后移）',
+  (ccArgs(root)[0] || '').startsWith('--range 0000000000000000000000000000000000000000 '), ccArgs(root).join('|'));
 
 // 2) experiment/x → main（回归漏口）：本地分支在 experiment，目标 main → 必须含 --hardening
 git(root, ['checkout', '-q', '-b', 'experiment/x']);
@@ -72,8 +84,10 @@ git(root, ['commit', '-q', '-m', 'x']);
 r = run(root, ['push', 'origin', 'HEAD:main']);
 check('experiment/x→main 推送成功', r.status === 0, `${r.stdout}${r.stderr}`);
 check('experiment/x→main argv 含 --hardening（直推漏口修复）', (stubArgs(root)[1] || '').includes('--hardening'), stubArgs(root).join('|'));
+check('experiment/x→main 构建门 --range old 为远端实 sha（非零）',
+  /^--range [0-9a-f]{40} /.test(ccArgs(root)[1] || ''), ccArgs(root).join('|'));
 
-// 3) experiment/y → experiment/y：目标在探索泳道 → 不含 --hardening
+// 3) experiment/y → experiment/y：目标在探索泳道 → 不含 --hardening；构建门仍按范围跑（advisory）
 git(root, ['fetch', '-q', 'origin']);
 git(root, ['branch', 'experiment/y', 'origin/main']);
 git(root, ['checkout', '-q', 'experiment/y']);
@@ -84,6 +98,8 @@ r = run(root, ['push', 'origin', 'HEAD:experiment/y']);
 check('experiment→experiment 推送成功', r.status === 0, `${r.stdout}${r.stderr}`);
 const line3 = stubArgs(root)[2] || '';
 check('experiment→experiment argv 不含 --hardening', !line3.includes('--hardening'), stubArgs(root).join('|'));
+check('experiment→experiment 构建门仍按范围跑（advisory 不阻断）',
+  /^--range [0-9a-f]{40} /.test(ccArgs(root)[2] || ''), ccArgs(root).join('|'));
 
-console.log(`\n${fail ? `❌ ${fail} failed` : '✅ all passed'}（${pass} passed）`);
+console.log(`\n合计: PASS ${pass} / FAIL ${fail}`);
 process.exit(fail ? 1 : 0);

package/templates/_agents/scripts/rule-budget.mjs

@@ -8,6 +8,10 @@
 // 「提交后树」= 索引（index）内容：staged 版优先于 HEAD；无 git（fixture）回退工作区文件。
 // 字节口径 = 索引 / HEAD 内容（git cat-file，LF 归一）。禁用工作区 wc -c 口径（CRLF 膨胀系统性偏大，
 // 2026-09-21 实测差 ~500B 一度误判超限）——本脚本所有字节数都走 cat-file，仅无 git 时才落工作区。
+// 条目数预算（2026-10-15 减重手段② 自源仓回灌）：上限字段形如 `<N>#count` 时按「匹配文件条数」执法
+//   而非字节——规则面一进一出（新增一条须先退役一条，退役判定 agg-judgments --retire-candidates）。
+//   旧格式行（纯数字）不受影响；`#count` 行对旧读者（未升级的脚本副本）因上限非纯数字被跳过——
+//   fail-open，不误拦。
 import { spawnSync } from 'node:child_process';
 import fs from 'node:fs';
 import path from 'node:path';
@@ -60,13 +64,22 @@ const expand = (pat) => {
 
 let viol = 0;
 const over = (what, bytes, lim) => { console.log(`常驻面超限：${what} ${bytes}B > 上限 ${lim}B`); viol = 1; };
+const overCount = (pat, n, lim) => { console.log(`常驻面超限（条目数）：${pat} ${n} 项 > 上限 ${lim} 项——一进一出：新增须先退役一条（退役判定 agg-judgments --retire-candidates）`); viol = 1; };
 
 for (const line of fs.readFileSync(BUDGETS, 'utf8').split(/\r?\n/)) {
   const sp = line.lastIndexOf(' ');
   if (sp < 0) continue;
   const pat = line.slice(0, sp), lim = line.slice(sp + 1);
   if (pat === '' || pat.startsWith('#')) continue;
-  if (!/^\d+$/.test(lim)) continue;
+  // 条目数预算（2026-10-15 减重手段②）：`<N>#count` = 匹配文件数上限（一进一出的执法面）
+  const cnt = /^(\d+)#count$/.exec(lim);
+  if (!cnt && !/^\d+$/.test(lim)) continue;
+  if (cnt) {
+    if (mode === '--staged' && !staged.some((sf) => sf.startsWith(pat))) continue;
+    const n = expand(pat).length;
+    if (n > Number(cnt[1])) overCount(pat, n, cnt[1]);
+    continue;
+  }
   if (pat.endsWith('/')) {
     // 目录合计：--staged 下仅当暂存触及该目录内文件才查（字面前缀匹配，同 sh 版 2026-09-24 口径）
     if (mode === '--staged' && !staged.some((sf) => sf.startsWith(pat))) continue;

package/templates/_agents/scripts/rule-budget.test.mjs

@@ -0,0 +1,118 @@
+#!/usr/bin/env node
+// rule-budget.test.mjs — 常驻面预算黑盒套件（2026-10-15 减重手段② 自源仓回灌随附：#count 条目数指令）
+// 夹具：os.tmpdir 下临时目录（非 git 环境——脚本 git rev-parse 失败留在 fixture 目录，
+// 字节口径回退工作区文件；与真实仓「索引/HEAD」口径的差异不影响指令语义判定）。
+// 覆盖：字节超限/未超、#count 超限/压线、旧格式行不受 #count 影响、缺预算表 exit 0、
+//       --staged 无 git（staged 空）时 #count 门跳过。
+// 运行：node templates/_agents/scripts/rule-budget.test.mjs
+import fs from 'node:fs';
+import os from 'node:os';
+import path from 'node:path';
+import { spawnSync } from 'node:child_process';
+import { fileURLToPath } from 'node:url';
+
+const SCRIPT = path.join(path.dirname(fileURLToPath(import.meta.url)), 'rule-budget.mjs');
+
+let pass = 0;
+let fail = 0;
+const check = (desc, cond, detail = '') => {
+  if (cond) { pass++; console.log(`PASS  ${desc}`); }
+  else { fail++; console.log(`FAIL  ${desc}${detail ? '\n      ' + detail : ''}`); }
+};
+
+function makeFixture({ budgets, dirs = {}, files = {} }) {
+  const root = fs.mkdtempSync(path.join(os.tmpdir(), 'rule-budget-'));
+  if (budgets !== null) {
+    fs.mkdirSync(path.join(root, '.agents'), { recursive: true });
+    fs.writeFileSync(path.join(root, '.agents', 'rule-budgets.txt'), budgets, 'utf8');
+  }
+  for (const [dir, names] of Object.entries(dirs)) {
+    fs.mkdirSync(path.join(root, dir), { recursive: true });
+    for (const n of names) fs.writeFileSync(path.join(root, dir, n), 'x\n', 'utf8');
+  }
+  for (const [f, content] of Object.entries(files)) {
+    fs.mkdirSync(path.dirname(path.join(root, f)), { recursive: true });
+    fs.writeFileSync(path.join(root, f), content, 'utf8');
+  }
+  return root;
+}
+
+const run = (cwd, mode = '--all') => {
+  const r = spawnSync(process.execPath, [SCRIPT, mode], { cwd, encoding: 'utf8' });
+  return { code: r.status, out: String(r.stdout || '') };
+};
+
+let root;
+
+// ---- T1 字节超限（旧格式语义不回归）----
+root = makeFixture({
+  budgets: 'AGENTS.md 10\n',
+  files: { 'AGENTS.md': 'x'.repeat(50) },
+});
+{
+  const r = run(root);
+  check('T1 字节超限 exit 1 + 违例行', r.code === 1 && r.out.includes('常驻面超限：AGENTS.md') && r.out.includes('> 上限 10B'), JSON.stringify(r));
+}
+
+// ---- T2 字节未超 → 0 ----
+root = makeFixture({
+  budgets: 'AGENTS.md 100\n',
+  files: { 'AGENTS.md': 'x'.repeat(50) },
+});
+check('T2 字节未超 exit 0', run(root).code === 0);
+
+// ---- T3 #count 超限 ----
+root = makeFixture({
+  budgets: '.agents/rules/ 2#count\n',
+  dirs: { '.agents/rules': ['r01-a.md', 'r02-b.md', 'r03-c.md'] },
+});
+{
+  const r = run(root);
+  check('T3 #count 超限 exit 1 + 条目数违例行 + 一进一出提示', r.code === 1 && r.out.includes('条目数') && r.out.includes('3 项 > 上限 2 项') && r.out.includes('一进一出'), JSON.stringify(r));
+}
+
+// ---- T4 #count 压线（= 上限）→ 0 ----
+root = makeFixture({
+  budgets: '.agents/rules/ 3#count\n',
+  dirs: { '.agents/rules': ['r01-a.md', 'r02-b.md', 'r03-c.md'] },
+});
+check('T4 #count 压线 exit 0', run(root).code === 0);
+
+// ---- T5 混合表：#count 行存在但未触其它字节条目 → 0（互不干扰）----
+root = makeFixture({
+  budgets: 'AGENTS.md 100\n.agents/rules/ 3#count\n',
+  files: { 'AGENTS.md': 'x'.repeat(50) },
+  dirs: { '.agents/rules': ['r01-a.md', 'r02-b.md', 'r03-c.md'] },
+});
+check('T5 混合表双通过 exit 0', run(root).code === 0);
+
+// ---- T6 缺预算表 → exit 0（fixture 沙箱不拦，既有语义）----
+root = makeFixture({ budgets: null });
+check('T6 缺预算表 exit 0', run(root).code === 0);
+
+// ---- T7 --staged 无 git（staged 空）：#count 门跳过不拦 ----
+root = makeFixture({
+  budgets: '.agents/rules/ 2#count\n',
+  dirs: { '.agents/rules': ['r01-a.md', 'r02-b.md', 'r03-c.md'] },
+});
+{
+  const r = run(root, '--staged');
+  check('T7 --staged 无 git 环境跳过 #count 门 exit 0', r.code === 0, JSON.stringify(r));
+}
+
+// ---- T8 glob 形态 #count（* 后缀）也按条数执法 ----
+root = makeFixture({
+  budgets: '.agents/commands/*.md 2#count\n',
+  dirs: { '.agents/commands': ['a.md', 'b.md', 'c.md', 'd.txt'] },
+});
+{
+  const r = run(root);
+  check('T8 glob #count 只数 *.md（3 项 > 2）exit 1', r.code === 1 && r.out.includes('3 项'), JSON.stringify(r));
+}
+
+for (const d of fs.readdirSync(os.tmpdir()).filter((f) => f.startsWith('rule-budget-'))) {
+  try { fs.rmSync(path.join(os.tmpdir(), d), { recursive: true, force: true }); } catch { /* Windows 文件锁容忍 */ }
+}
+
+console.log(`\n合计: PASS ${pass} / FAIL ${fail}`);
+process.exit(fail ? 1 : 0);

package/templates/_agents/scripts/solidify-task.mjs

@@ -45,7 +45,9 @@ const classify = (content) => {
 
 function run() {
   const { topic, root, delegated, auto } = parseArgs();
-  const draftsDir = path.join(root, '.zcode', 'drafts');
+  // 草稿暂存区 = .zcode/workflow-drafts（宿主保存工作流草稿的实际目录；
+  // 2026-10-16 自源仓 8deb032b 回灌纠正：原 .zcode/drafts 自引入起从未存在，脚本一跑即 fail）
+  const draftsDir = path.join(root, '.zcode', 'workflow-drafts');
   if (!fs.existsSync(draftsDir)) fail(`草稿目录 ${draftsDir} 不存在`);
   const files = fs.readdirSync(draftsDir).filter((f) => f.includes(topic) && f.endsWith('.md'));
   if (!files.length) fail(`在 ${draftsDir} 中未找到主题为 ${topic} 的草稿文件`);

package/templates/_agents/scripts/solidify-task.test.mjs

@@ -35,7 +35,7 @@ const mkfix = () => {
     fs.mkdirSync(path.join(d, 'workflow', s), { recursive: true });
   }
   fs.mkdirSync(path.join(d, '.agents'), { recursive: true });
-  fs.mkdirSync(path.join(d, '.zcode', 'drafts'), { recursive: true });
+  fs.mkdirSync(path.join(d, '.zcode', 'workflow-drafts'), { recursive: true });
   fs.writeFileSync(path.join(d, '.agents', 'workflow-enums.txt'), ENUMS_FIXTURE);
   fs.writeFileSync(path.join(d, '.agents', 'workflow-modules.txt'), '# modules\npipeline\nui\n');
   return d;
@@ -57,7 +57,7 @@ const migratedPath = (root) => path.join(root, 'workflow', 'intents', `${TODAY}-
 // T1：默认只迁移不落账
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-task.md'), DRAFT('demo'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-task.md'), DRAFT('demo'));
   const r = run(d, ['--topic', 'demo', '--root', d]);
   check('T1 默认迁移成功 exit 0', r.code === 0, r.out);
   check('T1 草稿已迁移到 intents 且日期前缀正确',
@@ -68,7 +68,7 @@ const migratedPath = (root) => path.join(root, 'workflow', 'intents', `${TODAY}-
 // T2：--delegated 原话原样转发
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-task.md'), DRAFT('demo'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-task.md'), DRAFT('demo'));
   const r = run(d, ['--topic', 'demo', '--root', d, '--delegated', '固化了可以']);
   check('T2 --delegated 流程 exit 0', r.code === 0, r.out);
   const lines = ledgerLines(d);
@@ -81,7 +81,7 @@ const migratedPath = (root) => path.join(root, 'workflow', 'intents', `${TODAY}-
 // T3：--auto 在 Strict（缺 trust-mode.json）下被拒 → 失败计数并 exit 1
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-task.md'), DRAFT('demo'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-task.md'), DRAFT('demo'));
   const r = run(d, ['--topic', 'demo', '--root', d, '--auto']);
   check('T3 --auto 在缺省 Strict 下 exit 1（不吞失败）', r.code === 1, r.out);
   check('T3 输出含失败汇总', r.out.includes('确认汇总') && r.out.includes('失败'), r.out);
@@ -90,28 +90,28 @@ const migratedPath = (root) => path.join(root, 'workflow', 'intents', `${TODAY}-
 // T4：缺草稿 → exit 1
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'other.md'), DRAFT('other'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'other.md'), DRAFT('other'));
   const r = run(d, ['--topic', 'nope', '--root', d]);
   check('T4 缺主题草稿 exit 1 且带指引', r.code === 1 && r.out.includes('未找到主题'), r.out);
 }
 // T5：草稿非可识别文档 → exit 1
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-note.md'), '# 随手笔记\nnot a workflow doc\n');
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-note.md'), '# 随手笔记\nnot a workflow doc\n');
   const r = run(d, ['--topic', 'demo', '--root', d]);
   check('T5 无可识别文档 exit 1', r.code === 1 && r.out.includes('未找到可识别'), r.out);
 }
 // T6：--delegated 与 --auto 互斥 → exit 1
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-task.md'), DRAFT('demo'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-task.md'), DRAFT('demo'));
   const r = run(d, ['--topic', 'demo', '--root', d, '--delegated', 'x', '--auto']);
   check('T6 互斥 exit 1', r.code === 1 && r.out.includes('互斥'), r.out);
 }
 // T7：失败路径退出码传播（确认失败后 exit 1，不吞）
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-task.md'), DRAFT('demo'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-task.md'), DRAFT('demo'));
   // 让确认失败：用 --auto 触发 Strict 拒绝（缺 trust-mode.json 即 Strict）。
   const r = run(d, ['--topic', 'demo', '--root', d, '--auto']);
   check('T7 失败后 exit 1 且索引仍生成', r.code === 1 && fs.existsSync(path.join(d, 'workflow', 'INDEX.md')), r.out);
@@ -119,11 +119,11 @@ const migratedPath = (root) => path.join(root, 'workflow', 'intents', `${TODAY}-
 // T8：索引更新失败传播退出码（独立于确认失败路径——删除 workflow/plans 目录使 gen-workflow-index 失败）
 {
   const d = mkfix();
-  fs.writeFileSync(path.join(d, '.zcode', 'drafts', 'demo-task.md'), DRAFT('demo'));
+  fs.writeFileSync(path.join(d, '.zcode', 'workflow-drafts', 'demo-task.md'), DRAFT('demo'));
   fs.rmSync(path.join(d, 'workflow', 'plans'), { recursive: true });
   const r = run(d, ['--topic', 'demo', '--root', d]);
   check('T8 索引更新失败 exit 1 且输出指明', r.code === 1 && r.out.includes('索引更新失败'), r.out);
 }
 
-console.log(`\n${fail ? `❌ ${fail} failed` : '✅ all passed'}（${pass} passed）`);
+console.log(`\n合计: PASS ${pass} / FAIL ${fail}`);
 process.exit(fail ? 1 : 0);

package/templates/_agents/scripts/trust-mode.test.mjs

@@ -106,5 +106,5 @@ const DRAFT = (level = 'L1') => `---\n状态: draft\n级别: ${level}\nrisk_leve
     `${r.stdout}${r.stderr}\n${lines.join('|')}`);
 }
 
-console.log(`\n${fail ? `❌ ${fail} failed` : '✅ all passed'}（${pass} passed）`);
+console.log(`\n合计: PASS ${pass} / FAIL ${fail}`);
 process.exit(fail ? 1 : 0);