@massa-ai/core 1.2.1

package/dist/services/memory/consolidator.d.ts

@@ -0,0 +1,92 @@
+/**
+ * Memory consolidation window (Phase 1, P1-CONSOLIDATE, borrowed from
+ * ai-memory ConsolidatedBatch).
+ *
+ * Two-stage:
+ *   1. Rule-based prefilter: cluster a candidate set by `project_id` and
+ *      pairwise embedding cosine >= 0.65, bounding the window to top-N (8)
+ *      most recent. No LLM. Returns null if no cluster of >= 2 exists.
+ *   2. LLM merge: produce a `ConsolidatedBatch` via `generateObject` + a zod
+ *      schema enforcing type/level enums. Returns null if the LLM is disabled
+ *      or fails (caller's rule-based path proceeds).
+ *
+ * Pure over its inputs + the injected `llm` handle — no DB, no global state.
+ */
+import { z } from "zod";
+import type { MemoryRow } from "../../data/memory/memory-repository.js";
+/** Tunable prefilter constants. */
+export declare const CONSOLIDATE_COSINE_THRESHOLD = 0.65;
+export declare const CONSOLIDATE_MAX_WINDOW = 8;
+declare const MEMORY_TYPE_VALUES: readonly ["critical", "conversation", "code", "decision", "pattern"];
+declare const MEMORY_LEVEL_VALUES: readonly [0, 1, 2, 3, 4];
+/** Zod schema enforcing type/level enums — rejects malformed LLM output. */
+export declare const ConsolidatedBatchSchema: z.ZodObject<{
+    summary: z.ZodString;
+    type: z.ZodEnum<{
+        code: "code";
+        pattern: "pattern";
+        decision: "decision";
+        critical: "critical";
+        conversation: "conversation";
+    }>;
+    level: z.ZodUnion<readonly [z.ZodLiteral<0>, z.ZodLiteral<1>, z.ZodLiteral<2>, z.ZodLiteral<3>, z.ZodLiteral<4>]>;
+    rationale: z.ZodString;
+    sourceIds: z.ZodArray<z.ZodString>;
+}, z.core.$strip>;
+export type ConsolidatedBatchInput = z.infer<typeof ConsolidatedBatchSchema>;
+export interface ConsolidatedBatch {
+    id: string;
+    sourceIds: string[];
+    summary: string;
+    type: (typeof MEMORY_TYPE_VALUES)[number];
+    level: (typeof MEMORY_LEVEL_VALUES)[number];
+    rationale: string;
+}
+/** Candidate memory shape needed by the prefilter. */
+export interface ConsolidateCandidate {
+    id: string;
+    projectId?: string | null;
+    importance: number;
+    /** Embedding as stored: Buffer/Uint8Array (DB BLOB), Float32Array, or number[]. */
+    embedding?: Buffer | Uint8Array | number[] | Float32Array | null;
+    createdAt?: number;
+}
+/** Injectable LLM surface (matches the `llm` export from llm-client.ts). */
+export interface LlmSurface {
+    object<T>(prompt: string, schema: z.ZodSchema<T>, opts?: {
+        timeoutMs?: number;
+        modelRole?: "instruct" | "code";
+    }): Promise<{
+        ok: boolean;
+        value?: T;
+        error?: string;
+    }>;
+    isEnabled(): boolean;
+}
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Prefilter: pick the best cluster of >= 2 near-duplicate memories.
+ * Returns the window (source candidates) or null if none qualifies.
+ */
+export declare function pickConsolidationWindow(candidates: ConsolidateCandidate[], opts?: {
+    threshold?: number;
+    maxWindow?: number;
+}): ConsolidateCandidate[] | null;
+/**
+ * Run the full two-stage consolidation over a candidate set. Returns a
+ * ConsolidatedBatch on success, or null when:
+ *   - no qualifying cluster exists (prefilter),
+ *   - the LLM is disabled,
+ *   - the LLM fails or returns an invalid object.
+ *
+ * `idFactory` is injected so callers/tests can control the batch id.
+ */
+export declare function consolidateWindow(candidates: ConsolidateCandidate[], llm: LlmSurface, opts?: {
+    threshold?: number;
+    maxWindow?: number;
+    idFactory?: () => string;
+}): Promise<ConsolidatedBatch | null>;
+/** Convenience: convert MemoryRow[] to candidates (embedding preserved as Buffer). */
+export declare function rowsToCandidates(rows: MemoryRow[]): ConsolidateCandidate[];
+export {};
+//# sourceMappingURL=consolidator.d.ts.map

package/dist/services/memory/consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../../../src/services/memory/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wCAAwC,CAAC;AAGxE,mCAAmC;AACnC,eAAO,MAAM,4BAA4B,OAAO,CAAC;AACjD,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC,QAAA,MAAM,kBAAkB,sEAMd,CAAC;AAEX,QAAA,MAAM,mBAAmB,0BAA2B,CAAC;AAErD,4EAA4E;AAC5E,eAAO,MAAM,uBAAuB;;;;;;;;;;;;iBAYlC,CAAC;AAEH,MAAM,MAAM,sBAAsB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,uBAAuB,CAAC,CAAC;AAE7E,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1C,KAAK,EAAE,CAAC,OAAO,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5C,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,sDAAsD;AACtD,MAAM,WAAW,oBAAoB;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,mFAAmF;IACnF,SAAS,CAAC,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,EAAE,GAAG,YAAY,GAAG,IAAI,CAAC;IACjE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,4EAA4E;AAC5E,MAAM,WAAW,UAAU;IACzB,MAAM,CAAC,CAAC,EACN,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EACtB,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,UAAU,GAAG,MAAM,CAAA;KAAE,GAC7D,OAAO,CAAC;QAAE,EAAE,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvD,SAAS,IAAI,OAAO,CAAC;CACtB;AAwBD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAUjE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,UAAU,EAAE,oBAAoB,EAAE,EAClC,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GACpD,oBAAoB,EAAE,GAAG,IAAI,CA6C/B;AAqBD;;;;;;;;GAQG;AACH,wBAAsB,iBAAiB,CACrC,UAAU,EAAE,oBAAoB,EAAE,EAClC,GAAG,EAAE,UAAU,EACf,IAAI,GAAE;IACJ,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,MAAM,CAAC;CACrB,GACL,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,CAmBnC;AAED,sFAAsF;AACtF,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,oBAAoB,EAAE,CAQ1E"}

package/dist/services/memory/consolidator.js

@@ -0,0 +1,182 @@
+/**
+ * Memory consolidation window (Phase 1, P1-CONSOLIDATE, borrowed from
+ * ai-memory ConsolidatedBatch).
+ *
+ * Two-stage:
+ *   1. Rule-based prefilter: cluster a candidate set by `project_id` and
+ *      pairwise embedding cosine >= 0.65, bounding the window to top-N (8)
+ *      most recent. No LLM. Returns null if no cluster of >= 2 exists.
+ *   2. LLM merge: produce a `ConsolidatedBatch` via `generateObject` + a zod
+ *      schema enforcing type/level enums. Returns null if the LLM is disabled
+ *      or fails (caller's rule-based path proceeds).
+ *
+ * Pure over its inputs + the injected `llm` handle — no DB, no global state.
+ */
+import { z } from "zod";
+/** Tunable prefilter constants. */
+export const CONSOLIDATE_COSINE_THRESHOLD = 0.65;
+export const CONSOLIDATE_MAX_WINDOW = 8;
+const MEMORY_TYPE_VALUES = [
+    "critical",
+    "conversation",
+    "code",
+    "decision",
+    "pattern",
+];
+const MEMORY_LEVEL_VALUES = [0, 1, 2, 3, 4];
+/** Zod schema enforcing type/level enums — rejects malformed LLM output. */
+export const ConsolidatedBatchSchema = z.object({
+    summary: z.string().min(1),
+    type: z.enum(MEMORY_TYPE_VALUES),
+    level: z.union([
+        z.literal(0),
+        z.literal(1),
+        z.literal(2),
+        z.literal(3),
+        z.literal(4),
+    ]),
+    rationale: z.string().min(1),
+    sourceIds: z.array(z.string()).min(2),
+});
+function vecFrom(raw) {
+    if (!raw)
+        return null;
+    // Buffer, Uint8Array, and Float32Array are all ArrayBufferView-backed.
+    // legacy local database returns BLOB columns as Uint8Array (not always a Buffer), so
+    // duck-type on the byte-length rather than `instanceof Buffer`.
+    if (Array.isArray(raw))
+        return raw.length > 0 ? raw : null;
+    if (typeof ArrayBuffer !== "undefined" && ArrayBuffer.isView(raw)) {
+        const view = raw;
+        const byteLen = view.byteLength ?? view.length ?? 0;
+        if (byteLen === 0)
+            return null;
+        const buf = view.buffer;
+        const byteOffset = view.byteOffset ?? 0;
+        const floatLen = Math.floor(byteLen / 4);
+        if (floatLen === 0)
+            return null;
+        return Array.from(new Float32Array(buf, byteOffset, floatLen));
+    }
+    if (raw && typeof raw.length === "number") {
+        return Array.from(raw);
+    }
+    return null;
+}
+export function cosineSimilarity(a, b) {
+    if (!a || !b || a.length !== b.length || a.length === 0)
+        return 0;
+    let dot = 0, na = 0, nb = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        na += a[i] * a[i];
+        nb += b[i] * b[i];
+    }
+    const d = Math.sqrt(na) * Math.sqrt(nb);
+    return d === 0 ? 0 : dot / d;
+}
+/**
+ * Prefilter: pick the best cluster of >= 2 near-duplicate memories.
+ * Returns the window (source candidates) or null if none qualifies.
+ */
+export function pickConsolidationWindow(candidates, opts = {}) {
+    const threshold = opts.threshold ?? CONSOLIDATE_COSINE_THRESHOLD;
+    const maxWindow = opts.maxWindow ?? CONSOLIDATE_MAX_WINDOW;
+    if (candidates.length < 2)
+        return null;
+    // Group by project_id (null grouped together). Within a group, find the
+    // largest clique where every pair is >= threshold (greedy: seed with the
+    // most-recent, grow by mutual similarity to all current members).
+    const byProject = new Map();
+    for (const c of candidates) {
+        const key = c.projectId ?? "__null__";
+        const arr = byProject.get(key) ?? [];
+        arr.push(c);
+        byProject.set(key, arr);
+    }
+    let best = [];
+    for (const group of byProject.values()) {
+        if (group.length < 2)
+            continue;
+        // Sort by recency desc (createdAt) — most recent first.
+        const sorted = [...group].sort((a, b) => (b.createdAt ?? 0) - (a.createdAt ?? 0));
+        // Seed with the most recent that has an embedding.
+        const seedIdx = sorted.findIndex((c) => vecFrom(c.embedding) !== null);
+        if (seedIdx === -1)
+            continue;
+        const seed = sorted[seedIdx];
+        const seedVec = vecFrom(seed.embedding);
+        const clique = [seed];
+        for (let i = 0; i < sorted.length && clique.length < maxWindow; i++) {
+            if (i === seedIdx)
+                continue;
+            const cand = sorted[i];
+            const candVec = vecFrom(cand.embedding);
+            if (!candVec)
+                continue;
+            // Must be similar to ALL current clique members.
+            if (clique.every((m) => cosineSimilarity(vecFrom(m.embedding), candVec) >= threshold)) {
+                clique.push(cand);
+            }
+        }
+        if (clique.length >= 2 && clique.length > best.length) {
+            best = clique;
+        }
+    }
+    return best.length >= 2 ? best : null;
+}
+function buildPrompt(window) {
+    const items = window
+        .map((c, i) => `[${i}] id=${c.id} importance=${c.importance.toFixed(2)}\n${"(content not available at prefilter stage)"}`)
+        .join("\n");
+    return [
+        "You are consolidating a cluster of near-duplicate agent memories into one summary memory.",
+        "Produce a single consolidated memory that subsumes the sources. The new memory's type and level must be one of the allowed enum values.",
+        "sourceIds MUST be exactly the provided ids.",
+        "",
+        "Sources:",
+        items,
+        "",
+        "Return JSON: { summary, type, level, rationale, sourceIds }.",
+    ].join("\n");
+}
+/**
+ * Run the full two-stage consolidation over a candidate set. Returns a
+ * ConsolidatedBatch on success, or null when:
+ *   - no qualifying cluster exists (prefilter),
+ *   - the LLM is disabled,
+ *   - the LLM fails or returns an invalid object.
+ *
+ * `idFactory` is injected so callers/tests can control the batch id.
+ */
+export async function consolidateWindow(candidates, llm, opts = {}) {
+    const window = pickConsolidationWindow(candidates, opts);
+    if (!window)
+        return null;
+    if (!llm.isEnabled())
+        return null;
+    const prompt = buildPrompt(window);
+    const result = await llm.object(prompt, ConsolidatedBatchSchema);
+    if (!result.ok || !result.value)
+        return null;
+    const batch = {
+        id: opts.idFactory ? opts.idFactory() : `batch-${Date.now()}`,
+        sourceIds: result.value.sourceIds,
+        summary: result.value.summary,
+        type: result.value.type,
+        level: result.value.level,
+        rationale: result.value.rationale,
+    };
+    return batch;
+}
+/** Convenience: convert MemoryRow[] to candidates (embedding preserved as Buffer). */
+export function rowsToCandidates(rows) {
+    return rows.map((r) => ({
+        id: r.id,
+        projectId: r.project_id,
+        importance: r.importance,
+        embedding: r.embedding,
+        createdAt: r.created_at,
+    }));
+}
+//# sourceMappingURL=consolidator.js.map

package/dist/services/memory/consolidator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.js","sourceRoot":"","sources":["../../../src/services/memory/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,mCAAmC;AACnC,MAAM,CAAC,MAAM,4BAA4B,GAAG,IAAI,CAAC;AACjD,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAExC,MAAM,kBAAkB,GAAG;IACzB,UAAU;IACV,cAAc;IACd,MAAM;IACN,UAAU;IACV,SAAS;CACD,CAAC;AAEX,MAAM,mBAAmB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAU,CAAC;AAErD,4EAA4E;AAC5E,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC;IAChC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC;QACb,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;KACb,CAAC;IACF,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;CACtC,CAAC,CAAC;AAiCH,SAAS,OAAO,CAAC,GAAsC;IACrD,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,uEAAuE;IACvE,qFAAqF;IACrF,gEAAgE;IAChE,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3D,IAAI,OAAO,WAAW,KAAK,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC,GAAU,CAAC,EAAE,CAAC;QACzE,MAAM,IAAI,GAAG,GAAsB,CAAC;QACpC,MAAM,OAAO,GAAI,IAAmB,CAAC,UAAU,IAAK,IAAY,CAAC,MAAM,IAAI,CAAC,CAAC;QAC7E,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,GAAG,GAAI,IAAmB,CAAC,MAAqB,CAAC;QACvD,MAAM,UAAU,GAAI,IAAmB,CAAC,UAAU,IAAI,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,GAAG,IAAI,OAAQ,GAAoB,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC5D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAmB,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClE,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,UAAkC,EAClC,OAAmD,EAAE;IAErD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,4BAA4B,CAAC;IACjE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,sBAAsB,CAAC;IAC3D,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,wEAAwE;IACxE,yEAAyE;IACzE,kEAAkE;IAClE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;IAC5D,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,UAAU,CAAC;QACtC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI,GAA2B,EAAE,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,wDAAwD;QACxD,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAClD,CAAC;QACF,mDAAmD;QACnD,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,IAAI,CAAC,CAAC;QACvE,IAAI,OAAO,KAAK,CAAC,CAAC;YAAE,SAAS;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,CAAE,CAAC;QACzC,MAAM,MAAM,GAA2B,CAAC,IAAI,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpE,IAAI,CAAC,KAAK,OAAO;gBAAE,SAAS;YAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxC,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,iDAAiD;YACjD,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAE,EAAE,OAAO,CAAC,IAAI,SAAS,CAAC,EAAE,CAAC;gBACvF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACtD,IAAI,GAAG,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACxC,CAAC;AAED,SAAS,WAAW,CAAC,MAA8B;IACjD,MAAM,KAAK,GAAG,MAAM;SACjB,GAAG,CACF,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,4CAA4C,EAAE,CAC7G;SACA,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,OAAO;QACL,2FAA2F;QAC3F,yIAAyI;QACzI,6CAA6C;QAC7C,EAAE;QACF,UAAU;QACV,KAAK;QACL,EAAE;QACF,8DAA8D;KAC/D,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,UAAkC,EAClC,GAAe,EACf,OAII,EAAE;IAEN,MAAM,MAAM,GAAG,uBAAuB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzD,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE;QAAE,OAAO,IAAI,CAAC;IAElC,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IACjE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAE7C,MAAM,KAAK,GAAsB;QAC/B,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,GAAG,EAAE,EAAE;QAC7D,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS;QACjC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO;QAC7B,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI;QACvB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK;QACzB,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS;KAClC,CAAC;IACF,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,gBAAgB,CAAC,IAAiB;IAChD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,SAAS,EAAE,CAAC,CAAC,UAAU;QACvB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,SAAS,EAAE,CAAC,CAAC,UAAU;KACxB,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/services/memory/decay.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Memory salience decay — pure, tested function.
+ *
+ * Borrowed from ai-memory's `decay.rs`. The score blends a recency-decayed
+ * salience term with an access-reinforcement term:
+ *
+ *   score = salience · exp(-λ · Δt_days)
+ *         + σ      · log(1 + access) · exp(-μ · Δt_access_days)
+ *
+ * where:
+ *   - salience        = memory.importance (∈ [0,1])
+ *   - Δt_days         = days since `lastAccessed ?? createdAt`
+ *   - Δt_access_days  = days since `lastAccessed ?? createdAt`
+ *   - access          = memory.accessCount (∈ ℕ)
+ *
+ * Properties (asserted in decay.test.ts):
+ *   - Monotonic non-increasing in Δt (holding access fixed).
+ *   - Pinned memories are decay-exempt: score === importance.
+ *   - Bounded in [0,1] for all finite inputs.
+ *   - Increasing accessCount (recency fixed) never decreases the access term.
+ *   - Scores below `coldThreshold` flag the memory as a prune candidate.
+ *
+ * This module has NO runtime dependencies beyond `@massa-ai/shared`'s
+ * `DecayParams` type — it is safe to unit-test without a database.
+ */
+import type { DecayParams } from "@massa-ai/shared";
+/** Minimal memory shape consumed by `decayScore` — decoupled from the row type. */
+export interface DecayMemory {
+    /** Salience ∈ [0,1]. Maps to `memories.importance`. */
+    importance: number;
+    /** Number of times the memory has been accessed. */
+    accessCount?: number;
+    /** Epoch-ms creation time. */
+    createdAt: number;
+    /** Epoch-ms last access time (falls back to createdAt). */
+    lastAccessed?: number | null;
+    /** Pinned memories are decay-exempt. Maps to `memories.pinned` (0/1 or bool). */
+    pinned?: number | boolean;
+}
+/** Canonical defaults, mirrored from ai-memory decay.rs. */
+export declare const DEFAULT_DECAY_PARAMS: DecayParams;
+/**
+ * Compute the decayed salience score for a memory.
+ *
+ * @param mem    The memory (salience, access, timestamps, pinned flag).
+ * @param params Decay tunables. Defaults to `DEFAULT_DECAY_PARAMS`.
+ * @param now    Epoch-ms "now"; defaults to `Date.now()`. Injected for tests.
+ * @returns Score clamped to [0,1]. Pinned memories return `importance`.
+ */
+export declare function decayScore(mem: DecayMemory, params?: DecayParams, now?: number): number;
+/**
+ * Whether a memory's decayed score is below the cold threshold, making it a
+ * candidate for pruning. Pinned memories are never cold.
+ */
+export declare function isCold(mem: DecayMemory, params?: DecayParams, now?: number): boolean;
+//# sourceMappingURL=decay.d.ts.map

package/dist/services/memory/decay.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decay.d.ts","sourceRoot":"","sources":["../../../src/services/memory/decay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,mFAAmF;AACnF,MAAM,WAAW,WAAW;IAC1B,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;IACnB,oDAAoD;IACpD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,8BAA8B;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,iFAAiF;IACjF,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CAC3B;AAED,4DAA4D;AAC5D,eAAO,MAAM,oBAAoB,EAAE,WAKlC,CAAC;AAWF;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,GAAG,EAAE,WAAW,EAChB,MAAM,GAAE,WAAkC,EAC1C,GAAG,GAAE,MAAmB,GACvB,MAAM,CAiBR;AAED;;;GAGG;AACH,wBAAgB,MAAM,CACpB,GAAG,EAAE,WAAW,EAChB,MAAM,GAAE,WAAkC,EAC1C,GAAG,GAAE,MAAmB,GACvB,OAAO,CAGT"}

package/dist/services/memory/decay.js

@@ -0,0 +1,73 @@
+/**
+ * Memory salience decay — pure, tested function.
+ *
+ * Borrowed from ai-memory's `decay.rs`. The score blends a recency-decayed
+ * salience term with an access-reinforcement term:
+ *
+ *   score = salience · exp(-λ · Δt_days)
+ *         + σ      · log(1 + access) · exp(-μ · Δt_access_days)
+ *
+ * where:
+ *   - salience        = memory.importance (∈ [0,1])
+ *   - Δt_days         = days since `lastAccessed ?? createdAt`
+ *   - Δt_access_days  = days since `lastAccessed ?? createdAt`
+ *   - access          = memory.accessCount (∈ ℕ)
+ *
+ * Properties (asserted in decay.test.ts):
+ *   - Monotonic non-increasing in Δt (holding access fixed).
+ *   - Pinned memories are decay-exempt: score === importance.
+ *   - Bounded in [0,1] for all finite inputs.
+ *   - Increasing accessCount (recency fixed) never decreases the access term.
+ *   - Scores below `coldThreshold` flag the memory as a prune candidate.
+ *
+ * This module has NO runtime dependencies beyond `@massa-ai/shared`'s
+ * `DecayParams` type — it is safe to unit-test without a database.
+ */
+/** Canonical defaults, mirrored from ai-memory decay.rs. */
+export const DEFAULT_DECAY_PARAMS = {
+    lambda: 0.02,
+    sigma: 0.6,
+    mu: 0.04,
+    coldThreshold: 0.2,
+};
+const DAY_MS = 24 * 60 * 60 * 1000;
+function clamp01(x) {
+    if (!Number.isFinite(x))
+        return 0;
+    if (x < 0)
+        return 0;
+    if (x > 1)
+        return 1;
+    return x;
+}
+/**
+ * Compute the decayed salience score for a memory.
+ *
+ * @param mem    The memory (salience, access, timestamps, pinned flag).
+ * @param params Decay tunables. Defaults to `DEFAULT_DECAY_PARAMS`.
+ * @param now    Epoch-ms "now"; defaults to `Date.now()`. Injected for tests.
+ * @returns Score clamped to [0,1]. Pinned memories return `importance`.
+ */
+export function decayScore(mem, params = DEFAULT_DECAY_PARAMS, now = Date.now()) {
+    const salience = Number.isFinite(mem.importance) ? mem.importance : 0;
+    // Pinned memories are decay-exempt: return salience unchanged.
+    if (mem.pinned === 1 || mem.pinned === true) {
+        return clamp01(salience);
+    }
+    const reference = mem.lastAccessed ?? mem.createdAt;
+    const deltaDays = Math.max(0, (now - reference) / DAY_MS);
+    const access = Math.max(0, Math.floor(mem.accessCount ?? 0));
+    const salienceTerm = salience * Math.exp(-params.lambda * deltaDays);
+    const accessTerm = params.sigma * Math.log1p(access) * Math.exp(-params.mu * deltaDays);
+    return clamp01(salienceTerm + accessTerm);
+}
+/**
+ * Whether a memory's decayed score is below the cold threshold, making it a
+ * candidate for pruning. Pinned memories are never cold.
+ */
+export function isCold(mem, params = DEFAULT_DECAY_PARAMS, now = Date.now()) {
+    if (mem.pinned === 1 || mem.pinned === true)
+        return false;
+    return decayScore(mem, params, now) < params.coldThreshold;
+}
+//# sourceMappingURL=decay.js.map

package/dist/services/memory/decay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decay.js","sourceRoot":"","sources":["../../../src/services/memory/decay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAkBH,4DAA4D;AAC5D,MAAM,CAAC,MAAM,oBAAoB,GAAgB;IAC/C,MAAM,EAAE,IAAI;IACZ,KAAK,EAAE,GAAG;IACV,EAAE,EAAE,IAAI;IACR,aAAa,EAAE,GAAG;CACnB,CAAC;AAEF,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEnC,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,GAAgB,EAChB,SAAsB,oBAAoB,EAC1C,MAAc,IAAI,CAAC,GAAG,EAAE;IAExB,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtE,+DAA+D;IAC/D,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;QAC5C,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,YAAY,IAAI,GAAG,CAAC,SAAS,CAAC;IACpD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7D,MAAM,YAAY,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;IACrE,MAAM,UAAU,GACd,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC;IAEvE,OAAO,OAAO,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CACpB,GAAgB,EAChB,SAAsB,oBAAoB,EAC1C,MAAc,IAAI,CAAC,GAAG,EAAE;IAExB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAC1D,OAAO,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC;AAC7D,CAAC"}

package/dist/services/memory/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Memory services barrel exports.
+ *
+ * Redundancy filtering and semantic clustering for memory quality.
+ */
+export { RedundancyFilter } from "./redundancy-filter.js";
+export type { DuplicatePair, MergeResult, CleanupStats } from "./redundancy-filter.js";
+export { MemoryClustering } from "./memory-clustering.js";
+export type { MemoryCluster, ClusteringResult } from "./memory-clustering.js";
+export { MemoryService } from "./memory-service.js";
+export type { Memory, ScoredMemory } from "./memory-service.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/services/memory/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/services/memory/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEvF,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,YAAY,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE9E,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/services/memory/index.js

@@ -0,0 +1,9 @@
+/**
+ * Memory services barrel exports.
+ *
+ * Redundancy filtering and semantic clustering for memory quality.
+ */
+export { RedundancyFilter } from "./redundancy-filter.js";
+export { MemoryClustering } from "./memory-clustering.js";
+export { MemoryService } from "./memory-service.js";
+//# sourceMappingURL=index.js.map

package/dist/services/memory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/services/memory/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/services/memory/llm-client.d.ts

@@ -0,0 +1,111 @@
+/**
+ * Shared local-first LLM client (Phase 1, cross-cutting §1).
+ *
+ * Wraps the Vercel AI SDK (`generateText` / `generateObject`) over an
+ * OpenAI-compatible provider configured from the top-level `config.llm` block.
+ * Default backend is a local Ollama instance (http://localhost:11434/v1).
+ *
+ * Contract (cross-cutting §1):
+ *   (a) respect `timeoutMs` (via AbortSignal.timeout),
+ *   (b) degrade silently to a non-LLM path on any failure — never throw,
+ *   (c) be config-gated default-off (`config.llm.enabled`, env RLM_LLM_ENABLED).
+ *
+ * Consumers (Phase 1: consolidator; Phase 2: query-understanding; Phase 4:
+ * bootstrap; Phase 5: auto-improve; Phase 7: compression) MUST treat a
+ * `{ ok: false }` result as "fall through to the non-LLM path".
+ */
+import { z } from "zod";
+/**
+ * Which model role a call targets. `"instruct"` (default) selects the
+ * NL/instruction model (`config.llm.model`); `"code"` selects the coder model
+ * (`config.llm.codeModel`) for code-oriented sites (bootstrap, reranker,
+ * compression). This is the per-task routing knob (COVERAGE #1/#5/#7).
+ */
+export type LlmModelRole = "instruct" | "code";
+export interface LlmCompleteOptions {
+    /** Optional system prompt. */
+    system?: string;
+    /** Per-call timeout override (ms). Defaults to `config.llm.timeoutMs`. */
+    timeoutMs?: number;
+    /** Model role: `"instruct"` (default) or `"code"`. */
+    modelRole?: LlmModelRole;
+}
+export interface LlmObjectOptions extends LlmCompleteOptions {
+}
+export interface LlmResult<T = string> {
+    ok: boolean;
+    value?: T;
+    /** Present when ok === false. */
+    error?: string;
+}
+/**
+ * Check whether the configured Ollama instance supports `json_schema` format
+ * (requires Ollama >= 0.5.0). Caches the result for the process lifetime.
+ * On any error (Ollama down, unparseable version), returns `false` (safe
+ * fallback to the current json_object path).
+ * @internal
+ */
+export declare function _checkJsonSchemaSupport(): Promise<boolean>;
+/**
+ * Test seam: force the json_schema support flag without hitting Ollama.
+ * Pass `null` to clear the cache.
+ * @internal
+ */
+export declare function _setJsonSchemaSupportedForTesting(flag: boolean | null): void;
+/** Whether the LLM is enabled at the current config. Cheap, side-effect-free. */
+export declare function isLlmEnabled(): boolean;
+export declare function _setLlmEnabledForTesting(flag: boolean | null): void;
+/**
+ * Best-effort `think:false` injection. Ollama's OpenAI-compat layer honors a
+ * top-level `think` field for qwen3. Wrapped fetch keeps the SDK contract
+ * intact and only mutates the JSON body for chat/completion POSTs.
+ *
+ * Typed loosely (input/init as unknown) and cast on return so it satisfies the
+ * SDK's `FetchFunction` (Bun's fetch type includes a `preconnect` method that a
+ * plain wrapper does not carry) without forcing callers to replicate it.
+ * @internal
+ */
+export declare function _wrapFetchDisableThink(baseFetch: typeof globalThis.fetch): typeof globalThis.fetch;
+/**
+ * Normalize the reasoning channel exposed by the AI SDK (v5+) into a single
+ * string. Handles: array of `{type:"reasoning", text}` parts, a raw string,
+ * `providerMetadata.openai.reasoningText`, and the Responses-API error shape
+ * (`response.body.output[].summary[].text`). Returns "" when absent.
+ *
+ * Accepts either a successful `result` or a thrown `AI_NoObjectGeneratedError`
+ * (which carries `response.body.output`).
+ * @internal
+ */
+export declare function _reasoningToText(result: any): string;
+/**
+ * Best-effort extraction of the first balanced JSON object from a free-text
+ * (typically reasoning) string. Strips ```json fences first. Returns the
+ * parsed object or `undefined` on any failure. Pure; safe to unit-test.
+ * @internal
+ */
+export declare function _extractJsonObject(text: string): unknown | undefined;
+/**
+ * Generate a free-form text completion. Returns `{ ok: false }` (never throws)
+ * when the LLM is disabled, times out, or errors. When the content channel is
+ * empty (qwen3 thinking-model failure mode), falls back to the reasoning
+ * channel before degrading.
+ */
+export declare function llmComplete(prompt: string, opts?: LlmCompleteOptions): Promise<LlmResult<string>>;
+/**
+ * Generate a structured object validated against a zod schema. Returns
+ * `{ ok: false }` (never throws) when the LLM is disabled, times out, returns
+ * an invalid object, or errors. When the content channel is empty or the
+ * schema fails (qwen3 thinking-model failure mode), attempts to recover JSON
+ * from the reasoning channel before degrading.
+ */
+export declare function llmObject<T>(prompt: string, schema: z.ZodSchema<T>, opts?: LlmObjectOptions): Promise<LlmResult<T>>;
+/**
+ * Injectable handle bundling both calls, so callers (consolidator, etc.) can
+ * be tested with a fake LLM without touching config or network.
+ */
+export declare const llm: {
+    complete: typeof llmComplete;
+    object: typeof llmObject;
+    isEnabled: typeof isLlmEnabled;
+};
+//# sourceMappingURL=llm-client.d.ts.map

package/dist/services/memory/llm-client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-client.d.ts","sourceRoot":"","sources":["../../../src/services/memory/llm-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAKH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;;;;GAKG;AACH,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,MAAM,CAAC;AAE/C,MAAM,WAAW,kBAAkB;IACjC,8BAA8B;IAC9B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,0EAA0E;IAC1E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sDAAsD;IACtD,SAAS,CAAC,EAAE,YAAY,CAAC;CAC1B;AAED,MAAM,WAAW,gBAAiB,SAAQ,kBAAkB;CAE3D;AAED,MAAM,WAAW,SAAS,CAAC,CAAC,GAAG,MAAM;IACnC,EAAE,EAAE,OAAO,CAAC;IACZ,KAAK,CAAC,EAAE,CAAC,CAAC;IACV,iCAAiC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAWD;;;;;;GAMG;AACH,wBAAsB,uBAAuB,IAAI,OAAO,CAAC,OAAO,CAAC,CAiChE;AAED;;;;GAIG;AACH,wBAAgB,iCAAiC,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI,CAE5E;AAID,iFAAiF;AACjF,wBAAgB,YAAY,IAAI,OAAO,CAOtC;AAQD,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI,CAEnE;AA2CD;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CACpC,SAAS,EAAE,OAAO,UAAU,CAAC,KAAK,GACjC,OAAO,UAAU,CAAC,KAAK,CAgBzB;AAaD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,GAAG,GAAG,MAAM,CAgCpD;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAmCpE;AAOD;;;;;GAKG;AACH,wBAAsB,WAAW,CAC/B,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,kBAAuB,GAC5B,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CA0C5B;AAED;;;;;;GAMG;AACH,wBAAsB,SAAS,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EACtB,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAqGvB;AAED;;;GAGG;AACH,eAAO,MAAM,GAAG;;;;CAIf,CAAC"}