@rudderjs/ai 1.18.1 → 1.18.3

package/dist/doctor.js

@@ -1,5 +1,68 @@
-// @rudderjs/ai is deprecated. The AI engine now lives in @gemstack/ai-sdk.
-// This module re-exports it for backwards compatibility; import from
-// '@gemstack/ai-sdk/doctor' directly in new code.
-export * from '@gemstack/ai-sdk/doctor';
+// AI doctor checks contributed by @rudderjs/ai. This is a Rudder binding: it
+// registers into @rudderjs/console's doctor registry, so it lives here rather
+// than in the agnostic @gemstack/ai-sdk engine.
+import fs from 'node:fs';
+import path from 'node:path';
+import { registerDoctorCheck } from '@rudderjs/console';
+function readFileSafe(rel) {
+    try {
+        return fs.readFileSync(path.join(process.cwd(), rel), 'utf-8');
+    }
+    catch {
+        return null;
+    }
+}
+// Maps provider driver name → env var the user must set. Mirrors the
+// driver names listed in @gemstack/ai-sdk's provider implementations.
+const PROVIDER_ENV = {
+    anthropic: 'ANTHROPIC_API_KEY',
+    openai: 'OPENAI_API_KEY',
+    google: 'GOOGLE_AI_API_KEY',
+    bedrock: 'AWS_ACCESS_KEY_ID',
+    groq: 'GROQ_API_KEY',
+    openrouter: 'OPENROUTER_API_KEY',
+    // ollama, lmstudio: local — no key needed.
+};
+// Extracts driver names referenced by config/ai.ts WITHOUT importing the
+// module. We grep for `driver: '<name>'` literals — covers the scaffolded
+// shape.
+function declaredProviders() {
+    const text = readFileSafe('config/ai.ts') ??
+        readFileSafe('config/ai.js') ??
+        readFileSafe('config/ai.mjs') ?? '';
+    const matches = [...text.matchAll(/driver\s*:\s*['"]([^'"]+)['"]/g)];
+    return [...new Set(matches.map(m => m[1]).filter(Boolean))];
+}
+registerDoctorCheck({
+    id: 'ai:provider-keys',
+    category: 'ai',
+    title: 'AI provider API keys',
+    run() {
+        const providers = declaredProviders();
+        if (providers.length === 0) {
+            return { status: 'ok', message: 'no config/ai.ts or no providers declared — skip' };
+        }
+        const needsKey = providers.filter(p => p in PROVIDER_ENV);
+        if (needsKey.length === 0) {
+            return { status: 'ok', message: `${providers.length} provider(s) — all local (no keys required)` };
+        }
+        const missing = needsKey.filter(p => !process.env[PROVIDER_ENV[p]]);
+        if (missing.length === needsKey.length) {
+            return {
+                status: 'warn',
+                message: `none of ${needsKey.length} cloud provider(s) have an API key set`,
+                fix: `Set at least one of: ${needsKey.map(p => PROVIDER_ENV[p]).join(', ')} (or remove the providers from config/ai.ts if unused)`,
+                detail: `Declared providers: ${needsKey.join(', ')}`,
+            };
+        }
+        if (missing.length > 0) {
+            return {
+                status: 'warn',
+                message: `${needsKey.length - missing.length}/${needsKey.length} cloud provider(s) have keys`,
+                fix: `Set missing keys: ${missing.map(p => PROVIDER_ENV[p]).join(', ')} (or remove the providers from config/ai.ts if unused)`,
+            };
+        }
+        return { status: 'ok', message: `${needsKey.length} cloud provider(s), all keys present` };
+    },
+});
 //# sourceMappingURL=doctor.js.map

package/dist/doctor.js.map

@@ -1 +1 @@
-{"version":3,"file":"doctor.js","sourceRoot":"","sources":["../src/doctor.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,qEAAqE;AACrE,kDAAkD;AAClD,cAAc,yBAAyB,CAAA"}
+{"version":3,"file":"doctor.js","sourceRoot":"","sources":["../src/doctor.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,8EAA8E;AAC9E,gDAAgD;AAEhD,OAAO,EAAE,MAAM,SAAS,CAAA;AACxB,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,mBAAmB,EAAqB,MAAM,mBAAmB,CAAA;AAE1E,SAAS,YAAY,CAAC,GAAW;IAC/B,IAAI,CAAC;QAAC,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,IAAI,CAAA;IAAC,CAAC;AAC9F,CAAC;AAED,qEAAqE;AACrE,sEAAsE;AACtE,MAAM,YAAY,GAA2B;IAC3C,SAAS,EAAE,mBAAmB;IAC9B,MAAM,EAAK,gBAAgB;IAC3B,MAAM,EAAK,mBAAmB;IAC9B,OAAO,EAAI,mBAAmB;IAC9B,IAAI,EAAO,cAAc;IACzB,UAAU,EAAC,oBAAoB;IAC/B,2CAA2C;CAC5C,CAAA;AAED,yEAAyE;AACzE,0EAA0E;AAC1E,SAAS;AACT,SAAS,iBAAiB;IACxB,MAAM,IAAI,GACR,YAAY,CAAC,cAAc,CAAC;QAC5B,YAAY,CAAC,cAAc,CAAC;QAC5B,YAAY,CAAC,eAAe,CAAC,IAAI,EAAE,CAAA;IACrC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,gCAAgC,CAAC,CAAC,CAAA;IACpE,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AAC9D,CAAC;AAED,mBAAmB,CAAC;IAClB,EAAE,EAAQ,kBAAkB;IAC5B,QAAQ,EAAE,IAAI;IACd,KAAK,EAAK,sBAAsB;IAChC,GAAG;QACD,MAAM,SAAS,GAAG,iBAAiB,EAAE,CAAA;QACrC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,iDAAiD,EAAE,CAAA;QACrF,CAAC;QACD,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,YAAY,CAAC,CAAA;QACzD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC,MAAM,6CAA6C,EAAE,CAAA;QACpG,CAAC;QACD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;QACpE,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;YACvC,OAAO;gBACL,MAAM,EAAG,MAAM;gBACf,OAAO,EAAE,WAAW,QAAQ,CAAC,MAAM,wCAAwC;gBAC3E,GAAG,EAAM,wBAAwB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,wDAAwD;gBACtI,MAAM,EAAG,uBAAuB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACtD,CAAA;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO;gBACL,MAAM,EAAG,MAAM;gBACf,OAAO,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,8BAA8B;gBAC7F,GAAG,EAAM,qBAAqB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,wDAAwD;aACnI,CAAA;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,MAAM,sCAAsC,EAAE,CAAA;IAC5F,CAAC;CACF,CAAC,CAAA"}

package/dist/mcp/index.d.ts

@@ -1,2 +1,2 @@
-export * from '@gemstack/ai-sdk/mcp';
+export * from '@gemstack/ai-mcp';
 //# sourceMappingURL=index.d.ts.map

package/dist/mcp/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/mcp/index.ts"],"names":[],"mappings":"AAGA,cAAc,sBAAsB,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/mcp/index.ts"],"names":[],"mappings":"AAIA,cAAc,kBAAkB,CAAA"}

package/dist/mcp/index.js

@@ -1,5 +1,6 @@
-// @rudderjs/ai is deprecated. The AI engine now lives in @gemstack/ai-sdk.
-// This module re-exports it for backwards compatibility; import from
-// '@gemstack/ai-sdk/mcp' directly in new code.
-export * from '@gemstack/ai-sdk/mcp';
+// @rudderjs/ai is deprecated. The agent<->MCP bridge now lives in
+// @gemstack/ai-mcp (it graduated out of @gemstack/ai-sdk at 0.3.0). This
+// module re-exports it for backwards compatibility; import from
+// '@gemstack/ai-mcp' directly in new code.
+export * from '@gemstack/ai-mcp';
 //# sourceMappingURL=index.js.map

package/dist/mcp/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/mcp/index.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,qEAAqE;AACrE,+CAA+C;AAC/C,cAAc,sBAAsB,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/mcp/index.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,yEAAyE;AACzE,gEAAgE;AAChE,2CAA2C;AAC3C,cAAc,kBAAkB,CAAA"}

package/dist/memory-embedding/index.d.ts

@@ -1,2 +1,121 @@
-export * from '@gemstack/ai-sdk/memory-embedding';
+/**
+ * `@rudderjs/ai/memory-embedding` — embedding-backed {@link UserMemory}
+ * for #A4 Phase 5.
+ *
+ * Composes Phase 4's {@link OrmUserMemory} with the embedding
+ * provider registered on {@link AiRegistry}: `remember()` embeds the
+ * fact and writes the Float32-packed vector into the row's
+ * `embedding` column; `recall()` embeds the query and ranks by
+ * cosine similarity. `forget()` / `forgetAll()` delegate to the
+ * inner store — the embedding lives in the same row, so deleting
+ * the row deletes the vector. GDPR right-to-be-forgotten cascades
+ * automatically.
+ *
+ * v1 is **pure-JS cosine over the user's full set** — fine up to
+ * a few thousand facts per user. For larger workloads, B7 lands a
+ * pgvector-backed `EmbeddingUserMemory` that pushes the dot-product
+ * into the database.
+ *
+ * @example
+ * ```ts
+ * import { OrmUserMemory } from '@rudderjs/ai/memory-orm'
+ * import { EmbeddingUserMemory } from '@rudderjs/ai/memory-embedding'
+ *
+ * const memory = new EmbeddingUserMemory({
+ *   inner: new OrmUserMemory(),
+ *   model: 'openai/text-embedding-3-small',
+ *   threshold: 0.5,    // cosine floor; matches below are dropped
+ * })
+ * ```
+ *
+ * **Pre-Phase-5 facts** (rows with `embedding === null`) fall back to
+ * token-overlap matching against the `fact` column — same shape as
+ * `MemoryUserMemory.recall()`. So upgrading from `OrmUserMemory` to
+ * `EmbeddingUserMemory` doesn't lose recall on existing rows; new
+ * `remember()` calls populate the embedding column going forward.
+ */
+import { OrmUserMemory } from '../memory-orm/index.js';
+import type { MemoryEntry, UserMemory } from '@gemstack/ai-sdk';
+export interface EmbeddingUserMemoryOptions {
+    /**
+     * The composed inner store. Must be {@link OrmUserMemory} for v1
+     * — the composer reads/writes the `embedding Bytes?` column on
+     * the same row. Other backends (Pinecone, Weaviate) implement
+     * their own.
+     */
+    inner: OrmUserMemory;
+    /**
+     * Embedding model id (`'<provider>/<model>'`). Used for both
+     * fact embedding on `remember()` and query embedding on
+     * `recall()`. Default: whatever `AI.embed()` picks (`AiRegistry`
+     * default).
+     */
+    model?: string;
+    /**
+     * Cosine-similarity floor in `[-1, 1]`. Matches below the
+     * threshold are dropped before sorting. Default `0` — return
+     * everything ranked. Tighten for higher precision; loosen for
+     * higher recall.
+     */
+    threshold?: number;
+    /**
+     * Optional fallback for rows whose `embedding` column is `null`
+     * (rows persisted without the embedding composer wired in).
+     *
+     * - `'token-overlap'` (default) — score 0 if any ≥3-char token
+     *   from the query appears in the row's `fact`. Lets you
+     *   upgrade `OrmUserMemory` → `EmbeddingUserMemory` without
+     *   losing recall on existing rows.
+     * - `'skip'` — drop null-embedding rows entirely.
+     */
+    nullEmbeddingFallback?: 'token-overlap' | 'skip';
+}
+export declare class EmbeddingUserMemory implements UserMemory {
+    private readonly inner;
+    private readonly model;
+    private readonly threshold;
+    private readonly fallback;
+    constructor(opts: EmbeddingUserMemoryOptions);
+    remember(userId: string, fact: string, opts?: {
+        tags?: string[];
+        score?: number;
+    }): Promise<MemoryEntry>;
+    recall(userId: string, query: string, opts?: {
+        limit?: number;
+        tags?: string[];
+    }): Promise<MemoryEntry[]>;
+    forget(userId: string, factId: string): Promise<void>;
+    list(userId: string, opts?: {
+        tags?: string[];
+        limit?: number;
+    }): Promise<MemoryEntry[]>;
+    forgetAll(userId: string): Promise<void>;
+    /**
+     * Single-string embedding via the {@link AI} facade. Returns the
+     * first (and only) embedding vector. Throws on provider/network
+     * failure; callers route through try/catch and degrade.
+     */
+    private embed;
+}
+/**
+ * Pack a `number[]` into a Float32 byte buffer. 4 bytes per dim;
+ * a 1536-dim OpenAI embedding compresses to 6144 bytes.
+ *
+ * Uses `ArrayBuffer` + `Float32Array` so the output is a portable
+ * `Uint8Array` (works in Node, browser, RN). Prisma's `Bytes`
+ * column accepts both `Uint8Array` and `Buffer`.
+ */
+export declare function serializeVector(v: number[]): Uint8Array;
+/**
+ * Reverse of {@link serializeVector}. Reads the underlying byte
+ * buffer as Float32 and returns a fresh `number[]` so callers can
+ * mutate without affecting the source row.
+ */
+export declare function deserializeVector(bytes: Uint8Array): number[];
+/**
+ * Cosine similarity in `[-1, 1]`. Returns `0` when either vector
+ * has zero magnitude, or when lengths don't match (defensive — should
+ * never happen if remember/recall use the same embedding model).
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
 //# sourceMappingURL=index.d.ts.map

package/dist/memory-embedding/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory-embedding/index.ts"],"names":[],"mappings":"AAGA,cAAc,mCAAmC,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory-embedding/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAGH,OAAO,EAAE,aAAa,EAAoB,MAAM,wBAAwB,CAAA;AACxE,OAAO,KAAK,EACV,WAAW,EACX,UAAU,EACX,MAAM,kBAAkB,CAAA;AAEzB,MAAM,WAAW,0BAA0B;IACzC;;;;;OAKG;IACH,KAAK,EAAE,aAAa,CAAA;IACpB;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAA;IACd;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB;;;;;;;;;OASG;IACH,qBAAqB,CAAC,EAAE,eAAe,GAAG,MAAM,CAAA;CACjD;AAED,qBAAa,mBAAoB,YAAW,UAAU;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAuB;IAC7C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAQ;IAClC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA0B;gBAEvC,IAAI,EAAE,0BAA0B;IAOtC,QAAQ,CACZ,MAAM,EAAE,MAAM,EACd,IAAI,EAAI,MAAM,EACd,IAAI,CAAC,EAAG;QAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1C,OAAO,CAAC,WAAW,CAAC;IAkBjB,MAAM,CACV,MAAM,EAAE,MAAM,EACd,KAAK,EAAG,MAAM,EACd,IAAI,CAAC,EAAG;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1C,OAAO,CAAC,WAAW,EAAE,CAAC;IA4CnB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAMrD,IAAI,CACR,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAG;QAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1C,OAAO,CAAC,WAAW,EAAE,CAAC;IAInB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAK9C;;;;OAIG;YACW,KAAK;CAMpB;AAID;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,UAAU,CAKvD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE,CAK7D;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAcjE"}

package/dist/memory-embedding/index.js

@@ -1,5 +1,229 @@
-// @rudderjs/ai is deprecated. The AI engine now lives in @gemstack/ai-sdk.
-// This module re-exports it for backwards compatibility; import from
-// '@gemstack/ai-sdk/memory-embedding' directly in new code.
-export * from '@gemstack/ai-sdk/memory-embedding';
+/**
+ * `@rudderjs/ai/memory-embedding` — embedding-backed {@link UserMemory}
+ * for #A4 Phase 5.
+ *
+ * Composes Phase 4's {@link OrmUserMemory} with the embedding
+ * provider registered on {@link AiRegistry}: `remember()` embeds the
+ * fact and writes the Float32-packed vector into the row's
+ * `embedding` column; `recall()` embeds the query and ranks by
+ * cosine similarity. `forget()` / `forgetAll()` delegate to the
+ * inner store — the embedding lives in the same row, so deleting
+ * the row deletes the vector. GDPR right-to-be-forgotten cascades
+ * automatically.
+ *
+ * v1 is **pure-JS cosine over the user's full set** — fine up to
+ * a few thousand facts per user. For larger workloads, B7 lands a
+ * pgvector-backed `EmbeddingUserMemory` that pushes the dot-product
+ * into the database.
+ *
+ * @example
+ * ```ts
+ * import { OrmUserMemory } from '@rudderjs/ai/memory-orm'
+ * import { EmbeddingUserMemory } from '@rudderjs/ai/memory-embedding'
+ *
+ * const memory = new EmbeddingUserMemory({
+ *   inner: new OrmUserMemory(),
+ *   model: 'openai/text-embedding-3-small',
+ *   threshold: 0.5,    // cosine floor; matches below are dropped
+ * })
+ * ```
+ *
+ * **Pre-Phase-5 facts** (rows with `embedding === null`) fall back to
+ * token-overlap matching against the `fact` column — same shape as
+ * `MemoryUserMemory.recall()`. So upgrading from `OrmUserMemory` to
+ * `EmbeddingUserMemory` doesn't lose recall on existing rows; new
+ * `remember()` calls populate the embedding column going forward.
+ */
+import { AI } from '@gemstack/ai-sdk';
+import { UserMemoryRecord } from '../memory-orm/index.js';
+export class EmbeddingUserMemory {
+    inner;
+    model;
+    threshold;
+    fallback;
+    constructor(opts) {
+        this.inner = opts.inner;
+        if (opts.model !== undefined)
+            this.model = opts.model;
+        this.threshold = opts.threshold ?? 0;
+        this.fallback = opts.nullEmbeddingFallback ?? 'token-overlap';
+    }
+    async remember(userId, fact, opts) {
+        const entry = await this.inner.remember(userId, fact, opts);
+        // Best-effort embed + persist. Failures are logged via the inner
+        // store still having the entry; we don't break the caller.
+        try {
+            const vector = await this.embed(fact);
+            await UserMemoryRecord.update(entry.id, {
+                embedding: serializeVector(vector),
+            });
+        }
+        catch {
+            // Embedding failed (network, missing peer SDK). The row is
+            // already in the store; recall will fall back to
+            // token-overlap if the column stays null. No-op.
+        }
+        return entry;
+    }
+    async recall(userId, query, opts) {
+        let queryVector = null;
+        try {
+            queryVector = await this.embed(query);
+        }
+        catch {
+            // Embed failed — fall through to token-overlap on every row.
+        }
+        const rows = await UserMemoryRecord.where('userId', userId).get();
+        const wanted = opts?.tags;
+        const queryTokens = tokenize(query);
+        const scored = [];
+        for (const row of rows) {
+            const entry = rowToEntry(row);
+            if (!matchesTags(entry, wanted))
+                continue;
+            let score;
+            if (queryVector !== null && row.embedding !== null && row.embedding !== undefined) {
+                const factVector = deserializeVector(row.embedding);
+                score = cosineSimilarity(queryVector, factVector);
+            }
+            else if (this.fallback === 'skip') {
+                continue;
+            }
+            else {
+                // token-overlap fallback — score 0 (mid-range) if any
+                // token matches, otherwise drop.
+                if (factHasAnyToken(entry.fact, queryTokens)) {
+                    score = 0;
+                }
+                else {
+                    continue;
+                }
+            }
+            if (score >= this.threshold) {
+                scored.push({ entry, score });
+            }
+        }
+        scored.sort((a, b) => b.score - a.score);
+        const capped = capLimit(scored, opts?.limit);
+        return capped.map(s => ({ ...s.entry, score: s.score }));
+    }
+    async forget(userId, factId) {
+        // The embedding lives in the same row — deleting via the inner
+        // store deletes the vector too. GDPR cascade is automatic.
+        return this.inner.forget(userId, factId);
+    }
+    async list(userId, opts) {
+        return this.inner.list(userId, opts);
+    }
+    async forgetAll(userId) {
+        if (!this.inner.forgetAll)
+            return;
+        return this.inner.forgetAll(userId);
+    }
+    /**
+     * Single-string embedding via the {@link AI} facade. Returns the
+     * first (and only) embedding vector. Throws on provider/network
+     * failure; callers route through try/catch and degrade.
+     */
+    async embed(text) {
+        const result = await AI.embed(text, this.model ? { model: this.model } : undefined);
+        const vec = result.embeddings[0];
+        if (!vec)
+            throw new Error('[ai-sdk] embed() returned no vectors');
+        return vec;
+    }
+}
+// ─── Vector + similarity helpers (exported for tests + B7) ─────
+/**
+ * Pack a `number[]` into a Float32 byte buffer. 4 bytes per dim;
+ * a 1536-dim OpenAI embedding compresses to 6144 bytes.
+ *
+ * Uses `ArrayBuffer` + `Float32Array` so the output is a portable
+ * `Uint8Array` (works in Node, browser, RN). Prisma's `Bytes`
+ * column accepts both `Uint8Array` and `Buffer`.
+ */
+export function serializeVector(v) {
+    const buf = new ArrayBuffer(v.length * 4);
+    const view = new Float32Array(buf);
+    for (let i = 0; i < v.length; i++)
+        view[i] = v[i];
+    return new Uint8Array(buf);
+}
+/**
+ * Reverse of {@link serializeVector}. Reads the underlying byte
+ * buffer as Float32 and returns a fresh `number[]` so callers can
+ * mutate without affecting the source row.
+ */
+export function deserializeVector(bytes) {
+    // The `bytes.buffer` may be a slice; honor byteOffset + byteLength
+    // so we don't read into adjacent memory.
+    const view = new Float32Array(bytes.buffer, bytes.byteOffset, bytes.byteLength / 4);
+    return Array.from(view);
+}
+/**
+ * Cosine similarity in `[-1, 1]`. Returns `0` when either vector
+ * has zero magnitude, or when lengths don't match (defensive — should
+ * never happen if remember/recall use the same embedding model).
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        const ai = a[i];
+        const bi = b[i];
+        dot += ai * bi;
+        magA += ai * ai;
+        magB += bi * bi;
+    }
+    if (magA === 0 || magB === 0)
+        return 0;
+    return dot / (Math.sqrt(magA) * Math.sqrt(magB));
+}
+// ─── Internal helpers ─────────────────────────────────────
+function rowToEntry(row) {
+    const tags = row.getTags();
+    const out = {
+        id: row.id,
+        userId: row.userId,
+        fact: row.fact,
+        createdAt: row.createdAt,
+    };
+    if (tags.length > 0)
+        out.tags = tags;
+    if (row.score != null)
+        out.score = row.score;
+    if (row.updatedAt != null)
+        out.updatedAt = row.updatedAt;
+    return out;
+}
+function tokenize(s) {
+    const out = new Set();
+    for (const tok of s.toLowerCase().split(/[^a-z0-9]+/)) {
+        if (tok.length >= 3)
+            out.add(tok);
+    }
+    return out;
+}
+function factHasAnyToken(fact, queryTokens) {
+    if (queryTokens.size === 0)
+        return true;
+    const factTokens = tokenize(fact);
+    for (const t of factTokens)
+        if (queryTokens.has(t))
+            return true;
+    return false;
+}
+function matchesTags(entry, wanted) {
+    if (!wanted || wanted.length === 0)
+        return true;
+    if (!entry.tags || entry.tags.length === 0)
+        return false;
+    return wanted.every(t => entry.tags.includes(t));
+}
+function capLimit(items, limit) {
+    return limit !== undefined && limit > 0 ? items.slice(0, limit) : items;
+}
 //# sourceMappingURL=index.js.map

package/dist/memory-embedding/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/memory-embedding/index.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,qEAAqE;AACrE,4DAA4D;AAC5D,cAAc,mCAAmC,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/memory-embedding/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAA;AACrC,OAAO,EAAiB,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AAyCxE,MAAM,OAAO,mBAAmB;IACb,KAAK,CAAkB;IACvB,KAAK,CAAuB;IAC5B,SAAS,CAAQ;IACjB,QAAQ,CAA0B;IAEnD,YAAY,IAAgC;QAC1C,IAAI,CAAC,KAAK,GAAO,IAAI,CAAC,KAAK,CAAA;QAC3B,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;QACrD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,QAAQ,GAAI,IAAI,CAAC,qBAAqB,IAAI,eAAe,CAAA;IAChE,CAAC;IAED,KAAK,CAAC,QAAQ,CACZ,MAAc,EACd,IAAc,EACd,IAA2C;QAE3C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAE3D,iEAAiE;QACjE,2DAA2D;QAC3D,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACrC,MAAM,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE;gBACtC,SAAS,EAAE,eAAe,CAAC,MAAM,CAAC;aACnC,CAAC,CAAA;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,2DAA2D;YAC3D,iDAAiD;YACjD,iDAAiD;QACnD,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,KAAK,CAAC,MAAM,CACV,MAAc,EACd,KAAc,EACd,IAA2C;QAE3C,IAAI,WAAW,GAAoB,IAAI,CAAA;QACvC,IAAI,CAAC;YACH,WAAW,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,6DAA6D;QAC/D,CAAC;QAED,MAAM,IAAI,GAAI,MAAM,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,GAAG,EAAmC,CAAA;QACnG,MAAM,MAAM,GAAG,IAAI,EAAE,IAAI,CAAA;QAEzB,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;QAEnC,MAAM,MAAM,GAAiD,EAAE,CAAA;QAC/D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAA;YAC7B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,SAAQ;YAEzC,IAAI,KAAa,CAAA;YACjB,IAAI,WAAW,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAClF,MAAM,UAAU,GAAG,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBACnD,KAAK,GAAG,gBAAgB,CAAC,WAAW,EAAE,UAAU,CAAC,CAAA;YACnD,CAAC;iBAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;gBACpC,SAAQ;YACV,CAAC;iBAAM,CAAC;gBACN,sDAAsD;gBACtD,iCAAiC;gBACjC,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;oBAC7C,KAAK,GAAG,CAAC,CAAA;gBACX,CAAC;qBAAM,CAAC;oBACN,SAAQ;gBACV,CAAC;YACH,CAAC;YAED,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QAC5C,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC1D,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,MAAc,EAAE,MAAc;QACzC,+DAA+D;QAC/D,2DAA2D;QAC3D,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC1C,CAAC;IAED,KAAK,CAAC,IAAI,CACR,MAAc,EACd,IAA2C;QAE3C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IACtC,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,MAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,OAAM;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;IACrC,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,KAAK,CAAC,IAAY;QAC9B,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QACnF,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAA;QACjE,OAAO,GAAG,CAAA;IACZ,CAAC;CACF;AAED,kEAAkE;AAElE;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,CAAW;IACzC,MAAM,GAAG,GAAI,IAAI,WAAW,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC1C,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAA;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;IAClD,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;AAC5B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAiB;IACjD,mEAAmE;IACnE,yCAAyC;IACzC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAA;IACnF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAA;IACnC,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;QAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;QAChB,GAAG,IAAK,EAAE,GAAG,EAAE,CAAA;QACf,IAAI,IAAI,EAAE,GAAG,EAAE,CAAA;QACf,IAAI,IAAI,EAAE,GAAG,EAAE,CAAA;IACjB,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IACtC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;AAClD,CAAC;AAED,6DAA6D;AAE7D,SAAS,UAAU,CAAC,GAAqB;IACvC,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,EAAE,CAAA;IAC1B,MAAM,GAAG,GAAgB;QACvB,EAAE,EAAS,GAAG,CAAC,EAAE;QACjB,MAAM,EAAK,GAAG,CAAC,MAAM;QACrB,IAAI,EAAO,GAAG,CAAC,IAAI;QACnB,SAAS,EAAE,GAAG,CAAC,SAAS;KACzB,CAAA;IACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAS,GAAG,CAAC,IAAI,GAAQ,IAAI,CAAA;IAChD,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI;QAAO,GAAG,CAAC,KAAK,GAAO,GAAG,CAAC,KAAK,CAAA;IACrD,IAAI,GAAG,CAAC,SAAS,IAAI,IAAI;QAAG,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;IACzD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;QACtD,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IACnC,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,eAAe,CAAC,IAAY,EAAE,WAAwB;IAC7D,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACvC,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;IACjC,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAA;IAC/D,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,WAAW,CAAC,KAAkB,EAAE,MAA4B;IACnE,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/C,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACxD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AACnD,CAAC;AAED,SAAS,QAAQ,CAAI,KAAU,EAAE,KAAyB;IACxD,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;AACzE,CAAC"}

package/dist/memory-orm/index.d.ts

@@ -1,2 +1,118 @@
-export * from '@gemstack/ai-sdk/memory-orm';
+/**
+ * `@rudderjs/ai/memory-orm` — ORM-backed {@link UserMemory} for #A4 Phase 4.
+ *
+ * Stores per-user facts in a `UserMemory` table via the registered
+ * `@rudderjs/orm` adapter (Prisma today; Drizzle as well once the user's
+ * tables are wired). Drop-in alongside Phase 1's in-process
+ * `MemoryUserMemory`.
+ *
+ * Wire it from your AI config:
+ *
+ * ```ts
+ * // config/ai.ts
+ * import type { AiConfig } from '@gemstack/ai-sdk'
+ * import { OrmUserMemory } from '@rudderjs/ai/memory-orm'
+ *
+ * export default {
+ *   default: 'anthropic/claude-sonnet-4-5',
+ *   providers: { ... },
+ *   memory: new OrmUserMemory(),
+ * } satisfies AiConfig
+ * ```
+ *
+ * The schema lives at `@rudderjs/ai/memory-orm`'s {@link userMemoryPrismaSchema}
+ * — copy it into your Prisma schema. The optional `embedding Bytes?`
+ * column is shipped here in Phase 4 (intentionally nullable) so Phase 5's
+ * `EmbeddingUserMemory` can populate it without forcing an additive
+ * migration.
+ */
+import { Model } from '@rudderjs/orm';
+import type { MemoryEntry, UserMemory } from '@gemstack/ai-sdk';
+/**
+ * The Model row backing {@link OrmUserMemory}. Exposed so apps that
+ * want their own queries (admin views, audit dumps) can use the
+ * familiar `UserMemoryRecord.where(...).get()` instead of routing
+ * everything through the {@link UserMemory} interface.
+ *
+ * Tags persist as a JSON-encoded string in the `tags` column — both
+ * Prisma's portable `String?` and Drizzle's `text` work without
+ * needing native array columns. The {@link UserMemory.recall} path
+ * filters tags in JavaScript for the same reason.
+ *
+ * The `embedding Bytes?` column is in the schema as of Phase 4
+ * (nullable) so `@rudderjs/ai/memory-embedding`'s `EmbeddingUserMemory`
+ * (Phase 5) writes the Float32-packed vector here on `remember()` and
+ * reads it for cosine recall. `OrmUserMemory` ignores it — the
+ * column stays `null` for any row stored without the embedding
+ * composer.
+ */
+export declare class UserMemoryRecord extends Model {
+    static table: string;
+    static fillable: string[];
+    id: string;
+    userId: string;
+    fact: string;
+    /** JSON-encoded `string[]` or null. Use `getTags()` for the parsed shape. */
+    tags: string | null;
+    score: number | null;
+    /**
+     * Float32-packed vector serialized via
+     * `@rudderjs/ai/memory-embedding`'s `serializeVector` /
+     * `deserializeVector`. `null` when the row was stored without the
+     * embedding composer (Phase 4-only setups).
+     */
+    embedding: Uint8Array | null;
+    createdAt: Date;
+    updatedAt: Date | null;
+    /** Parsed tags array; empty when nothing was stored. */
+    getTags(): string[];
+}
+/**
+ * `UserMemory` implementation that persists rows to the registered
+ * ORM adapter. Designed for production use — the in-process
+ * `MemoryUserMemory` is for tests and dev.
+ *
+ * Adapter coverage:
+ * - Prisma — works out of the box; copy {@link userMemoryPrismaSchema}
+ *   into your schema.
+ * - Drizzle — works once you define a table matching the schema's
+ *   columns and register it via `tables: { userMemory: <table> }` on
+ *   the `drizzle()` config.
+ *
+ * Recall semantics: case-insensitive **token-OR-LIKE** matching against
+ * the `fact` column. The query is tokenized on non-alphanumeric
+ * boundaries (≥3-char tokens) and any row whose `fact` matches at
+ * least one token via `LIKE %tok%` is returned. Mirrors Phase 1's
+ * `MemoryUserMemory.recall()` behavior so the two backends are
+ * swap-compatible. Tag scope is applied JS-side after fetch — pushing
+ * tag-array filtering into the WHERE is adapter-specific and lands in a
+ * follow-up.
+ */
+export declare class OrmUserMemory implements UserMemory {
+    remember(userId: string, fact: string, opts?: {
+        tags?: string[];
+        score?: number;
+    }): Promise<MemoryEntry>;
+    recall(userId: string, query: string, opts?: {
+        limit?: number;
+        tags?: string[];
+    }): Promise<MemoryEntry[]>;
+    forget(userId: string, factId: string): Promise<void>;
+    list(userId: string, opts?: {
+        tags?: string[];
+        limit?: number;
+    }): Promise<MemoryEntry[]>;
+    forgetAll(userId: string): Promise<void>;
+}
+/**
+ * Reference Prisma schema for `OrmUserMemory`. Copy into your
+ * `prisma/schema/<file>.prisma` (or paste alongside an existing
+ * model). The `embedding Bytes?` column is intentionally nullable so
+ * Phase 5's `EmbeddingUserMemory` becomes additive — no schema
+ * migration when you upgrade.
+ *
+ * SQLite stores `Bytes` as `BLOB`; Postgres stores it as `bytea`.
+ * Both work for the dot-product implementation Phase 5 will use.
+ */
+export declare const userMemoryPrismaSchema = "model UserMemory {\n  id        String   @id @default(cuid())\n  userId    String\n  fact      String\n  /// JSON-encoded `string[]` of tags, or null\n  tags      String?\n  /// Confidence score in [0, 1] \u2014 extract sets this from the model's self-rating\n  score     Float?\n  /// Phase 5 \u2014 vector embedding for cosine recall (nullable so Phase 4 ignores it)\n  embedding Bytes?\n  createdAt DateTime @default(now())\n  updatedAt DateTime @updatedAt\n\n  @@index([userId])\n}\n";
 //# sourceMappingURL=index.d.ts.map

package/dist/memory-orm/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory-orm/index.ts"],"names":[],"mappings":"AAGA,cAAc,6BAA6B,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory-orm/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AACrC,OAAO,KAAK,EACV,WAAW,EACX,UAAU,EACX,MAAM,kBAAkB,CAAA;AAIzB;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,OAAgB,KAAK,SAAe;IAEpC,OAAgB,QAAQ,WAAmD;IAEnE,EAAE,EAAS,MAAM,CAAA;IACjB,MAAM,EAAK,MAAM,CAAA;IACjB,IAAI,EAAO,MAAM,CAAA;IACzB,6EAA6E;IACrE,IAAI,EAAO,MAAM,GAAG,IAAI,CAAA;IACxB,KAAK,EAAM,MAAM,GAAG,IAAI,CAAA;IAChC;;;;;OAKG;IACK,SAAS,EAAE,UAAU,GAAG,IAAI,CAAA;IAC5B,SAAS,EAAE,IAAI,CAAA;IACf,SAAS,EAAE,IAAI,GAAG,IAAI,CAAA;IAE9B,wDAAwD;IACxD,OAAO,IAAI,MAAM,EAAE;CASpB;AAID;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,aAAc,YAAW,UAAU;IACxC,QAAQ,CACZ,MAAM,EAAE,MAAM,EACd,IAAI,EAAI,MAAM,EACd,IAAI,CAAC,EAAG;QAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1C,OAAO,CAAC,WAAW,CAAC;IASjB,MAAM,CACV,MAAM,EAAE,MAAM,EACd,KAAK,EAAG,MAAM,EACd,IAAI,CAAC,EAAG;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1C,OAAO,CAAC,WAAW,EAAE,CAAC;IAgBnB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKrD,IAAI,CACR,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAG;QAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1C,OAAO,CAAC,WAAW,EAAE,CAAC;IAMnB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAG/C;AAID;;;;;;;;;GASG;AACH,eAAO,MAAM,sBAAsB,4eAelC,CAAA"}