@a9i5k4/dsh-auto-memory 3.1.5 → 3.1.6

package/lib/rerank-host.js

@@ -1,5 +1,5 @@
 /**
- * rerank-host-pre —— P4 精排多级档位 + 有界异步窗口(2026-09-16, rerank_host_v1)。
+ * rerank-host-pre —— P4 精排多级档位 + 有界异步窗口(2026-09-16, rerank_host_pre_v1)。
  *
  * 权威依据: MASTER-PLAN-3.0.md §Phase 4 (H2 按实测重写) + TODO-GRAPH V2-P4 卡。
  * 实测推翻方案假设(留痕): bge-reranker-v2-m3 P95 37.4 秒(50 对/题, RSS 3.84GB);
@@ -22,14 +22,14 @@
  * 纯主机侧状态机, 模型调用经 opts.rerankFn 注入(测试可控), 零 fs/零网络。
  */
 
-export const RERANK_HOST_VERSION = 'rerank_host_v1'
+export const RERANK_HOST_VERSION = 'rerank_host_pre_v1'
 
 /** 有界异步窗口: 从入队起算(毫秒), 含排队与计算; 到期不续命。 */
-export const RERANK_WINDOW_MS_V1 = 60000
+export const RERANK_WINDOW_MS_PRE_V1 = 60000
 /** 登记的清理宽限: 超窗后仍允许 killFn 在此宽限内终止进程。 */
-export const RERANK_KILL_GRACE_MS_V1 = 5000
+export const RERANK_KILL_GRACE_MS_PRE_V1 = 5000
 /** 缓存上限(条): 有界结果缓存, LRU 逐出。 */
-export const RERANK_CACHE_MAX_V1 = 16
+export const RERANK_CACHE_MAX_PRE_V1 = 16
 
 /** 档位解析: 'off'/'fast'/'enthusiast' 之外一律按 off(fail closed)。 */
 export function resolveRerankTierPre(raw) {
@@ -79,7 +79,7 @@ export function createRerankHostPre(opts = {}) {
   function pruneExpired() {
     const t = now()
     for (const [k, v] of cache) {
-      if (t - v.at > RERANK_WINDOW_MS_V1) { cache.delete(k); stats.expiredDrops++ }
+      if (t - v.at > RERANK_WINDOW_MS_PRE_V1) { cache.delete(k); stats.expiredDrops++ }
     }
   }
 
@@ -100,7 +100,7 @@ export function createRerankHostPre(opts = {}) {
     if (typeof opts.rerankFn !== 'function') { stats.tierRejects++; return { mode: 'skip', reason: 'no-worker' } }
     const inputKey = computeRerankInputKeyPre({ query, orderedIds, memoryIndexVersion })
     const hit = cache.get(inputKey)
-    if (hit && now() - hit.at <= RERANK_WINDOW_MS_V1) {
+    if (hit && now() - hit.at <= RERANK_WINDOW_MS_PRE_V1) {
       // T5-4R: 复用前调用方必须重跑当轮状态/fv2/冷却/预算检查 — 本模块只担保 inputKey 完全匹配。
       stats.reused++
       return { mode: 'reuse', scores: hit.scores, inputKey }
@@ -115,10 +115,10 @@ export function createRerankHostPre(opts = {}) {
       .then(() => opts.rerankFn({ query, ordered: Array.isArray(orderedIds) ? orderedIds.map(String) : [] }))
       .then((scores) => {
         // 到期不续命: 完成时已超窗 ⇒ 丢弃(没有下一轮就过期, 不制造请求)。
-        if (now() - startedAt > RERANK_WINDOW_MS_V1) { stats.expiredDrops++; return }
+        if (now() - startedAt > RERANK_WINDOW_MS_PRE_V1) { stats.expiredDrops++; return }
         // 缓存条目记入队时刻(卡内口径: 窗口从入队起算, 不是完成时刻 — 否则慢计算等于续命)。
         cache.set(inputKey, { at: startedAt, scores: Array.isArray(scores) ? scores : [] })
-        if (cache.size > RERANK_CACHE_MAX_V1) {
+        if (cache.size > RERANK_CACHE_MAX_PRE_V1) {
           const oldest = [...cache.entries()].sort((a, b) => a[1].at - b[1].at)[0]
           if (oldest) cache.delete(oldest[0])
         }
@@ -143,7 +143,7 @@ export function createRerankHostPre(opts = {}) {
 
   /** 是否存在超窗未完成的运行任务(调用方据此在宽限内 kill)。 */
   function isRunningBeyondWindowPre() {
-    return !!(running && now() - running.startedAt > RERANK_WINDOW_MS_V1 + RERANK_KILL_GRACE_MS_V1)
+    return !!(running && now() - running.startedAt > RERANK_WINDOW_MS_PRE_V1 + RERANK_KILL_GRACE_MS_PRE_V1)
   }
 
   function debugView() {
@@ -152,7 +152,7 @@ export function createRerankHostPre(opts = {}) {
       version: RERANK_HOST_VERSION, tier: resolved.tier, active: resolved.active,
       running: running ? { inputKey: running.inputKey, elapsedMs: now() - running.startedAt, beyondWindow: isRunningBeyondWindowPre() } : null,
       cacheSize: cache.size, stats,
-      windowMs: RERANK_WINDOW_MS_V1, killGraceMs: RERANK_KILL_GRACE_MS_V1,
+      windowMs: RERANK_WINDOW_MS_PRE_V1, killGraceMs: RERANK_KILL_GRACE_MS_PRE_V1,
     }
   }
 

package/lib/rules-edit.js

@@ -34,13 +34,13 @@
  */
 
 /** 日期段标题（与 rules-layer.js 的 DATE_SECTION_RE 同口径）。 */
-export const RULE_DATE_SECTION_RE_V1 = /^##\s*\d{4}-\d{2}-\d{2}\s*$/
+export const RULE_DATE_SECTION_RE_PRE_V1 = /^##\s*\d{4}-\d{2}-\d{2}\s*$/
 
 /** 条目行：允许前导缩进 + `- `（渲染器同样只看 `- ` 行）。 */
-export const RULE_ITEM_RE_V1 = /^(\s*)-\s+(.*)$/
+export const RULE_ITEM_RE_PRE_V1 = /^(\s*)-\s+(.*)$/
 
 /** 单条规则长度上限（与写闸门同量级，防止一次塞进整篇文档）。 */
-export const RULE_ITEM_MAX_CHARS_V1 = 2000
+export const RULE_ITEM_MAX_CHARS_PRE_V1 = 2000
 
 /**
  * 列出所有规则条目（**行号从 0 开始**，供后续增删改定位）。
@@ -54,8 +54,8 @@ export function listRuleItemsPre(text) {
   let curDate = null
   for (let i = 0; i < lines.length; i++) {
     const l = lines[i]
-    if (RULE_DATE_SECTION_RE_V1.test(l)) { curDate = l.replace(/^##\s*/, '').trim(); continue }
-    const m = RULE_ITEM_RE_V1.exec(l)
+    if (RULE_DATE_SECTION_RE_PRE_V1.test(l)) { curDate = l.replace(/^##\s*/, '').trim(); continue }
+    const m = RULE_ITEM_RE_PRE_V1.exec(l)
     if (!m) continue
     const body = m[2].trim()
     if (!body) continue
@@ -86,7 +86,7 @@ export function updateRuleItemPre(text, idx, nextBody) {
   const body = String(nextBody == null ? '' : nextBody).trim()
   if (!Number.isInteger(idx) || idx < 0 || idx >= items.length) return { ok: false, error: 'index-out-of-range' }
   if (!body) return { ok: false, error: 'empty-body' }
-  if (body.length > RULE_ITEM_MAX_CHARS_V1) return { ok: false, error: 'too-long' }
+  if (body.length > RULE_ITEM_MAX_CHARS_PRE_V1) return { ok: false, error: 'too-long' }
   if (/\r|\n/.test(body)) return { ok: false, error: 'multiline-not-allowed' }
   const lines = splitLinesPre(text)
   const it = items[idx]
@@ -118,7 +118,7 @@ export function removeRuleItemPre(text, idx) {
 export function appendRuleItemPre(text, body, opts = {}) {
   const b = String(body == null ? '' : body).trim()
   if (!b) return { ok: false, error: 'empty-body' }
-  if (b.length > RULE_ITEM_MAX_CHARS_V1) return { ok: false, error: 'too-long' }
+  if (b.length > RULE_ITEM_MAX_CHARS_PRE_V1) return { ok: false, error: 'too-long' }
   if (/\r|\n/.test(b)) return { ok: false, error: 'multiline-not-allowed' }
   const lines = splitLinesPre(text)
   const want = opts && opts.dateSection ? String(opts.dateSection).trim() : ''
@@ -133,11 +133,11 @@ export function appendRuleItemPre(text, body, opts = {}) {
   // 找目标日期段，插到该段内最后一个非空行之后
   let secAt = -1
   for (let i = 0; i < lines.length; i++) {
-    if (RULE_DATE_SECTION_RE_V1.test(lines[i]) && lines[i].replace(/^##\s*/, '').trim() === want) { secAt = i; break }
+    if (RULE_DATE_SECTION_RE_PRE_V1.test(lines[i]) && lines[i].replace(/^##\s*/, '').trim() === want) { secAt = i; break }
   }
   if (secAt < 0) return { ok: false, error: 'date-section-not-found' }
   let end = secAt + 1
-  while (end < lines.length && !RULE_DATE_SECTION_RE_V1.test(lines[end])) end++
+  while (end < lines.length && !RULE_DATE_SECTION_RE_PRE_V1.test(lines[end])) end++
   let ins = end
   while (ins > secAt + 1 && lines[ins - 1].trim() === '') ins--
   lines.splice(ins, 0, newLine)

package/lib/rules-layer.js

@@ -1,5 +1,5 @@
 /**
- * 规则层抽取（rules_layer_v1）—— P6A 的"分类"部分（Phase 6 拆分中的 6A）。
+ * 规则层抽取（rules_layer_pre_v1）—— P6A 的"分类"部分（Phase 6 拆分中的 6A）。
  *
  * 2026-09-14 建立（P0 第五步）。**它解决的是用户最痛的病之一**：
  *   注入开场白原来把所有记忆统一降格为「只是背景事实与规则参考」（`lib/index.js` 的
@@ -38,7 +38,7 @@
  *   等价性由守卫 tests/smoke/smoke-test-p9-rules-lifecycle-pre.mjs 逐例对照断言。
  */
 
-export const RULES_LAYER_VERSION = 'rules_layer_v1'
+export const RULES_LAYER_VERSION = 'rules_layer_pre_v1'
 
 /**
  * ★P6B（2026-09-15 · 用户裁定开工）：日志行内 kind 标记 —— 规则分类的**持久化**落点。
@@ -50,18 +50,18 @@ export const RULES_LAYER_VERSION = 'rules_layer_v1'
  * 可被本模块的条目切分生态直接消费，且重启/迁移不丢（不依赖任何 sidecar）。
  * kind 作**可选参数**（缺省 fact）：不传时写入行与旧版逐字节一致（新旧并存 + 开关回退纪律）。
  */
-export const LOG_KINDS_V1 = Object.freeze(['rule', 'preference', 'fact', 'todo'])
+export const LOG_KINDS_PRE_V1 = Object.freeze(['rule', 'preference', 'fact', 'todo'])
 
 /** 行内标记的正则形态（渲染/解析两侧共用，不各写一套）。 */
-export const LOG_KIND_TAG_RE_V1 = /\s*\[kind:(rule|preference|fact|todo)\]\s*/
+export const LOG_KIND_TAG_RE_PRE_V1 = /\s*\[kind:(rule|preference|fact|todo)\]\s*/
 
 /** 结构化前缀（高置信）：既有用户级记忆的真实形态。 */
-export const RULE_MARKERS_V1 = Object.freeze([
+export const RULE_MARKERS_PRE_V1 = Object.freeze([
   '【用户硬性规则', '【硬性规则', '【规则】', '【必须遵守', '【禁止', '【用户规则',
 ])
 
 /** 约束语汇（中置信）—— 单靠它**不足以**判定为规则（见文件头 T7-4 说明）。 */
-export const RULE_CONSTRAINT_WORDS_V1 = Object.freeze([
+export const RULE_CONSTRAINT_WORDS_PRE_V1 = Object.freeze([
   '严禁', '绝不', '必须', '不得', '禁止', '务必', '一律', '永远不', '不要再', '不准',
 ])
 
@@ -70,7 +70,7 @@ export const RULE_CONSTRAINT_WORDS_V1 = Object.freeze([
  * **不是**当前有效的规则要求 ⇒ 降级为 `candidate`（待确认候选），不得自动取得不可裁地位。
  * 这是 v2 §3.3（Q7 第 2 条）给的反例在代码里的落点。
  */
-export const RULE_DESCRIPTION_MARKERS_V1 = Object.freeze([
+export const RULE_DESCRIPTION_MARKERS_PRE_V1 = Object.freeze([
   '据文档', '文档写着', '文档说', '曾经', '已取消', '已废弃', '不再要求', '原要求', '旧规则', '据说',
 ])
 
@@ -100,10 +100,10 @@ const clean = (s) => String(s == null ? '' : s)
  * 条目状态行语法（与 note-status.js **完全一致**；刻意内联见文件头 P9 说明）。
  * 只认整行、只认三态；非法 memoryId / 未知属性一律丢弃（fail-soft）。
  */
-const STATUS_LINE_RE_V1 = /^<!--\s*dsh-status:\s*(current|superseded|retracted)\s*((?:\w+=(?:"[^"]*"|[^\s"]+)\s*)*)-->$/
-const STATUS_ATTR_RE_V1 = /(\w+)=(?:"([^"]*)"|([^\s"]+))/g
-const MEM_ID_RE_V1 = /^mem_[0-9a-f]{32}$/
-const STATUS_REASON_MAX_V1 = 120
+const STATUS_LINE_RE_PRE_V1 = /^<!--\s*dsh-status:\s*(current|superseded|retracted)\s*((?:\w+=(?:"[^"]*"|[^\s"]+)\s*)*)-->$/
+const STATUS_ATTR_RE_PRE_V1 = /(\w+)=(?:"([^"]*)"|([^\s"]+))/g
+const MEM_ID_RE_PRE_V1 = /^mem_[0-9a-f]{32}$/
+const STATUS_REASON_MAX_PRE_V1 = 120
 
 /**
  * 从条目正文解析状态：**最后一个**状态行胜出（口径同 note-status.js 的 statusOfBodyPre）。
@@ -114,17 +114,17 @@ const STATUS_REASON_MAX_V1 = 120
 export function statusOfEntryPre(body) {
   const lines = clean(body).split(/\r?\n/)
   for (let i = lines.length - 1; i >= 0; i--) {
-    const m = STATUS_LINE_RE_V1.exec(lines[i].trim())
+    const m = STATUS_LINE_RE_PRE_V1.exec(lines[i].trim())
     if (!m) continue
     const out = { status: m[1] }
-    STATUS_ATTR_RE_V1.lastIndex = 0
+    STATUS_ATTR_RE_PRE_V1.lastIndex = 0
     let a
-    while ((a = STATUS_ATTR_RE_V1.exec(m[2] || '')) !== null) {
+    while ((a = STATUS_ATTR_RE_PRE_V1.exec(m[2] || '')) !== null) {
       const k = a[1]
       const v = a[2] !== undefined ? a[2] : a[3]
-      if (k === 'by') { if (MEM_ID_RE_V1.test(String(v || ''))) out.supersededBy = String(v) }
+      if (k === 'by') { if (MEM_ID_RE_PRE_V1.test(String(v || ''))) out.supersededBy = String(v) }
       else if (k === 'reason') {
-        const r = String(v || '').replace(/[\r\n]+/g, ' ').trim().slice(0, STATUS_REASON_MAX_V1)
+        const r = String(v || '').replace(/[\r\n]+/g, ' ').trim().slice(0, STATUS_REASON_MAX_PRE_V1)
         if (r) out.reason = r
       }
     }
@@ -141,7 +141,7 @@ export function statusOfEntryPre(body) {
 export function stripStatusLinesPre(body) {
   const s = clean(body)
   if (!s.includes('<!-- dsh-status:')) return s
-  return s.split(/\r?\n/).filter((ln) => STATUS_LINE_RE_V1.exec(ln.trim()) === null).join('\n')
+  return s.split(/\r?\n/).filter((ln) => STATUS_LINE_RE_PRE_V1.exec(ln.trim()) === null).join('\n')
 }
 
 /**
@@ -177,13 +177,13 @@ export function splitMemoryEntriesPre(text) {
 function classifyText(rawText) {
   const text = clean(rawText)
   if (!text.trim()) return { kind: 'reference', confidence: 'none', reasons: ['空内容'] }
-  const marker = RULE_MARKERS_V1.find((k) => text.includes(k))
+  const marker = RULE_MARKERS_PRE_V1.find((k) => text.includes(k))
   if (marker) {
     return { kind: 'rule', confidence: 'high', reasons: ['结构化前缀 ' + marker] }
   }
-  const words = RULE_CONSTRAINT_WORDS_V1.filter((w) => text.includes(w))
+  const words = RULE_CONSTRAINT_WORDS_PRE_V1.filter((w) => text.includes(w))
   if (!words.length) return { kind: 'reference', confidence: 'none', reasons: ['无规则标记与约束语汇'] }
-  const desc = RULE_DESCRIPTION_MARKERS_V1.filter((w) => text.includes(w))
+  const desc = RULE_DESCRIPTION_MARKERS_PRE_V1.filter((w) => text.includes(w))
   if (desc.length) {
     // ★ v2 修正的落点：含"必须"但是**描述/引文**，不得自动升级为规则
     return {
@@ -303,7 +303,7 @@ export function ruleSummaryPre(text, max = 200) {
     // 去掉列表前缀再返回，保持一条一行
     let body = l.replace(/^[-*+]\s+/, '')
     // ★P6B：剥行内 kind 标记与前置时间戳（只影响渲染，不回写盘上原文）
-    body = body.replace(LOG_KIND_TAG_RE_V1, ' ').trim()
+    body = body.replace(LOG_KIND_TAG_RE_PRE_V1, ' ').trim()
     body = body.replace(/^\d{1,2}:\d{2}\s+/, '').trim()
     if (!body) continue
     return body.length > max ? body.slice(0, Math.max(1, max - 1)) + '…' : body
@@ -327,8 +327,8 @@ export function renderRulesSectionPre(rules, opts = {}) {
   const r = rules && typeof rules === 'object' ? rules : {}
   const list = Array.isArray(r.rules) ? r.rules : []
   if (!list.length) return { text: '', chars: 0, guide: '' }
-  const title = clean((opts && opts.title) || RULES_SECTION_TITLE_V1)
-  const guide = clean((opts && opts.guide) || RULES_SECTION_GUIDE_V1)
+  const title = clean((opts && opts.title) || RULES_SECTION_TITLE_PRE_V1)
+  const guide = clean((opts && opts.guide) || RULES_SECTION_GUIDE_PRE_V1)
   // ★P9：空摘要**不渲染**（旧写法会产出裸 "- " 行；放宽小节标记后更易出现）
   const rows = list.map((x) => '- ' + ruleSummaryPre(x.text)).filter((r) => r !== '- ')
   if (!rows.length) return { text: '', chars: 0, guide: '' }
@@ -340,13 +340,13 @@ export function renderRulesSectionPre(rules, opts = {}) {
  * 规则段标题（T7-3：与参考段的措辞**必须不同**；断言直接比对两者）。
  * 用户可通过 `promptLayerOverrides.snapshotRulesTitle` 覆盖。
  */
-export const RULES_SECTION_TITLE_V1 = '[规则 — 用户级硬性约束 · 必须遵守]'
+export const RULES_SECTION_TITLE_PRE_V1 = '[规则 — 用户级硬性约束 · 必须遵守]'
 
 /**
  * 规则段引导语：**约束语**（"以下为必须遵守的约束"），不是"只是参考"。
  * 这句话就是 P6A「措辞」要修的病：旧开场白把规矩与资料统一降格为「只是背景事实与规则参考」。
  */
-export const RULES_SECTION_GUIDE_V1 = '以下条目是用户明确要求长期遵守的约束，不是可选背景。凡与其它内容冲突，以本节为准；无法满足时必须显式说明。'
+export const RULES_SECTION_GUIDE_PRE_V1 = '以下条目是用户明确要求长期遵守的约束，不是可选背景。凡与其它内容冲突，以本节为准；无法满足时必须显式说明。'
 
 /** 参考段引导语（保留"参考"语义，与规则段措辞不同）。 */
-export const REFERENCE_SECTION_GUIDE_V1 = '以下为背景资料与历史记录，供参考与检索定位；与上面的规则冲突时不适用。'
+export const REFERENCE_SECTION_GUIDE_PRE_V1 = '以下为背景资料与历史记录，供参考与检索定位；与上面的规则冲突时不适用。'

package/lib/semantic-decide.js

@@ -1,8 +1,8 @@
 /**
- * JS 端激活判定核(js_activation_decide_v1) —— 2026-08-27 补全 JS 默认闭环。
+ * JS 端激活判定核(js_activation_decide_pre_v1) —— 2026-08-27 补全 JS 默认闭环。
  *
- * 与 Python m7_activation_features_v2.decide_activation_v2 逐字段对齐:
- *  - 意图头:char_wb 2-4gram + sublinear TF-IDF + L2 归一 + LR + Platt(读 recall_intent_lr_v1.json)
+ * 与 Python m7_activation_features_pre_v2.decide_activation_v2 逐字段对齐:
+ *  - 意图头:char_wb 2-4gram + sublinear TF-IDF + L2 归一 + LR + Platt(读 recall_intent_lr_pre_v1.json)
  *  - 两车道:explicit(interrogative/recall-ctx) / proactive
  *  - echo veto / completeness / margin / delta 门 → decision(lane/reasonCodes 与 Python 一致)
  *
@@ -15,7 +15,7 @@
  */
 import { readFileSync } from 'node:fs'
 
-export const JS_ACTIVATION_DECIDE_VERSION = 'js_activation_decide_v1'
+export const JS_ACTIVATION_DECIDE_VERSION = 'js_activation_decide_pre_v1'
 
 // ---- token 常量(与 Python 逐字一致) ----
 const INTERROG = ['什么', '如何', '怎么', '哪些', '哪个', '为什么', '多少', '吗', '呢', '是不是', '对不对', '有没有', '怎么用', '怎么回事', '是什么', 'how', 'what', 'why', 'which', 'where', 'when']
@@ -108,7 +108,7 @@ function lexicalContainment(queryText, candidateText) {
   return hit / q.size
 }
 
-/** 意图头(读 recall_intent_lr_v1.json,与 Python RecallIntentHead 对齐)。 */
+/** 意图头(读 recall_intent_lr_pre_v1.json,与 Python RecallIntentHead 对齐)。 */
 function createRecallIntentHead(artifact) {
   const fs = artifact.featureSchema
   const vf = fs && fs.vectorizer
@@ -249,8 +249,8 @@ export function decideActivationV2(features, head, policy) {
 
 function pack(features, policy, snapshot, decision, reasonCodes, lane) {
   return {
-    featurePolicyVersion: (policy && policy.policyVersion) || 'activation_policy_v2',
-    activationPolicyVersion: (policy && policy.policyVersion) || 'activation_policy_v2',
+    featurePolicyVersion: (policy && policy.policyVersion) || 'activation_policy_pre_v2',
+    activationPolicyVersion: (policy && policy.policyVersion) || 'activation_policy_pre_v2',
     decision,
     reasonCodes,
     advisoryOnly: null,

package/lib/semantic-js.js

@@ -1,5 +1,5 @@
 /**
- * C2 内置语义引擎宿主(js_semantic_engine_v1)+ 资产下载器(js_semantic_dl_v1)。
+ * C2 内置语义引擎宿主(js_semantic_engine_pre_v1)+ 资产下载器(js_semantic_dl_pre_v1)。
  * 2026-08-26 用户裁定:C2 是默认主路径,本模块把 js-semantic-trial 试验模块接入生产。
  *
  * 组成:
@@ -20,10 +20,10 @@ import path from 'node:path'
 import { resolveDshHomePre } from './dsh-home.js'
 import { homedir } from 'node:os'
 
-export const JS_SEMANTIC_ENGINE_VERSION = 'js_semantic_engine_v1'
-export const JS_SEMANTIC_DL_VERSION = 'js_semantic_dl_v1'
+export const JS_SEMANTIC_ENGINE_VERSION = 'js_semantic_engine_pre_v1'
+export const JS_SEMANTIC_DL_VERSION = 'js_semantic_dl_pre_v1'
 /** D6 冻结融合权重(与 worker DEFAULT_SEARCH_POLICY 一致)。 */
-export const D6_FUSION_WEIGHTS_V1 = Object.freeze({ dense: 0.7, lexical: 0.3 })
+export const D6_FUSION_WEIGHTS_PRE_V1 = Object.freeze({ dense: 0.7, lexical: 0.3 })
 
 // ========== 1) D6 minmax 融合(纯函数) ==========
 
@@ -58,7 +58,7 @@ export function fuseD6Pre(pairs) {
         memoryId: p.memoryId,
         denseN,
         lexN,
-        fused: D6_FUSION_WEIGHTS_V1.dense * denseN + D6_FUSION_WEIGHTS_V1.lexical * lexN,
+        fused: D6_FUSION_WEIGHTS_PRE_V1.dense * denseN + D6_FUSION_WEIGHTS_PRE_V1.lexical * lexN,
       }
     })
     .sort((x, y) => (y.fused !== x.fused ? y.fused - x.fused : (x.memoryId < y.memoryId ? -1 : 1)))
@@ -381,7 +381,7 @@ export function createJsSemanticEnginePre(opts = {}) {
     async rank(corpusSnap, queryText) {
       try {
         const miv = String((corpusSnap && corpusSnap.memoryIndexVersion) || '')
-        if (!miv || !/^idx_[0-9a-f]{32}$/.test(miv)) return null
+        if (!miv || !/^idx_pre_[0-9a-f]{32}$/.test(miv)) return null
         const t = await ensureTier()
         const built = await buildIndexIfStale(miv, corpusSnap && corpusSnap.records)
         if (!built.entries.length) return { miv, scores: new Map() }
@@ -425,22 +425,22 @@ function clean(t) {
 // ========== 3) 资产下载器 ==========
 
 /** 资产清单:SHA256 于 2026-08-26 从已验证开发树副本冻结(Xenova/multilingual-e5-small q8)。 */
-const E5_SMALL_Q8_FILES_V1 = Object.freeze([
+const E5_SMALL_Q8_FILES_PRE_V1 = Object.freeze([
   Object.freeze({ rel: 'multilingual-e5-small/onnx/model_quantized.onnx', bytes: 118308185, sha256: 'f80102d3f2a1229f387d3c81909990d8945513e347b0eab049f7de3c6f98c193' }),
   Object.freeze({ rel: 'multilingual-e5-small/tokenizer.json', bytes: 17082730, sha256: '0b44a9d7b51c3c62626640cda0e2c2f70fdacdc25bbbd68038369d14ebdf4c39' }),
   Object.freeze({ rel: 'multilingual-e5-small/config.json', bytes: 658, sha256: 'cb99455288675345e1a4f411438d5d0adbba5fbd3a67ea4fb03c015433b996c1' }),
   Object.freeze({ rel: 'multilingual-e5-small/special_tokens_map.json', bytes: 167, sha256: 'd05497f1da52c5e09554c0cd874037a083e1dc1b9cfd48034d1c717f1afc07a7' }),
   Object.freeze({ rel: 'multilingual-e5-small/tokenizer_config.json', bytes: 443, sha256: 'a1d6bc8734a6f635dc158508bef000f8e2e5a759c7d92f984b2c86e5ff53425b' }),
 ])
-export const E5_SMALL_Q8_MANIFEST_V1 = Object.freeze({
+export const E5_SMALL_Q8_MANIFEST_PRE_V1 = Object.freeze({
   model: E5_MODELS_SUBDIR,
   dtype: 'q8',
-  files: E5_SMALL_Q8_FILES_V1,
-  totalBytes: E5_SMALL_Q8_FILES_V1.reduce((s, f) => s + f.bytes, 0),
+  files: E5_SMALL_Q8_FILES_PRE_V1,
+  totalBytes: E5_SMALL_Q8_FILES_PRE_V1.reduce((s, f) => s + f.bytes, 0),
 })
 
 /** 双通道:cn=hf-mirror(国内可达)/ intl=huggingface 官方。auto=国内优先(用户群主体)。 */
-export const SEMANTIC_DL_MIRRORS_V1 = Object.freeze({
+export const SEMANTIC_DL_MIRRORS_PRE_V1 = Object.freeze({
   cn: 'https://hf-mirror.com/Xenova/multilingual-e5-small/resolve/main/',
   intl: 'https://huggingface.co/Xenova/multilingual-e5-small/resolve/main/',
 })
@@ -451,7 +451,7 @@ export const SEMANTIC_DL_MIRRORS_V1 = Object.freeze({
  */
 export function createSemanticDownloaderPre(opts = {}) {
   const modelsRoot = String(opts.modelsRoot || '')
-  const manifest = opts.manifest || E5_SMALL_Q8_MANIFEST_V1
+  const manifest = opts.manifest || E5_SMALL_Q8_MANIFEST_PRE_V1
   const doFetch = opts.fetchImpl || ((u, o) => fetch(u, o))
   let st = { phase: 'idle', file: '', bytesDone: 0, bytesTotal: manifest.totalBytes, mirrorUsed: '', error: '', startedAt: 0 }
   let cancelFlag = false
@@ -525,7 +525,7 @@ export function createSemanticDownloaderPre(opts = {}) {
         if (cancelFlag) break
         try {
           setState({ mirrorUsed: m })
-          const r = await fetchToFile(f, SEMANTIC_DL_MIRRORS_V1[m])
+          const r = await fetchToFile(f, SEMANTIC_DL_MIRRORS_PRE_V1[m])
           const final = path.join(modelsRoot, f.rel)
           mkdirSync(path.dirname(final), { recursive: true })
           try { unlinkSync(final) } catch (_) {}

package/lib/shadow-host.js

@@ -1,3 +1,4 @@
+import { memoryDir } from './datadir.js'
 /**
  * M4-3 Host Shadow Wiring(docs/M4-CONTRACT.md §5/§14/§15/§17)。
  * 桥接 lib/index.js(M2 ContextObserver/M3 sidecar)与 M4-1 纯核心:
@@ -16,7 +17,7 @@ import { createHash } from 'node:crypto'
 import {
   validateSnapshot, buildQueryPlan, computeSignals, gatePreV1,
   lexicalSearch, buildCandidates, buildRetrievalId, replay as replayCore,
-  SHADOW_GATE_POLICY_V1, LEXICAL_POLICY_VERSION, GATE_POLICY_VERSION, NAMESPACE,
+  SHADOW_GATE_POLICY_PRE_V1, LEXICAL_POLICY_VERSION, GATE_POLICY_VERSION, NAMESPACE,
 } from './shadow-retrieval.js'
 import { buildSourceCatalog, loadCorpusSnapshot, CorpusRegistry, canonicalize } from './m4-corpus.js'
 
@@ -46,12 +47,12 @@ export function truncateAuditEvent(ev) {
  * 表放**模块级**而非闭包级：同进程多实例共享 ⇒ 不会各自持一份而双写。
  * 语义同 index.js 的 diagThrottled：首条立即透出，窗口内重复压掉。
  */
-const DIAG_THROTTLE_MS_V1 = 300000
+const DIAG_THROTTLE_MS_PRE_V1 = 300000
 const _diagAt = new Map()
 function shouldReportDiag(key) {
   try {
     const now = Date.now()
-    if (now - (Number(_diagAt.get(key)) || 0) < DIAG_THROTTLE_MS_V1) return false
+    if (now - (Number(_diagAt.get(key)) || 0) < DIAG_THROTTLE_MS_PRE_V1) return false
     _diagAt.set(key, now)
   } catch (_) { /* 计时失败不阻断上报 */ }
   return true
@@ -67,7 +68,7 @@ export function createShadowHost({ engine, onDiag = null, recallStats = null })
   const states = new WeakMap() // runtime → shadow state(lazy)
   const volatileRing = [] // ≤64 events(最小投影)
   const stats = { evaluated: 0, retrieved: 0, prefetched: 0, suppressed: 0, stale: 0, errors: 0 }
-  const registry = new CorpusRegistry({ sidecarDir: path.join(dshHome(), 'memory', 'index', 'files') })
+  const registry = new CorpusRegistry({ sidecarDir: path.join(memoryDir('index', dshHome), 'files') })
   let lastMemoryIndexVersion = null
   let lastCombo = null
   let enableEpoch = 0
@@ -155,7 +156,7 @@ export function createShadowHost({ engine, onDiag = null, recallStats = null })
   }
 
   /** durable audit 目录与日期分片。 */
-  function auditDir() { return path.join(dshHome(), 'memory', 'retrieval-pre', 'audit') }
+  function auditDir() { return path.join(memoryDir('retrieval', dshHome), 'audit') }
   function dshHome() {
     // ★#86-3：统一口径（M4-4 的「必须拼 .dsh」约定已由 resolveDshHomePre 保证）。
     return resolveDshHomeForEnginePre(engine)
@@ -291,7 +292,7 @@ export function createShadowHost({ engine, onDiag = null, recallStats = null })
         const dec = gatePreV1(snapshot, { previousLatch: st.latched, cooldownRemaining, signals: computeSignals(snapshot, qp, st.recentHits), queryPlan: qp })
         st.lastGate = { action: dec.action, hesitation: dec.hesitation, rawScore: dec.rawScore, latched: dec.latched }
         st.latched = dec.latched
-        st.cooldownUntilSegment = dec.action === 'retrieve' ? (st.processedSegmentCount + SHADOW_GATE_POLICY_V1.cooldownSegments) : st.cooldownUntilSegment
+        st.cooldownUntilSegment = dec.action === 'retrieve' ? (st.processedSegmentCount + SHADOW_GATE_POLICY_PRE_V1.cooldownSegments) : st.cooldownUntilSegment
         stats.evaluated++
         if (dec.action === 'suppress') { stats.suppressed++; pushSuppressed(dec, snapshot); return }
         // latest-wins abort