ollama-intern-mcp 1.0.0

package/dist/corpus/storage.js

@@ -0,0 +1,81 @@
+/**
+ * Corpus persistence — one JSON file per named corpus.
+ *
+ * Location: ~/.ollama-intern/corpora/<name>.json  (override via INTERN_CORPUS_DIR)
+ *
+ * Schema is explicitly versioned so we can evolve without silent breakage.
+ * Raw vectors are stored (this file is the database), but they never reach
+ * Claude — search handlers strip them before returning.
+ */
+import { readFile, writeFile, mkdir, readdir, stat } from "node:fs/promises";
+import { existsSync } from "node:fs";
+import { homedir } from "node:os";
+import { join, dirname } from "node:path";
+import { InternError } from "../errors.js";
+export const CORPUS_SCHEMA_VERSION = 2;
+export function corpusDir() {
+    return process.env.INTERN_CORPUS_DIR ?? join(homedir(), ".ollama-intern", "corpora");
+}
+export function corpusPath(name) {
+    return join(corpusDir(), `${name}.json`);
+}
+const NAME_RX = /^[a-zA-Z0-9_-]+$/;
+export function assertValidCorpusName(name) {
+    if (!NAME_RX.test(name)) {
+        throw new InternError("SCHEMA_INVALID", `Invalid corpus name "${name}"`, "Corpus names must match [a-zA-Z0-9_-]+ so they map safely to filenames.", false);
+    }
+}
+export async function loadCorpus(name) {
+    assertValidCorpusName(name);
+    const path = corpusPath(name);
+    if (!existsSync(path))
+        return null;
+    const raw = await readFile(path, "utf8");
+    const parsed = JSON.parse(raw);
+    const found = parsed.schema_version;
+    if (found !== CORPUS_SCHEMA_VERSION) {
+        throw new InternError("SCHEMA_INVALID", `Corpus "${name}" is at schema v${found ?? "unknown"}; this build expects v${CORPUS_SCHEMA_VERSION}. File: ${path}`, `Re-index to upgrade in place: ollama_corpus_index({ name: "${name}", paths: [<your source paths>] }). No migration is performed — the re-index rewrites ${path} with the current schema.`, false);
+    }
+    return parsed;
+}
+export async function saveCorpus(corpus) {
+    assertValidCorpusName(corpus.name);
+    const path = corpusPath(corpus.name);
+    await mkdir(dirname(path), { recursive: true });
+    await writeFile(path, JSON.stringify(corpus), "utf8");
+}
+export async function listCorpora() {
+    const dir = corpusDir();
+    if (!existsSync(dir))
+        return [];
+    const entries = await readdir(dir);
+    const summaries = [];
+    for (const entry of entries) {
+        if (!entry.endsWith(".json"))
+            continue;
+        const name = entry.slice(0, -".json".length);
+        if (!NAME_RX.test(name))
+            continue;
+        try {
+            const full = join(dir, entry);
+            const [corpus, st] = await Promise.all([loadCorpus(name), stat(full)]);
+            if (!corpus)
+                continue;
+            summaries.push({
+                name: corpus.name,
+                model_version: corpus.model_version,
+                indexed_at: corpus.indexed_at,
+                documents: corpus.stats.documents,
+                chunks: corpus.stats.chunks,
+                total_chars: corpus.stats.total_chars,
+                bytes_on_disk: st.size,
+            });
+        }
+        catch {
+            // Skip malformed corpora silently in list; load will surface the error.
+        }
+    }
+    summaries.sort((a, b) => a.name.localeCompare(b.name));
+    return summaries;
+}
+//# sourceMappingURL=storage.js.map

package/dist/corpus/storage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage.js","sourceRoot":"","sources":["../../src/corpus/storage.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7E,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAmCvC,MAAM,UAAU,SAAS;IACvB,OAAO,OAAO,CAAC,GAAG,CAAC,iBAAiB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,gBAAgB,EAAE,SAAS,CAAC,CAAC;AACvF,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,GAAG,IAAI,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED,MAAM,OAAO,GAAG,kBAAkB,CAAC;AAEnC,MAAM,UAAU,qBAAqB,CAAC,IAAY;IAChD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,WAAW,CACnB,gBAAgB,EAChB,wBAAwB,IAAI,GAAG,EAC/B,yEAAyE,EACzE,KAAK,CACN,CAAC;IACJ,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,IAAY;IAC3C,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAsD,CAAC;IACpF,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC;IACpC,IAAI,KAAK,KAAK,qBAAqB,EAAE,CAAC;QACpC,MAAM,IAAI,WAAW,CACnB,gBAAgB,EAChB,WAAW,IAAI,mBAAmB,KAAK,IAAI,SAAS,yBAAyB,qBAAqB,WAAW,IAAI,EAAE,EACnH,8DAA8D,IAAI,yFAAyF,IAAI,2BAA2B,EAC1L,KAAK,CACN,CAAC;IACJ,CAAC;IACD,OAAO,MAAoB,CAAC;AAC9B,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,MAAkB;IACjD,qBAAqB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;AACxD,CAAC;AAYD,MAAM,CAAC,KAAK,UAAU,WAAW;IAC/B,MAAM,GAAG,GAAG,SAAS,EAAE,CAAC;IACxB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;IACnC,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,SAAS;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,aAAa,EAAE,MAAM,CAAC,aAAa;gBACnC,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS;gBACjC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;gBAC3B,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,WAAW;gBACrC,aAAa,EAAE,EAAE,CAAC,IAAI;aACvB,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,wEAAwE;QAC1E,CAAC;IACH,CAAC;IACD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/coverage.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Coverage contract — after a multi-source research or summarize call,
+ * detect which source paths the model's output actually covered.
+ *
+ * A two-file summary that only mentions one file is a real quality bug
+ * (observed in the first adoption pass: commandui.md + hardware-m5-max.md
+ * → summary only covered CommandUI). Silently accepting that makes the
+ * flagship less trustworthy. This module surfaces omissions so the caller
+ * knows when to rerun, re-prompt, or read the omitted file themselves.
+ *
+ * Detection is deterministic and cheap — no extra LLM calls. We pull a
+ * small set of "distinctive tokens" per source and check how many show
+ * up in the output. Accurate enough to catch whole-file omissions,
+ * conservative enough to avoid false-alarm on tight summaries.
+ */
+import type { LoadedSource } from "./sources.js";
+export interface CoverageReport {
+    covered_sources: string[];
+    omitted_sources: string[];
+    coverage_notes: string[];
+}
+export interface DetectCoverageOptions {
+    /** Paths the caller already knows are covered (e.g. from research citations). */
+    explicitlyCovered?: string[];
+    /** Maximum signal tokens to extract per source. Default 12. */
+    maxTokensPerSource?: number;
+}
+/**
+ * Detect which source paths the output covers.
+ *
+ * A source is "covered" when:
+ *   - it appears in `explicitlyCovered` (citations etc.), OR
+ *   - any of its signal tokens appear in the output.
+ *
+ * Everything else is "omitted" and a coverage note is added.
+ */
+export declare function detectCoverage(output: string, sources: LoadedSource[], options?: DetectCoverageOptions): CoverageReport;
+//# sourceMappingURL=coverage.d.ts.map

package/dist/coverage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage.d.ts","sourceRoot":"","sources":["../src/coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEjD,MAAM,WAAW,cAAc;IAC7B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AA4DD,MAAM,WAAW,qBAAqB;IACpC,iFAAiF;IACjF,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC7B,+DAA+D;IAC/D,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,YAAY,EAAE,EACvB,OAAO,GAAE,qBAA0B,GAClC,cAAc,CAiChB"}

package/dist/coverage.js

@@ -0,0 +1,117 @@
+/**
+ * Coverage contract — after a multi-source research or summarize call,
+ * detect which source paths the model's output actually covered.
+ *
+ * A two-file summary that only mentions one file is a real quality bug
+ * (observed in the first adoption pass: commandui.md + hardware-m5-max.md
+ * → summary only covered CommandUI). Silently accepting that makes the
+ * flagship less trustworthy. This module surfaces omissions so the caller
+ * knows when to rerun, re-prompt, or read the omitted file themselves.
+ *
+ * Detection is deterministic and cheap — no extra LLM calls. We pull a
+ * small set of "distinctive tokens" per source and check how many show
+ * up in the output. Accurate enough to catch whole-file omissions,
+ * conservative enough to avoid false-alarm on tight summaries.
+ */
+import { basename, extname } from "node:path";
+/** Stop words + common connectors we won't treat as distinctive signal. */
+const STOP = new Set([
+    "the", "and", "for", "with", "from", "into", "over", "under", "this", "that", "these", "those",
+    "have", "will", "shall", "been", "were", "being", "your", "their", "them", "they", "each",
+    "when", "what", "where", "which", "would", "could", "should", "about", "after", "before",
+    "some", "most", "many", "much", "more", "less", "also", "than", "then", "there", "here",
+    "only", "just", "very", "such", "like", "than", "onto", "upon", "into", "unto", "then",
+    "name", "type", "description", "true", "false", "null", "none", "note", "notes", "section",
+    "example", "examples", "step", "steps", "item", "items", "thing", "things", "file", "files",
+    "input", "inputs", "output", "outputs", "result", "results", "value", "values", "field", "fields",
+    "option", "options", "param", "params", "return", "returns", "function", "class", "method",
+    "interface", "import", "export", "const", "async", "await", "null", "true", "false",
+]);
+function isSignalToken(word) {
+    if (word.length < 5)
+        return false;
+    if (/^\d+$/.test(word))
+        return false;
+    if (STOP.has(word.toLowerCase()))
+        return false;
+    return true;
+}
+/** Extract distinctive signal tokens from a source: frequent, long, non-stop. */
+function signalTokensFor(source, maxTokens = 12) {
+    const body = source.body.slice(0, 4000); // headers/summary region is enough
+    const words = body
+        .toLowerCase()
+        .split(/[^a-z0-9-]+/g)
+        .filter(isSignalToken);
+    const freq = new Map();
+    for (const w of words)
+        freq.set(w, (freq.get(w) ?? 0) + 1);
+    // Score: frequency * length — long repeated tokens are most distinctive.
+    const ranked = [...freq.entries()]
+        .map(([w, c]) => ({ word: w, score: c * Math.min(w.length, 12) }))
+        .sort((a, b) => b.score - a.score)
+        .slice(0, maxTokens)
+        .map((r) => r.word);
+    // Always include the filename stem — it's often the strongest coverage signal
+    // ("commandui" from "commandui.md" will appear in any summary that covers it).
+    const stem = basename(source.path, extname(source.path)).toLowerCase();
+    if (stem && !ranked.includes(stem))
+        ranked.unshift(stem);
+    return ranked;
+}
+function outputHasAnyToken(output, tokens) {
+    const lower = output.toLowerCase();
+    for (const t of tokens) {
+        // Word-ish match: surrounded by non-alphanum or at string edges.
+        const re = new RegExp(`(^|[^a-z0-9])${escapeRegExp(t)}([^a-z0-9]|$)`, "i");
+        if (re.test(lower))
+            return true;
+    }
+    return false;
+}
+function escapeRegExp(s) {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+/**
+ * Detect which source paths the output covers.
+ *
+ * A source is "covered" when:
+ *   - it appears in `explicitlyCovered` (citations etc.), OR
+ *   - any of its signal tokens appear in the output.
+ *
+ * Everything else is "omitted" and a coverage note is added.
+ */
+export function detectCoverage(output, sources, options = {}) {
+    const explicit = new Set((options.explicitlyCovered ?? []).map(normalizeForCompare));
+    const covered = [];
+    const omitted = [];
+    const notes = [];
+    for (const src of sources) {
+        const isExplicit = explicit.has(normalizeForCompare(src.path));
+        if (isExplicit) {
+            covered.push(src.path);
+            continue;
+        }
+        const tokens = signalTokensFor(src, options.maxTokensPerSource);
+        if (tokens.length === 0) {
+            // No detectable signal — don't falsely claim coverage. Call it omitted.
+            omitted.push(src.path);
+            notes.push(`No distinctive tokens extractable from "${src.path}"; coverage could not be verified.`);
+            continue;
+        }
+        if (outputHasAnyToken(output, tokens)) {
+            covered.push(src.path);
+        }
+        else {
+            omitted.push(src.path);
+        }
+    }
+    if (omitted.length > 0 && sources.length > 1) {
+        notes.unshift(`Summary omitted ${omitted.length} of ${sources.length} source(s). Consider rerunning with a narrower focus, a longer max_words, or reading the omitted files directly.`);
+    }
+    return { covered_sources: covered, omitted_sources: omitted, coverage_notes: notes };
+}
+function normalizeForCompare(p) {
+    return p.replace(/\\/g, "/").toLowerCase();
+}
+//# sourceMappingURL=coverage.js.map

package/dist/coverage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage.js","sourceRoot":"","sources":["../src/coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAS9C,2EAA2E;AAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;IACnB,KAAK,EAAC,KAAK,EAAC,KAAK,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO;IACnF,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM;IAC/E,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO,EAAC,OAAO,EAAC,OAAO,EAAC,QAAQ,EAAC,OAAO,EAAC,OAAO,EAAC,QAAQ;IAC/E,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM;IAC7E,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM;IAC5E,MAAM,EAAC,MAAM,EAAC,aAAa,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,SAAS;IACjF,SAAS,EAAC,UAAU,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO,EAAC,QAAQ,EAAC,MAAM,EAAC,OAAO;IAClF,OAAO,EAAC,QAAQ,EAAC,QAAQ,EAAC,SAAS,EAAC,QAAQ,EAAC,SAAS,EAAC,OAAO,EAAC,QAAQ,EAAC,OAAO,EAAC,QAAQ;IACxF,QAAQ,EAAC,SAAS,EAAC,OAAO,EAAC,QAAQ,EAAC,QAAQ,EAAC,SAAS,EAAC,UAAU,EAAC,OAAO,EAAC,QAAQ;IAClF,WAAW,EAAC,QAAQ,EAAC,QAAQ,EAAC,OAAO,EAAC,OAAO,EAAC,OAAO,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO;CAC5E,CAAC,CAAC;AAEH,SAAS,aAAa,CAAC,IAAY;IACjC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iFAAiF;AACjF,SAAS,eAAe,CAAC,MAAoB,EAAE,YAAoB,EAAE;IACnE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,mCAAmC;IAC5E,MAAM,KAAK,GAAG,IAAI;SACf,WAAW,EAAE;SACb,KAAK,CAAC,cAAc,CAAC;SACrB,MAAM,CAAC,aAAa,CAAC,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3D,yEAAyE;IACzE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;SAC/B,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SACjE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEtB,8EAA8E;IAC9E,+EAA+E;IAC/E,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IACvE,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CAAC,MAAc,EAAE,MAAgB;IACzD,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,iEAAiE;QACjE,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,gBAAgB,YAAY,CAAC,CAAC,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QAC3E,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IAClC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AASD;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAc,EACd,OAAuB,EACvB,UAAiC,EAAE;IAEnC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC;IACrF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/D,IAAI,UAAU,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAChE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,wEAAwE;YACxE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,2CAA2C,GAAG,CAAC,IAAI,oCAAoC,CAAC,CAAC;YACpG,SAAS;QACX,CAAC;QACD,IAAI,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7C,KAAK,CAAC,OAAO,CACX,mBAAmB,OAAO,CAAC,MAAM,OAAO,OAAO,CAAC,MAAM,kHAAkH,CACzK,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;AACvF,CAAC;AAED,SAAS,mBAAmB,CAAC,CAAS;IACpC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;AAC7C,CAAC"}

package/dist/embedMath.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Minimal vector math for concept-search mode. Stdlib only.
+ *
+ * `cosine(a, b)` returns a similarity in [-1, 1] (higher = more similar).
+ * `rank` returns descending by score and stable by input order on ties.
+ */
+export declare function cosine(a: number[], b: number[]): number;
+export interface RankedCandidate<T> {
+    item: T;
+    score: number;
+    /** Input-order index for stable sorting. */
+    originalIndex: number;
+}
+/**
+ * Rank candidates by cosine similarity to queryVec, descending.
+ * Ties break on original input index so the output is deterministic.
+ */
+export declare function rankByCosine<T>(queryVec: number[], candidates: Array<{
+    item: T;
+    vec: number[];
+}>): RankedCandidate<T>[];
+//# sourceMappingURL=embedMath.d.ts.map

package/dist/embedMath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedMath.d.ts","sourceRoot":"","sources":["../src/embedMath.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYvD;AAED,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,IAAI,EAAE,CAAC,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,QAAQ,EAAE,MAAM,EAAE,EAClB,UAAU,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,GAAG,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,GAC5C,eAAe,CAAC,CAAC,CAAC,EAAE,CAQtB"}

package/dist/embedMath.js

@@ -0,0 +1,34 @@
+/**
+ * Minimal vector math for concept-search mode. Stdlib only.
+ *
+ * `cosine(a, b)` returns a similarity in [-1, 1] (higher = more similar).
+ * `rank` returns descending by score and stable by input order on ties.
+ */
+export function cosine(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dot = 0;
+    let na = 0;
+    let 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 denom = Math.sqrt(na) * Math.sqrt(nb);
+    return denom === 0 ? 0 : dot / denom;
+}
+/**
+ * Rank candidates by cosine similarity to queryVec, descending.
+ * Ties break on original input index so the output is deterministic.
+ */
+export function rankByCosine(queryVec, candidates) {
+    const ranked = candidates.map((c, i) => ({
+        item: c.item,
+        score: cosine(queryVec, c.vec),
+        originalIndex: i,
+    }));
+    ranked.sort((a, b) => (b.score - a.score) || (a.originalIndex - b.originalIndex));
+    return ranked;
+}
+//# sourceMappingURL=embedMath.js.map

package/dist/embedMath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedMath.js","sourceRoot":"","sources":["../src/embedMath.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,UAAU,MAAM,CAAC,CAAW,EAAE,CAAW;IAC7C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,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,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC;AASD;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAkB,EAClB,UAA6C;IAE7C,MAAM,MAAM,GAAyB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7D,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC;QAC9B,aAAa,EAAE,CAAC;KACjB,CAAC,CAAC,CAAC;IACJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;IAClF,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/envelope.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Uniform response envelope — every tool returns this shape.
+ *
+ * residency is populated from Ollama's /api/ps. When in_vram is false
+ * or size_vram < size, the model paged to disk; inference drops 5–10×.
+ * Surfacing it mechanically in every call is what prevents hand-wavy
+ * performance claims when Ollama's eviction bug (#13227) strikes.
+ */
+import type { Tier } from "./tiers.js";
+export interface Residency {
+    in_vram: boolean;
+    size_bytes: number;
+    size_vram_bytes: number;
+    evicted: boolean;
+    expires_at: string | null;
+}
+export interface Envelope<T> {
+    result: T;
+    tier_used: Tier;
+    model: string;
+    /** Active hardware profile (e.g. "dev-rtx5080", "m5-max"). Lets bench/eval runs keep dev numbers out of publishable tables. */
+    hardware_profile: string;
+    tokens_in: number;
+    tokens_out: number;
+    elapsed_ms: number;
+    residency: Residency | null;
+    /** Set when a timeout fired and the server fell back to a cheaper tier. */
+    fallback_from?: Tier;
+    /** Non-fatal warnings — e.g. "2 citations stripped (paths not in source_paths)". */
+    warnings?: string[];
+    /** Total items in the batch. Only set on batch-mode calls. */
+    batch_count?: number;
+    /** Items that returned {ok: true, result}. Only set on batch-mode calls. */
+    ok_count?: number;
+    /** Items that returned {ok: false, error}. Only set on batch-mode calls. */
+    error_count?: number;
+}
+export interface EnvelopeBuilderInput<T> {
+    result: T;
+    tier: Tier;
+    model: string;
+    hardwareProfile: string;
+    tokensIn: number;
+    tokensOut: number;
+    startedAt: number;
+    residency: Residency | null;
+    fallbackFrom?: Tier;
+    warnings?: string[];
+}
+export declare function buildEnvelope<T>(input: EnvelopeBuilderInput<T>): Envelope<T>;
+/** True when residency indicates the model was evicted to disk. */
+export declare function isEvicted(residency: Residency | null): boolean;
+//# sourceMappingURL=envelope.d.ts.map

package/dist/envelope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"envelope.d.ts","sourceRoot":"","sources":["../src/envelope.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAEvC,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC;IACzB,MAAM,EAAE,CAAC,CAAC;IACV,SAAS,EAAE,IAAI,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,+HAA+H;IAC/H,gBAAgB,EAAE,MAAM,CAAC;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IAC5B,2EAA2E;IAC3E,aAAa,CAAC,EAAE,IAAI,CAAC;IACrB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,8DAA8D;IAC9D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,4EAA4E;IAC5E,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,4EAA4E;IAC5E,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACrC,MAAM,EAAE,CAAC,CAAC;IACV,IAAI,EAAE,IAAI,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IAC5B,YAAY,CAAC,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAc5E;AAED,mEAAmE;AACnE,wBAAgB,SAAS,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,GAAG,OAAO,CAG9D"}

package/dist/envelope.js

@@ -0,0 +1,32 @@
+/**
+ * Uniform response envelope — every tool returns this shape.
+ *
+ * residency is populated from Ollama's /api/ps. When in_vram is false
+ * or size_vram < size, the model paged to disk; inference drops 5–10×.
+ * Surfacing it mechanically in every call is what prevents hand-wavy
+ * performance claims when Ollama's eviction bug (#13227) strikes.
+ */
+export function buildEnvelope(input) {
+    const env = {
+        result: input.result,
+        tier_used: input.tier,
+        model: input.model,
+        hardware_profile: input.hardwareProfile,
+        tokens_in: input.tokensIn,
+        tokens_out: input.tokensOut,
+        elapsed_ms: Date.now() - input.startedAt,
+        residency: input.residency,
+    };
+    if (input.fallbackFrom)
+        env.fallback_from = input.fallbackFrom;
+    if (input.warnings && input.warnings.length > 0)
+        env.warnings = input.warnings;
+    return env;
+}
+/** True when residency indicates the model was evicted to disk. */
+export function isEvicted(residency) {
+    if (!residency)
+        return false;
+    return residency.evicted || !residency.in_vram || residency.size_vram_bytes < residency.size_bytes;
+}
+//# sourceMappingURL=envelope.js.map

package/dist/envelope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"envelope.js","sourceRoot":"","sources":["../src/envelope.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AA+CH,MAAM,UAAU,aAAa,CAAI,KAA8B;IAC7D,MAAM,GAAG,GAAgB;QACvB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,SAAS,EAAE,KAAK,CAAC,IAAI;QACrB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,KAAK,CAAC,eAAe;QACvC,SAAS,EAAE,KAAK,CAAC,QAAQ;QACzB,UAAU,EAAE,KAAK,CAAC,SAAS;QAC3B,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS;QACxC,SAAS,EAAE,KAAK,CAAC,SAAS;KAC3B,CAAC;IACF,IAAI,KAAK,CAAC,YAAY;QAAE,GAAG,CAAC,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC;IAC/D,IAAI,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC/E,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,SAAS,CAAC,SAA2B;IACnD,IAAI,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IAC7B,OAAO,SAAS,CAAC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,eAAe,GAAG,SAAS,CAAC,UAAU,CAAC;AACrG,CAAC"}

package/dist/errors.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Structured error shape — code / message / hint / retryable.
+ * Matches shipcheck hard gate B: no raw stacks, always a hint, always a retry signal.
+ */
+export type ErrorCode = "OLLAMA_UNREACHABLE" | "OLLAMA_MODEL_MISSING" | "OLLAMA_TIMEOUT" | "TIER_TIMEOUT" | "PROTECTED_PATH_WRITE" | "CITATION_INVALID" | "COMPILE_FAILED" | "EXTRACT_UNPARSEABLE" | "SOURCE_PATH_NOT_FOUND" | "SCHEMA_INVALID" | "INTERNAL";
+export declare class InternError extends Error {
+    readonly code: ErrorCode;
+    readonly hint: string;
+    readonly retryable: boolean;
+    constructor(code: ErrorCode, message: string, hint: string, retryable?: boolean);
+}
+export interface ErrorShape {
+    error: true;
+    code: ErrorCode;
+    message: string;
+    hint: string;
+    retryable: boolean;
+}
+export declare function toErrorShape(err: unknown): ErrorShape;
+//# sourceMappingURL=errors.d.ts.map

package/dist/errors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,MAAM,SAAS,GACjB,oBAAoB,GACpB,sBAAsB,GACtB,gBAAgB,GAChB,cAAc,GACd,sBAAsB,GACtB,kBAAkB,GAClB,gBAAgB,GAChB,qBAAqB,GACrB,uBAAuB,GACvB,gBAAgB,GAChB,UAAU,CAAC;AAEf,qBAAa,WAAY,SAAQ,KAAK;aAElB,IAAI,EAAE,SAAS;aAEf,IAAI,EAAE,MAAM;aACZ,SAAS,EAAE,OAAO;gBAHlB,IAAI,EAAE,SAAS,EAC/B,OAAO,EAAE,MAAM,EACC,IAAI,EAAE,MAAM,EACZ,SAAS,GAAE,OAAe;CAK7C;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,IAAI,CAAC;IACZ,IAAI,EAAE,SAAS,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU,CAYrD"}

package/dist/errors.js

@@ -0,0 +1,30 @@
+/**
+ * Structured error shape — code / message / hint / retryable.
+ * Matches shipcheck hard gate B: no raw stacks, always a hint, always a retry signal.
+ */
+export class InternError extends Error {
+    code;
+    hint;
+    retryable;
+    constructor(code, message, hint, retryable = false) {
+        super(message);
+        this.code = code;
+        this.hint = hint;
+        this.retryable = retryable;
+        this.name = "InternError";
+    }
+}
+export function toErrorShape(err) {
+    if (err instanceof InternError) {
+        return { error: true, code: err.code, message: err.message, hint: err.hint, retryable: err.retryable };
+    }
+    const message = err instanceof Error ? err.message : String(err);
+    return {
+        error: true,
+        code: "INTERNAL",
+        message,
+        hint: "Unexpected error. Check ~/.ollama-intern/log.ndjson for details.",
+        retryable: false,
+    };
+}
+//# sourceMappingURL=errors.js.map

package/dist/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAeH,MAAM,OAAO,WAAY,SAAQ,KAAK;IAElB;IAEA;IACA;IAJlB,YACkB,IAAe,EAC/B,OAAe,EACC,IAAY,EACZ,YAAqB,KAAK;QAE1C,KAAK,CAAC,OAAO,CAAC,CAAC;QALC,SAAI,GAAJ,IAAI,CAAW;QAEf,SAAI,GAAJ,IAAI,CAAQ;QACZ,cAAS,GAAT,SAAS,CAAiB;QAG1C,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;IAC5B,CAAC;CACF;AAUD,MAAM,UAAU,YAAY,CAAC,GAAY;IACvC,IAAI,GAAG,YAAY,WAAW,EAAE,CAAC;QAC/B,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;IACzG,CAAC;IACD,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACjE,OAAO;QACL,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,UAAU;QAChB,OAAO;QACP,IAAI,EAAE,kEAAkE;QACxE,SAAS,EAAE,KAAK;KACjB,CAAC;AACJ,CAAC"}

package/dist/evals/retrieval.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Retrieval eval runner — measurement law for the Retrieval Truth Spine.
+ *
+ * Loads gold queries from evals/gold/retrieval.jsonl, runs every query
+ * through every search mode against a fixture corpus, and reports
+ * precision@1 and precision@3 per (mode × class) plus per-mode and
+ * overall aggregates.
+ *
+ * The runner is deliberately retrieval-native: assertions check whether
+ * the expected path appears in the top-K hits, not whether the answer
+ * is correct. Answer synthesis is slice 5; measurement is the floor
+ * under it.
+ *
+ * No product-surface changes ride on this file. It is a pure consumer
+ * of searchCorpus() and the corpus schema.
+ */
+import type { CorpusFile } from "../corpus/storage.js";
+import { type SearchMode } from "../corpus/searcher.js";
+import type { OllamaClient } from "../ollama.js";
+export type QueryClass = "semantic" | "fact" | "procedural" | "confusable";
+export declare const QUERY_CLASSES: readonly QueryClass[];
+export interface GoldQuery {
+    id: string;
+    class: QueryClass;
+    query: string;
+    /** Paths that count as correct answers. Match is OR: at least one must appear in top-K. Paths are matched by basename so fixture-dir location doesn't matter. */
+    expected_paths: string[];
+    /** Optional factual anchor. If present, at least one matching chunk's text must contain every phrase. */
+    expected_phrases?: string[];
+}
+export declare function loadGold(filePath: string): Promise<GoldQuery[]>;
+export interface EvalRecord {
+    id: string;
+    class: QueryClass;
+    query: string;
+    mode: SearchMode;
+    top_paths: string[];
+    hit1: boolean;
+    hit3: boolean;
+    /** null if no expected_phrases on the query. */
+    phrasesHit: boolean | null;
+}
+export interface RunEvalOptions {
+    gold: GoldQuery[];
+    corpus: CorpusFile;
+    client: OllamaClient;
+    model: string;
+    topK?: number;
+    previewChars?: number;
+}
+export declare function runRetrievalEval(opts: RunEvalOptions): Promise<EvalRecord[]>;
+export interface CellMetrics {
+    n: number;
+    precision1: number;
+    precision3: number;
+}
+export interface EvalSummary {
+    overall: CellMetrics;
+    byMode: Record<SearchMode, CellMetrics>;
+    byModeByClass: Record<SearchMode, Record<QueryClass, CellMetrics>>;
+}
+export declare function summarizeEval(records: EvalRecord[]): EvalSummary;
+/**
+ * Markdown-friendly report suitable for console.log during tests. The
+ * shape is stable so it can be diffed between runs.
+ */
+export declare function formatEvalReport(summary: EvalSummary): string;
+//# sourceMappingURL=retrieval.d.ts.map

package/dist/evals/retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieval.d.ts","sourceRoot":"","sources":["../../src/evals/retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAA8B,KAAK,UAAU,EAAkB,MAAM,uBAAuB,CAAC;AACpG,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEjD,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,MAAM,GAAG,YAAY,GAAG,YAAY,CAAC;AAE3E,eAAO,MAAM,aAAa,EAAE,SAAS,UAAU,EAKrC,CAAC;AAEX,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,UAAU,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,iKAAiK;IACjK,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,yGAAyG;IACzG,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC7B;AAED,wBAAsB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAYrE;AAED,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,UAAU,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,UAAU,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;IACd,gDAAgD;IAChD,UAAU,EAAE,OAAO,GAAG,IAAI,CAAC;CAC5B;AAqCD,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,SAAS,EAAE,CAAC;IAClB,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,EAAE,YAAY,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,wBAAsB,gBAAgB,CAAC,IAAI,EAAE,cAAc,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAiClF;AAED,MAAM,WAAW,WAAW;IAC1B,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,WAAW,CAAC;IACrB,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACxC,aAAa,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;CACpE;AAqBD,wBAAgB,aAAa,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,WAAW,CA0BhE;AAMD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,WAAW,GAAG,MAAM,CA0B7D"}