agent-nuvira 3.1.3 → 3.3.0

package/dist/learning/prompt-layers.js

@@ -0,0 +1,140 @@
+/**
+ * Prompt layers — deterministic splitting of a composed prompt into the
+ * layers that matter for review (enterprise hardening, session 3).
+ *
+ * WHY THIS EXISTS (the prompt audit of the last 30 traces):
+ * The trace stored ONE flat `promptPreview` capped at 300–500 chars, and for
+ * chat turns the preview deliberately shortened the system prompt to its first
+ * 80 characters. Result: in 106/106 chat steps the single most important
+ * artifact — the system prompt (persona, tool contract, response rules) — was
+ * INVISIBLE, and `promptDigest` hashed the whole thread so it could not show
+ * whether the stable layer was byte-stable (i.e. cacheable). Prompt
+ * engineering was, in practice, unreviewable.
+ *
+ * This module answers three questions from a flat prompt string, with no LLM
+ * and no caller changes:
+ *   1. Which bytes are the STABLE layer (identity / contract)?
+ *   2. Which are CONTEXT (project knowledge, recalled state, history, tools)?
+ *   3. Which are VOLATILE (the current task / ask)?
+ *
+ * Two transports are recognised because the codebase composes prompts two ways:
+ *   - the chat thread serialisation: `[System]` / `[User]` / `[Assistant]` /
+ *     `[Tool result]` markers (see `chat.ts` callModelWithTrace);
+ *   - the layered assembler: `# Project Context` … `## Task` headings
+ *     (see `agents/prompt-assembly.ts` assemblePrompt).
+ * Anything else falls back to a single `system` layer so a digest still detects
+ * change even when the shape is unknown.
+ */
+import { createHash } from 'node:crypto';
+function sha256Prefix(input, length = 16) {
+    try {
+        return createHash('sha256').update(input).digest('hex').slice(0, length);
+    }
+    catch {
+        return String(input.length);
+    }
+}
+/** The chat transport's role markers, at the START of a line. */
+const CHAT_MARKER_RE = /^(?:\[System\]|\[User\]|\[Assistant\]|\[Tool result\])\s*$/;
+/** The assembler transport's headings. */
+const ASSEMBLED_CONTEXT_RE = /^#\s*Project Context\s*$/m;
+const ASSEMBLED_VOLATILE_RE = /^##\s*Task\s*$/m;
+/**
+ * Split a chat-thread serialisation. The LAST `[User]` block is the current
+ * ask (volatile); every earlier block — injected context, prior turns, tool
+ * results — is context; the leading `[System]` block is the stable layer.
+ */
+function splitChatThread(text) {
+    const lines = text.split('\n');
+    // Index of each marker line.
+    const marks = [];
+    lines.forEach((l, i) => {
+        if (CHAT_MARKER_RE.test(l.trim()))
+            marks.push({ i, kind: l.trim() });
+    });
+    if (marks.length === 0)
+        return { system: text, context: '', volatile: '' };
+    const lastUser = [...marks].reverse().find((m) => m.kind === '[User]');
+    const sys = marks.find((m) => m.kind === '[System]');
+    // Slice boundaries: a block runs from a marker to the next marker.
+    const blockEnd = (idx) => {
+        const next = marks.find((m) => m.i > marks[idx].i);
+        return next ? next.i : lines.length;
+    };
+    const blockAt = (mark) => {
+        const pos = marks.findIndex((m) => m.i === mark.i);
+        return lines.slice(mark.i, blockEnd(pos)).join('\n');
+    };
+    const system = sys ? blockAt(sys) : '';
+    const volatile = lastUser ? blockAt(lastUser) : '';
+    const context = lines
+        .filter((_, i) => {
+        // Everything except the system block and the LAST user block.
+        if (sys && i >= sys.i && i < blockEnd(marks.findIndex((m) => m.i === sys.i)))
+            return false;
+        if (lastUser && i >= lastUser.i && i < blockEnd(marks.findIndex((m) => m.i === lastUser.i)))
+            return false;
+        return true;
+    })
+        .join('\n');
+    return { system, context: context.trim(), volatile };
+}
+/**
+ * Split an `assemblePrompt` result: everything before `# Project Context` is
+ * the stable layer, the Project Context block is context, and `## Task`
+ * onward is volatile.
+ */
+function splitAssembledPrompt(text) {
+    const ctxMatch = ASSEMBLED_CONTEXT_RE.exec(text);
+    const volMatch = ASSEMBLED_VOLATILE_RE.exec(text);
+    const ctxAt = ctxMatch?.index ?? -1;
+    const volAt = volMatch?.index ?? -1;
+    if (ctxAt === -1 && volAt === -1) {
+        // Unknown shape — keep it as one stable layer so change is still detected.
+        return { system: text, context: '', volatile: '' };
+    }
+    const systemEnd = ctxAt !== -1 ? ctxAt : volAt;
+    const system = text.slice(0, systemEnd).trim();
+    const context = ctxAt === -1 ? '' : text.slice(ctxAt, volAt === -1 ? text.length : volAt).trim();
+    const volatile = volAt === -1 ? '' : text.slice(volAt).trim();
+    return { system, context, volatile };
+}
+/**
+ * Split a composed prompt into its stable / context / volatile layers.
+ * Deterministic and transport-aware; never throws.
+ */
+export function splitPromptLayers(text) {
+    const t = text || '';
+    if (!t.trim())
+        return { system: '', context: '', volatile: '' };
+    try {
+        if (CHAT_MARKER_RE.test(t.split('\n')[0].trim()) || /\n\[User\]\s*$|\n\[User\]\n/.test(t)) {
+            return splitChatThread(t);
+        }
+        return splitAssembledPrompt(t);
+    }
+    catch {
+        return { system: t, context: '', volatile: '' };
+    }
+}
+/**
+ * Per-layer digests + sizes. The three digests SEPARATELY answer the review
+ * question the flat digest could not: did the stable layer change between
+ * steps (a cache-busting regression), or only the volatile one (expected)?
+ */
+export function digestPromptLayers(layers) {
+    return {
+        systemDigest: sha256Prefix(layers.system),
+        contextDigest: sha256Prefix(layers.context),
+        volatileDigest: sha256Prefix(layers.volatile),
+        systemChars: layers.system.length,
+        contextChars: layers.context.length,
+        volatileChars: layers.volatile.length,
+    };
+}
+/** Convenience: split + digest in one call. */
+export function digestPrompt(text) {
+    const layers = splitPromptLayers(text);
+    return { layers, digests: digestPromptLayers(layers) };
+}
+//# sourceMappingURL=prompt-layers.js.map

package/dist/learning/prompt-layers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prompt-layers.js","sourceRoot":"","sources":["../../src/learning/prompt-layers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAqBzC,SAAS,YAAY,CAAC,KAAa,EAAE,MAAM,GAAG,EAAE;IAC9C,IAAI,CAAC;QACH,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,iEAAiE;AACjE,MAAM,cAAc,GAAG,4DAA4D,CAAC;AAEpF,0CAA0C;AAC1C,MAAM,oBAAoB,GAAG,2BAA2B,CAAC;AACzD,MAAM,qBAAqB,GAAG,iBAAiB,CAAC;AAEhD;;;;GAIG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,6BAA6B;IAC7B,MAAM,KAAK,GAAuC,EAAE,CAAC;IACrD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IACH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAE3E,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IACvE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAErD,mEAAmE;IACnE,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAU,EAAE;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACtC,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,IAAmB,EAAU,EAAE;QAC9C,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,MAAM,OAAO,GAAG,KAAK;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACf,8DAA8D;QAC9D,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3F,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1G,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC;AACvD,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,IAAY;IACxC,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;IAEpC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACjC,2EAA2E;QAC3E,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACrD,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACjG,MAAM,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9D,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,MAAM,CAAC,GAAG,IAAI,IAAI,EAAE,CAAC;IACrB,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAChE,IAAI,CAAC;QACH,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1F,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAClD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAoB;IACrD,OAAO;QACL,YAAY,EAAE,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;QACzC,aAAa,EAAE,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC;QAC3C,cAAc,EAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC;QAC7C,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM;QACjC,YAAY,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM;QACnC,aAAa,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;KACtC,CAAC;AACJ,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACvC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;AACzD,CAAC"}

package/dist/learning/provider-limits.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Provider output-cap learning (enterprise-grade hardening, G15).
+ *
+ * WHY THIS EXISTS. A live unattended story run (12 pages, no human input)
+ * failed EVERY prose unit with the same provider rejection:
+ *
+ *   Groq API error (400): {"error":{"message":"`max_tokens` must be less than
+ *   or equal to `512`, the maximum value for `max_tokens` is less than the
+ *   `context_window` for this model","param":"max_tokens"}}
+ *
+ * The cause was OUR constant, not the model pool: the prose path asks for
+ * `maxTokens: 8192` (~900 words with headroom) because a chapter needs it, and
+ * the routed model happened to permit only 512. So:
+ *
+ *   - the agent looked broken ("Repair budget exhausted") when it was misconfigured;
+ *   - `resolveMaxOutputTokens()` could not have prevented it — that heuristic
+ *     reads the CONTEXT WINDOW, and this model advertises a large window with a
+ *     tiny output cap, which is exactly the case the window heuristic cannot see;
+ *   - the failure repeated 6 batches in a row, because nothing learned from it.
+ *
+ * Two disciplines come out of that, and this module is both:
+ *
+ * 1. `parseMaxTokensLimit()` — a provider that TELLS us its limit has told us
+ *    the truth. Read it from the error instead of discarding it, so the retry
+ *    is targeted at a number the provider itself named.
+ *
+ * 2. `rememberMaxTokensLimit()` / `clampMaxTokens()` — the learned limit is
+ *    remembered per provider × model and applied PREDICTIVELY to later calls,
+ *    so one rejection costs one wasted call per process instead of one per
+ *    unit. Only ever clamps DOWN: a provider that accepts our request is
+ *    never overruled by a stale or mis-parsed limit.
+ *
+ * Deliberately pure + process-local (no config writes): a provider contract is
+ * a runtime fact, and persisting a mis-parse would poison future sessions.
+ */
+/**
+ * The smallest number any recognised phrasing names, or `null` when the error
+ * is not an output-cap rejection. Returning the SMALLEST is the safe read when
+ * a message contains several numbers: a retry that is too small still
+ * succeeds (shorter output), a retry that is too large fails again and wastes
+ * another call — and the whole point of this path is to stop wasting calls.
+ */
+export declare function parseMaxTokensLimit(error: unknown): number | null;
+/**
+ * Record a provider-named output cap. Ignored when the key is incomplete
+ * (a bare provider or model is too coarse to clamp against) or the value is
+ * not a positive integer. Also clamps against any already-learned value so a
+ * later, larger claim cannot raise the cap back up.
+ */
+export declare function rememberMaxTokensLimit(provider: string | undefined, model: string | undefined, limit: number): void;
+/** The learned cap for provider × model, or `undefined` when none is known. */
+export declare function knownMaxTokensLimit(provider: string | undefined, model: string | undefined): number | undefined;
+/**
+ * Apply the learned cap to a requested value. Only ever lowers: an unlearned
+ * pair and an already-small request both pass through unchanged, so a caller
+ * that deliberately asks for less keeps its value.
+ */
+export declare function clampMaxTokens(requested: number | undefined, provider: string | undefined, model: string | undefined): number | undefined;
+/**
+ * Read a cap out of an error and remember it. Returns the parsed limit (so the
+ * caller can retry with it) or `null` when the error was not a cap rejection.
+ */
+export declare function learnMaxTokensLimitFromError(error: unknown, provider: string | undefined, model: string | undefined): number | null;
+/** Test hook — clears the process-local table. */
+export declare function resetLearnedMaxTokensLimits(): void;
+//# sourceMappingURL=provider-limits.d.ts.map

package/dist/learning/provider-limits.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"provider-limits.d.ts","sourceRoot":"","sources":["../../src/learning/provider-limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAsCH;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAajE;AA2CD;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,KAAK,EAAE,MAAM,GACZ,IAAI,CAON;AAED,+EAA+E;AAC/E,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,SAAS,GACxB,MAAM,GAAG,SAAS,CAIpB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,SAAS,EAAE,MAAM,GAAG,SAAS,EAC7B,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,SAAS,GACxB,MAAM,GAAG,SAAS,CAKpB;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,CAC1C,KAAK,EAAE,OAAO,EACd,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,SAAS,GACxB,MAAM,GAAG,IAAI,CAKf;AAED,kDAAkD;AAClD,wBAAgB,2BAA2B,IAAI,IAAI,CAElD"}

package/dist/learning/provider-limits.js

@@ -0,0 +1,184 @@
+/**
+ * Provider output-cap learning (enterprise-grade hardening, G15).
+ *
+ * WHY THIS EXISTS. A live unattended story run (12 pages, no human input)
+ * failed EVERY prose unit with the same provider rejection:
+ *
+ *   Groq API error (400): {"error":{"message":"`max_tokens` must be less than
+ *   or equal to `512`, the maximum value for `max_tokens` is less than the
+ *   `context_window` for this model","param":"max_tokens"}}
+ *
+ * The cause was OUR constant, not the model pool: the prose path asks for
+ * `maxTokens: 8192` (~900 words with headroom) because a chapter needs it, and
+ * the routed model happened to permit only 512. So:
+ *
+ *   - the agent looked broken ("Repair budget exhausted") when it was misconfigured;
+ *   - `resolveMaxOutputTokens()` could not have prevented it — that heuristic
+ *     reads the CONTEXT WINDOW, and this model advertises a large window with a
+ *     tiny output cap, which is exactly the case the window heuristic cannot see;
+ *   - the failure repeated 6 batches in a row, because nothing learned from it.
+ *
+ * Two disciplines come out of that, and this module is both:
+ *
+ * 1. `parseMaxTokensLimit()` — a provider that TELLS us its limit has told us
+ *    the truth. Read it from the error instead of discarding it, so the retry
+ *    is targeted at a number the provider itself named.
+ *
+ * 2. `rememberMaxTokensLimit()` / `clampMaxTokens()` — the learned limit is
+ *    remembered per provider × model and applied PREDICTIVELY to later calls,
+ *    so one rejection costs one wasted call per process instead of one per
+ *    unit. Only ever clamps DOWN: a provider that accepts our request is
+ *    never overruled by a stale or mis-parsed limit.
+ *
+ * Deliberately pure + process-local (no config writes): a provider contract is
+ * a runtime fact, and persisting a mis-parse would poison future sessions.
+ */
+/**
+ * camelCase → snake_case, lowercased, so one set of patterns covers
+ * `max_tokens`, `maxCompletionTokens` and `maxOutputTokens` alike. Without
+ * this, `maxOutputTokens must be <= 2048` (Gemini) reads as an unrelated
+ * error and the agent would keep failing the same way.
+ */
+function normalize(text) {
+    return text.replace(/([a-z0-9])([A-Z])/g, '$1_$2').toLowerCase();
+}
+/** Guard: only text that talks about output caps can yield a limit. */
+const MENTIONS_MAX_TOKENS = /max[_\s-]?(?:output[_\s-]|completion[_\s-])?tokens?/;
+/** A max-output field name followed, within a short distance, by a number. */
+const CAP_FIELD = 'max[_\\s-]?(?:output[_\\s-]|completion[_\\s-])?tokens?';
+/**
+ * Phrasings observed across OpenAI-compatible providers (Groq, Together,
+ * Mistral, OpenRouter...), Anthropic and Gemini. Every pattern captures the
+ * named limit in group 1; the caller takes the SMALLEST of all matches.
+ */
+const LIMIT_PATTERNS = [
+    // "max_tokens must be <= 512" / "must be less than or equal to 512"
+    new RegExp(`${CAP_FIELD}[\\s"'\`]*(?:must be )?(?:less than or equal to|no more than|at most|not exceed|<=?)\\s*["'\`]*(\\d+)`),
+    // "max_tokens: 8192 > 4096, which is the maximum allowed number of output tokens"
+    new RegExp(`${CAP_FIELD}[\\s"'\`]*[:=]?\\s*(\\d+)[\\s\\S]{0,160}?maximum allowed number of output tokens`),
+    // "...which is the maximum allowed number of output tokens for <model>"
+    /(\d+)[\s,)\]]*(?:which is |is )?the maximum allowed number of output tokens/i,
+    // "maximum value for max_tokens is 512"
+    new RegExp(`maximum(?: allowed)?(?: value)?(?: for| of)?[\\s"'\`]*${CAP_FIELD}[^\\d]{0,60}?(\\d+)`),
+];
+/**
+ * The smallest number any recognised phrasing names, or `null` when the error
+ * is not an output-cap rejection. Returning the SMALLEST is the safe read when
+ * a message contains several numbers: a retry that is too small still
+ * succeeds (shorter output), a retry that is too large fails again and wastes
+ * another call — and the whole point of this path is to stop wasting calls.
+ */
+export function parseMaxTokensLimit(error) {
+    const text = normalize(errorText(error));
+    if (!text || !MENTIONS_MAX_TOKENS.test(text))
+        return null;
+    const found = [];
+    for (const pattern of LIMIT_PATTERNS) {
+        const match = pattern.exec(text);
+        if (!match)
+            continue;
+        const value = Number.parseInt(match[1], 10);
+        if (Number.isFinite(value) && value > 0)
+            found.push(value);
+    }
+    if (found.length === 0)
+        return null;
+    return Math.min(...found);
+}
+/** Error → searchable text, digging into `cause` and attached bodies. */
+function errorText(error) {
+    if (error == null)
+        return '';
+    if (typeof error === 'string')
+        return error;
+    if (typeof error === 'object') {
+        const withMessage = error;
+        const parts = [];
+        if (typeof withMessage.message === 'string')
+            parts.push(withMessage.message);
+        // Provider bodies are frequently nested under `cause`/`response.data`.
+        const cause = withMessage.cause;
+        if (cause && cause !== error)
+            parts.push(errorText(cause));
+        const response = withMessage.response;
+        if (response?.data !== undefined) {
+            try {
+                parts.push(typeof response.data === 'string' ? response.data : JSON.stringify(response.data));
+            }
+            catch {
+                /* best-effort */
+            }
+        }
+        if (parts.length > 0)
+            return parts.join('\n');
+        try {
+            return JSON.stringify(error);
+        }
+        catch {
+            return '';
+        }
+    }
+    return String(error);
+}
+// ── Learned limits ──────────────────────────────────────────────────────────
+/** provider × model → the cap the provider itself named. Process-local. */
+const learnedLimits = new Map();
+function limitKey(provider, model) {
+    const p = (provider || '').trim().toLowerCase();
+    const m = (model || '').trim().toLowerCase();
+    if (!p || !m)
+        return null;
+    return `${p}::${m}`;
+}
+/**
+ * Record a provider-named output cap. Ignored when the key is incomplete
+ * (a bare provider or model is too coarse to clamp against) or the value is
+ * not a positive integer. Also clamps against any already-learned value so a
+ * later, larger claim cannot raise the cap back up.
+ */
+export function rememberMaxTokensLimit(provider, model, limit) {
+    const key = limitKey(provider, model);
+    if (!key)
+        return;
+    if (!Number.isFinite(limit) || limit <= 0)
+        return;
+    const existing = learnedLimits.get(key);
+    const next = existing === undefined ? limit : Math.min(existing, limit);
+    learnedLimits.set(key, Math.floor(next));
+}
+/** The learned cap for provider × model, or `undefined` when none is known. */
+export function knownMaxTokensLimit(provider, model) {
+    const key = limitKey(provider, model);
+    if (!key)
+        return undefined;
+    return learnedLimits.get(key);
+}
+/**
+ * Apply the learned cap to a requested value. Only ever lowers: an unlearned
+ * pair and an already-small request both pass through unchanged, so a caller
+ * that deliberately asks for less keeps its value.
+ */
+export function clampMaxTokens(requested, provider, model) {
+    const limit = knownMaxTokensLimit(provider, model);
+    if (limit === undefined)
+        return requested;
+    if (requested === undefined)
+        return limit;
+    return Math.min(requested, limit);
+}
+/**
+ * Read a cap out of an error and remember it. Returns the parsed limit (so the
+ * caller can retry with it) or `null` when the error was not a cap rejection.
+ */
+export function learnMaxTokensLimitFromError(error, provider, model) {
+    const limit = parseMaxTokensLimit(error);
+    if (limit === null)
+        return null;
+    rememberMaxTokensLimit(provider, model, limit);
+    return limit;
+}
+/** Test hook — clears the process-local table. */
+export function resetLearnedMaxTokensLimits() {
+    learnedLimits.clear();
+}
+//# sourceMappingURL=provider-limits.js.map

package/dist/learning/provider-limits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"provider-limits.js","sourceRoot":"","sources":["../../src/learning/provider-limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH;;;;;GAKG;AACH,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;AACnE,CAAC;AAED,uEAAuE;AACvE,MAAM,mBAAmB,GAAG,qDAAqD,CAAC;AAElF,8EAA8E;AAC9E,MAAM,SAAS,GAAG,wDAAwD,CAAC;AAE3E;;;;GAIG;AACH,MAAM,cAAc,GAAa;IAC/B,oEAAoE;IACpE,IAAI,MAAM,CACR,GAAG,SAAS,uGAAuG,CACpH;IACD,kFAAkF;IAClF,IAAI,MAAM,CACR,GAAG,SAAS,kFAAkF,CAC/F;IACD,wEAAwE;IACxE,8EAA8E;IAC9E,wCAAwC;IACxC,IAAI,MAAM,CAAC,yDAAyD,SAAS,qBAAqB,CAAC;CACpG,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAc;IAChD,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,IAAI,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAE1D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED,yEAAyE;AACzE,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,KAAK,IAAI,IAAI;QAAE,OAAO,EAAE,CAAC;IAC7B,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAG,KAAmE,CAAC;QACxF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,OAAO,WAAW,CAAC,OAAO,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC7E,uEAAuE;QACvE,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;QAChC,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,WAAW,CAAC,QAA0C,CAAC;QACxE,IAAI,QAAQ,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC;gBACH,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YAChG,CAAC;YAAC,MAAM,CAAC;gBACP,iBAAiB;YACnB,CAAC;QACH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED,+EAA+E;AAE/E,2EAA2E;AAC3E,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;AAEhD,SAAS,QAAQ,CAAC,QAA4B,EAAE,KAAyB;IACvE,MAAM,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC7C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1B,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACtB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,QAA4B,EAC5B,KAAyB,EACzB,KAAa;IAEb,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG;QAAE,OAAO;IACjB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO;IAClD,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACxE,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,mBAAmB,CACjC,QAA4B,EAC5B,KAAyB;IAEzB,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG;QAAE,OAAO,SAAS,CAAC;IAC3B,OAAO,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,SAA6B,EAC7B,QAA4B,EAC5B,KAAyB;IAEzB,MAAM,KAAK,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAC1C,KAAc,EACd,QAA4B,EAC5B,KAAyB;IAEzB,MAAM,KAAK,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAChC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/C,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,2BAA2B;IACzC,aAAa,CAAC,KAAK,EAAE,CAAC;AACxB,CAAC"}

package/dist/learning/reasoning-trace.d.ts

@@ -20,6 +20,7 @@
  *   - Dashboard /api/traces endpoints (TracePanel)
  */
 import type { LLMCallFn } from '../agents/agent.js';
+import { type PromptLayerDigests } from './prompt-layers.js';
 /** A compact routing snapshot captured at decision time (from AutoRouteResult). */
 export interface TraceRoutingSnapshot {
     provider: string;
@@ -64,6 +65,14 @@ export interface TraceStep {
     error?: string;
     /** Auto-router decision snapshot when the call was auto-routed. */
     routing?: TraceRoutingSnapshot;
+    /**
+     * PER-LAYER prompt digests (stable / context / volatile) + their sizes.
+     * The flat `promptDigest` hashes the whole thread, which grows every step —
+     * so it can never show whether the STABLE layer (system prompt) was
+     * byte-stable across steps. These three digests answer that, which is what
+     * makes prompt-caching regressions reviewable at all.
+     */
+    layers?: PromptLayerDigests;
     /** True when this step is a REPAIR re-prompt escalated to a stronger model
      *  (v1.60.4 per-task/planner escalation — the routing snapshot then carries
      *  the escalated decision at the next complexity level). */
@@ -100,6 +109,80 @@ export interface TraceOutcome {
      * instead of letting it read as work in progress.
      */
     unfulfilledPromise?: boolean;
+    /**
+     * True when this turn MUTATED the workspace (`edit_file`/`write_file`) and
+     * ran nothing that could observe the result (`run_terminal`/`test`/`browser`
+     * /`run_cli`). The edit is real but "it works" is unproven — the Trace tab
+     * surfaces this so an unverified change never reads as a verified one.
+     */
+    unverifiedEdit?: boolean;
+    /**
+     * True when the answer ASSERTED a completed code change while the turn was
+     * unverified (see `detectUnverifiedEditClaim`). This is the edit analogue of
+     * `unverifiedClaim` — the honesty flag for a false "I have fixed it".
+     */
+    unverifiedEditClaim?: boolean;
+    /**
+     * G13b — True when the request asked for an AUTHORED deliverable to be
+     * PRODUCED and the turn wrote NOTHING to disk (see
+     * `ToolLoopResult.undeliveredArtifact`). The reply may be excellent prose —
+     * the 12-page story that was composed into a chat window instead of a file —
+     * but the deliverable does not exist, so the Trace tab must not read it as
+     * finished work.
+     */
+    undeliveredArtifact?: boolean;
+}
+/**
+ * Which gate made a decision, or refused one.
+ *
+ * `confirmation` is the family the G18 audit could not see at all: a tool that
+ * declined to act until a human approved. `permission`/`verification`/
+ * `deliverable`/`promise` are the loop's own bounded nudges; `autonomy` is a
+ * gate that DECIDED to proceed on the request's own authorization; `budget` is
+ * a bound (step/continuation) being reached.
+ */
+export type TraceGateName = 'permission' | 'verification' | 'deliverable' | 'promise' | 'confirmation' | 'workspace' | 'autonomy' | 'budget';
+/**
+ * A NON-LLM fact about a turn: a tool call, a gate decision, or a refusal.
+ *
+ * WHY THIS IS NOT A `TraceStep`. `steps` are LLM calls — they carry a prompt
+ * digest, a model, tokens, and they feed `getTraceStats`. A tool call has none
+ * of those, and folding it in would corrupt every aggregate the Trace tab and
+ * the stats command already report. This is the separate, equally honest
+ * record: WHAT THE TURN DID, alongside what the model was asked.
+ *
+ * The gap it closes was recorded as G18: the loop engine wrote no trace at all,
+ * and the audit of the confirmation gates had to be done by reading code and
+ * driving the real tools, because "the trace store showed 0 refusals" meant
+ * "it cannot see refusals" — not "there were none".
+ */
+export interface TraceEvent {
+    /** 1-based position within the trace's event list. */
+    seq: number;
+    /** Epoch ms when the event was recorded. */
+    timestamp: number;
+    /**
+     * `tool`     — a tool call that actually ran (ok/error, duration, args);
+     * `gate`     — a gate made a DECISION (nudge spent, or autonomy proceeded);
+     * `refusal`  — a call was DECLINED (`Error:` result, confirmation gate,
+     *              unknown/disabled tool, repeat dispatch);
+     * `decision` — a non-tool decision worth auditing (e.g. the provider walk
+     *              abandoning a candidate, a loop bound being reached).
+     */
+    kind: 'tool' | 'gate' | 'refusal' | 'decision';
+    /** Tool name for `tool`/`refusal` events. */
+    tool?: string;
+    /** Which gate/nudge/bound this is about (see {@link TraceGateName}). */
+    gate?: TraceGateName;
+    /** One line, human-readable — the same wording the console prints. */
+    summary: string;
+    /** Bounded args preview for a tool call (what the gate actually saw). */
+    args?: string;
+    /** Bounded result/error preview (the evidence the verdict was read from). */
+    result?: string;
+    /** True when the call succeeded; false for an error or a refusal. */
+    ok?: boolean;
+    durationMs?: number;
 }
 /** A full reasoning trace — one pipeline execution. */
 export interface ReasoningTrace {
@@ -126,6 +209,21 @@ export interface ReasoningTrace {
     outcome?: TraceOutcome;
     /** LLM calls in execution order. */
     steps: TraceStep[];
+    /**
+     * Non-LLM facts about the run, in order: tool calls, gate decisions, and
+     * refusals (G18). Absent on traces written before this existed — readers must
+     * treat `undefined` as "no events were recorded", never as "none happened".
+     */
+    events?: TraceEvent[];
+    /**
+     * The FULL stable layer (system prompt), captured ONCE per trace.
+     * Previously every trace exposed only the first 80 characters of it, so the
+     * persona / tool contract / response rules were unreviewable. Capped to keep
+     * the trace file bounded; `systemPromptChars` records the true size.
+     */
+    systemPrompt?: string;
+    /** True length of the stable layer (before the storage cap). */
+    systemPromptChars?: number;
 }
 /** Aggregated stats over all stored traces. */
 export interface TraceStats {
@@ -139,6 +237,18 @@ export interface TraceStats {
     byAgentType: Record<string, number>;
     /** Steps by model. */
     byModel: Record<string, number>;
+    /**
+     * G18 — non-LLM facts recorded across all traces (tool calls, gate decisions,
+     * refusals). Counted separately from `totalSteps` on purpose: an event is not
+     * an LLM call, and adding it to the token/latency averages would make both
+     * wrong. `refusals` is the number the confirmation-gate audit could not obtain
+     * before this existed.
+     */
+    totalEvents: number;
+    /** How many of those events are refusals (declined calls). */
+    refusals: number;
+    /** How many are gate DECISIONS (a nudge spent, or autonomy proceeding). */
+    gateDecisions: number;
     updatedAt: number;
 }
 /** Context for withTraceCapture — everything a step needs except the call result. */
@@ -172,7 +282,18 @@ export declare function beginTrace(meta: {
  * Record one LLM call as a step in the trace. Best-effort: never throws.
  * seq is assigned automatically from the current step count.
  */
-export declare function recordStep(traceId: string, step: Omit<TraceStep, 'seq' | 'timestamp'>): void;
+export declare function recordStep(traceId: string, step: Omit<TraceStep, 'seq' | 'timestamp'> & {
+    promptFull?: string;
+}): void;
+/**
+ * Record one NON-LLM event (a tool call, a gate decision, a refusal) — G18.
+ *
+ * Same contract as {@link recordStep}: best-effort, never throws, and the tail
+ * is kept when the cap is hit (the most recent actions are the ones an audit
+ * reads). The caller passes WHAT HAPPENED; `seq`/`timestamp` are assigned here
+ * so two recorders can never disagree about ordering.
+ */
+export declare function recordTraceEvent(traceId: string, event: Omit<TraceEvent, 'seq' | 'timestamp'>): void;
 /**
  * Mark a trace finished (sets endedAt, durationMs, success). Idempotent: a
  * second endTrace (e.g. from a finally block after an early close) is a no-op.
@@ -188,6 +309,9 @@ export declare function buildTraceOutcome(input: {
     tools?: readonly string[];
     unverifiedActionClaim?: boolean;
     unfulfilledPromise?: boolean;
+    unverifiedEdit?: boolean;
+    unverifiedEditClaim?: boolean;
+    undeliveredArtifact?: boolean;
 }): TraceOutcome;
 /** Get one trace by id (null when missing). */
 export declare function getTrace(id: string): ReasoningTrace | null;

package/dist/learning/reasoning-trace.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reasoning-trace.d.ts","sourceRoot":"","sources":["../../src/learning/reasoning-trace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAOH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAMpD,mFAAmF;AACnF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,mCAAmC;AACnC,MAAM,WAAW,SAAS;IACxB,yCAAyC;IACzC,GAAG,EAAE,MAAM,CAAC;IACZ,sCAAsC;IACtC,SAAS,EAAE,MAAM,CAAC;IAClB,qEAAqE;IACrE,SAAS,EAAE,MAAM,CAAC;IAClB,mFAAmF;IACnF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,uCAAuC;IACvC,QAAQ,EAAE,MAAM,CAAC;IACjB,+BAA+B;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,YAAY,EAAE,MAAM,CAAC;IACrB,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;IACtB,kEAAkE;IAClE,eAAe,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,cAAc,EAAE,MAAM,CAAC;IACvB,8BAA8B;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,+BAA+B;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,2BAA2B;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,OAAO,EAAE,OAAO,CAAC;IACjB,yCAAyC;IACzC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mEAAmE;IACnE,OAAO,CAAC,EAAE,oBAAoB,CAAC;IAC/B;;gEAE4D;IAC5D,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;OAKG;IACH,IAAI,EAAE,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,WAAW,CAAC;IACpD,sEAAsE;IACtE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,2EAA2E;IAC3E,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;OAIG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,uDAAuD;AACvD,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,2FAA2F;IAC3F,MAAM,EAAE,cAAc,GAAG,MAAM,GAAG,MAAM,CAAC;IACzC,qCAAqC;IACrC,SAAS,EAAE,MAAM,CAAC;IAClB,iEAAiE;IACjE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8CAA8C;IAC9C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gDAAgD;IAChD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;oBAEgB;IAChB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,+EAA+E;IAC/E,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,oCAAoC;IACpC,KAAK,EAAE,SAAS,EAAE,CAAC;CACpB;AAED,+CAA+C;AAC/C,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,sDAAsD;IACtD,YAAY,EAAE,MAAM,CAAC;IACrB,+CAA+C;IAC/C,WAAW,EAAE,MAAM,CAAC;IACpB,0BAA0B;IAC1B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,sBAAsB;IACtB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,qFAAqF;AACrF,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oEAAoE;IACpE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iEAAiE;IACjE,OAAO,CAAC,EAAE,oBAAoB,CAAC;IAC/B,uEAAuE;IACvE,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAWD,oFAAoF;AACpF,eAAO,MAAM,UAAU,KAAK,CAAC;AAqD7B;;;GAGG;AACH,wBAAgB,UAAU,CACxB,IAAI,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,cAAc,GAAG,MAAM,GAAG,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GACnG,MAAM,CAkBR;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,GAAG,WAAW,CAAC,GAAG,IAAI,CAoB5F;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,IAAI,CAczF;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE;IACvC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1B,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B,GAAG,YAAY,CAYf;AAED,+CAA+C;AAC/C,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAG1D;AAED,2DAA2D;AAC3D,wBAAgB,UAAU,CAAC,KAAK,SAAK,GAAG,cAAc,EAAE,CAGvD;AAED,yDAAyD;AACzD,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAO/C;AAED,+BAA+B;AAC/B,wBAAgB,WAAW,IAAI,IAAI,CAElC;AAED,8CAA8C;AAC9C,wBAAgB,aAAa,IAAI,UAAU,CAyB1C;AAID;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,SAAS,EAClB,GAAG,EAAE,mBAAmB,GACvB,SAAS,CAkCX"}
+{"version":3,"file":"reasoning-trace.d.ts","sourceRoot":"","sources":["../../src/learning/reasoning-trace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAOH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAGpD,OAAO,EAAyC,KAAK,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAIpG,mFAAmF;AACnF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,mCAAmC;AACnC,MAAM,WAAW,SAAS;IACxB,yCAAyC;IACzC,GAAG,EAAE,MAAM,CAAC;IACZ,sCAAsC;IACtC,SAAS,EAAE,MAAM,CAAC;IAClB,qEAAqE;IACrE,SAAS,EAAE,MAAM,CAAC;IAClB,mFAAmF;IACnF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,uCAAuC;IACvC,QAAQ,EAAE,MAAM,CAAC;IACjB,+BAA+B;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,YAAY,EAAE,MAAM,CAAC;IACrB,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;IACtB,kEAAkE;IAClE,eAAe,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,cAAc,EAAE,MAAM,CAAC;IACvB,8BAA8B;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,+BAA+B;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,2BAA2B;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,OAAO,EAAE,OAAO,CAAC;IACjB,yCAAyC;IACzC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mEAAmE;IACnE,OAAO,CAAC,EAAE,oBAAoB,CAAC;IAC/B;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B;;gEAE4D;IAC5D,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;OAKG;IACH,IAAI,EAAE,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,WAAW,CAAC;IACpD,sEAAsE;IACtE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,2EAA2E;IAC3E,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;OAIG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B;;;;;OAKG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B;;;;;;;OAOG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,aAAa,GACrB,YAAY,GACZ,cAAc,GACd,aAAa,GACb,SAAS,GACT,cAAc,GACd,WAAW,GACX,UAAU,GACV,QAAQ,CAAC;AAEb;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,UAAU;IACzB,sDAAsD;IACtD,GAAG,EAAE,MAAM,CAAC;IACZ,4CAA4C;IAC5C,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;;;OAOG;IACH,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,UAAU,CAAC;IAC/C,6CAA6C;IAC7C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,wEAAwE;IACxE,IAAI,CAAC,EAAE,aAAa,CAAC;IACrB,sEAAsE;IACtE,OAAO,EAAE,MAAM,CAAC;IAChB,yEAAyE;IACzE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,6EAA6E;IAC7E,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,qEAAqE;IACrE,EAAE,CAAC,EAAE,OAAO,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,uDAAuD;AACvD,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,2FAA2F;IAC3F,MAAM,EAAE,cAAc,GAAG,MAAM,GAAG,MAAM,CAAC;IACzC,qCAAqC;IACrC,SAAS,EAAE,MAAM,CAAC;IAClB,iEAAiE;IACjE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8CAA8C;IAC9C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gDAAgD;IAChD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;oBAEgB;IAChB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,+EAA+E;IAC/E,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,oCAAoC;IACpC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB;;;;OAIG;IACH,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;IACtB;;;;;OAKG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,gEAAgE;IAChE,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,+CAA+C;AAC/C,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,sDAAsD;IACtD,YAAY,EAAE,MAAM,CAAC;IACrB,+CAA+C;IAC/C,WAAW,EAAE,MAAM,CAAC;IACpB,0BAA0B;IAC1B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,sBAAsB;IACtB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC;;;;;;OAMG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,8DAA8D;IAC9D,QAAQ,EAAE,MAAM,CAAC;IACjB,2EAA2E;IAC3E,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,qFAAqF;AACrF,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oEAAoE;IACpE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iEAAiE;IACjE,OAAO,CAAC,EAAE,oBAAoB,CAAC;IAC/B,uEAAuE;IACvE,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAWD,oFAAoF;AACpF,eAAO,MAAM,UAAU,KAAK,CAAC;AA8D7B;;;GAGG;AACH,wBAAgB,UAAU,CACxB,IAAI,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,cAAc,GAAG,MAAM,GAAG,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GACnG,MAAM,CAmBR;AAED;;;GAGG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,GAAG,WAAW,CAAC,GAAG;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GACnE,IAAI,CAkCN;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,GAAG,WAAW,CAAC,GAC3C,IAAI,CAgBN;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,IAAI,CAczF;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE;IACvC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1B,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B,GAAG,YAAY,CAef;AAED,+CAA+C;AAC/C,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAG1D;AAED,2DAA2D;AAC3D,wBAAgB,UAAU,CAAC,KAAK,SAAK,GAAG,cAAc,EAAE,CAGvD;AAED,yDAAyD;AACzD,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAO/C;AAED,+BAA+B;AAC/B,wBAAgB,WAAW,IAAI,IAAI,CAElC;AAED,8CAA8C;AAC9C,wBAAgB,aAAa,IAAI,UAAU,CAoC1C;AAID;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,SAAS,EAClB,GAAG,EAAE,mBAAmB,GACvB,SAAS,CAgDX"}