@tangle-network/agent-eval 0.150.1 → 0.150.2

package/dist/integrity-DL91tucI.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"integrity-DL91tucI.js","names":["unhandled"],"sources":["../src/supervisor-run/integrity-issues.ts","../src/supervisor-run/integrity-steer.ts","../src/supervisor-run/integrity-source.ts","../src/supervisor-run/integrity-tree.ts","../src/supervisor-run/integrity-types.ts","../src/supervisor-run/source-facts.ts","../src/supervisor-run/rollout-nodes.ts","../src/supervisor-run/integrity.ts"],"sourcesContent":["import type { SupervisorRunIntegrityEvidence, SupervisorRunIntegrityIssue } from './integrity-types'\n\nexport const MAX_EXAMPLES = 20\n\nexport function evidence(path: string, value: unknown): SupervisorRunIntegrityEvidence {\n  return { path, value }\n}\n\nexport function issue(\n  init: Omit<SupervisorRunIntegrityIssue, 'evidence'> & {\n    evidence?: readonly SupervisorRunIntegrityEvidence[]\n  },\n): SupervisorRunIntegrityIssue {\n  return { ...init, evidence: init.evidence ?? [] }\n}\n","import { evidence, issue, MAX_EXAMPLES } from './integrity-issues'\nimport type { JoinedWorker } from './integrity-source'\nimport type { SupervisorRunIntegrityIssue } from './integrity-types'\n\nfunction idListDetail(ids: readonly string[]): string {\n  const examples = ids\n    .slice(0, MAX_EXAMPLES)\n    .map((id) => JSON.stringify(id))\n    .join(', ')\n  return ids.length <= MAX_EXAMPLES\n    ? examples\n    : `${examples}, and ${ids.length - MAX_EXAMPLES} more`\n}\n\nexport function steerIssues(\n  joined: JoinedWorker,\n  rootCompleted: boolean,\n): SupervisorRunIntegrityIssue[] {\n  const { facts } = joined\n  const subject = facts.workerId ?? joined.spawn.id\n  const prefix = `workers/${facts.sourceIndex}`\n  const out: SupervisorRunIntegrityIssue[] = []\n  if (\n    !facts.inboxCaptured ||\n    !facts.eventsCaptured ||\n    facts.inboxInvalidRows > 0 ||\n    facts.eventsInvalidRows > 0\n  ) {\n    const missing = [\n      ...(facts.inboxCaptured ? [] : ['inbox']),\n      ...(facts.eventsCaptured ? [] : ['events']),\n    ]\n    const malformed = [\n      ...(facts.inboxInvalidRows > 0 ? [`inbox:${facts.inboxInvalidRows}`] : []),\n      ...(facts.eventsInvalidRows > 0 ? [`events:${facts.eventsInvalidRows}`] : []),\n    ]\n    out.push(\n      issue({\n        code: 'worker-controls-unavailable',\n        area: 'capture-integrity',\n        severity: 'medium',\n        subject,\n        claim:\n          'Steer delivery integrity is unavailable for a worker with missing control artifacts',\n        detail:\n          missing.length > 0\n            ? `${JSON.stringify(subject)} is missing ${missing.join(' and ')}.`\n            : `${JSON.stringify(subject)} has malformed control rows (${malformed.join(', ')}).`,\n        evidence: [\n          ...missing.map((artifact) => evidence(`${prefix}/${artifact}`, null)),\n          ...(facts.inboxInvalidRows > 0\n            ? [evidence(`${prefix}/inbox/malformed-rows/count`, facts.inboxInvalidRows)]\n            : []),\n          ...(facts.eventsInvalidRows > 0\n            ? [evidence(`${prefix}/events/malformed-rows/count`, facts.eventsInvalidRows)]\n            : []),\n        ],\n        recommendedAction:\n          'Retain both control artifacts and repair malformed rows before correlating requests.',\n        metadata: {\n          assessment: 'unavailable',\n          missing_artifacts: missing,\n          malformed_rows: malformed,\n        },\n      }),\n    )\n    return out\n  }\n\n  const requestsById = new Map<string, typeof facts.steerRequests>()\n  const unidentifiedRequests = facts.steerRequests.filter((request) => request.requestId === null)\n  for (const request of facts.steerRequests) {\n    if (request.requestId === null) continue\n    const rows = requestsById.get(request.requestId) ?? []\n    rows.push(request)\n    requestsById.set(request.requestId, rows)\n  }\n  if (unidentifiedRequests.length > 0) {\n    out.push(\n      issue({\n        code: 'steer-request-id-unavailable',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject,\n        claim: 'Some queued steer requests cannot be correlated because their ids are missing',\n        detail: `${unidentifiedRequests.length} queued request(s) omit id.`,\n        evidence: unidentifiedRequests\n          .slice(0, MAX_EXAMPLES)\n          .map((request) => evidence(`${prefix}/inbox/${request.row}/id`, null)),\n        recommendedAction: 'Assign one stable request id before appending a steer to the inbox.',\n        metadata: { assessment: 'unavailable', unavailable_count: unidentifiedRequests.length },\n      }),\n    )\n  }\n  const duplicateRequestIds = [...requestsById]\n    .filter(([, rows]) => rows.length > 1)\n    .map(([id]) => id)\n  if (duplicateRequestIds.length > 0) {\n    out.push(\n      issue({\n        code: 'duplicate-steer-request-id',\n        area: 'control-integrity',\n        severity: 'high',\n        subject,\n        claim: 'A worker inbox contains duplicate steer request ids',\n        detail: `${duplicateRequestIds.length} duplicate id(s): ${idListDetail(duplicateRequestIds)}.`,\n        evidence: [\n          evidence(\n            `${prefix}/inbox/duplicate-request-ids`,\n            duplicateRequestIds.slice(0, MAX_EXAMPLES),\n          ),\n        ],\n        recommendedAction: 'Generate a unique request id for every queued steer.',\n      }),\n    )\n  }\n\n  const acknowledgementsById = new Map<string, typeof facts.steerAcknowledgements>()\n  const unidentifiedAcks = facts.steerAcknowledgements.filter((ack) => ack.requestId === null)\n  for (const ack of facts.steerAcknowledgements) {\n    if (ack.requestId === null) continue\n    const rows = acknowledgementsById.get(ack.requestId) ?? []\n    rows.push(ack)\n    acknowledgementsById.set(ack.requestId, rows)\n  }\n  if (unidentifiedAcks.length > 0) {\n    out.push(\n      issue({\n        code: 'steer-ack-id-unavailable',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject,\n        claim: 'Some steer acknowledgements cannot be correlated because requestId is missing',\n        detail: `${unidentifiedAcks.length} down-leg event(s) omit requestId.`,\n        evidence: unidentifiedAcks\n          .slice(0, MAX_EXAMPLES)\n          .map((ack) => evidence(`${prefix}/events/${ack.row}/requestId`, null)),\n        recommendedAction: 'Echo the queued request id on every worker acknowledgement.',\n        metadata: { assessment: 'unavailable', unavailable_count: unidentifiedAcks.length },\n      }),\n    )\n  }\n\n  const unknownAckIds = [...acknowledgementsById.keys()].filter((id) => !requestsById.has(id))\n  if (unknownAckIds.length > 0) {\n    out.push(\n      issue({\n        code: 'unknown-steer-ack',\n        area: 'control-integrity',\n        severity: 'high',\n        subject,\n        claim: 'A worker acknowledged steer request ids absent from its captured inbox',\n        detail: `${unknownAckIds.length} unknown id(s): ${idListDetail(unknownAckIds)}.`,\n        evidence: [\n          evidence(`${prefix}/events/unknown-request-ids`, unknownAckIds.slice(0, MAX_EXAMPLES)),\n        ],\n        recommendedAction:\n          'Reject acknowledgements whose request id was not queued for this worker.',\n      }),\n    )\n  }\n\n  const duplicateAckIds = [...acknowledgementsById]\n    .filter(([, rows]) => rows.length > 1)\n    .map(([id]) => id)\n  if (duplicateAckIds.length > 0) {\n    out.push(\n      issue({\n        code: 'duplicate-steer-ack',\n        area: 'control-integrity',\n        severity: 'high',\n        subject,\n        claim: 'A worker emitted duplicate acknowledgements for steer request ids',\n        detail: `${duplicateAckIds.length} duplicated id(s): ${idListDetail(duplicateAckIds)}.`,\n        evidence: [\n          evidence(\n            `${prefix}/events/duplicate-request-ids`,\n            duplicateAckIds.slice(0, MAX_EXAMPLES),\n          ),\n        ],\n        recommendedAction: 'Make steer acknowledgement append idempotent by request id.',\n      }),\n    )\n  }\n\n  const missingAckIds = [...requestsById.keys()].filter((id) => !acknowledgementsById.has(id))\n  if (rootCompleted && missingAckIds.length > 0) {\n    out.push(\n      issue({\n        code: 'missing-steer-ack',\n        area: 'control-integrity',\n        severity: 'high',\n        subject,\n        claim: 'A completed supervisor run has queued steer requests without acknowledgements',\n        detail: `${missingAckIds.length}/${requestsById.size} request id(s) are unacknowledged: ${idListDetail(missingAckIds)}.`,\n        evidence: [\n          evidence(\n            `${prefix}/inbox/unacknowledged-request-ids`,\n            missingAckIds.slice(0, MAX_EXAMPLES),\n          ),\n        ],\n        recommendedAction:\n          'Record one delivered or failed acknowledgement for every queued request id.',\n      }),\n    )\n  }\n\n  const statusUnavailableIds: string[] = []\n  const notDeliveredIds: string[] = []\n  for (const [id, acknowledgements] of acknowledgementsById) {\n    if (!requestsById.has(id) || acknowledgements.length !== 1) continue\n    const delivered = acknowledgements[0]?.delivered\n    if (delivered === null || delivered === undefined) statusUnavailableIds.push(id)\n    else if (!delivered) notDeliveredIds.push(id)\n  }\n  if (statusUnavailableIds.length > 0) {\n    out.push(\n      issue({\n        code: 'steer-ack-status-unavailable',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject,\n        claim: 'Some steer acknowledgements omit delivery status',\n        detail: `${statusUnavailableIds.length} id(s): ${idListDetail(statusUnavailableIds)}.`,\n        evidence: [\n          evidence(\n            `${prefix}/events/status-unavailable-request-ids`,\n            statusUnavailableIds.slice(0, MAX_EXAMPLES),\n          ),\n        ],\n        recommendedAction: 'Record delivered: true or delivered: false on each acknowledgement.',\n        metadata: { assessment: 'unavailable', unavailable_count: statusUnavailableIds.length },\n      }),\n    )\n  }\n  if (notDeliveredIds.length > 0) {\n    out.push(\n      issue({\n        code: 'steer-not-delivered',\n        area: 'control-integrity',\n        severity: 'high',\n        subject,\n        claim: 'Queued steer requests were acknowledged but not delivered',\n        detail: `${notDeliveredIds.length} id(s): ${idListDetail(notDeliveredIds)}.`,\n        evidence: [\n          evidence(\n            `${prefix}/events/not-delivered-request-ids`,\n            notDeliveredIds.slice(0, MAX_EXAMPLES),\n          ),\n        ],\n        recommendedAction:\n          'Retry or explicitly fail the control request instead of treating it as delivered.',\n      }),\n    )\n  }\n  return out\n}\n","import { evidence, issue, MAX_EXAMPLES } from './integrity-issues'\nimport { steerIssues } from './integrity-steer'\nimport type { SupervisorRunIntegrityIssue } from './integrity-types'\nimport type { SpawnRow, SupervisorTreeFacts, WorkerLogFacts } from './source-facts'\nimport type { SupervisorRunSources, SupervisorRunTree } from './types'\n\nfunction sourceIdentityIssues(facts: SupervisorTreeFacts): SupervisorRunIntegrityIssue[] {\n  const out: SupervisorRunIntegrityIssue[] = []\n  const malformedSpawns = facts.spawns.filter((spawn) => !spawn.valid)\n  if (facts.journalInvalidRows > 0 || malformedSpawns.length > 0) {\n    out.push(\n      issue({\n        code: 'source-row-malformed',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject: 'journal-rows',\n        claim: 'Some supervisor journal rows could not be interpreted',\n        detail: `${facts.journalInvalidRows} of ${facts.journalRows} row(s) could not be interpreted (${facts.journalMalformedJsonRows} were not JSON objects) and ${malformedSpawns.length} malformed spawn row(s) were excluded from structural conclusions.`,\n        evidence: [\n          evidence('journal/uninterpretable-rows/count', facts.journalInvalidRows),\n          evidence('journal/malformed-json-rows/count', facts.journalMalformedJsonRows),\n          evidence('journal/rows/count', facts.journalRows),\n          evidence('journal/dialect', facts.journalDialect),\n          ...malformedSpawns\n            .slice(0, MAX_EXAMPLES)\n            .map((spawn) =>\n              evidence(`journal/spawns/${spawn.sourceRow}/invalid-fields`, spawn.invalidFields),\n            ),\n        ],\n        recommendedAction:\n          'Repair the rows, or teach the parser the shape they are in, before using the run for structural analysis. A row nobody can read must never be silently absent from the tree.',\n        metadata: {\n          assessment: 'unavailable',\n          journal_rows: facts.journalRows,\n          uninterpretable_rows: facts.journalInvalidRows,\n          malformed_json_rows: facts.journalMalformedJsonRows,\n          malformed_spawn_rows: malformedSpawns.length,\n          journal_dialect: facts.journalDialect,\n        },\n      }),\n    )\n  }\n  const unidentifiedSpawns = malformedSpawns.filter((spawn) => spawn.id.length === 0)\n  const unidentifiedCloses = facts.closes.filter((close) => close.id.length === 0)\n  if (unidentifiedSpawns.length + unidentifiedCloses.length > 0) {\n    out.push(\n      issue({\n        code: 'source-event-identity-unavailable',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject: 'journal-event-identity',\n        claim: 'Some supervisor journal events have no usable invocation id',\n        detail: `${unidentifiedSpawns.length} spawn and ${unidentifiedCloses.length} terminal event(s) lack an id.`,\n        evidence: [\n          evidence('journal/unidentified-spawns/count', unidentifiedSpawns.length),\n          evidence('journal/unidentified-terminals/count', unidentifiedCloses.length),\n        ],\n        recommendedAction: 'Reject or repair control events that omit their stable invocation id.',\n        metadata: { assessment: 'unavailable', checks: ['journal-event-linkage'] },\n      }),\n    )\n  }\n\n  const spawnCounts = new Map<string, number>()\n  for (const spawn of facts.spawns) {\n    if (!spawn.valid || spawn.id.length === 0) continue\n    spawnCounts.set(spawn.id, (spawnCounts.get(spawn.id) ?? 0) + 1)\n  }\n  for (const [id, count] of spawnCounts) {\n    if (count < 2) continue\n    out.push(\n      issue({\n        code: 'duplicate-spawn',\n        area: 'control-integrity',\n        severity: 'critical',\n        subject: id,\n        claim: 'An invocation has more than one spawned control event',\n        detail: `${count} spawned events name invocation ${JSON.stringify(id)}.`,\n        evidence: [evidence(`journal/spawn-count/${encodeURIComponent(id)}`, count)],\n        recommendedAction: 'Make spawn event append idempotent.',\n      }),\n    )\n  }\n\n  const closeCounts = new Map<string, number>()\n  for (const close of facts.closes) {\n    if (close.id.length === 0) continue\n    closeCounts.set(close.id, (closeCounts.get(close.id) ?? 0) + 1)\n  }\n  const uncertainSpawnIds = new Set(\n    malformedSpawns.filter((spawn) => spawn.id.length > 0).map((spawn) => spawn.id),\n  )\n  if (unidentifiedSpawns.length === 0 && facts.journalInvalidRows === 0) {\n    const orphanCloses = new Map<string, Array<(typeof facts.closes)[number]>>()\n    for (const close of facts.closes) {\n      if (close.id.length === 0 || spawnCounts.has(close.id) || uncertainSpawnIds.has(close.id)) {\n        continue\n      }\n      const rows = orphanCloses.get(close.id) ?? []\n      rows.push(close)\n      orphanCloses.set(close.id, rows)\n    }\n    for (const [id, closes] of orphanCloses) {\n      out.push(\n        issue({\n          code: 'orphan-terminal',\n          area: 'control-integrity',\n          severity: 'critical',\n          subject: id,\n          claim: 'A terminal control event names an invocation that was never spawned',\n          detail: `${closes.length} terminal event(s) for ${JSON.stringify(id)} have no matching spawn.`,\n          evidence: [\n            evidence(`journal/closes/${encodeURIComponent(id)}/count`, closes.length),\n            ...closes\n              .slice(0, MAX_EXAMPLES)\n              .map((close, index) =>\n                evidence(`journal/closes/${encodeURIComponent(id)}/${index}`, close),\n              ),\n          ],\n          recommendedAction: 'Retain the matching spawn event or reject the orphan terminal event.',\n        }),\n      )\n    }\n  }\n  for (const [id, count] of closeCounts) {\n    if (count < 2) continue\n    out.push(\n      issue({\n        code: 'duplicate-terminal',\n        area: 'control-integrity',\n        severity: 'critical',\n        subject: id,\n        claim: 'An invocation has more than one terminal control event',\n        detail: `${count} settled/cancelled events name invocation ${JSON.stringify(id)}.`,\n        evidence: [evidence(`journal/terminal-count/${encodeURIComponent(id)}`, count)],\n        recommendedAction: 'Make terminal event append idempotent.',\n      }),\n    )\n  }\n  return out\n}\n\nexport interface JoinedWorker {\n  readonly spawn: SpawnRow\n  readonly facts: WorkerLogFacts\n}\n\nfunction joinWorkerControls(facts: SupervisorTreeFacts): {\n  joined: JoinedWorker[]\n  issue: SupervisorRunIntegrityIssue | null\n} {\n  const spawnsById = new Map<string, SpawnRow[]>()\n  const spawnsByLabel = new Map<string, SpawnRow[]>()\n  for (const spawn of facts.workerSpawns) {\n    const ids = spawnsById.get(spawn.id) ?? []\n    ids.push(spawn)\n    spawnsById.set(spawn.id, ids)\n    const labels = spawnsByLabel.get(spawn.label) ?? []\n    labels.push(spawn)\n    spawnsByLabel.set(spawn.label, labels)\n  }\n  const rowsWithoutIdByLabel = new Map<string, WorkerLogFacts[]>()\n  for (const row of facts.workerLogRows) {\n    if (row.workerId !== null && row.workerId.length > 0) continue\n    const matches = rowsWithoutIdByLabel.get(row.label) ?? []\n    matches.push(row)\n    rowsWithoutIdByLabel.set(row.label, matches)\n  }\n\n  const rowsBySpawn = new Map<string, WorkerLogFacts[]>()\n  const unmatchedRows: number[] = []\n  const ambiguousRows: number[] = []\n  for (const row of facts.workerLogRows) {\n    const matches =\n      row.workerId !== null && row.workerId.length > 0\n        ? (spawnsById.get(row.workerId) ?? [])\n        : (rowsWithoutIdByLabel.get(row.label)?.length ?? 0) === 1\n          ? (spawnsByLabel.get(row.label) ?? [])\n          : []\n    if (matches.length === 0) {\n      unmatchedRows.push(row.sourceIndex)\n      continue\n    }\n    if (matches.length !== 1) {\n      ambiguousRows.push(row.sourceIndex)\n      continue\n    }\n    const spawn = matches[0] as SpawnRow\n    const joined = rowsBySpawn.get(spawn.id) ?? []\n    joined.push(row)\n    rowsBySpawn.set(spawn.id, joined)\n  }\n\n  const joined: JoinedWorker[] = []\n  const missingSpawnIds: string[] = []\n  const duplicateSpawnIds: string[] = []\n  for (const spawn of facts.workerSpawns) {\n    if ((spawnsById.get(spawn.id)?.length ?? 0) !== 1) continue\n    const rows = rowsBySpawn.get(spawn.id) ?? []\n    if (rows.length === 0) missingSpawnIds.push(spawn.id)\n    else if (rows.length > 1) duplicateSpawnIds.push(spawn.id)\n    else joined.push({ spawn, facts: rows[0] as WorkerLogFacts })\n  }\n\n  if (\n    missingSpawnIds.length === 0 &&\n    duplicateSpawnIds.length === 0 &&\n    unmatchedRows.length === 0 &&\n    ambiguousRows.length === 0\n  ) {\n    return { joined, issue: null }\n  }\n  return {\n    joined,\n    issue: issue({\n      code: 'worker-control-join-unavailable',\n      area: 'capture-integrity',\n      severity: 'high',\n      subject: 'worker-control-join',\n      claim: 'Worker control-log coverage does not match recorded child invocations',\n      detail: `${missingSpawnIds.length} spawn(s) have no log, ${duplicateSpawnIds.length} have duplicate logs, ${unmatchedRows.length} log row(s) match no spawn, and ${ambiguousRows.length} row(s) are ambiguous.`,\n      evidence: [\n        evidence('workers/join/missing-spawn-ids', missingSpawnIds.slice(0, MAX_EXAMPLES)),\n        evidence('workers/join/duplicate-spawn-ids', duplicateSpawnIds.slice(0, MAX_EXAMPLES)),\n        evidence('workers/join/unmatched-source-rows', unmatchedRows.slice(0, MAX_EXAMPLES)),\n        evidence('workers/join/ambiguous-source-rows', ambiguousRows.slice(0, MAX_EXAMPLES)),\n      ],\n      recommendedAction:\n        'Retain exactly one worker control row with workerId for every spawned invocation.',\n      metadata: {\n        assessment: 'unavailable',\n        missing_count: missingSpawnIds.length,\n        duplicate_count: duplicateSpawnIds.length,\n        unmatched_count: unmatchedRows.length,\n        ambiguous_count: ambiguousRows.length,\n      },\n    }),\n  }\n}\n\nexport function sourceIssues(\n  source: SupervisorRunSources,\n  facts: SupervisorTreeFacts,\n  tree: SupervisorRunTree,\n): SupervisorRunIntegrityIssue[] {\n  const out = sourceIdentityIssues(facts)\n  if (source.workers === null) {\n    const reason = source.workersMissingReason ?? 'worker control-log store was not captured'\n    out.push(\n      issue({\n        code: 'worker-controls-unavailable',\n        area: 'capture-integrity',\n        severity: 'medium',\n        subject: 'steer-delivery',\n        claim:\n          'Steer delivery integrity is unavailable because worker control logs were not captured',\n        detail: reason,\n        evidence: [evidence('sources/workers', null)],\n        recommendedAction: 'Retain each worker inbox and event stream.',\n        metadata: { assessment: 'unavailable', reason },\n      }),\n    )\n    return out\n  }\n\n  const joined = joinWorkerControls(facts)\n  if (joined.issue !== null) out.push(joined.issue)\n  const rootCompleted =\n    tree.rootId !== null &&\n    tree.nodes.filter((node) => node.rollout_id === tree.rootId).length === 1 &&\n    tree.nodes.find((node) => node.rollout_id === tree.rootId)?.outcome.is_completed === true\n  for (const row of joined.joined) out.push(...steerIssues(row, rootCompleted))\n  return out\n}\n","import { validateRolloutLine } from '../rollout/schema'\nimport { evidence, issue, MAX_EXAMPLES } from './integrity-issues'\nimport type { SupervisorRunIntegrityEvidence, SupervisorRunIntegrityIssue } from './integrity-types'\nimport type { SupervisorRunTree } from './types'\n\ninterface NodeRecord {\n  readonly index: number\n  readonly raw: Record<string, unknown>\n  readonly errors: readonly string[]\n  readonly id: string | null\n  readonly parent: string | null | undefined\n  readonly runId: string | null\n  readonly role: string | null\n  readonly messages: readonly unknown[] | null\n  readonly profileId: string | null\n  readonly completed: boolean | null\n  readonly terminal: boolean | null\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n\nfunction nonEmptyString(value: unknown): string | null {\n  return typeof value === 'string' && value.length > 0 ? value : null\n}\n\nfunction parentValue(raw: Record<string, unknown>): string | null | undefined {\n  if (raw.parent_rollout_id === null) return null\n  return nonEmptyString(raw.parent_rollout_id) ?? undefined\n}\n\nfunction terminalValue(outcome: Record<string, unknown> | null): boolean | null {\n  if (outcome === null) return null\n  if (typeof outcome.is_completed !== 'boolean' || typeof outcome.is_truncated !== 'boolean') {\n    return null\n  }\n  if (outcome.error !== null && typeof outcome.error !== 'string') return null\n  return outcome.is_completed || outcome.is_truncated || outcome.error !== null\n}\n\nfunction nodeRecord(value: unknown, index: number): NodeRecord {\n  const raw = isRecord(value) ? value : {}\n  const policy = isRecord(raw.policy) ? raw.policy : null\n  const outcome = isRecord(raw.outcome) ? raw.outcome : null\n  return {\n    index,\n    raw,\n    errors: validateRolloutLine(value),\n    id: nonEmptyString(raw.rollout_id),\n    parent: parentValue(raw),\n    runId: nonEmptyString(raw.run_id),\n    role: nonEmptyString(raw.role),\n    messages: Array.isArray(raw.messages) ? raw.messages : null,\n    profileId: policy === null ? null : nonEmptyString(policy.agent_profile_cell_id),\n    completed:\n      outcome !== null && typeof outcome.is_completed === 'boolean' ? outcome.is_completed : null,\n    terminal: terminalValue(outcome),\n  }\n}\n\nfunction metric(\n  record: NodeRecord,\n  keys: readonly string[],\n): { key: string; value: number } | null {\n  const outcome = isRecord(record.raw.outcome) ? record.raw.outcome : null\n  const metrics = outcome !== null && isRecord(outcome.metrics) ? outcome.metrics : null\n  if (metrics === null) return null\n  for (const key of keys) {\n    const value = metrics[key]\n    if (typeof value === 'number' && Number.isFinite(value)) return { key, value }\n  }\n  return null\n}\n\nfunction nodeEvidence(\n  record: NodeRecord,\n  path: string,\n  value: unknown,\n): SupervisorRunIntegrityEvidence {\n  const key = record.id ?? `index-${record.index}`\n  return evidence(`nodes/${encodeURIComponent(key)}/${path}`, value)\n}\n\nfunction unavailableNodeChecks(record: NodeRecord): string[] {\n  const checks: string[] = []\n  if (record.id === null) checks.push('identity', 'root-membership', 'parent-link', 'cycle')\n  if (record.parent === undefined) checks.push('parent-link', 'cycle')\n  if (record.runId === null) checks.push('cross-run-parent')\n  if (record.role === null) checks.push('root-role')\n  if (!isRecord(record.raw.outcome)) checks.push('timing', 'terminal-state')\n  return [...new Set(checks)]\n}\n\ninterface TreeIssueUncertainty {\n  readonly unknownIdentityRows?: number\n  readonly uncertainIds?: ReadonlySet<string>\n}\n\nexport function treeIssues(\n  tree: SupervisorRunTree,\n  uncertainty: TreeIssueUncertainty = {},\n): SupervisorRunIntegrityIssue[] {\n  const out: SupervisorRunIntegrityIssue[] = []\n  const records = (tree.nodes as readonly unknown[]).map(nodeRecord)\n  const malformedSourceRows = tree.gaps\n    .filter((gap) => gap.code === 'source-row-malformed')\n    .reduce((count, gap) => count + (gap.count ?? 1), 0)\n\n  for (const record of records) {\n    if (record.errors.length === 0) continue\n    out.push(\n      issue({\n        code: 'node-schema-invalid',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject: record.id ?? `node-${record.index}`,\n        claim: 'A supervisor-tree node fails canonical rollout validation',\n        detail: record.errors.join('; '),\n        evidence: [evidence(`nodes/${record.index}/validation`, record.errors)],\n        recommendedAction:\n          'Fix the producer so every node validates as the existing tangle.rollout.v1 shape before analysis.',\n        metadata: { validation_errors: record.errors },\n      }),\n    )\n    const unavailableChecks = unavailableNodeChecks(record)\n    if (unavailableChecks.length === 0) continue\n    out.push(\n      issue({\n        code: 'node-checks-unavailable',\n        area: 'capture-integrity',\n        severity: 'medium',\n        subject: record.id ?? `node-${record.index}`,\n        claim: 'Some integrity checks are unavailable for a malformed supervisor-tree node',\n        detail: `Unavailable checks: ${unavailableChecks.join(', ')}.`,\n        evidence: [evidence(`nodes/${record.index}/unavailable-checks`, unavailableChecks)],\n        recommendedAction:\n          'Retain the named identity and relationship fields with their canonical types.',\n        metadata: { assessment: 'unavailable', checks: unavailableChecks },\n      }),\n    )\n  }\n\n  const byId = new Map<string, NodeRecord[]>()\n  for (const record of records) {\n    if (record.id === null) continue\n    const matches = byId.get(record.id) ?? []\n    matches.push(record)\n    byId.set(record.id, matches)\n  }\n\n  for (const [rolloutId, matches] of byId) {\n    if (matches.length < 2) continue\n    out.push(\n      issue({\n        code: 'duplicate-rollout-id',\n        area: 'control-integrity',\n        severity: 'critical',\n        subject: rolloutId,\n        claim: 'A rollout id is duplicated within one supervisor tree',\n        detail: `${matches.length} nodes claim rollout_id ${JSON.stringify(rolloutId)}, so references are ambiguous.`,\n        evidence: [\n          evidence(`duplicates/${encodeURIComponent(rolloutId)}/count`, matches.length),\n          ...matches.slice(0, MAX_EXAMPLES).map((record) =>\n            evidence(`nodes/${record.index}/identity`, {\n              rollout_id: record.id,\n              parent_rollout_id: record.parent,\n              role: record.role,\n            }),\n          ),\n        ],\n        recommendedAction: 'Give every invocation one stable rollout id and regenerate the tree.',\n      }),\n    )\n  }\n\n  const unknownIdentityRows =\n    records.filter((record) => record.id === null).length +\n    Math.max(malformedSourceRows, uncertainty.unknownIdentityRows ?? 0)\n  const unique = records.filter(\n    (record): record is NodeRecord & { readonly id: string } =>\n      record.id !== null && byId.get(record.id)?.length === 1,\n  )\n\n  let root: NodeRecord | undefined\n  if (tree.rootId === null) {\n    out.push(\n      issue({\n        code: 'root-unavailable',\n        area: 'capture-integrity',\n        severity: 'high',\n        subject: 'tree-root',\n        claim: 'The supervisor-tree root is unavailable',\n        detail: `rootId is null while ${records.length} node row(s) were captured.`,\n        evidence: [evidence('rootId', null)],\n        recommendedAction: 'Capture the root spawned event and preserve its rollout id as rootId.',\n        metadata: { assessment: 'unavailable', node_rows: records.length },\n      }),\n    )\n  } else {\n    const rootRows = byId.get(tree.rootId) ?? []\n    if (rootRows.length === 1) {\n      root = rootRows[0]\n    } else if (rootRows.length === 0 && unknownIdentityRows > 0) {\n      out.push(\n        issue({\n          code: 'node-checks-unavailable',\n          area: 'capture-integrity',\n          severity: 'high',\n          subject: tree.rootId,\n          claim: 'Root membership is unavailable because a malformed node lost its rollout id',\n          detail: `${unknownIdentityRows} malformed node row(s) have no usable rollout_id, so absence of root ${JSON.stringify(tree.rootId)} cannot be established.`,\n          evidence: [evidence('rootId', tree.rootId)],\n          recommendedAction: 'Retain rollout_id even when another node field fails validation.',\n          metadata: { assessment: 'unavailable', checks: ['root-membership'] },\n        }),\n      )\n    } else if (rootRows.length === 0) {\n      out.push(\n        issue({\n          code: 'declared-root-missing',\n          area: 'control-integrity',\n          severity: 'critical',\n          subject: tree.rootId,\n          claim: 'The declared supervisor-tree root has no matching invocation node',\n          detail: `rootId ${JSON.stringify(tree.rootId)} is absent from ${records.length} node row(s).`,\n          evidence: [evidence('rootId', tree.rootId)],\n          recommendedAction: 'Restore the root rollout row or correct rootId.',\n        }),\n      )\n    }\n  }\n\n  if (root !== undefined) {\n    if (root.parent !== undefined && root.parent !== null) {\n      out.push(\n        issue({\n          code: 'root-has-parent',\n          area: 'control-integrity',\n          severity: 'critical',\n          subject: root.id ?? tree.rootId ?? 'tree-root',\n          claim: 'The declared supervisor-tree root has a parent',\n          detail: `Root points to parent ${JSON.stringify(root.parent)}.`,\n          evidence: [nodeEvidence(root, 'parent_rollout_id', root.parent)],\n          recommendedAction: 'Record the root with parent_rollout_id null.',\n        }),\n      )\n    }\n    if (root.role !== null && root.role !== 'supervisor') {\n      out.push(\n        issue({\n          code: 'root-role-invalid',\n          area: 'control-integrity',\n          severity: 'high',\n          subject: root.id ?? tree.rootId ?? 'tree-root',\n          claim: 'The declared supervisor-tree root is not labeled as a supervisor',\n          detail: `Root has role ${JSON.stringify(root.role)}.`,\n          evidence: [nodeEvidence(root, 'role', root.role)],\n          recommendedAction:\n            'Preserve the root invocation role as supervisor when minting rollout rows.',\n        }),\n      )\n    }\n  }\n\n  for (const record of unique) {\n    if (record.parent === undefined) continue\n    if (record.parent === null) {\n      if (record.id !== tree.rootId) {\n        out.push(\n          issue({\n            code: 'detached-node',\n            area: 'control-integrity',\n            severity: 'critical',\n            subject: record.id,\n            claim: 'A non-root invocation is recorded as a detached parentless root',\n            detail: `Node ${JSON.stringify(record.id)} is parentless while rootId is ${JSON.stringify(tree.rootId)}.`,\n            evidence: [\n              nodeEvidence(record, 'parent_rollout_id', null),\n              evidence('rootId', tree.rootId),\n            ],\n            recommendedAction:\n              'Attach the invocation to its spawning parent or record a separate run.',\n          }),\n        )\n      }\n      continue\n    }\n\n    const parentRows = byId.get(record.parent) ?? []\n    if (parentRows.length === 0) {\n      if (unknownIdentityRows > 0 || uncertainty.uncertainIds?.has(record.parent) === true) {\n        out.push(\n          issue({\n            code: 'node-checks-unavailable',\n            area: 'capture-integrity',\n            severity: 'high',\n            subject: record.id,\n            claim: 'Parent membership is unavailable because a malformed node lost its rollout id',\n            detail:\n              uncertainty.uncertainIds?.has(record.parent) === true\n                ? `Parent ${JSON.stringify(record.parent)} appears only in a malformed source row, so its absence cannot be established.`\n                : `Parent ${JSON.stringify(record.parent)} cannot be matched while ${unknownIdentityRows} row(s) have no usable rollout_id.`,\n            evidence: [nodeEvidence(record, 'parent_rollout_id', record.parent)],\n            recommendedAction: 'Retain rollout_id on every row before assessing detached children.',\n            metadata: { assessment: 'unavailable', checks: ['parent-membership'] },\n          }),\n        )\n      } else {\n        out.push(\n          issue({\n            code: 'parent-missing',\n            area: 'control-integrity',\n            severity: 'critical',\n            subject: record.id,\n            claim: 'An invocation points to a parent absent from the supervisor tree',\n            detail: `Node ${JSON.stringify(record.id)} names missing parent ${JSON.stringify(record.parent)}.`,\n            evidence: [nodeEvidence(record, 'parent_rollout_id', record.parent)],\n            recommendedAction: 'Retain the parent invocation or remove the dangling edge.',\n          }),\n        )\n      }\n      continue\n    }\n    if (parentRows.length !== 1) continue\n    const parent = parentRows[0] as NodeRecord\n\n    if (record.runId !== null && parent.runId !== null && record.runId !== parent.runId) {\n      out.push(\n        issue({\n          code: 'cross-run-parent',\n          area: 'control-integrity',\n          severity: 'critical',\n          subject: record.id,\n          claim: 'A parent-child edge crosses supervisor-run identities',\n          detail: `Child run_id ${JSON.stringify(record.runId)} differs from parent run_id ${JSON.stringify(parent.runId)}.`,\n          evidence: [\n            nodeEvidence(record, 'run_id', record.runId),\n            nodeEvidence(parent, 'run_id', parent.runId),\n          ],\n          recommendedAction:\n            'Keep one run_id across a supervision tree or remove the cross-run edge.',\n        }),\n      )\n    }\n\n    const childStart = metric(record, ['spawned_at', 'started_at'])\n    const parentStart = metric(parent, ['spawned_at', 'started_at'])\n    if (childStart !== null && parentStart !== null && childStart.value < parentStart.value) {\n      out.push(\n        issue({\n          code: 'child-before-parent',\n          area: 'control-integrity',\n          severity: 'high',\n          subject: record.id,\n          claim: 'A child invocation is timestamped before its parent started',\n          detail: `Child ${childStart.key} ${childStart.value} precedes parent ${parentStart.key} ${parentStart.value}.`,\n          evidence: [\n            nodeEvidence(record, `outcome.metrics.${childStart.key}`, childStart.value),\n            nodeEvidence(parent, `outcome.metrics.${parentStart.key}`, parentStart.value),\n          ],\n          recommendedAction: 'Use one ordered clock for spawn events or retain clock metadata.',\n        }),\n      )\n    }\n\n    const parentClose = metric(parent, ['settled_at', 'completed_at', 'finished_at'])\n    if (childStart !== null && parentClose !== null && childStart.value > parentClose.value) {\n      out.push(\n        issue({\n          code: 'child-after-parent-close',\n          area: 'control-integrity',\n          severity: 'critical',\n          subject: record.id,\n          claim: 'A child invocation is timestamped after its parent closed',\n          detail: `Child ${childStart.key} ${childStart.value} follows parent ${parentClose.key} ${parentClose.value}.`,\n          evidence: [\n            nodeEvidence(record, `outcome.metrics.${childStart.key}`, childStart.value),\n            nodeEvidence(parent, `outcome.metrics.${parentClose.key}`, parentClose.value),\n          ],\n          recommendedAction:\n            'Correct the causal timestamps or attach the child to its actual spawner.',\n        }),\n      )\n    }\n  }\n\n  for (const record of unique) {\n    const start = metric(record, ['spawned_at', 'started_at'])\n    const close = metric(record, ['settled_at', 'completed_at', 'finished_at'])\n    if (start === null || close === null || close.value >= start.value) continue\n    out.push(\n      issue({\n        code: 'close-before-start',\n        area: 'control-integrity',\n        severity: 'high',\n        subject: record.id,\n        claim: 'An invocation is timestamped as closing before it started',\n        detail: `${start.key} is ${start.value} and ${close.key} is ${close.value}.`,\n        evidence: [\n          nodeEvidence(record, `outcome.metrics.${start.key}`, start.value),\n          nodeEvidence(record, `outcome.metrics.${close.key}`, close.value),\n        ],\n        recommendedAction: 'Correct the event ordering or retain clock-domain metadata.',\n      }),\n    )\n  }\n\n  const emittedCycles = new Set<string>()\n  const resolved = new Set<string>()\n  for (const start of unique) {\n    if (resolved.has(start.id)) continue\n    const path: string[] = []\n    const positions = new Map<string, number>()\n    let current: string | null = start.id\n    while (current !== null) {\n      if (resolved.has(current)) break\n      const position = positions.get(current)\n      if (position !== undefined) {\n        const cycle = path.slice(position)\n        const key = [...cycle].sort().join('\\u0000')\n        if (!emittedCycles.has(key)) {\n          emittedCycles.add(key)\n          out.push(\n            issue({\n              code: 'parent-cycle',\n              area: 'control-integrity',\n              severity: 'critical',\n              subject: [...cycle].sort()[0] ?? 'cycle',\n              claim: 'The supervisor tree contains a parent cycle',\n              detail: `${cycle.join(' -> ')} -> ${cycle[0]}`,\n              evidence: cycle.slice(0, MAX_EXAMPLES).flatMap((id) => {\n                const rows = byId.get(id)\n                const record = rows?.length === 1 ? rows[0] : undefined\n                return record === undefined\n                  ? []\n                  : [nodeEvidence(record, 'parent_rollout_id', record.parent)]\n              }),\n              recommendedAction:\n                'Correct parent ids at ingestion; a cyclic graph is not a run tree.',\n            }),\n          )\n        }\n        break\n      }\n      positions.set(current, path.length)\n      path.push(current)\n      const rows = byId.get(current)\n      if (rows?.length !== 1) break\n      const parent = rows[0]?.parent\n      if (parent === undefined) break\n      current = parent\n    }\n    for (const id of path) resolved.add(id)\n  }\n\n  if (root?.completed === true) {\n    const missingTerminal = unique.filter(\n      (record) => record.id !== root?.id && record.terminal === false,\n    )\n    if (missingTerminal.length > 0) {\n      out.push(\n        issue({\n          code: 'child-terminal-unavailable',\n          area: 'capture-integrity',\n          severity: 'high',\n          subject: 'child-terminal-outcomes',\n          claim: 'A completed supervisor run has children with no captured terminal outcome',\n          detail: `${missingTerminal.length}/${Math.max(0, unique.length - 1)} child node(s) are neither completed, truncated, nor errored.`,\n          evidence: [\n            evidence('children/missing-terminal/count', missingTerminal.length),\n            ...missingTerminal\n              .slice(0, MAX_EXAMPLES)\n              .map((record) => nodeEvidence(record, 'outcome', record.raw.outcome)),\n          ],\n          recommendedAction: 'Retain each child settlement or cancellation event.',\n          metadata: { assessment: 'unavailable', unavailable_count: missingTerminal.length },\n        }),\n      )\n    }\n  }\n\n  const missingTranscripts = records.filter((record) => record.messages?.length === 0)\n  if (missingTranscripts.length > 0) {\n    out.push(\n      issue({\n        code: 'transcript-unavailable',\n        area: 'capture-integrity',\n        severity: 'medium',\n        subject: 'decision-transcripts',\n        claim: 'Decision transcripts are unavailable for some supervisor-tree invocations',\n        detail: `${missingTranscripts.length}/${records.length} node row(s) have messages: [].`,\n        evidence: [\n          evidence('capture/missing-transcripts/count', missingTranscripts.length),\n          ...missingTranscripts\n            .slice(0, MAX_EXAMPLES)\n            .map((record) => nodeEvidence(record, 'messages', [])),\n        ],\n        recommendedAction: 'Hydrate canonical messages from the retained session transcript.',\n        metadata: { assessment: 'unavailable', unavailable_count: missingTranscripts.length },\n      }),\n    )\n  }\n\n  const missingProfiles = records.filter((record) => record.profileId === null)\n  if (missingProfiles.length > 0) {\n    out.push(\n      issue({\n        code: 'profile-id-unavailable',\n        area: 'capture-integrity',\n        severity: 'medium',\n        subject: 'agent-profile-identity',\n        claim:\n          'Canonical agent-profile identity is unavailable for some supervisor-tree invocations',\n        detail: `${missingProfiles.length}/${records.length} node row(s) omit policy.agent_profile_cell_id.`,\n        evidence: [\n          evidence('capture/missing-agent-profile-cell-id/count', missingProfiles.length),\n          ...missingProfiles\n            .slice(0, MAX_EXAMPLES)\n            .map((record) => nodeEvidence(record, 'policy.agent_profile_cell_id', null)),\n        ],\n        recommendedAction:\n          'Record policy.agent_profile_cell_id on every invocation at dispatch time.',\n        metadata: { assessment: 'unavailable', unavailable_count: missingProfiles.length },\n      }),\n    )\n  }\n\n  return out\n}\n","import type { SupervisorRunTree } from './types'\n\nexport const SUPERVISOR_RUN_INTEGRITY_SCHEMA = 'tangle.supervisor-run-integrity@1'\n\nexport type SupervisorRunIntegritySeverity = 'critical' | 'high' | 'medium' | 'low' | 'info'\n\nexport type SupervisorRunSourceOnlyCheckCode =\n  | 'journal-event-cardinality'\n  | 'worker-control-join'\n  | 'steer-ack-correlation'\n\nexport type SupervisorRunIntegrityIssueCode =\n  | 'source-checks-unavailable'\n  | 'node-schema-invalid'\n  | 'node-checks-unavailable'\n  | 'root-unavailable'\n  | 'duplicate-rollout-id'\n  | 'declared-root-missing'\n  | 'root-has-parent'\n  | 'root-role-invalid'\n  | 'detached-node'\n  | 'parent-missing'\n  | 'cross-run-parent'\n  | 'child-before-parent'\n  | 'child-after-parent-close'\n  | 'close-before-start'\n  | 'parent-cycle'\n  | 'child-terminal-unavailable'\n  | 'transcript-unavailable'\n  | 'profile-id-unavailable'\n  | 'source-row-malformed'\n  | 'source-event-identity-unavailable'\n  | 'duplicate-spawn'\n  | 'orphan-terminal'\n  | 'duplicate-terminal'\n  | 'worker-controls-unavailable'\n  | 'worker-control-join-unavailable'\n  | 'steer-request-id-unavailable'\n  | 'steer-ack-id-unavailable'\n  | 'steer-ack-status-unavailable'\n  | 'duplicate-steer-request-id'\n  | 'missing-steer-ack'\n  | 'duplicate-steer-ack'\n  | 'unknown-steer-ack'\n  | 'steer-not-delivered'\n\nexport interface SupervisorRunIntegrityEvidence {\n  readonly path: string\n  readonly value: unknown\n}\n\nexport interface SupervisorRunIntegrityIssue {\n  readonly code: SupervisorRunIntegrityIssueCode\n  readonly area: 'control-integrity' | 'capture-integrity'\n  readonly severity: SupervisorRunIntegritySeverity\n  readonly subject: string\n  readonly claim: string\n  readonly detail: string\n  readonly evidence: readonly SupervisorRunIntegrityEvidence[]\n  readonly recommendedAction: string\n  readonly metadata?: Readonly<Record<string, unknown>>\n}\n\nexport interface SupervisorRunIntegrityReport {\n  readonly schema: typeof SUPERVISOR_RUN_INTEGRITY_SCHEMA\n  readonly runRef: string\n  readonly input: 'sources' | 'tree'\n  readonly tree: SupervisorRunTree\n  readonly issues: readonly SupervisorRunIntegrityIssue[]\n}\n\nexport interface SupervisorRunIntegrityOptions {\n  /** Pins rollout provenance when source input must be projected into a tree. */\n  readonly capturedAt?: string\n}\n","import type { SupervisorRunNodeRole, SupervisorRunSources } from './types'\n\n// ---------------------------------------------------------------------------\n// Journal shapes — structurally parsed. The journal is the contract, not the type.\n// ---------------------------------------------------------------------------\n\ninterface JournalEvent {\n  kind?: unknown\n  id?: unknown\n  parent?: unknown\n  label?: unknown\n  role?: unknown\n  profileDigest?: unknown\n  runtime?: unknown\n  status?: unknown\n  verdict?: unknown\n  reason?: unknown\n  infra?: unknown\n  seq?: unknown\n  at?: unknown\n  spend?: unknown\n  spent?: unknown\n}\n\ninterface Tokens {\n  input: number\n  output: number\n  cacheRead: number\n  cacheWrite: number\n  /** False when the event carried no cache counters at all — not \"zero cached\". */\n  hasCache: boolean\n}\n\ninterface SpendLike {\n  tokens: Tokens\n  usd: number\n}\n\nexport function asRecord(v: unknown): Record<string, unknown> {\n  return typeof v === 'object' && v !== null ? (v as Record<string, unknown>) : {}\n}\n\nfunction num(v: unknown): number {\n  return typeof v === 'number' && Number.isFinite(v) ? v : 0\n}\n\nfunction readSpend(v: unknown): SpendLike {\n  const rec = asRecord(v)\n  const tok = asRecord(rec.tokens)\n  const cacheRead = tok.cacheRead ?? tok.cache_read\n  const cacheWrite = tok.cacheWrite ?? tok.cache_write\n  return {\n    tokens: {\n      input: num(tok.input),\n      output: num(tok.output),\n      cacheRead: num(cacheRead),\n      cacheWrite: num(cacheWrite),\n      hasCache: cacheRead !== undefined || cacheWrite !== undefined,\n    },\n    usd: num(rec.usd),\n  }\n}\n\nexport function parseJsonl(text: string | null): Record<string, unknown>[] {\n  return parseJsonlWithDiagnostics(text).rows\n}\n\ninterface ParsedJsonl {\n  readonly rows: Record<string, unknown>[]\n  readonly invalidRows: number\n}\n\nfunction parseJsonlWithDiagnostics(text: string | null): ParsedJsonl {\n  if (text === null) return { rows: [], invalidRows: 0 }\n  const out: Record<string, unknown>[] = []\n  let invalidRows = 0\n  for (const line of text.split('\\n')) {\n    const trimmed = line.trim()\n    if (!trimmed) continue\n    try {\n      const parsed: unknown = JSON.parse(trimmed)\n      if (typeof parsed === 'object' && parsed !== null && !Array.isArray(parsed)) {\n        out.push(parsed as Record<string, unknown>)\n      } else {\n        invalidRows += 1\n      }\n    } catch {\n      invalidRows += 1\n    }\n  }\n  return { rows: out, invalidRows }\n}\n\nexport function parseJson(text: string | null): Record<string, unknown> | null {\n  if (text === null) return null\n  try {\n    const parsed: unknown = JSON.parse(text)\n    return typeof parsed === 'object' && parsed !== null\n      ? (parsed as Record<string, unknown>)\n      : null\n  } catch {\n    return null\n  }\n}\n\nfunction ms(at: unknown): number | null {\n  if (typeof at !== 'string') return null\n  const t = Date.parse(at)\n  return Number.isFinite(t) ? t : null\n}\n\n// ---------------------------------------------------------------------------\n// The supervision tree, as parsed from the journal event stream.\n// ---------------------------------------------------------------------------\n\nexport interface SpawnRow {\n  /** Zero-based row among parsed journal objects. */\n  sourceRow: number\n  id: string\n  parent: string | null\n  label: string\n  /** Null when the source did not explicitly record a role. */\n  role: SupervisorRunNodeRole | null\n  /** Exact canonical AgentProfile digest, when the source recorded one. */\n  profileDigest: string | null\n  /** Exact execution runtime tag, when the source recorded one. */\n  runtime: string | null\n  at: number | null\n  /** False when identity, parentage, label, or role was malformed. */\n  valid: boolean\n  invalidFields: readonly string[]\n}\n\nexport interface CloseRow {\n  id: string\n  kind: 'settled' | 'cancelled'\n  status: string | null\n  /** String verdict from legacy journals, or valid/invalid for a structured verdict. */\n  verdict: string | null\n  /** Structured verdict validity, when recorded. */\n  valid: boolean | null\n  /** Structured verdict score, preserved without boolean coercion. */\n  score: number | null\n  /** The verdict exactly as the journal carried it. */\n  rawVerdict: unknown | null\n  /** Terminal failure detail exactly as recorded. */\n  reason: string | null\n  /** Whether Runtime classified the failure as infrastructure-caused. */\n  infra: boolean | null\n  at: number | null\n  spend: SpendLike\n  /** False when the close event carried no spend object — not \"spent nothing\". */\n  hasSpend: boolean\n}\n\nexport interface WorkerLogFacts {\n  /** Position in `SupervisorRunSources.workers`, retained for exact evidence paths. */\n  sourceIndex: number\n  workerId: string | null\n  label: string\n  /** `false` means the artifact was missing; a captured empty artifact is `true`. */\n  inboxCaptured: boolean\n  eventsCaptured: boolean\n  inboxInvalidRows: number\n  eventsInvalidRows: number\n  started: number | null\n  /** True once a `finished` event was seen — independent of whether its `at` parsed. */\n  finished: boolean\n  finishedAt: number | null\n  passed: boolean | null\n  /** Numeric score exactly as the finished event recorded it. */\n  score: number | null\n  /** `patchBytes` as reported by the finished event (not the patch file's size). */\n  finishedPatchBytes: number | null\n  evidenceBytes: number\n  /** Unique queued request ids, or null when exact accounting is unavailable. */\n  steersQueued: number | null\n  /** Unique matched request ids acknowledged as delivered, or null when unavailable. */\n  steersDelivered: number | null\n  steersQueuedUnavailable: string | null\n  steersDeliveredUnavailable: string | null\n  questions: number\n  steerRequests: SteerRequestFact[]\n  steerAcknowledgements: SteerAcknowledgementFact[]\n}\n\nexport interface SteerRequestFact {\n  /** Durable inbox request id; null when the row did not retain one. */\n  requestId: string | null\n  row: number\n}\n\nexport interface SteerAcknowledgementFact {\n  /** Worker event request id; null when the event cannot be correlated. */\n  requestId: string | null\n  /** `null` means the acknowledgement omitted delivery status. */\n  delivered: boolean | null\n  row: number\n}\n\n/**\n * The tree + timeline the report is computed from, exposed because the rollout-row\n * minter needs exactly the same parse (one parser, two consumers).\n */\nexport interface SupervisorTreeFacts {\n  readonly rootId: string | null\n  readonly spawns: readonly SpawnRow[]\n  readonly closes: readonly CloseRow[]\n  readonly workerSpawns: readonly SpawnRow[]\n  readonly workerCloses: readonly CloseRow[]\n  readonly brain: {\n    tokensIn: number\n    tokensOut: number\n    cacheRead: number\n    cacheWrite: number\n    /** False when no metered event carried cache counters — not \"nothing cached\". */\n    hasCache: boolean\n    usd: number\n    /** Root-attributed metered events only — exactly the rows summed into this object. */\n    meteredCount: number\n  }\n  readonly workerLogs: ReadonlyMap<string, WorkerLogFacts>\n  /** Every worker source row, including duplicate identities that a map cannot retain. */\n  readonly workerLogRows: readonly WorkerLogFacts[]\n  /** Every non-empty journal line, whatever shape it turned out to have. */\n  readonly journalRows: number\n  /**\n   * Journal lines this parser could not interpret at all: invalid JSON, non-objects, and\n   * JSON objects carrying no record shape it recognizes.\n   *\n   * This count is what separates \"the run was empty\" from \"the input was unreadable\".\n   * Zero spawns with zero invalid rows is a positive claim that nothing happened; it must\n   * only ever be made about bytes the parser actually understood.\n   */\n  readonly journalInvalidRows: number\n  /** The `journalInvalidRows` subset that was not valid JSON, or not a JSON object. */\n  readonly journalMalformedJsonRows: number\n  /**\n   * Records recognized but deliberately not folded into the tree, counted by kind — the\n   * runtime envelope's `begin` header and the `waiting` / `woken` wait-node events. Kept\n   * separate from `journalInvalidRows` because these rows were understood, not rejected.\n   */\n  readonly journalIgnoredRowsByKind: Readonly<Record<string, number>>\n  /**\n   * Every metered row read, root-attributed or not. `brain.meteredCount` covers only the\n   * root's own spend; a nested driver's metered rows are understood but reach this tree\n   * through that driver's settled close, so this total is what keeps row accounting exact:\n   * journalRows = spawns + closes + journalMeteredRows + ignored + journalInvalidRows.\n   */\n  readonly journalMeteredRows: number\n  /** Which dialect(s) the journal's rows were actually written in. */\n  readonly journalDialect: SupervisorJournalDialect\n  /** Parsed once with the journal and worker artifacts. */\n  readonly state: Record<string, unknown> | null\n  readonly startedAt: number | null\n  readonly completedAt: number | null\n  /**\n   * First and last stamped tree events (spawned / settled / cancelled /\n   * metered) in the journal — the bounds of observed activity. They derive a\n   * lower-bound wall for a store that writes no completion stamp.\n   */\n  readonly firstEventAt: number | null\n  readonly lastEventAt: number | null\n}\n\ninterface VerdictFacts {\n  label: string | null\n  valid: boolean | null\n  score: number | null\n  raw: unknown | null\n}\n\nfunction readVerdict(v: unknown): VerdictFacts {\n  if (typeof v === 'string') return { label: v, valid: null, score: null, raw: v }\n  if (typeof v !== 'object' || v === null) {\n    return { label: null, valid: null, score: null, raw: null }\n  }\n  const rec = v as Record<string, unknown>\n  const valid = typeof rec.valid === 'boolean' ? rec.valid : null\n  return {\n    label: valid === null ? null : valid ? 'valid' : 'invalid',\n    valid,\n    score: typeof rec.score === 'number' && Number.isFinite(rec.score) ? rec.score : null,\n    raw: v,\n  }\n}\n\nexport function workerSourceKey(\n  worker: NonNullable<SupervisorRunSources['workers']>[number],\n): string {\n  return worker.workerId ?? worker.label\n}\n\n// ---------------------------------------------------------------------------\n// Journal dialects — the two shapes a supervision journal is actually written in.\n// ---------------------------------------------------------------------------\n\n/**\n * How a journal's rows were shaped on disk.\n *\n * `flat` — one event object per line (`{kind:'spawned', id, ...}`). The loops\n * supervisor writes this, and `readClaudeCodeSupervisorRun` synthesizes it.\n *\n * `runtime-envelope` — the records `agent-runtime`'s `FileSpawnJournal` writes:\n * a `{kind:'begin', root, at}` header followed by `{kind:'event', root, event}`\n * envelopes (`agent-runtime/src/durable/spawn-journal.ts`, `appendRecord`). It is\n * the layout `createFileRunContext(dir)` produces at `<dir>/spawn-journal.jsonl`.\n * This dialect is READ, not tolerated: agent-runtime is the writer, so a reader\n * that could not interpret it was the defect, and `journalDialect` records which\n * shape the bytes actually had so an unexpected one is never invisible.\n *\n * `mixed` — rows of both shapes in one file. `none` — no interpretable row at all.\n */\nexport type SupervisorJournalDialect = 'none' | 'flat' | 'runtime-envelope' | 'mixed'\n\ntype JournalRowDialect = 'flat' | 'runtime-envelope'\n\n/** Event kinds this parser folds into the tree. */\nconst TREE_EVENT_KINDS = ['spawned', 'settled', 'cancelled', 'metered'] as const\ntype TreeEventKind = (typeof TREE_EVENT_KINDS)[number]\n\n/**\n * Event kinds `agent-runtime` journals that this parser recognizes but does not model as\n * tree nodes: `waiting` arms a wait node and `woken` settles it. They are counted by kind\n * rather than dropped, so \"understood, not modeled\" can never be mistaken for \"absent\".\n */\nconst UNMODELLED_EVENT_KINDS: readonly string[] = ['waiting', 'woken']\n\nfunction treeEventKind(value: unknown): TreeEventKind | null {\n  return (TREE_EVENT_KINDS as readonly unknown[]).includes(value) ? (value as TreeEventKind) : null\n}\n\ntype JournalRowReading =\n  | {\n      outcome: 'event'\n      dialect: JournalRowDialect\n      kind: TreeEventKind\n      event: JournalEvent\n    }\n  | { outcome: 'ignored'; dialect: JournalRowDialect; kind: string }\n  | { outcome: 'unreadable' }\n\n/**\n * Classify one parsed journal row. Every row lands in exactly one outcome — interpreted,\n * recognized-but-not-modeled, or unreadable — because a row that falls through silently is\n * how a run with events reads as a run with none.\n */\nfunction readJournalRow(row: Record<string, unknown>): JournalRowReading {\n  const kind = row.kind\n  if (typeof kind !== 'string') return { outcome: 'unreadable' }\n\n  // agent-runtime's FileSpawnJournal record header. It carries no event.\n  if (kind === 'begin' && typeof row.root === 'string') {\n    return { outcome: 'ignored', dialect: 'runtime-envelope', kind: 'begin' }\n  }\n  if (kind === 'event') {\n    const inner = row.event\n    if (typeof inner !== 'object' || inner === null || Array.isArray(inner)) {\n      return { outcome: 'unreadable' }\n    }\n    const innerKind = (inner as Record<string, unknown>).kind\n    if (typeof innerKind !== 'string') return { outcome: 'unreadable' }\n    const tree = treeEventKind(innerKind)\n    if (tree !== null) {\n      return {\n        outcome: 'event',\n        dialect: 'runtime-envelope',\n        kind: tree,\n        event: inner as JournalEvent,\n      }\n    }\n    // The envelope proves this IS a journaled event, so an unmodelled kind is recorded by\n    // name rather than called unreadable — the caller sees exactly what went uncounted.\n    return { outcome: 'ignored', dialect: 'runtime-envelope', kind: innerKind }\n  }\n\n  const tree = treeEventKind(kind)\n  if (tree !== null) {\n    return { outcome: 'event', dialect: 'flat', kind: tree, event: row as JournalEvent }\n  }\n  if (UNMODELLED_EVENT_KINDS.includes(kind)) {\n    return { outcome: 'ignored', dialect: 'flat', kind }\n  }\n  // A bare object with an unknown `kind` could be any record at all — unlike the envelope\n  // case there is no evidence it is a journal event, so it counts as unreadable (fail closed).\n  return { outcome: 'unreadable' }\n}\n\nfunction summarizeDialect(seen: ReadonlySet<JournalRowDialect>): SupervisorJournalDialect {\n  if (seen.size === 0) return 'none'\n  if (seen.size > 1) return 'mixed'\n  return seen.has('runtime-envelope') ? 'runtime-envelope' : 'flat'\n}\n\nexport function parseSupervisorTree(src: SupervisorRunSources): SupervisorTreeFacts {\n  const parsedJournal = parseJsonlWithDiagnostics(src.journal)\n  const events = parsedJournal.rows\n  const state = parseJson(src.state)\n\n  const spawns: SpawnRow[] = []\n  const closes: CloseRow[] = []\n  let brainIn = 0\n  let brainOut = 0\n  let brainCacheRead = 0\n  let brainCacheWrite = 0\n  let brainHasCache = false\n  let brainUsd = 0\n  let meteredCount = 0\n  let rootId: string | null = null\n  let unreadableRows = 0\n  const ignoredByKind = new Map<string, number>()\n  const dialectsSeen = new Set<JournalRowDialect>()\n  const meteredRows: Array<{ id: string; spend: SpendLike; at: number | null }> = []\n  for (const [sourceRow, row] of events.entries()) {\n    const reading = readJournalRow(row)\n    if (reading.outcome === 'unreadable') {\n      unreadableRows += 1\n      continue\n    }\n    dialectsSeen.add(reading.dialect)\n    if (reading.outcome === 'ignored') {\n      ignoredByKind.set(reading.kind, (ignoredByKind.get(reading.kind) ?? 0) + 1)\n      continue\n    }\n    const { kind, event: ev } = reading\n    const id = typeof ev.id === 'string' ? ev.id : ''\n    if (kind === 'spawned') {\n      const parent = typeof ev.parent === 'string' && ev.parent.length > 0 ? ev.parent : null\n      const label = typeof ev.label === 'string' ? ev.label : ''\n      const invalidFields: string[] = []\n      if (id.length === 0) invalidFields.push('id')\n      const parentOmittedForFirstRoot = ev.parent === undefined && rootId === null\n      if (\n        ev.parent !== null &&\n        !parentOmittedForFirstRoot &&\n        !(typeof ev.parent === 'string' && ev.parent.length > 0)\n      ) {\n        invalidFields.push('parent')\n      }\n      if (label.length === 0) invalidFields.push('label')\n      if (ev.role !== undefined && ev.role !== 'supervisor' && ev.role !== 'worker') {\n        invalidFields.push('role')\n      }\n      if (\n        ev.profileDigest !== undefined &&\n        !(typeof ev.profileDigest === 'string' && ev.profileDigest.length > 0)\n      ) {\n        invalidFields.push('profileDigest')\n      }\n      if (ev.runtime !== undefined && !(typeof ev.runtime === 'string' && ev.runtime.length > 0)) {\n        invalidFields.push('runtime')\n      }\n      const role: SupervisorRunNodeRole | null =\n        ev.role === 'supervisor' || ev.role === 'worker' ? ev.role : null\n      const valid = invalidFields.length === 0\n      if (valid && parent === null && rootId === null) rootId = id\n      spawns.push({\n        sourceRow,\n        id,\n        parent,\n        label,\n        role,\n        profileDigest:\n          typeof ev.profileDigest === 'string' && ev.profileDigest.length > 0\n            ? ev.profileDigest\n            : null,\n        runtime: typeof ev.runtime === 'string' && ev.runtime.length > 0 ? ev.runtime : null,\n        at: ms(ev.at),\n        valid,\n        invalidFields,\n      })\n    } else if (kind === 'settled') {\n      const verdict = readVerdict(ev.verdict)\n      closes.push({\n        id,\n        kind: 'settled',\n        status: typeof ev.status === 'string' ? ev.status : null,\n        verdict: verdict.label,\n        valid: verdict.valid,\n        score: verdict.score,\n        rawVerdict: verdict.raw,\n        reason: typeof ev.reason === 'string' ? ev.reason : null,\n        infra: typeof ev.infra === 'boolean' ? ev.infra : null,\n        at: ms(ev.at),\n        spend: readSpend(ev.spent),\n        hasSpend: asRecord(ev.spent).tokens !== undefined,\n      })\n    } else if (kind === 'cancelled') {\n      closes.push({\n        id,\n        kind: 'cancelled',\n        status: 'cancelled',\n        verdict: typeof ev.reason === 'string' ? ev.reason : null,\n        valid: null,\n        score: null,\n        rawVerdict: typeof ev.reason === 'string' ? ev.reason : null,\n        reason: typeof ev.reason === 'string' ? ev.reason : null,\n        infra: null,\n        at: ms(ev.at),\n        spend: {\n          tokens: { input: 0, output: 0, cacheRead: 0, cacheWrite: 0, hasCache: false },\n          usd: 0,\n        },\n        hasSpend: false,\n      })\n    } else if (kind === 'metered') {\n      // Deferred: rows are attributed after the loop, once the root is known, so a metered\n      // event that precedes the root spawn is never misattributed.\n      meteredRows.push({ id, spend: readSpend(ev.spend), at: ms(ev.at) })\n    } else {\n      // `TREE_EVENT_KINDS` and these branches are one contract: adding a kind to the set\n      // without a branch here would silently drop its rows, which is the defect this\n      // accounting exists to prevent. The compiler refuses the omission.\n      const unhandled: never = kind\n      throw new Error(`unhandled journal event kind ${JSON.stringify(unhandled)}`)\n    }\n  }\n\n  // Only root-attributed metered events are the supervisor brain's own spend. A nested\n  // driver meters under its own id; its spend reaches this tree through its settled close,\n  // so folding it into the brain here would count the same tokens twice.\n  for (const row of meteredRows) {\n    if (rootId === null || row.id !== rootId) continue\n    brainIn += row.spend.tokens.input\n    brainOut += row.spend.tokens.output\n    brainCacheRead += row.spend.tokens.cacheRead\n    brainCacheWrite += row.spend.tokens.cacheWrite\n    brainHasCache = brainHasCache || row.spend.tokens.hasCache\n    brainUsd += row.spend.usd\n    meteredCount += 1\n  }\n\n  const workerSpawns = spawns.filter((s) => s.valid && s.id !== rootId)\n  const workerIds = new Set(workerSpawns.map((s) => s.id))\n  const workerCloses = closes.filter((c) => workerIds.has(c.id))\n\n  const workerLogs = new Map<string, WorkerLogFacts>()\n  const workerLogRows: WorkerLogFacts[] = []\n  for (const [sourceIndex, w] of (src.workers ?? []).entries()) {\n    const facts: WorkerLogFacts = {\n      sourceIndex,\n      workerId: w.workerId ?? null,\n      label: w.label,\n      inboxCaptured: w.inbox !== null,\n      eventsCaptured: w.events !== null,\n      inboxInvalidRows: 0,\n      eventsInvalidRows: 0,\n      started: null,\n      finished: false,\n      finishedAt: null,\n      passed: null,\n      score: null,\n      finishedPatchBytes: null,\n      evidenceBytes: 0,\n      steersQueued: null,\n      steersDelivered: null,\n      steersQueuedUnavailable: null,\n      steersDeliveredUnavailable: null,\n      questions: 0,\n      steerRequests: [],\n      steerAcknowledgements: [],\n    }\n    const parsedInbox = parseJsonlWithDiagnostics(w.inbox)\n    const parsedEvents = parseJsonlWithDiagnostics(w.events)\n    facts.inboxInvalidRows = parsedInbox.invalidRows\n    facts.eventsInvalidRows = parsedEvents.invalidRows\n    for (const [row, req] of parsedInbox.rows.entries()) {\n      if (typeof req.message !== 'string' || req.message.trim().length === 0) continue\n      facts.steerRequests.push({\n        requestId: typeof req.id === 'string' && req.id.length > 0 ? req.id : null,\n        row,\n      })\n    }\n    for (const [row, ev] of parsedEvents.rows.entries()) {\n      const kind = ev.kind\n      if (kind === 'message') {\n        if (ev.direction === 'up') {\n          facts.questions += 1\n          continue\n        }\n        facts.steerAcknowledgements.push({\n          requestId:\n            typeof ev.requestId === 'string' && ev.requestId.length > 0 ? ev.requestId : null,\n          delivered: typeof ev.delivered === 'boolean' ? ev.delivered : null,\n          row,\n        })\n      } else if (kind === 'started') {\n        facts.started = ms(ev.at)\n      } else if (kind === 'finished') {\n        facts.finished = true\n        facts.finishedAt = ms(ev.at)\n        facts.passed = typeof ev.passed === 'boolean' ? ev.passed : null\n        facts.score = typeof ev.score === 'number' && Number.isFinite(ev.score) ? ev.score : null\n        facts.finishedPatchBytes = typeof ev.patchBytes === 'number' ? ev.patchBytes : null\n        facts.evidenceBytes = typeof ev.evidence === 'string' ? ev.evidence.length : 0\n      }\n    }\n    const requestsById = new Map<string, number>()\n    for (const request of facts.steerRequests) {\n      if (request.requestId === null) continue\n      requestsById.set(request.requestId, (requestsById.get(request.requestId) ?? 0) + 1)\n    }\n    const acknowledgementsById = new Map<string, SteerAcknowledgementFact[]>()\n    for (const acknowledgement of facts.steerAcknowledgements) {\n      if (acknowledgement.requestId === null) continue\n      const matches = acknowledgementsById.get(acknowledgement.requestId) ?? []\n      matches.push(acknowledgement)\n      acknowledgementsById.set(acknowledgement.requestId, matches)\n    }\n    const queueProblems: string[] = []\n    if (!facts.inboxCaptured) queueProblems.push('inbox absent')\n    if (!facts.eventsCaptured) queueProblems.push('events absent')\n    if (facts.inboxInvalidRows > 0) queueProblems.push('inbox contains malformed rows')\n    if (facts.eventsInvalidRows > 0) queueProblems.push('events contain malformed rows')\n    if (facts.steerRequests.some((request) => request.requestId === null)) {\n      queueProblems.push('queued request id missing')\n    }\n    if ([...requestsById.values()].some((count) => count > 1)) {\n      queueProblems.push('queued request id duplicated')\n    }\n    if (facts.steerAcknowledgements.some((acknowledgement) => acknowledgement.requestId === null)) {\n      queueProblems.push('acknowledgement request id missing')\n    }\n    if ([...acknowledgementsById.keys()].some((id) => !requestsById.has(id))) {\n      queueProblems.push('acknowledgement has no queued request')\n    }\n    if (queueProblems.length === 0) {\n      facts.steersQueued = requestsById.size\n    } else {\n      facts.steersQueuedUnavailable = [...new Set(queueProblems)].join('; ')\n    }\n\n    const deliveryProblems = [...queueProblems]\n    if ([...acknowledgementsById.values()].some((rows) => rows.length > 1)) {\n      deliveryProblems.push('acknowledgement request id duplicated')\n    }\n    if (facts.steerAcknowledgements.some((acknowledgement) => acknowledgement.delivered === null)) {\n      deliveryProblems.push('acknowledgement delivery status missing')\n    }\n    if (deliveryProblems.length === 0) {\n      facts.steersDelivered = [...requestsById.keys()].filter((id) => {\n        const acknowledgement = acknowledgementsById.get(id)\n        return acknowledgement?.length === 1 && acknowledgement[0]?.delivered === true\n      }).length\n    } else {\n      facts.steersDeliveredUnavailable = [...new Set(deliveryProblems)].join('; ')\n    }\n    workerLogRows.push(facts)\n    workerLogs.set(workerSourceKey(w), facts)\n  }\n\n  const startedAt = ms(state?.startedAt) ?? spawns[0]?.at ?? null\n  const rootClose = rootId === null ? null : closes.find((close) => close.id === rootId)\n  const completedAt = ms(state?.completedAt) ?? rootClose?.at ?? null\n\n  let firstEventAt: number | null = null\n  let lastEventAt: number | null = null\n  const widenEventSpan = (at: number | null): void => {\n    if (at === null) return\n    if (firstEventAt === null || at < firstEventAt) firstEventAt = at\n    if (lastEventAt === null || at > lastEventAt) lastEventAt = at\n  }\n  for (const spawn of spawns) widenEventSpan(spawn.at)\n  for (const close of closes) widenEventSpan(close.at)\n  for (const metered of meteredRows) widenEventSpan(metered.at)\n\n  return {\n    rootId,\n    spawns,\n    closes,\n    workerSpawns,\n    workerCloses,\n    brain: {\n      tokensIn: brainIn,\n      tokensOut: brainOut,\n      cacheRead: brainCacheRead,\n      cacheWrite: brainCacheWrite,\n      hasCache: brainHasCache,\n      usd: brainUsd,\n      meteredCount,\n    },\n    workerLogs,\n    workerLogRows,\n    journalRows: events.length + parsedJournal.invalidRows,\n    journalInvalidRows: parsedJournal.invalidRows + unreadableRows,\n    journalMalformedJsonRows: parsedJournal.invalidRows,\n    journalIgnoredRowsByKind: Object.fromEntries(ignoredByKind),\n    journalMeteredRows: meteredRows.length,\n    journalDialect: summarizeDialect(dialectsSeen),\n    state,\n    startedAt,\n    completedAt,\n    firstEventAt,\n    lastEventAt,\n  }\n}\n","/**\n * The supervision tree as `tangle.rollout.v1` rows.\n *\n * A supervisor run IS a tree of rollouts, so its nodes are not a new shape:\n * the root becomes one `RolloutLine` with `role: 'supervisor'`, and every\n * spawned invocation keeps its explicit supervisor/worker role with\n * `parent_rollout_id` pointing at its spawner. The rows append to the same\n * ledger as solo-agent rollouts and join to them with the same keys.\n *\n * What the journal CANNOT supply is the transcript: a worker's messages live\n * in its harness store (opencode sqlite, Claude Code jsonl), which the\n * `src/rollout/readers/*` intake readers own. Rows minted here are therefore\n * GAP lines (`messages: []`, `provenance.gap` set) carrying identity,\n * structure, outcome and cost; hydrating them with messages is the readers'\n * job, keyed on `artifacts.transcript_ref`.\n *\n * Timing lives in `outcome.metrics` (`spawned_at` / `settled_at` / `wall_ms`)\n * rather than a schema field: `tangle.rollout.v1` describes ONE invocation,\n * and the inter-invocation event timeline — which is what waves, concurrency,\n * idle and utilization are computed from — is a property of the journal, not\n * of any single row. The analyzer reads that timeline; these rows carry the\n * per-node facts.\n */\n\nimport { unscreenedRewardFields } from '../rollout/reward'\nimport {\n  isRolloutLine,\n  ROLLOUT_SCHEMA,\n  type RolloutLine,\n  type RolloutSplit,\n} from '../rollout/schema'\nimport { asRecord, parseJson, parseSupervisorTree, type SupervisorTreeFacts } from './source-facts'\nimport type {\n  SupervisorRunSources,\n  SupervisorRunTree,\n  SupervisorRunTreeGap,\n  WorkerLogSource,\n} from './types'\n\nexport interface SupervisorRolloutOptions {\n  /** Benchmark/suite id for `task.suite`. Defaults to `'supervisor-run'`. */\n  readonly suite?: string\n  /** `task.split`. Defaults to `'search'` (the trainable pool). */\n  readonly split?: RolloutSplit\n  /** Replicate index. Defaults to 0. */\n  readonly rep?: number\n  /** Sampling seed the campaign pinned. Defaults to null (not recorded). */\n  readonly seed?: number | null\n  /** `run_id` for every node. Defaults to the supervisor root id, else `runRef`. */\n  readonly runId?: string\n  /** Harness that drove the supervisor. */\n  readonly supervisorHarness?: string | null\n  /** Harness that drove the workers. */\n  readonly workerHarness?: string | null\n  /** Model the supervisor ran on. */\n  readonly supervisorModel?: string | null\n  /** Model the workers ran on. */\n  readonly workerModel?: string | null\n  readonly experimentId?: string | null\n  readonly candidateId?: string | null\n  readonly generation?: number | null\n  readonly candidateIndex?: number | null\n  /** Pins `provenance.captured_at`; defaults to now. */\n  readonly capturedAt?: string\n}\n\nconst EMPTY_COST = {\n  usd: null,\n  tokens_in: null,\n  tokens_out: null,\n  tokens_reasoning: null,\n  cache_read: null,\n  cache_write: null,\n  wall_s: null,\n} as const\n\nfunction hasWorkerId(\n  worker: WorkerLogSource,\n): worker is WorkerLogSource & { readonly workerId: string } {\n  return worker.workerId !== undefined\n}\n\n/**\n * Mint the supervision tree as rollout rows. Returns the rows plus the gaps\n * that made any of them incomplete — same unavailable-vs-zero discipline as\n * the report: a row with no transcript says WHY, it never pretends to be empty.\n */\nexport function supervisorRunRolloutLines(\n  src: SupervisorRunSources,\n  opts: SupervisorRolloutOptions = {},\n): SupervisorRunTree {\n  return supervisorRunRolloutLinesFromFacts(src, parseSupervisorTree(src), opts)\n}\n\n/** Mint rollout rows from an already parsed source without reading its JSONL again. */\nexport function supervisorRunRolloutLinesFromFacts(\n  src: SupervisorRunSources,\n  tree: SupervisorTreeFacts,\n  opts: SupervisorRolloutOptions = {},\n): SupervisorRunTree {\n  const gaps: SupervisorRunTreeGap[] = []\n  if (src.journal === null) {\n    gaps.push({\n      code: 'journal-unavailable',\n      message: `${src.supRunDir === null ? 'no supervisor run dir' : 'journal absent'}; no nodes recoverable`,\n    })\n    return { rootId: null, nodes: [], gaps }\n  }\n  // `journalInvalidRows` covers rows the parser could not interpret at all, including JSON\n  // objects in a shape it does not recognize — so a journal it read but understood none of\n  // reports an explicit gap instead of an empty tree.\n  const malformedSourceRows =\n    tree.journalInvalidRows + tree.spawns.filter((spawn) => !spawn.valid).length\n  if (malformedSourceRows > 0) {\n    gaps.push({\n      code: 'source-row-malformed',\n      message: `${malformedSourceRows} of ${tree.journalRows} journal row(s) were unusable and excluded from the tree`,\n      count: malformedSourceRows,\n    })\n  }\n\n  const state = tree.state\n  const result = parseJson(src.result)\n  const judge = parseJson(src.judge)\n  const stateResult = asRecord(state?.result)\n\n  const rootId = tree.rootId\n  const runId = opts.runId ?? rootId ?? src.runRef\n  const suite = opts.suite ?? 'supervisor-run'\n  const instanceId = src.instanceId ?? src.runRef\n  const split: RolloutSplit = opts.split ?? 'search'\n  const capturedAt = opts.capturedAt ?? new Date().toISOString()\n\n  const base = {\n    schema: ROLLOUT_SCHEMA,\n    run_id: runId,\n    experiment_id: opts.experimentId ?? null,\n    candidate_id: opts.candidateId ?? null,\n    generation: opts.generation ?? null,\n    candidate_index: opts.candidateIndex ?? null,\n    task: {\n      suite,\n      instance_id: instanceId,\n      split,\n      seed: opts.seed ?? null,\n      rep: opts.rep ?? 0,\n    },\n    messages: [] as RolloutLine['messages'],\n    tool_defs: [] as RolloutLine['tool_defs'],\n  } satisfies Partial<RolloutLine> & Record<string, unknown>\n\n  const nodes: RolloutLine[] = []\n\n  // ── root: the supervisor invocation ────────────────────────────────────\n  if (rootId !== null) {\n    const rootSpawn = tree.spawns.find((spawn) => spawn.valid && spawn.id === rootId)\n    const judgeResolved = typeof judge?.resolved === 'boolean' ? judge.resolved : null\n    const judgeScore = typeof judge?.score === 'number' ? judge.score : null\n    const reward = judgeScore ?? (judgeResolved === null ? null : judgeResolved ? 1 : 0)\n    if (reward === null) {\n      gaps.push({\n        code: 'root-reward-unavailable',\n        message: 'no judge verdict for this run',\n        nodeId: rootId,\n      })\n    }\n    const wallMs =\n      tree.startedAt !== null && tree.completedAt !== null && tree.completedAt >= tree.startedAt\n        ? tree.completedAt - tree.startedAt\n        : null\n    nodes.push({\n      ...base,\n      rollout_id: rootId,\n      parent_rollout_id: null,\n      role: rootSpawn?.role ?? 'supervisor',\n      policy: {\n        harness: opts.supervisorHarness ?? null,\n        harness_version: null,\n        model: opts.supervisorModel ?? null,\n        provider: null,\n        profile_commit: null,\n        agent_profile_cell_id: rootSpawn?.profileDigest ?? null,\n        sampling: null,\n      },\n      outcome: {\n        // `reward` and `realness_gated` are written by one call, in the module\n        // that owns the gate. This is the SECOND producer of rollout rewards —\n        // the judge verdict in the supervision run dir, not `mintRolloutRows` —\n        // and it wrote `reward` by hand while never stating the flag, so\n        // `isLineRealnessGated` was structurally false for every supervisor and\n        // worker row ever emitted here. `unscreenedRewardFields` is the honest\n        // name for what this producer can claim: a supervision journal carries\n        // no `RunRecord.outcome.realness`, so no authenticity gate has run on\n        // this score, and `realness_gated: false` states that rather than\n        // implying it by omission. These rows stay plain `RolloutLine`s, so a\n        // caller feeding them to a training exporter must `assertMinted` first.\n        ...unscreenedRewardFields(reward),\n        reward_source: src.judgeSource,\n        verdict: judge ?? null,\n        metrics: {\n          arm: src.arm,\n          sup_status: typeof state?.status === 'string' ? state.status : null,\n          sup_verdict: typeof state?.verdict === 'string' ? state.verdict : null,\n          delivered: typeof stateResult.delivered === 'boolean' ? stateResult.delivered : null,\n          verify_pass: typeof result?.verify_pass === 'boolean' ? result.verify_pass : null,\n          started_at: tree.startedAt,\n          completed_at: tree.completedAt,\n          workers_spawned: tree.workerSpawns.length,\n          brain_metered_events: tree.brain.meteredCount,\n          runtime: rootSpawn?.runtime ?? null,\n          profile_digest: rootSpawn?.profileDigest ?? null,\n        },\n        is_completed: state?.status === 'completed',\n        is_truncated: false,\n        error:\n          result?.kind === 'interrupted' && typeof result.reason === 'string'\n            ? result.reason\n            : null,\n        realness_gated: false,\n      },\n      cost: {\n        ...EMPTY_COST,\n        usd:\n          src.limits.spendUsd !== null\n            ? null\n            : typeof stateResult.spentUsd === 'number'\n              ? stateResult.spentUsd\n              : tree.brain.usd,\n        tokens_in: src.limits.managerTokens === null ? tree.brain.tokensIn : null,\n        tokens_out: src.limits.managerTokens === null ? tree.brain.tokensOut : null,\n        cache_read:\n          src.limits.managerTokens === null && tree.brain.hasCache ? tree.brain.cacheRead : null,\n        cache_write:\n          src.limits.managerTokens === null && tree.brain.hasCache ? tree.brain.cacheWrite : null,\n        wall_s: wallMs === null ? null : wallMs / 1000,\n      },\n      artifacts: {\n        patch_path: typeof result?.patchPath === 'string' ? result.patchPath : null,\n        run_dir: src.supRunDir,\n        transcript_ref:\n          src.rootTranscriptRef !== undefined\n            ? src.rootTranscriptRef\n            : src.supRunDir === null\n              ? null\n              : `${src.supRunDir}/journal.jsonl`,\n      },\n      provenance: {\n        captured_at: capturedAt,\n        capture: 'backfill',\n        gap: 'supervision journal carries structure and spend, not the brain transcript',\n      },\n    })\n  } else {\n    gaps.push({\n      code: 'root-spawn-unavailable',\n      message: 'no parentless spawned event in the journal',\n    })\n  }\n\n  // ── workers: one node per spawn, keyed to its spawner ───────────────────\n  const closeById = new Map(tree.closes.map((c) => [c.id, c]))\n  const sourceById = new Map(\n    (src.workers ?? []).filter(hasWorkerId).map((worker) => [worker.workerId, worker]),\n  )\n  const fallbackSourceByLabel = new Map(\n    (src.workers ?? [])\n      .filter((worker) => worker.workerId === undefined)\n      .map((worker) => [worker.label, worker]),\n  )\n  // Stable ids are authoritative. Labels are a compatibility join for stores\n  // that predate workerId and are only safe when the store keeps them unique.\n  for (const spawn of tree.workerSpawns) {\n    if (spawn.role === null) {\n      gaps.push({\n        code: 'node-role-unavailable',\n        message: `child ${JSON.stringify(spawn.label)} has no explicit invocation role`,\n        nodeId: spawn.id,\n      })\n      continue\n    }\n    const close = closeById.get(spawn.id) ?? null\n    const workerSource = sourceById.get(spawn.id) ?? fallbackSourceByLabel.get(spawn.label) ?? null\n    const facts =\n      tree.workerLogs.get(workerSource?.workerId ?? workerSource?.label ?? spawn.label) ?? null\n    const wallMs =\n      facts?.started != null && facts.finishedAt != null ? facts.finishedAt - facts.started : null\n    const score = close?.score ?? facts?.score ?? null\n    const passed = close?.valid ?? facts?.passed ?? null\n    const reward = score ?? (passed === null ? null : passed ? 1 : 0)\n    if (reward === null) {\n      gaps.push({\n        code: 'child-reward-unavailable',\n        message: `child ${JSON.stringify(spawn.label)} has no verify verdict`,\n        nodeId: spawn.id,\n      })\n    }\n    const isSupervisor = spawn.role === 'supervisor'\n    nodes.push({\n      ...base,\n      rollout_id: spawn.id,\n      parent_rollout_id: spawn.parent,\n      role: spawn.role,\n      policy: {\n        harness: isSupervisor ? (opts.supervisorHarness ?? null) : (opts.workerHarness ?? null),\n        harness_version: null,\n        model: isSupervisor ? (opts.supervisorModel ?? null) : (opts.workerModel ?? null),\n        provider: null,\n        profile_commit: null,\n        agent_profile_cell_id: spawn.profileDigest,\n        sampling: null,\n      },\n      outcome: {\n        // Same producer, same claim: a child reward is a self-verify verdict\n        // from the journal that no realness gate has seen.\n        ...unscreenedRewardFields(reward),\n        reward_source:\n          reward === null ? null : score === null ? 'worker-self-verify' : 'worker-verdict-score',\n        verdict:\n          close === null\n            ? null\n            : {\n                kind: close.kind,\n                status: close.status,\n                verdict: close.rawVerdict,\n                valid: close.valid,\n                score: close.score,\n              },\n        metrics: {\n          label: spawn.label,\n          spawned_at: spawn.at,\n          settled_at: close?.at ?? null,\n          started_at: facts?.started ?? null,\n          finished_at: facts?.finishedAt ?? null,\n          wall_ms: wallMs,\n          patch_bytes: workerSource?.patchBytes ?? facts?.finishedPatchBytes ?? null,\n          evidence_bytes: facts?.evidenceBytes ?? null,\n          steers_queued: facts?.steersQueued ?? null,\n          steers_delivered: facts?.steersDelivered ?? null,\n          questions: facts?.questions ?? null,\n          runtime: spawn.runtime,\n          profile_digest: spawn.profileDigest,\n        },\n        is_completed: close?.kind === 'settled' && close.status === 'done',\n        is_truncated: close?.kind === 'cancelled',\n        error:\n          close?.kind === 'cancelled'\n            ? (close.reason ?? 'cancelled')\n            : close?.status === 'down'\n              ? (close.reason ?? 'child down')\n              : null,\n        realness_gated: false,\n      },\n      // `close.spend` is only a measurement when the close event carried one;\n      // a store that never priced this worker must leave null, not 0.\n      cost: {\n        ...EMPTY_COST,\n        usd: src.limits.spendUsd !== null || !close?.hasSpend ? null : close.spend.usd,\n        tokens_in: workerSource?.tokensIn ?? (close?.hasSpend ? close.spend.tokens.input : null),\n        tokens_out: workerSource?.tokensOut ?? (close?.hasSpend ? close.spend.tokens.output : null),\n        // Mirror the tokens_in/out journal fallback so a loops-shaped store whose\n        // `settled` spend carries cache counters is not reported as null cache\n        // beside real tokens. Gate on `hasCache` — a spend object without cache\n        // counters must stay null, not a fabricated 0.\n        cache_read:\n          workerSource?.cacheRead ??\n          (close?.hasSpend && close.spend.tokens.hasCache ? close.spend.tokens.cacheRead : null),\n        cache_write:\n          workerSource?.cacheWrite ??\n          (close?.hasSpend && close.spend.tokens.hasCache ? close.spend.tokens.cacheWrite : null),\n        wall_s: wallMs === null ? null : wallMs / 1000,\n      },\n      // A reader that knows where its worker artifacts live says so; only the\n      // loops layout is derivable from `supRunDir`, so guessing it for another\n      // store would mint rows pointing at paths that never existed.\n      artifacts: {\n        patch_path:\n          workerSource?.patchPath !== undefined\n            ? workerSource.patchPath\n            : src.supRunDir === null\n              ? null\n              : `${src.supRunDir}/workers/${spawn.label}.patch`,\n        run_dir: src.supRunDir,\n        transcript_ref:\n          workerSource?.transcriptRef !== undefined\n            ? workerSource.transcriptRef\n            : src.supRunDir === null\n              ? null\n              : `${src.supRunDir}/workers/${spawn.label}.ndjson`,\n      },\n      provenance: {\n        captured_at: capturedAt,\n        capture: 'backfill',\n        gap:\n          workerSource?.transcriptRef == null\n            ? 'worker transcript lives in the harness session store — hydrate via src/rollout/readers'\n            : 'worker transcript recorded by the harness; messages not inlined into this row',\n      },\n    })\n  }\n\n  const invalid = nodes.filter((n) => !isRolloutLine(n))\n  if (invalid.length > 0) {\n    gaps.push({\n      code: 'node-schema-invalid',\n      message: `${invalid.length} node(s) failed tangle.rollout.v1 validation`,\n      count: invalid.length,\n    })\n  }\n  return { rootId, nodes, gaps }\n}\n","import { evidence, issue } from './integrity-issues'\nimport { sourceIssues } from './integrity-source'\nimport { treeIssues } from './integrity-tree'\nimport {\n  SUPERVISOR_RUN_INTEGRITY_SCHEMA,\n  type SupervisorRunIntegrityOptions,\n  type SupervisorRunIntegrityReport,\n  type SupervisorRunSourceOnlyCheckCode,\n} from './integrity-types'\nimport { supervisorRunRolloutLinesFromFacts } from './rollout-nodes'\nimport { parseSupervisorTree } from './source-facts'\nimport type { SupervisorRunSources, SupervisorRunTree } from './types'\n\nexport {\n  SUPERVISOR_RUN_INTEGRITY_SCHEMA,\n  type SupervisorRunIntegrityEvidence,\n  type SupervisorRunIntegrityIssue,\n  type SupervisorRunIntegrityIssueCode,\n  type SupervisorRunIntegrityOptions,\n  type SupervisorRunIntegrityReport,\n  type SupervisorRunIntegritySeverity,\n  type SupervisorRunSourceOnlyCheckCode,\n} from './integrity-types'\n\nfunction isTree(input: SupervisorRunSources | SupervisorRunTree): input is SupervisorRunTree {\n  return 'nodes' in input && Array.isArray(input.nodes)\n}\n\nfunction treeRunRef(tree: SupervisorRunTree): string {\n  const runIds = [\n    ...new Set(\n      tree.nodes\n        .map((node) => node.run_id)\n        .filter((runId): runId is string => typeof runId === 'string' && runId.length > 0),\n    ),\n  ].sort()\n  if (runIds.length === 1) return runIds[0]!\n  if (runIds.length > 1) return `mixed-runs:${runIds.join(',')}`\n  return tree.rootId ?? 'unidentified-tree'\n}\n\n/**\n * Run deterministic integrity checks over source bytes or an already minted tree.\n * Source input is parsed exactly once and reused by projection and source-only checks.\n */\nexport function analyzeSupervisorRunIntegrity(\n  input: SupervisorRunSources | SupervisorRunTree,\n  options: SupervisorRunIntegrityOptions = {},\n): SupervisorRunIntegrityReport {\n  if (isTree(input)) {\n    const sourceOnlyChecks: readonly SupervisorRunSourceOnlyCheckCode[] = [\n      'journal-event-cardinality',\n      'worker-control-join',\n      'steer-ack-correlation',\n    ]\n    return {\n      schema: SUPERVISOR_RUN_INTEGRITY_SCHEMA,\n      runRef: treeRunRef(input),\n      input: 'tree',\n      tree: input,\n      issues: [\n        ...treeIssues(input),\n        issue({\n          code: 'source-checks-unavailable',\n          area: 'capture-integrity',\n          severity: 'medium',\n          subject: 'source-only-control-checks',\n          claim: 'Source-only control checks are unavailable for SupervisorRunTree input',\n          detail:\n            'Rollout rows do not retain journal event multiplicity or worker inbox and acknowledgement rows.',\n          evidence: [evidence('input/source-only-checks', sourceOnlyChecks)],\n          recommendedAction:\n            'Pass SupervisorRunSources when journal and worker control checks are required.',\n          metadata: { assessment: 'unavailable', checks: sourceOnlyChecks },\n        }),\n      ],\n    }\n  }\n\n  const facts = parseSupervisorTree(input)\n  const tree = supervisorRunRolloutLinesFromFacts(input, facts, {\n    capturedAt: options.capturedAt,\n  })\n  return {\n    schema: SUPERVISOR_RUN_INTEGRITY_SCHEMA,\n    runRef: input.runRef,\n    input: 'sources',\n    tree,\n    issues: [\n      ...treeIssues(tree, {\n        unknownIdentityRows:\n          facts.journalInvalidRows +\n          facts.spawns.filter((spawn) => !spawn.valid && spawn.id.length === 0).length,\n        uncertainIds: new Set(\n          facts.spawns\n            .filter((spawn) => !spawn.valid && spawn.id.length > 0)\n            .map((spawn) => spawn.id),\n        ),\n      }),\n      ...sourceIssues(input, facts, tree),\n    ],\n  }\n}\n"],"mappings":";;;AAIA,SAAgB,SAAS,MAAc,OAAgD;CACrF,OAAO;EAAE;EAAM;CAAM;AACvB;AAEA,SAAgB,MACd,MAG6B;CAC7B,OAAO;EAAE,GAAG;EAAM,UAAU,KAAK,YAAY,CAAC;CAAE;AAClD;;;ACVA,SAAS,aAAa,KAAgC;CACpD,MAAM,WAAW,IACd,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,OAAO,KAAK,UAAU,EAAE,CAAC,CAAC,CAC/B,KAAK,IAAI;CACZ,OAAO,IAAI,UAAA,KACP,WACA,GAAG,SAAS,QAAQ,IAAI,SAAA,GAAsB;AACpD;AAEA,SAAgB,YACd,QACA,eAC+B;CAC/B,MAAM,EAAE,UAAU;CAClB,MAAM,UAAU,MAAM,YAAY,OAAO,MAAM;CAC/C,MAAM,SAAS,WAAW,MAAM;CAChC,MAAM,MAAqC,CAAC;CAC5C,IACE,CAAC,MAAM,iBACP,CAAC,MAAM,kBACP,MAAM,mBAAmB,KACzB,MAAM,oBAAoB,GAC1B;EACA,MAAM,UAAU,CACd,GAAI,MAAM,gBAAgB,CAAC,IAAI,CAAC,OAAO,GACvC,GAAI,MAAM,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAC3C;EACA,MAAM,YAAY,CAChB,GAAI,MAAM,mBAAmB,IAAI,CAAC,SAAS,MAAM,kBAAkB,IAAI,CAAC,GACxE,GAAI,MAAM,oBAAoB,IAAI,CAAC,UAAU,MAAM,mBAAmB,IAAI,CAAC,CAC7E;EACA,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV;GACA,OACE;GACF,QACE,QAAQ,SAAS,IACb,GAAG,KAAK,UAAU,OAAO,EAAE,cAAc,QAAQ,KAAK,OAAO,EAAE,KAC/D,GAAG,KAAK,UAAU,OAAO,EAAE,+BAA+B,UAAU,KAAK,IAAI,EAAE;GACrF,UAAU;IACR,GAAG,QAAQ,KAAK,aAAa,SAAS,GAAG,OAAO,GAAG,YAAY,IAAI,CAAC;IACpE,GAAI,MAAM,mBAAmB,IACzB,CAAC,SAAS,GAAG,OAAO,8BAA8B,MAAM,gBAAgB,CAAC,IACzE,CAAC;IACL,GAAI,MAAM,oBAAoB,IAC1B,CAAC,SAAS,GAAG,OAAO,+BAA+B,MAAM,iBAAiB,CAAC,IAC3E,CAAC;GACP;GACA,mBACE;GACF,UAAU;IACR,YAAY;IACZ,mBAAmB;IACnB,gBAAgB;GAClB;EACF,CAAC,CACH;EACA,OAAO;CACT;CAEA,MAAM,+BAAe,IAAI,IAAwC;CACjE,MAAM,uBAAuB,MAAM,cAAc,QAAQ,YAAY,QAAQ,cAAc,IAAI;CAC/F,KAAK,MAAM,WAAW,MAAM,eAAe;EACzC,IAAI,QAAQ,cAAc,MAAM;EAChC,MAAM,OAAO,aAAa,IAAI,QAAQ,SAAS,KAAK,CAAC;EACrD,KAAK,KAAK,OAAO;EACjB,aAAa,IAAI,QAAQ,WAAW,IAAI;CAC1C;CACA,IAAI,qBAAqB,SAAS,GAChC,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,qBAAqB,OAAO;EACvC,UAAU,qBACP,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,YAAY,SAAS,GAAG,OAAO,SAAS,QAAQ,IAAI,MAAM,IAAI,CAAC;EACvE,mBAAmB;EACnB,UAAU;GAAE,YAAY;GAAe,mBAAmB,qBAAqB;EAAO;CACxF,CAAC,CACH;CAEF,MAAM,sBAAsB,CAAC,GAAG,YAAY,CAAC,CAC1C,QAAQ,GAAG,UAAU,KAAK,SAAS,CAAC,CAAC,CACrC,KAAK,CAAC,QAAQ,EAAE;CACnB,IAAI,oBAAoB,SAAS,GAC/B,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,oBAAoB,OAAO,oBAAoB,aAAa,mBAAmB,EAAE;EAC5F,UAAU,CACR,SACE,GAAG,OAAO,+BACV,oBAAoB,MAAM,GAAA,EAAe,CAC3C,CACF;EACA,mBAAmB;CACrB,CAAC,CACH;CAGF,MAAM,uCAAuB,IAAI,IAAgD;CACjF,MAAM,mBAAmB,MAAM,sBAAsB,QAAQ,QAAQ,IAAI,cAAc,IAAI;CAC3F,KAAK,MAAM,OAAO,MAAM,uBAAuB;EAC7C,IAAI,IAAI,cAAc,MAAM;EAC5B,MAAM,OAAO,qBAAqB,IAAI,IAAI,SAAS,KAAK,CAAC;EACzD,KAAK,KAAK,GAAG;EACb,qBAAqB,IAAI,IAAI,WAAW,IAAI;CAC9C;CACA,IAAI,iBAAiB,SAAS,GAC5B,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,iBAAiB,OAAO;EACnC,UAAU,iBACP,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,QAAQ,SAAS,GAAG,OAAO,UAAU,IAAI,IAAI,aAAa,IAAI,CAAC;EACvE,mBAAmB;EACnB,UAAU;GAAE,YAAY;GAAe,mBAAmB,iBAAiB;EAAO;CACpF,CAAC,CACH;CAGF,MAAM,gBAAgB,CAAC,GAAG,qBAAqB,KAAK,CAAC,CAAC,CAAC,QAAQ,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;CAC3F,IAAI,cAAc,SAAS,GACzB,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,cAAc,OAAO,kBAAkB,aAAa,aAAa,EAAE;EAC9E,UAAU,CACR,SAAS,GAAG,OAAO,8BAA8B,cAAc,MAAM,GAAA,EAAe,CAAC,CACvF;EACA,mBACE;CACJ,CAAC,CACH;CAGF,MAAM,kBAAkB,CAAC,GAAG,oBAAoB,CAAC,CAC9C,QAAQ,GAAG,UAAU,KAAK,SAAS,CAAC,CAAC,CACrC,KAAK,CAAC,QAAQ,EAAE;CACnB,IAAI,gBAAgB,SAAS,GAC3B,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,gBAAgB,OAAO,qBAAqB,aAAa,eAAe,EAAE;EACrF,UAAU,CACR,SACE,GAAG,OAAO,gCACV,gBAAgB,MAAM,GAAA,EAAe,CACvC,CACF;EACA,mBAAmB;CACrB,CAAC,CACH;CAGF,MAAM,gBAAgB,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC,CAAC,QAAQ,OAAO,CAAC,qBAAqB,IAAI,EAAE,CAAC;CAC3F,IAAI,iBAAiB,cAAc,SAAS,GAC1C,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,cAAc,OAAO,GAAG,aAAa,KAAK,qCAAqC,aAAa,aAAa,EAAE;EACtH,UAAU,CACR,SACE,GAAG,OAAO,oCACV,cAAc,MAAM,GAAA,EAAe,CACrC,CACF;EACA,mBACE;CACJ,CAAC,CACH;CAGF,MAAM,uBAAiC,CAAC;CACxC,MAAM,kBAA4B,CAAC;CACnC,KAAK,MAAM,CAAC,IAAI,qBAAqB,sBAAsB;EACzD,IAAI,CAAC,aAAa,IAAI,EAAE,KAAK,iBAAiB,WAAW,GAAG;EAC5D,MAAM,YAAY,iBAAiB,EAAE,EAAE;EACvC,IAAI,cAAc,QAAQ,cAAc,KAAA,GAAW,qBAAqB,KAAK,EAAE;OAC1E,IAAI,CAAC,WAAW,gBAAgB,KAAK,EAAE;CAC9C;CACA,IAAI,qBAAqB,SAAS,GAChC,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,qBAAqB,OAAO,UAAU,aAAa,oBAAoB,EAAE;EACpF,UAAU,CACR,SACE,GAAG,OAAO,yCACV,qBAAqB,MAAM,GAAA,EAAe,CAC5C,CACF;EACA,mBAAmB;EACnB,UAAU;GAAE,YAAY;GAAe,mBAAmB,qBAAqB;EAAO;CACxF,CAAC,CACH;CAEF,IAAI,gBAAgB,SAAS,GAC3B,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV;EACA,OAAO;EACP,QAAQ,GAAG,gBAAgB,OAAO,UAAU,aAAa,eAAe,EAAE;EAC1E,UAAU,CACR,SACE,GAAG,OAAO,oCACV,gBAAgB,MAAM,GAAA,EAAe,CACvC,CACF;EACA,mBACE;CACJ,CAAC,CACH;CAEF,OAAO;AACT;;;AC1PA,SAAS,qBAAqB,OAA2D;CACvF,MAAM,MAAqC,CAAC;CAC5C,MAAM,kBAAkB,MAAM,OAAO,QAAQ,UAAU,CAAC,MAAM,KAAK;CACnE,IAAI,MAAM,qBAAqB,KAAK,gBAAgB,SAAS,GAC3D,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO;EACP,QAAQ,GAAG,MAAM,mBAAmB,MAAM,MAAM,YAAY,oCAAoC,MAAM,yBAAyB,8BAA8B,gBAAgB,OAAO;EACpL,UAAU;GACR,SAAS,sCAAsC,MAAM,kBAAkB;GACvE,SAAS,qCAAqC,MAAM,wBAAwB;GAC5E,SAAS,sBAAsB,MAAM,WAAW;GAChD,SAAS,mBAAmB,MAAM,cAAc;GAChD,GAAG,gBACA,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,UACJ,SAAS,kBAAkB,MAAM,UAAU,kBAAkB,MAAM,aAAa,CAClF;EACJ;EACA,mBACE;EACF,UAAU;GACR,YAAY;GACZ,cAAc,MAAM;GACpB,sBAAsB,MAAM;GAC5B,qBAAqB,MAAM;GAC3B,sBAAsB,gBAAgB;GACtC,iBAAiB,MAAM;EACzB;CACF,CAAC,CACH;CAEF,MAAM,qBAAqB,gBAAgB,QAAQ,UAAU,MAAM,GAAG,WAAW,CAAC;CAClF,MAAM,qBAAqB,MAAM,OAAO,QAAQ,UAAU,MAAM,GAAG,WAAW,CAAC;CAC/E,IAAI,mBAAmB,SAAS,mBAAmB,SAAS,GAC1D,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO;EACP,QAAQ,GAAG,mBAAmB,OAAO,aAAa,mBAAmB,OAAO;EAC5E,UAAU,CACR,SAAS,qCAAqC,mBAAmB,MAAM,GACvE,SAAS,wCAAwC,mBAAmB,MAAM,CAC5E;EACA,mBAAmB;EACnB,UAAU;GAAE,YAAY;GAAe,QAAQ,CAAC,uBAAuB;EAAE;CAC3E,CAAC,CACH;CAGF,MAAM,8BAAc,IAAI,IAAoB;CAC5C,KAAK,MAAM,SAAS,MAAM,QAAQ;EAChC,IAAI,CAAC,MAAM,SAAS,MAAM,GAAG,WAAW,GAAG;EAC3C,YAAY,IAAI,MAAM,KAAK,YAAY,IAAI,MAAM,EAAE,KAAK,KAAK,CAAC;CAChE;CACA,KAAK,MAAM,CAAC,IAAI,UAAU,aAAa;EACrC,IAAI,QAAQ,GAAG;EACf,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO;GACP,QAAQ,GAAG,MAAM,kCAAkC,KAAK,UAAU,EAAE,EAAE;GACtE,UAAU,CAAC,SAAS,uBAAuB,mBAAmB,EAAE,KAAK,KAAK,CAAC;GAC3E,mBAAmB;EACrB,CAAC,CACH;CACF;CAEA,MAAM,8BAAc,IAAI,IAAoB;CAC5C,KAAK,MAAM,SAAS,MAAM,QAAQ;EAChC,IAAI,MAAM,GAAG,WAAW,GAAG;EAC3B,YAAY,IAAI,MAAM,KAAK,YAAY,IAAI,MAAM,EAAE,KAAK,KAAK,CAAC;CAChE;CACA,MAAM,oBAAoB,IAAI,IAC5B,gBAAgB,QAAQ,UAAU,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,UAAU,MAAM,EAAE,CAChF;CACA,IAAI,mBAAmB,WAAW,KAAK,MAAM,uBAAuB,GAAG;EACrE,MAAM,+BAAe,IAAI,IAAkD;EAC3E,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,IAAI,MAAM,GAAG,WAAW,KAAK,YAAY,IAAI,MAAM,EAAE,KAAK,kBAAkB,IAAI,MAAM,EAAE,GACtF;GAEF,MAAM,OAAO,aAAa,IAAI,MAAM,EAAE,KAAK,CAAC;GAC5C,KAAK,KAAK,KAAK;GACf,aAAa,IAAI,MAAM,IAAI,IAAI;EACjC;EACA,KAAK,MAAM,CAAC,IAAI,WAAW,cACzB,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO;GACP,QAAQ,GAAG,OAAO,OAAO,yBAAyB,KAAK,UAAU,EAAE,EAAE;GACrE,UAAU,CACR,SAAS,kBAAkB,mBAAmB,EAAE,EAAE,SAAS,OAAO,MAAM,GACxE,GAAG,OACA,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,OAAO,UACX,SAAS,kBAAkB,mBAAmB,EAAE,EAAE,GAAG,SAAS,KAAK,CACrE,CACJ;GACA,mBAAmB;EACrB,CAAC,CACH;CAEJ;CACA,KAAK,MAAM,CAAC,IAAI,UAAU,aAAa;EACrC,IAAI,QAAQ,GAAG;EACf,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO;GACP,QAAQ,GAAG,MAAM,4CAA4C,KAAK,UAAU,EAAE,EAAE;GAChF,UAAU,CAAC,SAAS,0BAA0B,mBAAmB,EAAE,KAAK,KAAK,CAAC;GAC9E,mBAAmB;EACrB,CAAC,CACH;CACF;CACA,OAAO;AACT;AAOA,SAAS,mBAAmB,OAG1B;CACA,MAAM,6BAAa,IAAI,IAAwB;CAC/C,MAAM,gCAAgB,IAAI,IAAwB;CAClD,KAAK,MAAM,SAAS,MAAM,cAAc;EACtC,MAAM,MAAM,WAAW,IAAI,MAAM,EAAE,KAAK,CAAC;EACzC,IAAI,KAAK,KAAK;EACd,WAAW,IAAI,MAAM,IAAI,GAAG;EAC5B,MAAM,SAAS,cAAc,IAAI,MAAM,KAAK,KAAK,CAAC;EAClD,OAAO,KAAK,KAAK;EACjB,cAAc,IAAI,MAAM,OAAO,MAAM;CACvC;CACA,MAAM,uCAAuB,IAAI,IAA8B;CAC/D,KAAK,MAAM,OAAO,MAAM,eAAe;EACrC,IAAI,IAAI,aAAa,QAAQ,IAAI,SAAS,SAAS,GAAG;EACtD,MAAM,UAAU,qBAAqB,IAAI,IAAI,KAAK,KAAK,CAAC;EACxD,QAAQ,KAAK,GAAG;EAChB,qBAAqB,IAAI,IAAI,OAAO,OAAO;CAC7C;CAEA,MAAM,8BAAc,IAAI,IAA8B;CACtD,MAAM,gBAA0B,CAAC;CACjC,MAAM,gBAA0B,CAAC;CACjC,KAAK,MAAM,OAAO,MAAM,eAAe;EACrC,MAAM,UACJ,IAAI,aAAa,QAAQ,IAAI,SAAS,SAAS,IAC1C,WAAW,IAAI,IAAI,QAAQ,KAAK,CAAC,KACjC,qBAAqB,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,OAAO,IACpD,cAAc,IAAI,IAAI,KAAK,KAAK,CAAC,IAClC,CAAC;EACT,IAAI,QAAQ,WAAW,GAAG;GACxB,cAAc,KAAK,IAAI,WAAW;GAClC;EACF;EACA,IAAI,QAAQ,WAAW,GAAG;GACxB,cAAc,KAAK,IAAI,WAAW;GAClC;EACF;EACA,MAAM,QAAQ,QAAQ;EACtB,MAAM,SAAS,YAAY,IAAI,MAAM,EAAE,KAAK,CAAC;EAC7C,OAAO,KAAK,GAAG;EACf,YAAY,IAAI,MAAM,IAAI,MAAM;CAClC;CAEA,MAAM,SAAyB,CAAC;CAChC,MAAM,kBAA4B,CAAC;CACnC,MAAM,oBAA8B,CAAC;CACrC,KAAK,MAAM,SAAS,MAAM,cAAc;EACtC,KAAK,WAAW,IAAI,MAAM,EAAE,CAAC,EAAE,UAAU,OAAO,GAAG;EACnD,MAAM,OAAO,YAAY,IAAI,MAAM,EAAE,KAAK,CAAC;EAC3C,IAAI,KAAK,WAAW,GAAG,gBAAgB,KAAK,MAAM,EAAE;OAC/C,IAAI,KAAK,SAAS,GAAG,kBAAkB,KAAK,MAAM,EAAE;OACpD,OAAO,KAAK;GAAE;GAAO,OAAO,KAAK;EAAqB,CAAC;CAC9D;CAEA,IACE,gBAAgB,WAAW,KAC3B,kBAAkB,WAAW,KAC7B,cAAc,WAAW,KACzB,cAAc,WAAW,GAEzB,OAAO;EAAE;EAAQ,OAAO;CAAK;CAE/B,OAAO;EACL;EACA,OAAO,MAAM;GACX,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO;GACP,QAAQ,GAAG,gBAAgB,OAAO,yBAAyB,kBAAkB,OAAO,wBAAwB,cAAc,OAAO,kCAAkC,cAAc,OAAO;GACxL,UAAU;IACR,SAAS,kCAAkC,gBAAgB,MAAM,GAAA,EAAe,CAAC;IACjF,SAAS,oCAAoC,kBAAkB,MAAM,GAAA,EAAe,CAAC;IACrF,SAAS,sCAAsC,cAAc,MAAM,GAAA,EAAe,CAAC;IACnF,SAAS,sCAAsC,cAAc,MAAM,GAAA,EAAe,CAAC;GACrF;GACA,mBACE;GACF,UAAU;IACR,YAAY;IACZ,eAAe,gBAAgB;IAC/B,iBAAiB,kBAAkB;IACnC,iBAAiB,cAAc;IAC/B,iBAAiB,cAAc;GACjC;EACF,CAAC;CACH;AACF;AAEA,SAAgB,aACd,QACA,OACA,MAC+B;CAC/B,MAAM,MAAM,qBAAqB,KAAK;CACtC,IAAI,OAAO,YAAY,MAAM;EAC3B,MAAM,SAAS,OAAO,wBAAwB;EAC9C,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OACE;GACF,QAAQ;GACR,UAAU,CAAC,SAAS,mBAAmB,IAAI,CAAC;GAC5C,mBAAmB;GACnB,UAAU;IAAE,YAAY;IAAe;GAAO;EAChD,CAAC,CACH;EACA,OAAO;CACT;CAEA,MAAM,SAAS,mBAAmB,KAAK;CACvC,IAAI,OAAO,UAAU,MAAM,IAAI,KAAK,OAAO,KAAK;CAChD,MAAM,gBACJ,KAAK,WAAW,QAChB,KAAK,MAAM,QAAQ,SAAS,KAAK,eAAe,KAAK,MAAM,CAAC,CAAC,WAAW,KACxE,KAAK,MAAM,MAAM,SAAS,KAAK,eAAe,KAAK,MAAM,CAAC,EAAE,QAAQ,iBAAiB;CACvF,KAAK,MAAM,OAAO,OAAO,QAAQ,IAAI,KAAK,GAAG,YAAY,KAAK,aAAa,CAAC;CAC5E,OAAO;AACT;;;AC9PA,SAAS,SAAS,OAAkD;CAClE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAEA,SAAS,eAAe,OAA+B;CACrD,OAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ;AACjE;AAEA,SAAS,YAAY,KAAyD;CAC5E,IAAI,IAAI,sBAAsB,MAAM,OAAO;CAC3C,OAAO,eAAe,IAAI,iBAAiB,KAAK,KAAA;AAClD;AAEA,SAAS,cAAc,SAAyD;CAC9E,IAAI,YAAY,MAAM,OAAO;CAC7B,IAAI,OAAO,QAAQ,iBAAiB,aAAa,OAAO,QAAQ,iBAAiB,WAC/E,OAAO;CAET,IAAI,QAAQ,UAAU,QAAQ,OAAO,QAAQ,UAAU,UAAU,OAAO;CACxE,OAAO,QAAQ,gBAAgB,QAAQ,gBAAgB,QAAQ,UAAU;AAC3E;AAEA,SAAS,WAAW,OAAgB,OAA2B;CAC7D,MAAM,MAAM,SAAS,KAAK,IAAI,QAAQ,CAAC;CACvC,MAAM,SAAS,SAAS,IAAI,MAAM,IAAI,IAAI,SAAS;CACnD,MAAM,UAAU,SAAS,IAAI,OAAO,IAAI,IAAI,UAAU;CACtD,OAAO;EACL;EACA;EACA,QAAQ,oBAAoB,KAAK;EACjC,IAAI,eAAe,IAAI,UAAU;EACjC,QAAQ,YAAY,GAAG;EACvB,OAAO,eAAe,IAAI,MAAM;EAChC,MAAM,eAAe,IAAI,IAAI;EAC7B,UAAU,MAAM,QAAQ,IAAI,QAAQ,IAAI,IAAI,WAAW;EACvD,WAAW,WAAW,OAAO,OAAO,eAAe,OAAO,qBAAqB;EAC/E,WACE,YAAY,QAAQ,OAAO,QAAQ,iBAAiB,YAAY,QAAQ,eAAe;EACzF,UAAU,cAAc,OAAO;CACjC;AACF;AAEA,SAAS,OACP,QACA,MACuC;CACvC,MAAM,UAAU,SAAS,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,UAAU;CACpE,MAAM,UAAU,YAAY,QAAQ,SAAS,QAAQ,OAAO,IAAI,QAAQ,UAAU;CAClF,IAAI,YAAY,MAAM,OAAO;CAC7B,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,GAAG,OAAO;GAAE;GAAK;EAAM;CAC/E;CACA,OAAO;AACT;AAEA,SAAS,aACP,QACA,MACA,OACgC;CAChC,MAAM,MAAM,OAAO,MAAM,SAAS,OAAO;CACzC,OAAO,SAAS,SAAS,mBAAmB,GAAG,EAAE,GAAG,QAAQ,KAAK;AACnE;AAEA,SAAS,sBAAsB,QAA8B;CAC3D,MAAM,SAAmB,CAAC;CAC1B,IAAI,OAAO,OAAO,MAAM,OAAO,KAAK,YAAY,mBAAmB,eAAe,OAAO;CACzF,IAAI,OAAO,WAAW,KAAA,GAAW,OAAO,KAAK,eAAe,OAAO;CACnE,IAAI,OAAO,UAAU,MAAM,OAAO,KAAK,kBAAkB;CACzD,IAAI,OAAO,SAAS,MAAM,OAAO,KAAK,WAAW;CACjD,IAAI,CAAC,SAAS,OAAO,IAAI,OAAO,GAAG,OAAO,KAAK,UAAU,gBAAgB;CACzE,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AAC5B;AAOA,SAAgB,WACd,MACA,cAAoC,CAAC,GACN;CAC/B,MAAM,MAAqC,CAAC;CAC5C,MAAM,UAAW,KAAK,MAA6B,IAAI,UAAU;CACjE,MAAM,sBAAsB,KAAK,KAC9B,QAAQ,QAAQ,IAAI,SAAS,sBAAsB,CAAC,CACpD,QAAQ,OAAO,QAAQ,SAAS,IAAI,SAAS,IAAI,CAAC;CAErD,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,OAAO,OAAO,WAAW,GAAG;EAChC,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,OAAO,MAAM,QAAQ,OAAO;GACrC,OAAO;GACP,QAAQ,OAAO,OAAO,KAAK,IAAI;GAC/B,UAAU,CAAC,SAAS,SAAS,OAAO,MAAM,cAAc,OAAO,MAAM,CAAC;GACtE,mBACE;GACF,UAAU,EAAE,mBAAmB,OAAO,OAAO;EAC/C,CAAC,CACH;EACA,MAAM,oBAAoB,sBAAsB,MAAM;EACtD,IAAI,kBAAkB,WAAW,GAAG;EACpC,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,OAAO,MAAM,QAAQ,OAAO;GACrC,OAAO;GACP,QAAQ,uBAAuB,kBAAkB,KAAK,IAAI,EAAE;GAC5D,UAAU,CAAC,SAAS,SAAS,OAAO,MAAM,sBAAsB,iBAAiB,CAAC;GAClF,mBACE;GACF,UAAU;IAAE,YAAY;IAAe,QAAQ;GAAkB;EACnE,CAAC,CACH;CACF;CAEA,MAAM,uBAAO,IAAI,IAA0B;CAC3C,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,OAAO,OAAO,MAAM;EACxB,MAAM,UAAU,KAAK,IAAI,OAAO,EAAE,KAAK,CAAC;EACxC,QAAQ,KAAK,MAAM;EACnB,KAAK,IAAI,OAAO,IAAI,OAAO;CAC7B;CAEA,KAAK,MAAM,CAAC,WAAW,YAAY,MAAM;EACvC,IAAI,QAAQ,SAAS,GAAG;EACxB,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO;GACP,QAAQ,GAAG,QAAQ,OAAO,0BAA0B,KAAK,UAAU,SAAS,EAAE;GAC9E,UAAU,CACR,SAAS,cAAc,mBAAmB,SAAS,EAAE,SAAS,QAAQ,MAAM,GAC5E,GAAG,QAAQ,MAAM,GAAA,EAAe,CAAC,CAAC,KAAK,WACrC,SAAS,SAAS,OAAO,MAAM,YAAY;IACzC,YAAY,OAAO;IACnB,mBAAmB,OAAO;IAC1B,MAAM,OAAO;GACf,CAAC,CACH,CACF;GACA,mBAAmB;EACrB,CAAC,CACH;CACF;CAEA,MAAM,sBACJ,QAAQ,QAAQ,WAAW,OAAO,OAAO,IAAI,CAAC,CAAC,SAC/C,KAAK,IAAI,qBAAqB,YAAY,uBAAuB,CAAC;CACpE,MAAM,SAAS,QAAQ,QACpB,WACC,OAAO,OAAO,QAAQ,KAAK,IAAI,OAAO,EAAE,CAAC,EAAE,WAAW,CAC1D;CAEA,IAAI;CACJ,IAAI,KAAK,WAAW,MAClB,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO;EACP,QAAQ,wBAAwB,QAAQ,OAAO;EAC/C,UAAU,CAAC,SAAS,UAAU,IAAI,CAAC;EACnC,mBAAmB;EACnB,UAAU;GAAE,YAAY;GAAe,WAAW,QAAQ;EAAO;CACnE,CAAC,CACH;MACK;EACL,MAAM,WAAW,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC;EAC3C,IAAI,SAAS,WAAW,GACtB,OAAO,SAAS;OACX,IAAI,SAAS,WAAW,KAAK,sBAAsB,GACxD,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,KAAK;GACd,OAAO;GACP,QAAQ,GAAG,oBAAoB,uEAAuE,KAAK,UAAU,KAAK,MAAM,EAAE;GAClI,UAAU,CAAC,SAAS,UAAU,KAAK,MAAM,CAAC;GAC1C,mBAAmB;GACnB,UAAU;IAAE,YAAY;IAAe,QAAQ,CAAC,iBAAiB;GAAE;EACrE,CAAC,CACH;OACK,IAAI,SAAS,WAAW,GAC7B,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,KAAK;GACd,OAAO;GACP,QAAQ,UAAU,KAAK,UAAU,KAAK,MAAM,EAAE,kBAAkB,QAAQ,OAAO;GAC/E,UAAU,CAAC,SAAS,UAAU,KAAK,MAAM,CAAC;GAC1C,mBAAmB;EACrB,CAAC,CACH;CAEJ;CAEA,IAAI,SAAS,KAAA,GAAW;EACtB,IAAI,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,MAC/C,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,KAAK,MAAM,KAAK,UAAU;GACnC,OAAO;GACP,QAAQ,yBAAyB,KAAK,UAAU,KAAK,MAAM,EAAE;GAC7D,UAAU,CAAC,aAAa,MAAM,qBAAqB,KAAK,MAAM,CAAC;GAC/D,mBAAmB;EACrB,CAAC,CACH;EAEF,IAAI,KAAK,SAAS,QAAQ,KAAK,SAAS,cACtC,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,KAAK,MAAM,KAAK,UAAU;GACnC,OAAO;GACP,QAAQ,iBAAiB,KAAK,UAAU,KAAK,IAAI,EAAE;GACnD,UAAU,CAAC,aAAa,MAAM,QAAQ,KAAK,IAAI,CAAC;GAChD,mBACE;EACJ,CAAC,CACH;CAEJ;CAEA,KAAK,MAAM,UAAU,QAAQ;EAC3B,IAAI,OAAO,WAAW,KAAA,GAAW;EACjC,IAAI,OAAO,WAAW,MAAM;GAC1B,IAAI,OAAO,OAAO,KAAK,QACrB,IAAI,KACF,MAAM;IACJ,MAAM;IACN,MAAM;IACN,UAAU;IACV,SAAS,OAAO;IAChB,OAAO;IACP,QAAQ,QAAQ,KAAK,UAAU,OAAO,EAAE,EAAE,iCAAiC,KAAK,UAAU,KAAK,MAAM,EAAE;IACvG,UAAU,CACR,aAAa,QAAQ,qBAAqB,IAAI,GAC9C,SAAS,UAAU,KAAK,MAAM,CAChC;IACA,mBACE;GACJ,CAAC,CACH;GAEF;EACF;EAEA,MAAM,aAAa,KAAK,IAAI,OAAO,MAAM,KAAK,CAAC;EAC/C,IAAI,WAAW,WAAW,GAAG;GAC3B,IAAI,sBAAsB,KAAK,YAAY,cAAc,IAAI,OAAO,MAAM,MAAM,MAC9E,IAAI,KACF,MAAM;IACJ,MAAM;IACN,MAAM;IACN,UAAU;IACV,SAAS,OAAO;IAChB,OAAO;IACP,QACE,YAAY,cAAc,IAAI,OAAO,MAAM,MAAM,OAC7C,UAAU,KAAK,UAAU,OAAO,MAAM,EAAE,kFACxC,UAAU,KAAK,UAAU,OAAO,MAAM,EAAE,2BAA2B,oBAAoB;IAC7F,UAAU,CAAC,aAAa,QAAQ,qBAAqB,OAAO,MAAM,CAAC;IACnE,mBAAmB;IACnB,UAAU;KAAE,YAAY;KAAe,QAAQ,CAAC,mBAAmB;IAAE;GACvE,CAAC,CACH;QAEA,IAAI,KACF,MAAM;IACJ,MAAM;IACN,MAAM;IACN,UAAU;IACV,SAAS,OAAO;IAChB,OAAO;IACP,QAAQ,QAAQ,KAAK,UAAU,OAAO,EAAE,EAAE,wBAAwB,KAAK,UAAU,OAAO,MAAM,EAAE;IAChG,UAAU,CAAC,aAAa,QAAQ,qBAAqB,OAAO,MAAM,CAAC;IACnE,mBAAmB;GACrB,CAAC,CACH;GAEF;EACF;EACA,IAAI,WAAW,WAAW,GAAG;EAC7B,MAAM,SAAS,WAAW;EAE1B,IAAI,OAAO,UAAU,QAAQ,OAAO,UAAU,QAAQ,OAAO,UAAU,OAAO,OAC5E,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,OAAO;GAChB,OAAO;GACP,QAAQ,gBAAgB,KAAK,UAAU,OAAO,KAAK,EAAE,8BAA8B,KAAK,UAAU,OAAO,KAAK,EAAE;GAChH,UAAU,CACR,aAAa,QAAQ,UAAU,OAAO,KAAK,GAC3C,aAAa,QAAQ,UAAU,OAAO,KAAK,CAC7C;GACA,mBACE;EACJ,CAAC,CACH;EAGF,MAAM,aAAa,OAAO,QAAQ,CAAC,cAAc,YAAY,CAAC;EAC9D,MAAM,cAAc,OAAO,QAAQ,CAAC,cAAc,YAAY,CAAC;EAC/D,IAAI,eAAe,QAAQ,gBAAgB,QAAQ,WAAW,QAAQ,YAAY,OAChF,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,OAAO;GAChB,OAAO;GACP,QAAQ,SAAS,WAAW,IAAI,GAAG,WAAW,MAAM,mBAAmB,YAAY,IAAI,GAAG,YAAY,MAAM;GAC5G,UAAU,CACR,aAAa,QAAQ,mBAAmB,WAAW,OAAO,WAAW,KAAK,GAC1E,aAAa,QAAQ,mBAAmB,YAAY,OAAO,YAAY,KAAK,CAC9E;GACA,mBAAmB;EACrB,CAAC,CACH;EAGF,MAAM,cAAc,OAAO,QAAQ;GAAC;GAAc;GAAgB;EAAa,CAAC;EAChF,IAAI,eAAe,QAAQ,gBAAgB,QAAQ,WAAW,QAAQ,YAAY,OAChF,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,OAAO;GAChB,OAAO;GACP,QAAQ,SAAS,WAAW,IAAI,GAAG,WAAW,MAAM,kBAAkB,YAAY,IAAI,GAAG,YAAY,MAAM;GAC3G,UAAU,CACR,aAAa,QAAQ,mBAAmB,WAAW,OAAO,WAAW,KAAK,GAC1E,aAAa,QAAQ,mBAAmB,YAAY,OAAO,YAAY,KAAK,CAC9E;GACA,mBACE;EACJ,CAAC,CACH;CAEJ;CAEA,KAAK,MAAM,UAAU,QAAQ;EAC3B,MAAM,QAAQ,OAAO,QAAQ,CAAC,cAAc,YAAY,CAAC;EACzD,MAAM,QAAQ,OAAO,QAAQ;GAAC;GAAc;GAAgB;EAAa,CAAC;EAC1E,IAAI,UAAU,QAAQ,UAAU,QAAQ,MAAM,SAAS,MAAM,OAAO;EACpE,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS,OAAO;GAChB,OAAO;GACP,QAAQ,GAAG,MAAM,IAAI,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI,MAAM,MAAM,MAAM;GAC1E,UAAU,CACR,aAAa,QAAQ,mBAAmB,MAAM,OAAO,MAAM,KAAK,GAChE,aAAa,QAAQ,mBAAmB,MAAM,OAAO,MAAM,KAAK,CAClE;GACA,mBAAmB;EACrB,CAAC,CACH;CACF;CAEA,MAAM,gCAAgB,IAAI,IAAY;CACtC,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,SAAS,IAAI,MAAM,EAAE,GAAG;EAC5B,MAAM,OAAiB,CAAC;EACxB,MAAM,4BAAY,IAAI,IAAoB;EAC1C,IAAI,UAAyB,MAAM;EACnC,OAAO,YAAY,MAAM;GACvB,IAAI,SAAS,IAAI,OAAO,GAAG;GAC3B,MAAM,WAAW,UAAU,IAAI,OAAO;GACtC,IAAI,aAAa,KAAA,GAAW;IAC1B,MAAM,QAAQ,KAAK,MAAM,QAAQ;IACjC,MAAM,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAQ;IAC3C,IAAI,CAAC,cAAc,IAAI,GAAG,GAAG;KAC3B,cAAc,IAAI,GAAG;KACrB,IAAI,KACF,MAAM;MACJ,MAAM;MACN,MAAM;MACN,UAAU;MACV,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM;MACjC,OAAO;MACP,QAAQ,GAAG,MAAM,KAAK,MAAM,EAAE,MAAM,MAAM;MAC1C,UAAU,MAAM,MAAM,GAAA,EAAe,CAAC,CAAC,SAAS,OAAO;OACrD,MAAM,OAAO,KAAK,IAAI,EAAE;OACxB,MAAM,SAAS,MAAM,WAAW,IAAI,KAAK,KAAK,KAAA;OAC9C,OAAO,WAAW,KAAA,IACd,CAAC,IACD,CAAC,aAAa,QAAQ,qBAAqB,OAAO,MAAM,CAAC;MAC/D,CAAC;MACD,mBACE;KACJ,CAAC,CACH;IACF;IACA;GACF;GACA,UAAU,IAAI,SAAS,KAAK,MAAM;GAClC,KAAK,KAAK,OAAO;GACjB,MAAM,OAAO,KAAK,IAAI,OAAO;GAC7B,IAAI,MAAM,WAAW,GAAG;GACxB,MAAM,SAAS,KAAK,EAAE,EAAE;GACxB,IAAI,WAAW,KAAA,GAAW;GAC1B,UAAU;EACZ;EACA,KAAK,MAAM,MAAM,MAAM,SAAS,IAAI,EAAE;CACxC;CAEA,IAAI,MAAM,cAAc,MAAM;EAC5B,MAAM,kBAAkB,OAAO,QAC5B,WAAW,OAAO,OAAO,MAAM,MAAM,OAAO,aAAa,KAC5D;EACA,IAAI,gBAAgB,SAAS,GAC3B,IAAI,KACF,MAAM;GACJ,MAAM;GACN,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO;GACP,QAAQ,GAAG,gBAAgB,OAAO,GAAG,KAAK,IAAI,GAAG,OAAO,SAAS,CAAC,EAAE;GACpE,UAAU,CACR,SAAS,mCAAmC,gBAAgB,MAAM,GAClE,GAAG,gBACA,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,WAAW,aAAa,QAAQ,WAAW,OAAO,IAAI,OAAO,CAAC,CACxE;GACA,mBAAmB;GACnB,UAAU;IAAE,YAAY;IAAe,mBAAmB,gBAAgB;GAAO;EACnF,CAAC,CACH;CAEJ;CAEA,MAAM,qBAAqB,QAAQ,QAAQ,WAAW,OAAO,UAAU,WAAW,CAAC;CACnF,IAAI,mBAAmB,SAAS,GAC9B,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO;EACP,QAAQ,GAAG,mBAAmB,OAAO,GAAG,QAAQ,OAAO;EACvD,UAAU,CACR,SAAS,qCAAqC,mBAAmB,MAAM,GACvE,GAAG,mBACA,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,WAAW,aAAa,QAAQ,YAAY,CAAC,CAAC,CAAC,CACzD;EACA,mBAAmB;EACnB,UAAU;GAAE,YAAY;GAAe,mBAAmB,mBAAmB;EAAO;CACtF,CAAC,CACH;CAGF,MAAM,kBAAkB,QAAQ,QAAQ,WAAW,OAAO,cAAc,IAAI;CAC5E,IAAI,gBAAgB,SAAS,GAC3B,IAAI,KACF,MAAM;EACJ,MAAM;EACN,MAAM;EACN,UAAU;EACV,SAAS;EACT,OACE;EACF,QAAQ,GAAG,gBAAgB,OAAO,GAAG,QAAQ,OAAO;EACpD,UAAU,CACR,SAAS,+CAA+C,gBAAgB,MAAM,GAC9E,GAAG,gBACA,MAAM,GAAA,EAAe,CAAC,CACtB,KAAK,WAAW,aAAa,QAAQ,gCAAgC,IAAI,CAAC,CAC/E;EACA,mBACE;EACF,UAAU;GAAE,YAAY;GAAe,mBAAmB,gBAAgB;EAAO;CACnF,CAAC,CACH;CAGF,OAAO;AACT;;;AC/gBA,MAAa,kCAAkC;;;ACoC/C,SAAgB,SAAS,GAAqC;CAC5D,OAAO,OAAO,MAAM,YAAY,MAAM,OAAQ,IAAgC,CAAC;AACjF;AAEA,SAAS,IAAI,GAAoB;CAC/B,OAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAC3D;AAEA,SAAS,UAAU,GAAuB;CACxC,MAAM,MAAM,SAAS,CAAC;CACtB,MAAM,MAAM,SAAS,IAAI,MAAM;CAC/B,MAAM,YAAY,IAAI,aAAa,IAAI;CACvC,MAAM,aAAa,IAAI,cAAc,IAAI;CACzC,OAAO;EACL,QAAQ;GACN,OAAO,IAAI,IAAI,KAAK;GACpB,QAAQ,IAAI,IAAI,MAAM;GACtB,WAAW,IAAI,SAAS;GACxB,YAAY,IAAI,UAAU;GAC1B,UAAU,cAAc,KAAA,KAAa,eAAe,KAAA;EACtD;EACA,KAAK,IAAI,IAAI,GAAG;CAClB;AACF;AAEA,SAAgB,WAAW,MAAgD;CACzE,OAAO,0BAA0B,IAAI,CAAC,CAAC;AACzC;AAOA,SAAS,0BAA0B,MAAkC;CACnE,IAAI,SAAS,MAAM,OAAO;EAAE,MAAM,CAAC;EAAG,aAAa;CAAE;CACrD,MAAM,MAAiC,CAAC;CACxC,IAAI,cAAc;CAClB,KAAK,MAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;EACnC,MAAM,UAAU,KAAK,KAAK;EAC1B,IAAI,CAAC,SAAS;EACd,IAAI;GACF,MAAM,SAAkB,KAAK,MAAM,OAAO;GAC1C,IAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,MAAM,GACxE,IAAI,KAAK,MAAiC;QAE1C,eAAe;EAEnB,QAAQ;GACN,eAAe;EACjB;CACF;CACA,OAAO;EAAE,MAAM;EAAK;CAAY;AAClC;AAEA,SAAgB,UAAU,MAAqD;CAC7E,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI;EACF,MAAM,SAAkB,KAAK,MAAM,IAAI;EACvC,OAAO,OAAO,WAAW,YAAY,WAAW,OAC3C,SACD;CACN,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,GAAG,IAA4B;CACtC,IAAI,OAAO,OAAO,UAAU,OAAO;CACnC,MAAM,IAAI,KAAK,MAAM,EAAE;CACvB,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAmKA,SAAS,YAAY,GAA0B;CAC7C,IAAI,OAAO,MAAM,UAAU,OAAO;EAAE,OAAO;EAAG,OAAO;EAAM,OAAO;EAAM,KAAK;CAAE;CAC/E,IAAI,OAAO,MAAM,YAAY,MAAM,MACjC,OAAO;EAAE,OAAO;EAAM,OAAO;EAAM,OAAO;EAAM,KAAK;CAAK;CAE5D,MAAM,MAAM;CACZ,MAAM,QAAQ,OAAO,IAAI,UAAU,YAAY,IAAI,QAAQ;CAC3D,OAAO;EACL,OAAO,UAAU,OAAO,OAAO,QAAQ,UAAU;EACjD;EACA,OAAO,OAAO,IAAI,UAAU,YAAY,OAAO,SAAS,IAAI,KAAK,IAAI,IAAI,QAAQ;EACjF,KAAK;CACP;AACF;AAEA,SAAgB,gBACd,QACQ;CACR,OAAO,OAAO,YAAY,OAAO;AACnC;;AA2BA,MAAM,mBAAmB;CAAC;CAAW;CAAW;CAAa;AAAS;;;;;;AAQtE,MAAM,yBAA4C,CAAC,WAAW,OAAO;AAErE,SAAS,cAAc,OAAsC;CAC3D,OAAQ,iBAAwC,SAAS,KAAK,IAAK,QAA0B;AAC/F;;;;;;AAiBA,SAAS,eAAe,KAAiD;CACvE,MAAM,OAAO,IAAI;CACjB,IAAI,OAAO,SAAS,UAAU,OAAO,EAAE,SAAS,aAAa;CAG7D,IAAI,SAAS,WAAW,OAAO,IAAI,SAAS,UAC1C,OAAO;EAAE,SAAS;EAAW,SAAS;EAAoB,MAAM;CAAQ;CAE1E,IAAI,SAAS,SAAS;EACpB,MAAM,QAAQ,IAAI;EAClB,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,OAAO,EAAE,SAAS,aAAa;EAEjC,MAAM,YAAa,MAAkC;EACrD,IAAI,OAAO,cAAc,UAAU,OAAO,EAAE,SAAS,aAAa;EAClE,MAAM,OAAO,cAAc,SAAS;EACpC,IAAI,SAAS,MACX,OAAO;GACL,SAAS;GACT,SAAS;GACT,MAAM;GACN,OAAO;EACT;EAIF,OAAO;GAAE,SAAS;GAAW,SAAS;GAAoB,MAAM;EAAU;CAC5E;CAEA,MAAM,OAAO,cAAc,IAAI;CAC/B,IAAI,SAAS,MACX,OAAO;EAAE,SAAS;EAAS,SAAS;EAAQ,MAAM;EAAM,OAAO;CAAoB;CAErF,IAAI,uBAAuB,SAAS,IAAI,GACtC,OAAO;EAAE,SAAS;EAAW,SAAS;EAAQ;CAAK;CAIrD,OAAO,EAAE,SAAS,aAAa;AACjC;AAEA,SAAS,iBAAiB,MAAgE;CACxF,IAAI,KAAK,SAAS,GAAG,OAAO;CAC5B,IAAI,KAAK,OAAO,GAAG,OAAO;CAC1B,OAAO,KAAK,IAAI,kBAAkB,IAAI,qBAAqB;AAC7D;AAEA,SAAgB,oBAAoB,KAAgD;CAClF,MAAM,gBAAgB,0BAA0B,IAAI,OAAO;CAC3D,MAAM,SAAS,cAAc;CAC7B,MAAM,QAAQ,UAAU,IAAI,KAAK;CAEjC,MAAM,SAAqB,CAAC;CAC5B,MAAM,SAAqB,CAAC;CAC5B,IAAI,UAAU;CACd,IAAI,WAAW;CACf,IAAI,iBAAiB;CACrB,IAAI,kBAAkB;CACtB,IAAI,gBAAgB;CACpB,IAAI,WAAW;CACf,IAAI,eAAe;CACnB,IAAI,SAAwB;CAC5B,IAAI,iBAAiB;CACrB,MAAM,gCAAgB,IAAI,IAAoB;CAC9C,MAAM,+BAAe,IAAI,IAAuB;CAChD,MAAM,cAA0E,CAAC;CACjF,KAAK,MAAM,CAAC,WAAW,QAAQ,OAAO,QAAQ,GAAG;EAC/C,MAAM,UAAU,eAAe,GAAG;EAClC,IAAI,QAAQ,YAAY,cAAc;GACpC,kBAAkB;GAClB;EACF;EACA,aAAa,IAAI,QAAQ,OAAO;EAChC,IAAI,QAAQ,YAAY,WAAW;GACjC,cAAc,IAAI,QAAQ,OAAO,cAAc,IAAI,QAAQ,IAAI,KAAK,KAAK,CAAC;GAC1E;EACF;EACA,MAAM,EAAE,MAAM,OAAO,OAAO;EAC5B,MAAM,KAAK,OAAO,GAAG,OAAO,WAAW,GAAG,KAAK;EAC/C,IAAI,SAAS,WAAW;GACtB,MAAM,SAAS,OAAO,GAAG,WAAW,YAAY,GAAG,OAAO,SAAS,IAAI,GAAG,SAAS;GACnF,MAAM,QAAQ,OAAO,GAAG,UAAU,WAAW,GAAG,QAAQ;GACxD,MAAM,gBAA0B,CAAC;GACjC,IAAI,GAAG,WAAW,GAAG,cAAc,KAAK,IAAI;GAC5C,MAAM,4BAA4B,GAAG,WAAW,KAAA,KAAa,WAAW;GACxE,IACE,GAAG,WAAW,QACd,CAAC,6BACD,EAAE,OAAO,GAAG,WAAW,YAAY,GAAG,OAAO,SAAS,IAEtD,cAAc,KAAK,QAAQ;GAE7B,IAAI,MAAM,WAAW,GAAG,cAAc,KAAK,OAAO;GAClD,IAAI,GAAG,SAAS,KAAA,KAAa,GAAG,SAAS,gBAAgB,GAAG,SAAS,UACnE,cAAc,KAAK,MAAM;GAE3B,IACE,GAAG,kBAAkB,KAAA,KACrB,EAAE,OAAO,GAAG,kBAAkB,YAAY,GAAG,cAAc,SAAS,IAEpE,cAAc,KAAK,eAAe;GAEpC,IAAI,GAAG,YAAY,KAAA,KAAa,EAAE,OAAO,GAAG,YAAY,YAAY,GAAG,QAAQ,SAAS,IACtF,cAAc,KAAK,SAAS;GAE9B,MAAM,OACJ,GAAG,SAAS,gBAAgB,GAAG,SAAS,WAAW,GAAG,OAAO;GAC/D,MAAM,QAAQ,cAAc,WAAW;GACvC,IAAI,SAAS,WAAW,QAAQ,WAAW,MAAM,SAAS;GAC1D,OAAO,KAAK;IACV;IACA;IACA;IACA;IACA;IACA,eACE,OAAO,GAAG,kBAAkB,YAAY,GAAG,cAAc,SAAS,IAC9D,GAAG,gBACH;IACN,SAAS,OAAO,GAAG,YAAY,YAAY,GAAG,QAAQ,SAAS,IAAI,GAAG,UAAU;IAChF,IAAI,GAAG,GAAG,EAAE;IACZ;IACA;GACF,CAAC;EACH,OAAO,IAAI,SAAS,WAAW;GAC7B,MAAM,UAAU,YAAY,GAAG,OAAO;GACtC,OAAO,KAAK;IACV;IACA,MAAM;IACN,QAAQ,OAAO,GAAG,WAAW,WAAW,GAAG,SAAS;IACpD,SAAS,QAAQ;IACjB,OAAO,QAAQ;IACf,OAAO,QAAQ;IACf,YAAY,QAAQ;IACpB,QAAQ,OAAO,GAAG,WAAW,WAAW,GAAG,SAAS;IACpD,OAAO,OAAO,GAAG,UAAU,YAAY,GAAG,QAAQ;IAClD,IAAI,GAAG,GAAG,EAAE;IACZ,OAAO,UAAU,GAAG,KAAK;IACzB,UAAU,SAAS,GAAG,KAAK,CAAC,CAAC,WAAW,KAAA;GAC1C,CAAC;EACH,OAAO,IAAI,SAAS,aAClB,OAAO,KAAK;GACV;GACA,MAAM;GACN,QAAQ;GACR,SAAS,OAAO,GAAG,WAAW,WAAW,GAAG,SAAS;GACrD,OAAO;GACP,OAAO;GACP,YAAY,OAAO,GAAG,WAAW,WAAW,GAAG,SAAS;GACxD,QAAQ,OAAO,GAAG,WAAW,WAAW,GAAG,SAAS;GACpD,OAAO;GACP,IAAI,GAAG,GAAG,EAAE;GACZ,OAAO;IACL,QAAQ;KAAE,OAAO;KAAG,QAAQ;KAAG,WAAW;KAAG,YAAY;KAAG,UAAU;IAAM;IAC5E,KAAK;GACP;GACA,UAAU;EACZ,CAAC;OACI,IAAI,SAAS,WAGlB,YAAY,KAAK;GAAE;GAAI,OAAO,UAAU,GAAG,KAAK;GAAG,IAAI,GAAG,GAAG,EAAE;EAAE,CAAC;OAMlE,MAAM,IAAI,MAAM,gCAAgC,KAAK,UAAUA,IAAS,GAAG;CAE/E;CAKA,KAAK,MAAM,OAAO,aAAa;EAC7B,IAAI,WAAW,QAAQ,IAAI,OAAO,QAAQ;EAC1C,WAAW,IAAI,MAAM,OAAO;EAC5B,YAAY,IAAI,MAAM,OAAO;EAC7B,kBAAkB,IAAI,MAAM,OAAO;EACnC,mBAAmB,IAAI,MAAM,OAAO;EACpC,gBAAgB,iBAAiB,IAAI,MAAM,OAAO;EAClD,YAAY,IAAI,MAAM;EACtB,gBAAgB;CAClB;CAEA,MAAM,eAAe,OAAO,QAAQ,MAAM,EAAE,SAAS,EAAE,OAAO,MAAM;CACpE,MAAM,YAAY,IAAI,IAAI,aAAa,KAAK,MAAM,EAAE,EAAE,CAAC;CACvD,MAAM,eAAe,OAAO,QAAQ,MAAM,UAAU,IAAI,EAAE,EAAE,CAAC;CAE7D,MAAM,6BAAa,IAAI,IAA4B;CACnD,MAAM,gBAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,aAAa,OAAO,IAAI,WAAW,CAAC,EAAA,CAAG,QAAQ,GAAG;EAC5D,MAAM,QAAwB;GAC5B;GACA,UAAU,EAAE,YAAY;GACxB,OAAO,EAAE;GACT,eAAe,EAAE,UAAU;GAC3B,gBAAgB,EAAE,WAAW;GAC7B,kBAAkB;GAClB,mBAAmB;GACnB,SAAS;GACT,UAAU;GACV,YAAY;GACZ,QAAQ;GACR,OAAO;GACP,oBAAoB;GACpB,eAAe;GACf,cAAc;GACd,iBAAiB;GACjB,yBAAyB;GACzB,4BAA4B;GAC5B,WAAW;GACX,eAAe,CAAC;GAChB,uBAAuB,CAAC;EAC1B;EACA,MAAM,cAAc,0BAA0B,EAAE,KAAK;EACrD,MAAM,eAAe,0BAA0B,EAAE,MAAM;EACvD,MAAM,mBAAmB,YAAY;EACrC,MAAM,oBAAoB,aAAa;EACvC,KAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,KAAK,QAAQ,GAAG;GACnD,IAAI,OAAO,IAAI,YAAY,YAAY,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAAG;GACxE,MAAM,cAAc,KAAK;IACvB,WAAW,OAAO,IAAI,OAAO,YAAY,IAAI,GAAG,SAAS,IAAI,IAAI,KAAK;IACtE;GACF,CAAC;EACH;EACA,KAAK,MAAM,CAAC,KAAK,OAAO,aAAa,KAAK,QAAQ,GAAG;GACnD,MAAM,OAAO,GAAG;GAChB,IAAI,SAAS,WAAW;IACtB,IAAI,GAAG,cAAc,MAAM;KACzB,MAAM,aAAa;KACnB;IACF;IACA,MAAM,sBAAsB,KAAK;KAC/B,WACE,OAAO,GAAG,cAAc,YAAY,GAAG,UAAU,SAAS,IAAI,GAAG,YAAY;KAC/E,WAAW,OAAO,GAAG,cAAc,YAAY,GAAG,YAAY;KAC9D;IACF,CAAC;GACH,OAAO,IAAI,SAAS,WAClB,MAAM,UAAU,GAAG,GAAG,EAAE;QACnB,IAAI,SAAS,YAAY;IAC9B,MAAM,WAAW;IACjB,MAAM,aAAa,GAAG,GAAG,EAAE;IAC3B,MAAM,SAAS,OAAO,GAAG,WAAW,YAAY,GAAG,SAAS;IAC5D,MAAM,QAAQ,OAAO,GAAG,UAAU,YAAY,OAAO,SAAS,GAAG,KAAK,IAAI,GAAG,QAAQ;IACrF,MAAM,qBAAqB,OAAO,GAAG,eAAe,WAAW,GAAG,aAAa;IAC/E,MAAM,gBAAgB,OAAO,GAAG,aAAa,WAAW,GAAG,SAAS,SAAS;GAC/E;EACF;EACA,MAAM,+BAAe,IAAI,IAAoB;EAC7C,KAAK,MAAM,WAAW,MAAM,eAAe;GACzC,IAAI,QAAQ,cAAc,MAAM;GAChC,aAAa,IAAI,QAAQ,YAAY,aAAa,IAAI,QAAQ,SAAS,KAAK,KAAK,CAAC;EACpF;EACA,MAAM,uCAAuB,IAAI,IAAwC;EACzE,KAAK,MAAM,mBAAmB,MAAM,uBAAuB;GACzD,IAAI,gBAAgB,cAAc,MAAM;GACxC,MAAM,UAAU,qBAAqB,IAAI,gBAAgB,SAAS,KAAK,CAAC;GACxE,QAAQ,KAAK,eAAe;GAC5B,qBAAqB,IAAI,gBAAgB,WAAW,OAAO;EAC7D;EACA,MAAM,gBAA0B,CAAC;EACjC,IAAI,CAAC,MAAM,eAAe,cAAc,KAAK,cAAc;EAC3D,IAAI,CAAC,MAAM,gBAAgB,cAAc,KAAK,eAAe;EAC7D,IAAI,MAAM,mBAAmB,GAAG,cAAc,KAAK,+BAA+B;EAClF,IAAI,MAAM,oBAAoB,GAAG,cAAc,KAAK,+BAA+B;EACnF,IAAI,MAAM,cAAc,MAAM,YAAY,QAAQ,cAAc,IAAI,GAClE,cAAc,KAAK,2BAA2B;EAEhD,IAAI,CAAC,GAAG,aAAa,OAAO,CAAC,CAAC,CAAC,MAAM,UAAU,QAAQ,CAAC,GACtD,cAAc,KAAK,8BAA8B;EAEnD,IAAI,MAAM,sBAAsB,MAAM,oBAAoB,gBAAgB,cAAc,IAAI,GAC1F,cAAc,KAAK,oCAAoC;EAEzD,IAAI,CAAC,GAAG,qBAAqB,KAAK,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC,GACrE,cAAc,KAAK,uCAAuC;EAE5D,IAAI,cAAc,WAAW,GAC3B,MAAM,eAAe,aAAa;OAElC,MAAM,0BAA0B,CAAC,GAAG,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,IAAI;EAGvE,MAAM,mBAAmB,CAAC,GAAG,aAAa;EAC1C,IAAI,CAAC,GAAG,qBAAqB,OAAO,CAAC,CAAC,CAAC,MAAM,SAAS,KAAK,SAAS,CAAC,GACnE,iBAAiB,KAAK,uCAAuC;EAE/D,IAAI,MAAM,sBAAsB,MAAM,oBAAoB,gBAAgB,cAAc,IAAI,GAC1F,iBAAiB,KAAK,yCAAyC;EAEjE,IAAI,iBAAiB,WAAW,GAC9B,MAAM,kBAAkB,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC,CAAC,QAAQ,OAAO;GAC9D,MAAM,kBAAkB,qBAAqB,IAAI,EAAE;GACnD,OAAO,iBAAiB,WAAW,KAAK,gBAAgB,EAAE,EAAE,cAAc;EAC5E,CAAC,CAAC,CAAC;OAEH,MAAM,6BAA6B,CAAC,GAAG,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,KAAK,IAAI;EAE7E,cAAc,KAAK,KAAK;EACxB,WAAW,IAAI,gBAAgB,CAAC,GAAG,KAAK;CAC1C;CAEA,MAAM,YAAY,GAAG,OAAO,SAAS,KAAK,OAAO,EAAE,EAAE,MAAM;CAC3D,MAAM,YAAY,WAAW,OAAO,OAAO,OAAO,MAAM,UAAU,MAAM,OAAO,MAAM;CACrF,MAAM,cAAc,GAAG,OAAO,WAAW,KAAK,WAAW,MAAM;CAE/D,IAAI,eAA8B;CAClC,IAAI,cAA6B;CACjC,MAAM,kBAAkB,OAA4B;EAClD,IAAI,OAAO,MAAM;EACjB,IAAI,iBAAiB,QAAQ,KAAK,cAAc,eAAe;EAC/D,IAAI,gBAAgB,QAAQ,KAAK,aAAa,cAAc;CAC9D;CACA,KAAK,MAAM,SAAS,QAAQ,eAAe,MAAM,EAAE;CACnD,KAAK,MAAM,SAAS,QAAQ,eAAe,MAAM,EAAE;CACnD,KAAK,MAAM,WAAW,aAAa,eAAe,QAAQ,EAAE;CAE5D,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,OAAO;GACL,UAAU;GACV,WAAW;GACX,WAAW;GACX,YAAY;GACZ,UAAU;GACV,KAAK;GACL;EACF;EACA;EACA;EACA,aAAa,OAAO,SAAS,cAAc;EAC3C,oBAAoB,cAAc,cAAc;EAChD,0BAA0B,cAAc;EACxC,0BAA0B,OAAO,YAAY,aAAa;EAC1D,oBAAoB,YAAY;EAChC,gBAAgB,iBAAiB,YAAY;EAC7C;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;ACrnBA,MAAM,aAAa;CACjB,KAAK;CACL,WAAW;CACX,YAAY;CACZ,kBAAkB;CAClB,YAAY;CACZ,aAAa;CACb,QAAQ;AACV;AAEA,SAAS,YACP,QAC2D;CAC3D,OAAO,OAAO,aAAa,KAAA;AAC7B;;;;;;AAOA,SAAgB,0BACd,KACA,OAAiC,CAAC,GACf;CACnB,OAAO,mCAAmC,KAAK,oBAAoB,GAAG,GAAG,IAAI;AAC/E;;AAGA,SAAgB,mCACd,KACA,MACA,OAAiC,CAAC,GACf;CACnB,MAAM,OAA+B,CAAC;CACtC,IAAI,IAAI,YAAY,MAAM;EACxB,KAAK,KAAK;GACR,MAAM;GACN,SAAS,GAAG,IAAI,cAAc,OAAO,0BAA0B,iBAAiB;EAClF,CAAC;EACD,OAAO;GAAE,QAAQ;GAAM,OAAO,CAAC;GAAG;EAAK;CACzC;CAIA,MAAM,sBACJ,KAAK,qBAAqB,KAAK,OAAO,QAAQ,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;CACxE,IAAI,sBAAsB,GACxB,KAAK,KAAK;EACR,MAAM;EACN,SAAS,GAAG,oBAAoB,MAAM,KAAK,YAAY;EACvD,OAAO;CACT,CAAC;CAGH,MAAM,QAAQ,KAAK;CACnB,MAAM,SAAS,UAAU,IAAI,MAAM;CACnC,MAAM,QAAQ,UAAU,IAAI,KAAK;CACjC,MAAM,cAAc,SAAS,OAAO,MAAM;CAE1C,MAAM,SAAS,KAAK;CACpB,MAAM,QAAQ,KAAK,SAAS,UAAU,IAAI;CAC1C,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,aAAa,IAAI,cAAc,IAAI;CACzC,MAAM,QAAsB,KAAK,SAAS;CAC1C,MAAM,aAAa,KAAK,+BAAc,IAAI,KAAK,EAAA,CAAE,YAAY;CAE7D,MAAM,OAAO;EACX,QAAQ;EACR,QAAQ;EACR,eAAe,KAAK,gBAAgB;EACpC,cAAc,KAAK,eAAe;EAClC,YAAY,KAAK,cAAc;EAC/B,iBAAiB,KAAK,kBAAkB;EACxC,MAAM;GACJ;GACA,aAAa;GACb;GACA,MAAM,KAAK,QAAQ;GACnB,KAAK,KAAK,OAAO;EACnB;EACA,UAAU,CAAC;EACX,WAAW,CAAC;CACd;CAEA,MAAM,QAAuB,CAAC;CAG9B,IAAI,WAAW,MAAM;EACnB,MAAM,YAAY,KAAK,OAAO,MAAM,UAAU,MAAM,SAAS,MAAM,OAAO,MAAM;EAChF,MAAM,gBAAgB,OAAO,OAAO,aAAa,YAAY,MAAM,WAAW;EAE9E,MAAM,UADa,OAAO,OAAO,UAAU,WAAW,MAAM,QAAQ,UACtC,kBAAkB,OAAO,OAAO,gBAAgB,IAAI;EAClF,IAAI,WAAW,MACb,KAAK,KAAK;GACR,MAAM;GACN,SAAS;GACT,QAAQ;EACV,CAAC;EAEH,MAAM,SACJ,KAAK,cAAc,QAAQ,KAAK,gBAAgB,QAAQ,KAAK,eAAe,KAAK,YAC7E,KAAK,cAAc,KAAK,YACxB;EACN,MAAM,KAAK;GACT,GAAG;GACH,YAAY;GACZ,mBAAmB;GACnB,MAAM,WAAW,QAAQ;GACzB,QAAQ;IACN,SAAS,KAAK,qBAAqB;IACnC,iBAAiB;IACjB,OAAO,KAAK,mBAAmB;IAC/B,UAAU;IACV,gBAAgB;IAChB,uBAAuB,WAAW,iBAAiB;IACnD,UAAU;GACZ;GACA,SAAS;IAYP,GAAG,uBAAuB,MAAM;IAChC,eAAe,IAAI;IACnB,SAAS,SAAS;IAClB,SAAS;KACP,KAAK,IAAI;KACT,YAAY,OAAO,OAAO,WAAW,WAAW,MAAM,SAAS;KAC/D,aAAa,OAAO,OAAO,YAAY,WAAW,MAAM,UAAU;KAClE,WAAW,OAAO,YAAY,cAAc,YAAY,YAAY,YAAY;KAChF,aAAa,OAAO,QAAQ,gBAAgB,YAAY,OAAO,cAAc;KAC7E,YAAY,KAAK;KACjB,cAAc,KAAK;KACnB,iBAAiB,KAAK,aAAa;KACnC,sBAAsB,KAAK,MAAM;KACjC,SAAS,WAAW,WAAW;KAC/B,gBAAgB,WAAW,iBAAiB;IAC9C;IACA,cAAc,OAAO,WAAW;IAChC,cAAc;IACd,OACE,QAAQ,SAAS,iBAAiB,OAAO,OAAO,WAAW,WACvD,OAAO,SACP;IACN,gBAAgB;GAClB;GACA,MAAM;IACJ,GAAG;IACH,KACE,IAAI,OAAO,aAAa,OACpB,OACA,OAAO,YAAY,aAAa,WAC9B,YAAY,WACZ,KAAK,MAAM;IACnB,WAAW,IAAI,OAAO,kBAAkB,OAAO,KAAK,MAAM,WAAW;IACrE,YAAY,IAAI,OAAO,kBAAkB,OAAO,KAAK,MAAM,YAAY;IACvE,YACE,IAAI,OAAO,kBAAkB,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,YAAY;IACpF,aACE,IAAI,OAAO,kBAAkB,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,aAAa;IACrF,QAAQ,WAAW,OAAO,OAAO,SAAS;GAC5C;GACA,WAAW;IACT,YAAY,OAAO,QAAQ,cAAc,WAAW,OAAO,YAAY;IACvE,SAAS,IAAI;IACb,gBACE,IAAI,sBAAsB,KAAA,IACtB,IAAI,oBACJ,IAAI,cAAc,OAChB,OACA,GAAG,IAAI,UAAU;GAC3B;GACA,YAAY;IACV,aAAa;IACb,SAAS;IACT,KAAK;GACP;EACF,CAAC;CACH,OACE,KAAK,KAAK;EACR,MAAM;EACN,SAAS;CACX,CAAC;CAIH,MAAM,YAAY,IAAI,IAAI,KAAK,OAAO,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAC3D,MAAM,aAAa,IAAI,KACpB,IAAI,WAAW,CAAC,EAAA,CAAG,OAAO,WAAW,CAAC,CAAC,KAAK,WAAW,CAAC,OAAO,UAAU,MAAM,CAAC,CACnF;CACA,MAAM,wBAAwB,IAAI,KAC/B,IAAI,WAAW,CAAC,EAAA,CACd,QAAQ,WAAW,OAAO,aAAa,KAAA,CAAS,CAAC,CACjD,KAAK,WAAW,CAAC,OAAO,OAAO,MAAM,CAAC,CAC3C;CAGA,KAAK,MAAM,SAAS,KAAK,cAAc;EACrC,IAAI,MAAM,SAAS,MAAM;GACvB,KAAK,KAAK;IACR,MAAM;IACN,SAAS,SAAS,KAAK,UAAU,MAAM,KAAK,EAAE;IAC9C,QAAQ,MAAM;GAChB,CAAC;GACD;EACF;EACA,MAAM,QAAQ,UAAU,IAAI,MAAM,EAAE,KAAK;EACzC,MAAM,eAAe,WAAW,IAAI,MAAM,EAAE,KAAK,sBAAsB,IAAI,MAAM,KAAK,KAAK;EAC3F,MAAM,QACJ,KAAK,WAAW,IAAI,cAAc,YAAY,cAAc,SAAS,MAAM,KAAK,KAAK;EACvF,MAAM,SACJ,OAAO,WAAW,QAAQ,MAAM,cAAc,OAAO,MAAM,aAAa,MAAM,UAAU;EAC1F,MAAM,QAAQ,OAAO,SAAS,OAAO,SAAS;EAC9C,MAAM,SAAS,OAAO,SAAS,OAAO,UAAU;EAChD,MAAM,SAAS,UAAU,WAAW,OAAO,OAAO,SAAS,IAAI;EAC/D,IAAI,WAAW,MACb,KAAK,KAAK;GACR,MAAM;GACN,SAAS,SAAS,KAAK,UAAU,MAAM,KAAK,EAAE;GAC9C,QAAQ,MAAM;EAChB,CAAC;EAEH,MAAM,eAAe,MAAM,SAAS;EACpC,MAAM,KAAK;GACT,GAAG;GACH,YAAY,MAAM;GAClB,mBAAmB,MAAM;GACzB,MAAM,MAAM;GACZ,QAAQ;IACN,SAAS,eAAgB,KAAK,qBAAqB,OAAS,KAAK,iBAAiB;IAClF,iBAAiB;IACjB,OAAO,eAAgB,KAAK,mBAAmB,OAAS,KAAK,eAAe;IAC5E,UAAU;IACV,gBAAgB;IAChB,uBAAuB,MAAM;IAC7B,UAAU;GACZ;GACA,SAAS;IAGP,GAAG,uBAAuB,MAAM;IAChC,eACE,WAAW,OAAO,OAAO,UAAU,OAAO,uBAAuB;IACnE,SACE,UAAU,OACN,OACA;KACE,MAAM,MAAM;KACZ,QAAQ,MAAM;KACd,SAAS,MAAM;KACf,OAAO,MAAM;KACb,OAAO,MAAM;IACf;IACN,SAAS;KACP,OAAO,MAAM;KACb,YAAY,MAAM;KAClB,YAAY,OAAO,MAAM;KACzB,YAAY,OAAO,WAAW;KAC9B,aAAa,OAAO,cAAc;KAClC,SAAS;KACT,aAAa,cAAc,cAAc,OAAO,sBAAsB;KACtE,gBAAgB,OAAO,iBAAiB;KACxC,eAAe,OAAO,gBAAgB;KACtC,kBAAkB,OAAO,mBAAmB;KAC5C,WAAW,OAAO,aAAa;KAC/B,SAAS,MAAM;KACf,gBAAgB,MAAM;IACxB;IACA,cAAc,OAAO,SAAS,aAAa,MAAM,WAAW;IAC5D,cAAc,OAAO,SAAS;IAC9B,OACE,OAAO,SAAS,cACX,MAAM,UAAU,cACjB,OAAO,WAAW,SACf,MAAM,UAAU,eACjB;IACR,gBAAgB;GAClB;GAGA,MAAM;IACJ,GAAG;IACH,KAAK,IAAI,OAAO,aAAa,QAAQ,CAAC,OAAO,WAAW,OAAO,MAAM,MAAM;IAC3E,WAAW,cAAc,aAAa,OAAO,WAAW,MAAM,MAAM,OAAO,QAAQ;IACnF,YAAY,cAAc,cAAc,OAAO,WAAW,MAAM,MAAM,OAAO,SAAS;IAKtF,YACE,cAAc,cACb,OAAO,YAAY,MAAM,MAAM,OAAO,WAAW,MAAM,MAAM,OAAO,YAAY;IACnF,aACE,cAAc,eACb,OAAO,YAAY,MAAM,MAAM,OAAO,WAAW,MAAM,MAAM,OAAO,aAAa;IACpF,QAAQ,WAAW,OAAO,OAAO,SAAS;GAC5C;GAIA,WAAW;IACT,YACE,cAAc,cAAc,KAAA,IACxB,aAAa,YACb,IAAI,cAAc,OAChB,OACA,GAAG,IAAI,UAAU,WAAW,MAAM,MAAM;IAChD,SAAS,IAAI;IACb,gBACE,cAAc,kBAAkB,KAAA,IAC5B,aAAa,gBACb,IAAI,cAAc,OAChB,OACA,GAAG,IAAI,UAAU,WAAW,MAAM,MAAM;GAClD;GACA,YAAY;IACV,aAAa;IACb,SAAS;IACT,KACE,cAAc,iBAAiB,OAC3B,2FACA;GACR;EACF,CAAC;CACH;CAEA,MAAM,UAAU,MAAM,QAAQ,MAAM,CAAC,cAAc,CAAC,CAAC;CACrD,IAAI,QAAQ,SAAS,GACnB,KAAK,KAAK;EACR,MAAM;EACN,SAAS,GAAG,QAAQ,OAAO;EAC3B,OAAO,QAAQ;CACjB,CAAC;CAEH,OAAO;EAAE;EAAQ;EAAO;CAAK;AAC/B;;;ACjYA,SAAS,OAAO,OAA6E;CAC3F,OAAO,WAAW,SAAS,MAAM,QAAQ,MAAM,KAAK;AACtD;AAEA,SAAS,WAAW,MAAiC;CACnD,MAAM,SAAS,CACb,GAAG,IAAI,IACL,KAAK,MACF,KAAK,SAAS,KAAK,MAAM,CAAC,CAC1B,QAAQ,UAA2B,OAAO,UAAU,YAAY,MAAM,SAAS,CAAC,CACrF,CACF,CAAC,CAAC,KAAK;CACP,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO;CACvC,IAAI,OAAO,SAAS,GAAG,OAAO,cAAc,OAAO,KAAK,GAAG;CAC3D,OAAO,KAAK,UAAU;AACxB;;;;;AAMA,SAAgB,8BACd,OACA,UAAyC,CAAC,GACZ;CAC9B,IAAI,OAAO,KAAK,GAAG;EACjB,MAAM,mBAAgE;GACpE;GACA;GACA;EACF;EACA,OAAO;GACL,QAAQ;GACR,QAAQ,WAAW,KAAK;GACxB,OAAO;GACP,MAAM;GACN,QAAQ,CACN,GAAG,WAAW,KAAK,GACnB,MAAM;IACJ,MAAM;IACN,MAAM;IACN,UAAU;IACV,SAAS;IACT,OAAO;IACP,QACE;IACF,UAAU,CAAC,SAAS,4BAA4B,gBAAgB,CAAC;IACjE,mBACE;IACF,UAAU;KAAE,YAAY;KAAe,QAAQ;IAAiB;GAClE,CAAC,CACH;EACF;CACF;CAEA,MAAM,QAAQ,oBAAoB,KAAK;CACvC,MAAM,OAAO,mCAAmC,OAAO,OAAO,EAC5D,YAAY,QAAQ,WACtB,CAAC;CACD,OAAO;EACL,QAAQ;EACR,QAAQ,MAAM;EACd,OAAO;EACP;EACA,QAAQ,CACN,GAAG,WAAW,MAAM;GAClB,qBACE,MAAM,qBACN,MAAM,OAAO,QAAQ,UAAU,CAAC,MAAM,SAAS,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC;GACxE,cAAc,IAAI,IAChB,MAAM,OACH,QAAQ,UAAU,CAAC,MAAM,SAAS,MAAM,GAAG,SAAS,CAAC,CAAC,CACtD,KAAK,UAAU,MAAM,EAAE,CAC5B;EACF,CAAC,GACD,GAAG,aAAa,OAAO,OAAO,IAAI,CACpC;CACF;AACF"}

package/dist/{judge-calibration-DZkWrm5H.js → judge-calibration-zZjLz8hr.js}

@@ -1,4 +1,4 @@
-import { a as spearmanR, r as pearsonR } from "./descriptive-B5MwKfbf.js";
+import { a as spearmanR, r as pearsonR } from "./descriptive-jDOuI6mz.js";
 //#region src/judge-calibration.ts
 /**
 * Judge calibration — measure judge quality against human gold + bias.
@@ -314,4 +314,4 @@ function quantile(sorted, q) {
 //#endregion
 export { verbosityBias as i, calibrateJudgeContinuous as n, continuousAgreement as r, calibrateJudge as t };
 
-//# sourceMappingURL=judge-calibration-DZkWrm5H.js.map
+//# sourceMappingURL=judge-calibration-zZjLz8hr.js.map

package/dist/{judge-calibration-DZkWrm5H.js.map → judge-calibration-zZjLz8hr.js.map}

@@ -1 +1 @@
-{"version":3,"file":"judge-calibration-DZkWrm5H.js","names":[],"sources":["../src/judge-calibration.ts"],"sourcesContent":["/**\n * Judge calibration — measure judge quality against human gold + bias.\n *\n * Workflow:\n *   1. Build a golden set: {itemId, humanScore}[].\n *   2. Run candidate judges; each produces {itemId, score}.\n *   3. `calibrateJudge(golden, candidate)` reports κ + Pearson + MAE.\n *   4. `calibrateJudgeContinuous(golden, candidate)` adds quadratic-weighted\n *      κ over the un-rounded [0,1] scores plus ICC(2,1), Pearson, Spearman,\n *      and bootstrap CIs — use this for fine-grained judges where rounding\n *      to int discards information (e.g. 0.78 vs 0.81 both round to 1 and\n *      look \"perfectly agreed\" to integer κ).\n *   5. Run bias probes (positional, verbosity, self-preference) to\n *      detect systematic score inflation.\n *   6. For N≥2 judges on the same items, `continuousAgreement(scores)`\n *      reports ICC(2,1) + κ_w + Pearson + Spearman with bootstrap CIs.\n *\n * Returns actionable diagnostics, not a single number. Consumers then\n * decide whether to trust the judge, retrain it, or add a tie-breaker.\n */\n\nimport { pearsonR, spearmanR } from './statistics/descriptive'\n\nexport interface GoldenItem {\n  itemId: string\n  humanScore: number\n  /** Optional group used for per-group bias audits (e.g. model-of-output family). */\n  group?: string\n}\n\nexport interface CandidateScore {\n  itemId: string\n  score: number\n  /** Optional — enables positional-bias analysis (did order matter?). */\n  positionOfAInput?: 'first' | 'second'\n}\n\nexport interface CalibrationResult {\n  n: number\n  pearson: number\n  /** Cohen's κ with quadratic weights over integer-rounded scores. */\n  kappa: number\n  /** Mean absolute error vs human. */\n  mae: number\n  /** Worst-5 miscalibrations (largest |judge - human|). */\n  worstItems: Array<{ itemId: string; judge: number; human: number; delta: number }>\n}\n\n/**\n * Measure judge quality against human gold labels: computes Cohen's κ, Pearson correlation, and MAE over matched item ids.\n */\nexport function calibrateJudge(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n): CalibrationResult {\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const common = [...map.values()].filter((v) => Number.isFinite(v.j))\n  const n = common.length\n  if (n < 2) {\n    return { n, pearson: NaN, kappa: NaN, mae: NaN, worstItems: [] }\n  }\n  const humans = common.map((c) => c.h)\n  const judges = common.map((c) => c.j)\n  const pearson = pearsonR(humans, judges)\n  const kappa = weightedKappa(humans.map(Math.round), judges.map(Math.round))\n  const absDiffs = common.map((c) => Math.abs(c.j - c.h))\n  const mae = absDiffs.reduce((a, b) => a + b, 0) / n\n  const worst = [...map.entries()]\n    .filter(([, v]) => Number.isFinite(v.j))\n    .map(([itemId, v]) => ({ itemId, judge: v.j, human: v.h, delta: Math.abs(v.j - v.h) }))\n    .sort((a, b) => b.delta - a.delta)\n    .slice(0, 5)\n  return { n, pearson, kappa, mae, worstItems: worst }\n}\n\nexport interface PositionalBiasResult {\n  /**\n   * Score delta (first-position - second-position) averaged across items\n   * presented in both positions. Non-zero = positional bias.\n   */\n  avgDelta: number\n  n: number\n}\n\n/**\n * Feed the same items to the judge twice with A/B swapped and pass all\n * results here. Items that don't appear in both positions are ignored.\n */\nexport function positionalBias(scores: CandidateScore[]): PositionalBiasResult {\n  const pairs = new Map<string, { first?: number; second?: number }>()\n  for (const s of scores) {\n    const slot = pairs.get(s.itemId) ?? {}\n    if (s.positionOfAInput === 'first') slot.first = s.score\n    else if (s.positionOfAInput === 'second') slot.second = s.score\n    pairs.set(s.itemId, slot)\n  }\n  const deltas: number[] = []\n  for (const { first, second } of pairs.values()) {\n    if (first !== undefined && second !== undefined) deltas.push(first - second)\n  }\n  if (deltas.length === 0) return { avgDelta: 0, n: 0 }\n  return { avgDelta: deltas.reduce((a, b) => a + b, 0) / deltas.length, n: deltas.length }\n}\n\nexport interface VerbosityBiasResult {\n  /** Pearson correlation between output length and score. Strong positive = verbosity bias. */\n  pearson: number\n  n: number\n}\n\nexport function verbosityBias(\n  samples: Array<{ outputLen: number; score: number }>,\n): VerbosityBiasResult {\n  const n = samples.length\n  if (n < 3) return { pearson: NaN, n }\n  return {\n    pearson: pearsonR(\n      samples.map((s) => s.outputLen),\n      samples.map((s) => s.score),\n    ),\n    n,\n  }\n}\n\nexport interface SelfPreferenceResult {\n  /** Mean judge score when judge's family matches output's family. */\n  inFamilyMean: number\n  outOfFamilyMean: number\n  deltaMean: number\n  n: number\n}\n\n/**\n * Pass the same scenarios scored with judge-model X grading outputs from\n * model X (in-family) and model Y (out-of-family). Non-zero delta\n * indicates self-preference.\n */\nexport function selfPreference(\n  samples: Array<{ score: number; inFamily: boolean }>,\n): SelfPreferenceResult {\n  const inF = samples.filter((s) => s.inFamily).map((s) => s.score)\n  const outF = samples.filter((s) => !s.inFamily).map((s) => s.score)\n  if (inF.length === 0 || outF.length === 0)\n    return { inFamilyMean: 0, outOfFamilyMean: 0, deltaMean: 0, n: 0 }\n  const inMean = inF.reduce((a, b) => a + b, 0) / inF.length\n  const outMean = outF.reduce((a, b) => a + b, 0) / outF.length\n  return {\n    inFamilyMean: inMean,\n    outOfFamilyMean: outMean,\n    deltaMean: inMean - outMean,\n    n: samples.length,\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\n/** Quadratic weighted Cohen's κ over bounded integer scores. */\nfunction weightedKappa(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length === 0) return NaN\n  const min = Math.min(...a, ...b)\n  const max = Math.max(...a, ...b)\n  const K = max - min + 1\n  if (K < 2) return 1\n  const observed: number[][] = Array.from({ length: K }, () => new Array(K).fill(0))\n  const rowMarg = new Array(K).fill(0)\n  const colMarg = new Array(K).fill(0)\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i]! - min\n    const bi = b[i]! - min\n    const row = observed[ai]!\n    row[bi] = (row[bi] ?? 0) + 1\n    rowMarg[ai]++\n    colMarg[bi]++\n  }\n  let num = 0\n  let den = 0\n  for (let i = 0; i < K; i++) {\n    for (let j = 0; j < K; j++) {\n      const w = (i - j) ** 2 / (K - 1) ** 2\n      const expected = (rowMarg[i] * colMarg[j]) / a.length\n      num += w * observed[i]![j]!\n      den += w * expected\n    }\n  }\n  if (den === 0) return 1\n  return 1 - num / den\n}\n\n// ── Continuous-value inter-rater agreement ──────────────────────────\n//\n// `weightedKappa` above quantises to integers. For [0,1] judges that is\n// lossy: 0.78 and 0.81 both round to 1 and look identical to integer κ.\n// `continuousAgreement` keeps the original magnitudes:\n//\n//   - κ_w   : Cohen's weighted κ generalised to continuous scores. For two\n//             raters, weighted κ = 1 − Σ w_ij·o_ij / Σ w_ij·e_ij collapses\n//             into the closed form below when each \"category\" is the score\n//             itself (Janson & Olsson 2001; Cohen 1968 quadratic weights).\n//   - ICC   : Intraclass Correlation Coefficient, ICC(2,1) per Shrout &\n//             Fleiss (1979) — two-way random effects, absolute agreement,\n//             single rater. The right reliability coefficient when judges\n//             are a random sample of the judge population.\n//   - r, ρ  : Pearson + Spearman for sanity-check. Pearson catches linear\n//             association regardless of scale; Spearman catches monotone\n//             association regardless of distribution.\n//   - CIs   : Bootstrap percentile CIs over items (rows). Bias is preserved\n//             because we resample the full row, i.e. a judge's vector\n//             stays internally consistent within each bootstrap replicate.\n//\n// References:\n//   - Shrout, P. E. & Fleiss, J. L. (1979). Intraclass correlations: uses\n//     in assessing rater reliability. Psychological Bulletin, 86(2), 420.\n//   - McGraw, K. O. & Wong, S. P. (1996). Forming inferences about some\n//     intraclass correlation coefficients. Psychological Methods, 1, 30.\n//   - Janson, H. & Olsson, U. (2001). A measure of agreement for interval\n//     or nominal multivariate observations. Educ. Psychol. Meas., 61, 277.\n\nexport interface ContinuousAgreement {\n  /** Cohen's κ_w with quadratic weights, computed on raw [0,1] scores. */\n  weightedKappa: number\n  /** ICC(2,1): two-way random effects, absolute agreement, single rater. */\n  icc: number\n  /** Pearson product-moment correlation (averaged over rater pairs if N>2). */\n  pearson: number\n  /** Spearman rank correlation (averaged over rater pairs if N>2). */\n  spearman: number\n  /** 95% bootstrap percentile CIs over items. */\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n  /** Number of complete items (no NaN across raters). */\n  n: number\n  /** Number of raters. */\n  raters: number\n}\n\nexport interface ContinuousAgreementOptions {\n  /** Bootstrap iterations. Default 1000. Set to 0 to skip CIs (CI = [NaN, NaN]). */\n  bootstrap?: number\n  /** κ weighting scheme. Default 'quadratic'. */\n  weights?: 'linear' | 'quadratic'\n  /** PRNG seed for reproducible bootstrap. Default 0xC0FFEE. */\n  seed?: number\n  /** Confidence level for percentile CI. Default 0.95. */\n  ciLevel?: number\n}\n\n/**\n * Inter-rater agreement on continuous (typically [0,1]) scores.\n *\n * `scores` has shape [n_items][n_raters]. Rows with any non-finite entry\n * are dropped. Returns NaN metrics if fewer than 2 raters or 2 complete\n * items remain.\n */\nexport function continuousAgreement(\n  scores: number[][],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousAgreement {\n  const bootstrap = opts.bootstrap ?? 1000\n  const weights = opts.weights ?? 'quadratic'\n  const seed = opts.seed ?? 0xc0ffee\n  const ciLevel = opts.ciLevel ?? 0.95\n\n  const matrix = scores.filter((row) => row.length >= 2 && row.every((v) => Number.isFinite(v)))\n  const raters = matrix[0]?.length ?? 0\n  // All rows must have the same rater count, else drop the offenders.\n  const clean = matrix.filter((row) => row.length === raters)\n  const nClean = clean.length\n\n  if (nClean < 2 || raters < 2) {\n    return {\n      weightedKappa: NaN,\n      icc: NaN,\n      pearson: NaN,\n      spearman: NaN,\n      ci: { icc: [NaN, NaN], weightedKappa: [NaN, NaN] },\n      n: nClean,\n      raters,\n    }\n  }\n\n  const kappa = continuousWeightedKappa(clean, weights)\n  const icc = icc21(clean)\n  const pearson = avgPairwise(clean, pearsonR)\n  const spearman = avgPairwise(clean, spearmanR)\n\n  const ciIcc: [number, number] = [NaN, NaN]\n  const ciKappa: [number, number] = [NaN, NaN]\n  if (bootstrap > 0) {\n    const rng = mulberry32(seed)\n    const iccs: number[] = []\n    const kappas: number[] = []\n    for (let b = 0; b < bootstrap; b++) {\n      const sample: number[][] = new Array(nClean)\n      for (let i = 0; i < nClean; i++) {\n        sample[i] = clean[Math.floor(rng() * nClean)]!\n      }\n      const iccB = icc21(sample)\n      const kB = continuousWeightedKappa(sample, weights)\n      if (Number.isFinite(iccB)) iccs.push(iccB)\n      if (Number.isFinite(kB)) kappas.push(kB)\n    }\n    const [lo, hi] = percentileBounds(ciLevel)\n    if (iccs.length > 0) {\n      iccs.sort((a, b) => a - b)\n      ciIcc[0] = quantile(iccs, lo)\n      ciIcc[1] = quantile(iccs, hi)\n    }\n    if (kappas.length > 0) {\n      kappas.sort((a, b) => a - b)\n      ciKappa[0] = quantile(kappas, lo)\n      ciKappa[1] = quantile(kappas, hi)\n    }\n  }\n\n  return {\n    weightedKappa: kappa,\n    icc,\n    pearson,\n    spearman,\n    ci: { icc: ciIcc, weightedKappa: ciKappa },\n    n: nClean,\n    raters,\n  }\n}\n\nexport interface ContinuousCalibrationResult extends CalibrationResult {\n  /** Cohen's κ_w computed on raw (un-rounded) scores. */\n  weightedKappaContinuous: number\n  /** ICC(2,1) treating golden + candidate as two raters. */\n  icc: number\n  spearman: number\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n}\n\n/**\n * Extends `calibrateJudge` with continuous-value agreement metrics while\n * retaining its base calibration summary.\n */\nexport function calibrateJudgeContinuous(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousCalibrationResult {\n  const base = calibrateJudge(golden, candidate)\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const rows: number[][] = []\n  for (const v of map.values()) {\n    if (Number.isFinite(v.j)) rows.push([v.h, v.j])\n  }\n  const agreement = continuousAgreement(rows, opts)\n  return {\n    ...base,\n    weightedKappaContinuous: agreement.weightedKappa,\n    icc: agreement.icc,\n    spearman: agreement.spearman,\n    ci: agreement.ci,\n  }\n}\n\n// ── Continuous-agreement internals ──────────────────────────────────\n\n/**\n * Quadratic-weighted κ on continuous scores. With weights w(x,y) = (x-y)^2\n * (or |x-y| for linear) the formula collapses to:\n *\n *   κ_w = 1 − E_obs[w] / E_exp[w]\n *\n * where E_obs averages w over paired (a_i, b_i) and E_exp averages w over\n * the independent product distribution (sum_{i,j} w(a_i, b_j) / n^2).\n * The normalisation by (max-min)^2 in the integer version cancels in the\n * ratio, so we don't need it here. Generalises to N raters by averaging κ_w\n * over all rater pairs (mean pairwise weighted agreement).\n */\nfunction continuousWeightedKappa(rows: number[][], scheme: 'linear' | 'quadratic'): number {\n  if (rows.length === 0) return NaN\n  const raters = rows[0]!.length\n  if (raters < 2) return NaN\n  const wFn =\n    scheme === 'linear'\n      ? (x: number, y: number) => Math.abs(x - y)\n      : (x: number, y: number) => (x - y) ** 2\n  let sum = 0\n  let pairs = 0\n  for (let r1 = 0; r1 < raters; r1++) {\n    for (let r2 = r1 + 1; r2 < raters; r2++) {\n      const a = rows.map((row) => row[r1]!)\n      const b = rows.map((row) => row[r2]!)\n      const n = a.length\n      let obs = 0\n      for (let i = 0; i < n; i++) obs += wFn(a[i]!, b[i]!)\n      obs /= n\n      // Expected under independence: average of w over all i,j cross pairs.\n      let exp = 0\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) exp += wFn(a[i]!, b[j]!)\n      }\n      exp /= n * n\n      if (exp === 0) {\n        // Degenerate: at least one rater is constant. Convention: perfect\n        // agreement iff observed disagreement is also zero, else 0.\n        sum += obs === 0 ? 1 : 0\n      } else {\n        sum += 1 - obs / exp\n      }\n      pairs++\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/**\n * ICC(2,1) — two-way random effects, absolute agreement, single rater.\n *\n *   ICC(2,1) = (MSR − MSE) / (MSR + (k−1)·MSE + k·(MSC − MSE)/n)\n *\n * where MSR = between-rows MS, MSC = between-columns MS, MSE = residual MS,\n * n = rows (items), k = columns (raters).\n */\nfunction icc21(rows: number[][]): number {\n  const n = rows.length\n  if (n < 2) return NaN\n  const k = rows[0]!.length\n  if (k < 2) return NaN\n\n  // Row means.\n  const rowMeans = rows.map((row) => row.reduce((s, v) => s + v, 0) / k)\n  // Column means.\n  const colMeans = new Array(k).fill(0)\n  for (let j = 0; j < k; j++) {\n    let s = 0\n    for (let i = 0; i < n; i++) s += rows[i]![j]!\n    colMeans[j] = s / n\n  }\n  // Grand mean.\n  let grand = 0\n  for (let i = 0; i < n; i++) grand += rowMeans[i]!\n  grand /= n\n\n  let ssR = 0\n  for (let i = 0; i < n; i++) ssR += (rowMeans[i]! - grand) ** 2\n  ssR *= k\n  let ssC = 0\n  for (let j = 0; j < k; j++) ssC += (colMeans[j]! - grand) ** 2\n  ssC *= n\n  let ssT = 0\n  for (let i = 0; i < n; i++) {\n    for (let j = 0; j < k; j++) ssT += (rows[i]![j]! - grand) ** 2\n  }\n  const ssE = ssT - ssR - ssC\n\n  const dfR = n - 1\n  const dfC = k - 1\n  const dfE = (n - 1) * (k - 1)\n  const msR = ssR / dfR\n  const msC = ssC / dfC\n  const msE = dfE > 0 ? ssE / dfE : 0\n\n  const denom = msR + (k - 1) * msE + (k * (msC - msE)) / n\n  if (denom === 0) {\n    // Degenerate (all values equal): convention = 1 if rows identical,\n    // else 0. Identical rows ⇒ msR = 0 too, so msR − msE near 0.\n    return msR === 0 && msE === 0 ? 1 : 0\n  }\n  return (msR - msE) / denom\n}\n\n/** Average pairwise statistic over all rater pairs. */\nfunction avgPairwise(rows: number[][], fn: (a: number[], b: number[]) => number): number {\n  const k = rows[0]?.length ?? 0\n  if (k < 2) return NaN\n  let sum = 0\n  let pairs = 0\n  for (let i = 0; i < k; i++) {\n    for (let j = i + 1; j < k; j++) {\n      const a = rows.map((row) => row[i]!)\n      const b = rows.map((row) => row[j]!)\n      const r = fn(a, b)\n      if (Number.isFinite(r)) {\n        sum += r\n        pairs++\n      }\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/** Seeded PRNG — Mulberry32. Deterministic across platforms. */\nfunction mulberry32(seed: number): () => number {\n  let a = seed >>> 0\n  return () => {\n    a = (a + 0x6d2b79f5) >>> 0\n    let t = a\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\nfunction percentileBounds(ciLevel: number): [number, number] {\n  const tail = (1 - ciLevel) / 2\n  return [tail, 1 - tail]\n}\n\n/** Linear-interpolated quantile of a pre-sorted ascending array. */\nfunction quantile(sorted: number[], q: number): number {\n  if (sorted.length === 0) return NaN\n  if (sorted.length === 1) return sorted[0]!\n  const pos = q * (sorted.length - 1)\n  const lo = Math.floor(pos)\n  const hi = Math.ceil(pos)\n  if (lo === hi) return sorted[lo]!\n  const frac = pos - lo\n  return sorted[lo]! * (1 - frac) + sorted[hi]! * frac\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAmDA,SAAgB,eACd,QACA,WACmB;CACnB,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,SAAS,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC;CACnE,MAAM,IAAI,OAAO;CACjB,IAAI,IAAI,GACN,OAAO;EAAE;EAAG,SAAS;EAAK,OAAO;EAAK,KAAK;EAAK,YAAY,CAAC;CAAE;CAEjE,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CACpC,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CAUpC,OAAO;EAAE;EAAG,SATI,SAAS,QAAQ,MASf;EAAG,OARP,cAAc,OAAO,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,CAQhD;EAAG,KAPX,OAAO,KAAK,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAClC,CAAC,CAAC,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAMjB,YALnB,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,CAC7B,QAAQ,GAAG,OAAO,OAAO,SAAS,EAAE,CAAC,CAAC,CAAC,CACvC,KAAK,CAAC,QAAQ,QAAQ;GAAE;GAAQ,OAAO,EAAE;GAAG,OAAO,EAAE;GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;EAAE,EAAE,CAAC,CACtF,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CACjC,MAAM,GAAG,CACqC;CAAE;AACrD;AAqCA,SAAgB,cACd,SACqB;CACrB,MAAM,IAAI,QAAQ;CAClB,IAAI,IAAI,GAAG,OAAO;EAAE,SAAS;EAAK;CAAE;CACpC,OAAO;EACL,SAAS,SACP,QAAQ,KAAK,MAAM,EAAE,SAAS,GAC9B,QAAQ,KAAK,MAAM,EAAE,KAAK,CAC5B;EACA;CACF;AACF;;AAmCA,SAAS,cAAc,GAAa,GAAqB;CACvD,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,OAAO;CACpD,MAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;CAE/B,MAAM,IADM,KAAK,IAAI,GAAG,GAAG,GAAG,CAClB,IAAI,MAAM;CACtB,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,WAAuB,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;CACjF,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,MAAM,SAAS;EACrB,IAAI,OAAO,IAAI,OAAO,KAAK;EAC3B,QAAQ,GAAG;EACX,QAAQ,GAAG;CACb;CACA,IAAI,MAAM;CACV,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;EACpC,MAAM,WAAY,QAAQ,KAAK,QAAQ,KAAM,EAAE;EAC/C,OAAO,IAAI,SAAS,EAAE,CAAE;EACxB,OAAO,IAAI;CACb;CAEF,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO,IAAI,MAAM;AACnB;;;;;;;;AAqEA,SAAgB,oBACd,QACA,OAAmC,CAAC,GACf;CACrB,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,UAAU,KAAK,WAAW;CAChC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,UAAU,KAAK,WAAW;CAEhC,MAAM,SAAS,OAAO,QAAQ,QAAQ,IAAI,UAAU,KAAK,IAAI,OAAO,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC;CAC7F,MAAM,SAAS,OAAO,EAAE,EAAE,UAAU;CAEpC,MAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI,WAAW,MAAM;CAC1D,MAAM,SAAS,MAAM;CAErB,IAAI,SAAS,KAAK,SAAS,GACzB,OAAO;EACL,eAAe;EACf,KAAK;EACL,SAAS;EACT,UAAU;EACV,IAAI;GAAE,KAAK,CAAC,KAAK,GAAG;GAAG,eAAe,CAAC,KAAK,GAAG;EAAE;EACjD,GAAG;EACH;CACF;CAGF,MAAM,QAAQ,wBAAwB,OAAO,OAAO;CACpD,MAAM,MAAM,MAAM,KAAK;CACvB,MAAM,UAAU,YAAY,OAAO,QAAQ;CAC3C,MAAM,WAAW,YAAY,OAAO,SAAS;CAE7C,MAAM,QAA0B,CAAC,KAAK,GAAG;CACzC,MAAM,UAA4B,CAAC,KAAK,GAAG;CAC3C,IAAI,YAAY,GAAG;EACjB,MAAM,MAAM,WAAW,IAAI;EAC3B,MAAM,OAAiB,CAAC;EACxB,MAAM,SAAmB,CAAC;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,SAAqB,IAAI,MAAM,MAAM;GAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,OAAO,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM;GAE7C,MAAM,OAAO,MAAM,MAAM;GACzB,MAAM,KAAK,wBAAwB,QAAQ,OAAO;GAClD,IAAI,OAAO,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;GACzC,IAAI,OAAO,SAAS,EAAE,GAAG,OAAO,KAAK,EAAE;EACzC;EACA,MAAM,CAAC,IAAI,MAAM,iBAAiB,OAAO;EACzC,IAAI,KAAK,SAAS,GAAG;GACnB,KAAK,MAAM,GAAG,MAAM,IAAI,CAAC;GACzB,MAAM,KAAK,SAAS,MAAM,EAAE;GAC5B,MAAM,KAAK,SAAS,MAAM,EAAE;EAC9B;EACA,IAAI,OAAO,SAAS,GAAG;GACrB,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;GAC3B,QAAQ,KAAK,SAAS,QAAQ,EAAE;GAChC,QAAQ,KAAK,SAAS,QAAQ,EAAE;EAClC;CACF;CAEA,OAAO;EACL,eAAe;EACf;EACA;EACA;EACA,IAAI;GAAE,KAAK;GAAO,eAAe;EAAQ;EACzC,GAAG;EACH;CACF;AACF;;;;;AAkBA,SAAgB,yBACd,QACA,WACA,OAAmC,CAAC,GACP;CAC7B,MAAM,OAAO,eAAe,QAAQ,SAAS;CAC7C,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,OAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,GACzB,IAAI,OAAO,SAAS,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;CAEhD,MAAM,YAAY,oBAAoB,MAAM,IAAI;CAChD,OAAO;EACL,GAAG;EACH,yBAAyB,UAAU;EACnC,KAAK,UAAU;EACf,UAAU,UAAU;EACpB,IAAI,UAAU;CAChB;AACF;;;;;;;;;;;;;AAgBA,SAAS,wBAAwB,MAAkB,QAAwC;CACzF,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,MAAM,SAAS,KAAK,EAAE,CAAE;CACxB,IAAI,SAAS,GAAG,OAAO;CACvB,MAAM,MACJ,WAAW,YACN,GAAW,MAAc,KAAK,IAAI,IAAI,CAAC,KACvC,GAAW,OAAe,IAAI,MAAM;CAC3C,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,KAAK,GAAG,KAAK,QAAQ,MAC5B,KAAK,IAAI,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;EACvC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,EAAE;EACZ,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EACnD,OAAO;EAEP,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EAErD,OAAO,IAAI;EACX,IAAI,QAAQ,GAGV,OAAO,QAAQ,IAAI,IAAI;OAEvB,OAAO,IAAI,MAAM;EAEnB;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;;;;;;;;;AAUA,SAAS,MAAM,MAA0B;CACvC,MAAM,IAAI,KAAK;CACf,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,IAAI,KAAK,EAAE,CAAE;CACnB,IAAI,IAAI,GAAG,OAAO;CAGlB,MAAM,WAAW,KAAK,KAAK,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC;CAErE,MAAM,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,KAAK,EAAE,CAAE;EAC1C,SAAS,KAAK,IAAI;CACpB;CAEA,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,SAAS,SAAS;CAC9C,SAAS;CAET,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,KAAK,EAAE,CAAE,KAAM,UAAU;CAE/D,MAAM,MAAM,MAAM,MAAM;CAExB,MAAM,MAAM,IAAI;CAChB,MAAM,MAAM,IAAI;CAChB,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM;CAElC,MAAM,QAAQ,OAAO,IAAI,KAAK,MAAO,KAAK,MAAM,OAAQ;CACxD,IAAI,UAAU,GAGZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI;CAEtC,QAAQ,MAAM,OAAO;AACvB;;AAGA,SAAS,YAAY,MAAkB,IAAkD;CACvF,MAAM,IAAI,KAAK,EAAE,EAAE,UAAU;CAC7B,IAAI,IAAI,GAAG,OAAO;CAClB,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAG9B,MAAM,IAAI,GAFA,KAAK,KAAK,QAAQ,IAAI,EAEnB,GADH,KAAK,KAAK,QAAQ,IAAI,EAChB,CAAC;EACjB,IAAI,OAAO,SAAS,CAAC,GAAG;GACtB,OAAO;GACP;EACF;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;;AAGA,SAAS,WAAW,MAA4B;CAC9C,IAAI,IAAI,SAAS;CACjB,aAAa;EACX,IAAK,IAAI,eAAgB;EACzB,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;AAEA,SAAS,iBAAiB,SAAmC;CAC3D,MAAM,QAAQ,IAAI,WAAW;CAC7B,OAAO,CAAC,MAAM,IAAI,IAAI;AACxB;;AAGA,SAAS,SAAS,QAAkB,GAAmB;CACrD,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO;CACvC,MAAM,MAAM,KAAK,OAAO,SAAS;CACjC,MAAM,KAAK,KAAK,MAAM,GAAG;CACzB,MAAM,KAAK,KAAK,KAAK,GAAG;CACxB,IAAI,OAAO,IAAI,OAAO,OAAO;CAC7B,MAAM,OAAO,MAAM;CACnB,OAAO,OAAO,OAAQ,IAAI,QAAQ,OAAO,MAAO;AAClD"}
+{"version":3,"file":"judge-calibration-zZjLz8hr.js","names":[],"sources":["../src/judge-calibration.ts"],"sourcesContent":["/**\n * Judge calibration — measure judge quality against human gold + bias.\n *\n * Workflow:\n *   1. Build a golden set: {itemId, humanScore}[].\n *   2. Run candidate judges; each produces {itemId, score}.\n *   3. `calibrateJudge(golden, candidate)` reports κ + Pearson + MAE.\n *   4. `calibrateJudgeContinuous(golden, candidate)` adds quadratic-weighted\n *      κ over the un-rounded [0,1] scores plus ICC(2,1), Pearson, Spearman,\n *      and bootstrap CIs — use this for fine-grained judges where rounding\n *      to int discards information (e.g. 0.78 vs 0.81 both round to 1 and\n *      look \"perfectly agreed\" to integer κ).\n *   5. Run bias probes (positional, verbosity, self-preference) to\n *      detect systematic score inflation.\n *   6. For N≥2 judges on the same items, `continuousAgreement(scores)`\n *      reports ICC(2,1) + κ_w + Pearson + Spearman with bootstrap CIs.\n *\n * Returns actionable diagnostics, not a single number. Consumers then\n * decide whether to trust the judge, retrain it, or add a tie-breaker.\n */\n\nimport { pearsonR, spearmanR } from './statistics/descriptive'\n\nexport interface GoldenItem {\n  itemId: string\n  humanScore: number\n  /** Optional group used for per-group bias audits (e.g. model-of-output family). */\n  group?: string\n}\n\nexport interface CandidateScore {\n  itemId: string\n  score: number\n  /** Optional — enables positional-bias analysis (did order matter?). */\n  positionOfAInput?: 'first' | 'second'\n}\n\nexport interface CalibrationResult {\n  n: number\n  pearson: number\n  /** Cohen's κ with quadratic weights over integer-rounded scores. */\n  kappa: number\n  /** Mean absolute error vs human. */\n  mae: number\n  /** Worst-5 miscalibrations (largest |judge - human|). */\n  worstItems: Array<{ itemId: string; judge: number; human: number; delta: number }>\n}\n\n/**\n * Measure judge quality against human gold labels: computes Cohen's κ, Pearson correlation, and MAE over matched item ids.\n */\nexport function calibrateJudge(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n): CalibrationResult {\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const common = [...map.values()].filter((v) => Number.isFinite(v.j))\n  const n = common.length\n  if (n < 2) {\n    return { n, pearson: NaN, kappa: NaN, mae: NaN, worstItems: [] }\n  }\n  const humans = common.map((c) => c.h)\n  const judges = common.map((c) => c.j)\n  const pearson = pearsonR(humans, judges)\n  const kappa = weightedKappa(humans.map(Math.round), judges.map(Math.round))\n  const absDiffs = common.map((c) => Math.abs(c.j - c.h))\n  const mae = absDiffs.reduce((a, b) => a + b, 0) / n\n  const worst = [...map.entries()]\n    .filter(([, v]) => Number.isFinite(v.j))\n    .map(([itemId, v]) => ({ itemId, judge: v.j, human: v.h, delta: Math.abs(v.j - v.h) }))\n    .sort((a, b) => b.delta - a.delta)\n    .slice(0, 5)\n  return { n, pearson, kappa, mae, worstItems: worst }\n}\n\nexport interface PositionalBiasResult {\n  /**\n   * Score delta (first-position - second-position) averaged across items\n   * presented in both positions. Non-zero = positional bias.\n   */\n  avgDelta: number\n  n: number\n}\n\n/**\n * Feed the same items to the judge twice with A/B swapped and pass all\n * results here. Items that don't appear in both positions are ignored.\n */\nexport function positionalBias(scores: CandidateScore[]): PositionalBiasResult {\n  const pairs = new Map<string, { first?: number; second?: number }>()\n  for (const s of scores) {\n    const slot = pairs.get(s.itemId) ?? {}\n    if (s.positionOfAInput === 'first') slot.first = s.score\n    else if (s.positionOfAInput === 'second') slot.second = s.score\n    pairs.set(s.itemId, slot)\n  }\n  const deltas: number[] = []\n  for (const { first, second } of pairs.values()) {\n    if (first !== undefined && second !== undefined) deltas.push(first - second)\n  }\n  if (deltas.length === 0) return { avgDelta: 0, n: 0 }\n  return { avgDelta: deltas.reduce((a, b) => a + b, 0) / deltas.length, n: deltas.length }\n}\n\nexport interface VerbosityBiasResult {\n  /** Pearson correlation between output length and score. Strong positive = verbosity bias. */\n  pearson: number\n  n: number\n}\n\nexport function verbosityBias(\n  samples: Array<{ outputLen: number; score: number }>,\n): VerbosityBiasResult {\n  const n = samples.length\n  if (n < 3) return { pearson: NaN, n }\n  return {\n    pearson: pearsonR(\n      samples.map((s) => s.outputLen),\n      samples.map((s) => s.score),\n    ),\n    n,\n  }\n}\n\nexport interface SelfPreferenceResult {\n  /** Mean judge score when judge's family matches output's family. */\n  inFamilyMean: number\n  outOfFamilyMean: number\n  deltaMean: number\n  n: number\n}\n\n/**\n * Pass the same scenarios scored with judge-model X grading outputs from\n * model X (in-family) and model Y (out-of-family). Non-zero delta\n * indicates self-preference.\n */\nexport function selfPreference(\n  samples: Array<{ score: number; inFamily: boolean }>,\n): SelfPreferenceResult {\n  const inF = samples.filter((s) => s.inFamily).map((s) => s.score)\n  const outF = samples.filter((s) => !s.inFamily).map((s) => s.score)\n  if (inF.length === 0 || outF.length === 0)\n    return { inFamilyMean: 0, outOfFamilyMean: 0, deltaMean: 0, n: 0 }\n  const inMean = inF.reduce((a, b) => a + b, 0) / inF.length\n  const outMean = outF.reduce((a, b) => a + b, 0) / outF.length\n  return {\n    inFamilyMean: inMean,\n    outOfFamilyMean: outMean,\n    deltaMean: inMean - outMean,\n    n: samples.length,\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\n/** Quadratic weighted Cohen's κ over bounded integer scores. */\nfunction weightedKappa(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length === 0) return NaN\n  const min = Math.min(...a, ...b)\n  const max = Math.max(...a, ...b)\n  const K = max - min + 1\n  if (K < 2) return 1\n  const observed: number[][] = Array.from({ length: K }, () => new Array(K).fill(0))\n  const rowMarg = new Array(K).fill(0)\n  const colMarg = new Array(K).fill(0)\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i]! - min\n    const bi = b[i]! - min\n    const row = observed[ai]!\n    row[bi] = (row[bi] ?? 0) + 1\n    rowMarg[ai]++\n    colMarg[bi]++\n  }\n  let num = 0\n  let den = 0\n  for (let i = 0; i < K; i++) {\n    for (let j = 0; j < K; j++) {\n      const w = (i - j) ** 2 / (K - 1) ** 2\n      const expected = (rowMarg[i] * colMarg[j]) / a.length\n      num += w * observed[i]![j]!\n      den += w * expected\n    }\n  }\n  if (den === 0) return 1\n  return 1 - num / den\n}\n\n// ── Continuous-value inter-rater agreement ──────────────────────────\n//\n// `weightedKappa` above quantises to integers. For [0,1] judges that is\n// lossy: 0.78 and 0.81 both round to 1 and look identical to integer κ.\n// `continuousAgreement` keeps the original magnitudes:\n//\n//   - κ_w   : Cohen's weighted κ generalised to continuous scores. For two\n//             raters, weighted κ = 1 − Σ w_ij·o_ij / Σ w_ij·e_ij collapses\n//             into the closed form below when each \"category\" is the score\n//             itself (Janson & Olsson 2001; Cohen 1968 quadratic weights).\n//   - ICC   : Intraclass Correlation Coefficient, ICC(2,1) per Shrout &\n//             Fleiss (1979) — two-way random effects, absolute agreement,\n//             single rater. The right reliability coefficient when judges\n//             are a random sample of the judge population.\n//   - r, ρ  : Pearson + Spearman for sanity-check. Pearson catches linear\n//             association regardless of scale; Spearman catches monotone\n//             association regardless of distribution.\n//   - CIs   : Bootstrap percentile CIs over items (rows). Bias is preserved\n//             because we resample the full row, i.e. a judge's vector\n//             stays internally consistent within each bootstrap replicate.\n//\n// References:\n//   - Shrout, P. E. & Fleiss, J. L. (1979). Intraclass correlations: uses\n//     in assessing rater reliability. Psychological Bulletin, 86(2), 420.\n//   - McGraw, K. O. & Wong, S. P. (1996). Forming inferences about some\n//     intraclass correlation coefficients. Psychological Methods, 1, 30.\n//   - Janson, H. & Olsson, U. (2001). A measure of agreement for interval\n//     or nominal multivariate observations. Educ. Psychol. Meas., 61, 277.\n\nexport interface ContinuousAgreement {\n  /** Cohen's κ_w with quadratic weights, computed on raw [0,1] scores. */\n  weightedKappa: number\n  /** ICC(2,1): two-way random effects, absolute agreement, single rater. */\n  icc: number\n  /** Pearson product-moment correlation (averaged over rater pairs if N>2). */\n  pearson: number\n  /** Spearman rank correlation (averaged over rater pairs if N>2). */\n  spearman: number\n  /** 95% bootstrap percentile CIs over items. */\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n  /** Number of complete items (no NaN across raters). */\n  n: number\n  /** Number of raters. */\n  raters: number\n}\n\nexport interface ContinuousAgreementOptions {\n  /** Bootstrap iterations. Default 1000. Set to 0 to skip CIs (CI = [NaN, NaN]). */\n  bootstrap?: number\n  /** κ weighting scheme. Default 'quadratic'. */\n  weights?: 'linear' | 'quadratic'\n  /** PRNG seed for reproducible bootstrap. Default 0xC0FFEE. */\n  seed?: number\n  /** Confidence level for percentile CI. Default 0.95. */\n  ciLevel?: number\n}\n\n/**\n * Inter-rater agreement on continuous (typically [0,1]) scores.\n *\n * `scores` has shape [n_items][n_raters]. Rows with any non-finite entry\n * are dropped. Returns NaN metrics if fewer than 2 raters or 2 complete\n * items remain.\n */\nexport function continuousAgreement(\n  scores: number[][],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousAgreement {\n  const bootstrap = opts.bootstrap ?? 1000\n  const weights = opts.weights ?? 'quadratic'\n  const seed = opts.seed ?? 0xc0ffee\n  const ciLevel = opts.ciLevel ?? 0.95\n\n  const matrix = scores.filter((row) => row.length >= 2 && row.every((v) => Number.isFinite(v)))\n  const raters = matrix[0]?.length ?? 0\n  // All rows must have the same rater count, else drop the offenders.\n  const clean = matrix.filter((row) => row.length === raters)\n  const nClean = clean.length\n\n  if (nClean < 2 || raters < 2) {\n    return {\n      weightedKappa: NaN,\n      icc: NaN,\n      pearson: NaN,\n      spearman: NaN,\n      ci: { icc: [NaN, NaN], weightedKappa: [NaN, NaN] },\n      n: nClean,\n      raters,\n    }\n  }\n\n  const kappa = continuousWeightedKappa(clean, weights)\n  const icc = icc21(clean)\n  const pearson = avgPairwise(clean, pearsonR)\n  const spearman = avgPairwise(clean, spearmanR)\n\n  const ciIcc: [number, number] = [NaN, NaN]\n  const ciKappa: [number, number] = [NaN, NaN]\n  if (bootstrap > 0) {\n    const rng = mulberry32(seed)\n    const iccs: number[] = []\n    const kappas: number[] = []\n    for (let b = 0; b < bootstrap; b++) {\n      const sample: number[][] = new Array(nClean)\n      for (let i = 0; i < nClean; i++) {\n        sample[i] = clean[Math.floor(rng() * nClean)]!\n      }\n      const iccB = icc21(sample)\n      const kB = continuousWeightedKappa(sample, weights)\n      if (Number.isFinite(iccB)) iccs.push(iccB)\n      if (Number.isFinite(kB)) kappas.push(kB)\n    }\n    const [lo, hi] = percentileBounds(ciLevel)\n    if (iccs.length > 0) {\n      iccs.sort((a, b) => a - b)\n      ciIcc[0] = quantile(iccs, lo)\n      ciIcc[1] = quantile(iccs, hi)\n    }\n    if (kappas.length > 0) {\n      kappas.sort((a, b) => a - b)\n      ciKappa[0] = quantile(kappas, lo)\n      ciKappa[1] = quantile(kappas, hi)\n    }\n  }\n\n  return {\n    weightedKappa: kappa,\n    icc,\n    pearson,\n    spearman,\n    ci: { icc: ciIcc, weightedKappa: ciKappa },\n    n: nClean,\n    raters,\n  }\n}\n\nexport interface ContinuousCalibrationResult extends CalibrationResult {\n  /** Cohen's κ_w computed on raw (un-rounded) scores. */\n  weightedKappaContinuous: number\n  /** ICC(2,1) treating golden + candidate as two raters. */\n  icc: number\n  spearman: number\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n}\n\n/**\n * Extends `calibrateJudge` with continuous-value agreement metrics while\n * retaining its base calibration summary.\n */\nexport function calibrateJudgeContinuous(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousCalibrationResult {\n  const base = calibrateJudge(golden, candidate)\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const rows: number[][] = []\n  for (const v of map.values()) {\n    if (Number.isFinite(v.j)) rows.push([v.h, v.j])\n  }\n  const agreement = continuousAgreement(rows, opts)\n  return {\n    ...base,\n    weightedKappaContinuous: agreement.weightedKappa,\n    icc: agreement.icc,\n    spearman: agreement.spearman,\n    ci: agreement.ci,\n  }\n}\n\n// ── Continuous-agreement internals ──────────────────────────────────\n\n/**\n * Quadratic-weighted κ on continuous scores. With weights w(x,y) = (x-y)^2\n * (or |x-y| for linear) the formula collapses to:\n *\n *   κ_w = 1 − E_obs[w] / E_exp[w]\n *\n * where E_obs averages w over paired (a_i, b_i) and E_exp averages w over\n * the independent product distribution (sum_{i,j} w(a_i, b_j) / n^2).\n * The normalisation by (max-min)^2 in the integer version cancels in the\n * ratio, so we don't need it here. Generalises to N raters by averaging κ_w\n * over all rater pairs (mean pairwise weighted agreement).\n */\nfunction continuousWeightedKappa(rows: number[][], scheme: 'linear' | 'quadratic'): number {\n  if (rows.length === 0) return NaN\n  const raters = rows[0]!.length\n  if (raters < 2) return NaN\n  const wFn =\n    scheme === 'linear'\n      ? (x: number, y: number) => Math.abs(x - y)\n      : (x: number, y: number) => (x - y) ** 2\n  let sum = 0\n  let pairs = 0\n  for (let r1 = 0; r1 < raters; r1++) {\n    for (let r2 = r1 + 1; r2 < raters; r2++) {\n      const a = rows.map((row) => row[r1]!)\n      const b = rows.map((row) => row[r2]!)\n      const n = a.length\n      let obs = 0\n      for (let i = 0; i < n; i++) obs += wFn(a[i]!, b[i]!)\n      obs /= n\n      // Expected under independence: average of w over all i,j cross pairs.\n      let exp = 0\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) exp += wFn(a[i]!, b[j]!)\n      }\n      exp /= n * n\n      if (exp === 0) {\n        // Degenerate: at least one rater is constant. Convention: perfect\n        // agreement iff observed disagreement is also zero, else 0.\n        sum += obs === 0 ? 1 : 0\n      } else {\n        sum += 1 - obs / exp\n      }\n      pairs++\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/**\n * ICC(2,1) — two-way random effects, absolute agreement, single rater.\n *\n *   ICC(2,1) = (MSR − MSE) / (MSR + (k−1)·MSE + k·(MSC − MSE)/n)\n *\n * where MSR = between-rows MS, MSC = between-columns MS, MSE = residual MS,\n * n = rows (items), k = columns (raters).\n */\nfunction icc21(rows: number[][]): number {\n  const n = rows.length\n  if (n < 2) return NaN\n  const k = rows[0]!.length\n  if (k < 2) return NaN\n\n  // Row means.\n  const rowMeans = rows.map((row) => row.reduce((s, v) => s + v, 0) / k)\n  // Column means.\n  const colMeans = new Array(k).fill(0)\n  for (let j = 0; j < k; j++) {\n    let s = 0\n    for (let i = 0; i < n; i++) s += rows[i]![j]!\n    colMeans[j] = s / n\n  }\n  // Grand mean.\n  let grand = 0\n  for (let i = 0; i < n; i++) grand += rowMeans[i]!\n  grand /= n\n\n  let ssR = 0\n  for (let i = 0; i < n; i++) ssR += (rowMeans[i]! - grand) ** 2\n  ssR *= k\n  let ssC = 0\n  for (let j = 0; j < k; j++) ssC += (colMeans[j]! - grand) ** 2\n  ssC *= n\n  let ssT = 0\n  for (let i = 0; i < n; i++) {\n    for (let j = 0; j < k; j++) ssT += (rows[i]![j]! - grand) ** 2\n  }\n  const ssE = ssT - ssR - ssC\n\n  const dfR = n - 1\n  const dfC = k - 1\n  const dfE = (n - 1) * (k - 1)\n  const msR = ssR / dfR\n  const msC = ssC / dfC\n  const msE = dfE > 0 ? ssE / dfE : 0\n\n  const denom = msR + (k - 1) * msE + (k * (msC - msE)) / n\n  if (denom === 0) {\n    // Degenerate (all values equal): convention = 1 if rows identical,\n    // else 0. Identical rows ⇒ msR = 0 too, so msR − msE near 0.\n    return msR === 0 && msE === 0 ? 1 : 0\n  }\n  return (msR - msE) / denom\n}\n\n/** Average pairwise statistic over all rater pairs. */\nfunction avgPairwise(rows: number[][], fn: (a: number[], b: number[]) => number): number {\n  const k = rows[0]?.length ?? 0\n  if (k < 2) return NaN\n  let sum = 0\n  let pairs = 0\n  for (let i = 0; i < k; i++) {\n    for (let j = i + 1; j < k; j++) {\n      const a = rows.map((row) => row[i]!)\n      const b = rows.map((row) => row[j]!)\n      const r = fn(a, b)\n      if (Number.isFinite(r)) {\n        sum += r\n        pairs++\n      }\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/** Seeded PRNG — Mulberry32. Deterministic across platforms. */\nfunction mulberry32(seed: number): () => number {\n  let a = seed >>> 0\n  return () => {\n    a = (a + 0x6d2b79f5) >>> 0\n    let t = a\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\nfunction percentileBounds(ciLevel: number): [number, number] {\n  const tail = (1 - ciLevel) / 2\n  return [tail, 1 - tail]\n}\n\n/** Linear-interpolated quantile of a pre-sorted ascending array. */\nfunction quantile(sorted: number[], q: number): number {\n  if (sorted.length === 0) return NaN\n  if (sorted.length === 1) return sorted[0]!\n  const pos = q * (sorted.length - 1)\n  const lo = Math.floor(pos)\n  const hi = Math.ceil(pos)\n  if (lo === hi) return sorted[lo]!\n  const frac = pos - lo\n  return sorted[lo]! * (1 - frac) + sorted[hi]! * frac\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAmDA,SAAgB,eACd,QACA,WACmB;CACnB,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,SAAS,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC;CACnE,MAAM,IAAI,OAAO;CACjB,IAAI,IAAI,GACN,OAAO;EAAE;EAAG,SAAS;EAAK,OAAO;EAAK,KAAK;EAAK,YAAY,CAAC;CAAE;CAEjE,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CACpC,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CAUpC,OAAO;EAAE;EAAG,SATI,SAAS,QAAQ,MASf;EAAG,OARP,cAAc,OAAO,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,CAQhD;EAAG,KAPX,OAAO,KAAK,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAClC,CAAC,CAAC,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAMjB,YALnB,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,CAC7B,QAAQ,GAAG,OAAO,OAAO,SAAS,EAAE,CAAC,CAAC,CAAC,CACvC,KAAK,CAAC,QAAQ,QAAQ;GAAE;GAAQ,OAAO,EAAE;GAAG,OAAO,EAAE;GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;EAAE,EAAE,CAAC,CACtF,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CACjC,MAAM,GAAG,CACqC;CAAE;AACrD;AAqCA,SAAgB,cACd,SACqB;CACrB,MAAM,IAAI,QAAQ;CAClB,IAAI,IAAI,GAAG,OAAO;EAAE,SAAS;EAAK;CAAE;CACpC,OAAO;EACL,SAAS,SACP,QAAQ,KAAK,MAAM,EAAE,SAAS,GAC9B,QAAQ,KAAK,MAAM,EAAE,KAAK,CAC5B;EACA;CACF;AACF;;AAmCA,SAAS,cAAc,GAAa,GAAqB;CACvD,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,OAAO;CACpD,MAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;CAE/B,MAAM,IADM,KAAK,IAAI,GAAG,GAAG,GAAG,CAClB,IAAI,MAAM;CACtB,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,WAAuB,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;CACjF,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,MAAM,SAAS;EACrB,IAAI,OAAO,IAAI,OAAO,KAAK;EAC3B,QAAQ,GAAG;EACX,QAAQ,GAAG;CACb;CACA,IAAI,MAAM;CACV,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;EACpC,MAAM,WAAY,QAAQ,KAAK,QAAQ,KAAM,EAAE;EAC/C,OAAO,IAAI,SAAS,EAAE,CAAE;EACxB,OAAO,IAAI;CACb;CAEF,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO,IAAI,MAAM;AACnB;;;;;;;;AAqEA,SAAgB,oBACd,QACA,OAAmC,CAAC,GACf;CACrB,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,UAAU,KAAK,WAAW;CAChC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,UAAU,KAAK,WAAW;CAEhC,MAAM,SAAS,OAAO,QAAQ,QAAQ,IAAI,UAAU,KAAK,IAAI,OAAO,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC;CAC7F,MAAM,SAAS,OAAO,EAAE,EAAE,UAAU;CAEpC,MAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI,WAAW,MAAM;CAC1D,MAAM,SAAS,MAAM;CAErB,IAAI,SAAS,KAAK,SAAS,GACzB,OAAO;EACL,eAAe;EACf,KAAK;EACL,SAAS;EACT,UAAU;EACV,IAAI;GAAE,KAAK,CAAC,KAAK,GAAG;GAAG,eAAe,CAAC,KAAK,GAAG;EAAE;EACjD,GAAG;EACH;CACF;CAGF,MAAM,QAAQ,wBAAwB,OAAO,OAAO;CACpD,MAAM,MAAM,MAAM,KAAK;CACvB,MAAM,UAAU,YAAY,OAAO,QAAQ;CAC3C,MAAM,WAAW,YAAY,OAAO,SAAS;CAE7C,MAAM,QAA0B,CAAC,KAAK,GAAG;CACzC,MAAM,UAA4B,CAAC,KAAK,GAAG;CAC3C,IAAI,YAAY,GAAG;EACjB,MAAM,MAAM,WAAW,IAAI;EAC3B,MAAM,OAAiB,CAAC;EACxB,MAAM,SAAmB,CAAC;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,SAAqB,IAAI,MAAM,MAAM;GAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,OAAO,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM;GAE7C,MAAM,OAAO,MAAM,MAAM;GACzB,MAAM,KAAK,wBAAwB,QAAQ,OAAO;GAClD,IAAI,OAAO,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;GACzC,IAAI,OAAO,SAAS,EAAE,GAAG,OAAO,KAAK,EAAE;EACzC;EACA,MAAM,CAAC,IAAI,MAAM,iBAAiB,OAAO;EACzC,IAAI,KAAK,SAAS,GAAG;GACnB,KAAK,MAAM,GAAG,MAAM,IAAI,CAAC;GACzB,MAAM,KAAK,SAAS,MAAM,EAAE;GAC5B,MAAM,KAAK,SAAS,MAAM,EAAE;EAC9B;EACA,IAAI,OAAO,SAAS,GAAG;GACrB,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;GAC3B,QAAQ,KAAK,SAAS,QAAQ,EAAE;GAChC,QAAQ,KAAK,SAAS,QAAQ,EAAE;EAClC;CACF;CAEA,OAAO;EACL,eAAe;EACf;EACA;EACA;EACA,IAAI;GAAE,KAAK;GAAO,eAAe;EAAQ;EACzC,GAAG;EACH;CACF;AACF;;;;;AAkBA,SAAgB,yBACd,QACA,WACA,OAAmC,CAAC,GACP;CAC7B,MAAM,OAAO,eAAe,QAAQ,SAAS;CAC7C,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,OAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,GACzB,IAAI,OAAO,SAAS,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;CAEhD,MAAM,YAAY,oBAAoB,MAAM,IAAI;CAChD,OAAO;EACL,GAAG;EACH,yBAAyB,UAAU;EACnC,KAAK,UAAU;EACf,UAAU,UAAU;EACpB,IAAI,UAAU;CAChB;AACF;;;;;;;;;;;;;AAgBA,SAAS,wBAAwB,MAAkB,QAAwC;CACzF,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,MAAM,SAAS,KAAK,EAAE,CAAE;CACxB,IAAI,SAAS,GAAG,OAAO;CACvB,MAAM,MACJ,WAAW,YACN,GAAW,MAAc,KAAK,IAAI,IAAI,CAAC,KACvC,GAAW,OAAe,IAAI,MAAM;CAC3C,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,KAAK,GAAG,KAAK,QAAQ,MAC5B,KAAK,IAAI,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;EACvC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,EAAE;EACZ,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EACnD,OAAO;EAEP,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EAErD,OAAO,IAAI;EACX,IAAI,QAAQ,GAGV,OAAO,QAAQ,IAAI,IAAI;OAEvB,OAAO,IAAI,MAAM;EAEnB;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;;;;;;;;;AAUA,SAAS,MAAM,MAA0B;CACvC,MAAM,IAAI,KAAK;CACf,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,IAAI,KAAK,EAAE,CAAE;CACnB,IAAI,IAAI,GAAG,OAAO;CAGlB,MAAM,WAAW,KAAK,KAAK,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC;CAErE,MAAM,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,KAAK,EAAE,CAAE;EAC1C,SAAS,KAAK,IAAI;CACpB;CAEA,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,SAAS,SAAS;CAC9C,SAAS;CAET,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,KAAK,EAAE,CAAE,KAAM,UAAU;CAE/D,MAAM,MAAM,MAAM,MAAM;CAExB,MAAM,MAAM,IAAI;CAChB,MAAM,MAAM,IAAI;CAChB,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM;CAElC,MAAM,QAAQ,OAAO,IAAI,KAAK,MAAO,KAAK,MAAM,OAAQ;CACxD,IAAI,UAAU,GAGZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI;CAEtC,QAAQ,MAAM,OAAO;AACvB;;AAGA,SAAS,YAAY,MAAkB,IAAkD;CACvF,MAAM,IAAI,KAAK,EAAE,EAAE,UAAU;CAC7B,IAAI,IAAI,GAAG,OAAO;CAClB,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAG9B,MAAM,IAAI,GAFA,KAAK,KAAK,QAAQ,IAAI,EAEnB,GADH,KAAK,KAAK,QAAQ,IAAI,EAChB,CAAC;EACjB,IAAI,OAAO,SAAS,CAAC,GAAG;GACtB,OAAO;GACP;EACF;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;;AAGA,SAAS,WAAW,MAA4B;CAC9C,IAAI,IAAI,SAAS;CACjB,aAAa;EACX,IAAK,IAAI,eAAgB;EACzB,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;AAEA,SAAS,iBAAiB,SAAmC;CAC3D,MAAM,QAAQ,IAAI,WAAW;CAC7B,OAAO,CAAC,MAAM,IAAI,IAAI;AACxB;;AAGA,SAAS,SAAS,QAAkB,GAAmB;CACrD,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO;CACvC,MAAM,MAAM,KAAK,OAAO,SAAS;CACjC,MAAM,KAAK,KAAK,MAAM,GAAG;CACzB,MAAM,KAAK,KAAK,KAAK,GAAG;CACxB,IAAI,OAAO,IAAI,OAAO,OAAO;CAC7B,MAAM,OAAO,MAAM;CACnB,OAAO,OAAO,OAAQ,IAAI,QAAQ,OAAO,MAAO;AAClD"}

package/dist/{llm-judge-CVq33oz1.js → llm-judge-BqqMS8t7.js}

@@ -1,12 +1,12 @@
 import { i as JudgeError, s as ValidationError, t as AgentEvalError } from "./errors-Dngq5h35.js";
-import { o as weightedComposite, t as confidenceInterval } from "./descriptive-B5MwKfbf.js";
+import { s as weightedComposite, t as confidenceInterval } from "./descriptive-jDOuI6mz.js";
 import { r as pairedBootstrap } from "./paired-tests-BHIhYVdu.js";
 import { n as contentHash, t as canonicalJson } from "./verdict-cache-mZf5FEiY.js";
-import { a as campaignCellCostProvenance, o as campaignCellExecutionEvidence, t as detectRewardHacking, u as projectCampaignCellQuality } from "./reward-hacking-DKI9T52l.js";
+import { a as campaignCellCostProvenance, o as campaignCellExecutionEvidence, t as detectRewardHacking, u as projectCampaignCellQuality } from "./reward-hacking-C0x0xihA.js";
 import { i as CostLedger, t as CostAccountingIncompleteError } from "./cost-ledger-B1qx30B4.js";
 import { u as mapConcurrent } from "./ledger-core-DTae9rv_.js";
 import { i as hashCanonical } from "./canonical-D-XsTQ6_.js";
-import { b as createRunCostLedger, h as isRecord, m as isExternalTextCandidate, x as fsCampaignStorage } from "./external-optimizer-subprocess-Dn90UqN2.js";
+import { b as createRunCostLedger, h as isRecord, m as isExternalTextCandidate, x as fsCampaignStorage } from "./external-optimizer-subprocess-CKNb42oM.js";
 import { t as DEFAULT_REDACTION_RULES } from "./redact-7Aq1ukl-.js";
 import { a as heldoutSignificance, i as dimensionRegressions, o as pairHoldout } from "./power-preflight-DEw-uC7q.js";
 import { a as combineAbortSignals, n as clamp01, r as assertProposalFindings } from "./run-score-lDzV0X8j.js";
@@ -5117,4 +5117,4 @@ function firstString(value) {
 //#endregion
 export { runEval as $, surfaceHash as A, campaignMeanComposite as B, optimizationTokenUsageFromSummary as C, componentSurfaceIdentityMaterial as D, codeSurfaceIdentityMaterial as E, assertSearchHistoryMatchesReplay as F, assertGepaCandidatePopulationSummary as G, buildReflectionPrompt as H, createSearchHistoryReceipt as I, DEFAULT_RED_TEAM_CORPUS as J, readGepaCandidatePopulationArtifact as K, searchHistoryCoverageRow as L, SEARCH_HISTORY_RECEIPT_SCHEMA_VERSION as M, SearchHistoryRequiredError as N, renderSurfaceDiff as O, assertCompleteSearchHistory as P, runCanaries as Q, verifySearchHistoryReceipt as R, costFromLedgerSummary as S, assertComponentSurface as T, parseReflectionResponse as U, compareRankKeys as V, recoverTruncatedJson as W, redTeamReport as X, redTeamDataset as Y, scoreRedTeamOutput as Z, paretoFrontier as _, canonicalDigest as a, assertRealBackend as at, combineComparisonCosts as b, loopProvenanceSpans as c, assertCampaignSplitIdentity as ct, verifyLoopProvenanceRecord as d, campaignSplitDigestFromIdentities as dt, runCampaign as et, runImprovementLoop as f, readCachedCell as ft, dominates as g, labelTrustRank as h, campaignMeasurementDigest as i, BackendIntegrityError as it, SEARCH_HISTORY_RECEIPT_DIGEST_ALGORITHM as j, surfaceContentHash as k, provenanceRecordPath as l, campaignScenarioIdentity as lt, isProposedCandidate as m, computeManifestHash as mt, JudgeParseError as n, resolveRunDir as nt, emitLoopProvenance as o, summarizeBackendIntegrity as ot, runOptimization as p, cellCachePath as pt, defaultProductionGate as q, buildLoopProvenanceRecord as r, tangleTracesRoot as rt, loopProvenanceArgsFromResult as s, assertCampaignDesign as st, llmJudge as t, planCampaignRun as tt, provenanceSpansPath as u, campaignSplitDigest as ut, openAutoPr as v, assertCodeSurfaceIdentity as w, compareOptimizationMethods as x, assertOptimizationResult as y, campaignBreakdown as z };
 
-//# sourceMappingURL=llm-judge-CVq33oz1.js.map
+//# sourceMappingURL=llm-judge-BqqMS8t7.js.map