@nexus-cortex/core 4.26.0

package/dist/training/DecisionPriorInjector.js

@@ -0,0 +1,34 @@
+/**
+ * DecisionPriorInjector — formats a <system-reminder> block from past
+ * decision stats so the orchestrator can prepend it to the next tool
+ * result, giving the model evidence-based priors about how a given
+ * (toolName, input) pattern has fared in past sessions.
+ *
+ * Only emits a reminder when at least one prior FAILED — pure-success
+ * histories produce no output (no actionable signal, just noise).
+ *
+ * When `recent` is supplied, the reminder body includes up to 3 specific
+ * recent outcomes (newest first) — matching the
+ * "up to 3 prior outcomes" pattern. Specific
+ * recent entries give the model far more actionable signal than the
+ * aggregate count alone (e.g. "the last 2 attempts both timed out").
+ */
+const RECENT_LIMIT = 3;
+export function formatPriorReminder(toolName, stats, recent) {
+    if (stats.failures === 0)
+        return null;
+    const ratio = `${stats.failures} ${stats.failures === 1 ? 'failure' : 'failures'} of ${stats.total} prior call${stats.total === 1 ? '' : 's'}`;
+    const errorPart = stats.lastError ? ` Last error: ${stats.lastError}.` : '';
+    let recentBlock = '';
+    if (recent && recent.length > 0) {
+        const top = recent.slice(0, RECENT_LIMIT);
+        const lines = top.map((d, i) => {
+            const status = d.success ? 'success' : 'failed';
+            const err = d.success || !d.errorSnippet ? '' : `: ${d.errorSnippet}`;
+            return ` ${i + 1}. ${status}${err}`;
+        });
+        recentBlock = ` Recent outcomes (newest first):\n${lines.join('\n')}`;
+    }
+    return (`<system-reminder>PRIOR DECISIONS for tool "${toolName}" with this exact input: ${ratio}.${errorPart}${recentBlock} Consider checking inputs or trying an alternate approach before retrying the same call.</system-reminder>\n\n`);
+}
+//# sourceMappingURL=DecisionPriorInjector.js.map

package/dist/training/DecisionPriorInjector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecisionPriorInjector.js","sourceRoot":"","sources":["../../src/training/DecisionPriorInjector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,MAAM,UAAU,mBAAmB,CACjC,QAAgB,EAChB,KAAoB,EACpB,MAAmB;IAEnB,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,MAAM,KAAK,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,OAAO,KAAK,CAAC,KAAK,cAAc,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IAC/I,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAE5E,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;YAChD,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,YAAY,EAAE,CAAC;YACtE,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM,GAAG,GAAG,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;QACH,WAAW,GAAG,qCAAqC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,OAAO,CACL,8CAA8C,QAAQ,4BAA4B,KAAK,IAAI,SAAS,GAAG,WAAW,gHAAgH,CACnO,CAAC;AACJ,CAAC"}

package/dist/training/DecisionStore.d.ts

@@ -0,0 +1,78 @@
+/**
+ * DecisionStore — append-only JSONL log of tool-call decisions for the
+ * lookup-before-action prior injection pattern (a lookup-before-action prior pipeline,
+ * simplified
+ * for the standalone nexus-cortex OSS harness which has no STDB dependency).
+ *
+ * Each line is a self-contained Decision record:
+ *   { ts, sessionId, toolName, inputHash, inputSummary, success, errorSnippet? }
+ *
+ * Lookup is O(N) over the file because the file is expected to stay small
+ * (one line per tool call). When this becomes a problem, swap the backend
+ * for a real index — the surface here (record/lookup/stats) is stable.
+ */
+export interface DecisionInput {
+    sessionId: string;
+    toolName: string;
+    /** Raw tool input. Hashed (key-stable) for matching. */
+    input: unknown;
+    success: boolean;
+    /** First ~200 chars of error message, if any. */
+    errorSnippet?: string;
+}
+export interface Decision {
+    ts: number;
+    sessionId: string;
+    toolName: string;
+    inputHash: string;
+    inputSummary: string;
+    success: boolean;
+    errorSnippet?: string;
+}
+export interface DecisionStats {
+    total: number;
+    successes: number;
+    failures: number;
+    /** Most recent failure's error snippet, when available. */
+    lastError?: string;
+}
+/**
+ * Stable, order-independent hash of a tool input value. Keys are sorted at
+ * every nesting level so `{a:1,b:2}` and `{b:2,a:1}` collide, but `[1,2,3]`
+ * and `[3,2,1]` do not (array order is semantically meaningful).
+ */
+export declare function stableInputHash(value: unknown): string;
+/** Default size cap before the store rotates (2 MB). Bounds both disk and
+ *  the per-lookup full-file scan. One rotated generation (`.1`) is kept so
+ *  priors survive the rotation boundary; total ≤ ~2×cap. */
+export declare const DEFAULT_MAX_STORE_BYTES: number;
+/** Resolve the rotation cap from `CORTEX_DECISIONS_MAX_BYTES`. Must be a
+ *  positive integer byte count; anything else (unset, zero, negative,
+ *  non-numeric, float) falls back to {@link DEFAULT_MAX_STORE_BYTES}. */
+export declare function resolveMaxStoreBytes(env?: NodeJS.ProcessEnv): number;
+export declare class DecisionStore {
+    private readonly storePath;
+    private readonly maxBytes;
+    constructor(storePath: string, maxBytes?: number);
+    /** Rotate main → `.1` (replacing any prior `.1`) once it exceeds the cap.
+     *  Single generation: bounds disk to ~2×cap and lookup cost to O(cap),
+     *  not O(history). Best-effort — a rotation failure must not break
+     *  recording. */
+    private rotateIfNeeded;
+    /** Append a decision. Idempotent at the filesystem level (mkdir -p). */
+    record(input: DecisionInput): Promise<void>;
+    /**
+     * Read all decisions matching the given (toolName, inputHash). Lines that
+     * fail to parse are skipped — the store is resilient to partial writes
+     * from crashes.
+     */
+    lookup(toolName: string, inputHash: string): Promise<Decision[]>;
+    /**
+     * Return the most recent matching decisions in reverse chronological
+     * order, capped at `limit`. Used by the prior-injector to surface
+     * specific recent outcomes rather than just aggregate counts.
+     */
+    recent(toolName: string, inputHash: string, limit: number): Promise<Decision[]>;
+    stats(toolName: string, inputHash: string): Promise<DecisionStats>;
+}
+//# sourceMappingURL=DecisionStore.d.ts.map

package/dist/training/DecisionStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecisionStore.d.ts","sourceRoot":"","sources":["../../src/training/DecisionStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAMH,MAAM,WAAW,aAAa;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,wDAAwD;IACxD,KAAK,EAAE,OAAO,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,iDAAiD;IACjD,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,2DAA2D;IAC3D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAKD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAGtD;AAoBD;;4DAE4D;AAC5D,eAAO,MAAM,uBAAuB,QAAkB,CAAC;AAEvD;;yEAEyE;AACzE,wBAAgB,oBAAoB,CAClC,GAAG,GAAE,MAAM,CAAC,UAAwB,GACnC,MAAM,CAKR;AAED,qBAAa,aAAa;IAEtB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ;gBADR,SAAS,EAAE,MAAM,EACjB,QAAQ,GAAE,MAA+B;IAG5D;;;qBAGiB;YACH,cAAc;IAU5B,wEAAwE;IAClE,MAAM,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAmBjD;;;;OAIG;IACG,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IA+BtE;;;;OAIG;IACG,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAO/E,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC;CAmBzE"}

package/dist/training/DecisionStore.js

@@ -0,0 +1,171 @@
+/**
+ * DecisionStore — append-only JSONL log of tool-call decisions for the
+ * lookup-before-action prior injection pattern (a lookup-before-action prior pipeline,
+ * simplified
+ * for the standalone nexus-cortex OSS harness which has no STDB dependency).
+ *
+ * Each line is a self-contained Decision record:
+ *   { ts, sessionId, toolName, inputHash, inputSummary, success, errorSnippet? }
+ *
+ * Lookup is O(N) over the file because the file is expected to stay small
+ * (one line per tool call). When this becomes a problem, swap the backend
+ * for a real index — the surface here (record/lookup/stats) is stable.
+ */
+import * as fs from 'fs/promises';
+import * as path from 'path';
+import { createHash } from 'crypto';
+const MAX_INPUT_SUMMARY = 300;
+const MAX_ERROR_SNIPPET = 200;
+/**
+ * Stable, order-independent hash of a tool input value. Keys are sorted at
+ * every nesting level so `{a:1,b:2}` and `{b:2,a:1}` collide, but `[1,2,3]`
+ * and `[3,2,1]` do not (array order is semantically meaningful).
+ */
+export function stableInputHash(value) {
+    const canonical = canonicalJSON(value);
+    return createHash('sha256').update(canonical).digest('hex').slice(0, 32);
+}
+function canonicalJSON(value) {
+    if (value === null || typeof value !== 'object') {
+        return JSON.stringify(value);
+    }
+    if (Array.isArray(value)) {
+        return '[' + value.map(canonicalJSON).join(',') + ']';
+    }
+    const keys = Object.keys(value).sort();
+    const parts = keys.map((k) => JSON.stringify(k) + ':' + canonicalJSON(value[k]));
+    return '{' + parts.join(',') + '}';
+}
+function truncate(s, max) {
+    return s.length <= max ? s : s.slice(0, max) + '…';
+}
+/** Default size cap before the store rotates (2 MB). Bounds both disk and
+ *  the per-lookup full-file scan. One rotated generation (`.1`) is kept so
+ *  priors survive the rotation boundary; total ≤ ~2×cap. */
+export const DEFAULT_MAX_STORE_BYTES = 2 * 1024 * 1024;
+/** Resolve the rotation cap from `CORTEX_DECISIONS_MAX_BYTES`. Must be a
+ *  positive integer byte count; anything else (unset, zero, negative,
+ *  non-numeric, float) falls back to {@link DEFAULT_MAX_STORE_BYTES}. */
+export function resolveMaxStoreBytes(env = process.env) {
+    const raw = env.CORTEX_DECISIONS_MAX_BYTES?.trim();
+    if (!raw || !/^\d+$/.test(raw))
+        return DEFAULT_MAX_STORE_BYTES;
+    const n = Number(raw);
+    return Number.isInteger(n) && n > 0 ? n : DEFAULT_MAX_STORE_BYTES;
+}
+export class DecisionStore {
+    storePath;
+    maxBytes;
+    constructor(storePath, maxBytes = resolveMaxStoreBytes()) {
+        this.storePath = storePath;
+        this.maxBytes = maxBytes;
+    }
+    /** Rotate main → `.1` (replacing any prior `.1`) once it exceeds the cap.
+     *  Single generation: bounds disk to ~2×cap and lookup cost to O(cap),
+     *  not O(history). Best-effort — a rotation failure must not break
+     *  recording. */
+    async rotateIfNeeded() {
+        try {
+            const { size } = await fs.stat(this.storePath);
+            if (size <= this.maxBytes)
+                return;
+            await fs.rename(this.storePath, this.storePath + '.1'); // replaces .1
+        }
+        catch {
+            /* stat ENOENT or rename race — non-fatal */
+        }
+    }
+    /** Append a decision. Idempotent at the filesystem level (mkdir -p). */
+    async record(input) {
+        const decision = {
+            ts: Date.now(),
+            sessionId: input.sessionId,
+            toolName: input.toolName,
+            inputHash: stableInputHash(input.input),
+            inputSummary: truncate(canonicalJSON(input.input), MAX_INPUT_SUMMARY),
+            success: input.success,
+            ...(input.errorSnippet
+                ? { errorSnippet: truncate(input.errorSnippet, MAX_ERROR_SNIPPET) }
+                : {}),
+        };
+        await fs.mkdir(path.dirname(this.storePath), { recursive: true });
+        // Rotate BEFORE appending so the main file always exists (with at least
+        // the just-written record) when record() returns — no empty window.
+        await this.rotateIfNeeded();
+        await fs.appendFile(this.storePath, JSON.stringify(decision) + '\n', 'utf-8');
+    }
+    /**
+     * Read all decisions matching the given (toolName, inputHash). Lines that
+     * fail to parse are skipped — the store is resilient to partial writes
+     * from crashes.
+     */
+    async lookup(toolName, inputHash) {
+        // Read rotated `.1` (older) THEN main (newer) so combined order stays
+        // oldest→newest, which `recent()` relies on. Bounded to ≤ ~2×cap.
+        const readMaybe = async (p) => {
+            try {
+                return await fs.readFile(p, 'utf-8');
+            }
+            catch (err) {
+                if (err.code === 'ENOENT')
+                    return '';
+                throw err;
+            }
+        };
+        const rotated = await readMaybe(this.storePath + '.1');
+        const main = await readMaybe(this.storePath);
+        const raw = rotated + (rotated && !rotated.endsWith('\n') ? '\n' : '') + main;
+        if (!raw)
+            return [];
+        const out = [];
+        for (const line of raw.split('\n')) {
+            if (!line.trim())
+                continue;
+            let parsed;
+            try {
+                parsed = JSON.parse(line);
+            }
+            catch {
+                continue;
+            }
+            if (parsed.toolName === toolName && parsed.inputHash === inputHash) {
+                out.push(parsed);
+            }
+        }
+        return out;
+    }
+    /**
+     * Return the most recent matching decisions in reverse chronological
+     * order, capped at `limit`. Used by the prior-injector to surface
+     * specific recent outcomes rather than just aggregate counts.
+     */
+    async recent(toolName, inputHash, limit) {
+        if (limit <= 0)
+            return [];
+        const all = await this.lookup(toolName, inputHash);
+        // `lookup` returns in file order (oldest first). Reverse and slice.
+        return all.slice().reverse().slice(0, limit);
+    }
+    async stats(toolName, inputHash) {
+        const hits = await this.lookup(toolName, inputHash);
+        let lastError;
+        let successes = 0;
+        let failures = 0;
+        for (const h of hits) {
+            if (h.success)
+                successes++;
+            else {
+                failures++;
+                if (h.errorSnippet)
+                    lastError = h.errorSnippet;
+            }
+        }
+        return {
+            total: hits.length,
+            successes,
+            failures,
+            ...(lastError ? { lastError } : {}),
+        };
+    }
+}
+//# sourceMappingURL=DecisionStore.js.map

package/dist/training/DecisionStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecisionStore.js","sourceRoot":"","sources":["../../src/training/DecisionStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,MAAM,aAAa,CAAC;AAClC,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AA8BpC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAc;IAC5C,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED,SAAS,aAAa,CAAC,KAAc;IACnC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACxD,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,CAAC,IAAI,EAAE,CAAC;IAClE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,aAAa,CAAE,KAAiC,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;IACF,OAAO,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;AACrC,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS,EAAE,GAAW;IACtC,OAAO,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC;AACrD,CAAC;AAED;;4DAE4D;AAC5D,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAEvD;;yEAEyE;AACzE,MAAM,UAAU,oBAAoB,CAClC,MAAyB,OAAO,CAAC,GAAG;IAEpC,MAAM,GAAG,GAAG,GAAG,CAAC,0BAA0B,EAAE,IAAI,EAAE,CAAC;IACnD,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,uBAAuB,CAAC;IAC/D,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC;AACpE,CAAC;AAED,MAAM,OAAO,aAAa;IAEL;IACA;IAFnB,YACmB,SAAiB,EACjB,WAAmB,oBAAoB,EAAE;QADzC,cAAS,GAAT,SAAS,CAAQ;QACjB,aAAQ,GAAR,QAAQ,CAAiC;IACzD,CAAC;IAEJ;;;qBAGiB;IACT,KAAK,CAAC,cAAc;QAC1B,IAAI,CAAC;YACH,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC/C,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAAE,OAAO;YAClC,MAAM,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,cAAc;QACxE,CAAC;QAAC,MAAM,CAAC;YACP,4CAA4C;QAC9C,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,KAAK,CAAC,MAAM,CAAC,KAAoB;QAC/B,MAAM,QAAQ,GAAa;YACzB,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE;YACd,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,SAAS,EAAE,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC;YACvC,YAAY,EAAE,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,iBAAiB,CAAC;YACrE,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,GAAG,CAAC,KAAK,CAAC,YAAY;gBACpB,CAAC,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,KAAK,CAAC,YAAY,EAAE,iBAAiB,CAAC,EAAE;gBACnE,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;QACF,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAClE,wEAAwE;QACxE,oEAAoE;QACpE,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;QAC5B,MAAM,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,MAAM,CAAC,QAAgB,EAAE,SAAiB;QAC9C,sEAAsE;QACtE,kEAAkE;QAClE,MAAM,SAAS,GAAG,KAAK,EAAE,CAAS,EAAmB,EAAE;YACrD,IAAI,CAAC;gBACH,OAAO,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACvC,CAAC;YAAC,OAAO,GAAQ,EAAE,CAAC;gBAClB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;oBAAE,OAAO,EAAE,CAAC;gBACrC,MAAM,GAAG,CAAC;YACZ,CAAC;QACH,CAAC,CAAC;QACF,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAC9E,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,CAAC;QACpB,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,SAAS;YAC3B,IAAI,MAAgB,CAAC;YACrB,IAAI,CAAC;gBACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,MAAM,CAAC,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,MAAM,CAAC,QAAgB,EAAE,SAAiB,EAAE,KAAa;QAC7D,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACnD,oEAAoE;QACpE,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,QAAgB,EAAE,SAAiB;QAC7C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACpD,IAAI,SAA6B,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,OAAO;gBAAE,SAAS,EAAE,CAAC;iBACtB,CAAC;gBACJ,QAAQ,EAAE,CAAC;gBACX,IAAI,CAAC,CAAC,YAAY;oBAAE,SAAS,GAAG,CAAC,CAAC,YAAY,CAAC;YACjD,CAAC;QACH,CAAC;QACD,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,SAAS;YACT,QAAQ;YACR,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpC,CAAC;IACJ,CAAC;CACF"}

package/dist/training/ExperimentLedger.d.ts

@@ -0,0 +1,138 @@
+/**
+ * ExperimentLedger — the keep/discard decision record for auto-research.
+ *
+ * One auto-research *unit* = a candidate harness version (a worktree branch) tested
+ * against a base version across a set of fixed-eval tasks. This ledger records the
+ * decision: did the candidate beat the base by a statistically real margin, or was
+ * the apparent improvement noise? That decision — `keep` | `discard` | `pending` —
+ * is the API the swarm (Layer 2) consumes before any autonomous merge.
+ *
+ * OVERFITTING GUARD (load-bearing): the decision is made from `split:'train'`
+ * benchmark records only; `split:'holdout'` records confirm generalization and are
+ * NEVER the basis for keep/discard. The statistical fields (pValue/ciLow/ciHigh/
+ * fwerAdjusted) come from the Monte-Carlo gate (AutoResearchStats) — a raw `delta>0`
+ * must NEVER set decision='keep'. A recursive loop fed by raw deltas overfits to
+ * noise; that is the entire failure mode this layer exists to prevent.
+ *
+ * Store: append-only JSONL at `.cortex/experiments.jsonl`. Latest snapshot per
+ * `experimentTag` wins; never rewritten in place (concurrent-safe for two agents
+ * sharing the tree).
+ *
+ * --- STDB PORTABILITY (the Layer-3 integration contract) ---
+ * This schema is deliberately shaped to map 1:1 onto SpacetimeDB tables. STDB
+ * columns must be flat scalars (nested arrays become child tables), so:
+ *   - `ExperimentRecord` (minus `results`)  -> table `experiment` (flat header)
+ *   - `ExperimentTaskResult[]` (`results`)   -> table `experiment_task_result` (child)
+ * The two are joined by `experimentTag`. Locally we embed `results[]` in the JSON
+ * line for convenience; the nexus side splits it into the child table on ingest.
+ * Keep these field lists in sync with `cortex-autoresearch-swarm-port.md`.
+ */
+export type ExperimentDecision = 'keep' | 'discard' | 'pending';
+/**
+ * Per-task base-vs-candidate comparison. One row per fixed-eval task in the
+ * experiment. STDB child table `experiment_task_result` (joined by experimentTag).
+ */
+export interface ExperimentTaskResult {
+    /** join key back to the parent experiment (denormalized for the STDB child table). */
+    experimentTag: string;
+    /** the comparability key — same task across base and candidate harness versions. */
+    taskFingerprint: string;
+    /** mean composite/qualitative score on the BASE harness version (split='train'). */
+    baseScore: number;
+    /** mean composite/qualitative score on the CANDIDATE harness version (split='train'). */
+    candScore: number;
+    /** candScore - baseScore. Convenience; recomputed on write so it never drifts. */
+    delta: number;
+    /** number of base-version runs aggregated into baseScore (n>=2 for significance). */
+    baseN: number;
+    /** number of candidate-version runs aggregated into candScore. */
+    candN: number;
+}
+/**
+ * The experiment header — one keep/discard decision. STDB table `experiment`.
+ * Everything here is a flat scalar EXCEPT `results` (which STDB splits out).
+ */
+export interface ExperimentRecord {
+    /** = swarm-member id. Stable key; latest snapshot per tag wins. */
+    experimentTag: string;
+    /** harness git ref the candidate is measured against (the control). */
+    baseRef: string;
+    /** harness git ref under test (the candidate / worktree HEAD). */
+    candidateRef: string;
+    /** worktree branch name the experiment runs on. */
+    branch: string;
+    /** the gate's verdict. 'pending' until the Monte-Carlo gate has enough runs. */
+    decision: ExperimentDecision;
+    /** commit the candidate was merged at, once kept + verified on held-out. */
+    mergedCommit?: string;
+    /** human/agent-readable rationale (which deficiency, why kept/discarded). */
+    reason?: string;
+    /** total benchmark runs feeding this decision (sum across tasks/arms). */
+    nRuns: number;
+    /** permutation-test p-value from the Monte-Carlo gate (lower = more real). */
+    pValue?: number;
+    /** bootstrap CI lower bound on the aggregate delta. */
+    ciLow?: number;
+    /** bootstrap CI upper bound on the aggregate delta. */
+    ciHigh?: number;
+    /** true once the p-value/CI has been corrected for the swarm's family-wise
+     *  error rate (N parallel experiments). A 'keep' is only trustworthy when this
+     *  is true — it's the multiple-comparisons guard at swarm scale. */
+    fwerAdjusted?: boolean;
+    /** deficiency id (ResearchBacklog) this experiment addresses, if any. */
+    deficiencyId?: string;
+    /** which benchmark lens produced the underlying records (cortex-bench|swebench|…). */
+    benchmarkSource?: string;
+    /** per-task comparisons. STDB: this array -> `experiment_task_result` child rows. */
+    results: ExperimentTaskResult[];
+    createdAt: string;
+    updatedAt: string;
+}
+export interface NewExperiment {
+    experimentTag: string;
+    baseRef: string;
+    candidateRef: string;
+    branch: string;
+    deficiencyId?: string;
+    benchmarkSource?: string;
+    reason?: string;
+    results?: ExperimentTaskResult[];
+}
+/** Fields the Monte-Carlo gate writes back onto an experiment when it decides. */
+export interface DecisionUpdate {
+    decision: ExperimentDecision;
+    pValue?: number;
+    ciLow?: number;
+    ciHigh?: number;
+    fwerAdjusted?: boolean;
+    nRuns?: number;
+    reason?: string;
+    mergedCommit?: string;
+}
+export declare class ExperimentLedger {
+    private readonly storePath;
+    constructor(projectRoot: string);
+    private append;
+    /** Current state = latest snapshot per experimentTag (append-only; last write wins). */
+    list(opts?: {
+        decision?: ExperimentDecision | ExperimentDecision[];
+    }): ExperimentRecord[];
+    get(experimentTag: string): ExperimentRecord | undefined;
+    /** Open a new experiment (or re-snapshot an existing tag). Starts 'pending' —
+     *  a decision is NEVER set at creation; only the Monte-Carlo gate decides. */
+    open(e: NewExperiment): ExperimentRecord;
+    /** Replace the per-task comparison set (e.g. after compareVersions runs). */
+    setResults(experimentTag: string, results: ExperimentTaskResult[]): ExperimentRecord | undefined;
+    /** Record the Monte-Carlo gate's verdict. This is the ONLY path that sets a
+     *  non-'pending' decision — keeps the statistical discipline in one place. */
+    decide(experimentTag: string, d: DecisionUpdate): ExperimentRecord | undefined;
+    /** Experiments awaiting a decision — what the gate processes next. */
+    pending(): ExperimentRecord[];
+    /**
+     * Flatten all experiments' per-task rows into the STDB `experiment_task_result`
+     * shape. The nexus Layer-3 ingest consumes exactly this — header rows from
+     * `list()`, child rows from here.
+     */
+    allTaskResults(): ExperimentTaskResult[];
+}
+//# sourceMappingURL=ExperimentLedger.d.ts.map

package/dist/training/ExperimentLedger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExperimentLedger.d.ts","sourceRoot":"","sources":["../../src/training/ExperimentLedger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAKH,MAAM,MAAM,kBAAkB,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS,CAAC;AAEhE;;;GAGG;AACH,MAAM,WAAW,oBAAoB;IACnC,sFAAsF;IACtF,aAAa,EAAE,MAAM,CAAC;IACtB,oFAAoF;IACpF,eAAe,EAAE,MAAM,CAAC;IACxB,oFAAoF;IACpF,SAAS,EAAE,MAAM,CAAC;IAClB,yFAAyF;IACzF,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,KAAK,EAAE,MAAM,CAAC;IACd,qFAAqF;IACrF,KAAK,EAAE,MAAM,CAAC;IACd,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,mEAAmE;IACnE,aAAa,EAAE,MAAM,CAAC;IACtB,uEAAuE;IACvE,OAAO,EAAE,MAAM,CAAC;IAChB,kEAAkE;IAClE,YAAY,EAAE,MAAM,CAAC;IACrB,mDAAmD;IACnD,MAAM,EAAE,MAAM,CAAC;IACf,gFAAgF;IAChF,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,4EAA4E;IAC5E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,6EAA6E;IAC7E,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,0EAA0E;IAC1E,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,uDAAuD;IACvD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,uDAAuD;IACvD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;wEAEoE;IACpE,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,yEAAyE;IACzE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,sFAAsF;IACtF,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,qFAAqF;IACrF,OAAO,EAAE,oBAAoB,EAAE,CAAC;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,aAAa;IAC5B,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,OAAO,CAAC,EAAE,oBAAoB,EAAE,CAAC;CAClC;AAED,kFAAkF;AAClF,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAgBD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAEvB,WAAW,EAAE,MAAM;IAI/B,OAAO,CAAC,MAAM;IAKd,wFAAwF;IACxF,IAAI,CAAC,IAAI,GAAE;QAAE,QAAQ,CAAC,EAAE,kBAAkB,GAAG,kBAAkB,EAAE,CAAA;KAAO,GAAG,gBAAgB,EAAE;IAmB7F,GAAG,CAAC,aAAa,EAAE,MAAM,GAAG,gBAAgB,GAAG,SAAS;IAIxD;kFAC8E;IAC9E,IAAI,CAAC,CAAC,EAAE,aAAa,GAAG,gBAAgB;IA2BxC,6EAA6E;IAC7E,UAAU,CAAC,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,oBAAoB,EAAE,GAAG,gBAAgB,GAAG,SAAS;IAchG;kFAC8E;IAC9E,MAAM,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC,EAAE,cAAc,GAAG,gBAAgB,GAAG,SAAS;IAmB9E,sEAAsE;IACtE,OAAO,IAAI,gBAAgB,EAAE;IAI7B;;;;OAIG;IACH,cAAc,IAAI,oBAAoB,EAAE;CAGzC"}

package/dist/training/ExperimentLedger.js

@@ -0,0 +1,160 @@
+/**
+ * ExperimentLedger — the keep/discard decision record for auto-research.
+ *
+ * One auto-research *unit* = a candidate harness version (a worktree branch) tested
+ * against a base version across a set of fixed-eval tasks. This ledger records the
+ * decision: did the candidate beat the base by a statistically real margin, or was
+ * the apparent improvement noise? That decision — `keep` | `discard` | `pending` —
+ * is the API the swarm (Layer 2) consumes before any autonomous merge.
+ *
+ * OVERFITTING GUARD (load-bearing): the decision is made from `split:'train'`
+ * benchmark records only; `split:'holdout'` records confirm generalization and are
+ * NEVER the basis for keep/discard. The statistical fields (pValue/ciLow/ciHigh/
+ * fwerAdjusted) come from the Monte-Carlo gate (AutoResearchStats) — a raw `delta>0`
+ * must NEVER set decision='keep'. A recursive loop fed by raw deltas overfits to
+ * noise; that is the entire failure mode this layer exists to prevent.
+ *
+ * Store: append-only JSONL at `.cortex/experiments.jsonl`. Latest snapshot per
+ * `experimentTag` wins; never rewritten in place (concurrent-safe for two agents
+ * sharing the tree).
+ *
+ * --- STDB PORTABILITY (the Layer-3 integration contract) ---
+ * This schema is deliberately shaped to map 1:1 onto SpacetimeDB tables. STDB
+ * columns must be flat scalars (nested arrays become child tables), so:
+ *   - `ExperimentRecord` (minus `results`)  -> table `experiment` (flat header)
+ *   - `ExperimentTaskResult[]` (`results`)   -> table `experiment_task_result` (child)
+ * The two are joined by `experimentTag`. Locally we embed `results[]` in the JSON
+ * line for convenience; the nexus side splits it into the child table on ingest.
+ * Keep these field lists in sync with `cortex-autoresearch-swarm-port.md`.
+ */
+import * as fs from 'fs';
+import * as path from 'path';
+const STORE_RELATIVE_PATH = path.join('.cortex', 'experiments.jsonl');
+function normalizeResults(experimentTag, results = []) {
+    return results.map(r => ({
+        experimentTag,
+        taskFingerprint: r.taskFingerprint,
+        baseScore: r.baseScore,
+        candScore: r.candScore,
+        delta: Math.round((r.candScore - r.baseScore) * 1000) / 1000,
+        baseN: r.baseN,
+        candN: r.candN,
+    }));
+}
+export class ExperimentLedger {
+    storePath;
+    constructor(projectRoot) {
+        this.storePath = path.join(projectRoot, STORE_RELATIVE_PATH);
+    }
+    append(rec) {
+        fs.mkdirSync(path.dirname(this.storePath), { recursive: true });
+        fs.appendFileSync(this.storePath, JSON.stringify(rec) + '\n', 'utf8');
+    }
+    /** Current state = latest snapshot per experimentTag (append-only; last write wins). */
+    list(opts = {}) {
+        let raw = '';
+        try {
+            raw = fs.readFileSync(this.storePath, 'utf8');
+        }
+        catch {
+            return [];
+        }
+        const byTag = new Map();
+        for (const line of raw.split('\n')) {
+            if (!line.trim())
+                continue;
+            try {
+                const r = JSON.parse(line);
+                if (r && typeof r.experimentTag === 'string')
+                    byTag.set(r.experimentTag, r);
+            }
+            catch { /* skip corrupt line */ }
+        }
+        let out = [...byTag.values()];
+        if (opts.decision) {
+            const want = Array.isArray(opts.decision) ? opts.decision : [opts.decision];
+            out = out.filter(r => want.includes(r.decision));
+        }
+        return out.sort((a, b) => b.updatedAt.localeCompare(a.updatedAt));
+    }
+    get(experimentTag) {
+        return this.list().find(r => r.experimentTag === experimentTag);
+    }
+    /** Open a new experiment (or re-snapshot an existing tag). Starts 'pending' —
+     *  a decision is NEVER set at creation; only the Monte-Carlo gate decides. */
+    open(e) {
+        const existing = this.get(e.experimentTag);
+        const now = new Date().toISOString();
+        const results = normalizeResults(e.experimentTag, e.results ?? existing?.results ?? []);
+        const rec = {
+            experimentTag: e.experimentTag,
+            baseRef: e.baseRef,
+            candidateRef: e.candidateRef,
+            branch: e.branch,
+            decision: existing?.decision ?? 'pending',
+            mergedCommit: existing?.mergedCommit,
+            reason: e.reason ?? existing?.reason,
+            nRuns: existing?.nRuns ?? results.reduce((s, r) => s + r.baseN + r.candN, 0),
+            pValue: existing?.pValue,
+            ciLow: existing?.ciLow,
+            ciHigh: existing?.ciHigh,
+            fwerAdjusted: existing?.fwerAdjusted,
+            deficiencyId: e.deficiencyId ?? existing?.deficiencyId,
+            benchmarkSource: e.benchmarkSource ?? existing?.benchmarkSource,
+            results,
+            createdAt: existing?.createdAt ?? now,
+            updatedAt: now,
+        };
+        this.append(rec);
+        return rec;
+    }
+    /** Replace the per-task comparison set (e.g. after compareVersions runs). */
+    setResults(experimentTag, results) {
+        const cur = this.get(experimentTag);
+        if (!cur)
+            return undefined;
+        const norm = normalizeResults(experimentTag, results);
+        const merged = {
+            ...cur,
+            results: norm,
+            nRuns: norm.reduce((s, r) => s + r.baseN + r.candN, 0),
+            updatedAt: new Date().toISOString(),
+        };
+        this.append(merged);
+        return merged;
+    }
+    /** Record the Monte-Carlo gate's verdict. This is the ONLY path that sets a
+     *  non-'pending' decision — keeps the statistical discipline in one place. */
+    decide(experimentTag, d) {
+        const cur = this.get(experimentTag);
+        if (!cur)
+            return undefined;
+        const merged = {
+            ...cur,
+            decision: d.decision,
+            pValue: d.pValue ?? cur.pValue,
+            ciLow: d.ciLow ?? cur.ciLow,
+            ciHigh: d.ciHigh ?? cur.ciHigh,
+            fwerAdjusted: d.fwerAdjusted ?? cur.fwerAdjusted,
+            nRuns: d.nRuns ?? cur.nRuns,
+            reason: d.reason ?? cur.reason,
+            mergedCommit: d.mergedCommit ?? cur.mergedCommit,
+            updatedAt: new Date().toISOString(),
+        };
+        this.append(merged);
+        return merged;
+    }
+    /** Experiments awaiting a decision — what the gate processes next. */
+    pending() {
+        return this.list({ decision: 'pending' });
+    }
+    /**
+     * Flatten all experiments' per-task rows into the STDB `experiment_task_result`
+     * shape. The nexus Layer-3 ingest consumes exactly this — header rows from
+     * `list()`, child rows from here.
+     */
+    allTaskResults() {
+        return this.list().flatMap(e => e.results);
+    }
+}
+//# sourceMappingURL=ExperimentLedger.js.map

package/dist/training/ExperimentLedger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExperimentLedger.js","sourceRoot":"","sources":["../../src/training/ExperimentLedger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAyF7B,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;AAEtE,SAAS,gBAAgB,CAAC,aAAqB,EAAE,UAAkC,EAAE;IACnF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvB,aAAa;QACb,eAAe,EAAE,CAAC,CAAC,eAAe;QAClC,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;QAC5D,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,KAAK,EAAE,CAAC,CAAC,KAAK;KACf,CAAC,CAAC,CAAC;AACN,CAAC;AAED,MAAM,OAAO,gBAAgB;IACV,SAAS,CAAS;IAEnC,YAAY,WAAmB;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,mBAAmB,CAAC,CAAC;IAC/D,CAAC;IAEO,MAAM,CAAC,GAAqB;QAClC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC;IACxE,CAAC;IAED,wFAAwF;IACxF,IAAI,CAAC,OAAiE,EAAE;QACtE,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,CAAC;YAAC,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,EAAE,CAAC;QAAC,CAAC;QAC3E,MAAM,KAAK,GAAG,IAAI,GAAG,EAA4B,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,SAAS;YAC3B,IAAI,CAAC;gBACH,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAqB,CAAC;gBAC/C,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,aAAa,KAAK,QAAQ;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAC9E,CAAC;YAAC,MAAM,CAAC,CAAC,uBAAuB,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9B,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACpE,CAAC;IAED,GAAG,CAAC,aAAqB;QACvB,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,aAAa,CAAC,CAAC;IAClE,CAAC;IAED;kFAC8E;IAC9E,IAAI,CAAC,CAAgB;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;QACxF,MAAM,GAAG,GAAqB;YAC5B,aAAa,EAAE,CAAC,CAAC,aAAa;YAC9B,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,QAAQ,EAAE,QAAQ,IAAI,SAAS;YACzC,YAAY,EAAE,QAAQ,EAAE,YAAY;YACpC,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,QAAQ,EAAE,MAAM;YACpC,KAAK,EAAE,QAAQ,EAAE,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC5E,MAAM,EAAE,QAAQ,EAAE,MAAM;YACxB,KAAK,EAAE,QAAQ,EAAE,KAAK;YACtB,MAAM,EAAE,QAAQ,EAAE,MAAM;YACxB,YAAY,EAAE,QAAQ,EAAE,YAAY;YACpC,YAAY,EAAE,CAAC,CAAC,YAAY,IAAI,QAAQ,EAAE,YAAY;YACtD,eAAe,EAAE,CAAC,CAAC,eAAe,IAAI,QAAQ,EAAE,eAAe;YAC/D,OAAO;YACP,SAAS,EAAE,QAAQ,EAAE,SAAS,IAAI,GAAG;YACrC,SAAS,EAAE,GAAG;SACf,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,6EAA6E;IAC7E,UAAU,CAAC,aAAqB,EAAE,OAA+B;QAC/D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAC;QAC3B,MAAM,IAAI,GAAG,gBAAgB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QACtD,MAAM,MAAM,GAAqB;YAC/B,GAAG,GAAG;YACN,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACtD,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;kFAC8E;IAC9E,MAAM,CAAC,aAAqB,EAAE,CAAiB;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAC;QAC3B,MAAM,MAAM,GAAqB;YAC/B,GAAG,GAAG;YACN,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM;YAC9B,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK;YAC3B,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM;YAC9B,YAAY,EAAE,CAAC,CAAC,YAAY,IAAI,GAAG,CAAC,YAAY;YAChD,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK;YAC3B,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM;YAC9B,YAAY,EAAE,CAAC,CAAC,YAAY,IAAI,GAAG,CAAC,YAAY;YAChD,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,sEAAsE;IACtE,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;CACF"}