cognitive-core 0.2.4 → 0.3.1

package/dist/eval/retrieval/knowledge-quality.d.ts

@@ -0,0 +1,91 @@
+import type { KnowledgeNote } from '../../types/knowledge.js';
+import type { SearchProvider } from '../../memory/search-provider.js';
+import type { LabeledKnowledgeQuery, Stratum } from './knowledge-corpus.js';
+export interface StratumMetrics {
+    stratum: Stratum;
+    queries: number;
+    /** Fraction of queries with ≥1 relevant note in top-k. */
+    recallAtK: number;
+    /** 95% bootstrap CI on recall@k (seeded). */
+    recallCI: [number, number];
+    /** Mean reciprocal rank of the first relevant note. */
+    mrr: number;
+    /** Mean nDCG@k (binary relevance). */
+    ndcgAtK: number;
+    /** Threshold-free ranking quality: P(score(relevant) > score(irrelevant)). */
+    auc: number;
+}
+export interface ProviderReport {
+    provider: string;
+    k: number;
+    byStratum: Record<Stratum, StratumMetrics>;
+    /** Among planted-decoy queries: fraction where the true note outranks the decoy. */
+    distractorBeatRate: number;
+    distractorN: number;
+    /** Per-query reciprocal rank, by stratum (for paired comparison). */
+    perQueryRR: Record<Stratum, number[]>;
+    /** Per-query recall@k hit flags, by stratum (for paired bootstrap). */
+    perQueryHit: Record<Stratum, boolean[]>;
+}
+/** Score one provider over the corpus. */
+export declare function scoreProvider(provider: SearchProvider, notes: KnowledgeNote[], queries: LabeledKnowledgeQuery[], opts?: {
+    k?: number;
+    seed?: number;
+}): Promise<ProviderReport>;
+/** Promotion gate — written down before the run, not chosen after seeing it. */
+export interface ABGate {
+    /** Minimum paraphrase recall gain (treatment − baseline). */
+    minParaphraseGain: number;
+    /** Maximum allowed lexical-stratum recall loss (treatment − baseline ≥ −this). */
+    maxLexicalLoss: number;
+    /** Minimum distractor-beat-rate delta (treatment − baseline). */
+    minDistractorDelta: number;
+}
+export declare const DEFAULT_GATE: ABGate;
+export interface PairedResult {
+    wins: number;
+    ties: number;
+    losses: number;
+    n: number;
+    meanRRDelta: number;
+    rrDeltaCI: [number, number];
+    /** CI excludes 0 ⇒ the paired difference is significant. */
+    significant: boolean;
+}
+export interface ABSignal {
+    baseline: string;
+    treatment: string;
+    control?: string;
+    k: number;
+    /** THE signal: recall@k(treatment | paraphrase) − recall@k(baseline | paraphrase). */
+    paraphraseRecallGain: number;
+    /** Control gain (should be ≈0 if the win is genuinely semantic). */
+    controlParaphraseGain?: number;
+    /** Do-no-harm: recall@k(treatment | lexical) − recall@k(baseline | lexical). */
+    lexicalRecallDelta: number;
+    /** Over-firing guard: distractorBeatRate(treatment) − distractorBeatRate(baseline). */
+    distractorBeatDelta: number;
+    /** Recall CIs disjoint on the paraphrase stratum (secondary significance proxy). */
+    paraphraseRecallCIDisjoint: boolean;
+    /** Paired per-query RR comparison on the paraphrase stratum. */
+    paired: PairedResult;
+    verdict: {
+        promote: boolean;
+        reasons: string[];
+    };
+}
+/**
+ * Compute the A/B signal from scored reports. `control` (e.g. Hash embeddings)
+ * is the negative control: if it reproduces the paraphrase gain, the gain is an
+ * artifact, not semantics, and the verdict refuses to promote.
+ */
+export declare function computeABSignal(baseline: ProviderReport, treatment: ProviderReport, opts?: {
+    control?: ProviderReport;
+    gate?: ABGate;
+    seed?: number;
+}): ABSignal;
+/** One block per provider: the provider × stratum matrix. */
+export declare function formatProviderReport(r: ProviderReport): string;
+/** Verdict summary for the A/B signal. */
+export declare function formatABSignal(s: ABSignal): string;
+//# sourceMappingURL=knowledge-quality.d.ts.map

package/dist/eval/retrieval/knowledge-quality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-quality.d.ts","sourceRoot":"","sources":["../../../src/eval/retrieval/knowledge-quality.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAGtE,OAAO,KAAK,EAAE,qBAAqB,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAqB5E,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,0DAA0D;IAC1D,SAAS,EAAE,MAAM,CAAC;IAClB,6CAA6C;IAC7C,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,uDAAuD;IACvD,GAAG,EAAE,MAAM,CAAC;IACZ,sCAAsC;IACtC,OAAO,EAAE,MAAM,CAAC;IAChB,8EAA8E;IAC9E,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC3C,oFAAoF;IACpF,kBAAkB,EAAE,MAAM,CAAC;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;IACtC,uEAAuE;IACvE,WAAW,EAAE,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;CACzC;AAgED,0CAA0C;AAC1C,wBAAsB,aAAa,CACjC,QAAQ,EAAE,cAAc,EACxB,KAAK,EAAE,aAAa,EAAE,EACtB,OAAO,EAAE,qBAAqB,EAAE,EAChC,IAAI,GAAE;IAAE,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAO,GACvC,OAAO,CAAC,cAAc,CAAC,CA4DzB;AAED,gFAAgF;AAChF,MAAM,WAAW,MAAM;IACrB,6DAA6D;IAC7D,iBAAiB,EAAE,MAAM,CAAC;IAC1B,kFAAkF;IAClF,cAAc,EAAE,MAAM,CAAC;IACvB,iEAAiE;IACjE,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED,eAAO,MAAM,YAAY,EAAE,MAI1B,CAAC;AAEF,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5B,4DAA4D;IAC5D,WAAW,EAAE,OAAO,CAAC;CACtB;AAyCD,MAAM,WAAW,QAAQ;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,sFAAsF;IACtF,oBAAoB,EAAE,MAAM,CAAC;IAC7B,oEAAoE;IACpE,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,gFAAgF;IAChF,kBAAkB,EAAE,MAAM,CAAC;IAC3B,uFAAuF;IACvF,mBAAmB,EAAE,MAAM,CAAC;IAC5B,oFAAoF;IACpF,0BAA0B,EAAE,OAAO,CAAC;IACpC,gEAAgE;IAChE,MAAM,EAAE,YAAY,CAAC;IACrB,OAAO,EAAE;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;CAClD;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,cAAc,EACxB,SAAS,EAAE,cAAc,EACzB,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,cAAc,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAO,GACpE,QAAQ,CAmDV;AAID,6DAA6D;AAC7D,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,cAAc,GAAG,MAAM,CAU9D;AAED,0CAA0C;AAC1C,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAelD"}

package/dist/eval/retrieval/knowledge-quality.js

@@ -0,0 +1,247 @@
+import { seededRng } from '../rng.js';
+import { bootstrapCI, ciDisjoint } from '../metrics.js';
+/**
+ * A/B retrieval-quality harness for KnowledgeBank search providers.
+ *
+ * Scores any {@link SearchProvider} over the stratified knowledge corpus and
+ * computes the difference-in-differences signal that actually discriminates a
+ * semantic embedder from a lexical scorer:
+ *
+ *   paraphraseRecallGain = recall@k(treatment | paraphrase)
+ *                        − recall@k(baseline  | paraphrase)
+ *
+ * validated against (a) a Hash negative control — a lexical bag-of-words in
+ * vector space, which should NOT reproduce the gain, proving the win is
+ * semantics and not an artifact of the embed-text/scoring change; (b) a paired
+ * per-query bootstrap so the gain has error bars; and (c) do-no-harm guards on
+ * the lexical stratum and a planted-decoy precision guard.
+ */
+const STRATA = ['lexical', 'paraphrase'];
+async function rankAll(provider, query, notes) {
+    const results = await provider.search(query, notes, { maxResults: notes.length });
+    const rankById = new Map();
+    const scoreById = new Map();
+    results.forEach((r, i) => {
+        if (!rankById.has(r.noteId))
+            rankById.set(r.noteId, i);
+        scoreById.set(r.noteId, r.score);
+    });
+    return { rankById, scoreById };
+}
+function minRank(ranking, ids) {
+    let best = Infinity;
+    for (const id of ids) {
+        const r = ranking.rankById.get(id);
+        if (r !== undefined && r < best)
+            best = r;
+    }
+    return best;
+}
+function ndcgAtK(ranking, relevant, k) {
+    // Rank → id, restricted to top-k.
+    const idByRank = [];
+    for (const [id, r] of ranking.rankById)
+        if (r < k)
+            idByRank[r] = id;
+    let dcg = 0;
+    for (let r = 0; r < k; r++) {
+        const id = idByRank[r];
+        if (id && relevant.has(id))
+            dcg += 1 / Math.log2(r + 2);
+    }
+    const ideal = Math.min(relevant.size, k);
+    let idcg = 0;
+    for (let i = 0; i < ideal; i++)
+        idcg += 1 / Math.log2(i + 2);
+    return idcg > 0 ? dcg / idcg : 0;
+}
+function aucForQuery(ranking, relevant, notes) {
+    const relScores = [];
+    const irrScores = [];
+    for (const note of notes) {
+        const s = ranking.scoreById.get(note.frontmatter.id) ?? 0;
+        if (relevant.has(note.frontmatter.id))
+            relScores.push(s);
+        else
+            irrScores.push(s);
+    }
+    if (relScores.length === 0 || irrScores.length === 0)
+        return null;
+    let wins = 0;
+    for (const r of relScores)
+        for (const i of irrScores)
+            wins += r > i ? 1 : r === i ? 0.5 : 0;
+    return wins / (relScores.length * irrScores.length);
+}
+/** Score one provider over the corpus. */
+export async function scoreProvider(provider, notes, queries, opts = {}) {
+    const k = opts.k ?? 5;
+    const perQueryRR = { lexical: [], paraphrase: [] };
+    const perQueryHit = { lexical: [], paraphrase: [] };
+    const mrrSum = { lexical: 0, paraphrase: 0 };
+    const ndcgSum = { lexical: 0, paraphrase: 0 };
+    const aucSum = { lexical: 0, paraphrase: 0 };
+    const aucN = { lexical: 0, paraphrase: 0 };
+    let distractorBeat = 0;
+    let distractorN = 0;
+    for (const q of queries) {
+        const ranking = await rankAll(provider, q.query, notes);
+        const relevant = new Set(q.relevantIds);
+        const best = minRank(ranking, q.relevantIds);
+        const hit = best < k;
+        const rr = best === Infinity ? 0 : 1 / (best + 1);
+        perQueryHit[q.stratum].push(hit);
+        perQueryRR[q.stratum].push(rr);
+        mrrSum[q.stratum] += rr;
+        ndcgSum[q.stratum] += ndcgAtK(ranking, relevant, k);
+        const auc = aucForQuery(ranking, relevant, notes);
+        if (auc !== null) {
+            aucSum[q.stratum] += auc;
+            aucN[q.stratum] += 1;
+        }
+        if (q.decoyIds && q.decoyIds.length > 0) {
+            distractorN++;
+            const decoyRank = minRank(ranking, q.decoyIds);
+            if (best < decoyRank)
+                distractorBeat++;
+        }
+    }
+    const byStratum = {};
+    for (const s of STRATA) {
+        const n = perQueryHit[s].length || 1;
+        byStratum[s] = {
+            stratum: s,
+            queries: perQueryHit[s].length,
+            recallAtK: perQueryHit[s].filter(Boolean).length / n,
+            recallCI: bootstrapCI(perQueryHit[s], { seed: opts.seed ?? 0 }),
+            mrr: mrrSum[s] / n,
+            ndcgAtK: ndcgSum[s] / n,
+            auc: aucN[s] ? aucSum[s] / aucN[s] : 0,
+        };
+    }
+    return {
+        provider: provider.name,
+        k,
+        byStratum,
+        distractorBeatRate: distractorN ? distractorBeat / distractorN : 0,
+        distractorN,
+        perQueryRR,
+        perQueryHit,
+    };
+}
+export const DEFAULT_GATE = {
+    minParaphraseGain: 0.15,
+    maxLexicalLoss: 0.02,
+    minDistractorDelta: 0,
+};
+/** Paired bootstrap on per-query RR deltas (resample query indices, seeded). */
+function pairedRRDelta(baseRR, treatRR, seed) {
+    const n = Math.min(baseRR.length, treatRR.length);
+    const deltas = [];
+    let wins = 0;
+    let ties = 0;
+    let losses = 0;
+    const eps = 1e-9;
+    for (let i = 0; i < n; i++) {
+        const d = treatRR[i] - baseRR[i];
+        deltas.push(d);
+        if (d > eps)
+            wins++;
+        else if (d < -eps)
+            losses++;
+        else
+            ties++;
+    }
+    const mean = deltas.reduce((a, b) => a + b, 0) / (n || 1);
+    const iterations = 2000;
+    const rng = seededRng('kb-paired-bootstrap', seed, n);
+    const means = [];
+    for (let it = 0; it < iterations; it++) {
+        let sum = 0;
+        for (let i = 0; i < n; i++)
+            sum += deltas[Math.floor(rng() * n)];
+        means.push(sum / (n || 1));
+    }
+    means.sort((a, b) => a - b);
+    const lo = means[Math.floor(0.025 * iterations)];
+    const hi = means[Math.min(iterations - 1, Math.floor(0.975 * iterations))];
+    return {
+        wins,
+        ties,
+        losses,
+        n,
+        meanRRDelta: mean,
+        rrDeltaCI: [lo, hi],
+        significant: lo > 0 || hi < 0,
+    };
+}
+/**
+ * Compute the A/B signal from scored reports. `control` (e.g. Hash embeddings)
+ * is the negative control: if it reproduces the paraphrase gain, the gain is an
+ * artifact, not semantics, and the verdict refuses to promote.
+ */
+export function computeABSignal(baseline, treatment, opts = {}) {
+    const gate = opts.gate ?? DEFAULT_GATE;
+    const seed = opts.seed ?? 0;
+    const paraphraseRecallGain = treatment.byStratum.paraphrase.recallAtK - baseline.byStratum.paraphrase.recallAtK;
+    const controlParaphraseGain = opts.control
+        ? opts.control.byStratum.paraphrase.recallAtK - baseline.byStratum.paraphrase.recallAtK
+        : undefined;
+    const lexicalRecallDelta = treatment.byStratum.lexical.recallAtK - baseline.byStratum.lexical.recallAtK;
+    const distractorBeatDelta = treatment.distractorBeatRate - baseline.distractorBeatRate;
+    const paired = pairedRRDelta(baseline.perQueryRR.paraphrase, treatment.perQueryRR.paraphrase, seed);
+    const paraphraseRecallCIDisjoint = ciDisjoint(baseline.byStratum.paraphrase.recallCI, treatment.byStratum.paraphrase.recallCI);
+    const reasons = [];
+    if (paraphraseRecallGain < gate.minParaphraseGain)
+        reasons.push(`paraphrase gain ${paraphraseRecallGain.toFixed(2)} < ${gate.minParaphraseGain}`);
+    if (lexicalRecallDelta < -gate.maxLexicalLoss)
+        reasons.push(`lexical regression ${lexicalRecallDelta.toFixed(2)} < -${gate.maxLexicalLoss}`);
+    if (distractorBeatDelta < gate.minDistractorDelta)
+        reasons.push(`distractor beat delta ${distractorBeatDelta.toFixed(2)} < ${gate.minDistractorDelta}`);
+    if (!paired.significant)
+        reasons.push('paired RR delta CI includes 0');
+    if (controlParaphraseGain !== undefined && controlParaphraseGain >= gate.minParaphraseGain)
+        reasons.push(`control reproduced the gain (${controlParaphraseGain.toFixed(2)}) — artifact, not semantics`);
+    return {
+        baseline: baseline.provider,
+        treatment: treatment.provider,
+        control: opts.control?.provider,
+        k: treatment.k,
+        paraphraseRecallGain,
+        controlParaphraseGain,
+        lexicalRecallDelta,
+        distractorBeatDelta,
+        paraphraseRecallCIDisjoint,
+        paired,
+        verdict: { promote: reasons.length === 0, reasons },
+    };
+}
+const pct = (x) => `${(x * 100).toFixed(0)}%`;
+/** One block per provider: the provider × stratum matrix. */
+export function formatProviderReport(r) {
+    const row = (m) => `  ${m.stratum.padEnd(11)} recall@${r.k} ${pct(m.recallAtK).padStart(4)} | ` +
+        `MRR ${m.mrr.toFixed(2)} | nDCG ${m.ndcgAtK.toFixed(2)} | AUC ${m.auc.toFixed(2)}`;
+    return [
+        `${r.provider} (k=${r.k})`,
+        row(r.byStratum.lexical),
+        row(r.byStratum.paraphrase),
+        `  distractor   beat-rate ${pct(r.distractorBeatRate)} (n=${r.distractorN})`,
+    ].join('\n');
+}
+/** Verdict summary for the A/B signal. */
+export function formatABSignal(s) {
+    const ctrl = s.controlParaphraseGain !== undefined
+        ? ` | control gain ${s.controlParaphraseGain >= 0 ? '+' : ''}${s.controlParaphraseGain.toFixed(2)}`
+        : '';
+    return [
+        `${s.treatment} vs ${s.baseline}${s.control ? ` (control ${s.control})` : ''}`,
+        `  paraphrase recall gain  ${s.paraphraseRecallGain >= 0 ? '+' : ''}${s.paraphraseRecallGain.toFixed(2)}${ctrl}`,
+        `  lexical recall delta    ${s.lexicalRecallDelta >= 0 ? '+' : ''}${s.lexicalRecallDelta.toFixed(2)} (do-no-harm)`,
+        `  distractor beat delta   ${s.distractorBeatDelta >= 0 ? '+' : ''}${s.distractorBeatDelta.toFixed(2)}`,
+        `  paired RR (paraphrase)  ${s.paired.wins}W/${s.paired.ties}T/${s.paired.losses}L of ${s.paired.n}` +
+            ` | meanΔ ${s.paired.meanRRDelta.toFixed(3)} CI[${s.paired.rrDeltaCI[0].toFixed(3)}, ${s.paired.rrDeltaCI[1].toFixed(3)}]` +
+            ` ${s.paired.significant ? '✓sig' : '✗ns'}`,
+        `  VERDICT: ${s.verdict.promote ? 'PROMOTE ✅' : 'HOLD ❌'}${s.verdict.reasons.length ? ` — ${s.verdict.reasons.join('; ')}` : ''}`,
+    ].join('\n');
+}
+//# sourceMappingURL=knowledge-quality.js.map

package/dist/eval/retrieval/knowledge-quality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-quality.js","sourceRoot":"","sources":["../../../src/eval/retrieval/knowledge-quality.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAGxD;;;;;;;;;;;;;;;GAeG;AAEH,MAAM,MAAM,GAAc,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;AAmCpD,KAAK,UAAU,OAAO,CACpB,QAAwB,EACxB,KAAa,EACb,KAAsB;IAEtB,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjC,CAAC;AAED,SAAS,OAAO,CAAC,OAAgB,EAAE,GAAa;IAC9C,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CAAC,OAAgB,EAAE,QAAqB,EAAE,CAAS;IACjE,kCAAkC;IAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,QAAQ;QAAE,IAAI,CAAC,GAAG,CAAC;YAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACpE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,EAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7D,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAClB,OAAgB,EAChB,QAAqB,EACrB,KAAsB;IAEtB,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1D,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YACpD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAClE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,KAAK,MAAM,CAAC,IAAI,SAAS;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,OAAO,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AACtD,CAAC;AAED,0CAA0C;AAC1C,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,QAAwB,EACxB,KAAsB,EACtB,OAAgC,EAChC,OAAsC,EAAE;IAExC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IAEtB,MAAM,UAAU,GAA8B,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAC9E,MAAM,WAAW,GAA+B,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAChF,MAAM,MAAM,GAA4B,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACtE,MAAM,OAAO,GAA4B,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACvE,MAAM,MAAM,GAA4B,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACtE,MAAM,IAAI,GAA4B,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IAEpE,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;QAE7C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAClD,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAClD,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;YACzB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QAED,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,WAAW,EAAE,CAAC;YACd,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC/C,IAAI,IAAI,GAAG,SAAS;gBAAE,cAAc,EAAE,CAAC;QACzC,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,EAAqC,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;QACrC,SAAS,CAAC,CAAC,CAAC,GAAG;YACb,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM;YAC9B,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC;YACpD,QAAQ,EAAE,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YAC/D,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAClB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;YACvB,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACvC,CAAC;IACJ,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,IAAI;QACvB,CAAC;QACD,SAAS;QACT,kBAAkB,EAAE,WAAW,CAAC,CAAC,CAAC,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClE,WAAW;QACX,UAAU;QACV,WAAW;KACZ,CAAC;AACJ,CAAC;AAYD,MAAM,CAAC,MAAM,YAAY,GAAW;IAClC,iBAAiB,EAAE,IAAI;IACvB,cAAc,EAAE,IAAI;IACpB,kBAAkB,EAAE,CAAC;CACtB,CAAC;AAaF,gFAAgF;AAChF,SAAS,aAAa,CAAC,MAAgB,EAAE,OAAiB,EAAE,IAAY;IACtE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,GAAG,GAAG,IAAI,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,GAAG;YAAE,IAAI,EAAE,CAAC;aACf,IAAI,CAAC,GAAG,CAAC,GAAG;YAAE,MAAM,EAAE,CAAC;;YACvB,IAAI,EAAE,CAAC;IACd,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAE1D,MAAM,UAAU,GAAG,IAAI,CAAC;IACxB,MAAM,GAAG,GAAG,SAAS,CAAC,qBAAqB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC;QACvC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC3E,OAAO;QACL,IAAI;QACJ,IAAI;QACJ,MAAM;QACN,CAAC;QACD,WAAW,EAAE,IAAI;QACjB,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;QACnB,WAAW,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;KAC9B,CAAC;AACJ,CAAC;AAsBD;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAwB,EACxB,SAAyB,EACzB,OAAmE,EAAE;IAErE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,YAAY,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;IAE5B,MAAM,oBAAoB,GACxB,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,SAAS,CAAC;IACrF,MAAM,qBAAqB,GAAG,IAAI,CAAC,OAAO;QACxC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,UAAU,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,SAAS;QACvF,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,kBAAkB,GACtB,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC;IAC/E,MAAM,mBAAmB,GAAG,SAAS,CAAC,kBAAkB,GAAG,QAAQ,CAAC,kBAAkB,CAAC;IAEvF,MAAM,MAAM,GAAG,aAAa,CAC1B,QAAQ,CAAC,UAAU,CAAC,UAAU,EAC9B,SAAS,CAAC,UAAU,CAAC,UAAU,EAC/B,IAAI,CACL,CAAC;IACF,MAAM,0BAA0B,GAAG,UAAU,CAC3C,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,EACtC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,CACxC,CAAC;IAEF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,oBAAoB,GAAG,IAAI,CAAC,iBAAiB;QAC/C,OAAO,CAAC,IAAI,CAAC,mBAAmB,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;IACjG,IAAI,kBAAkB,GAAG,CAAC,IAAI,CAAC,cAAc;QAC3C,OAAO,CAAC,IAAI,CAAC,sBAAsB,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;IAChG,IAAI,mBAAmB,GAAG,IAAI,CAAC,kBAAkB;QAC/C,OAAO,CAAC,IAAI,CACV,yBAAyB,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,kBAAkB,EAAE,CACvF,CAAC;IACJ,IAAI,CAAC,MAAM,CAAC,WAAW;QAAE,OAAO,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;IACvE,IAAI,qBAAqB,KAAK,SAAS,IAAI,qBAAqB,IAAI,IAAI,CAAC,iBAAiB;QACxF,OAAO,CAAC,IAAI,CACV,gCAAgC,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC,6BAA6B,CAC9F,CAAC;IAEJ,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,SAAS,EAAE,SAAS,CAAC,QAAQ;QAC7B,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ;QAC/B,CAAC,EAAE,SAAS,CAAC,CAAC;QACd,oBAAoB;QACpB,qBAAqB;QACrB,kBAAkB;QAClB,mBAAmB;QACnB,0BAA0B;QAC1B,MAAM;QACN,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE;KACpD,CAAC;AACJ,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAEtD,6DAA6D;AAC7D,MAAM,UAAU,oBAAoB,CAAC,CAAiB;IACpD,MAAM,GAAG,GAAG,CAAC,CAAiB,EAAE,EAAE,CAChC,KAAK,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;QAC5E,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACrF,OAAO;QACL,GAAG,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC,CAAC,GAAG;QAC1B,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC;QACxB,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC;QAC3B,4BAA4B,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,WAAW,GAAG;KAC7E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,cAAc,CAAC,CAAW;IACxC,MAAM,IAAI,GACR,CAAC,CAAC,qBAAqB,KAAK,SAAS;QACnC,CAAC,CAAC,mBAAmB,CAAC,CAAC,qBAAqB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACnG,CAAC,CAAC,EAAE,CAAC;IACT,OAAO;QACL,GAAG,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC9E,6BAA6B,CAAC,CAAC,oBAAoB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE;QAChH,6BAA6B,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe;QAClH,6BAA6B,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACvG,6BAA6B,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE;YAClG,YAAY,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;YAC1H,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE;QAC7C,cAAc,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;KAClI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC"}

package/dist/eval/retrieval/ladder.d.ts

@@ -0,0 +1,69 @@
+import type { EffectivenessMetrics } from '../../learning/effectiveness.js';
+import type { ABSignal } from './knowledge-quality.js';
+/**
+ * Proxy → outcome ladder for memory retrieval.
+ *
+ * Offline retrieval recall (the A/B signal in `knowledge-quality.ts`) is a
+ * *proxy*. A recall win only creates value if it converts down two more rungs,
+ * and it can leak at either joint:
+ *
+ *   recall@k  ──►  injected-knowledge utilization  ──►  task-success lift
+ *   (offline)      (was the surfaced note used?)        (north star)
+ *
+ * This module composes the three rungs into one verdict and — crucially —
+ * *localizes* where value is lost, so the next action is unambiguous:
+ *
+ *   - retrieval rung fails           → fix retrieval before looking downstream
+ *   - retrieval up, utilization flat → notes aren't actionable / injection is the
+ *                                       bottleneck (fix note CONTENT, not recall)
+ *   - utilization up, success flat   → knowledge isn't the binding constraint for
+ *                                       these tasks (memory won't move them)
+ *   - all three pass                 → value confirmed
+ *
+ * The retrieval rung comes from the offline corpus A/B; the utilization and
+ * success rungs come from {@link EffectivenessMetrics} (live run annotations) —
+ * `knowledgeApplicationRate` and `successRateDelta` (guided − unguided). Keeping
+ * this a pure function over those two inputs means any live runner
+ * (skillopt / skillflow) can feed it without bespoke plumbing.
+ */
+export type LadderVerdict = 'value-confirmed' | 'no-retrieval-gain' | 'leak-at-utilization' | 'leak-at-success' | 'insufficient-data';
+export interface LadderRung {
+    name: 'retrieval' | 'utilization' | 'success-lift';
+    /** Headline value for the rung. */
+    value: number;
+    passed: boolean;
+    detail: string;
+}
+export interface LadderReport {
+    rungs: {
+        retrieval: LadderRung;
+        utilization: LadderRung;
+        successLift: LadderRung;
+    };
+    verdict: LadderVerdict;
+    /** One-line, action-oriented localization of where value is (or isn't) flowing. */
+    diagnosis: string;
+}
+export interface LadderThresholds {
+    /** Min fraction of guided tasks that actually applied surfaced knowledge. */
+    minUtilizationRate: number;
+    /** Min guided − unguided success-rate delta to count as a real lift. */
+    minSuccessLift: number;
+    /** Min guided tasks before the success rung is readable. */
+    minGuided: number;
+    /** Min unguided tasks before the success rung is readable. */
+    minUnguided: number;
+}
+export declare const DEFAULT_LADDER_THRESHOLDS: LadderThresholds;
+/**
+ * Compose the ladder from the offline retrieval A/B signal and the live-run
+ * effectiveness metrics, and localize where value is gained or lost.
+ */
+export declare function evaluateLadder(input: {
+    retrieval: ABSignal;
+    effectiveness: EffectivenessMetrics;
+    thresholds?: Partial<LadderThresholds>;
+}): LadderReport;
+/** Human-readable ladder summary for logs / reports. */
+export declare function formatLadder(r: LadderReport): string;
+//# sourceMappingURL=ladder.d.ts.map

package/dist/eval/retrieval/ladder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ladder.d.ts","sourceRoot":"","sources":["../../../src/eval/retrieval/ladder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AAC5E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAEvD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,MAAM,MAAM,aAAa,GACrB,iBAAiB,GACjB,mBAAmB,GACnB,qBAAqB,GACrB,iBAAiB,GACjB,mBAAmB,CAAC;AAExB,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,WAAW,GAAG,aAAa,GAAG,cAAc,CAAC;IACnD,mCAAmC;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE;QAAE,SAAS,EAAE,UAAU,CAAC;QAAC,WAAW,EAAE,UAAU,CAAC;QAAC,WAAW,EAAE,UAAU,CAAA;KAAE,CAAC;IACnF,OAAO,EAAE,aAAa,CAAC;IACvB,mFAAmF;IACnF,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,gBAAgB;IAC/B,6EAA6E;IAC7E,kBAAkB,EAAE,MAAM,CAAC;IAC3B,wEAAwE;IACxE,cAAc,EAAE,MAAM,CAAC;IACvB,4DAA4D;IAC5D,SAAS,EAAE,MAAM,CAAC;IAClB,8DAA8D;IAC9D,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,eAAO,MAAM,yBAAyB,EAAE,gBAKvC,CAAC;AAEF;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE;IACpC,SAAS,EAAE,QAAQ,CAAC;IACpB,aAAa,EAAE,oBAAoB,CAAC;IACpC,UAAU,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC;CACxC,GAAG,YAAY,CA0Df;AAED,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CASpD"}

package/dist/eval/retrieval/ladder.js

@@ -0,0 +1,80 @@
+export const DEFAULT_LADDER_THRESHOLDS = {
+    minUtilizationRate: 0.3,
+    minSuccessLift: 0.02,
+    minGuided: 10,
+    minUnguided: 10,
+};
+/**
+ * Compose the ladder from the offline retrieval A/B signal and the live-run
+ * effectiveness metrics, and localize where value is gained or lost.
+ */
+export function evaluateLadder(input) {
+    const t = { ...DEFAULT_LADDER_THRESHOLDS, ...input.thresholds };
+    const { retrieval, effectiveness: e } = input;
+    const retrievalRung = {
+        name: 'retrieval',
+        value: retrieval.paraphraseRecallGain,
+        passed: retrieval.verdict.promote,
+        detail: retrieval.verdict.promote
+            ? `paraphrase recall gain +${retrieval.paraphraseRecallGain.toFixed(2)} (PROMOTE)`
+            : `gate not met: ${retrieval.verdict.reasons.join('; ')}`,
+    };
+    const utilizationRung = {
+        name: 'utilization',
+        value: e.knowledgeApplicationRate,
+        passed: e.knowledgeApplicationRate >= t.minUtilizationRate,
+        detail: `${(e.knowledgeApplicationRate * 100).toFixed(0)}% of guided tasks applied surfaced knowledge (min ${(t.minUtilizationRate * 100).toFixed(0)}%)`,
+    };
+    const enoughData = e.guidedTasks >= t.minGuided && e.unguidedTasks >= t.minUnguided;
+    const successLiftRung = {
+        name: 'success-lift',
+        value: e.successRateDelta,
+        passed: enoughData && e.successRateDelta >= t.minSuccessLift,
+        detail: enoughData
+            ? `guided ${(e.guidedSuccessRate * 100).toFixed(0)}% vs unguided ${(e.unguidedSuccessRate * 100).toFixed(0)}% (Δ ${e.successRateDelta >= 0 ? '+' : ''}${(e.successRateDelta * 100).toFixed(0)}pp, min +${(t.minSuccessLift * 100).toFixed(0)}pp)`
+            : `insufficient samples (guided ${e.guidedTasks}/${t.minGuided}, unguided ${e.unguidedTasks}/${t.minUnguided})`,
+    };
+    // Localize: read the rungs top-down and stop at the first break.
+    let verdict;
+    let diagnosis;
+    if (!retrievalRung.passed) {
+        verdict = 'no-retrieval-gain';
+        diagnosis = 'Retrieval rung failed — fix retrieval before looking downstream.';
+    }
+    else if (!enoughData) {
+        verdict = 'insufficient-data';
+        diagnosis = `Retrieval improved, but too few guided/unguided tasks to read the outcome rungs (need ≥${t.minGuided}/${t.minUnguided}). Run more live tasks.`;
+    }
+    else if (!utilizationRung.passed) {
+        verdict = 'leak-at-utilization';
+        diagnosis =
+            'Retrieval improved but surfaced notes are rarely applied — fix note actionability / injection formatting, not retrieval.';
+    }
+    else if (!successLiftRung.passed) {
+        verdict = 'leak-at-success';
+        diagnosis =
+            'Notes are retrieved and used, but task success did not move — knowledge is not the binding constraint for these tasks.';
+    }
+    else {
+        verdict = 'value-confirmed';
+        diagnosis =
+            'Recall gain converts through utilization to a real task-success lift. Memory is earning its keep.';
+    }
+    return {
+        rungs: { retrieval: retrievalRung, utilization: utilizationRung, successLift: successLiftRung },
+        verdict,
+        diagnosis,
+    };
+}
+/** Human-readable ladder summary for logs / reports. */
+export function formatLadder(r) {
+    const mark = (ok) => (ok ? '✅' : '❌');
+    return [
+        'memory value ladder:',
+        `  1. retrieval     ${mark(r.rungs.retrieval.passed)}  ${r.rungs.retrieval.detail}`,
+        `  2. utilization   ${mark(r.rungs.utilization.passed)}  ${r.rungs.utilization.detail}`,
+        `  3. success-lift  ${mark(r.rungs.successLift.passed)}  ${r.rungs.successLift.detail}`,
+        `  VERDICT: ${r.verdict.toUpperCase()} — ${r.diagnosis}`,
+    ].join('\n');
+}
+//# sourceMappingURL=ladder.js.map

package/dist/eval/retrieval/ladder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ladder.js","sourceRoot":"","sources":["../../../src/eval/retrieval/ladder.ts"],"names":[],"mappings":"AA+DA,MAAM,CAAC,MAAM,yBAAyB,GAAqB;IACzD,kBAAkB,EAAE,GAAG;IACvB,cAAc,EAAE,IAAI;IACpB,SAAS,EAAE,EAAE;IACb,WAAW,EAAE,EAAE;CAChB,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAI9B;IACC,MAAM,CAAC,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;IAChE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC;IAE9C,MAAM,aAAa,GAAe;QAChC,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,SAAS,CAAC,oBAAoB;QACrC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,OAAO;QACjC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,OAAO;YAC/B,CAAC,CAAC,2BAA2B,SAAS,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY;YAClF,CAAC,CAAC,iBAAiB,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;KAC5D,CAAC;IAEF,MAAM,eAAe,GAAe;QAClC,IAAI,EAAE,aAAa;QACnB,KAAK,EAAE,CAAC,CAAC,wBAAwB;QACjC,MAAM,EAAE,CAAC,CAAC,wBAAwB,IAAI,CAAC,CAAC,kBAAkB;QAC1D,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,wBAAwB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qDAAqD,CAAC,CAAC,CAAC,kBAAkB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;KACzJ,CAAC;IAEF,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,WAAW,CAAC;IACpF,MAAM,eAAe,GAAe;QAClC,IAAI,EAAE,cAAc;QACpB,KAAK,EAAE,CAAC,CAAC,gBAAgB;QACzB,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,cAAc;QAC5D,MAAM,EAAE,UAAU;YAChB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,iBAAiB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,mBAAmB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK;YACjP,CAAC,CAAC,gCAAgC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,cAAc,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,WAAW,GAAG;KAClH,CAAC;IAEF,iEAAiE;IACjE,IAAI,OAAsB,CAAC;IAC3B,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,GAAG,mBAAmB,CAAC;QAC9B,SAAS,GAAG,kEAAkE,CAAC;IACjF,CAAC;SAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QACvB,OAAO,GAAG,mBAAmB,CAAC;QAC9B,SAAS,GAAG,0FAA0F,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,yBAAyB,CAAC;IAC9J,CAAC;SAAM,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;QACnC,OAAO,GAAG,qBAAqB,CAAC;QAChC,SAAS;YACP,0HAA0H,CAAC;IAC/H,CAAC;SAAM,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;QACnC,OAAO,GAAG,iBAAiB,CAAC;QAC5B,SAAS;YACP,wHAAwH,CAAC;IAC7H,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,iBAAiB,CAAC;QAC5B,SAAS;YACP,mGAAmG,CAAC;IACxG,CAAC;IAED,OAAO;QACL,KAAK,EAAE,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,eAAe,EAAE,WAAW,EAAE,eAAe,EAAE;QAC/F,OAAO;QACP,SAAS;KACV,CAAC;AACJ,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAAC,CAAe;IAC1C,MAAM,IAAI,GAAG,CAAC,EAAW,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C,OAAO;QACL,sBAAsB;QACtB,sBAAsB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE;QACnF,sBAAsB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE;QACvF,sBAAsB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE;QACvF,cAAc,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,SAAS,EAAE;KACzD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC"}

package/dist/eval/retrieval/quality.d.ts

@@ -0,0 +1,39 @@
+import type { MemorySystem } from '../../memory/system.js';
+import { type TaskType } from './corpus.js';
+/**
+ * Offline retrieval-quality metrics — does goal-keyed retrieval surface the
+ * right task type, exclude failures, and render a usable recipe? Computed over
+ * a labeled corpus with NO live agent, so it's fast and reproducible and can be
+ * used to tune k / thresholds / embeddings.
+ */
+export interface RetrievalQualityMetrics {
+    queries: number;
+    k: number;
+    /** Fraction of queries whose top-1 retrieved experience is the same task type. */
+    sameTypeAt1: number;
+    /** Fraction of queries with ≥1 same-type experience in top-k. */
+    recallAtK: number;
+    /** Mean reciprocal rank of the first same-type experience. */
+    mrr: number;
+    /** Fraction of retrieved exemplars (across all queries) that are FAILURES. */
+    failureLeakRate: number;
+    /** Fraction of retrieved exemplars that render a non-empty action recipe. */
+    recipeRenderedRate: number;
+    /** Mean retrieved count per query (≤ k). */
+    avgRetrieved: number;
+}
+/** Keyword classifier — fallback when an experience has no stored type label. */
+export declare function classifyGoal(goal: string): TaskType;
+/**
+ * Run each query against memory and aggregate retrieval-quality metrics.
+ * The memory must already hold the corpus; configure its `maxExperiences` ≥ k.
+ */
+export declare function evaluateRetrievalQuality(memory: MemorySystem, queries: Array<{
+    goal: string;
+    type: TaskType;
+}>, opts?: {
+    k?: number;
+}): Promise<RetrievalQualityMetrics>;
+/** One-line summary for logs/reports. */
+export declare function formatRetrievalMetrics(m: RetrievalQualityMetrics): string;
+//# sourceMappingURL=quality.d.ts.map

package/dist/eval/retrieval/quality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality.d.ts","sourceRoot":"","sources":["../../../src/eval/retrieval/quality.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAG3D,OAAO,EAAc,KAAK,QAAQ,EAAE,MAAM,aAAa,CAAC;AAExD;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,MAAM,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;IACV,kFAAkF;IAClF,WAAW,EAAE,MAAM,CAAC;IACpB,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;IAClB,8DAA8D;IAC9D,GAAG,EAAE,MAAM,CAAC;IACZ,8EAA8E;IAC9E,eAAe,EAAE,MAAM,CAAC;IACxB,6EAA6E;IAC7E,kBAAkB,EAAE,MAAM,CAAC;IAC3B,4CAA4C;IAC5C,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,iFAAiF;AACjF,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAQnD;AASD;;;GAGG;AACH,wBAAsB,wBAAwB,CAC5C,MAAM,EAAE,YAAY,EACpB,OAAO,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC,EAChD,IAAI,GAAE;IAAE,CAAC,CAAC,EAAE,MAAM,CAAA;CAAO,GACxB,OAAO,CAAC,uBAAuB,CAAC,CAyClC;AAED,yCAAyC;AACzC,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,uBAAuB,GAAG,MAAM,CAOzE"}

package/dist/eval/retrieval/quality.js

@@ -0,0 +1,75 @@
+import { experienceActionRecipe } from '../../runtime/manager.js';
+import { TASK_TYPES } from './corpus.js';
+/** Keyword classifier — fallback when an experience has no stored type label. */
+export function classifyGoal(goal) {
+    const g = goal.toLowerCase();
+    if (g.startsWith('heat'))
+        return 'heat';
+    if (g.startsWith('cool'))
+        return 'cool';
+    if (g.startsWith('clean'))
+        return 'clean';
+    if (g.startsWith('examine') || g.includes('look at'))
+        return 'examine';
+    if (g.startsWith('put two'))
+        return 'pick-two';
+    return 'pick';
+}
+function experienceType(exp) {
+    const ctx = exp.metadata?.taskContext;
+    const t = ctx?.taskType;
+    if (typeof t === 'string' && TASK_TYPES.includes(t))
+        return t;
+    return classifyGoal(exp.taskInput);
+}
+/**
+ * Run each query against memory and aggregate retrieval-quality metrics.
+ * The memory must already hold the corpus; configure its `maxExperiences` ≥ k.
+ */
+export async function evaluateRetrievalQuality(memory, queries, opts = {}) {
+    const k = opts.k ?? 4;
+    let sameTypeAt1 = 0;
+    let recallAtK = 0;
+    let mrrSum = 0;
+    let retrievedTotal = 0;
+    let failureCount = 0;
+    let recipeCount = 0;
+    for (const query of queries) {
+        const result = await memory.queryV2(query.goal, { domains: ['embodied'] });
+        const retrieved = result.experiences.slice(0, k);
+        retrievedTotal += retrieved.length;
+        const types = retrieved.map((r) => experienceType(r.experience));
+        if (types[0] === query.type)
+            sameTypeAt1++;
+        const firstSame = types.findIndex((t) => t === query.type);
+        if (firstSame >= 0) {
+            recallAtK++;
+            mrrSum += 1 / (firstSame + 1);
+        }
+        for (const { experience } of retrieved) {
+            if (!experience.success)
+                failureCount++;
+            if (experienceActionRecipe(experience))
+                recipeCount++;
+        }
+    }
+    const n = queries.length || 1;
+    return {
+        queries: queries.length,
+        k,
+        sameTypeAt1: sameTypeAt1 / n,
+        recallAtK: recallAtK / n,
+        mrr: mrrSum / n,
+        failureLeakRate: retrievedTotal ? failureCount / retrievedTotal : 0,
+        recipeRenderedRate: retrievedTotal ? recipeCount / retrievedTotal : 0,
+        avgRetrieved: retrievedTotal / n,
+    };
+}
+/** One-line summary for logs/reports. */
+export function formatRetrievalMetrics(m) {
+    const pct = (x) => `${(x * 100).toFixed(0)}%`;
+    return (`k=${m.k} | same-type@1 ${pct(m.sameTypeAt1)} | recall@k ${pct(m.recallAtK)} | ` +
+        `MRR ${m.mrr.toFixed(2)} | failure-leak ${pct(m.failureLeakRate)} | ` +
+        `recipe ${pct(m.recipeRenderedRate)} | avg-retrieved ${m.avgRetrieved.toFixed(1)}`);
+}
+//# sourceMappingURL=quality.js.map

package/dist/eval/retrieval/quality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality.js","sourceRoot":"","sources":["../../../src/eval/retrieval/quality.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,UAAU,EAAiB,MAAM,aAAa,CAAC;AAyBxD,iFAAiF;AACjF,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACxC,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACxC,IAAI,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAC1C,IAAI,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IACvE,IAAI,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,UAAU,CAAC;IAC/C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,cAAc,CAAC,GAAe;IACrC,MAAM,GAAG,GAAI,GAAG,CAAC,QAAiE,EAAE,WAAW,CAAC;IAChG,MAAM,CAAC,GAAG,GAAG,EAAE,QAAQ,CAAC;IACxB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAK,UAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAa,CAAC;IACxF,OAAO,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACrC,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,MAAoB,EACpB,OAAgD,EAChD,OAAuB,EAAE;IAEzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IAEtB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3E,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,cAAc,IAAI,SAAS,CAAC,MAAM,CAAC;QAEnC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QACjE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI;YAAE,WAAW,EAAE,CAAC;QAE3C,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,SAAS,EAAE,CAAC;YACZ,MAAM,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,SAAS,EAAE,CAAC;YACvC,IAAI,CAAC,UAAU,CAAC,OAAO;gBAAE,YAAY,EAAE,CAAC;YACxC,IAAI,sBAAsB,CAAC,UAAU,CAAC;gBAAE,WAAW,EAAE,CAAC;QACxD,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IAC9B,OAAO;QACL,OAAO,EAAE,OAAO,CAAC,MAAM;QACvB,CAAC;QACD,WAAW,EAAE,WAAW,GAAG,CAAC;QAC5B,SAAS,EAAE,SAAS,GAAG,CAAC;QACxB,GAAG,EAAE,MAAM,GAAG,CAAC;QACf,eAAe,EAAE,cAAc,CAAC,CAAC,CAAC,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACnE,kBAAkB,EAAE,cAAc,CAAC,CAAC,CAAC,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrE,YAAY,EAAE,cAAc,GAAG,CAAC;KACjC,CAAC;AACJ,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,sBAAsB,CAAC,CAA0B;IAC/D,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IACtD,OAAO,CACL,KAAK,CAAC,CAAC,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK;QAChF,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK;QACrE,UAAU,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,oBAAoB,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACnF,CAAC;AACJ,CAAC"}