@miller-tech/uap 2.1.7 → 2.11.1

package/dist/evals/routing-eval.d.ts

@@ -0,0 +1,104 @@
+/**
+ * ROUTING EVAL — measures rank-1 *description separability* of the pattern,
+ * droid, and skill registries against curated fixtures with planted traps.
+ *
+ * This is a separability proxy, not a replica of production routing: the
+ * production pattern router is keyword-substring multi-match, and droids and
+ * skills are routed by the LLM reading descriptions. What this eval guards
+ * is the shared failure mode — descriptions that stop being distinguishable
+ * as the registry grows. For patterns, a parity baseline against the real
+ * PatternRouter is reported alongside (informational, not gated).
+ *
+ * Kind-scoped ranking: a fixture case declares its surface (pattern, droid,
+ * or skill) and is ranked only against that surface, matching how the
+ * surfaces are actually consumed (pattern router vs Task subagent_type vs
+ * Skill invocation). Threshold failures exit nonzero in CI.
+ */
+import { type RoutingEntry, type RoutingKind } from './routing-corpus.js';
+/** All routable surfaces — add a fourth kind here, not in two places. */
+export declare const ROUTING_KINDS: RoutingKind[];
+export interface RoutingEvalCase {
+    kind: RoutingKind;
+    query: string;
+    /** Expected entry id within the kind, or null for "should match nothing". */
+    expect: string | null;
+    /** Planted trap: deliberately confusable with a near-neighbor entry. */
+    trap?: boolean;
+    note?: string;
+}
+export interface CaseResult {
+    kind: RoutingKind;
+    query: string;
+    expect: string | null;
+    actual: string | null;
+    score: number;
+    /** rank1 minus rank2 score for positive cases — near-tie fragility gauge. */
+    margin: number;
+    /** Distinct content tokens shared between query and top-ranked entry. */
+    overlap: number;
+    pass: boolean;
+    trap: boolean;
+}
+export interface KindReport {
+    total: number;
+    passed: number;
+    rank1Accuracy: number;
+}
+export interface RoutingEvalReport {
+    total: number;
+    passed: number;
+    failed: number;
+    /** Rank-1 accuracy over positive (non-null expect) cases. */
+    rank1Accuracy: number;
+    trapTotal: number;
+    trapPassed: number;
+    negativeTotal: number;
+    negativePassed: number;
+    perKind: Record<string, KindReport>;
+    /** Corpus entries embedded from a body fallback (weak routing surface). */
+    weakEntries: string[];
+    failures: CaseResult[];
+    /** Smallest rank1–rank2 margin among passing positive cases. */
+    minMargin: number;
+    /** Entries whose bare name exists under more than one kind (cross-kind collision). */
+    crossKindNames: string[];
+    /** PatternRouter (keyword multi-match) inclusion rate on pattern positives. */
+    patternRouterBaseline: {
+        total: number;
+        included: number;
+    } | null;
+    threshold: number;
+    meetsThreshold: boolean;
+}
+export declare const DEFAULT_CASES_PATH = "evals/routing/cases.json";
+export declare const DEFAULT_THRESHOLD = 0.9;
+/**
+ * Backstop ceiling on a negative case's top cosine score. The real negative
+ * gate is token overlap (below) — calibration showed cosine alone cannot
+ * separate near-domain negatives (single high-idf shared token, score up to
+ * ~0.31) from weak positives (down to ~0.23), so this only catches
+ * pathological full-coverage matches.
+ */
+export declare const DEFAULT_NEGATIVE_MAX_SCORE = 0.5;
+/**
+ * Real negative gate: a route claim resting on at most one shared content
+ * token is not a route. Negatives with 2+ distinct shared tokens fail.
+ * Ranker-agnostic, unlike a cosine ceiling.
+ */
+export declare const DEFAULT_NEGATIVE_MAX_OVERLAP = 1;
+/** Load and validate eval cases from JSON. Throws on malformed fixtures. */
+export declare function loadEvalCases(path: string): RoutingEvalCase[];
+export interface RunRoutingEvalOptions {
+    casesPath?: string;
+    threshold?: number;
+    negativeMaxScore?: number;
+    negativeMaxOverlap?: number;
+    /** Pre-loaded cases (unit tests inject synthetic fixtures). */
+    cases?: RoutingEvalCase[];
+    /** Pre-loaded corpus (unit tests inject synthetic corpora). */
+    corpus?: RoutingEntry[];
+}
+export declare function runRoutingEval(projectDir: string, options?: RunRoutingEvalOptions): RoutingEvalReport;
+/** Human-readable summary for CLI output. */
+export declare function formatReport(report: RoutingEvalReport): string;
+//# sourceMappingURL=routing-eval.d.ts.map

package/dist/evals/routing-eval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"routing-eval.d.ts","sourceRoot":"","sources":["../../src/evals/routing-eval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAKH,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,qBAAqB,CAAC;AAG7B,yEAAyE;AACzE,eAAO,MAAM,aAAa,EAAE,WAAW,EAAkC,CAAC;AAE1E,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,6EAA6E;IAC7E,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,wEAAwE;IACxE,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAC;IACf,yEAAyE;IACzE,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,6DAA6D;IAC7D,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACpC,2EAA2E;IAC3E,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,QAAQ,EAAE,UAAU,EAAE,CAAC;IACvB,gEAAgE;IAChE,SAAS,EAAE,MAAM,CAAC;IAClB,sFAAsF;IACtF,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,+EAA+E;IAC/E,qBAAqB,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAClE,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,OAAO,CAAC;CACzB;AAED,eAAO,MAAM,kBAAkB,6BAA6B,CAAC;AAC7D,eAAO,MAAM,iBAAiB,MAAM,CAAC;AACrC;;;;;;GAMG;AACH,eAAO,MAAM,0BAA0B,MAAM,CAAC;AAC9C;;;;GAIG;AACH,eAAO,MAAM,4BAA4B,IAAI,CAAC;AAE9C,4EAA4E;AAC5E,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,eAAe,EAAE,CA4B7D;AA8CD,MAAM,WAAW,qBAAqB;IACpC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,+DAA+D;IAC/D,KAAK,CAAC,EAAE,eAAe,EAAE,CAAC;IAC1B,+DAA+D;IAC/D,MAAM,CAAC,EAAE,YAAY,EAAE,CAAC;CACzB;AAED,wBAAgB,cAAc,CAC5B,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,qBAA0B,GAClC,iBAAiB,CAgHnB;AAED,6CAA6C;AAC7C,wBAAgB,YAAY,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CA6B9D"}

package/dist/evals/routing-eval.js

@@ -0,0 +1,231 @@
+/**
+ * ROUTING EVAL — measures rank-1 *description separability* of the pattern,
+ * droid, and skill registries against curated fixtures with planted traps.
+ *
+ * This is a separability proxy, not a replica of production routing: the
+ * production pattern router is keyword-substring multi-match, and droids and
+ * skills are routed by the LLM reading descriptions. What this eval guards
+ * is the shared failure mode — descriptions that stop being distinguishable
+ * as the registry grows. For patterns, a parity baseline against the real
+ * PatternRouter is reported alongside (informational, not gated).
+ *
+ * Kind-scoped ranking: a fixture case declares its surface (pattern, droid,
+ * or skill) and is ranked only against that surface, matching how the
+ * surfaces are actually consumed (pattern router vs Task subagent_type vs
+ * Skill invocation). Threshold failures exit nonzero in CI.
+ */
+import { existsSync, readFileSync } from 'fs';
+import { join } from 'path';
+import { TfIdfIndex } from './tfidf.js';
+import { loadRoutingCorpus, } from './routing-corpus.js';
+import { PatternRouter } from '../coordination/pattern-router.js';
+/** All routable surfaces — add a fourth kind here, not in two places. */
+export const ROUTING_KINDS = ['pattern', 'droid', 'skill'];
+export const DEFAULT_CASES_PATH = 'evals/routing/cases.json';
+export const DEFAULT_THRESHOLD = 0.9;
+/**
+ * Backstop ceiling on a negative case's top cosine score. The real negative
+ * gate is token overlap (below) — calibration showed cosine alone cannot
+ * separate near-domain negatives (single high-idf shared token, score up to
+ * ~0.31) from weak positives (down to ~0.23), so this only catches
+ * pathological full-coverage matches.
+ */
+export const DEFAULT_NEGATIVE_MAX_SCORE = 0.5;
+/**
+ * Real negative gate: a route claim resting on at most one shared content
+ * token is not a route. Negatives with 2+ distinct shared tokens fail.
+ * Ranker-agnostic, unlike a cosine ceiling.
+ */
+export const DEFAULT_NEGATIVE_MAX_OVERLAP = 1;
+/** Load and validate eval cases from JSON. Throws on malformed fixtures. */
+export function loadEvalCases(path) {
+    if (!existsSync(path)) {
+        throw new Error(`routing eval cases not found: ${path}`);
+    }
+    const raw = JSON.parse(readFileSync(path, 'utf-8'));
+    // Honor the fixture format version: a ranker swap changes score semantics,
+    // so unknown versions must force recalibration instead of silently reusing
+    // fixtures calibrated for a different scorer.
+    if (raw.version !== 1) {
+        throw new Error(`routing eval cases malformed: unsupported version "${String(raw.version)}" in ${path}`);
+    }
+    if (!Array.isArray(raw.cases)) {
+        throw new Error(`routing eval cases malformed: missing "cases" array in ${path}`);
+    }
+    const kinds = new Set(['pattern', 'droid', 'skill']);
+    return raw.cases.map((c, i) => {
+        const kase = c;
+        if (!kinds.has(String(kase.kind))) {
+            throw new Error(`case ${i}: invalid kind "${String(kase.kind)}"`);
+        }
+        if (typeof kase.query !== 'string' || kase.query.length < 5) {
+            throw new Error(`case ${i}: query missing or too short`);
+        }
+        if (kase.expect !== null && typeof kase.expect !== 'string') {
+            throw new Error(`case ${i}: expect must be a string id or null`);
+        }
+        return kase;
+    });
+}
+function evaluateCase(kase, entries, index, negativeMaxScore, negativeMaxOverlap) {
+    const scores = index.score(kase.query);
+    let topIdx = -1;
+    let top = 0;
+    let second = 0;
+    for (let i = 0; i < scores.length; i++) {
+        if (scores[i] > top) {
+            second = top;
+            top = scores[i];
+            topIdx = i;
+        }
+        else if (scores[i] > second) {
+            second = scores[i];
+        }
+    }
+    const actual = topIdx >= 0 ? entries[topIdx].id : null;
+    const overlap = topIdx >= 0 ? index.sharedTokens(kase.query, topIdx).length : 0;
+    const pass = kase.expect === null
+        ? overlap <= negativeMaxOverlap && top <= negativeMaxScore
+        : actual === kase.expect;
+    const round = (n) => Math.round(n * 1000) / 1000;
+    return {
+        kind: kase.kind,
+        query: kase.query,
+        expect: kase.expect,
+        actual,
+        score: round(top),
+        margin: round(top - second),
+        overlap,
+        pass,
+        trap: kase.trap === true,
+    };
+}
+function emptyKindReport() {
+    return { total: 0, passed: 0, rank1Accuracy: 0 };
+}
+export function runRoutingEval(projectDir, options = {}) {
+    const threshold = options.threshold ?? DEFAULT_THRESHOLD;
+    const negativeMaxScore = options.negativeMaxScore ?? DEFAULT_NEGATIVE_MAX_SCORE;
+    const negativeMaxOverlap = options.negativeMaxOverlap ?? DEFAULT_NEGATIVE_MAX_OVERLAP;
+    const cases = options.cases ?? loadEvalCases(join(projectDir, options.casesPath ?? DEFAULT_CASES_PATH));
+    const corpus = options.corpus ?? loadRoutingCorpus(projectDir);
+    // Fixture integrity: every expected id must exist in its kind's corpus.
+    for (const kase of cases) {
+        if (kase.expect === null)
+            continue;
+        if (!corpus.some((e) => e.kind === kase.kind && e.id === kase.expect)) {
+            throw new Error(`fixture integrity: case "${kase.query.slice(0, 60)}…" expects unknown ${kase.kind} "${kase.expect}"`);
+        }
+    }
+    // One TF-IDF index per kind — kind-scoped ranking matches how the
+    // surfaces are consumed (pattern router vs droid registry vs skills).
+    const indexes = new Map();
+    for (const kind of ROUTING_KINDS) {
+        const entries = corpus.filter((e) => e.kind === kind);
+        if (entries.length > 0) {
+            indexes.set(kind, { entries, index: new TfIdfIndex(entries.map((e) => e.text)) });
+        }
+    }
+    const results = [];
+    for (const kase of cases) {
+        const surface = indexes.get(kase.kind);
+        if (!surface) {
+            throw new Error(`routing corpus is empty for kind "${kase.kind}"`);
+        }
+        results.push(evaluateCase(kase, surface.entries, surface.index, negativeMaxScore, negativeMaxOverlap));
+    }
+    const positives = results.filter((r) => r.expect !== null);
+    if (positives.length === 0) {
+        // Guard against a silently vacuous pass: with no positive cases the
+        // accuracy gate is meaningless, so this is an error, not a 100% run.
+        throw new Error('routing eval has no positive cases — refusing to pass vacuously');
+    }
+    const traps = results.filter((r) => r.trap);
+    const negatives = results.filter((r) => r.expect === null);
+    const failures = results.filter((r) => !r.pass);
+    const rank1Accuracy = positives.filter((r) => r.pass).length / positives.length;
+    const perKind = {};
+    for (const kind of ROUTING_KINDS) {
+        const kindPositives = positives.filter((r) => r.kind === kind);
+        const report = emptyKindReport();
+        report.total = kindPositives.length;
+        report.passed = kindPositives.filter((r) => r.pass).length;
+        report.rank1Accuracy = report.total === 0 ? 1 : report.passed / report.total;
+        perKind[kind] = report;
+    }
+    const passingPositives = positives.filter((r) => r.pass);
+    const minMargin = Math.min(...passingPositives.map((r) => r.margin));
+    // Cross-kind name collisions: the production LLM sees all registries at
+    // once, so a name that exists as both droid and skill is a real routing
+    // hazard even though the eval ranks kind-scoped. Surfaced as a warning.
+    const kindsByName = new Map();
+    for (const e of corpus) {
+        if (!kindsByName.has(e.id))
+            kindsByName.set(e.id, new Set());
+        kindsByName.get(e.id).add(e.kind);
+    }
+    const crossKindNames = [...kindsByName.entries()]
+        .filter(([, kinds]) => kinds.size > 1)
+        .map(([name]) => name);
+    // Parity baseline: run pattern positives through the production keyword
+    // router and measure inclusion rate (multi-match, so rank-1 n/a).
+    // Skipped for injected synthetic corpora (unit tests).
+    let patternRouterBaseline = null;
+    if (options.corpus === undefined) {
+        const router = new PatternRouter();
+        if (router.loadPatterns(projectDir)) {
+            const patternCases = cases.filter((c) => c.kind === 'pattern' && c.expect !== null);
+            const included = patternCases.filter((c) => router.matchPatterns(c.query).some((p) => String(p.id) === c.expect)).length;
+            patternRouterBaseline = { total: patternCases.length, included };
+        }
+    }
+    return {
+        total: results.length,
+        passed: results.filter((r) => r.pass).length,
+        failed: failures.length,
+        rank1Accuracy,
+        trapTotal: traps.length,
+        trapPassed: traps.filter((r) => r.pass).length,
+        negativeTotal: negatives.length,
+        negativePassed: negatives.filter((r) => r.pass).length,
+        perKind,
+        weakEntries: corpus.filter((e) => !e.hasDescription).map((e) => e.key),
+        failures,
+        minMargin,
+        crossKindNames,
+        patternRouterBaseline,
+        threshold,
+        // Gate: rank-1 accuracy over positives must clear the threshold, and
+        // every negative case must stay below the no-match score ceiling —
+        // false-routing garbage input is a hard fail, not a percentage point.
+        meetsThreshold: rank1Accuracy >= threshold && negatives.every((r) => r.pass),
+    };
+}
+/** Human-readable summary for CLI output. */
+export function formatReport(report) {
+    const pct = (n) => `${(n * 100).toFixed(1)}%`;
+    const lines = [
+        `rank-1 accuracy: ${pct(report.rank1Accuracy)} (threshold ${pct(report.threshold)})`,
+        `cases: ${report.passed}/${report.total} passed` +
+            ` | traps: ${report.trapPassed}/${report.trapTotal}` +
+            ` | negatives: ${report.negativePassed}/${report.negativeTotal}`,
+        ...Object.entries(report.perKind).map(([kind, r]) => `  ${kind}: ${pct(r.rank1Accuracy)} (${r.passed}/${r.total})`),
+        `min rank1-rank2 margin (passing positives): ${report.minMargin.toFixed(3)}`,
+    ];
+    if (report.patternRouterBaseline) {
+        const b = report.patternRouterBaseline;
+        lines.push(`production pattern-router inclusion baseline: ${b.included}/${b.total}`);
+    }
+    if (report.crossKindNames.length > 0) {
+        lines.push(`cross-kind name collisions: ${report.crossKindNames.join(', ')}`);
+    }
+    if (report.weakEntries.length > 0) {
+        lines.push(`weak entries (no description, body fallback): ${report.weakEntries.join(', ')}`);
+    }
+    for (const f of report.failures) {
+        lines.push(`FAIL [${f.kind}] "${f.query.slice(0, 70)}" → got ${f.actual ?? '∅'} (${f.score}), expected ${f.expect ?? 'no match'}`);
+    }
+    lines.push(report.meetsThreshold ? 'PASS' : 'FAIL — below threshold');
+    return lines.join('\n');
+}
+//# sourceMappingURL=routing-eval.js.map

package/dist/evals/routing-eval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"routing-eval.js","sourceRoot":"","sources":["../../src/evals/routing-eval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EACL,iBAAiB,GAGlB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAElE,yEAAyE;AACzE,MAAM,CAAC,MAAM,aAAa,GAAkB,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAwD1E,MAAM,CAAC,MAAM,kBAAkB,GAAG,0BAA0B,CAAC;AAC7D,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AACrC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAC9C;;;;GAIG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC;AAE9C,4EAA4E;AAC5E,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,EAAE,CAAC,CAAC;IAC3D,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAA2C,CAAC;IAC9F,2EAA2E;IAC3E,2EAA2E;IAC3E,8CAA8C;IAC9C,IAAI,GAAG,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,sDAAsD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IAC3G,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,0DAA0D,IAAI,EAAE,CAAC,CAAC;IACpF,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACrD,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5B,MAAM,IAAI,GAAG,CAA6B,CAAC;QAC3C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,mBAAmB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,8BAA8B,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,sCAAsC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,IAAuB,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,YAAY,CACnB,IAAqB,EACrB,OAAuB,EACvB,KAAiB,EACjB,gBAAwB,EACxB,kBAA0B;IAE1B,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,CAAC;YACb,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,GAAG,CAAC,CAAC;QACb,CAAC;aAAM,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;YAC9B,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,IAAI,GACR,IAAI,CAAC,MAAM,KAAK,IAAI;QAClB,CAAC,CAAC,OAAO,IAAI,kBAAkB,IAAI,GAAG,IAAI,gBAAgB;QAC1D,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;IAC7B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IACzD,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,MAAM;QACN,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;QACjB,MAAM,EAAE,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC;QAC3B,OAAO;QACP,IAAI;QACJ,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI;KACzB,CAAC;AACJ,CAAC;AAED,SAAS,eAAe;IACtB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC;AACnD,CAAC;AAaD,MAAM,UAAU,cAAc,CAC5B,UAAkB,EAClB,UAAiC,EAAE;IAEnC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,iBAAiB,CAAC;IACzD,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,0BAA0B,CAAC;IAChF,MAAM,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,IAAI,4BAA4B,CAAC;IACtF,MAAM,KAAK,GACT,OAAO,CAAC,KAAK,IAAI,aAAa,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC,CAAC,CAAC;IAC5F,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAE/D,wEAAwE;IACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;YAAE,SAAS;QACnC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACtE,MAAM,IAAI,KAAK,CACb,4BAA4B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,sBAAsB,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,GAAG,CACtG,CAAC;QACJ,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,sEAAsE;IACtE,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+D,CAAC;IACvF,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACtD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,CAAC,IAAI,CACV,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,gBAAgB,EAAE,kBAAkB,CAAC,CACzF,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;IAC3D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,oEAAoE;QACpE,qEAAqE;QACrE,MAAM,IAAI,KAAK,CAAC,iEAAiE,CAAC,CAAC;IACrF,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChD,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhF,MAAM,OAAO,GAA+B,EAAE,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,CAAC,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC;QACpC,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC3D,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC7E,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;IACzB,CAAC;IAED,MAAM,gBAAgB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAErE,wEAAwE;IACxE,wEAAwE;IACxE,wEAAwE;IACxE,MAAM,WAAW,GAAG,IAAI,GAAG,EAA4B,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7D,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IACD,MAAM,cAAc,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC;SAC9C,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;SACrC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAEzB,wEAAwE;IACxE,kEAAkE;IAClE,uDAAuD;IACvD,IAAI,qBAAqB,GAA+C,IAAI,CAAC;IAC7E,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QACnC,IAAI,MAAM,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;YACpF,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACzC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CACrE,CAAC,MAAM,CAAC;YACT,qBAAqB,GAAG,EAAE,KAAK,EAAE,YAAY,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC;QACnE,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM;QAC5C,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,aAAa;QACb,SAAS,EAAE,KAAK,CAAC,MAAM;QACvB,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM;QAC9C,aAAa,EAAE,SAAS,CAAC,MAAM;QAC/B,cAAc,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM;QACtD,OAAO;QACP,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QACtE,QAAQ;QACR,SAAS;QACT,cAAc;QACd,qBAAqB;QACrB,SAAS;QACT,qEAAqE;QACrE,mEAAmE;QACnE,sEAAsE;QACtE,cAAc,EACZ,aAAa,IAAI,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,YAAY,CAAC,MAAyB;IACpD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IACtD,MAAM,KAAK,GAAG;QACZ,oBAAoB,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG;QACpF,UAAU,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK,SAAS;YAC9C,aAAa,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,SAAS,EAAE;YACpD,iBAAiB,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,aAAa,EAAE;QAClE,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CACnC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,GAAG,CAC7E;QACD,+CAA+C,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;KAC7E,CAAC;IACF,IAAI,MAAM,CAAC,qBAAqB,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,MAAM,CAAC,qBAAqB,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACvF,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,+BAA+B,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,iDAAiD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QAChC,KAAK,CAAC,IAAI,CACR,SAAS,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC,MAAM,IAAI,UAAU,EAAE,CACvH,CAAC;IACJ,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC;IACtE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/evals/tfidf.d.ts

@@ -0,0 +1,35 @@
+/**
+ * TF-IDF RANKER — pure-TypeScript retrieval scorer for routing evals.
+ *
+ * Airgap-pure by design: no embedding model, no network, deterministic output.
+ * Used by the routing eval harness (0.4) to measure whether corpus entries
+ * (patterns, droids, skills) stay separable as the registry grows.
+ */
+/**
+ * Naive suffix stemmer — good enough for routing separability without a
+ * dependency. Handles the dominant mismatch classes seen in calibration:
+ * plurals ("interfaces"/"interface") and -ing forms ("tweaking"/"tweak").
+ */
+export declare function stem(token: string): string;
+/** Tokenize: lowercase, split on non-alphanumerics, stem, drop short + stopwords. */
+export declare function tokenize(text: string): string[];
+export declare class TfIdfIndex {
+    private readonly idf;
+    private vectors;
+    private norms;
+    /** Raw tokenized documents, kept for shared-token overlap analysis. */
+    private docTokens;
+    constructor(documents: string[]);
+    /** Distinct content tokens shared between the query and a document. */
+    sharedTokens(query: string, docIndex: number): string[];
+    private build;
+    private vectorize;
+    /** Cosine score of the query against every document, in document order. */
+    score(query: string): number[];
+    /** Index of the highest-scoring document, or -1 when all scores are 0. */
+    topIndex(query: string): {
+        index: number;
+        score: number;
+    };
+}
+//# sourceMappingURL=tfidf.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.d.ts","sourceRoot":"","sources":["../../src/evals/tfidf.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAcH;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAU1C;AAED,qFAAqF;AACrF,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAM/C;AAyBD,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAA6B;IACjD,OAAO,CAAC,OAAO,CAAkC;IACjD,OAAO,CAAC,KAAK,CAAgB;IAC7B,uEAAuE;IACvE,OAAO,CAAC,SAAS,CAAkB;gBAEvB,SAAS,EAAE,MAAM,EAAE;IAI/B,uEAAuE;IACvE,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAOvD,OAAO,CAAC,KAAK;IAiBb,OAAO,CAAC,SAAS;IAYjB,2EAA2E;IAC3E,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE;IAM9B,0EAA0E;IAC1E,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE;CAY1D"}

package/dist/evals/tfidf.js

@@ -0,0 +1,132 @@
+/**
+ * TF-IDF RANKER — pure-TypeScript retrieval scorer for routing evals.
+ *
+ * Airgap-pure by design: no embedding model, no network, deterministic output.
+ * Used by the routing eval harness (0.4) to measure whether corpus entries
+ * (patterns, droids, skills) stay separable as the registry grows.
+ */
+/** Minimal stopword list — keeps domain tokens, drops glue words. */
+const STOPWORDS = new Set([
+    'the', 'a', 'an', 'and', 'or', 'but', 'if', 'then', 'else', 'for', 'to',
+    'of', 'in', 'on', 'at', 'by', 'with', 'from', 'as', 'is', 'are', 'was',
+    'were', 'be', 'been', 'being', 'it', 'its', 'this', 'that', 'these',
+    'those', 'i', 'we', 'you', 'they', 'he', 'she', 'do', 'does', 'did',
+    'use', 'using', 'used', 'when', 'what', 'which', 'who', 'how', 'why',
+    'our', 'your', 'their', 'my', 'his', 'her', 'its', 'not', 'no', 'so',
+    'can', 'could', 'should', 'would', 'will', 'shall', 'may', 'might',
+    'into', 'onto', 'upon', 'via', 'per', 'about', 'over', 'under', 'again',
+]);
+/**
+ * Naive suffix stemmer — good enough for routing separability without a
+ * dependency. Handles the dominant mismatch classes seen in calibration:
+ * plurals ("interfaces"/"interface") and -ing forms ("tweaking"/"tweak").
+ */
+export function stem(token) {
+    if (token.length <= 4)
+        return token;
+    if (token.endsWith('ing') && token.length > 6)
+        return token.slice(0, -3);
+    if (token.endsWith('ed') && token.length > 5)
+        return token.slice(0, -2);
+    // "-es" after a sibilant: processes→process, classes→class (before plain -s)
+    if (/(s|x|ch|sh)es$/.test(token) && token.length > 5)
+        return token.slice(0, -2);
+    if (token.endsWith('s') && !token.endsWith('ss') && !token.endsWith('us')) {
+        return token.slice(0, -1);
+    }
+    return token;
+}
+/** Tokenize: lowercase, split on non-alphanumerics, stem, drop short + stopwords. */
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[^a-z0-9]+/)
+        .map(stem)
+        .filter((t) => t.length >= 2 && !STOPWORDS.has(t));
+}
+function l2Norm(vec) {
+    let sum = 0;
+    for (const v of vec.values())
+        sum += v * v;
+    return Math.sqrt(sum);
+}
+function cosine(a, aNorm, b, bNorm) {
+    if (aNorm === 0 || bNorm === 0)
+        return 0;
+    // Iterate the smaller vector for speed.
+    const [small, big] = a.size <= b.size ? [a, b] : [b, a];
+    let dot = 0;
+    for (const [term, w] of small) {
+        const other = big.get(term);
+        if (other !== undefined)
+            dot += w * other;
+    }
+    return dot / (aNorm * bNorm);
+}
+export class TfIdfIndex {
+    idf = new Map();
+    vectors = [];
+    norms = [];
+    /** Raw tokenized documents, kept for shared-token overlap analysis. */
+    docTokens = [];
+    constructor(documents) {
+        this.build(documents);
+    }
+    /** Distinct content tokens shared between the query and a document. */
+    sharedTokens(query, docIndex) {
+        const doc = this.docTokens[docIndex];
+        if (!doc)
+            return [];
+        const docSet = new Set(doc);
+        return [...new Set(tokenize(query))].filter((t) => docSet.has(t));
+    }
+    build(documents) {
+        const tokenized = documents.map((d) => tokenize(d));
+        this.docTokens = tokenized;
+        const docFreq = new Map();
+        for (const tokens of tokenized) {
+            for (const term of new Set(tokens)) {
+                docFreq.set(term, (docFreq.get(term) ?? 0) + 1);
+            }
+        }
+        const total = Math.max(documents.length, 1);
+        for (const [term, df] of docFreq) {
+            this.idf.set(term, Math.log(1 + total / df));
+        }
+        this.vectors = tokenized.map((tokens) => this.vectorize(tokens));
+        this.norms = this.vectors.map((v) => l2Norm(v));
+    }
+    vectorize(tokens) {
+        const termFreq = new Map();
+        for (const t of tokens)
+            termFreq.set(t, (termFreq.get(t) ?? 0) + 1);
+        const vec = new Map();
+        for (const [term, count] of termFreq) {
+            const idf = this.idf.get(term);
+            if (idf === undefined)
+                continue; // unseen term (query side)
+            vec.set(term, (1 + Math.log(count)) * idf);
+        }
+        return vec;
+    }
+    /** Cosine score of the query against every document, in document order. */
+    score(query) {
+        const qv = this.vectorize(tokenize(query));
+        const qn = l2Norm(qv);
+        return this.vectors.map((dv, i) => cosine(qv, qn, dv, this.norms[i]));
+    }
+    /** Index of the highest-scoring document, or -1 when all scores are 0. */
+    topIndex(query) {
+        const scores = this.score(query);
+        let best = -1;
+        let bestScore = 0;
+        for (let i = 0; i < scores.length; i++) {
+            if (scores[i] > bestScore) {
+                bestScore = scores[i];
+                best = i;
+            }
+        }
+        return { index: best, score: bestScore };
+    }
+}
+//# sourceMappingURL=tfidf.js.map

package/dist/evals/tfidf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.js","sourceRoot":"","sources":["../../src/evals/tfidf.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,qEAAqE;AACrE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI;IACvE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;IACtE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACnE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK;IACnE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IACpE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI;IACpE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO;IAClE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;CACxE,CAAC,CAAC;AAEH;;;;GAIG;AACH,MAAM,UAAU,IAAI,CAAC,KAAa;IAChC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzE,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxE,6EAA6E;IAC7E,IAAI,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,IAAI,CAAC;SACT,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,MAAM,CAAC,GAAwB;IACtC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE;QAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,MAAM,CACb,CAAsB,EACtB,KAAa,EACb,CAAsB,EACtB,KAAa;IAEb,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,wCAAwC;IACxC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,OAAO,UAAU;IACJ,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,OAAO,GAA+B,EAAE,CAAC;IACzC,KAAK,GAAa,EAAE,CAAC;IAC7B,uEAAuE;IAC/D,SAAS,GAAe,EAAE,CAAC;IAEnC,YAAY,SAAmB;QAC7B,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,uEAAuE;IACvE,YAAY,CAAC,KAAa,EAAE,QAAgB;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;IAEO,KAAK,CAAC,SAAmB;QAC/B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAEO,SAAS,CAAC,MAAgB;QAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS,CAAC,2BAA2B;YAC5D,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2EAA2E;IAC3E,KAAK,CAAC,KAAa;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,0EAA0E;IAC1E,QAAQ,CAAC,KAAa;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;gBAC1B,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,GAAG,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAC3C,CAAC;CACF"}

package/dist/review/prepass.d.ts

@@ -0,0 +1,88 @@
+/**
+ * DETERMINISTIC REVIEW PRE-PASS (uplift 0.2)
+ *
+ * A ruleset scanner that runs BEFORE the LLM reviewers in the parallel
+ * review protocol (open-code-review precedent: deterministic pipelines first,
+ * LLM second). Reviewers receive pre-filtered, line-anchored findings so
+ * their tokens go to judgment, not pattern-matching.
+ *
+ * Design stance: precision over recall. Every rule here fires on a pattern
+ * that is almost always worth a human/reviewer glance; ambiguous heuristics
+ * belong to the LLM reviewers, not to this pass. Findings are advisory input
+ * to review — the blocking behavior stays in the expert-review enforcer,
+ * which is unchanged.
+ */
+export type PrePassCategory = 'secrets' | 'injection' | 'error-handling' | 'concurrency' | 'sql';
+export type PrePassSeverity = 'high' | 'medium';
+export interface PrePassFinding {
+    rule: string;
+    category: PrePassCategory;
+    severity: PrePassSeverity;
+    file: string;
+    line: number;
+    snippet: string;
+    message: string;
+}
+interface LineRule {
+    name: string;
+    category: PrePassCategory;
+    severity: PrePassSeverity;
+    pattern: RegExp;
+    message: string;
+    /** When set, only files with one of these extensions are scanned. */
+    codeOnly?: boolean;
+}
+/**
+ * Line-anchored rules. Keep each one boringly precise — a finding that cries
+ * wolf trains reviewers to ignore the whole pass.
+ */
+export declare const LINE_RULES: LineRule[];
+/**
+ * Redact secret material from a finding snippet. The artifact's purpose is to
+ * be pasted into LLM reviewer prompts — a secrets scanner must not multiply
+ * copies of what it detects. The file:line anchor is enough for a reviewer
+ * to inspect the secret in place.
+ */
+export declare function redactSecrets(snippet: string): string;
+/** Scan one file's content. `file` is the repo-relative path used in findings. */
+export declare function scanFileContent(file: string, content: string): PrePassFinding[];
+export interface PrePassOptions {
+    /** Explicit repo-relative file list (default: changed files vs upstream). */
+    files?: string[];
+    projectDir?: string;
+}
+/** Resolve the target file list for a pre-pass run. */
+export declare function collectPrePassTargets(options: PrePassOptions): string[];
+/** Scan a resolved target list. */
+export declare function runPrePass(options: PrePassOptions): {
+    findings: PrePassFinding[];
+    filesScanned: string[];
+};
+/** Percent-encode branch to a filename slug — mirrors slug_for() in the
+ * expert_review_required enforcer exactly (the artifact must land where the
+ * enforcer looks). */
+export declare function branchSlug(branch: string): string;
+export interface PrePassArtifact {
+    ran_at: string;
+    head: string | null;
+    files_scanned: number;
+    finding_count: number;
+    findings: PrePassFinding[];
+}
+/**
+ * Write the pre-pass artifact to .uap/reviews/<branch-slug>.pre-pass.json.
+ *
+ * Deliberately a SIBLING of the review artifact (<slug>.json), not a block
+ * inside it: the expert-review enforcer treats the existence of <slug>.json
+ * as "a review happened", and every substantive check in it is conditional on
+ * keys the pre-pass never writes. A pre-pass-only <slug>.json would satisfy
+ * the blocking gate with zero reviewers — so this advisory pass must never
+ * create that file. Consolidation reads this sibling and merges its findings
+ * into the real artifact along with the verdict.
+ */
+export declare function writePrePassArtifact(projectDir: string, findings: PrePassFinding[], filesScanned: number): {
+    path: string;
+    artifact: PrePassArtifact;
+} | null;
+export {};
+//# sourceMappingURL=prepass.d.ts.map

package/dist/review/prepass.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prepass.d.ts","sourceRoot":"","sources":["../../src/review/prepass.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAeH,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,WAAW,GAAG,gBAAgB,GAAG,aAAa,GAAG,KAAK,CAAC;AACjG,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,QAAQ,CAAC;AAEhD,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,eAAe,CAAC;IAC1B,QAAQ,EAAE,eAAe,CAAC;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,UAAU,QAAQ;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,eAAe,CAAC;IAC1B,QAAQ,EAAE,eAAe,CAAC;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,qEAAqE;IACrE,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAID;;;GAGG;AACH,eAAO,MAAM,UAAU,EAAE,QAAQ,EAqKhC,CAAC;AAIF;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAOrD;AAQD,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,cAAc,EAAE,CA6B/E;AAwFD,MAAM,WAAW,cAAc;IAC7B,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,uDAAuD;AACvD,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,cAAc,GAAG,MAAM,EAAE,CA2BvE;AAED,mCAAmC;AACnC,wBAAgB,UAAU,CAAC,OAAO,EAAE,cAAc,GAAG;IACnD,QAAQ,EAAE,cAAc,EAAE,CAAC;IAC3B,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAgBA;AAED;;sBAEsB;AACtB,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEjD;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,cAAc,EAAE,CAAC;CAC5B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAClC,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,cAAc,EAAE,EAC1B,YAAY,EAAE,MAAM,GACnB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,eAAe,CAAA;CAAE,GAAG,IAAI,CAgCpD"}