@theihtisham/agent-shadow-brain 5.1.1 → 6.0.0

package/dist/brain/hive-accelerator.js

@@ -0,0 +1,152 @@
+// src/brain/hive-accelerator.ts — SSSP + TurboQuant accelerator for v6.0 modules
+// v6.0.0 — Hive Mind Edition
+//
+// Re-uses the existing SSSP router (O(m log^(2/3) n), arXiv 2504.17033) and
+// TurboMemory (PolarQuant + QJL, ICLR 2026 — 6x vector compression) to make
+// Hive Mind modules faster and more memory-efficient:
+//
+//   - Causal Chains → SSSP for ancestor/descendant traversal
+//   - SABB sliver scoring → TurboQuant vector similarity
+//   - Brain Exchange payloads → TurboQuant compression before serialization
+//   - Attention Heatmap → TurboQuant similarity between decision and memories
+//
+// Modules call these helpers when available; fall back to naive paths if the
+// accelerator can't be initialized.
+import { SSSPRouter } from './sssp-router.js';
+import { TurboMemory } from './turbo-memory.js';
+export class HiveAccelerator {
+    constructor() {
+        this.initialized = false;
+        this.sssp = new SSSPRouter();
+        this.turbo = new TurboMemory();
+    }
+    async init() {
+        if (this.initialized)
+            return;
+        this.initialized = true;
+    }
+    /**
+     * Rebuild the SSSP graph from causal links for O(m log^(2/3) n) traversal.
+     * Each link contributes two directed edges (cause → effect).
+     */
+    buildCausalGraph(links) {
+        const nodes = new Map();
+        for (const link of links) {
+            const list = nodes.get(link.causeId) ?? [];
+            list.push({ targetId: link.effectId, latency: 1 - link.strength });
+            nodes.set(link.causeId, list);
+            // Also register effect nodes so graph is complete
+            if (!nodes.has(link.effectId))
+                nodes.set(link.effectId, []);
+        }
+        const nodeArr = [];
+        for (const [id, connections] of nodes)
+            nodeArr.push({ id, connections });
+        this.sssp.buildGraph(nodeArr);
+    }
+    /** Run BMSSP from a source node — returns distances + predecessors. */
+    traverseCausal(sourceId) {
+        try {
+            const sssp = this.sssp;
+            if (typeof sssp.bmssp === 'function')
+                return sssp.bmssp(sourceId);
+            if (typeof sssp.computeShortestPath === 'function')
+                return sssp.computeShortestPath(sourceId);
+            if (typeof sssp.run === 'function')
+                return sssp.run(sourceId);
+            if (typeof sssp.shortestPaths === 'function')
+                return sssp.shortestPaths(sourceId);
+            return null;
+        }
+        catch {
+            return null;
+        }
+    }
+    /**
+     * Store a compressed vector representation of a memory for faster SABB /
+     * heatmap similarity scoring. Uses PolarQuant + QJL (3 bits/dim).
+     */
+    async storeCompressed(id, vector, metadata = {}) {
+        try {
+            const t = this.turbo;
+            if (typeof t.store === 'function')
+                return t.store(id, vector, metadata);
+            if (typeof t.add === 'function')
+                return t.add(id, vector, metadata);
+            if (typeof t.upsert === 'function')
+                return t.upsert(id, vector, metadata);
+            return null;
+        }
+        catch {
+            return null;
+        }
+    }
+    /** Semantic similarity search — returns top-K matching memories. */
+    async similaritySearch(queryVector, k = 5) {
+        try {
+            const t = this.turbo;
+            if (typeof t.search === 'function')
+                return t.search(queryVector, k);
+            if (typeof t.topK === 'function')
+                return t.topK(queryVector, k);
+            if (typeof t.query === 'function')
+                return t.query(queryVector, k);
+            return [];
+        }
+        catch {
+            return [];
+        }
+    }
+    /** Convert text to a simple 64-dim vector (character n-gram hash). Cheap, deterministic. */
+    static textToVector(text, dim = 64) {
+        const v = new Array(dim).fill(0);
+        const normalized = text.toLowerCase().replace(/[^a-z0-9\s]/g, ' ');
+        for (let i = 0; i < normalized.length - 2; i++) {
+            const tri = normalized.slice(i, i + 3);
+            let h = 0;
+            for (let c = 0; c < tri.length; c++)
+                h = (h * 31 + tri.charCodeAt(c)) >>> 0;
+            v[h % dim] += 1;
+        }
+        // L2 normalize
+        let norm = 0;
+        for (const x of v)
+            norm += x * x;
+        norm = Math.sqrt(norm) || 1;
+        for (let i = 0; i < dim; i++)
+            v[i] = v[i] / norm;
+        return v;
+    }
+    /** Cosine similarity between two vectors. */
+    static cosine(a, b) {
+        let dot = 0;
+        let na = 0;
+        let nb = 0;
+        for (let i = 0; i < a.length && i < b.length; i++) {
+            dot += a[i] * b[i];
+            na += a[i] * a[i];
+            nb += b[i] * b[i];
+        }
+        return dot / ((Math.sqrt(na) || 1) * (Math.sqrt(nb) || 1));
+    }
+    status() {
+        const g = this.sssp.graph ?? { nodeCount: 0, edgeCount: 0 };
+        const m = this.turbo.memoryStore ?? { entries: [], compressionRatio: 6 };
+        return {
+            ssspNodes: g.nodeCount ?? 0,
+            ssspEdges: g.edgeCount ?? 0,
+            turboEntries: (m.entries ?? []).length,
+            turboCompressionRatio: m.compressionRatio ?? 6,
+        };
+    }
+}
+let _instance = null;
+export function getHiveAccelerator() {
+    if (!_instance)
+        _instance = new HiveAccelerator();
+    return _instance;
+}
+export function resetHiveAcceleratorForTests() {
+    _instance = null;
+}
+//# sourceMappingURL=hive-accelerator.js.map

package/dist/brain/hive-accelerator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hive-accelerator.js","sourceRoot":"","sources":["../../src/brain/hive-accelerator.ts"],"names":[],"mappings":"AAAA,iFAAiF;AACjF,6BAA6B;AAC7B,EAAE;AACF,4EAA4E;AAC5E,4EAA4E;AAC5E,sDAAsD;AACtD,EAAE;AACF,6DAA6D;AAC7D,yDAAyD;AACzD,4EAA4E;AAC5E,8EAA8E;AAC9E,EAAE;AACF,6EAA6E;AAC7E,oCAAoC;AAEpC,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAUhD,MAAM,OAAO,eAAe;IAK1B;QAFQ,gBAAW,GAAG,KAAK,CAAC;QAG1B,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,KAAmB;QAClC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAwD,CAAC;QAC9E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC9B,kDAAkD;YAClD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,MAAM,OAAO,GAAqF,EAAE,CAAC;QACrG,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED,uEAAuE;IACvE,cAAc,CAAC,QAAgB;QAC7B,IAAI,CAAC;YACH,MAAM,IAAI,GAAQ,IAAI,CAAC,IAAW,CAAC;YACnC,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAClE,IAAI,OAAO,IAAI,CAAC,mBAAmB,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;YAC9F,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9D,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAClF,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,eAAe,CAAC,EAAU,EAAE,MAAgB,EAAE,WAAoC,EAAE;QACxF,IAAI,CAAC;YACH,MAAM,CAAC,GAAQ,IAAI,CAAC,KAAY,CAAC;YACjC,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YACxE,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpE,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC1E,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,KAAK,CAAC,gBAAgB,CAAC,WAAqB,EAAE,CAAC,GAAG,CAAC;QACjD,IAAI,CAAC;YACH,MAAM,CAAC,GAAQ,IAAI,CAAC,KAAY,CAAC;YACjC,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpE,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAChE,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAClE,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,4FAA4F;IAC5F,MAAM,CAAC,YAAY,CAAC,IAAY,EAAE,GAAG,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5E,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;QACD,eAAe;QACf,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,CAAC;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACjD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,6CAA6C;IAC7C,MAAM,CAAC,MAAM,CAAC,CAAW,EAAE,CAAW;QACpC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM;QACJ,MAAM,CAAC,GAAS,IAAI,CAAC,IAAY,CAAC,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QAC1E,MAAM,CAAC,GAAS,IAAI,CAAC,KAAa,CAAC,WAAW,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAC;QACvF,OAAO;YACL,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC;YAC3B,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC;YAC3B,YAAY,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM;YACtC,qBAAqB,EAAE,CAAC,CAAC,gBAAgB,IAAI,CAAC;SAC/C,CAAC;IACJ,CAAC;CACF;AAED,IAAI,SAAS,GAA2B,IAAI,CAAC;AAE7C,MAAM,UAAU,kBAAkB;IAChC,IAAI,CAAC,SAAS;QAAE,SAAS,GAAG,IAAI,eAAe,EAAE,CAAC;IAClD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,4BAA4B;IAC1C,SAAS,GAAG,IAAI,CAAC;AACnB,CAAC"}

package/dist/brain/json-output.d.ts

@@ -0,0 +1,26 @@
+import { z, ZodSchema } from 'zod';
+export interface JsonOutputOptions<T> {
+    system?: string;
+    maxTokens?: number;
+    maxRetries?: number;
+    featureName?: string;
+    fallback?: T;
+    /** Extra instruction to append — e.g. "Respond ONLY with JSON matching {...}". */
+    schemaHint?: string;
+    /** Cache identical requests (default: true). */
+    useCache?: boolean;
+}
+/**
+ * Ask the LLM for JSON that satisfies a Zod schema.
+ * Returns parsed T, or opts.fallback if every retry failed.
+ */
+export declare function generateJson<T>(prompt: string, schema: ZodSchema<T>, opts?: JsonOutputOptions<T>): Promise<{
+    value: T;
+    provider: string;
+    model: string;
+    attempts: number;
+    cached?: boolean;
+}>;
+/** Re-export Zod for downstream brain modules that want to define schemas. */
+export { z };
+//# sourceMappingURL=json-output.d.ts.map

package/dist/brain/json-output.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-output.d.ts","sourceRoot":"","sources":["../../src/brain/json-output.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,KAAK,CAAC;AAInC,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAClC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,CAAC,CAAC;IACb,kFAAkF;IAClF,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gDAAgD;IAChD,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAAC,CAAC,EAClC,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EACpB,IAAI,GAAE,iBAAiB,CAAC,CAAC,CAAM,GAC9B,OAAO,CAAC;IAAE,KAAK,EAAE,CAAC,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC,CAkD5F;AAsCD,8EAA8E;AAC9E,OAAO,EAAE,CAAC,EAAE,CAAC"}

package/dist/brain/json-output.js

@@ -0,0 +1,112 @@
+// src/brain/json-output.ts — Structured JSON output helper
+// v6.0.0 — Hive Mind Edition
+//
+// Wraps ModelRegistry.generate with strict JSON schema enforcement and retry.
+// If the model returns free text or malformed JSON, extract → parse → validate
+// against a Zod schema; retry up to N times with a repair prompt; fall back to
+// a safe default if all retries fail.
+import { z } from 'zod';
+import { getModelRegistry } from './model-registry.js';
+import { getPromptCache } from './prompt-cache.js';
+/**
+ * Ask the LLM for JSON that satisfies a Zod schema.
+ * Returns parsed T, or opts.fallback if every retry failed.
+ */
+export async function generateJson(prompt, schema, opts = {}) {
+    const registry = getModelRegistry();
+    await registry.init();
+    const cache = getPromptCache();
+    const maxRetries = opts.maxRetries ?? 2;
+    const hint = opts.schemaHint ?? 'Respond ONLY with a single valid JSON object. No markdown, no prose, no code fences.';
+    const fullPrompt = `${prompt}\n\n${hint}`;
+    let lastText = '';
+    let lastProvider = 'none';
+    let lastModel = 'fallback';
+    for (let attempt = 0; attempt <= maxRetries; attempt++) {
+        const repairSuffix = attempt > 0
+            ? `\n\nYour previous response was invalid or did not match the schema. Your previous output was:\n${lastText.slice(0, 400)}\n\nReturn valid JSON only.`
+            : '';
+        const effectivePrompt = fullPrompt + repairSuffix;
+        const doGenerate = () => registry.generate(effectivePrompt, {
+            system: opts.system,
+            maxTokens: opts.maxTokens ?? 800,
+            featureName: opts.featureName,
+        });
+        const response = opts.useCache === false
+            ? await doGenerate()
+            : await cache.wrap({ prompt: effectivePrompt, system: opts.system, provider: 'lead', model: 'lead', estimatedTokens: Math.ceil(effectivePrompt.length / 4) + (opts.maxTokens ?? 800), estimatedCostUsd: 0.002 }, doGenerate);
+        lastText = response.text || '';
+        lastProvider = response.provider;
+        lastModel = response.model;
+        const extracted = extractJson(lastText);
+        if (extracted !== null) {
+            const parsed = schema.safeParse(extracted);
+            if (parsed.success) {
+                return { value: parsed.data, provider: lastProvider, model: lastModel, attempts: attempt + 1 };
+            }
+        }
+        // try again
+    }
+    if (opts.fallback !== undefined) {
+        return { value: opts.fallback, provider: lastProvider, model: lastModel, attempts: maxRetries + 1 };
+    }
+    throw new Error('Failed to extract valid JSON after ' + (maxRetries + 1) + ' attempts. Last text: ' + lastText.slice(0, 200));
+}
+/**
+ * Attempt to extract a JSON object from a blob of text. Tolerates code fences,
+ * leading/trailing prose, unbalanced whitespace.
+ */
+function extractJson(text) {
+    if (!text)
+        return null;
+    const clean = text.replace(/```json\s*|```\s*/g, '');
+    try {
+        return JSON.parse(clean);
+    }
+    catch { /* try harder */ }
+    // Find the largest balanced {...} or [...] substring
+    const firstBrace = clean.search(/[{[]/);
+    if (firstBrace < 0)
+        return null;
+    let depth = 0;
+    let inString = false;
+    let escape = false;
+    for (let i = firstBrace; i < clean.length; i++) {
+        const c = clean[i];
+        if (inString) {
+            if (escape) {
+                escape = false;
+                continue;
+            }
+            if (c === '\\') {
+                escape = true;
+                continue;
+            }
+            if (c === '"')
+                inString = false;
+            continue;
+        }
+        if (c === '"') {
+            inString = true;
+            continue;
+        }
+        if (c === '{' || c === '[')
+            depth++;
+        else if (c === '}' || c === ']') {
+            depth--;
+            if (depth === 0) {
+                const candidate = clean.slice(firstBrace, i + 1);
+                try {
+                    return JSON.parse(candidate);
+                }
+                catch {
+                    return null;
+                }
+            }
+        }
+    }
+    return null;
+}
+/** Re-export Zod for downstream brain modules that want to define schemas. */
+export { z };
+//# sourceMappingURL=json-output.js.map

package/dist/brain/json-output.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-output.js","sourceRoot":"","sources":["../../src/brain/json-output.ts"],"names":[],"mappings":"AAAA,2DAA2D;AAC3D,6BAA6B;AAC7B,EAAE;AACF,8EAA8E;AAC9E,+EAA+E;AAC/E,+EAA+E;AAC/E,sCAAsC;AAEtC,OAAO,EAAE,CAAC,EAAa,MAAM,KAAK,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAcnD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,MAAc,EACd,MAAoB,EACpB,OAA6B,EAAE;IAE/B,MAAM,QAAQ,GAAG,gBAAgB,EAAE,CAAC;IACpC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IACtB,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC;IAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,IAAI,sFAAsF,CAAC;IACvH,MAAM,UAAU,GAAG,GAAG,MAAM,OAAO,IAAI,EAAE,CAAC;IAE1C,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,YAAY,GAAG,MAAM,CAAC;IAC1B,IAAI,SAAS,GAAG,UAAU,CAAC;IAE3B,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;QACvD,MAAM,YAAY,GAAG,OAAO,GAAG,CAAC;YAC9B,CAAC,CAAC,kGAAkG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,6BAA6B;YACvJ,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,eAAe,GAAG,UAAU,GAAG,YAAY,CAAC;QAElD,MAAM,UAAU,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,eAAe,EAAE;YAC1D,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,GAAG;YAChC,WAAW,EAAE,IAAI,CAAC,WAAW;SAC9B,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK;YACtC,CAAC,CAAC,MAAM,UAAU,EAAE;YACpB,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CACd,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,EAC5L,UAAU,CACX,CAAC;QAEN,QAAQ,GAAG,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/B,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC;QACjC,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAE3B,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnB,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,GAAG,CAAC,EAAE,CAAC;YACjG,CAAC;QACH,CAAC;QACD,YAAY;IACd,CAAC;IAED,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,GAAG,CAAC,EAAE,CAAC;IACtG,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,qCAAqC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,wBAAwB,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AAChI,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;IACrD,IAAI,CAAC;QAAC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAE5D,qDAAqD;IACrD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxC,IAAI,UAAU,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,MAAM,EAAE,CAAC;gBAAC,MAAM,GAAG,KAAK,CAAC;gBAAC,SAAS;YAAC,CAAC;YACzC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBAAC,MAAM,GAAG,IAAI,CAAC;gBAAC,SAAS;YAAC,CAAC;YAC5C,IAAI,CAAC,KAAK,GAAG;gBAAE,QAAQ,GAAG,KAAK,CAAC;YAChC,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAAC,QAAQ,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAChC,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjD,IAAI,CAAC;oBAAC,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBAAC,CAAC;gBAAC,MAAM,CAAC;oBAAC,OAAO,IAAI,CAAC;gBAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,OAAO,EAAE,CAAC,EAAE,CAAC"}

package/dist/brain/l0-cache.d.ts

@@ -0,0 +1,40 @@
+import { L0CacheEntry, L0CacheStats } from '../types.js';
+export interface L0CacheOptions {
+    bytesLimit?: number;
+    /** Estimate bytes for a value when computing budget */
+    byteEstimator?: (value: unknown) => number;
+}
+/** Generic L0 cache. Construct one per logical namespace (recall, vectors, etc.) */
+export declare class L0Cache<T = unknown> {
+    private map;
+    private bytesUsed;
+    private bytesLimit;
+    private byteEstimator;
+    private hits;
+    private misses;
+    private evictions;
+    private accessTimingsNs;
+    constructor(opts?: L0CacheOptions);
+    /** Get a value from the cache — sub-microsecond on hit */
+    get(key: string): T | undefined;
+    /** Set a value — evicts LRU entries if over budget */
+    set(key: string, value: T): void;
+    /** Check existence without touching LRU */
+    has(key: string): boolean;
+    /** Remove a single entry */
+    delete(key: string): boolean;
+    /** Clear all entries */
+    clear(): void;
+    /** Get cache stats */
+    getStats(): L0CacheStats;
+    /** Iterate entries (for warm-restart persistence) */
+    entries(): IterableIterator<[string, L0CacheEntry<T>]>;
+    /** Resize the byte budget — evicts if shrinking */
+    resize(newBytesLimit: number): void;
+    private evictOldest;
+    private recordTiming;
+}
+export declare function getCache<T = unknown>(namespace: string, opts?: L0CacheOptions): L0Cache<T>;
+export declare function getAllCacheStats(): Record<string, L0CacheStats>;
+export declare function clearAllCaches(): void;
+//# sourceMappingURL=l0-cache.d.ts.map

package/dist/brain/l0-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"l0-cache.d.ts","sourceRoot":"","sources":["../../src/brain/l0-cache.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAIzD,MAAM,WAAW,cAAc;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uDAAuD;IACvD,aAAa,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,MAAM,CAAC;CAC5C;AAgBD,oFAAoF;AACpF,qBAAa,OAAO,CAAC,CAAC,GAAG,OAAO;IAC9B,OAAO,CAAC,GAAG,CAA2C;IACtD,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,aAAa,CAA6B;IAElD,OAAO,CAAC,IAAI,CAAK;IACjB,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,eAAe,CAAgB;gBAE3B,IAAI,GAAE,cAAmB;IAKrC,0DAA0D;IAC1D,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAqB/B,sDAAsD;IACtD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IA4BhC,2CAA2C;IAC3C,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,4BAA4B;IAC5B,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAO5B,wBAAwB;IACxB,KAAK,IAAI,IAAI;IAKb,sBAAsB;IACtB,QAAQ,IAAI,YAAY;IAyBxB,qDAAqD;IACrD,OAAO,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAItD,mDAAmD;IACnD,MAAM,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI;IAOnC,OAAO,CAAC,WAAW;IAUnB,OAAO,CAAC,YAAY;CAOrB;AAKD,wBAAgB,QAAQ,CAAC,CAAC,GAAG,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,CAAC,CAAC,CAO1F;AAED,wBAAgB,gBAAgB,IAAI,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAM/D;AAED,wBAAgB,cAAc,IAAI,IAAI,CAErC"}

package/dist/brain/l0-cache.js

@@ -0,0 +1,176 @@
+// src/brain/l0-cache.ts — L0 In-Memory Hot Tier (v5.2.0)
+//
+// Sub-millisecond recall for the hottest brain entries. Sits in front of the
+// global JSON brain. Map-based, LRU-evicted, byte-budget-bounded.
+//
+// Design:
+//   - Pure JavaScript Map (insertion-ordered → easy LRU)
+//   - Byte budget (default 64MB) prevents memory bloat
+//   - Tracks hit/miss for adaptive prefetch decisions
+//   - Auto-evict least-recently-accessed when budget exceeded
+const DEFAULT_BYTES_LIMIT = 64 * 1024 * 1024; // 64MB
+/** Default byte estimator — works for strings, objects, arrays */
+function defaultByteEstimator(value) {
+    if (value == null)
+        return 8;
+    if (typeof value === 'string')
+        return value.length * 2;
+    if (typeof value === 'number')
+        return 8;
+    if (typeof value === 'boolean')
+        return 4;
+    if (value instanceof Uint8Array)
+        return value.byteLength;
+    try {
+        return JSON.stringify(value).length * 2;
+    }
+    catch {
+        return 64;
+    }
+}
+/** Generic L0 cache. Construct one per logical namespace (recall, vectors, etc.) */
+export class L0Cache {
+    constructor(opts = {}) {
+        this.map = new Map();
+        this.bytesUsed = 0;
+        this.hits = 0;
+        this.misses = 0;
+        this.evictions = 0;
+        this.accessTimingsNs = [];
+        this.bytesLimit = opts.bytesLimit ?? DEFAULT_BYTES_LIMIT;
+        this.byteEstimator = opts.byteEstimator ?? defaultByteEstimator;
+    }
+    /** Get a value from the cache — sub-microsecond on hit */
+    get(key) {
+        const start = process.hrtime.bigint();
+        const entry = this.map.get(key);
+        if (!entry) {
+            this.misses++;
+            this.recordTiming(start);
+            return undefined;
+        }
+        // LRU touch — re-insert at end of map
+        this.map.delete(key);
+        entry.hits++;
+        entry.lastAccessed = Date.now();
+        this.map.set(key, entry);
+        this.hits++;
+        this.recordTiming(start);
+        return entry.value;
+    }
+    /** Set a value — evicts LRU entries if over budget */
+    set(key, value) {
+        const bytes = this.byteEstimator(value);
+        // If key already exists, subtract its bytes first
+        const existing = this.map.get(key);
+        if (existing) {
+            this.bytesUsed -= existing.bytes;
+            this.map.delete(key);
+        }
+        // Make room
+        while (this.bytesUsed + bytes > this.bytesLimit && this.map.size > 0) {
+            this.evictOldest();
+        }
+        const entry = {
+            key,
+            value,
+            hits: 0,
+            insertedAt: Date.now(),
+            lastAccessed: Date.now(),
+            bytes,
+        };
+        this.map.set(key, entry);
+        this.bytesUsed += bytes;
+    }
+    /** Check existence without touching LRU */
+    has(key) {
+        return this.map.has(key);
+    }
+    /** Remove a single entry */
+    delete(key) {
+        const entry = this.map.get(key);
+        if (!entry)
+            return false;
+        this.bytesUsed -= entry.bytes;
+        return this.map.delete(key);
+    }
+    /** Clear all entries */
+    clear() {
+        this.map.clear();
+        this.bytesUsed = 0;
+    }
+    /** Get cache stats */
+    getStats() {
+        const total = this.hits + this.misses;
+        const avgAccessNs = this.accessTimingsNs.length
+            ? this.accessTimingsNs.reduce((a, b) => a + b, 0) / this.accessTimingsNs.length
+            : 0;
+        // Top 10 most-hit keys
+        const topKeys = Array.from(this.map.values())
+            .sort((a, b) => b.hits - a.hits)
+            .slice(0, 10)
+            .map(e => ({ key: e.key, hits: e.hits }));
+        return {
+            entries: this.map.size,
+            bytesUsed: this.bytesUsed,
+            bytesLimit: this.bytesLimit,
+            hits: this.hits,
+            misses: this.misses,
+            hitRate: total ? this.hits / total : 0,
+            evictions: this.evictions,
+            avgAccessNs,
+            topKeys,
+        };
+    }
+    /** Iterate entries (for warm-restart persistence) */
+    entries() {
+        return this.map.entries();
+    }
+    /** Resize the byte budget — evicts if shrinking */
+    resize(newBytesLimit) {
+        this.bytesLimit = newBytesLimit;
+        while (this.bytesUsed > this.bytesLimit && this.map.size > 0) {
+            this.evictOldest();
+        }
+    }
+    evictOldest() {
+        // First entry in Map = oldest by insertion (and we re-insert on touch → LRU)
+        const oldest = this.map.keys().next().value;
+        if (oldest === undefined)
+            return;
+        const entry = this.map.get(oldest);
+        if (entry)
+            this.bytesUsed -= entry.bytes;
+        this.map.delete(oldest);
+        this.evictions++;
+    }
+    recordTiming(startNs) {
+        const elapsedNs = Number(process.hrtime.bigint() - startNs);
+        this.accessTimingsNs.push(elapsedNs);
+        if (this.accessTimingsNs.length > 1000) {
+            this.accessTimingsNs.shift();
+        }
+    }
+}
+/** Process-wide singleton caches — one per logical namespace */
+const caches = new Map();
+export function getCache(namespace, opts) {
+    let cache = caches.get(namespace);
+    if (!cache) {
+        cache = new L0Cache(opts);
+        caches.set(namespace, cache);
+    }
+    return cache;
+}
+export function getAllCacheStats() {
+    const out = {};
+    for (const [name, cache] of caches.entries()) {
+        out[name] = cache.getStats();
+    }
+    return out;
+}
+export function clearAllCaches() {
+    for (const cache of caches.values())
+        cache.clear();
+}
+//# sourceMappingURL=l0-cache.js.map

package/dist/brain/l0-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"l0-cache.js","sourceRoot":"","sources":["../../src/brain/l0-cache.ts"],"names":[],"mappings":"AAAA,yDAAyD;AACzD,EAAE;AACF,6EAA6E;AAC7E,kEAAkE;AAClE,EAAE;AACF,UAAU;AACV,yDAAyD;AACzD,uDAAuD;AACvD,sDAAsD;AACtD,8DAA8D;AAI9D,MAAM,mBAAmB,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,OAAO;AAQrD,kEAAkE;AAClE,SAAS,oBAAoB,CAAC,KAAc;IAC1C,IAAI,KAAK,IAAI,IAAI;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC;IACxC,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IACzC,IAAI,KAAK,YAAY,UAAU;QAAE,OAAO,KAAK,CAAC,UAAU,CAAC;IACzD,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,MAAM,OAAO,OAAO;IAWlB,YAAY,OAAuB,EAAE;QAV7B,QAAG,GAAiC,IAAI,GAAG,EAAE,CAAC;QAC9C,cAAS,GAAG,CAAC,CAAC;QAId,SAAI,GAAG,CAAC,CAAC;QACT,WAAM,GAAG,CAAC,CAAC;QACX,cAAS,GAAG,CAAC,CAAC;QACd,oBAAe,GAAa,EAAE,CAAC;QAGrC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC;QACzD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,oBAAoB,CAAC;IAClE,CAAC;IAED,0DAA0D;IAC1D,GAAG,CAAC,GAAW;QACb,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,sCAAsC;QACtC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,KAAK,CAAC,IAAI,EAAE,CAAC;QACb,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAEzB,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,sDAAsD;IACtD,GAAG,CAAC,GAAW,EAAE,KAAQ;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAExC,kDAAkD;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,IAAI,QAAQ,CAAC,KAAK,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QAED,YAAY;QACZ,OAAO,IAAI,CAAC,SAAS,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrE,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;QAED,MAAM,KAAK,GAAoB;YAC7B,GAAG;YACH,KAAK;YACL,IAAI,EAAE,CAAC;YACP,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;YACtB,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;YACxB,KAAK;SACN,CAAC;QAEF,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC;IAC1B,CAAC;IAED,2CAA2C;IAC3C,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,4BAA4B;IAC5B,MAAM,CAAC,GAAW;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QACzB,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC;QAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,wBAAwB;IACxB,KAAK;QACH,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,sBAAsB;IACtB,QAAQ;QACN,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM;YAC7C,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM;YAC/E,CAAC,CAAC,CAAC,CAAC;QAEN,uBAAuB;QACvB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;aAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;aAC/B,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;aACZ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAE5C,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI;YACtB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,WAAW;YACX,OAAO;SACR,CAAC;IACJ,CAAC;IAED,qDAAqD;IACrD,OAAO;QACL,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IAED,mDAAmD;IACnD,MAAM,CAAC,aAAqB;QAC1B,IAAI,CAAC,UAAU,GAAG,aAAa,CAAC;QAChC,OAAO,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC7D,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;IACH,CAAC;IAEO,WAAW;QACjB,6EAA6E;QAC7E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC5C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,KAAK;YAAE,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEO,YAAY,CAAC,OAAe;QAClC,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC;QAC5D,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;YACvC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;CACF;AAED,gEAAgE;AAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;AAE/C,MAAM,UAAU,QAAQ,CAAc,SAAiB,EAAE,IAAqB;IAC5E,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,IAAI,OAAO,CAAI,IAAI,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,KAAmB,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,gBAAgB;IAC9B,MAAM,GAAG,GAAiC,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,cAAc;IAC5B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE;QAAE,KAAK,CAAC,KAAK,EAAE,CAAC;AACrD,CAAC"}

package/dist/brain/local-llm.d.ts

@@ -0,0 +1,20 @@
+import { LocalLLMConfig, LocalLLMProvider, LocalLLMResponse } from '../types.js';
+export declare class LocalLLM {
+    private config;
+    constructor(config?: Partial<LocalLLMConfig>);
+    /** Check if the local provider is reachable. */
+    isAvailable(): Promise<boolean>;
+    /** Generate text locally. Falls back to deterministic stub when unreachable. */
+    generate(prompt: string, system?: string): Promise<LocalLLMResponse>;
+    /** Rough per-call cost in USD for a local model — effectively zero (electricity). */
+    static estimatedCostUsd(_tokens: number): number;
+    getConfig(): LocalLLMConfig;
+    setConfig(patch: Partial<LocalLLMConfig>): void;
+    private generateOllama;
+    private fallback;
+}
+export declare function getLocalLLM(config?: Partial<LocalLLMConfig>): LocalLLM;
+export declare function resetLocalLLMForTests(): void;
+/** Map a generic provider preference to a LocalLLMProvider. */
+export declare function preferredLocalProvider(pref?: string): LocalLLMProvider;
+//# sourceMappingURL=local-llm.d.ts.map

package/dist/brain/local-llm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-llm.d.ts","sourceRoot":"","sources":["../../src/brain/local-llm.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAWjF,qBAAa,QAAQ;IACnB,OAAO,CAAC,MAAM,CAAiB;gBAEnB,MAAM,GAAE,OAAO,CAAC,cAAc,CAAM;IAIhD,gDAAgD;IAC1C,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAarC,gFAAgF;IAC1E,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAuB1E,qFAAqF;IACrF,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAIhD,SAAS,IAAI,cAAc;IAI3B,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,cAAc,CAAC,GAAG,IAAI;YAMjC,cAAc;IA8B5B,OAAO,CAAC,QAAQ;CAejB;AAID,wBAAgB,WAAW,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAAG,QAAQ,CAItE;AAED,wBAAgB,qBAAqB,IAAI,IAAI,CAE5C;AAED,+DAA+D;AAC/D,wBAAgB,sBAAsB,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,gBAAgB,CAGtE"}