@modusensus/dsh-mneme 0.8.15 → 0.8.16

package/test/contrast.test.js

@@ -0,0 +1,314 @@
+import test from "node:test";
+import assert from "node:assert/strict";
+import { readFileSync } from "node:fs";
+import { dirname, join } from "node:path";
+import { fileURLToPath } from "node:url";
+
+// #178 的回归锁：面板正文色的对比度。
+//
+// 为什么是硬编码快照而不是现场读宿主：CI runner 上没有 DSH 安装（没有
+// app.asar），宿主 token 表根本读不到；而这条锁要在 CI 上拦住「面板又用回了
+// 一个低对比度的宿主 token」。所以把面板实际引用到的宿主 token 浅/深取值抄成
+// 快照（2026-10 取自 DSH app.asar 的 token 表：body = 浅色、
+// body[data-ds-dark-theme] = 深色、:root = 两主题同值），锁的是**面板自己的
+// 用法**，宿主改色不会让这条锁变红。
+//
+// 面板的坑有两层，这条锁两层都咬：
+//   ① 宿主 token 在浅色下给正文只有 1.26–4.49 的对比度（label-tertiary 50 处、
+//      label-dimmed 4 处），照抄宿主名就等于照抄不合规——注意这两个名字**都是
+//      真实存在的**宿主 token，只是宿主把它们定位成分隔线/占位符的低对比层；
+//   ② 面板还长期引用 5 个**根本不存在的**宿主名（--dsw-alias-state-error /
+//      -warning / -success / -warn / --dsw-alias-border），
+//      于是吃的一直是写在 fallback 里的硬编码色。所以除了比值，还要锁「引用到的
+//      宿主名必须真实存在」。
+//
+// 修法是面板自有的语义色层（--mneme-*，定义在 .mneme-x 等四个渲染根上），
+// 混色基准仍是宿主 token，宿主换肤时跟着走。见 lib/client.js 里那段注释。
+
+const root = join(dirname(fileURLToPath(import.meta.url)), "..");
+const clientSource = readFileSync(join(root, "lib/client.js"), "utf8");
+
+const HOST_TOKENS = {
+  "--dsw-alias-label-primary": { light: "#0f1115", dark: "#f9fafb" },
+  "--dsw-alias-label-secondary": { light: "#61666b", dark: "#cfd3d6" },
+  "--dsw-alias-label-tertiary": { light: "#81858c", dark: "#adb2b8" },
+  // 真名，不是幻影：宿主确有 --dsw-alias-label-dimmed（指向 static-neutral-bluish-200
+  // / -750）。它留在快照里是为了让存在性锁**不**把它当幻影报错——该拦的是「拿它当
+  // 正文/图形色」的用法，那由上面的比值锁负责。
+  "--dsw-alias-label-dimmed": { light: "#e1e5ee", dark: "#43454a" },
+  "--dsw-alias-state-business-primary": { light: "#4176e6", dark: "#7aaaff" },
+  "--dsw-alias-state-error-primary": { light: "#ec1313", dark: "#f25a5a" },
+  "--dsw-alias-bg-layer-1": { light: "#ffffff", dark: "#232324" },
+  "--dsw-alias-bg-layer-2": { light: "#ffffff", dark: "#2c2c2e" },
+  "--dsw-alias-bg-base": { light: "#ffffff", dark: "#151517" },
+  "--dsw-alias-button-elevated-fill": { light: "#ffffff", dark: "#43454a" },
+  "--dsw-alias-border-l1": { light: "#0000000a", dark: "#ffffff0f" },
+  "--dsw-alias-border-l2": { light: "#0000001a", dark: "#ffffff1f" },
+  "--dsw-alias-interactive-bg-hover": { light: "#2631480f", dark: "#ffffff14" },
+  "--dsw-alias-interactive-bg-active": { light: "#2631481a", dark: "#ffffff24" },
+  "--dsw-alias-scrollbar-bg-l2": { light: "#e5e5e5", dark: "#545557" },
+  "--dsw-alias-scrollbar-hover-l2": { light: "#d4d4d4", dark: "#65676b" },
+  "--dsw-static-amber-600": { light: "#dd8629", dark: "#dd8629" },
+  "--dsw-static-green-500": { light: "#22c55e", dark: "#22c55e" },
+  // 真实存在但**不是颜色**的宿主 token：只参与上面的「名字必须存在」检查。
+  "--dsw-radius-md": { light: null, dark: null },
+  "--dsw-focus-ring-width": { light: null, dark: null },
+  "--dsw-focus-ring-color": { light: "transparent", dark: "transparent" }
+};
+
+/* ---------- 从面板产物里切出 CSS 块 ---------- */
+const cssStart = clientSource.indexOf("const css = [");
+const cssEnd = clientSource.indexOf('].join("\\n");', cssStart);
+assert.ok(cssStart > 0 && cssEnd > cssStart, "lib/client.js 里找不到 CSS 数组（切片锚点变了？）");
+const cssBlock = clientSource.slice(cssStart, cssEnd);
+
+const rules = [];
+for (const m of cssBlock.matchAll(/"((?:[^"\\]|\\.)*)"/g)) {
+  const s = m[1].replace(/\\"/g, '"');
+  if (!s.includes("{")) continue;
+  const rm = /^([^{]+)\{([^}]*)\}$/.exec(s.trim());
+  if (rm) rules.push({ sel: rm[1].trim(), body: rm[2] });
+}
+
+/* ---------- 颜色数学（alpha 合成，不是「和白底混」） ---------- */
+function parseColor(c) {
+  let m;
+  if ((m = /^#([0-9a-fA-F]{3,8})$/.exec(String(c).trim()))) {
+    let s = m[1];
+    if (s.length === 3 || s.length === 4) s = s.split("").map((x) => x + x).join("");
+    return [
+      parseInt(s.slice(0, 2), 16), parseInt(s.slice(2, 4), 16), parseInt(s.slice(4, 6), 16),
+      s.length === 8 ? parseInt(s.slice(6, 8), 16) / 255 : 1
+    ];
+  }
+  if ((m = /^rgba?\(\s*([\d.]+)[\s,]+([\d.]+)[\s,]+([\d.]+)(?:[\s,/]+([\d.]+%?))?\s*\)$/.exec(String(c).trim()))) {
+    const a = m[4] === undefined ? 1 : m[4].endsWith("%") ? parseFloat(m[4]) / 100 : parseFloat(m[4]);
+    return [+m[1], +m[2], +m[3], a];
+  }
+  return null;
+}
+// 半透明前景必须真的叠到底色上再算比值：早期审计脚本拿「和白底混」量深色主题，
+// 把 --dsw-alias-label-primary 60% 算成 15.36 的假高分（真实值 6.30）。
+function composite(top, bottom) {
+  const a = top[3] + bottom[3] * (1 - top[3]);
+  const f = (i) => (top[i] * top[3] + bottom[i] * bottom[3] * (1 - top[3])) / (a || 1);
+  return [f(0), f(1), f(2), a];
+}
+function luminance([r, g, b]) {
+  const [x, y, z] = [r, g, b].map((v) => {
+    const s = v / 255;
+    return s <= 0.03928 ? s / 12.92 : ((s + 0.055) / 1.055) ** 2.4;
+  });
+  return 0.2126 * x + 0.7152 * y + 0.0722 * z;
+}
+function contrast(fg, bg) {
+  const a = luminance(composite(fg, bg));
+  const b = luminance(bg);
+  const [hi, lo] = [a, b].sort((p, q) => q - p);
+  return (hi + 0.05) / (lo + 0.05);
+}
+
+/* ---------- 解析：宿主快照 + 面板自己的语义色层 ---------- */
+const TOKENS = new Map();
+for (const [name, v] of Object.entries(HOST_TOKENS)) TOKENS.set(name, v);
+
+// 面板语义色层是一条由多个字符串字面量拼起来的规则，不出现在上面的 rules 里，
+// 所以按拼好的文本再读一次。
+const joined = [...cssBlock.matchAll(/"((?:[^"\\]|\\.)*)"/g)].map((m) => m[1].replace(/\\"/g, '"')).join("");
+const layerM = /([^{}]*)\{[^{}]*--mneme-fg-dim\s*:[^{}]*\}/.exec(joined);
+assert.ok(layerM, "找不到面板语义色层（--mneme-* 定义），四个渲染根那条规则被删了？");
+const layer = { sel: layerM[1].split("}").pop().trim(), body: layerM[0].slice(layerM[0].indexOf("{")) };
+for (const g of layer.body.matchAll(/(--mneme-[a-z0-9-]+)\s*:\s*([^;}]+)/g)) {
+  TOKENS.set(g[1], { light: g[2].trim(), dark: g[2].trim() });
+}
+
+// 先把 var()/color-mix() 逐层折成字符串，再交给 colorOf 解析成 RGBA。
+// 之所以不用「一个递归函数同时返回数组和字符串」：字符串替换里塞数组会被打散。
+function resolveValue(raw, theme) {
+  let v = String(raw).trim().replace(/!important$/, "").trim();
+  let changed = true;
+  for (let guard = 0; changed && guard < 20; guard++) {
+    changed = false;
+    v = v.replace(/var\(\s*(--[a-z0-9-]+)\s*(?:,\s*([^()]*(?:\([^()]*\)[^()]*)*))?\)/g, (_, tok, fb) => {
+      const e = TOKENS.get(tok);
+      const inner = e ? resolveValue(e[theme], theme) : null;
+      if (inner) { changed = true; return inner; }
+      if (fb) { changed = true; return fb.trim(); }
+      return "\u00acMISSING\u00ac";
+    });
+  }
+  return v.includes("\u00acMISSING\u00ac") ? null : v.trim();
+}
+function colorOf(raw, theme) {
+  const v = resolveValue(raw, theme);
+  if (v === null) return null;
+  let m = /^color-mix\(\s*in\s+srgb\s*,\s*(.+?)\s+([\d.]+)%\s*,\s*transparent\s*\)$/.exec(v);
+  if (m) {
+    const base = colorOf(m[1], theme);
+    if (!base) return null;
+    return [...base.slice(0, 3), base[3] * (parseFloat(m[2]) / 100)];
+  }
+  m = /^color-mix\(\s*in\s+srgb\s*,\s*(.+?)\s+([\d.]+)%\s*,\s*(.+?)\s*\)$/.exec(v);
+  if (m) {
+    const a = colorOf(m[1], theme);
+    const b = colorOf(m[3], theme);
+    if (!a || !b) return null;
+    const p = parseFloat(m[2]) / 100;
+    return [...a.slice(0, 3).map((x, i) => x * p + b[i] * (1 - p)), a[3] * p + b[3] * (1 - p)];
+  }
+  return parseColor(v);
+}
+
+/* ---------- 底色：按类名找它自己的 background ---------- */
+const BG_BY_CLASS = new Map();
+for (const r of rules) {
+  const bg = /(?:^|;)\s*background(?:-color)?\s*:\s*([^;]+)/.exec(r.body);
+  if (!bg) continue;
+  for (const c of r.sel.matchAll(/\.([a-z0-9-]+)/gi)) {
+    const k = c[1].toLowerCase();
+    if (!BG_BY_CLASS.has(k)) BG_BY_CLASS.set(k, []);
+    BG_BY_CLASS.get(k).push({ val: bg[1].trim(), sel: r.sel });
+  }
+}
+const THEME_BG = { light: "#ffffff", dark: "#232324" }; // --dsw-alias-bg-layer-1
+function backgroundOf(sel, theme) {
+  const base = parseColor(THEME_BG[theme]);
+  const own = [];
+  for (const c of sel.matchAll(/\.([a-z0-9-]+)/gi)) {
+    for (const e of BG_BY_CLASS.get(c[1].toLowerCase()) ?? []) {
+      if (!/hover|active|focus|disabled/.test(e.sel)) own.push(e);
+    }
+  }
+  for (const e of own) {
+    const v = colorOf(e.val, theme);
+    if (v) return v[3] < 1 ? composite(v, base) : v;
+  }
+  return base;
+}
+
+/* ---------- 逐条算 ---------- */
+const failures = [];
+let audited = 0;
+for (const r of rules) {
+  const colM = /(?:^|;)\s*color\s*:\s*([^;]+)/.exec(r.body);
+  if (!colM) continue;
+  if (/::(before|after)/.test(r.sel)) continue;
+  const fsM = /font-size\s*:\s*([\d.]+)px/.exec(r.body);
+  const fwM = /font-weight\s*:\s*([\d]+|bold|normal)/.exec(r.body);
+  const fs = fsM ? +fsM[1] : 13;
+  const fw = fwM ? (/bold/.test(fwM[1]) ? 700 : fwM[1] === "normal" ? 400 : +fwM[1]) : 400;
+  const need = fs >= 24 || (fs >= 18.66 && fw >= 700) ? 3 : 4.5;
+  for (const theme of ["light", "dark"]) {
+    const fg = colorOf(colM[1], theme);
+    // 解析不出来**不算通过**：面板 CSS 块里的 color 全是 hex/rgb/var/color-mix
+    // （没有 inherit/currentColor 之类的关键字），所以 null 只可能意味着引用了
+    // 不存在的 token 或写了个解析器不认识的值——那正是要拦的东西。若在这里
+    // `continue`，把一条声明改成 `color:var(--mneme-unknown)` 就能静默溜过，
+    // 剩下的声明仍然够 audited >= 200。
+    if (!fg) {
+      failures.push(`${theme} ${r.sel} 颜色解析失败：${colM[1].trim()}`);
+      continue;
+    }
+    audited++;
+    const cr = contrast(fg, backgroundOf(r.sel, theme));
+    if (cr < need) {
+      failures.push(`${theme} ${r.sel} ${fs}px/${fw} = ${cr.toFixed(2)} < ${need}（${colM[1].trim()}）`);
+    }
+  }
+}
+
+test("面板每个 color 声明在浅/深两主题下都达到 WCAG AA（#178 主锁）", () => {
+  assert.ok(audited >= 200, `审计到的 color 声明太少（${audited}），CSS 切片或解析器可能失效了`);
+  assert.deepEqual(failures, [], "以下声明对比度不足：\n" + failures.join("\n"));
+});
+
+// 幻影 token 的回归锁：面板曾经引用 5 个宿主里不存在的名字，于是长年吃 fallback
+// 里的硬编码色（换肤不跟随、深色主题翻车）。这条锁不看比值、只看名字是否存在，
+// 因此将来任何「顺手写个听起来合理的 --dsw-* 名」都会被拦下。
+test("面板引用的宿主 token 必须真实存在（幻影 token 回归锁）", () => {
+  // 只扫真实声明：CSS 数组里夹着 JS 注释，注释里会提到被修掉的旧名。
+  const declared = cssBlock.split("\n").filter((l) => !/^\s*\/\//.test(l)).join("\n");
+  const referenced = new Set([...declared.matchAll(/--dsw-[a-z0-9-]+/g)].map((m) => m[0]));
+  const unknown = [...referenced].filter((n) => !(n in HOST_TOKENS));
+  assert.deepEqual(unknown, [], "面板引用了宿主快照里没有的 token（幻影名或快照过期）：" + unknown.join(", "));
+});
+
+// 变量层必须挂满四个渲染根：面板不只长在 .mneme-x 下——记忆库 sheet portal 到
+// body（.mneme-overlay）、侧边栏入口在宿主插槽（.mneme-triggerwrap）、顶部入口
+// portal 到宿主侧边栏（.mneme-topentry）。少挂一个，那个根下的文字就退回宿主的
+// 低对比度 token，而且上面的主锁**照样全绿**（主锁只算颜色，不知道变量有没有继承到）。
+test("面板语义色层覆盖四个渲染根", () => {
+  const sel = layer.sel;
+  assert.equal(sel, ".mneme-x,.mneme-overlay,.mneme-triggerwrap,.mneme-topentry");
+});
+
+// 图形色的对比度（WCAG 1.4.11，非文字 3:1）。上面那条主锁只看 `color:`，
+// 而「颜色就是信息」的地方用的是 `background:` / `stroke:`——热度条、热度点、
+// 打卡点、关系图连线。它们此前用宿主的 label-dimmed（浅 1.26 / 深 1.45），
+// 等于把三档热度画成同一个看不见的灰。谁把它们改回去，主锁不会响，这条会。
+const GRAPHICS = [
+  { sel: ".mneme-heatbar--hot", prop: "background" },
+  { sel: ".mneme-heatbar--warm", prop: "background" },
+  { sel: ".mneme-heatbar--cold", prop: "background" },
+  { sel: ".mneme-heatdot--hot", prop: "background" },
+  { sel: ".mneme-heatdot--warm", prop: "background" },
+  { sel: ".mneme-heatdot--cold", prop: "background" },
+  { sel: ".mneme-wbdot", prop: "background" },
+  { sel: ".mneme-wbdot--err", prop: "background" },
+  { sel: ".mneme-gedge", prop: "stroke" },
+  // Token 去向三屏（2026-10）：donut 弧（stroke）、图例色点与 7 天柱（background）
+  // 都是「颜色就是信息」的图形——弧长/点位承载比例语义，掉回浅灰等于白画。
+  // 零值热力格（interactive-bg-hover 轨道）与 heatbar 同理不在此列。
+  { sel: ".mneme-seg--1", prop: "stroke" },
+  { sel: ".mneme-seg--2", prop: "stroke" },
+  { sel: ".mneme-seg--3", prop: "stroke" },
+  { sel: ".mneme-seg--4", prop: "stroke" },
+  { sel: ".mneme-seg--5", prop: "stroke" },
+  { sel: ".mneme-seg--6", prop: "stroke" },
+  { sel: ".mneme-dot--1", prop: "background" },
+  { sel: ".mneme-dot--2", prop: "background" },
+  { sel: ".mneme-dot--3", prop: "background" },
+  { sel: ".mneme-dot--4", prop: "background" },
+  { sel: ".mneme-dot--5", prop: "background" },
+  { sel: ".mneme-dot--6", prop: "background" },
+  { sel: ".mneme-bar", prop: "background" },
+  { sel: ".mneme-heatcell.l1", prop: "background" },
+  { sel: ".mneme-heatcell.l2", prop: "background" },
+  { sel: ".mneme-heatcell.l3", prop: "background" },
+  { sel: ".mneme-heatcell.l4", prop: "background" }
+];
+test("图形色（热度/打卡/连线）在浅深两主题下都达到 3:1", () => {
+  const bySel = new Map(rules.map((r) => [r.sel, r]));
+  const problems = [];
+  for (const g of GRAPHICS) {
+    const r = bySel.get(g.sel);
+    if (!r) { problems.push(`${g.sel} 规则没了`); continue; }
+    const m = new RegExp(`(?:^|;)\\s*${g.prop}\\s*:\\s*([^;]+)`).exec(r.body);
+    if (!m) { problems.push(`${g.sel} 没有 ${g.prop}`); continue; }
+    for (const theme of ["light", "dark"]) {
+      const fg = colorOf(m[1], theme);
+      if (!fg) { problems.push(`${g.sel} 解析不出颜色：${m[1]}`); continue; }
+      // 热度条画在它自己的轨道（interactive-bg-hover）上，其余直接压在画布上。
+      let bg = parseColor(THEME_BG[theme]);
+      if (/heatbar/.test(g.sel)) {
+        const track = colorOf("var(--dsw-alias-interactive-bg-hover)", theme);
+        if (track) bg = composite(track, bg);
+      }
+      const cr = contrast(fg, bg);
+      if (cr < 3) problems.push(`${theme} ${g.sel} ${cr.toFixed(2)} < 3（${m[1].trim()}）`);
+    }
+  }
+  assert.deepEqual(problems, [], "图形色对比度不足：\n" + problems.join("\n"));
+});
+
+// 虚线关系边曾经在 .mneme-gedge-dashed 上再叠一层 opacity:.7，把已经只有 50% 的
+// 描边压到浅色 2.28（低于图形 3:1）。上面那条图形锁只读单条规则自己的 stroke，
+// 看不到「同一条边同时命中两条规则、其中一条在降透明度」这种叠加，所以单独锁一层：
+// 虚线态只允许用 dash 图案区分，不许再动透明度。
+test("虚线关系边不得靠降低不透明度区分", () => {
+  const dashed = rules.find((r) => r.sel === ".mneme-gedge-dashed");
+  assert.ok(dashed, ".mneme-gedge-dashed 规则没了（虚线态怎么区分无 memory_id 的边？）");
+  const op = /(?:^|;)\s*opacity\s*:\s*([^;]+)/.exec(dashed.body);
+  assert.equal(op, null, `虚线边又叠了 opacity（${op?.[1].trim()}）：50% 描边乘上它会在浅色画布跌破 3:1`);
+  assert.match(dashed.body, /stroke-dasharray/, "虚线态丢了 dash 图案，就和实线边分不出来了");
+});

package/test/dream-merge-guardrail.test.js

@@ -0,0 +1,219 @@
+import test from "node:test";
+import assert from "node:assert/strict";
+import { createStore } from "../src/store.js";
+import { createService } from "../src/service.js";
+import { Config } from "../src/config.js";
+import { createSettings } from "../src/settings.js";
+import { createDreamScheduler, validateDecisions } from "../src/dream.js";
+import { mockCtx } from "./helpers/dream-mock.js";
+
+// 回归（#135 成本审计派生）：merge 决策的单轮数量闸 dreamMaxMergePerRun。
+//
+// 为什么需要这道闸：merge 是巩固里唯一**回吐正文**的动作——每条 merge 都要求模型
+// 重新写出合并后的 content（实测 2113 条 merge 平均 550 字符/条），而 keep /
+// archive / conflict 都不带正文。单轮 merge 数因此是「输出里正文占比」唯一可控的
+// 杠杆。此前 update(2) / create(5) / archive(8) 都有上限，唯独 merge 没有。
+//
+// 闸门形态与现有三道**完全一致**：全局信号，skipInvalid 也不豁免，超限整单拒绝。
+// 这一点是本文件的锁点之一——若有人把 merge 闸改成「逐条跳过」，就与另外三道闸
+// 的语义分叉了，而超限（模型一轮要合并几十条）恰恰是整体失控信号，必须整单拒绝。
+//
+// 默认值 40 的校准依据（只读探针：全库 246 轮 / 近 10 天 88 轮 dream_runs.decisions）：
+//   每轮 merge 数  全库 p50 7 / p90 15 / p99 28 / max 39
+//                  近 10 天 p50 9 / p90 20 / p99 39 / max 39
+// 取 40 = 观测分布上沿（历史命中 0/246），与 archive 闸默认 8 恰为其 p90=max 同
+// 一校准法：面向未来的尾险护栏，不是成本削减工具。刻意保守的理由是代价不对称：
+// 整单拒绝 = run 记 failed = 调度器不刷新 baseline（src/dream.js:905-915）=
+// 下一次写入用同一批输入重跑，一次误伤约等于该轮成本 ×2。
+//
+// 相关但**不是**本闸目标的实测事实（防后人误用本闸去省 token）：dream_consolidate
+// 的输出 token 里只有约 11.8% 是决策正文，其余是推理与 JSON 骨架，那部分由
+// dreamReasoningEffort / 模型选择决定，调 merge 上限影响不到。
+
+function snap(entries) {
+  return new Map(
+    entries.map(([id, type]) => [
+      id,
+      { id, type, title: `t-${id}`, content: `c-${id}`, importance: 3, archived: false, forgotten: false }
+    ])
+  );
+}
+
+/** 造 n 条互不相干的普通类型记忆，配对成 merge（每条 merge 需要 title+content）。 */
+function mergeDecisions(n) {
+  const entries = Array.from({ length: n * 2 }, (_, i) => [`m${i}`, "project"]);
+  const decisions = [];
+  for (let i = 0; i < n; i += 1) {
+    decisions.push({
+      action: "merge",
+      ids: [`m${2 * i}`, `m${2 * i + 1}`],
+      title: `merged-${i}`,
+      content: `合并后的正文 ${i}`,
+      keepSource: `m${2 * i}`
+    });
+  }
+  return { entries, decisions };
+}
+
+// ---------------------------------------------------------- 数量闸（纯函数）
+
+test("#135-cost: merge count above the cap rejects the whole batch (global gate)", () => {
+  const { entries, decisions } = mergeDecisions(41);
+  const s = snap(entries);
+  const { ok, errors } = validateDecisions(decisions, s, { skipInvalid: true });
+  assert.equal(ok, false, "41 merges > default cap 40 → reject even under skipInvalid");
+  assert.ok(
+    errors.some((e) => e.includes("too many merge decisions")),
+    `cap error present, got: ${errors.join("; ")}`
+  );
+});
+
+test("#135-cost: merge count at the cap passes (boundary is inclusive)", () => {
+  const { entries, decisions } = mergeDecisions(40);
+  const s = snap(entries);
+  const { ok, errors } = validateDecisions(decisions, s, { skipInvalid: true });
+  assert.equal(ok, true, `exactly 40 merges is allowed, got: ${errors.join("; ")}`);
+});
+
+test("#135-cost: merge cap is configurable and defaults to the observed upper bound (40)", () => {
+  const { entries, decisions } = mergeDecisions(41);
+  const s = snap(entries);
+  // 默认值本身是本次改动的契约：实测分布上沿 39 → 闸门取 40。
+  const raised = validateDecisions(structuredClone(decisions), s, { skipInvalid: true, maxMergePerRun: 60 });
+  assert.equal(raised.ok, true, `raised cap lets the batch through, got: ${raised.errors.join("; ")}`);
+  const lowered = validateDecisions(structuredClone(decisions), s, { skipInvalid: true, maxMergePerRun: 20 });
+  assert.equal(lowered.ok, false, "lowered cap catches the same batch");
+});
+
+test("#135-cost: merge cap does not fire on ordinary runs (calibrated to the tail, not the median)", () => {
+  // p90 = 15、p99 = 28：常态与「偏大但正常」的轮都不该被拦。若有人把默认值调到
+  // p90 附近（用覆盖换成本），这条用例会红——这是刻意的：默认值必须落在尾险区。
+  for (const n of [7, 15, 28, 39]) {
+    const { entries, decisions } = mergeDecisions(n);
+    const { ok, errors } = validateDecisions(decisions, snap(entries), { skipInvalid: true });
+    assert.equal(ok, true, `${n} merges (within observed distribution) must pass, got: ${errors.join("; ")}`);
+  }
+});
+
+test("#135-cost: merge cap is independent of the other three caps", () => {
+  // 31 条 merge + 1 条 update + 1 条 archive：三道老闸都在限内，只有 merge 超限时
+  // 才应该报 merge 的错——确认新闸不是被别的计数顺带触发的。
+  const { entries, decisions } = mergeDecisions(41);
+  const s = snap([...entries, ["u1", "project"], ["a1", "decision"]]);
+  const all = [
+    ...decisions,
+    { action: "update", ids: ["u1"], changes: { title: "改标题" } },
+    { action: "archive", ids: ["a1"], reason: "重复或过时" }
+  ];
+  const { ok, errors } = validateDecisions(all, s, { skipInvalid: true });
+  assert.equal(ok, false);
+  assert.ok(errors.some((e) => e.includes("too many merge decisions")));
+  assert.equal(errors.some((e) => e.includes("too many update decisions")), false, "update cap must not fire");
+  assert.equal(errors.some((e) => e.includes("too many archive decisions")), false, "archive cap must not fire");
+});
+
+// ---------------------------------------------------------- 配置面（schema + 白名单成对）
+
+test("#135-cost: dreamMaxMergePerRun defaults to 40 and clamps to [1, 200]", () => {
+  assert.equal(Config({}).dreamMaxMergePerRun, 40, "default = observed upper bound of merge-per-run distribution");
+  assert.equal(Config({ dreamMaxMergePerRun: 1 }).dreamMaxMergePerRun, 1, "lower bound accepted");
+  assert.equal(Config({ dreamMaxMergePerRun: 200 }).dreamMaxMergePerRun, 200, "upper bound accepted");
+  assert.throws(() => Config({ dreamMaxMergePerRun: 0 }), "zero rejected");
+  assert.throws(() => Config({ dreamMaxMergePerRun: 201 }), "above max rejected");
+});
+
+test("#135-cost: dreamMaxMergePerRun is in the settings whitelist with the same bounds as the schema", () => {
+  // 新配置键必须 config.js schema 与 settings.js 白名单成对出现（AGENTS.md 自查清单 2）。
+  // 走公开的 setFeatureFlags 路径：validateFlag 是 settings.js 的模块内私有函数，
+  // 而「键不在白名单 → 静默丢弃、不报错」正是这条用例要防的失败模式。
+  const store = createStore(":memory:");
+  const settings = createSettings(store.db);
+  assert.deepEqual(settings.getFeatureFlags(), {}, "nothing stored initially");
+  assert.equal(settings.setFeatureFlags({ dreamMaxMergePerRun: 40 }).dreamMaxMergePerRun, 40, "whitelisted");
+  assert.equal(settings.getFeatureFlags().dreamMaxMergePerRun, 40, "persisted and re-read");
+  assert.throws(
+    () => settings.setFeatureFlags({ dreamMaxMergePerRun: 0 }),
+    /must be an integer in \[1, 200\]/
+  );
+  assert.throws(
+    () => settings.setFeatureFlags({ dreamMaxMergePerRun: 201 }),
+    /must be an integer in \[1, 200\]/
+  );
+  assert.throws(() => settings.setFeatureFlags({ dreamMaxMergePerRun: 1.5 }), /must be an integer/);
+  // 越界被拒后不得留下脏值。
+  assert.equal(settings.getFeatureFlags().dreamMaxMergePerRun, 40, "rejected write did not corrupt the stored value");
+  store.close();
+});
+
+// ---------------------------------------------------------- 端到端（runDream）
+
+test("#135-cost: runDream rejects a runaway merge batch and leaves the memories untouched", async () => {
+  const store = createStore(":memory:");
+  const service = createService({ store, mirror: null, config: {} });
+  // 84 条普通记忆 → 42 对 merge，超过默认闸 40。
+  for (let i = 0; i < 84; i += 1) {
+    service.saveWithDedupe({ type: "project", title: `记忆 ${i}`, content: `正文 ${i}`, importance: 3 });
+  }
+  const ctx = mockCtx({
+    onConsolidation: (listText) => {
+      const ids = [...listText.matchAll(/id=([^\s|]+)/g)].map((m) => m[1]);
+      const decisions = [];
+      for (let i = 0; i + 1 < ids.length; i += 2) {
+        decisions.push({
+          action: "merge",
+          ids: [ids[i], ids[i + 1]],
+          title: `合并 ${i}`,
+          content: `合并后的正文 ${i}`,
+          keepSource: ids[i]
+        });
+      }
+      return JSON.stringify(decisions);
+    }
+  });
+  const dream = createDreamScheduler({ thresholdCount: 1, thresholdChars: 0, delayMs: 0 });
+  const result = await dream.runDream(ctx, service, { dreamProvider: "deepseek", dreamModel: "deepseek-chat" });
+  assert.equal(result.ok, false, "42 merges > cap 40 → run fails as a whole");
+  assert.match(result.error, /invalid decisions/);
+  // 整单拒绝 = 一条都没落：merge 不得半途生效（这正是「全局闸门」与「逐条跳过」的区别）。
+  // 注意 service.all() 含已归档行，所以必须数「未归档」的条数：merge 生效会把 source
+  // 置 archived，84 条里若有任何一条落了，未归档数就会掉下来。
+  assert.equal(service.all().filter((m) => !m.archived).length, 84, "no memory was merged away");
+  const audit = store.listDreamRuns().at(-1);
+  assert.equal(audit.status, "failed");
+  // decisions 是 store 层已 JSON.parse 的列，序列化后查错误串（_validationFailed 哨兵）。
+  assert.match(JSON.stringify(audit.decisions), /too many merge decisions/);
+  store.close();
+});
+
+test("#135-cost: runDream lands a merge batch below the cap", async () => {
+  const store = createStore(":memory:");
+  const service = createService({ store, mirror: null, config: {} });
+  for (let i = 0; i < 20; i += 1) {
+    service.saveWithDedupe({ type: "project", title: `记忆 ${i}`, content: `正文 ${i}`, importance: 3 });
+  }
+  const ctx = mockCtx({
+    onConsolidation: (listText) => {
+      const ids = [...listText.matchAll(/id=([^\s|]+)/g)].map((m) => m[1]);
+      const decisions = [];
+      for (let i = 0; i + 1 < ids.length; i += 2) {
+        decisions.push({
+          action: "merge",
+          ids: [ids[i], ids[i + 1]],
+          title: `合并 ${i}`,
+          content: `合并后的正文 ${i}`,
+          keepSource: ids[i]
+        });
+      }
+      return JSON.stringify(decisions);
+    }
+  });
+  const dream = createDreamScheduler({ thresholdCount: 1, thresholdChars: 0, delayMs: 0 });
+  const result = await dream.runDream(ctx, service, { dreamProvider: "deepseek", dreamModel: "deepseek-chat" });
+  assert.equal(result.status, "ok", `10 merges must pass, got: ${result.error ?? ""}`);
+  // 10 对 merge → 10 个 keeper 留下，其余 10 条被归档；再加上本轮落库的 summary
+  // 记忆（未归档），未归档数应为 11。这条断言同时证明「闸门放行」与「merge 真的
+  // 生效了」——只断言 notEqual(failed) 会被「什么都没做」蒙混过去。
+  assert.equal(service.all().filter((m) => !m.archived).length, 11, "10 keepers + 1 summary survived");
+  assert.equal(result.applied, 10, "all 10 merges committed");
+  store.close();
+});

package/test/hot-memory.test.js

@@ -1,6 +1,6 @@
 import test from "node:test";
 import assert from "node:assert/strict";
-import { createHotMemory, estimateTokens } from "../src/hot-memory.js";
+import { createHotMemory, estimateTokens, roundsFromEvents } from "../src/hot-memory.js";
 import { createStore } from "../src/store.js";
 import { createService } from "../src/service.js";
 import { createVectorIndex } from "../src/vector-index.js";
@@ -143,3 +143,69 @@ test("selective injection re-orders candidates by query similarity", () => {
   assert.equal(picked[0].id, thesis.id);
   assert.ok(picked.some((m) => m.id === plugin.id));
 });
+
+// --- roundsFromEvents：surface 投影（rewind 撤回内容不得回流热记忆） ---
+
+function userEvent(seq, text, kind) {
+  return { seq, type: "user/message", data: { source: kind ? { kind } : undefined, content: [text] } };
+}
+function assistantEvent(seq, text) {
+  return { seq, type: "assistant/message", data: { message: { content: [{ type: "text", text }] } } };
+}
+
+test("roundsFromEvents pairs user/assistant rounds and keeps the trailing pending query", () => {
+  const events = [
+    userEvent(1, "第一问"),
+    assistantEvent(2, "第一答"),
+    userEvent(3, "第二问")
+  ];
+  const rounds = roundsFromEvents(events, 5);
+  assert.equal(rounds.length, 2);
+  assert.equal(rounds[0].query, "第一问");
+  assert.equal(rounds[0].response, "第一答");
+  assert.equal(rounds[1].query, "第二问");
+  assert.equal(rounds[1].response, "");
+});
+
+test("roundsFromEvents excludes events shadowed off the surface (rewind/compact)", () => {
+  // append-only 日志里被撤回的轮次仍在，但 surface 只剩可见 seq——
+  // 热记忆必须与模型同源，被遮蔽的轮次不得回流。
+  const events = [
+    userEvent(1, "已被撤回的问题"),
+    assistantEvent(2, "已被撤回的回答"),
+    { seq: 3, type: "user/message", data: { source: { kind: "dsh-rewind" }, content: [""] } },
+    userEvent(4, "撤回后的新问题"),
+    assistantEvent(5, "撤回后的新回答")
+  ];
+  const visible = new Set([3, 4, 5]);
+  const rounds = roundsFromEvents(events, 5, visible);
+  assert.equal(rounds.length, 1);
+  assert.equal(rounds[0].query, "撤回后的新问题");
+  assert.equal(rounds[0].response, "撤回后的新回答");
+  assert.ok(!JSON.stringify(rounds).includes("已被撤回"));
+});
+
+test("roundsFromEvents with no surface info keeps the legacy full-log behavior", () => {
+  const events = [userEvent(1, "旧宿主问题"), assistantEvent(2, "旧宿主回答")];
+  const rounds = roundsFromEvents(events, 5, null);
+  assert.equal(rounds.length, 1);
+  assert.equal(rounds[0].query, "旧宿主问题");
+  assert.equal(rounds[0].response, "旧宿主回答");
+});
+
+test("roundsFromEvents skips rewind markers as queries even when on the surface", () => {
+  const events = [
+    { seq: 1, type: "user/message", data: { source: { kind: "dsh-rewind" }, content: [""] } },
+    userEvent(2, "标记后的第一问"),
+    assistantEvent(3, "标记后的第一答")
+  ];
+  const visible = new Set([1, 2, 3]);
+  const rounds = roundsFromEvents(events, 5, visible);
+  assert.equal(rounds.length, 1);
+  assert.equal(rounds[0].query, "标记后的第一问");
+});
+
+test("roundsFromEvents with an empty surface yields no rounds (model sees nothing)", () => {
+  const events = [userEvent(1, "问题"), assistantEvent(2, "回答")];
+  assert.equal(roundsFromEvents(events, 5, new Set()).length, 0);
+});

package/test/inject-recall.test.js

@@ -103,3 +103,42 @@ test("slotFillRate = 注入条数 / (轮数 × 槽位数)", () => {
   assert.equal(stats.injection.slotFillRate, 3 / 4);
   store.close();
 });
+
+// #369：history 曾被注入白名单挡在门外（蒸馏产得出、注入收不进）。这两条断言分
+// 别锁「收编生效」与「重要度闸门对 history 不豁免」——后者一旦失效，短流水账会
+// 直接挤掉决策类条目，那才是这个改动真正的风险面。
+test("#369: history 进注入候选池", () => {
+  const { service } = setup();
+  service.saveWithDedupe({ type: "history", title: "切到暗色主题", content: "用户本次会话把界面切成暗色主题", importance: 4 });
+  const titles = service.injectCandidates({ maxItems: 5 }).map((m) => m.title);
+  assert.ok(titles.includes("切到暗色主题"), "importance>=3 的 history 应进注入候选");
+});
+
+test("#369: 低于重要度闸门的 history 不得例外放行", () => {
+  const { service } = setup();
+  service.saveWithDedupe({ type: "history", title: "打开过一次终端", content: "用户中途打开过一次终端", importance: 2 });
+  const titles = service.injectCandidates({ maxItems: 5 }).map((m) => m.title);
+  assert.ok(!titles.includes("打开过一次终端"), "history 不是 summary/preference，闸门照样生效");
+});
+
+// pattern 只由手工写入，却已被 dreamMergeGuard 列为长保留受保护类型——巩固层当资产
+// 护住、注入面一次不给看是同一条口径的两头不一致。这条锁它进池。
+test("#369: 手写的 pattern 进注入候选池", () => {
+  const { service } = setup();
+  service.saveWithDedupe({ type: "pattern", title: "重复字符串先抽共用模块", content: "多处重复的截断逻辑先收拢成共用模块，再改调用方", importance: 5 });
+  const titles = service.injectCandidates({ maxItems: 5 }).map((m) => m.title);
+  assert.ok(titles.includes("重复字符串先抽共用模块"), "importance>=3 的 pattern 应进注入候选");
+});
+
+// CodeRabbit on PR #404：语义缓存回填分支曾独漏重要度门槛（向量路与 BM25 路都带）。
+// 一正一反：反向锁「低于闸门的行走缓存也不许进池」，正向锁「达标的照常进池」，
+// 免得断言退化成常量真；缓存没被灌进来时正向那条会先红，用例不会空压。
+test("#369: 语义缓存回填同样受重要度闸门约束", async () => {
+  const { service } = setup();
+  const low = service.saveWithDedupe({ type: "history", title: "终端开了一次", content: "用户中途打开过一次终端做检查", importance: 2 });
+  const high = service.saveWithDedupe({ type: "history", title: "终端方案定案", content: "用户终端接入方案已定案并验证", importance: 4 });
+  await service.searchMemories("终端", { mode: "keyword", useRerank: false, recordRecall: false });
+  const ids = service.injectCandidates({ query: "终端", maxItems: 5 }).map((m) => m.id);
+  assert.ok(ids.includes(high.memory.id), "i4 的 history 应经缓存回填进池（正向对照）");
+  assert.equal(ids.includes(low.memory.id), false, "低于闸门的行不得借语义缓存绕开门槛");
+});