@astragenie/astramemory-local 0.7.2

package/dist/sync/shipper.js

@@ -0,0 +1,189 @@
+/**
+ * Sync shipper (Wave 3d, ADR-003) — one-way, append-only, idempotent log
+ * shipping: local memory_events -> cloud POST /sync/events.
+ *
+ * The log IS the queue: unsynced rows are `synced_at IS NULL`; a batch is
+ * acked by the cloud's `{ acked_seq }` and marked in one UPDATE. Crash-safe
+ * by construction — replaying a batch is always safe (cloud dedups on
+ * content_hash and (device_id, seq)).
+ *
+ * Scope filter (ADR-009): only events whose atom is team/org-scoped ship.
+ * `personal` atoms never leave the machine. erase_request events for atoms
+ * whose row is already hard-deleted ship when their payload carries a
+ * team/org scope (3f writes the scope into the erase payload for exactly
+ * this reason).
+ *
+ * Offline: unlimited — failures leave rows unsynced; retry with exponential
+ * backoff capped at BACKOFF_CAP_MS.
+ */
+import { randomUUID } from 'node:crypto';
+import { existsSync, readFileSync, writeFileSync, mkdirSync } from 'node:fs';
+import { join } from 'node:path';
+import { logger } from '../log/logger.js';
+export const SYNC_PROTOCOL = 'astramem-sync@1';
+const DEFAULT_BATCH = 200;
+const DEFAULT_INTERVAL_MS = 30_000;
+const BACKOFF_CAP_MS = 15 * 60_000;
+/**
+ * Stable per-install device id, persisted as a plain file in the config dir
+ * (an identifier, not a secret — the device TOKEN lives in the keystore).
+ */
+export function getOrCreateDeviceId(configDir) {
+    const path = join(configDir, 'device-id');
+    if (existsSync(path)) {
+        const existing = readFileSync(path, 'utf8').trim();
+        if (existing)
+            return existing;
+    }
+    const id = randomUUID();
+    mkdirSync(configDir, { recursive: true });
+    writeFileSync(path, `${id}\n`, 'utf8');
+    return id;
+}
+/**
+ * Unsynced, ship-eligible events in seq order (ADR-009 scope filter).
+ * LEFT JOIN: an erase_request may outlive its memories row — it ships when
+ * its payload records a team/org scope.
+ *
+ * `archive`/`restore` (FEAT-404) are excluded unconditionally, regardless of
+ * scope: archival is a per-device retention/storage-hygiene decision (one
+ * device's local SQLite-growth mitigation), not a semantic memory change,
+ * so it must never leave the machine. The sync wire schema
+ * (contracts/schemas/sync-envelope.v1.schema.json) also never lists these
+ * two types in its event_type enum — shipping one would fail schema
+ * validation on the wire, on top of being the wrong policy.
+ */
+export function listUnsynced(db, batchSize) {
+    return db
+        .prepare(`
+      SELECT e.seq, e.event_id, e.event_type, e.atom_id, e.payload_json, e.content_hash, e.created_at
+      FROM memory_events e
+      LEFT JOIN memories m ON m.id = e.atom_id
+      WHERE e.synced_at IS NULL
+        AND e.event_type NOT IN ('archive', 'restore')
+        AND (
+          m.scope IN ('team', 'org')
+          OR (
+            e.event_type = 'erase_request'
+            AND json_extract(e.payload_json, '$.scope') IN ('team', 'org')
+          )
+        )
+      ORDER BY e.seq ASC
+      LIMIT ?
+    `)
+        .all(batchSize);
+}
+/** Last acked seq = highest synced event seq (0 when nothing has shipped). */
+export function lastAckedSeq(db) {
+    const row = db
+        .prepare('SELECT MAX(seq) AS s FROM memory_events WHERE synced_at IS NOT NULL')
+        .get();
+    return row.s ?? 0;
+}
+export function buildEnvelope(deviceId, workspaceId, cursor, rows) {
+    return {
+        protocol: SYNC_PROTOCOL,
+        device_id: deviceId,
+        workspace_id: workspaceId,
+        cursor,
+        events: rows.map(r => ({
+            seq: r.seq,
+            event_id: r.event_id,
+            event_type: r.event_type,
+            atom_id: r.atom_id,
+            payload_json: r.payload_json !== null ? JSON.parse(r.payload_json) : null,
+            content_hash: r.content_hash,
+            created_at: r.created_at,
+        })),
+    };
+}
+/**
+ * One shipping round: read a batch, POST it, mark acked rows synced.
+ * Throws on transport/HTTP failure — the caller owns retry/backoff.
+ */
+export async function shipOnce(opts) {
+    const batchSize = opts.batchSize ?? DEFAULT_BATCH;
+    const rows = listUnsynced(opts.db, batchSize);
+    if (rows.length === 0)
+        return { shipped: 0, acked: 0, idle: true };
+    const envelope = buildEnvelope(opts.deviceId, opts.workspaceId, lastAckedSeq(opts.db), rows);
+    const doFetch = opts.fetchImpl ?? fetch;
+    const res = await doFetch(`${opts.url.replace(/\/$/, '')}/sync/events`, {
+        method: 'POST',
+        headers: {
+            'content-type': 'application/json',
+            authorization: `Bearer ${opts.token}`,
+        },
+        body: JSON.stringify(envelope),
+        // A hung cloud socket must not stall shipping rounds indefinitely — abort
+        // and let the caller's backoff handle it.
+        signal: AbortSignal.timeout(10_000),
+    });
+    if (!res.ok) {
+        throw new Error(`sync ship failed: HTTP ${res.status}`);
+    }
+    const body = (await res.json());
+    const ackedSeq = typeof body.acked_seq === 'number' ? body.acked_seq : -1;
+    if (ackedSeq < 0) {
+        throw new Error('sync ship failed: response missing acked_seq');
+    }
+    // Mark ONLY the rows we actually shipped and the server acked. A partial
+    // ack (acked_seq mid-batch) leaves the tail unsynced for the next round.
+    const shippedAcked = rows.filter(r => r.seq <= ackedSeq).map(r => r.seq);
+    if (shippedAcked.length > 0) {
+        const now = Date.now();
+        const placeholders = shippedAcked.map(() => '?').join(', ');
+        opts.db
+            .prepare(`UPDATE memory_events SET synced_at = ? WHERE seq IN (${placeholders}) AND synced_at IS NULL`)
+            .run(now, ...shippedAcked);
+    }
+    return { shipped: rows.length, acked: shippedAcked.length, idle: false };
+}
+/** Pure backoff schedule: base * 2^failures, capped. Exported for tests. */
+export function backoffDelay(baseMs, consecutiveFailures) {
+    return Math.min(baseMs * 2 ** consecutiveFailures, BACKOFF_CAP_MS);
+}
+/**
+ * Start the periodic shipper loop. Ships immediately, then every intervalMs;
+ * on failure the next attempt is delayed by exponential backoff.
+ */
+export function startShipper(opts) {
+    const intervalMs = opts.intervalMs ?? DEFAULT_INTERVAL_MS;
+    let stopped = false;
+    let timer = null;
+    let inFlight = null;
+    let failures = 0;
+    async function round() {
+        if (stopped)
+            return;
+        try {
+            const result = await shipOnce(opts);
+            failures = 0;
+            if (!result.idle) {
+                logger.info({ shipped: result.shipped, acked: result.acked }, 'sync: batch shipped');
+            }
+        }
+        catch (err) {
+            failures++;
+            logger.warn({ err: err.message, consecutive_failures: failures }, 'sync: ship failed — will retry with backoff');
+        }
+        if (!stopped) {
+            const delay = failures > 0 ? backoffDelay(intervalMs, failures) : intervalMs;
+            timer = setTimeout(launch, delay);
+        }
+    }
+    function launch() {
+        inFlight = round().finally(() => { inFlight = null; });
+    }
+    launch();
+    return {
+        async stop() {
+            stopped = true;
+            if (timer)
+                clearTimeout(timer);
+            if (inFlight)
+                await inFlight;
+        },
+    };
+}
+//# sourceMappingURL=shipper.js.map

package/dist/sync/shipper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shipper.js","sourceRoot":"","sources":["../../src/sync/shipper.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,MAAM,CAAC,MAAM,aAAa,GAAG,iBAA0B,CAAC;AAgDxD,MAAM,aAAa,GAAG,GAAG,CAAC;AAC1B,MAAM,mBAAmB,GAAG,MAAM,CAAC;AACnC,MAAM,cAAc,GAAG,EAAE,GAAG,MAAM,CAAC;AAEnC;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACnD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAC1C,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;IAChC,CAAC;IACD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;IACxB,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1C,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACvC,OAAO,EAAE,CAAC;AACZ,CAAC;AAYD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,EAAM,EAAE,SAAiB;IACpD,OAAO,EAAE;SACN,OAAO,CAAC;;;;;;;;;;;;;;;KAeR,CAAC;SACD,GAAG,CAAC,SAAS,CAAkB,CAAC;AACrC,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,YAAY,CAAC,EAAM;IACjC,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CAAC,qEAAqE,CAAC;SAC9E,GAAG,EAA0B,CAAC;IACjC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,QAAgB,EAChB,WAAmB,EACnB,MAAc,EACd,IAAmB;IAEnB,OAAO;QACL,QAAQ,EAAE,aAAa;QACvB,SAAS,EAAE,QAAQ;QACnB,YAAY,EAAE,WAAW;QACzB,MAAM;QACN,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrB,GAAG,EAAE,CAAC,CAAC,GAAG;YACV,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,YAAY,EAAE,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,CAA6B,CAAC,CAAC,CAAC,IAAI;YACtG,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,UAAU,EAAE,CAAC,CAAC,UAAU;SACzB,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AASD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAiB;IAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,aAAa,CAAC;IAClD,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAEnE,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC7F,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC;IAExC,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,EAAE;QACtE,MAAM,EAAE,MAAM;QACd,OAAO,EAAE;YACP,cAAc,EAAE,kBAAkB;YAClC,aAAa,EAAE,UAAU,IAAI,CAAC,KAAK,EAAE;SACtC;QACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;QAC9B,0EAA0E;QAC1E,0CAA0C;QAC1C,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC;KACpC,CAAC,CAAC;IACH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,0BAA0B,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAA2B,CAAC;IAC1D,MAAM,QAAQ,GAAG,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAClE,CAAC;IAED,yEAAyE;IACzE,yEAAyE;IACzE,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzE,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAI,CAAC,EAAE;aACJ,OAAO,CAAC,wDAAwD,YAAY,yBAAyB,CAAC;aACtG,GAAG,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC3E,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,mBAA2B;IACtE,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,mBAAmB,EAAE,cAAc,CAAC,CAAC;AACrE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAAiB;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC;IAC1D,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,KAAK,GAAyC,IAAI,CAAC;IACvD,IAAI,QAAQ,GAAyB,IAAI,CAAC;IAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,UAAU,KAAK;QAClB,IAAI,OAAO;YAAE,OAAO;QACpB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;YACpC,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,qBAAqB,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CACT,EAAE,GAAG,EAAG,GAAa,CAAC,OAAO,EAAE,oBAAoB,EAAE,QAAQ,EAAE,EAC/D,6CAA6C,CAC9C,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YAC7E,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,SAAS,MAAM;QACb,QAAQ,GAAG,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,MAAM,EAAE,CAAC;IAET,OAAO;QACL,KAAK,CAAC,IAAI;YACR,OAAO,GAAG,IAAI,CAAC;YACf,IAAI,KAAK;gBAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,QAAQ;gBAAE,MAAM,QAAQ,CAAC;QAC/B,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/tag-hygiene/backfill.d.ts

@@ -0,0 +1,50 @@
+/**
+ * runTagHygieneBackfill — FEAT-403 core (DB-only, CLI-independent so it's
+ * directly unit-testable without spawning the daemon).
+ *
+ * Candidate selection (`WHERE repo blank OR project blank`) is what makes
+ * this idempotent by construction (AC-3): a fully-tagged row is never
+ * selected on a re-run, so re-running on a fully-tagged corpus is always a
+ * pure no-op scan with zero mutation.
+ *
+ * Tier-1 (session cwd/project_id) and tier-2 (prompt-assisted, confidence-
+ * gated) are applied per-row; tier-2 only runs when tier-1 found nothing at
+ * all for that row (never mixes a tier-1 partial fill with a tier-2 guess in
+ * the same row — keeps the mis-tag blast radius per row to one tier).
+ *
+ * Mutations run outside a single wrapping transaction, one UPDATE per
+ * applied row: tier-2 calls an LLM per candidate (async), and better-sqlite3
+ * transactions must be synchronous. This is also a deliberately resumable
+ * shape (durability principle) — if the process is interrupted mid-run, a
+ * re-run picks up exactly where it left off via the same WHERE clause.
+ */
+import type { DB } from '../storage/db.js';
+import type { Tier2InferFn } from './tier2-infer.js';
+export interface BackfillOptions {
+    dryRun: boolean;
+    limit?: number;
+    tier2Enabled: boolean;
+    /** Minimum tier-2 confidence required to apply an inferred tag (AC-4). */
+    confidenceThreshold: number;
+}
+export interface BackfillCandidate {
+    id: string;
+    currentRepo: string | null;
+    currentProject: string | null;
+    proposedRepo: string | null;
+    proposedProject: string | null;
+    /** null when the memory was left untagged (no signal, or tier-2 confidence too low). */
+    tier: 1 | 2 | null;
+    /** Only set when tier-2 ran for this row. */
+    confidence?: number;
+    applied: boolean;
+}
+export interface BackfillResult {
+    scanned: number;
+    tier1Applied: number;
+    tier2Applied: number;
+    leftUntagged: number;
+    dryRun: boolean;
+    candidates: BackfillCandidate[];
+}
+export declare function runTagHygieneBackfill(db: DB, opts: BackfillOptions, tier2Infer?: Tier2InferFn): Promise<BackfillResult>;

package/dist/tag-hygiene/backfill.js

@@ -0,0 +1,117 @@
+/**
+ * runTagHygieneBackfill — FEAT-403 core (DB-only, CLI-independent so it's
+ * directly unit-testable without spawning the daemon).
+ *
+ * Candidate selection (`WHERE repo blank OR project blank`) is what makes
+ * this idempotent by construction (AC-3): a fully-tagged row is never
+ * selected on a re-run, so re-running on a fully-tagged corpus is always a
+ * pure no-op scan with zero mutation.
+ *
+ * Tier-1 (session cwd/project_id) and tier-2 (prompt-assisted, confidence-
+ * gated) are applied per-row; tier-2 only runs when tier-1 found nothing at
+ * all for that row (never mixes a tier-1 partial fill with a tier-2 guess in
+ * the same row — keeps the mis-tag blast radius per row to one tier).
+ *
+ * Mutations run outside a single wrapping transaction, one UPDATE per
+ * applied row: tier-2 calls an LLM per candidate (async), and better-sqlite3
+ * transactions must be synchronous. This is also a deliberately resumable
+ * shape (durability principle) — if the process is interrupted mid-run, a
+ * re-run picks up exactly where it left off via the same WHERE clause.
+ */
+import { deriveRepoFromCwd } from './derive-repo.js';
+function isBlank(v) {
+    return v === null || v === undefined || v.trim() === '';
+}
+export async function runTagHygieneBackfill(db, opts, tier2Infer) {
+    const limitClause = opts.limit !== undefined ? ` LIMIT ${Math.max(1, opts.limit)}` : '';
+    const rows = db.prepare(`
+    SELECT id, text, repo, project, session_id FROM memories
+    WHERE (repo IS NULL OR TRIM(repo) = '') OR (project IS NULL OR TRIM(project) = '')
+    ORDER BY created_at ASC${limitClause}
+  `).all();
+    const sessionStmt = db.prepare('SELECT repo, project, cwd FROM sessions WHERE id = ?');
+    const updateStmt = db.prepare('UPDATE memories SET repo = ?, project = ?, updated_at = ? WHERE id = ?');
+    // Known (repo, project) vocabulary from the already-tagged corpus — grounds
+    // tier-2 inference so it can only choose among names actually seen
+    // elsewhere, never invent one (see tier2-infer.ts). Queried once per run.
+    const knownPairs = opts.tier2Enabled && tier2Infer
+        ? db.prepare(`
+        SELECT DISTINCT repo, project FROM memories
+        WHERE repo IS NOT NULL AND TRIM(repo) != '' AND project IS NOT NULL AND TRIM(project) != ''
+      `).all()
+        : [];
+    const candidates = [];
+    let tier1Applied = 0;
+    let tier2Applied = 0;
+    let leftUntagged = 0;
+    for (const row of rows) {
+        let proposedRepo = isBlank(row.repo) ? null : row.repo;
+        let proposedProject = isBlank(row.project) ? null : row.project;
+        let tier = null;
+        let confidence;
+        // ---- Tier 1: session metadata (repo, or project_id, or cwd) ----
+        if (row.session_id) {
+            const session = sessionStmt.get(row.session_id);
+            if (session) {
+                const sessionRepo = session.repo ?? deriveRepoFromCwd(session.cwd);
+                const sessionProject = session.project;
+                let changed = false;
+                if (isBlank(proposedRepo) && !isBlank(sessionRepo)) {
+                    proposedRepo = sessionRepo;
+                    changed = true;
+                }
+                if (isBlank(proposedProject) && !isBlank(sessionProject)) {
+                    proposedProject = sessionProject;
+                    changed = true;
+                }
+                if (changed)
+                    tier = 1;
+            }
+        }
+        // ---- Tier 2: prompt-assisted inference — only when tier-1 found nothing ----
+        if (tier === null && opts.tier2Enabled && tier2Infer && (isBlank(proposedRepo) || isBlank(proposedProject))) {
+            const inferred = await tier2Infer(row.text, knownPairs);
+            confidence = inferred.confidence;
+            if (inferred.confidence >= opts.confidenceThreshold) {
+                if (isBlank(proposedRepo) && !isBlank(inferred.repo))
+                    proposedRepo = inferred.repo;
+                if (isBlank(proposedProject) && !isBlank(inferred.project))
+                    proposedProject = inferred.project;
+                if (!isBlank(proposedRepo) || !isBlank(proposedProject))
+                    tier = 2;
+            }
+        }
+        const willApply = tier !== null && (proposedRepo !== row.repo || proposedProject !== row.project);
+        if (willApply) {
+            if (!opts.dryRun) {
+                updateStmt.run(proposedRepo, proposedProject, Date.now(), row.id);
+            }
+            if (tier === 1)
+                tier1Applied++;
+            else if (tier === 2)
+                tier2Applied++;
+        }
+        else {
+            leftUntagged++;
+        }
+        candidates.push({
+            id: row.id,
+            currentRepo: row.repo,
+            currentProject: row.project,
+            proposedRepo,
+            proposedProject,
+            tier: willApply ? tier : null,
+            confidence,
+            applied: willApply && !opts.dryRun,
+        });
+    }
+    return {
+        scanned: rows.length,
+        tier1Applied,
+        tier2Applied,
+        leftUntagged,
+        dryRun: opts.dryRun,
+        candidates,
+    };
+}
+//# sourceMappingURL=backfill.js.map

package/dist/tag-hygiene/backfill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backfill.js","sourceRoot":"","sources":["../../src/tag-hygiene/backfill.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AA+CrD,SAAS,OAAO,CAAC,CAA4B;IAC3C,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;AAC1D,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,EAAM,EACN,IAAqB,EACrB,UAAyB;IAEzB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACxF,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;6BAGG,WAAW;GACrC,CAAC,CAAC,GAAG,EAAiB,CAAC;IAExB,MAAM,WAAW,GAAG,EAAE,CAAC,OAAO,CAAC,sDAAsD,CAAC,CAAC;IACvF,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAAC,wEAAwE,CAAC,CAAC;IAExG,4EAA4E;IAC5E,mEAAmE;IACnE,0EAA0E;IAC1E,MAAM,UAAU,GAAuB,IAAI,CAAC,YAAY,IAAI,UAAU;QACpE,CAAC,CAAE,EAAE,CAAC,OAAO,CAAC;;;OAGX,CAAC,CAAC,GAAG,EAAyB;QACjC,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,UAAU,GAAwB,EAAE,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;QACvD,IAAI,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;QAChE,IAAI,IAAI,GAAiB,IAAI,CAAC;QAC9B,IAAI,UAA8B,CAAC;QAEnC,mEAAmE;QACnE,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACnB,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAA2B,CAAC;YAC1E,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,IAAI,iBAAiB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACnE,MAAM,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC;gBACvC,IAAI,OAAO,GAAG,KAAK,CAAC;gBACpB,IAAI,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;oBAAC,YAAY,GAAG,WAAW,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;gBAAC,CAAC;gBACnG,IAAI,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;oBAAC,eAAe,GAAG,cAAc,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;gBAAC,CAAC;gBAC/G,IAAI,OAAO;oBAAE,IAAI,GAAG,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,+EAA+E;QAC/E,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,YAAY,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC;YAC5G,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YACxD,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;YACjC,IAAI,QAAQ,CAAC,UAAU,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBACpD,IAAI,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAAE,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;gBACnF,IAAI,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE,eAAe,GAAG,QAAQ,CAAC,OAAO,CAAC;gBAC/F,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC;oBAAE,IAAI,GAAG,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,KAAK,IAAI,IAAI,CAAC,YAAY,KAAK,GAAG,CAAC,IAAI,IAAI,eAAe,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QAElG,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;YACD,IAAI,IAAI,KAAK,CAAC;gBAAE,YAAY,EAAE,CAAC;iBAC1B,IAAI,IAAI,KAAK,CAAC;gBAAE,YAAY,EAAE,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,WAAW,EAAE,GAAG,CAAC,IAAI;YACrB,cAAc,EAAE,GAAG,CAAC,OAAO;YAC3B,YAAY;YACZ,eAAe;YACf,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;YAC7B,UAAU;YACV,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM;SACnC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,MAAM;QACpB,YAAY;QACZ,YAAY;QACZ,YAAY;QACZ,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,UAAU;KACX,CAAC;AACJ,CAAC"}

package/dist/tag-hygiene/derive-repo.d.ts

@@ -0,0 +1,9 @@
+/**
+ * deriveRepoFromCwd — tier-1 heuristic (FEAT-403 AC-1).
+ *
+ * Given a session's working directory, derive a repo name as the last path
+ * segment. Handles both POSIX and Windows separators (the daemon runs
+ * cross-platform — see CLAUDE.md) and trailing slashes. Returns null for
+ * empty/root-only paths rather than guessing.
+ */
+export declare function deriveRepoFromCwd(cwd: string | null | undefined): string | null;

package/dist/tag-hygiene/derive-repo.js

@@ -0,0 +1,19 @@
+/**
+ * deriveRepoFromCwd — tier-1 heuristic (FEAT-403 AC-1).
+ *
+ * Given a session's working directory, derive a repo name as the last path
+ * segment. Handles both POSIX and Windows separators (the daemon runs
+ * cross-platform — see CLAUDE.md) and trailing slashes. Returns null for
+ * empty/root-only paths rather than guessing.
+ */
+export function deriveRepoFromCwd(cwd) {
+    if (!cwd)
+        return null;
+    const trimmed = cwd.replace(/[\\/]+$/, '');
+    if (!trimmed)
+        return null;
+    const segments = trimmed.split(/[\\/]/).filter(Boolean);
+    const last = segments[segments.length - 1];
+    return last && last.length > 0 ? last : null;
+}
+//# sourceMappingURL=derive-repo.js.map

package/dist/tag-hygiene/derive-repo.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"derive-repo.js","sourceRoot":"","sources":["../../src/tag-hygiene/derive-repo.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAA8B;IAC9D,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,OAAO,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/C,CAAC"}

package/dist/tag-hygiene/tier2-infer.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Tier-2 "prompt-assisted" inference (FEAT-403 AC-4).
+ *
+ * Runs only when tier-1 (session cwd/project_id, see derive-repo.ts +
+ * backfill.ts) found nothing to derive from. Grounded ONLY in the
+ * (repo, project) vocabulary already present elsewhere in the tagged
+ * corpus — the model is told to pick among known pairs or return null, never
+ * to invent a new name from thin air. Any parse failure, empty vocabulary,
+ * or provider error resolves to confidence 0 so the caller (backfill.ts)
+ * leaves the memory untagged rather than risk a mis-tag.
+ */
+import type { LLMProvider } from '../contracts/index.js';
+export interface TagCandidatePair {
+    repo: string | null;
+    project: string | null;
+}
+export interface Tier2InferResult {
+    repo: string | null;
+    project: string | null;
+    confidence: number;
+}
+export type Tier2InferFn = (memoryText: string, knownPairs: TagCandidatePair[]) => Promise<Tier2InferResult>;
+/**
+ * Default tier-2 inference, backed by an injected LLMProvider (reuse the
+ * existing provider abstraction — src/contracts/llm.ts, src/providers/index.ts
+ * — rather than a bespoke HTTP call).
+ */
+export declare function makeLlmTier2Infer(llm: LLMProvider): Tier2InferFn;

package/dist/tag-hygiene/tier2-infer.js

@@ -0,0 +1,72 @@
+/**
+ * Tier-2 "prompt-assisted" inference (FEAT-403 AC-4).
+ *
+ * Runs only when tier-1 (session cwd/project_id, see derive-repo.ts +
+ * backfill.ts) found nothing to derive from. Grounded ONLY in the
+ * (repo, project) vocabulary already present elsewhere in the tagged
+ * corpus — the model is told to pick among known pairs or return null, never
+ * to invent a new name from thin air. Any parse failure, empty vocabulary,
+ * or provider error resolves to confidence 0 so the caller (backfill.ts)
+ * leaves the memory untagged rather than risk a mis-tag.
+ */
+import { z } from 'zod';
+const Tier2ResponseSchema = z.object({
+    repo: z.string().nullable().optional(),
+    project: z.string().nullable().optional(),
+    confidence: z.number().min(0).max(1),
+});
+const TIER2_SYSTEM_PROMPT = `You infer which repository/project a memory (fact, decision, or lesson) belongs to. You will be given a list of already-known repo/project pairs seen elsewhere in this corpus, and the memory's text. Pick ONE known pair if the text gives clear evidence, or return null for both fields if there is no clear signal — never invent a new repo/project name. Respond with strict JSON only: {"repo": string|null, "project": string|null, "confidence": number between 0 and 1}. confidence reflects how certain you are the memory belongs to the chosen pair; use a low confidence (< 0.5) when unsure.`;
+/**
+ * Default tier-2 inference, backed by an injected LLMProvider (reuse the
+ * existing provider abstraction — src/contracts/llm.ts, src/providers/index.ts
+ * — rather than a bespoke HTTP call).
+ */
+export function makeLlmTier2Infer(llm) {
+    return async (memoryText, knownPairs) => {
+        if (knownPairs.length === 0) {
+            // No known vocabulary to ground a guess in — never invent from thin air.
+            return { repo: null, project: null, confidence: 0 };
+        }
+        const pairsList = knownPairs
+            .map(p => `- repo=${p.repo ?? 'null'} project=${p.project ?? 'null'}`)
+            .join('\n');
+        const messages = [
+            { role: 'system', content: TIER2_SYSTEM_PROMPT },
+            {
+                role: 'user',
+                content: `Known repo/project pairs seen in this corpus:\n${pairsList}\n\nMemory text:\n${memoryText}\n\nWhich pair (if any) does this memory belong to?`,
+            },
+        ];
+        try {
+            const result = await llm.chat(messages, { temperature: 0, json: true, maxTokens: 200 });
+            return parseTier2Response(result.text) ?? { repo: null, project: null, confidence: 0 };
+        }
+        catch {
+            return { repo: null, project: null, confidence: 0 };
+        }
+    };
+}
+/** Parse the LLM's JSON response, stripping markdown fences if present. */
+function parseTier2Response(raw) {
+    try {
+        let text = raw.trim();
+        text = text.replace(/^```(?:json)?\n?/i, '').replace(/\n?```\s*$/i, '').trim();
+        const start = text.indexOf('{');
+        const end = text.lastIndexOf('}');
+        if (start === -1 || end === -1)
+            return null;
+        const parsedJson = JSON.parse(text.slice(start, end + 1));
+        const validated = Tier2ResponseSchema.safeParse(parsedJson);
+        if (!validated.success)
+            return null;
+        return {
+            repo: validated.data.repo ?? null,
+            project: validated.data.project ?? null,
+            confidence: validated.data.confidence,
+        };
+    }
+    catch {
+        return null;
+    }
+}
+//# sourceMappingURL=tier2-infer.js.map

package/dist/tag-hygiene/tier2-infer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier2-infer.js","sourceRoot":"","sources":["../../src/tag-hygiene/tier2-infer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAmBxB,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IACnC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACtC,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACzC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;AAEH,MAAM,mBAAmB,GAAG,8kBAA8kB,CAAC;AAE3mB;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAgB;IAChD,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE;QACtC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,yEAAyE;YACzE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QACtD,CAAC;QAED,MAAM,SAAS,GAAG,UAAU;aACzB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,IAAI,IAAI,MAAM,YAAY,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;aACrE,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,QAAQ,GAAc;YAC1B,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,EAAE;YAChD;gBACE,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,kDAAkD,SAAS,qBAAqB,UAAU,qDAAqD;aACzJ;SACF,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;YACxF,OAAO,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QACzF,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QACtD,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,2EAA2E;AAC3E,SAAS,kBAAkB,CAAC,GAAW;IACrC,IAAI,CAAC;QACH,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAE/E,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAE5C,MAAM,UAAU,GAAY,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,SAAS,GAAG,mBAAmB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC5D,IAAI,CAAC,SAAS,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAEpC,OAAO;YACL,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI;YACjC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI;YACvC,UAAU,EAAE,SAAS,CAAC,IAAI,CAAC,UAAU;SACtC,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/vector/sqlite-vec.d.ts

@@ -0,0 +1,16 @@
+import type { DB } from '../storage/db.js';
+import type { VectorStore, VecFilter, VecHit } from '../contracts/index.js';
+export declare class SqliteVecStore implements VectorStore {
+    private db;
+    private dim;
+    readonly name: "sqlite-vec";
+    /** FEAT-409: dim defaults to DEFAULT_EMBED_DIM (1024) for backward
+     * compat — callers with a config/provider in scope should pass
+     * embed.dim (or cfg.embedding.dim) explicitly so this matches the
+     * memories_vec schema the DB was actually created with. */
+    constructor(db: DB, dim?: number);
+    upsert(id: string, vec: Float32Array): Promise<void>;
+    search(vec: Float32Array, k: number, filter?: VecFilter): Promise<VecHit[]>;
+    clear(): Promise<void>;
+    private allocateRowid;
+}

package/dist/vector/sqlite-vec.js

@@ -0,0 +1,49 @@
+import { DEFAULT_EMBED_DIM } from '../contracts/embed.js';
+export class SqliteVecStore {
+    db;
+    dim;
+    name = 'sqlite-vec';
+    /** FEAT-409: dim defaults to DEFAULT_EMBED_DIM (1024) for backward
+     * compat — callers with a config/provider in scope should pass
+     * embed.dim (or cfg.embedding.dim) explicitly so this matches the
+     * memories_vec schema the DB was actually created with. */
+    constructor(db, dim = DEFAULT_EMBED_DIM) {
+        this.db = db;
+        this.dim = dim;
+    }
+    async upsert(id, vec) {
+        if (vec.length !== this.dim)
+            throw new Error(`expected dim ${this.dim}, got ${vec.length}`);
+        const memoriesRowid = this.allocateRowid(id);
+        const buf = Buffer.from(vec.buffer);
+        const existing = this.db.prepare('SELECT rowid FROM memories_vec WHERE rowid = ?').get(BigInt(memoriesRowid));
+        if (existing) {
+            this.db.prepare('UPDATE memories_vec SET embedding = ? WHERE rowid = ?').run(buf, BigInt(memoriesRowid));
+        }
+        else {
+            this.db.prepare('INSERT INTO memories_vec (rowid, embedding) VALUES (?, ?)').run(BigInt(memoriesRowid), buf);
+        }
+    }
+    async search(vec, k, filter) {
+        if (filter && (filter.type?.length || filter.repo || filter.project || filter.since !== undefined)) {
+            throw new Error('VecFilter not yet implemented in sqlite-vec adapter — apply filters in the search layer instead');
+        }
+        const rows = this.db.prepare(`
+      SELECT m.id, mv.distance
+      FROM memories_vec mv
+      JOIN memories m ON m.rowid = mv.rowid
+      WHERE mv.embedding MATCH ? AND mv.k = ?
+    `).all(Buffer.from(vec.buffer), k);
+        return rows.map(r => ({ id: r.id, score: 1 / (1 + r.distance) }));
+    }
+    async clear() {
+        this.db.exec('DELETE FROM memories_vec');
+    }
+    allocateRowid(id) {
+        const r = this.db.prepare('SELECT rowid FROM memories WHERE id = ?').get(id);
+        if (!r)
+            throw new Error(`memory ${id} not in memories table — insert there first`);
+        return r.rowid;
+    }
+}
+//# sourceMappingURL=sqlite-vec.js.map

package/dist/vector/sqlite-vec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-vec.js","sourceRoot":"","sources":["../../src/vector/sqlite-vec.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAE1D,MAAM,OAAO,cAAc;IAML;IAAgB;IAL3B,IAAI,GAAG,YAAqB,CAAC;IACtC;;;+DAG2D;IAC3D,YAAoB,EAAM,EAAU,MAAc,iBAAiB;QAA/C,OAAE,GAAF,EAAE,CAAI;QAAU,QAAG,GAAH,GAAG,CAA4B;IAAG,CAAC;IAEvE,KAAK,CAAC,MAAM,CAAC,EAAU,EAAE,GAAiB;QACxC,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5F,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgC,CAAC;QAC7I,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uDAAuD,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;QAC3G,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2DAA2D,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/G,CAAC;IACH,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,GAAiB,EAAE,CAAS,EAAE,MAAkB;QAC3D,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,EAAE,CAAC;YACnG,MAAM,IAAI,KAAK,CAAC,iGAAiG,CAAC,CAAC;QACrH,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAK5B,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAqC,CAAC;QACvE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IAC3C,CAAC;IAEO,aAAa,CAAC,EAAU;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAgC,CAAC;QAC5G,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,UAAU,EAAE,6CAA6C,CAAC,CAAC;QACnF,OAAO,CAAC,CAAC,KAAK,CAAC;IACjB,CAAC;CACF"}