@monoes/monomindcli 2.7.13 → 2.7.15

package/dist/src/knowledge/eval/network-guard.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Query-time network guard.
+ *
+ * The stop condition says "zero network calls at query time". This module does
+ * not *infer* that from reading code — it BLOCKS the network and records every
+ * attempt. If retrieval needs the network, queries fail loudly instead of
+ * quietly succeeding and leaving us to assert offline-ness we never tested.
+ *
+ * Honest limits, stated so nobody over-claims from this evidence:
+ *  - Coverage is layered, and the layers are not equally strong:
+ *      * `net.Socket.prototype.connect` / `tls.TLSSocket.prototype.connect` are
+ *        PROTOTYPE patches, so they bite no matter how the caller imported the
+ *        module. Every TCP client in Node funnels through them, including
+ *        undici (and therefore fetch), http, https and any npm HTTP library.
+ *        This is the layer that actually makes the claim true.
+ *      * `globalThis.fetch` is a global patch and equally universal.
+ *      * The module-level patches (http.request, dns.lookup, ...) only bite for
+ *        `require()` consumers: an ESM `import * as http` snapshots the
+ *        bindings at load time and cannot be reached afterwards. They are kept
+ *        as a second net, not relied on.
+ *  - A native addon opening a socket in C++ would bypass all of it, which is
+ *    why the baseline report also carries an out-of-process `lsof` check.
+ *  - It is installed around the query phase only. Ingest may legitimately fetch
+ *    an embedding model on first run; that is build time, not query time, and
+ *    is reported separately.
+ *
+ * @module v1/cli/knowledge/eval/network-guard
+ */
+export interface NetworkAttempt {
+    api: string;
+    target: string;
+    stack: string;
+}
+export interface NetworkGuard {
+    attempts: NetworkAttempt[];
+    /** APIs that could NOT be patched. A non-empty list downgrades the offline
+     *  claim from "proven" to "partial" — never silently ignored. */
+    unpatched: string[];
+    release(): void;
+}
+/**
+ * Installs the guard. Every blocked call throws, so any code path that needed
+ * the network surfaces as a failed query rather than a silent pass.
+ */
+export declare function installNetworkGuard(): NetworkGuard;
+//# sourceMappingURL=network-guard.d.ts.map

package/dist/src/knowledge/eval/network-guard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-guard.d.ts","sourceRoot":"","sources":["../../../../src/knowledge/eval/network-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAWH,MAAM,WAAW,cAAc;IAC7B,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,cAAc,EAAE,CAAC;IAC3B;qEACiE;IACjE,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,IAAI,IAAI,CAAC;CACjB;AAcD;;;GAGG;AACH,wBAAgB,mBAAmB,IAAI,YAAY,CAsDlD"}

package/dist/src/knowledge/eval/network-guard.js

@@ -0,0 +1,112 @@
+/**
+ * Query-time network guard.
+ *
+ * The stop condition says "zero network calls at query time". This module does
+ * not *infer* that from reading code — it BLOCKS the network and records every
+ * attempt. If retrieval needs the network, queries fail loudly instead of
+ * quietly succeeding and leaving us to assert offline-ness we never tested.
+ *
+ * Honest limits, stated so nobody over-claims from this evidence:
+ *  - Coverage is layered, and the layers are not equally strong:
+ *      * `net.Socket.prototype.connect` / `tls.TLSSocket.prototype.connect` are
+ *        PROTOTYPE patches, so they bite no matter how the caller imported the
+ *        module. Every TCP client in Node funnels through them, including
+ *        undici (and therefore fetch), http, https and any npm HTTP library.
+ *        This is the layer that actually makes the claim true.
+ *      * `globalThis.fetch` is a global patch and equally universal.
+ *      * The module-level patches (http.request, dns.lookup, ...) only bite for
+ *        `require()` consumers: an ESM `import * as http` snapshots the
+ *        bindings at load time and cannot be reached afterwards. They are kept
+ *        as a second net, not relied on.
+ *  - A native addon opening a socket in C++ would bypass all of it, which is
+ *    why the baseline report also carries an out-of-process `lsof` check.
+ *  - It is installed around the query phase only. Ingest may legitimately fetch
+ *    an embedding model on first run; that is build time, not query time, and
+ *    is reported separately.
+ *
+ * @module v1/cli/knowledge/eval/network-guard
+ */
+import { createRequire } from 'node:module';
+// Deliberately require() rather than `import * as http`. ESM namespace objects
+// are non-configurable, so assigning to them throws `Cannot redefine property`
+// — which is exactly how a network guard silently becomes decorative. The CJS
+// module objects for Node builtins ARE writable, which is how every HTTP
+// interception library works. A unit test asserts the guard actually blocks.
+const req = createRequire(import.meta.url);
+function describe(args) {
+    try {
+        const a = args[0];
+        if (typeof a === 'string')
+            return a;
+        if (a && typeof a === 'object') {
+            if (a.href)
+                return String(a.href);
+            if (a.hostname || a.host)
+                return String(a.hostname ?? a.host) + ':' + String(a.port ?? '');
+        }
+        return String(a);
+    }
+    catch {
+        return '<unprintable>';
+    }
+}
+/**
+ * Installs the guard. Every blocked call throws, so any code path that needed
+ * the network surfaces as a failed query rather than a silent pass.
+ */
+export function installNetworkGuard() {
+    const attempts = [];
+    const restores = [];
+    const block = (api) => (...args) => {
+        const err = new Error('[eval] BLOCKED network call at query time: ' + api + ' -> ' + describe(args));
+        attempts.push({ api, target: describe(args), stack: (err.stack ?? '').split('\n').slice(1, 8).join('\n') });
+        throw err;
+    };
+    /** Returns false when the property genuinely could not be replaced — the
+     *  caller turns that into a reported gap rather than a silent pass. */
+    const failures = [];
+    const patch = (obj, key, api) => {
+        if (!obj || typeof obj[key] !== 'function')
+            return;
+        const orig = obj[key];
+        try {
+            Object.defineProperty(obj, key, { value: block(api), writable: true, configurable: true });
+            restores.push(() => { try {
+                Object.defineProperty(obj, key, { value: orig, writable: true, configurable: true });
+            }
+            catch { /* best effort */ } });
+        }
+        catch {
+            failures.push(api);
+        }
+    };
+    const http = req('node:http');
+    const https = req('node:https');
+    const net = req('node:net');
+    const tls = req('node:tls');
+    const dns = req('node:dns');
+    const g = globalThis;
+    if (typeof g.fetch === 'function') {
+        const orig = g.fetch;
+        g.fetch = block('fetch');
+        restores.push(() => { g.fetch = orig; });
+    }
+    patch(http, 'request', 'http.request');
+    patch(http, 'get', 'http.get');
+    patch(https, 'request', 'https.request');
+    patch(https, 'get', 'https.get');
+    patch(net, 'connect', 'net.connect');
+    patch(net, 'createConnection', 'net.createConnection');
+    patch(net.Socket.prototype, 'connect', 'net.Socket.connect');
+    patch(tls, 'connect', 'tls.connect');
+    patch(dns, 'lookup', 'dns.lookup');
+    patch(dns, 'resolve', 'dns.resolve');
+    patch(dns.promises, 'lookup', 'dns.promises.lookup');
+    return {
+        attempts,
+        unpatched: failures,
+        release() { for (const r of restores.reverse())
+            r(); },
+    };
+}
+//# sourceMappingURL=network-guard.js.map

package/dist/src/knowledge/eval/network-guard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-guard.js","sourceRoot":"","sources":["../../../../src/knowledge/eval/network-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,+EAA+E;AAC/E,+EAA+E;AAC/E,8EAA8E;AAC9E,yEAAyE;AACzE,6EAA6E;AAC7E,MAAM,GAAG,GAAG,aAAa,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;AAgB3C,SAAS,QAAQ,CAAC,IAAe;IAC/B,IAAI,CAAC;QACH,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAQ,CAAC;QACzB,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,IAAI;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,eAAe,CAAC;IAAC,CAAC;AACrC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB;IACjC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAsB,EAAE,CAAC;IAEvC,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAe,EAAS,EAAE;QAC3D,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,6CAA6C,GAAG,GAAG,GAAG,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACrG,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5G,MAAM,GAAG,CAAC;IACZ,CAAC,CAAC;IAEF;2EACuE;IACvE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,GAAQ,EAAE,GAAW,EAAE,GAAW,EAAQ,EAAE;QACzD,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,UAAU;YAAE,OAAO;QACnD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;YAC3F,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;gBAAC,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrJ,CAAC;QAAC,MAAM,CAAC;YACP,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;IAE5B,MAAM,CAAC,GAAG,UAAiB,CAAC;IAC5B,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;QACrB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IACvC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAC/B,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;IACzC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;IACjC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACrC,KAAK,CAAC,GAAG,EAAE,kBAAkB,EAAE,sBAAsB,CAAC,CAAC;IACvD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;IAC7D,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACrC,KAAK,CAAC,GAAG,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACnC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACrC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,qBAAqB,CAAC,CAAC;IAErD,OAAO;QACL,QAAQ;QACR,SAAS,EAAE,QAAQ;QACnB,OAAO,KAAK,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE;YAAE,CAAC,EAAE,CAAC,CAAC,CAAC;KACvD,CAAC;AACJ,CAAC"}

package/dist/src/knowledge/eval/retrievers.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Retrievers under test, including the deliberately weak baselines.
+ *
+ * The weak baselines exist to answer one question the headline number cannot:
+ * how much of our score is the retrieval stack, and how much is a golden set
+ * so easy that keyword matching nearly solves it? A small gap between
+ * `bm25-only` and the real stack means the SET is uninformative, not that the
+ * stack is good. See Requirement C in the item-0 brief.
+ *
+ * @module v1/cli/knowledge/eval/retrievers
+ */
+export interface EvalChunk {
+    docId: string;
+    chunkIndex: number;
+    text: string;
+}
+export interface RawHit {
+    docId: string;
+    chunkIndex: number;
+    score: number;
+}
+export interface Retriever {
+    name: string;
+    description: string;
+    /** Must not make network calls. Returns chunk-level hits, best-first. */
+    search(query: string, limit: number): Promise<RawHit[]>;
+}
+export declare class Bm25Retriever implements Retriever {
+    private chunks;
+    name: string;
+    description: string;
+    private docs;
+    private df;
+    private avgLen;
+    constructor(chunks: EvalChunk[]);
+    search(query: string, limit: number): Promise<RawHit[]>;
+}
+export declare class RandomRetriever implements Retriever {
+    private seed;
+    name: string;
+    description: string;
+    private docIds;
+    constructor(chunks: EvalChunk[], seed?: string);
+    search(query: string, limit: number): Promise<RawHit[]>;
+}
+/** Wraps an arbitrary async search function (the real stack) as a Retriever. */
+export declare class FnRetriever implements Retriever {
+    name: string;
+    description: string;
+    private fn;
+    constructor(name: string, description: string, fn: (query: string, limit: number) => Promise<RawHit[]>);
+    search(query: string, limit: number): Promise<RawHit[]>;
+}
+export declare class RrfRetriever implements Retriever {
+    private children;
+    /** RRF smoothing constant. Standard values: 10–100. */
+    private rrfK;
+    name: string;
+    description: string;
+    constructor(children: Retriever[], 
+    /** RRF smoothing constant. Standard values: 10–100. */
+    rrfK: number, name?: string);
+    search(query: string, limit: number): Promise<RawHit[]>;
+}
+//# sourceMappingURL=retrievers.d.ts.map

package/dist/src/knowledge/eval/retrievers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrievers.d.ts","sourceRoot":"","sources":["../../../../src/knowledge/eval/retrievers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,MAAM;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,yEAAyE;IACzE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CACzD;AAQD,qBAAa,aAAc,YAAW,SAAS;IAQjC,OAAO,CAAC,MAAM;IAP1B,IAAI,SAAe;IACnB,WAAW,SAA0E;IAErF,OAAO,CAAC,IAAI,CAAkB;IAC9B,OAAO,CAAC,EAAE,CAA6B;IACvC,OAAO,CAAC,MAAM,CAAK;IAEnB,YAAoB,MAAM,EAAE,SAAS,EAAE,EAStC;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAyB5D;CACF;AAYD,qBAAa,eAAgB,YAAW,SAAS;IAMd,OAAO,CAAC,IAAI;IAL7C,IAAI,SAAY;IAChB,WAAW,SAAkE;IAE7E,OAAO,CAAC,MAAM,CAAW;IAEzB,YAAY,MAAM,EAAE,SAAS,EAAE,EAAU,IAAI,SAAsB,EAElE;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAe5D;CACF;AAED,gFAAgF;AAChF,qBAAa,WAAY,YAAW,SAAS;IAElC,IAAI,EAAE,MAAM;IACZ,WAAW,EAAE,MAAM;IAC1B,OAAO,CAAC,EAAE;IAHZ,YACS,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,EAClB,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,EAC7D;IACJ,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAkC;CAC1F;AAaD,qBAAa,YAAa,YAAW,SAAS;IAK1C,OAAO,CAAC,QAAQ;IAChB,uDAAuD;IACvD,OAAO,CAAC,IAAI;IANd,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IAEpB,YACU,QAAQ,EAAE,SAAS,EAAE;IAC7B,uDAAuD;IAC/C,IAAI,EAAE,MAAM,EACpB,IAAI,CAAC,EAAE,MAAM,EAKd;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAwC5D;CACF"}

package/dist/src/knowledge/eval/retrievers.js

@@ -0,0 +1,180 @@
+/**
+ * Retrievers under test, including the deliberately weak baselines.
+ *
+ * The weak baselines exist to answer one question the headline number cannot:
+ * how much of our score is the retrieval stack, and how much is a golden set
+ * so easy that keyword matching nearly solves it? A small gap between
+ * `bm25-only` and the real stack means the SET is uninformative, not that the
+ * stack is good. See Requirement C in the item-0 brief.
+ *
+ * @module v1/cli/knowledge/eval/retrievers
+ */
+import { contentTokens } from './metrics.js';
+// -- BM25 floor ------------------------------------------------------
+// Okapi BM25 with the standard k1=1.2, b=0.75. This is OUR OWN scorer, run
+// in-process over the same chunk set the dense index holds. It is NOT the
+// SQLite FTS5 implementation that item 1 will add — the two will differ, and
+// scoreboard rows must not treat them as interchangeable.
+export class Bm25Retriever {
+    chunks;
+    name = 'bm25-only';
+    description = 'Okapi BM25 (k1=1.2, b=0.75) over the same chunks, no dense component';
+    docs = [];
+    df = new Map();
+    avgLen = 0;
+    constructor(chunks) {
+        this.chunks = chunks;
+        for (const c of chunks) {
+            const toks = contentTokens(c.text);
+            this.docs.push(toks);
+            for (const t of new Set(toks))
+                this.df.set(t, (this.df.get(t) ?? 0) + 1);
+        }
+        this.avgLen = this.docs.length === 0
+            ? 0
+            : this.docs.reduce((a, d) => a + d.length, 0) / this.docs.length;
+    }
+    async search(query, limit) {
+        const k1 = 1.2, b = 0.75;
+        const N = this.docs.length;
+        const q = contentTokens(query);
+        const scored = [];
+        for (let i = 0; i < N; i++) {
+            const toks = this.docs[i];
+            if (toks.length === 0)
+                continue;
+            const tf = new Map();
+            for (const t of toks)
+                tf.set(t, (tf.get(t) ?? 0) + 1);
+            let score = 0;
+            for (const term of q) {
+                const f = tf.get(term);
+                if (!f)
+                    continue;
+                const n = this.df.get(term) ?? 0;
+                const idf = Math.log(1 + (N - n + 0.5) / (n + 0.5));
+                score += idf * ((f * (k1 + 1)) / (f + k1 * (1 - b + b * (toks.length / this.avgLen))));
+            }
+            if (score > 0) {
+                scored.push({ docId: this.chunks[i].docId, chunkIndex: this.chunks[i].chunkIndex, score });
+            }
+        }
+        scored.sort((a, b2) => b2.score - a.score);
+        return scored.slice(0, limit);
+    }
+}
+// -- Random floor ----------------------------------------------------
+// The true floor. Deterministic per (query, corpus) via a seeded PRNG so the
+// number is reproducible on a clean checkout rather than a fresh coin flip.
+function hashSeed(s) {
+    let h = 2166136261;
+    for (let i = 0; i < s.length; i++) {
+        h ^= s.charCodeAt(i);
+        h = Math.imul(h, 16777619);
+    }
+    return h >>> 0;
+}
+export class RandomRetriever {
+    seed;
+    name = 'random';
+    description = 'Deterministic seeded random document sample — the true floor';
+    docIds;
+    constructor(chunks, seed = 'second-brain-eval') {
+        this.seed = seed;
+        this.docIds = [...new Set(chunks.map(c => c.docId))].sort();
+    }
+    async search(query, limit) {
+        let state = hashSeed(this.seed + '::' + query);
+        const next = () => {
+            state ^= state << 13;
+            state >>>= 0;
+            state ^= state >> 17;
+            state ^= state << 5;
+            state >>>= 0;
+            return state / 0xffffffff;
+        };
+        const pool = [...this.docIds];
+        const out = [];
+        for (let i = 0; i < limit && pool.length > 0; i++) {
+            const idx = Math.floor(next() * pool.length) % pool.length;
+            out.push({ docId: pool.splice(idx, 1)[0], chunkIndex: 0, score: 1 - i / limit });
+        }
+        return out;
+    }
+}
+/** Wraps an arbitrary async search function (the real stack) as a Retriever. */
+export class FnRetriever {
+    name;
+    description;
+    fn;
+    constructor(name, description, fn) {
+        this.name = name;
+        this.description = description;
+        this.fn = fn;
+    }
+    search(query, limit) { return this.fn(query, limit); }
+}
+// -- RRF fusion -------------------------------------------------------
+// Reciprocal Rank Fusion: fusionScore(d) = Σ 1/(k + rank_i) for each
+// retriever i that returned document d. Equal weight across all sources.
+//
+// `score` on the returned RawHit is the RRF fusion score — a rank-derived
+// quantity, NOT a similarity and NOT comparable to cosine or BM25 scores.
+// Callers that need a per-source score must read the child retrievers
+// directly. This is the null hypothesis row: equal weight, no query
+// adaptation. Expected to fail the low-overlap gate because BM25 scores
+// 0.182 in that tercile and equal-weight fusion drags dense down.
+export class RrfRetriever {
+    children;
+    rrfK;
+    name;
+    description;
+    constructor(children, 
+    /** RRF smoothing constant. Standard values: 10–100. */
+    rrfK, name) {
+        this.children = children;
+        this.rrfK = rrfK;
+        this.name = name ?? `rrf-k${rrfK}`;
+        this.description =
+            `Reciprocal Rank Fusion (k=${rrfK}, equal weight) over [${children.map(c => c.name).join(', ')}]`;
+    }
+    async search(query, limit) {
+        // Over-fetch from each child: a document at rank 50 in one child and
+        // rank 1 in another should still be fusible, so fetch more than `limit`.
+        const childLimit = limit * 5;
+        const childResults = await Promise.all(this.children.map(c => c.search(query, childLimit)));
+        // Build per-document fusion scores. Track the best chunk per document
+        // from whichever child scored it highest (for the chunkIndex field).
+        const fusion = new Map();
+        for (const hits of childResults) {
+            // Dedupe by docId within this child before assigning ranks.
+            const seen = new Set();
+            let rank = 0;
+            for (const h of hits) {
+                if (seen.has(h.docId))
+                    continue;
+                seen.add(h.docId);
+                rank++;
+                const rrfScore = 1 / (this.rrfK + rank);
+                const existing = fusion.get(h.docId);
+                if (existing) {
+                    existing.score += rrfScore;
+                    if (h.score > existing.bestChildScore) {
+                        existing.chunkIndex = h.chunkIndex;
+                        existing.bestChildScore = h.score;
+                    }
+                }
+                else {
+                    fusion.set(h.docId, { score: rrfScore, chunkIndex: h.chunkIndex, bestChildScore: h.score });
+                }
+            }
+        }
+        const fused = [];
+        for (const [docId, v] of fusion) {
+            fused.push({ docId, chunkIndex: v.chunkIndex, score: v.score });
+        }
+        fused.sort((a, b) => b.score - a.score);
+        return fused.slice(0, limit);
+    }
+}
+//# sourceMappingURL=retrievers.js.map

package/dist/src/knowledge/eval/retrievers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrievers.js","sourceRoot":"","sources":["../../../../src/knowledge/eval/retrievers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAqB7C,uEAAuE;AACvE,2EAA2E;AAC3E,0EAA0E;AAC1E,6EAA6E;AAC7E,0DAA0D;AAE1D,MAAM,OAAO,aAAa;IAQJ,MAAM;IAP1B,IAAI,GAAG,WAAW,CAAC;IACnB,WAAW,GAAG,sEAAsE,CAAC;IAE7E,IAAI,GAAe,EAAE,CAAC;IACtB,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/B,MAAM,GAAG,CAAC,CAAC;IAEnB,YAAoB,MAAmB;sBAAnB,MAAM;QACxB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAClC,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACrE,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,KAAa;QACvC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAChC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACvB,IAAI,CAAC,CAAC;oBAAE,SAAS;gBACjB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;gBACpD,KAAK,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzF,CAAC;YACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;YAC7F,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;CACF;AAED,uEAAuE;AACvE,6EAA6E;AAC7E,4EAA4E;AAE5E,SAAS,QAAQ,CAAC,CAAS;IACzB,IAAI,CAAC,GAAG,UAAU,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAAC,CAAC;IACxF,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AAED,MAAM,OAAO,eAAe;IAMe,IAAI;IAL7C,IAAI,GAAG,QAAQ,CAAC;IAChB,WAAW,GAAG,8DAA8D,CAAC;IAErE,MAAM,CAAW;IAEzB,YAAY,MAAmB,EAAU,IAAI,GAAG,mBAAmB;oBAA1B,IAAI;QAC3C,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9D,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,KAAa;QACvC,IAAI,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC;YAAC,KAAK,MAAM,CAAC,CAAC;YACnC,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC;YAAC,KAAK,MAAM,CAAC,CAAC;YAClC,OAAO,KAAK,GAAG,UAAU,CAAC;QAC5B,CAAC,CAAC;QACF,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3D,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAED,gFAAgF;AAChF,MAAM,OAAO,WAAW;IAEb,IAAI;IACJ,WAAW;IACV,EAAE;IAHZ,YACS,IAAY,EACZ,WAAmB,EAClB,EAAuD;oBAFxD,IAAI;2BACJ,WAAW;kBACV,EAAE;IACT,CAAC;IACJ,MAAM,CAAC,KAAa,EAAE,KAAa,IAAuB,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;CAC1F;AAED,wEAAwE;AACxE,qEAAqE;AACrE,yEAAyE;AACzE,EAAE;AACF,0EAA0E;AAC1E,0EAA0E;AAC1E,sEAAsE;AACtE,oEAAoE;AACpE,wEAAwE;AACxE,kEAAkE;AAElE,MAAM,OAAO,YAAY;IAKb,QAAQ;IAER,IAAI;IANd,IAAI,CAAS;IACb,WAAW,CAAS;IAEpB,YACU,QAAqB;IAC7B,uDAAuD;IAC/C,IAAY,EACpB,IAAa;wBAHL,QAAQ;oBAER,IAAI;QAGZ,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAI,EAAE,CAAC;QACnC,IAAI,CAAC,WAAW;YACd,6BAA6B,IAAI,yBAAyB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACtG,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,KAAa;QACvC,qEAAqE;QACrE,yEAAyE;QACzE,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,GAAG,CACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CACpD,CAAC;QAEF,sEAAsE;QACtE,qEAAqE;QACrE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyE,CAAC;QAEhG,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,4DAA4D;YAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAChC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClB,IAAI,EAAE,CAAC;gBACP,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;gBACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC;oBAC3B,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;wBACtC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;wBACnC,QAAQ,CAAC,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC;oBACpC,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,cAAc,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC9F,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAClE,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;CACF"}

package/dist/src/knowledge/eval/signals.d.ts

@@ -0,0 +1,111 @@
+/**
+ * Pre-registered signals and the persistent regression suite.
+ *
+ * TWO DEFECTS IN THE SCOREBOARD THAT THIS FILE EXISTS TO FIX.
+ *
+ * 1. The scoreboard could only report NOVELTY, never REGRESSION. Every row was
+ *    a point measurement of a different item, and nothing was ever re-measured.
+ *    If item 1 caused item 4's win to evaporate, or an unguarded ingest path
+ *    quietly refilled the store, no row in an append-only table would ever show
+ *    it. Here, every row re-runs EVERY prior item's signal, so a win that decays
+ *    is visible on the next row rather than never.
+ *
+ * 2. Claims could be fitted after the fact. An item that shipped against
+ *    Recall@5 could be defended with "but MRR improved" once Recall@5 came in
+ *    flat. A signal must be declared BEFORE the run, with its direction and
+ *    magnitude, and `declaredAt` is what makes that checkable.
+ *
+ * The sealed dev/test split stops us fitting the DATA. This stops us fitting
+ * the CLAIM. They are different failure modes and need different machinery.
+ *
+ * @module v1/cli/knowledge/eval/signals
+ */
+import type { StoreProfile } from './harness.js';
+export interface PreRegisteredSignal {
+    /** Stable id, referenced by the scoreboard row that shipped the item. */
+    id: string;
+    /** Backlog item this signal belongs to. */
+    item: string;
+    /** ISO date the prediction was recorded. MUST predate the run that tests it —
+     *  a magnitude written down after seeing the number is not a prediction. */
+    declaredAt: string;
+    /** One sentence, in words, of what is claimed. */
+    claim: string;
+    /** Dotted path into the eval report, e.g.
+     *  'results.dense-only (gte-modernbert-base).scoreboard.recallAt5'. */
+    metric: string;
+    direction: 'increase' | 'decrease' | 'no-worse-than';
+    /** Declared before measuring. Compared against the CI half-width at scoring
+     *  time: a prediction smaller than the noise floor is not testable. */
+    expectedMagnitude: number;
+    /**
+     * Store profiles in which this signal is VISIBLE AT ALL. Item 4's superseded
+     * rows do not exist in a 'fresh' corpus, so scoring it there yields a flat
+     * number that means "cannot see", not "no effect". Getting this wrong is how
+     * a working item gets dropped.
+     */
+    visibleIn: StoreProfile[];
+    /** What would make this win decay. This is what populates the regression
+     *  suite — declared up front, not reconstructed later from a plan. */
+    decayCondition: string;
+    /** Value when the item shipped. Written ONCE, never edited. */
+    shipValue?: number;
+    /** Value before the item shipped. Written ONCE, never edited. */
+    baselineValue?: number;
+    /**
+     * The regime the reference value was measured under: corpus hash, golden-set
+     * version and split scheme. If the current run does not match, the reference
+     * describes a world that no longer exists and comparing against it is
+     * meaningless — the signal reports `stale-baseline`, NOT `DECAYED`.
+     *
+     * This exists because it fired on its first run: the item-1 gate's 0.500
+     * baseline was measured on the rank-based split, and the stability fix
+     * changed DEV membership. The suite dutifully reported DECAYED for a number
+     * that had not regressed at all — it had been re-measured over a different
+     * set. A false alarm is not harmless: it teaches people to ignore the alarm.
+     */
+    measuredUnder?: {
+        corpusHash?: string;
+        goldenSetVersion?: string;
+        splitScheme?: string;
+    };
+}
+/**
+ * Why a delta came out flat. Three different situations produce an identical
+ * null row and only one of them justifies dropping an item, so a null must say
+ * which it is. `cannot-see-mechanism` is the DEFAULT: claiming "no effect"
+ * requires first showing the harness could have seen an effect.
+ */
+export type NullVerdict = 'no-effect' | 'cannot-see-mechanism' | 'redundant' | 'undetermined';
+export interface SignalResult {
+    id: string;
+    item: string;
+    claim: string;
+    metric: string;
+    declaredAt: string;
+    currentValue: number | null;
+    shipValue: number | null;
+    baselineValue: number | null;
+    /** Movement since ship time. Negative for a signal declared 'increase' is decay. */
+    deltaSinceShip: number | null;
+    verdict: 'holding' | 'DECAYED' | 'cannot-see' | 'not-yet-shipped' | 'below-noise-floor' | 'stale-baseline';
+    nullVerdict?: NullVerdict;
+    note: string;
+}
+/** Read a dotted path, tolerating keys that themselves contain dots. */
+export declare function readMetric(report: unknown, dotted: string): number | null;
+/**
+ * THE PERSISTENT REGRESSION SUITE.
+ *
+ * Append one entry per shipped item, with `shipValue` and `baselineValue`
+ * frozen at ship time. Never edit an existing entry: an edited prediction is
+ * not a prediction. Every future scoreboard row re-scores all of them.
+ */
+export declare const SIGNAL_REGISTRY: PreRegisteredSignal[];
+export interface Regime {
+    corpusHash: string;
+    goldenSetVersion: string;
+    splitScheme: string;
+}
+export declare function scoreSignals(report: unknown, storeProfile: StoreProfile, noiseFloor: number, regime?: Regime): SignalResult[];
+//# sourceMappingURL=signals.d.ts.map

package/dist/src/knowledge/eval/signals.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"signals.d.ts","sourceRoot":"","sources":["../../../../src/knowledge/eval/signals.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEjD,MAAM,WAAW,mBAAmB;IAClC,yEAAyE;IACzE,EAAE,EAAE,MAAM,CAAC;IACX,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb;gFAC4E;IAC5E,UAAU,EAAE,MAAM,CAAC;IACnB,kDAAkD;IAClD,KAAK,EAAE,MAAM,CAAC;IACd;2EACuE;IACvE,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,UAAU,GAAG,UAAU,GAAG,eAAe,CAAC;IACrD;2EACuE;IACvE,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;OAKG;IACH,SAAS,EAAE,YAAY,EAAE,CAAC;IAC1B;0EACsE;IACtE,cAAc,EAAE,MAAM,CAAC;IACvB,+DAA+D;IAC/D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iEAAiE;IACjE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;;;;;;;OAWG;IACH,aAAa,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC1F;AAED;;;;;GAKG;AACH,MAAM,MAAM,WAAW,GACnB,WAAW,GACX,sBAAsB,GACtB,WAAW,GACX,cAAc,CAAC;AAEnB,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,oFAAoF;IACpF,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,OAAO,EAAE,SAAS,GAAG,SAAS,GAAG,YAAY,GAAG,iBAAiB,GAAG,mBAAmB,GAAG,gBAAgB,CAAC;IAC3G,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,IAAI,EAAE,MAAM,CAAC;CACd;AAED,wEAAwE;AACxE,wBAAgB,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAwBzE;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,EAAE,mBAAmB,EA+GhD,CAAC;AAEF,MAAM,WAAW,MAAM;IAAG,UAAU,EAAE,MAAM,CAAC;IAAC,gBAAgB,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE;AAE7F,wBAAgB,YAAY,CAC1B,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,YAAY,EAC1B,UAAU,EAAE,MAAM,EAClB,MAAM,CAAC,EAAE,MAAM,GACd,YAAY,EAAE,CAqEhB"}