dsh-vibe-math 2.4.1 → 2.6.0

package/vibe-math-v3/vibe-math-v3.js

@@ -64,6 +64,25 @@ export function apply(ctx) {
   // ================= per-session registry =================
   const sessions = new Map() // rootAgentId -> Session
   const childOwner = new Map() // childId -> rootAgentId (route subagent/end back to its session)
+  // childOwner 的**有界化**（审计 L1）。这条映射只在"这个 child 还可能再发 subagent/end"时有价值，
+  // 但（与 v2 同一结论）不能在事件回调里立即回收：辩论/续轮会在同一个 child 上再次 end，丢了映射这次
+  // 事件就没人路由，verdict 收口随之失效。所以改为**引用 + 宽限期**：仍被任务或 agentRegistry 引用的
+  // 一律保留，没有引用且距最近一次 end 已超过宽限期才回收。
+  const CHILD_OWNER_GRACE_MS = 5 * 60 * 1000
+  const lastChildEndAt = new Map() // childId -> 最近一次 subagent/end 的时间
+  function pruneChildOwner() {
+    const keep = new Set()
+    for (const s of sessions.values()) {
+      try { for (const id of s.referencedChildIds()) keep.add(id) } catch (e) { /* 尽力而为 */ }
+    }
+    const cutoff = now() - CHILD_OWNER_GRACE_MS
+    for (const cid of Array.from(childOwner.keys())) {
+      if (keep.has(cid)) continue
+      const ended = lastChildEndAt.get(cid)
+      if (ended === undefined || ended > cutoff) continue
+      childOwner.delete(cid); lastChildEndAt.delete(cid)
+    }
+  }
   const fileOwner = {} // 进程级写锁：fileKey -> { childId, sessionId, at } —— 防任何代理（跨会话）并发写同一 md 文件
   // Process epoch: PROCESS-level (one per apply, shared by every session), written to
   // State/process_epoch.json at init; a DIFFERENT persisted epoch means a previous DSH
@@ -71,6 +90,11 @@ export function apply(ctx) {
   // same-process pause→resume (children may still be alive). Kept at apply level so two
   // sessions in one process never treat each other as a stale previous process.
   const processEpoch = String(Date.now()) + '-' + Math.random().toString(36).slice(2, 8)
+  // 项目锁 LEASE 的续租轮询间隔（apply 级定时器用，见 apply() 末尾）：它必须**明显快于**续租判据
+  // （projectLockTimeoutMs/4），否则"多久检查一次"会成为租约年龄的下界——实测 2500ms 轮询配 625ms
+  // 判据时最坏年龄仍有 2467ms，几乎顶到 2500ms 的租约上限。250ms 轮询下最坏租约年龄 ≈
+  // max(250ms, projectLockTimeoutMs/4)，即上限的 1/4 再加一次轮询的抖动。
+  const LOCK_POLL_MS = 250
 
   function sessionIdOf(agent) { try { return (agent && agent.id) ? String(agent.id) : undefined } catch (e) { return undefined } }
   // Walk up the durable session lineage to the top-level (root) agent of this session,
@@ -111,7 +135,7 @@ export function apply(ctx) {
     directionsPerSolver: 1,       // directions shown per solver prompt (1 = own only)
     verifierCount: 3,             // independent reviewers per verification
     debateMaxRounds: 5,           // debate round cap
-    verdictMode: 'forced',        // flat = 均衡(0.5) | forced = 按历史准确率+严谨性加权；两者都先做近共识判定（同侧且均值≥0.85/≤0.15取均值）
+    verdictMode: 'forced',        // flat = 均衡(0.5) | forced = 对每票**等权**取均值（每票按自己报出的概率贡献；严格 1/0 是绝对投票，其影响通过数值本身拉向端点）。**不再**按"历史准确率"加权：那个统计量统计的是"与本批裁决的一致度"，没有后续真值可纠正它。两者都先做近共识判定（同侧且均值≥0.85/≤0.15取均值）
     provider: '',
     model: '',
     solverPersona: '',
@@ -143,7 +167,7 @@ export function apply(ctx) {
     plannerEnabled: true,         // false = 完全走内置启发式（规划代理禁用）
     plannerProvider: '',          // 规划代理模型 provider（空 = 继承）
     plannerModel: '',             // 规划代理模型 id（空 = 继承）
-    planMinIntervalMs: 30000,     // 两次规划调用的最小间隔（系统空闲且有工作时忽略）
+    planMinIntervalMs: 30000,     // 每一次规划调用的最小间隔（含空计划与「空闲但有工作」）
     plannerMaxFails: 3,           // 规划代理连续失败达此值 → 自动降级启发式
     methodKeepIntervalMs: 0,      // Method Keeper 定时整理间隔（0 = 事件驱动）
     methodKeepEvery: 5,           // 每积累 N 个待沉淀发明/新命题触发一次整理
@@ -155,12 +179,26 @@ export function apply(ctx) {
     leanCommand: 'lean',          // 要执行的 Lean 可执行文件（例：'lake'）
     leanArgs: [],                 // 插在文件名之前的附加参数（例：['env','lean'] 配 leanCommand='lake'）
     leanTimeoutMs: 120000,        // 单次 Lean 运行超时上限（毫秒，正整数）
+    // ---- 最终论文（规格：docs/final-paper.md；v2/v3 为单作者变体）----
+    finalPaper: true,             // 收口时是否自动撰写最终论文（false 只关自动触发；/vibe paper 仍可用）
+    paperFormat: 'both',          // both = md + tex | md = 只写 markdown | tex = 只写 latex
+    paperLanguage: 'zh',          // zh = 中文（ctexart/xelatex 优先）| en = 英文（article/pdflatex 优先）
+    paperCompilePdf: true,        // 检测到 LaTeX 时是否编译 paper.pdf
+    paperLatexCommand: '',        // 指定 LaTeX 引擎（空 = 按语言探测 xelatex/latexmk/pdflatex/lualatex/tectonic）
   }
   let params = Object.assign({}, DEFAULT_PARAMS)
   let scheduler = { running: false, startedAt: 0, lastCheckpoint: 0, gate: null } // activeCount 由 activeCount() 从 agentRegistry 推导（防漂移，同 v2）
   let agentRegistry = {}
   let decisionQueue = []
   let verifierAccuracy = {}
+  // 验证者票数统计的保留上限（审计 L1）：它按**一次性的 childId** 记，每次验证都新增键，
+  // 长跑进程里无界增长并整表落盘。它已经不再参与任何加权（见 finalVerdict 的 M8 说明），
+  // 只是审计轨迹，所以按插入顺序保留最近 N 条即可。
+  const VERIFIER_ACC_KEEP = 200
+  function pruneVerifierAccuracy() {
+    const keys = Object.keys(verifierAccuracy)
+    for (let i = 0; i < keys.length - VERIFIER_ACC_KEEP; i++) delete verifierAccuracy[keys[i]]
+  }
   let tasks = {}                  // verify tasks keyed by 'verify:<rId>'
   let activityLog = []
   let lastReportWrite = 0
@@ -223,9 +261,9 @@ export function apply(ctx) {
     { name: 'maxParallelThreshold', type: 'integer', description: '全局最大并发子代理轮数（新派发前须满足 active < 阈值）', suggestion: 4 },
     { name: 'solverMaxRounds', type: 'integer', description: '每个求解方向的最大迭代轮数', suggestion: 3 },
     { name: 'directionsPerSolver', type: 'integer', description: '每个 solver 提示词附带的其他活跃方向摘要数量：1 = 只看自己方向', suggestion: 1 },
-    { name: 'verifierCount', type: 'integer', description: '每个验证对象的独立验证器数量', suggestion: 3 },
+    { name: 'verifierCount', type: 'integer', description: '每个验证对象的独立验证器数量（实际下界为 2：少于 2 份独立评审一律不定论，见 minVotes）', suggestion: 3 },
     { name: 'debateMaxRounds', type: 'integer', description: '验证辩论（交流群）最大轮数', suggestion: 5 },
-    { name: 'verdictMode', type: 'enum', options: ['flat', 'forced'], description: '裁决模式：flat = 均衡机制；forced = 强制裁决（按历史准确率+严谨性加权）；两者都先做近共识判定（同侧且均值≥0.85/≤0.15取均值，修复 v2 flat 误判）', suggestion: 'forced' },
+    { name: 'verdictMode', type: 'enum', options: ['flat', 'forced'], description: '裁决模式：flat = 均衡机制（分歧时 0.5）；forced = 强制裁决（对每票等权取均值；严格 1/0 是绝对投票，其影响通过数值本身拉向端点。**不按"历史准确率"加权**——该统计量统计的是与本批裁决的一致度，没有后续真值可纠正）；两者都先做近共识判定（同侧且均值≥0.85/≤0.15取均值，修复 v2 flat 误判）', suggestion: 'forced' },
     { name: 'provider', type: 'string', description: '子代理模型 provider（空 = 继承根代理）', suggestion: '' },
     { name: 'model', type: 'string', description: '子代理模型 id（空 = 继承根代理）', suggestion: '' },
     { name: 'solverPersona', type: 'string', description: '注入每个求解器提示词开头的人格/要求', suggestion: '' },
@@ -256,7 +294,7 @@ export function apply(ctx) {
     { name: 'plannerEnabled', type: 'boolean', description: 'false = 完全走内置启发式调度（规划代理禁用）', suggestion: true },
     { name: 'plannerProvider', type: 'string', description: '规划代理模型 provider（空 = 继承根代理）', suggestion: '' },
     { name: 'plannerModel', type: 'string', description: '规划代理模型 id（空 = 继承根代理）', suggestion: '' },
-    { name: 'planMinIntervalMs', type: 'integer', description: '两次规划调用的最小间隔（毫秒）；系统空闲且有工作时忽略', suggestion: 30000 },
+    { name: 'planMinIntervalMs', type: 'integer', description: '每一次规划调用的最小间隔（毫秒）；对**每一次**规划调用都生效（含空计划、含「空闲但仍有工作」，不再有空闲绕过）', suggestion: 30000 },
     { name: 'plannerMaxFails', type: 'integer', description: '规划代理连续失败达此值 → 自动降级启发式', suggestion: 3 },
     { name: 'methodKeepIntervalMs', type: 'integer', description: 'Method Keeper 定时整理间隔（0 = 事件驱动）', suggestion: 0 },
     { name: 'methodKeepEvery', type: 'integer', description: '每积累 N 个待沉淀发明/新命题触发一次整理', suggestion: 5 },
@@ -267,6 +305,11 @@ export function apply(ctx) {
     { name: 'leanCommand', type: 'string', description: 'Lean 可执行文件（例：lean / lake；配合 leanArgs=[env,lean] 用 lake）', suggestion: 'lean' },
     { name: 'leanArgs', type: 'string[]', description: '插在 .lean 文件名之前的附加参数', suggestion: [] },
     { name: 'leanTimeoutMs', type: 'integer', description: '单次 Lean 运行的超时上限（毫秒，非正数回退默认）', suggestion: 120000 },
+    { name: 'finalPaper', type: 'boolean', description: '收口（checkTermination 的完整收口分支：无未解决问题、无待验证对象、无任务/计划/门）时自动撰写最终论文：派遣一名专职「论文撰写」子代理，把已定论命题/解法/方法整理成 Paper/<项目>/{paper.md,paper.tex,paper.meta.json,paper.log.md}。false = 只关自动触发，/vibe paper 手动命令仍可用', suggestion: true },
+    { name: 'paperFormat', type: 'enum', options: ['both', 'md', 'tex'], description: '论文产出格式：both = markdown + latex；md = 只写 paper.md（跳过编译）；tex = 只写 paper.tex（tex 才会尝试编译 pdf）', suggestion: 'both' },
+    { name: 'paperLanguage', type: 'enum', options: ['zh', 'en'], description: '论文语言：zh = 中文（LaTeX 用 ctexart，引擎优先 xelatex）；en = 英文（article，引擎优先 pdflatex/latexmk）', suggestion: 'zh' },
+    { name: 'paperCompilePdf', type: 'boolean', description: '检测到 LaTeX 时是否编译 paper.pdf（-interaction=nonstopmode 跑两遍；失败先尝试修复：换引擎/去不支持宏包/最小模板）。false 或无 LaTeX 时只保留 tex+md 并记日志（不阻塞定稿）', suggestion: true },
+    { name: 'paperLatexCommand', type: 'string', description: '指定 LaTeX 引擎可执行文件（空 = 按语言探测：中文 xelatex > latexmk > pdflatex > lualatex > tectonic；英文 pdflatex 优先）。解析不到时按"未检测到"降级', suggestion: '' },
   ]
 
   // ================= fs (adapted to DSH 0.1.1: resolve returns {targetKey, displayPath}) =================
@@ -345,7 +388,10 @@ export function apply(ctx) {
    * 与 `Verified/Lean/`（归档证明，与定论卡片同处 Verified/，一眼可见"这条结论的证明在哪"），
    * 以及**项目树之外**的全局可复用库 `<VibeMath 根>/Formal/{Lib,Proved}`（跨项目复用是核心收益）。
    */
-  async function ensureDirs() { const base = frameworkRoot(); const dirs = ['Problems', 'Progress', 'Propos', 'Methods', 'Verified/命题', 'Verified/问题', 'Verified/Lean', 'Formal', 'Reliable', 'Notes', 'Logs/Verification', 'Logs/Plans', 'State']; const paths = [vibeRoot() + '/Projects', vibeRoot() + '/Methods', vibeRoot() + '/Formal/Lib', vibeRoot() + '/Formal/Proved'].concat(dirs.map(function (d) { return base + '/' + d })); return await runShell(mkdirCmd(paths)) }
+  // Progress_Logs/ 必须和别的骨架目录**一起**建出来（审计 L8）：vibe_math_report 会写
+  // `Progress_Logs/report.json`，README 也把它列为布局的一部分，但此前它只靠 writeText 的隐式
+  // mkdir 兜底——在宿主不支持删除/创建的路径上（runShell 失败）报告目录就时有时无。
+  async function ensureDirs() { const base = frameworkRoot(); const dirs = ['Problems', 'Progress', 'Progress_Logs', 'Propos', 'Methods', 'Verified/命题', 'Verified/问题', 'Verified/Lean', 'Formal', 'Reliable', 'Notes', 'Logs/Verification', 'Logs/Plans', 'State']; const paths = [vibeRoot() + '/Projects', vibeRoot() + '/Methods', vibeRoot() + '/Formal/Lib', vibeRoot() + '/Formal/Proved'].concat(dirs.map(function (d) { return base + '/' + d })); return await runShell(mkdirCmd(paths)) }
   async function removeFile(rel) { const base = frameworkRoot(); return await runShell(rmCmd(base + '/' + rel)) }
 
   // ================= settings =================
@@ -354,7 +400,7 @@ export function apply(ctx) {
     const intFields = ['maxParallelThreshold', 'solverMaxRounds', 'directionsPerSolver', 'verifierCount', 'debateMaxRounds', 'solverMaxToolCalls', 'verifierMaxToolCalls', 'reportIntervalMs', 'tickIntervalMs', 'activityLogCap', 'maxExplorerRetries', 'planningHorizon', 'planMinIntervalMs', 'plannerMaxFails', 'methodKeepIntervalMs', 'methodKeepEvery', 'projectLockTimeoutMs']
     const numFields = ['promoteValueThreshold']
     const arrayFields = ['solverToolAllow', 'solverToolDeny', 'verifierToolAllow', 'verifierToolDeny', 'leanArgs']
-    const boolFields = ['plannerEnabled', 'methodAutoPromote', 'indexAutoRebuild']
+    const boolFields = ['plannerEnabled', 'methodAutoPromote', 'indexAutoRebuild', 'finalPaper', 'paperCompilePdf']
     for (const k of Object.keys(DEFAULT_PARAMS)) {
       if (!(k in obj)) continue
       const v = obj[k]
@@ -373,6 +419,10 @@ export function apply(ctx) {
       else if (k === 'leanCommand') { const s = String(v == null ? '' : v).trim(); out[k] = s || 'lean' }
       else if (k === 'leanTimeoutMs') { const n = Number(v); out[k] = (Number.isFinite(n) && n > 0) ? Math.floor(n) : DEFAULT_PARAMS[k] }
       else if (k === 'solverAllowNetwork' || k === 'verifierAllowNetwork' || k === 'solverAllowScripts' || k === 'verifierAllowScripts') { out[k] = (v === true || v === false || v === '') ? v : DEFAULT_PARAMS[k] }
+      // 最终论文（spec v2 §B）：布尔/枚举必须**显式归一化**，不允许未知键直通（'false' 会保持真值）。
+      else if (k === 'paperFormat') { out[k] = (v === 'both' || v === 'md' || v === 'tex') ? v : DEFAULT_PARAMS[k] }
+      else if (k === 'paperLanguage') { out[k] = (v === 'zh' || v === 'en') ? v : DEFAULT_PARAMS[k] }
+      else if (k === 'paperLatexCommand') { const s = String(v == null ? '' : v).trim(); out[k] = s }
       else { out[k] = v }
     }
     return out
@@ -424,7 +474,11 @@ export function apply(ctx) {
   // ================= md soft-spec helpers =================
   // 软规范：对象 md 头部锚点行（唯一强制部分）+ 正文自由叙述。调度器只解析
   // 头部锚点与条目标题行（### 解法/证明/证伪 N｜标题｜概率X｜状态Y），从不解析正文散文。
-  function anchorLine(k, v) { return '- ' + k + ': ' + String(v == null ? '' : v) }
+  function anchorLine(k, v) {
+    // 锚点行是**逐行**格式，parseAnchors 的 `.*$` 不跨行（无 `s` 标志）：值里含换行会让这一行被
+    // 劈成两行，第二行既不是锚点也会污染下一个锚点/段落的解析。compose 侧统一折成空格（审计 L6）。
+    return '- ' + k + ': ' + String(v == null ? '' : v).replace(/[\r\n]+/g, ' ')
+  }
   // 解析条目标题行 + 其后正文，直到下一个 ### / ## 标题。返回 [{heading, text}]
   /**
    * 按顺序切出正文里的所有 `## ` 顶层段。用于"无损往返"：compose 只重新生成自己管理的
@@ -460,6 +514,12 @@ export function apply(ctx) {
     lines.push(anchorLine('依赖', JSON.stringify(p.依赖 || [])))
     lines.push(anchorLine('被依赖', JSON.stringify(p.被依赖 || [])))
     lines.push(anchorLine('来源', p.来源 || '原始'))
+    // 关联锚点（H4）：这两行此前**只读不写** ⇒ 任何一次重载（resume / vibe_math_index /
+    // set_project / 进程重启都会按文件名重新解析卡片）之后，判断问题与它的临时假设命题
+    // 全部失联：processStatusUpdates 的"收口僵尸判断问题"分支、settleVerdict 的"回写源命题"
+    // 分支、Verified 卡的来源字段都只在同进程内有效。写出来才是真正的持久关联。
+    if (p.判断命题) lines.push(anchorLine('判断命题', p.判断命题))
+    if (p.来源命题) lines.push(anchorLine('来源命题', p.来源命题))
     lines.push(anchorLine('计划', p.计划 || ''))
     lines.push('')
     lines.push('## 陈述')
@@ -471,7 +531,7 @@ export function apply(ctx) {
     if (sols.length === 0) lines.push('（暂无解法候选）')
     else for (let i = 0; i < sols.length; i++) {
       const s = sols[i]
-      lines.push('### 解法 ' + (i + 1) + '｜' + (s.title || '解法' + (i + 1)) + '｜概率' + (s.prob != null ? s.prob : 0.5) + '｜状态' + (s.status || '未定论'))
+      lines.push('### 解法 ' + (i + 1) + '｜' + escField(s.title || '解法' + (i + 1)) + '｜概率' + probText(s.prob != null ? s.prob : 0.5) + '｜状态' + escField(s.status || '未定论'))
       lines.push(s.text || '')
       lines.push('')
     }
@@ -480,7 +540,7 @@ export function apply(ctx) {
   function parseProblemMd(id, text) {
     const { head, body } = splitHeader(text)
     const a = parseAnchors(head)
-    const sols = parseEntries(body, /^###\s*解法\s*\d+｜(.*?)｜概率([0-9.]+)｜状态(.+)$/).map(function (e) { return { title: e.title, prob: clamp01(e.prob), status: e.status, text: e.text } })
+    const sols = parseEntries(body, entryRe('解法')).map(function (e) { return { title: unescField(e.title), prob: clamp01(e.prob), status: unescField(e.status), text: e.text } })
     return {
       id: id, 标题: a['标题'] || id, 状态: a['状态'] || '求解中',
       优先级: (a['优先级'] === 'never' ? 'never' : (Number(a['优先级']) || 1)),
@@ -505,6 +565,10 @@ export function apply(ctx) {
     if (formalAnchorLine(p.id)) lines.push(anchorLine('形式化', formalAnchorLine(p.id)))
     lines.push(anchorLine('优先级', p.优先级 == null ? 1 : p.优先级))
     lines.push(anchorLine('依赖', JSON.stringify(p.依赖 || [])))
+    // 来源锚点（H4）：与问题卡的 判断命题/来源命题 对称——不写盘的话，重载后
+    // 「引理来自哪个问题/方向」丢失，Verified 命题卡的 `- 来源:` 也会永久为空。
+    if (p.来源问题) lines.push(anchorLine('来源问题', p.来源问题))
+    if (p.来源方向) lines.push(anchorLine('来源方向', p.来源方向))
     if (p.价值关键性 != null) lines.push(anchorLine('价值/关键性', p.价值关键性))
     lines.push('')
     lines.push('## 陈述')
@@ -515,7 +579,7 @@ export function apply(ctx) {
     if (proofs.length === 0) lines.push('（暂无证明尝试）')
     else for (let i = 0; i < proofs.length; i++) {
       const s = proofs[i]
-      lines.push('### 证明 ' + (i + 1) + '｜' + (s.title || '证明' + (i + 1)) + '｜概率' + (s.prob != null ? s.prob : 0.5) + '｜状态' + (s.status || '未定论'))
+      lines.push('### 证明 ' + (i + 1) + '｜' + escField(s.title || '证明' + (i + 1)) + '｜概率' + probText(s.prob != null ? s.prob : 0.5) + '｜状态' + escField(s.status || '未定论'))
       lines.push(s.text || '')
       lines.push('')
     }
@@ -524,7 +588,7 @@ export function apply(ctx) {
     if (refutes.length === 0) lines.push('（暂无证伪尝试）')
     else for (let i = 0; i < refutes.length; i++) {
       const s = refutes[i]
-      lines.push('### 证伪 ' + (i + 1) + '｜' + (s.title || '证伪' + (i + 1)) + '｜概率' + (s.prob != null ? s.prob : 0.5) + '｜状态' + (s.status || '未定论'))
+      lines.push('### 证伪 ' + (i + 1) + '｜' + escField(s.title || '证伪' + (i + 1)) + '｜概率' + probText(s.prob != null ? s.prob : 0.5) + '｜状态' + escField(s.status || '未定论'))
       lines.push(s.text || '')
       lines.push('')
     }
@@ -533,8 +597,8 @@ export function apply(ctx) {
   function parsePropositionMd(id, text) {
     const { head, body } = splitHeader(text)
     const a = parseAnchors(head)
-    const proofs = parseEntries(body, /^###\s*证明\s*\d+｜(.*?)｜概率([0-9.]+)｜状态(.+)$/).map(function (e) { return { title: e.title, prob: clamp01(e.prob), status: e.status, text: e.text } })
-    const refutes = parseEntries(body, /^###\s*证伪\s*\d+｜(.*?)｜概率([0-9.]+)｜状态(.+)$/).map(function (e) { return { title: e.title, prob: clamp01(e.prob), status: e.status, text: e.text } })
+    const proofs = parseEntries(body, entryRe('证明')).map(function (e) { return { title: unescField(e.title), prob: clamp01(e.prob), status: unescField(e.status), text: e.text } })
+    const refutes = parseEntries(body, entryRe('证伪')).map(function (e) { return { title: unescField(e.title), prob: clamp01(e.prob), status: unescField(e.status), text: e.text } })
     return {
       id: id, 标题: a['标题'] || id, 状态: a['状态'] || '未定论',
       概率: clamp01(a['概率'] != null ? Number(a['概率']) : 0.5),
@@ -768,6 +832,8 @@ export function apply(ctx) {
   function allProblems() { return Array.from(problems.values()) }
   function allPropos() { return Array.from(propos.values()) }
   function depResolved(id) {
+    // M9：对象键一律是 idSafe(id)（见各写入点），依赖是模型写的原始 id ⇒ 查表前必须走同一把归一化。
+    id = idSafe(id)
     if (problems.has(id)) { const q = problems.get(id); return q.状态 === '已解决' || q.优先级 === 'never' }
     if (propos.has(id)) { const p = propos.get(id); return p.概率 === 1 || p.概率 === 0 || p.优先级 === 'never' } // never = 主动弃权，视为依赖已满足，避免等待依赖死锁
     return true // unknown dependency: treat as resolved (conservative)
@@ -804,7 +870,14 @@ export function apply(ctx) {
     const va = await readJson('State/verifier_accuracy.json'); if (va) verifierAccuracy = va
     const tk = await readJson('State/tasks.json'); if (tk) tasks = tk
     const er = await readJson('State/explorer_retries.json'); if (er) explorerRetries = er
-    const pq = await readJson('State/plans.json'); if (pq && Array.isArray(pq.queued)) planQueue = pq.queued
+    const pq = await readJson('State/plans.json')
+    // 计划队列的**跨进程**语义（审计 L9）：planQueue 是"本进程内跨 tick"的队列，里面的动作指的是
+    // 当时那个进程/那次运行的对象与状态。上一进程留下的队列在恢复时重放，轻则对已不存在的 target
+    // 空转，重则把过期计划的动作施加到新状态上。进程 epoch 是权威判据：只有本进程写下的队列才恢复。
+    if (pq && Array.isArray(pq.queued)) {
+      if (pq.epoch === processEpoch) planQueue = pq.queued
+      else if (pq.queued.length > 0) { planQueue = []; logActivity('plan', '丢弃上一进程留下的 ' + pq.queued.length + ' 条计划动作（跨进程重放会施加过期计划）') }
+    }
     const ml = await readJson('State/method_log.json'); if (ml) methodLog = Object.assign({ pendingInventions: [], keepCount: 0, lastKeepAt: 0 }, ml)
     const pl = await readJson('State/project_lock.json'); if (pl) projectLock = Object.assign({ sessionId: '', at: 0 }, pl)
     const lp = await readJson('State/last_plan.json'); if (lp) lastPlanSummary = lp
@@ -825,7 +898,7 @@ export function apply(ctx) {
     await writeJson('State/verifier_accuracy.json', verifierAccuracy)
     await writeJson('State/tasks.json', tasks)
     await writeJson('State/explorer_retries.json', explorerRetries)
-    await writeJson('State/plans.json', { queued: planQueue })
+    await writeJson('State/plans.json', { queued: planQueue, epoch: processEpoch })
     await writeJson('State/method_log.json', methodLog)
     await writeJson('State/project_lock.json', projectLock)
     await writeJson('State/archived_journals.json', archivedJ)
@@ -927,7 +1000,10 @@ export function apply(ctx) {
         '，问题 ' + report.problems.solved + '/' + report.problems.total + ' 已解决，命题 ' + report.propositions.resolved + '/' + report.propositions.total + ' 已定论，' +
         '活跃代理轮数=' + report.activeCount + '，待人工决策=' + report.pendingDecisions.length + '，待执行计划=' + report.queuedPlanActions + '。' +
         '请调用 vibe_math_report 汇总当前进展及各代理状态，并用人话简要汇报（不打断用户，简短即可）。'
-      rootAgent.followup({ id: uuid(), role: 'user', content: [textBlock(text)], source: { kind: 'plugin', plugin: 'vibe-math-v3' } })
+      // 来源 kind 必须是**已声明**的：`MessageSourceMap` 是 merge-extensible 联合，但没有共享的
+      // catch-all `plugin` kind（审计 L5/dsh-llm message.d.ts），{kind:'plugin'} 是契约外形状。
+      // role 本来就是 'user'，正文自带 "[Vibe Math V3] 进度更新" 的真署名，故用核心声明的 {kind:'user'}。
+      rootAgent.followup({ id: uuid(), role: 'user', content: [textBlock(text)], source: { kind: 'user' } })
       lastPushReport = now()
     } catch (e) {
       console.error('vibe-math-v3: push report failed: ' + String((e && e.message) || e))
@@ -1053,7 +1129,8 @@ export function apply(ctx) {
   function kcObjectModels() {
     return '\n2) OBJECT MODELS（md 卡片，软规范：头部锚点行 + 正文自由叙述）：\n' +
       '- 问题卡 Problems/<id>.md：{ 标题, ID, 类型:问题, 状态:原始|求解中|等待依赖|已解决|死路, 优先级, 依赖:[], 被依赖:[], 来源:原始|后生, 计划（由调度器按规划代理的计划自动更新：一句话说明下一轮安排）, ## 陈述（完整问题陈述，每个记号/对象都要完整定义）, ## 来源与动机（后生问题：产生流程/动机/如何回填主线）, ## 解法候选（### 解法 N｜标题｜概率X｜状态Y + 叙述式完整解法）}。\n' +
-      '- 命题卡 Propos/<分类>/<id>.md：{ 标题, ID, 类型:命题, 状态:未定论|已验证·真|已验证·假, 概率, 优先级, 依赖:[], ## 陈述（完整）, ## 证明尝试（### 证明 N｜…｜概率X｜状态Y）, ## 证伪尝试（### 证伪 N｜…｜概率X｜状态Y）}。\n' +
+      '- 命题卡 Propos/<分类>/<id>.md：{ 标题, ID, 类型:命题, 状态:未定论|已验证·真|已验证·假, 概率, 优先级, 依赖:[], 价值/关键性, 来源问题, 来源方向, ## 陈述（完整）, ## 证明尝试（### 证明 N｜…｜概率X｜状态Y）, ## 证伪尝试（### 证伪 N｜…｜概率X｜状态Y）}。\n' +
+      '- `价值/关键性 ∈ [0,1]`（M1）：这条命题对**整个项目主线**有多关键——若它成立/被证伪，能改变多少后续方向。≥ promoteValueThreshold（默认 0.7）且仍未定论(概率∈(0,1))的命题会被自动晋升成「判断下述命题是否成立：…」问题，由求解器专门证明/证伪并把结果回写源命题。你不填就默认 0.5（永不晋升）。**只有你（写卡的代理）能设这个值**——请在你认为"这条引理/猜想值得单独立项"时显式写上。\n' +
       '- 证明/证伪尝试语义：`## 证明尝试`=为证实而写的论证；`## 证伪尝试`=专门反驳/反例的论证。**失败的"找反例未果"/sanity check 是支持性证据，不属于证伪尝试**；不要写入 `## 证伪尝试`（否则系统会当作待验证的反驳去验证）。对仍未完成的证明/证伪，明确标注缺口而非伪装完成。\n' +
       '- 方法卡 Methods/<id>.md：{ 标题, ID, 类型:方法, 状态:经验|应用验证|含已验证断言, 可信断言:[]（只允许已进 Verified/ 的 ID）, 上级体系/子方法/相关, 适用场景, ## 核心内容, ## 定义与记号, ## 应用记录, ## 改进历史 }。\n' +
       '- 收口规则：某个解法/证明/证伪 概率=1 → 问题已解决 / 命题已验证（状态/概率锚点由调度器改写）。\n'
@@ -1079,7 +1156,7 @@ export function apply(ctx) {
   function kcSolverFiles() {
     return '你的归属文件：\n' +
       '- 求解器：把该方向的完整叙述（本轮进展/子路线/可行性信号/教训/完整解法文本）写进 `Progress/<问题id>/<方向id>.md`；聚合索引 `Progress/<问题id>.md` 由调度器维护，不要动它。\n' +
-      '- 新引理：写一张完整命题卡到 `Propos/<分类>/<p-id>.md`，含锚点 `- 标题:`、`- ID/类型/状态/概率/优先级` 与 `## 陈述`；证明写进 `### 证明 1｜标题｜概率X｜状态Y` 段落（完整证明文本是验证必需，否则验证器只能验裸命题）。\n'
+      '- 新引理：写一张完整命题卡到 `Propos/<分类>/<p-id>.md`，含锚点 `- 标题:`、`- ID/类型/状态/概率/优先级/价值关键性` 与 `## 陈述`；证明写进 `### 证明 1｜标题｜概率X｜状态Y` 段落（完整证明文本是验证必需，否则验证器只能验裸命题）。`- 价值/关键性: <0..1>` 表示这条引理对项目主线的关键程度（≥ 阈值会被自动晋升为独立问题），别省。\n'
   }
   // 方法整理代理专属：方法卡
   function kcKeeperFiles() {
@@ -1207,7 +1284,7 @@ export function apply(ctx) {
     head += '\nLEMMA RULES: every lemma you register MUST carry a complete proof in `lemmas[].proof` (and in the card\'s `## 证明尝试`). If a claim is only partly argued, do NOT register it as a finished lemma — either prove it fully or record it as an explicit gap/conjecture stating the missing step, so the verifier knows exactly what is (and is not) being claimed. Incomplete "lemmas" waste verification and can mislead.\n'
     head += '\nOUTPUT CONTRACT — pick ONE channel. Write content into Markdown; only lightweight scheduling metadata (and verification-required proofs) cross the machine reply.\n' +
       'CHANNEL A (recommended, you can write files): write the full round narrative into `Progress/' + q.id + '/' + dir.id + '.md` and each new lemma card into `Propos/<分类>/<id>.md`, then reply ONLY this metadata object:\n' +
-      '{"meta":{"kind":"solver","qid":"' + q.id + '","dirId":"' + dir.id + '","round":' + round + ',"survival":0.5,"status":"continue|success|dead-end","dead_end_reason":"... or null","lemmas":[{"id":"p-...","title":"...","statement":"...","proof":"<完整证明文本，供验证器核验>","prob":0.6,"分类":"<引理卡目录名，必须与你要写入的 Propos/<分类>/ 目录严格一致>","优先级":1}],"methods_used":[{"id":"m-...","效果":"...","建议":"..."}],"new_inventions":[{"类型":"...","标题":"...","内容描述":"...","是否已入库":false}],"solution_prob":0.85,"solution_text":"<完整解法文本，或 null>","sub_questions":[{"q_sub_title":"...","q_sub_statement":"完整问题陈述(含所有对象/定义)","assumption_title":"p_{q-tmp} 标题","assumption_statement":"完整假设陈述(含所有定义)"}]}}\n' +
+      '{"meta":{"kind":"solver","qid":"' + q.id + '","dirId":"' + dir.id + '","round":' + round + ',"survival":0.5,"status":"continue|success|dead-end","dead_end_reason":"... or null","lemmas":[{"id":"p-...","title":"...","statement":"...","proof":"<完整证明文本，供验证器核验>","prob":0.6,"价值/关键性":0.5,"分类":"<引理卡目录名，必须与你要写入的 Propos/<分类>/ 目录严格一致>","优先级":1}],"methods_used":[{"id":"m-...","效果":"...","建议":"..."}],"new_inventions":[{"类型":"...","标题":"...","内容描述":"...","是否已入库":false}],"solution_prob":0.85,"solution_text":"<完整解法文本，或 null>","sub_questions":[{"q_sub_title":"...","q_sub_statement":"完整问题陈述(含所有对象/定义)","assumption_title":"p_{q-tmp} 标题","assumption_statement":"完整假设陈述(含所有定义)"}]}}\n' +
       'CHANNEL B (your file tools are unavailable): put the content you would have written into __writes and carry the same meta:\n' +
       '{"__writes":[{"path":"Progress/' + q.id + '/' + dir.id + '.md","content":"<完整本轮叙述>"}],"meta":{"kind":"solver","qid":"' + q.id + '","dirId":"' + dir.id + '",...同上 meta 字段...}}\n' +
       '区分规则：methods_used 只能填**已存在的方法卡 ID**（m-…，来自 AVAILABLE METHODS 列表）——引用你自己刚想出的新方法/新技巧不属于 methods_used，请如实填入 new_inventions（它会由 Method Keeper 蒸馏建卡）；不要把方法名/标题当 id 填进 methods_used。'
@@ -1281,7 +1358,24 @@ export function apply(ctx) {
   }
 
   // ================= decisions (manual/auto) =================
-  function enqueueDecision(node, contextText, data) { const d = { id: uuid(), node: node, context: contextText, data: data, status: 'pending', resolution: null, createdAt: now() }; decisionQueue.push(d); return d }
+  // 已结清决策的保留条数（审计 L1）：decisionQueue 以前只把 status 置 resolved、永不裁剪，
+  // 且整表落盘到 State/decision_queue.json，长跑进程里它是第二处无界增长。保留最近 N 条已结清记录
+  // 作为审计轨迹（list_decisions 只列 pending，所以裁剪不影响任何读取路径），pending 一律不裁。
+  const RESOLVED_DECISION_KEEP = 50
+  function pruneDecisionQueue() {
+    let resolved = 0
+    for (let i = 0; i < decisionQueue.length; i++) if (decisionQueue[i] && decisionQueue[i].status !== 'pending') resolved++
+    let drop = resolved - RESOLVED_DECISION_KEEP
+    if (drop <= 0) return
+    const kept = []
+    for (let i = 0; i < decisionQueue.length; i++) {
+      const d = decisionQueue[i]
+      if (d && d.status !== 'pending' && drop > 0) { drop--; continue }
+      kept.push(d)
+    }
+    decisionQueue = kept
+  }
+  function enqueueDecision(node, contextText, data) { const d = { id: uuid(), node: node, context: contextText, data: data, status: 'pending', resolution: null, createdAt: now() }; decisionQueue.push(d); pruneDecisionQueue(); return d }
   async function maybeGate(node, contextText, data, autoFn) { if (params.mode === 'auto') return await autoFn(data); const d = enqueueDecision(node, contextText, data); setGate(d, node); logActivity('gate', node + ': ' + contextText); await saveAll(); return { gated: true, decisionId: d.id } }
   /**
    * 设置唯一闸门，并把被它取代的旧决策**立即结清**。
@@ -1372,6 +1466,8 @@ export function apply(ctx) {
       await reconcileVerify()
       await executePlanQueue()
       await maybePlan()
+      // 方法整理排在终止判定之前：到期的方法整理是**真实工作**，先把它派出去，
+      // 再让 checkTermination 看到"有在途的 method-keeper"从而不误判停机（H1 修复的配套）。
       await maybeMethodKeepFallback()
       await maybePushReport(false)
       await maybeWriteReport(false)
@@ -1570,7 +1666,9 @@ export function apply(ctx) {
   }
   function verifyTaskBusy(rId) { if (tasks['verify:' + rId]) return true; return Object.keys(agentRegistry).some(function (cid) { const m = agentRegistry[cid]; return m && m.role === 'verifier' && m.rId === rId }) }
   async function createVerifyTask(c) {
-    const rId = c.rId
+    // M9：验证 id 由对象 id 派生（`r-<对象id>[-sN]`），对象键已归一化 ⇒ rId 也归一化，
+    // 否则原始 id 里的路径分隔符会被拼进 Logs/Verification/<rId>_<ts>.json 造出子目录。
+    const rId = idSafe(c.rId)
     if (verifyTaskBusy(rId)) return false
     // require 门禁的**防空转**（契约 §2「对象留在原库，可形式化后再次提议」）：已经被记为
     // 「形式化待办」、而形式化又还没补齐的对象不再重复表决——重复表决只会一次又一次被同一道
@@ -1657,15 +1755,18 @@ export function apply(ctx) {
     // 规划代理在途时不再重复调用
     const plannerInFlight = Object.keys(agentRegistry).some(function (cid) { const m = agentRegistry[cid]; return m && m.role === 'planner' })
     if (plannerInFlight) return
-    // 有"可调度工作"= 有待解问题方向可推进 或 有验证候选 或 有待沉淀发明 或 有待执行计划。
-    // 修复：仅剩验证候选（如所有问题已解决但 Propos 里仍有未验证命题/解法）时也必须触发规划，
-    // 否则 planner 永远不会被调用、验证永不进行。
+    // 有"可调度工作"= 有待解问题方向可推进 或 有验证候选 或 有**到期**的方法整理 或 有待执行计划。
+    // H1 修复：这里必须用真正的到期判定 methodKeepDue()，而不是"待沉淀发明非空"。
+    // 旧条件在 pendingInventions ∈ [1, methodKeepEvery-1] 时恒真，于是**没有任何工作**的每一
+    // 个 tick 都派生一个 planner：空计划不留痕（lastPlanSummary 不写）、冷却又被"无在途工作"
+    // 绕过、终止判定又被刚派出的 planner 挡掉 ⇒ 按 tick 计费的 planner 热循环永不终止。
+    // 待沉淀发明到期时由 maybeMethodKeepFallback() 处理，不需要（也不应该）叫 planner。
     const verifyWork = (await buildVerifyCandidates()).length > 0
-    if (!hasSchedulableWork() && !verifyWork && methodLog.pendingInventions.length === 0 && planQueue.length === 0) { await maybeMethodKeepFallback(); return }
-    // 冷却：系统空闲且有工作时忽略冷却（避免 30s 空转）
+    if (!hasSchedulableWork() && !verifyWork && !methodKeepDue() && planQueue.length === 0) return
+    // 冷却对**每一次**规划调用生效（含空计划）：空计划同样是一次真实的模型调用，必须退避。
+    // 旧代码用 hasInflight 跳过冷却，本意是"空闲且有工作时不空转"，但那恰好是 H1 的放大器。
     const cooldown = Number(params.planMinIntervalMs) || 0
-    const hasInflight = Object.keys(agentRegistry).length > 0 || planQueue.length > 0
-    if (cooldown > 0 && hasInflight && (now() - lastPlanAt) < cooldown) return
+    if (cooldown > 0 && (now() - lastPlanAt) < cooldown) return
     await callPlanner()
   }
   async function callPlanner() {
@@ -1742,7 +1843,7 @@ export function apply(ctx) {
       if (act === 'spawn') {
         const role = String(a.role || '')
         if (role === 'explorer') {
-          const q = problems.get(String(a.target || ''))
+          const q = problems.get(idSafe(String(a.target || ''))) // M9：问题键已归一化
           if (!q || q.状态 === '已解决' || q.优先级 === 'never') continue
           const dirs = getDirState(q.id)
           const allExhausted = dirs.length > 0 && dirs.every(function (d) { return d.status === 'dead-end' || d.status === 'success' })
@@ -1751,7 +1852,7 @@ export function apply(ctx) {
           if (busy) continue
           if ((explorerRetries[q.id] || 0) >= (Number(params.maxExplorerRetries) || 3)) continue
         } else if (role === 'solver') {
-          const q = problems.get(String(a.target || ''))
+          const q = problems.get(idSafe(String(a.target || ''))) // M9：问题键已归一化
           if (!q || q.状态 === '已解决' || q.优先级 === 'never' || q.状态 === '等待依赖') continue
           const dir = (getDirState(q.id) || []).find(function (d) { return d.id === String(a.direction || '') })
           if (!dir || dir.status !== 'active') continue
@@ -1759,11 +1860,13 @@ export function apply(ctx) {
           const running = Object.keys(agentRegistry).some(function (cid) { const m = agentRegistry[cid]; return m && m.qid === q.id && m.direction === dir.id && m.role === 'solver' })
           if (running) continue
         } else if (role === 'verifier') {
-          const rId = String(a.target || '')
+          const rId = idSafe(String(a.target || '')) // M9：与 createVerifyTask 同一把归一化
           if (!rId) continue
           if (verifyTaskBusy(rId)) continue
           const cands = await buildVerifyCandidates()
-          if (!cands.some(function (c) { return c.rId === rId })) continue
+          if (!cands.some(function (c) { return idSafe(c.rId) === rId })) continue
+          out.push({ action: 'spawn', role: role, target: rId, direction: a.direction || '', reason: String(a.reason || '') })
+          continue
         } else if (role === 'method-keeper') {
           // 无目标；允许（由代码兜底去重：一次只允许一个 method-keeper）
           const running = Object.keys(agentRegistry).some(function (cid) { const m = agentRegistry[cid]; return m && m.role === 'method-keeper' })
@@ -1775,10 +1878,10 @@ export function apply(ctx) {
         if (!agentRegistry[cid]) continue
         out.push({ action: 'interrupt', childId: cid, reason: String(a.reason || '') })
       } else if (act === 'promote') {
-        const p = propos.get(String(a.target || ''))
+        const p = propos.get(idSafe(String(a.target || ''))) // M9：命题键已归一化
         if (!p || p.概率 === 1 || p.概率 === 0 || p.优先级 === 'never' || p.在问题清单) continue
         if (Number(p.价值关键性) < Number(params.promoteValueThreshold)) continue
-        out.push({ action: 'promote', target: String(a.target || ''), reason: String(a.reason || '') })
+        out.push({ action: 'promote', target: p.id, reason: String(a.reason || '') })
       } else if (act === 'wait' || act === 'continue' || act === 'stop') {
         out.push(Object.assign({ action: act }, a.childId ? { childId: String(a.childId) } : {}, a.target ? { target: String(a.target) } : {}, { reason: String(a.reason || '') }))
       }
@@ -1974,7 +2077,9 @@ export function apply(ctx) {
       if (parsed.lessons) dir.lessons = (dir.lessons || []).concat(parsed.lessons)
       if (parsed.blockers) dir.blockers = (dir.blockers || []).concat(parsed.blockers)
       if (parsed.dead_end_reason) dir.dead_end_reason = parsed.dead_end_reason
+      // M11：`survival_probability`（遗留扁平名）与 `survival`（提示词名）都接受。
       if (typeof parsed.survival_probability === 'number') dir.survival = clamp01(parsed.survival_probability)
+      else if (typeof parsed.survival === 'number') dir.survival = clamp01(parsed.survival)
       if (parsed.lemmas && parsed.lemmas.length) { for (let i = 0; i < parsed.lemmas.length; i++) { const lid = await addLemmaAsProposition(qid, parsed.lemmas[i]); if (lid) { dir.lemmas = dir.lemmas || []; dir.lemmas.push({ id: lid, title: parsed.lemmas[i].title || '' }) } } }
       if (parsed.sub_questions && parsed.sub_questions.length) { for (let i = 0; i < parsed.sub_questions.length; i++) { const sq = parsed.sub_questions[i]; if (sq && sq.q_sub_statement && dir.sub_questions && dir.sub_questions.some(function (x) { return x.statement === sq.q_sub_statement })) continue; const rec = await addSubQuestion(qid, dirId, sq); if (rec) { dir.sub_questions = dir.sub_questions || []; dir.sub_questions.push(rec) } } }
       // journal narrative (论文式续写：把本轮叙述追加进研究日志)
@@ -1988,11 +2093,16 @@ export function apply(ctx) {
       await consumeMethodFeedback(parsed, { qid: qid, dirId: dirId })
     }
     if (status === 'success') {
-      if (parsed && parsed.solution) {
+      // M11：遗留扁平通道的字段名（solution / solution_probability）与提示词教的名字
+      // （solution_text / solution_prob）不一致 ⇒ 严格按提示词回写的 solver 会掉进 else 分支，
+      // 在轮次上限处被判成"claimed success without solution"并把方向写死。两套名字都接受。
+      const flatSolution = (parsed && parsed.solution != null) ? parsed.solution : (parsed ? parsed.solution_text : undefined)
+      const flatSolutionProb = (parsed && parsed.solution_probability != null) ? parsed.solution_probability : (parsed ? parsed.solution_prob : undefined)
+      if (parsed && flatSolution) {
         dir.status = 'success'
         delete agentRegistry[childId]
         logActivity('solver', qid + '/' + dirId + ' success at round ' + meta.round)
-        await addSolution(qid, parsed.solution, parsed.solution_probability)
+        await addSolution(qid, flatSolution, flatSolutionProb)
       } else {
         if (meta.round >= params.solverMaxRounds) {
           dir.status = 'dead-end'; dir.dead_end_reason = dir.dead_end_reason || 'claimed success without solution at iteration cap'
@@ -2031,12 +2141,14 @@ export function apply(ctx) {
   function statusFromStop(stopReason) { return (stopReason === 'completed' || stopReason === 'max-tokens') ? 'continue' : 'dead-end' }
   async function addLemmaAsProposition(qid, lemma) {
     if (!lemma || !lemma.title) return
-    let be = clamp01(lemma.布尔估计 != null ? lemma.布尔估计 : 0.6)
+    // M11：`prob`（提示词名）与 `布尔估计`（遗留扁平名）都接受；`分类` 与 `细类型` 同理。
+    const rawProb = lemmaProb(lemma)
+    let be = clamp01(rawProb != null ? rawProb : 0.6)
     if (be >= 1) be = 0.99; else if (be <= 0) be = 0.01
     const p = {
       id: 'p-' + shortId(), 标题: lemma.title, 状态: '未定论', 概率: be,
       优先级: (lemma.优先级 != null) ? lemma.优先级 : 1, 依赖: [], 价值关键性: clamp01(lemma['价值/关键性'] != null ? lemma['价值/关键性'] : 0.5),
-      分类: categoryOf({ 分类: Object.keys(lemma.细类型 || { 未分类: {} })[0] || '未分类' }),
+      分类: categoryOf({ 分类: lemmaCategory(lemma) || '未分类' }),
       陈述: lemma.statement || lemma.title,
       proofs: [{ title: lemma.title + '（证明）', prob: clamp01(0.7), status: '未定论', text: lemma.proof || '' }],
       refutes: [], 来源问题: qid, 在问题清单: false,
@@ -2101,21 +2213,23 @@ export function apply(ctx) {
     if (Array.isArray(parsed.methods_used)) {
       for (const mu of parsed.methods_used) {
         if (!mu || !mu.id) continue
-        const m = methods.get(mu.id) || globalMethods.get(mu.id)
+        // M9：方法键一律是 idSafe(id)，代理给的是原始 id ⇒ 查表前归一化。
+        const muId = idSafe(mu.id)
+        const m = methods.get(muId) || globalMethods.get(muId)
         if (!m) {
           // 未知 id：solver 引用了一个尚未入卡的方法/技巧 → 作为待沉淀发明记录，防引用丢失（Method Keeper 将据此建卡）
-          methodLog.pendingInventions.push({ at: now(), 来源: ctx.qid ? ('问题 ' + ctx.qid + (ctx.dirId ? ' 方向 ' + ctx.dirId : '')) : '', 类型: '方法', 标题: String(mu.id), 内容描述: (mu.效果 || '') + (mu.建议 ? '；建议：' + mu.建议 : '') })
-          logActivity('method', 'methods_used referenced unknown method ' + mu.id + ' → queued as pending invention')
+          methodLog.pendingInventions.push({ at: now(), 来源: ctx.qid ? ('问题 ' + ctx.qid + (ctx.dirId ? ' 方向 ' + ctx.dirId : '')) : '', 类型: '方法', 标题: String(muId), 内容描述: (mu.效果 || '') + (mu.建议 ? '；建议：' + mu.建议 : '') })
+          logActivity('method', 'methods_used referenced unknown method ' + muId + ' → queued as pending invention')
           continue
         }
-        if (methods.has(mu.id)) {
+        if (methods.has(muId)) {
           // 只记录"有实际问题/方向上下文"的引用；method-keeper 纯整理时的引用（qid/dirId 皆空）不当作应用，
           // 避免把"整理时引用该方法"误记为"实际应用"，从而污染应用计数并触发错误的全局晋升。
           if (ctx.dirId || ctx.qid) {
             m.applications = m.applications || []
             m.applications.push({ at: fmtTime(), 问题: ctx.qid || '', 方向: ctx.dirId || '', text: (mu.效果 || '') + (mu.建议 ? '；建议：' + mu.建议 : '') })
             await saveMethod(m, false)
-            logActivity('method', 'application record appended to ' + mu.id + ' (问题 ' + ctx.qid + ' 方向 ' + ctx.dirId + ')')
+            logActivity('method', 'application record appended to ' + muId + ' (问题 ' + ctx.qid + ' 方向 ' + ctx.dirId + ')')
           }
         }
       }
@@ -2871,7 +2985,15 @@ export function apply(ctx) {
     const id = formalId(target)
     if (!id) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'defect 记录必须写明 target' }
     const prev = formalOf(id)
-    const archived = String(prev.proof || '').trim() || ('Verified/Lean/' + id + '.lean')
+    // 撤回目标（审计 L2）：只在**确实有过归档证明**时才撤回。此前 prev.proof 为空时也会拿
+    // 'Verified/Lean/<id>.lean' 去撤，而 withdrawArchivedProof 在文件删不掉/不存在时会**就地覆盖写**
+    // ——于是一个从未有过证明的对象会在"所有人都来这里找证明"的目录里凭空多出一份撤回声明文件。
+    let archived = String(prev.proof || '').trim()
+    if (!archived) {
+      const fallback = 'Verified/Lean/' + id + '.lean'
+      const abs = leanAbsPath(fallback)
+      if (abs !== null && (await readTextAbs(abs)) !== undefined) archived = fallback
+    }
     await putFormal(id, Object.assign({}, prev, {
       status: 'attempted',
       decision: 'defect',
@@ -2880,7 +3002,7 @@ export function apply(ctx) {
       updatedAt: now(),
     }))
     // 归档证明必须消失，否则 Verified/Lean/ 里会留下一份"看起来已通过"的不忠实代码。
-    const withdrawn = await withdrawArchivedProof(archived)
+    const withdrawn = archived ? await withdrawArchivedProof(archived) : 'none'
     // 待办条目按 id 去重、就地刷新：note 进入 TODO.md 的 why 列（require 档据此搁置定论）。
     const list = formalTodo()
     const i = list.findIndex(function (x) { return x && x.id === id })
@@ -2892,12 +3014,13 @@ export function apply(ctx) {
     await rebuildLeanLibIndexes()
     await saveAll()
     // 如实说出**哪一种**撤回发生了：删除成功 / 就地覆盖 / 两者都失败（后者必须让人手动处理，
-    // 否则一份不忠实的代码会静静留在"证明"的路径上而无人知晓）。
+    // 否则一份不忠实的代码会静静留在"证明"的路径上而无人知晓）。'none' = 本来就没有归档证明。
     await formalAnnounce('【形式化】' + who + ' 认定 ' + id + ' 的 Lean 形式化存在**忠实性缺陷**：' + note
       + '。这不是"命题为假"，而是**形式化不合格**：已撤回其「已通过」状态（降级为 attempted）、'
-      + (withdrawn === 'deleted' ? '删除归档证明 ' + archived
-        : withdrawn === 'overwritten' ? '归档证明 ' + archived + ' 无法删除（宿主不支持删除），已**就地覆盖为撤回声明**'
-          : '归档证明 ' + archived + ' **未能撤回**（宿主删除与覆盖均失败，请手动删除，不要把它当作该对象的证明）')
+      + (withdrawn === 'none' ? '该对象此前没有任何归档证明，无需撤回'
+        : withdrawn === 'deleted' ? '删除归档证明 ' + archived
+          : withdrawn === 'overwritten' ? '归档证明 ' + archived + ' 无法删除（宿主不支持删除），已**就地覆盖为撤回声明**'
+            : '归档证明 ' + archived + ' **未能撤回**（宿主删除与覆盖均失败，请手动删除，不要把它当作该对象的证明）')
       + '、写入 Formal/TODO.md；'
       + (formalMode() === 'require'
         ? '本次裁定**不定论**，修正形式化并重新跑通（vibe_math_lean_archive kind=\'proof\'）后再投票。'
@@ -2952,6 +3075,26 @@ export function apply(ctx) {
   }
 
   // ================= verification (验证器) =================
+  /**
+   * 一个判决对象**至少**需要几票。
+   *
+   * H5：此前没有任何下限——`maxParallelThreshold=1` 时 backfillVerifiers 只派出 1 个验证器，
+   * 它一结束 `allReported`（只看"已存在的孩子是否都报了"）即为真，`consensus` 对单元素数组
+   * 恒真，于是跳过全部辩论直接 `finalVerdict → 1 → settleVerdict`，写出 `概率:1/已验证·真`
+   * 并落 `Verified/`。`Verified/` 是所有提示词的"绝对可信"层，一票定论 = 一个验证器的偏见
+   * 直接变成下游全部代理的"已知事实"。
+   *
+   * 下限取 max(2, expectedCount)：verifierCount=1 不是"允许单票"，只是"至少 2 个独立验证器"
+   * （与 createVerifyTask 的 `Math.max(2, ...)` 一致）。
+   */
+  function minVotes(t) { return Math.max(2, Number(t && t.expectedCount) || 0, Number(params.verifierCount) || 0) }
+  function haveEnoughVotes(t) { return Object.keys(t.childResults).length >= minVotes(t) }
+  /** 所有已派出的验证器都报了本轮的票，**且**票数达到下限——否则不得推进/裁决。 */
+  function allReportedWithQuorum(t, round) {
+    if (!t || !Array.isArray(t.children) || t.children.length === 0) return false
+    if (t.children.length < Math.max(2, Number(t.expectedCount) || 0)) return false
+    return t.children.every(function (cid) { const r = t.childResults[cid]; return r && r.round === round })
+  }
   function consensus(t) { const vs = Object.keys(t.childResults).map(function (cid) { return t.childResults[cid].Result }); if (vs.length === 0) return false; return vs.every(function (v) { return v === 1 }) || vs.every(function (v) { return v === 0 }) }
   function buildTranscript(t) { const parts = []; const cids = Object.keys(t.childResults); for (let i = 0; i < cids.length; i++) { const r = t.childResults[cids[i]]; parts.push('Reviewer ' + i + ': Result=' + r.Result + ' Reason=' + r.Reason) } return parts.join('\n') }
   async function handleVerifier(childId, meta, output, stopReason) {
@@ -2974,12 +3117,16 @@ export function apply(ctx) {
     if (t.children.indexOf(childId) === -1) t.children.push(childId)
     t.childResults[childId] = { Result: Result, Reason: Reason, round: meta.round }
     delete agentRegistry[childId]
-    const allReported = t.children.length > 0 && t.children.every(function (cid) { const r = t.childResults[cid]; return r && r.round === meta.round })
-    if (!allReported) { await saveAll(); return }
+    // H5：推进/裁决的前置条件是"已凑齐下限票数且本轮都已回报"，不是"目前存在的那几个孩子都报了"。
+    // 未凑齐时保持 spawning，由 reconcileVerify 在后续 tick 里补派验证器（不裁决、不定论）。
+    if (!allReportedWithQuorum(t, meta.round)) { await saveAll(); return }
     await advanceVerification(t, meta.round)
     await saveAll()
   }
   async function advanceVerification(t, round) {
+    // H5 第二道闸门：票数不足下限时**不辩论、不裁决**，回到 spawning 等 reconcileVerify 补派。
+    // 放在最前面：即便 handleVerifier 因为"孩子被删除"等边缘情形推进到这里，也绝不定论。
+    if (!haveEnoughVotes(t)) { t.status = 'spawning'; return }
     if (round < params.debateMaxRounds && !consensus(t) && t.children.length > 0) {
       if (!scheduler.running) { t.status = 'paused'; return }
       if (activeCount() >= params.maxParallelThreshold) { t.status = 'paused'; return }
@@ -3008,6 +3155,8 @@ export function apply(ctx) {
     }
   }
   async function finalizeVerification(t) {
+    // H5 最后一道闸门：票数不足下限时**决不**给出裁决（单票绝不结论）。
+    if (!haveEnoughVotes(t)) { t.status = 'spawning'; return }
     const verdict = finalVerdict(t)
     if (params.mode === 'manual') {
       const d = enqueueDecision('verdict', 'verdict for ' + t.rId + ' (debate finished) = ' + verdict, { rId: t.rId, verdict: verdict, task: JSON.parse(JSON.stringify(t)) })
@@ -3033,16 +3182,14 @@ export function apply(ctx) {
       if (mean >= 0.85 || mean <= 0.15) return Math.max(0.01, Math.min(0.99, mean))
     }
     if (params.verdictMode === 'forced') {
-      let num = 0; let den = 0
-      const cids = Object.keys(t.childResults)
-      for (let i = 0; i < rs.length; i++) {
-        const acc = verifierAccuracy[cids[i]] || { correct: 0, total: 0 }
-        const accRate = acc.total > 0 ? (acc.correct / acc.total) : 0.5
-        const confident = (rs[i].Result === 1 || rs[i].Result === 0) ? 0.1 : 0
-        const w = Math.max(0.05, Math.min(0.95, accRate + confident))
-        num += w * rs[i].Result; den += w
-      }
-      return den > 0 ? Math.max(0.01, Math.min(0.99, num / den)) : 0.5
+      // M8：这里**不再**按 verifierAccuracy 加权。那份统计量统计的是"这一票与该次裁决是否一致"，
+      // 而裁决本身就是同一批票的聚合——即"与自己一致"（注：v 为加权均值时 `Result === v` 几乎恒假，
+      // 于是它其实把"从众度"记成 0），且没有任何后续真值（Lean 通过 / 被 defect 撤回 / 命题被反证）
+      // 会纠正它。用这样一个量去加权，放大而非抑制系统性偏见，与"按历史准确率加权"的宣称相反。
+      // 改为**等权**取均值：每票按自己报出的概率贡献，本身就是该验证器的贝叶斯式估计；
+      // 严格的 1/0 是绝对投票，其影响已通过数值本身（拉向端点）自然体现，无需人为加权。
+      let sum = 0; for (let i = 0; i < rs.length; i++) sum += rs[i].Result
+      return Math.max(0.01, Math.min(0.99, sum / rs.length))
     }
     return 0.5
   }
@@ -3050,12 +3197,17 @@ export function apply(ctx) {
     const v = clamp01(verdict)
     const r = t.r
     const cids = Object.keys(t.childResults)
+    // 票数记录保留（Logs/Verification 与 State/verifier_accuracy.json 是审计轨迹），但该统计量
+    // **不再**参与任何加权（见 finalVerdict 的 M8 说明）。这里记的是"该票的实际概率"而非布尔值：
+    // 原来的 `Result === v` 记法在 v 为加权均值时几乎不可能相等，等于把"从众度"记成 0，
+    // 与字段名 correct/total 的含义相去更远。
     for (let i = 0; i < cids.length; i++) {
       const acc = verifierAccuracy[cids[i]] || { correct: 0, total: 0 }
       acc.total += 1
-      if (t.childResults[cids[i]].Result === v) acc.correct += 1
+      if (Number(t.childResults[cids[i]].Result) === v) acc.correct += 1
       verifierAccuracy[cids[i]] = acc
     }
+    pruneVerifierAccuracy()
     await writeJson('Logs/Verification/' + t.rId + '_' + Date.now() + '.json', { r: r, verdict: v, results: t.childResults, transcript: buildTranscript(t), history: t.history || [], at: now() })
     // ── require 门禁（契约 §8）────────────────────────────────────────────────
     // 判定为真（严格证明）或假（严格反驳）之前必须先有 `passed` 或 `blocked`。门禁放在**改
@@ -3152,13 +3304,493 @@ export function apply(ctx) {
     return best
   }
 
+  // ==========================================================================================
+  // 最终论文（规格：docs/final-paper.md）—— 会话侧（v3 数据来源：md 知识库）。
+  //
+  // 时序（修订 §A2/§A3）：v3 的收口信号是 checkTermination() 的完整收口分支（无未解决问题、
+  // `leftoverVerify` 为空——**这才是真实完整性判据**（§A4）、无真实在途代理、无任务/计划/挂起门）。
+  // 撰写子代理必须在 `scheduler.running=false` 与 `releaseProjectLock()` **之前**派遣
+  // （停止后 scheduleTick() 是空操作；提前释放项目锁后另一会话可能写同一棵树）。派不出去
+  // （宿主激活上限 ACTIVATION_LIMIT_REACHED）→ 排队 + apply 级心跳重试 + 可见告警。
+  // 落盘（§C/§D）：md/tex 是文本；**paper.pdf 只能由编译器子进程生成**、插件只 stat 且**永不删除/覆盖**；
+  // paper.meta.json 最后写（原子提交点）；幂等 = run id + finalizedAt + 逐产物存在性（不用稳定哈希）。
+  // ==========================================================================================
+  let paperInFlight = ''            // 正在撰写的 childId
+  let paperInFlightAt = 0           // 派遣时刻（判定卡死窗口；force 与心跳都据它降级）
+  let paperReaps = 0                // 本 run 内已回收卡死撰写者的次数（自动重派上限）
+  const paperAbandoned = {}         // childId -> true：已放弃的撰写者；它事后返回时输出被丢弃并留痕
+  let paperPending = null           // 激活上限排队重试：{ tries, retryAt, reason, limit, trigger, opts }
+  const PAPER_RETRY_MS = 5000
+  const PAPER_MAX_RETRIES = 12
+  const PAPER_STALE_MS = 10 * 60 * 1000 // 撰写者卡死窗口：超过它，force 与心跳都会回收并重派（10 分钟）
+  const PAPER_MAX_AUTO_REAPS = 2    // 心跳自动回收+重派的次数上限，之后交给 /vibe paper force
+  const PAPER_LOCK_STALE_MS = 120000
+  function activationLimitFrom(message) { const m = /active child limit:\s*(\d+)/.exec(String(message == null ? '' : message)); return m ? Number(m[1]) : undefined }
+  function paperId(opts) { return paperDirId((opts && opts.id) || currentProject) }
+  function paperDir(id) { return 'Paper/' + paperDirId(id) }
+  function paperAbsDir(id) { return frameworkRoot() + '/' + paperDir(id) }
+  function paperAuthorLine() { return 'Vibe Math V3（单作者：论文撰写子代理）· 项目 ' + currentProject }
+  function paperOpts(opts) {
+    const o = opts || {}
+    const fmt = (o.format === 'md' || o.format === 'tex' || o.format === 'both') ? o.format : ((params.paperFormat === 'md' || params.paperFormat === 'tex') ? params.paperFormat : 'both')
+    const lang = (o.lang === 'en' || o.lang === 'zh') ? o.lang : (params.paperLanguage === 'en' ? 'en' : 'zh')
+    const compilePdf = (o.compilePdf === true || o.compilePdf === false) ? o.compilePdf : (params.paperCompilePdf !== false)
+    return { format: fmt, lang: lang, compilePdf: compilePdf, force: o.force === true, id: o.id }
+  }
+  async function paperReadMeta(id) { const m = await readJson(paperDir(id) + '/paper.meta.json'); return (m && typeof m === 'object' && !Array.isArray(m)) ? m : undefined }
+  async function paperPathExists(rel) { try { const t = await fsTarget(rel); return (await fs.stat(t)) !== undefined } catch (e) { return false } }
+  async function paperAppendLog(id, tag, text) {
+    const rel = paperDir(id) + '/paper.log.md'
+    const prev = await readText(rel)
+    const head = (prev === undefined || !String(prev).trim()) ? (paperLogHead(id).join('\n') + '\n') : String(prev)
+    await writeText(rel, head + paperLogLine(now(), tag, text) + '\n')
+  }
+  /** paper 作用域锁（修订 §A3）：v3 在收口时已释放项目锁，用它防止两个会话同时写同一棵 Paper/ 树。 */
+  async function paperLockAcquire(id) {
+    const rel = paperDir(id) + '/paper.lock.json'
+    const cur = await readJson(rel)
+    if (cur && cur.sessionId && cur.sessionId !== sessionId && (now() - Number(cur.at || 0)) < PAPER_LOCK_STALE_MS) return { ok: false, holder: String(cur.sessionId), at: Number(cur.at || 0) }
+    await writeJson(rel, { sessionId: sessionId, at: now(), project: currentProject })
+    return { ok: true }
+  }
+  async function paperLockRelease(id) {
+    const rel = paperDir(id) + '/paper.lock.json'
+    const cur = await readJson(rel)
+    if (cur && cur.sessionId === sessionId) await writeJson(rel, { sessionId: '', at: now(), released: true })
+  }
+  /**
+   * 回收卡死的撰写者（修订 §1：死掉的撰写者绝不能把论文永久卡住）。清状态 + 尽力中断 +
+   * 从 agentRegistry 摘除（否则一直被算作活跃子代理）+ 记进 paperAbandoned（事后返回的输出被明确
+   * 丢弃并留痕）+ 可见告警。
+   */
+  async function paperReapWriter(id, why) {
+    const cid = paperInFlight
+    paperInFlight = ''; paperInFlightAt = 0
+    if (cid) {
+      try { await interruptChild(cid) } catch (e) { /* best effort */ }
+      delete agentRegistry[cid]
+      paperAbandoned[cid] = true
+    }
+    await paperAppendLog(id, 'reap', '回收卡死的撰写者 ' + (cid || '(未知)') + '：' + why + '（论文不会被永久卡住；force/心跳会继续）')
+    logActivity('paper', '回收卡死的论文撰写子代理 ' + (cid || '(未知)') + '：' + why)
+    console.error('vibe-math-v3: reaped a stalled paper writer (' + (cid || 'unknown') + '): ' + why)
+    reportDirty = true
+    return cid
+  }
+  function paperWriterVerdictNow(force) {
+    return paperWriterVerdict({ inFlight: !!paperInFlight, force: !!force, ageMs: now() - Number(paperInFlightAt || 0), staleMs: PAPER_STALE_MS, childInRegistry: paperInFlight ? (agentRegistry[paperInFlight] !== undefined) : true })
+  }
+  function paperOneLine(s, cap) { return String(s == null ? '' : s).replace(/\s+/g, ' ').trim().slice(0, cap || 400) }
+  /** 证据索引（spec §3.9）：只列**确实存在**的文件；排除 Paper/ 自己（避免自我污染）。
+   *  formalVerify=off 必须真的是无操作（formal-verify-v3 的语料守卫断言"off 的提示词里零 Lean 文本"），
+   *  所以 off 档不把形式化路径写进材料。 */
+  async function paperEvidenceIndex() {
+    const formalNow = formalOn()
+    const out = []
+    if (formalNow && await paperPathExists('State/formal.json')) out.push('State/formal.json')
+    if (await paperPathExists('State/index.json')) out.push('State/index.json')
+    for (const p of allProblems()) out.push(problemRel(p))
+    for (const p of allPropos()) out.push(propositionRel(p))
+    for (const m of methods.values()) out.push(methodRel(m, false))
+    const dirs = ['Verified/命题', 'Verified/问题', 'Logs/Verification', 'Logs/Plans', 'Progress'].concat(formalNow ? ['Verified/Lean', 'Formal'] : [])
+    for (let i = 0; i < dirs.length; i++) { const files = await listFiles(dirs[i]); for (let j = 0; j < files.length; j++) out.push(dirs[i] + '/' + files[j]) }
+    const seen = {}, uniq = []
+    for (let i = 0; i < out.length; i++) { const x = String(out[i]); if (seen[x] || x.indexOf('Paper/') === 0) continue; seen[x] = true; uniq.push(x) }
+    return uniq.sort()
+  }
+  /** 汇总材料（spec §4 + 修订 §A4）：只含既有证据；未决项（含 leftoverVerify 的待验证对象）显式标注。 */
+  async function buildPaperDigest() {
+    const L = []
+    L.push('PRESET: vibe-math-v3 (single-author)')
+    L.push('PROJECT: ' + currentProject)
+    const qs = allProblems()
+    L.push('')
+    L.push('[ORIGINAL PROBLEMS] (Problems/*.md)')
+    if (qs.length === 0) L.push('- (none)')
+    for (let i = 0; i < qs.length; i++) {
+      const q = qs[i]
+      L.push('- id=' + q.id + ' | 状态=' + q.状态 + ' | 优先级=' + q.优先级 + ' | 依赖=' + JSON.stringify(q.依赖 || []) + ' | 来源=' + (q.来源 || '原始') + ' | 陈述=' + paperOneLine(q.陈述, 800))
+      const dirs = getDirState(q.id)
+      if (dirs.length) L.push('    · 方向：' + dirs.map(function (d) { return d.id + ':' + d.status }).join(', '))
+      const sols = q.solutions || []
+      if (sols.length === 0) L.push('    · 解法：无')
+      for (let j = 0; j < sols.length; j++) L.push('    · 解法#' + j + ' 概率=' + sols[j].prob + ' 状态=' + (sols[j].status || '') + ' 证据=Verified/问题/ 与 Logs/Verification/ | ' + paperOneLine(sols[j].text, 1200))
+    }
+    const ps = allPropos()
+    L.push('')
+    L.push('[PROPOSITIONS] (Propos/<分类>/<id>.md)')
+    if (ps.length === 0) L.push('- (none)')
+    for (let i = 0; i < ps.length; i++) {
+      const p = ps[i]
+      const rec = formalOn() ? formalOf(p.id) : null   // off 档不把形式化字段写进材料（off 是真无操作）
+      L.push('- id=' + p.id + ' | 概率=' + p.概率 + ' | 状态=' + p.状态 + ' | 优先级=' + p.优先级 + ' | 价值/关键性=' + p.价值关键性 + ' | 来源问题=' + (p.来源问题 || '') + (rec ? (' | 形式化=' + ((rec && rec.status) || 'none') + (rec && rec.proof ? ('（' + rec.proof + '）') : '')) : '') + ' | 陈述=' + paperOneLine(p.陈述, 800))
+      const sides = [['证明', p.proofs || []], ['证伪', p.refutes || []]]
+      for (let k = 0; k < sides.length; k++) { const arr = sides[k][1]; for (let j = 0; j < arr.length; j++) if (arr[j] && arr[j].prob === 1) L.push('    · 已检验通过：' + sides[k][0] + '#' + j + ' | ' + paperOneLine(arr[j].text, 900)) }
+    }
+    L.push('')
+    L.push('[METHODS / ARTEFACTS] (Methods/ + 全局 VibeMath/Methods/)')
+    const ms = Array.from(methods.values()).concat(Array.from(globalMethods.values()))
+    if (ms.length === 0) L.push('- (none)')
+    for (let i = 0; i < ms.length; i++) {
+      const m = ms[i]
+      L.push('- id=' + m.id + ' | 标题=' + m.标题 + ' | 类型=' + m.类型 + ' | 状态=' + m.状态 + ' | 可信断言=' + JSON.stringify(m.可信断言 || []) + ' | 应用次数=' + ((m.applications || []).length) + ' | 核心内容=' + paperOneLine(m.核心内容, 900))
+    }
+    // §A4：v3 的真实完整性判据是 leftoverVerify（buildVerifyCandidates）——把仍未验证的对象列出来。
+    let cands = []
+    try { cands = await buildVerifyCandidates() } catch (e) { /* 尽力而为 */ }
+    L.push('')
+    L.push('[STILL UNVERIFIED — v3 的完整性判据 leftoverVerify（buildVerifyCandidates）；必须标注为未决]')
+    if (cands.length === 0) L.push('- (none — 没有待验证对象)')
+    for (let i = 0; i < cands.length; i++) L.push('- 未决：' + cands[i].rId + '（' + cands[i].kind + '，' + paperOneLine(cands[i].概述, 200) + (cands[i].prob === undefined ? '' : ('，prob=' + cands[i].prob)) + '）')
+    L.push('')
+    L.push('[UNRESOLVED / REFUTED — 论文里必须显式标注，不得当成已成立的结论]')
+    let any = false
+    for (let i = 0; i < ps.length; i++) {
+      if (!(ps[i].概率 === 1 || ps[i].概率 === 0)) { any = true; L.push('- 未定论：命题 ' + ps[i].id + '（概率=' + ps[i].概率 + '）') }
+      else if (ps[i].概率 === 0) L.push('- 已被否证：命题 ' + ps[i].id)
+    }
+    for (let i = 0; i < qs.length; i++) {
+      const sols = qs[i].solutions || []
+      for (let j = 0; j < sols.length; j++) if (!(sols[j].prob === 1 || sols[j].prob === 0)) { any = true; L.push('- 未定论：问题 ' + qs[i].id + ' 的解法#' + j + '（概率=' + sols[j].prob + '）') }
+    }
+    if (!any && cands.length === 0) L.push('- (none — 所有对象均已定论)')
+    L.push('')
+    L.push('[EVIDENCE INDEX] (only files that exist)')
+    const ev = await paperEvidenceIndex()
+    for (let i = 0; i < ev.length; i++) L.push('- ' + ev[i])
+    return L.join('\n')
+  }
+  /** 「论文撰写」子代理提示词（单作者；与 v2 同一形状/同一骨架）。 */
+  function paperWriterPrompt(digest, o) {
+    const langName = o.lang === 'en' ? 'English' : '中文（Chinese）'
+    return 'You are the DEDICATED PAPER WRITER (single-author mode) of a math research run that has just CONVERGED.\n' +
+      'Write its final paper in ' + langName + ', using ONLY the evidence in the MATERIAL section below.\n\n' +
+      'HARD RULES:\n' +
+      '- NEVER invent content: no new proposition, no new computation, no citation that is not in the MATERIAL.\n' +
+      '- Unresolved or refuted items MUST be explicitly labelled (「未定论」/「已被否证」, or "unresolved"/"refuted" in English); never present them as established.\n' +
+      '- Fixed 9-section skeleton — provide bodies for these EXACT `## ` headings (the framework writes the headings, author/date and the evidence index itself):\n' +
+      PAPER_SKELETON.map(function (s, i) { return '    ' + (i + 1) + '. ' + s.key + ' — ' + s.spec }).join('\n') + '\n' +
+      '- A section with no evidence must be exactly 「' + PAPER_NO_EVIDENCE + '」 (do not pad it).\n' +
+      '- Markdown subset only: `#`/`##`/`###`, `- ` lists, `**bold**`, `*em*`, `` `code` ``, and inline math as `$...$`. No tables, images, footnotes or raw HTML.\n\n' +
+      'OUTPUT CONTRACT — respond with ONLY one ```json code fence, no prose:\n' +
+      '{"title":"<paper title>","abstract":"<original problem + main results>","sections":[{"name":"<one of the 9 headings>","body":"<markdown>"}, ...]}\n\n' +
+      'MATERIAL (evidence only — do not add anything beyond it):\n' + digest
+  }
+  /** LaTeX 检测（spec §5 + 修订 §D）：paperLatexCommand 非空时只用它；否则按语言顺序探测。 */
+  async function paperDetectLatex(lang) {
+    const sub = subprocessOf()
+    if (sub === undefined || typeof sub.spawn !== 'function') return { available: [], reason: 'no-subprocess' }
+    if (typeof sub.resolveExecutable !== 'function') return { available: [], reason: 'no-resolveExecutable' }
+    const forced = String(params.paperLatexCommand || '').trim()
+    if (forced) {
+      try { const p = await sub.resolveExecutable(forced); return p ? { available: [{ name: forced, path: String(p) }], reason: 'ok', forced: true } : { available: [], reason: 'paperLatexCommand not found: ' + forced, forced: true } }
+      catch (e) { return { available: [], reason: 'paperLatexCommand not found: ' + forced, forced: true } }
+    }
+    const order = lang === 'en' ? PAPER_ENGINE_ORDER_EN : PAPER_ENGINE_ORDER_ZH
+    const available = []
+    for (let i = 0; i < order.length; i++) {
+      try { const p = await sub.resolveExecutable(order[i]); if (p) available.push({ name: order[i], path: String(p) }) } catch (e) { /* 未安装 */ }
+    }
+    return { available: available, reason: available.length ? 'ok' : 'none' }
+  }
+  function paperArgvFor(engine) {
+    if (engine.name === 'latexmk') return [engine.path, '-pdf', '-interaction=nonstopmode', '-halt-on-error', 'paper.tex']
+    if (engine.name === 'tectonic') return [engine.path, '--keep-logs', 'paper.tex']
+    return [engine.path, '-interaction=nonstopmode', '-halt-on-error', 'paper.tex']
+  }
+  /** 一次编译（nonstopmode），带主动超时 terminate。 */
+  async function paperRunOnce(engine, dirAbs, capMs) {
+    const sub = subprocessOf()
+    if (sub === undefined || typeof sub.spawn !== 'function') return { ok: false, exitCode: null, code: 'NO_SUBPROCESS' }
+    let handle
+    try { handle = sub.spawn({ argv: paperArgvFor(engine), cwd: dirAbs, stdio: { stdin: 'ignore', stdout: { maxBytes: 64 * 1024 }, stderr: { maxBytes: 64 * 1024 } }, graceMs: capMs }) }
+    catch (e) { return { ok: false, exitCode: null, code: 'SPAWN_FAILED', message: String((e && e.message) || e) } }
+    let timedOut = false, timer = null, outcome
+    try {
+      outcome = await Promise.race([
+        handle.done,
+        new Promise(function (resolve) { timer = setTimeout(function () { timedOut = true; try { if (handle && typeof handle.terminate === 'function') handle.terminate() } catch (e) { /* best effort */ } resolve({ exitCode: null }) }, capMs) }),
+      ])
+    } catch (e) { if (timer !== null) clearTimeout(timer); return { ok: false, exitCode: null, code: 'RUN_FAILED', message: String((e && e.message) || e) } }
+    if (timer !== null) clearTimeout(timer)
+    let err = ''
+    try { if (handle.collected && handle.collected.stderr) err = String(handle.collected.stderr.readFrom(0).text || '') } catch (e) { /* best effort */ }
+    return { ok: !timedOut && !!outcome && outcome.exitCode === 0, exitCode: outcome ? outcome.exitCode : null, timedOut: timedOut, stderr: err.slice(-1200) }
+  }
+  /**
+   * 编译（spec §5 + 修订 §D/§E）：主引擎（nonstopmode，两遍）→ 换引擎 → 去不支持宏包 → 最小模板再试一次；
+   * 然后报告并降级。**永不删除/覆盖已有 pdf**：成功判据 = 本次运行 exit 0 **且** pdf 存在。
+   */
+  async function paperCompile(id, o, texPrimary, bodyTex) {
+    const relDir = paperDir(id), absDir = paperAbsDir(id)
+    const attempts = []
+    if (!o.compilePdf) return { compile: 'skipped', reason: 'paperCompilePdf=false', engine: null, attempts: attempts, pdfPreserved: await paperPathExists(relDir + '/paper.pdf') }
+    if (o.format === 'md') return { compile: 'skipped', reason: 'paperFormat=md（不产出 tex，跳过编译）', engine: null, attempts: attempts, pdfPreserved: await paperPathExists(relDir + '/paper.pdf') }
+    const det = await paperDetectLatex(o.lang)
+    if (det.available.length === 0) {
+      await paperAppendLog(id, 'latex', '未检测到任何 LaTeX 引擎（' + det.reason + '）→ 只保留 paper.tex + paper.md，不编译 pdf（spec §5：不阻塞定稿）')
+      return { compile: 'not-detected', reason: det.reason, engine: null, attempts: attempts, pdfPreserved: await paperPathExists(relDir + '/paper.pdf') }
+    }
+    await paperAppendLog(id, 'latex', '检测到引擎 ' + det.available.map(function (x) { return x.name }).join(', ') + (det.forced ? '（paperLatexCommand 指定）' : ('（顺序 ' + (o.lang === 'en' ? PAPER_ENGINE_ORDER_EN : PAPER_ENGINE_ORDER_ZH).join(' > ') + '）')))
+    const plan = [{ engine: det.available[0], tex: texPrimary, mode: 'primary' }]
+    if (det.available[1]) plan.push({ engine: det.available[1], tex: texPrimary, mode: 'engine-fallback' })
+    plan.push({ engine: det.available[0], tex: paperSanitizeTex(texPrimary), mode: 'drop-unsupported-packages' })
+    plan.push({ engine: det.available[0], tex: paperMinimalTexDoc({ lang: o.lang, bodyTex: bodyTex }), mode: 'minimal-template' })
+    const cap = 120000
+    for (let i = 0; i < plan.length; i++) {
+      const step = plan[i]
+      await writeText(relDir + '/paper.tex', step.tex)
+      const runs = []
+      for (let pass = 0; pass < 2; pass++) runs.push(await paperRunOnce(step.engine, absDir, cap))
+      const last = runs[runs.length - 1]
+      const pdf = !!last.ok && await paperPathExists(relDir + '/paper.pdf')
+      attempts.push({ engine: step.engine.name, mode: step.mode, ok: pdf, exitCode: last.exitCode, timedOut: !!last.timedOut, stderr: last.stderr || '' })
+      await paperAppendLog(id, 'compile', step.mode + ' engine=' + step.engine.name + ' → ' + (pdf ? 'ok（paper.pdf 已生成）' : ('failed（exit=' + String(last.exitCode) + (last.timedOut ? ', timeout' : '') + '）')))
+      if (pdf) return { compile: (i === 0) ? 'ok' : 'repaired', engine: step.engine.name, mode: step.mode, attempts: attempts, pdfPreserved: false }
+    }
+    await writeText(relDir + '/paper.tex', texPrimary)
+    const preserved = await paperPathExists(relDir + '/paper.pdf')
+    await paperAppendLog(id, 'compile', '所有尝试均失败：保留 paper.tex + paper.md' + (preserved ? '（paper.pdf 是**上一次成功编译**留下的，未被覆盖）' : '，未生成 paper.pdf') + '（不阻塞定稿）')
+    logActivity('paper', '论文 pdf 编译失败（已尝试换引擎/去不支持宏包/最小模板），已保留 tex+md：' + relDir)
+    reportDirty = true
+    return { compile: 'failed', engine: det.available[0].name, attempts: attempts, pdfPreserved: preserved }
+  }
+  /** 落盘 md/tex/pdf/meta（meta **最后**写 = 原子提交点；spec §2/§5）。 */
+  async function paperEmitArtifacts(id, o, info) {
+    const relDir = paperDir(id)
+    const dateStr = fmtTime(now()).slice(0, 10)
+    const author = paperAuthorLine()
+    const evidence = info.evidence || (await paperEvidenceIndex())
+    const title = String(info.title || '').trim() || ('研究报告：' + currentProject)
+    const md = paperBuildMarkdown({ title: title, author: author, date: dateStr, abstract: info.abstract, sections: info.sections, evidence: evidence })
+    const artifacts = { md: false, tex: false, pdf: false }
+    let compile = 'skipped', engine = null, attempts = [], pdfPreserved = false
+    if (o.format === 'md' || o.format === 'both') { await writeText(relDir + '/paper.md', md); artifacts.md = true }
+    if (o.format === 'tex' || o.format === 'both') {
+      const bodyTex = paperMdToTexBody(md)
+      const tex = paperTexDoc({ title: title, author: author, date: dateStr, lang: o.lang, bodyTex: bodyTex })
+      await writeText(relDir + '/paper.tex', tex)
+      artifacts.tex = true
+      const c = await paperCompile(id, o, tex, bodyTex)
+      compile = c.compile; engine = c.engine || null; attempts = c.attempts || []
+      pdfPreserved = !!c.pdfPreserved
+      if (compile === 'ok' || compile === 'repaired') artifacts.pdf = await paperPathExists(relDir + '/paper.pdf')
+    }
+    const filled = PAPER_SKELETON.map(function (s) { return s.key }).filter(function (k) { return !!(info.sections && String(info.sections[k] || '').trim()) })
+    const meta = {
+      id: id, dir: relDir, preset: 'vibe-math-v3', singleAuthor: true, project: currentProject,
+      title: title, author: author, date: dateStr, abstract: String(info.abstract || ''),
+      sectionBodies: info.sections || {}, sections: PAPER_SKELETON.map(function (s) { return s.key }), filledSections: filled,
+      raw: String(info.raw == null ? '' : info.raw), notes: Array.isArray(info.notes) ? info.notes : [],
+      trigger: info.trigger || 'manual', runStartedAt: Number(scheduler.startedAt) || 0,
+      params: { finalPaper: params.finalPaper !== false, paperFormat: o.format, paperLanguage: o.lang, paperCompilePdf: !!o.compilePdf, paperLatexCommand: String(params.paperLatexCommand || '') },
+      finalizedAt: now(), finalizedAtText: fmtTime(now()),
+      artifacts: artifacts, compile: compile, compileEngine: engine, compileAttempts: attempts, pdfPreserved: pdfPreserved,
+      material: info.material || null, evidence: evidence,
+    }
+    await writeJson(relDir + '/paper.meta.json', meta)
+    return meta
+  }
+  async function paperMissingArtifacts(id, o) {
+    const relDir = paperDir(id)
+    const need = []
+    if (o.format === 'md' || o.format === 'both') { if (!(await paperPathExists(relDir + '/paper.md'))) need.push('paper.md') }
+    if (o.format === 'tex' || o.format === 'both') { if (!(await paperPathExists(relDir + '/paper.tex'))) need.push('paper.tex') }
+    return need
+  }
+  /** 派遣（内部）：激活上限拒绝 → 排队重试（修订 §A2）。 */
+  async function paperDispatch(trigger, o, id, prevTries) {
+    const relDir = paperDir(id)
+    const digest = await buildPaperDigest()
+    let childId
+    try {
+      childId = await spawnChild('paper-writer:' + id, paperWriterPrompt(digest, o), { role: 'paper', paperId: id, trigger: trigger, lang: o.lang, format: o.format, compilePdf: o.compilePdf })
+    } catch (e) {
+      const message = String((e && e.message) || e)
+      const limit = activationLimitFrom(message)
+      if (limit !== undefined || /ACTIVATION_LIMIT_REACHED|active child limit/i.test(message)) {
+        const tries = Number(prevTries || 0) + 1
+        if (tries > PAPER_MAX_RETRIES) {
+          paperPending = null
+          await paperAppendLog(id, 'dispatch-failed', '宿主激活上限连续拒绝 ' + PAPER_MAX_RETRIES + ' 次，已放弃自动派遣：' + message)
+          logActivity('paper', '论文撰写子代理被宿主激活上限连续拒绝（' + PAPER_MAX_RETRIES + ' 次），已放弃自动派遣（稍后可 /vibe paper force 重试）：' + message)
+          console.error('vibe-math-v3: paper writer refused by the host activation limit ' + PAPER_MAX_RETRIES + ' times; giving up (retry later with /vibe paper force) — ' + message)
+          await paperLockRelease(id)
+          return { ok: false, message: 'paper writer refused by the activation limit ' + PAPER_MAX_RETRIES + ' times: ' + message, id: id, dir: relDir, limit: limit }
+        }
+        paperPending = { tries: tries, retryAt: now() + PAPER_RETRY_MS, reason: message, limit: limit, trigger: trigger, opts: { lang: o.lang, format: o.format, compilePdf: o.compilePdf } }
+        if (tries === 1 || tries % 3 === 0) {
+          await paperAppendLog(id, 'dispatch-queued', '宿主激活上限（' + (limit === undefined ? '?' : limit) + '）拒绝派遣（第 ' + tries + ' 次）：' + (PAPER_RETRY_MS / 1000) + 's 后重试')
+          logActivity('paper', '论文撰写子代理被宿主激活上限拒绝（第 ' + tries + ' 次），已排队重试：' + message)
+          console.error('vibe-math-v3: paper writer queued after an activation-limit refusal (try ' + tries + '): ' + message)
+        }
+        reportDirty = true
+        return { ok: true, queued: true, reason: 'activation-limit-reached', tries: tries, retryAt: paperPending.retryAt, limit: limit, id: id, dir: relDir }
+      }
+      await paperAppendLog(id, 'dispatch-failed', message)
+      logActivity('paper', '「论文撰写」子代理派遣失败：' + message)
+      await paperLockRelease(id)
+      return { ok: false, message: 'paper writer dispatch failed: ' + message, id: id, dir: relDir }
+    }
+    paperInFlight = childId
+    paperInFlightAt = now()
+    // 只有"非自动重试"的派遣才重置回收计数：auto-retry 必须保留计数，否则卡死重派会无限循环。
+    if (trigger !== 'auto-retry') paperReaps = 0
+    paperPending = null
+    const material = paperMaterialSummary(digest)
+    await paperAppendLog(id, 'dispatch', 'trigger=' + trigger + ' child=' + childId + ' format=' + o.format + ' lang=' + o.lang + ' compilePdf=' + o.compilePdf + (o.force ? ' force=true' : '') + ' run=' + (Number(scheduler.startedAt) || 0) + ' material=' + material.chars + ' chars/' + material.lines + ' lines')
+    logActivity('paper', '已派遣「论文撰写」子代理（' + trigger + '，' + o.format + '/' + o.lang + '）→ ' + relDir)
+    reportDirty = true
+    return { ok: true, dispatched: true, childId: childId, id: id, dir: relDir, trigger: trigger, format: o.format, lang: o.lang, compilePdf: o.compilePdf }
+  }
+  /** 触发入口（spec §2/§3 + 修订 §A2/§A3）：自动（收口）与手动命令共用。 */
+  async function maybeWritePaper(trigger, opts) {
+    const o = paperOpts(opts)
+    const id = paperId(opts)
+    const relDir = paperDir(id)
+    const meta = await paperReadMeta(id)
+    const sameRun = !!meta && Number(meta.runStartedAt || 0) === (Number(scheduler.startedAt) || 0)
+    if (!o.force && meta && meta.finalizedAt && sameRun) {
+      const missing = await paperMissingArtifacts(id, o)
+      if (missing.length === 0) {
+        await paperAppendLog(id, 'skip', '幂等：同一 run（' + (Number(scheduler.startedAt) || 0) + '）已有定稿且产物齐全 → 不重复撰写（/vibe paper force 可重写）')
+        return { ok: true, skipped: true, reason: 'already-finalized-this-run', id: id, dir: relDir, finalizedAt: meta.finalizedAt, artifacts: meta.artifacts || {}, compile: meta.compile, note: '同一 run 只写一次；重复触发只补写缺失产物（spec §2）' }
+      }
+      await paperAppendLog(id, 'fill', '幂等：已有定稿但缺少 ' + missing.join(', ') + ' → 用已存的定稿内容补写（不重新派遣作者）')
+      const filled = await paperEmitArtifacts(id, o, { title: meta.title, abstract: meta.abstract, sections: meta.sectionBodies || {}, evidence: meta.evidence, raw: meta.raw, notes: (meta.notes || []).concat(['补写缺失产物：' + missing.join(', ')]), trigger: meta.trigger || trigger, material: meta.material })
+      return { ok: true, skipped: true, reason: 'filled-missing-artifacts', filled: missing, id: id, dir: relDir, finalizedAt: filled.finalizedAt, artifacts: filled.artifacts, compile: filled.compile }
+    }
+    if (paperInFlight) {
+      const verdict = paperWriterVerdictNow(o.force)
+      if (verdict === 'reap') {
+        const gone = agentRegistry[paperInFlight] === undefined
+        await paperReapWriter(id, gone ? '子代理已不在 agentRegistry（end 事件丢失 / 宿主丢弃）' : ('超过卡死窗口 ' + Math.round(PAPER_STALE_MS / 60000) + ' 分钟未返回'))
+      } else if (verdict === 'refuse') {
+        const ageMs = now() - Number(paperInFlightAt || 0)
+        await paperAppendLog(id, 'force-refused', '仍有在途撰写者 ' + paperInFlight + '（' + Math.round(ageMs / 1000) + 's）：超过 ' + Math.round(PAPER_STALE_MS / 60000) + ' 分钟才会被 force 放弃')
+        return { ok: false, reason: 'writer-in-flight', childId: paperInFlight, ageMs: ageMs, staleMs: PAPER_STALE_MS, id: id, dir: relDir, message: '已有在途的论文撰写子代理 ' + paperInFlight + '（已 ' + Math.round(ageMs / 1000) + 's 未返回）。等它返回，或等超过 ' + Math.round(PAPER_STALE_MS / 60000) + ' 分钟后 force 会自动回收并重派（心跳也会自动回收）。' }
+      } else {
+        return { ok: true, skipped: true, reason: 'writer-in-flight', childId: paperInFlight, ageMs: now() - Number(paperInFlightAt || 0), staleMs: PAPER_STALE_MS, id: id, dir: relDir }
+      }
+    }
+    if (paperPending) return { ok: true, queued: true, reason: 'retry-queued', retryAt: paperPending.retryAt, tries: paperPending.tries, id: id, dir: relDir }
+    const lock = await paperLockAcquire(id)
+    if (!lock.ok) {
+      await paperAppendLog(id, 'skip', 'paper 锁由会话 ' + lock.holder + ' 持有（未过期）→ 本次不派遣（修订 §A3 的 paper 作用域锁）')
+      return { ok: true, skipped: true, reason: 'locked-by-another-session', holder: lock.holder, id: id, dir: relDir }
+    }
+    return await paperDispatch(trigger, o, id, 0)
+  }
+  function paperRetryDue() { return !!(paperPending && now() >= Number(paperPending.retryAt || 0)) }
+  /**
+   * 心跳（修订 §1）：在途 → 续租 paper 锁；**卡死则自动回收**（child 不在注册表，或超过卡死窗口），
+   * 并自动重派（上限 PAPER_MAX_AUTO_REAPS，之后给出可执行提示交给 /vibe paper force）；有排队则重试派遣。
+   */
+  async function runPaperRetry() {
+    const id = paperId()
+    if (paperInFlight) {
+      if (paperWriterVerdictNow(false) === 'reap') {
+        const gone = agentRegistry[paperInFlight] === undefined
+        await paperReapWriter(id, gone ? '子代理已不在 agentRegistry（end 事件丢失 / 宿主丢弃）' : ('超过卡死窗口 ' + Math.round(PAPER_STALE_MS / 60000) + ' 分钟未返回'))
+        const meta = await paperReadMeta(id)
+        if (params.finalPaper !== false && !(meta && meta.finalizedAt) && Number(paperReaps || 0) < PAPER_MAX_AUTO_REAPS) {
+          paperReaps = Number(paperReaps || 0) + 1
+          await paperAppendLog(id, 'retry-after-reap', '第 ' + paperReaps + ' 次自动重派（上限 ' + PAPER_MAX_AUTO_REAPS + '）')
+          await paperDispatch('auto-retry', paperOpts({}), id, 0)
+        } else {
+          await paperAppendLog(id, 'reap-giveup', '自动重派已达上限 ' + PAPER_MAX_AUTO_REAPS + '（或已有定稿）：不再自动派遣，请用 /vibe paper force 手动重写')
+          logActivity('paper', '论文撰写子代理连续卡死/已放弃：不再自动重派，可用 /vibe paper force 手动重写')
+        }
+        return
+      }
+      try { await paperLockAcquire(id) } catch (e) { /* 续租失败不致命 */ }
+      return
+    }
+    if (!paperRetryDue()) return
+    const p = paperPending
+    paperPending = null
+    const o = paperOpts(p.opts)
+    await paperDispatch(p.trigger || 'auto-retry', o, id, Number(p.tries || 0))
+  }
+  /** `/vibe paper [lang=zh|en] [format=both|md|tex] [force]`（spec §2/§6）。 */
+  async function paperCommand(args) {
+    const rest = Array.isArray(args) ? args : []
+    const opts = {}
+    for (let i = 0; i < rest.length; i++) {
+      const a = String(rest[i] || '')
+      if (a === 'force') { opts.force = true; continue }
+      const eq = a.indexOf('=')
+      const k = eq > 0 ? a.slice(0, eq).toLowerCase() : ''
+      const v = eq > 0 ? a.slice(eq + 1).toLowerCase() : ''
+      if (k === 'lang') { if (v !== 'zh' && v !== 'en') return { ok: false, message: '/vibe paper lang= 只接受 zh|en（收到 ' + JSON.stringify(a) + '）' }; opts.lang = v; continue }
+      if (k === 'format') { if (v !== 'both' && v !== 'md' && v !== 'tex') return { ok: false, message: '/vibe paper format= 只接受 both|md|tex（收到 ' + JSON.stringify(a) + '）' }; opts.format = v; continue }
+      return { ok: false, message: 'unknown /vibe paper option: ' + a + '（可用 lang=zh|en、format=both|md|tex、force）' }
+    }
+    const r = await maybeWritePaper('manual', opts)
+    if (r.ok === false) return r
+    const autoNote = params.finalPaper === false ? '（自动触发已关闭 finalPaper=false；手动命令仍可用）' : ''
+    const msg = r.dispatched ? ('已派遣「论文撰写」子代理，产物将写入 ' + r.dir + '/')
+      : r.queued ? ('宿主激活上限已满：论文撰写已排队，' + (PAPER_RETRY_MS / 1000) + 's 后自动重试（第 ' + r.tries + ' 次）')
+        : (r.reason === 'already-finalized-this-run' ? '同一 run 已有定稿且产物齐全：不重复撰写（需要重写请用 /vibe paper force）'
+          : (r.reason === 'filled-missing-artifacts' ? ('已用既有定稿补写缺失产物：' + (r.filled || []).join(', ')) : ('未重新派遣：' + (r.reason || ''))))
+    return Object.assign({}, r, { message: msg + autoNote, autoDisabled: params.finalPaper === false })
+  }
+  /** 论文撰写子代理结束（spec §4）：解析回复 → 组装 9 节 → 落盘 → 编译 → 记日志 → 释放 paper 锁。 */
+  async function handlePaperWriter(childId, meta, output) {
+    const id = meta.paperId || paperId()
+    paperInFlight = ''; paperInFlightAt = 0; paperReaps = 0
+    delete paperAbandoned[childId]
+    const o = paperOpts({ lang: meta.lang, format: meta.format, compilePdf: meta.compilePdf })
+    const parsed = parseJson(output)
+    const info = paperSkeletonFromReply(parsed, output)
+    if (!info.title) info.title = paperTitleFromMd(String(output || '')) || ('研究报告：' + currentProject)
+    for (let i = 0; i < info.notes.length; i++) await paperAppendLog(id, 'note', info.notes[i])
+    if (!String(output || '').trim()) await paperAppendLog(id, 'reply', '作者回复为空：只写骨架 + 占位说明（绝不编造内容）')
+    let written
+    try {
+      written = await paperEmitArtifacts(id, o, { title: info.title, abstract: info.abstract, sections: info.sections, raw: String(output || ''), notes: info.notes, trigger: meta.trigger || 'auto', material: paperMaterialSummary(await buildPaperDigest()) })
+    } catch (e) {
+      await paperAppendLog(id, 'finalize-failed', String((e && e.message) || e))
+      logActivity('paper', '论文落盘失败：' + String((e && e.message) || e))
+      await paperLockRelease(id)
+      return
+    }
+    await paperAppendLog(id, 'finalize', '产物 ' + JSON.stringify(written.artifacts) + ' compile=' + written.compile + (written.compileEngine ? (' engine=' + written.compileEngine) : '') + ' run=' + (Number(scheduler.startedAt) || 0))
+    logActivity('paper', '论文（最终稿）已落盘：' + paperDir(id) + '/（' + Object.keys(written.artifacts).filter(function (k) { return written.artifacts[k] }).join('/') + '，编译=' + written.compile + '）')
+    await paperLockRelease(id)
+    reportDirty = true
+    await saveAll()
+  }
+  /** status 里的论文视图（spec §2/§6）。 */
+  async function paperStatusView() {
+    const id = paperId()
+    const meta = await paperReadMeta(id)
+    return {
+      id: id, dir: paperDir(id), inFlight: paperInFlight || null,
+      inFlightSince: paperInFlight ? Number(paperInFlightAt || 0) : null,
+      inFlightAgeMs: paperInFlight ? (now() - Number(paperInFlightAt || 0)) : null,
+      staleMs: PAPER_STALE_MS, reapedThisRun: Number(paperReaps || 0),
+      queued: paperPending ? { tries: paperPending.tries, retryAt: paperPending.retryAt, reason: paperPending.reason, limit: paperPending.limit === undefined ? null : paperPending.limit } : null,
+      autoFinalPaper: params.finalPaper !== false, format: params.paperFormat, language: params.paperLanguage, compilePdf: params.paperCompilePdf !== false,
+      finalizedAt: meta ? meta.finalizedAt : null, artifacts: meta ? (meta.artifacts || {}) : {}, compile: meta ? meta.compile : null,
+    }
+  }
+
   // ================= child result dispatch =================
   async function onChildEnd(info) {
     // 子代理结束/中断：自动释放它持有的所有写锁（防锁残留导致文件被永久锁住）
     const endedId = String(info.id)
     for (const k of Object.keys(fileOwner)) { if (String(fileOwner[k].childId) === endedId) delete fileOwner[k] }
     const meta = agentRegistry[info.id]
-    if (meta === undefined) return
+    if (meta === undefined) {
+      // 已回收的撰写者事后才返回：输出被丢弃，但必须**留痕**，不能静默消失（修订 §1）。
+      if (paperAbandoned[info.id]) {
+        delete paperAbandoned[info.id]
+        logActivity('paper', '已回收的论文撰写子代理 ' + info.id + ' 事后返回：其输出被丢弃（已重派新的撰写者）')
+        reportDirty = true
+      }
+      return
+    }
     const output = blocksToText(info.lastAssistantMessage)
     try {
       if (meta.role === 'explorer') await handleExplorer(info.id, meta, output)
@@ -3166,6 +3798,9 @@ export function apply(ctx) {
       else if (meta.role === 'verifier') await handleVerifier(info.id, meta, output, info.stopReason)
       else if (meta.role === 'planner') await handlePlanner(info.id, meta, output)
       else if (meta.role === 'method-keeper') await handleMethodKeeper(info.id, meta, output)
+      // 修订 §A2：论文撰写子代理必须有**自己的分支**——未知 role 的产出会被静默丢弃。
+      else if (meta.role === 'paper') await handlePaperWriter(info.id, meta, output)
+      else console.error('vibe-math-v3: subagent ' + info.id + ' ended with an unknown role "' + String(meta.role) + '" — its output is dropped')
     } catch (e) { console.error('vibe-math-v3 onChildEnd error: ' + String((e && e.stack) || e)) }
     await saveAll()
     await maybePromoteMethods()
@@ -3184,6 +3819,9 @@ export function apply(ctx) {
       if (Object.keys(agentRegistry).length > 0 || Object.keys(tasks).length > 0) {
         logActivity(fresh ? 'start' : 'resume', 'cleared ' + Object.keys(agentRegistry).length + ' agent(s) and ' + Object.keys(tasks).length + ' task(s) (' + (fresh ? 'restart' : 'stale from previous process') + ')')
         agentRegistry = {}; tasks = {}
+        // 论文派遣态是本进程内存态：子代理已被中断/丢弃，排队与在途标记必须一起清掉（修订 §A2）。
+        if (paperInFlight || paperPending) logActivity('paper', '重启/跨进程恢复：清空论文撰写态（inFlight=' + (paperInFlight || '-') + (paperPending ? ', queued' : '') + '）')
+        paperInFlight = ''; paperInFlightAt = 0; paperReaps = 0; paperPending = null
       }
     }
     await writeJson('State/process_epoch.json', processEpoch)
@@ -3191,10 +3829,43 @@ export function apply(ctx) {
     if (params.indexAutoRebuild) await rebuildIndex()
     return { ok: true }
   }
-  async function acquireProjectLock() {
+  /**
+   * 项目锁 = 租约（lease），不是一次性写入的时间戳。
+   *
+   * 旧实现只在获取时写一次 `at`，全仓没有任何续租点：运行满 projectLockTimeoutMs（默认 60s）后
+   * 第二个会话就会把锁判为"过期"并直接夺锁，两个进程于是并发写同一棵 md 树——而写锁 fileOwner
+   * 是**进程级**的，跨进程不共享，挡不住这一路。
+   *
+   * 现在：(1) 独立的续租定时器按 LOCK_POLL_MS 轮询、在租约用掉 1/4 时写盘——最坏租约年龄因此远低于
+   * projectLockTimeoutMs，且与 tick 时长完全无关（Round C 修正：此前 renewProjectLock 放在 tick()
+   * 顶部，单个 tick 超过 projectLockTimeoutMs 就会让租约过期）；
+   * (2) 夺取**其他会话**持有的锁需要显式 override（`{override:true}` / `/vibe resume override`）。
+   * 唯一保留的隐式接管是"锁租约已明确过期"（持有者进程崩溃、不再续租），以免崩溃后项目永久锁死；
+   * 正常运行中的会话不会被接管。
+   */
+  // 节流判据取**落盘的那份租约自己的年龄**（`projectLock.at`），不再维护影子时间戳
+  // `projectLockRenewedAt`：实测它连续两次轮询都读到"距上次续租约 5s"（因而每次都判定"不必写"），
+  // 而文件里的 `at` 始终停在会话启动那一刻——影子时间戳与真正的租约可以分叉。
+  // `projectLock.at` 正是 acquireProjectLock() 判过期、也是崩溃恢复所依据的唯一状态。
+  // 因此"多久写一次"由租约年龄自己决定，二者不可能再分叉。
+  async function renewProjectLock() {
+    if (!scheduler.running) return
+    if (projectLock.sessionId !== sessionId) return
+    const timeout = Number(params.projectLockTimeoutMs) || 60000
+    if ((now() - (Number(projectLock.at) || 0)) < Math.max(1000, timeout / 4)) return
+    projectLock.at = now()
+    await saveAll()
+  }
+  async function acquireProjectLock(override) {
     const timeout = Number(params.projectLockTimeoutMs) || 60000
-    if (projectLock.sessionId && projectLock.sessionId !== sessionId && (now() - projectLock.at) < timeout) {
-      return { ok: false, message: '项目 "' + currentProject + '" 正被会话 ' + projectLock.sessionId + ' 占用（锁超时 ' + timeout + 'ms）' }
+    const held = projectLock.sessionId && projectLock.sessionId !== sessionId
+    if (held) {
+      const age = now() - (Number(projectLock.at) || 0)
+      // 过期租约 = 持有者进程已不在续租（崩溃） → 允许接管，否则崩溃一次项目就永久锁死。
+      if (age < timeout && !override) {
+        return { ok: false, code: 'PROJECT_LOCKED', message: '项目 "' + currentProject + '" 正被会话 ' + projectLock.sessionId + ' 占用（租约剩余 ' + Math.max(0, timeout - age) + 'ms；确认对方已停止后可显式接管：override=true）' }
+      }
+      logActivity('lock', 'project lock taken over from session ' + projectLock.sessionId + (override ? ' (explicit override)' : ' (lease expired after ' + age + 'ms)'))
     }
     projectLock = { sessionId: sessionId, at: now() }
     await saveAll()
@@ -3203,10 +3874,10 @@ export function apply(ctx) {
   async function releaseProjectLock() {
     if (projectLock.sessionId === sessionId) { projectLock = { sessionId: '', at: 0 }; await saveAll() }
   }
-  async function startScheduler() { const r = await init(true); if (!r.ok) return r; const lock = await acquireProjectLock(); if (!lock.ok) return lock; scheduler.running = true; scheduler.startedAt = now(); scheduler.gate = null; logActivity('start', 'scheduler started for project ' + currentProject + '（v3：md 知识库 + 规划代理调度 + 方法库）'); await saveAll(); await maybeWriteReport(true); scheduleTick(); return { ok: true, message: 'scheduler started', project: currentProject, frameworkRoot: frameworkRoot() } }
-  async function resumeScheduler() { const r = await init(false); if (!r.ok) return r; const lock = await acquireProjectLock(); if (!lock.ok) return lock; scheduler.running = true; scheduler.gate = null; logActivity('resume', 'scheduler resumed'); await saveAll(); await maybeWriteReport(true); scheduleTick(); return { ok: true, message: 'scheduler resumed', project: currentProject, frameworkRoot: frameworkRoot() } }
+  async function startScheduler(override) { const r = await init(true); if (!r.ok) return r; const lock = await acquireProjectLock(override === true); if (!lock.ok) return lock; scheduler.running = true; scheduler.startedAt = now(); scheduler.gate = null; logActivity('start', 'scheduler started for project ' + currentProject + '（v3：md 知识库 + 规划代理调度 + 方法库）'); await saveAll(); await maybeWriteReport(true); scheduleTick(); return { ok: true, message: 'scheduler started', project: currentProject, frameworkRoot: frameworkRoot() } }
+  async function resumeScheduler(override) { const r = await init(false); if (!r.ok) return r; const lock = await acquireProjectLock(override === true); if (!lock.ok) return lock; scheduler.running = true; scheduler.gate = null; logActivity('resume', 'scheduler resumed'); await saveAll(); await maybeWriteReport(true); scheduleTick(); return { ok: true, message: 'scheduler resumed', project: currentProject, frameworkRoot: frameworkRoot() } }
   async function pauseScheduler() { scheduler.running = false; await releaseProjectLock(); logActivity('pause', 'scheduler paused'); await saveAll(); return { ok: true, message: 'scheduler paused' } }
-  async function abortScheduler() { scheduler.running = false; const ids = Object.keys(agentRegistry); for (let i = 0; i < ids.length; i++) await interruptChild(ids[i]); agentRegistry = {}; planQueue = []; await releaseProjectLock(); logActivity('abort', 'scheduler aborted, ' + ids.length + ' child(ren) interrupted'); await saveAll(); return { ok: true, message: 'scheduler aborted', interrupted: ids.length } }
+  async function abortScheduler() { scheduler.running = false; const ids = Object.keys(agentRegistry); for (let i = 0; i < ids.length; i++) await interruptChild(ids[i]); agentRegistry = {}; planQueue = []; paperInFlight = ''; paperInFlightAt = 0; paperReaps = 0; paperPending = null; await releaseProjectLock(); logActivity('abort', 'scheduler aborted, ' + ids.length + ' child(ren) interrupted'); await saveAll(); return { ok: true, message: 'scheduler aborted', interrupted: ids.length } }
   async function autoResolvePending() {
     const pending = decisionQueue.filter(function (d) { return d.status === 'pending' })
     for (let i = 0; i < pending.length; i++) {
@@ -3243,6 +3914,8 @@ export function apply(ctx) {
       plannerEnabled: params.plannerEnabled, plannerFails: plannerFails,
       formal: formalSummary(),
       recentActivity: activityLog.slice(-Math.min(10, Number(params.activityLogCap) || 100)), params: params,
+      // 最终论文的可观测面（spec §2/§6）。
+      paper: await paperStatusView(),
     }
   }
   async function checkTermination() {
@@ -3258,12 +3931,22 @@ export function apply(ctx) {
     // 注意：待沉淀发明（pendingInventions）不应阻塞终止——它是"批量蒸馏"（积够 methodKeepEvery 才触发），
     // 少量残留不会再有 method-keeper 触发，若纳入会令 scheduler 永不终止（闲置空转）。
     const leftoverVerify = (await buildVerifyCandidates()).length > 0
-    if (unsolved.length === 0 && !leftoverVerify && Object.keys(agentRegistry).length === 0 && Object.keys(tasks).length === 0 && planQueue.length === 0) {
+    // H1：在途的 **planner 不算"活跃工作"**。planner 不产出知识、不持有验证任务，只是"问下一步做什么"；
+    // 旧判定把刚派出的 planner 也算成活跃代理，于是本 tick 的停机判定永远被自己派出的 planner 挡掉，
+    // 空闲时形成"每 tick 一个 planner"的活锁。排除它之后，空闲的那一 tick 就能正常收口停机。
+    const realAgents = Object.keys(agentRegistry).filter(function (cid) { const m = agentRegistry[cid]; return m && m.role !== 'planner' && m.role !== 'paper' }).length
+    if (unsolved.length === 0 && !leftoverVerify && realAgents === 0 && Object.keys(tasks).length === 0 && planQueue.length === 0) {
+      // ★ 最终论文（修订 §A2/§A3）：必须在 running=false 与 releaseProjectLock() **之前**派遣——
+      //   停止之后 scheduleTick() 是空操作；提前放锁后另一会话可能开始写同一棵树（paper 锁兜底）。
+      //   触发点就是这个分支本身：`leftoverVerify` 为空才是 v3 的真实完整性判据（§A4）。
+      if (params.finalPaper !== false) {
+        try { await maybeWritePaper('auto') } catch (e) { logActivity('paper', '自动撰写最终论文失败：' + String((e && e.message) || e)) }
+      }
       scheduler.running = false
       await releaseProjectLock()
       logActivity('stop', 'all active problems solved (never-priority excluded) and no active agents/tasks/plans — scheduler stopped (strict termination)')
       await saveAll(); await maybeWriteReport(true); await maybePushReport(true)
-    } else if (!hasPendingGate && Object.keys(agentRegistry).length === 0 && Object.keys(tasks).length === 0 && planQueue.length === 0 && unsolved.length > 0) {
+    } else if (!hasPendingGate && realAgents === 0 && Object.keys(tasks).length === 0 && planQueue.length === 0 && unsolved.length > 0) {
       let allBlocked = true
       for (let i = 0; i < unsolved.length; i++) {
         const q = unsolved[i]
@@ -3290,7 +3973,7 @@ export function apply(ctx) {
     if (!create && !exists) return { ok: false, message: 'project not found: ' + slug }
     if (scheduler.running) await abortScheduler()
     currentProject = slug; await writeCurrentProject(); await ensureDirs()
-    params = Object.assign({}, DEFAULT_PARAMS); scheduler = { running: false, startedAt: 0, lastCheckpoint: 0, gate: null }; agentRegistry = {}; decisionQueue = []; verifierAccuracy = {}; tasks = {}; explorerRetries = {}; activityLog = []; planQueue = []; plannerFails = 0; methodLog = { pendingInventions: [], keepCount: 0, lastKeepAt: 0 }; projectLock = { sessionId: '', at: 0 }; lastReportWrite = 0; lastPushReport = 0; reportDirty = false; lastPlanSummary = null; archivedJ = {}; lastIndexWrite = 0; formalState = { records: {}, todo: [], libRuns: {} }
+    params = Object.assign({}, DEFAULT_PARAMS); scheduler = { running: false, startedAt: 0, lastCheckpoint: 0, gate: null }; agentRegistry = {}; decisionQueue = []; verifierAccuracy = {}; tasks = {}; explorerRetries = {}; activityLog = []; planQueue = []; plannerFails = 0; methodLog = { pendingInventions: [], keepCount: 0, lastKeepAt: 0 }; projectLock = { sessionId: '', at: 0 }; lastReportWrite = 0; lastPushReport = 0; reportDirty = false; lastPlanSummary = null; archivedJ = {}; lastIndexWrite = 0; formalState = { records: {}, todo: [], libRuns: {} }; paperInFlight = ''; paperInFlightAt = 0; paperReaps = 0; paperPending = null
     await loadSettings(); await migrateLegacyParams(); await loadState(); await loadKnowledgeBase(); await saveAll()
     if (params.indexAutoRebuild) await rebuildIndex()
     return { ok: true, project: slug, frameworkRoot: frameworkRoot() }
@@ -3302,47 +3985,50 @@ export function apply(ctx) {
   function objParams(props, required) { return { type: 'object', properties: props, additionalProperties: false, required: required || [] } }
   const handlers = {}
   function registerTool(name, description, parameters, executeFn) { handlers[name] = executeFn }
-  registerTool('vibe_math_start', 'Start (or restart) the Vibe Math V3 scheduler for the current project.', objParams({}), async function () { return await startScheduler() })
-  registerTool('vibe_math_resume', 'Resume the Vibe Math V3 scheduler after a checkpoint/restart.', objParams({}), async function () { return await resumeScheduler() })
-  registerTool('vibe_math_pause', 'Pause the scheduler (in-flight children finish their current turn).', objParams({}), async function () { return await pauseScheduler() })
-  registerTool('vibe_math_abort', 'Abort the scheduler and interrupt all active children.', objParams({}), async function () { return await abortScheduler() })
-  registerTool('vibe_math_status', 'Show scheduler status, params, active agents, projects, and recent activity.', objParams({}), async function () { await refreshParams(); return await getStatus() })
-  registerTool('vibe_math_report', 'Return the full progress report and write it to Progress_Logs/report.json + Logs/报告.md.', objParams({}), async function () { await refreshParams(); await maybeWriteReport(true); return await buildReport() })
-  registerTool('vibe_math_set_mode', 'Switch between manual and auto (preset) mode. Switching to auto auto-resolves any pending manual decisions.', objParams({ mode: { type: 'string', enum: ['manual', 'auto'] } }, ['mode']), async function (args) { params.mode = args.mode; await saveAll(); await saveSettings(); if (params.mode === 'auto') await autoResolvePending(); return { ok: true, mode: params.mode } })
-  registerTool('vibe_math_set_params', 'Update scheduler parameters (partial). Lean 形式化验证：formalVerify = off（默认，不额外要求）| encourage（按实现难度自行决定是否形式化；一旦 Lean 通过，验证转为对 Lean 陈述的「忠实性审查」）| require（同上，且加门禁：对象未达到 Lean 已通过或已记录显式阻塞原因之前，真/假裁定记为未定论、原因 formal-required，并进入 Formal/TODO.md）；leanCommand/leanArgs/leanTimeoutMs 控制 Lean 工具链的调用方式。', objParams({ maxParallelThreshold: { type: 'integer' }, solverMaxRounds: { type: 'integer' }, verifierCount: { type: 'integer' }, debateMaxRounds: { type: 'integer' }, verdictMode: { type: 'string', enum: ['flat', 'forced'] }, reportMode: { type: 'string', enum: ['file', 'push', 'both'] }, promoteValueThreshold: { type: 'number' }, priorityAdjust: { type: 'string', enum: ['none', 'deadend-deprioritize', 'survival-map'] }, proposPriorityAdjust: { type: 'string', enum: ['none', 'progress-graded'] }, provider: { type: 'string' }, model: { type: 'string' }, solverPersona: { type: 'string' }, verifierPersona: { type: 'string' }, explorerPersona: { type: 'string' }, plannerPersona: { type: 'string' }, methodKeeperPersona: { type: 'string' }, knowledgeContext: { type: 'string' }, solverToolAllow: { type: 'array', items: { type: 'string' } }, solverToolDeny: { type: 'array', items: { type: 'string' } }, verifierToolAllow: { type: 'array', items: { type: 'string' } }, verifierToolDeny: { type: 'array', items: { type: 'string' } }, solverAllowNetwork: { type: 'boolean' }, verifierAllowNetwork: { type: 'boolean' }, solverAllowScripts: { type: 'boolean' }, verifierAllowScripts: { type: 'boolean' }, solverMaxToolCalls: { type: 'integer' }, verifierMaxToolCalls: { type: 'integer' }, reportIntervalMs: { type: 'integer' }, tickIntervalMs: { type: 'integer' }, activityLogCap: { type: 'integer' }, maxExplorerRetries: { type: 'integer' }, directionsPerSolver: { type: 'integer' }, planningHorizon: { type: 'integer' }, plannerEnabled: { type: 'boolean' }, plannerProvider: { type: 'string' }, plannerModel: { type: 'string' }, planMinIntervalMs: { type: 'integer' }, plannerMaxFails: { type: 'integer' }, methodKeepIntervalMs: { type: 'integer' }, methodKeepEvery: { type: 'integer' }, methodAutoPromote: { type: 'boolean' }, indexAutoRebuild: { type: 'boolean' }, projectLockTimeoutMs: { type: 'integer' }, formalVerify: { type: 'string', enum: ['off', 'encourage', 'require'] }, leanCommand: { type: 'string' }, leanArgs: { type: 'array', items: { type: 'string' } }, leanTimeoutMs: { type: 'integer' } }), async function (args) { params = Object.assign({}, params, sanitizeParams(args)); await saveAll(); await saveSettings(); return { ok: true, params: params } })
-  registerTool('vibe_math_setup', 'Return the interactive parameter schema for guided configuration.', objParams({}), async function () { await refreshParams(); const list = PARAM_SCHEMA.map(function (p) { const out = Object.assign({}, p); out.current = params[p.name]; out.default = DEFAULT_PARAMS[p.name]; return out }); return { ok: true, parameters: list, saveTo: frameworkRoot() + '/vibe_math_setting.json' } })
-  registerTool('vibe_math_save_settings', 'Write the current params to vibe_math_setting.json (JSON with comments) as new defaults.', objParams({}), async function () { return await saveSettings() })
-  registerTool('vibe_math_template', 'Create a fresh vibe_math_setting.json template (with defaults + comments) in the workspace (global) or current project folder.', objParams({ where: { type: 'string', enum: ['global', 'project'] } }), async function (args) { return await createTemplate((args && args.where) || 'global') })
-  registerTool('vibe_math_add_problem', 'Add a problem to the current project (creates Problems/<id>.md).', objParams({ id: { type: 'string' }, description: { type: 'string' }, priority: { type: 'integer' }, dependencies: { type: 'array', items: { type: 'string' } } }, ['id', 'description']), async function (args) { if (problems.has(args.id)) return { ok: false, message: 'problem id already exists' }; problems.set(args.id, { id: args.id, 标题: args.id, 状态: '求解中', 优先级: args.priority || 0, 依赖: Array.isArray(args.dependencies) ? args.dependencies : [], 被依赖: [], 来源: '原始', 计划: '待调度', 陈述: args.description, 来源与动机: '', solutions: [], 判断命题: '', 来源命题: '' }); await saveProblem(problems.get(args.id)); await syncDependencies(); await rebuildIndex(); scheduleTick(); return { ok: true, message: 'problem added', file: problemRel(problems.get(args.id)) } })
-  registerTool('vibe_math_add_proposition', 'Add a proposition to Propos/ (creates Propos/<分类>/<id>.md).', objParams({ id: { type: 'string' }, 概述: { type: 'string' }, 概率: { type: 'number' }, 优先级: { type: 'integer' }, '价值/关键性': { type: 'number' }, 分类: { type: 'string' } }, ['id', '概述']), async function (args) {
-    if (propos.has(args.id)) return { ok: false, message: 'proposition id already exists' }
-    const p = { id: args.id, 标题: args.id, 状态: '未定论', 概率: clamp01(args.概率 != null ? args.概率 : 0.5), 优先级: (args.优先级 != null) ? args.优先级 : 1, 依赖: [], 价值关键性: clamp01(args['价值/关键性'] != null ? args['价值/关键性'] : 0.5), 分类: args.分类 || '未分类', 陈述: args.概述, proofs: [], refutes: [], 来源问题: '', 在问题清单: false }
+  registerTool('vibe_math_start', TOOL_DESC.vibe_math_start, objParams({ override: { type: 'boolean' } }), async function (args) { return await startScheduler(args && args.override) })
+  registerTool('vibe_math_resume', TOOL_DESC.vibe_math_resume, objParams({ override: { type: 'boolean' } }), async function (args) { return await resumeScheduler(args && args.override) })
+  registerTool('vibe_math_pause', TOOL_DESC.vibe_math_pause, objParams({}), async function () { return await pauseScheduler() })
+  registerTool('vibe_math_abort', TOOL_DESC.vibe_math_abort, objParams({}), async function () { return await abortScheduler() })
+  registerTool('vibe_math_status', TOOL_DESC.vibe_math_status, objParams({}), async function () { await refreshParams(); return await getStatus() })
+  registerTool('vibe_math_report', TOOL_DESC.vibe_math_report, objParams({}), async function () { await refreshParams(); await maybeWriteReport(true); return await buildReport() })
+  registerTool('vibe_math_set_mode', TOOL_DESC.vibe_math_set_mode, objParams({ mode: { type: 'string', enum: ['manual', 'auto'] } }, ['mode']), async function (args) { params.mode = args.mode; await saveAll(); await saveSettings(); if (params.mode === 'auto') await autoResolvePending(); return { ok: true, mode: params.mode } })
+  registerTool('vibe_math_set_params', TOOL_DESC.vibe_math_set_params, objParams({ mode: { type: 'string', enum: ['manual', 'auto'] }, maxParallelThreshold: { type: 'integer' }, solverMaxRounds: { type: 'integer' }, verifierCount: { type: 'integer' }, debateMaxRounds: { type: 'integer' }, verdictMode: { type: 'string', enum: ['flat', 'forced'] }, reportMode: { type: 'string', enum: ['file', 'push', 'both'] }, promoteValueThreshold: { type: 'number' }, priorityAdjust: { type: 'string', enum: ['none', 'deadend-deprioritize', 'survival-map'] }, proposPriorityAdjust: { type: 'string', enum: ['none', 'progress-graded'] }, provider: { type: 'string' }, model: { type: 'string' }, solverPersona: { type: 'string' }, verifierPersona: { type: 'string' }, explorerPersona: { type: 'string' }, plannerPersona: { type: 'string' }, methodKeeperPersona: { type: 'string' }, knowledgeContext: { type: 'string' }, solverToolAllow: { type: 'array', items: { type: 'string' } }, solverToolDeny: { type: 'array', items: { type: 'string' } }, verifierToolAllow: { type: 'array', items: { type: 'string' } }, verifierToolDeny: { type: 'array', items: { type: 'string' } }, solverAllowNetwork: { type: 'boolean' }, verifierAllowNetwork: { type: 'boolean' }, solverAllowScripts: { type: 'boolean' }, verifierAllowScripts: { type: 'boolean' }, solverMaxToolCalls: { type: 'integer' }, verifierMaxToolCalls: { type: 'integer' }, reportIntervalMs: { type: 'integer' }, tickIntervalMs: { type: 'integer' }, activityLogCap: { type: 'integer' }, maxExplorerRetries: { type: 'integer' }, directionsPerSolver: { type: 'integer' }, planningHorizon: { type: 'integer' }, plannerEnabled: { type: 'boolean' }, plannerProvider: { type: 'string' }, plannerModel: { type: 'string' }, planMinIntervalMs: { type: 'integer' }, plannerMaxFails: { type: 'integer' }, methodKeepIntervalMs: { type: 'integer' }, methodKeepEvery: { type: 'integer' }, methodAutoPromote: { type: 'boolean' }, indexAutoRebuild: { type: 'boolean' }, projectLockTimeoutMs: { type: 'integer' }, formalVerify: { type: 'string', enum: ['off', 'encourage', 'require'] }, leanCommand: { type: 'string' }, leanArgs: { type: 'array', items: { type: 'string' } }, leanTimeoutMs: { type: 'integer' }, finalPaper: { type: 'boolean' }, paperFormat: { type: 'string', enum: ['both', 'md', 'tex'] }, paperLanguage: { type: 'string', enum: ['zh', 'en'] }, paperCompilePdf: { type: 'boolean' }, paperLatexCommand: { type: 'string' } }), async function (args) { params = Object.assign({}, params, sanitizeParams(args)); await saveAll(); await saveSettings(); return { ok: true, params: params } })
+  registerTool('vibe_math_setup', TOOL_DESC.vibe_math_setup, objParams({}), async function () { await refreshParams(); const list = PARAM_SCHEMA.map(function (p) { const out = Object.assign({}, p); out.current = params[p.name]; out.default = DEFAULT_PARAMS[p.name]; return out }); return { ok: true, parameters: list, saveTo: frameworkRoot() + '/vibe_math_setting.json' } })
+  registerTool('vibe_math_save_settings', TOOL_DESC.vibe_math_save_settings, objParams({}), async function () { return await saveSettings() })
+  registerTool('vibe_math_template', TOOL_DESC.vibe_math_template, objParams({ where: { type: 'string', enum: ['global', 'project'] } }), async function (args) { return await createTemplate((args && args.where) || 'global') })
+  registerTool('vibe_math_add_problem', TOOL_DESC.vibe_math_add_problem, objParams({ id: { type: 'string' }, description: { type: 'string' }, priority: { type: 'integer' }, dependencies: { type: 'array', items: { type: 'string' } } }, ['id', 'description']), async function (args) { const id = idSafe(args.id); if (problems.has(id)) return { ok: false, message: 'problem id already exists' }; problems.set(id, { id: id, 标题: id, 状态: '求解中', 优先级: args.priority || 0, 依赖: Array.isArray(args.dependencies) ? args.dependencies : [], 被依赖: [], 来源: '原始', 计划: '待调度', 陈述: String(args.description == null ? '' : args.description), 来源与动机: '', solutions: [], 判断命题: '', 来源命题: '' }); await saveProblem(problems.get(id)); await syncDependencies(); await rebuildIndex(); scheduleTick(); return { ok: true, message: 'problem added', file: problemRel(problems.get(id)) } })
+  registerTool('vibe_math_add_proposition', TOOL_DESC.vibe_math_add_proposition, objParams({ id: { type: 'string' }, 概述: { type: 'string' }, 概率: { type: 'number' }, 优先级: { type: 'integer' }, '价值/关键性': { type: 'number' }, 分类: { type: 'string' }, 来源问题: { type: 'string' }, 来源方向: { type: 'string' } }, ['id', '概述']), async function (args) {
+    // M9：内存键、对象 id、文件名必须是**同一个**归一化 id。此前内存键用原始 id、文件名用
+    // idSafe(id)、重载键又来自文件名 ⇒ 同一个对象分裂成两个身份（`p-1/2` 与 `p-1-2`）。
+    const id = idSafe(args.id)
+    if (propos.has(id)) return { ok: false, message: 'proposition id already exists' }
+    const p = { id: id, 标题: id, 状态: '未定论', 概率: clamp01(args.概率 != null ? args.概率 : 0.5), 优先级: (args.优先级 != null) ? args.优先级 : 1, 依赖: [], 价值关键性: clamp01(args['价值/关键性'] != null ? args['价值/关键性'] : 0.5), 分类: args.分类 || '未分类', 陈述: String(args.概述 == null ? '' : args.概述), proofs: [], refutes: [], 来源问题: String(args.来源问题 || ''), 来源方向: String(args.来源方向 || ''), 在问题清单: false }
     propos.set(p.id, p); await saveProposition(p); await rebuildIndex(); scheduleTick(); return { ok: true, proposition: p, file: propositionRel(p) }
   })
-  registerTool('vibe_math_list_propositions', 'List propositions from Propos/ (summary index: id, 标题, 概率, 状态, 优先级, 分类).', objParams({}), async function () { const all = allPropos(); return { ok: true, count: all.length, propositions: all.map(function (p) { return { id: p.id, 标题: p.标题, 概率: p.概率, 状态: p.状态, 优先级: p.优先级, 分类: categoryOf(p) } }) } })
-  registerTool('vibe_math_new_project', 'Create a new math project folder and switch to it.', objParams({ name: { type: 'string' } }, ['name']), async function (args) { const slug = slugify(args.name); return await setProject(slug, true) })
-  registerTool('vibe_math_set_project', 'Switch the current math project.', objParams({ name: { type: 'string' } }, ['name']), async function (args) { const slug = slugify(args.name); return await setProject(slug, false) })
-  registerTool('vibe_math_list_projects', 'List math projects.', objParams({}), async function () { return { ok: true, current: currentProject, projects: await listDirsAt(vibeRoot(), 'Projects') } })
-  registerTool('vibe_math_list_decisions', 'List pending manual decisions.', objParams({}), async function () { return { ok: true, decisions: decisionQueue.filter(function (d) { return d.status === 'pending' }).map(function (d) { return { id: d.id, node: d.node, context: d.context } }) } })
-  registerTool('vibe_math_decide', 'Resolve a pending manual decision (plan: approve|reject; verdict: override with verdict 1|0; spawn: approve|reject; method-promote: approve|reject).', objParams({ id: { type: 'string' }, action: { type: 'string', enum: ['approve', 'reject', 'override'] }, verdict: { type: 'number' } }, ['id', 'action']), async function (args) { const d = decisionQueue.find(function (x) { return x.id === args.id }); if (!d) return { ok: false, message: 'decision not found' }; if (d.status !== 'pending') return { ok: false, message: 'decision already resolved' }; const resolution = { action: args.action, verdict: args.verdict }; const applied = await applyDecision(d.node, d.data, resolution); const r = await resolveDecision(args.id, resolution); return Object.assign({ ok: true, applied: applied }, r) })
-  registerTool('vibe_math_list_agents', 'List tracked sub-agents (child sessions).', objParams({}), async function () { const out = []; const ids = Object.keys(agentRegistry); for (let i = 0; i < ids.length; i++) { const m = agentRegistry[ids[i]]; out.push({ childId: ids[i], role: m.role, qid: m.qid, direction: m.direction, round: m.round, rId: m.rId }) } return { ok: true, agents: out, count: out.length } })
-  registerTool('vibe_math_message_agent', 'Send a message to a tracked child agent (next turn).', objParams({ childId: { type: 'string' }, message: { type: 'string' } }, ['childId', 'message']), async function (args) { if (!agentRegistry[args.childId]) return { ok: false, message: 'unknown childId' }; await followupChild(args.childId, args.message); return { ok: true, message: 'message delivered' } })
-  registerTool('vibe_math_interrupt_agent', 'Interrupt a tracked child agent.', objParams({ childId: { type: 'string' } }, ['childId']), async function (args) { await interruptChild(args.childId); return { ok: true, message: 'interrupt requested' } })
-  registerTool('vibe_math_plan', 'Show the queued plan / last plan result, or force a planning round.', objParams({ force: { type: 'boolean' } }), async function (args) { if (args && args.force && scheduler.running && !scheduler.gate) { await callPlanner(); return { ok: true, message: 'planning triggered', queued: planQueue.length } } return { ok: true, queued: planQueue, lastPlan: lastPlanSummary } })
-  registerTool('vibe_math_index', 'Rebuild the machine index (State/index.json) from the Markdown knowledge base.', objParams({}), async function () { await loadKnowledgeBase(); const r = await rebuildIndex(); return { ok: true, index: r, project: currentProject } })
-  registerTool('vibe_math_method_add', 'Manually add a method card to Methods/ (creates Methods/<id>.md).', objParams({ id: { type: 'string' }, 标题: { type: 'string' }, 类型: { type: 'string' }, 核心内容: { type: 'string' }, 适用场景: { type: 'string' } }, ['id', '标题']), async function (args) { if (methods.has(args.id)) return { ok: false, message: 'method id already exists' }; const m = { id: args.id, 标题: args.标题, 类型: args.类型 || '方法', 状态: '经验', 可信断言: [], 上级体系: [], 子方法: [], 相关: [], 适用场景: args.适用场景 || '', 核心内容: args.核心内容 || '', 定义与记号: '', applications: [], improvements: [], 来源: 'user' }; methods.set(m.id, m); await saveMethod(m, false); await rebuildIndex(); return { ok: true, method: m, file: methodRel(m, false) } })
-  registerTool('vibe_math_method_list', 'List methods from Methods/ (+ global VibeMath/Methods/): id, 标题, 类型, 状态, 可信断言, applications count.', objParams({}), async function () { const all = Array.from(methods.values()); const g = Array.from(globalMethods.values()); return { ok: true, count: all.length, globalCount: g.length, methods: all.map(function (m) { return { id: m.id, 标题: m.标题, 类型: m.类型, 状态: m.状态, 可信断言: m.可信断言 || [], applications: (m.applications || []).length, global: false } }).concat(g.map(function (m) { return { id: m.id, 标题: m.标题, 类型: m.类型, 状态: m.状态, 可信断言: m.可信断言 || [], applications: (m.applications || []).length, global: true } })) } })
-  registerTool('vibe_math_lock_status', 'Show the project lock occupancy.', objParams({}), async function () { return { ok: true, project: currentProject, lock: projectLock } })
-  registerTool('vibe_math_claim_write', 'Acquire the write lock for one target file (relative to the project root). Call before writing a Markdown file directly; a file may only be written by ONE agent at a time. Returns the display path you may write (VibeMath/Projects/<project>/<target>) and a hint.', objParams({ target: { type: 'string' } }, ['target']), async function (args, agent) { return await claimWrite(String(args.target || ''), agent) })
-  registerTool('vibe_math_release_write', 'Release the write lock for one target file (relative to the project root). Call after you finished writing it.', objParams({ target: { type: 'string' } }, ['target']), async function (args, agent) { return await releaseWrite(String(args.target || ''), agent) })
-  registerTool('vibe_math_sync_meta', 'Report lightweight scheduling metadata after you wrote content to Markdown files (direction status/survival, registered lemma ids, methods_used/new_inventions, new method cards). Content itself stays in the md files; this only keeps the scheduler index/state in sync.', objParams({ meta: { type: 'object' } }, ['meta']), async function (args, agent) { return await syncMeta(args.meta || {}, agent) })
+  registerTool('vibe_math_list_propositions', TOOL_DESC.vibe_math_list_propositions, objParams({}), async function () { const all = allPropos(); return { ok: true, count: all.length, propositions: all.map(function (p) { return { id: p.id, 标题: p.标题, 概率: p.概率, 状态: p.状态, 优先级: p.优先级, 分类: categoryOf(p) } }) } })
+  registerTool('vibe_math_new_project', TOOL_DESC.vibe_math_new_project, objParams({ name: { type: 'string' } }, ['name']), async function (args) { const slug = slugify(args.name); return await setProject(slug, true) })
+  registerTool('vibe_math_set_project', TOOL_DESC.vibe_math_set_project, objParams({ name: { type: 'string' } }, ['name']), async function (args) { const slug = slugify(args.name); return await setProject(slug, false) })
+  registerTool('vibe_math_list_projects', TOOL_DESC.vibe_math_list_projects, objParams({}), async function () { return { ok: true, current: currentProject, projects: await listDirsAt(vibeRoot(), 'Projects') } })
+  registerTool('vibe_math_list_decisions', TOOL_DESC.vibe_math_list_decisions, objParams({}), async function () { return { ok: true, decisions: decisionQueue.filter(function (d) { return d.status === 'pending' }).map(function (d) { return { id: d.id, node: d.node, context: d.context } }) } })
+  registerTool('vibe_math_decide', TOOL_DESC.vibe_math_decide, objParams({ id: { type: 'string' }, action: { type: 'string', enum: ['approve', 'reject', 'override'] }, verdict: { type: 'number' } }, ['id', 'action']), async function (args) { const d = decisionQueue.find(function (x) { return x.id === args.id }); if (!d) return { ok: false, message: 'decision not found' }; if (d.status !== 'pending') return { ok: false, message: 'decision already resolved' }; const resolution = { action: args.action, verdict: args.verdict }; const applied = await applyDecision(d.node, d.data, resolution); const r = await resolveDecision(args.id, resolution); return Object.assign({ ok: true, applied: applied }, r) })
+  registerTool('vibe_math_list_agents', TOOL_DESC.vibe_math_list_agents, objParams({}), async function () { const out = []; const ids = Object.keys(agentRegistry); for (let i = 0; i < ids.length; i++) { const m = agentRegistry[ids[i]]; out.push({ childId: ids[i], role: m.role, qid: m.qid, direction: m.direction, round: m.round, rId: m.rId }) } return { ok: true, agents: out, count: out.length } })
+  registerTool('vibe_math_message_agent', TOOL_DESC.vibe_math_message_agent, objParams({ childId: { type: 'string' }, message: { type: 'string' } }, ['childId', 'message']), async function (args) { if (!agentRegistry[args.childId]) return { ok: false, message: 'unknown childId' }; await followupChild(args.childId, args.message); return { ok: true, message: 'message delivered' } })
+  registerTool('vibe_math_interrupt_agent', TOOL_DESC.vibe_math_interrupt_agent, objParams({ childId: { type: 'string' } }, ['childId']), async function (args) { await interruptChild(args.childId); return { ok: true, message: 'interrupt requested' } })
+  registerTool('vibe_math_plan', TOOL_DESC.vibe_math_plan, objParams({ force: { type: 'boolean' } }), async function (args) { if (args && args.force && scheduler.running && !scheduler.gate) { await callPlanner(); return { ok: true, message: 'planning triggered', queued: planQueue.length } } return { ok: true, queued: planQueue, lastPlan: lastPlanSummary } })
+  registerTool('vibe_math_index', TOOL_DESC.vibe_math_index, objParams({}), async function () { await loadKnowledgeBase(); const r = await rebuildIndex(); return { ok: true, index: r, project: currentProject } })
+  registerTool('vibe_math_method_add', TOOL_DESC.vibe_math_method_add, objParams({ id: { type: 'string' }, 标题: { type: 'string' }, 类型: { type: 'string' }, 核心内容: { type: 'string' }, 适用场景: { type: 'string' } }, ['id', '标题']), async function (args) { const id = idSafe(args.id); if (methods.has(id)) return { ok: false, message: 'method id already exists' }; const m = { id: id, 标题: args.标题, 类型: args.类型 || '方法', 状态: '经验', 可信断言: [], 上级体系: [], 子方法: [], 相关: [], 适用场景: args.适用场景 || '', 核心内容: args.核心内容 || '', 定义与记号: '', applications: [], improvements: [], 来源: 'user' }; methods.set(m.id, m); await saveMethod(m, false); await rebuildIndex(); return { ok: true, method: m, file: methodRel(m, false) } })
+  registerTool('vibe_math_method_list', TOOL_DESC.vibe_math_method_list, objParams({}), async function () { const all = Array.from(methods.values()); const g = Array.from(globalMethods.values()); return { ok: true, count: all.length, globalCount: g.length, methods: all.map(function (m) { return { id: m.id, 标题: m.标题, 类型: m.类型, 状态: m.状态, 可信断言: m.可信断言 || [], applications: (m.applications || []).length, global: false } }).concat(g.map(function (m) { return { id: m.id, 标题: m.标题, 类型: m.类型, 状态: m.状态, 可信断言: m.可信断言 || [], applications: (m.applications || []).length, global: true } })) } })
+  registerTool('vibe_math_lock_status', TOOL_DESC.vibe_math_lock_status, objParams({}), async function () { return { ok: true, project: currentProject, lock: projectLock } })
+  registerTool('vibe_math_claim_write', TOOL_DESC.vibe_math_claim_write, objParams({ target: { type: 'string' } }, ['target']), async function (args, agent) { return await claimWrite(String(args.target || ''), agent) })
+  registerTool('vibe_math_release_write', TOOL_DESC.vibe_math_release_write, objParams({ target: { type: 'string' } }, ['target']), async function (args, agent) { return await releaseWrite(String(args.target || ''), agent) })
+  registerTool('vibe_math_sync_meta', TOOL_DESC.vibe_math_sync_meta, objParams({ meta: { type: 'object' } }, ['meta']), async function (args, agent) { return await syncMeta(args.meta || {}, agent) })
 
   // ---- Lean 形式化验证工具（契约 docs/formal-verification.md §5）----
   // **无条件注册**：注册是静态的（与既有 ctx.effect 纪律一致），模式只决定框架是否主动告诉
   // 代理它们存在；off 模式下人/代理主动调用时照常工作。
-  registerTool('vibe_math_lean_run', '(member) Execute the Lean toolchain on one .lean file inside the workspace and report the result. Never throws: a missing toolchain returns LEAN_NOT_FOUND, a non-zero exit returns the compiler output. Pass target=<object id> to also record the run against that object.', objParams({ file: { type: 'string' }, target: { type: 'string' }, timeout_ms: { type: 'integer' } }, ['file']), async function (args, agent) { return await leanRunTool(agent && agent.id, args) })
-  registerTool('vibe_math_lean_archive', '(member) Archive Lean code. kind="def": a REUSABLE definition/object/assumption → the global cross-project library (VibeMath/Formal/Lib). kind="lemma": a machine-checked lemma → VibeMath/Formal/Proved. kind="proof": the formal proof of a project object → Formal/<target>.lean, and (when the run passes) also Verified/Lean/<target>.lean, marking the object Lean-passed. kind="blocked": record an explicit, reasoned "cannot/not worth formalizing" decision (note required).', objParams({ kind: { type: 'string', enum: ['def', 'lemma', 'proof', 'blocked'] }, name: { type: 'string' }, target: { type: 'string' }, content: { type: 'string' }, from: { type: 'string' }, note: { type: 'string' }, run: { type: 'boolean' } }, ['kind']), async function (args, agent) { return await leanArchive(agent && agent.id, args) })
-  registerTool('vibe_math_lean_lib', "(member) List (and by default rebuild) the Lean reuse library: this project's Formal/Index.md, plus the global cross-project Formal/Lib and Formal/Proved indexes. Look here BEFORE writing a new definition so you reuse instead of redefining.", objParams({ refresh: { type: 'boolean' } }), async function (args) {
+  registerTool('vibe_math_lean_run', TOOL_DESC.vibe_math_lean_run, objParams({ file: { type: 'string' }, target: { type: 'string' }, timeout_ms: { type: 'integer' } }, ['file']), async function (args, agent) { return await leanRunTool(agent && agent.id, args) })
+  registerTool('vibe_math_lean_archive', TOOL_DESC.vibe_math_lean_archive, objParams({ kind: { type: 'string', enum: ['def', 'lemma', 'proof', 'blocked'] }, name: { type: 'string' }, target: { type: 'string' }, content: { type: 'string' }, from: { type: 'string' }, note: { type: 'string' }, run: { type: 'boolean' } }, ['kind']), async function (args, agent) { return await leanArchive(agent && agent.id, args) })
+  registerTool('vibe_math_lean_lib', TOOL_DESC.vibe_math_lean_lib, objParams({ refresh: { type: 'boolean' } }), async function (args) {
     const a = args || {}
     const r = a.refresh === false
       ? { lib: null, proved: null, objects: Object.keys(formalRecords()).length }
@@ -3455,11 +4141,13 @@ export function apply(ctx) {
         if (Array.isArray(meta.lemmas)) {
           for (const l of meta.lemmas) {
             if (!l || (!l.id && !l.title)) continue
-            const pid = l.id || ('p-' + shortId())
+            // M9：代理给的 id 可能与文件名归一化结果不同（`p-1/2` → `p-1-2`）⇒ 键与 id 一并归一化。
+            const pid = l.id ? idSafe(l.id) : ('p-' + shortId())
             if (!propos.has(pid)) {
-              const pn = { id: pid, 标题: l.title || pid, 状态: '未定论', 概率: clamp01(l.prob != null ? l.prob : 0.6), 优先级: l.优先级 != null ? l.优先级 : 1, 依赖: [], 价值关键性: clamp01(l['价值/关键性'] != null ? l['价值/关键性'] : 0.5), 分类: l.分类 || '未分类', 陈述: l.statement || l.title || '', proofs: [], refutes: [], 来源问题: qid, 在问题清单: false }
+              const lProb = lemmaProb(l)
+              const pn = { id: pid, 标题: l.title || pid, 状态: '未定论', 概率: clamp01(lProb != null ? lProb : 0.6), 优先级: l.优先级 != null ? l.优先级 : 1, 依赖: [], 价值关键性: clamp01(l['价值/关键性'] != null ? l['价值/关键性'] : 0.5), 分类: lemmaCategory(l) || '未分类', 陈述: l.statement || l.title || '', proofs: [], refutes: [], 来源问题: qid, 在问题清单: false }
               // 引理证明文本（验证必需）由代理在 sync_meta 的 l.proof 上报（结构化，非长叙述）；无则验证器只能验裸命题
-              if (l.proof) { pn.proofs = [{ title: (l.title || pid) + '（证明）', prob: clamp01(l.prob != null ? l.prob : 0.7), status: '未定论', text: String(l.proof) }] }
+              if (l.proof) { pn.proofs = [{ title: (l.title || pid) + '（证明）', prob: clamp01(lProb != null ? lProb : 0.7), status: '未定论', text: String(l.proof) }] }
               propos.set(pid, pn)
               // 若代理已直接写了该命题卡，保留其内容（不覆盖）；否则写一张标准卡兜底（保证可被索引/验证）
               const rel = propositionRel(pn) // 与 saveProposition 同一路径
@@ -3468,11 +4156,16 @@ export function apply(ctx) {
             if (!(dir.lemmas || []).some(function (x) { return x.id === pid })) { dir.lemmas = dir.lemmas || []; dir.lemmas.push({ id: pid, title: l.title || pid }) }
           }
         }
-        // 解法上报（prob 由代理写进 Problems/<qid>.md；这里只登记）
-        if (meta.solution_prob != null && meta.solution_text) {
+        // 解法上报（prob 由代理写进 Problems/<qid>.md；这里只登记）。
+        // M11：提示词教的是 `solution_text` / `solution_prob`，但遗留扁平通道用的是
+        // `parsed.solution` / `parsed.solution_probability`。**两套拼写都接受**，否则一个
+        // 严格按提示词回 `solution_text` 的 solver 会在这里被判成"声称成功却没有解法"，方向被写死。
+        const solText = (meta.solution_text != null) ? meta.solution_text : meta.solution
+        const solProb = (meta.solution_prob != null) ? meta.solution_prob : meta.solution_probability
+        if (solProb != null && solText) {
           q.solutions = q.solutions || []
-          const p = clamp01(meta.solution_prob)
-          q.solutions.push({ title: '解法 ' + (q.solutions.length + 1), prob: p >= 1 ? 0.99 : (p <= 0 ? 0.01 : p), status: '未定论', text: String(meta.solution_text).slice(0, 2000) })
+          const p = clamp01(solProb)
+          q.solutions.push({ title: '解法 ' + (q.solutions.length + 1), prob: p >= 1 ? 0.99 : (p <= 0 ? 0.01 : p), status: '未定论', text: String(solText).slice(0, 2000) })
         }
         // 子问题/临时假设（与旧 JSON 路径一致）：注册 q_sub 问题 + 判断问题 + p-tmp 假设
         if (Array.isArray(meta.sub_questions)) {
@@ -3491,7 +4184,8 @@ export function apply(ctx) {
     }
     if (kind === 'methods') {
       if (Array.isArray(meta.used)) for (const mu of meta.used) await consumeMethodFeedback({ methods_used: mu ? [mu] : [] }, { qid: '', dirId: '' })
-      if (Array.isArray(meta.created)) for (const mid of meta.created) {
+      if (Array.isArray(meta.created)) for (const rawMid of meta.created) {
+        const mid = idSafe(rawMid) // M9：键、id 与文件名同一把归一化
         if (!methods.has(mid)) {
           const mm = { id: mid, 标题: mid, 类型: '方法', 状态: '经验', 可信断言: [], 上级体系: [], 子方法: [], 相关: [], 适用场景: '', 核心内容: '', 定义与记号: '', applications: [], improvements: [], 来源: 'agent-written' }
           methods.set(mid, mm)
@@ -3503,12 +4197,13 @@ export function apply(ctx) {
       if (Array.isArray(meta.improvements)) {
         for (const imp of meta.improvements) {
           if (!imp || !imp.id) continue
-          const m = methods.get(imp.id)
-          if (!m) { logActivity('method', 'improvement referenced unknown method ' + imp.id); continue }
+          const impId = idSafe(imp.id) // M9：方法键已归一化，改进目标必须查同一把键
+          const m = methods.get(impId)
+          if (!m) { logActivity('method', 'improvement referenced unknown method ' + impId); continue }
           m.improvements = m.improvements || []
           m.improvements.push({ v: m.improvements.length + 1, 原因: imp.原因 || '', text: imp.改进内容 || '' })
           await saveMethod(m, false)
-          logActivity('method', 'method ' + imp.id + ' improved (v' + m.improvements.length + ')')
+          logActivity('method', 'method ' + impId + ' improved (v' + m.improvements.length + ')')
         }
       }
       await saveAll()
@@ -3517,10 +4212,26 @@ export function apply(ctx) {
     return { ok: false, message: 'unknown meta kind: ' + kind }
   }
 
+  // ---- 会话级 handler 表的工具描述（唯一来源）----
+  //
+  // 提示词审计 M3（v3）：同一批工具在**两条注册路径**上各写了一份 description——会话 handler 表
+  // （registerTool(name, description, …) 只存 handler）与文件末尾真正的 `tools.register`
+  // （模型实际看到的那一份）。两边的**参数 schema 一致**（I13/I14 守），但描述会漂移：
+  // `vibe_math_list_propositions` / `vibe_math_method_list` / `claim_write` / `release_write` /
+  // `sync_meta` 五处曾对不上，模型看到哪一版取决于哪条路径生效。
+  //
+  // 现在这两条路径共用**模块级**常量 TOOL_DESC（定义在文件末尾的 shared helpers 区），
+  // 任何一侧被改都会同时生效，不可能再漂移。`tests/audit-v3-registration-parity.mjs` 守这条不变式。
+
   // ================= slash command /vibe =================
+  // 注意：签名**必须**保持 `dispatchVibeCommand(cmd, args)`——`audit-persona-surface` 的
+  // `commandRegion()` 靠这个字面量把 /vibe 的分支表接进提示词面一致性检查（hint/usage/handler
+  // 三处必须一致）。多一个形参会让那段源码不再被扫到，等于把这条守卫静默关掉。
+  // `override` 通过 args 本身传递（见下面 commands.register 的处理）。
   async function dispatchVibeCommand(cmd, args) {
-    if (cmd === 'start') return await startScheduler()
-    if (cmd === 'resume') return await resumeScheduler()
+    const override = args.indexOf('override') !== -1
+    if (cmd === 'start') return await startScheduler(override)
+    if (cmd === 'resume') return await resumeScheduler(override)
     if (cmd === 'pause') return await pauseScheduler()
     if (cmd === 'abort') return await abortScheduler()
     if (cmd === 'status') { await refreshParams(); return await getStatus() }
@@ -3529,8 +4240,8 @@ export function apply(ctx) {
     if (cmd === 'setup') { await refreshParams(); const list = PARAM_SCHEMA.map(function (p) { const out = Object.assign({}, p); out.current = params[p.name]; out.default = DEFAULT_PARAMS[p.name]; return out }); return { ok: true, parameters: list, saveTo: frameworkRoot() + '/vibe_math_setting.json' } }
     if (cmd === 'save') return await saveSettings()
     if (cmd === 'template') return await createTemplate(args[0] === 'project' ? 'project' : 'global')
-    if (cmd === 'add') { const id = args[0]; const desc = args.slice(1).join(' '); if (!id || !desc) return { ok: false, message: 'usage: /vibe add <id> <description>' }; if (problems.has(id)) return { ok: false, message: 'problem id already exists' }; problems.set(id, { id: id, 标题: id, 状态: '求解中', 优先级: 0, 依赖: [], 被依赖: [], 来源: '原始', 计划: '待调度', 陈述: desc, 来源与动机: '', solutions: [], 判断命题: '', 来源命题: '' }); await saveProblem(problems.get(id)); await rebuildIndex(); scheduleTick(); return { ok: true, message: 'problem added', file: problemRel(problems.get(id)) } }
-    if (cmd === 'add-proposition') { const id = args[0]; const desc = args.slice(1).join(' '); if (!id || !desc) return { ok: false, message: 'usage: /vibe add-proposition <id> <概述>' }; const p = { id: id, 标题: id, 状态: '未定论', 概率: 0.5, 优先级: 1, 依赖: [], 价值关键性: 0.5, 分类: '未分类', 陈述: desc, proofs: [], refutes: [], 来源问题: '', 在问题清单: false }; propos.set(p.id, p); await saveProposition(p); await rebuildIndex(); scheduleTick(); return { ok: true, proposition: p, file: propositionRel(p) } }
+    if (cmd === 'add') { const raw = args[0]; const desc = args.slice(1).join(' '); if (!raw || !desc) return { ok: false, message: 'usage: /vibe add <id> <description>' }; const id = idSafe(raw); if (problems.has(id)) return { ok: false, message: 'problem id already exists' }; problems.set(id, { id: id, 标题: id, 状态: '求解中', 优先级: 0, 依赖: [], 被依赖: [], 来源: '原始', 计划: '待调度', 陈述: desc, 来源与动机: '', solutions: [], 判断命题: '', 来源命题: '' }); await saveProblem(problems.get(id)); await rebuildIndex(); scheduleTick(); return { ok: true, message: 'problem added', file: problemRel(problems.get(id)) } }
+    if (cmd === 'add-proposition') { const raw = args[0]; const desc = args.slice(1).join(' '); if (!raw || !desc) return { ok: false, message: 'usage: /vibe add-proposition <id> <概述>' }; const id = idSafe(raw); const p = { id: id, 标题: id, 状态: '未定论', 概率: 0.5, 优先级: 1, 依赖: [], 价值关键性: 0.5, 分类: '未分类', 陈述: desc, proofs: [], refutes: [], 来源问题: '', 在问题清单: false }; propos.set(p.id, p); await saveProposition(p); await rebuildIndex(); scheduleTick(); return { ok: true, proposition: p, file: propositionRel(p) } }
     if (cmd === 'list-propositions') { const all = allPropos(); return { ok: true, count: all.length, propositions: all.map(function (p) { return { id: p.id, 标题: p.标题, 概率: p.概率, 状态: p.状态, 优先级: p.优先级, 分类: categoryOf(p) } }) } }
     if (cmd === 'methods') { const all = Array.from(methods.values()); return { ok: true, count: all.length, methods: all.map(function (m) { return { id: m.id, 标题: m.标题, 类型: m.类型, 状态: m.状态 } }) } }
     if (cmd === 'index') { await loadKnowledgeBase(); return await rebuildIndex() }
@@ -3543,7 +4254,8 @@ export function apply(ctx) {
     }
     if (cmd === 'decisions') return { ok: true, decisions: decisionQueue.filter(function (d) { return d.status === 'pending' }).map(function (d) { return { id: d.id, node: d.node, context: d.context } }) }
     if (cmd === 'agents') { const out = []; const ids = Object.keys(agentRegistry); for (let i = 0; i < ids.length; i++) { const m = agentRegistry[ids[i]]; out.push({ childId: ids[i], role: m.role, qid: m.qid, direction: m.direction, round: m.round }) } return { ok: true, agents: out } }
-    return { ok: false, usage: 'start | resume | pause | abort | status | report | mode <auto|manual> | setup | save | template [global|project] | add <id> <desc> | add-proposition <id> <概述> | list-propositions | methods | index | plan | lock | project [list|new <name>|<name>] | decisions | agents', message: 'unknown /vibe subcommand: ' + (cmd || '(empty)') }
+    if (cmd === 'paper') return await paperCommand(args)
+    return { ok: false, usage: 'start [override] | resume [override] | pause | abort | status | report | mode <auto|manual> | setup | save | template [global|project] | add <id> <desc> | add-proposition <id> <概述> | list-propositions | methods | index | plan | lock | project [list|new <name>|<name>] | decisions | agents | paper [lang=zh|en] [format=both|md|tex] [force]', message: 'unknown /vibe subcommand: ' + (cmd || '(empty)') }
   }
 
   // ================= session surface =================
@@ -3556,11 +4268,29 @@ export function apply(ctx) {
     get scheduler() { return scheduler },
     get tickInFlight() { return tickInFlight },
     scheduleTick: scheduleTick,
+    // Lease renewal for the apply-scope interval (see the ctx.effect below). Kept on the session so
+    // the timer needs no per-session context, and so a mock host WITHOUT ctx.timeout still renews.
+    renewLockIfDue: renewProjectLock,
     onChildEnd: onChildEnd,
     dispatchVibeCommand: dispatchVibeCommand,
     handlers: handlers,
     refreshProject: async function () { if (rootAgent) currentProject = await readCurrentProject() },
     getRunning: function () { return scheduler.running },
+    // apply 级心跳用（修订 §A2）：running=false 之后 scheduleTick() 是空操作，论文的排队重试
+    // （激活上限）与 paper 锁续租必须由**独立于调度器**的心跳驱动。
+    paperRetryDue: paperRetryDue,
+    runPaperRetry: runPaperRetry,
+    // childOwner 裁剪用（审计 L1）：这个会话当前仍"可能再发 subagent/end"的 child
+    // = 在册子代理 + 任何任务正在等的那几个。
+    referencedChildIds: function () {
+      const out = Object.keys(agentRegistry)
+      const ids = Object.keys(tasks)
+      for (let i = 0; i < ids.length; i++) {
+        const t = tasks[ids[i]]
+        if (t && Array.isArray(t.children)) for (let j = 0; j < t.children.length; j++) out.push(t.children[j])
+      }
+      return out
+    },
     tickDue: function () { const iv = Math.max(200, Number(params.tickIntervalMs) || 2000); return (now() - lastTickAt) >= iv },
   }
 }
@@ -3581,47 +4311,47 @@ export function apply(ctx) {
       },
     }))
   }
-  registerTool('vibe_math_start', 'Start (or restart) the Vibe Math V3 scheduler for the current project.', objParams({}), 'vibe_math_start')
-  registerTool('vibe_math_resume', 'Resume the Vibe Math V3 scheduler after a checkpoint/restart.', objParams({}), 'vibe_math_resume')
-  registerTool('vibe_math_pause', 'Pause the scheduler (in-flight children finish their current turn).', objParams({}), 'vibe_math_pause')
-  registerTool('vibe_math_abort', 'Abort the scheduler and interrupt all active children.', objParams({}), 'vibe_math_abort')
-  registerTool('vibe_math_status', 'Show scheduler status, params, active agents, projects, and recent activity.', objParams({}), 'vibe_math_status')
-  registerTool('vibe_math_report', 'Return the full progress report and write it to Progress_Logs/report.json + Logs/报告.md.', objParams({}), 'vibe_math_report')
-  registerTool('vibe_math_set_mode', 'Switch between manual and auto (preset) mode. Switching to auto auto-resolves any pending manual decisions.', objParams({ mode: { type: 'string', enum: ['manual', 'auto'] } }, ['mode']), 'vibe_math_set_mode')
-  registerTool('vibe_math_set_params', 'Update scheduler parameters (partial). Lean 形式化验证：formalVerify = off（默认，不额外要求）| encourage（按实现难度自行决定是否形式化；一旦 Lean 通过，验证转为对 Lean 陈述的「忠实性审查」）| require（同上，且加门禁：对象未达到 Lean 已通过或已记录显式阻塞原因之前，真/假裁定记为未定论、原因 formal-required，并进入 Formal/TODO.md）；leanCommand/leanArgs/leanTimeoutMs 控制 Lean 工具链的调用方式。', objParams({ maxParallelThreshold: { type: 'integer' }, solverMaxRounds: { type: 'integer' }, verifierCount: { type: 'integer' }, debateMaxRounds: { type: 'integer' }, verdictMode: { type: 'string', enum: ['flat', 'forced'] }, reportMode: { type: 'string', enum: ['file', 'push', 'both'] }, promoteValueThreshold: { type: 'number' }, priorityAdjust: { type: 'string', enum: ['none', 'deadend-deprioritize', 'survival-map'] }, proposPriorityAdjust: { type: 'string', enum: ['none', 'progress-graded'] }, provider: { type: 'string' }, model: { type: 'string' }, solverPersona: { type: 'string' }, verifierPersona: { type: 'string' }, explorerPersona: { type: 'string' }, plannerPersona: { type: 'string' }, methodKeeperPersona: { type: 'string' }, knowledgeContext: { type: 'string' }, solverToolAllow: { type: 'array', items: { type: 'string' } }, solverToolDeny: { type: 'array', items: { type: 'string' } }, verifierToolAllow: { type: 'array', items: { type: 'string' } }, verifierToolDeny: { type: 'array', items: { type: 'string' } }, solverAllowNetwork: { type: 'boolean' }, verifierAllowNetwork: { type: 'boolean' }, solverAllowScripts: { type: 'boolean' }, verifierAllowScripts: { type: 'boolean' }, solverMaxToolCalls: { type: 'integer' }, verifierMaxToolCalls: { type: 'integer' }, reportIntervalMs: { type: 'integer' }, tickIntervalMs: { type: 'integer' }, activityLogCap: { type: 'integer' }, maxExplorerRetries: { type: 'integer' }, directionsPerSolver: { type: 'integer' }, planningHorizon: { type: 'integer' }, plannerEnabled: { type: 'boolean' }, plannerProvider: { type: 'string' }, plannerModel: { type: 'string' }, planMinIntervalMs: { type: 'integer' }, plannerMaxFails: { type: 'integer' }, methodKeepIntervalMs: { type: 'integer' }, methodKeepEvery: { type: 'integer' }, methodAutoPromote: { type: 'boolean' }, indexAutoRebuild: { type: 'boolean' }, projectLockTimeoutMs: { type: 'integer' }, formalVerify: { type: 'string', enum: ['off', 'encourage', 'require'] }, leanCommand: { type: 'string' }, leanArgs: { type: 'array', items: { type: 'string' } }, leanTimeoutMs: { type: 'integer' } }), 'vibe_math_set_params')
-  registerTool('vibe_math_setup', 'Return the interactive parameter schema for guided configuration.', objParams({}), 'vibe_math_setup')
-  registerTool('vibe_math_save_settings', 'Write the current params to vibe_math_setting.json (JSON with comments) as new defaults.', objParams({}), 'vibe_math_save_settings')
-  registerTool('vibe_math_template', 'Create a fresh vibe_math_setting.json template (with defaults + comments) in the workspace (global) or current project folder.', objParams({ where: { type: 'string', enum: ['global', 'project'] } }), 'vibe_math_template')
-  registerTool('vibe_math_add_problem', 'Add a problem to the current project (creates Problems/<id>.md).', objParams({ id: { type: 'string' }, description: { type: 'string' }, priority: { type: 'integer' }, dependencies: { type: 'array', items: { type: 'string' } } }, ['id', 'description']), 'vibe_math_add_problem')
-  registerTool('vibe_math_add_proposition', 'Add a proposition to Propos/ (creates Propos/<分类>/<id>.md).', objParams({ id: { type: 'string' }, 概述: { type: 'string' }, 概率: { type: 'number' }, 优先级: { type: 'integer' }, '价值/关键性': { type: 'number' }, 分类: { type: 'string' } }, ['id', '概述']), 'vibe_math_add_proposition')
-  registerTool('vibe_math_list_propositions', 'List propositions from Propos/ (summary index).', objParams({}), 'vibe_math_list_propositions')
-  registerTool('vibe_math_new_project', 'Create a new math project folder and switch to it.', objParams({ name: { type: 'string' } }, ['name']), 'vibe_math_new_project')
-  registerTool('vibe_math_set_project', 'Switch the current math project.', objParams({ name: { type: 'string' } }, ['name']), 'vibe_math_set_project')
-  registerTool('vibe_math_list_projects', 'List math projects.', objParams({}), 'vibe_math_list_projects')
-  registerTool('vibe_math_list_decisions', 'List pending manual decisions.', objParams({}), 'vibe_math_list_decisions')
-  registerTool('vibe_math_decide', 'Resolve a pending manual decision (plan: approve|reject; verdict: override with verdict 1|0; spawn: approve|reject; method-promote: approve|reject).', objParams({ id: { type: 'string' }, action: { type: 'string', enum: ['approve', 'reject', 'override'] }, verdict: { type: 'number' } }, ['id', 'action']), 'vibe_math_decide')
-  registerTool('vibe_math_list_agents', 'List tracked sub-agents (child sessions).', objParams({}), 'vibe_math_list_agents')
-  registerTool('vibe_math_message_agent', 'Send a message to a tracked child agent (next turn).', objParams({ childId: { type: 'string' }, message: { type: 'string' } }, ['childId', 'message']), 'vibe_math_message_agent')
-  registerTool('vibe_math_interrupt_agent', 'Interrupt a tracked child agent.', objParams({ childId: { type: 'string' } }, ['childId']), 'vibe_math_interrupt_agent')
-  registerTool('vibe_math_plan', 'Show the queued plan / last plan result, or force a planning round.', objParams({ force: { type: 'boolean' } }), 'vibe_math_plan')
-  registerTool('vibe_math_index', 'Rebuild the machine index (State/index.json) from the Markdown knowledge base.', objParams({}), 'vibe_math_index')
-  registerTool('vibe_math_method_add', 'Manually add a method card to Methods/ (creates Methods/<id>.md).', objParams({ id: { type: 'string' }, 标题: { type: 'string' }, 类型: { type: 'string' }, 核心内容: { type: 'string' }, 适用场景: { type: 'string' } }, ['id', '标题']), 'vibe_math_method_add')
-  registerTool('vibe_math_method_list', 'List methods from Methods/ (+ global VibeMath/Methods/).', objParams({}), 'vibe_math_method_list')
-  registerTool('vibe_math_lock_status', 'Show the project lock occupancy.', objParams({}), 'vibe_math_lock_status')
-  registerTool('vibe_math_claim_write', 'Acquire the write lock for one target file (relative to the project root). Call before writing a Markdown file directly.', objParams({ target: { type: 'string' } }, ['target']), 'vibe_math_claim_write')
-  registerTool('vibe_math_release_write', 'Release the write lock for one target file (relative to the project root).', objParams({ target: { type: 'string' } }, ['target']), 'vibe_math_release_write')
-  registerTool('vibe_math_sync_meta', 'After you write content into Markdown files, report ONLY lightweight scheduling metadata to keep the scheduler state in sync (content stays in the md files). meta.kind must be one of:\n- "directions": {qid, directions:[{id,title,method,core_assumption,feasibility}], methods_used:[{id,效果,建议}], new_inventions:[{类型,标题,内容描述,是否已入库}]}\n- "solver": {qid, dirId, round, survival, status:"continue|success|dead-end", dead_end_reason, lemmas:[{id,title,statement,proof,prob,分类,优先级}], methods_used, new_inventions, solution_prob, solution_text, sub_questions:[{q_sub_title,q_sub_statement,assumption_title,assumption_statement}]}\n- "methods": {used:[{id,效果,建议}], created:[ids], improvements:[{id,改进内容,原因}]}', objParams({ meta: { type: 'object' } }, ['meta']), 'vibe_math_sync_meta')
+  registerTool('vibe_math_start', TOOL_DESC.vibe_math_start, objParams({ override: { type: 'boolean' } }), 'vibe_math_start')
+  registerTool('vibe_math_resume', TOOL_DESC.vibe_math_resume, objParams({ override: { type: 'boolean' } }), 'vibe_math_resume')
+  registerTool('vibe_math_pause', TOOL_DESC.vibe_math_pause, objParams({}), 'vibe_math_pause')
+  registerTool('vibe_math_abort', TOOL_DESC.vibe_math_abort, objParams({}), 'vibe_math_abort')
+  registerTool('vibe_math_status', TOOL_DESC.vibe_math_status, objParams({}), 'vibe_math_status')
+  registerTool('vibe_math_report', TOOL_DESC.vibe_math_report, objParams({}), 'vibe_math_report')
+  registerTool('vibe_math_set_mode', TOOL_DESC.vibe_math_set_mode, objParams({ mode: { type: 'string', enum: ['manual', 'auto'] } }, ['mode']), 'vibe_math_set_mode')
+  registerTool('vibe_math_set_params', TOOL_DESC.vibe_math_set_params, objParams({ mode: { type: 'string', enum: ['manual', 'auto'] }, maxParallelThreshold: { type: 'integer' }, solverMaxRounds: { type: 'integer' }, verifierCount: { type: 'integer' }, debateMaxRounds: { type: 'integer' }, verdictMode: { type: 'string', enum: ['flat', 'forced'] }, reportMode: { type: 'string', enum: ['file', 'push', 'both'] }, promoteValueThreshold: { type: 'number' }, priorityAdjust: { type: 'string', enum: ['none', 'deadend-deprioritize', 'survival-map'] }, proposPriorityAdjust: { type: 'string', enum: ['none', 'progress-graded'] }, provider: { type: 'string' }, model: { type: 'string' }, solverPersona: { type: 'string' }, verifierPersona: { type: 'string' }, explorerPersona: { type: 'string' }, plannerPersona: { type: 'string' }, methodKeeperPersona: { type: 'string' }, knowledgeContext: { type: 'string' }, solverToolAllow: { type: 'array', items: { type: 'string' } }, solverToolDeny: { type: 'array', items: { type: 'string' } }, verifierToolAllow: { type: 'array', items: { type: 'string' } }, verifierToolDeny: { type: 'array', items: { type: 'string' } }, solverAllowNetwork: { type: 'boolean' }, verifierAllowNetwork: { type: 'boolean' }, solverAllowScripts: { type: 'boolean' }, verifierAllowScripts: { type: 'boolean' }, solverMaxToolCalls: { type: 'integer' }, verifierMaxToolCalls: { type: 'integer' }, reportIntervalMs: { type: 'integer' }, tickIntervalMs: { type: 'integer' }, activityLogCap: { type: 'integer' }, maxExplorerRetries: { type: 'integer' }, directionsPerSolver: { type: 'integer' }, planningHorizon: { type: 'integer' }, plannerEnabled: { type: 'boolean' }, plannerProvider: { type: 'string' }, plannerModel: { type: 'string' }, planMinIntervalMs: { type: 'integer' }, plannerMaxFails: { type: 'integer' }, methodKeepIntervalMs: { type: 'integer' }, methodKeepEvery: { type: 'integer' }, methodAutoPromote: { type: 'boolean' }, indexAutoRebuild: { type: 'boolean' }, projectLockTimeoutMs: { type: 'integer' }, formalVerify: { type: 'string', enum: ['off', 'encourage', 'require'] }, leanCommand: { type: 'string' }, leanArgs: { type: 'array', items: { type: 'string' } }, leanTimeoutMs: { type: 'integer' }, finalPaper: { type: 'boolean' }, paperFormat: { type: 'string', enum: ['both', 'md', 'tex'] }, paperLanguage: { type: 'string', enum: ['zh', 'en'] }, paperCompilePdf: { type: 'boolean' }, paperLatexCommand: { type: 'string' } }), 'vibe_math_set_params')
+  registerTool('vibe_math_setup', TOOL_DESC.vibe_math_setup, objParams({}), 'vibe_math_setup')
+  registerTool('vibe_math_save_settings', TOOL_DESC.vibe_math_save_settings, objParams({}), 'vibe_math_save_settings')
+  registerTool('vibe_math_template', TOOL_DESC.vibe_math_template, objParams({ where: { type: 'string', enum: ['global', 'project'] } }), 'vibe_math_template')
+  registerTool('vibe_math_add_problem', TOOL_DESC.vibe_math_add_problem, objParams({ id: { type: 'string' }, description: { type: 'string' }, priority: { type: 'integer' }, dependencies: { type: 'array', items: { type: 'string' } } }, ['id', 'description']), 'vibe_math_add_problem')
+  registerTool('vibe_math_add_proposition', TOOL_DESC.vibe_math_add_proposition, objParams({ id: { type: 'string' }, 概述: { type: 'string' }, 概率: { type: 'number' }, 优先级: { type: 'integer' }, '价值/关键性': { type: 'number' }, 分类: { type: 'string' }, 来源问题: { type: 'string' }, 来源方向: { type: 'string' } }, ['id', '概述']), 'vibe_math_add_proposition')
+  registerTool('vibe_math_list_propositions', TOOL_DESC.vibe_math_list_propositions, objParams({}), 'vibe_math_list_propositions')
+  registerTool('vibe_math_new_project', TOOL_DESC.vibe_math_new_project, objParams({ name: { type: 'string' } }, ['name']), 'vibe_math_new_project')
+  registerTool('vibe_math_set_project', TOOL_DESC.vibe_math_set_project, objParams({ name: { type: 'string' } }, ['name']), 'vibe_math_set_project')
+  registerTool('vibe_math_list_projects', TOOL_DESC.vibe_math_list_projects, objParams({}), 'vibe_math_list_projects')
+  registerTool('vibe_math_list_decisions', TOOL_DESC.vibe_math_list_decisions, objParams({}), 'vibe_math_list_decisions')
+  registerTool('vibe_math_decide', TOOL_DESC.vibe_math_decide, objParams({ id: { type: 'string' }, action: { type: 'string', enum: ['approve', 'reject', 'override'] }, verdict: { type: 'number' } }, ['id', 'action']), 'vibe_math_decide')
+  registerTool('vibe_math_list_agents', TOOL_DESC.vibe_math_list_agents, objParams({}), 'vibe_math_list_agents')
+  registerTool('vibe_math_message_agent', TOOL_DESC.vibe_math_message_agent, objParams({ childId: { type: 'string' }, message: { type: 'string' } }, ['childId', 'message']), 'vibe_math_message_agent')
+  registerTool('vibe_math_interrupt_agent', TOOL_DESC.vibe_math_interrupt_agent, objParams({ childId: { type: 'string' } }, ['childId']), 'vibe_math_interrupt_agent')
+  registerTool('vibe_math_plan', TOOL_DESC.vibe_math_plan, objParams({ force: { type: 'boolean' } }), 'vibe_math_plan')
+  registerTool('vibe_math_index', TOOL_DESC.vibe_math_index, objParams({}), 'vibe_math_index')
+  registerTool('vibe_math_method_add', TOOL_DESC.vibe_math_method_add, objParams({ id: { type: 'string' }, 标题: { type: 'string' }, 类型: { type: 'string' }, 核心内容: { type: 'string' }, 适用场景: { type: 'string' } }, ['id', '标题']), 'vibe_math_method_add')
+  registerTool('vibe_math_method_list', TOOL_DESC.vibe_math_method_list, objParams({}), 'vibe_math_method_list')
+  registerTool('vibe_math_lock_status', TOOL_DESC.vibe_math_lock_status, objParams({}), 'vibe_math_lock_status')
+  registerTool('vibe_math_claim_write', TOOL_DESC.vibe_math_claim_write, objParams({ target: { type: 'string' } }, ['target']), 'vibe_math_claim_write')
+  registerTool('vibe_math_release_write', TOOL_DESC.vibe_math_release_write, objParams({ target: { type: 'string' } }, ['target']), 'vibe_math_release_write')
+  registerTool('vibe_math_sync_meta', TOOL_DESC.vibe_math_sync_meta, objParams({ meta: { type: 'object' } }, ['meta']), 'vibe_math_sync_meta')
   // Lean 形式化验证（docs/formal-verification.md）：三个工具**无条件注册**——注册是静态的，
   // 模式只决定框架是否主动告诉代理它们存在。off 模式下人/代理主动调用时照常工作。
-  registerTool('vibe_math_lean_run', '(member) Execute the Lean toolchain on one .lean file inside the workspace and report the result. Never throws: a missing toolchain returns LEAN_NOT_FOUND, a non-zero exit returns the compiler output. Pass target=<object id> to also record the run against that object.', objParams({ file: { type: 'string' }, target: { type: 'string' }, timeout_ms: { type: 'integer' } }, ['file']), 'vibe_math_lean_run')
-  registerTool('vibe_math_lean_archive', '(member) Archive Lean code. kind="def": a REUSABLE definition/object/assumption → the global cross-project library (VibeMath/Formal/Lib). kind="lemma": a machine-checked lemma → VibeMath/Formal/Proved. kind="proof": the formal proof of a project object → Formal/<target>.lean, and (when the run passes) also Verified/Lean/<target>.lean, marking the object Lean-passed. kind="blocked": record an explicit, reasoned "cannot/not worth formalizing" decision (note required).', objParams({ kind: { type: 'string', enum: ['def', 'lemma', 'proof', 'blocked'] }, name: { type: 'string' }, target: { type: 'string' }, content: { type: 'string' }, from: { type: 'string' }, note: { type: 'string' }, run: { type: 'boolean' } }, ['kind']), 'vibe_math_lean_archive')
-  registerTool('vibe_math_lean_lib', "(member) List (and by default rebuild) the Lean reuse library: this project's Formal/Index.md, plus the global cross-project Formal/Lib and Formal/Proved indexes. Look here BEFORE writing a new definition so you reuse instead of redefining.", objParams({ refresh: { type: 'boolean' } }), 'vibe_math_lean_lib')
+  registerTool('vibe_math_lean_run', TOOL_DESC.vibe_math_lean_run, objParams({ file: { type: 'string' }, target: { type: 'string' }, timeout_ms: { type: 'integer' } }, ['file']), 'vibe_math_lean_run')
+  registerTool('vibe_math_lean_archive', TOOL_DESC.vibe_math_lean_archive, objParams({ kind: { type: 'string', enum: ['def', 'lemma', 'proof', 'blocked'] }, name: { type: 'string' }, target: { type: 'string' }, content: { type: 'string' }, from: { type: 'string' }, note: { type: 'string' }, run: { type: 'boolean' } }, ['kind']), 'vibe_math_lean_archive')
+  registerTool('vibe_math_lean_lib', TOOL_DESC.vibe_math_lean_lib, objParams({ refresh: { type: 'boolean' } }), 'vibe_math_lean_lib')
 
   // /vibe slash command (registered once; routed per session)
   ctx.effect(() => commands.register({
     name: 'vibe',
     description: 'control the Vibe Math V3 solver (start/pause/projects/setup/save/decisions/agents/methods/index/plan/lock)',
-    input: { hint: '[start|resume|pause|abort|status|report|mode <auto|manual>|setup|save|template [global|project]|add <id> <desc>|add-proposition <id> <概述>|list-propositions|methods|index|plan|lock|project [list|new <name>|<name>]|decisions|agents]' },
+    input: { hint: '[start [override]|resume [override]|pause|abort|status|report|mode <auto|manual>|setup|save|template [global|project]|add <id> <desc>|add-proposition <id> <概述>|list-propositions|methods|index|plan|lock|project [list|new <name>|<name>]|decisions|agents|paper [lang=zh|en] [format=both|md|tex] [force]]' },
     handler: async function (invocation) {
       const s = getSession(invocation && invocation.agent)
       if (!s) return { kind: 'error', text: JSON.stringify({ ok: false, error: 'no vibe-math session for this agent' }) }
@@ -3640,16 +4370,61 @@ export function apply(ctx) {
 
   // subagent/end (registered once; routed to the owning session via childOwner)
   ctx.on('subagent/end', function (info) {
+    // 记下最近一次 end 的时间：childOwner 的宽限期从这里算（见 pruneChildOwner）。
+    lastChildEndAt.set(info.id, now())
     const sid = childOwner.get(info.id)
     const s = sid !== undefined ? sessions.get(sid) : undefined
     if (s) s.onChildEnd(info).catch(function (e) { console.error('vibe-math-v3 onChildEnd reject: ' + String((e && e.stack) || e)) })
-    // 注意：这里**不要**回收 childOwner 条目（与 v2 同一结论）。该映射在子代理 end 之后仍会
+    // 注意：这里**不要**立即回收 childOwner 条目（与 v2 同一结论）。该映射在子代理 end 之后仍会
     // 被后续事件路由用到；在 v2 上实测过"事件回调里回收"与"onChildEnd 末尾回收"两种写法，
-    // 都会让 verdict 收口失效。代价只是每个历史子代理一条小记录（有界、不影响功能）。
+    // 都会让 verdict 收口失效。回收交给引用 + 宽限期的 pruneChildOwner（审计 L1）。
   })
 
+  // Project-lock LEASE renewal timer (Round C, HIGH): renewal must NOT live in tick().
+  //
+  // Round A put `await renewProjectLock()` at the top of tick(), which left the lease starvable: a
+  // single tick whose awaited work outlives projectLockTimeoutMs (one slow shell/Lean call is enough)
+  // keeps the on-disk `at` stale, and the `if (tickInFlight) return` early-return (:1374) renews
+  // nothing either, so a second session's acquireProjectLock() saw `age >= timeout` and took the
+  // project lock WITHOUT `override` while this session was alive and mid-tick. Measured: 5803 ms of
+  // stale lease against a 2500 ms timeout (probe _oneoff/rb-probe-v3-locklease.mjs).
+  //
+  // An independent interval cannot be delayed by tick duration, tick overlap or a held gate. It is
+  // registered once per preset via ctx.effect (disposed with the plugin) — NOT per startScheduler —
+  // so an `await` inside its callback cannot race plugin disposal, and the scheduler stays mockable
+  // (tests/selfdrive-v3.mjs has no ctx.timeout). The poll runs many times inside one lease window,
+  // so the lease can never approach expiry however long a single tick runs; renewProjectLock() itself
+  // is still the throttled writer and keeps its `scheduler.running` / ownership guards, which preserves
+  // the crash-recovery path exactly: a dead process stops renewing, its lease ages out, and only then
+  // may a new session take it over.
+  // 心跳定时器（每个宿主一次，随插件 fiber 释放）。
+  //
+  // L7：优先用**宿主的 timer 服务**（`ctx.interval`，随宿主暂停/记账、随 fiber 释放），
+  // 只有在宿主没有该服务时（测试 mock / 旧线）才回落到裸 setInterval——回落是必需的：
+  // `inject` 里没有 'timer'（加进去会让缺该服务的主机整个不激活），而 mock 宿主没有 ctx.interval。
+  // 两种实现都返回 disposer，ctx.effect 的清理语义不变。
+  function everyMs(ms, fn) {
+    try { if (typeof ctx.interval === 'function') return ctx.interval(fn, ms) } catch (e) { /* 回落到 setInterval */ }
+    const t = setInterval(fn, ms)
+    return () => clearInterval(t)
+  }
+  ctx.effect(() => everyMs(LOCK_POLL_MS, function () { for (const s of sessions.values()) { s.renewLockIfDue().catch(function (e) { console.error('vibe-math-v3 lock renew error: ' + String((e && e.message) || e)) }) } }))
   // tick timer (registered once; ticks every running session at its own pace)
-  ctx.effect(() => { const t = setInterval(function () { for (const s of sessions.values()) { if (s.getRunning() && !s.tickInFlight && s.tickDue() && s.scheduler.gate === null) s.scheduleTick() } }, 1000); return () => clearInterval(t) })
+  ctx.effect(() => {
+    let beat = 0
+    return everyMs(1000, function () {
+      for (const s of sessions.values()) {
+        if (s.getRunning() && !s.tickInFlight && s.tickDue() && s.scheduler.gate === null) s.scheduleTick()
+        // 论文心跳（修订 §A2）：**独立于 scheduler.running** —— 收口后 running=false，但被激活上限
+        // 拒绝的撰写派遣仍要重试，在途时还要续租 paper 锁。runPaperRetry() 无事可做时立即返回。
+        if (typeof s.runPaperRetry === 'function') s.runPaperRetry().catch(function (e) { console.error('vibe-math-v3: paper retry failed: ' + String((e && e.message) || e)) })
+      }
+      // childOwner 裁剪（审计 L1）：每 30 拍（约 30s）一次，成本是"会话数 × 映射数"的一次扫描。
+      if ((++beat % 30) === 0) {
+        try { pruneChildOwner() } catch (e) { console.error('vibe-math-v3: pruneChildOwner failed: ' + String((e && e.message) || e)) }
+      }
+    })
+  })
 }
 
 // ---- test seam: pure, stateless helpers --------------------------------
@@ -3665,6 +4440,255 @@ export function apply(ctx) {
 // to the clock) and `parseProgress` normalises the object it is handed in place (pre-existing).
 // Nothing here is used by the plugin at runtime except through `apply()`, and behaviour is
 // byte-identical to the previous in-`apply` declarations.
+// ============================================================================================
+// 最终论文（规格：docs/final-paper.md）—— **纯函数部分**（module scope；
+// 与 v2 逐字同构，只有数据来源不同）。会话相关的落盘/派遣/编译在 makeSession 里。
+// ============================================================================================
+/** 固定 9 节骨架（spec §3）。key 同时是 md 的 `## ` 标题与 tex 的 `\section{}`。 */
+const PAPER_SKELETON = [
+  { key: '摘要', spec: '1 标题、作者、日期、摘要（原问题 + 主要结论）' },
+  { key: '引言与问题背景', spec: '2 原问题的完整陈述' },
+  { key: '原问题的完整解法', spec: '3 最终答案 + 完整推理链' },
+  { key: '已检验通过的命题', spec: '4 逐条列出，含判定为真的估计值与证据来源' },
+  { key: '已解决的子问题与中间成果', spec: '5' },
+  { key: '创造或发现的有价值之物', spec: '6 方法、理论、思想、有价值经验、数学理解' },
+  { key: '规律总结', spec: '7 从上述条目归纳出的可复用规律' },
+  { key: '讨论、局限与展望', spec: '8' },
+  { key: '附录：证据与文件索引', spec: '9 Verified/、Logs/、关键卡片路径' },
+]
+const PAPER_NO_EVIDENCE = '（本节暂无证据支持的内容——不编造。）'
+const PAPER_EVIDENCE_HEADING = '证据与文件索引'
+/** LaTeX 引擎检测顺序（spec §5）：中文优先 xelatex，英文优先 pdflatex/latexmk。 */
+const PAPER_ENGINE_ORDER_ZH = ['xelatex', 'latexmk', 'pdflatex', 'lualatex', 'tectonic']
+const PAPER_ENGINE_ORDER_EN = ['pdflatex', 'latexmk', 'xelatex', 'lualatex', 'tectonic']
+/** 只用常见宏包（spec §5）；修复阶段会丢弃不在这个名单里的 \usepackage。 */
+const PAPER_ALLOWED_PACKAGES = ['amsmath', 'amssymb', 'amsthm', 'geometry', 'hyperref', 'longtable', 'booktabs']
+/** tex 必须转义的 10 个字符（spec §5）：\ _ % & # $ { } ~ ^ ——一次替换，避免二次转义。 */
+const PAPER_TEX_MAP = { '\\': '\\textbackslash{}', '_': '\\_', '%': '\\%', '&': '\\&', '#': '\\#', '$': '\\$', '{': '\\{', '}': '\\}', '~': '\\textasciitilde{}', '^': '\\textasciicircum{}' }
+function texEscape(s) { return String(s == null ? '' : s).replace(/[\\_%&#${}~^]/g, function (c) { return PAPER_TEX_MAP[c] }) }
+/** 材料摘要（只作记录；幂等判定用 run id + finalizedAt + 逐产物存在性，修订 §C）。 */
+function paperMaterialSummary(digest) {
+  const t = String(digest == null ? '' : digest)
+  return { chars: t.length, lines: t.split('\n').length }
+}
+/**
+ * 撰写者卡死判定（纯函数，便于守卫覆盖两条分支）：
+ *   'none'   正常在途（还没到卡死窗口，且 force 未要求放弃）
+ *   'reap'   必须回收：child 已不在 agentRegistry（end 事件丢失 / 宿主丢弃，它永远不会再回来），
+ *            或已超过卡死窗口——force 与心跳都据此自动降级，论文不能被一个死掉的撰写者永久卡住
+ *   'refuse' force 但还没到窗口：调用方必须给出**可执行**的报错（告诉调用者还要等多久）
+ */
+function paperWriterVerdict(o) {
+  if (!(o && o.inFlight)) return 'none'
+  if (o.childInRegistry === false) return 'reap'
+  const age = Number((o && o.ageMs) || 0)
+  const stale = Math.max(1, Number((o && o.staleMs) || 0))
+  if (age >= stale) return 'reap'
+  return (o && o.force) ? 'refuse' : 'none'
+}
+/** 行内 md → tex：``code`` / **bold** / *em* 转成命令，其余按 spec §5 转义；`$...$` 原样保留。 */
+function paperInlineToTex(s) {
+  const t = String(s == null ? '' : s)
+  let out = ''
+  let i = 0
+  while (i < t.length) {
+    const c = t[i]
+    if (c === '$') { const j = t.indexOf('$', i + 1); if (j > i) { out += t.slice(i, j + 1); i = j + 1; continue } }
+    if (c === '`') { const j = t.indexOf('`', i + 1); if (j > i) { out += '\\texttt{' + texEscape(t.slice(i + 1, j)) + '}'; i = j + 1; continue } }
+    if (c === '*' && t[i + 1] === '*') { const j = t.indexOf('**', i + 2); if (j > i) { out += '\\textbf{' + paperInlineToTex(t.slice(i + 2, j)) + '}'; i = j + 2; continue } }
+    if (c === '*') { const j = t.indexOf('*', i + 1); if (j > i) { out += '\\emph{' + paperInlineToTex(t.slice(i + 1, j)) + '}'; i = j + 1; continue } }
+    out += PAPER_TEX_MAP[c] !== undefined ? PAPER_TEX_MAP[c] : c
+    i++
+  }
+  return out
+}
+/** md 正文 → tex 正文（标题/列表/段落；只认 compose 侧约定的最小语法）。 */
+function paperMdToTexBody(md) {
+  const out = []
+  let inList = false
+  let buf = []
+  const flush = function () { if (buf.length) { out.push(paperInlineToTex(buf.join(' '))); buf = [] } }
+  const closeList = function () { if (inList) { out.push('\\end{itemize}'); inList = false } }
+  const lines = String(md == null ? '' : md).split(/\r?\n/)
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i].replace(/\s+$/, '')
+    const h = /^(#{1,4})\s+(.*)$/.exec(line)
+    if (h) {
+      flush(); closeList()
+      const txt = paperInlineToTex(h[2])
+      const lv = h[1].length
+      out.push(lv <= 1 ? ('\\section*{' + txt + '}') : lv === 2 ? ('\\section{' + txt + '}') : lv === 3 ? ('\\subsection{' + txt + '}') : ('\\subsubsection{' + txt + '}'))
+      continue
+    }
+    const li = /^\s*[-*]\s+(.*)$/.exec(line)
+    if (li) { flush(); if (!inList) { out.push('\\begin{itemize}'); inList = true } out.push('  \\item ' + paperInlineToTex(li[1])); continue }
+    if (!line.trim()) { flush(); closeList(); out.push(''); continue }
+    buf.push(line.trim())
+  }
+  flush(); closeList()
+  return out.join('\n').replace(/\n{3,}/g, '\n\n').trim()
+}
+/** 主模板（spec §5）：中文 ctexart / 英文 article，只加常见宏包。 */
+function paperTexDoc(o) {
+  const lang = (o && o.lang === 'en') ? 'en' : 'zh'
+  return [
+    '\\documentclass[11pt]{' + (lang === 'en' ? 'article' : 'ctexart') + '}',
+    '\\usepackage[margin=2.5cm]{geometry}',
+    '\\usepackage{amsmath,amssymb,amsthm}',
+    '\\usepackage{hyperref}',
+    '\\usepackage{longtable,booktabs}',
+    '\\title{' + texEscape(o && o.title) + '}',
+    '\\author{' + texEscape(o && o.author) + '}',
+    '\\date{' + texEscape(o && o.date) + '}',
+    '\\begin{document}',
+    '\\maketitle',
+    String((o && o.bodyTex) || ''),
+    '\\end{document}',
+  ].join('\n') + '\n'
+}
+/** 修复阶段的**最小模板**（spec §5）：只留 documentclass + 正文。 */
+function paperMinimalTexDoc(o) {
+  const lang = (o && o.lang === 'en') ? 'en' : 'zh'
+  return [
+    '\\documentclass[11pt]{' + (lang === 'en' ? 'article' : 'ctexart') + '}',
+    '\\begin{document}',
+    String((o && o.bodyTex) || ''),
+    '\\end{document}',
+  ].join('\n') + '\n'
+}
+/** 修复阶段：丢弃不在常见宏包名单里的 \usepackage（其余原样保留）。 */
+function paperSanitizeTex(tex) {
+  const keep = []
+  const lines = String(tex == null ? '' : tex).split('\n')
+  for (let i = 0; i < lines.length; i++) {
+    const m = /^\s*\\usepackage(\[[^\]]*\])?\{([^}]*)\}\s*$/.exec(lines[i])
+    if (m) {
+      const pkgs = String(m[2]).split(',').map(function (x) { return x.trim() }).filter(Boolean)
+      const ok = pkgs.filter(function (p) { return PAPER_ALLOWED_PACKAGES.indexOf(p) >= 0 })
+      if (ok.length === 0) continue
+      keep.push('\\usepackage' + (m[1] || '') + '{' + ok.join(',') + '}')
+      continue
+    }
+    keep.push(lines[i])
+  }
+  return keep.join('\n')
+}
+/** 骨架名匹配：允许带序号/前缀，或只写节名的一部分（例如「附录」）。 */
+function paperSkeletonKey(name) {
+  const n = String(name == null ? '' : name).replace(/^#+\s*/, '').trim()
+  if (!n) return undefined
+  for (const s of PAPER_SKELETON) if (n === s.key) return s.key
+  for (const s of PAPER_SKELETON) if (n.indexOf(s.key) !== -1 || s.key.indexOf(n) !== -1) return s.key
+  return undefined
+}
+/** 按 `## ` 把任意 markdown 切成 [{name,text}]（无标题时 name=''）。 */
+function paperSplitByHeadings(md) {
+  const out = []
+  let cur = { name: '', text: [] }
+  const lines = String(md == null ? '' : md).split(/\r?\n/)
+  for (let i = 0; i < lines.length; i++) {
+    const h = /^##\s+(.*?)\s*$/.exec(lines[i])
+    if (h) { if (cur.name || cur.text.length) out.push({ name: cur.name, text: cur.text.join('\n').trim() }); cur = { name: h[1], text: [] }; continue }
+    cur.text.push(lines[i])
+  }
+  if (cur.name || cur.text.length) out.push({ name: cur.name, text: cur.text.join('\n').trim() })
+  return out
+}
+/** 把「论文撰写」子代理的回复映射到 9 节骨架上（**绝不编造**：缺的节由调用方填占位说明）。 */
+function paperSkeletonFromReply(reply, fallbackText) {
+  const sections = {}
+  const notes = []
+  let title = ''
+  let abstract = ''
+  const put = function (key, body) {
+    const b = String(body == null ? '' : body).trim()
+    if (!b) return
+    sections[key] = sections[key] ? (sections[key] + '\n\n' + b) : b
+  }
+  const absorbUnknown = function (name, text) {
+    if (!name && !String(text || '').trim()) return
+    notes.push('作者写了一节「' + (name || '(无名)') + '」，不属于固定 9 节骨架，已并入「讨论、局限与展望」')
+    put('讨论、局限与展望', (name ? ('**' + name + '**\n\n') : '') + text)
+  }
+  const obj = (reply && typeof reply === 'object' && !Array.isArray(reply)) ? reply : null
+  if (obj) {
+    title = String(obj.title || obj.标题 || '').trim()
+    abstract = String(obj.abstract || obj.摘要 || '').trim()
+    const list = Array.isArray(obj.sections) ? obj.sections : (Array.isArray(obj.章节) ? obj.章节 : [])
+    for (let i = 0; i < list.length; i++) {
+      const s = list[i]
+      if (!s) continue
+      const name = String(s.name || s.key || s.heading || s.标题 || '')
+      const body = String(s.body != null ? s.body : (s.content != null ? s.content : (s.内容 != null ? s.内容 : '')))
+      const key = paperSkeletonKey(name)
+      if (key === undefined) absorbUnknown(name.trim(), body)
+      else put(key, body)
+    }
+    const bodyField = String(obj.body || obj.content || obj.md || obj.正文 || '')
+    if (bodyField.trim()) {
+      const parts = paperSplitByHeadings(bodyField)
+      for (let i = 0; i < parts.length; i++) {
+        const key = paperSkeletonKey(parts[i].name)
+        if (key === undefined) { if (!parts[i].name && !abstract && !sections['摘要']) abstract = parts[i].text; else if (parts[i].name) absorbUnknown(parts[i].name, parts[i].text) }
+        else put(key, parts[i].text)
+      }
+    }
+  } else {
+    const parts = paperSplitByHeadings(String(fallbackText == null ? '' : fallbackText))
+    let matched = 0
+    for (let i = 0; i < parts.length; i++) {
+      const key = paperSkeletonKey(parts[i].name)
+      if (key === undefined) { if (parts[i].name) absorbUnknown(parts[i].name, parts[i].text) }
+      else { put(key, parts[i].text); matched++ }
+    }
+    if (matched === 0) {
+      const raw = String(fallbackText == null ? '' : fallbackText).trim()
+      if (raw) { notes.push('作者回复不是契约 JSON，也没有可识别的 `## ` 节标题；其原样正文已记入「讨论、局限与展望」'); put('讨论、局限与展望', raw) }
+      else notes.push('作者回复为空：没有任何内容可写（不得编造）')
+    }
+  }
+  return { title: title, abstract: abstract, sections: sections, notes: notes }
+}
+/** 组装 md（spec §3）：9 节固定骨架 + 确定性证据索引；缺证据的节写占位说明。 */
+function paperBuildMarkdown(o) {
+  const sec = (o && o.sections) || {}
+  const ev = ((o && o.evidence) || []).slice()
+  const L = []
+  const ttl = String((o && o.title) || '').trim() || '研究报告'
+  L.push('# ' + ttl)
+  L.push('')
+  L.push('- 作者：' + String((o && o.author) || ''))
+  L.push('- 日期：' + String((o && o.date) || ''))
+  L.push('')
+  for (let i = 0; i < PAPER_SKELETON.length; i++) {
+    const key = PAPER_SKELETON[i].key
+    L.push('## ' + key)
+    L.push('')
+    let body = String(sec[key] || '').trim()
+    if (key === '摘要') { const ab = String((o && o.abstract) || '').trim(); if (ab) body = body ? (ab + '\n\n' + body) : ab }
+    if (key === '附录：证据与文件索引' && ev.length) {
+      const idx = '### ' + PAPER_EVIDENCE_HEADING + '\n\n' + ev.map(function (x) { return '- `' + String(x) + '`' }).join('\n')
+      body = body ? (body + '\n\n' + idx) : idx
+    }
+    L.push(body || PAPER_NO_EVIDENCE)
+    L.push('')
+  }
+  return L.join('\n').replace(/\n{3,}/g, '\n\n').trimEnd() + '\n'
+}
+/** paper.log.md 的**唯一格式**（v2/v3 逐字一致，spec §4）。 */
+function paperLogHead(id) {
+  return ['# 论文写作日志｜' + String(id), '',
+    '> 单作者流程（v2/v3 同一格式）：收口触发 → 派遣「论文撰写」子代理 → 落盘 md/tex → 编译 pdf。', '']
+}
+function paperLogLine(at, tag, text) { return '- ' + fmtTime(at) + ' [' + String(tag) + '] ' + String(text == null ? '' : text) }
+/** 论文目录 id：只允许安全字符（同一把归一化 ⇒ 不可能写出 Paper/ 之外，spec §6 越权用例）。 */
+function paperDirId(raw) { return (idSafe(String(raw == null ? '' : raw).trim()) || 'run') }
+/** 从回复里抽出可能存在的标题行（md 非契约路径的兜底）。 */
+function paperTitleFromMd(md) {
+  const m = /^#\s+(.*?)\s*$/m.exec(String(md == null ? '' : md))
+  return m ? m[1].trim() : ''
+}
+
 export const __testHelpers = {
   uuid,
   shortId,
@@ -3682,21 +4706,109 @@ export const __testHelpers = {
   parseEntries,
   section,
   parseBodySections,
+  findSectionHeads,
+  escField,
+  unescField,
+  entryRe,
+  probText,
   extraBodySections,
   parseAppTitle,
   parseMethodMd,
   sanitizeToolFilter,
   registeredToolsFromError,
+  // final paper（spec §6 的纯函数守卫面；与 v2 同构）
+  PAPER_SKELETON,
+  PAPER_NO_EVIDENCE,
+  PAPER_ALLOWED_PACKAGES,
+  PAPER_ENGINE_ORDER_ZH,
+  PAPER_ENGINE_ORDER_EN,
+  texEscape,
+  paperMaterialSummary,
+  paperWriterVerdict,
+  paperInlineToTex,
+  paperMdToTexBody,
+  paperTexDoc,
+  paperMinimalTexDoc,
+  paperSanitizeTex,
+  paperSkeletonKey,
+  paperSkeletonFromReply,
+  paperBuildMarkdown,
+  paperLogHead,
+  paperLogLine,
+  paperDirId,
+  paperTitleFromMd,
 }
 
 function now() { return Date.now() }
 
+/**
+ * 工具描述的唯一来源（提示词审计 M3）：v3 的每个工具都在**两条路径**上注册——会话 handler 表
+ * （makeSession 内只存 handler）与文件末尾真正生效的 `tools.register`。两条路径必须逐字一致，
+ * 否则模型看到的描述取决于哪条路径生效，任何一侧被改都会静默改变提示词面。
+ * 全部 33 个工具都从此表取描述；`tests/audit-v3-registration-parity.mjs` 逐字比对两条路径。
+ */
+const TOOL_DESC = {
+  vibe_math_start: 'Start (or restart) the Vibe Math V3 scheduler for the current project. override=true forcibly takes over the project lock held by another session (only after you verified that session is gone).',
+  vibe_math_resume: 'Resume the Vibe Math V3 scheduler after a checkpoint/restart. override=true forcibly takes over the project lock held by another session (only after you verified that session is gone).',
+  vibe_math_pause: 'Pause the scheduler (in-flight children finish their current turn).',
+  vibe_math_abort: 'Abort the scheduler and interrupt all active children.',
+  vibe_math_status: 'Show scheduler status, params, active agents, projects, and recent activity.',
+  vibe_math_report: 'Return the full progress report and write it to Progress_Logs/report.json + Logs/报告.md.',
+  vibe_math_set_mode: 'Switch between manual and auto (preset) mode. Switching to auto auto-resolves any pending manual decisions.',
+  // set_params 的 schema 现在也收 mode（M10）：同一能力既有专用工具 vibe_math_set_mode，也可用这个键；
+  // 两条注册路径共用这一份描述，`--self-probe` 会证明漂移能被抓到。
+  vibe_math_set_params: 'Update scheduler parameters (partial). Lean 形式化验证：formalVerify = off（默认，不额外要求）| encourage（按实现难度自行决定是否形式化；一旦 Lean 通过，验证转为对 Lean 陈述的「忠实性审查」）| require（同上，且加门禁：对象未达到 Lean 已通过或已记录显式阻塞原因之前，真/假裁定记为未定论、原因 formal-required，并进入 Formal/TODO.md）；leanCommand/leanArgs/leanTimeoutMs 控制 Lean 工具链的调用方式。最终论文：finalPaper（默认 true；收口时自动派遣一名「论文撰写」子代理）/ paperFormat = both|md|tex / paperLanguage = zh|en / paperCompilePdf（检测到 LaTeX 时编译 paper.pdf）/ paperLatexCommand（指定引擎，空 = 自动探测 xelatex→latexmk→pdflatex→lualatex→tectonic），产物在 Paper/<项目>/。',
+  vibe_math_setup: 'Return the interactive parameter schema for guided configuration.',
+  vibe_math_save_settings: 'Write the current params to vibe_math_setting.json (JSON with comments) as new defaults.',
+  vibe_math_template: 'Create a fresh vibe_math_setting.json template (with defaults + comments) in the workspace (global) or current project folder.',
+  vibe_math_add_problem: 'Add a problem to the current project (creates Problems/<id>.md).',
+  vibe_math_add_proposition: 'Add a proposition to Propos/ (creates Propos/<分类>/<id>.md).',
+  vibe_math_list_propositions: 'List propositions from Propos/ (summary index: id, 标题, 概率, 状态, 优先级, 分类).',
+  vibe_math_new_project: 'Create a new math project folder and switch to it.',
+  vibe_math_set_project: 'Switch the current math project.',
+  vibe_math_list_projects: 'List math projects.',
+  vibe_math_list_decisions: 'List pending manual decisions.',
+  vibe_math_decide: 'Resolve a pending manual decision (plan: approve|reject; verdict: override with verdict 1|0; spawn: approve|reject; method-promote: approve|reject).',
+  vibe_math_list_agents: 'List tracked sub-agents (child sessions).',
+  vibe_math_message_agent: 'Send a message to a tracked child agent (next turn).',
+  vibe_math_interrupt_agent: 'Interrupt a tracked child agent.',
+  vibe_math_plan: 'Show the queued plan / last plan result, or force a planning round.',
+  vibe_math_index: 'Rebuild the machine index (State/index.json) from the Markdown knowledge base.',
+  vibe_math_method_add: 'Manually add a method card to Methods/ (creates Methods/<id>.md).',
+  vibe_math_method_list: 'List methods from Methods/ (+ global VibeMath/Methods/): id, 标题, 类型, 状态, 可信断言, applications count.',
+  vibe_math_lock_status: 'Show the project lock occupancy.',
+  vibe_math_claim_write: '(member) Acquire the write lock for one target file (relative to the project root). Call before writing a Markdown file directly; a file may only be written by ONE agent at a time. Returns the display path you may write (VibeMath/Projects/<project>/<target>) and a hint.',
+  vibe_math_release_write: '(member) Release the write lock for one target file (relative to the project root). Call after you finished writing it.',
+  vibe_math_sync_meta: '(member) After you write content into Markdown files, report ONLY lightweight scheduling metadata to keep the scheduler state in sync (content stays in the md files). meta.kind must be one of:\n- "directions": {qid, directions:[{id,title,method,core_assumption,feasibility}], methods_used:[{id,效果,建议}], new_inventions:[{类型,标题,内容描述,是否已入库}]}\n- "solver": {qid, dirId, round, survival, status:"continue|success|dead-end", dead_end_reason, lemmas:[{id,title,statement,proof,prob,价值/关键性,分类,优先级}], methods_used, new_inventions, solution_prob, solution_text, sub_questions:[{q_sub_title,q_sub_statement,assumption_title,assumption_statement}]}\n- "methods": {used:[{id,效果,建议}], created:[ids], improvements:[{id,改进内容,原因}]}',
+  vibe_math_lean_run: "(member) Execute the Lean toolchain on one .lean file inside the workspace and report the result. Never throws: a missing toolchain returns LEAN_NOT_FOUND, a non-zero exit returns the compiler output. Pass target=<object id> to also record the run against that object.",
+  vibe_math_lean_archive: '(member) Archive Lean code. kind="def": a REUSABLE definition/object/assumption → the global cross-project library (VibeMath/Formal/Lib). kind="lemma": a machine-checked lemma → VibeMath/Formal/Proved. kind="proof": the formal proof of a project object → Formal/<target>.lean, and (when the run passes) also Verified/Lean/<target>.lean, marking the object Lean-passed. kind="blocked": record an explicit, reasoned "cannot/not worth formalizing" decision (note required).',
+  vibe_math_lean_lib: "(member) List (and by default rebuild) the Lean reuse library: this project's Formal/Index.md, plus the global cross-project Formal/Lib and Formal/Proved indexes. Look here BEFORE writing a new definition so you reuse instead of redefining.",
+}
+
 function uuid() { const h = '0123456789abcdef'; let s = ''; for (let i = 0; i < 36; i++) { if (i === 8 || i === 13 || i === 18 || i === 23) s += '-'; else s += h[Math.floor(Math.random() * 16)] } return s }
 
 function shortId() { const h = '0123456789abcdef'; let s = ''; for (let i = 0; i < 8; i++) s += h[Math.floor(Math.random() * 16)]; return s }
 
 function clamp01(v) { const n = Number(v); if (!Number.isFinite(n)) return 0.5; return Math.max(0, Math.min(1, n)) }
 
+/**
+ * M11：同一个语义两套字段名。提示词教的是 `prob`（`lemmas[].prob`），而遗留扁平 JSON 通道
+ * 用的是 `布尔估计`（`细类型` 同理）。这里统一取值顺序，两套拼写都接受，避免"按提示词回写的
+ * 引理"被当成没有估计值。
+ */
+function lemmaProb(l) {
+  if (l == null) return undefined
+  if (l.prob != null) return l.prob
+  if (l['布尔估计'] != null) return l['布尔估计']
+  return undefined
+}
+function lemmaCategory(l) {
+  if (l == null) return ''
+  if (l['分类'] != null) return String(l['分类'])
+  if (l['细类型'] != null) return String(Object.keys(l['细类型'] || { 未分类: {} })[0] || '未分类')
+  return ''
+}
+
 function fmtTime(ts) { try { return new Date(ts || now()).toISOString().replace('T', ' ').slice(0, 19) } catch (e) { return String(ts || '') } }
 
 function slugify(s) { const t = String(s == null ? '' : s).trim().toLowerCase().replace(/[^a-z0-9_\-\u4e00-\u9fa5]+/g, '-').replace(/^-+|-+$/g, ''); return t || 'project' }
@@ -3744,12 +4856,37 @@ function safeJson(v, fb) { if (v == null || v === '') return fb; try { return JS
 function stripJsonComments(text) { let out = ''; let inStr = false; let inLine = false; let inBlock = false; let esc = false; for (let i = 0; i < text.length; i++) { const c = text[i]; const n = text[i + 1]; if (inLine) { if (c === '\n') { inLine = false; out += c } continue } if (inBlock) { if (c === '*' && n === '/') { inBlock = false; i++ } continue } if (inStr) { out += c; if (esc) esc = false; else if (c === '\\') esc = true; else if (c === '"') inStr = false; continue } if (c === '"') { inStr = true; out += c; continue } if (c === '/' && n === '/') { inLine = true; i++; continue } if (c === '/' && n === '*') { inBlock = true; i++; continue } out += c } return out }
 
 function splitHeader(text) {
-  const idx = String(text).search(/\n## /)
-  const head = idx === -1 ? String(text) : String(text).slice(0, idx)
-  const body = idx === -1 ? '' : String(text).slice(idx + 1)
+  const heads = findSectionHeads(text)
+  const first = (heads.length > 0 && heads[0].from > 0) ? heads[0].from : -1
+  const head = first === -1 ? String(text) : String(text).slice(0, first - 1)
+  const body = first === -1 ? '' : String(text).slice(first)
   return { head: head, body: body }
 }
 
+/**
+ * 顶层 `## ` 段落边界，**跳过围栏代码块**（审计 L4）。
+ *
+ * 此前 splitHeader / section / parseBodySections 都把正文里**任意** `## ` 行当段落边界。代理把
+ * 引用或代码粘进「陈述」段时，围栏里的 `## ` 行会被当成新段落：那半段代码变成"额外的段"，
+ * 下一次 compose 还会给它补一个 `## ` 标题（正文被改写、代码块被劈开）。围栏内的 `## ` 不是边界。
+ */
+function findSectionHeads(text) {
+  const out = []
+  const src = String(text == null ? '' : text)
+  const lines = src.split('\n')
+  let pos = 0, fence = false
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i]
+    if (/^\s*(```|~~~)/.test(line)) { fence = !fence; pos += line.length + 1; continue }
+    if (!fence) {
+      const m = /^##\s+(.+?)\s*$/.exec(line)
+      if (m) out.push({ name: m[1].trim(), from: pos, len: line.length })
+    }
+    pos += line.length + 1
+  }
+  return out
+}
+
 function parseAnchors(head) {
   const anchors = {}
   const re = /^-\s*([A-Za-z\u4e00-\u9fa5/]+)\s*:\s*(.*)$/gm
@@ -3758,6 +4895,28 @@ function parseAnchors(head) {
   return anchors
 }
 
+/**
+ * md 卡片是**逐行**格式：字段里出现换行会把标题行劈成两行（`parseAnchors` 的 `.*$` 与
+ * `parseEntries` 的逐行扫描都不跨行），出现全角竖线 `｜` 则会让
+ * `### 解法 N｜标题｜概率X｜状态Y` 的惰性匹配在**标题内部**提前切段（审计 L6）。
+ * 约定：compose 侧转义 `\`、`｜` 与换行（`\n`），parse 侧还原 ⇒ 往返无损，且惰性匹配不可能切进字段。
+ */
+function escField(v) { return String(v == null ? '' : v).replace(/\\/g, '\\\\').replace(/｜/g, '\\｜').replace(/\r?\n/g, '\\n') }
+function unescField(v) {
+  const s = String(v == null ? '' : v)
+  if (s.indexOf('\\') === -1) return s
+  return s.replace(/\\(.)/g, function (_m, c) { return c === 'n' ? '\n' : c })
+}
+// 字段体：接受 `\\.` 转义对，但不接受裸 `｜`/裸换行 ⇒ 惰性匹配只在真正的分隔符处停。
+const ENTRY_FIELD = '(?:[^｜\\r\\n\\\\]|\\\\.)*?'
+/**
+ * 条目标题行正则。概率段用 `[-+0-9.eE]+` 而非 `[0-9.]+`（审计 L3）：指数记法（如 `概率5e-7`，
+ * 来自 meta.solution_prob / l.prob 这类 ∈(0,1) 的数值）此前整条匹配失败，条目在重载后被静默丢弃。
+ */
+function entryRe(kind) { return new RegExp('^###\\s*' + kind + '\\s*\\d+｜(' + ENTRY_FIELD + ')｜概率([-+0-9.eE]+)｜状态(' + ENTRY_FIELD + ')$') }
+/** 写出条目标题时的概率文本：非有限值（NaN/Infinity）绝不能写出去，否则那一行永远解析不回来。 */
+function probText(v) { const n = Number(v); return Number.isFinite(n) ? String(n) : '0.5' }
+
 function parseEntries(body, kindRe) {
   const out = []
   const lines = String(body).split('\n')
@@ -3783,23 +4942,24 @@ function parseEntries(body, kindRe) {
 }
 
 function section(body, name) {
-  const re = new RegExp('^##\\s+' + name + '\\s*$', 'm')
-  const m = re.exec(String(body))
-  if (!m) return ''
-  const rest = String(body).slice(m.index + m[0].length)
-  const end = rest.search(/\n##\s/)
-  return (end === -1 ? rest : rest.slice(0, end)).trim()
+  const text = String(body)
+  const heads = findSectionHeads(text)
+  let start = -1, end = -1
+  for (let i = 0; i < heads.length; i++) {
+    if (start === -1) { if (heads[i].name === name) start = heads[i].from + heads[i].len }
+    else { end = heads[i].from; break }
+  }
+  if (start === -1) return ''
+  return (end === -1 ? text.slice(start) : text.slice(start, end)).trim()
 }
 
 function parseBodySections(body) {
   const text = String(body || '')
-  const re = /^##\s+(.+?)\s*$/gm
+  const heads = findSectionHeads(text)
   const found = []
-  let m
-  while ((m = re.exec(text)) !== null) found.push({ name: m[1].trim(), from: m.index, bodyFrom: m.index + m[0].length })
-  for (let i = 0; i < found.length; i++) {
-    const to = i + 1 < found.length ? found[i + 1].from : text.length
-    found[i].text = text.slice(found[i].bodyFrom, to).trim()
+  for (let i = 0; i < heads.length; i++) {
+    const to = i + 1 < heads.length ? heads[i + 1].from : text.length
+    found.push({ name: heads[i].name, from: heads[i].from, bodyFrom: heads[i].from + heads[i].len, text: text.slice(heads[i].from + heads[i].len, to).trim() })
   }
   return found
 }
@@ -3812,8 +4972,12 @@ function extraBodySections(body, managedNames) {
 
 function parseAppTitle(title) {
   const t = String(title || '')
-  const mQ = /问题\s*(\S+)/.exec(t)
-  const mD = /方向\s*(\S+)/.exec(t)
+  // M7：字段名后**必须**有空白才取值为字段，且值里不许含分隔符 `｜`。
+  // 旧写法 `/问题\s*(\S+)/` 在"问题为空、方向非空"时把分隔符也吃进去：
+  // `应用 1｜<时间>｜问题 ｜方向 d1` → 问题='｜方向'（composeMethodMd 恰好会写出这种标题），
+  // 下一次回写就把这个脏值固化进方法卡。
+  const mQ = /(?:^|[\s｜])问题[ \t]+([^｜\s]+)/.exec(t)
+  const mD = /(?:^|[\s｜])方向[ \t]+([^｜\s]+)/.exec(t)
   // `at` = 第一段（时间戳）。取第一个 '｜' 之前的部分。
   const at = t.split('｜')[0].trim()
   return { at: at, 问题: mQ ? mQ[1] : '', 方向: mD ? mD[1] : '' }
@@ -3828,8 +4992,13 @@ function parseMethodMd(id, text) {
   })
   // 改进历史必须真正解析回来：此前硬编码 [] 导致每次 compose 都写成占位符，
   // 于是"下一次用到该方法"就把代理沉淀的改进历史静默销毁（违反「正文只追加，不覆盖」）。
+  //
+  // H3：原因必须从**标题行独立解析**，不能借道 parseEntries 的槽位。约定里 m[1]=标题段、
+  // m[2]=概率段、m[3]=状态段，而改进标题 `### v3（<原因>）` 只有两个捕获组：m[2] 是原因、
+  // m[3] 是 undefined ⇒ `e.status` 恒为 ''，每次回写都写成 `### v1（）`（原因永久丢失）。
   const improvements = parseEntries(body, /^###\s*v(\d+)\s*（(.*?)）\s*$/).map(function (e) {
-    return { v: Number(e.title) || 0, 原因: e.status || '', text: e.text }
+    const m = /^###\s*v(\d+)\s*（(.*?)）\s*$/.exec(e.heading)
+    return { v: m ? Number(m[1]) : 0, 原因: m ? m[2] : '', text: e.text }
   })
   return {
     id: id, 标题: a['标题'] || id, 类型: a['类型'] || '方法', 状态: a['状态'] || '经验',