dsh-vibe-math 2.5.0 → 2.7.0

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

@@ -39,6 +39,22 @@
 //   VibeMath/current.<sessionId>.json = per-session current project.
 export const name = 'vibe-math-v3'
 export const inject = ['subagents', 'agents', 'fs', 'tools', 'commands']
+import { createHash } from 'node:crypto'
+// 数学计算工具（共享模块，四套字节一致；由 integration owner 维护，本文件只做接线）。
+// 模块内部自己 import './math-engines.js'，接线方不直接引用引擎表。
+import {
+  registerMathComputation,
+  MATH_PARAM_NAMES,
+  MATH_PARAM_DEFAULTS,
+  MATH_TOOL_DESCRIPTION,
+  MATH_TOOL_SCHEMA,
+  MATH_ARCHIVE_WORKFLOW_LINE,
+  MATH_PERSONA_TOOL_LINE,
+  MATH_RULE_LINES,
+  normalizeMathParams,
+  mathAvailabilityLine,
+  probeMathEngines,
+} from './math-computation.js'
 
 // Standing mount: DSH mounts each agent preset ONCE per preset and joins every
 // session that names it to that SAME plugin instance (see @deepseek-ai/dsh-agent-presets).
@@ -179,6 +195,24 @@ export function apply(ctx) {
     leanCommand: 'lean',          // 要执行的 Lean 可执行文件（例：'lake'）
     leanArgs: [],                 // 插在文件名之前的附加参数（例：['env','lean'] 配 leanCommand='lake'）
     leanTimeoutMs: 120000,        // 单次 Lean 运行超时上限（毫秒，正整数）
+    leanAsync: true,              // true = Lean 编译走后台队列（入队即返回）| false = 同步 await（旧语义）
+    leanJobsMaxParallel: 1,       // 后台编译并发上限（默认 1 = 串行；可调大以并行编译）
+    leanInitiative: 'normal',     // 日常流程中的形式化主动性：off | normal | eager（与 formalVerify 的"验证要求强度"是两件事）
+    leanSearchPaths: [],          // 额外搜索路径（默认空 = 只用自动注入的 VibeMath 根）；非空时先注入它们、再注入自动根
+    // ---- 最终论文（规格：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）
+    // ---- 数学计算 math_computation（规格：docs/math-computation.md；六参数已冻结，拼写不得改）----
+    // 值取共享模块的 MATH_PARAM_DEFAULTS（四套逐字一致）；数组必须**拷贝**，否则四套会共享同一个默认数组。
+    mathComputation: MATH_PARAM_DEFAULTS.mathComputation,   // off | auto | on（auto = 探测到任一允许引擎才工作）
+    mathMode: MATH_PARAM_DEFAULTS.mathMode,                 // typed | typed+shell（后者才允许提示词里的 shell 兜底段）
+    mathEngines: MATH_PARAM_DEFAULTS.mathEngines.slice(),   // 允许的引擎（含 cli；cli 默认开启，受 mathMode/mathEngines 双闸）
+    mathTimeoutMs: MATH_PARAM_DEFAULTS.mathTimeoutMs,       // 单次计算超时上限（毫秒，下界 1000）
+    mathPackages: MATH_PARAM_DEFAULTS.mathPackages.slice(), // 需要预检的包（缺包只报告 + 给安装计划）
+    mathInstallScope: MATH_PARAM_DEFAULTS.mathInstallScope, // user | system（system 只对当次显式调用生效，永不记忆）
   }
   let params = Object.assign({}, DEFAULT_PARAMS)
   let scheduler = { running: false, startedAt: 0, lastCheckpoint: 0, gate: null } // activeCount 由 activeCount() 从 agentRegistry 推导（防漂移，同 v2）
@@ -298,7 +332,23 @@ export function apply(ctx) {
     { name: 'formalVerify', type: 'enum', options: ['off', 'encourage', 'require'], description: 'Lean 形式化验证：off = 不额外要求（默认，提示词里不出现任何 Lean 内容）；encourage = 鼓励按实现难度形式化，Lean 通过后验证转为忠实性审查；require = 同上并加门禁：真/假定论必须先达到 Lean 已通过 或 已记录显式阻塞原因，否则记为未定论（formal-required）并进「形式化待办」', suggestion: 'off' },
     { 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: 'leanTimeoutMs', type: 'integer', description: '单次 Lean 运行的超时上限（毫秒，非正数回退默认）；异步档下它同时是**每个后台作业**的预算（到时主动 terminate，作业记 timeout，对象留在 attempted）', suggestion: 120000 },
+    { name: 'leanAsync', type: 'boolean', description: 'Lean 编译模式：true（默认）= 后台队列，vibe_math_lean_run / vibe_math_lean_archive{run:true} 立即返回 async.jobId 入队，成员不阻塞，结果由下一轮提示的【形式化结果】行与 vibe_math_lean_job 公告（**只有作业落地为 ok 才会置 passed 并写归档证明**）；false = 完全同步 await（与旧行为逐字一致）', suggestion: true },
+    { name: 'leanJobsMaxParallel', type: 'integer', description: '后台 Lean 编译的并发上限（默认 1 = 串行，保持可预测的资源占用；调大可并行编译多个作业）', suggestion: 1 },
+    { name: 'leanInitiative', type: 'enum', options: ['off', 'normal', 'eager'], description: '日常流程中的形式化主动性：off（不主动，只在验证提示词按 formalVerify 的要求做）| normal（默认：顺手把有价值且可能复用的东西形式化）| eager（更主动：日常就主动把有价值的小引理/命题/定义形式化）。注意它与 formalVerify（验证时的要求强度：off|encourage|require）是**两件事**', suggestion: 'normal' },
+    { name: 'leanSearchPaths', type: 'string[]', description: '额外 Lean 搜索路径（默认空数组 = 只用框架自动注入的 VibeMath 根）。非空时按顺序先注入这里给的路径、再注入自动根（去重）；若 leanArgs 里已显式给了 --search-path/-R/--root，则完全尊重用户配置、不注入任何东西', suggestion: [] },
+    { 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: '' },
+    // ---- 数学计算 math_computation（六参数冻结；描述与 prompts.md §1/§6 口径一致）----
+    { name: 'mathComputation', type: 'enum', options: ['off', 'auto', 'on'], description: '数学计算总开关：off = 真无操作（提示词零提及）；auto = 探测到 mathEngines 里任一允许引擎才工作；on = 同上（探测失败时工具仍返回可执行的安装指引，而不是假装可用）', suggestion: 'auto' },
+    { name: 'mathMode', type: 'enum', options: ['typed', 'typed+shell'], description: '计算策略：typed+shell（默认）= 工具不可用时允许宿主 shell 兜底，但结论必须标注"未经工具归档（shell 路径）"；typed = 只用工具路径（提示词里不出现 shell 兜底段，engine:"cli" 返回 REFUSED{reason:policy}）', suggestion: 'typed+shell' },
+    { name: 'mathEngines', type: 'string[]', description: '允许的引擎列表（默认 python|r|octave|julia|matlab|maple|wolfram|cli）。cli 默认开启且走同一套超时/输出上限/回执；从列表里移除某引擎即禁用（商业引擎只探测+许可，永不安装）', suggestion: MATH_PARAM_DEFAULTS.mathEngines.slice() },
+    { name: 'mathTimeoutMs', type: 'integer', description: '单次数学计算的超时上限（毫秒，默认 60000，最小 1000）；到时主动 terminate 并把回执标为 MATH_TIMEOUT', suggestion: 60000 },
+    { name: 'mathPackages', type: 'string[]', description: '需要预检的包（默认空）。缺包只报告 + 给"用户自装指引"或"代理代装计划"，不会执行脚本，也永不自动安装', suggestion: [] },
+    { name: 'mathInstallScope', type: 'enum', options: ['user', 'system'], description: '安装作用域：user（默认，用户级目录）；system 只对当次显式调用生效、永不记忆（不会写进状态文件）', suggestion: 'user' },
   ]
 
   // ================= fs (adapted to DSH 0.1.1: resolve returns {targetKey, displayPath}) =================
@@ -360,6 +410,18 @@ export function apply(ctx) {
     if (isWindows()) return 'Remove-Item -Force -LiteralPath ' + psQuote(path) + ' -ErrorAction SilentlyContinue'
     return 'rm -f ' + shQuote(path)
   }
+  /**
+   * `subprocess.spawn` 的契约返回**句柄**（带 `done`），但桩宿主/测试替身常常写成 `async spawn(...)`
+   * ——返回的是 Promise，`handle.done` 是 undefined，`await handle.done` 得到 undefined，随后
+   * `outcome.exitCode` 抛 "Cannot read properties of undefined (reading 'exitCode')"，被 catch 成一条
+   * 误导性的目录创建失败。这里统一兼容一次：Promise 就先 await，句柄缺 `done` 才如实报错。
+   */
+  async function spawnHandle(subprocess, spec) {
+    const raw = subprocess.spawn(spec)
+    const handle = (raw && typeof raw.then === 'function') ? await raw : raw
+    if (!handle || handle.done === undefined) throw new Error('subprocess.spawn returned no handle.done')
+    return handle
+  }
   async function runShell(script, cwd) {
     const subprocess = subprocessOf()
     if (subprocess === undefined) return { ok: false, error: 'no-subprocess' }
@@ -367,9 +429,9 @@ export function apply(ctx) {
       const argv = isWindows()
         ? ['powershell', '-NoProfile', '-NonInteractive', '-Command', script]
         : ['/bin/sh', '-c', script]
-      const handle = subprocess.spawn({ argv: argv, cwd: cwd || workspaceRoot(), stdio: { stdin: 'ignore', stdout: 'inherit', stderr: 'inherit' }, graceMs: 20000 })
+      const handle = await spawnHandle(subprocess, { argv: argv, cwd: cwd || workspaceRoot(), stdio: { stdin: 'ignore', stdout: 'inherit', stderr: 'inherit' }, graceMs: 20000 })
       const outcome = await handle.done
-      return { ok: outcome.exitCode === 0, exitCode: outcome.exitCode }
+      return { ok: !!outcome && outcome.exitCode === 0, exitCode: (outcome && outcome.exitCode !== undefined) ? outcome.exitCode : null }
     } catch (e) { return { ok: false, error: String((e && e.message) || e) } }
   }
   /**
@@ -380,19 +442,139 @@ export function apply(ctx) {
   // 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 ensureDirs() { const base = frameworkRoot(); const dirs = ['Problems', 'Progress', 'Progress_Logs', 'Propos', 'Methods', 'Verified/命题', 'Verified/问题', 'Verified/Lean', 'Formal', 'Formal/Jobs', 'Reliable', 'Notes', 'Logs/Verification', 'Logs/Plans', 'State', 'Computation']; 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)) }
 
+  // ================= 数学计算 math_computation：会话侧接线（共享模块，FREEZE §4/§5） =================
+  // 探测量（是否装了 python/r/…）是异步的，而提示词是同步构造的 ⇒ 会话级缓存 + TTL 刷新，
+  // 提示词侧只读缓存现算（与 formalVerify / Lean 的动态纪律一致）。
+  const MATH_PROBE_TTL_MS = 15 * 60 * 1000
+  let mathProbe = null
+  let mathProbeAt = 0
+  /**
+   * `host.spawn` 适配：模块只给 `{argv, cwd, timeoutMs, stdoutCap, stderrCap}`，超时/终止由**接线方**负责
+   * （契约：超时必须 handle.terminate()）。返回**完整** stdout/stderr——模块自己落盘完整版、只在返回体裁 64KB，
+   * 所以 stdio 上限要宽（默认 4MB），否则"超大输出"永远测不出完整落盘。
+   */
+  async function mathSpawn(spec) {
+    const sub = subprocessOf()
+    if (sub === undefined || typeof sub.spawn !== 'function') return null // 模块映射为 MATH_NO_SUBPROCESS
+    const s = spec || {}
+    const cap = Math.max(1000, Number(s.timeoutMs) || Number(params.mathTimeoutMs) || 60000)
+    const outCap = Math.max(4096, Number(s.stdoutCap) || 4 * 1024 * 1024)
+    const errCap = Math.max(4096, Number(s.stderrCap) || 4 * 1024 * 1024)
+    const started = now()
+    let handle
+    try {
+      handle = await spawnHandle(sub, {
+        argv: s.argv,
+        cwd: s.cwd || frameworkRoot(),
+        stdio: { stdin: 'ignore', stdout: { maxBytes: outCap }, stderr: { maxBytes: errCap } },
+        graceMs: cap,
+      })
+    } catch (e) { return null }
+    let timedOut = false, killed = false, timer = null, outcome
+    try {
+      outcome = await Promise.race([
+        handle.done,
+        new Promise(function (resolve) {
+          timer = setTimeout(function () {
+            timedOut = true
+            killed = true
+            try { if (handle && typeof handle.terminate === 'function') handle.terminate() } catch (e) { /* best effort */ }
+            resolve({ exitCode: null })
+          }, cap)
+        }),
+      ])
+    } catch (e) { if (timer !== null) clearTimeout(timer); return null }
+    if (timer !== null) clearTimeout(timer)
+    let out = '', err = ''
+    try { if (handle.collected && handle.collected.stdout) out = handle.collected.stdout.readFrom(0).text } catch (e) { /* best effort */ }
+    try { if (handle.collected && handle.collected.stderr) err = handle.collected.stderr.readFrom(0).text } catch (e) { /* best effort */ }
+    return {
+      exit: (outcome && outcome.exitCode !== undefined) ? outcome.exitCode : null,
+      timedOut: timedOut, killed: killed, ms: now() - started,
+      stdout: String(out == null ? '' : out), stderr: String(err == null ? '' : err),
+    }
+  }
+  /** host.exists：项目根相对路径是否存在。 */
+  async function mathExists(rel) {
+    try { const t = await fsTarget(rel); const s = await fs.stat(t); return s !== undefined } catch (e) { return false }
+  }
+  /**
+   * host.listDir（**可选**，FREEZE §4）：模块用它数 `Computation/` 下的 run 目录数（>200 只告警、永不删除）。
+   * 必须原样返回 DSH `fs.listDir` 的条目（{name,type}）——模块按 `type === 'directory'` 计数。
+   * 宿主 fs 没有该能力时整个回调都不声明（见 mathHost 的条件字段）。
+   */
+  async function mathListDir(rel) {
+    try { const t = await fsTarget(rel); const ents = await fs.listDir(t); return Array.isArray(ents) ? ents : [] } catch (e) { return [] }
+  }
+  /** 会话级 host：参数是**活引用**（函数），回执里写 designator='vibe-math-v3'。 */
+  const mathHost = {
+    // 模块注册时只**交回** handler/description/parameters；真正的挂载是下面两条**字面量** registerTool
+    // 调用（会话层 + apply 层）。原因：tests/audit-v3-registration-parity.mjs 的静态扫描器按
+    // `registerTool('<名字字面量>', TOOL_DESC.<同名>, …)` 收集两条路径，动态回调形态它看不见，
+    // 会让 `tableKeys.size === byName.size` 不成立。回调保持为空以实现"只注册一次"的显式化。
+    register: function (name, description, parameters, handler) { /* 挂载见 mathTool 之后的字面量两行 */ },
+    params: function () { return params },
+    projectRoot: function () { return frameworkRoot() },
+    designator: 'vibe-math-v3',
+    // 宿主明知没有 subprocess 服务时可以直接说 false ⇒ 模块立即返回 MATH_NO_SUBPROCESS（不再逐个探引擎）。
+    hasSubprocess: function () { const sub = subprocessOf(); return !!(sub && typeof sub.spawn === 'function') },
+    // **可选能力，按宿主实际情况声明**：宿主 fs 没有 listDir 就不给这个回调（模块据此跳过
+    // "每项目 run 目录数 >200" 的保留检查，而不是每次运行都白问一次）。
+    listDir: (typeof fs.listDir === 'function') ? mathListDir : undefined,
+    writeText: async function (rel, text) { return await writeText(rel, text) },
+    readText: async function (rel) { return await readText(rel) },
+    exists: mathExists,
+    resolveExecutable: async function (cmd) {
+      const sub = subprocessOf()
+      if (sub === undefined || typeof sub.resolveExecutable !== 'function') throw new Error('no subprocess service')
+      const p = await sub.resolveExecutable(String(cmd))
+      if (typeof p !== 'string' || !p) throw new Error('not found: ' + String(cmd))
+      return p
+    },
+    spawn: mathSpawn,
+    log: function (kind, msg) { logActivity('math', String(kind) + ': ' + String(msg)) },
+  }
+  // 真实注册必须等到 `const handlers = {}` 与 `function registerTool(...)` 就绪（handlers 是 const，
+  // 提前调用会撞 TDZ）⇒ 这里只留槽位，注册放在会话工具表旁。
+  let mathTool = null
+  /** 刷新探测缓存。`mathComputation:'off'` ⇒ 不探测、不缓存、不注入（真 no-op）。 */
+  async function refreshMathProbe(force) {
+    if (params.mathComputation === 'off') { mathProbe = null; mathProbeAt = 0; return null }
+    if (!mathTool) return null
+    try { mathProbe = await mathTool.probe(force ? { refresh: true } : undefined); mathProbeAt = now() } catch (e) { mathProbe = null }
+    return mathProbe
+  }
+  /** 心跳里的 TTL 刷新（每拍一次布尔判断）。 */
+  function mathProbeDue() { return params.mathComputation !== 'off' && (!mathProbe || (now() - mathProbeAt) >= MATH_PROBE_TTL_MS) }
+  /**
+   * 每轮可用性行（中文）。由模块的 `mathAvailabilityLine(probe,'zh',mathMode)` 按档位拼装：
+   * 只有 `typed+shell` 才含 shell 兜底句（`mathMode:'typed'` 天然不含，守卫据此断言）。
+   * `off` 档返回空串——提示词零提及（对齐 formalVerify:'off' 的真 no-op 纪律）。
+   */
+  function mathWorkLine() {
+    if (params.mathComputation === 'off') return ''
+    if (!mathProbe) return '' // 还没探测过 ⇒ 不注入（不撒谎；init 会先探一次）
+    return '\n' + mathAvailabilityLine(mathProbe, 'zh', params.mathMode) + '\n'
+  }
+
   // ================= settings =================
   function sanitizeParams(obj) {
     const out = {}
     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', 'leanAsync']
+    // 数学计算六参数的显式强制（FREEZE §5.3）：交给共享模块的 normalizeMathParams 逐键判型
+    // （enum/array/integer）——`'false'`/错类型/错枚举一律回退默认，**绝不**落到末尾的
+    // `else { out[k] = v }`（那条尾巴会把任意字符串当合法值放行）。
+    const mathNorm = normalizeMathParams(obj)
     for (const k of Object.keys(DEFAULT_PARAMS)) {
       if (!(k in obj)) continue
       const v = obj[k]
+      if (MATH_PARAM_NAMES.indexOf(k) !== -1) { out[k] = Object.prototype.hasOwnProperty.call(mathNorm, k) ? mathNorm[k] : DEFAULT_PARAMS[k]; continue }
       if (intFields.indexOf(k) !== -1) { const n = Number(v); out[k] = Number.isFinite(n) ? Math.floor(n) : DEFAULT_PARAMS[k] }
       else if (numFields.indexOf(k) !== -1) { const n = Number(v); out[k] = Number.isFinite(n) ? Math.max(0, Math.min(1, n)) : DEFAULT_PARAMS[k] }
       else if (arrayFields.indexOf(k) !== -1) { out[k] = Array.isArray(v) ? v.filter(function (x) { return typeof x === 'string' }) : DEFAULT_PARAMS[k] }
@@ -407,7 +589,20 @@ export function apply(ctx) {
       else if (k === 'formalVerify') { out[k] = (v === 'off' || v === 'encourage' || v === 'require') ? v : 'off' }
       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] }
+      // Lean 增量/异步（spec §1.1 + 修订 §5）：并行度必须有下界（0 会让队列永不推进，静默失效）。
+      else if (k === 'leanJobsMaxParallel') { const n = Number(v); out[k] = Number.isFinite(n) ? Math.max(1, Math.min(8, Math.floor(n))) : DEFAULT_PARAMS[k] }
+      else if (k === 'leanInitiative') { out[k] = (v === 'off' || v === 'normal' || v === 'eager') ? v : DEFAULT_PARAMS[k] }
+      else if (k === 'leanSearchPaths') {
+        if (!Array.isArray(v)) { out[k] = DEFAULT_PARAMS[k] } else {
+          const seen = {}
+          out[k] = v.map(function (x) { return String(x == null ? '' : x).trim() }).filter(function (x) { if (!x || seen[x]) return false; seen[x] = true; return true })
+        }
+      }
       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
@@ -1212,7 +1407,7 @@ export function apply(ctx) {
       'feasibility ∈ [0,1] = your estimate of the probability this direction leads to a full solution. Respond with ONLY a single JSON object in a ```json code fence (no prose outside it). Register the directions as metadata; the scheduler writes them into the research log:\n' +
       '{"meta":{"kind":"directions","qid":"<qid>","directions":[{"id":"d1","title":"...","method":"...","core_assumption":"...","feasibility":0.5}],"methods_used":[{"id":"m-...","效果":"<为何该方向借鉴它>","建议":"..."}],"new_inventions":[{"类型":"方法|工具|...","标题":"...","内容描述":"...","是否已入库":false}]}}' +
       // 顺手形式化（契约 §6.2）+ 回执字段（契约 §6.3）
-      (formalOn() ? '\n' + formalWorkLine() + formalReplyNote() : '')
+      mathWorkLine() + formalDailySection()
   }
   function rederivePrompt(q, prog) {
     const prior = prog.map(function (d) {
@@ -1227,7 +1422,7 @@ export function apply(ctx) {
       'Then deeply DERIVE 1-3 BRAND-NEW directions never tried before, each with a one-line motivation. Return the UNION of high-potential leftover directions and the brand-new directions (drop dead ends).\n\n' +
       'feasibility ∈ [0,1]. Respond with ONLY a single JSON object in a ```json code fence (no prose outside it). Register the directions as metadata; the scheduler writes them into the research log:\n' +
       '{"meta":{"kind":"directions","qid":"<qid>","directions":[{"id":"d1","title":"...","method":"...","core_assumption":"...","feasibility":0.5}],"methods_used":[{"id":"m-...","效果":"...","建议":"..."}],"new_inventions":[{"类型":"方法|工具|...","标题":"...","内容描述":"...","是否已入库":false}]}}' +
-      (formalOn() ? '\n' + formalWorkLine() + formalReplyNote() : '')
+      mathWorkLine() + formalDailySection()
   }
   function directionSummary(d) {
     return 'id ' + d.id + '「' + d.title + '」method=' + d.method + ' | round=' + d.round + ' status=' + d.status +
@@ -1275,7 +1470,7 @@ export function apply(ctx) {
       '区分规则：methods_used 只能填**已存在的方法卡 ID**（m-…，来自 AVAILABLE METHODS 列表）——引用你自己刚想出的新方法/新技巧不属于 methods_used，请如实填入 new_inventions（它会由 Method Keeper 蒸馏建卡）；不要把方法名/标题当 id 填进 methods_used。'
     // 顺手形式化（契约 §6.2）：把常用/可复用的对象、假设、新定义沉淀到全局 Lean 库；
     // 回执里同样要带上 formal 难度判断字段（契约 §6.3）。
-    if (formalOn()) head += '\n' + formalWorkLine() + formalReplyNote()
+    head += mathWorkLine() + formalDailySection()
     return head
   }
   function verifierTargetText(r) {
@@ -1334,7 +1529,8 @@ export function apply(ctx) {
       'For each pending invention decide: create a NEW method card, or fold it into an EXISTING method (as an improvement). Only list 可信断言 for claims already verified (ids from Verified/) — everything else stays 经验 (experiential). You may propose 上级体系/子方法 links to organize methods into systems.\n' +
       // Method Keeper 的职责正是「沉淀可复用方法」，所以形式化的沉淀也归它：可复用的定义/假设
       // 进全局 Lib/，已成立的引理进 Proved/，让后续项目的证明直接 import 复用（契约 §6.2）。
-      (formalOn() ? formalWorkLine() + '\n【方法沉淀 × Lean 形式化】除了方法卡，你沉淀的每个可复用对象 / 定义 / 假设都应当归档到全局 Lean 库（vibe_math_lean_archive kind=\'def\'），已成立的引理归档到 Proved/（kind=\'lemma\'）；归档时**连同定义与陈述一起写清**，方便后续直接 import。\n' : '') +
+      mathWorkLine() +
+      (formalWorkLine() + (formalOn() ? '\n【方法沉淀 × Lean 形式化】除了方法卡，你沉淀的每个可复用对象 / 定义 / 假设都应当归档到全局 Lean 库（vibe_math_lean_archive kind=\'def\'），已成立的引理归档到 Proved/（kind=\'lemma\'）；归档时**连同定义与陈述一起写清**，方便后续直接 import。\n' : '')) +
       'OUTPUT CONTRACT — pick ONE channel. Write method cards into Markdown; only the created IDs, which cards were used, and improvements cross the machine reply.\n' +
       'CHANNEL A (recommended, you can write files): write each method card into `Methods/<m-id>.md` (`# 方法｜标题` + `- 标题/ID/类型/状态/可信断言/适用场景` + `## 核心内容`/`## 应用记录`/`## 改进历史`), then reply ONLY this metadata:\n' +
       '{"meta":{"kind":"methods","used":[{"id":"m-...","效果":"...","建议":"..."}],"created":["m-xxx"],"improvements":[{"id":"m-...","改进内容":"...","原因":"..."}]}}\n' +
@@ -2472,21 +2668,30 @@ export function apply(ctx) {
    * 在一个 .lean 文件上跑工具链。**任何**失败模式（无 subprocess 服务、工具链不存在、
    * spawn 失败、超时、非零退出）都变成可读结果：调度循环永远不会因为 Lean 而崩。
    */
+  /**
+   * 路径/存在性守卫（同步档与异步档共用同一套错误码）。
+   */
   async function leanRunFile(relPath, timeoutMs) {
-    const started = now()
     const rel = String(relPath == null ? '' : relPath).trim()
     if (!rel) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'file is required' }
     const abs = await leanResolveRun(rel)
-    if (abs === null) {
-      return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'Lean 文件必须位于 ' + vibeRoot().replace(/\\/g, '/') + '/ 之内（收到 ' + rel + '）' }
-    }
+    if (abs === null) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'Lean 文件必须位于 ' + vibeRoot().replace(/\\/g, '/') + '/ 之内（收到 ' + rel + '）' }
     if (!/\.lean$/i.test(abs)) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'only .lean files can be executed' }
     if (await readTextAbs(abs) === undefined) return { ok: false, code: 'V3_NOT_FOUND', message: 'no such file: ' + rel }
+    return await leanExecFile(rel, abs, timeoutMs)
+  }
+  /**
+   * 已解析路径的**实际执行**（同步档与后台作业共用）：搜索路径注入（spec §3 + 修订 §2）
+   * 在**用户 leanArgs 之后、文件名之前**；作业用入队时冻结的 plan（修订 §4）。
+   */
+  async function leanExecFile(rel, abs, timeoutMs, plan, onHandle) {
+    const started = now()
     const sub = subprocessOf()
     if (sub === undefined || typeof sub.spawn !== 'function') {
       return { ok: false, code: 'NO_SUBPROCESS', message: 'the host exposes no subprocess service; Lean cannot be executed here', file: rel, ms: 0 }
     }
-    const cmd = String(params.leanCommand || 'lean')
+    const p = plan || leanBuildPlan()
+    const cmd = String(p.engine || 'lean')
     const cap = Math.max(1000, Number(timeoutMs) || Number(params.leanTimeoutMs) || 120000)
     if (typeof sub.resolveExecutable !== 'function') {
       return { ok: false, code: 'LEAN_NOT_FOUND', message: 'the host subprocess service exposes no resolveExecutable(); cannot resolve "' + cmd + '" —— 仍可把形式化代码写下来归档，但无法在此宿主上执行', file: rel, ms: now() - started }
@@ -2495,10 +2700,13 @@ export function apply(ctx) {
     try { exe = await sub.resolveExecutable(cmd) } catch (e) {
       return { ok: false, code: 'LEAN_NOT_FOUND', message: 'cannot resolve "' + cmd + '": ' + String((e && e.message) || e) + ' —— 仍可把形式化代码写下来归档，但无法在此宿主上执行', file: rel, ms: now() - started }
     }
-    const argv = [exe].concat((Array.isArray(params.leanArgs) ? params.leanArgs : []).map(String)).concat([abs])
+    const inject = Array.isArray(p.inject) ? p.inject : leanSearchPathPlan(p.args, p.searchPaths, vibeRoot()).inject
+    const argv = [exe].concat((Array.isArray(p.args) ? p.args : []).map(String)).concat(inject).concat([abs])
+    const searchPath = (Array.isArray(p.searchPaths) && p.searchPaths.length) ? p.searchPaths.join(',') : vibeRoot()
+    logActivity('formal', 'Lean 运行 ' + rel + '（search-path=' + searchPath + '）')
     let handle
     try {
-      handle = sub.spawn({
+      handle = await spawnHandle(sub, {
         argv: argv,
         cwd: frameworkRoot(),
         stdio: { stdin: 'ignore', stdout: { maxBytes: 64 * 1024 }, stderr: { maxBytes: 64 * 1024 } },
@@ -2507,7 +2715,8 @@ export function apply(ctx) {
     } catch (e) {
       return { ok: false, code: 'LEAN_SPAWN_FAILED', message: String((e && e.message) || e), file: rel, ms: now() - started }
     }
-    // 超时必须有**主动**兜底：graceMs 只是宿主侧的宽限，契约 §7 要求超时后调用 handle.terminate()。
+    leanSyncHandle = handle
+    if (typeof onHandle === 'function') { try { onHandle(handle) } catch (e) { /* best effort */ } }
     let timedOut = false
     let timer = null
     let outcome
@@ -2527,26 +2736,24 @@ export function apply(ctx) {
       return { ok: false, code: 'LEAN_RUN_FAILED', message: String((e && e.message) || e), file: rel, ms: now() - started }
     }
     if (timer) clearTimeout(timer)
+    leanSyncHandle = null
+    if (typeof onHandle === 'function') { try { onHandle(null) } catch (e) { /* best effort */ } }
     let out = '', err = ''
     try { if (handle.collected && handle.collected.stdout) out = handle.collected.stdout.readFrom(0).text } catch (e) { /* best effort */ }
     try { if (handle.collected && handle.collected.stderr) err = handle.collected.stderr.readFrom(0).text } catch (e) { /* best effort */ }
     const exitCode = outcome ? outcome.exitCode : null
     const ms = now() - started
     const ok = exitCode === 0
+    const isTimeout = timedOut || ms >= cap
     return {
       ok: ok, exitCode: exitCode, signal: (outcome && outcome.signal) || null, ms: ms,
-      command: argv.join(' '), file: rel,
+      command: argv.join(' '), file: rel, searchPath: searchPath,
       stdout: formalTail(out, 4000), stderr: formalTail(err, 4000),
-      timedOut: timedOut,
-      code: ok ? undefined : (timedOut ? 'LEAN_TIMEOUT' : 'LEAN_FAILED'),
+      timedOut: isTimeout,
+      code: ok ? undefined : (isTimeout ? 'LEAN_TIMEOUT' : 'LEAN_FAILED'),
     }
   }
-  /**
-   * 把一次运行记到对象上（契约 §4 状态迁移）。普通运行最多把对象推进到 `attempted`；
-   * `passed` 只能由 vibe_math_lean_archive{kind:'proof'} 且该文件最近一次运行 ok 产生——否则一次
-   * 顺手跑个无关文件就能把对象"洗白"成已形式化。passed/blocked 不会被普通运行降级。
-   */
-  async function formalSetRun(target, run) {
+  async function formalSetRun(target, run, asyncInfo) {
     const t = formalId(target)
     if (!t) return
     const prev = formalOf(t)
@@ -2555,10 +2762,10 @@ export function apply(ctx) {
       status: status,
       file: (run && run.file) || prev.file || '',
       run: { at: now(), ok: !!(run && run.ok), exitCode: (run && run.exitCode !== undefined) ? run.exitCode : null, ms: (run && run.ms) || 0, stdoutTail: formalTail(run && run.stdout, 800), stderrTail: formalTail(run && run.stderr, 800) },
+      async: asyncInfo || prev.async || null,
       updatedAt: now(),
     }))
   }
-
   // ---- 提示词注入（都在**构造提示词的那一刻**现算，故运行中切模式立刻生效）--------
   function formalPromptBlock(target) {
     if (!formalOn()) return ''
@@ -2589,7 +2796,7 @@ export function apply(ctx) {
       L.push('    请复核这个判断是否成立；若你认为其实可以形式化，请指出来并动手做。')
     } else {
       L.push('  · 请先判断该对象的**实现难度**：若能在可接受的工作量内形式化，优先写 Lean 代码并执行。')
-      L.push('  · 工具：vibe_math_lean_run（执行）· vibe_math_lean_archive（归档）· vibe_math_lean_lib（查已有可复用库）')
+      L.push('  · 工具：vibe_math_lean_run（执行）· vibe_math_lean_archive（归档）· vibe_math_lean_lib（查已有可复用库/jobs）· vibe_math_lean_read（取回归档原文）')
       L.push('  · 工作目录：Formal/（相对项目根）；可复用定义放 ' + (vibeRoot() + '/Formal/Lib/').replace(/\\/g, '/')
         + '，已证引理放 ' + (vibeRoot() + '/Formal/Proved/').replace(/\\/g, '/') + '；写之前先 vibe_math_lean_lib 查重。')
       L.push('  · **一旦 Lean 通过，你唯一需要确认的就是忠实性**：定义/对象/条件/假设/结论是否与命题原文逐条一致。请把注意力放在这种核对上，而不是重新做一遍推导。')
@@ -2601,14 +2808,27 @@ export function apply(ctx) {
         L.push('  · 若你判断不值得或无法形式化，可以不做，但请在回执的 formal 字段写明难度判断（decision=\'blocked\' 时必须写明 note）。')
       }
       L.push('  · 归档可复用定义/引理前先跑通（vibe_math_lean_archive run=true 或先 vibe_math_lean_run）；跑不通不要入库。')
+      // —— §5 B（逐字）：三条筛选判据 + 先查再写 + 异步"落地前不得当成已通过" ——
+      L.push('  · 三条筛选判据：① 有价值或可能复用；② 较为关键或必要；③ 你对该陈述有把握（置信度高）。')
+      L.push('  · 写新定义/证明前**先 vibe_math_lean_lib 查已有库**（vibe_math_lean_read 可取回归档原文逐字复用），查不到再写；复用已归档内容用 `import Formal.Lib.<name>` / `import Formal.Proved.<name>`。')
+      L.push('  · **没把握就记 blocked** 并写清难点，别用形式化掩盖不确定。')
+      L.push('  · 该对象若已有后台编译在队列中（leanAsync 默认开启），**不得**在作业落地为通过之前声称已通过或转忠实性审查；等 vibe_math_lean_lib 的 jobs 显示 settled 再审。')
       L.push('  · 宿主没有 Lean 工具链（LEAN_NOT_FOUND）或宿主不提供 subprocess 服务（NO_SUBPROCESS）时：把代码写下来归档，并在回执的 note 里写明"宿主无 Lean 工具链"——这算显式阻塞原因，定论门禁可以据此放行。')
     }
-    return L.join('\n')
+    // 数学计算可用性行（prompts.md §2）：验证轮同样告知"先 probe 再 run / 回执即引用"。
+    return L.join('\n') + leanNoticeSection() + mathWorkLine()
   }
   /** 日常提示词里的"顺手形式化"一行（off 模式返回空串 = 一个字都不多）。 */
   function formalWorkLine() {
-    if (!formalOn()) return ''
-    return '【顺手形式化（' + (formalMode() === 'require' ? '强制' : '鼓励') + '）】把你工作中常用或可能复用的对象、假设、'
+    // v5 统一口径：**日常主动性（leanInitiative）与验证要求强度（formalVerify）是两根独立的轴**。
+    // 不能用 `!formalOn()` 一票否决——那会让 `leanInitiative:'eager'` 在 `formalVerify:'off'` 下静默
+    // 失效。`formalVerify:'off'` 只关掉**验证阶段**的 Lean 文本（formalPromptBlock 仍 `!formalOn() ⇒ ''`）；
+    // `leanInitiative:'off'` 连日线都不注入（真无操作）。
+    const initiative = LEAN_INITIATIVE_MODES.indexOf(params.leanInitiative) !== -1 ? params.leanInitiative : 'normal'
+    // 后台作业的一次性公告（spec §2.4）：注入到本轮提示里，取走即清空。
+    const notice = leanNoticeSection()
+    if (initiative === 'off' || !(formalOn() || initiative === 'eager')) return ''
+    return '【顺手形式化（' + (formalOn() ? (formalMode() === 'require' ? '强制' : '鼓励') : '仅主动性') + '）】把你工作中常用或可能复用的对象、假设、'
       + '新定义用 Lean 形式化定义并归档到全局可复用库（vibe_math_lean_archive kind=\'def\'），已成立的引理归到 '
       + (vibeRoot() + '/Formal/Proved/').replace(/\\/g, '/') + '（kind=\'lemma\'）；写之前先 vibe_math_lean_lib 查重，避免重复定义。'
       + (formalMode() === 'require'
@@ -2616,6 +2836,29 @@ export function apply(ctx) {
         : '这会让后续的验证与证明省掉大量重复工作。')
       // 硬要求 3（契约 §6 顶部）：可复用库只收**跑通过**的代码，否则它会被不编译的定义污染。
       + '归档前先跑通（vibe_math_lean_run 或 run=true）；跑不通的定义不要进可复用库。'
+      + (initiative === 'eager'
+        ? '\n  · **主动档（leanInitiative=eager）**：日常就主动把有价值的小引理/命题/定义形式化——每轮工作结束时审视一次"这轮有什么值得进库"，值得就顺手归档。'
+        : '\n  · 主动性 normal：顺手把明显有价值且可能复用的东西形式化；不必刻意扩大范围。')
+      // —— §5 A（逐字）：三条筛选判据 + 先查再写 + 「没把握就记 blocked」 + 异步"落地前不得当成已通过" ——
+      + '\n  · 三条筛选判据：① 有价值或可能复用；② 较为关键或必要；③ 你对该陈述有把握（置信度高）。'
+      + '\n  · **先 vibe_math_lean_lib 查再决定是否重写**：vibe_math_lean_lib 列出现成定义/引理，vibe_math_lean_read 可取回归档原文逐字复用；'
+      + '复用已归档内容用 `import Formal.Lib.<name>` / `import Formal.Proved.<name>`（模块根 = ' + vibeRoot().replace(/\\/g, '/') + '，框架已把它加进编译搜索路径）。'
+      + '\n  · **没把握就记 blocked**（vibe_math_lean_archive kind=\'blocked\' note=…，或回执 formal 的 blocked）：把难点写清楚，别用形式化掩盖不确定。'
+      + '\n  · 编译默认走后台队列（leanAsync=true）：入队后你可以继续工作；用 vibe_math_lean_job（可 waitMs 等结果）或下一轮提示里的'
+      + '【形式化结果】行看结果。**在作业落地为通过之前，不得把该对象当成已通过。**'
+      + notice
+  }
+  /**
+   * 平时工作提示词里的「顺手形式化」日线段 + 回执 note。**两根轴独立**（v5 统一口径）：
+   * 日线由 `leanInitiative` 决定（`eager` 在 `formalVerify:'off'` 下也要注入），
+   * `formalReplyNote()` 只属于**验证阶段**（`formalOn()` 门控）。
+   * 用一个 `formalOn()` 把两者一起关掉，正是 audit-B #2 的成因。
+   */
+  function formalDailySection() {
+    const line = formalWorkLine()
+    const note = formalOn() ? formalReplyNote() : ''
+    if (!line && !note) return ''
+    return (line ? '\n' + line : '') + note
   }
   /** 回执契约里的 formal 字段（契约 §6.3）：非 off 模式必须出现在回执契约里，否则这条通道不可发现。 */
   function formalJsonField(target) {
@@ -2710,6 +2953,304 @@ export function apply(ctx) {
       note: formalOn() ? '' : '未启用（formalVerify = off；可用 vibe_math_set_params 切到 encourage / require）',
     }
   }
+  // ================= Lean 增量 + 异步：作业队列（spec §2） =================
+  // 并发上限 = `leanJobsMaxParallel`（默认 1 = 串行）。队列是**内存**态，作业记录镜像到
+  // <项目>/Formal/Jobs/<jobId>.json —— 崩溃恢复、lean_lib.jobs 与 lean_job 都读它。
+  const LEAN_QUEUE_CONCURRENCY_MAX = 8
+  const leanQueue = []            // FIFO：待跑作业
+  const leanJobs = new Map()      // jobId -> job（内存视图，含 state）
+  const leanRunningHandles = new Map() // jobId -> 子进程 handle（dispose 时 terminate）
+  let leanSyncHandle = null       // 同步档在跑的 handle（同样能被 terminate）
+  const leanPendingNotices = []   // 一次性公告行（注入下一次 round prompt，spec §2.4）
+  /** 当前会话的构建计划（修订 §2/§4）：冻结 engine/args/搜索路径，作业与指纹都用它。 */
+  function leanBuildPlan() {
+    const userArgs = (Array.isArray(params.leanArgs) ? params.leanArgs : []).map(String)
+    const plan = leanSearchPathPlan(userArgs, params.leanSearchPaths, vibeRoot())
+    return { engine: String(params.leanCommand || 'lean'), args: userArgs, searchPaths: plan.paths, inject: plan.inject, explicit: plan.explicit }
+  }
+  function leanPlanContext(plan) { return leanBuildContext(plan.engine, plan.args, plan.searchPaths) }
+  /** 归档作业当前应绑定的构建计划（def/lemma 与 proof 都是本项目计划）。 */
+  function leanContextNow() { return leanPlanContext(leanBuildPlan()) }
+  function leanJobsMaxParallel() { return Math.max(1, Math.min(LEAN_QUEUE_CONCURRENCY_MAX, Number(params.leanJobsMaxParallel) || 1)) }
+  function leanActiveCount() { let n = 0; for (const j of leanJobs.values()) if (j.state === 'running') n++ ; return n }
+  function leanSleep(ms) { return new Promise(function (r) { setTimeout(r, Math.max(0, Number(ms) || 0)) }) }
+  /** VibeMath 根相对 → 绝对（全局库不在项目树内）。 */
+  function vibeAbs(rel) { return vibeRoot() + '/' + String(rel).replace(/^\.\//, '') }
+  function leanJobAbs(job) {
+    const rel = String((job && job.rel) || '')
+    if (!rel) return null
+    return job.scope === 'root' ? normalizeAbsPath(vibeAbs(rel)) : normalizeAbsPath(frameworkRoot() + '/' + rel)
+  }
+  /** 作业的回执路径与归档路径（lean_job 返回它们，修订 §3）。 */
+  function leanJobPaths(job) {
+    const rec = { receipt: 'Formal/Jobs/' + job.jobId + '.json' }
+    if (job.kind === 'archive' && job.archive && job.archive.kind === 'proof' && job.target) {
+      rec.work = job.rel
+      rec.archive = job.state === 'settled' ? ('Verified/Lean/' + job.target + '.lean') : ''
+    } else if (job.kind === 'archive') rec.archive = job.rel
+    else rec.file = job.rel
+    return rec
+  }
+  function leanJobRecord(job) {
+    return {
+      jobId: job.jobId, kind: job.kind, state: job.state, attempts: Number(job.attempts || 1),
+      target: job.target || '', name: job.name || '', rel: job.rel || '', scope: job.scope || 'project',
+      sha256: job.sha || '', buildSha256: job.buildSha || '', buildContext: job.buildCtx || '',
+      engine: (job.plan && job.plan.engine) || '', argv: (job.plan && job.plan.args) || [], searchPaths: (job.plan && job.plan.searchPaths) || [],
+      archiveKind: (job.archive && job.archive.kind) || '',
+      enqueuedAt: job.enqueuedAt || 0, startedAt: job.startedAt || 0, settledAt: job.settledAt || 0,
+      exitCode: job.exitCode === undefined ? null : job.exitCode,
+      timedOut: !!job.timedOut, interrupted: !!job.interrupted, note: job.note || '',
+      project: currentProject,
+    }
+  }
+  async function writeLeanJobFile(job) { await writeJson('Formal/Jobs/' + job.jobId + '.json', leanJobRecord(job)) }
+  function hydrateLeanJob(rec) {
+    return {
+      jobId: String(rec.jobId), kind: rec.kind || 'run', target: rec.target || '', name: rec.name || '',
+      rel: rec.rel || '', scope: rec.scope || 'project', sha: rec.sha256 || '',
+      buildSha: rec.buildSha256 || '', buildCtx: rec.buildContext || '',
+      plan: rec.engine !== undefined ? { engine: rec.engine || '', args: rec.argv || [], searchPaths: rec.searchPaths || [] } : null,
+      archive: rec.archiveKind ? { kind: rec.archiveKind, target: rec.target || '', name: rec.name || '' } : null,
+      state: rec.state || 'queued', attempts: Number(rec.attempts || 1), enqueuedAt: Number(rec.enqueuedAt || 0),
+      startedAt: Number(rec.startedAt || 0), settledAt: Number(rec.settledAt || 0),
+      exitCode: rec.exitCode === undefined ? null : rec.exitCode, timedOut: !!rec.timedOut,
+      interrupted: !!rec.interrupted, run: rec.run || null, note: rec.note || '',
+    }
+  }
+  /** 入队：同 jobId 已在队列/在跑 ⇒ 复用（幂等）；返回作业对象。 */
+  async function enqueueLeanJob(spec) {
+    const existing = leanJobs.get(spec.jobId)
+    if (existing && (existing.state === 'queued' || existing.state === 'running')) return existing
+    const job = Object.assign({}, spec, {
+      state: 'queued', attempts: Number(spec.attempts || ((existing && existing.attempts) || 0) + 1),
+      enqueuedAt: spec.enqueuedAt || now(), startedAt: 0, settledAt: 0, exitCode: null,
+      timedOut: false, interrupted: false, run: null, note: spec.note || '',
+    })
+    leanJobs.set(job.jobId, job)
+    leanQueue.push(job)
+    await writeLeanJobFile(job)
+    formalAnnounce('Lean 作业入队 ' + job.jobId + '（' + job.kind + (job.target ? '｜对象 ' + job.target : (job.name ? '｜' + job.name : '')) + '，state=queued）')
+    return job
+  }
+  function pushLeanNotice(line) { if (leanPendingNotices.length >= 20) leanPendingNotices.shift(); leanPendingNotices.push(String(line)) }
+  /** 一次性公告（spec §2.4）：取走即清空，保证同一条结果只注入一次。 */
+  function leanNoticeSection() {
+    if (leanPendingNotices.length === 0) return ''
+    const lines = leanPendingNotices.splice(0, leanPendingNotices.length)
+    return '\n' + lines.join('\n') + '\n'
+  }
+  function leanJobPublic(job) { return { jobId: job.jobId, state: job.state, rel: job.rel || '', target: job.target || '', attempts: Number(job.attempts || 1), settledAt: Number(job.settledAt || 0) } }
+  /**
+   * 心跳里推进队列：**不 await 编译本身**（调用方不 await 本函数）。
+   * 并发上限 = `leanJobsMaxParallel`（默认 1，串行）；串行时本函数等待该作业跑完再返回。
+   */
+  async function runLeanQueue() {
+    const max = leanJobsMaxParallel()
+    let started = 0
+    while (leanQueue.length > 0 && leanActiveCount() + started < max) {
+      const job = leanQueue.shift()
+      if (!job || job.state !== 'queued') continue
+      started++
+      if (max <= 1) { await runLeanJob(job); return }
+      runLeanJob(job).catch(function (e) { console.error('vibe-math-v3: lean job failed: ' + String((e && e.message) || e)) })
+    }
+  }
+  async function runLeanJob(job) {
+    if (job.state !== 'queued') return
+    job.state = 'running'; job.startedAt = now(); job.interrupted = false
+    await writeLeanJobFile(job)
+    let run
+    try { run = await leanExecFile(job.rel, leanJobAbs(job), job.timeoutMs, job.plan, function (h) { if (h) leanRunningHandles.set(job.jobId, h); else leanRunningHandles.delete(job.jobId) }) }
+    catch (e) { run = { ok: false, exitCode: null, code: 'LEAN_RUN_FAILED', message: String((e && e.message) || e), ms: 0 } }
+    try { await settleLeanJob(job, run) } catch (e) { console.error('vibe-math-v3: lean job settle failed: ' + String((e && e.stack) || e)) }
+  }
+  /** 结果公告行（spec §2.4 的四种结局）。 */
+  function leanSettleNotice(job, settledOk, capMs) {
+    const ms = (job.run && job.run.ms) || 0
+    if (job.interrupted) return '【形式化结果】' + job.jobId + '：中断（会话卸载或崩溃，已标记 attempted，可重跑）'
+    if (job.timedOut) return '【形式化结果】' + job.jobId + '：超时（leanTimeoutMs=' + capMs + ' 已 terminate；对象留在 attempted）'
+    if (settledOk) return '【形式化结果】' + job.jobId + '：通过（exit 0，' + (ms / 1000).toFixed(1) + 's' + ((job.kind === 'archive' && job.archive && job.archive.kind === 'proof') ? ('，已归档 Verified/Lean/' + job.target + '.lean') : '') + '）'
+    if (job.hashMismatch) return '【形式化结果】' + job.jobId + '：失败（编译期间文件内容已变，本次结果已丢弃；请重跑）'
+    if (job.contextMismatch) return '【形式化结果】' + job.jobId + '：失败（编译期间构建上下文已变：引擎/参数/搜索路径，本次结果已丢弃；请在新上下文下重跑）'
+    return '【形式化结果】' + job.jobId + '：失败（exit ' + String(job.exitCode) + '，见 stderr 尾部）'
+  }
+  /**
+   * 落地一个作业（**唯一**的 passed 入口，spec §2.1）：只有 exit 0 **且** 内容哈希仍匹配才算 ok；
+   * 其余一律 attempted；中断/超时都不是 passed；内容变了只标记不贴结果。
+   */
+  async function settleLeanJob(job, run) {
+    const capMs = Math.max(1000, Number(job.timeoutMs) || Number(params.leanTimeoutMs) || 120000)
+    let currentSha = null
+    try { const t = await readTextAbs(leanJobAbs(job)); if (t !== undefined) currentSha = leanContentSha(t) } catch (e) { /* 读不到 ⇒ 视为不匹配 */ }
+    const hashOk = currentSha !== null && currentSha === job.sha
+    // 修订 §4：结果只对**产生它的那个构建上下文**有效。参数在编译途中被改（引擎/参数/搜索路径）
+    // ⇒ 这次 ok 不能贴到"现在的配置"上，宁可判为未通过并明确公告。
+    const ctxNow = leanContextNow()
+    const ctxOk = !job.buildCtx || job.buildCtx === ctxNow
+    job.hashMismatch = !hashOk
+    job.contextMismatch = !ctxOk
+    job.exitCode = run.exitCode === undefined ? null : run.exitCode
+    job.timedOut = !!run.timedOut
+    job.settledAt = now()
+    const settledOk = !job.interrupted && !job.timedOut && run.exitCode === 0 && hashOk && ctxOk
+    job.state = job.interrupted ? 'interrupted' : (job.timedOut ? 'timeout' : (settledOk ? 'settled' : 'failed'))
+    job.run = { at: now(), ok: settledOk, exitCode: job.exitCode, ms: run.ms || 0, timedOut: !!job.timedOut, interrupted: !!job.interrupted, stdoutTail: formalTail(run.stdout, 800), stderrTail: formalTail(run.stderr, 800), searchPath: run.searchPath || vibeRoot(), buildContext: job.buildCtx || '' }
+    if (job.hashMismatch && !job.interrupted && !job.timedOut) job.note = 'file changed while compiling — result discarded (hash mismatch)'
+    else if (job.contextMismatch && !job.interrupted && !job.timedOut) job.note = 'build context changed while compiling (engine/args/search paths) — result discarded; re-run under the new context'
+    const asyncInfo = { jobId: job.jobId, state: job.state, attempts: job.attempts, enqueuedAt: job.enqueuedAt, startedAt: job.startedAt, settledAt: job.settledAt, exitCode: job.exitCode, buildSha256: job.buildSha || '' }
+    if (job.kind === 'archive') await settleLeanArchiveJob(job, settledOk, asyncInfo)
+    else if (job.target) await formalSetRun(job.target, Object.assign({}, run, { ok: settledOk, file: job.rel }), asyncInfo)
+    if (!job.interrupted) await writeFormalIndex()
+    await writeLeanJobFile(job)
+    pushLeanNotice(leanSettleNotice(job, settledOk, capMs))
+    formalAnnounce('Lean 作业 ' + job.jobId + ' ' + job.state + '（' + job.kind + '）' + (job.target ? '｜对象 ' + job.target : ''))
+    reportDirty = true
+  }
+  /** 归档类作业的落地：**只有 ok 才落库/置 passed**（def/lemma 的文件在入队前已写好）。 */
+  async function settleLeanArchiveJob(job, ok, asyncInfo) {
+    const a = job.archive || {}
+    if (a.kind !== 'proof') {
+      // 与同步档同一份记账：全局库的运行结果进 formalState.libRuns（索引据此显示"跑通/未跑通"）。
+      const libRel = String(job.rel || '').replace(/^Formal\//, '')
+      if (libRel) formalState.libRuns[libRel] = { ok: !!ok, exitCode: job.exitCode === undefined ? null : job.exitCode, ms: (job.run && job.run.ms) || 0, at: now() }
+      await rebuildLeanLibIndexes()
+      formalAnnounce('归档作业 ' + job.jobId + '（' + a.kind + ' ' + job.rel + '）' + (ok ? '运行通过' : '运行未通过（见 stderr 尾部；该文件不应被当作可复用定义）'))
+      return
+    }
+    const target = job.target
+    const prev = formalOf(target)
+    const passed = !!ok
+    const stalePrev = passed ? '' : String(prev.proof || ('Verified/Lean/' + target + '.lean'))
+    const rec = Object.assign({}, prev, {
+      status: passed ? 'passed' : 'attempted',
+      file: job.rel,
+      proof: passed ? 'Verified/Lean/' + target + '.lean' : '',
+      decision: 'used',
+      note: String(prev.note || ''),
+      run: job.run,
+      async: asyncInfo,
+      updatedAt: now(),
+    })
+    let withdrawn = null
+    if (passed) {
+      const body = await readTextAbs(leanJobAbs(job))
+      if (body !== undefined) await writeText('Verified/Lean/' + target + '.lean', body)
+    } else if (stalePrev) { try { withdrawn = await withdrawArchivedProof(stalePrev) } catch (e) { withdrawn = { rel: stalePrev, outcome: 'failed' } } }
+    await putFormal(target, rec)
+    await upsertFormalAnchor(target)
+    await rebuildLeanLibIndexes()
+    formalAnnounce('归档作业 ' + job.jobId + ' 为 ' + target + ' ' + (passed ? ('通过，已归档 ' + rec.proof + '，验证转为忠实性审查')
+      : ('未通过：' + formalTail(job.run && job.run.stderrTail, 160) + '；已撤回上一份已通过状态与归档证明' + (withdrawn && withdrawn.outcome !== 'failed' ? '（' + withdrawn.outcome + '）' : '（⚠ 撤回失败，请不要把 ' + stalePrev + ' 当作该对象的证明）'))))
+  }
+  /** 去重（spec §4.3）：同内容且已成功过 ⇒ 跳过写盘与重编译。 */
+  async function leanDedupeLookup(jobId, abs, sha, proofTarget) {
+    if (proofTarget) {
+      const rec = formalOf(proofTarget)
+      if (rec && rec.status === 'passed') {
+        const cur = await readTextAbs(vibeAbs('Verified/Lean/' + proofTarget + '.lean'))
+        if (cur !== undefined && leanContentSha(cur) === sha) return { deduped: true, file: 'Verified/Lean/' + proofTarget + '.lean' }
+      }
+      return null
+    }
+    const prev = await readJson('Formal/Jobs/' + jobId + '.json')
+    if (leanJobSettledOk(prev)) {
+      const cur = await readTextAbs(abs)
+      if (cur !== undefined && leanContentSha(cur) === sha) return { deduped: true, file: String(prev.rel || '') }
+    }
+    return null
+  }
+  /** 后台作业的公共返回形状（§1.2）。 */
+  function leanAsyncReturn(job, extra) {
+    return Object.assign({
+      ok: true, async: { jobId: job.jobId, state: job.state }, jobId: job.jobId,
+      message: '已入队后台编译（并发上限 1）；你可以继续工作。结果会写入 Formal/ 与索引，并在下一轮提示里公告；也可用 vibe_math_lean_lib 的 jobs 字段随时查看。**在该作业落地为通过之前，不得把相关对象当成已通过。**',
+    }, extra || {})
+  }
+  /** 崩溃恢复（spec §2.6）：queued 重入队；running 哈希匹配 ⇒ 标记 interrupted + 重入队（attempts+1），不匹配 ⇒ 只标记；恢复**绝不**置 passed。 */
+  async function recoverLeanJobs() {
+    let files = []
+    try { files = (await listFiles('Formal/Jobs')) || [] } catch (e) { return { recovered: 0 } }
+    let recovered = 0
+    for (let i = 0; i < files.length; i++) {
+      const f = String(files[i])
+      if (!/\.json$/.test(f)) continue
+      const rec = await readJson('Formal/Jobs/' + f)
+      if (!rec || !rec.jobId) continue
+      // 本进程内存里已知的作业（queued/running 或已落地）不再恢复：同一进程内切换项目时，
+      // 内存队列还在正常跑，按文件状态"恢复"会把一个在跑的作业误判成崩溃（重复入队/误置 interrupted）。
+      if (leanJobs.has(String(rec.jobId))) continue
+      const job = hydrateLeanJob(rec)
+      leanJobs.set(job.jobId, job)
+      const abs = leanJobAbs(job)
+      const txt = abs ? await readTextAbs(abs) : undefined
+      const curSha = txt === undefined ? null : leanContentSha(txt)
+      const hashMatch = curSha !== null && curSha === job.sha
+      if (job.state === 'queued') {
+        await enqueueLeanJob(job)
+        pushLeanNotice('【形式化结果】' + job.jobId + '：上次会话未执行的排队作业已重新入队')
+        recovered++
+      } else if (job.state === 'running') {
+        if (hashMatch) {
+          if (job.target) await putFormal(job.target, Object.assign({}, formalOf(job.target), { status: 'attempted', async: { jobId: job.jobId, state: 'interrupted', attempts: job.attempts }, updatedAt: now() }))
+          job.interrupted = true
+          // 先落到 interrupted，再重入队：否则 enqueueLeanJob 的幂等守卫会把这条 "running" 记录
+          // 当成"仍在跑"而早退，attempts 也不会 +1（恢复就静默失效了）。
+          job.state = 'interrupted'
+          await enqueueLeanJob(Object.assign({}, job, { attempts: job.attempts + 1 }))
+          pushLeanNotice('【形式化结果】' + job.jobId + '：中断（会话崩溃，已标记 attempted，已用新 attempts 重新入队）')
+        } else {
+          if (job.target) await putFormal(job.target, Object.assign({}, formalOf(job.target), { status: 'attempted', async: { jobId: job.jobId, state: 'interrupted', attempts: job.attempts, note: 'file changed' }, updatedAt: now() }))
+          job.state = 'interrupted'; job.interrupted = true
+          job.note = 'file changed while the previous session was compiling — not auto-re-driven'
+          await writeLeanJobFile(job)
+          pushLeanNotice('【形式化结果】' + job.jobId + '：中断（文件已变，未自动重驱；请手动重跑）')
+        }
+        recovered++
+      } else if (job.state === 'settled') {
+        // 修订 §4：只有**同一构建上下文**下的 settled(ok) 才允许恢复成 passed。
+        const ctxNow = leanContextNow()
+        const ctxOk = !job.buildCtx || job.buildCtx === ctxNow
+        if (leanJobSettledOk(rec) && hashMatch && ctxOk) {
+          job.run = { at: now(), ok: true, exitCode: 0, ms: 0, timedOut: false, interrupted: false, stdoutTail: '', stderrTail: '', searchPath: vibeRoot(), buildContext: job.buildCtx || '' }
+          if (job.kind === 'archive') await settleLeanArchiveJob(job, true, { jobId: job.jobId, state: 'settled', attempts: job.attempts, settledAt: job.settledAt, exitCode: 0, buildSha256: job.buildSha || '' })
+          else if (job.target) await formalSetRun(job.target, job.run, { jobId: job.jobId, state: 'settled', buildSha256: job.buildSha || '' })
+          pushLeanNotice('【形式化结果】' + job.jobId + '：已按作业记录补写归档与 passed（恢复时校验内容哈希与构建上下文一致）')
+        } else if (job.target) {
+          await putFormal(job.target, Object.assign({}, formalOf(job.target), { status: 'attempted', async: { jobId: job.jobId, state: 'interrupted', attempts: job.attempts, note: ctxOk ? 'recovered-incomplete' : 'build context changed' }, updatedAt: now() }))
+          pushLeanNotice('【形式化结果】' + job.jobId + '：按作业记录标记为未通过/已变（恢复绝不置 passed）')
+        }
+        recovered++
+      }
+    }
+    if (recovered > 0) formalAnnounce('Lean 作业恢复：处理了 ' + recovered + ' 条遗留作业记录（queued 重入队 / running 标记中断 / settled 补写；绝不置 passed）')
+    return { recovered: recovered }
+  }
+  /** 会话卸载/销毁：终止在跑的编译并标记 interrupted（不留孤儿进程，spec §2.5）。 */
+  function disposeLeanJobs() {
+    let n = 0
+    for (const job of leanJobs.values()) {
+      if (job.state === 'running') { job.interrupted = true; n++ }
+    }
+    for (const job of leanQueue) { job.state = 'interrupted'; job.interrupted = true; n++ }
+    for (const h of leanRunningHandles.values()) {
+      try { if (h && typeof h.terminate === 'function') h.terminate() } catch (e) { /* best effort */ }
+    }
+    leanRunningHandles.clear()
+    if (leanSyncHandle && typeof leanSyncHandle.terminate === 'function') { try { leanSyncHandle.terminate() } catch (e) { /* best effort */ } }
+    leanSyncHandle = null
+    leanQueue.length = 0
+    if (n > 0) {
+      pushLeanNotice('【形式化结果】干预：会话卸载，' + n + ' 个 Lean 作业已标记 interrupted（未落地为 passed）')
+      // 落盘尽力而为（disposer 不能 await）：作业记录留着，供下次 init 恢复时标记。
+      try {
+        for (const job of leanJobs.values()) { if (job.state === 'running' || job.interrupted) writeLeanJobFile(job).catch(function () { }) }
+      } catch (e) { /* best effort */ }
+    }
+    return n
+  }
+
+  // ---- 三份索引（框架维护；契约 §9）----
   async function writeFormalIndex() {
     const recs = formalRecords()
     const keys = Object.keys(recs).sort()
@@ -2769,9 +3310,9 @@ export function apply(ctx) {
     }
     const libRows = await scan(vibeRoot() + '/Formal/Lib', 'Lib')
     await writeTextAbs(vibeRoot() + '/Formal/Lib/Index.md', ['# 可复用 Lean 定义库（跨项目）｜' + currentProject, '',
-      '> 写新定义之前先查这里：能复用就不要重新定义。', '',
-      '| 名称 | 文件 | 类别 | 摘要 | 最近运行 |', '|---|---|---|---|---|']
-      .concat(libRows.length ? libRows.map(function (r) { return '| ' + r.base + ' | ' + r.rel + ' | def | ' + r.first.replace(/\|/g, '/') + ' | ' + r.run + ' |' }) : ['| （暂无） | | | | |']).join('\n') + '\n')
+      '> 写新定义之前先查这里：能复用就不要重新定义。复用方式：`import Formal.Lib.<名称>`（模块根 = VibeMath 根）。', '',
+      '| 名称 | 文件 | 类别 | 依赖（import） | 摘要 | 最近运行 |', '|---|---|---|---|---|---|']
+      .concat(libRows.length ? libRows.map(function (r) { return '| ' + r.base + ' | ' + r.rel + ' | def | ' + String(r.depend || '—').replace(/\|/g, '/') + ' | ' + r.first.replace(/\|/g, '/') + ' | ' + r.run + ' |' }) : ['| （暂无） | | | | | |']).join('\n') + '\n')
     const provedRows = await scan(vibeRoot() + '/Formal/Proved', 'Proved')
     await writeTextAbs(vibeRoot() + '/Formal/Proved/Index.md', ['# 已成立的 Lean 命题 / 引理（机器已核对，可跨项目复用）｜' + currentProject, '',
       '> 这些文件是通过内核检查的引理，可直接 import 复用。', '',
@@ -2829,18 +3370,27 @@ export function apply(ctx) {
    */
   async function leanRunTool(memberId, o) {
     const args = o || {}
-    const run = await leanRunFile(String(args.file || ''), args.timeout_ms)
+    const rel = String(args.file || '').trim()
     const target = String(args.target || '').trim()
+    if (params.leanAsync !== false) {
+      const guard = await leanResolveRunTarget(rel)
+      if (!guard.ok) return guard
+      const plan = leanBuildPlan()
+      const ctx = leanPlanContext(plan)
+      const fp = leanJobFingerprint(guard.text, ctx)
+      const jobId = leanJobId(target || guard.rel, fp)
+      const job = await enqueueLeanJob({ jobId: jobId, kind: 'run', key: target || guard.rel, rel: guard.rel, scope: 'project', target: target, sha: guard.sha, buildSha: fp, buildCtx: ctx, plan: plan, memberId: memberId, timeoutMs: args.timeout_ms })
+      return leanAsyncReturn(job, { file: guard.rel, state: job.state, hint: '已入队。**在它落地为通过之前，不得把该对象当成已通过**；结果会在下一轮提示的【形式化结果】行里公告，或用 vibe_math_lean_job（可 waitMs 等待）查看。' })
+    }
+    const run = await leanRunFile(rel, args.timeout_ms)
     if (run.file || run.ok) {
       if (target) { await formalSetRun(target, run); await upsertFormalAnchor(target) }
       await writeFormalIndex()
     }
     if (run.ok) await formalAnnounce('【形式化】' + (memberId || 'scheduler') + ' 运行 Lean 通过：' + run.file + '（' + ((run.ms || 0) / 1000).toFixed(1) + 's）' + (target ? '｜对象 ' + target : ''))
-    // 失败提示必须与失败原因一致：工具链缺失 / 宿主没有 subprocess 服务时**没有任何编译器输出**
-    // 可以"按它修复"，把它当成普通编译错误会让代理反复重试而不是走"写下代码 + 记录显式阻塞"
-    // 这条出路（契约 §6 硬要求 4）。
     const noHost = run.code === 'LEAN_NOT_FOUND' || run.code === 'NO_SUBPROCESS' || run.code === 'LEAN_SPAWN_FAILED'
     return Object.assign({ ok: !!run.ok }, run, {
+      async: null,
       hint: run.ok
         ? '通过。若是某个对象的证明，请用 vibe_math_lean_archive kind=\'proof\' 归档（会写入 Verified/Lean/ 并把审查对象变成忠实性）；若是可复用定义/引理，用 kind=\'def\'/\'lemma\' 归档到全局库。'
         : (noHost
@@ -2848,6 +3398,80 @@ export function apply(ctx) {
           : '未通过。请按上面的编译器输出修复后重跑；若判断无法完成，用 vibe_math_lean_archive kind=\'blocked\' 记录原因。'),
     })
   }
+  /** 异步档的路径/存在性校验（与 leanRunFile 同一套守卫与错误码）。 */
+  async function leanResolveRunTarget(relPath) {
+    const rel = String(relPath || '').trim()
+    if (!rel) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'file is required' }
+    const abs = await leanResolveRun(rel)
+    if (abs === null) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'Lean 文件必须位于 ' + vibeRoot().replace(/\\/g, '/') + '/ 之内（收到 ' + rel + '）' }
+    if (!/\.lean$/i.test(abs)) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'only .lean files can be executed' }
+    const txt = await readTextAbs(abs)
+    if (txt === undefined) return { ok: false, code: 'V3_NOT_FOUND', message: 'no such file: ' + rel }
+    return { ok: true, rel: rel, abs: abs, sha: leanContentSha(txt), text: txt }
+  }
+  /** `lean_read`：只读地取回归档的 Lean 原文（verbatim 复用；§1.2）。 */
+  async function leanReadTool(o) {
+    const args = o || {}
+    const rawName = String(args.name || '').trim()
+    if (!rawName) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'name is required' }
+    if (rawName.indexOf('..') !== -1 || /[\\/]/.test(rawName) || /^[a-z]:/i.test(rawName)) {
+      return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'name must be a bare library name (no path separators, no "..", no absolute path)' }
+    }
+    const name = idSafe(rawName)
+    const kind = (args.kind === 'lib' || args.kind === 'proved') ? args.kind : 'auto'
+    const order = kind === 'auto' ? ['lib', 'proved'] : [kind]
+    for (let i = 0; i < order.length; i++) {
+      const k = order[i]
+      const rel = 'Formal/' + (k === 'lib' ? 'Lib' : 'Proved') + '/' + name + '.lean'
+      const dir = normalizeAbsPath(vibeRoot() + '/Formal/' + (k === 'lib' ? 'Lib' : 'Proved'))
+      const abs = normalizeAbsPath(vibeRoot() + '/' + rel)
+      if (abs.indexOf(dir + '/') !== 0) continue
+      const txt = await readTextAbs(abs)
+      if (txt === undefined) continue
+      const LIMIT = 64 * 1024
+      const bytes = Buffer.byteLength(txt, 'utf8')
+      const truncated = bytes > LIMIT
+      return { ok: true, name: name, file: rel, kind: k, sha256: leanContentSha(txt), bytes: bytes, text: truncated ? Buffer.from(txt, 'utf8').slice(0, LIMIT).toString('utf8') : txt, truncated: truncated }
+    }
+    return { ok: false, code: 'V3_NOT_FOUND', message: 'no archived Lean file named ' + name + '（查过 Formal/Lib 与 Formal/Proved）；可先用 vibe_math_lean_lib 看清单' }
+  }
+  /**
+   * `lean_job`（修订 §3，只读）：不带 jobId ⇒ 本会话作业清单；带 ⇒ 该作业 state/exitCode/回执路径/归档路径。
+   * waitMs>0 最多等这么久（内部轮询；心跳是独立 timer，不会被阻塞），超时返回当前 state。
+   */
+  async function leanJobTool(o) {
+    const args = o || {}
+    const wantId = String(args.jobId || '').trim()
+    const waitMs = Math.max(0, Math.min(600000, Number(args.waitMs) || 0))
+    if (!wantId) {
+      const jobs = []
+      for (const j of leanJobs.values()) jobs.push(Object.assign(leanJobPublic(j), { exitCode: j.exitCode === undefined ? null : j.exitCode, paths: leanJobPaths(j), buildSha256: j.buildSha || '' }))
+      jobs.sort(function (a, b) { return (b.settledAt || 0) - (a.settledAt || 0) || String(a.jobId).localeCompare(String(b.jobId)) })
+      return { ok: true, async: params.leanAsync !== false, maxParallel: leanJobsMaxParallel(), queued: leanQueue.length, running: leanActiveCount(), jobs: jobs, paths: { receipts: 'Formal/Jobs/', proofs: 'Verified/Lean/', lib: 'VibeMath/Formal/Lib/', proved: 'VibeMath/Formal/Proved/' }, hint: 'state=settled 且 exitCode=0（且内容哈希/构建上下文一致）才算通过；queued/running 一律还不算。' }
+    }
+    let job = leanJobs.get(wantId)
+    if (!job) {
+      const rec = await readJson('Formal/Jobs/' + wantId + '.json')
+      if (!rec || !rec.jobId) return { ok: false, code: 'V3_NOT_FOUND', message: 'no such Lean job: ' + wantId + '（用不带 jobId 的 vibe_math_lean_job 列清单）' }
+      job = hydrateLeanJob(rec)
+      if (!leanJobs.has(job.jobId)) leanJobs.set(job.jobId, job)
+    }
+    const startedAt = now()
+    while (waitMs > 0 && (job.state === 'queued' || job.state === 'running') && (now() - startedAt) < waitMs) {
+      await leanSleep(50)
+      const cur = leanJobs.get(wantId)
+      if (cur) job = cur
+    }
+    return {
+      ok: true, jobId: job.jobId, state: job.state, exitCode: job.exitCode === undefined ? null : job.exitCode,
+      attempt: Number(job.attempts || 1), timedOut: !!job.timedOut, interrupted: !!job.interrupted, note: job.note || '',
+      buildSha256: job.buildSha || '', buildContext: job.buildCtx || '',
+      waitedMs: now() - startedAt, stillRunning: (job.state === 'queued' || job.state === 'running'),
+      passed: leanJobSettledOk(leanJobRecord(job)),
+      paths: leanJobPaths(job),
+      run: job.run || null,
+    }
+  }
   async function leanArchive(memberId, o) {
     const args = o || {}
     const kind = String(args.kind || '')
@@ -2872,6 +3496,22 @@ export function apply(ctx) {
       const dirRel = kind === 'def' ? 'Lib' : 'Proved'
       const rel = 'Formal/' + dirRel + '/' + name + '.lean'
       const abs = vibeRoot() + '/' + rel
+      const sha = leanContentSha(body)
+      const plan = leanBuildPlan()
+      const ctx = leanPlanContext(plan)
+      const fp = leanJobFingerprint(body, ctx)
+      const jobId = leanJobId(name, fp)
+      // 去重（§4.3）：同内容 + 同构建上下文且已成功归档过 ⇒ 跳过重写与重编译。
+      const dedupe = await leanDedupeLookup(jobId, abs, sha, null)
+      if (dedupe) {
+        await formalAnnounce('【形式化】' + who + ' 归档 ' + kind + ' `' + name + '` 命中去重（同内容与构建上下文，跳过重写与重编译）')
+        return { ok: true, kind: kind, name: name, file: rel, deduped: true, sha256: sha, buildSha256: fp, note: '内容与构建上下文都与已归档并编译通过的版本一致：跳过重写与重编译（去重）。' }
+      }
+      if (params.leanAsync !== false && args.run !== false) {
+        if (!await writeTextAbs(abs, body)) return { ok: false, code: 'V3_WRITE_FAILED', message: 'could not write ' + rel }
+        const job = await enqueueLeanJob({ jobId: jobId, kind: 'archive', key: name, rel: rel, scope: 'root', name: name, target: '', sha: sha, buildSha: fp, buildCtx: ctx, plan: plan, memberId: memberId, archive: { kind: kind } })
+        return leanAsyncReturn(job, { kind: kind, name: name, file: rel, sha256: sha, buildSha256: fp, deduped: false, note: '文件已写入 ' + rel + '；编译已入队（并发上限 leanJobsMaxParallel）。**落地为通过之前，请不要把它当作可复用定义**；结果会在下一轮提示的【形式化结果】行公告，也可用 vibe_math_lean_job 查/等。' })
+      }
       if (!await writeTextAbs(abs, body)) return { ok: false, code: 'V3_WRITE_FAILED', message: 'could not write ' + rel }
       // 全局库在项目树之外，必须用**绝对路径**执行（相对形式会在项目根里找）。
       const run = args.run === false ? null : await leanRunFile(abs)
@@ -2888,6 +3528,36 @@ export function apply(ctx) {
       if (body === undefined && from) { const r = await readFrom(); if (r.err) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: r.err }; body = r.body }
       if (body === undefined) return { ok: false, code: 'V3_INVALID_ARGUMENT', message: 'provide content, or from=<existing .lean file>' }
       const workRel = 'Formal/' + target + '.lean'
+      const sha = leanContentSha(body)
+      const plan = leanBuildPlan()
+      const ctx = leanPlanContext(plan)
+      const fp = leanJobFingerprint(body, ctx)
+      const jobId = leanJobId(target, fp)
+      // 去重（§4.3）：对象已 passed 且归档证明与新提交内容一致 ⇒ 跳过。
+      const dedupe = await leanDedupeLookup(jobId, null, sha, target)
+      if (dedupe) {
+        await formalAnnounce('【形式化】' + who + ' 归档证明 ' + target + ' 命中去重（已 passed 且内容一致）')
+        return { ok: true, kind: kind, target: target, file: workRel, proof: dedupe.file, passed: true, deduped: true, sha256: sha, buildSha256: fp, status: 'passed', note: '该对象已是 passed，且归档证明与新提交内容一致：跳过重写与重编译（去重）。' }
+      }
+      if (params.leanAsync !== false) {
+        if (!await writeTextAbs(frameworkRoot() + '/' + workRel, body)) return { ok: false, code: 'V3_WRITE_FAILED', message: 'could not write ' + workRel }
+        const prevA = formalOf(target)
+        await putFormal(target, Object.assign({}, prevA, {
+          status: prevA.status === 'passed' ? 'passed' : 'attempted',
+          file: workRel,
+          decision: 'used',
+          note: String(args.note || prevA.note || ''),
+          async: { jobId: jobId, state: 'queued', attempts: 0, enqueuedAt: now(), startedAt: 0, settledAt: 0, exitCode: null, buildSha256: fp },
+          updatedAt: now(),
+        }))
+        await upsertFormalAnchor(target)
+        await writeFormalIndex()
+        const job = await enqueueLeanJob({ jobId: jobId, kind: 'archive', key: target, rel: workRel, scope: 'project', target: target, sha: sha, buildSha: fp, buildCtx: ctx, plan: plan, memberId: memberId, archive: { kind: 'proof', target: target } })
+        return leanAsyncReturn(job, {
+          kind: kind, target: target, file: workRel, status: 'attempted', sha256: sha, buildSha256: fp,
+          note: '工作文件已写入 ' + workRel + '；编译已入队。**只有该作业在同一个构建上下文下落地为通过，才会写入 Verified/Lean/' + target + '.lean 并把状态变为 passed**——在它落地之前，这个对象不是"已通过形式化"。',
+        })
+      }
       // 用绝对路径写：`writeText` 写失败时只会抛（由工具包装层变成通用 error），
       // 这一行的 V3_WRITE_FAILED 分支就永远不可能触发；writeTextAbs 会如实返回 false。
       if (!await writeTextAbs(frameworkRoot() + '/' + workRel, body)) return { ok: false, code: 'V3_WRITE_FAILED', message: 'could not write ' + workRel }
@@ -3289,13 +3959,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 = await spawnHandle(sub, { 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)
@@ -3303,6 +4453,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()
@@ -3321,9 +4474,17 @@ 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)
+    // Lean 异步作业的崩溃恢复（spec §2.6）：同一进程 continue 不重驱（内存队列还在跑），
+    // 只有新进程/新会话接手（fresh 或 stale epoch）才按 Formal/Jobs/*.json 恢复；恢复绝不置 passed。
+    if (fresh || stale) { try { await recoverLeanJobs() } catch (e) { console.error('vibe-math-v3: lean job recovery failed: ' + String((e && e.message) || e)) } }
+    // 数学计算的引擎探测（异步）在 init 时先跑一次：提示词侧只读缓存现算（mathWorkLine）。
+    try { await refreshMathProbe(true) } catch (e) { /* 探测失败不影响 init：mathWorkLine 会因此为空 */ }
     await saveAll()
     if (params.indexAutoRebuild) await rebuildIndex()
     return { ok: true }
@@ -3376,7 +4537,7 @@ export function apply(ctx) {
   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++) {
@@ -3413,6 +4574,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() {
@@ -3431,8 +4594,14 @@ export function apply(ctx) {
     // 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' }).length
+    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)')
@@ -3464,8 +4633,13 @@ 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: {} }
-    await loadSettings(); await migrateLegacyParams(); await loadState(); await loadKnowledgeBase(); await saveAll()
+    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()
+    // 切到/新建项目 = 接手这棵树的遗留作业（本进程不认识的 jobId 才恢复）。
+    try { await recoverLeanJobs() } catch (e) { console.error('vibe-math-v3: lean job recovery on project switch failed: ' + String((e && e.message) || e)) }; await loadKnowledgeBase()
+    // 切项目后引擎探测缓存过期（mathEngines/路径可能不同）：重探一次再让提示词读它。
+    try { await refreshMathProbe(true) } catch (e) { /* 探测失败不影响切换 */ }
+    await saveAll()
     if (params.indexAutoRebuild) await rebuildIndex()
     return { ok: true, project: slug, frameworkRoot: frameworkRoot() }
   }
@@ -3476,6 +4650,13 @@ 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 }
+  // math_computation 的**会话层**注册（共享模块的 host 在上面构造，绑定本会话的 params/Paths/fs）。
+  // 模块调用一次 host.register(...) ⇒ handlers['math_computation'] = 该会话的 handler；
+  // apply 层（工具面）在 apply 作用域单独注册一次，按名路由回这里（FREEZE §4 要求两层都在）。
+  mathTool = registerMathComputation(mathHost)
+  // 会话层挂载（**字面量形态**，静态扫描器可见）：handler 是模块为**本会话**构造的那一个；
+  // apply 层的同名词由宿主按 handlerName 路由回这里。两层名字/描述/schema 三处完全一致。
+  registerTool('math_computation', TOOL_DESC.math_computation, MATH_TOOL_SCHEMA, async function (args, agent) { return await mathTool.handler(args || {}, agent) })
   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() })
@@ -3483,7 +4664,7 @@ export function apply(ctx) {
   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' } }), async function (args) { params = Object.assign({}, params, sanitizeParams(args)); await saveAll(); await saveSettings(); return { ok: true, params: params } })
+  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' }, leanAsync: { type: 'boolean' }, leanJobsMaxParallel: { type: 'integer' }, leanInitiative: { type: 'string', enum: ['off', 'normal', 'eager'] }, leanSearchPaths: { type: 'array', items: { type: 'string' } }, mathComputation: { type: 'string', enum: ['off', 'auto', 'on'] }, mathMode: { type: 'string', enum: ['typed', 'typed+shell'] }, mathEngines: { type: 'array', items: { type: 'string' } }, mathTimeoutMs: { type: 'integer' }, mathPackages: { type: 'array', items: { type: 'string' } }, mathInstallScope: { type: 'string', enum: ['user', 'system'] }, 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(); if (args && MATH_PARAM_NAMES.some(function (k) { return k in args })) { try { await refreshMathProbe(true) } catch (e) { /* 探测失败不影响参数保存 */ } } 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') })
@@ -3529,13 +4710,17 @@ export function apply(ctx) {
       counts: r, todo: formalTodo().map(function (t) { return { id: t.id, why: t.why, at: t.at } }),
       objects: Object.keys(formalRecords()).map(function (k) {
         const rec = formalRecords()[k] || {}
-        return { target: k, status: rec.status, file: rec.file, proof: rec.proof, note: rec.note }
+        return { target: k, status: rec.status, file: rec.file, proof: rec.proof, note: rec.note, async: rec.async || null }
       }),
-      paths: { project: 'Formal/（相对项目根）', lib: 'VibeMath/Formal/Lib/', proved: 'VibeMath/Formal/Proved/', proofs: 'Verified/Lean/' },
-      hint: "复用优先：先在 Lib/ 里找现成定义；新定义用 vibe_math_lean_archive kind='def' 归档，已证引理用 kind='lemma'；归档前先跑通（run=true 或先 vibe_math_lean_run），跑不通不要入库。",
+      async: params.leanAsync !== false,
+      jobs: (function () { const out = []; for (const j of leanJobs.values()) out.push(Object.assign(leanJobPublic(j), { exitCode: j.exitCode === undefined ? null : j.exitCode, paths: leanJobPaths(j), buildSha256: j.buildSha || '' })); out.sort(function (x, y) { return (y.settledAt || 0) - (x.settledAt || 0) || String(x.jobId).localeCompare(String(y.jobId)) }); return out })(),
+      paths: { project: 'Formal/（相对项目根）', lib: 'VibeMath/Formal/Lib/', proved: 'VibeMath/Formal/Proved/', proofs: 'Verified/Lean/', searchPath: vibeRoot(), jobs: 'Formal/Jobs/' },
+      hint: "复用优先：先在 Lib/ 里找现成定义（vibe_math_lean_read 可取原文）；新定义用 vibe_math_lean_archive kind='def' 归档，已证引理用 kind='lemma'；归档前先跑通（run=true 或先 vibe_math_lean_run），跑不通不要入库。异步档用 jobs 字段查后台编译：**只有 state=settled 才算通过**。",
       verify: (Object.keys(tasks).length ? String(tasks[Object.keys(tasks)[0]].rId || '') : null),
     }
   })
+  registerTool('vibe_math_lean_read', TOOL_DESC.vibe_math_lean_read, objParams({ name: { type: 'string' }, kind: { type: 'string', enum: ['auto', 'lib', 'proved'] } }, ['name']), async function (args) { return await leanReadTool(args) })
+  registerTool('vibe_math_lean_job', TOOL_DESC.vibe_math_lean_job, objParams({ jobId: { type: 'string' }, waitMs: { type: 'integer' } }), async function (args) { return await leanJobTool(args) })
 
   // ---- 代理直接写 md 的写锁 + 轻元数据同步（任务2：代理自组织写各自对应路径的 md，避免并发写同一文件） ----
   /**
@@ -3745,7 +4930,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 [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', 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 =================
@@ -3766,6 +4952,21 @@ export function apply(ctx) {
     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,
+    // Lean 异步队列（spec §2）：心跳推进队列；dispose 由 apply 级 disposer 调用（不留孤儿进程）。
+    runLeanQueue: runLeanQueue,
+    disposeLeanJobs: disposeLeanJobs,
+    leanQueueSize: function () { return leanQueue.length },
+    leanJobsPublic: function () { const out = []; for (const j of leanJobs.values()) out.push(leanJobPublic(j)); return out },
+    // 数学计算（FREEZE §4）：心跳用 TTL 刷新探测缓存；off 档不探测（真 no-op）。
+    mathProbeDue: mathProbeDue,
+    refreshMathProbe: refreshMathProbe,
+    mathProbe: function () { return mathProbe },
+    // P2a：persona 两个文本块必须含的「归档→编辑→重跑」规则（文本取自共享模块常量，persona 不手抄）。
+    mathArchiveWorkflowLine: MATH_ARCHIVE_WORKFLOW_LINE,
     // childOwner 裁剪用（审计 L1）：这个会话当前仍"可能再发 subagent/end"的 child
     // = 在册子代理 + 任何任务正在等的那几个。
     referencedChildIds: function () {
@@ -3804,7 +5005,7 @@ export function apply(ctx) {
   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' } }), 'vibe_math_set_params')
+  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' }, leanAsync: { type: 'boolean' }, leanJobsMaxParallel: { type: 'integer' }, leanInitiative: { type: 'string', enum: ['off', 'normal', 'eager'] }, leanSearchPaths: { type: 'array', items: { type: 'string' } }, mathComputation: { type: 'string', enum: ['off', 'auto', 'on'] }, mathMode: { type: 'string', enum: ['typed', 'typed+shell'] }, mathEngines: { type: 'array', items: { type: 'string' } }, mathTimeoutMs: { type: 'integer' }, mathPackages: { type: 'array', items: { type: 'string' } }, mathInstallScope: { type: 'string', enum: ['user', 'system'] }, 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')
@@ -3832,12 +5033,21 @@ export function apply(ctx) {
   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')
+  registerTool('vibe_math_lean_read', TOOL_DESC.vibe_math_lean_read, objParams({ name: { type: 'string' }, kind: { type: 'string', enum: ['auto', 'lib', 'proved'] } }, ['name']), 'vibe_math_lean_read')
+  registerTool('vibe_math_lean_job', TOOL_DESC.vibe_math_lean_job, objParams({ jobId: { type: 'string' }, waitMs: { type: 'integer' } }), 'vibe_math_lean_job')
+
+  // ── math_computation：apply 层（工具面）────────────────────────────────────────────────────
+  // 共享模块的 handler 在**会话层**构造（闭包住该会话的 params/Paths/fs）；这一层只把工具名/描述/schema
+  // 挂到宿主工具面，执行时由 apply 级包装按 handlerName 路由回 s.handlers['math_computation']。
+  // **字面量形态**（与 audit-v3-registration-parity.mjs 的扫描器约定一致）：名字字面量 +
+  // TOOL_DESC.math_computation + MATH_TOOL_SCHEMA，两条路径的描述/schema 因此逐字相同。
+  registerTool('math_computation', TOOL_DESC.math_computation, MATH_TOOL_SCHEMA, 'math_computation')
 
   // /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 [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]' },
+    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' }) }
@@ -3892,14 +5102,29 @@ export function apply(ctx) {
   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)
+    return () => {
+      clearInterval(t)
+      // 卸载/销毁：终止在跑的编译并标记 interrupted（不留孤儿进程，spec §2.5）。
+      for (const s of sessions.values()) {
+        try { if (typeof s.disposeLeanJobs === 'function') s.disposeLeanJobs() } catch (e) { console.error('vibe-math-v3: lean dispose failed: ' + String((e && e.message) || e)) }
+      }
+    }
   }
   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(() => {
     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() }
+      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)) })
+        // Lean 异步队列（spec §2.2）：独立于 scheduler.running；runLeanQueue() 内部不 await 编译。
+        if (typeof s.runLeanQueue === 'function') s.runLeanQueue().catch(function (e) { console.error('vibe-math-v3: lean queue failed: ' + String((e && e.message) || e)) })
+        // 数学计算的探测缓存 TTL 刷新（15 分钟或从未探测过）：mathWorkLine 只读缓存，不能自己 await。
+        if (typeof s.mathProbeDue === 'function' && s.mathProbeDue()) s.refreshMathProbe(false).catch(function (e) { console.error('vibe-math-v3: math probe 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)) }
@@ -3921,6 +5146,316 @@ 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() : ''
+}
+
+/** 搜索路径 flag：收敛成一个常量（不同 Lean 版本拼写可能不同，改这里即可，接口不变）。 */
+const LEAN_SEARCH_PATH_FLAG = '--search-path'
+/** 用户已显式给出搜索路径就不再注入（显式覆盖优先）。 */
+function hasLeanSearchFlag(args) {
+  return (Array.isArray(args) ? args : []).some(function (a) {
+    const s = String(a)
+    return s === LEAN_SEARCH_PATH_FLAG || s.indexOf(LEAN_SEARCH_PATH_FLAG + '=') === 0 || s === '-R' || s === '--root'
+  })
+}
+/**
+ * 搜索路径注入计划（修订 §2）：用户 leanArgs 已显式给过 ⇒ 什么都不注入（显式覆盖优先）；
+ * 否则**先注入用户给的 leanSearchPaths，再注入自动根**，去重且保持顺序。
+ */
+function leanSearchPathPlan(userArgs, extraPaths, autoRoot) {
+  const args = Array.isArray(userArgs) ? userArgs.map(String) : []
+  if (hasLeanSearchFlag(args)) return { inject: [], paths: [], explicit: true }
+  const out = []
+  const seen = {}
+  const add = function (p) {
+    const s = String(p == null ? '' : p).trim()
+    if (!s || seen[s]) return
+    seen[s] = true
+    out.push(s)
+  }
+  for (const p of (Array.isArray(extraPaths) ? extraPaths : [])) add(p)
+  add(autoRoot)
+  const inject = []
+  for (const p of out) { inject.push(LEAN_SEARCH_PATH_FLAG, p) }
+  return { inject: inject, paths: out, explicit: false }
+}
+/** 规范化文本：换行统一 \n、去行尾空白、去尾部空行——内容哈希只反映语义内容。 */
+function normalizeLeanText(t) {
+  return String(t == null ? '' : t).replace(/\r\n?/g, '\n').replace(/[ \t]+$/gm, '').replace(/\n+$/, '') + '\n'
+}
+/** 内容 sha256（归档去重与作业幂等的键）。 */
+function leanContentSha(t) { return createHash('sha256').update(normalizeLeanText(t), 'utf8').digest('hex') }
+/**
+ * 构建上下文（修订 §4）：同一段代码在不同引擎/参数/搜索路径下结果可能不同，
+ * 所以"已通过"的判定必须绑定**构建上下文**，不能只看内容。
+ */
+function leanBuildContext(engine, args, searchPaths) {
+  return JSON.stringify({
+    engine: String(engine == null ? '' : engine),
+    args: (Array.isArray(args) ? args : []).map(String),
+    searchPaths: (Array.isArray(searchPaths) ? searchPaths : []).map(String),
+  })
+}
+/** 作业指纹 = sha256(内容 + 构建上下文)（修订 §4：jobId 取它的前 12 位）。 */
+function leanJobFingerprint(contentText, buildCtx) {
+  return createHash('sha256').update(normalizeLeanText(contentText) + '\n' + String(buildCtx || ''), 'utf8').digest('hex')
+}
+/** jobId = `<target|name>-<指纹[0:12]>`：同一内容 + 同一构建上下文天然只有一个作业。 */
+function leanJobId(key, fingerprint) {
+  const k = String(key == null ? '' : key).replace(/[^A-Za-z0-9_.-]/g, '_').replace(/^_+|_+$/g, '').slice(0, 60) || 'job'
+  return k + '-' + String(fingerprint == null ? '' : fingerprint).slice(0, 12)
+}
+/** "已落地且通过"的**唯一**判据：state=settled 且 exit 0 且未超时未中断（内容哈希由 settle 校验）。 */
+function leanJobSettledOk(rec) { return !!rec && rec.state === 'settled' && rec.exitCode === 0 && !rec.timedOut && !rec.interrupted }
+/** 主动性档位（修订 §1）：与"验证时的要求强度"（formalVerify）是两件事。 */
+const LEAN_INITIATIVE_MODES = ['off', 'normal', 'eager']
+
 export const __testHelpers = {
   uuid,
   shortId,
@@ -3948,6 +5483,37 @@ export const __testHelpers = {
   parseMethodMd,
   sanitizeToolFilter,
   registeredToolsFromError,
+  LEAN_INITIATIVE_MODES,
+  leanJobSettledOk,
+  leanJobId,
+  leanJobFingerprint,
+  leanBuildContext,
+  leanContentSha,
+  normalizeLeanText,
+  leanSearchPathPlan,
+  hasLeanSearchFlag,
+  LEAN_SEARCH_PATH_FLAG,
+  // 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() }
@@ -3968,7 +5534,7 @@ const TOOL_DESC = {
   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 工具链的调用方式。',
+  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 工具链的调用方式（框架会在用户 leanArgs 之后、文件名之前自动追加 --search-path <VibeMath 根>，用户已显式给出就不注入；leanSearchPaths 可附加额外搜索路径，先注入它们再注入自动根）；leanAsync = true（默认，后台队列：入队即返回，只有作业落地 ok 才置 passed 并写归档证明）| false（同步 await 的旧语义）；leanJobsMaxParallel = 后台编译并发上限（默认 1 = 串行）；leanInitiative = off|normal|eager 控制**日常的**形式化主动性（与 formalVerify 的验证要求强度是两件事）。最终论文：finalPaper（默认 true；收口时自动派遣一名「论文撰写」子代理）/ paperFormat = both|md|tex / paperLanguage = zh|en / paperCompilePdf（检测到 LaTeX 时编译 paper.pdf）/ paperLatexCommand（指定引擎，空 = 自动探测 xelatex→latexmk→pdflatex→lualatex→tectonic），产物在 Paper/<项目>/。数学计算（工具 math_computation，回执落在 Computation/<id>/）：mathComputation = off|auto|on（默认 auto；off 时提示词零提及）· mathMode = typed|typed+shell（默认 typed+shell；typed 时提示词不含 shell 兜底段且 cli 返回 REFUSED{reason:policy}）· mathEngines = 允许的引擎列表（默认含 cli，cli 默认开启）· mathTimeoutMs（默认 60000，最小 1000；到时主动 terminate）· mathPackages（需预检的包，缺包只报告+给安装计划）· mathInstallScope = user|system（默认 user；system 只对当次显式调用生效、永不记忆）。',
   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.',
@@ -3994,6 +5560,10 @@ const TOOL_DESC = {
   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.",
+  vibe_math_lean_read: '(member) Read back the original text of one archived Lean file (verbatim reuse). Only files under Formal/Lib and Formal/Proved are readable; name is id-sanitised and path escapes are rejected. Returns {ok,name,file,kind,sha256,bytes,text,truncated} (text capped at 64KB).',
+  vibe_math_lean_job: '(member) Read-only view of the background Lean compile jobs. Without jobId: the session job list (state/rel/target/attempts/paths). With jobId: that job state/exitCode/receipt + archive paths. waitMs>0 waits up to that many ms for a queued/running job to settle (polling; it does not block the heartbeat) and returns the current state on timeout. Only state=settled with exitCode=0 (same content hash AND same build context) counts as passed.',
+  // 数学计算：描述逐字来自共享模块的 MATH_TOOL_DESCRIPTION（四套一致，FREEZE §1）。
+  math_computation: MATH_TOOL_DESCRIPTION,
 }
 
 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 }