@modusensus/dsh-mneme 0.2.1 → 0.2.3

package/README.md

@@ -5,7 +5,7 @@
 [![npm version](https://img.shields.io/npm/v/@modusensus/dsh-mneme?color=blue&label=npm)](https://www.npmjs.com/package/@modusensus/dsh-mneme)
 [![license](https://img.shields.io/badge/license-MIT-green)](LICENSE)
 [![Awesome](https://awesome-dsh-plugin.com/badge.svg)](https://github.com/awesome-dsh-plugin/awesome-dsh-plugin)
-[![tests](https://img.shields.io/badge/tests-198%20passed-success)](https://github.com/modusensus/dsh-mneme)
+[![tests](https://img.shields.io/badge/tests-212%20passed-success)](https://github.com/modusensus/dsh-mneme)
 
 > 给 DeepSeek Harness 的跨会话记忆插件：让 Agent 记住你、记住项目、自动整理记忆。**Mneme**（Μνήμη）——希腊记忆女神 Mnemosyne 之名，掌管记忆与梦境，正如 autoDream 在后台巩固记忆。
 
@@ -38,13 +38,15 @@
 ### autoDream 自动记忆整理 🧠
 
 - **触发**：记忆数 > 10 或总字符 > 5000 时，异步自动触发（不阻塞写入）
-- **决策清单式整理**：LLM 输出 `keep` / `merge` / `archive` / `conflict` 决策清单，服务端校验后逐条应用
+- **决策清单式整理**：LLM 输出 `keep` / `merge` / `archive` / `conflict` / `update` 决策清单，服务端校验后逐条应用
   - `merge`：合并主题相近的条目，保留信息最完整者
   - `archive`：归档过时/冗余条目（可恢复，不物理删除）
   - `conflict`：裁决矛盾信息，胜者保留、败者归档并追加溯源注释
+  - `update`（v0.2.1）：直接修正单条记忆的过时/错误内容（单 id / 必须实际变化 / 非 summary / 24h 保护 / 每次 ≤2）
+- **失败追踪（v0.2.1）**：用户纠正记忆时写入 `failure_memories` 表（旧值/新值），为后续自进化积累数据
 - **摘要生成**：整理后生成"记忆库总览"（单一实例），作为下次会话的优先注入
 - **Fail-safe**：非法 LLM 输出（未知 id / 非法 action / 跨类型合并 / 越界 importance）拒绝整单，绝不破坏记忆库
-- **裁决审计**：每次运行写入 `dream_runs` 审计表（输入快照 sha256 digest + 完整输入快照 + 决策清单 + 逐 id 去向 + receipt），可离线回放；merge / conflict 幂等应用，重放/并发重复执行无累积副作用
+- **裁决审计**：每次运行写入 `dream_runs` 审计表（输入快照 sha256 digest + 完整输入快照 + 决策清单 + 逐 id 去向 + receipt），可离线回放；merge / conflict / update 幂等应用，重放/并发重复执行无累积副作用；update 记录 `_before` 快照
 
 ### Web 记忆面板
 
@@ -204,7 +206,7 @@ src/
 lib/
 ├── client.js         # Web 面板（手写 ModuleLoader bundle）
 └── *.js              # src 的同步分发产物
-test/                 # 198 个 node:test 测试（含审计与三轴线压测不变量）
+test/                 # 212 个 node:test 测试（含审计与三轴线压测不变量）
 scripts/              # e2e-dsh.js 端到端演示 · stress-dsh.js 三轴线压测 · sync-lib.js 同步
 ```
 
@@ -213,7 +215,7 @@ scripts/              # e2e-dsh.js 端到端演示 · stress-dsh.js 三轴线压
 ```bash
 cd dsh-mneme
 npm install        # 安装 peer 依赖（以 devDependencies 形式，用于本地测试）
-npm test           # 运行 198 个测试
+npm test           # 运行 212 个测试
 npm run stress     # 三轴线压测：长会话检索 / 冲突仲裁 / 多 Agent 并发（离线 mock LLM）
 npm run sync       # 把 src/ 同步到 lib/（发布时由 prepack 钩子自动执行）
 ```

package/lib/api.js

@@ -71,7 +71,15 @@ export function createApi(ctx, service, settings, commands, embedder, semantic =
         const url = new URL(req.url, "http://localhost");
         const q = url.searchParams.get("q") ?? "";
         const limit = Number(url.searchParams.get("limit") ?? 20);
-        // mode: auto (default) | keyword | vector | hybrid
+        // mode selects the recall strategy (defaults to auto):
+        //   auto    (default) keyword first, vector fills remaining slots
+        //   hybrid  vector first, keyword fills remaining slots; scores of
+        //           memories hit by both sides are weight-blended
+        //   vector  vector only, falls back to keyword when the vector path
+        //           is unavailable (no embedder or a throwing one)
+        //   keyword literal text only; never queries the embedder
+        // rerank=false disables the cross-encoder reorder for this request;
+        // the response `mode` field reports which path actually produced rows.
         const mode = url.searchParams.get("mode") ?? "auto";
         const rerank = url.searchParams.get("rerank") !== "false";
         const query = q.trim();

package/lib/dream/decisions.js

@@ -30,6 +30,36 @@ export function validateDecisions(decisions, snapshot, options = {}) {
       errors.push(`${at}: ${d.action} needs non-empty ids`);
       continue;
     }
+    // update-specific field validation runs BEFORE claiming ids, so a failing
+    // update never pollutes the claimed set (which drives the "every id must
+    // appear in a decision" check below).
+    if (d.action === "update") {
+      // 只能更新单条
+      if (!Array.isArray(d.ids) || d.ids.length !== 1) {
+        errors.push(`${at}: update must target exactly one id`);
+        continue;
+      }
+      // 必须产生实际变化
+      const mem = snapshot.get(d.ids[0]);
+      const hasChange = (d.title !== undefined && d.title !== mem?.title)
+        || (d.content !== undefined && d.content !== mem?.content)
+        || (d.importance !== undefined && d.importance !== mem?.importance);
+      if (!hasChange) {
+        errors.push(`${at}: update must change at least one field`);
+        continue;
+      }
+      // 不能更新 summary
+      if (mem?.type === "summary") {
+        errors.push(`${at}: cannot update summary via update action`);
+        continue;
+      }
+      // 保护期：新建记忆不可立即被 update（可配置）
+      const ageHours = (Date.now() - new Date(mem?.created_at).getTime()) / 3600000;
+      if (ageHours < minAgeHours) {
+        errors.push(`${at}: memory too young (< ${minAgeHours}h)`);
+        continue;
+      }
+    }
     for (const id of ids) {
       const mem = snapshot.get(id);
       if (!mem) {
@@ -59,33 +89,6 @@ export function validateDecisions(decisions, snapshot, options = {}) {
         errors.push(`${at}: merge ids span multiple types (${[...mergeTypes].join(", ")})`);
       }
     }
-    if (d.action === "update") {
-      // 只能更新单条
-      if (!Array.isArray(d.ids) || d.ids.length !== 1) {
-        errors.push(`${at}: update must target exactly one id`);
-        continue;
-      }
-      // 必须产生实际变化
-      const mem = snapshot.get(d.ids[0]);
-      const hasChange = (d.title !== undefined && d.title !== mem?.title)
-        || (d.content !== undefined && d.content !== mem?.content)
-        || (d.importance !== undefined && d.importance !== mem?.importance);
-      if (!hasChange) {
-        errors.push(`${at}: update must change at least one field`);
-        continue;
-      }
-      // 不能更新 summary
-      if (mem?.type === "summary") {
-        errors.push(`${at}: cannot update summary via update action`);
-        continue;
-      }
-      // 保护期：新建记忆不可立即被 update（可配置）
-      const ageHours = (Date.now() - new Date(mem?.created_at).getTime()) / 3600000;
-      if (ageHours < minAgeHours) {
-        errors.push(`${at}: memory too young (< ${minAgeHours}h)`);
-        continue;
-      }
-    }
   }
   // Cap update churn: too many edits in one cycle signals a runaway model
   const updateCount = decisions.filter((d) => d.action === "update").length;

package/lib/index.js

@@ -36,6 +36,11 @@ export const apply = (ctx, config) => {
   mkdirSync(memoryDir, { recursive: true });
 
   const store = createStore(join(memoryDir, "memory.db"));
+  // Prune reflection failure rows older than 90 days on boot (best-effort, so
+  // the failure table never grows unbounded).
+  try {
+    store.deleteOldFailures(new Date(Date.now() - 90 * 86400000).toISOString());
+  } catch { /* non-fatal */ }
   const mirror = createMirror(memoryDir);
   const service = createService({ store, mirror, config: cfg });
 

package/lib/service.js

@@ -284,17 +284,25 @@ export function createService({ store, mirror, config, onWrite }) {
       syncMirror();
       notifyWrite();
     },
-    update: (id, p) => {
+    update: (id, p, ctx = {}) => {
       const old = store.getById(id);
       const updated = store.update(id, p);
-      // Record a user correction (only when content actually changed and the
-      // reflection failure tracker is enabled): expected = what it became,
-      // actual = what it was before. Feeds later reflection/evolution passes.
-      if (old && updated && config.reflectionFailureTracking && old.content !== updated.content) {
+      // Record a user correction when any meaningful field changed and the
+      // reflection failure tracker is enabled. expected = what it became,
+      // actual = what it was before; query (when provided) captures the
+      // user's original intent so later reflection can reason about recall.
+      const hasMeaningfulChange = old && updated && (
+        old.content !== updated.content ||
+        old.title !== updated.title ||
+        old.importance !== updated.importance
+      );
+      if (hasMeaningfulChange && config.reflectionFailureTracking) {
         store.saveFailure({
           id: randomUUID(),
+          query: ctx.query ?? null,
           expected: updated.content,
           actual: old.content,
+          before: { title: old.title, content: old.content, importance: old.importance },
           failure_type: "user_correction",
           memory_id: id
         });

package/lib/store.js

@@ -42,13 +42,16 @@ CREATE TABLE IF NOT EXISTS dream_runs (
 CREATE INDEX IF NOT EXISTS idx_dream_runs_created ON dream_runs(created_at);
 
 -- failure_memories: records user corrections / reflection failures. Captures
--- what a memory was ("actual") vs what the user changed it to ("expected")
+-- what a memory was (actual) vs what the user changed it to (expected)
 -- so later reflection passes can mine recurring correction patterns.
+-- before holds a JSON snapshot of the pre-change title/content/importance,
+-- so a title-only or importance-only correction is still traceable.
 CREATE TABLE IF NOT EXISTS failure_memories (
   id           TEXT PRIMARY KEY,
   query        TEXT,
   expected     TEXT,
   actual       TEXT,
+  before       TEXT,
   failure_type TEXT NOT NULL,
   memory_id    TEXT,
   created_at   TEXT NOT NULL
@@ -405,13 +408,14 @@ export function createStore(path) {
    * Like the dream audit trail this is bookkeeping: it never triggers write
    * hooks, so reflection mining of failures cannot loop back into the writer.
    */
-  function saveFailure({ id, query, expected, actual, failure_type, memory_id }) {
+  function saveFailure({ id, query, expected, actual, before, failure_type, memory_id }) {
     const now = nowIso();
+    const beforeJson = before && typeof before === "object" ? JSON.stringify(before) : (before ?? null);
     db.prepare(
-      `INSERT INTO failure_memories (id, query, expected, actual, failure_type, memory_id, created_at)
-       VALUES (?, ?, ?, ?, ?, ?, ?)`
-    ).run(id ?? randomUUID(), query ?? null, expected ?? null, actual ?? null, failure_type, memory_id ?? null, now);
-    return { id, query, expected, actual, failure_type, memory_id, created_at: now };
+      `INSERT INTO failure_memories (id, query, expected, actual, before, failure_type, memory_id, created_at)
+       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`
+    ).run(id ?? randomUUID(), query ?? null, expected ?? null, actual ?? null, beforeJson, failure_type, memory_id ?? null, now);
+    return { id, query, expected, actual, before: before ?? null, failure_type, memory_id, created_at: now };
   }
 
   function listFailures({ limit = 50, offset = 0, since, memory_id, failure_type } = {}) {
@@ -423,7 +427,17 @@ export function createStore(path) {
     const where = clauses.length ? `WHERE ${clauses.join(" AND ")}` : "";
     const lim = Number.isInteger(limit) && limit > 0 ? limit : 50;
     const off = Number.isInteger(offset) && offset > 0 ? offset : 0;
-    return db.prepare(`SELECT * FROM failure_memories ${where} ORDER BY created_at DESC, id LIMIT ? OFFSET ?`).all(...params, lim, off);
+    return db.prepare(`SELECT * FROM failure_memories ${where} ORDER BY created_at DESC, id LIMIT ? OFFSET ?`).all(...params, lim, off)
+      .map((row) => {
+        let before;
+        try { before = row.before ? JSON.parse(row.before) : null; } catch { before = null; }
+        return { ...row, before };
+      });
+  }
+
+  /** Delete failure rows older than `before` (ISO string). Returns count removed. */
+  function deleteOldFailures(before) {
+    return db.prepare("DELETE FROM failure_memories WHERE created_at < ?").run(before).changes;
   }
 
   function getFailureStats({ since } = {}) {
@@ -459,6 +473,7 @@ export function createStore(path) {
     saveFailure,
     listFailures,
     getFailureStats,
+    deleteOldFailures,
     close() {
       db.close();
     }

package/lib/tools.js

@@ -133,7 +133,8 @@ export function createTools(ctx, service, config, embedder) {
         content: { type: "string" },
         type: { type: "string", enum: ["preference", "project", "decision", "history"] },
         tags: { type: "array", items: { type: "string" } },
-        importance: { type: "integer", description: "1-5" }
+        importance: { type: "integer", description: "1-5" },
+        reason: { type: "string", description: "Optional context for the correction (what the user actually said/wanted), recorded for reflection" }
       },
       output: {
         schema: {
@@ -160,7 +161,7 @@ export function createTools(ctx, service, config, embedder) {
           type: args.type,
           tags: args.tags,
           importance: args.importance
-        });
+        }, { query: args.reason });
         return { memory: { id: memory.id, title: memory.title, content: memory.content } };
       }
     }),

package/lib/vector-index.js

@@ -73,7 +73,7 @@ export function createVectorIndex({ store, logger }) {
 
     /** Re-embed every row missing an embedding. Returns indexed count. */
     async rebuildIndex(embedder, { limit = 1000 } = {}) {
-      if (!embedder || typeof embedder.embed !== "function") return { indexed: 0, skipped: 0 };
+      if (!embedder || typeof embedder.embedSingle !== "function") return { indexed: 0, skipped: 0 };
       const rows = store.needsEmbedding(limit);
       let indexed = 0;
       for (const row of rows) {

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@modusensus/dsh-mneme",
   "description": "Cross-session memory plugin for DeepSeek Harness with autoDream consolidation: SQLite store, Markdown mirrors, 6 model tools, automatic injection, session summarization, user profile/rules, custom slash commands, vector (semantic) search, and a Web GUI panel",
-  "version": "0.2.1",
+  "version": "0.2.3",
   "license": "MIT",
   "type": "module",
   "main": "lib/index.js",

package/src/api.js

@@ -71,7 +71,15 @@ export function createApi(ctx, service, settings, commands, embedder, semantic =
         const url = new URL(req.url, "http://localhost");
         const q = url.searchParams.get("q") ?? "";
         const limit = Number(url.searchParams.get("limit") ?? 20);
-        // mode: auto (default) | keyword | vector | hybrid
+        // mode selects the recall strategy (defaults to auto):
+        //   auto    (default) keyword first, vector fills remaining slots
+        //   hybrid  vector first, keyword fills remaining slots; scores of
+        //           memories hit by both sides are weight-blended
+        //   vector  vector only, falls back to keyword when the vector path
+        //           is unavailable (no embedder or a throwing one)
+        //   keyword literal text only; never queries the embedder
+        // rerank=false disables the cross-encoder reorder for this request;
+        // the response `mode` field reports which path actually produced rows.
         const mode = url.searchParams.get("mode") ?? "auto";
         const rerank = url.searchParams.get("rerank") !== "false";
         const query = q.trim();

package/src/dream/decisions.js

@@ -30,6 +30,36 @@ export function validateDecisions(decisions, snapshot, options = {}) {
       errors.push(`${at}: ${d.action} needs non-empty ids`);
       continue;
     }
+    // update-specific field validation runs BEFORE claiming ids, so a failing
+    // update never pollutes the claimed set (which drives the "every id must
+    // appear in a decision" check below).
+    if (d.action === "update") {
+      // 只能更新单条
+      if (!Array.isArray(d.ids) || d.ids.length !== 1) {
+        errors.push(`${at}: update must target exactly one id`);
+        continue;
+      }
+      // 必须产生实际变化
+      const mem = snapshot.get(d.ids[0]);
+      const hasChange = (d.title !== undefined && d.title !== mem?.title)
+        || (d.content !== undefined && d.content !== mem?.content)
+        || (d.importance !== undefined && d.importance !== mem?.importance);
+      if (!hasChange) {
+        errors.push(`${at}: update must change at least one field`);
+        continue;
+      }
+      // 不能更新 summary
+      if (mem?.type === "summary") {
+        errors.push(`${at}: cannot update summary via update action`);
+        continue;
+      }
+      // 保护期：新建记忆不可立即被 update（可配置）
+      const ageHours = (Date.now() - new Date(mem?.created_at).getTime()) / 3600000;
+      if (ageHours < minAgeHours) {
+        errors.push(`${at}: memory too young (< ${minAgeHours}h)`);
+        continue;
+      }
+    }
     for (const id of ids) {
       const mem = snapshot.get(id);
       if (!mem) {
@@ -59,33 +89,6 @@ export function validateDecisions(decisions, snapshot, options = {}) {
         errors.push(`${at}: merge ids span multiple types (${[...mergeTypes].join(", ")})`);
       }
     }
-    if (d.action === "update") {
-      // 只能更新单条
-      if (!Array.isArray(d.ids) || d.ids.length !== 1) {
-        errors.push(`${at}: update must target exactly one id`);
-        continue;
-      }
-      // 必须产生实际变化
-      const mem = snapshot.get(d.ids[0]);
-      const hasChange = (d.title !== undefined && d.title !== mem?.title)
-        || (d.content !== undefined && d.content !== mem?.content)
-        || (d.importance !== undefined && d.importance !== mem?.importance);
-      if (!hasChange) {
-        errors.push(`${at}: update must change at least one field`);
-        continue;
-      }
-      // 不能更新 summary
-      if (mem?.type === "summary") {
-        errors.push(`${at}: cannot update summary via update action`);
-        continue;
-      }
-      // 保护期：新建记忆不可立即被 update（可配置）
-      const ageHours = (Date.now() - new Date(mem?.created_at).getTime()) / 3600000;
-      if (ageHours < minAgeHours) {
-        errors.push(`${at}: memory too young (< ${minAgeHours}h)`);
-        continue;
-      }
-    }
   }
   // Cap update churn: too many edits in one cycle signals a runaway model
   const updateCount = decisions.filter((d) => d.action === "update").length;

package/src/index.js

@@ -36,6 +36,11 @@ export const apply = (ctx, config) => {
   mkdirSync(memoryDir, { recursive: true });
 
   const store = createStore(join(memoryDir, "memory.db"));
+  // Prune reflection failure rows older than 90 days on boot (best-effort, so
+  // the failure table never grows unbounded).
+  try {
+    store.deleteOldFailures(new Date(Date.now() - 90 * 86400000).toISOString());
+  } catch { /* non-fatal */ }
   const mirror = createMirror(memoryDir);
   const service = createService({ store, mirror, config: cfg });
 

package/src/service.js

@@ -284,17 +284,25 @@ export function createService({ store, mirror, config, onWrite }) {
       syncMirror();
       notifyWrite();
     },
-    update: (id, p) => {
+    update: (id, p, ctx = {}) => {
       const old = store.getById(id);
       const updated = store.update(id, p);
-      // Record a user correction (only when content actually changed and the
-      // reflection failure tracker is enabled): expected = what it became,
-      // actual = what it was before. Feeds later reflection/evolution passes.
-      if (old && updated && config.reflectionFailureTracking && old.content !== updated.content) {
+      // Record a user correction when any meaningful field changed and the
+      // reflection failure tracker is enabled. expected = what it became,
+      // actual = what it was before; query (when provided) captures the
+      // user's original intent so later reflection can reason about recall.
+      const hasMeaningfulChange = old && updated && (
+        old.content !== updated.content ||
+        old.title !== updated.title ||
+        old.importance !== updated.importance
+      );
+      if (hasMeaningfulChange && config.reflectionFailureTracking) {
         store.saveFailure({
           id: randomUUID(),
+          query: ctx.query ?? null,
           expected: updated.content,
           actual: old.content,
+          before: { title: old.title, content: old.content, importance: old.importance },
           failure_type: "user_correction",
           memory_id: id
         });

package/src/store.js

@@ -42,13 +42,16 @@ CREATE TABLE IF NOT EXISTS dream_runs (
 CREATE INDEX IF NOT EXISTS idx_dream_runs_created ON dream_runs(created_at);
 
 -- failure_memories: records user corrections / reflection failures. Captures
--- what a memory was ("actual") vs what the user changed it to ("expected")
+-- what a memory was (actual) vs what the user changed it to (expected)
 -- so later reflection passes can mine recurring correction patterns.
+-- before holds a JSON snapshot of the pre-change title/content/importance,
+-- so a title-only or importance-only correction is still traceable.
 CREATE TABLE IF NOT EXISTS failure_memories (
   id           TEXT PRIMARY KEY,
   query        TEXT,
   expected     TEXT,
   actual       TEXT,
+  before       TEXT,
   failure_type TEXT NOT NULL,
   memory_id    TEXT,
   created_at   TEXT NOT NULL
@@ -405,13 +408,14 @@ export function createStore(path) {
    * Like the dream audit trail this is bookkeeping: it never triggers write
    * hooks, so reflection mining of failures cannot loop back into the writer.
    */
-  function saveFailure({ id, query, expected, actual, failure_type, memory_id }) {
+  function saveFailure({ id, query, expected, actual, before, failure_type, memory_id }) {
     const now = nowIso();
+    const beforeJson = before && typeof before === "object" ? JSON.stringify(before) : (before ?? null);
     db.prepare(
-      `INSERT INTO failure_memories (id, query, expected, actual, failure_type, memory_id, created_at)
-       VALUES (?, ?, ?, ?, ?, ?, ?)`
-    ).run(id ?? randomUUID(), query ?? null, expected ?? null, actual ?? null, failure_type, memory_id ?? null, now);
-    return { id, query, expected, actual, failure_type, memory_id, created_at: now };
+      `INSERT INTO failure_memories (id, query, expected, actual, before, failure_type, memory_id, created_at)
+       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`
+    ).run(id ?? randomUUID(), query ?? null, expected ?? null, actual ?? null, beforeJson, failure_type, memory_id ?? null, now);
+    return { id, query, expected, actual, before: before ?? null, failure_type, memory_id, created_at: now };
   }
 
   function listFailures({ limit = 50, offset = 0, since, memory_id, failure_type } = {}) {
@@ -423,7 +427,17 @@ export function createStore(path) {
     const where = clauses.length ? `WHERE ${clauses.join(" AND ")}` : "";
     const lim = Number.isInteger(limit) && limit > 0 ? limit : 50;
     const off = Number.isInteger(offset) && offset > 0 ? offset : 0;
-    return db.prepare(`SELECT * FROM failure_memories ${where} ORDER BY created_at DESC, id LIMIT ? OFFSET ?`).all(...params, lim, off);
+    return db.prepare(`SELECT * FROM failure_memories ${where} ORDER BY created_at DESC, id LIMIT ? OFFSET ?`).all(...params, lim, off)
+      .map((row) => {
+        let before;
+        try { before = row.before ? JSON.parse(row.before) : null; } catch { before = null; }
+        return { ...row, before };
+      });
+  }
+
+  /** Delete failure rows older than `before` (ISO string). Returns count removed. */
+  function deleteOldFailures(before) {
+    return db.prepare("DELETE FROM failure_memories WHERE created_at < ?").run(before).changes;
   }
 
   function getFailureStats({ since } = {}) {
@@ -459,6 +473,7 @@ export function createStore(path) {
     saveFailure,
     listFailures,
     getFailureStats,
+    deleteOldFailures,
     close() {
       db.close();
     }

package/src/tools.js

@@ -133,7 +133,8 @@ export function createTools(ctx, service, config, embedder) {
         content: { type: "string" },
         type: { type: "string", enum: ["preference", "project", "decision", "history"] },
         tags: { type: "array", items: { type: "string" } },
-        importance: { type: "integer", description: "1-5" }
+        importance: { type: "integer", description: "1-5" },
+        reason: { type: "string", description: "Optional context for the correction (what the user actually said/wanted), recorded for reflection" }
       },
       output: {
         schema: {
@@ -160,7 +161,7 @@ export function createTools(ctx, service, config, embedder) {
           type: args.type,
           tags: args.tags,
           importance: args.importance
-        });
+        }, { query: args.reason });
         return { memory: { id: memory.id, title: memory.title, content: memory.content } };
       }
     }),

package/src/vector-index.js

@@ -73,7 +73,7 @@ export function createVectorIndex({ store, logger }) {
 
     /** Re-embed every row missing an embedding. Returns indexed count. */
     async rebuildIndex(embedder, { limit = 1000 } = {}) {
-      if (!embedder || typeof embedder.embed !== "function") return { indexed: 0, skipped: 0 };
+      if (!embedder || typeof embedder.embedSingle !== "function") return { indexed: 0, skipped: 0 };
       const rows = store.needsEmbedding(limit);
       let indexed = 0;
       for (const row of rows) {