hippo-memory 1.44.0 → 1.45.0

package/dist/src/replay.js

@@ -1,122 +0,0 @@
-/**
- * Replay — biologically-inspired rehearsal during consolidation.
- *
- * Hippocampal replay is internally-driven reactivation of memories during
- * slow-wave sleep: the brain picks important recent experiences and "plays
- * them back" without external input, strengthening them before they decay.
- * In McClelland's complementary-learning-systems framing, replay is also
- * how episodic memories train the neocortex (interleaved rehearsal); in
- * reward-modulated STDP, replay is gated by dopamine so rewarded
- * experiences get preferentially consolidated.
- *
- * This module implements a lightweight, deterministic analog. During each
- * `hippo sleep`, we sample N surviving memories by a priority score that
- * weighs reward feedback, emotional valence, under-rehearsal, and age —
- * then apply the same retrieval-strengthening dynamics `markRetrieved`
- * applies to real queries. The effect is that important memories stay
- * strong even when the user hasn't explicitly queried them recently.
- *
- * Distinct from the other consolidation passes:
- *   - decay: removes what's too weak
- *   - physics: moves particles in embedding space
- *   - merge: collapses near-duplicate episodics into semantics
- *   - REPLAY: picks winners and rehearses them (this file)
- */
-import { isOutcomeSlowAblated } from './ablation.js';
-import { resolveConfidence } from './memory.js';
-const VALENCE_WEIGHT = {
-    neutral: 1.0,
-    positive: 1.3,
-    negative: 1.5,
-    critical: 2.0,
-};
-/**
- * Priority score used to rank survivors for replay. Higher = more likely
- * to be sampled. Pure function of the entry and current time.
- */
-export function replayPriority(entry, now) {
-    const pos = entry.outcome_positive ?? 0;
-    const neg = entry.outcome_negative ?? 0;
-    // Reward signal: neutral memories get 1, strongly-rewarded memories > 1,
-    // negative-dominated memories floor at 0.1 (so they're still eligible, just
-    // much less likely to be sampled than neutral peers). Clamp is required
-    // because sampleForReplay depends on all weights being positive.
-    const rewardSignal = isOutcomeSlowAblated()
-        ? 1.0 // EVAL-ONLY ablation (see ablation.ts): outcome-off also silences replay's reward bias
-        : Math.max(0.1, 1 + pos * 0.5 + (pos - neg) * 0.25);
-    const valence = VALENCE_WEIGHT[entry.emotional_valence] ?? 1.0;
-    // Under-rehearsed memories benefit most from replay.
-    const underRehearsed = 1 / (1 + (entry.retrieval_count ?? 0));
-    // Idle-time boost: memories that haven't been touched recently need rehearsal more.
-    const lastRetrieved = new Date(entry.last_retrieved);
-    const deltaMs = now.getTime() - lastRetrieved.getTime();
-    const ageHours = Number.isFinite(deltaMs) ? Math.max(0, deltaMs / 3_600_000) : 0;
-    const idleBoost = 1 + Math.log1p(ageHours) * 0.1;
-    // Weight by current strength so dead-and-decaying memories don't waste replay slots.
-    const rawStrength = Number.isFinite(entry.strength) ? entry.strength : 0;
-    const strengthFloor = Math.max(0.1, rawStrength);
-    return rewardSignal * valence * underRehearsed * idleBoost * strengthFloor;
-}
-/**
- * Deterministic 32-bit RNG (Mulberry32). Same seed → same sequence.
- * Keeps replay reproducible for tests and audit runs without bringing
- * in a random-number dependency.
- */
-function mulberry32(seed) {
-    let s = seed >>> 0;
-    return () => {
-        let t = (s += 0x6D2B79F5);
-        t = Math.imul(t ^ (t >>> 15), t | 1);
-        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
-        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
-    };
-}
-/**
- * Pick `count` memories for replay, weighted by `replayPriority`, without
- * replacement. Deterministic given the same seed.
- *
- * The sampler is weighted but not greedy — picking by priority alone would
- * always pick the top-N, which overfits. Biological replay shows both
- * preferential-for-reward AND stochastic-exploration characteristics; we
- * keep the stochastic element so adjacent survivors aren't always ignored.
- */
-export function sampleForReplay(survivors, count, now, seed = Date.now() >>> 0) {
-    if (count <= 0 || survivors.length === 0)
-        return [];
-    const rng = mulberry32(seed);
-    // Deliberately-marked and aged-out memories are both untrusted; rehearsing
-    // them would defeat the purpose of staleness, so derive rather than trust
-    // the stored value (it no longer carries the age-out case, see memory.ts).
-    const eligible = survivors.filter((e) => resolveConfidence(e, now) !== 'stale');
-    if (eligible.length === 0)
-        return [];
-    const pool = eligible.map((entry, idx) => ({
-        entry,
-        idx,
-        weight: replayPriority(entry, now),
-    }));
-    const want = Math.min(count, pool.length);
-    const chosen = [];
-    const taken = new Set();
-    for (let k = 0; k < want; k++) {
-        let totalW = 0;
-        for (const p of pool)
-            if (!taken.has(p.idx))
-                totalW += p.weight;
-        if (totalW <= 0)
-            break;
-        let r = rng() * totalW;
-        for (const p of pool) {
-            if (taken.has(p.idx))
-                continue;
-            r -= p.weight;
-            if (r <= 0) {
-                chosen.push(p.entry);
-                taken.add(p.idx);
-                break;
-            }
-        }
-    }
-    return chosen;
-}
-//# sourceMappingURL=replay.js.map

package/dist/src/replay.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"replay.js","sourceRoot":"","sources":["../../src/replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAA2C,MAAM,aAAa,CAAC;AAEzF,MAAM,cAAc,GAAG;IACrB,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG;CAC6B,CAAC;AAE7C;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAkB,EAAE,GAAS;IAC1D,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACxC,yEAAyE;IACzE,4EAA4E;IAC5E,wEAAwE;IACxE,iEAAiE;IACjE,MAAM,YAAY,GAAG,oBAAoB,EAAE;QACzC,CAAC,CAAC,GAAG,CAAC,uFAAuF;QAC7F,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC;IAE/D,qDAAqD;IACrD,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC,CAAC;IAE9D,oFAAoF;IACpF,MAAM,aAAa,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;IACxD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;IAEjD,qFAAqF;IACrF,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAEjD,OAAO,YAAY,GAAG,OAAO,GAAG,cAAc,GAAG,SAAS,GAAG,aAAa,CAAC;AAC7E,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;IACnB,OAAO,GAAG,EAAE;QACV,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC;QAC1B,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAC7B,SAAwB,EACxB,KAAa,EACb,GAAS,EACT,OAAe,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC;IAE/B,IAAI,KAAK,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAE7B,2EAA2E;IAC3E,0EAA0E;IAC1E,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,OAAO,CAAC,CAAC;IAChF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACzC,KAAK;QACL,GAAG;QACH,MAAM,EAAE,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC;KACnC,CAAC,CAAC,CAAC;IAEJ,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC;QAChE,IAAI,MAAM,IAAI,CAAC;YAAE,MAAM;QACvB,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,MAAM,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/src/rerankers/cross-encoder.js

@@ -1,137 +0,0 @@
-import { createRequire } from 'node:module';
-import { pathToFileURL } from 'node:url';
-const MODEL_NAME = 'Xenova/ms-marco-MiniLM-L-6-v2';
-const _require = createRequire(import.meta.url);
-const TRANSFORMERS_PACKAGES = ['@huggingface/transformers', '@xenova/transformers'];
-// Returns the ESM entry URL, the same build src/embeddings.ts imports. A
-// require-style resolve picks the CommonJS build and puts a second copy of
-// the library, with its own ONNX sessions, in the process.
-function resolveTransformersPackage() {
-    for (const name of TRANSFORMERS_PACKAGES) {
-        try {
-            return import.meta.resolve(name);
-        }
-        catch {
-            // import.meta.resolve is missing under some module runners (vitest's
-            // included); fall through to the require-based resolve there.
-            try {
-                return pathToFileURL(_require.resolve(name)).href;
-            }
-            catch {
-                // Try the legacy fallback only when the preferred package is not installed.
-            }
-        }
-    }
-    return null;
-}
-async function loadTransformersModule() {
-    // Import one backend only. Loading both native ONNX runtimes in one process
-    // can abort during finalization; Hugging Face is the maintained default.
-    const url = resolveTransformersPackage();
-    if (!url)
-        return null;
-    try {
-        const mod = await import(/* @vite-ignore */ url);
-        const tok = mod.AutoTokenizer ?? mod.default?.AutoTokenizer;
-        const seq = mod.AutoModelForSequenceClassification ?? mod.default?.AutoModelForSequenceClassification;
-        return tok && seq ? { AutoTokenizer: tok, AutoModelForSequenceClassification: seq } : null;
-    }
-    catch {
-        return null;
-    }
-}
-let pipelineLoading = null;
-let warnedOnFallback = false;
-/**
- * True if a Transformers.js backend is importable. Note: this does NOT confirm
- * that the model is downloadable from Hugging Face CDN — in sandboxed
- * environments the package may import but the model fetch may be blocked.
- * The reranker silently falls back to identity ordering in that case.
- */
-export async function isCrossEncoderAvailable() {
-    return (await loadTransformersModule()) !== null;
-}
-// NOT the text-classification pipeline: this model is a num_labels=1
-// regression head, and that pipeline softmaxes a length-1 logit vector, which
-// is identically 1.0 for every input. Read the logit, then squash it.
-async function buildPipeline() {
-    try {
-        const mod = await loadTransformersModule();
-        if (!mod)
-            return null;
-        const [tokenizer, model] = await Promise.all([
-            mod.AutoTokenizer.from_pretrained(MODEL_NAME),
-            mod.AutoModelForSequenceClassification.from_pretrained(MODEL_NAME),
-        ]);
-        return async (query, candidate) => {
-            const inputs = await tokenizer(query, {
-                text_pair: candidate,
-                padding: true,
-                truncation: true,
-            });
-            const { logits } = await model(inputs);
-            const score = 1 / (1 + Math.exp(-Number(logits.data[0])));
-            // NaN would make the sort comparator a no-op; throwing hands this
-            // candidate to the per-candidate fallback instead.
-            if (!Number.isFinite(score))
-                throw new Error('cross-encoder returned a non-finite score');
-            return score;
-        };
-    }
-    catch {
-        return null;
-    }
-}
-// One shared in-flight load: two first calls must not fetch the model twice.
-// A failed load clears the slot so a later call can try again.
-function loadPipeline() {
-    pipelineLoading ??= buildPipeline().then((pipe) => {
-        if (!pipe)
-            pipelineLoading = null;
-        return pipe;
-    });
-    return pipelineLoading;
-}
-/** Track 2 reranker: MS-MARCO MiniLM cross-encoder, identity fallback if the model will not load. */
-export const crossEncoderReranker = async (query, results, options) => {
-    const topK = options?.topK ?? 50;
-    const head = results.slice(0, topK);
-    const pipe = await loadPipeline();
-    if (!pipe) {
-        // Warn once per process: a silent identity fallback otherwise reads as a
-        // working reranker.
-        if (!warnedOnFallback) {
-            warnedOnFallback = true;
-            // eslint-disable-next-line no-console
-            console.warn('[hippo] cross-encoder reranker unavailable (no Transformers.js backend, or model fetch blocked); falling back to identity ordering. Subsequent calls will not repeat this warning.');
-        }
-        return head.map((r, i) => ({
-            ...r,
-            rerankScore: r.score,
-            preRerankRank: r.preRerankRank ?? i + 1,
-            postRerankRank: i + 1,
-        }));
-    }
-    const scored = await Promise.all(head.map(async (r, i) => {
-        let ceScore;
-        try {
-            ceScore = await pipe(query, r.entry.content);
-        }
-        catch {
-            // One bad inference must not sink the whole pass.
-            ceScore = r.score;
-        }
-        return {
-            ...r,
-            rerankScore: ceScore,
-            preRerankRank: r.preRerankRank ?? i + 1,
-            postRerankRank: 0,
-        };
-    }));
-    // Plain stable sort on purpose: tied scores MUST fall back to the prior
-    // relevance order, never an arbitrary content order.
-    scored.sort((a, b) => b.rerankScore - a.rerankScore);
-    scored.forEach((r, i) => (r.postRerankRank = i + 1));
-    return scored;
-};
-//# sourceMappingURL=cross-encoder.js.map

package/dist/src/rerankers/cross-encoder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cross-encoder.js","sourceRoot":"","sources":["../../../src/rerankers/cross-encoder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAGzC,MAAM,UAAU,GAAG,+BAA+B,CAAC;AAwBnD,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAEhD,MAAM,qBAAqB,GAAG,CAAC,2BAA2B,EAAE,sBAAsB,CAAU,CAAC;AAE7F,yEAAyE;AACzE,2EAA2E;AAC3E,2DAA2D;AAC3D,SAAS,0BAA0B;IACjC,KAAK,MAAM,IAAI,IAAI,qBAAqB,EAAE,CAAC;QACzC,IAAI,CAAC;YACH,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;QAAC,MAAM,CAAC;YACP,qEAAqE;YACrE,8DAA8D;YAC9D,IAAI,CAAC;gBACH,OAAO,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YACpD,CAAC;YAAC,MAAM,CAAC;gBACP,4EAA4E;YAC9E,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,KAAK,UAAU,sBAAsB;IACnC,4EAA4E;IAC5E,yEAAyE;IACzE,MAAM,GAAG,GAAG,0BAA0B,EAAE,CAAC;IACzC,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,IAAI,CAAC;QACH,MAAM,GAAG,GAAgC,MAAM,MAAM,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAC9E,MAAM,GAAG,GAAG,GAAG,CAAC,aAAa,IAAI,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC;QAC5D,MAAM,GAAG,GACP,GAAG,CAAC,kCAAkC,IAAI,GAAG,CAAC,OAAO,EAAE,kCAAkC,CAAC;QAC5F,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,kCAAkC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7F,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAGD,IAAI,eAAe,GAA0C,IAAI,CAAC;AAClE,IAAI,gBAAgB,GAAG,KAAK,CAAC;AAE7B;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB;IAC3C,OAAO,CAAC,MAAM,sBAAsB,EAAE,CAAC,KAAK,IAAI,CAAC;AACnD,CAAC;AAED,qEAAqE;AACrE,8EAA8E;AAC9E,sEAAsE;AACtE,KAAK,UAAU,aAAa;IAC1B,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,sBAAsB,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC3C,GAAG,CAAC,aAAa,CAAC,eAAe,CAAC,UAAU,CAAC;YAC7C,GAAG,CAAC,kCAAkC,CAAC,eAAe,CAAC,UAAU,CAAC;SACnE,CAAC,CAAC;QACH,OAAO,KAAK,EAAE,KAAa,EAAE,SAAiB,EAAE,EAAE;YAChD,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,KAAK,EAAE;gBACpC,SAAS,EAAE,SAAS;gBACpB,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;YACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,kEAAkE;YAClE,mDAAmD;YACnD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;YAC1F,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,6EAA6E;AAC7E,+DAA+D;AAC/D,SAAS,YAAY;IACnB,eAAe,KAAK,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;QAChD,IAAI,CAAC,IAAI;YAAE,eAAe,GAAG,IAAI,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IACH,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,qGAAqG;AACrG,MAAM,CAAC,MAAM,oBAAoB,GAAe,KAAK,EACnD,KAAK,EACL,OAAO,EACP,OAAyB,EACA,EAAE;IAC3B,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAEpC,MAAM,IAAI,GAAG,MAAM,YAAY,EAAE,CAAC;IAClC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,yEAAyE;QACzE,oBAAoB;QACpB,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,gBAAgB,GAAG,IAAI,CAAC;YACxB,sCAAsC;YACtC,OAAO,CAAC,IAAI,CACV,oLAAoL,CACrL,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC;YACJ,WAAW,EAAE,CAAC,CAAC,KAAK;YACpB,aAAa,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC;YACvC,cAAc,EAAE,CAAC,GAAG,CAAC;SACtB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAC9B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,kDAAkD;YAClD,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC;QACpB,CAAC;QACD,OAAO;YACL,GAAG,CAAC;YACJ,WAAW,EAAE,OAAO;YACpB,aAAa,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC;YACvC,cAAc,EAAE,CAAC;SAClB,CAAC;IACJ,CAAC,CAAC,CACH,CAAC;IAEF,wEAAwE;IACxE,qDAAqD;IACrD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/dist/src/rerankers/index.js

@@ -1,20 +0,0 @@
-import { crossEncoderReranker } from './cross-encoder.js';
-import { jevReranker } from './jev.js';
-import { llmReranker } from './llm.js';
-const REGISTRY = {
-    'cross-encoder': crossEncoderReranker,
-    jev: jevReranker,
-    llm: llmReranker,
-};
-function isRegisteredRerankerName(name) {
-    return Object.hasOwn(REGISTRY, name);
-}
-export function getReranker(name) {
-    if (!name)
-        return null;
-    if (!isRegisteredRerankerName(name)) {
-        throw new Error(`Unknown reranker: ${name}. Available: ${Object.keys(REGISTRY).join(', ')}`);
-    }
-    return REGISTRY[name];
-}
-//# sourceMappingURL=index.js.map

package/dist/src/rerankers/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/rerankers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAGvC,MAAM,QAAQ,GAAG;IACf,eAAe,EAAE,oBAAoB;IACrC,GAAG,EAAE,WAAW;IAChB,GAAG,EAAE,WAAW;CACoB,CAAC;AAIvC,SAAS,wBAAwB,CAAC,IAAY;IAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,IAA+B;IACzD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CACb,qBAAqB,IAAI,gBAAgB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC5E,CAAC;IACJ,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC"}

package/dist/src/rerankers/jev.js

@@ -1,119 +0,0 @@
-import { crossEncoderReranker } from './cross-encoder.js';
-const ENDPOINT = 'https://api.typesafe.ai/v1/systemone';
-const DEFAULT_TIMEOUT_MS = 5_000;
-const TRUNCATE_CHARS = 1200;
-// Pinned, not `jev-latest`: every number in docs/evals/2026-09-19-jev-reranker.md was
-// measured on this version, and the alias moves whenever the vendor ships a release.
-const DEFAULT_MODEL = 'jev-1.13.0';
-// The pool size every number in docs/evals/2026-09-19-jev-reranker.md was measured at.
-export const JEV_DEFAULT_TOP_K = 40;
-function truncate(s, n) {
-    return s.length <= n ? s : `${s.slice(0, n)}...`;
-}
-// Number.isFinite rejects a string or null without coercing it, which the
-// declared type cannot promise about a third-party payload.
-function isProbability(v) {
-    return v !== undefined && Number.isFinite(v) && v >= 0 && v <= 1;
-}
-// A half-scored list ranks worse than the order it would replace, so one bad
-// answer voids the whole response.
-function parseScores(answers, n) {
-    const out = [];
-    for (let i = 1; i <= n; i++) {
-        const v = answers?.[`c${i}`]?.noul;
-        if (!isProbability(v))
-            return null;
-        out.push(v);
-    }
-    return out;
-}
-/** One batched request for the whole candidate list. Rejects with the reason when there are no usable scores. */
-async function requestScores(query, head) {
-    const key = process.env.TYPESAFE_API_KEY;
-    if (!key)
-        throw new Error('TYPESAFE_API_KEY not set');
-    const lines = head.map((r, i) => `[${i + 1}] ${truncate(r.entry.content, TRUNCATE_CHARS)}`);
-    const state = `Query: ${query}\n\nNumbered candidate memories from an AI coding agent's project store:\n\n${lines.join('\n\n')}`;
-    const questions = {};
-    for (let i = 1; i <= head.length; i++) {
-        questions[`c${i}`] = {
-            type: 'noul',
-            instructions: `Probability that candidate ${i} (numbered in the state above) helps answer the query.`,
-        };
-    }
-    const parsed = Number.parseInt(process.env.HIPPO_JEV_TIMEOUT_MS ?? '', 10);
-    const timeoutMs = parsed > 0 ? parsed : DEFAULT_TIMEOUT_MS;
-    const controller = new AbortController();
-    const timer = setTimeout(() => controller.abort(), timeoutMs);
-    try {
-        const resp = await fetch(ENDPOINT, {
-            method: 'POST',
-            headers: { 'content-type': 'application/json', authorization: `Bearer ${key}` },
-            body: JSON.stringify({
-                state,
-                model: process.env.HIPPO_JEV_MODEL ?? DEFAULT_MODEL,
-                questions,
-            }),
-            signal: controller.signal,
-        });
-        if (!resp.ok) {
-            // A third-party header ends up on stderr, so keep printable ASCII only.
-            const requestId = resp.headers.get('x-request-id')?.replace(/[^\x20-\x7e]/g, '').slice(0, 64);
-            await resp.body?.cancel();
-            throw new Error(`HTTP ${resp.status}${requestId ? `, request ${requestId}` : ''}`);
-        }
-        const body = await resp.json();
-        const scores = parseScores(body.answers, head.length);
-        if (!scores)
-            throw new Error('incomplete or out-of-range answers');
-        return scores;
-    }
-    catch (err) {
-        if (err instanceof Error && err.name === 'AbortError') {
-            throw new Error(`no answer within ${timeoutMs} ms`);
-        }
-        throw err;
-    }
-    finally {
-        clearTimeout(timer);
-    }
-}
-/** Builds a Jev reranker around the reranker it degrades to. Exported so a test can pass a stand-in. */
-export function createJevReranker(localFallback) {
-    let warned = false;
-    return async (query, results, options) => {
-        const head = results.slice(0, options?.topK ?? JEV_DEFAULT_TOP_K);
-        if (head.length === 0)
-            return [];
-        let scores;
-        try {
-            scores = await requestScores(query, head);
-        }
-        catch (err) {
-            // A read path never throws, and never hands back the unranked order
-            // without saying so: warn once, then use the free local reranker.
-            if (!warned) {
-                warned = true;
-                const reason = err instanceof Error ? err.message : 'unknown error';
-                // eslint-disable-next-line no-console
-                console.warn(`[hippo] jev reranker unavailable (${reason}); falling back to the local cross-encoder. Subsequent calls will not repeat this warning.`);
-            }
-            return localFallback(query, head, options);
-        }
-        const scored = head.map((r, i) => ({
-            ...r,
-            rerankScore: scores[i],
-            preRerankRank: r.preRerankRank ?? i + 1,
-            postRerankRank: 0,
-        }));
-        // Stable sort: ties fall back to the prior relevance order.
-        scored.sort((a, b) => b.rerankScore - a.rerankScore);
-        scored.forEach((r, i) => (r.postRerankRank = i + 1));
-        return scored;
-    };
-}
-/** Track 4 reranker: hosted TypeSafe Jev, opt-in and paid (TYPESAFE_API_KEY), one batched call per recall.
- *  Any failure warns once and delegates to the local cross-encoder. Scores are not bit-stable run to run.
- *  Cost, env vars, evidence and limits: docs/evals/2026-09-19-jev-reranker.md. */
-export const jevReranker = createJevReranker(crossEncoderReranker);
-//# sourceMappingURL=jev.js.map

package/dist/src/rerankers/jev.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"jev.js","sourceRoot":"","sources":["../../../src/rerankers/jev.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAI1D,MAAM,QAAQ,GAAG,sCAAsC,CAAC;AACxD,MAAM,kBAAkB,GAAG,KAAK,CAAC;AACjC,MAAM,cAAc,GAAG,IAAI,CAAC;AAC5B,sFAAsF;AACtF,qFAAqF;AACrF,MAAM,aAAa,GAAG,YAAY,CAAC;AACnC,uFAAuF;AACvF,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAMpC,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IACpC,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC;AACnD,CAAC;AAED,0EAA0E;AAC1E,4DAA4D;AAC5D,SAAS,aAAa,CAAC,CAAqB;IAC1C,OAAO,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACnE,CAAC;AAED,6EAA6E;AAC7E,mCAAmC;AACnC,SAAS,WAAW,CAAC,OAA8C,EAAE,CAAS;IAC5E,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iHAAiH;AACjH,KAAK,UAAU,aAAa,CAAC,KAAa,EAAE,IAAoB;IAC9D,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC;IACzC,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAEtD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;IAC5F,MAAM,KAAK,GAAG,UAAU,KAAK,+EAA+E,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IACjI,MAAM,SAAS,GAA2D,EAAE,CAAC;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG;YACnB,IAAI,EAAE,MAAM;YACZ,YAAY,EAAE,8BAA8B,CAAC,wDAAwD;SACtG,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,oBAAoB,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAC3E,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,kBAAkB,CAAC;IAC3D,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;IACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;IAC9D,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,QAAQ,EAAE;YACjC,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE,aAAa,EAAE,UAAU,GAAG,EAAE,EAAE;YAC/E,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK;gBACL,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,aAAa;gBACnD,SAAS;aACV,CAAC;YACF,MAAM,EAAE,UAAU,CAAC,MAAM;SAC1B,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,wEAAwE;YACxE,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9F,MAAM,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,aAAa,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACrF,CAAC;QACD,MAAM,IAAI,GAA4C,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QACxE,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACnE,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,oBAAoB,SAAS,KAAK,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED,wGAAwG;AACxG,MAAM,UAAU,iBAAiB,CAAC,aAAyB;IACzD,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,OAAO,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAyB,EAA2B,EAAE;QAClF,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,IAAI,iBAAiB,CAAC,CAAC;QAClE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEjC,IAAI,MAAyB,CAAC;QAC9B,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,oEAAoE;YACpE,kEAAkE;YAClE,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM,MAAM,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC;gBACpE,sCAAsC;gBACtC,OAAO,CAAC,IAAI,CACV,qCAAqC,MAAM,4FAA4F,CACxI,CAAC;YACJ,CAAC;YACD,OAAO,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC7C,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,GAAG,CAAC;YACJ,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC;YACtB,aAAa,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC;YACvC,cAAc,EAAE,CAAC;SAClB,CAAC,CAAC,CAAC;QAEJ,4DAA4D;QAC5D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;AAED;;kFAEkF;AAClF,MAAM,CAAC,MAAM,WAAW,GAAe,iBAAiB,CAAC,oBAAoB,CAAC,CAAC"}

package/dist/src/rerankers/llm.js

@@ -1,80 +0,0 @@
-const DEFAULT_TIMEOUT_MS = 30_000;
-/**
- * Track 3 reranker: listwise LLM rerank. Uses a customer-supplied
- * OpenAI-compatible endpoint. Gated on HIPPO_LLM_RERANKER_URL to prevent
- * accidental cost.
- *
- * Skeleton only — see docs/plans/2026-05-10-f6-reranker-hardening.md Task 8.
- * Full characterisation deferred to a follow-on plan.
- *
- * Timeout: defaults to 30s; overridable via HIPPO_LLM_RERANKER_TIMEOUT_MS.
- * On timeout or any fetch failure, the reranker silently falls back to
- * identity ordering — recall must not hang on a wedged endpoint.
- */
-export const llmReranker = async (query, results, options) => {
-    const url = process.env.HIPPO_LLM_RERANKER_URL;
-    const key = process.env.HIPPO_LLM_RERANKER_KEY;
-    if (!url) {
-        throw new Error('HIPPO_LLM_RERANKER_URL not set; refusing to run LLM reranker.');
-    }
-    const topK = options?.topK ?? 20;
-    const head = results.slice(0, topK);
-    const prompt = [
-        `Rerank the candidates below by relevance to the query. Output a JSON array of indices (zero-indexed) in best-first order.`,
-        `Query: ${query}`,
-        ...head.map((r, i) => `[${i}] ${r.entry.content}`),
-        `Output format: [<int>, <int>, ...] with all ${head.length} indices.`,
-    ].join('\n');
-    const timeoutMs = Number.parseInt(process.env.HIPPO_LLM_RERANKER_TIMEOUT_MS ?? '', 10) || DEFAULT_TIMEOUT_MS;
-    const controller = new AbortController();
-    const timer = setTimeout(() => controller.abort(), timeoutMs);
-    const headers = {
-        'content-type': 'application/json',
-    };
-    if (key) {
-        headers.authorization = `Bearer ${key}`;
-    }
-    let permutation = null;
-    try {
-        const resp = await fetch(`${url.replace(/\/$/, '')}/chat/completions`, {
-            method: 'POST',
-            headers: { ...headers },
-            body: JSON.stringify({
-                model: process.env.HIPPO_LLM_RERANKER_MODEL ?? 'gpt-4o-mini',
-                messages: [{ role: 'user', content: prompt }],
-                temperature: 0,
-            }),
-            signal: controller.signal,
-        });
-        if (resp.ok) {
-            const j = await resp.json();
-            const txt = j.choices?.[0]?.message?.content ?? '';
-            const m = txt.match(/\[\s*(\d+(?:\s*,\s*\d+)*)\s*\]/);
-            if (m) {
-                const parsed = m[1].split(',').map((s) => parseInt(s.trim(), 10));
-                if (parsed.length === head.length &&
-                    parsed.every((n) => Number.isInteger(n) && n >= 0 && n < head.length) &&
-                    new Set(parsed).size === head.length) {
-                    permutation = parsed;
-                }
-            }
-        }
-    }
-    catch {
-        // Fall through to identity. Includes AbortError on timeout — see
-        // DEFAULT_TIMEOUT_MS / HIPPO_LLM_RERANKER_TIMEOUT_MS above.
-    }
-    finally {
-        clearTimeout(timer);
-    }
-    const ordered = permutation
-        ? permutation.map((idx) => head[idx])
-        : head;
-    return ordered.map((r, i) => ({
-        ...r,
-        rerankScore: ordered.length - i,
-        preRerankRank: r.preRerankRank ?? i + 1,
-        postRerankRank: i + 1,
-    }));
-};
-//# sourceMappingURL=llm.js.map

package/dist/src/rerankers/llm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"llm.js","sourceRoot":"","sources":["../../../src/rerankers/llm.ts"],"names":[],"mappings":"AAEA,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAOlC;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,WAAW,GAAe,KAAK,EAC1C,KAAK,EACL,OAAO,EACP,OAAyB,EACA,EAAE;IAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC;IAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC;IAC/C,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;IACnF,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAEpC,MAAM,MAAM,GAAG;QACb,2HAA2H;QAC3H,UAAU,KAAK,EAAE;QACjB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QAClD,+CAA+C,IAAI,CAAC,MAAM,WAAW;KACtE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAC/B,OAAO,CAAC,GAAG,CAAC,6BAA6B,IAAI,EAAE,EAC/C,EAAE,CACH,IAAI,kBAAkB,CAAC;IACxB,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;IACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;IAE9D,MAAM,OAAO,GAAiB;QAC5B,cAAc,EAAE,kBAAkB;KACnC,CAAC;IACF,IAAI,GAAG,EAAE,CAAC;QACR,OAAO,CAAC,aAAa,GAAG,UAAU,GAAG,EAAE,CAAC;IAC1C,CAAC;IAED,IAAI,WAAW,GAAoB,IAAI,CAAC;IACxC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,mBAAmB,EAAE;YACrE,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE;YACvB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,wBAAwB,IAAI,aAAa;gBAC5D,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;gBAC7C,WAAW,EAAE,CAAC;aACf,CAAC;YACF,MAAM,EAAE,UAAU,CAAC,MAAM;SAC1B,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACZ,MAAM,CAAC,GAA4D,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;YACrF,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,CAAC;YACnD,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,gCAAgC,CAAC,CAAC;YACtD,IAAI,CAAC,EAAE,CAAC;gBACN,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBAClE,IACE,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;oBAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;oBACrE,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,EACpC,CAAC;oBACD,WAAW,GAAG,MAAM,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,iEAAiE;QACjE,4DAA4D;IAC9D,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,OAAO,GAAG,WAAW;QACzB,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,CAAC,CAAC,IAAI,CAAC;IAET,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,GAAG,CAAC;QACJ,WAAW,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;QAC/B,aAAa,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC;QACvC,cAAc,EAAE,CAAC,GAAG,CAAC;KACtB,CAAC,CAAC,CAAC;AACN,CAAC,CAAC"}

package/dist/src/rerankers/types.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=types.js.map

package/dist/src/rerankers/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/rerankers/types.ts"],"names":[],"mappings":""}

package/dist/src/rrf.js

@@ -1,61 +0,0 @@
-/**
- * Reciprocal Rank Fusion (Cormack, Clarke, and Buettcher 2009).
- *
- * Fuses N ranked candidate lists into a single ordering by summing
- * weighted 1/(k + rank) contributions per candidate. The constant K is
- * the canonical 60 from the original paper and the value already in use
- * across hippo's `hybridSearch` since v1.0. Do NOT tune K without an
- * explicit cross-corpus eval — it is calibrated against IR benchmarks
- * and works robustly across BM25/dense/cross-encoder rank-list shapes.
- *
- * Generic over the candidate id type so this helper can be shared by
- * `src/search.ts::hybridSearch` (T = number, idx into MemoryEntry[]) and
- * the LongMemEval F9 hybrid retrieve benchmark (T = string, session_id).
- *
- * Behaviour MUST stay byte-identical to the inline implementation that
- * lived in `src/search.ts:354-374` before extraction (commit ab6c5eb).
- * The `tests/rrf.test.ts` suite is the contract.
- */
-export const RRF_K = 60;
-/**
- * Fuse N ranked lists into a single Map of candidate id -> RRF score.
- *
- * @param rankedLists  Each inner array is candidates in descending-score order.
- *                     Element at index 0 is rank 1; index 1 is rank 2; etc.
- * @param weights      Per-list weights. weights.length === rankedLists.length.
- *                     Weights are summed without normalisation — pass {0.5, 0.5}
- *                     for symmetric fusion or {0.2, 0.8} for asymmetric.
- * @param options      Optional k override + absentRank override.
- * @returns            Map from candidate id to fused RRF score. Sort descending
- *                     by value to get the fused ordering.
- */
-export function rrfFuse(rankedLists, weights, options) {
-    if (rankedLists.length !== weights.length) {
-        throw new Error(`rrfFuse: rankedLists.length (${rankedLists.length}) must match weights.length (${weights.length})`);
-    }
-    const k = options?.k ?? RRF_K;
-    const defaultAbsentRank = rankedLists.reduce((m, l) => Math.max(m, l.length), 0) + 1;
-    const absentRank = options?.absentRank ?? defaultAbsentRank;
-    const rankMaps = rankedLists.map((list) => {
-        const m = new Map();
-        for (let i = 0; i < list.length; i++) {
-            m.set(list[i], i + 1); // 1-indexed rank
-        }
-        return m;
-    });
-    const allCandidates = new Set();
-    for (const list of rankedLists)
-        for (const c of list)
-            allCandidates.add(c);
-    const scores = new Map();
-    for (const c of allCandidates) {
-        let score = 0;
-        for (let i = 0; i < rankMaps.length; i++) {
-            const rank = rankMaps[i].get(c) ?? absentRank;
-            score += weights[i] / (k + rank);
-        }
-        scores.set(c, score);
-    }
-    return scores;
-}
-//# sourceMappingURL=rrf.js.map

package/dist/src/rrf.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rrf.js","sourceRoot":"","sources":["../../src/rrf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;AAaxB;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,OAAO,CACrB,WAA4C,EAC5C,OAA8B,EAC9B,OAAwB;IAExB,IAAI,WAAW,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CACb,gCAAgC,WAAW,CAAC,MAAM,gCAAgC,OAAO,CAAC,MAAM,GAAG,CACpG,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,KAAK,CAAC;IAC9B,MAAM,iBAAiB,GACrB,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,iBAAiB,CAAC;IAE5D,MAAM,QAAQ,GAA0B,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAI,GAAG,EAAa,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB;QAC1C,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,IAAI,GAAG,EAAK,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,WAAW;QAAE,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;YAC9C,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}