@tangle-network/agent-eval 0.215.1 → 0.216.1

package/dist/ledger-core/index.js

@@ -1,4 +1,4 @@
-import { a as hashCanonical, n as LedgerCanonicalizationError, o as jsonDocument, r as canonicalString, t as LEDGER_HASH_PATTERN } from "../canonical-BsZVgBhW.js";
-import { _ as probeAtomicFileLock, a as trustedHeadPathFor, c as readProjectorSnapshotFile, d as withLedgerFileLock, f as writeLedgerFileAtomically, g as AtomicFileLockError, i as readTrustedHeadFile, l as appendLedgerLine, n as MemoryLedgerJournal, o as verifyEntriesAgainstTrustedHead, r as replayLedgerText, s as projectorSnapshotPathFor, t as FileLedgerJournal, u as tryWithLedgerFileLock, v as tryAcquireAtomicFileLock } from "../journal-DvKCvjty.js";
-import { a as merkleRoot, c as verifyMerkleInclusion, i as merkleLeafHash, n as merkleConsistencyProof, o as merkleSalt, r as merkleInclusionProof, s as verifyMerkleConsistency, t as MERKLE_EMPTY_ROOT } from "../ledger-core-B2hahzrt.js";
+import { a as hashCanonical, n as LedgerCanonicalizationError, o as jsonDocument, r as canonicalString, t as LEDGER_HASH_PATTERN } from "../canonical-B2RqLofv.js";
+import { _ as probeAtomicFileLock, a as trustedHeadPathFor, c as readProjectorSnapshotFile, d as withLedgerFileLock, f as writeLedgerFileAtomically, g as AtomicFileLockError, i as readTrustedHeadFile, l as appendLedgerLine, n as MemoryLedgerJournal, o as verifyEntriesAgainstTrustedHead, r as replayLedgerText, s as projectorSnapshotPathFor, t as FileLedgerJournal, u as tryWithLedgerFileLock, v as tryAcquireAtomicFileLock } from "../journal-DfRz9kps.js";
+import { a as merkleRoot, c as verifyMerkleInclusion, i as merkleLeafHash, n as merkleConsistencyProof, o as merkleSalt, r as merkleInclusionProof, s as verifyMerkleConsistency, t as MERKLE_EMPTY_ROOT } from "../ledger-core-Gq7yp8lP.js";
 export { AtomicFileLockError, FileLedgerJournal, LEDGER_HASH_PATTERN, LedgerCanonicalizationError, MERKLE_EMPTY_ROOT, MemoryLedgerJournal, appendLedgerLine, canonicalString, hashCanonical, jsonDocument, merkleConsistencyProof, merkleInclusionProof, merkleLeafHash, merkleRoot, merkleSalt, probeAtomicFileLock, projectorSnapshotPathFor, readProjectorSnapshotFile, readTrustedHeadFile, replayLedgerText, trustedHeadPathFor, tryAcquireAtomicFileLock, tryWithLedgerFileLock, verifyEntriesAgainstTrustedHead, verifyMerkleConsistency, verifyMerkleInclusion, withLedgerFileLock, writeLedgerFileAtomically };

package/dist/{ledger-core-B2hahzrt.js → ledger-core-Gq7yp8lP.js}

@@ -1,6 +1,6 @@
-import { s as ValidationError } from "./errors-Dngq5h35.js";
-import { t as LEDGER_HASH_PATTERN } from "./canonical-BsZVgBhW.js";
-import "./journal-DvKCvjty.js";
+import { s as ValidationError } from "./errors-DVZiqS7K.js";
+import { t as LEDGER_HASH_PATTERN } from "./canonical-B2RqLofv.js";
+import "./journal-DfRz9kps.js";
 import { sha256Bytes } from "@tangle-network/agent-interface";
 //#region src/ledger-core/merkle.ts
 /**
@@ -245,4 +245,4 @@ function fromHex(hex) {
 //#endregion
 export { merkleRoot as a, verifyMerkleInclusion as c, merkleLeafHash as i, merkleConsistencyProof as n, merkleSalt as o, merkleInclusionProof as r, verifyMerkleConsistency as s, MERKLE_EMPTY_ROOT as t };
 
-//# sourceMappingURL=ledger-core-B2hahzrt.js.map
+//# sourceMappingURL=ledger-core-Gq7yp8lP.js.map

package/dist/{ledger-core-B2hahzrt.js.map → ledger-core-Gq7yp8lP.js.map}

@@ -1 +1 @@
-{"version":3,"file":"ledger-core-B2hahzrt.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. */\nexport const 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 * Consistency proof that the first `oldSize` leaves are the tree of that size\n * (RFC 9162 §2.1.4.1). Sizes 0 and `leaves.length` need no path.\n */\nexport function merkleConsistencyProof(\n  leaves: readonly LedgerHash[],\n  oldSize: number,\n): MerkleConsistencyProof {\n  const nodes = decodeLeaves(leaves)\n  if (!Number.isSafeInteger(oldSize) || oldSize < 0 || oldSize > nodes.length) {\n    throw new ValidationError(\n      `merkle old size ${oldSize} is outside a tree of ${nodes.length} leaves`,\n    )\n  }\n  const path: Uint8Array[] = []\n  if (oldSize > 0 && oldSize < nodes.length) subproof(nodes, oldSize, 0, nodes.length, true, path)\n  return { oldSize, newSize: nodes.length, path: path.map(toLedgerHash) }\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/** Check that the tree with `newRoot` extends the tree with `oldRoot` (RFC 9162 §2.1.4.2). */\nexport function verifyMerkleConsistency(\n  proof: MerkleConsistencyProof,\n  oldRoot: LedgerHash,\n  newRoot: LedgerHash,\n): MerkleVerification {\n  const { oldSize, newSize } = proof\n  if (!isSize(oldSize) || !isSize(newSize) || oldSize > newSize) {\n    return refused(`old size ${oldSize} does not precede new size ${newSize}`)\n  }\n  const decoded = decodeAll([oldRoot, newRoot, ...proof.path])\n  if (decoded === undefined) return refused('proof carries a malformed hash')\n  const [oldBytes, newBytes, ...given] = decoded as [Uint8Array, Uint8Array, ...Uint8Array[]]\n  if (oldSize === 0 || oldSize === newSize) {\n    if (given.length !== 0) return refused('a trivial consistency proof must be empty')\n    if (oldSize === 0) {\n      return oldRoot === MERKLE_EMPTY_ROOT\n        ? { verified: true }\n        : refused('the empty tree has a different root')\n    }\n    return equal(oldBytes, newBytes)\n      ? { verified: true }\n      : refused('equal sizes with different roots')\n  }\n  const path = isPowerOfTwo(oldSize) ? [oldBytes, ...given] : given\n  if (path.length === 0) return refused('consistency proof is empty')\n  let fn = oldSize - 1\n  let sn = newSize - 1\n  while (fn % 2 === 1) {\n    fn = Math.floor(fn / 2)\n    sn = Math.floor(sn / 2)\n  }\n  let fr = path[0] as Uint8Array\n  let sr = fr\n  for (const c of path.slice(1)) {\n    if (sn === 0) return refused('proof path is longer than the tree is deep')\n    if (fn % 2 === 1 || fn === sn) {\n      fr = node(c, fr)\n      sr = node(c, sr)\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      sr = node(sr, c)\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  if (!equal(fr, oldBytes)) return refused('proof does not rebuild the old root')\n  if (!equal(sr, newBytes)) return refused('proof does not rebuild the new root')\n  return { verified: true }\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\nfunction subproof(\n  nodes: readonly Uint8Array[],\n  oldSize: number,\n  start: number,\n  end: number,\n  complete: boolean,\n  path: Uint8Array[],\n): void {\n  if (end - start === oldSize) {\n    if (!complete) path.push(subtreeRoot(nodes, start, end))\n    return\n  }\n  const k = largestPowerOfTwoBelow(end - start)\n  if (oldSize <= k) {\n    subproof(nodes, oldSize, start, start + k, complete, path)\n    path.push(subtreeRoot(nodes, start + k, end))\n  } else {\n    subproof(nodes, oldSize - k, start + k, end, false, path)\n    path.push(subtreeRoot(nodes, start, start + k))\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\nfunction isPowerOfTwo(n: number): boolean {\n  if (n < 1) return false\n  let m = n\n  while (m % 2 === 0) m /= 2\n  return m === 1\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,MAAa,oBAAgC,4BAAY,IAAI,WAAW,CAAC,CAAC;;AAG1E,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;;;;;AAMA,SAAgB,uBACd,QACA,SACwB;CACxB,MAAM,QAAQ,aAAa,MAAM;CACjC,IAAI,CAAC,OAAO,cAAc,OAAO,KAAK,UAAU,KAAK,UAAU,MAAM,QACnE,MAAM,IAAI,gBACR,mBAAmB,QAAQ,wBAAwB,MAAM,OAAO,QAClE;CAEF,MAAM,OAAqB,CAAC;CAC5B,IAAI,UAAU,KAAK,UAAU,MAAM,QAAQ,SAAS,OAAO,SAAS,GAAG,MAAM,QAAQ,MAAM,IAAI;CAC/F,OAAO;EAAE;EAAS,SAAS,MAAM;EAAQ,MAAM,KAAK,IAAI,YAAY;CAAE;AACxE;;AAGA,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;;AAGA,SAAgB,wBACd,OACA,SACA,SACoB;CACpB,MAAM,EAAE,SAAS,YAAY;CAC7B,IAAI,CAAC,OAAO,OAAO,KAAK,CAAC,OAAO,OAAO,KAAK,UAAU,SACpD,OAAO,QAAQ,YAAY,QAAQ,6BAA6B,SAAS;CAE3E,MAAM,UAAU,UAAU;EAAC;EAAS;EAAS,GAAG,MAAM;CAAI,CAAC;CAC3D,IAAI,YAAY,KAAA,GAAW,OAAO,QAAQ,gCAAgC;CAC1E,MAAM,CAAC,UAAU,UAAU,GAAG,SAAS;CACvC,IAAI,YAAY,KAAK,YAAY,SAAS;EACxC,IAAI,MAAM,WAAW,GAAG,OAAO,QAAQ,2CAA2C;EAClF,IAAI,YAAY,GACd,OAAO,YAAY,oBACf,EAAE,UAAU,KAAK,IACjB,QAAQ,qCAAqC;EAEnD,OAAO,MAAM,UAAU,QAAQ,IAC3B,EAAE,UAAU,KAAK,IACjB,QAAQ,kCAAkC;CAChD;CACA,MAAM,OAAO,aAAa,OAAO,IAAI,CAAC,UAAU,GAAG,KAAK,IAAI;CAC5D,IAAI,KAAK,WAAW,GAAG,OAAO,QAAQ,4BAA4B;CAClE,IAAI,KAAK,UAAU;CACnB,IAAI,KAAK,UAAU;CACnB,OAAO,KAAK,MAAM,GAAG;EACnB,KAAK,KAAK,MAAM,KAAK,CAAC;EACtB,KAAK,KAAK,MAAM,KAAK,CAAC;CACxB;CACA,IAAI,KAAK,KAAK;CACd,IAAI,KAAK;CACT,KAAK,MAAM,KAAK,KAAK,MAAM,CAAC,GAAG;EAC7B,IAAI,OAAO,GAAG,OAAO,QAAQ,4CAA4C;EACzE,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI;GAC7B,KAAK,KAAK,GAAG,EAAE;GACf,KAAK,KAAK,GAAG,EAAE;GACf,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,KAAK,KAAK,IAAI,CAAC;EAEjB,KAAK,KAAK,MAAM,KAAK,CAAC;EACtB,KAAK,KAAK,MAAM,KAAK,CAAC;CACxB;CACA,IAAI,OAAO,GAAG,OAAO,QAAQ,6CAA6C;CAC1E,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,OAAO,QAAQ,qCAAqC;CAC9E,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,OAAO,QAAQ,qCAAqC;CAC9E,OAAO,EAAE,UAAU,KAAK;AAC1B;AAEA,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;AAEA,SAAS,SACP,OACA,SACA,OACA,KACA,UACA,MACM;CACN,IAAI,MAAM,UAAU,SAAS;EAC3B,IAAI,CAAC,UAAU,KAAK,KAAK,YAAY,OAAO,OAAO,GAAG,CAAC;EACvD;CACF;CACA,MAAM,IAAI,uBAAuB,MAAM,KAAK;CAC5C,IAAI,WAAW,GAAG;EAChB,SAAS,OAAO,SAAS,OAAO,QAAQ,GAAG,UAAU,IAAI;EACzD,KAAK,KAAK,YAAY,OAAO,QAAQ,GAAG,GAAG,CAAC;CAC9C,OAAO;EACL,SAAS,OAAO,UAAU,GAAG,QAAQ,GAAG,KAAK,OAAO,IAAI;EACxD,KAAK,KAAK,YAAY,OAAO,OAAO,QAAQ,CAAC,CAAC;CAChD;AACF;AAEA,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;AAEA,SAAS,aAAa,GAAoB;CACxC,IAAI,IAAI,GAAG,OAAO;CAClB,IAAI,IAAI;CACR,OAAO,IAAI,MAAM,GAAG,KAAK;CACzB,OAAO,MAAM;AACf;AAEA,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"}
+{"version":3,"file":"ledger-core-Gq7yp8lP.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. */\nexport const 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 * Consistency proof that the first `oldSize` leaves are the tree of that size\n * (RFC 9162 §2.1.4.1). Sizes 0 and `leaves.length` need no path.\n */\nexport function merkleConsistencyProof(\n  leaves: readonly LedgerHash[],\n  oldSize: number,\n): MerkleConsistencyProof {\n  const nodes = decodeLeaves(leaves)\n  if (!Number.isSafeInteger(oldSize) || oldSize < 0 || oldSize > nodes.length) {\n    throw new ValidationError(\n      `merkle old size ${oldSize} is outside a tree of ${nodes.length} leaves`,\n    )\n  }\n  const path: Uint8Array[] = []\n  if (oldSize > 0 && oldSize < nodes.length) subproof(nodes, oldSize, 0, nodes.length, true, path)\n  return { oldSize, newSize: nodes.length, path: path.map(toLedgerHash) }\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/** Check that the tree with `newRoot` extends the tree with `oldRoot` (RFC 9162 §2.1.4.2). */\nexport function verifyMerkleConsistency(\n  proof: MerkleConsistencyProof,\n  oldRoot: LedgerHash,\n  newRoot: LedgerHash,\n): MerkleVerification {\n  const { oldSize, newSize } = proof\n  if (!isSize(oldSize) || !isSize(newSize) || oldSize > newSize) {\n    return refused(`old size ${oldSize} does not precede new size ${newSize}`)\n  }\n  const decoded = decodeAll([oldRoot, newRoot, ...proof.path])\n  if (decoded === undefined) return refused('proof carries a malformed hash')\n  const [oldBytes, newBytes, ...given] = decoded as [Uint8Array, Uint8Array, ...Uint8Array[]]\n  if (oldSize === 0 || oldSize === newSize) {\n    if (given.length !== 0) return refused('a trivial consistency proof must be empty')\n    if (oldSize === 0) {\n      return oldRoot === MERKLE_EMPTY_ROOT\n        ? { verified: true }\n        : refused('the empty tree has a different root')\n    }\n    return equal(oldBytes, newBytes)\n      ? { verified: true }\n      : refused('equal sizes with different roots')\n  }\n  const path = isPowerOfTwo(oldSize) ? [oldBytes, ...given] : given\n  if (path.length === 0) return refused('consistency proof is empty')\n  let fn = oldSize - 1\n  let sn = newSize - 1\n  while (fn % 2 === 1) {\n    fn = Math.floor(fn / 2)\n    sn = Math.floor(sn / 2)\n  }\n  let fr = path[0] as Uint8Array\n  let sr = fr\n  for (const c of path.slice(1)) {\n    if (sn === 0) return refused('proof path is longer than the tree is deep')\n    if (fn % 2 === 1 || fn === sn) {\n      fr = node(c, fr)\n      sr = node(c, sr)\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      sr = node(sr, c)\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  if (!equal(fr, oldBytes)) return refused('proof does not rebuild the old root')\n  if (!equal(sr, newBytes)) return refused('proof does not rebuild the new root')\n  return { verified: true }\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\nfunction subproof(\n  nodes: readonly Uint8Array[],\n  oldSize: number,\n  start: number,\n  end: number,\n  complete: boolean,\n  path: Uint8Array[],\n): void {\n  if (end - start === oldSize) {\n    if (!complete) path.push(subtreeRoot(nodes, start, end))\n    return\n  }\n  const k = largestPowerOfTwoBelow(end - start)\n  if (oldSize <= k) {\n    subproof(nodes, oldSize, start, start + k, complete, path)\n    path.push(subtreeRoot(nodes, start + k, end))\n  } else {\n    subproof(nodes, oldSize - k, start + k, end, false, path)\n    path.push(subtreeRoot(nodes, start, start + k))\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\nfunction isPowerOfTwo(n: number): boolean {\n  if (n < 1) return false\n  let m = n\n  while (m % 2 === 0) m /= 2\n  return m === 1\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,MAAa,oBAAgC,4BAAY,IAAI,WAAW,CAAC,CAAC;;AAG1E,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;;;;;AAMA,SAAgB,uBACd,QACA,SACwB;CACxB,MAAM,QAAQ,aAAa,MAAM;CACjC,IAAI,CAAC,OAAO,cAAc,OAAO,KAAK,UAAU,KAAK,UAAU,MAAM,QACnE,MAAM,IAAI,gBACR,mBAAmB,QAAQ,wBAAwB,MAAM,OAAO,QAClE;CAEF,MAAM,OAAqB,CAAC;CAC5B,IAAI,UAAU,KAAK,UAAU,MAAM,QAAQ,SAAS,OAAO,SAAS,GAAG,MAAM,QAAQ,MAAM,IAAI;CAC/F,OAAO;EAAE;EAAS,SAAS,MAAM;EAAQ,MAAM,KAAK,IAAI,YAAY;CAAE;AACxE;;AAGA,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;;AAGA,SAAgB,wBACd,OACA,SACA,SACoB;CACpB,MAAM,EAAE,SAAS,YAAY;CAC7B,IAAI,CAAC,OAAO,OAAO,KAAK,CAAC,OAAO,OAAO,KAAK,UAAU,SACpD,OAAO,QAAQ,YAAY,QAAQ,6BAA6B,SAAS;CAE3E,MAAM,UAAU,UAAU;EAAC;EAAS;EAAS,GAAG,MAAM;CAAI,CAAC;CAC3D,IAAI,YAAY,KAAA,GAAW,OAAO,QAAQ,gCAAgC;CAC1E,MAAM,CAAC,UAAU,UAAU,GAAG,SAAS;CACvC,IAAI,YAAY,KAAK,YAAY,SAAS;EACxC,IAAI,MAAM,WAAW,GAAG,OAAO,QAAQ,2CAA2C;EAClF,IAAI,YAAY,GACd,OAAO,YAAY,oBACf,EAAE,UAAU,KAAK,IACjB,QAAQ,qCAAqC;EAEnD,OAAO,MAAM,UAAU,QAAQ,IAC3B,EAAE,UAAU,KAAK,IACjB,QAAQ,kCAAkC;CAChD;CACA,MAAM,OAAO,aAAa,OAAO,IAAI,CAAC,UAAU,GAAG,KAAK,IAAI;CAC5D,IAAI,KAAK,WAAW,GAAG,OAAO,QAAQ,4BAA4B;CAClE,IAAI,KAAK,UAAU;CACnB,IAAI,KAAK,UAAU;CACnB,OAAO,KAAK,MAAM,GAAG;EACnB,KAAK,KAAK,MAAM,KAAK,CAAC;EACtB,KAAK,KAAK,MAAM,KAAK,CAAC;CACxB;CACA,IAAI,KAAK,KAAK;CACd,IAAI,KAAK;CACT,KAAK,MAAM,KAAK,KAAK,MAAM,CAAC,GAAG;EAC7B,IAAI,OAAO,GAAG,OAAO,QAAQ,4CAA4C;EACzE,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI;GAC7B,KAAK,KAAK,GAAG,EAAE;GACf,KAAK,KAAK,GAAG,EAAE;GACf,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,KAAK,KAAK,IAAI,CAAC;EAEjB,KAAK,KAAK,MAAM,KAAK,CAAC;EACtB,KAAK,KAAK,MAAM,KAAK,CAAC;CACxB;CACA,IAAI,OAAO,GAAG,OAAO,QAAQ,6CAA6C;CAC1E,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,OAAO,QAAQ,qCAAqC;CAC9E,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,OAAO,QAAQ,qCAAqC;CAC9E,OAAO,EAAE,UAAU,KAAK;AAC1B;AAEA,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;AAEA,SAAS,SACP,OACA,SACA,OACA,KACA,UACA,MACM;CACN,IAAI,MAAM,UAAU,SAAS;EAC3B,IAAI,CAAC,UAAU,KAAK,KAAK,YAAY,OAAO,OAAO,GAAG,CAAC;EACvD;CACF;CACA,MAAM,IAAI,uBAAuB,MAAM,KAAK;CAC5C,IAAI,WAAW,GAAG;EAChB,SAAS,OAAO,SAAS,OAAO,QAAQ,GAAG,UAAU,IAAI;EACzD,KAAK,KAAK,YAAY,OAAO,QAAQ,GAAG,GAAG,CAAC;CAC9C,OAAO;EACL,SAAS,OAAO,UAAU,GAAG,QAAQ,GAAG,KAAK,OAAO,IAAI;EACxD,KAAK,KAAK,YAAY,OAAO,OAAO,QAAQ,CAAC,CAAC;CAChD;AACF;AAEA,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;AAEA,SAAS,aAAa,GAAoB;CACxC,IAAI,IAAI,GAAG,OAAO;CAClB,IAAI,IAAI;CACR,OAAO,IAAI,MAAM,GAAG,KAAK;CACzB,OAAO,MAAM;AACf;AAEA,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-DQveoxSM.js → llm-client-CyBAoYiX.js}

@@ -1,7 +1,110 @@
-import { t as AgentEvalError } from "./errors-Dngq5h35.js";
-import { c as costForTokenPricing } from "./cost-ledger-D2FnJPBF.js";
+import { t as AgentEvalError } from "./errors-DVZiqS7K.js";
+import { c as costForTokenPricing } from "./cost-ledger-BP8V4kUQ.js";
 import { t as newRecordId } from "./record-id-DUgsK5qp.js";
-import { a as providerFromBaseUrl, i as defaultProviderRedactor } from "./raw-provider-sink-rB2DYxr6.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) {
@@ -285,112 +388,7 @@ function assertCrossFamilyServed(pairs, opts = {}) {
 	return list;
 }
 //#endregion
-//#region src/llm-client.ts
-/**
-* OpenAI-compatible client. The CLASS is internal; one transport now drives it
-* for public callers.
-*
-* agent-eval never goes looking for a credential — it reads no environment
-* variable to find one — and this module is still not reachable through any
-* export subpath. What reaches a consumer is `createChatClient({ transport:
-* 'openai-compatible', baseUrl, apiKey })`, the sanctioned public route, which
-* constructs this client from an endpoint and a credential the caller passed as
-* values. Anything richer than that transport's options stays in-repo.
-*
-* Three in-repo callers hold the class directly:
-*   - `src/analyst/chat-client.ts`, the public transport above;
-*   - the `agent-eval` binary (`src/cli-config.ts`), a deployed server whose
-*     caller is a JSON-RPC client in another language and which therefore
-*     configures its own endpoint from its own environment;
-*   - the loopback optimizer proxy path (`src/analyst/benchmark-public-model.ts`,
-*     `src/analyst/dspy-rlm-engine.ts`), which targets `http://127.0.0.1:<port>/v1`
-*     with an ephemeral token and executes nothing itself.
-*
-* The canonical request/result TYPES it defines ARE public — they are the
-* contract every caller-owned transport speaks.
-*
-* OpenAI-compatible `/v1/chat/completions` client with:
-*   - Exponential-backoff retry on 429 + 5xx gateway errors (502/503/504).
-*   - Retry on transient network errors (fetch failed, AbortError, ECONNRESET).
-*   - One retry at temperature 1 when a model explicitly requires it.
-*   - Graceful json_schema → json_object degrade on 400 with schema-reject body.
-*   - Fenced-JSON stripping (```json ... ```) for models that wrap structured output.
-*   - Configurable base URL + api key / bearer, works with LiteLLM proxies, OpenAI
-*     directly, cli-bridge subscriptions, and any router that speaks the spec.
-*
-* Usage:
-*   const { value, result } = await callLlmJson<MyType>(
-*     { model: 'gpt-4o', messages: [...], jsonSchema: { name: 'x', schema: {...} } },
-*     { baseUrl: process.env.AGENT_EVAL_LLM_BASE_URL, apiKey: process.env.AGENT_EVAL_LLM_API_KEY },
-*   )
-*
-*/
-function maximumChargeForLlmRequest(request, options = {}) {
-	if (request.maxTokens === void 0) return void 0;
-	if (!Number.isInteger(request.maxTokens) || request.maxTokens <= 0) throw new RangeError(`maximumChargeForLlmRequest: maxTokens must be a positive integer`);
-	if (request.messages.some((message) => Array.isArray(message.content) && message.content.some((part) => part.type === "image_url"))) return;
-	const attempts = resolveMaximumAttempts(options.maximumAttempts);
-	const forceJsonObject = options.jsonSchemaTransport === "json-object";
-	const usage = {
-		inputTokens: new TextEncoder().encode(JSON.stringify(buildBody(request, forceJsonObject, options.thinking))).byteLength * attempts,
-		outputTokens: request.maxTokens * attempts
-	};
-	return options.customTokenPricing ? {
-		customTokenPricing: options.customTokenPricing,
-		...usage
-	} : {
-		model: request.model,
-		...usage
-	};
-}
-/** Convert a provider result into the canonical paid-call receipt input.
-* The receipt is JSON-clean: absent optional fields are omitted, never carried
-* as explicit-undefined keys. Receipts cross JSON boundaries (the external
-* optimizer's loopback proxy validates them with `assertJsonValue`), where an
-* explicit-undefined value is rejected as non-serializable. */
-function costReceiptFromLlm(result, customTokenPricing) {
-	const cachedTokens = result.usage.cachedPromptTokens ?? 0;
-	const inputTokens = Math.max(0, result.usage.promptTokens - cachedTokens);
-	const providerCostUsd = providerReportedCost(result.raw);
-	return {
-		model: result.model,
-		inputTokens,
-		outputTokens: result.usage.completionTokens,
-		...result.usage.reasoningTokens === void 0 ? {} : { reasoningTokens: result.usage.reasoningTokens },
-		...cachedTokens > 0 ? { cachedTokens } : {},
-		...providerCostUsd === void 0 ? customTokenPricing && result.usage.captured !== false ? { customTokenPricing } : result.costUsd === null ? {} : { estimatedCostUsd: result.costUsd } : { actualCostUsd: providerCostUsd },
-		usageUnknown: result.usage.captured === false
-	};
-}
-function providerReportedCost(raw) {
-	const value = raw._response_cost ?? raw.cost_usd;
-	return typeof value === "number" && Number.isFinite(value) && value >= 0 ? value : void 0;
-}
-/** Structured-response failures retain their completed provider receipt. */
-function costReceiptFromLlmError(error, customTokenPricing) {
-	return error instanceof LlmResponseError ? costReceiptFromLlm(error.result, customTokenPricing) : void 0;
-}
-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;
-	}
-};
+//#region src/llm-client/resilience.ts
 const DEFAULT_TIMEOUT_MS = Number(process.env.TANGLE_LLM_TIMEOUT_MS) || 3e5;
 const DEFAULT_MAXIMUM_ATTEMPTS = process.env.TANGLE_LLM_MAXIMUM_ATTEMPTS === void 0 ? 6 : Number(process.env.TANGLE_LLM_MAXIMUM_ATTEMPTS);
 function resolveMaximumAttempts(configured) {
@@ -412,9 +410,6 @@ function pacingStateFor(opts) {
 	}
 	return state;
 }
-function providerTokenCount(value) {
-	return typeof value === "number" && Number.isSafeInteger(value) && value >= 0 ? value : void 0;
-}
 const RETRYABLE_STATUS = /* @__PURE__ */ new Set([
 	429,
 	502,
@@ -489,6 +484,35 @@ function parseRetryAfter(headers) {
 function backoffMs(attempt) {
 	return Math.min(500 * 2 ** attempt, 16e3);
 }
+/** Backoff belongs to the caller's operation and must stop when it is cancelled. */
+async function sleep(ms, signal) {
+	do {
+		signal?.throwIfAborted();
+		const chunk = Math.min(Math.ceil(ms), 2147483647);
+		await new Promise((resolve, reject) => {
+			const onAbort = () => {
+				clearTimeout(timer);
+				signal?.removeEventListener("abort", onAbort);
+				reject(signal?.reason);
+			};
+			const timer = setTimeout(() => {
+				signal?.removeEventListener("abort", onAbort);
+				resolve();
+			}, chunk);
+			signal?.addEventListener("abort", onAbort, { once: true });
+		});
+		ms -= chunk;
+	} while (ms > 0);
+}
+/** True once the cross-attempt wall-clock budget (if any) is exhausted. */
+function deadlineExceeded(start, deadlineMs) {
+	return deadlineMs != null && Date.now() - start >= deadlineMs;
+}
+//#endregion
+//#region src/llm-client/wire.ts
+function providerTokenCount(value) {
+	return typeof value === "number" && Number.isSafeInteger(value) && value >= 0 ? value : void 0;
+}
 function buildHeaders(opts) {
 	const headers = {
 		"Content-Type": "application/json",
@@ -609,90 +633,55 @@ function parseWireToolCalls(value, model) {
 		};
 	});
 }
-/** Backoff belongs to the caller's operation and must stop when it is cancelled. */
-async function sleep(ms, signal) {
-	do {
-		signal?.throwIfAborted();
-		const chunk = Math.min(Math.ceil(ms), 2147483647);
-		await new Promise((resolve, reject) => {
-			const onAbort = () => {
-				clearTimeout(timer);
-				signal?.removeEventListener("abort", onAbort);
-				reject(signal?.reason);
-			};
-			const timer = setTimeout(() => {
-				signal?.removeEventListener("abort", onAbort);
-				resolve();
-			}, chunk);
-			signal?.addEventListener("abort", onAbort, { once: true });
-		});
-		ms -= chunk;
-	} while (ms > 0);
-}
-/** True once the cross-attempt wall-clock budget (if any) is exhausted. */
-function deadlineExceeded(start, deadlineMs) {
-	return deadlineMs != null && Date.now() - start >= deadlineMs;
+//#endregion
+//#region src/llm-client/accounting.ts
+function maximumChargeForLlmRequest(request, options = {}) {
+	if (request.maxTokens === void 0) return void 0;
+	if (!Number.isInteger(request.maxTokens) || request.maxTokens <= 0) throw new RangeError(`maximumChargeForLlmRequest: maxTokens must be a positive integer`);
+	if (request.messages.some((message) => Array.isArray(message.content) && message.content.some((part) => part.type === "image_url"))) return;
+	const attempts = resolveMaximumAttempts(options.maximumAttempts);
+	const forceJsonObject = options.jsonSchemaTransport === "json-object";
+	const usage = {
+		inputTokens: new TextEncoder().encode(JSON.stringify(buildBody(request, forceJsonObject, options.thinking))).byteLength * attempts,
+		outputTokens: request.maxTokens * attempts
+	};
+	return options.customTokenPricing ? {
+		customTokenPricing: options.customTokenPricing,
+		...usage
+	} : {
+		model: request.model,
+		...usage
+	};
 }
-/**
-* 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;
+/** Convert a provider result into the canonical paid-call receipt input.
+* The receipt is JSON-clean: absent optional fields are omitted, never carried
+* as explicit-undefined keys. Receipts cross JSON boundaries (the external
+* optimizer's loopback proxy validates them with `assertJsonValue`), where an
+* explicit-undefined value is rejected as non-serializable. */
+function costReceiptFromLlm(result, customTokenPricing) {
+	const cachedTokens = result.usage.cachedPromptTokens ?? 0;
+	const inputTokens = Math.max(0, result.usage.promptTokens - cachedTokens);
+	const providerCostUsd = providerReportedCost(result.raw);
+	return {
+		model: result.model,
+		inputTokens,
+		outputTokens: result.usage.completionTokens,
+		...result.usage.reasoningTokens === void 0 ? {} : { reasoningTokens: result.usage.reasoningTokens },
+		...cachedTokens > 0 ? { cachedTokens } : {},
+		...providerCostUsd === void 0 ? customTokenPricing && result.usage.captured !== false ? { customTokenPricing } : result.costUsd === null ? {} : { estimatedCostUsd: result.costUsd } : { actualCostUsd: providerCostUsd },
+		usageUnknown: result.usage.captured === false
+	};
 }
-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 providerReportedCost(raw) {
+	const value = raw._response_cost ?? raw.cost_usd;
+	return typeof value === "number" && Number.isFinite(value) && value >= 0 ? value : void 0;
 }
-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;
+/** Structured-response failures retain their completed provider receipt. */
+function costReceiptFromLlmError(error, customTokenPricing) {
+	return error instanceof LlmResponseError ? costReceiptFromLlm(error.result, customTokenPricing) : void 0;
 }
+//#endregion
+//#region src/llm-client/request.ts
 /**
 * Low-level call. Returns raw content + usage + cost. Retries on transient
 * failures; does NOT degrade schema here — callers that want graceful
@@ -977,6 +966,15 @@ function headersToObject(h) {
 	});
 	return out;
 }
+/** Shared schema-to-JSON-mode fallback that preserves the raw result. */
+async function callLlmStructured(req, opts = {}) {
+	return callLlmAttempts({
+		...req,
+		jsonMode: req.jsonMode ?? !req.jsonSchema
+	}, opts, true);
+}
+//#endregion
+//#region src/llm-client.ts
 /**
 * Structured-output call. Returns parsed JSON plus the raw result envelope.
 * Degrades `jsonSchema` → `jsonMode` on a 400 that names the schema param —
@@ -990,31 +988,6 @@ async function callLlmJson(req, opts = {}) {
 		result
 	};
 }
-/** Shared schema-to-JSON-mode fallback that preserves the raw result. */
-async function callLlmStructured(req, opts = {}) {
-	return callLlmAttempts({
-		...req,
-		jsonMode: req.jsonMode ?? !req.jsonSchema
-	}, opts, true);
-}
-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})`);
-	}
-}
 /**
 * Stateful client — construct once with defaults, call many times.
 * Thin wrapper around the free functions; exists for callers that want
@@ -1045,6 +1018,6 @@ var LlmClient = class {
 	}
 };
 //#endregion
-export { combineAbortSignals as C, judgeFamily as S, assertServedModels as _, callLlmJson as a, CrossFamilyError as b, extractJsonPayload as c, stripFencedJson as d, ModelSubstitutionError as f, assertServedModelPolicy as g, assertServedModel as h, backoffMs as i, isTransientLlmError as l, assertCrossFamilyServed as m, LlmClient as n, costReceiptFromLlm as o, ServedCrossFamilyError as p, LlmResponseError as r, costReceiptFromLlmError as s, LlmCallError as t, maximumChargeForLlmRequest as u, checkServedModel as v, assertCrossFamily as x, servedModelAcceptable as y };
+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 };
 
-//# sourceMappingURL=llm-client-DQveoxSM.js.map
+//# sourceMappingURL=llm-client-CyBAoYiX.js.map