opensquid 0.5.395

package/dist/rag/memory/consolidate.js

@@ -0,0 +1,77 @@
+/**
+ * Memory consolidation (retire-Rust RES-4b; port of engine compress.rs `consolidate`). The D2 safety
+ * contract: compress a window → Mc, VERIFY (recall-replay) that Mc preserves each predecessor's
+ * recall, and ONLY THEN force-delete the NON-immune predecessors. Fail-closed on ANY uncertainty
+ * (recall_k==0, a vanished predecessor, a search error, or Mc absent from the top-k) → delete
+ * NOTHING; Mc lives alongside the originals and the caller surfaces drift.
+ *
+ * The citation-counter immunity (`consumed_by_user_lessons > 0`) is checked HERE, re-loaded right
+ * before the irreversible delete — NOT delegated to the force-delete (which would bypass it). The
+ * delete MUST go through the backend `deleteLesson(force:true)` so the per-file source is removed too;
+ * a DB-only delete would let `rebuildLibsqlIndex` resurrect the predecessor, undoing the consolidation.
+ *
+ * Imports from: ./compress.js.
+ * Imported by: RES-4c (the compression orchestrator) — not yet wired.
+ */
+import { compress } from './compress.js';
+/** Top-k for the recall-replay probe — engine DEFAULT_CONSOLIDATE_RECALL_K (compress.rs:252). */
+export const DEFAULT_CONSOLIDATE_RECALL_K = 5;
+/** Representative recall-probe text for a predecessor (compress.rs:456-466). libSQL memory is
+ * content-only (compress folds description into the content head), so the first line — falling back
+ * to the content — capped at 200 chars is the representative query. */
+function recallQueryFor(m) {
+    const head = m.content.trim().split('\n')[0]?.trim() ?? '';
+    return (head.length > 0 ? head : m.content.trim()).slice(0, 200);
+}
+export async function consolidate(deps, ids, recallK = DEFAULT_CONSOLIDATE_RECALL_K) {
+    const unique = [...new Set(ids)];
+    // 1. compress → Mc. Errors propagate — NOTHING is deleted (we never reach the delete phase).
+    const mc = await compress(deps, unique);
+    // 2. recall-replay verify. Fail-closed: recallK==0, vanished predecessor, search error, or Mc absent.
+    let verified = recallK > 0;
+    for (const pid of unique) {
+        if (!verified)
+            break;
+        const pred = await deps.getMemoryById(pid);
+        if (pred === null) {
+            verified = false;
+            break;
+        }
+        let hits;
+        try {
+            hits = await deps.recallIds(recallQueryFor(pred), recallK);
+        }
+        catch {
+            verified = false;
+            break;
+        }
+        if (!hits.includes(mc.id)) {
+            verified = false;
+            break;
+        }
+    }
+    // 3. fail-closed: a verify miss deletes NOTHING. Mc lives alongside the predecessors.
+    if (!verified)
+        return { mcId: mc.id, deleted: [], keptImmune: [], verified: false };
+    // 4. gated delete — RE-LOAD the authoritative citation counter right before the irreversible delete.
+    const deleted = [];
+    const keptImmune = [];
+    for (const pid of unique) {
+        const reloaded = await deps.getMemoryById(pid);
+        // Absent/unreadable → treat as immune-safe (never force-delete the unconfirmable).
+        const immune = reloaded === null ? true : reloaded.consumedByUserLessons > 0;
+        if (immune) {
+            keptImmune.push(pid);
+            continue;
+        }
+        try {
+            await deps.deleteMemory(pid);
+            deleted.push(pid);
+        }
+        catch {
+            keptImmune.push(pid); // a delete error is non-fatal — keep it; Mc preserves the trace
+        }
+    }
+    return { mcId: mc.id, deleted, keptImmune, verified: true };
+}
+//# sourceMappingURL=consolidate.js.map

package/dist/rag/memory/consolidate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidate.js","sourceRoot":"","sources":["../../../src/rag/memory/consolidate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,QAAQ,EAAqC,MAAM,eAAe,CAAC;AAE5E,iGAAiG;AACjG,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC;AAgB9C;;uEAEuE;AACvE,SAAS,cAAc,CAAC,CAAY;IAClC,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAC3D,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,IAAqB,EACrB,GAAa,EACb,UAAkB,4BAA4B;IAE9C,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAEjC,6FAA6F;IAC7F,MAAM,EAAE,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAExC,sGAAsG;IACtG,IAAI,QAAQ,GAAG,OAAO,GAAG,CAAC,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,CAAC,QAAQ;YAAE,MAAM;QACrB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM;QACR,CAAC;QACD,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7D,CAAC;QAAC,MAAM,CAAC;YACP,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM;QACR,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM;QACR,CAAC;IACH,CAAC;IAED,sFAAsF;IACtF,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAEpF,qGAAqG;IACrG,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC/C,mFAAmF;QACnF,MAAM,MAAM,GAAG,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,GAAG,CAAC,CAAC;QAC7E,IAAI,MAAM,EAAE,CAAC;YACX,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QAAC,MAAM,CAAC;YACP,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,gEAAgE;QACxF,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC9D,CAAC"}

package/dist/rag/memory/cycle.d.ts

@@ -0,0 +1,24 @@
+/**
+ * `derived_from` cycle + depth detection for memory compression (retire-Rust RES-4a; port of
+ * engine/src/engine/memory/cycle.rs). Walks each predecessor's `derived_from` chain with an
+ * iterative DFS that tracks the CURRENT PATH (not all-visited), so legitimate diamond DAGs (the
+ * same ancestor reachable via two branches) don't false-positive as cycles. A back-edge onto the
+ * current path is a true cycle; exceeding the depth cap is treated the same (CompressionCycleError).
+ * The walk loads parents lazily; an absent predecessor is skipped (compress() validates existence).
+ *
+ * Imports from: nothing (pure — takes a parent-lookup fn).
+ * Imported by: src/rag/memory/compress.ts.
+ */
+/** Depth cap for the derived_from chain walk (engine compress.rs COMPRESSION_MAX_CHAIN_DEPTH). */
+export declare const COMPRESSION_MAX_CHAIN_DEPTH = 16;
+export declare class CompressionCycleError extends Error {
+    readonly chain: string[];
+    constructor(chain: string[]);
+}
+/**
+ * Throw `CompressionCycleError` if any `derived_from` chain rooted at `rootIds` contains a cycle or
+ * exceeds the depth cap; resolve otherwise. `getDerivedFrom(id)` returns the parent ids, or `null`
+ * when the memory is absent (skipped).
+ */
+export declare function detectCycleInWindow(getDerivedFrom: (id: string) => Promise<string[] | null>, rootIds: string[]): Promise<void>;
+//# sourceMappingURL=cycle.d.ts.map

package/dist/rag/memory/cycle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle.d.ts","sourceRoot":"","sources":["../../../src/rag/memory/cycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,kGAAkG;AAClG,eAAO,MAAM,2BAA2B,KAAK,CAAC;AAE9C,qBAAa,qBAAsB,SAAQ,KAAK;aAClB,KAAK,EAAE,MAAM,EAAE;gBAAf,KAAK,EAAE,MAAM,EAAE;CAI5C;AAED;;;;GAIG;AACH,wBAAsB,mBAAmB,CACvC,cAAc,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,EACxD,OAAO,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC,IAAI,CAAC,CAkBf"}

package/dist/rag/memory/cycle.js

@@ -0,0 +1,50 @@
+/**
+ * `derived_from` cycle + depth detection for memory compression (retire-Rust RES-4a; port of
+ * engine/src/engine/memory/cycle.rs). Walks each predecessor's `derived_from` chain with an
+ * iterative DFS that tracks the CURRENT PATH (not all-visited), so legitimate diamond DAGs (the
+ * same ancestor reachable via two branches) don't false-positive as cycles. A back-edge onto the
+ * current path is a true cycle; exceeding the depth cap is treated the same (CompressionCycleError).
+ * The walk loads parents lazily; an absent predecessor is skipped (compress() validates existence).
+ *
+ * Imports from: nothing (pure — takes a parent-lookup fn).
+ * Imported by: src/rag/memory/compress.ts.
+ */
+/** Depth cap for the derived_from chain walk (engine compress.rs COMPRESSION_MAX_CHAIN_DEPTH). */
+export const COMPRESSION_MAX_CHAIN_DEPTH = 16;
+export class CompressionCycleError extends Error {
+    chain;
+    constructor(chain) {
+        super(`compression cycle or over-depth in derived_from chain: ${chain.join(' -> ')}`);
+        this.chain = chain;
+        this.name = 'CompressionCycleError';
+    }
+}
+/**
+ * Throw `CompressionCycleError` if any `derived_from` chain rooted at `rootIds` contains a cycle or
+ * exceeds the depth cap; resolve otherwise. `getDerivedFrom(id)` returns the parent ids, or `null`
+ * when the memory is absent (skipped).
+ */
+export async function detectCycleInWindow(getDerivedFrom, rootIds) {
+    for (const root of rootIds) {
+        // Iterative DFS; each frame carries the path from the root so cycle detection is per-path
+        // (diamonds OK) and the depth cap is the path length.
+        const stack = [{ id: root, path: [root] }];
+        while (stack.length > 0) {
+            const frame = stack.pop();
+            if (frame === undefined)
+                break;
+            const { id, path } = frame;
+            if (path.length > COMPRESSION_MAX_CHAIN_DEPTH)
+                throw new CompressionCycleError(path);
+            const parents = await getDerivedFrom(id);
+            if (parents === null)
+                continue; // absent predecessor — skip (existence is compress()'s job)
+            for (const parent of parents) {
+                if (path.includes(parent))
+                    throw new CompressionCycleError([...path, parent]); // back-edge on current path = cycle
+                stack.push({ id: parent, path: [...path, parent] });
+            }
+        }
+    }
+}
+//# sourceMappingURL=cycle.js.map

package/dist/rag/memory/cycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle.js","sourceRoot":"","sources":["../../../src/rag/memory/cycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,kGAAkG;AAClG,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC;AAE9C,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAClB;IAA5B,YAA4B,KAAe;QACzC,KAAK,CAAC,0DAA0D,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAD5D,UAAK,GAAL,KAAK,CAAU;QAEzC,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;IACtC,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,cAAwD,EACxD,OAAiB;IAEjB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,0FAA0F;QAC1F,sDAAsD;QACtD,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC1B,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM;YAC/B,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;YAC3B,IAAI,IAAI,CAAC,MAAM,GAAG,2BAA2B;gBAAE,MAAM,IAAI,qBAAqB,CAAC,IAAI,CAAC,CAAC;YACrF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,OAAO,KAAK,IAAI;gBAAE,SAAS,CAAC,4DAA4D;YAC5F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;oBAAE,MAAM,IAAI,qBAAqB,CAAC,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,oCAAoC;gBACnH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/rag/memory/store.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Memory-store accessors for compression (retire-Rust RES-4a). The memory store IS the libSQL
+ * `lessons` table (source:'memory'); compression needs two things the base store
+ * (src/rag/backends/libsql_store.ts) doesn't expose: a get-by-id and an insert that carries the two
+ * compression columns (`derived_from`, `consumed_by_user_lessons`). These are added ADDITIVELY via
+ * `ensureCompressionColumns` (idempotent `ALTER TABLE ADD COLUMN` — existing rows default, so the
+ * RES-1/3 recall/memorize paths are unaffected). Kept here (not in libsql_store) so the memory-
+ * compression concern stays cohesive and the base backend's private client is untouched.
+ *
+ * Imports from: @libsql/client, ./compress.js.
+ * Imported by: RES-4b (consolidate wires compress's getMemoryById/insertMemory deps) — not yet wired.
+ */
+import type { Client } from '@libsql/client';
+import type { MemoryRow } from './compress.js';
+/** Idempotently add the two compression columns to an existing `lessons` table. */
+export declare function ensureCompressionColumns(client: Client): Promise<void>;
+/** Load one memory by id (the `lessons` row), or null. */
+export declare function getMemoryById(client: Client, id: string): Promise<MemoryRow | null>;
+/**
+ * Insert a memory carrying the compression columns (+ FTS + optional vector). Idempotent upsert by id.
+ * File-first when `sourceDir` is given: writes the per-file source-of-truth (atomic) BEFORE the DB
+ * upsert, mirroring `storeLesson` — so a consolidated memory survives a `rebuildLibsqlIndex` (which
+ * re-indexes from files only). `sourceDir` undefined → DB-only (the pre-existing behavior).
+ */
+export declare function insertMemory(client: Client, m: MemoryRow, sourceDir?: string): Promise<void>;
+/** The auto-memory import marker, as a tag (libSQL has no `origin` column): `origin:import:<name>`. */
+export declare const IMPORT_TAG_PREFIX = "origin:import:";
+export interface ListMemoriesResult {
+    results: MemoryRow[];
+    returned: number;
+    total: number;
+}
+/** Paged list of memory rows in a deterministic order, each carrying its tags (the import marker). */
+export declare function listMemories(client: Client, opts: {
+    limit: number;
+    offset: number;
+}): Promise<ListMemoriesResult>;
+/**
+ * Update a memory's content (the folded `description\n\nbody`) + its `scope:` tag, re-embedding via
+ * `embed`. Preserves every OTHER tag (incl. the `origin:import:` marker) + derived_from/counters by
+ * loading the row and reusing the file-first `insertMemory` upsert. Throws if the id is absent.
+ */
+export declare function updateMemory(client: Client, embed: (text: string) => Promise<number[] | null>, opts: {
+    id: string;
+    content: string;
+    scope?: string;
+}): Promise<void>;
+//# sourceMappingURL=store.d.ts.map

package/dist/rag/memory/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../../src/rag/memory/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAI7C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C,mFAAmF;AACnF,wBAAsB,wBAAwB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAc5E;AAqBD,0DAA0D;AAC1D,wBAAsB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAQzF;AAED;;;;;GAKG;AACH,wBAAsB,YAAY,CAChC,MAAM,EAAE,MAAM,EACd,CAAC,EAAE,SAAS,EACZ,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,IAAI,CAAC,CA2Cf;AAED,uGAAuG;AACvG,eAAO,MAAM,iBAAiB,mBAAmB,CAAC;AAElD,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,SAAS,EAAE,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,sGAAsG;AACtG,wBAAsB,YAAY,CAChC,MAAM,EAAE,MAAM,EACd,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACtC,OAAO,CAAC,kBAAkB,CAAC,CAU7B;AAED;;;;GAIG;AACH,wBAAsB,YAAY,CAChC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,EACjD,IAAI,EAAE;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GACpD,OAAO,CAAC,IAAI,CAAC,CAOf"}

package/dist/rag/memory/store.js

@@ -0,0 +1,126 @@
+import { writeRecord } from '../backends/perfile_source.js';
+/** Idempotently add the two compression columns to an existing `lessons` table. */
+export async function ensureCompressionColumns(client) {
+    for (const ddl of [
+        `ALTER TABLE lessons ADD COLUMN derived_from TEXT NOT NULL DEFAULT '[]'`,
+        `ALTER TABLE lessons ADD COLUMN consumed_by_user_lessons INTEGER NOT NULL DEFAULT 0`,
+        // Scope columns (T-memory-scope-isolation) — additive, idempotent, same as the compression cols.
+        `ALTER TABLE lessons ADD COLUMN tier TEXT NOT NULL DEFAULT 'shared'`,
+        `ALTER TABLE lessons ADD COLUMN namespace TEXT`,
+    ]) {
+        try {
+            await client.execute(ddl);
+        }
+        catch {
+            // duplicate-column = already migrated; any other error surfaces on the SELECT/INSERT below.
+        }
+    }
+}
+const str = (v) => (typeof v === 'string' ? v : '');
+const num = (v) => typeof v === 'number' ? v : typeof v === 'bigint' ? Number(v) : 0;
+function rowToMemory(row) {
+    return {
+        id: str(row.id),
+        content: str(row.content),
+        tags: JSON.parse(str(row.tags) || '[]'),
+        source: str(row.source),
+        author: str(row.author) === 'user' ? 'user' : 'agent',
+        createdAt: str(row.created_at),
+        derivedFrom: JSON.parse(str(row.derived_from) || '[]'),
+        consumedByUserLessons: num(row.consumed_by_user_lessons),
+        tier: str(row.tier) === 'project' ? 'project' : 'shared',
+        namespace: typeof row.namespace === 'string' ? row.namespace : null,
+    };
+}
+/** Load one memory by id (the `lessons` row), or null. */
+export async function getMemoryById(client, id) {
+    const rs = await client.execute({
+        sql: `SELECT id, content, tags, source, author, created_at, derived_from, consumed_by_user_lessons, tier, namespace
+          FROM lessons WHERE id = ?`,
+        args: [id],
+    });
+    if (rs.rows.length === 0)
+        return null;
+    return rowToMemory(rs.rows[0]);
+}
+/**
+ * Insert a memory carrying the compression columns (+ FTS + optional vector). Idempotent upsert by id.
+ * File-first when `sourceDir` is given: writes the per-file source-of-truth (atomic) BEFORE the DB
+ * upsert, mirroring `storeLesson` — so a consolidated memory survives a `rebuildLibsqlIndex` (which
+ * re-indexes from files only). `sourceDir` undefined → DB-only (the pre-existing behavior).
+ */
+export async function insertMemory(client, m, sourceDir) {
+    if (sourceDir !== undefined)
+        await writeRecord(sourceDir, m);
+    const tagsJson = JSON.stringify(m.tags);
+    const vec = m.embedding ?? null;
+    await client.execute({ sql: `DELETE FROM lessons WHERE id = ?`, args: [m.id] });
+    await client.execute({ sql: `DELETE FROM lessons_fts WHERE id = ?`, args: [m.id] });
+    const tier = m.tier ?? 'shared';
+    const namespace = m.namespace ?? null;
+    await client.execute({
+        sql: `INSERT INTO lessons (id, content, tags, source, author, created_at, derived_from,
+          consumed_by_user_lessons, tier, namespace, embedding)
+          VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ${vec ? 'vector32(?)' : 'NULL'})`,
+        args: vec
+            ? [
+                m.id,
+                m.content,
+                tagsJson,
+                m.source,
+                m.author,
+                m.createdAt,
+                JSON.stringify(m.derivedFrom),
+                m.consumedByUserLessons,
+                tier,
+                namespace,
+                JSON.stringify(vec),
+            ]
+            : [
+                m.id,
+                m.content,
+                tagsJson,
+                m.source,
+                m.author,
+                m.createdAt,
+                JSON.stringify(m.derivedFrom),
+                m.consumedByUserLessons,
+                tier,
+                namespace,
+            ],
+    });
+    await client.execute({
+        sql: `INSERT INTO lessons_fts (id, content, tags, source) VALUES (?, ?, ?, ?)`,
+        args: [m.id, m.content, tagsJson, m.source],
+    });
+}
+/** The auto-memory import marker, as a tag (libSQL has no `origin` column): `origin:import:<name>`. */
+export const IMPORT_TAG_PREFIX = 'origin:import:';
+/** Paged list of memory rows in a deterministic order, each carrying its tags (the import marker). */
+export async function listMemories(client, opts) {
+    const totalRs = await client.execute(`SELECT COUNT(*) AS n FROM lessons`);
+    const total = num(totalRs.rows[0]?.n);
+    const rs = await client.execute({
+        sql: `SELECT id, content, tags, source, author, created_at, derived_from, consumed_by_user_lessons
+          FROM lessons ORDER BY created_at, id LIMIT ? OFFSET ?`,
+        args: [opts.limit, opts.offset],
+    });
+    const results = rs.rows.map((r) => rowToMemory(r));
+    return { results, returned: results.length, total };
+}
+/**
+ * Update a memory's content (the folded `description\n\nbody`) + its `scope:` tag, re-embedding via
+ * `embed`. Preserves every OTHER tag (incl. the `origin:import:` marker) + derived_from/counters by
+ * loading the row and reusing the file-first `insertMemory` upsert. Throws if the id is absent.
+ */
+export async function updateMemory(client, embed, opts) {
+    const row = await getMemoryById(client, opts.id);
+    if (row === null)
+        throw new Error(`updateMemory: ${opts.id} not found`);
+    const tags = row.tags.filter((t) => !t.startsWith('scope:')); // replace, don't append
+    if (opts.scope !== undefined)
+        tags.push(`scope:${opts.scope}`);
+    const embedding = await embed(opts.content);
+    await insertMemory(client, { ...row, content: opts.content, tags, embedding });
+}
+//# sourceMappingURL=store.js.map

package/dist/rag/memory/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../../src/rag/memory/store.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAI5D,mFAAmF;AACnF,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAAC,MAAc;IAC3D,KAAK,MAAM,GAAG,IAAI;QAChB,wEAAwE;QACxE,oFAAoF;QACpF,iGAAiG;QACjG,oEAAoE;QACpE,+CAA+C;KAChD,EAAE,CAAC;QACF,IAAI,CAAC;YACH,MAAM,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,4FAA4F;QAC9F,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACrE,MAAM,GAAG,GAAG,CAAC,CAAU,EAAU,EAAE,CACjC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEpE,SAAS,WAAW,CAAC,GAA4B;IAC/C,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACf,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC;QACzB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAa;QACnD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO;QACrD,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC;QAC9B,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,CAAa;QAClE,qBAAqB,EAAE,GAAG,CAAC,GAAG,CAAC,wBAAwB,CAAC;QACxD,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ;QACxD,SAAS,EAAE,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI;KACpE,CAAC;AACJ,CAAC;AAED,0DAA0D;AAC1D,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,MAAc,EAAE,EAAU;IAC5D,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC;QAC9B,GAAG,EAAE;oCAC2B;QAChC,IAAI,EAAE,CAAC,EAAE,CAAC;KACX,CAAC,CAAC;IACH,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,OAAO,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAuC,CAAC,CAAC;AACvE,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,MAAc,EACd,CAAY,EACZ,SAAkB;IAElB,IAAI,SAAS,KAAK,SAAS;QAAE,MAAM,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;IAChC,MAAM,MAAM,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,kCAAkC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,MAAM,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,sCAAsC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACpF,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,QAAQ,CAAC;IAChC,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;IACtC,MAAM,MAAM,CAAC,OAAO,CAAC;QACnB,GAAG,EAAE;;kDAEyC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,GAAG;QAC7E,IAAI,EAAE,GAAG;YACP,CAAC,CAAC;gBACE,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,OAAO;gBACT,QAAQ;gBACR,CAAC,CAAC,MAAM;gBACR,CAAC,CAAC,MAAM;gBACR,CAAC,CAAC,SAAS;gBACX,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC;gBAC7B,CAAC,CAAC,qBAAqB;gBACvB,IAAI;gBACJ,SAAS;gBACT,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;aACpB;YACH,CAAC,CAAC;gBACE,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,OAAO;gBACT,QAAQ;gBACR,CAAC,CAAC,MAAM;gBACR,CAAC,CAAC,MAAM;gBACR,CAAC,CAAC,SAAS;gBACX,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC;gBAC7B,CAAC,CAAC,qBAAqB;gBACvB,IAAI;gBACJ,SAAS;aACV;KACN,CAAC,CAAC;IACH,MAAM,MAAM,CAAC,OAAO,CAAC;QACnB,GAAG,EAAE,yEAAyE;QAC9E,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC;KAC5C,CAAC,CAAC;AACL,CAAC;AAED,uGAAuG;AACvG,MAAM,CAAC,MAAM,iBAAiB,GAAG,gBAAgB,CAAC;AAQlD,sGAAsG;AACtG,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,MAAc,EACd,IAAuC;IAEvC,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC;IAC1E,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC;QAC9B,GAAG,EAAE;gEACuD;QAC5D,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;KAChC,CAAC,CAAC;IACH,MAAM,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAuC,CAAC,CAAC,CAAC;IACzF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;AACtD,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,MAAc,EACd,KAAiD,EACjD,IAAqD;IAErD,MAAM,GAAG,GAAG,MAAM,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACjD,IAAI,GAAG,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC;IACxE,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,wBAAwB;IACtF,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;QAAE,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,YAAY,CAAC,MAAM,EAAE,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;AACjF,CAAC"}

package/dist/rag/migrate_memories.d.ts

@@ -0,0 +1,22 @@
+import type { Embedder } from './embedders/types.js';
+import type { Lesson } from './types.js';
+/**
+ * Parse one engine `mem-*.md` into a `Lesson`. Verified frontmatter: id, description, created_at,
+ * [updated_at], consumed_by_user_lessons, scope (scalar), origin (NESTED). We carry the semantic
+ * payload (description + body) + `scope` (as an FTS-discoverable tag) + createdAt; nested `origin`
+ * and other provenance stay in the retained source files (the migration is additive).
+ */
+export declare function parseMemoryFile(raw: string, fallbackId: string): Lesson;
+/**
+ * Copy every `mem-*.md` in `memDir` into the libSQL store: write each as a per-file record (the
+ * source of truth), then rebuild the derived index. Returns the number migrated.
+ */
+export declare function migrateMemories(opts: {
+    memDir: string;
+    sourceDir: string;
+    dbUrl: string;
+    embedder: Embedder;
+}): Promise<{
+    migrated: number;
+}>;
+//# sourceMappingURL=migrate_memories.d.ts.map

package/dist/rag/migrate_memories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"migrate_memories.d.ts","sourceRoot":"","sources":["../../src/rag/migrate_memories.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAEzC;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAevE;AAED;;;GAGG;AACH,wBAAsB,eAAe,CAAC,IAAI,EAAE;IAC1C,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,QAAQ,CAAC;CACpB,GAAG,OAAO,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CAchC"}

package/dist/rag/migrate_memories.js

@@ -0,0 +1,53 @@
+/**
+ * Engine → libSQL memory migration (T-MIGRATE-MEMORIES, retire-Rust step 1). Copies the engine's
+ * `~/.opensquid/memories/mem-*.md` into the libSQL store via the per-file source + index rebuild —
+ * ADDITIVE (copies, never deletes the engine files) and idempotent (writeRecord overwrites
+ * atomically; rebuildLibsqlIndex drops + rebuilds). Reuses slice 1a/1b machinery; no new insert path.
+ *
+ * Imports from: node:fs/promises, node:path, ./backends/libsql_store.js, ./backends/perfile_source.js,
+ *   ./embedders/types.js, ./types.js.
+ * Imported by: src/cli.ts (the `migrate-memories` command).
+ */
+import { readFile, readdir } from 'node:fs/promises';
+import { join } from 'node:path';
+import { rebuildLibsqlIndex } from './backends/libsql_store.js';
+import { writeRecord } from './backends/perfile_source.js';
+/**
+ * Parse one engine `mem-*.md` into a `Lesson`. Verified frontmatter: id, description, created_at,
+ * [updated_at], consumed_by_user_lessons, scope (scalar), origin (NESTED). We carry the semantic
+ * payload (description + body) + `scope` (as an FTS-discoverable tag) + createdAt; nested `origin`
+ * and other provenance stay in the retained source files (the migration is additive).
+ */
+export function parseMemoryFile(raw, fallbackId) {
+    const id = /^id:\s*(.+)$/m.exec(raw)?.[1]?.trim() ?? fallbackId;
+    const description = /^description:\s*(.+)$/m.exec(raw)?.[1]?.trim() ?? '';
+    const scope = /^scope:\s*(.+)$/m.exec(raw)?.[1]?.trim();
+    const createdAt = /^created_at:\s*'?([^'\n]+)'?$/m.exec(raw)?.[1]?.trim() ?? new Date(0).toISOString();
+    const body = raw.includes('\n---\n') ? raw.split('\n---\n').slice(1).join('\n---\n').trim() : raw;
+    return {
+        id,
+        content: `${description}\n\n${body}`.trim(),
+        tags: scope ? [`scope:${scope}`] : [],
+        source: 'memory',
+        author: 'user',
+        createdAt,
+    };
+}
+/**
+ * Copy every `mem-*.md` in `memDir` into the libSQL store: write each as a per-file record (the
+ * source of truth), then rebuild the derived index. Returns the number migrated.
+ */
+export async function migrateMemories(opts) {
+    const files = (await readdir(opts.memDir)).filter((f) => f.startsWith('mem-') && f.endsWith('.md'));
+    for (const f of files) {
+        const raw = await readFile(join(opts.memDir, f), 'utf8');
+        await writeRecord(opts.sourceDir, parseMemoryFile(raw, f.replace(/\.md$/, '')));
+    }
+    await rebuildLibsqlIndex({
+        dbUrl: opts.dbUrl,
+        embedder: opts.embedder,
+        sourceDir: opts.sourceDir,
+    });
+    return { migrated: files.length };
+}
+//# sourceMappingURL=migrate_memories.js.map

package/dist/rag/migrate_memories.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"migrate_memories.js","sourceRoot":"","sources":["../../src/rag/migrate_memories.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAI3D;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW,EAAE,UAAkB;IAC7D,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC;IAChE,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAC1E,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;IACxD,MAAM,SAAS,GACb,gCAAgC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IACvF,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAClG,OAAO;QACL,EAAE;QACF,OAAO,EAAE,GAAG,WAAW,OAAO,IAAI,EAAE,CAAC,IAAI,EAAE;QAC3C,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;QACrC,MAAM,EAAE,QAAQ;QAChB,MAAM,EAAE,MAAM;QACd,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAKrC;IACC,MAAM,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAC/C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CACjD,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACzD,MAAM,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,kBAAkB,CAAC;QACvB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,SAAS,EAAE,IAAI,CAAC,SAAS;KAC1B,CAAC,CAAC;IACH,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;AACpC,CAAC"}

package/dist/rag/ollama_client.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Minimal Ollama HTTP client for embeddings.
+ *
+ * Single endpoint: `POST {ollamaUrl}/api/embed` with `{ model, input }`.
+ * Returns `embeddings[0]` (Ollama replies `{ embeddings: number[][] }`
+ * for `input` — array-of-strings — so we always take the first vector).
+ *
+ * NO model-name hardcoding in the call site: the caller supplies the
+ * model id. The default arg here (`qwen3-embedding:4b`) is the project's
+ * chosen embedder per `project_loop_embedder_choice` — this is the
+ * embedder choice memory, not the LLM-model-neutrality rule
+ * (`feedback_stop_haiku_drift`). The LLM neutrality rule applies to
+ * classifier / subagent calls (see src/functions/llm.ts); the embedder
+ * is a fixed substrate choice for the default backend.
+ *
+ * `QWEN3_DIM = 2560` is exported so the libsql backend can pin its
+ * F32_BLOB schema column to the right width. Mismatch causes silent
+ * insert failures, not row errors — that's the libsql vector contract.
+ *
+ * Errors: throws on non-2xx HTTP, missing `embeddings` field, or empty
+ * vector. The libsql backend catches these to flip `embedderUp = false`.
+ *
+ * Imports from: nothing (fetch is global in Node 20+).
+ * Imported by: src/rag/backends/libsql_qwen3.ts.
+ */
+export declare const QWEN3_DIM = 2560;
+export declare function ollamaEmbed(ollamaUrl: string, text: string, model?: string): Promise<number[]>;
+//# sourceMappingURL=ollama_client.d.ts.map

package/dist/rag/ollama_client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ollama_client.d.ts","sourceRoot":"","sources":["../../src/rag/ollama_client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,eAAO,MAAM,SAAS,OAAO,CAAC;AAM9B,wBAAsB,WAAW,CAC/B,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,EACZ,KAAK,SAAuB,GAC3B,OAAO,CAAC,MAAM,EAAE,CAAC,CAenB"}

package/dist/rag/ollama_client.js

@@ -0,0 +1,43 @@
+/**
+ * Minimal Ollama HTTP client for embeddings.
+ *
+ * Single endpoint: `POST {ollamaUrl}/api/embed` with `{ model, input }`.
+ * Returns `embeddings[0]` (Ollama replies `{ embeddings: number[][] }`
+ * for `input` — array-of-strings — so we always take the first vector).
+ *
+ * NO model-name hardcoding in the call site: the caller supplies the
+ * model id. The default arg here (`qwen3-embedding:4b`) is the project's
+ * chosen embedder per `project_loop_embedder_choice` — this is the
+ * embedder choice memory, not the LLM-model-neutrality rule
+ * (`feedback_stop_haiku_drift`). The LLM neutrality rule applies to
+ * classifier / subagent calls (see src/functions/llm.ts); the embedder
+ * is a fixed substrate choice for the default backend.
+ *
+ * `QWEN3_DIM = 2560` is exported so the libsql backend can pin its
+ * F32_BLOB schema column to the right width. Mismatch causes silent
+ * insert failures, not row errors — that's the libsql vector contract.
+ *
+ * Errors: throws on non-2xx HTTP, missing `embeddings` field, or empty
+ * vector. The libsql backend catches these to flip `embedderUp = false`.
+ *
+ * Imports from: nothing (fetch is global in Node 20+).
+ * Imported by: src/rag/backends/libsql_qwen3.ts.
+ */
+export const QWEN3_DIM = 2560;
+export async function ollamaEmbed(ollamaUrl, text, model = 'qwen3-embedding:4b') {
+    const res = await fetch(`${ollamaUrl}/api/embed`, {
+        method: 'POST',
+        headers: { 'content-type': 'application/json' },
+        body: JSON.stringify({ model, input: text }),
+    });
+    if (!res.ok) {
+        throw new Error(`ollamaEmbed: HTTP ${res.status} ${res.statusText}`);
+    }
+    const body = (await res.json());
+    const vec = body.embeddings?.[0];
+    if (!Array.isArray(vec) || vec.length === 0) {
+        throw new Error('ollamaEmbed: malformed response (no embeddings[0])');
+    }
+    return vec;
+}
+//# sourceMappingURL=ollama_client.js.map

package/dist/rag/ollama_client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ollama_client.js","sourceRoot":"","sources":["../../src/rag/ollama_client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,MAAM,CAAC,MAAM,SAAS,GAAG,IAAI,CAAC;AAM9B,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAiB,EACjB,IAAY,EACZ,KAAK,GAAG,oBAAoB;IAE5B,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,SAAS,YAAY,EAAE;QAChD,MAAM,EAAE,MAAM;QACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;QAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;KAC7C,CAAC,CAAC;IACH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAwB,CAAC;IACvD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/rag/rrf.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Reciprocal Rank Fusion (Cormack et al., SIGIR 2009 §3).
+ *
+ * Combines multiple ranked lists into a single fused list with the formula
+ * `score(id) = Σ 1 / (k + rank_i(id))` where `k = 60` is the constant from
+ * the original paper. The hybrid backend uses RRF to merge the semantic
+ * (vector-cosine) and lexical (FTS5) rankings — neither ordering alone
+ * matches user intent for short-form lesson recall.
+ *
+ * Why `RRF_K = 60`: large enough to dampen top-rank dominance (the
+ * 1-vs-2 gap is ~1.6 % rather than 50 %), small enough that rank still
+ * matters past position 10. Don't tune this without a benchmark — every
+ * dataset re-derives back to ~60.
+ *
+ * Imports from: ./types.js.
+ * Imported by: src/rag/backends/libsql_qwen3.ts.
+ */
+import type { RecallHit } from './types.js';
+export declare function rrfFuse(lists: RecallHit[][], topK: number): RecallHit[];
+//# sourceMappingURL=rrf.d.ts.map

package/dist/rag/rrf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rrf.d.ts","sourceRoot":"","sources":["../../src/rag/rrf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAI5C,wBAAgB,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,EAAE,CAevE"}

package/dist/rag/rrf.js

@@ -0,0 +1,37 @@
+/**
+ * Reciprocal Rank Fusion (Cormack et al., SIGIR 2009 §3).
+ *
+ * Combines multiple ranked lists into a single fused list with the formula
+ * `score(id) = Σ 1 / (k + rank_i(id))` where `k = 60` is the constant from
+ * the original paper. The hybrid backend uses RRF to merge the semantic
+ * (vector-cosine) and lexical (FTS5) rankings — neither ordering alone
+ * matches user intent for short-form lesson recall.
+ *
+ * Why `RRF_K = 60`: large enough to dampen top-rank dominance (the
+ * 1-vs-2 gap is ~1.6 % rather than 50 %), small enough that rank still
+ * matters past position 10. Don't tune this without a benchmark — every
+ * dataset re-derives back to ~60.
+ *
+ * Imports from: ./types.js.
+ * Imported by: src/rag/backends/libsql_qwen3.ts.
+ */
+const RRF_K = 60;
+export function rrfFuse(lists, topK) {
+    const scores = new Map();
+    for (const list of lists) {
+        list.forEach((hit, i) => {
+            const id = hit.lesson.id;
+            const inc = 1 / (RRF_K + i + 1);
+            const prev = scores.get(id);
+            if (prev)
+                prev.score += inc;
+            else
+                scores.set(id, { lesson: hit.lesson, score: inc });
+        });
+    }
+    return [...scores.entries()]
+        .sort((a, b) => b[1].score - a[1].score)
+        .slice(0, topK)
+        .map(([, v]) => ({ lesson: v.lesson, score: v.score, source: 'fused' }));
+}
+//# sourceMappingURL=rrf.js.map

package/dist/rag/rrf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rrf.js","sourceRoot":"","sources":["../../src/rag/rrf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB,MAAM,UAAU,OAAO,CAAC,KAAoB,EAAE,IAAY;IACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0D,CAAC;IACjF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACtB,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,IAAI;gBAAE,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;;gBACvB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;SACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;SACvC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;SACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,OAAgB,EAAE,CAAC,CAAC,CAAC;AACtF,CAAC"}

package/dist/rag/scope.d.ts

@@ -0,0 +1,10 @@
+import type { RecallScope } from './types.js';
+/** Resolve the recall namespace for `cwd`: umbrella → project-uuid → null. Never throws. */
+export declare function resolveRecallScope(cwd?: string): Promise<RecallScope>;
+/**
+ * The loud notice emitted when a scoped recall resolves to a null namespace — project memory is
+ * withheld this turn. NEVER a silent forget (directly answers the "AI forgets what I told it" drift).
+ * Callers that surface text (recall MCP, recall_pre_inject) prepend/emit this; null namespace is rare.
+ */
+export declare const NULL_SCOPE_NOTICE = "[opensquid] project unresolved (no umbrella/project context) \u2192 project-scoped memory withheld this turn; only shared memory recalled.";
+//# sourceMappingURL=scope.d.ts.map

package/dist/rag/scope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.d.ts","sourceRoot":"","sources":["../../src/rag/scope.ts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,4FAA4F;AAC5F,wBAAsB,kBAAkB,CAAC,GAAG,GAAE,MAAsB,GAAG,OAAO,CAAC,WAAW,CAAC,CAc1F;AAED;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,+IAC2G,CAAC"}