@tangle-network/agent-eval 0.216.1 → 0.217.1

package/dist/ledger-core-DrJhbms9.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ledger-core-DrJhbms9.js","names":[],"sources":["../src/ledger-core/merkle.ts"],"sourcesContent":["/**\n * Merkle proofs over an append-only list of leaves (RFC 9162 §2.1, the\n * Certificate Transparency tree).\n *\n * A hash chain proves a whole log against its head, but proving one entry means\n * replaying everything before it. This tree proves any one leaf against a root\n * with ⌈log₂ n⌉ hashes (inclusion), and proves that a larger tree only appended\n * to a smaller one (consistency). A verifier holding a root can therefore check\n * a single event, or that a later checkpoint extends an earlier one, without\n * reading the rest of the log.\n *\n * Leaves and interior nodes are domain-separated (0x00 and 0x01 prefixes), so a\n * leaf can never be presented as an interior node. Content that may later be\n * redacted takes a random 32-byte salt: a verifier then needs only the leaf's\n * hash, and short content cannot be guessed back from that hash. The salt must\n * be stored apart from anything that is shared after redaction.\n *\n * Builders refuse malformed input by throwing; verifiers never throw and return\n * a typed outcome, because a proof is external evidence and a bad one is a\n * finding, not a crash.\n */\nimport { sha256Bytes } from '@tangle-network/agent-interface'\nimport { ValidationError } from '../errors'\nimport { LEDGER_HASH_PATTERN, type LedgerHash } from './canonical'\n\n/** Proof that one leaf is at `leafIndex` in a tree of `treeSize` leaves. */\nexport interface MerkleInclusionProof {\n  readonly leafIndex: number\n  readonly treeSize: number\n  readonly path: readonly LedgerHash[]\n}\n\n/** Proof that the first `oldSize` leaves of a `newSize` tree are unchanged. */\nexport interface MerkleConsistencyProof {\n  readonly oldSize: number\n  readonly newSize: number\n  readonly path: readonly LedgerHash[]\n}\n\nexport type MerkleVerification =\n  | { readonly verified: true }\n  | { readonly verified: false; readonly reason: string }\n\nconst SALT_PATTERN = /^[a-f0-9]{64}$/\nconst LEAF_PREFIX = 0x00\nconst NODE_PREFIX = 0x01\nconst encoder = new TextEncoder()\n\n/** Root of the empty tree: SHA-256 of no bytes. */\nconst MERKLE_EMPTY_ROOT: LedgerHash = sha256Bytes(new Uint8Array(0)) as LedgerHash\n\n/** A fresh random salt for {@link merkleLeafHash}: 32 bytes as 64 lowercase hex characters. */\nexport function merkleSalt(): string {\n  return toHex(globalThis.crypto.getRandomValues(new Uint8Array(32)))\n}\n\n/**\n * Leaf hash of `content`: SHA-256(0x00 ‖ salt ‖ content). Without a salt this is\n * exactly the RFC 9162 leaf hash. Strings are hashed as UTF-8.\n */\nexport function merkleLeafHash(content: Uint8Array | string, salt?: string): LedgerHash {\n  const bytes = typeof content === 'string' ? encoder.encode(content) : content\n  if (salt === undefined) return digest(LEAF_PREFIX, bytes)\n  if (!SALT_PATTERN.test(salt)) {\n    throw new ValidationError('merkle salt must be 32 bytes as 64 lowercase hex characters')\n  }\n  return digest(LEAF_PREFIX, fromHex(salt), bytes)\n}\n\n/** Root over leaf hashes, in order. The empty list has {@link MERKLE_EMPTY_ROOT}. */\nexport function merkleRoot(leaves: readonly LedgerHash[]): LedgerHash {\n  const nodes = decodeLeaves(leaves)\n  return nodes.length === 0 ? MERKLE_EMPTY_ROOT : toLedgerHash(subtreeRoot(nodes, 0, nodes.length))\n}\n\n/** Inclusion proof for the leaf at `leafIndex` (RFC 9162 §2.1.3.1). */\nexport function merkleInclusionProof(\n  leaves: readonly LedgerHash[],\n  leafIndex: number,\n): MerkleInclusionProof {\n  const nodes = decodeLeaves(leaves)\n  if (!Number.isSafeInteger(leafIndex) || leafIndex < 0 || leafIndex >= nodes.length) {\n    throw new ValidationError(\n      `merkle leaf index ${leafIndex} is outside a tree of ${nodes.length} leaves`,\n    )\n  }\n  const path: Uint8Array[] = []\n  inclusionPath(nodes, leafIndex, 0, nodes.length, path)\n  return { leafIndex, treeSize: nodes.length, path: path.map(toLedgerHash) }\n}\n\n\n\n/** Check that `leaf` is in the tree with `root` at the proof's index (RFC 9162 §2.1.3.2). */\nexport function verifyMerkleInclusion(\n  leaf: LedgerHash,\n  proof: MerkleInclusionProof,\n  root: LedgerHash,\n): MerkleVerification {\n  const { leafIndex, treeSize } = proof\n  if (!isSize(treeSize) || !isSize(leafIndex) || leafIndex >= treeSize) {\n    return refused(`leaf index ${leafIndex} is outside a tree of ${treeSize} leaves`)\n  }\n  const decoded = decodeAll([leaf, root, ...proof.path])\n  if (decoded === undefined) return refused('proof carries a malformed hash')\n  const [leafBytes, rootBytes, ...path] = decoded as [Uint8Array, Uint8Array, ...Uint8Array[]]\n  let fn = leafIndex\n  let sn = treeSize - 1\n  let r = leafBytes\n  for (const p of path) {\n    if (sn === 0) return refused('proof path is longer than the tree is deep')\n    if (fn % 2 === 1 || fn === sn) {\n      r = node(p, r)\n      if (fn % 2 === 0) {\n        while (fn % 2 === 0 && fn !== 0) {\n          fn = Math.floor(fn / 2)\n          sn = Math.floor(sn / 2)\n        }\n      }\n    } else {\n      r = node(r, p)\n    }\n    fn = Math.floor(fn / 2)\n    sn = Math.floor(sn / 2)\n  }\n  if (sn !== 0) return refused('proof path is shorter than the tree is deep')\n  return equal(r, rootBytes) ? { verified: true } : refused('leaf does not hash to the root')\n}\n\n\n\nfunction subtreeRoot(nodes: readonly Uint8Array[], start: number, end: number): Uint8Array {\n  if (end - start === 1) return nodes[start] as Uint8Array\n  const k = largestPowerOfTwoBelow(end - start)\n  return node(subtreeRoot(nodes, start, start + k), subtreeRoot(nodes, start + k, end))\n}\n\nfunction inclusionPath(\n  nodes: readonly Uint8Array[],\n  index: number,\n  start: number,\n  end: number,\n  path: Uint8Array[],\n): void {\n  if (end - start === 1) return\n  const k = largestPowerOfTwoBelow(end - start)\n  if (index < start + k) {\n    inclusionPath(nodes, index, start, start + k, path)\n    path.push(subtreeRoot(nodes, start + k, end))\n  } else {\n    inclusionPath(nodes, index, start + k, end, path)\n    path.push(subtreeRoot(nodes, start, start + k))\n  }\n}\n\n\n\nfunction node(left: Uint8Array, right: Uint8Array): Uint8Array {\n  return fromHex(digest(NODE_PREFIX, left, right).slice('sha256:'.length))\n}\n\nfunction digest(prefix: number, ...parts: Uint8Array[]): LedgerHash {\n  const length = parts.reduce((total, part) => total + part.length, 1)\n  const bytes = new Uint8Array(length)\n  bytes[0] = prefix\n  let offset = 1\n  for (const part of parts) {\n    bytes.set(part, offset)\n    offset += part.length\n  }\n  return sha256Bytes(bytes) as LedgerHash\n}\n\nfunction decodeLeaves(leaves: readonly LedgerHash[]): Uint8Array[] {\n  const decoded = decodeAll(leaves)\n  if (decoded === undefined) {\n    throw new ValidationError('merkle leaves must be sha256:<64 lowercase hex> hashes')\n  }\n  return decoded\n}\n\nfunction decodeAll(hashes: readonly string[]): Uint8Array[] | undefined {\n  const out: Uint8Array[] = []\n  for (const hash of hashes) {\n    if (typeof hash !== 'string' || !LEDGER_HASH_PATTERN.test(hash)) return undefined\n    out.push(fromHex(hash.slice('sha256:'.length)))\n  }\n  return out\n}\n\nfunction toLedgerHash(bytes: Uint8Array): LedgerHash {\n  return `sha256:${toHex(bytes)}`\n}\n\nfunction largestPowerOfTwoBelow(n: number): number {\n  let k = 1\n  while (k * 2 < n) k *= 2\n  return k\n}\n\n\n\nfunction isSize(n: number): boolean {\n  return Number.isSafeInteger(n) && n >= 0\n}\n\nfunction equal(a: Uint8Array, b: Uint8Array): boolean {\n  if (a.length !== b.length) return false\n  for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false\n  return true\n}\n\nfunction refused(reason: string): MerkleVerification {\n  return { verified: false, reason }\n}\n\nfunction toHex(bytes: Uint8Array): string {\n  return Array.from(bytes, (byte) => byte.toString(16).padStart(2, '0')).join('')\n}\n\nfunction fromHex(hex: string): Uint8Array {\n  const bytes = new Uint8Array(hex.length / 2)\n  for (let i = 0; i < bytes.length; i++) bytes[i] = Number.parseInt(hex.slice(i * 2, i * 2 + 2), 16)\n  return bytes\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AA2CA,MAAM,eAAe;AACrB,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB,MAAM,UAAU,IAAI,YAAY;;AAGhC,MAAM,oBAAgC,4BAAY,IAAI,WAAW,CAAC,CAAC;;AAGnE,SAAgB,aAAqB;CACnC,OAAO,MAAM,WAAW,OAAO,gCAAgB,IAAI,WAAW,EAAE,CAAC,CAAC;AACpE;;;;;AAMA,SAAgB,eAAe,SAA8B,MAA2B;CACtF,MAAM,QAAQ,OAAO,YAAY,WAAW,QAAQ,OAAO,OAAO,IAAI;CACtE,IAAI,SAAS,KAAA,GAAW,OAAO,OAAO,aAAa,KAAK;CACxD,IAAI,CAAC,aAAa,KAAK,IAAI,GACzB,MAAM,IAAI,gBAAgB,6DAA6D;CAEzF,OAAO,OAAO,aAAa,QAAQ,IAAI,GAAG,KAAK;AACjD;;AAGA,SAAgB,WAAW,QAA2C;CACpE,MAAM,QAAQ,aAAa,MAAM;CACjC,OAAO,MAAM,WAAW,IAAI,oBAAoB,aAAa,YAAY,OAAO,GAAG,MAAM,MAAM,CAAC;AAClG;;AAGA,SAAgB,qBACd,QACA,WACsB;CACtB,MAAM,QAAQ,aAAa,MAAM;CACjC,IAAI,CAAC,OAAO,cAAc,SAAS,KAAK,YAAY,KAAK,aAAa,MAAM,QAC1E,MAAM,IAAI,gBACR,qBAAqB,UAAU,wBAAwB,MAAM,OAAO,QACtE;CAEF,MAAM,OAAqB,CAAC;CAC5B,cAAc,OAAO,WAAW,GAAG,MAAM,QAAQ,IAAI;CACrD,OAAO;EAAE;EAAW,UAAU,MAAM;EAAQ,MAAM,KAAK,IAAI,YAAY;CAAE;AAC3E;;AAKA,SAAgB,sBACd,MACA,OACA,MACoB;CACpB,MAAM,EAAE,WAAW,aAAa;CAChC,IAAI,CAAC,OAAO,QAAQ,KAAK,CAAC,OAAO,SAAS,KAAK,aAAa,UAC1D,OAAO,QAAQ,cAAc,UAAU,wBAAwB,SAAS,QAAQ;CAElF,MAAM,UAAU,UAAU;EAAC;EAAM;EAAM,GAAG,MAAM;CAAI,CAAC;CACrD,IAAI,YAAY,KAAA,GAAW,OAAO,QAAQ,gCAAgC;CAC1E,MAAM,CAAC,WAAW,WAAW,GAAG,QAAQ;CACxC,IAAI,KAAK;CACT,IAAI,KAAK,WAAW;CACpB,IAAI,IAAI;CACR,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,OAAO,GAAG,OAAO,QAAQ,4CAA4C;EACzE,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI;GAC7B,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,KAAK,MAAM,GACb,OAAO,KAAK,MAAM,KAAK,OAAO,GAAG;IAC/B,KAAK,KAAK,MAAM,KAAK,CAAC;IACtB,KAAK,KAAK,MAAM,KAAK,CAAC;GACxB;EAEJ,OACE,IAAI,KAAK,GAAG,CAAC;EAEf,KAAK,KAAK,MAAM,KAAK,CAAC;EACtB,KAAK,KAAK,MAAM,KAAK,CAAC;CACxB;CACA,IAAI,OAAO,GAAG,OAAO,QAAQ,6CAA6C;CAC1E,OAAO,MAAM,GAAG,SAAS,IAAI,EAAE,UAAU,KAAK,IAAI,QAAQ,gCAAgC;AAC5F;AAIA,SAAS,YAAY,OAA8B,OAAe,KAAyB;CACzF,IAAI,MAAM,UAAU,GAAG,OAAO,MAAM;CACpC,MAAM,IAAI,uBAAuB,MAAM,KAAK;CAC5C,OAAO,KAAK,YAAY,OAAO,OAAO,QAAQ,CAAC,GAAG,YAAY,OAAO,QAAQ,GAAG,GAAG,CAAC;AACtF;AAEA,SAAS,cACP,OACA,OACA,OACA,KACA,MACM;CACN,IAAI,MAAM,UAAU,GAAG;CACvB,MAAM,IAAI,uBAAuB,MAAM,KAAK;CAC5C,IAAI,QAAQ,QAAQ,GAAG;EACrB,cAAc,OAAO,OAAO,OAAO,QAAQ,GAAG,IAAI;EAClD,KAAK,KAAK,YAAY,OAAO,QAAQ,GAAG,GAAG,CAAC;CAC9C,OAAO;EACL,cAAc,OAAO,OAAO,QAAQ,GAAG,KAAK,IAAI;EAChD,KAAK,KAAK,YAAY,OAAO,OAAO,QAAQ,CAAC,CAAC;CAChD;AACF;AAIA,SAAS,KAAK,MAAkB,OAA+B;CAC7D,OAAO,QAAQ,OAAO,aAAa,MAAM,KAAK,CAAC,CAAC,MAAM,CAAgB,CAAC;AACzE;AAEA,SAAS,OAAO,QAAgB,GAAG,OAAiC;CAClE,MAAM,SAAS,MAAM,QAAQ,OAAO,SAAS,QAAQ,KAAK,QAAQ,CAAC;CACnE,MAAM,QAAQ,IAAI,WAAW,MAAM;CACnC,MAAM,KAAK;CACX,IAAI,SAAS;CACb,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,IAAI,MAAM,MAAM;EACtB,UAAU,KAAK;CACjB;CACA,OAAO,YAAY,KAAK;AAC1B;AAEA,SAAS,aAAa,QAA6C;CACjE,MAAM,UAAU,UAAU,MAAM;CAChC,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,gBAAgB,wDAAwD;CAEpF,OAAO;AACT;AAEA,SAAS,UAAU,QAAqD;CACtE,MAAM,MAAoB,CAAC;CAC3B,KAAK,MAAM,QAAQ,QAAQ;EACzB,IAAI,OAAO,SAAS,YAAY,CAAC,oBAAoB,KAAK,IAAI,GAAG,OAAO,KAAA;EACxE,IAAI,KAAK,QAAQ,KAAK,MAAM,CAAgB,CAAC,CAAC;CAChD;CACA,OAAO;AACT;AAEA,SAAS,aAAa,OAA+B;CACnD,OAAO,UAAU,MAAM,KAAK;AAC9B;AAEA,SAAS,uBAAuB,GAAmB;CACjD,IAAI,IAAI;CACR,OAAO,IAAI,IAAI,GAAG,KAAK;CACvB,OAAO;AACT;AAIA,SAAS,OAAO,GAAoB;CAClC,OAAO,OAAO,cAAc,CAAC,KAAK,KAAK;AACzC;AAEA,SAAS,MAAM,GAAe,GAAwB;CACpD,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO;CAC7D,OAAO;AACT;AAEA,SAAS,QAAQ,QAAoC;CACnD,OAAO;EAAE,UAAU;EAAO;CAAO;AACnC;AAEA,SAAS,MAAM,OAA2B;CACxC,OAAO,MAAM,KAAK,QAAQ,SAAS,KAAK,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;AAChF;AAEA,SAAS,QAAQ,KAAyB;CACxC,MAAM,QAAQ,IAAI,WAAW,IAAI,SAAS,CAAC;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM,KAAK,OAAO,SAAS,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE;CACjG,OAAO;AACT"}

package/dist/{llm-client-CyBAoYiX.js → llm-client-BshCREn6.js}

@@ -1,110 +1,8 @@
-import { t as AgentEvalError } from "./errors-DVZiqS7K.js";
-import { c as costForTokenPricing } from "./cost-ledger-BP8V4kUQ.js";
+import { t as AgentEvalError } from "./errors-BcOs5MKW.js";
+import { c as costForTokenPricing } from "./cost-ledger-D0352Z4d.js";
+import { a as LlmCallError, o as LlmResponseError, r as parseJsonResult } from "./json-BhdsJaOQ.js";
+import { a as providerFromBaseUrl, i as defaultProviderRedactor } from "./raw-provider-sink-75w4FWBj.js";
 import { t as newRecordId } from "./record-id-DUgsK5qp.js";
-import { a as providerFromBaseUrl, i as defaultProviderRedactor } from "./raw-provider-sink-DoHz4JNG.js";
-//#region src/llm-client/errors.ts
-var LlmCallError = class extends AgentEvalError {
-	status;
-	body;
-	model;
-	constructor(message, status, body, model) {
-		super("judge", message);
-		this.status = status;
-		this.body = body;
-		this.model = model;
-	}
-};
-/** A provider response completed and incurred measurable usage, but its content
-*  could not satisfy the caller's response contract. The response envelope is
-*  retained so accounting can commit the receipt before the error propagates. */
-var LlmResponseError = class extends AgentEvalError {
-	result;
-	constructor(message, result, options) {
-		super("judge", message, options);
-		this.result = result;
-	}
-};
-//#endregion
-//#region src/llm-client/json.ts
-/**
-* Strip a ```json / ``` code fence if the model emitted one.
-* Idempotent for naked JSON. Some models (claude-code via router, certain
-* deepseek models) wrap output even under json_object.
-*/
-function stripFencedJson(raw) {
-	const trimmed = raw.trim();
-	const m = trimmed.match(/^```(?:json)?\s*\n?([\s\S]*?)\n?```\s*$/);
-	return m ? m[1].trim() : trimmed;
-}
-function extractJsonPayload(raw) {
-	const stripped = stripFencedJson(raw);
-	try {
-		JSON.parse(stripped);
-		return stripped;
-	} catch {
-		if (stripped.startsWith("{") || stripped.startsWith("[")) return stripped;
-	}
-	const starts = [...stripped.matchAll(/[[{]/g)].map((match) => match.index).filter((index) => index != null);
-	for (const start of starts) {
-		const candidate = extractBalancedJson(stripped, start);
-		if (!candidate) continue;
-		try {
-			JSON.parse(candidate);
-			return candidate;
-		} catch {}
-	}
-	return stripped;
-}
-function extractBalancedJson(input, start) {
-	const opener = input[start];
-	const closer = opener === "{" ? "}" : opener === "[" ? "]" : null;
-	if (!closer) return null;
-	const stack = [closer];
-	let isInString = false;
-	let isEscaped = false;
-	for (let i = start + 1; i < input.length; i++) {
-		const char = input[i];
-		if (isEscaped) {
-			isEscaped = false;
-			continue;
-		}
-		if (char === "\\") {
-			isEscaped = isInString;
-			continue;
-		}
-		if (char === "\"") {
-			isInString = !isInString;
-			continue;
-		}
-		if (isInString) continue;
-		if (char === "{") stack.push("}");
-		else if (char === "[") stack.push("]");
-		else if (char === stack[stack.length - 1]) {
-			stack.pop();
-			if (stack.length === 0) return input.slice(start, i + 1);
-		}
-	}
-	return null;
-}
-function parseJsonResult(result, jsonPayloadMode) {
-	try {
-		if (result.finishReason === "length") throw new Error(`LLM returned truncated JSON content (model=${result.model}, finishReason=length)`);
-		return parseJsonSafely(result.content, result.model, jsonPayloadMode);
-	} catch (error) {
-		if (error instanceof LlmResponseError) throw error;
-		const cause = error instanceof Error ? error : new Error(String(error));
-		throw new LlmResponseError(cause.message, result, { cause });
-	}
-}
-function parseJsonSafely(content, model, jsonPayloadMode) {
-	const payload = jsonPayloadMode === "exact" ? content : extractJsonPayload(content);
-	try {
-		return JSON.parse(payload);
-	} catch {
-		throw new Error(`LLM returned non-JSON content (model=${model})`);
-	}
-}
-//#endregion
 //#region src/abort-signal.ts
 /** Combine active cancellation sources without wrapping a single source. */
 function combineAbortSignals(...signals) {
@@ -1018,6 +916,6 @@ var LlmClient = class {
 	}
 };
 //#endregion
-export { LlmResponseError as C, LlmCallError as S, assertCrossFamily as _, maximumChargeForLlmRequest as a, extractJsonPayload as b, ModelSubstitutionError as c, assertServedModel as d, assertServedModelPolicy as f, CrossFamilyError as g, servedModelAcceptable as h, costReceiptFromLlmError as i, ServedCrossFamilyError as l, checkServedModel as m, callLlmJson as n, backoffMs as o, assertServedModels as p, costReceiptFromLlm as r, isTransientLlmError as s, LlmClient as t, assertCrossFamilyServed as u, judgeFamily as v, stripFencedJson as x, combineAbortSignals as y };
+export { combineAbortSignals as _, maximumChargeForLlmRequest as a, ModelSubstitutionError as c, assertServedModelPolicy as d, assertServedModels as f, judgeFamily as g, assertCrossFamily as h, costReceiptFromLlmError as i, assertCrossFamilyServed as l, CrossFamilyError as m, callLlmJson as n, backoffMs as o, checkServedModel as p, costReceiptFromLlm as r, isTransientLlmError as s, LlmClient as t, assertServedModel as u };
 
-//# sourceMappingURL=llm-client-CyBAoYiX.js.map
+//# sourceMappingURL=llm-client-BshCREn6.js.map

package/dist/llm-client-BshCREn6.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-client-BshCREn6.js","names":[],"sources":["../src/abort-signal.ts","../src/judge-families.ts","../src/integrity/served-model.ts","../src/llm-client/resilience.ts","../src/llm-client/wire.ts","../src/llm-client/accounting.ts","../src/llm-client/request.ts","../src/llm-client.ts"],"sourcesContent":["/** Combine active cancellation sources without wrapping a single source. */\nexport function combineAbortSignals(\n  ...signals: Array<AbortSignal | undefined>\n): AbortSignal | undefined {\n  const active = [\n    ...new Set(signals.filter((signal): signal is AbortSignal => signal !== undefined)),\n  ]\n  if (active.length === 0) return undefined\n  if (active.length === 1) return active[0]\n  return AbortSignal.any(active)\n}\n","/**\n * Judge model-family classification + cross-family enforcement.\n *\n * A judge ensemble built entirely from one provider family shares that\n * family's blind spots and self-preference — its \"agreement\" is correlated\n * bias, not independent signal. `assertCrossFamily` makes the consumer prove\n * the ensemble spans ≥2 families; `judgeFamily` is the single regex map that\n * replaces the per-consumer copies (tax/legal/creative/gtm each ship one).\n */\n\n/** Provider family a model belongs to. `unknown` when no rule matches. */\nexport type JudgeFamily =\n  | 'anthropic'\n  | 'openai'\n  | 'google'\n  | 'meta'\n  | 'mistral'\n  | 'deepseek'\n  | 'xai'\n  | 'qwen'\n  | 'cohere'\n  | 'amazon'\n  | 'moonshot'\n  | 'zhipu'\n  | 'unknown'\n\n/** Explicit `provider/...` prefix → family (models.dev / OpenRouter style). */\nconst PROVIDER_PREFIX: Record<string, JudgeFamily> = {\n  anthropic: 'anthropic',\n  openai: 'openai',\n  'azure-openai': 'openai',\n  google: 'google',\n  'google-vertex': 'google',\n  meta: 'meta',\n  'meta-llama': 'meta',\n  mistral: 'mistral',\n  mistralai: 'mistral',\n  deepseek: 'deepseek',\n  xai: 'xai',\n  qwen: 'qwen',\n  alibaba: 'qwen',\n  cohere: 'cohere',\n  amazon: 'amazon',\n  bedrock: 'amazon',\n  moonshot: 'moonshot',\n  moonshotai: 'moonshot',\n  kimi: 'moonshot',\n  'kimi-code': 'moonshot',\n  zhipu: 'zhipu',\n  zhipuai: 'zhipu',\n  zai: 'zhipu',\n  'z-ai': 'zhipu',\n  glm: 'zhipu',\n}\n\n/** Fallback model-name patterns when there's no recognised provider prefix. */\nconst NAME_PATTERNS: Array<[RegExp, JudgeFamily]> = [\n  [/claude/i, 'anthropic'],\n  // Anthropic's own bare aliases (`claude --model sonnet|opus|haiku`). A run that requested `sonnet`\n  // and was served claude-sonnet-5 is an alias resolution, not a cross-family substitution: without\n  // this row the alias classified as `unknown` and assertServedModel refused the pair.\n  [/^(?:sonnet|opus|haiku)(?:[-@\\s]|$)/i, 'anthropic'],\n  [/\\b(gpt|davinci|babbage)\\b|^o[134]\\b|[-/]o[134]\\b|gpt-/i, 'openai'],\n  [/gemini|palm|gemma|bison/i, 'google'],\n  [/llama/i, 'meta'],\n  [/mi(s|x)tral|codestral|magistral/i, 'mistral'],\n  [/deepseek/i, 'deepseek'],\n  [/grok/i, 'xai'],\n  [/qwen/i, 'qwen'],\n  [/command-?(r|a)?/i, 'cohere'],\n  [/\\b(nova|titan)\\b/i, 'amazon'],\n  [/\\bkimi\\b|moonshot/i, 'moonshot'],\n  [/\\bglm\\b|zhipu|\\bz-?ai\\b/i, 'zhipu'],\n]\n\n/**\n * Classify a model id into its provider family. Strips a `@snapshot` suffix\n * and prefers an explicit `provider/...` prefix; otherwise matches the model\n * name. Returns `unknown` when nothing matches (callers decide whether that's\n * acceptable — `assertCrossFamily` counts it as its own family).\n */\nexport function judgeFamily(modelId: string): JudgeFamily {\n  const id = modelId.trim().split('@')[0]!.toLowerCase()\n  const slash = id.indexOf('/')\n  if (slash > 0) {\n    const prefix = id.slice(0, slash)\n    const mapped = PROVIDER_PREFIX[prefix]\n    if (mapped) return mapped\n  }\n  for (const [pattern, family] of NAME_PATTERNS) {\n    if (pattern.test(id)) return family\n  }\n  return 'unknown'\n}\n\nexport interface AssertCrossFamilyOptions {\n  /** Minimum number of distinct families the ensemble must span. Default 2. */\n  minFamilies?: number\n  /** When false (default), `unknown`-family models do NOT count toward the\n   *  family total — an ensemble of all-unclassifiable models is not provably\n   *  cross-family. Set true to count `unknown` as one shared family. */\n  allowUnknown?: boolean\n}\n\nexport class CrossFamilyError extends Error {\n  constructor(\n    message: string,\n    public readonly families: JudgeFamily[],\n    public readonly models: string[],\n  ) {\n    super(message)\n    this.name = 'CrossFamilyError'\n  }\n}\n\n/**\n * Throw unless the judge models span at least `minFamilies` distinct provider\n * families. Pass the model ids backing your judge ensemble. Fail-loud by\n * design — a correlated single-family ensemble silently inflates agreement.\n *\n * Scope: this reads the ids you REQUEST. It proves the panel was configured\n * across families; it cannot prove the panel RAN across families, because a\n * routing gateway may answer several different ids from one provider. Where\n * the diversity claim is load-bearing (a published leaderboard, a\n * certification, a non-self-judging exclusion), assert on the ids the\n * provider echoed instead: `assertCrossFamilyServed` in\n * ./integrity/served-model.\n */\nexport function assertCrossFamily(\n  models: string[],\n  opts: AssertCrossFamilyOptions = {},\n): JudgeFamily[] {\n  const minFamilies = opts.minFamilies ?? 2\n  const families = new Set<JudgeFamily>()\n  for (const m of models) {\n    const f = judgeFamily(m)\n    if (f === 'unknown' && !opts.allowUnknown) continue\n    families.add(f)\n  }\n  const list = [...families].sort()\n  if (list.length < minFamilies) {\n    throw new CrossFamilyError(\n      `judge ensemble spans ${list.length} provider famil${list.length === 1 ? 'y' : 'ies'} ` +\n        `(${list.join(', ') || 'none'}) but ${minFamilies} required — a single-family ensemble ` +\n        'is correlated bias, not independent signal',\n      list,\n      models,\n    )\n  }\n  return list\n}\n","/**\n * Served-model identity: prove the model that ANSWERED is the model that was\n * REQUESTED.\n *\n * A routing gateway can accept `model: \"gpt-4.1-mini\"` and answer from a\n * different model entirely. Every guard that reasons about the requested id —\n * cross-family judge diversity, per-model leaderboard rows, non-self-judging\n * exclusions, cost attribution — then passes while measuring something else.\n * The requested id is an intent; only the id echoed on the response is\n * evidence.\n *\n * `checkServedModel` classifies one requested/served pair; `assertServedModel`\n * and `assertServedModels` are the fail-loud gates; `assertCrossFamilyServed`\n * is the family-diversity rule computed over SERVED ids (the requested-id\n * version lives in ../judge-families and cannot see substitution).\n *\n * Aliasing is tolerated, substitution is not: `openai/gpt-4.1-mini` and\n * `gpt-4.1-mini` are the same request expressed two ways, so a response\n * echoing either satisfies the other. A response echoing `gemini-2.5-flash-lite`\n * does not.\n */\n\nimport { AgentEvalError } from '../errors'\nimport { type JudgeFamily, judgeFamily } from '../judge-families'\n\n/**\n * Output-token budget a liveness probe must grant a model.\n *\n * Identity is only readable off a response the provider actually produced. A\n * reasoning model spends budget on hidden reasoning tokens before it emits a\n * single visible one, so a cap of a few tokens makes a HEALTHY deepseek/glm\n * model fail with `reasoning_budget_exhausted` — it names no model, its\n * identity reads as `unreported`, and a preflight scores it DEAD. 64 clears\n * that floor. Every probe in this package reads this constant, so two probes\n * cannot reach two different answers about the same router.\n *\n * Cost: a probe spends at most `PROBE_MAX_TOKENS` output tokens per model,\n * plus whatever reasoning tokens a reasoning model bills — roughly 400 output\n * tokens for a six-model preflight. That is fractions of a cent, and far\n * cheaper than a campaign that runs on a model nobody proved was alive.\n */\nexport const PROBE_MAX_TOKENS = 64\n\n/** How a served id relates to the id that was requested. */\nexport type ServedModelVerdict =\n  /** Byte-identical after normalisation — the requested model answered. */\n  | 'exact'\n  /** Same model, different spelling (provider prefix, snapshot, tier suffix). */\n  | 'alias'\n  /** A different model of the SAME provider family answered. */\n  | 'substituted-within-family'\n  /** A different provider's model answered. */\n  | 'substituted-cross-family'\n  /** The response carried no model id — identity is unproven either way. */\n  | 'unreported'\n\nexport interface ServedModelCheck {\n  /** The id the caller asked for. */\n  requested: string\n  /** The id echoed on the response; `null` when the response omitted it. */\n  served: string | null\n  requestedFamily: JudgeFamily\n  /** `null` when `served` is null. */\n  servedFamily: JudgeFamily | null\n  verdict: ServedModelVerdict\n  /** True for every verdict except `exact` and `alias`. */\n  substituted: boolean\n}\n\n/**\n * Reduce a model id to its comparable core: lowercase, no surrounding space,\n * no `provider/` prefix, no `@snapshot` / `:batch` / `:free` tier suffix, no\n * trailing build date, and `.`/`_` folded to `-` so one version is spelled one\n * way.\n *\n * Dropping the build date is what makes snapshot resolution legible as the\n * non-event it is: a router answering `gpt-4o-mini` with\n * `gpt-4o-mini-2024-07-18` pinned a floating alias to a reproducible build —\n * the same model, which is the behaviour we want. Only routing decoration is\n * stripped; version digits are load-bearing, so `deepseek-v3.2` and\n * `deepseek-v4-flash` stay distinct, and comparison is EXACT equality rather\n * than a prefix test (a prefix rule would accept `gpt-5` → `gpt-5-mini`, a\n * silent downgrade wearing the right vendor name).\n */\nexport function normalizeModelId(modelId: string): string {\n  let id = modelId.trim().toLowerCase()\n  const at = id.indexOf('@')\n  if (at > 0) id = id.slice(0, at)\n  const colon = id.indexOf(':')\n  if (colon > 0) id = id.slice(0, colon)\n  const slash = id.lastIndexOf('/')\n  if (slash >= 0) id = id.slice(slash + 1)\n  return id\n    .replace(/-\\d{4}-\\d{2}-\\d{2}$/, '')\n    .replace(/-\\d{8}$/, '')\n    .replace(/[._]/g, '-')\n    .replace(/-+$/, '')\n    .trim()\n}\n\n/**\n * Classify one requested/served pair. Pure — no I/O — so it is safe inside\n * response handlers, reducers, and CI gates.\n *\n * `served` is the id echoed by the provider (OpenAI-compatible bodies put it\n * at `model`). `null`/`undefined` means the body omitted it; that is\n * `unreported`, NOT a pass — a provider that does not name what answered has\n * not proven identity, and a transport that drops the field must not read as\n * agreement.\n */\nexport function checkServedModel(\n  requested: string,\n  served: string | null | undefined,\n): ServedModelCheck {\n  const requestedFamily = judgeFamily(requested)\n  if (served === null || served === undefined || served.trim() === '') {\n    return {\n      requested,\n      served: null,\n      requestedFamily,\n      servedFamily: null,\n      verdict: 'unreported',\n      substituted: true,\n    }\n  }\n  const servedFamily = judgeFamily(served)\n  if (requested.trim().toLowerCase() === served.trim().toLowerCase()) {\n    return {\n      requested,\n      served,\n      requestedFamily,\n      servedFamily,\n      verdict: 'exact',\n      substituted: false,\n    }\n  }\n  if (normalizeModelId(requested) === normalizeModelId(served)) {\n    return {\n      requested,\n      served,\n      requestedFamily,\n      servedFamily,\n      verdict: 'alias',\n      substituted: false,\n    }\n  }\n  return {\n    requested,\n    served,\n    requestedFamily,\n    servedFamily,\n    verdict:\n      requestedFamily === servedFamily ? 'substituted-within-family' : 'substituted-cross-family',\n    substituted: true,\n  }\n}\n\nexport class ModelSubstitutionError extends AgentEvalError {\n  constructor(\n    message: string,\n    public readonly checks: ReadonlyArray<ServedModelCheck>,\n  ) {\n    super('model_substitution', message)\n    this.name = 'ModelSubstitutionError'\n  }\n}\n\n/**\n * Consumer-facing name for the substitution policy a metered surface applies.\n * `'exact'` rejects every substitution. `'allow-within-family'` accepts a\n * different model of the same provider family; it keeps family-level claims\n * valid and forfeits per-model claims. Maps to\n * `AssertServedModelOptions.allowWithinFamily`.\n */\nexport type ServedModelPolicy = 'exact' | 'allow-within-family'\n\nexport function assertServedModelPolicy(\n  value: unknown,\n  label: string,\n): asserts value is ServedModelPolicy | undefined {\n  if (value !== undefined && value !== 'exact' && value !== 'allow-within-family') {\n    throw new Error(`${label} must be 'exact' or 'allow-within-family'`)\n  }\n}\n\nexport interface AssertServedModelOptions {\n  /**\n   * Accept a different model of the same provider family (e.g. requested\n   * `deepseek-v3.2`, served `deepseek-v4-flash`). Default false. Setting this\n   * keeps family-level claims valid and forfeits per-model claims.\n   */\n  allowWithinFamily?: boolean\n  /**\n   * Accept a response that carried no model id. Default false — an\n   * unidentified response cannot support a per-model or per-family claim.\n   */\n  allowUnreported?: boolean\n  /** Prefixed to the thrown message, e.g. the judge or campaign cell name. */\n  context?: string\n}\n\n/**\n * The one place the accept/reject policy lives, so a caller that reports\n * substitution (a preflight table, a run record) and a caller that throws on it\n * can never drift apart. A cross-family substitution is never acceptable.\n */\nexport function servedModelAcceptable(\n  check: ServedModelCheck,\n  opts: AssertServedModelOptions = {},\n): boolean {\n  switch (check.verdict) {\n    case 'exact':\n    case 'alias':\n      return true\n    case 'unreported':\n      return opts.allowUnreported === true\n    case 'substituted-within-family':\n      return opts.allowWithinFamily === true\n    default:\n      return false\n  }\n}\n\nfunction describe(check: ServedModelCheck): string {\n  if (check.verdict === 'unreported')\n    return `${check.requested}: response carried no model id (identity unproven)`\n  return (\n    `${check.requested} (${check.requestedFamily}) → served ${check.served} ` +\n    `(${check.servedFamily}) [${check.verdict}]`\n  )\n}\n\n/**\n * Throw `ModelSubstitutionError` unless the served id is the requested model.\n * Returns the check on success so callers can record the served id alongside\n * the result.\n */\nexport function assertServedModel(\n  requested: string,\n  served: string | null | undefined,\n  opts: AssertServedModelOptions = {},\n): ServedModelCheck {\n  const check = checkServedModel(requested, served)\n  if (servedModelAcceptable(check, opts)) return check\n  const prefix = opts.context ? `${opts.context}: ` : ''\n  throw new ModelSubstitutionError(\n    `${prefix}model substitution — ${describe(check)}. The measurement is of the SERVED model, ` +\n      'not the requested one; any per-model or per-family claim from this call is invalid.',\n    [check],\n  )\n}\n\n/**\n * Batch form: check every pair and throw naming EVERY substitution, so one\n * failure does not hide the rest. Returns all checks on success.\n */\nexport function assertServedModels(\n  pairs: ReadonlyArray<{ requested: string; served: string | null | undefined }>,\n  opts: AssertServedModelOptions = {},\n): ServedModelCheck[] {\n  const checks = pairs.map((p) => checkServedModel(p.requested, p.served))\n  const bad = checks.filter((c) => !servedModelAcceptable(c, opts))\n  if (bad.length > 0) {\n    const prefix = opts.context ? `${opts.context}: ` : ''\n    throw new ModelSubstitutionError(\n      `${prefix}${bad.length}/${checks.length} call(s) were answered by a different model than ` +\n        `requested — ${bad.map(describe).join('; ')}. Per-model and per-family claims from this ` +\n        'run are invalid until the ids are re-measured.',\n      checks,\n    )\n  }\n  return checks\n}\n\nexport interface AssertCrossFamilyServedOptions extends AssertServedModelOptions {\n  /** Minimum distinct SERVED families required. Default 2. */\n  minFamilies?: number\n  /** Count `unknown`-family served ids toward the total. Default false. */\n  allowUnknown?: boolean\n}\n\nexport class ServedCrossFamilyError extends AgentEvalError {\n  constructor(\n    message: string,\n    public readonly families: JudgeFamily[],\n    public readonly checks: ReadonlyArray<ServedModelCheck>,\n  ) {\n    super('model_substitution', message)\n    this.name = 'ServedCrossFamilyError'\n  }\n}\n\n/**\n * Family-diversity rule over the models that actually ANSWERED.\n *\n * `assertCrossFamily` (../judge-families) reads the requested ids and so\n * cannot see a gateway that answers three \"different\" requests from one\n * provider. This one asserts no substitution first, then counts families from\n * the served ids — a panel that collapsed to one family under the hood fails\n * here even though its request list looked diverse.\n */\nexport function assertCrossFamilyServed(\n  pairs: ReadonlyArray<{ requested: string; served: string | null | undefined }>,\n  opts: AssertCrossFamilyServedOptions = {},\n): JudgeFamily[] {\n  const checks = assertServedModels(pairs, opts)\n  const families = new Set<JudgeFamily>()\n  for (const check of checks) {\n    const family = check.servedFamily\n    if (family === null) continue\n    if (family === 'unknown' && !opts.allowUnknown) continue\n    families.add(family)\n  }\n  const list = [...families].sort()\n  const minFamilies = opts.minFamilies ?? 2\n  if (list.length < minFamilies) {\n    const prefix = opts.context ? `${opts.context}: ` : ''\n    throw new ServedCrossFamilyError(\n      `${prefix}the models that ANSWERED span ${list.length} provider famil` +\n        `${list.length === 1 ? 'y' : 'ies'} (${list.join(', ') || 'none'}) but ${minFamilies} ` +\n        `required — served ids: ${checks.map((c) => c.served ?? 'unreported').join(', ')}`,\n      list,\n      checks,\n    )\n  }\n  return list\n}\n","import type { LlmClientOptions } from './contract'\nimport { LlmCallError } from './errors'\n\n// ─── Internals ──────────────────────────────────────────────────────────\n\n// Flagship / reasoning models routinely take several minutes on large prompts (a\n// reflection over many failures, a long tool transcript). A tight cap aborts a\n// legitimately-slow but healthy call — and because every retry attempt re-uses\n// the same window, such a model aborts on ALL attempts and the loop throws. The\n// default is generous enough to let those complete, bounded enough that a truly\n// hung call still fails over after retries, and tunable per deployment via\n// TANGLE_LLM_TIMEOUT_MS. Per-call `req.timeoutMs` / `opts.defaultTimeoutMs`\n// still win for callers that know their model's latency.\nexport const DEFAULT_TIMEOUT_MS = Number(process.env.TANGLE_LLM_TIMEOUT_MS) || 300_000\n\nconst DEFAULT_MAXIMUM_ATTEMPTS =\n  process.env.TANGLE_LLM_MAXIMUM_ATTEMPTS === undefined\n    ? 6\n    : Number(process.env.TANGLE_LLM_MAXIMUM_ATTEMPTS)\n\nexport function resolveMaximumAttempts(configured: number | undefined): number {\n  const attempts = configured ?? DEFAULT_MAXIMUM_ATTEMPTS\n  if (!Number.isInteger(attempts) || attempts <= 0) {\n    throw new RangeError('LLM maximum attempts must be a positive integer')\n  }\n  return attempts\n}\n\nexport function resolveMinIntervalMs(configured: number | undefined): number {\n  const interval = configured ?? 0\n  if (!Number.isFinite(interval) || interval < 0) {\n    throw new RangeError('LLM minIntervalMs must be a finite non-negative number')\n  }\n  return interval\n}\n\n// Weak keys avoid retaining credentials or completed campaigns. LlmClient binds\n// its per-call option copies to the same state as its constructor options.\nexport const pacingStates = new WeakMap<LlmClientOptions, { lastStartedAt?: number }>()\n\nexport function pacingStateFor(opts: LlmClientOptions): { lastStartedAt?: number } {\n  let state = pacingStates.get(opts)\n  if (!state) {\n    state = {}\n    pacingStates.set(opts, state)\n  }\n  return state\n}\n\n// 522/524: Cloudflare edge timeouts (origin connect/respond) — transient\n// exactly like 504. Router deployments serve through Cloudflare, so a long\n// non-streaming call can draw these from the edge, not the origin.\nexport const RETRYABLE_STATUS = new Set([429, 502, 503, 504, 522, 524])\n\n/**\n * Transient transport/network error signatures, matched against an error's\n * name, message, and `code`. Covers fetch/undici network failures, aborts\n * and timeouts, and — critically — HTTP/2 transport faults a keep-alive\n * connection raises mid-response: `terminated`, `NGHTTP2_INTERNAL_ERROR`,\n * `UND_ERR_*`, `other side closed`. Those last ones carry no clean HTTP\n * status; unrecognised, they escape the retry loop and surface as an\n * uncaught rejection.\n */\nconst TRANSIENT_ERROR_PATTERNS: readonly RegExp[] = [\n  /AbortError/i,\n  /TimeoutError/i,\n  /this operation was aborted/i,\n  /fetch failed/i,\n  /ECONNRESET/i,\n  /ETIMEDOUT/i,\n  /EAI_AGAIN/i,\n  /socket hang up/i,\n  /stream.*ended.*unexpectedly/i,\n  /terminated/i,\n  /other side closed/i,\n  /NGHTTP2/i,\n  /UND_ERR/i,\n]\n\n/**\n * True when an error is a transient transport/network fault worth retrying,\n * as opposed to a deterministic failure (4xx schema reject, JSON parse) that\n * a retry cannot fix. Inspects `LlmCallError.status`, then the error's\n * name/message/code, then recurses into `error.cause` — undici nests the\n * real socket fault one or more levels under `.cause`.\n *\n * This is the retry classifier for the package: `callLlm` and\n * `withJudgeRetry` both route through it, so connection failures are treated\n * consistently across transports.\n */\nexport function isTransientLlmError(err: unknown): boolean {\n  return classifyTransient(err, 0)\n}\n\nfunction classifyTransient(err: unknown, depth: number): boolean {\n  if (err instanceof LlmCallError) return RETRYABLE_STATUS.has(err.status)\n  if (!(err instanceof Error)) return false\n  // Foreign transport errors can carry a numeric HTTP status without being an\n  // LlmCallError. A retryable status is decisive.\n  const status = (err as { status?: unknown }).status\n  if (typeof status === 'number' && RETRYABLE_STATUS.has(status)) return true\n  const code = (err as { code?: unknown }).code\n  const haystack = `${err.name}\\n${err.message}\\n${typeof code === 'string' ? code : ''}`\n  if (TRANSIENT_ERROR_PATTERNS.some((p) => p.test(haystack))) return true\n  const cause = (err as { cause?: unknown }).cause\n  if (depth < 4 && cause instanceof Error && cause !== err) {\n    return classifyTransient(cause, depth + 1)\n  }\n  return false\n}\n\nexport function parseRetryAfter(headers: Headers): number | null {\n  const h = headers.get('retry-after')?.trim()\n  if (!h) return null\n  const asNumber = Number(h)\n  if (!Number.isNaN(asNumber)) {\n    const delay = asNumber * 1000\n    return Number.isFinite(delay) && delay >= 0 ? delay : null\n  }\n  const asDate = Date.parse(h)\n  if (Number.isFinite(asDate)) return Math.max(0, asDate - Date.now())\n  return null\n}\n\n/** Exponential backoff: 500ms, 1s, 2s, 4s, ... capped at 16s. Attempt is 0-indexed. */\nexport function backoffMs(attempt: number): number {\n  return Math.min(500 * 2 ** attempt, 16_000)\n}\n\n/** Backoff belongs to the caller's operation and must stop when it is cancelled. */\nexport async function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  // A timer above the signed 32-bit limit becomes a near-immediate timeout.\n  // Split long server delays rather than truncating Retry-After or overflowing.\n  do {\n    signal?.throwIfAborted()\n    const chunk = Math.min(Math.ceil(ms), 2_147_483_647)\n    await new Promise<void>((resolve, reject) => {\n      const onAbort = () => {\n        clearTimeout(timer)\n        signal?.removeEventListener('abort', onAbort)\n        reject(signal?.reason)\n      }\n      const timer = setTimeout(() => {\n        signal?.removeEventListener('abort', onAbort)\n        resolve()\n      }, chunk)\n      signal?.addEventListener('abort', onAbort, { once: true })\n    })\n    ms -= chunk\n  } while (ms > 0)\n}\n\n/** True once the cross-attempt wall-clock budget (if any) is exhausted. */\nexport function deadlineExceeded(start: number, deadlineMs: number | undefined): boolean {\n  return deadlineMs != null && Date.now() - start >= deadlineMs\n}\n","import type {\n  LlmCallRequest,\n  LlmClientOptions,\n  LlmMessage,\n  LlmThinkingMode,\n  LlmTokenLogprob,\n  LlmToolCall,\n} from './contract'\n\nexport function providerTokenCount(value: unknown): number | undefined {\n  return typeof value === 'number' && Number.isSafeInteger(value) && value >= 0 ? value : undefined\n}\n\nexport function buildHeaders(opts: LlmClientOptions): Record<string, string> {\n  const headers: Record<string, string> = {\n    'Content-Type': 'application/json',\n    Accept: 'application/json',\n  }\n  if (opts.authHeader) {\n    headers[opts.authHeader.name] = opts.authHeader.value\n  } else if (opts.bearer || opts.apiKey) {\n    headers.Authorization = `Bearer ${opts.bearer ?? opts.apiKey}`\n  }\n  if (opts.idempotencyKey) headers['Idempotency-Key'] = opts.idempotencyKey\n  return headers\n}\n\nexport function isSchemaRejection(status: number, body: string): boolean {\n  if (status !== 400) return false\n  const lower = body.toLowerCase()\n  return (\n    lower.includes('response_format') ||\n    lower.includes('json_schema') ||\n    lower.includes('is unavailable') ||\n    lower.includes('not supported')\n  )\n}\n\nexport function isTemperatureOneRejection(status: number, body: string): boolean {\n  if (status !== 400 || !/temperature/i.test(body)) return false\n  return (\n    /temperature[^.\\n]{0,120}\\b(?:only|must|should|required|requires?)\\b[^.\\n]{0,40}\\b1(?:\\.0+)?\\b/i.test(\n      body,\n    ) || /\\bonly\\s+1(?:\\.0+)?\\s+is\\s+allowed\\b[^.\\n]{0,120}\\btemperature\\b/i.test(body)\n  )\n}\n\nexport function buildBody(\n  req: LlmCallRequest,\n  forceJsonObject: boolean,\n  defaultThinking?: LlmThinkingMode,\n): Record<string, unknown> {\n  const body: Record<string, unknown> = {\n    model: req.model,\n    messages: req.messages.map(encodeWireMessage),\n    temperature: req.temperature ?? 0,\n  }\n  if (req.maxTokens != null) {\n    if (usesMaxCompletionTokens(req.model)) body.max_completion_tokens = req.maxTokens\n    else body.max_tokens = req.maxTokens\n  }\n  if (req.logprobs !== undefined) {\n    body.logprobs = true\n    body.top_logprobs = req.logprobs.topLogprobs\n  }\n  if (req.tools !== undefined) body.tools = req.tools\n  if (req.toolChoice !== undefined) body.tool_choice = req.toolChoice\n  const thinking = req.thinking ?? defaultThinking\n  if (thinking !== undefined) {\n    body.thinking = { type: thinking }\n  }\n\n  if (req.jsonSchema && !forceJsonObject) {\n    body.response_format = {\n      type: 'json_schema',\n      json_schema: { name: req.jsonSchema.name, schema: req.jsonSchema.schema, strict: true },\n    }\n  } else if (req.jsonMode || req.jsonSchema) {\n    body.response_format = { type: 'json_object' }\n  }\n\n  return body\n}\n\nfunction usesMaxCompletionTokens(model: string): boolean {\n  return /^gpt-5(?:[.-]|$)/i.test(model)\n}\n\n/** Encode one canonical message as its OpenAI chat-completions wire shape. */\nfunction encodeWireMessage(message: LlmMessage): Record<string, unknown> {\n  if (message.role === 'tool') {\n    return { role: 'tool', tool_call_id: message.toolCallId, content: message.content }\n  }\n  if (message.toolCalls === undefined) {\n    return { role: message.role, content: message.content }\n  }\n  return {\n    role: message.role,\n    content: message.content,\n    tool_calls: message.toolCalls.map((call) => ({\n      id: call.id,\n      type: 'function',\n      function: { name: call.name, arguments: call.argumentsJson },\n    })),\n  }\n}\n\n/**\n * Parse `choices[0].logprobs.content` into the canonical per-token shape.\n * `null` when the provider returned nothing for a request that asked: a\n * provider that ignores `logprobs` is a fact the caller must be able to read,\n * not an error. A malformed entry is a contract violation and throws.\n */\nexport function parseWireLogprobs(\n  value: unknown,\n  model: string,\n): ReadonlyArray<LlmTokenLogprob> | null {\n  if (value === undefined || value === null) return null\n  if (!Array.isArray(value)) {\n    throw new Error(`LLM response logprobs.content must be an array (model=${model})`)\n  }\n  return value.map((entry, index) => {\n    const record = entry as { token?: unknown; logprob?: unknown; top_logprobs?: unknown } | null\n    if (\n      !record ||\n      typeof record !== 'object' ||\n      typeof record.token !== 'string' ||\n      typeof record.logprob !== 'number' ||\n      !Number.isFinite(record.logprob)\n    ) {\n      throw new Error(\n        `LLM response logprobs.content[${index}] is not a token with a finite logprob (model=${model})`,\n      )\n    }\n    const top = record.top_logprobs\n    if (top !== undefined && top !== null && !Array.isArray(top)) {\n      throw new Error(\n        `LLM response logprobs.content[${index}].top_logprobs must be an array (model=${model})`,\n      )\n    }\n    return {\n      token: record.token,\n      logprob: record.logprob,\n      top: (Array.isArray(top) ? top : []).map((alternative, position) => {\n        const candidate = alternative as { token?: unknown; logprob?: unknown } | null\n        if (\n          !candidate ||\n          typeof candidate !== 'object' ||\n          typeof candidate.token !== 'string' ||\n          typeof candidate.logprob !== 'number' ||\n          !Number.isFinite(candidate.logprob)\n        ) {\n          throw new Error(\n            `LLM response logprobs.content[${index}].top_logprobs[${position}] is not a token with a finite logprob (model=${model})`,\n          )\n        }\n        return { token: candidate.token, logprob: candidate.logprob }\n      }),\n    }\n  })\n}\n\n/** Parse provider tool_calls into the canonical shape. A malformed entry is a\n * provider-contract violation and throws rather than degrading silently. */\nexport function parseWireToolCalls(value: unknown, model: string): LlmToolCall[] | undefined {\n  if (value === undefined || value === null) return undefined\n  if (!Array.isArray(value)) {\n    throw new Error(`LLM response tool_calls must be an array (model=${model})`)\n  }\n  if (value.length === 0) return undefined\n  return value.map((entry, index) => {\n    const record = entry as {\n      id?: unknown\n      type?: unknown\n      function?: { name?: unknown; arguments?: unknown } | null\n    } | null\n    const fn = record && typeof record === 'object' ? record.function : undefined\n    if (\n      !record ||\n      typeof record !== 'object' ||\n      typeof record.id !== 'string' ||\n      record.id.length === 0 ||\n      (record.type !== undefined && record.type !== 'function') ||\n      !fn ||\n      typeof fn !== 'object' ||\n      typeof fn.name !== 'string' ||\n      fn.name.length === 0 ||\n      typeof fn.arguments !== 'string'\n    ) {\n      throw new Error(\n        `LLM response tool_calls[${index}] is not a function call with string arguments (model=${model})`,\n      )\n    }\n    return { id: record.id, name: fn.name, argumentsJson: fn.arguments }\n  })\n}\n","import type { CostReceiptInput, CustomTokenPricing, MaximumCharge } from '../cost-ledger'\nimport type { LlmCallRequest, LlmCallResult, LlmChargeBounds } from './contract'\nimport { LlmResponseError } from './errors'\nimport { resolveMaximumAttempts } from './resilience'\nimport { buildBody } from './wire'\n\nexport function maximumChargeForLlmRequest(\n  request: Pick<\n    LlmCallRequest,\n    'model' | 'messages' | 'jsonSchema' | 'tools' | 'toolChoice' | 'maxTokens' | 'thinking'\n  >,\n  options: LlmChargeBounds = {},\n): MaximumCharge | undefined {\n  if (request.maxTokens === undefined) return undefined\n  if (!Number.isInteger(request.maxTokens) || request.maxTokens <= 0) {\n    throw new RangeError(`maximumChargeForLlmRequest: maxTokens must be a positive integer`)\n  }\n  if (\n    request.messages.some(\n      (message) =>\n        Array.isArray(message.content) && message.content.some((part) => part.type === 'image_url'),\n    )\n  ) {\n    return undefined\n  }\n\n  const attempts = resolveMaximumAttempts(options.maximumAttempts)\n  const forceJsonObject = options.jsonSchemaTransport === 'json-object'\n  // A byte-level tokenizer cannot emit more input tokens than request bytes.\n  // Pricing the complete body also covers role/schema framing omitted from content-only estimates.\n  const requestBytes = new TextEncoder().encode(\n    JSON.stringify(buildBody(request, forceJsonObject, options.thinking)),\n  ).byteLength\n  // Schema fallback shares the same physical-attempt budget; it cannot buy a second batch.\n  const usage = {\n    inputTokens: requestBytes * attempts,\n    outputTokens: request.maxTokens * attempts,\n  }\n  return options.customTokenPricing\n    ? { customTokenPricing: options.customTokenPricing, ...usage }\n    : { model: request.model, ...usage }\n}\n\n/** Convert a provider result into the canonical paid-call receipt input.\n * The receipt is JSON-clean: absent optional fields are omitted, never carried\n * as explicit-undefined keys. Receipts cross JSON boundaries (the external\n * optimizer's loopback proxy validates them with `assertJsonValue`), where an\n * explicit-undefined value is rejected as non-serializable. */\nexport function costReceiptFromLlm(\n  result: LlmCallResult,\n  customTokenPricing?: CustomTokenPricing,\n): CostReceiptInput {\n  const cachedTokens = result.usage.cachedPromptTokens ?? 0\n  const inputTokens = Math.max(0, result.usage.promptTokens - cachedTokens)\n  const providerCostUsd = providerReportedCost(result.raw)\n  return {\n    model: result.model,\n    inputTokens,\n    outputTokens: result.usage.completionTokens,\n    ...(result.usage.reasoningTokens === undefined\n      ? {}\n      : { reasoningTokens: result.usage.reasoningTokens }),\n    ...(cachedTokens > 0 ? { cachedTokens } : {}),\n    ...(providerCostUsd === undefined\n      ? customTokenPricing && result.usage.captured !== false\n        ? { customTokenPricing }\n        : result.costUsd === null\n          ? {}\n          : { estimatedCostUsd: result.costUsd }\n      : { actualCostUsd: providerCostUsd }),\n    usageUnknown: result.usage.captured === false,\n  }\n}\n\nexport function providerReportedCost(raw: Record<string, unknown>): number | undefined {\n  const value = raw._response_cost ?? raw.cost_usd\n  return typeof value === 'number' && Number.isFinite(value) && value >= 0 ? value : undefined\n}\n\n/** Structured-response failures retain their completed provider receipt. */\nexport function costReceiptFromLlmError(\n  error: Error,\n  customTokenPricing?: CustomTokenPricing,\n): CostReceiptInput | undefined {\n  return error instanceof LlmResponseError\n    ? costReceiptFromLlm(error.result, customTokenPricing)\n    : undefined\n}\n","import { combineAbortSignals } from '../abort-signal'\nimport { costForTokenPricing } from '../cost-ledger'\nimport { assertServedModel as assertServedModelIdentity } from '../integrity/served-model'\nimport { newRecordId } from '../record-id'\nimport {\n  defaultProviderRedactor,\n  type ProviderRedactor,\n  providerFromBaseUrl,\n  type RawProviderEvent,\n  type RawProviderSink,\n} from '../trace/raw-provider-sink'\nimport { providerReportedCost } from './accounting'\nimport type { LlmCallRequest, LlmCallResult, LlmClientOptions } from './contract'\nimport { LlmCallError } from './errors'\nimport {\n  backoffMs,\n  DEFAULT_TIMEOUT_MS,\n  deadlineExceeded,\n  isTransientLlmError,\n  pacingStateFor,\n  parseRetryAfter,\n  RETRYABLE_STATUS,\n  resolveMaximumAttempts,\n  resolveMinIntervalMs,\n  sleep,\n} from './resilience'\nimport {\n  buildBody,\n  buildHeaders,\n  isSchemaRejection,\n  isTemperatureOneRejection,\n  parseWireLogprobs,\n  parseWireToolCalls,\n  providerTokenCount,\n} from './wire'\n\n/**\n * Low-level call. Returns raw content + usage + cost. Retries on transient\n * failures; does NOT degrade schema here — callers that want graceful\n * degrade use `callLlmJson`.\n */\nexport async function callLlm(\n  req: LlmCallRequest,\n  opts: LlmClientOptions = {},\n): Promise<LlmCallResult> {\n  return callLlmAttempts(req, opts, false)\n}\n\n/** One retry owner for raw and structured calls. Fallback changes the next\n * request, not the attempt allowance, deadline origin, or raw-event sequence. */\nasync function callLlmAttempts(\n  req: LlmCallRequest,\n  opts: LlmClientOptions,\n  allowSchemaFallback: boolean,\n): Promise<LlmCallResult> {\n  // No default endpoint. This client is internal to the `agent-eval` binary\n  // and the loopback optimizer proxy; both name their endpoint explicitly, and\n  // a fallback would let a misconfigured caller bill an unintended provider.\n  if (!opts.baseUrl) throw new Error('callLlm: opts.baseUrl is required')\n  const baseUrl = opts.baseUrl.replace(/\\/+$/, '')\n  const url = `${baseUrl}/chat/completions`\n  const endpoint = '/chat/completions'\n  const timeoutMs = req.timeoutMs ?? opts.defaultTimeoutMs ?? DEFAULT_TIMEOUT_MS\n  const maximumAttempts = resolveMaximumAttempts(opts.maximumAttempts)\n  const minIntervalMs = resolveMinIntervalMs(opts.minIntervalMs)\n  const pacing = pacingStateFor(opts)\n  const fetchFn = opts.fetch ?? globalThis.fetch\n  const headers = buildHeaders(opts)\n  const provider = opts.provider ?? providerFromBaseUrl(baseUrl)\n  const sink = opts.rawSink\n  const redactor = opts.redactor ?? defaultProviderRedactor\n  const traceContext = opts.traceContext\n  const callerSignal = opts.signal\n  const deadlineMs = opts.deadlineMs\n  const deadlineStart = Date.now()\n  if (opts.customTokenPricing) {\n    costForTokenPricing(opts.customTokenPricing, { inputTokens: 0, outputTokens: 0 })\n  }\n\n  let lastErr: unknown\n  let effectiveRequest = req\n  const remainingMs = () =>\n    deadlineMs === undefined ? Infinity : Math.max(0, deadlineMs - (Date.now() - deadlineStart))\n  const retryDelay = (ms: number) => sleep(Math.min(ms, remainingMs()), callerSignal)\n  for (let attempt = 0; attempt < maximumAttempts; attempt++) {\n    // A caller cancel is fatal — never retried. Checking before each attempt\n    // means an already-aborted signal short-circuits without firing fetch.\n    if (callerSignal?.aborted) {\n      throw new DOMException('callLlm aborted by caller signal', 'AbortError')\n    }\n    // Stop retrying once the cross-attempt budget is spent rather than burning\n    // a full per-attempt timeout on each remaining retry.\n    if (deadlineExceeded(deadlineStart, deadlineMs)) {\n      throw lastErr instanceof Error\n        ? lastErr\n        : new DOMException('callLlm deadline exceeded', 'TimeoutError')\n    }\n    const requestBody = buildBody(\n      effectiveRequest,\n      opts.jsonSchemaTransport === 'json-object',\n      opts.thinking,\n    )\n    const controller = new AbortController()\n    const attemptSignal = combineAbortSignals(controller.signal, callerSignal)!\n    let timeoutHandle: ReturnType<typeof setTimeout> | undefined\n    let started = Date.now()\n    // An attempt cancelled or timed out while queued never reached the\n    // provider, so it leaves no request or error event in the raw log.\n    let dispatched = false\n    let attemptErrorRecorded = false\n    try {\n      if (minIntervalMs > 0) {\n        // Recheck after every wake: concurrent waiters must not dispatch a\n        // catch-up burst.\n        while (true) {\n          callerSignal?.throwIfAborted()\n          if (deadlineExceeded(deadlineStart, deadlineMs)) {\n            throw lastErr instanceof Error\n              ? lastErr\n              : new DOMException('callLlm deadline exceeded', 'TimeoutError')\n          }\n          const waitMs =\n            pacing.lastStartedAt === undefined\n              ? 0\n              : pacing.lastStartedAt + minIntervalMs - Date.now()\n          if (waitMs <= 0) break\n          await retryDelay(waitMs)\n        }\n        // Queue time consumes the operation deadline, not the HTTP timeout.\n        started = Date.now()\n      }\n      // Claim the slot before any await so a concurrent waiter cannot take it.\n      pacing.lastStartedAt = started\n      dispatched = true\n      timeoutHandle = setTimeout(() => controller.abort(), Math.min(timeoutMs, remainingMs()))\n      if (sink) {\n        await recordRaw(sink, redactor, {\n          eventId: newRecordId(),\n          runId: traceContext?.runId,\n          spanId: traceContext?.spanId,\n          provider,\n          model: req.model,\n          endpoint,\n          baseUrl,\n          attemptIndex: attempt,\n          direction: 'request',\n          timestamp: started,\n          requestHeaders: headers,\n          requestBody,\n          redactedFields: [],\n        })\n      }\n      attemptSignal.throwIfAborted()\n      const res = await fetchFn(url, {\n        method: 'POST',\n        headers,\n        body: JSON.stringify(requestBody),\n        signal: attemptSignal,\n      })\n      const responseHeaders = sink ? headersToObject(res.headers) : undefined\n      // Headers are not completion: the same timeout/cancellation covers either response body.\n      const text = await res.text()\n      attemptSignal.throwIfAborted()\n      clearTimeout(timeoutHandle)\n\n      if (!res.ok) {\n        const body = text\n        if (sink) {\n          await recordRaw(sink, redactor, {\n            eventId: newRecordId(),\n            runId: traceContext?.runId,\n            spanId: traceContext?.spanId,\n            provider,\n            model: req.model,\n            endpoint,\n            baseUrl,\n            attemptIndex: attempt,\n            direction: 'error',\n            timestamp: Date.now(),\n            durationMs: Date.now() - started,\n            statusCode: res.status,\n            responseHeaders,\n            responseBody: body,\n            errorMessage: `HTTP ${res.status}`,\n            redactedFields: [],\n          })\n          attemptErrorRecorded = true\n        }\n        const err = new LlmCallError(\n          `LLM call failed with HTTP ${res.status}`,\n          res.status,\n          body,\n          req.model,\n        )\n        if (\n          isTemperatureOneRejection(res.status, body) &&\n          effectiveRequest.temperature !== 1 &&\n          attempt < maximumAttempts - 1 &&\n          !deadlineExceeded(deadlineStart, deadlineMs)\n        ) {\n          lastErr = err\n          effectiveRequest = { ...effectiveRequest, temperature: 1 }\n          continue\n        }\n        if (\n          allowSchemaFallback &&\n          opts.jsonSchemaTransport !== 'json-object' &&\n          effectiveRequest.jsonSchema &&\n          isSchemaRejection(res.status, body) &&\n          attempt < maximumAttempts - 1 &&\n          !deadlineExceeded(deadlineStart, deadlineMs)\n        ) {\n          lastErr = err\n          effectiveRequest = { ...effectiveRequest, jsonMode: true, jsonSchema: undefined }\n          continue\n        }\n        if (\n          RETRYABLE_STATUS.has(res.status) &&\n          attempt < maximumAttempts - 1 &&\n          !deadlineExceeded(deadlineStart, deadlineMs)\n        ) {\n          lastErr = err\n          const retryAfter = parseRetryAfter(res.headers)\n          const wait = retryAfter ?? backoffMs(attempt)\n          // A wait the deadline cannot cover ends the call with this answer. Sleeping to the\n          // deadline let a timer that fired a millisecond early start one more attempt with no time\n          // left, whose abort replaced the server's status (agent-eval publish run 37238259408).\n          if (wait >= remainingMs()) {\n            // A caller abort that landed while the answer was recorded still wins, as the\n            // retry wait would have reported it.\n            callerSignal?.throwIfAborted()\n            break\n          }\n          await retryDelay(wait)\n          continue\n        }\n        throw err\n      }\n\n      let json: Record<string, unknown>\n      try {\n        json = JSON.parse(text) as Record<string, unknown>\n      } catch (parseErr) {\n        if (sink) {\n          await recordRaw(sink, redactor, {\n            eventId: newRecordId(),\n            runId: traceContext?.runId,\n            spanId: traceContext?.spanId,\n            provider,\n            model: req.model,\n            endpoint,\n            baseUrl,\n            attemptIndex: attempt,\n            direction: 'error',\n            timestamp: Date.now(),\n            durationMs: Date.now() - started,\n            statusCode: res.status,\n            responseHeaders,\n            responseBody: text,\n            errorMessage: `non-JSON response: ${parseErr instanceof Error ? parseErr.message : String(parseErr)}`,\n            redactedFields: [],\n          })\n          attemptErrorRecorded = true\n        }\n        throw parseErr\n      }\n      if (sink) {\n        await recordRaw(sink, redactor, {\n          eventId: newRecordId(),\n          runId: traceContext?.runId,\n          spanId: traceContext?.spanId,\n          provider,\n          model: req.model,\n          endpoint,\n          baseUrl,\n          attemptIndex: attempt,\n          direction: 'response',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          statusCode: res.status,\n          responseHeaders,\n          responseBody: json,\n          redactedFields: [],\n        })\n      }\n      const choice = (\n        json.choices as\n          | Array<{\n              message?: { content?: string | null; tool_calls?: unknown }\n              finish_reason?: string | null\n              logprobs?: { content?: unknown } | null\n            }>\n          | undefined\n      )?.[0]\n      const toolCalls = parseWireToolCalls(choice?.message?.tool_calls, req.model)\n      const usageRaw =\n        json.usage && typeof json.usage === 'object' && !Array.isArray(json.usage)\n          ? (json.usage as Record<string, unknown>)\n          : undefined\n      const promptTokens = providerTokenCount(usageRaw?.prompt_tokens)\n      const completionTokens = providerTokenCount(usageRaw?.completion_tokens)\n      const totalTokens = providerTokenCount(usageRaw?.total_tokens)\n      const completionDetails =\n        usageRaw?.completion_tokens_details &&\n        typeof usageRaw.completion_tokens_details === 'object' &&\n        !Array.isArray(usageRaw.completion_tokens_details)\n          ? (usageRaw.completion_tokens_details as Record<string, unknown>)\n          : undefined\n      const reasoningRaw = completionDetails?.reasoning_tokens\n      const reasoningTokens =\n        reasoningRaw === undefined ? undefined : providerTokenCount(reasoningRaw)\n      const cachedRaw =\n        usageRaw?.prompt_tokens_details &&\n        typeof usageRaw.prompt_tokens_details === 'object' &&\n        !Array.isArray(usageRaw.prompt_tokens_details)\n          ? (usageRaw.prompt_tokens_details as Record<string, unknown>).cached_tokens\n          : undefined\n      const cachedPromptTokens = cachedRaw === undefined ? undefined : providerTokenCount(cachedRaw)\n      const usageCaptured =\n        promptTokens !== undefined &&\n        completionTokens !== undefined &&\n        (reasoningRaw === undefined ||\n          (reasoningTokens !== undefined && reasoningTokens <= completionTokens)) &&\n        (cachedRaw === undefined ||\n          (cachedPromptTokens !== undefined && cachedPromptTokens <= promptTokens)) &&\n        (totalTokens === undefined || totalTokens === promptTokens + completionTokens)\n      const costFromProxy = providerReportedCost(json)\n      const content = choice?.message?.content ?? ''\n\n      const configuredCost =\n        typeof costFromProxy !== 'number' && usageCaptured && opts.customTokenPricing\n          ? costForTokenPricing(opts.customTokenPricing, {\n              inputTokens: promptTokens! - (cachedPromptTokens ?? 0),\n              ...(cachedPromptTokens ? { cachedTokens: cachedPromptTokens } : {}),\n              outputTokens: completionTokens!,\n            })\n          : undefined\n\n      // The echoed id, kept separate from the attribution id: a provider that\n      // omits it must read as \"unproven\", never as \"the model I asked for\".\n      const servedModel =\n        typeof json.model === 'string' && json.model.trim() !== '' ? json.model : null\n      if (opts.assertServedModel) {\n        assertServedModelIdentity(\n          req.model,\n          servedModel,\n          opts.assertServedModel === true ? {} : opts.assertServedModel,\n        )\n      }\n\n      return {\n        content,\n        ...(toolCalls === undefined ? {} : { toolCalls }),\n        ...(req.logprobs === undefined\n          ? {}\n          : { logprobs: parseWireLogprobs(choice?.logprobs?.content, req.model) }),\n        finishReason: choice?.finish_reason ?? null,\n        contentEmpty: content.trim().length === 0,\n        usage: {\n          promptTokens: promptTokens ?? 0,\n          completionTokens: completionTokens ?? 0,\n          totalTokens: totalTokens ?? (promptTokens ?? 0) + (completionTokens ?? 0),\n          captured: usageCaptured,\n          reasoningTokens,\n          cachedPromptTokens,\n        },\n        costUsd: typeof costFromProxy === 'number' ? costFromProxy : (configuredCost ?? null),\n        model: servedModel ?? req.model,\n        servedModel,\n        durationMs: Date.now() - started,\n        raw: json,\n      }\n    } catch (err) {\n      clearTimeout(timeoutHandle)\n      lastErr = err\n      // A caller cancel is fatal even though an AbortError matches the\n      // transient patterns — a cancelled call must surface immediately, not\n      // be retried against the same dead intent.\n      if (callerSignal?.aborted) {\n        if (sink && dispatched && !attemptErrorRecorded) {\n          await recordRaw(sink, redactor, {\n            eventId: newRecordId(),\n            runId: traceContext?.runId,\n            spanId: traceContext?.spanId,\n            provider,\n            model: req.model,\n            endpoint,\n            baseUrl,\n            attemptIndex: attempt,\n            direction: 'error',\n            timestamp: Date.now(),\n            durationMs: Date.now() - started,\n            errorMessage: err instanceof Error ? err.message : String(err),\n            redactedFields: [],\n          })\n        }\n        throw err\n      }\n      if (sink && dispatched && !attemptErrorRecorded) {\n        // Record only if neither the !res.ok branch nor the JSON.parse catch\n        // already produced an error event for this attempt. Covers network\n        // failures, timeouts, and aborts.\n        await recordRaw(sink, redactor, {\n          eventId: newRecordId(),\n          runId: traceContext?.runId,\n          spanId: traceContext?.spanId,\n          provider,\n          model: req.model,\n          endpoint,\n          baseUrl,\n          attemptIndex: attempt,\n          direction: 'error',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          errorMessage: err instanceof Error ? err.message : String(err),\n          redactedFields: [],\n        })\n      }\n      const wait = backoffMs(attempt)\n      if (\n        attempt < maximumAttempts - 1 &&\n        isTransientLlmError(err) &&\n        !deadlineExceeded(deadlineStart, deadlineMs) &&\n        wait < remainingMs()\n      ) {\n        await retryDelay(wait)\n        continue\n      }\n      callerSignal?.throwIfAborted()\n      throw err\n    } finally {\n      clearTimeout(timeoutHandle)\n    }\n  }\n  throw lastErr instanceof Error ? lastErr : new Error(String(lastErr))\n}\n\nasync function recordRaw(\n  sink: RawProviderSink,\n  redactor: ProviderRedactor,\n  event: RawProviderEvent,\n): Promise<void> {\n  // Errors from sinks must not crash the LLM call. Forensic capture is\n  // best-effort; the structured trace is the system of record.\n  try {\n    await sink.record(redactor(event))\n  } catch {\n    // Intentionally swallowed.\n  }\n}\n\nfunction headersToObject(h: Headers): Record<string, string> {\n  const out: Record<string, string> = {}\n  h.forEach((value, key) => {\n    out[key] = value\n  })\n  return out\n}\n\n/** Shared schema-to-JSON-mode fallback that preserves the raw result. */\nexport async function callLlmStructured(\n  req: LlmCallRequest,\n  opts: LlmClientOptions = {},\n): Promise<LlmCallResult> {\n  return callLlmAttempts({ ...req, jsonMode: req.jsonMode ?? !req.jsonSchema }, opts, true)\n}\n","/**\n * OpenAI-compatible client. The CLASS is internal; one transport now drives it\n * for public callers.\n *\n * agent-eval never goes looking for a credential — it reads no environment\n * variable to find one — and this module is still not reachable through any\n * export subpath. What reaches a consumer is `createChatClient({ transport:\n * 'openai-compatible', baseUrl, apiKey })`, the sanctioned public route, which\n * constructs this client from an endpoint and a credential the caller passed as\n * values. Anything richer than that transport's options stays in-repo.\n *\n * Three in-repo callers hold the class directly:\n *   - `src/analyst/chat-client.ts`, the public transport above;\n *   - the `agent-eval` binary (`src/cli-config.ts`), a deployed server whose\n *     caller is a JSON-RPC client in another language and which therefore\n *     configures its own endpoint from its own environment;\n *   - the loopback optimizer proxy path (`src/analyst/benchmark-public-model.ts`,\n *     `src/analyst/dspy-rlm-engine.ts`), which targets `http://127.0.0.1:<port>/v1`\n *     with an ephemeral token and executes nothing itself.\n *\n * The canonical request/result TYPES it defines ARE public — they are the\n * contract every caller-owned transport speaks.\n *\n * OpenAI-compatible `/v1/chat/completions` client with:\n *   - Exponential-backoff retry on 429 + 5xx gateway errors (502/503/504).\n *   - Retry on transient network errors (fetch failed, AbortError, ECONNRESET).\n *   - One retry at temperature 1 when a model explicitly requires it.\n *   - Graceful json_schema → json_object degrade on 400 with schema-reject body.\n *   - Fenced-JSON stripping (```json ... ```) for models that wrap structured output.\n *   - Configurable base URL + api key / bearer, works with LiteLLM proxies, OpenAI\n *     directly, cli-bridge subscriptions, and any router that speaks the spec.\n *\n * Usage:\n *   const { value, result } = await callLlmJson<MyType>(\n *     { model: 'gpt-4o', messages: [...], jsonSchema: { name: 'x', schema: {...} } },\n *     { baseUrl: process.env.AGENT_EVAL_LLM_BASE_URL, apiKey: process.env.AGENT_EVAL_LLM_API_KEY },\n *   )\n *\n */\n\nimport type { LlmCallRequest, LlmCallResult, LlmClientOptions } from './llm-client/contract'\nimport { parseJsonResult } from './llm-client/json'\nimport { callLlm, callLlmStructured } from './llm-client/request'\nimport {\n  pacingStateFor,\n  pacingStates,\n  resolveMaximumAttempts,\n  resolveMinIntervalMs,\n} from './llm-client/resilience'\n\nexport {\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  maximumChargeForLlmRequest,\n} from './llm-client/accounting'\nexport type {\n  LlmCallMetadata,\n  LlmCallRequest,\n  LlmCallResult,\n  LlmChargeBounds,\n  LlmClientOptions,\n  LlmMessage,\n  LlmThinkingMode,\n  LlmTokenLogprob,\n  LlmToolCall,\n  LlmToolChoice,\n  LlmToolDefinition,\n  LlmUsage,\n} from './llm-client/contract'\nexport { LlmCallError, LlmResponseError } from './llm-client/errors'\nexport { extractJsonPayload, stripFencedJson } from './llm-client/json'\nexport { callLlm } from './llm-client/request'\nexport { backoffMs, isTransientLlmError } from './llm-client/resilience'\n\n/**\n * Structured-output call. Returns parsed JSON plus the raw result envelope.\n * Degrades `jsonSchema` → `jsonMode` on a 400 that names the schema param —\n * critical for deepseek-v3/v4, kimi-k2.6, and other models that don't accept\n * the `response_format.json_schema` shape but DO accept `json_object`.\n */\nexport async function callLlmJson<T = unknown>(\n  req: LlmCallRequest,\n  opts: LlmClientOptions = {},\n): Promise<{ value: T; result: LlmCallResult }> {\n  const result = await callLlmStructured(req, opts)\n  const value = parseJsonResult<T>(result, opts.jsonPayloadMode ?? 'extract')\n  return { value, result }\n}\n\n/**\n * Stateful client — construct once with defaults, call many times.\n * Thin wrapper around the free functions; exists for callers that want\n * to inject a single configured instance into multiple primitives.\n */\nexport class LlmClient {\n  readonly maximumAttempts: number\n  private readonly opts: LlmClientOptions\n\n  constructor(opts: LlmClientOptions = {}) {\n    this.opts = opts\n    this.maximumAttempts = resolveMaximumAttempts(opts.maximumAttempts)\n    resolveMinIntervalMs(opts.minIntervalMs)\n  }\n\n  private callOptions(per?: LlmClientOptions): LlmClientOptions {\n    const options = { ...this.opts, ...per }\n    pacingStates.set(options, pacingStateFor(this.opts))\n    return options\n  }\n\n  call(req: LlmCallRequest, per?: LlmClientOptions): Promise<LlmCallResult> {\n    const options = this.callOptions(per)\n    return req.jsonSchema ? callLlmStructured(req, options) : callLlm(req, options)\n  }\n\n  callJson<T = unknown>(\n    req: LlmCallRequest,\n    per?: LlmClientOptions,\n  ): Promise<{ value: T; result: LlmCallResult }> {\n    return callLlmJson<T>(req, this.callOptions(per))\n  }\n}\n"],"mappings":";;;;;;;AACA,SAAgB,oBACd,GAAG,SACsB;CACzB,MAAM,SAAS,CACb,GAAG,IAAI,IAAI,QAAQ,QAAQ,WAAkC,WAAW,KAAA,CAAS,CAAC,CACpF;CACA,IAAI,OAAO,WAAW,GAAG,OAAO,KAAA;CAChC,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO;CACvC,OAAO,YAAY,IAAI,MAAM;AAC/B;;;;ACiBA,MAAM,kBAA+C;CACnD,WAAW;CACX,QAAQ;CACR,gBAAgB;CAChB,QAAQ;CACR,iBAAiB;CACjB,MAAM;CACN,cAAc;CACd,SAAS;CACT,WAAW;CACX,UAAU;CACV,KAAK;CACL,MAAM;CACN,SAAS;CACT,QAAQ;CACR,QAAQ;CACR,SAAS;CACT,UAAU;CACV,YAAY;CACZ,MAAM;CACN,aAAa;CACb,OAAO;CACP,SAAS;CACT,KAAK;CACL,QAAQ;CACR,KAAK;AACP;;AAGA,MAAM,gBAA8C;CAClD,CAAC,WAAW,WAAW;CAIvB,CAAC,uCAAuC,WAAW;CACnD,CAAC,0DAA0D,QAAQ;CACnE,CAAC,4BAA4B,QAAQ;CACrC,CAAC,UAAU,MAAM;CACjB,CAAC,oCAAoC,SAAS;CAC9C,CAAC,aAAa,UAAU;CACxB,CAAC,SAAS,KAAK;CACf,CAAC,SAAS,MAAM;CAChB,CAAC,oBAAoB,QAAQ;CAC7B,CAAC,qBAAqB,QAAQ;CAC9B,CAAC,sBAAsB,UAAU;CACjC,CAAC,4BAA4B,OAAO;AACtC;;;;;;;AAQA,SAAgB,YAAY,SAA8B;CACxD,MAAM,KAAK,QAAQ,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAE,YAAY;CACrD,MAAM,QAAQ,GAAG,QAAQ,GAAG;CAC5B,IAAI,QAAQ,GAAG;EACb,MAAM,SAAS,GAAG,MAAM,GAAG,KAAK;EAChC,MAAM,SAAS,gBAAgB;EAC/B,IAAI,QAAQ,OAAO;CACrB;CACA,KAAK,MAAM,CAAC,SAAS,WAAW,eAC9B,IAAI,QAAQ,KAAK,EAAE,GAAG,OAAO;CAE/B,OAAO;AACT;AAWA,IAAa,mBAAb,cAAsC,MAAM;CAGxB;CACA;CAHlB,YACE,SACA,UACA,QACA;EACA,MAAM,OAAO;EAHG,KAAA,WAAA;EACA,KAAA,SAAA;EAGhB,KAAK,OAAO;CACd;AACF;;;;;;;;;;;;;;AAeA,SAAgB,kBACd,QACA,OAAiC,CAAC,GACnB;CACf,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,2BAAW,IAAI,IAAiB;CACtC,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,IAAI,YAAY,CAAC;EACvB,IAAI,MAAM,aAAa,CAAC,KAAK,cAAc;EAC3C,SAAS,IAAI,CAAC;CAChB;CACA,MAAM,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;CAChC,IAAI,KAAK,SAAS,aAChB,MAAM,IAAI,iBACR,wBAAwB,KAAK,OAAO,iBAAiB,KAAK,WAAW,IAAI,MAAM,MAAM,IAC/E,KAAK,KAAK,IAAI,KAAK,OAAO,QAAQ,YAAY,kFAEpD,MACA,MACF;CAEF,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClEA,SAAgB,iBAAiB,SAAyB;CACxD,IAAI,KAAK,QAAQ,KAAK,CAAC,CAAC,YAAY;CACpC,MAAM,KAAK,GAAG,QAAQ,GAAG;CACzB,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,EAAE;CAC/B,MAAM,QAAQ,GAAG,QAAQ,GAAG;CAC5B,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK;CACrC,MAAM,QAAQ,GAAG,YAAY,GAAG;CAChC,IAAI,SAAS,GAAG,KAAK,GAAG,MAAM,QAAQ,CAAC;CACvC,OAAO,GACJ,QAAQ,uBAAuB,EAAE,CAAC,CAClC,QAAQ,WAAW,EAAE,CAAC,CACtB,QAAQ,SAAS,GAAG,CAAC,CACrB,QAAQ,OAAO,EAAE,CAAC,CAClB,KAAK;AACV;;;;;;;;;;;AAYA,SAAgB,iBACd,WACA,QACkB;CAClB,MAAM,kBAAkB,YAAY,SAAS;CAC7C,IAAI,WAAW,QAAQ,WAAW,KAAA,KAAa,OAAO,KAAK,MAAM,IAC/D,OAAO;EACL;EACA,QAAQ;EACR;EACA,cAAc;EACd,SAAS;EACT,aAAa;CACf;CAEF,MAAM,eAAe,YAAY,MAAM;CACvC,IAAI,UAAU,KAAK,CAAC,CAAC,YAAY,MAAM,OAAO,KAAK,CAAC,CAAC,YAAY,GAC/D,OAAO;EACL;EACA;EACA;EACA;EACA,SAAS;EACT,aAAa;CACf;CAEF,IAAI,iBAAiB,SAAS,MAAM,iBAAiB,MAAM,GACzD,OAAO;EACL;EACA;EACA;EACA;EACA,SAAS;EACT,aAAa;CACf;CAEF,OAAO;EACL;EACA;EACA;EACA;EACA,SACE,oBAAoB,eAAe,8BAA8B;EACnE,aAAa;CACf;AACF;AAEA,IAAa,yBAAb,cAA4C,eAAe;CAGvC;CAFlB,YACE,SACA,QACA;EACA,MAAM,sBAAsB,OAAO;EAFnB,KAAA,SAAA;EAGhB,KAAK,OAAO;CACd;AACF;AAWA,SAAgB,wBACd,OACA,OACgD;CAChD,IAAI,UAAU,KAAA,KAAa,UAAU,WAAW,UAAU,uBACxD,MAAM,IAAI,MAAM,GAAG,MAAM,0CAA0C;AAEvE;;;;;;AAuBA,SAAgB,sBACd,OACA,OAAiC,CAAC,GACzB;CACT,QAAQ,MAAM,SAAd;EACE,KAAK;EACL,KAAK,SACH,OAAO;EACT,KAAK,cACH,OAAO,KAAK,oBAAoB;EAClC,KAAK,6BACH,OAAO,KAAK,sBAAsB;EACpC,SACE,OAAO;CACX;AACF;AAEA,SAAS,SAAS,OAAiC;CACjD,IAAI,MAAM,YAAY,cACpB,OAAO,GAAG,MAAM,UAAU;CAC5B,OACE,GAAG,MAAM,UAAU,IAAI,MAAM,gBAAgB,aAAa,MAAM,OAAO,IACnE,MAAM,aAAa,KAAK,MAAM,QAAQ;AAE9C;;;;;;AAOA,SAAgB,kBACd,WACA,QACA,OAAiC,CAAC,GAChB;CAClB,MAAM,QAAQ,iBAAiB,WAAW,MAAM;CAChD,IAAI,sBAAsB,OAAO,IAAI,GAAG,OAAO;CAE/C,MAAM,IAAI,uBACR,GAFa,KAAK,UAAU,GAAG,KAAK,QAAQ,MAAM,GAExC,uBAAuB,SAAS,KAAK,EAAE,gIAEjD,CAAC,KAAK,CACR;AACF;;;;;AAMA,SAAgB,mBACd,OACA,OAAiC,CAAC,GACd;CACpB,MAAM,SAAS,MAAM,KAAK,MAAM,iBAAiB,EAAE,WAAW,EAAE,MAAM,CAAC;CACvE,MAAM,MAAM,OAAO,QAAQ,MAAM,CAAC,sBAAsB,GAAG,IAAI,CAAC;CAChE,IAAI,IAAI,SAAS,GAEf,MAAM,IAAI,uBACR,GAFa,KAAK,UAAU,GAAG,KAAK,QAAQ,MAAM,KAEtC,IAAI,OAAO,GAAG,OAAO,OAAO,+DACvB,IAAI,IAAI,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE,6FAE9C,MACF;CAEF,OAAO;AACT;AASA,IAAa,yBAAb,cAA4C,eAAe;CAGvC;CACA;CAHlB,YACE,SACA,UACA,QACA;EACA,MAAM,sBAAsB,OAAO;EAHnB,KAAA,WAAA;EACA,KAAA,SAAA;EAGhB,KAAK,OAAO;CACd;AACF;;;;;;;;;;AAWA,SAAgB,wBACd,OACA,OAAuC,CAAC,GACzB;CACf,MAAM,SAAS,mBAAmB,OAAO,IAAI;CAC7C,MAAM,2BAAW,IAAI,IAAiB;CACtC,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW,MAAM;EACrB,IAAI,WAAW,aAAa,CAAC,KAAK,cAAc;EAChD,SAAS,IAAI,MAAM;CACrB;CACA,MAAM,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;CAChC,MAAM,cAAc,KAAK,eAAe;CACxC,IAAI,KAAK,SAAS,aAEhB,MAAM,IAAI,uBACR,GAFa,KAAK,UAAU,GAAG,KAAK,QAAQ,MAAM,GAExC,gCAAgC,KAAK,OAAO,iBACjD,KAAK,WAAW,IAAI,MAAM,MAAM,IAAI,KAAK,KAAK,IAAI,KAAK,OAAO,QAAQ,YAAY,0BAC3D,OAAO,KAAK,MAAM,EAAE,UAAU,YAAY,CAAC,CAAC,KAAK,IAAI,KACjF,MACA,MACF;CAEF,OAAO;AACT;;;ACzTA,MAAa,qBAAqB,OAAO,QAAQ,IAAI,qBAAqB,KAAK;AAE/E,MAAM,2BACJ,QAAQ,IAAI,gCAAgC,KAAA,IACxC,IACA,OAAO,QAAQ,IAAI,2BAA2B;AAEpD,SAAgB,uBAAuB,YAAwC;CAC7E,MAAM,WAAW,cAAc;CAC/B,IAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,YAAY,GAC7C,MAAM,IAAI,WAAW,iDAAiD;CAExE,OAAO;AACT;AAEA,SAAgB,qBAAqB,YAAwC;CAC3E,MAAM,WAAW,cAAc;CAC/B,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,GAC3C,MAAM,IAAI,WAAW,wDAAwD;CAE/E,OAAO;AACT;AAIA,MAAa,+BAAe,IAAI,QAAsD;AAEtF,SAAgB,eAAe,MAAoD;CACjF,IAAI,QAAQ,aAAa,IAAI,IAAI;CACjC,IAAI,CAAC,OAAO;EACV,QAAQ,CAAC;EACT,aAAa,IAAI,MAAM,KAAK;CAC9B;CACA,OAAO;AACT;AAKA,MAAa,mCAAmB,IAAI,IAAI;CAAC;CAAK;CAAK;CAAK;CAAK;CAAK;AAAG,CAAC;;;;;;;;;;AAWtE,MAAM,2BAA8C;CAClD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;;;AAaA,SAAgB,oBAAoB,KAAuB;CACzD,OAAO,kBAAkB,KAAK,CAAC;AACjC;AAEA,SAAS,kBAAkB,KAAc,OAAwB;CAC/D,IAAI,eAAe,cAAc,OAAO,iBAAiB,IAAI,IAAI,MAAM;CACvE,IAAI,EAAE,eAAe,QAAQ,OAAO;CAGpC,MAAM,SAAU,IAA6B;CAC7C,IAAI,OAAO,WAAW,YAAY,iBAAiB,IAAI,MAAM,GAAG,OAAO;CACvE,MAAM,OAAQ,IAA2B;CACzC,MAAM,WAAW,GAAG,IAAI,KAAK,IAAI,IAAI,QAAQ,IAAI,OAAO,SAAS,WAAW,OAAO;CACnF,IAAI,yBAAyB,MAAM,MAAM,EAAE,KAAK,QAAQ,CAAC,GAAG,OAAO;CACnE,MAAM,QAAS,IAA4B;CAC3C,IAAI,QAAQ,KAAK,iBAAiB,SAAS,UAAU,KACnD,OAAO,kBAAkB,OAAO,QAAQ,CAAC;CAE3C,OAAO;AACT;AAEA,SAAgB,gBAAgB,SAAiC;CAC/D,MAAM,IAAI,QAAQ,IAAI,aAAa,CAAC,EAAE,KAAK;CAC3C,IAAI,CAAC,GAAG,OAAO;CACf,MAAM,WAAW,OAAO,CAAC;CACzB,IAAI,CAAC,OAAO,MAAM,QAAQ,GAAG;EAC3B,MAAM,QAAQ,WAAW;EACzB,OAAO,OAAO,SAAS,KAAK,KAAK,SAAS,IAAI,QAAQ;CACxD;CACA,MAAM,SAAS,KAAK,MAAM,CAAC;CAC3B,IAAI,OAAO,SAAS,MAAM,GAAG,OAAO,KAAK,IAAI,GAAG,SAAS,KAAK,IAAI,CAAC;CACnE,OAAO;AACT;;AAGA,SAAgB,UAAU,SAAyB;CACjD,OAAO,KAAK,IAAI,MAAM,KAAK,SAAS,IAAM;AAC5C;;AAGA,eAAsB,MAAM,IAAY,QAAqC;CAG3E,GAAG;EACD,QAAQ,eAAe;EACvB,MAAM,QAAQ,KAAK,IAAI,KAAK,KAAK,EAAE,GAAG,UAAa;EACnD,MAAM,IAAI,SAAe,SAAS,WAAW;GAC3C,MAAM,gBAAgB;IACpB,aAAa,KAAK;IAClB,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,OAAO,QAAQ,MAAM;GACvB;GACA,MAAM,QAAQ,iBAAiB;IAC7B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV,GAAG,KAAK;GACR,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EAC3D,CAAC;EACD,MAAM;CACR,SAAS,KAAK;AAChB;;AAGA,SAAgB,iBAAiB,OAAe,YAAyC;CACvF,OAAO,cAAc,QAAQ,KAAK,IAAI,IAAI,SAAS;AACrD;;;AClJA,SAAgB,mBAAmB,OAAoC;CACrE,OAAO,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAA;AAC1F;AAEA,SAAgB,aAAa,MAAgD;CAC3E,MAAM,UAAkC;EACtC,gBAAgB;EAChB,QAAQ;CACV;CACA,IAAI,KAAK,YACP,QAAQ,KAAK,WAAW,QAAQ,KAAK,WAAW;MAC3C,IAAI,KAAK,UAAU,KAAK,QAC7B,QAAQ,gBAAgB,UAAU,KAAK,UAAU,KAAK;CAExD,IAAI,KAAK,gBAAgB,QAAQ,qBAAqB,KAAK;CAC3D,OAAO;AACT;AAEA,SAAgB,kBAAkB,QAAgB,MAAuB;CACvE,IAAI,WAAW,KAAK,OAAO;CAC3B,MAAM,QAAQ,KAAK,YAAY;CAC/B,OACE,MAAM,SAAS,iBAAiB,KAChC,MAAM,SAAS,aAAa,KAC5B,MAAM,SAAS,gBAAgB,KAC/B,MAAM,SAAS,eAAe;AAElC;AAEA,SAAgB,0BAA0B,QAAgB,MAAuB;CAC/E,IAAI,WAAW,OAAO,CAAC,eAAe,KAAK,IAAI,GAAG,OAAO;CACzD,OACE,iGAAiG,KAC/F,IACF,KAAK,oEAAoE,KAAK,IAAI;AAEtF;AAEA,SAAgB,UACd,KACA,iBACA,iBACyB;CACzB,MAAM,OAAgC;EACpC,OAAO,IAAI;EACX,UAAU,IAAI,SAAS,IAAI,iBAAiB;EAC5C,aAAa,IAAI,eAAe;CAClC;CACA,IAAI,IAAI,aAAa,MAAM;EACzB,IAAI,wBAAwB,IAAI,KAAK,GAAG,KAAK,wBAAwB,IAAI;OACpE,KAAK,aAAa,IAAI;CAC7B;CACA,IAAI,IAAI,aAAa,KAAA,GAAW;EAC9B,KAAK,WAAW;EAChB,KAAK,eAAe,IAAI,SAAS;CACnC;CACA,IAAI,IAAI,UAAU,KAAA,GAAW,KAAK,QAAQ,IAAI;CAC9C,IAAI,IAAI,eAAe,KAAA,GAAW,KAAK,cAAc,IAAI;CACzD,MAAM,WAAW,IAAI,YAAY;CACjC,IAAI,aAAa,KAAA,GACf,KAAK,WAAW,EAAE,MAAM,SAAS;CAGnC,IAAI,IAAI,cAAc,CAAC,iBACrB,KAAK,kBAAkB;EACrB,MAAM;EACN,aAAa;GAAE,MAAM,IAAI,WAAW;GAAM,QAAQ,IAAI,WAAW;GAAQ,QAAQ;EAAK;CACxF;MACK,IAAI,IAAI,YAAY,IAAI,YAC7B,KAAK,kBAAkB,EAAE,MAAM,cAAc;CAG/C,OAAO;AACT;AAEA,SAAS,wBAAwB,OAAwB;CACvD,OAAO,oBAAoB,KAAK,KAAK;AACvC;;AAGA,SAAS,kBAAkB,SAA8C;CACvE,IAAI,QAAQ,SAAS,QACnB,OAAO;EAAE,MAAM;EAAQ,cAAc,QAAQ;EAAY,SAAS,QAAQ;CAAQ;CAEpF,IAAI,QAAQ,cAAc,KAAA,GACxB,OAAO;EAAE,MAAM,QAAQ;EAAM,SAAS,QAAQ;CAAQ;CAExD,OAAO;EACL,MAAM,QAAQ;EACd,SAAS,QAAQ;EACjB,YAAY,QAAQ,UAAU,KAAK,UAAU;GAC3C,IAAI,KAAK;GACT,MAAM;GACN,UAAU;IAAE,MAAM,KAAK;IAAM,WAAW,KAAK;GAAc;EAC7D,EAAE;CACJ;AACF;;;;;;;AAQA,SAAgB,kBACd,OACA,OACuC;CACvC,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;CAClD,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,MAAM,yDAAyD,MAAM,EAAE;CAEnF,OAAO,MAAM,KAAK,OAAO,UAAU;EACjC,MAAM,SAAS;EACf,IACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,OAAO,UAAU,YACxB,OAAO,OAAO,YAAY,YAC1B,CAAC,OAAO,SAAS,OAAO,OAAO,GAE/B,MAAM,IAAI,MACR,iCAAiC,MAAM,gDAAgD,MAAM,EAC/F;EAEF,MAAM,MAAM,OAAO;EACnB,IAAI,QAAQ,KAAA,KAAa,QAAQ,QAAQ,CAAC,MAAM,QAAQ,GAAG,GACzD,MAAM,IAAI,MACR,iCAAiC,MAAM,yCAAyC,MAAM,EACxF;EAEF,OAAO;GACL,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,MAAM,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,EAAA,CAAG,KAAK,aAAa,aAAa;IAClE,MAAM,YAAY;IAClB,IACE,CAAC,aACD,OAAO,cAAc,YACrB,OAAO,UAAU,UAAU,YAC3B,OAAO,UAAU,YAAY,YAC7B,CAAC,OAAO,SAAS,UAAU,OAAO,GAElC,MAAM,IAAI,MACR,iCAAiC,MAAM,iBAAiB,SAAS,gDAAgD,MAAM,EACzH;IAEF,OAAO;KAAE,OAAO,UAAU;KAAO,SAAS,UAAU;IAAQ;GAC9D,CAAC;EACH;CACF,CAAC;AACH;;;AAIA,SAAgB,mBAAmB,OAAgB,OAA0C;CAC3F,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO,KAAA;CAClD,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,MAAM,mDAAmD,MAAM,EAAE;CAE7E,IAAI,MAAM,WAAW,GAAG,OAAO,KAAA;CAC/B,OAAO,MAAM,KAAK,OAAO,UAAU;EACjC,MAAM,SAAS;EAKf,MAAM,KAAK,UAAU,OAAO,WAAW,WAAW,OAAO,WAAW,KAAA;EACpE,IACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,OAAO,OAAO,YACrB,OAAO,GAAG,WAAW,KACpB,OAAO,SAAS,KAAA,KAAa,OAAO,SAAS,cAC9C,CAAC,MACD,OAAO,OAAO,YACd,OAAO,GAAG,SAAS,YACnB,GAAG,KAAK,WAAW,KACnB,OAAO,GAAG,cAAc,UAExB,MAAM,IAAI,MACR,2BAA2B,MAAM,wDAAwD,MAAM,EACjG;EAEF,OAAO;GAAE,IAAI,OAAO;GAAI,MAAM,GAAG;GAAM,eAAe,GAAG;EAAU;CACrE,CAAC;AACH;;;AC7LA,SAAgB,2BACd,SAIA,UAA2B,CAAC,GACD;CAC3B,IAAI,QAAQ,cAAc,KAAA,GAAW,OAAO,KAAA;CAC5C,IAAI,CAAC,OAAO,UAAU,QAAQ,SAAS,KAAK,QAAQ,aAAa,GAC/D,MAAM,IAAI,WAAW,kEAAkE;CAEzF,IACE,QAAQ,SAAS,MACd,YACC,MAAM,QAAQ,QAAQ,OAAO,KAAK,QAAQ,QAAQ,MAAM,SAAS,KAAK,SAAS,WAAW,CAC9F,GAEA;CAGF,MAAM,WAAW,uBAAuB,QAAQ,eAAe;CAC/D,MAAM,kBAAkB,QAAQ,wBAAwB;CAOxD,MAAM,QAAQ;EACZ,aALmB,IAAI,YAAY,CAAC,CAAC,OACrC,KAAK,UAAU,UAAU,SAAS,iBAAiB,QAAQ,QAAQ,CAAC,CACtE,CAAC,CAAC,aAG4B;EAC5B,cAAc,QAAQ,YAAY;CACpC;CACA,OAAO,QAAQ,qBACX;EAAE,oBAAoB,QAAQ;EAAoB,GAAG;CAAM,IAC3D;EAAE,OAAO,QAAQ;EAAO,GAAG;CAAM;AACvC;;;;;;AAOA,SAAgB,mBACd,QACA,oBACkB;CAClB,MAAM,eAAe,OAAO,MAAM,sBAAsB;CACxD,MAAM,cAAc,KAAK,IAAI,GAAG,OAAO,MAAM,eAAe,YAAY;CACxE,MAAM,kBAAkB,qBAAqB,OAAO,GAAG;CACvD,OAAO;EACL,OAAO,OAAO;EACd;EACA,cAAc,OAAO,MAAM;EAC3B,GAAI,OAAO,MAAM,oBAAoB,KAAA,IACjC,CAAC,IACD,EAAE,iBAAiB,OAAO,MAAM,gBAAgB;EACpD,GAAI,eAAe,IAAI,EAAE,aAAa,IAAI,CAAC;EAC3C,GAAI,oBAAoB,KAAA,IACpB,sBAAsB,OAAO,MAAM,aAAa,QAC9C,EAAE,mBAAmB,IACrB,OAAO,YAAY,OACjB,CAAC,IACD,EAAE,kBAAkB,OAAO,QAAQ,IACvC,EAAE,eAAe,gBAAgB;EACrC,cAAc,OAAO,MAAM,aAAa;CAC1C;AACF;AAEA,SAAgB,qBAAqB,KAAkD;CACrF,MAAM,QAAQ,IAAI,kBAAkB,IAAI;CACxC,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAA;AACrF;;AAGA,SAAgB,wBACd,OACA,oBAC8B;CAC9B,OAAO,iBAAiB,mBACpB,mBAAmB,MAAM,QAAQ,kBAAkB,IACnD,KAAA;AACN;;;;;;;;AC9CA,eAAsB,QACpB,KACA,OAAyB,CAAC,GACF;CACxB,OAAO,gBAAgB,KAAK,MAAM,KAAK;AACzC;;;AAIA,eAAe,gBACb,KACA,MACA,qBACwB;CAIxB,IAAI,CAAC,KAAK,SAAS,MAAM,IAAI,MAAM,mCAAmC;CACtE,MAAM,UAAU,KAAK,QAAQ,QAAQ,QAAQ,EAAE;CAC/C,MAAM,MAAM,GAAG,QAAQ;CACvB,MAAM,WAAW;CACjB,MAAM,YAAY,IAAI,aAAa,KAAK,oBAAoB;CAC5D,MAAM,kBAAkB,uBAAuB,KAAK,eAAe;CACnE,MAAM,gBAAgB,qBAAqB,KAAK,aAAa;CAC7D,MAAM,SAAS,eAAe,IAAI;CAClC,MAAM,UAAU,KAAK,SAAS,WAAW;CACzC,MAAM,UAAU,aAAa,IAAI;CACjC,MAAM,WAAW,KAAK,YAAY,oBAAoB,OAAO;CAC7D,MAAM,OAAO,KAAK;CAClB,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,eAAe,KAAK;CAC1B,MAAM,eAAe,KAAK;CAC1B,MAAM,aAAa,KAAK;CACxB,MAAM,gBAAgB,KAAK,IAAI;CAC/B,IAAI,KAAK,oBACP,oBAAoB,KAAK,oBAAoB;EAAE,aAAa;EAAG,cAAc;CAAE,CAAC;CAGlF,IAAI;CACJ,IAAI,mBAAmB;CACvB,MAAM,oBACJ,eAAe,KAAA,IAAY,WAAW,KAAK,IAAI,GAAG,cAAc,KAAK,IAAI,IAAI,cAAc;CAC7F,MAAM,cAAc,OAAe,MAAM,KAAK,IAAI,IAAI,YAAY,CAAC,GAAG,YAAY;CAClF,KAAK,IAAI,UAAU,GAAG,UAAU,iBAAiB,WAAW;EAG1D,IAAI,cAAc,SAChB,MAAM,IAAI,aAAa,oCAAoC,YAAY;EAIzE,IAAI,iBAAiB,eAAe,UAAU,GAC5C,MAAM,mBAAmB,QACrB,UACA,IAAI,aAAa,6BAA6B,cAAc;EAElE,MAAM,cAAc,UAClB,kBACA,KAAK,wBAAwB,eAC7B,KAAK,QACP;EACA,MAAM,aAAa,IAAI,gBAAgB;EACvC,MAAM,gBAAgB,oBAAoB,WAAW,QAAQ,YAAY;EACzE,IAAI;EACJ,IAAI,UAAU,KAAK,IAAI;EAGvB,IAAI,aAAa;EACjB,IAAI,uBAAuB;EAC3B,IAAI;GACF,IAAI,gBAAgB,GAAG;IAGrB,OAAO,MAAM;KACX,cAAc,eAAe;KAC7B,IAAI,iBAAiB,eAAe,UAAU,GAC5C,MAAM,mBAAmB,QACrB,UACA,IAAI,aAAa,6BAA6B,cAAc;KAElE,MAAM,SACJ,OAAO,kBAAkB,KAAA,IACrB,IACA,OAAO,gBAAgB,gBAAgB,KAAK,IAAI;KACtD,IAAI,UAAU,GAAG;KACjB,MAAM,WAAW,MAAM;IACzB;IAEA,UAAU,KAAK,IAAI;GACrB;GAEA,OAAO,gBAAgB;GACvB,aAAa;GACb,gBAAgB,iBAAiB,WAAW,MAAM,GAAG,KAAK,IAAI,WAAW,YAAY,CAAC,CAAC;GACvF,IAAI,MACF,MAAM,UAAU,MAAM,UAAU;IAC9B,SAAS,YAAY;IACrB,OAAO,cAAc;IACrB,QAAQ,cAAc;IACtB;IACA,OAAO,IAAI;IACX;IACA;IACA,cAAc;IACd,WAAW;IACX,WAAW;IACX,gBAAgB;IAChB;IACA,gBAAgB,CAAC;GACnB,CAAC;GAEH,cAAc,eAAe;GAC7B,MAAM,MAAM,MAAM,QAAQ,KAAK;IAC7B,QAAQ;IACR;IACA,MAAM,KAAK,UAAU,WAAW;IAChC,QAAQ;GACV,CAAC;GACD,MAAM,kBAAkB,OAAO,gBAAgB,IAAI,OAAO,IAAI,KAAA;GAE9D,MAAM,OAAO,MAAM,IAAI,KAAK;GAC5B,cAAc,eAAe;GAC7B,aAAa,aAAa;GAE1B,IAAI,CAAC,IAAI,IAAI;IACX,MAAM,OAAO;IACb,IAAI,MAAM;KACR,MAAM,UAAU,MAAM,UAAU;MAC9B,SAAS,YAAY;MACrB,OAAO,cAAc;MACrB,QAAQ,cAAc;MACtB;MACA,OAAO,IAAI;MACX;MACA;MACA,cAAc;MACd,WAAW;MACX,WAAW,KAAK,IAAI;MACpB,YAAY,KAAK,IAAI,IAAI;MACzB,YAAY,IAAI;MAChB;MACA,cAAc;MACd,cAAc,QAAQ,IAAI;MAC1B,gBAAgB,CAAC;KACnB,CAAC;KACD,uBAAuB;IACzB;IACA,MAAM,MAAM,IAAI,aACd,6BAA6B,IAAI,UACjC,IAAI,QACJ,MACA,IAAI,KACN;IACA,IACE,0BAA0B,IAAI,QAAQ,IAAI,KAC1C,iBAAiB,gBAAgB,KACjC,UAAU,kBAAkB,KAC5B,CAAC,iBAAiB,eAAe,UAAU,GAC3C;KACA,UAAU;KACV,mBAAmB;MAAE,GAAG;MAAkB,aAAa;KAAE;KACzD;IACF;IACA,IACE,uBACA,KAAK,wBAAwB,iBAC7B,iBAAiB,cACjB,kBAAkB,IAAI,QAAQ,IAAI,KAClC,UAAU,kBAAkB,KAC5B,CAAC,iBAAiB,eAAe,UAAU,GAC3C;KACA,UAAU;KACV,mBAAmB;MAAE,GAAG;MAAkB,UAAU;MAAM,YAAY,KAAA;KAAU;KAChF;IACF;IACA,IACE,iBAAiB,IAAI,IAAI,MAAM,KAC/B,UAAU,kBAAkB,KAC5B,CAAC,iBAAiB,eAAe,UAAU,GAC3C;KACA,UAAU;KAEV,MAAM,OADa,gBAAgB,IAAI,OACjB,KAAK,UAAU,OAAO;KAI5C,IAAI,QAAQ,YAAY,GAAG;MAGzB,cAAc,eAAe;MAC7B;KACF;KACA,MAAM,WAAW,IAAI;KACrB;IACF;IACA,MAAM;GACR;GAEA,IAAI;GACJ,IAAI;IACF,OAAO,KAAK,MAAM,IAAI;GACxB,SAAS,UAAU;IACjB,IAAI,MAAM;KACR,MAAM,UAAU,MAAM,UAAU;MAC9B,SAAS,YAAY;MACrB,OAAO,cAAc;MACrB,QAAQ,cAAc;MACtB;MACA,OAAO,IAAI;MACX;MACA;MACA,cAAc;MACd,WAAW;MACX,WAAW,KAAK,IAAI;MACpB,YAAY,KAAK,IAAI,IAAI;MACzB,YAAY,IAAI;MAChB;MACA,cAAc;MACd,cAAc,sBAAsB,oBAAoB,QAAQ,SAAS,UAAU,OAAO,QAAQ;MAClG,gBAAgB,CAAC;KACnB,CAAC;KACD,uBAAuB;IACzB;IACA,MAAM;GACR;GACA,IAAI,MACF,MAAM,UAAU,MAAM,UAAU;IAC9B,SAAS,YAAY;IACrB,OAAO,cAAc;IACrB,QAAQ,cAAc;IACtB;IACA,OAAO,IAAI;IACX;IACA;IACA,cAAc;IACd,WAAW;IACX,WAAW,KAAK,IAAI;IACpB,YAAY,KAAK,IAAI,IAAI;IACzB,YAAY,IAAI;IAChB;IACA,cAAc;IACd,gBAAgB,CAAC;GACnB,CAAC;GAEH,MAAM,SACJ,KAAK,UAOH;GACJ,MAAM,YAAY,mBAAmB,QAAQ,SAAS,YAAY,IAAI,KAAK;GAC3E,MAAM,WACJ,KAAK,SAAS,OAAO,KAAK,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK,KAAK,IACpE,KAAK,QACN,KAAA;GACN,MAAM,eAAe,mBAAmB,UAAU,aAAa;GAC/D,MAAM,mBAAmB,mBAAmB,UAAU,iBAAiB;GACvE,MAAM,cAAc,mBAAmB,UAAU,YAAY;GAO7D,MAAM,gBALJ,UAAU,6BACV,OAAO,SAAS,8BAA8B,YAC9C,CAAC,MAAM,QAAQ,SAAS,yBAAyB,IAC5C,SAAS,4BACV,KAAA,EAAA,EACkC;GACxC,MAAM,kBACJ,iBAAiB,KAAA,IAAY,KAAA,IAAY,mBAAmB,YAAY;GAC1E,MAAM,YACJ,UAAU,yBACV,OAAO,SAAS,0BAA0B,YAC1C,CAAC,MAAM,QAAQ,SAAS,qBAAqB,IACxC,SAAS,sBAAkD,gBAC5D,KAAA;GACN,MAAM,qBAAqB,cAAc,KAAA,IAAY,KAAA,IAAY,mBAAmB,SAAS;GAC7F,MAAM,gBACJ,iBAAiB,KAAA,KACjB,qBAAqB,KAAA,MACpB,iBAAiB,KAAA,KACf,oBAAoB,KAAA,KAAa,mBAAmB,sBACtD,cAAc,KAAA,KACZ,uBAAuB,KAAA,KAAa,sBAAsB,kBAC5D,gBAAgB,KAAA,KAAa,gBAAgB,eAAe;GAC/D,MAAM,gBAAgB,qBAAqB,IAAI;GAC/C,MAAM,UAAU,QAAQ,SAAS,WAAW;GAE5C,MAAM,iBACJ,OAAO,kBAAkB,YAAY,iBAAiB,KAAK,qBACvD,oBAAoB,KAAK,oBAAoB;IAC3C,aAAa,gBAAiB,sBAAsB;IACpD,GAAI,qBAAqB,EAAE,cAAc,mBAAmB,IAAI,CAAC;IACjE,cAAc;GAChB,CAAC,IACD,KAAA;GAIN,MAAM,cACJ,OAAO,KAAK,UAAU,YAAY,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,QAAQ;GAC5E,IAAI,KAAK,mBACP,kBACE,IAAI,OACJ,aACA,KAAK,sBAAsB,OAAO,CAAC,IAAI,KAAK,iBAC9C;GAGF,OAAO;IACL;IACA,GAAI,cAAc,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU;IAC/C,GAAI,IAAI,aAAa,KAAA,IACjB,CAAC,IACD,EAAE,UAAU,kBAAkB,QAAQ,UAAU,SAAS,IAAI,KAAK,EAAE;IACxE,cAAc,QAAQ,iBAAiB;IACvC,cAAc,QAAQ,KAAK,CAAC,CAAC,WAAW;IACxC,OAAO;KACL,cAAc,gBAAgB;KAC9B,kBAAkB,oBAAoB;KACtC,aAAa,gBAAgB,gBAAgB,MAAM,oBAAoB;KACvE,UAAU;KACV;KACA;IACF;IACA,SAAS,OAAO,kBAAkB,WAAW,gBAAiB,kBAAkB;IAChF,OAAO,eAAe,IAAI;IAC1B;IACA,YAAY,KAAK,IAAI,IAAI;IACzB,KAAK;GACP;EACF,SAAS,KAAK;GACZ,aAAa,aAAa;GAC1B,UAAU;GAIV,IAAI,cAAc,SAAS;IACzB,IAAI,QAAQ,cAAc,CAAC,sBACzB,MAAM,UAAU,MAAM,UAAU;KAC9B,SAAS,YAAY;KACrB,OAAO,cAAc;KACrB,QAAQ,cAAc;KACtB;KACA,OAAO,IAAI;KACX;KACA;KACA,cAAc;KACd,WAAW;KACX,WAAW,KAAK,IAAI;KACpB,YAAY,KAAK,IAAI,IAAI;KACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;KAC7D,gBAAgB,CAAC;IACnB,CAAC;IAEH,MAAM;GACR;GACA,IAAI,QAAQ,cAAc,CAAC,sBAIzB,MAAM,UAAU,MAAM,UAAU;IAC9B,SAAS,YAAY;IACrB,OAAO,cAAc;IACrB,QAAQ,cAAc;IACtB;IACA,OAAO,IAAI;IACX;IACA;IACA,cAAc;IACd,WAAW;IACX,WAAW,KAAK,IAAI;IACpB,YAAY,KAAK,IAAI,IAAI;IACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;IAC7D,gBAAgB,CAAC;GACnB,CAAC;GAEH,MAAM,OAAO,UAAU,OAAO;GAC9B,IACE,UAAU,kBAAkB,KAC5B,oBAAoB,GAAG,KACvB,CAAC,iBAAiB,eAAe,UAAU,KAC3C,OAAO,YAAY,GACnB;IACA,MAAM,WAAW,IAAI;IACrB;GACF;GACA,cAAc,eAAe;GAC7B,MAAM;EACR,UAAU;GACR,aAAa,aAAa;EAC5B;CACF;CACA,MAAM,mBAAmB,QAAQ,UAAU,IAAI,MAAM,OAAO,OAAO,CAAC;AACtE;AAEA,eAAe,UACb,MACA,UACA,OACe;CAGf,IAAI;EACF,MAAM,KAAK,OAAO,SAAS,KAAK,CAAC;CACnC,QAAQ,CAER;AACF;AAEA,SAAS,gBAAgB,GAAoC;CAC3D,MAAM,MAA8B,CAAC;CACrC,EAAE,SAAS,OAAO,QAAQ;EACxB,IAAI,OAAO;CACb,CAAC;CACD,OAAO;AACT;;AAGA,eAAsB,kBACpB,KACA,OAAyB,CAAC,GACF;CACxB,OAAO,gBAAgB;EAAE,GAAG;EAAK,UAAU,IAAI,YAAY,CAAC,IAAI;CAAW,GAAG,MAAM,IAAI;AAC1F;;;;;;;;;ACjYA,eAAsB,YACpB,KACA,OAAyB,CAAC,GACoB;CAC9C,MAAM,SAAS,MAAM,kBAAkB,KAAK,IAAI;CAEhD,OAAO;EAAE,OADK,gBAAmB,QAAQ,KAAK,mBAAmB,SACpD;EAAG;CAAO;AACzB;;;;;;AAOA,IAAa,YAAb,MAAuB;CACrB;CACA;CAEA,YAAY,OAAyB,CAAC,GAAG;EACvC,KAAK,OAAO;EACZ,KAAK,kBAAkB,uBAAuB,KAAK,eAAe;EAClE,qBAAqB,KAAK,aAAa;CACzC;CAEA,YAAoB,KAA0C;EAC5D,MAAM,UAAU;GAAE,GAAG,KAAK;GAAM,GAAG;EAAI;EACvC,aAAa,IAAI,SAAS,eAAe,KAAK,IAAI,CAAC;EACnD,OAAO;CACT;CAEA,KAAK,KAAqB,KAAgD;EACxE,MAAM,UAAU,KAAK,YAAY,GAAG;EACpC,OAAO,IAAI,aAAa,kBAAkB,KAAK,OAAO,IAAI,QAAQ,KAAK,OAAO;CAChF;CAEA,SACE,KACA,KAC8C;EAC9C,OAAO,YAAe,KAAK,KAAK,YAAY,GAAG,CAAC;CAClD;AACF"}

package/dist/{llm-judge-CG12SQJq.js → llm-judge-C8jMTNNG.js}

@@ -1,24 +1,25 @@
-import { i as JudgeError, s as ValidationError } from "./errors-DVZiqS7K.js";
-import { a as hashCanonical, i as compareCodeUnits, r as canonicalString, t as LEDGER_HASH_PATTERN } from "./canonical-B2RqLofv.js";
-import { i as modelHasSnapshot, s as searchCellRunId } from "./run-record-Boc5IUTp.js";
-import { t as mulberry32 } from "./random-ByUSnV9w.js";
-import { o as summarizeNumberSeries, s as weightedComposite, t as confidenceInterval } from "./descriptive-DboxPZrG.js";
-import { r as minimumPairsForPairedDeltaTest } from "./paired-promotion-decision-DsAPYGCm.js";
-import { a as heldoutSignificance, i as dimensionRegressions, o as pairHoldout } from "./statistical-heldout-42NlCNDe.js";
-import { n as contentHash } from "./verdict-cache-Bm8EKL2s.js";
-import { r as projectCampaignCellQuality, t as campaignCellCostProvenance } from "./run-record-C5e7FjhJ.js";
-import { n as CostAccountingIncompleteError, t as CostLedger } from "./cost-ledger-BP8V4kUQ.js";
-import { B as assertCampaignDesign, D as FinalEvidenceError, E as FinalEvidenceConflictError, F as surfaceHash, G as campaignSplitDigest, H as assertCompleteCampaign, I as surfaceHashMatches, L as BackendIntegrityError, M as renderSurfaceDiff, N as surfaceContentHash, P as surfaceDispatchRef, U as campaignCoverage, V as assertCampaignSplitIdentity, W as campaignScenarioIdentity, b as campaignMeanCompositeOrNull, q as formatCoverageFailures, v as campaignBreakdown, y as campaignMeanComposite } from "./campaign-evidence-Clrn4hBV.js";
+import { i as JudgeError, s as ValidationError } from "./errors-BcOs5MKW.js";
+import { a as hashCanonical, i as compareCodeUnits, r as canonicalString, t as LEDGER_HASH_PATTERN } from "./canonical-Dq2hOQ8L.js";
+import { i as modelHasSnapshot, s as searchCellRunId } from "./run-record-DhEJgoPz.js";
+import { t as mulberry32 } from "./random-DDDcC7YU.js";
+import { o as summarizeNumberSeries, s as weightedComposite, t as confidenceInterval } from "./descriptive-CVNy48rR.js";
+import { r as minimumPairsForPairedDeltaTest } from "./paired-promotion-decision-D0SHb-ZL.js";
+import { a as heldoutSignificance, i as dimensionRegressions, o as pairHoldout } from "./statistical-heldout-Bksv92Th.js";
+import { n as contentHash } from "./verdict-cache-CL_7tePD.js";
+import { r as projectCampaignCellQuality, t as campaignCellCostProvenance } from "./run-record-CysKLB93.js";
+import { n as CostAccountingIncompleteError, t as CostLedger } from "./cost-ledger-D0352Z4d.js";
+import { A as surfaceHashMatches, D as surfaceContentHash, E as renderSurfaceDiff, F as assertCampaignSplitIdentity, I as assertCompleteCampaign, L as campaignCoverage, O as surfaceDispatchRef, P as assertCampaignDesign, R as campaignScenarioIdentity, V as formatCoverageFailures, b as FinalEvidenceConflictError, f as campaignBreakdown, j as BackendIntegrityError, k as surfaceHash, m as campaignMeanCompositeOrNull, p as campaignMeanComposite, x as FinalEvidenceError, z as campaignSplitDigest } from "./campaign-evidence-CQYw8_0H.js";
 import { t as deepFreezeCanonicalJson } from "./deep-freeze-CurcOQg3.js";
-import { N as createRunCostLedger, P as fsCampaignStorage, g as isRecord, h as isExternalTextCandidate } from "./external-optimizer-subprocess-BqW0hHcI.js";
-import { r as summarizeEvaluationUnits, t as defineEvaluationClaim } from "./claim-q4HQhK1G.js";
-import { c as redactText, d as detectCredential, f as detectPersonalData, n as REDACTION_VERSION } from "./redact-B5xXKqQ3.js";
-import { t as detectRewardHacking } from "./reward-hacking-E0d-WVcP.js";
-import { t as assertProposalFindings } from "./proposal-findings-CY1xKn_a.js";
-import { i as runSearch, m as searchExpansionIndex, n as paretoFrontier, o as searchPolicyView, p as SEARCH_KERNEL_SOURCE, r as paretoFrontierWithCrowding, s as EXPANSION_OPERATORS, w as estimateNode } from "./pareto-Cm6ndrWN.js";
-import { a as validateSearchLedgerEvent, d as searchNodeId, f as searchTaskSetDigest, i as replaySearchLedgerText, n as openSearchLedger, u as searchCellId } from "./search-ledger-CVUGLDZp.js";
-import { n as searchProposerView, t as renderSearchSummary } from "./search-summary-BQCSWf1g.js";
-import { a as maximumChargeForLlmRequest, i as costReceiptFromLlmError, r as costReceiptFromLlm, x as stripFencedJson } from "./llm-client-CyBAoYiX.js";
+import { M as fsCampaignStorage, h as isExternalTextCandidate, j as createRunCostLedger } from "./external-optimizer-subprocess-XIHBOSKt.js";
+import { r as summarizeEvaluationUnits, t as defineEvaluationClaim } from "./claim-BPVuyHuy.js";
+import { d as detectPersonalData, s as redactText, t as REDACTION_VERSION, u as detectCredential } from "./redact-mtkTiJVk.js";
+import { t as detectRewardHacking } from "./reward-hacking-ByuETaIb.js";
+import { t as assertProposalFindings } from "./proposal-findings-BbWidvUk.js";
+import { i as runSearch, m as searchExpansionIndex, n as paretoFrontier, o as searchPolicyView, p as SEARCH_KERNEL_SOURCE, r as paretoFrontierWithCrowding, s as EXPANSION_OPERATORS, w as estimateNode } from "./pareto-BzsxidFD.js";
+import { a as validateSearchLedgerEvent, d as searchNodeId, f as searchTaskSetDigest, i as replaySearchLedgerText, n as openSearchLedger, u as searchCellId } from "./search-ledger-TUvB5gWH.js";
+import { n as searchProposerView, t as renderSearchSummary } from "./search-summary-DQIvJsSB.js";
+import { i as stripFencedJson, n as isRecord } from "./json-BhdsJaOQ.js";
+import { a as maximumChargeForLlmRequest, i as costReceiptFromLlmError, r as costReceiptFromLlm } from "./llm-client-BshCREn6.js";
 import { createHash } from "node:crypto";
 import { writeFileSync } from "node:fs";
 import { z } from "zod";
@@ -3707,7 +3708,7 @@ function crowdedFrontierParent(options) {
 	});
 }
 /**
-* AIDE's search policy (`aide/agent.py`, `search_policy`) with three changes
+* AIDE's search_policy with three changes
 * for noisy scores.
 *
 * 1. **Draft** while fewer than `drafts` nodes were drafted: the root is the
@@ -4056,15 +4057,6 @@ function mean(values) {
 function isProposedCandidate(value) {
 	return typeof value === "object" && value !== null && "surface" in value && "label" in value && "rationale" in value;
 }
-const LABEL_TRUST_RANK = {
-	unverified: 0,
-	"verified-signal": 1,
-	"human-rated": 2
-};
-/** Ordinal rank for a label-trust tier; absent ⇒ `unverified` (rank 0). */
-function labelTrustRank(trust) {
-	return LABEL_TRUST_RANK[trust ?? "unverified"];
-}
 //#endregion
 //#region src/campaign/presets/optimization-surface-nodes.ts
 /** Surface-node campaigns, cached cell adoption, and proposer history from the search ledger. */
@@ -5750,6 +5742,6 @@ function firstString(value) {
 	return typeof value === "string" && value.trim() ? value : void 0;
 }
 //#endregion
-export { evaluationUnitMap as $, assertSearchHistoryAdmissionOptions as A, asha as B, SearchRecorder as C, surfaceNode as D, surfaceDiff as E, verifySearchHistoryReceipt as F, defaultProductionGate as G, runFinalComparison as H, campaignCellSearchResult as I, redTeamReport as J, DEFAULT_RED_TEAM_CORPUS as K, searchModelIdentity as L, createSearchHistoryReceipt as M, searchHistoryCoverageRow as N, SearchHistoryRequiredError as O, verifySearchHistoryArtifact as P, captureFinalEvidencePolicy as Q, searchProposalExecution as R, incumbentWithOperatorBandit as S, searchEdgeId as T, openAutoPr as U, uniform as V, captureJudge as W, runCanaries as X, scoreRedTeamOutput as Y, assertIndependentEvaluationSplit as Z, labelTrustRank as _, transientDispatchFailure as a, resolveRunDir as at, crowdedFrontierParent as b, executeOptimizationMethod as c, buildCellSchedule as ct, combineComparisonCosts as d, exposeFinalEvidence as et, costFromLedgerSummary as f, isProposedCandidate as g, runOptimization as h, quotaExhaustedUntil as i, planCampaignRun as it, assertSearchHistoryMatchesState as j, assertCompleteSearchHistory as k, assertGepaCandidatePopulationSummary as l, cellCachePath as lt, runImprovementLoop as m, JudgeParseError as n, runEval as nt, aggregateRunScore as o, tangleTracesRoot as ot, optimizationTokenUsageFromSummary as p, redTeamDataset as q, isTransientTransportFailure as r, runCampaign as rt, clamp01 as s, readCachedCell as st, llmJudge as t, reserveFinalEvidence as tt, readGepaCandidatePopulationArtifact as u, computeManifestHash as ut, aide as v, developmentClaim as w, incumbent as x, beam as y, searchReceiptAccounting as z };
+export { planCampaignRun as $, verifySearchHistoryReceipt as A, defaultProductionGate as B, searchEdgeId as C, assertSearchHistoryMatchesState as D, assertSearchHistoryAdmissionOptions as E, asha as F, runCanaries as G, redTeamDataset as H, uniform as I, evaluationUnitMap as J, assertIndependentEvaluationSplit as K, runFinalComparison as L, searchModelIdentity as M, searchProposalExecution as N, createSearchHistoryReceipt as O, searchReceiptAccounting as P, runCampaign as Q, openAutoPr as R, developmentClaim as S, surfaceNode as T, redTeamReport as U, DEFAULT_RED_TEAM_CORPUS as V, scoreRedTeamOutput as W, reserveFinalEvidence as X, exposeFinalEvidence as Y, runEval as Z, beam as _, aggregateRunScore as a, incumbentWithOperatorBandit as b, assertGepaCandidatePopulationSummary as c, costFromLedgerSummary as d, resolveRunDir as et, optimizationTokenUsageFromSummary as f, aide as g, isProposedCandidate as h, transientDispatchFailure as i, campaignCellSearchResult as j, verifySearchHistoryArtifact as k, readGepaCandidatePopulationArtifact as l, runOptimization as m, JudgeParseError as n, cellCachePath as nt, clamp01 as o, runImprovementLoop as p, captureFinalEvidencePolicy as q, isTransientTransportFailure as r, computeManifestHash as rt, executeOptimizationMethod as s, llmJudge as t, buildCellSchedule as tt, combineComparisonCosts as u, crowdedFrontierParent as v, surfaceDiff as w, SearchRecorder as x, incumbent as y, captureJudge as z };
 
-//# sourceMappingURL=llm-judge-CG12SQJq.js.map
+//# sourceMappingURL=llm-judge-C8jMTNNG.js.map