@tangle-network/agent-eval 0.163.2 → 0.171.0

package/dist/{chat-client-DlMlAeYI.js.map → chat-client-DEtybj5i.js.map}

@@ -1 +1 @@
-{"version":3,"file":"chat-client-DlMlAeYI.js","names":["ANALYST_ID","ACTOR_PROMPT","ACTOR_PROMPT","ACTOR_PROMPT","ACTOR_PROMPT"],"sources":["../src/feedback-trajectory-review.ts","../src/trace-analyst/behavioral-metrics.ts","../src/analyst/behavioral-analyst.ts","../src/analyst/kinds/control-integrity.ts","../src/analyst/kinds/failure-mode.ts","../src/analyst/kinds/improvement.ts","../src/analyst/kinds/intent-divergence.ts","../src/analyst/kinds/knowledge-gap.ts","../src/analyst/kinds/knowledge-poisoning.ts","../src/analyst/kinds/index.ts","../src/analyst/registry.ts","../src/analyst/default-registry.ts","../src/analyst/chat-client.ts"],"sourcesContent":["import { type ExactAnalystRunResult, snapshotExactExecutionPlan } from './analyst/exact-types'\nimport type {\n  AnalystFinding,\n  AnalystRunResult,\n  AnalystUsageReceipt,\n  EvidenceRef,\n} from './analyst/types'\nimport { assertValidAnalystUsageReceipt } from './analyst/usage-receipt'\nimport type { FeedbackLabelSource, FeedbackTrajectory } from './feedback-trajectory'\nimport { canonicalString, hashCanonical } from './ledger-core/canonical'\nimport { deepFreezeCanonicalJson } from './ledger-core/deep-freeze'\n\nexport type AnalystReviewSource = Exclude<FeedbackLabelSource, 'system'>\nexport type AnalystFindingDigest = `sha256:${string}`\nexport type AnalystRunDigest = `sha256:${string}`\n\nexport interface AnalystMissedIssue {\n  id: string\n  reason: string\n  evidence?: EvidenceRef[]\n}\n\ninterface AnalystReviewDecisionBase {\n  runDigest: AnalystRunDigest\n  source: AnalystReviewSource\n  reviewerId: string\n  reviewId: string\n  reason: string\n  decidedAt: string\n}\n\nexport type AnalystReviewDecision =\n  | (AnalystReviewDecisionBase & {\n      findingId: string\n      findingDigest: AnalystFindingDigest\n      verdict: 'confirmed' | 'rejected'\n      missedIssues?: never\n    })\n  | (AnalystReviewDecisionBase & {\n      verdict: 'completeness_assessed'\n      missedIssues: AnalystMissedIssue[]\n      findingId?: never\n      findingDigest?: never\n    })\n\nexport interface AnalystReviewCounts {\n  emitted: number\n  confirmed: number\n  rejected: number\n  missed: number\n}\n\nexport interface AnalystReviewQuality {\n  precision: number\n  recall: number\n  f1: number\n  counts: AnalystReviewCounts\n}\n\nexport interface StoredAnalystReview {\n  runId: string\n  runDigest: AnalystRunDigest\n  findings: AnalystFinding[]\n  findingIds: string[]\n  analystIds: string[]\n  reviewDecisions: AnalystReviewDecision[]\n}\n\n/** Bind an analyst finding's complete canonical JSON content to a stable digest. */\nexport function analystFindingDigest(finding: AnalystFinding): AnalystFindingDigest {\n  return hashCanonical(snapshotAnalystFinding(finding, 'analyst finding'))\n}\n\n/** Bind the complete analyst result to one immutable review target. */\nexport function analystRunDigest(run: AnalystRunResult): AnalystRunDigest {\n  return hashCanonical(snapshotAnalystRun(run, 'analyst run'))\n}\n\nexport function snapshotAnalystRun(value: unknown, context = 'analyst run'): AnalystRunResult {\n  const snapshot = snapshotAnalystRunRecord(value, context)\n  if (snapshot.execution_plan !== undefined) {\n    return sealExactAnalystRunReceipt(snapshot, context)\n  }\n  if (snapshot.completion !== undefined) {\n    throw new TypeError(`${context} completion is valid only for an exact run`)\n  }\n  return snapshot as unknown as AnalystRunResult\n}\n\n/** Canonicalize, validate, and deeply freeze one complete or failed exact-run receipt. */\nexport function snapshotExactAnalystRunReceipt(\n  value: unknown,\n  context = 'exact analyst run receipt',\n): ExactAnalystRunResult {\n  return sealExactAnalystRunReceipt(snapshotAnalystRunRecord(value, context), context)\n}\n\nfunction snapshotAnalystRunRecord(value: unknown, context: string): Record<string, unknown> {\n  let snapshot: unknown\n  try {\n    snapshot = JSON.parse(canonicalString(value)) as unknown\n  } catch (cause) {\n    throw new TypeError(`${context} must have a canonical JSON representation`, { cause })\n  }\n  if (!isRecord(snapshot)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(\n    snapshot,\n    [\n      'run_id',\n      'correlation_id',\n      'started_at',\n      'ended_at',\n      'findings',\n      'per_analyst',\n      'total_cost_usd',\n      'total_cost_provenance',\n      'execution_plan',\n      'completion',\n    ],\n    context,\n  )\n  requiredString(snapshot.run_id, `${context} run_id`)\n  requiredString(snapshot.correlation_id, `${context} correlation_id`)\n  canonicalTimestamp(snapshot.started_at, `${context} started_at`)\n  canonicalTimestamp(snapshot.ended_at, `${context} ended_at`)\n  snapshot.findings = snapshotAnalystFindings(snapshot.findings, `${context} findings`)\n  if (!Array.isArray(snapshot.per_analyst)) {\n    throw new TypeError(`${context} per_analyst must be an array`)\n  }\n  for (const [index, summary] of snapshot.per_analyst.entries()) {\n    assertAnalystRunSummary(summary, `${context} per_analyst ${index}`)\n  }\n  if (\n    typeof snapshot.total_cost_usd !== 'number' ||\n    !Number.isFinite(snapshot.total_cost_usd) ||\n    snapshot.total_cost_usd < 0\n  ) {\n    throw new TypeError(`${context} total_cost_usd must be a finite non-negative number`)\n  }\n  if (snapshot.total_cost_provenance !== undefined) {\n    assertCostProvenance(snapshot.total_cost_provenance, `${context} total_cost_provenance`)\n  }\n  return snapshot\n}\n\nfunction assertAnalystRunSummary(value: unknown, context: string): void {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(\n    value,\n    [\n      'analyst_id',\n      'status',\n      'reason',\n      'findings_count',\n      'latency_ms',\n      'usage',\n      'allocated_budget_usd',\n      'error',\n    ],\n    context,\n  )\n  requiredString(value.analyst_id, `${context} analyst_id`)\n  if (value.status !== 'ok' && value.status !== 'skipped' && value.status !== 'failed') {\n    throw new TypeError(`${context} status is invalid`)\n  }\n  if (value.reason !== undefined) requiredString(value.reason, `${context} reason`)\n  if (value.status === 'skipped' && value.reason === undefined) {\n    throw new TypeError(`${context} skipped summary requires reason`)\n  }\n  nonnegativeSafeInteger(value.findings_count, `${context} findings_count`)\n  finiteNonnegative(value.latency_ms, `${context} latency_ms`)\n  assertAnalystUsageReceipt(value.usage, `${context} usage`)\n  if (value.allocated_budget_usd !== undefined && value.allocated_budget_usd !== null) {\n    finiteNonnegative(value.allocated_budget_usd, `${context} allocated_budget_usd`)\n  }\n  if (value.error !== undefined) {\n    if (value.status !== 'failed' || !isRecord(value.error)) {\n      throw new TypeError(`${context} error is valid only for failed summaries`)\n    }\n    assertOnlyKeys(value.error, ['class', 'message'], `${context} error`)\n    requiredString(value.error.class, `${context} error class`)\n    requiredString(value.error.message, `${context} error message`)\n  } else if (value.status === 'failed') {\n    throw new TypeError(`${context} failed summary requires error`)\n  }\n}\n\nfunction assertAnalystUsageReceipt(value: unknown, context: string): void {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(value, ['calls', 'tokens', 'cost', 'knownCostUsd'], context)\n  for (const field of ['calls', 'tokens', 'cost'] as const) {\n    if (!Object.hasOwn(value, field)) {\n      throw new TypeError(`${context} ${field} is required`)\n    }\n  }\n  if (value.tokens !== null) {\n    if (!isRecord(value.tokens)) throw new TypeError(`${context} tokens must be an object or null`)\n    assertOnlyKeys(\n      value.tokens,\n      ['input', 'output', 'reasoning', 'cached', 'cacheWrite'],\n      `${context} tokens`,\n    )\n  }\n  assertCostProvenance(value.cost, `${context} cost`)\n  assertValidAnalystUsageReceipt(value as unknown as AnalystUsageReceipt, context)\n}\n\nfunction assertCostProvenance(value: unknown, context: string): void {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(value, ['kind', 'usd'], context)\n  if (value.kind === 'uncaptured') {\n    if (value.usd !== null) throw new TypeError(`${context} uncaptured usd must be null`)\n    return\n  }\n  if (value.kind !== 'observed' && value.kind !== 'estimated') {\n    throw new TypeError(`${context} kind is invalid`)\n  }\n  finiteNonnegative(value.usd, `${context} usd`)\n}\n\nfunction sealExactAnalystRunReceipt(\n  run: Record<string, unknown>,\n  context: string,\n): ExactAnalystRunResult {\n  if (run.execution_plan === undefined) {\n    throw new TypeError(`${context} exact run requires execution_plan`)\n  }\n  const plan = snapshotExactExecutionPlan(run.execution_plan, `${context} execution_plan`)\n  const completion = snapshotExactRunCompletion(run.completion, `${context} completion`)\n  run.execution_plan = plan\n  run.completion = completion\n  const summaries = run.per_analyst as Array<{\n    analyst_id: string\n    status: 'ok' | 'skipped' | 'failed'\n    findings_count: number\n    usage: { cost: { kind: string; usd: number | null }; knownCostUsd?: number }\n    allocated_budget_usd?: number | null\n  }>\n  const findings = run.findings as AnalystFinding[]\n  const planned = plan.analysts.map((analyst) => analyst.id)\n  const completed = summaries.map((summary) => summary.analyst_id)\n  const ordered = completed.every((analystId, index) => analystId === planned[index])\n  if (!ordered || (completion.status === 'complete' && completed.length !== planned.length)) {\n    throw new TypeError(\n      completion.status === 'complete'\n        ? `${context} complete receipt must contain every execution_plan analyst in exact order`\n        : `${context} failed receipt per_analyst must be an execution_plan prefix`,\n    )\n  }\n  const completedIds = new Set(completed)\n  for (const finding of findings) {\n    if (!completedIds.has(finding.analyst_id)) {\n      throw new TypeError(`${context} finding names an analyst absent from per_analyst`)\n    }\n  }\n  for (const summary of summaries) {\n    const actual = findings.filter((finding) => finding.analyst_id === summary.analyst_id).length\n    if (summary.findings_count !== actual) {\n      throw new TypeError(\n        `${context} findings_count does not match findings for \"${summary.analyst_id}\"`,\n      )\n    }\n    const hasAllocation = Object.hasOwn(summary, 'allocated_budget_usd')\n    if (summary.status === 'skipped') {\n      if (hasAllocation) {\n        throw new TypeError(\n          `${context} skipped summary \"${summary.analyst_id}\" cannot report an allocated budget`,\n        )\n      }\n      continue\n    }\n    const allocation = summary.allocated_budget_usd\n    const validAllocation =\n      hasAllocation &&\n      (plan.policy.budget.kind === 'none'\n        ? allocation === null\n        : typeof allocation === 'number' &&\n          plan.policy.budget.allocations_usd[summary.analyst_id] !== null &&\n          plan.policy.budget.allocations_usd[summary.analyst_id] !== undefined &&\n          allocation <= plan.policy.budget.allocations_usd[summary.analyst_id]!)\n    if (!validAllocation) {\n      throw new TypeError(\n        `${context} summary \"${summary.analyst_id}\" allocation does not match its execution plan`,\n      )\n    }\n  }\n  let knownCost = 0\n  for (const summary of summaries) {\n    const amount =\n      summary.usage.cost.kind === 'uncaptured'\n        ? (summary.usage.knownCostUsd ?? 0)\n        : (summary.usage.cost.usd ?? 0)\n    knownCost = finiteNonnegative(knownCost + amount, `${context} aggregate known cost`)\n  }\n  if (run.total_cost_usd !== knownCost) {\n    throw new TypeError(`${context} total_cost_usd does not match per_analyst usage`)\n  }\n  if (run.total_cost_provenance === undefined) {\n    throw new TypeError(`${context} exact run requires total_cost_provenance`)\n  }\n  const costs = summaries.map((summary) => summary.usage.cost)\n  const expectedProvenance = costs.some((cost) => cost.kind === 'uncaptured')\n    ? { kind: 'uncaptured', usd: null }\n    : {\n        kind: costs.some((cost) => cost.kind === 'estimated') ? 'estimated' : 'observed',\n        usd: costs.reduce(\n          (sum, cost) =>\n            finiteNonnegative(sum + (cost.usd ?? 0), `${context} aggregate captured cost`),\n          0,\n        ),\n      }\n  if (hashCanonical(run.total_cost_provenance) !== hashCanonical(expectedProvenance)) {\n    throw new TypeError(`${context} total_cost_provenance does not match per_analyst usage`)\n  }\n  return deepFreezeCanonicalJson(run as unknown as ExactAnalystRunResult)\n}\n\nfunction snapshotExactRunCompletion(\n  value: unknown,\n  context: string,\n): ExactAnalystRunResult['completion'] {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  if (value.status === 'complete') {\n    assertOnlyKeys(value, ['status'], context)\n    return value as ExactAnalystRunResult['completion']\n  }\n  if (value.status !== 'failed') {\n    throw new TypeError(`${context} status must be complete or failed`)\n  }\n  assertOnlyKeys(value, ['status', 'error'], context)\n  if (!isRecord(value.error)) throw new TypeError(`${context} failed receipt requires error`)\n  assertOnlyKeys(value.error, ['class', 'message'], `${context} error`)\n  requiredString(value.error.class, `${context} error class`)\n  requiredString(value.error.message, `${context} error message`)\n  return value as unknown as ExactAnalystRunResult['completion']\n}\n\nfunction finiteNonnegative(value: unknown, context: string): number {\n  if (typeof value !== 'number' || !Number.isFinite(value) || value < 0) {\n    throw new TypeError(`${context} must be a non-negative finite number`)\n  }\n  return value\n}\n\nfunction nonnegativeSafeInteger(value: unknown, context: string): number {\n  if (!Number.isSafeInteger(value) || (value as number) < 0) {\n    throw new TypeError(`${context} must be a non-negative safe integer`)\n  }\n  return value as number\n}\n\nexport function snapshotAnalystFindings(\n  value: unknown,\n  context = 'analyst run findings',\n): AnalystFinding[] {\n  if (!Array.isArray(value)) {\n    throw new TypeError(`${context} must be an array`)\n  }\n  const findings = value.map((finding, index) =>\n    snapshotAnalystFinding(finding, `${context} finding ${index}`),\n  )\n  assertUniqueFindingIds(findings.map((finding) => finding.finding_id))\n  return findings\n}\n\nexport function readAnalystReview(trajectory: FeedbackTrajectory): StoredAnalystReview | undefined {\n  const analystAttempts = trajectory.attempts.filter(\n    (attempt) => isRecord(attempt.artifact) && attempt.artifact.type === 'analyst-run',\n  )\n  const analysis = isRecord(trajectory.metadata?.analysis)\n    ? trajectory.metadata.analysis\n    : undefined\n  if (analystAttempts.length === 0) {\n    if (analysis?.kind === 'analyst-run') {\n      throw new TypeError(\n        `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" is missing its archived run`,\n      )\n    }\n    return undefined\n  }\n  if (analystAttempts.length !== 1) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" must contain exactly one archived run`,\n    )\n  }\n  if (analysis?.kind !== 'analyst-run') {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" is missing review state`,\n    )\n  }\n\n  const artifact = analystAttempts[0]!.artifact\n  if (!isRecord(artifact)) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" has an invalid archived run`,\n    )\n  }\n  const runId = requiredString(\n    artifact.analystRunId,\n    `analyst trajectory \"${trajectory.id}\" run id`,\n  )\n  if (analysis.runId !== runId) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" run identity does not match its review state`,\n    )\n  }\n  const artifactRunDigest = requiredDigest(\n    artifact.runDigest,\n    `analyst trajectory \"${trajectory.id}\" archived run digest`,\n  )\n  const storedRunDigest = requiredDigest(\n    analysis.runDigest,\n    `analyst trajectory \"${trajectory.id}\" review run digest`,\n  )\n  if (artifactRunDigest !== storedRunDigest) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" run digest does not match its review state`,\n    )\n  }\n  const findings = snapshotAnalystFindings(\n    artifact.findings,\n    `analyst trajectory \"${trajectory.id}\"`,\n  )\n  const findingIds = findings.map((finding) => finding.finding_id)\n  const analystIds = stringArray(\n    artifact.analystIds,\n    `analyst trajectory \"${trajectory.id}\" analyst ids`,\n  )\n  const attemptMetadata = analystAttempts[0]!.metadata\n  if (!isRecord(attemptMetadata)) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" is missing archived run metadata`,\n    )\n  }\n  const archivedRun = snapshotAnalystRun(\n    {\n      run_id: runId,\n      correlation_id: artifact.correlationId,\n      started_at: analysis.startedAt,\n      ended_at: analysis.endedAt,\n      findings,\n      per_analyst: attemptMetadata.perAnalyst,\n      total_cost_usd: analysis.knownCostUsd,\n      ...(analysis.costProvenance === undefined\n        ? {}\n        : { total_cost_provenance: analysis.costProvenance }),\n      ...(artifact.executionPlan === undefined\n        ? {}\n        : {\n            execution_plan: artifact.executionPlan,\n            completion: artifact.completion,\n          }),\n    },\n    `analyst trajectory \"${trajectory.id}\" archived run`,\n  )\n  const knownAnalystIds = new Set(analystIds)\n  for (const [index, finding] of findings.entries()) {\n    if (!knownAnalystIds.has(finding.analyst_id)) {\n      throw new TypeError(\n        `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" omits generating analyst \"${finding.analyst_id}\" at finding ${index}`,\n      )\n    }\n  }\n  const reviewDecisions = validateAnalystReviewDecisions({\n    runId,\n    runDigest: storedRunDigest,\n    findings,\n    analystIds,\n    decisions: analysis.reviewDecisions,\n    requireComplete: true,\n  })\n  const expectedRunDigest = analystRunDigest(archivedRun)\n  if (storedRunDigest !== expectedRunDigest) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" archived run digest mismatch`,\n    )\n  }\n  return {\n    runId,\n    runDigest: expectedRunDigest,\n    findings,\n    findingIds,\n    analystIds,\n    reviewDecisions,\n  }\n}\n\nexport function completedAnalystReviewQuality(review: StoredAnalystReview): AnalystReviewQuality {\n  const findingDecisions = review.reviewDecisions.filter(\n    (decision): decision is Extract<AnalystReviewDecision, { verdict: 'confirmed' | 'rejected' }> =>\n      decision.verdict !== 'completeness_assessed',\n  )\n  const completeness = review.reviewDecisions.filter(\n    (decision): decision is Extract<AnalystReviewDecision, { verdict: 'completeness_assessed' }> =>\n      decision.verdict === 'completeness_assessed',\n  )\n  if (completeness.length !== 1) {\n    throw new TypeError(\n      'feedbackTrajectoryToOptimizerRow: analyst run requires exactly one independent completeness_assessed decision',\n    )\n  }\n\n  const confirmed = findingDecisions.filter((decision) => decision.verdict === 'confirmed').length\n  const rejected = findingDecisions.length - confirmed\n  const emitted = review.findingIds.length\n  const missed = completeness[0]!.missedIssues.length\n  const precision = emitted === 0 ? 1 : confirmed / emitted\n  const recallDenominator = confirmed + missed\n  const recall = recallDenominator === 0 ? 1 : confirmed / recallDenominator\n  const f1 = precision + recall === 0 ? 0 : (2 * precision * recall) / (precision + recall)\n  return {\n    precision,\n    recall,\n    f1,\n    counts: { emitted, confirmed, rejected, missed },\n  }\n}\n\nexport function validateAnalystReviewDecisions(input: {\n  runId: string\n  runDigest: AnalystRunDigest\n  findings: readonly AnalystFinding[]\n  analystIds: readonly string[]\n  decisions: unknown\n  requireComplete?: boolean\n}): AnalystReviewDecision[] {\n  if (!Array.isArray(input.decisions)) {\n    throw new TypeError('analyst review decisions must be an array')\n  }\n  const findings = snapshotAnalystFindings(input.findings)\n  const expectedRunDigest = requiredDigest(input.runDigest, 'analyst review run digest')\n  const findingsById = new Map(findings.map((finding) => [finding.finding_id, finding]))\n  const generatingAnalystIds = new Set(input.analystIds)\n  const seenFindingIds = new Set<string>()\n  let completenessCount = 0\n\n  const decisions = input.decisions.map((value, index): AnalystReviewDecision => {\n    if (!isRecord(value)) {\n      throw new TypeError(`analyst review decision ${index} must be an object`)\n    }\n    const source = requiredString(value.source, `analyst review decision ${index} source`)\n    if (!isAnalystReviewSource(source)) {\n      throw new TypeError(\n        `analyst review decision ${index} source must be user, judge, environment, metric, or policy`,\n      )\n    }\n    const reviewerId = requiredString(\n      value.reviewerId,\n      `analyst review decision ${index} reviewerId`,\n    )\n    if (generatingAnalystIds.has(reviewerId)) {\n      throw new TypeError(\n        `analyst review decision ${index} reviewerId must differ from the generating analyst`,\n      )\n    }\n    const reviewId = requiredString(value.reviewId, `analyst review decision ${index} reviewId`)\n    if (reviewId === input.runId) {\n      throw new TypeError(\n        `analyst review decision ${index} reviewId must identify an independent review`,\n      )\n    }\n    const reason = requiredString(value.reason, `analyst review decision ${index} reason`)\n    const decidedAt = canonicalTimestamp(\n      value.decidedAt,\n      `analyst review decision ${index} decidedAt`,\n    )\n    const runDigest = requiredDigest(value.runDigest, `analyst review decision ${index} runDigest`)\n    if (runDigest !== expectedRunDigest) {\n      throw new TypeError(`analyst review decision ${index} run digest mismatch`)\n    }\n\n    if (value.verdict === 'completeness_assessed') {\n      assertOnlyKeys(\n        value,\n        [\n          'runDigest',\n          'verdict',\n          'missedIssues',\n          'source',\n          'reviewerId',\n          'reviewId',\n          'reason',\n          'decidedAt',\n        ],\n        `analyst review decision ${index}`,\n      )\n      completenessCount += 1\n      if (completenessCount > 1) {\n        throw new TypeError('duplicate completeness_assessed analyst review decision')\n      }\n      return {\n        runDigest,\n        verdict: 'completeness_assessed',\n        missedIssues: validateMissedIssues(\n          value.missedIssues,\n          findingsById,\n          `analyst review decision ${index}`,\n        ),\n        source,\n        reviewerId,\n        reviewId,\n        reason,\n        decidedAt,\n      }\n    }\n\n    if (value.verdict !== 'confirmed' && value.verdict !== 'rejected') {\n      throw new TypeError(\n        `analyst review decision ${index} verdict must be confirmed, rejected, or completeness_assessed`,\n      )\n    }\n    assertOnlyKeys(\n      value,\n      [\n        'runDigest',\n        'findingId',\n        'findingDigest',\n        'verdict',\n        'source',\n        'reviewerId',\n        'reviewId',\n        'reason',\n        'decidedAt',\n      ],\n      `analyst review decision ${index}`,\n    )\n    const findingId = requiredString(value.findingId, `analyst review decision ${index} findingId`)\n    const finding = findingsById.get(findingId)\n    if (!finding) {\n      throw new TypeError(`analyst review decision references unknown finding id \"${findingId}\"`)\n    }\n    if (seenFindingIds.has(findingId)) {\n      throw new TypeError(`duplicate analyst review decision for finding id \"${findingId}\"`)\n    }\n    seenFindingIds.add(findingId)\n    const findingDigest = requiredString(\n      value.findingDigest,\n      `analyst review decision ${index} findingDigest`,\n    )\n    const expectedDigest = analystFindingDigest(finding)\n    if (findingDigest !== expectedDigest) {\n      throw new TypeError(\n        `analyst review decision ${index} digest mismatch for finding id \"${findingId}\"`,\n      )\n    }\n    return {\n      runDigest,\n      findingId,\n      findingDigest: expectedDigest,\n      verdict: value.verdict,\n      source,\n      reviewerId,\n      reviewId,\n      reason,\n      decidedAt,\n    }\n  })\n\n  if (input.requireComplete) {\n    const missing = findings\n      .map((finding) => finding.finding_id)\n      .filter((findingId) => !seenFindingIds.has(findingId))\n    if (missing.length > 0) {\n      throw new TypeError(\n        `feedbackTrajectoryToOptimizerRow: missing independent decisions for finding ids: ${missing.join(', ')}`,\n      )\n    }\n    if (completenessCount !== 1) {\n      throw new TypeError(\n        'feedbackTrajectoryToOptimizerRow: analyst run requires exactly one independent completeness_assessed decision',\n      )\n    }\n  }\n  return decisions\n}\n\nexport function assertUniqueFindingIds(findingIds: readonly string[]): void {\n  const seen = new Set<string>()\n  for (const findingId of findingIds) {\n    if (findingId.trim().length === 0) throw new TypeError('analyst finding id must not be empty')\n    if (seen.has(findingId)) {\n      throw new TypeError(`analyst run contains duplicate finding id \"${findingId}\"`)\n    }\n    seen.add(findingId)\n  }\n}\n\nfunction snapshotAnalystFinding(value: unknown, context: string): AnalystFinding {\n  let snapshot: unknown\n  try {\n    snapshot = JSON.parse(canonicalString(value)) as unknown\n  } catch (cause) {\n    throw new TypeError(`${context} must have a canonical JSON representation`, { cause })\n  }\n  assertAnalystFinding(snapshot, context)\n  return snapshot\n}\n\nfunction assertAnalystFinding(value: unknown, context: string): asserts value is AnalystFinding {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(\n    value,\n    [\n      'schema_version',\n      'finding_id',\n      'analyst_id',\n      'produced_at',\n      'severity',\n      'area',\n      'claim',\n      'rationale',\n      'evidence_refs',\n      'recommended_action',\n      'validation_plan',\n      'confidence',\n      'subject',\n      'derived_from_judge',\n      'metadata',\n    ],\n    context,\n  )\n  if (value.schema_version !== '1.0.0') {\n    throw new TypeError(`${context} schema_version must be \"1.0.0\"`)\n  }\n  requiredString(value.finding_id, `${context} finding_id`)\n  requiredString(value.analyst_id, `${context} analyst_id`)\n  canonicalTimestamp(value.produced_at, `${context} produced_at`)\n  if (\n    value.severity !== 'critical' &&\n    value.severity !== 'high' &&\n    value.severity !== 'medium' &&\n    value.severity !== 'low' &&\n    value.severity !== 'info'\n  ) {\n    throw new TypeError(`${context} severity is invalid`)\n  }\n  requiredString(value.area, `${context} area`)\n  requiredString(value.claim, `${context} claim`)\n  optionalString(value.rationale, `${context} rationale`)\n  value.evidence_refs = validateEvidenceRefs(value.evidence_refs, `${context} evidence_refs`)\n  optionalString(value.recommended_action, `${context} recommended_action`)\n  optionalString(value.validation_plan, `${context} validation_plan`)\n  if (\n    typeof value.confidence !== 'number' ||\n    !Number.isFinite(value.confidence) ||\n    value.confidence < 0 ||\n    value.confidence > 1\n  ) {\n    throw new TypeError(`${context} confidence must be a finite number from 0 through 1`)\n  }\n  optionalString(value.subject, `${context} subject`)\n  if (value.derived_from_judge !== undefined && typeof value.derived_from_judge !== 'boolean') {\n    throw new TypeError(`${context} derived_from_judge must be a boolean`)\n  }\n  if (value.metadata !== undefined && !isRecord(value.metadata)) {\n    throw new TypeError(`${context} metadata must be an object`)\n  }\n}\n\nfunction validateMissedIssues(\n  value: unknown,\n  findingsById: ReadonlyMap<string, AnalystFinding>,\n  context: string,\n): AnalystMissedIssue[] {\n  if (!Array.isArray(value)) {\n    throw new TypeError(`${context} missedIssues must be an array`)\n  }\n  const seen = new Set<string>()\n  return value.map((issue, index) => {\n    const issueContext = `${context} missedIssues ${index}`\n    if (!isRecord(issue)) throw new TypeError(`${issueContext} must be an object`)\n    assertOnlyKeys(issue, ['id', 'reason', 'evidence'], issueContext)\n    const id = requiredString(issue.id, `${issueContext} id`)\n    if (findingsById.has(id)) {\n      throw new TypeError(`${issueContext} id \"${id}\" is already an emitted finding id`)\n    }\n    if (seen.has(id)) {\n      throw new TypeError(`duplicate missed issue id \"${id}\"`)\n    }\n    seen.add(id)\n    const reason = requiredString(issue.reason, `${issueContext} reason`)\n    return {\n      id,\n      reason,\n      ...(issue.evidence === undefined\n        ? {}\n        : { evidence: validateEvidenceRefs(issue.evidence, `${issueContext} evidence`) }),\n    }\n  })\n}\n\nfunction validateEvidenceRefs(value: unknown, context: string): EvidenceRef[] {\n  if (!Array.isArray(value)) throw new TypeError(`${context} must be an array`)\n  return value.map((evidence, index) => {\n    const evidenceContext = `${context} ${index}`\n    if (!isRecord(evidence)) throw new TypeError(`${evidenceContext} must be an object`)\n    assertOnlyKeys(evidence, ['kind', 'uri', 'excerpt'], evidenceContext)\n    if (\n      evidence.kind !== 'span' &&\n      evidence.kind !== 'event' &&\n      evidence.kind !== 'artifact' &&\n      evidence.kind !== 'finding' &&\n      evidence.kind !== 'metric'\n    ) {\n      throw new TypeError(`${evidenceContext} kind is invalid`)\n    }\n    const uri = requiredString(evidence.uri, `${evidenceContext} uri`)\n    const excerpt = evidence.excerpt\n    optionalString(excerpt, `${evidenceContext} excerpt`)\n    return {\n      kind: evidence.kind,\n      uri,\n      ...(excerpt === undefined ? {} : { excerpt: excerpt as string }),\n    }\n  })\n}\n\nfunction assertOnlyKeys(\n  value: Record<string, unknown>,\n  allowed: readonly string[],\n  name: string,\n): void {\n  const allowedKeys = new Set(allowed)\n  const unexpected = Object.keys(value).filter((key) => !allowedKeys.has(key))\n  if (unexpected.length > 0) {\n    throw new TypeError(`${name} contains unknown fields: ${unexpected.sort().join(', ')}`)\n  }\n}\n\nfunction stringArray(value: unknown, name: string): string[] {\n  if (!Array.isArray(value) || value.some((item) => typeof item !== 'string')) {\n    throw new TypeError(`${name} must be an array of strings`)\n  }\n  const strings = value.map((item) => requiredString(item, name))\n  if (new Set(strings).size !== strings.length) {\n    throw new TypeError(`${name} must contain unique values`)\n  }\n  return strings\n}\n\nfunction requiredString(value: unknown, name: string): string {\n  if (typeof value !== 'string' || value.trim().length === 0) {\n    throw new TypeError(`${name} must be a non-empty string`)\n  }\n  return value\n}\n\nfunction requiredDigest(value: unknown, name: string): AnalystRunDigest {\n  const digest = requiredString(value, name)\n  if (!/^sha256:[a-f0-9]{64}$/.test(digest)) {\n    throw new TypeError(`${name} must be a sha256 digest`)\n  }\n  return digest as AnalystRunDigest\n}\n\nfunction optionalString(value: unknown, name: string): void {\n  if (value !== undefined && typeof value !== 'string') {\n    throw new TypeError(`${name} must be a string`)\n  }\n}\n\nfunction canonicalTimestamp(value: unknown, name: string): string {\n  const timestamp = requiredString(value, name)\n  const parsed = new Date(timestamp)\n  if (Number.isNaN(parsed.valueOf()) || parsed.toISOString() !== timestamp) {\n    throw new TypeError(`${name} must be a canonical ISO 8601 UTC timestamp`)\n  }\n  return timestamp\n}\n\nfunction isAnalystReviewSource(value: string): value is AnalystReviewSource {\n  return (\n    value === 'user' ||\n    value === 'judge' ||\n    value === 'environment' ||\n    value === 'metric' ||\n    value === 'policy'\n  )\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n","/**\n * Deterministic behavioral metrics over OTLP spans — pure arithmetic, no LLM.\n *\n * It computes token growth, output decay, tool monoculture, and missing\n * self-verification once in TypeScript with no model judgment.\n *\n * General, not trace-specific: the detectors key off token trajectories and\n * tool usage present in any agentic OTLP trace, not any one benchmark.\n */\n\nimport { LLM_CONTEXT_TOKENS } from '../trace/attribute-vocabulary'\nimport { executionTrackByLane } from '../trace/execution-tracks'\nimport {\n  LLM_INPUT_TOKEN_ATTR_KEYS,\n  LLM_OUTPUT_TOKEN_ATTR_KEYS,\n  TOOL_NAME_ATTR_KEYS,\n} from '../trace/otlp-attributes'\nimport { spanEpochMillis } from './otlp-span'\nimport type { TraceAnalystSpan } from './types'\n\nexport type SuboptimalCode =\n  | 'monotonic-input-growth'\n  | 'output-length-decay'\n  | 'single-tool-dependency'\n  | 'no-self-verification'\n\nexport interface SuboptimalSignal {\n  code: SuboptimalCode\n  severity: 'high' | 'medium' | 'low'\n  /** Human-readable claim, with the backing numbers inlined. */\n  detail: string\n  /** The exact figures the detector fired on — auditable, no model in the loop. */\n  evidence: Record<string, number | string | boolean>\n}\n\nexport interface BehavioralMetrics {\n  /** The only trace represented by these metrics; null when spans are empty. */\n  traceId: string | null\n  llmCallCount: number\n  /** Causally serial LLM timelines. Parallel branches are never joined. */\n  tokenSequences: BehavioralTokenSequence[]\n  /** Token values from the longest serial timeline, retained for convenience. */\n  inputTokenTrajectory: number[]\n  outputTokenTrajectory: number[]\n  toolHistogram: Record<string, number>\n  totalToolCalls: number\n  distinctTools: number\n  /** distinct/total tool calls; 1.0 when there are no tool calls. */\n  toolDiversityRatio: number\n  hasSelfVerification: boolean\n  signals: SuboptimalSignal[]\n}\n\nexport interface BehavioralTokenSequence {\n  scopeId: string\n  spanIds: string[]\n  inputTokenTrajectory: Array<number | null>\n  outputTokenTrajectory: Array<number | null>\n}\n\ninterface TokenSample {\n  span: TraceAnalystSpan\n  input: number | null\n  output: number | null\n  step: number | null\n}\n\n/** ≥ this input-token growth ratio across a run, with no compression, fires. */\nconst INPUT_GROWTH_FACTOR = 3\n/** Tool-usage signals need at least this many calls to be meaningful. */\nconst MIN_TOOL_CALLS = 3\n/**\n * Serial calls required before a strictly-decreasing output run counts as decay.\n *\n * A run of n independent lengths is strictly decreasing by chance with\n * probability 1/n!, so the old minimum of 3 fired on roughly one sequence in\n * six. The paired `inputIsMonotonic && inputGrew` guard does not offset that:\n * context accumulates by construction in a serial agent loop, so input growth\n * is very nearly free evidence. At 5 calls chance alone accounts for under 1%,\n * which is the bar a signal reported at full confidence has to clear.\n */\nconst OUTPUT_DECAY_MINIMUM_CALLS = 5\n/**\n * The last output must fall to at most this fraction of the first.\n *\n * Length wanders between turns for reasons that are not degradation, so\n * direction alone is not a finding — an observed 784 → 646 run (18%) was\n * reported as decay and was noise. Requiring the response to lose most of its\n * length keeps the signal on the failure it names: late steps that quietly\n * stop doing the work.\n */\nconst OUTPUT_DECAY_MAXIMUM_RETAINED_FRACTION = 0.6\n/** Tool names that read or check state count as self-verification, not mutation.\n *  Covers the inspect verbs plus the read/search tools real harnesses use to\n *  verify (Claude Code Read/Grep/Glob, codex read_file/ls/cat, git status/diff,\n *  test/lint). A pure shell tool (Bash/exec_command) is intentionally NOT matched\n *  — its name can't tell a `pytest` from an `rm`. */\nconst VERIFY_RE =\n  /verif|eval|inspect|check|assert|validat|review|confirm|read|grep|glob|search|view|\\blist\\b|\\bls\\b|\\bcat\\b|\\bfind\\b|diff|status|\\btest|lint|typecheck/i\n\nfunction num(v: unknown): number | null {\n  return typeof v === 'number' && Number.isFinite(v) ? v : null\n}\nfunction numAttr(attrs: Record<string, unknown>, keys: readonly string[]): number | null {\n  for (const key of keys) {\n    const value = num(attrs[key])\n    if (value !== null) return value\n  }\n  return null\n}\nfunction inputTokensOf(s: TraceAnalystSpan): number | null {\n  const exactContext = num(s.attributes[LLM_CONTEXT_TOKENS])\n  if (exactContext !== null) return exactContext\n  // Foreign producers disagree on whether prompt includes cached tokens.\n  // Without an exact total, retain the reported prompt instead of guessing.\n  return (\n    numAttr(s.attributes, LLM_INPUT_TOKEN_ATTR_KEYS) ?? num(s.attributes['llm.usage.input_tokens'])\n  )\n}\nfunction outputTokensOf(s: TraceAnalystSpan): number | null {\n  return (\n    numAttr(s.attributes, LLM_OUTPUT_TOKEN_ATTR_KEYS) ??\n    num(s.attributes['llm.usage.output_tokens'])\n  )\n}\nfunction stepOf(s: TraceAnalystSpan): number | null {\n  return num(s.attributes.step)\n}\nfunction toolNameOf(s: TraceAnalystSpan): string | null {\n  if (s.tool_name) return s.tool_name\n  for (const key of TOOL_NAME_ATTR_KEYS) {\n    const t = s.attributes[key]\n    if (typeof t === 'string' && t.length > 0) return t\n  }\n  return null\n}\n\n/**\n * Reduce a span list to behavioral metrics + fired suboptimality signals.\n * Pure + deterministic: same spans → same output, on any machine, no model.\n */\nexport function computeTraceMetrics(spans: readonly TraceAnalystSpan[]): BehavioralMetrics {\n  const traceIds = new Set(spans.map((span) => span.trace_id))\n  if (traceIds.size > 1) {\n    throw new Error(\n      `computeTraceMetrics: expected spans from one trace, received ${traceIds.size} traces`,\n    )\n  }\n  const traceId = traceIds.values().next().value ?? null\n\n  const samples: TokenSample[] = spans.map((span) => ({\n    span,\n    input: inputTokensOf(span),\n    output: outputTokensOf(span),\n    step: stepOf(span),\n  }))\n  const llmSamples = samples.filter((sample) => sample.span.kind === 'LLM')\n  const tokenSamples =\n    llmSamples.length > 0\n      ? llmSamples\n      : samples.filter((sample) => sample.input !== null || sample.output !== null)\n  const tokenSequences = buildTokenSequences(tokenSamples, spans)\n  const primarySequence = tokenSequences[0]\n  const inputTokenTrajectory =\n    primarySequence?.inputTokenTrajectory.filter((value): value is number => value !== null) ?? []\n  const outputTokenTrajectory =\n    primarySequence?.outputTokenTrajectory.filter((value): value is number => value !== null) ?? []\n  const toolHistogram: Record<string, number> = {}\n  let hasSelfVerification = false\n\n  for (const s of spans) {\n    const tool = toolNameOf(s)\n    if (tool) {\n      toolHistogram[tool] = (toolHistogram[tool] ?? 0) + 1\n      if (VERIFY_RE.test(tool)) hasSelfVerification = true\n    }\n  }\n\n  const totalToolCalls = Object.values(toolHistogram).reduce((a, b) => a + b, 0)\n  const distinctTools = Object.keys(toolHistogram).length\n  const toolDiversityRatio = totalToolCalls === 0 ? 1 : distinctTools / totalToolCalls\n\n  const signals: SuboptimalSignal[] = []\n  const seenTokenSignals = new Set<SuboptimalCode>()\n  for (const sequence of tokenSequences) {\n    for (const signal of tokenSignals(sequence)) {\n      if (seenTokenSignals.has(signal.code)) continue\n      seenTokenSignals.add(signal.code)\n      signals.push(signal)\n    }\n  }\n\n  if (totalToolCalls >= MIN_TOOL_CALLS && distinctTools === 1) {\n    const only = Object.keys(toolHistogram)[0]!\n    signals.push({\n      code: 'single-tool-dependency',\n      severity: 'medium',\n      detail: `All ${totalToolCalls} observed tool calls are \\`${only}\\`; no alternate tool call was observed.`,\n      evidence: { tool: only, calls: totalToolCalls, distinct_tools: 1 },\n    })\n  }\n\n  if (totalToolCalls >= MIN_TOOL_CALLS && !hasSelfVerification) {\n    signals.push({\n      code: 'no-self-verification',\n      severity: 'medium',\n      detail: `${totalToolCalls} tool calls were observed without a verification-named tool call.`,\n      evidence: { tool_calls: totalToolCalls, verification_calls: 0 },\n    })\n  }\n\n  return {\n    traceId,\n    llmCallCount: tokenSamples.length,\n    tokenSequences,\n    inputTokenTrajectory,\n    outputTokenTrajectory,\n    toolHistogram,\n    totalToolCalls,\n    distinctTools,\n    toolDiversityRatio,\n    hasSelfVerification,\n    signals,\n  }\n}\n\nfunction buildTokenSequences(\n  samples: readonly TokenSample[],\n  spans: readonly TraceAnalystSpan[],\n): BehavioralTokenSequence[] {\n  const spansById = new Map(spans.map((span) => [span.span_id, span]))\n  const executionScopeFor = createTokenExecutionScopeResolver(spansById)\n  const scopedSamples = samples.map((sample) => ({\n    sample,\n    ...executionScopeFor(sample.span),\n  }))\n  const trackByLane = executionTrackByLane(scopedSamples)\n  const byTrack = new Map<string, { scopeId: string; samples: TokenSample[] }>()\n  for (const scoped of scopedSamples) {\n    const trackId = trackByLane.get(scoped.key)!\n    const track = byTrack.get(trackId) ?? { scopeId: scoped.scopeId, samples: [] }\n    track.samples.push(scoped.sample)\n    byTrack.set(trackId, track)\n  }\n\n  const sequences: BehavioralTokenSequence[] = []\n  for (const { scopeId, samples: tracked } of byTrack.values()) {\n    const runs = serialTokenRuns([...tracked].sort(compareTokenSamples))\n    runs.forEach((run, index) => {\n      sequences.push({\n        scopeId: runs.length === 1 ? scopeId : `${scopeId}#${index + 1}`,\n        spanIds: run.map((sample) => sample.span.span_id),\n        inputTokenTrajectory: run.map((sample) => sample.input),\n        outputTokenTrajectory: run.map((sample) => sample.output),\n      })\n    })\n  }\n\n  return sequences.sort(\n    (a, b) =>\n      b.spanIds.length - a.spanIds.length ||\n      a.scopeId.localeCompare(b.scopeId) ||\n      a.spanIds[0]!.localeCompare(b.spanIds[0]!),\n  )\n}\n\ninterface AncestorScope {\n  agentId: string | null\n  rootId: string | null\n  missingParentId: string | null\n  laneSpanId: string | null\n}\n\nfunction createTokenExecutionScopeResolver(spansById: ReadonlyMap<string, TraceAnalystSpan>): (\n  span: TraceAnalystSpan,\n) => {\n  key: string\n  scopeKey: string\n  scopeId: string\n  start: number | null\n  end: number | null\n} {\n  const cache = new Map<string, AncestorScope>()\n  return (span) => {\n    const ancestry = resolveAncestorScope(span.parent_span_id, spansById, cache)\n    const rootId = ancestry.rootId\n    const scopeId = ancestry.agentId\n      ? `span:${ancestry.agentId}`\n      : ancestry.missingParentId\n        ? `parent:${ancestry.missingParentId}`\n        : rootId\n          ? `root:${rootId}`\n          : span.agent_name\n            ? `agent:${span.agent_name}`\n            : `trace:${span.trace_id}`\n    const scopeSpanId = ancestry.agentId ?? ancestry.missingParentId ?? rootId\n    const laneSpan = ancestry.laneSpanId ? spansById.get(ancestry.laneSpanId) : undefined\n    const direct = scopeSpanId === null || ancestry.laneSpanId === scopeSpanId\n    const timedSpan = direct ? span : laneSpan\n    return {\n      key: JSON.stringify([scopeId, direct ? span.span_id : ancestry.laneSpanId]),\n      scopeKey: scopeId,\n      scopeId,\n      start: timedSpan ? spanEpochMillis(timedSpan.start_time) : null,\n      end: timedSpan ? spanEpochMillis(timedSpan.end_time) : null,\n    }\n  }\n}\n\nfunction resolveAncestorScope(\n  startId: string | null,\n  spansById: ReadonlyMap<string, TraceAnalystSpan>,\n  cache: Map<string, AncestorScope>,\n): AncestorScope {\n  const empty: AncestorScope = {\n    agentId: null,\n    rootId: null,\n    missingParentId: null,\n    laneSpanId: null,\n  }\n  if (!startId) return empty\n\n  const path: string[] = []\n  const pathIndex = new Map<string, number>()\n  let currentId: string | null = startId\n  let resolved = empty\n  while (currentId) {\n    const cached = cache.get(currentId)\n    if (cached) {\n      resolved = cached\n      break\n    }\n    const cycleStart = pathIndex.get(currentId)\n    if (cycleStart !== undefined) {\n      resolved = {\n        agentId: null,\n        rootId: [...path.slice(cycleStart)].sort()[0]!,\n        missingParentId: null,\n        laneSpanId: [...path.slice(cycleStart)].sort()[0]!,\n      }\n      break\n    }\n    const current = spansById.get(currentId)\n    if (!current) {\n      resolved = {\n        agentId: null,\n        rootId: null,\n        missingParentId: currentId,\n        laneSpanId: currentId,\n      }\n      break\n    }\n    if (current.kind === 'AGENT') {\n      resolved = {\n        agentId: current.span_id,\n        rootId: null,\n        missingParentId: null,\n        laneSpanId: current.span_id,\n      }\n      break\n    }\n    pathIndex.set(currentId, path.length)\n    path.push(currentId)\n    currentId = current.parent_span_id\n  }\n\n  for (let index = path.length - 1; index >= 0; index -= 1) {\n    if (resolved.agentId === null && resolved.rootId === null) {\n      resolved = { ...resolved, rootId: path[index]!, laneSpanId: path[index]! }\n    } else if (\n      resolved.laneSpanId === (resolved.agentId ?? resolved.missingParentId ?? resolved.rootId)\n    ) {\n      resolved = { ...resolved, laneSpanId: path[index]! }\n    }\n    cache.set(path[index]!, resolved)\n  }\n  return resolved\n}\n\nfunction compareTokenSamples(a: TokenSample, b: TokenSample): number {\n  const aStart = spanEpochMillis(a.span.start_time)\n  const bStart = spanEpochMillis(b.span.start_time)\n  if (aStart === null && bStart !== null) return 1\n  if (aStart !== null && bStart === null) return -1\n  if (aStart !== null && bStart !== null && aStart !== bStart) return aStart - bStart\n  if (a.step !== null && b.step !== null && a.step !== b.step) return a.step - b.step\n  return a.span.span_id.localeCompare(b.span.span_id)\n}\n\nfunction serialTokenRuns(ordered: readonly TokenSample[]): TokenSample[][] {\n  const runs: TokenSample[][] = []\n  let serial: TokenSample[] = []\n  let overlap: TokenSample[] = []\n  let overlapEnd = Number.NEGATIVE_INFINITY\n\n  const flushSerial = () => {\n    if (serial.length > 0) runs.push(serial)\n    serial = []\n  }\n  const flushOverlap = () => {\n    if (overlap.length === 1) {\n      serial.push(overlap[0]!)\n    } else if (overlap.length > 1) {\n      flushSerial()\n      for (const sample of overlap) runs.push([sample])\n    }\n    overlap = []\n    overlapEnd = Number.NEGATIVE_INFINITY\n  }\n\n  for (const sample of ordered) {\n    const start = spanEpochMillis(sample.span.start_time)\n    const end = spanEpochMillis(sample.span.end_time)\n    if (start === null || end === null || sample.span.duration_ms <= 0 || end < start) {\n      flushOverlap()\n      flushSerial()\n      runs.push([sample])\n      continue\n    }\n    if (overlap.length > 0 && start >= overlapEnd) flushOverlap()\n    overlap.push(sample)\n    overlapEnd = Math.max(overlapEnd, end)\n  }\n  flushOverlap()\n  flushSerial()\n  return runs\n}\n\nfunction tokenSignals(sequence: BehavioralTokenSequence): SuboptimalSignal[] {\n  const signals: SuboptimalSignal[] = []\n  const inputs = sequence.inputTokenTrajectory\n  const outputs = sequence.outputTokenTrajectory\n  if (inputs.length >= 3 && inputs.every((value): value is number => value !== null)) {\n    const first = inputs[0]!\n    const last = inputs[inputs.length - 1]!\n    const isMonotonic = everyAdjacent(inputs, (previous, current) => current >= previous)\n    const growthFromZero = first === 0 && last > 0\n    const growth = growthFromZero ? Infinity : first > 0 ? last / first : 0\n    if (isMonotonic && last > first && growth >= INPUT_GROWTH_FACTOR) {\n      const growthLabel = growthFromZero ? '0→nonzero (unbounded)' : `${growth.toFixed(1)}x`\n      signals.push({\n        code: 'monotonic-input-growth',\n        severity: 'high',\n        detail: `LLM input tokens grew ${growthLabel} (${first}→${last}) across ${inputs.length} serial calls without an intervening decrease.`,\n        evidence: {\n          first,\n          last,\n          growth_x: growthFromZero ? 'unbounded' : Number(growth.toFixed(2)),\n          calls: inputs.length,\n          scope: sequence.scopeId,\n          first_span_id: sequence.spanIds[0]!,\n          last_span_id: sequence.spanIds[sequence.spanIds.length - 1]!,\n        },\n      })\n    }\n  }\n\n  if (\n    inputs.length >= OUTPUT_DECAY_MINIMUM_CALLS &&\n    inputs.length === outputs.length &&\n    inputs.every((value): value is number => value !== null) &&\n    outputs.every((value): value is number => value !== null)\n  ) {\n    const first = outputs[0]!\n    const last = outputs[outputs.length - 1]!\n    const inputIsMonotonic = everyAdjacent(inputs, (previous, current) => current >= previous)\n    const outputIsMonotonic = everyAdjacent(outputs, (previous, current) => current <= previous)\n    const inputGrew = inputs[inputs.length - 1]! > inputs[0]!\n    const decayIsMaterial = last <= first * OUTPUT_DECAY_MAXIMUM_RETAINED_FRACTION\n    if (inputIsMonotonic && inputGrew && outputIsMonotonic && decayIsMaterial) {\n      signals.push({\n        code: 'output-length-decay',\n        severity: 'medium',\n        detail: `LLM output tokens shrank ${first}→${last} over ${outputs.length} serial calls while input tokens increased monotonically.`,\n        evidence: {\n          first,\n          last,\n          calls: outputs.length,\n          scope: sequence.scopeId,\n          first_span_id: sequence.spanIds[0]!,\n          last_span_id: sequence.spanIds[sequence.spanIds.length - 1]!,\n        },\n      })\n    }\n  }\n  return signals\n}\n\nfunction everyAdjacent(\n  values: readonly number[],\n  predicate: (previous: number, current: number) => boolean,\n): boolean {\n  return values.slice(1).every((current, index) => predicate(values[index]!, current))\n}\n","/**\n * Deterministic behavioral analysis over arithmetic in trace spans.\n * This pass is cheap and repeatable; semantic analysis remains the job of\n * model-backed analysts. Relative quality requires a labeled comparison.\n */\n\nimport {\n  type BehavioralMetrics,\n  computeTraceMetrics,\n  type SuboptimalCode,\n} from '../trace-analyst/behavioral-metrics'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { ExactCapableAnalyst } from './exact-types'\nimport { type AnalystFinding, makeFinding } from './types'\n\nconst RECOMMENDED_ACTION: Record<SuboptimalCode, string> = {\n  'monotonic-input-growth':\n    'Inspect context assembly; if prior history is repeatedly included, summarize completed work before the next model call.',\n  'output-length-decay':\n    'Check late-step completeness; if shorter responses omit required work, add explicit completion criteria to the agent instructions.',\n  'single-tool-dependency':\n    'Test whether an inspect or verification tool improves outcomes after the repeated call fails or returns no progress.',\n  'no-self-verification':\n    'After state-changing actions, require an observable check before the agent proceeds.',\n}\n\nconst ANALYST_ID = 'efficiency-behavioral'\nconst DEFAULT_MAX_TRACES = 1_000\nconst DEFAULT_MAX_EVIDENCE_REFS = 20\nconst TRACE_PAGE_SIZE = 200\n\nexport interface BehavioralAnalystOptions {\n  /** Refuse larger unfiltered datasets instead of sampling them silently. Default 1,000. */\n  maxTraces?: number\n  /** Evidence locations retained per finding. Counts still cover every analyzed trace. Default 20. */\n  maxEvidenceRefsPerFinding?: number\n}\n\nconst AGGREGATE_CLAIM: Record<SuboptimalCode, (observed: number, analyzed: number) => string> = {\n  'monotonic-input-growth': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces showed input tokens grow from zero to nonzero or to at least 3x their initial value across at least 3 serial model calls without a decrease.`,\n  'output-length-decay': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces showed output tokens decrease while input tokens increased monotonically across at least 3 serial model calls.`,\n  'single-tool-dependency': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces used only one named tool across at least 3 tool calls.`,\n  'no-self-verification': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces had at least 3 tool calls without a verification-named tool call.`,\n}\n\nasync function listTraceIds(\n  store: TraceAnalysisStore,\n  maxTraces: number,\n  signal?: AbortSignal,\n): Promise<string[]> {\n  const traceIds = new Set<string>()\n  let offset = 0\n  let expectedTotal: number | undefined\n\n  while (true) {\n    signal?.throwIfAborted()\n    const page = await store.queryTraces({ limit: TRACE_PAGE_SIZE, offset })\n    if (expectedTotal === undefined) expectedTotal = page.total\n    if (page.total !== expectedTotal) {\n      throw new Error(\n        `behavioralAnalyst: trace count changed during pagination (${expectedTotal} to ${page.total})`,\n      )\n    }\n    if (page.total > maxTraces) {\n      throw new RangeError(\n        `behavioralAnalyst: ${page.total} traces exceed maxTraces=${maxTraces}; filter the store or raise the explicit limit`,\n      )\n    }\n    for (const trace of page.traces) traceIds.add(trace.trace_id)\n    if (traceIds.size > maxTraces) {\n      throw new RangeError(\n        `behavioralAnalyst: more than maxTraces=${maxTraces} unique traces were returned`,\n      )\n    }\n    if (!page.has_more) break\n    if (page.traces.length === 0) {\n      throw new Error('behavioralAnalyst: trace store returned an empty page with has_more=true')\n    }\n    offset += page.traces.length\n  }\n\n  if (traceIds.size !== expectedTotal) {\n    throw new Error(\n      `behavioralAnalyst: pagination returned ${traceIds.size}/${expectedTotal ?? 0} unique traces`,\n    )\n  }\n\n  return [...traceIds].sort()\n}\n\n/**\n * Map computed signals → structured AnalystFindings. Pure: no LLM, no clock\n * dependence beyond `produced_at` (overridable for deterministic tests).\n */\nexport function deriveEfficiencyFindings(\n  metrics: BehavioralMetrics,\n  opts: { analystId?: string; producedAt?: string } = {},\n): AnalystFinding[] {\n  const analystId = opts.analystId ?? ANALYST_ID\n  const traceId = metrics.traceId\n  return metrics.signals.map((sig) =>\n    makeFinding({\n      analyst_id: analystId,\n      area: 'efficiency',\n      subject: sig.code,\n      claim: sig.detail,\n      severity: sig.severity,\n      // Deterministic arithmetic over spans, not a model judgment → certain.\n      confidence: 1,\n      evidence_refs: [\n        {\n          kind: 'metric',\n          uri: traceId\n            ? `metric://trace/${encodeURIComponent(traceId)}/efficiency/${sig.code}`\n            : `metric://efficiency/${sig.code}`,\n          excerpt: JSON.stringify(sig.evidence),\n        },\n      ],\n      recommended_action: RECOMMENDED_ACTION[sig.code],\n      metadata: {\n        deterministic: true,\n        evidence: sig.evidence,\n        ...(traceId ? { trace_id: traceId } : {}),\n      },\n      id_basis: sig.code,\n      ...(opts.producedAt ? { produced_at: opts.producedAt } : {}),\n    }),\n  )\n}\n\n/** The deterministic behavioral/efficiency analyst (no LLM, any-model). */\nexport function behavioralAnalyst(\n  options: BehavioralAnalystOptions = {},\n): ExactCapableAnalyst<TraceAnalysisStore> {\n  const maxTraces = positiveInteger(options.maxTraces ?? DEFAULT_MAX_TRACES, 'maxTraces')\n  const maxEvidenceRefsPerFinding = positiveInteger(\n    options.maxEvidenceRefsPerFinding ?? DEFAULT_MAX_EVIDENCE_REFS,\n    'maxEvidenceRefsPerFinding',\n  )\n  return {\n    id: ANALYST_ID,\n    description:\n      'Deterministic behavioral/efficiency findings over OTLP spans — token-growth, output-decay, tool-monoculture, missing self-verification. Zero LLM; model-agnostic by construction.',\n    inputKind: 'trace-store',\n    cost: { kind: 'deterministic' },\n    version: '2.0.0',\n    executionConfig: {\n      kind: 'behavioral-efficiency',\n      max_traces: maxTraces,\n      max_evidence_refs_per_finding: maxEvidenceRefsPerFinding,\n    },\n    async analyze(store, context) {\n      const analyzedTraceIds = await listTraceIds(store, maxTraces, context.signal)\n      const findingsById = new Map<\n        string,\n        {\n          finding: AnalystFinding\n          observedTraceCount: number\n          evidenceTraceIds: string[]\n          evidence: AnalystFinding['evidence_refs']\n        }\n      >()\n      for (const traceId of analyzedTraceIds) {\n        context.signal?.throwIfAborted()\n        const viewed = await store.viewTrace({ trace_id: traceId })\n        if (viewed.trace_id !== traceId) {\n          throw new Error(\n            `behavioralAnalyst: requested trace '${traceId}', received '${viewed.trace_id}'`,\n          )\n        }\n        if (!viewed.spans) {\n          throw new Error(\n            `behavioralAnalyst: trace '${traceId}' is oversized; complete spans are required`,\n          )\n        }\n        const metrics = computeTraceMetrics(viewed.spans)\n        if (metrics.traceId !== null && metrics.traceId !== traceId) {\n          throw new Error(\n            `behavioralAnalyst: requested trace '${traceId}', received '${metrics.traceId}'`,\n          )\n        }\n        for (const finding of deriveEfficiencyFindings(metrics)) {\n          const current = findingsById.get(finding.finding_id)\n          if (!current) {\n            findingsById.set(finding.finding_id, {\n              finding,\n              observedTraceCount: 1,\n              evidenceTraceIds: [traceId],\n              evidence: [...finding.evidence_refs],\n            })\n            continue\n          }\n          current.observedTraceCount += 1\n          if (current.evidence.length < maxEvidenceRefsPerFinding) {\n            current.evidenceTraceIds.push(traceId)\n            current.evidence.push(...finding.evidence_refs)\n          }\n        }\n      }\n      return [...findingsById.values()].map(\n        ({ finding, observedTraceCount, evidenceTraceIds, evidence }) => ({\n          ...finding,\n          claim: AGGREGATE_CLAIM[finding.subject as SuboptimalCode](\n            observedTraceCount,\n            analyzedTraceIds.length,\n          ),\n          rationale: `${observedTraceCount}/${analyzedTraceIds.length} analyzed traces exhibited this pattern.`,\n          evidence_refs: evidence,\n          metadata: {\n            deterministic: true,\n            evidence_trace_ids: evidenceTraceIds,\n            omitted_evidence_trace_count: observedTraceCount - evidenceTraceIds.length,\n            observed_trace_count: observedTraceCount,\n            analyzed_trace_count: analyzedTraceIds.length,\n          },\n        }),\n      )\n    },\n  }\n}\n\nfunction positiveInteger(value: number, name: string): number {\n  if (!Number.isSafeInteger(value) || value < 1) {\n    throw new RangeError(`behavioralAnalyst: ${name} must be a positive safe integer`)\n  }\n  return value\n}\n","import {\n  analyzeSupervisorRunIntegrity,\n  type SupervisorRunIntegrityEvidence,\n} from '../../supervisor-run/integrity'\nimport type { SupervisorRunSources, SupervisorRunTree } from '../../supervisor-run/types'\nimport type { ExactCapableAnalyst } from '../exact-types'\nimport { type AnalystContext, type AnalystFinding, type EvidenceRef, makeFinding } from '../types'\n\nconst ANALYST_ID = 'control-integrity'\n\nfunction shown(value: unknown): string {\n  if (value === undefined) return '<absent>'\n  const encoded = JSON.stringify(value)\n  return encoded === undefined ? String(value) : encoded\n}\n\nfunction evidenceRef(namespace: string, value: SupervisorRunIntegrityEvidence): EvidenceRef {\n  return {\n    kind: 'metric',\n    uri: `supervisor-run://${encodeURIComponent(namespace)}/${value.path}`,\n    excerpt: shown(value.value),\n  }\n}\n\n/** Translate typed supervisor-run integrity issues into the shared analyst envelope. */\nexport function emitControlIntegrityFindings(\n  input: SupervisorRunSources | SupervisorRunTree,\n  producedAt: string,\n): AnalystFinding[] {\n  const report = analyzeSupervisorRunIntegrity(input, { capturedAt: producedAt })\n  return report.issues.map((issue) =>\n    makeFinding({\n      analyst_id: ANALYST_ID,\n      produced_at: producedAt,\n      area: issue.area,\n      severity: issue.severity,\n      subject: `${report.runRef}/${issue.subject}`,\n      claim: issue.claim,\n      rationale: issue.detail,\n      evidence_refs: issue.evidence.map((value) => evidenceRef(report.runRef, value)),\n      recommended_action: issue.recommendedAction,\n      validation_plan:\n        'Re-run this deterministic analyst on the retained SupervisorRunSources or SupervisorRunTree after correcting the producer.',\n      confidence: 1,\n      metadata: {\n        integrity_code: issue.code,\n        integrity_input: report.input,\n        integrity_run_ref: report.runRef,\n        integrity_subject: issue.subject,\n        ...issue.metadata,\n      },\n    }),\n  )\n}\n\n/** Deterministic Analyst adapter for `SupervisorRunSources | SupervisorRunTree`. */\nexport class ControlIntegrityAnalyst\n  implements ExactCapableAnalyst<SupervisorRunSources | SupervisorRunTree>\n{\n  readonly id = ANALYST_ID\n  readonly description =\n    'Deterministic supervisor-run integrity checks with explicit unavailable evidence.'\n  readonly inputKind = 'custom' as const\n  readonly cost = { kind: 'deterministic' as const, est_usd_per_run: 0 }\n  readonly version = '2.0.0'\n  readonly executionConfig = {\n    kind: 'control-integrity',\n    produced_at_source: 'tags.producedAt-or-system-clock',\n  } as const\n\n  async analyze(\n    input: SupervisorRunSources | SupervisorRunTree,\n    ctx: AnalystContext,\n  ): Promise<AnalystFinding[]> {\n    const producedAt = ctx.tags?.producedAt ?? new Date().toISOString()\n    const findings = emitControlIntegrityFindings(input, producedAt)\n    ctx.log?.(`control-integrity: ${findings.length} finding(s)`, {\n      input: 'nodes' in input ? 'SupervisorRunTree' : 'SupervisorRunSources',\n    })\n    return findings\n  }\n}\n\nexport const CONTROL_INTEGRITY_ANALYST = new ControlIntegrityAnalyst()\n","/**\n * Failure-mode analyst — prices each failure by the work it burned.\n *\n * Brief: for every failure worth reporting, find the span where it\n * started, find the span where the agent resumed productive work, and\n * report the distance between them as the cost. Severity follows that\n * measured cost. Frequency does not set severity.\n *\n * Why the reframe: counting is already free. `getDatasetOverview`\n * returns `errors.trace_count`, `errors.span_count`, and an\n * `error_clusters[]` array carrying each signature's tool, trace and\n * span counts, prevalence, and exemplar ids — deterministically, before\n * a single model call. The 1.x prompt spent a recursive investigation\n * re-deriving exactly that and answered with \"Bash tool calls are the\n * dominant failure surface (54 error spans across 47 distinct\n * signatures)\" and \"79/5260 tool calls ended in errors\". Both numbers\n * were true, both were already on the overview, and neither told an\n * operator which failure to fix first.\n *\n * What is NOT free is attributing waste. An error the agent shrugged\n * off on the next span cost approximately nothing. An error that sent\n * it down a wrong path for twenty spans, or that ended with a human\n * typing the correction, cost real wall-clock and real tokens. Only a\n * reader that follows the trace forward from the error to the point of\n * resumption can measure that, and that walk is what the model is paid\n * for here.\n *\n * The bounding pair is enforced structurally rather than by prompt\n * alone: `minimumEvidenceCitations: 2` rejects any finding that cannot\n * cite both the error span and the span that closed it, so an\n * unmeasured cost claim cannot reach the registry.\n *\n * Eight bounded model subqueries let the actor adjudicate the one\n * genuine judgement call — is a given post-error span real progress or\n * more flailing? — over excerpts it has already loaded.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('failure-mode')\n\nconst ACTOR_PROMPT = `You are a failure-cost analyst for an OTLP trace dataset. Your job is to find the failures that **burned the most agent work** and to price each one in spans, model calls, and wall-clock. How often an error occurred is not its cost and is not your output.\n\n${subjectGrammar}\n\nUse a lowercase cluster label that names the cost shape, not the error string: \"human-corrected-file-overwrite\", \"unrecovered-auth-loop\", \"long-detour-schema-guess\".\n\nWORKLIST → RECOVERY BOUNDARY → PRICE → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Read \\`errors.trace_count\\`, \\`errors.span_count\\`, and \\`error_clusters[]\\` — each cluster carries \\`signature\\`, \\`tool_name\\`, \\`trace_count\\`, \\`span_count\\`, \\`prevalence\\`, \\`exemplar_trace_ids\\`, and \\`exemplar_span_ids\\`. This is the deterministic analyzer's output, already computed for free. It is your WORKLIST: the exemplar ids name the spans you go price. It is never your findings.\n2. Reach error-bearing traces the exemplars miss with \\`queryTraces(filters={\"has_errors\": true}, limit=...)\\`. Prefer long traces and traces whose errors sit early: a failure has room to be expensive only when work followed it.\n3. Take one candidate error span E and read its trace in order. \\`viewTrace\\` returns that trace's spans sorted by \\`start_time\\`, which is the ordering every distance below is counted in. When \\`viewTrace\\` returns \\`oversized\\` instead of spans, locate candidates with \\`searchTrace\\` and pull the exact ids with \\`viewSpans\\`; use \\`searchSpan\\` when one span's payload is truncated.\n4. Find the RECOVERY BOUNDARY R — the first span after E in which the agent resumed productive work. Productive means a different, task-advancing action. A retry of the same call with the same arguments, a re-read of the same file, a re-plan of the same step, and an apology are all still inside the failure. Then price it:\n   - spans_burned: spans strictly between E and R\n   - model_calls_burned: how many of those spans have kind \\`LLM\\`\n   - wall_clock_ms: R \\`end_time\\` minus E \\`start_time\\`\n   Report all three. If the agent never resumed, R is the trace's last span and the failure is UNRECOVERED.\n5. Set severity from what ENDED the failure and from the measured distance, never from how many times the signature appears:\n   - HUMAN-CORRECTED — a human turn after E supplies the correction. This is the most expensive class at any span count, because the failure escaped the agent entirely and reached the user: severity critical. Detect it as a new user-role message in a later \\`LLM\\` span's input attributes, or a new root-level \\`AGENT\\` span in which the user restates or repairs the task. Search with patterns like \\`\"role\"\\\\s*:\\\\s*\"user\"\\`, \\`(that|this) is (wrong|not what)\\`, \\`I (said|asked|told you)\\`, \\`stop\\`, \\`undo\\`, \\`revert\\`, \\`you (deleted|broke|missed|ignored)\\`, \\`try again\\`. Quote the human's words exactly.\n   - UNRECOVERED — the trace ends without resumption: severity critical.\n   - LONG DETOUR — 10 or more spans burned, or 3 or more \\`LLM\\` spans burned: severity high.\n   - SHORT DETOUR — 2 to 9 spans burned: severity medium.\n   - SELF-RECOVERED ON THE NEXT SPAN — cost is approximately zero. Do not emit it. That is resilience, and reporting it dilutes the ranking.\n   One error that cost 20 spans outranks 50 errors that each cost one retry. Frequency may appear in a finding only as a multiplier on a measured per-instance cost, never as the reason for its severity.\n6. **Cluster, do not enumerate.** Errors sharing a root cause AND a recovery shape are ONE finding: report the summed cost across instances, state how many instances it covers, and cite the bounding pair of the single most expensive instance. Two errors with the same signature but different recovery shapes — one shrugged off, one human-corrected — are NOT the same finding; the expensive one is the finding and the cheap one is noise.\n\nFORBIDDEN OUTPUT. Each of the following duplicates the deterministic pass, and a duplicate finding is worse than no finding because it costs a reviewer the same attention while carrying no new information:\n   - a count of errors by tool (\"Bash is the dominant failure surface, 54 error spans\")\n   - a count or inventory of error signatures (\"47 distinct error signatures\")\n   - an error rate (\"79 of 5260 tool calls ended in errors\")\n   - any restatement of \\`prevalence\\`, \\`trace_count\\`, or \\`span_count\\` from \\`error_clusters[]\\`\nEvery finding MUST state its measured cost — spans burned, model calls burned, wall-clock — in the claim, and MUST cite the two spans that bound it: the error span and the recovery span, or the escaping human turn, or the trace's last span when unrecovered. A failure you cannot bound with two spans is one you did not measure: drop it.\n\n**Adjudicate boundaries with subqueries.** The single judgement call in this protocol is whether a post-error span is genuine resumption or more flailing. Load E, the spans between, and the candidate R, then send one bounded \\`llm_query\\` per candidate carrying those exact excerpts and asking which span first advances the task. Subqueries cannot call trace tools, so a trace id tells them nothing — paste the excerpts. Accept a boundary only when the excerpts you loaded support the answer.\n\nConfidence 0.9+ when both bounding spans are quoted and the spans between them were counted directly; 0.6-0.8 when an oversized trace forced you to sample the interval and the distance is an estimate; below 0.5 does not belong in this analyst, because an unmeasurable cost is not a finding. Keep the recommended action a short imperative; the improvement analyst expands it.\n\nIf every error in this dataset was recovered on the next span, return an empty findings array. That is the correct answer for a dataset whose failures were all cheap. Do not backfill it with the counts listed above and do not pad it with speculation.`\n\nexport const FAILURE_MODE_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'failure-mode',\n  description:\n    'Ranks failures by the work each one burned — spans, model calls, and wall-clock between the error and the span where the agent resumed — and treats a failure that reached a human as the most expensive class.',\n  area: 'failure-mode',\n  version: '2.0.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'all',\n  // Pricing one failure costs a bounded trace read plus a span-pair read,\n  // where counting cost a single overview call; the read budget is sized for\n  // that walk, not for the recount it replaces.\n  limits: { maxLlmCalls: 8, maxIterations: 24, maxToolCalls: 80 },\n  // The error span and the span that closed it. A cost claim that cannot cite\n  // both was never measured.\n  minimumEvidenceCitations: 2,\n}\n","/**\n * Improvement analyst — actionable self-improvement findings.\n *\n * Brief: read findings from upstream analysts (failure-mode,\n * knowledge-gap, knowledge-poisoning) AND the trace dataset itself,\n * then propose **concrete edits** to the agent's runtime: prompt\n * additions, RAG documents to ingest, tool descriptions to rewrite,\n * scaffolding changes to make, memory entries to invalidate. Each\n * finding is one proposed edit with the locus, the diff, and the\n * expected effect.\n *\n * This is the self-improvement loop's last mile: the prior\n * kinds describe *what's wrong*; this kind describes *what to change*.\n *\n * Eight bounded model subqueries let the actor compare competing fix\n * directions over the same cited evidence before recommending one.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('improvement')\n\nconst ACTOR_PROMPT = `You are a self-improvement analyst. Your job is to propose **concrete, locus-named edits** the agent's runtime should adopt to fix the failure modes, knowledge gaps, and poisonings present in this dataset.\n\nUpstream analysts have already classified the problems. Your job is to convert each problem into a *change to make* and grade its expected leverage. Each finding is one proposed edit.\n\n${subjectGrammar}\n\nDISCOVERY → CANDIDATE-FIXES → COMPETE → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Note the agents, tools, and any system-prompt fingerprints (look for the prompt text echoed in early spans).\n2. For each high-severity failure pattern, generate 2-3 candidate fixes. Real candidate axes:\n   - **System-prompt edit** — add an instruction, remove a misleading one, restructure precedence\n   - **Tool description edit** — rewrite a tool's description so the agent picks it correctly / passes valid args\n   - **New tool** — add a tool the agent kept emulating in code\n   - **RAG ingestion** — add a document or correct a stale one\n   - **Memory invalidation** — clear cached prior-run decisions that no longer apply\n   - **Scaffolding** — add a precondition check, a retry policy, a turn budget, a verification step\n   - **Output schema** — narrow the agent's output to forbid the failure shape\n   - **Skill / MCP / hook / subagent** — change the reusable profile component responsible for the behavior\n   - **Workflow / rollout policy** — change orchestration, budget, sampling, or stopping behavior\n   - **Code** — change an implementation path when profile edits cannot repair the behavior\n3. **Compare candidate fixes with bounded subqueries.** Load the representative failure excerpts, then send one \\`llm_query\\` per candidate-fix axis the same evidence. Ask for likely effect, side effects, and implementation scope. Subqueries cannot call trace tools; trace ids alone are insufficient context.\n4. After the comparisons return, **pick the winning candidate per cluster** based on expected effect and risk, then emit ONE finding. Keep the alternatives and rejection reasons in the rationale so the recommendation is auditable.\n5. **Cross-reference upstream findings.** Cite prior failure-mode or knowledge-gap findings as \\`finding://<prior-finding-id>\\`. This builds the dependency graph that lets the dashboard show \"fix #X resolves failure modes A, B, C.\"\n\nFor each winning recommendation, emit ONE finding. Use one exact locus from the subject grammar and state the edit in one sentence. Match leverage to the source failure's severity; use medium for quality-of-life changes and info for cleanup with no behavioral effect. Cite the targeted \\`finding://<id>\\` when available and the most representative span when useful. Quote the problem being fixed. Use confidence 0.85+ for a mechanical fix to a well-evidenced failure, 0.6-0.8 when judgment is required, and <0.5 for speculation. Explain in at most two sentences why this candidate beat its alternatives. The recommended action must be the literal diff, quoted replacement, tool description, or setting change.\n\nIf no upstream failure findings exist in this run, derive your own from the trace dataset using the failure-mode protocol inline (\\`searchTrace\\` for STATUS_CODE_ERROR / MaxTurnsExceeded / etc.). Prefer upstream findings when present because the analysts are designed to chain.\n\nDo NOT propose a fix you cannot defend with evidence. \"Tighten the prompt\" is not a finding; \"Add 'When the user asks for X, always Y' to the system prompt section \"request-classification\"\" is.`\n\nexport const IMPROVEMENT_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'improvement',\n  description:\n    'Converts upstream failure / gap / poisoning findings into concrete locus-named edits (prompt, tool-doc, RAG, scaffolding) with leverage grades.',\n  area: 'improvement',\n  version: '1.2.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'all',\n  limits: {\n    maxLlmCalls: 8,\n    maxIterations: 30,\n    maxToolCalls: 80,\n    maxOutputChars: 12_000,\n  },\n}\n","/**\n * Intent-divergence analyst — was the agent doing what the user asked,\n * and how early was the drift knowable?\n *\n * Brief: unlike every other kind, this one has free ground truth sitting\n * in the trace. A corrective human turn (\"no, I meant…\", \"stop doing X\",\n * \"why are you still asking\") is an *observed, labelled* divergence\n * event — the user themself marked the moment the agent was off target.\n * The analyst takes that label and works BACKWARD to the earliest\n * assistant turn where the divergence was already detectable, names the\n * signal in the user's stated intent that turn contradicted, and counts\n * the turns burned in between.\n *\n * \"The user corrected the agent\" is counting, and the deterministic\n * behavioral pass already counts it. The finding this kind owes is the\n * backward-looking one: at turn N the agent did X against stated intent\n * Y, the user corrected at turn N+K, so K turns were burned. A finding\n * with no earliest-detectable turn and no burned-turn count carries no\n * cost estimate and no place to put the fix, so it is not emitted.\n *\n * Second locus: turns where the *user's own* request was ambiguous or\n * self-contradictory, evidenced by the user later clarifying rather than\n * correcting. Nothing misbehaved there — the fix is a clarifying-question\n * policy that spends one turn up front instead of K turns of rework, so\n * those findings target `scaffolding:*` rather than the agent's\n * instructions.\n *\n * Six bounded model subqueries let the actor test competing\n * earliest-detectable anchors against the same loaded turn excerpts.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('intent-divergence')\n\nconst ACTOR_PROMPT = `You are an intent-divergence analyst for an OTLP trace dataset. Your job is to find where the agent stopped doing what the user asked, and to establish **how early that was knowable**.\n\nThis dataset carries ground truth the other analysts do not have. When a human turn corrects the agent — \"no, I meant…\", \"stop doing X\", \"why are you still asking\" — the user has labelled a divergence for you. That label marks the END of the divergence, not its start. Your finding is the start: the earliest assistant turn already off-intent, the signal in the user's stated intent it contradicted, and the number of turns burned before the correction landed.\n\n${subjectGrammar}\n\nDISCOVERY → BACKTRACK → QUANTIFY → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Note the agent names and \\`sample_trace_ids\\`; conversational datasets carry several human turns per trace and those are the ones worth pulling.\n2. **DISCOVERY — find the corrective human turns.** Use \\`searchTrace\\` for user-authored corrections:\n   Every pattern MUST begin with \\`(?i)\\`. The trace store compiles a search pattern case-sensitively unless it opens with that flag, and corrections are overwhelmingly sentence-initial and capitalised (\"Stop\", \"No,\", \"I said\"), so a lowercase pattern silently returns zero hits.\n   - Imperative stops: \\`(?i)\\\\bstop\\\\b\\`, \\`(?i)\\\\b(don'?t|do not)\\\\b\\`, \\`(?i)^\\\\s*no[,.!]\\`, \\`(?i)\\\\bnot what I (wanted|asked|meant)\\\\b\\`, \\`(?i)\\\\bthat'?s not what\\\\b\\`, \\`(?i)\\\\brevert\\\\b\\`, \\`(?i)\\\\bstart over\\\\b\\`\n   - Repetition and frustration: \\`(?i)\\\\bI (said|asked|told you)\\\\b\\`, \\`(?i)\\\\balready told you\\\\b\\`, \\`(?i)\\\\bwhy are you (still )?\\\\w+ing\\\\b\\`, \\`(?i)\\\\bjust (do|use|write|make)\\\\b\\`, \\`(?i)\\\\bagain\\\\b\\`\n   - Clarification markers (second-order, see step 6): \\`(?i)\\\\bI mean(t)?\\\\b\\`, \\`(?i)\\\\bto be clear\\\\b\\`, \\`(?i)\\\\bactually,? I (want|need)\\\\b\\`, \\`(?i)\\\\bwhat I meant\\\\b\\`, \\`(?i)\\\\blet me rephrase\\\\b\\`\n   Attribute every match to a role before using it. The same phrases inside an assistant turn are hedging, not correction.\n3. **BACKTRACK — walk the trace backward from the correction.** Read the ordered turns preceding it with \\`viewTrace\\` / \\`viewSpans\\`. Locate the user's ORIGINAL statement of intent (usually the first human turn, sometimes a constraint added mid-run), then locate the FIRST assistant turn that contradicts it. That turn, not the correction, anchors the finding. Name the concrete signal already available at that turn: an explicit constraint the agent violated, a scope it exceeded, a different question it answered, a file or target the user never named, a decision the user had already made.\n4. **QUANTIFY — count the burned turns.** K = (index of the corrective human turn) − (index of the earliest detectable assistant turn). Report both indices and K. If you cannot locate an earliest-detectable turn, you have a correction and not a divergence: drop it.\n5. **CLUSTER.** Repeated corrections about the same misread intent are ONE finding citing all of them, not one finding per corrective turn. Corrections about genuinely different intents in the same trace are separate findings.\n6. **Second-order — the request itself was ambiguous.** When the user CLARIFIES rather than corrects (\"I mean the staging config, not prod\"), the agent's reading was defensible and the request was underspecified or self-contradictory. Emit those against a \\`scaffolding:*\\` locus — a clarifying-question policy or a plan checkpoint — because the fix is one sharp question before acting, priced against the K turns the ambiguity cost. Do not charge the agent's instructions for a request that could not be resolved from its own text.\n\n**Test competing anchors with subqueries.** After the backward walk, load the excerpts for the original intent turn, your candidate earliest-detectable turn, and the turn before it. Send one bounded \\`llm_query\\` per candidate anchor asking whether the divergence is already present in that turn's text alone. Subqueries cannot call trace tools, and a turn index alone is insufficient context. Take the EARLIEST candidate the loaded excerpts support.\n\nFor each cluster, emit ONE finding. Use an exact locus from the subject grammar — the surface whose edit prevents the divergence, not the surface where it surfaced. State the claim in the shape \"turn N did X against stated intent Y; user corrected at turn N+K, burning K turns.\" Rate it critical when the divergence produced a user-visible or irreversible action, high when K is 3 or more or the run ended without the intent satisfied, medium for one or two burned turns, and low for a cosmetic correction. Cite BOTH spans with exact quotes: the earliest-detectable assistant turn and the corrective human turn. Use confidence 0.85+ when the stated intent and the diverging turn are both quotable and the contradiction is explicit, and 0.6-0.8 when the earliest-detectable turn is inferred from surrounding context. The recommended action must be the literal instruction, question, or checkpoint to add.\n\nDo NOT report a divergence the agent noticed and reversed inside the same turn — that is self-correction and it cost the user nothing. Do NOT report a human turn that adds NEW scope; a changed mind is not a divergence. If the dataset holds no corrective or clarifying human turns, return an empty findings array instead of grading tone.`\n\nexport const INTENT_DIVERGENCE_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'intent-divergence',\n  description:\n    'Anchors each corrective human turn to the earliest assistant turn where the divergence from stated intent was already detectable, and prices it in burned turns.',\n  area: 'intent-divergence',\n  version: '1.0.0',\n  instructions: ACTOR_PROMPT,\n  // Backtracking reads the ordered turns BEFORE the correction, so the\n  // search-only group cannot serve this kind: discovery finds the label,\n  // viewTrace / viewSpans find the anchor.\n  toolGroup: 'all',\n  limits: { maxLlmCalls: 6, maxIterations: 22, maxToolCalls: 64 },\n  // Both ends of the divergence must be quoted — the anchor turn alone is an\n  // unlabelled guess, the corrective turn alone is the counting the\n  // deterministic pass already does.\n  minimumEvidenceCitations: 2,\n}\n","/**\n * Knowledge-gap analyst — what did the agent NOT know that it needed?\n *\n * Brief: find moments in the trace where the agent had to guess, ask\n * the user to fill in context, recover from a wrong assumption, or\n * loop on a retrieval. Each finding names a *missing or outdated piece\n * of knowledge* the agent's curated knowledge base should have held —\n * or a downstream lookup (web, docs, tool description) that surfaced\n * stale or outdated information.\n *\n * The primary expected store is `@tangle-network/agent-knowledge`: a\n * Karpathy-style wiki the agent maintains with raw ↔ curated pages,\n * source anchors, and claim/relation triples. A gap is anything the\n * agent had to discover at run-time that should already have lived\n * there. Secondary loci: web-search results that returned outdated\n * pages, tool descriptions that omitted critical behavior, system-\n * prompt sections that didn't cover the case.\n *\n * Distinct from failure-mode: failure-mode classifies *how* it broke;\n * knowledge-gap names the *information* whose absence (or staleness)\n * caused the break. One failure-mode often maps to several gaps.\n *\n * Five bounded model subqueries let the actor compare candidate gaps\n * across source layers after it has loaded the relevant excerpts.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('knowledge-gap')\n\nconst ACTOR_PROMPT = `You are a knowledge-gap analyst for an OTLP trace dataset. Your job is to identify the **specific pieces of information the agent lacked, or that were stale**, that caused poor decisions.\n\nThe agent under analysis maintains a curated knowledge base via \\`@tangle-network/agent-knowledge\\` — a wiki of \\`KnowledgePage\\`s with raw source anchors, claims, and relations. The primary expected store of agent-knowable facts IS that wiki. A \"knowledge gap\" is anything the agent had to discover or guess at run-time that the wiki should have held — or an outdated/contradictory fact the agent picked up from a non-wiki source.\n\n${subjectGrammar}\n\nDISCOVERY → ATTRIBUTE-TO-LAYER → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Note which agents, tools, and models appear.\n2. Pull traces where the agent shows gap signals. The strongest signals are:\n   - Self-correction turns (\"I assumed X but…\", \"let me re-check\", \"actually,\")\n   - Clarifying-question turns where the agent asked the user something the runtime should have surfaced\n   - Repeated retrieval / lookup calls for the same artifact with slightly varied queries\n   - Tool errors that name a missing argument or unknown resource\n   - Web-search calls returning pages dated before a known cutoff for content that changes (versioned APIs, schemas, policies)\n   - Agent quoting a tool's docs / system prompt incorrectly because the actual text was insufficient\n   - Fabricated identifiers that don't appear in dataset \\`sample_trace_ids\\`\n   Use \\`searchTrace\\` with patterns like \\`I (don.?t|do not) know\\`, \\`assumed\\`, \\`unclear\\`, \\`could you (clarify|tell me|provide)\\`, \\`not found\\`, \\`undefined\\`, \\`unknown\\`, \\`null\\`, dates older than the analysis window, or the agent's specific clarification phrases.\n3. For each gap, identify the **layer of the runtime that should have prevented it** and use its exact locus from the subject grammar above.\n4. For each defensible gap, emit ONE finding. Use an exact locus from the subject grammar and name the missing or stale knowledge (for example, \"wiki has no page on invoice line-item shape; agent re-derived it from raw spans\"). Rate it high when it caused failure or a clarifying question, medium for unnecessary turns, and low for minor inefficiency. Cite the span where the question, correction, retrieval miss, or stale result surfaced and quote it exactly. Use confidence 0.85+ when the agent articulated the gap and 0.6-0.8 when inferred. Recommend a concrete wiki edit for an agent-knowledge locus or a prompt/tool-description edit otherwise.\n\n**Compare layers over loaded evidence.** After the first scan, load the exact excerpts behind candidates across \\`agent-knowledge:*\\`, \\`websearch:outdated\\`, \\`tool-doc:*\\`, \\`system-prompt:*\\`, and \\`memory:*\\`. Use one bounded \\`llm_query\\` per layer to classify those excerpts. Subqueries cannot call trace tools. Merge their classifications into the final finding set only when the source excerpts support them.\n\nDo NOT report a gap that the agent later recovered from cleanly within the same turn. That is resilience, not a gap. Cite the non-recovery version when both exist.`\n\nexport const KNOWLEDGE_GAP_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'knowledge-gap',\n  description:\n    'Identifies missing or stale pieces of knowledge — primarily against the agent-knowledge wiki — and attributes each to the runtime layer (wiki page, claim, raw source, websearch, tool-doc, system-prompt, memory) that should have held it.',\n  area: 'knowledge-gap',\n  version: '1.2.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'discoveryAndSearch',\n  limits: { maxLlmCalls: 5, maxIterations: 18, maxToolCalls: 48 },\n}\n","/**\n * Knowledge-poisoning analyst — what FALSE information misled the agent?\n *\n * Brief: find moments where the agent acted on information that was\n * *wrong* — stale memory, RAG documents that contradicted ground truth,\n * tool descriptions that lied about return shapes, system-prompt\n * instructions that no longer matched reality, prior-run summaries that\n * cached a wrong decision.\n *\n * Distinct from knowledge-gap: a gap is \"the agent didn't know X\"; a\n * poisoning is \"the agent confidently used X, but X was wrong.\" Gaps\n * surface as questions / self-correction; poisonings surface as\n * confident-but-wrong actions that downstream evidence contradicts.\n *\n * Eight bounded model subqueries let the actor independently assess\n * the action and contradiction excerpts for candidate poisonings.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('knowledge-poisoning')\n\nconst ACTOR_PROMPT = `You are a knowledge-poisoning analyst for an OTLP trace dataset. Your job is to identify cases where the agent **confidently used wrong information** — not where it lacked information (that's the knowledge-gap analyst).\n\n${subjectGrammar}\n\nDISCOVERY → DUAL-VERIFY → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Identify the agents, models, and tools.\n2. Pull traces where the agent's confident action was later contradicted. Strongest signals:\n   - Agent stated a fact in one span; a later span surfaced contradictory evidence; the agent then proceeded anyway or fabricated reconciliation.\n   - Tool call with stale arguments (an id that no longer exists, an API shape that changed).\n   - Agent cited an \\`agent-knowledge\\` wiki page or claim whose content contradicts the trace's own evidence — the wiki itself drifted.\n   - Web-search result the agent cited that returned an outdated page; agent treated it as canonical.\n   - System-prompt instruction the agent followed that ground-truth evidence in the trace contradicts (e.g. prompt says \"use endpoint A\"; tool reply says \"endpoint A deprecated, use B\").\n   - Repeated wrong-shape parsing despite the tool's actual output proving the shape.\n3. Use \\`searchTrace\\` with regex on phrases like \\`actually\\`, \\`turns out\\`, \\`previously assumed\\`, \\`old version\\`, \\`deprecated\\`, \\`updated to\\`, \\`now uses\\`, or specific entity names you suspect have changed.\n4. For each candidate poisoning, **DUAL-VERIFY**:\n   - Confirm the agent actually acted on the false belief (cite the span where it did)\n   - Confirm the belief is actually false in this trace's own evidence (cite the span that contradicts it)\n   Only emit a finding when both halves are supported. If you can only support one, drop it because single-evidence poisoning findings are too speculative to be useful.\n\n**Independently assess both halves.** Load the action excerpt and contradicting excerpt yourself, then send bounded \\`llm_query\\` calls the exact evidence for \"did the agent act?\" and \"does the trace contradict the belief?\" Subqueries cannot call trace tools. Accept a poisoning only when both assessments and the source excerpts support it.\n\nFor each confirmed poisoning, emit ONE finding. Use the source of the false belief as the exact subject. State \"agent believed X (from source S); trace evidence shows X is false.\" Rate it critical for a wrong user-visible action, high when caught internally after significant waste, and medium for inefficiency. Cite BOTH the action span and the contradicting span with exact quotes. Use confidence 0.85+ when both halves have exact quotes and 0.6-0.8 when one half is inferred. Recommend the literal source correction: update the wiki claim, invalidate and re-curate the raw source, or replace the stale prompt/tool instruction.\n\nDo NOT report a finding if the agent caught and corrected the false belief in the same turn. Reserve poisoning for cases where the false belief shaped downstream action.`\n\nexport const KNOWLEDGE_POISONING_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'knowledge-poisoning',\n  description:\n    'Identifies confident-but-wrong actions caused by stale memory, contradicting RAG, deprecated tool docs, or outdated system-prompt instructions.',\n  area: 'knowledge-poisoning',\n  version: '1.2.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'all',\n  limits: { maxLlmCalls: 8, maxIterations: 20, maxToolCalls: 64 },\n  minimumEvidenceCitations: 2,\n}\n","/**\n * Default analyst kinds focused on agent failure + recursive\n * self-improvement.\n *\n * The five kinds chain. Two independent classifiers partition the\n * outcome surface: failure-mode names how a run broke, intent-divergence\n * names where it drifted from what the user asked and how many turns\n * that cost. Knowledge-gap and knowledge-poisoning then explain *why* in\n * two orthogonal ways — missing information versus false information.\n * Improvement proposes the concrete edits. Register all five against the\n * same trace store in this order and run the registry with\n * `chainFindings: true` to pass each completed kind's findings to the\n * kinds that follow it.\n */\n\nexport {\n  CONTROL_INTEGRITY_ANALYST,\n  ControlIntegrityAnalyst,\n  emitControlIntegrityFindings,\n} from './control-integrity'\nexport { FAILURE_MODE_KIND_SPEC } from './failure-mode'\nexport { IMPROVEMENT_KIND_SPEC } from './improvement'\nexport { INTENT_DIVERGENCE_KIND_SPEC } from './intent-divergence'\nexport { KNOWLEDGE_GAP_KIND_SPEC } from './knowledge-gap'\nexport { KNOWLEDGE_POISONING_KIND_SPEC } from './knowledge-poisoning'\n\nimport type { TraceAnalystDefinition } from '../kind-factory'\nimport { FAILURE_MODE_KIND_SPEC } from './failure-mode'\nimport { IMPROVEMENT_KIND_SPEC } from './improvement'\nimport { INTENT_DIVERGENCE_KIND_SPEC } from './intent-divergence'\nimport { KNOWLEDGE_GAP_KIND_SPEC } from './knowledge-gap'\nimport { KNOWLEDGE_POISONING_KIND_SPEC } from './knowledge-poisoning'\n\n/**\n * The default kind suite. Order is the run order operators should use:\n * failure-mode and intent-divergence first (neither reads upstream\n * findings), gap + poisoning next (both explain the problems those two\n * found), improvement last (chains all four). Intent-divergence sits\n * ahead of improvement deliberately — a proposed edit should be able to\n * act on a priced divergence, and it is the only kind whose findings\n * carry a burned-turn cost to rank against.\n */\nexport const DEFAULT_TRACE_ANALYST_KINDS: readonly TraceAnalystDefinition[] = [\n  FAILURE_MODE_KIND_SPEC,\n  INTENT_DIVERGENCE_KIND_SPEC,\n  KNOWLEDGE_GAP_KIND_SPEC,\n  KNOWLEDGE_POISONING_KIND_SPEC,\n  IMPROVEMENT_KIND_SPEC,\n] as const\n","/**\n * AnalystRegistry — orchestrate N analysts against one run.\n *\n * Owns three responsibilities and only three:\n *   1. Registration — ids must be unique; bad registrations fail loudly\n *      at register-time, not run-time.\n *   2. Routing — each analyst declares its `inputKind`; the registry\n *      picks the matching field from AnalystRunInputs and skips the\n *      analyst with a logged reason if it's missing.\n *   3. Isolation — one analyst's exception MUST NOT stop other analysts.\n *      Failed analysts produce zero findings + a 'failed' summary row.\n *\n * Cross-cutting concerns (telemetry, error → finding conversion, cost\n * ingestion, storage rotation) live in `AnalystHooks`. Budget shaping\n * (equal split vs weighted vs custom) lives in `BudgetPolicy`. Both\n * have sensible defaults; consumers override only what they need.\n */\n\nimport { randomUUID } from 'node:crypto'\nimport { z } from 'zod'\nimport { combineAbortSignals } from '../abort-signal'\nimport type { CostLedgerHandle } from '../cost-ledger'\nimport {\n  snapshotAnalystFindings,\n  snapshotExactAnalystRunReceipt,\n} from '../feedback-trajectory-review'\nimport { canonicalString, hashCanonical } from '../ledger-core/canonical'\nimport { deepFreezeCanonicalJson } from '../ledger-core/deep-freeze'\nimport type { RunCostProvenance, RunTokenUsage } from '../run-record'\nimport type { ChatClient } from './chat-client'\nimport type {\n  ExactAnalystExecutionPlanSnapshot,\n  ExactAnalystRunEvent,\n  ExactAnalystRunResult,\n  ExactCapableAnalyst,\n  ExactExecutionComponentIdentity,\n  ExactExecutionComponentSnapshot,\n} from './exact-types'\nimport { snapshotExactExecutionComponentIdentity, snapshotExactExecutionPlan } from './exact-types'\nimport type {\n  Analyst,\n  AnalystContext,\n  AnalystFinding,\n  AnalystRunEvent,\n  AnalystRunInputs,\n  AnalystRunResult,\n  AnalystRunSummary,\n  AnalystUsageReceipt,\n} from './types'\nimport { assertValidAnalystUsageReceipt, validateUsageSettlementTimeout } from './usage-receipt'\n\n// ── Hook + policy surfaces ─────────────────────────────────────────\n\nexport interface AnalystHooks {\n  /** Legacy runs may mutate ctx; exact runs provide a frozen observational context. */\n  onBeforeAnalyze?(args: {\n    analyst: Analyst\n    ctx: AnalystContext\n    runId: string\n  }): void | Promise<void>\n  /** After every analyst (ok | failed | skipped). Use for telemetry, ingestion, rotation. */\n  onAfterAnalyze?(args: {\n    analyst: Analyst\n    summary: AnalystRunSummary\n    findings: AnalystFinding[]\n    runId: string\n  }): void | Promise<void>\n  /**\n   * On analyst exception. Hook MAY return findings to convert the\n   * error into structured findings; the summary still reports 'failed'.\n   * Return void to keep the default empty-findings behavior.\n   */\n  onError?(args: {\n    analyst: Analyst\n    error: Error\n    runId: string\n  }): AnalystFinding[] | undefined | Promise<AnalystFinding[] | undefined>\n  /** Once after registry.run() completes. Use for final aggregation, persistence. */\n  onComplete?(args: { result: AnalystRunResult }): void | Promise<void>\n}\n\nexport interface BudgetPolicy {\n  /** Overall USD cap across the registry.run(). */\n  totalUsd?: number\n  /** Per-analyst weight for the default allocator. Missing ids get weight 1. */\n  weights?: Record<string, number>\n  /**\n   * Custom allocator — receives the analyst, remaining/total budget, and\n   * the count of analysts that will run. Returns the per-analyst budget\n   * (or undefined only when the run has no overall cap). Overrides weights\n   * when set.\n   */\n  allocate?: (args: {\n    analyst: Analyst\n    totalUsd: number | undefined\n    remainingUsd: number | undefined\n    runningCount: number\n  }) => number | undefined\n}\n\nexport interface AnalystRegistryOptions {\n  /** Shared chat client passed to every LLM analyst via AnalystContext. */\n  chat?: ChatClient\n  /** Logger callback. Defaults to a no-op. */\n  log?: (msg: string, fields?: Record<string, unknown>) => void\n  /** Hooks invoked around analyze() — observability + customization seam. */\n  hooks?: AnalystHooks\n  /** Required identity/config when `runExact` applies `hooks`. */\n  hooksIdentity?: ExactExecutionComponentIdentity\n  /** Default budget when run() doesn't override. */\n  defaultBudget?: BudgetPolicy\n  /** Required identity/config when `runExact` provides `chat`. */\n  chatIdentity?: ExactExecutionComponentIdentity\n}\n\nexport interface RegistryRunOpts {\n  /** Restrict to a subset of registered analysts by id. */\n  only?: string[]\n  /** Skip these analysts even if registered. Useful for cheap iteration. */\n  skip?: string[]\n  /** Budget policy — totalUsd + optional weights/allocator. Falls back to options.defaultBudget. */\n  budget?: BudgetPolicy\n  /** Active-work cap for the complete registry run. Model receipt settlement may follow. */\n  timeoutMs?: number\n  /** Abort signal — forwarded into every analyst's context. */\n  signal?: AbortSignal\n  /** Shared paid-call account forwarded to every analyst. */\n  costLedger?: CostLedgerHandle\n  /** Attribution phase for calls written to `costLedger`. */\n  costPhase?: string\n  /** Tags echoed into AnalystContext.tags — useful for tracking environment/version in findings. */\n  tags?: Record<string, string>\n  /**\n   * Prior-run findings made available as retrieval context to every\n   * analyst via `ctx.priorFindings`. The registry forwards the slice\n   * whose `analyst_id` matches each registered analyst so a kind sees\n   * only its own history. Pass `{ '*': findings }` to broadcast to\n   * every analyst (useful when several kinds share the same historical\n   * context). For findings from this run, use `chainFindings` instead.\n   */\n  priorFindings?: ReadonlyArray<AnalystFinding> | Record<string, ReadonlyArray<AnalystFinding>>\n  /**\n   * Pass findings produced earlier in this registry run to each later analyst\n   * via `ctx.upstreamFindings`. Registration order is dependency order.\n   * Disabled by default because independent analyst suites must opt in.\n   */\n  chainFindings?: boolean\n}\n\n/** A caller-selected allocation rule for an exact analyst run. */\nexport type ExactAnalystBudgetPolicy =\n  | {\n      readonly kind: 'equal'\n      readonly totalUsd: number\n    }\n  | {\n      readonly kind: 'weighted'\n      readonly totalUsd: number\n      /** One explicit weight for every selected analyst id. */\n      readonly weights: Readonly<Record<string, number>>\n    }\n\n/**\n * Complete per-run analyst policy.\n *\n * Every field is required. `null` explicitly disables an optional resource or context channel.\n * `analystIds` is execution order; it is not filtered through registry insertion order.\n * Missing-input behavior is explicit so callers cannot accidentally inherit it by omission.\n * Exact runs are serial; more elaborate scheduling belongs in the caller's runtime.\n */\nexport interface ExactRegistryRunOpts {\n  readonly analystIds: readonly string[]\n  readonly budget: ExactAnalystBudgetPolicy | null\n  readonly totalTimeoutMs: number | null\n  readonly signal: AbortSignal | null\n  readonly costLedger: CostLedgerHandle | null\n  readonly costLedgerIdentity: ExactExecutionComponentIdentity | null\n  readonly costPhase: string | null\n  readonly tags: Readonly<Record<string, string>> | null\n  readonly priorFindings:\n    | ReadonlyArray<AnalystFinding>\n    | Readonly<Record<string, ReadonlyArray<AnalystFinding>>>\n    | null\n  readonly chainFindings: boolean\n  readonly missingInputMode: 'skip' | 'abort'\n  readonly applyRegistryHooks: boolean\n  readonly useRegistryChat: boolean\n}\n\ntype NormalizedBudgetPlan =\n  | { readonly kind: 'none' }\n  | { readonly kind: 'dynamic'; readonly policy: BudgetPolicy }\n\ninterface PreparedAnalyst {\n  readonly analyst: Analyst\n  readonly input:\n    | { readonly kind: 'present'; readonly value: unknown }\n    | { readonly kind: 'missing' }\n}\n\ninterface AnalystExecutionPlan {\n  readonly runId: string\n  readonly prepared: readonly PreparedAnalyst[]\n  readonly budget: NormalizedBudgetPlan\n  readonly totalTimeoutMs: number | null\n  readonly signal: AbortSignal | null\n  readonly costLedger: CostLedgerHandle | null\n  readonly costPhase: string | null\n  readonly tags: Readonly<Record<string, string>> | null\n  readonly priorFindings:\n    | ReadonlyArray<AnalystFinding>\n    | Readonly<Record<string, ReadonlyArray<AnalystFinding>>>\n    | null\n  readonly chainFindings: boolean\n  readonly hooks: AnalystHooks\n  readonly chat: ChatClient | undefined\n  readonly log: (msg: string, fields?: Record<string, unknown>) => void\n  readonly executionSnapshot: ExactAnalystExecutionPlanSnapshot | undefined\n}\n\ntype InternalAnalystRunEvent = AnalystRunEvent\n\n/** A post-start exact-run failure; completed work remains attached for accounting and review. */\nexport class ExactAnalystRunExecutionError extends Error {\n  readonly name: string = 'ExactAnalystRunExecutionError'\n  readonly result: ExactAnalystRunResult\n\n  constructor(message: string, result: ExactAnalystRunResult, options?: ErrorOptions) {\n    super(message, options)\n    const snapshot = snapshotExactAnalystRunReceipt(result, 'ExactAnalystRunExecutionError result')\n    if (snapshot.completion.status !== 'failed') {\n      throw new TypeError('ExactAnalystRunExecutionError result must be a failed receipt')\n    }\n    this.result = snapshot\n  }\n}\n\nexport class AnalystRegistry {\n  private readonly analysts = new Map<string, Analyst>()\n  private readonly options: AnalystRegistryOptions\n\n  constructor(options: AnalystRegistryOptions = {}) {\n    this.options = options\n  }\n\n  register(analyst: Analyst): void {\n    const id = analyst.id\n    const version = analyst.version\n    const cost = analyst.cost\n    if (!id) throw new Error('AnalystRegistry.register: analyst.id is required')\n    if (this.analysts.has(id)) {\n      throw new Error(`AnalystRegistry.register: duplicate analyst id \"${id}\"`)\n    }\n    if (!version) {\n      throw new Error(`AnalystRegistry.register: analyst \"${id}\" must declare a version`)\n    }\n    if (cost.kind === 'deterministic' && cost.settlement_timeout_ms !== undefined) {\n      throw new TypeError(\n        `AnalystRegistry.register: deterministic analyst \"${id}\" cannot declare settlement_timeout_ms`,\n      )\n    }\n    if (cost.settlement_timeout_ms !== undefined) {\n      validateUsageSettlementTimeout(cost.settlement_timeout_ms)\n    }\n    this.analysts.set(id, analyst)\n  }\n\n  list(): ReadonlyArray<{\n    id: string\n    description: string\n    version: string\n    cost: Analyst['cost']\n  }> {\n    return Array.from(this.analysts.values()).map((a) => ({\n      id: a.id,\n      description: a.description,\n      version: a.version,\n      cost: a.cost,\n    }))\n  }\n\n  async run(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: RegistryRunOpts = {},\n  ): Promise<AnalystRunResult> {\n    // Thin collector over `runStream`. Both surfaces share the same\n    // loop body so they cannot drift on isolation / hook order / cost.\n    for await (const ev of this.runStream(runId, inputs, runOpts)) {\n      if (ev.type === 'run-completed') return ev.result\n    }\n    throw new Error('AnalystRegistry.run: stream completed without run-completed event')\n  }\n\n  /** Run exactly the ordered analysts and complete policy supplied by the caller. */\n  async runExact(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: ExactRegistryRunOpts,\n  ): Promise<ExactAnalystRunResult> {\n    for await (const ev of this.runExactStream(runId, inputs, runOpts)) {\n      if (ev.type === 'run-completed') return ev.result\n    }\n    throw new Error('AnalystRegistry.runExact: stream completed without run-completed event')\n  }\n\n  /** Streaming counterpart to {@link runExact}. */\n  async *runExactStream(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: ExactRegistryRunOpts,\n  ): AsyncGenerator<ExactAnalystRunEvent, void, void> {\n    for await (const event of this.executePlanStream(\n      this.normalizeExactPlan(runId, inputs, runOpts),\n    )) {\n      yield event as ExactAnalystRunEvent\n    }\n  }\n\n  /**\n   * Streaming counterpart to `run()`. Emits `AnalystRunEvent` values\n   * in real time — `run-started`, then per-analyst `skipped` /\n   * `started` / `completed`, then a terminal `run-completed` whose\n   * payload is the full `AnalystRunResult`. UIs use this to render\n   * progress; persistence consumers use `run()` and read the result.\n   *\n   * Hooks (`onBeforeAnalyze` / `onAfterAnalyze` / `onError` /\n   * `onComplete`) fire as before — streaming is additive, not a hook\n   * replacement.\n   */\n  async *runStream(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: RegistryRunOpts = {},\n  ): AsyncGenerator<AnalystRunEvent, void, void> {\n    yield* this.executePlanStream(this.normalizeLegacyPlan(runId, inputs, runOpts))\n  }\n\n  private normalizeLegacyPlan(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: RegistryRunOpts,\n  ): AnalystExecutionPlan {\n    const timeoutMs = validateTimeout(runOpts.timeoutMs) ?? null\n    const budget = runOpts.budget ?? this.options.defaultBudget\n    validateBudgetPolicy(budget)\n    const selected = this.selectAnalysts(runOpts)\n    return {\n      runId,\n      prepared: selected.map((analyst) => ({\n        analyst,\n        input: this.routeInput(analyst, inputs),\n      })),\n      budget: budget ? { kind: 'dynamic', policy: budget } : { kind: 'none' },\n      totalTimeoutMs: timeoutMs,\n      signal: runOpts.signal ?? null,\n      costLedger: runOpts.costLedger ?? null,\n      costPhase: runOpts.costPhase ?? null,\n      tags: runOpts.tags ?? null,\n      priorFindings: runOpts.priorFindings ?? null,\n      chainFindings: runOpts.chainFindings ?? false,\n      hooks: this.options.hooks ?? {},\n      chat: this.options.chat,\n      log: this.options.log ?? (() => {}),\n      executionSnapshot: undefined,\n    }\n  }\n\n  private normalizeExactPlan(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: ExactRegistryRunOpts,\n  ): AnalystExecutionPlan {\n    const exactRunId = snapshotExactRunId(runId)\n    const exact = snapshotExactRegistryRunOpts(runOpts)\n    const selected = normalizeExactAnalysts(this.selectExactAnalysts(exact.analystIds))\n    const registryChat = this.options.chat\n    const registryChatIdentity = this.options.chatIdentity\n    const registryHooks = this.options.hooks\n    const registryHooksIdentity = this.options.hooksIdentity\n    if (exact.useRegistryChat && registryChat === undefined) {\n      throw new TypeError(\n        'ExactRegistryRunOpts.useRegistryChat is true but the registry has no chat client',\n      )\n    }\n    if (exact.applyRegistryHooks && !hasRegistryHooks(registryHooks)) {\n      throw new TypeError(\n        'ExactRegistryRunOpts.applyRegistryHooks is true but the registry has no lifecycle hooks',\n      )\n    }\n    const inputSnapshot = snapshotAnalystRunInputChannels(inputs)\n    const prepared = selected.map((analyst) => ({\n      analyst,\n      input: this.routeInput(analyst, inputSnapshot),\n    }))\n    if (exact.missingInputMode === 'abort') {\n      const missing = prepared.find((candidate) => candidate.input.kind === 'missing')?.analyst\n      if (missing) {\n        throw new TypeError(\n          `ExactRegistryRunOpts.missingInputMode abort preflight found no \"${missing.inputKind}\" input for \"${missing.id}\"`,\n        )\n      }\n    }\n    const hooksIdentity =\n      exact.applyRegistryHooks && registryHooks\n        ? requireExactComponentIdentity(registryHooksIdentity, 'registry hooks')\n        : null\n    const chatIdentity = exact.useRegistryChat\n      ? requireExactComponentIdentity(registryChatIdentity, 'registry chat')\n      : null\n    const costLedgerIdentity =\n      exact.costLedger === null\n        ? null\n        : requireExactComponentIdentity(exact.costLedgerIdentity ?? undefined, 'cost ledger')\n    const allocations = exactFixedBudgets(\n      exact.budget,\n      prepared\n        .filter(\n          (\n            candidate,\n          ): candidate is {\n            analyst: ExactCapableAnalyst\n            input: { kind: 'present'; value: unknown }\n          } => candidate.input.kind === 'present',\n        )\n        .map((candidate) => candidate.analyst),\n      selected,\n    )\n    const executionSnapshot = exactExecutionSnapshot(\n      selected,\n      exact,\n      allocations,\n      costLedgerIdentity,\n      hooksIdentity,\n      chatIdentity,\n    )\n    return {\n      runId: exactRunId,\n      prepared,\n      budget: { kind: 'none' },\n      totalTimeoutMs: exact.totalTimeoutMs,\n      signal: exact.signal,\n      costLedger: exact.costLedger,\n      costPhase: exact.costPhase,\n      tags: exact.tags,\n      priorFindings: exact.priorFindings,\n      chainFindings: exact.chainFindings,\n      hooks: exact.applyRegistryHooks && registryHooks ? snapshotHooks(registryHooks) : {},\n      chat: exact.useRegistryChat && registryChat ? snapshotChat(registryChat) : undefined,\n      // Exact runs expose live events and versioned hooks. An inherited logger is intentionally\n      // excluded because an anonymous callback can throw, block, or mutate shared state.\n      log: () => {},\n      executionSnapshot,\n    }\n  }\n\n  private async *executePlanStream(\n    plan: AnalystExecutionPlan,\n  ): AsyncGenerator<InternalAnalystRunEvent, void, void> {\n    const exact = plan.executionSnapshot !== undefined\n    if (exact && plan.signal?.aborted) throw abortReason(plan.signal)\n\n    const correlationId = `ar_${randomUUID().slice(0, 12)}`\n    const log = plan.log\n    const startedAt = new Date().toISOString()\n    const started = Date.now()\n    const timeoutSignal =\n      plan.totalTimeoutMs === null ? undefined : AbortSignal.timeout(plan.totalTimeoutMs)\n    const runSignal = combineAbortSignals(plan.signal ?? undefined, timeoutSignal)\n    const deadlineMs = plan.totalTimeoutMs === null ? undefined : started + plan.totalTimeoutMs\n    const runnable = plan.prepared\n      .filter(\n        (\n          candidate,\n        ): candidate is {\n          analyst: Analyst\n          input: { kind: 'present'; value: unknown }\n        } => candidate.input.kind === 'present',\n      )\n      .map((candidate) => candidate.analyst)\n    let remainingUsd = plan.budget.kind === 'dynamic' ? plan.budget.policy.totalUsd : undefined\n    const weights = plan.budget.kind === 'dynamic' ? plan.budget.policy.weights : undefined\n    const totalWeight =\n      weights &&\n      plan.budget.kind === 'dynamic' &&\n      plan.budget.policy.totalUsd != null &&\n      !plan.budget.policy.allocate &&\n      runnable.length > 0\n        ? runnable.reduce((sum, analyst) => sum + analystWeight(weights, analyst.id), 0)\n        : undefined\n    if (totalWeight === 0) {\n      throw new Error('BudgetPolicy.weights must allocate positive weight to a runnable analyst')\n    }\n    const upstreamFindings: AnalystFinding[] = []\n\n    yield snapshotExecutionEvent(\n      {\n        type: 'run-started',\n        run_id: plan.runId,\n        correlation_id: correlationId,\n        started_at: startedAt,\n        analyst_ids: plan.prepared.map(({ analyst }) => analyst.id),\n        ...(plan.executionSnapshot === undefined ? {} : { execution_plan: plan.executionSnapshot }),\n      },\n      exact,\n    )\n\n    const executions: AnalystExecution[] = []\n    let executionFailure: unknown\n\n    for (const { analyst, input } of plan.prepared) {\n      const t0 = Date.now()\n      if (runSignal?.aborted) {\n        const summary = abortedBeforeStartSummary(analyst, runSignal)\n        executions.push({ summary, findings: [], budgetDebitUsd: 0 })\n        log(`[analyst] skip ${analyst.id} — run aborted`, {\n          runId: plan.runId,\n          reason: summary.reason,\n        })\n        yield snapshotExecutionEvent({ type: 'analyst-skipped', summary }, exact)\n        if (exact) {\n          executionFailure = abortReason(runSignal)\n          break\n        }\n        continue\n      }\n\n      if (input.kind === 'missing') {\n        const summary: AnalystRunSummary = {\n          analyst_id: analyst.id,\n          status: 'skipped',\n          reason: `missing input of kind '${analyst.inputKind}'`,\n          findings_count: 0,\n          latency_ms: 0,\n          usage: zeroUsage(),\n        }\n        const execution = { summary, findings: [], budgetDebitUsd: 0 } satisfies AnalystExecution\n        executions.push(execution)\n        log(`[analyst] skip ${analyst.id} — missing input`, {\n          runId: plan.runId,\n          kind: analyst.inputKind,\n        })\n        const hookValues = snapshotAfterHookValues(summary, [], exact)\n        try {\n          await waitForHook(\n            plan.hooks.onAfterAnalyze\n              ? () =>\n                  plan.hooks.onAfterAnalyze?.({\n                    analyst,\n                    summary: hookValues.summary,\n                    findings: hookValues.findings,\n                    runId: plan.runId,\n                  })\n              : undefined,\n            runSignal,\n          )\n        } catch (error) {\n          if (!exact) throw error\n          executionFailure = error\n        }\n        yield snapshotExecutionEvent({ type: 'analyst-skipped', summary }, exact)\n        if (executionFailure !== undefined) break\n        continue\n      }\n\n      const allocatedUsd =\n        plan.executionSnapshot === undefined\n          ? allocateBudget(plan.budget.kind === 'dynamic' ? plan.budget.policy : undefined, {\n              analyst,\n              remainingUsd,\n              runningCount: runnable.length,\n              totalWeight,\n            })\n          : exactPlannedAllocation(plan.executionSnapshot, analyst.id)\n      const budgetCeilingUsd = plan.executionSnapshot === undefined ? remainingUsd : allocatedUsd\n      const usageReceipts: AnalystUsageReceipt[] = []\n      const contextTags = plan.tags === null ? undefined : { ...plan.tags }\n      const priorFindings = selectPriorFindings(plan.priorFindings ?? undefined, analyst.id)\n      const chainedFindings =\n        plan.chainFindings && upstreamFindings.length > 0 ? [...upstreamFindings] : undefined\n      const ctx: AnalystContext = {\n        runId: plan.runId,\n        correlationId,\n        deadlineMs,\n        budgetUsd: allocatedUsd,\n        costLedger: plan.costLedger ?? undefined,\n        costPhase: plan.costPhase ?? undefined,\n        chat: plan.chat,\n        tags: contextTags,\n        log: (message, fields) =>\n          log(`[${analyst.id}] ${message}`, {\n            runId: plan.runId,\n            correlationId,\n            ...fields,\n          }),\n        signal: runSignal,\n        priorFindings,\n        upstreamFindings: chainedFindings,\n        recordUsage: (receipt) => {\n          if (!exact) {\n            assertValidAnalystUsageReceipt(receipt)\n            usageReceipts.push(receipt)\n            return\n          }\n          usageReceipts.push(\n            snapshotUsageReceiptOnce(\n              receipt,\n              `AnalystRegistry.runExact analyst \"${analyst.id}\" usage`,\n            ),\n          )\n        },\n      }\n      if (exact) {\n        if (contextTags) deepFreezeCanonicalJson(contextTags)\n        if (priorFindings) deepFreezeCanonicalJson(priorFindings)\n        if (chainedFindings) deepFreezeCanonicalJson(chainedFindings)\n        Object.freeze(ctx)\n      }\n\n      try {\n        await waitForHook(\n          plan.hooks.onBeforeAnalyze\n            ? () => plan.hooks.onBeforeAnalyze?.({ analyst, ctx, runId: plan.runId })\n            : undefined,\n          runSignal,\n        )\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      if (runSignal?.aborted) {\n        const summary = abortedBeforeStartSummary(analyst, runSignal, Date.now() - t0)\n        executions.push({ summary, findings: [], budgetDebitUsd: 0 })\n        yield snapshotExecutionEvent({ type: 'analyst-skipped', summary }, exact)\n        if (exact) {\n          executionFailure = abortReason(runSignal)\n          break\n        }\n        continue\n      }\n      let effectiveBudget: number | undefined\n      try {\n        effectiveBudget = validateEffectiveBudget(ctx.budgetUsd, budgetCeilingUsd, analyst.id)\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      const analystContext: AnalystContext = exact ? ctx : { ...ctx }\n      const executionSignal = exact ? ctx.signal : runSignal\n      yield snapshotExecutionEvent(\n        {\n          type: 'analyst-started',\n          analyst_id: analyst.id,\n          started_at: new Date(t0).toISOString(),\n        },\n        exact,\n      )\n\n      let findings: AnalystFinding[]\n      let summary: AnalystRunSummary\n      let lifecycleFailure: unknown\n      let analysisFailure: Error | undefined\n      try {\n        if (runSignal?.aborted) throw abortReason(runSignal)\n        const analyzed = await waitForOperation(\n          (analyst as Analyst<unknown>).analyze(input.value, analystContext),\n          executionSignal,\n          analystAbortGraceMs(analyst),\n        )\n        findings = snapshotExecutionFindings(\n          analyzed,\n          exact,\n          `AnalystRegistry.runExact analyst \"${analyst.id}\" findings`,\n        )\n      } catch (error) {\n        const cause = error instanceof Error ? error : new Error(String(error))\n        analysisFailure = cause\n        let hookFindings: AnalystFinding[] = []\n        if (!executionSignal?.aborted) {\n          try {\n            const rawHookFindings =\n              (await waitForHook(\n                plan.hooks.onError\n                  ? () =>\n                      plan.hooks.onError?.({\n                        analyst,\n                        error: cause,\n                        runId: plan.runId,\n                      })\n                  : undefined,\n                executionSignal,\n              )) ?? []\n            hookFindings = snapshotExecutionFindings(\n              rawHookFindings,\n              exact,\n              `AnalystRegistry.runExact analyst \"${analyst.id}\" onError findings`,\n            )\n          } catch (error) {\n            lifecycleFailure = error\n          }\n        }\n        findings = hookFindings\n      }\n\n      let usage: AnalystUsageReceipt\n      try {\n        usage = resolveUsage(analyst, usageReceipts, exact)\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      if (analysisFailure === undefined) {\n        summary = {\n          analyst_id: analyst.id,\n          status: 'ok',\n          findings_count: findings.length,\n          latency_ms: Date.now() - t0,\n          usage,\n          ...(exact ? { allocated_budget_usd: effectiveBudget ?? null } : {}),\n        }\n        log(`[analyst] ok ${analyst.id}`, {\n          runId: plan.runId,\n          findings: findings.length,\n          latency_ms: summary.latency_ms,\n          cost_usd: knownCostUsd(usage),\n          cost_kind: usage.cost.kind,\n          input_tokens: usage.tokens?.input ?? null,\n          output_tokens: usage.tokens?.output ?? null,\n        })\n      } else {\n        const errorClass = analysisFailure.constructor.name || 'Error'\n        const errorMessage =\n          exact && analysisFailure.message.length === 0\n            ? 'Analyst failed without an error message'\n            : analysisFailure.message\n        summary = {\n          analyst_id: analyst.id,\n          status: 'failed',\n          findings_count: findings.length,\n          latency_ms: Date.now() - t0,\n          usage,\n          ...(exact ? { allocated_budget_usd: effectiveBudget ?? null } : {}),\n          error: { class: errorClass, message: errorMessage },\n        }\n        log(`[analyst] FAIL ${analyst.id}`, {\n          runId: plan.runId,\n          error_class: errorClass,\n          error: errorMessage,\n          cost_usd: knownCostUsd(usage),\n          cost_kind: usage.cost.kind,\n        })\n      }\n      logUncapturedBudgetWarning({\n        analyst,\n        runId: plan.runId,\n        budgetUsd: effectiveBudget,\n        usage,\n        log,\n      })\n\n      const execution = {\n        summary,\n        findings,\n        budgetDebitUsd: budgetDebit(summary.usage, effectiveBudget),\n      } satisfies AnalystExecution\n      if (exact) {\n        try {\n          executionCost([...executions, execution], true)\n        } catch (error) {\n          executionFailure = error\n          break\n        }\n      }\n      executions.push(execution)\n      if (plan.budget.kind === 'dynamic' && remainingUsd !== undefined) {\n        remainingUsd = Math.max(0, remainingUsd - execution.budgetDebitUsd)\n      }\n      if (plan.chainFindings) upstreamFindings.push(...findings)\n      if (lifecycleFailure !== undefined) {\n        if (!exact) throw lifecycleFailure\n        executionFailure = lifecycleFailure\n        break\n      }\n\n      const hookValues = snapshotAfterHookValues(summary, findings, exact)\n      try {\n        await waitForHook(\n          plan.hooks.onAfterAnalyze\n            ? () =>\n                plan.hooks.onAfterAnalyze?.({\n                  analyst,\n                  summary: hookValues.summary,\n                  findings: hookValues.findings,\n                  runId: plan.runId,\n                })\n            : undefined,\n          executionSignal,\n        )\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      yield snapshotExecutionEvent({ type: 'analyst-completed', summary, findings }, exact)\n      if (exact && runSignal?.aborted) {\n        executionFailure = abortReason(runSignal)\n        break\n      }\n    }\n\n    const summaries = executions.map(({ summary }) => summary)\n    const findings = executions.flatMap((execution) => execution.findings)\n    const cost = executionCost(executions, exact)\n    const baseResult: AnalystRunResult = {\n      run_id: plan.runId,\n      correlation_id: correlationId,\n      started_at: startedAt,\n      ended_at: new Date().toISOString(),\n      findings,\n      per_analyst: summaries,\n      total_cost_usd: cost.known,\n      total_cost_provenance: cost.provenance,\n    }\n    if (plan.executionSnapshot === undefined) {\n      await waitForHook(\n        plan.hooks.onComplete ? () => plan.hooks.onComplete?.({ result: baseResult }) : undefined,\n        runSignal,\n      )\n      yield { type: 'run-completed', result: baseResult }\n      return\n    }\n\n    let completeResult: ExactAnalystRunResult | undefined\n    if (executionFailure === undefined) {\n      try {\n        completeResult = snapshotExactAnalystRunReceipt(\n          {\n            ...baseResult,\n            execution_plan: plan.executionSnapshot,\n            completion: { status: 'complete' },\n          },\n          'AnalystRegistry.runExact result',\n        )\n        await waitForHook(\n          plan.hooks.onComplete\n            ? () => plan.hooks.onComplete?.({ result: completeResult! })\n            : undefined,\n          runSignal,\n        )\n      } catch (error) {\n        executionFailure = error\n      }\n    }\n    if (runSignal?.aborted) executionFailure ??= abortReason(runSignal)\n    if (executionFailure === undefined && completeResult) {\n      yield snapshotExecutionEvent({ type: 'run-completed', result: completeResult }, true)\n      return\n    }\n\n    const cause =\n      executionFailure instanceof Error ? executionFailure : new Error(String(executionFailure))\n    const errorClass = cause.constructor.name || 'Error'\n    const errorMessage =\n      cause.message.trim().length === 0\n        ? 'Exact analyst run failed without a message'\n        : cause.message\n    throw new ExactAnalystRunExecutionError(\n      `exact analyst run failed after starting: ${errorMessage}; partial result is attached`,\n      {\n        ...baseResult,\n        execution_plan: plan.executionSnapshot,\n        completion: {\n          status: 'failed',\n          error: { class: errorClass, message: errorMessage },\n        },\n      },\n      { cause },\n    )\n  }\n\n  private selectAnalysts(opts: RegistryRunOpts): Analyst[] {\n    let candidates = Array.from(this.analysts.values())\n    if (opts.only?.length) {\n      const only = new Set(opts.only)\n      candidates = candidates.filter((a) => only.has(a.id))\n    }\n    if (opts.skip?.length) {\n      const skip = new Set(opts.skip)\n      candidates = candidates.filter((a) => !skip.has(a.id))\n    }\n    return candidates\n  }\n\n  private selectExactAnalysts(\n    ids: readonly string[],\n  ): ReadonlyArray<{ readonly registeredId: string; readonly analyst: Analyst }> {\n    return ids.map((id) => {\n      const analyst = this.analysts.get(id)\n      if (!analyst) throw new Error(`ExactRegistryRunOpts.analystIds names unknown analyst \"${id}\"`)\n      return { registeredId: id, analyst }\n    })\n  }\n\n  private routeInput(\n    analyst: Analyst,\n    inputs: AnalystRunInputs,\n  ): { kind: 'present'; value: unknown } | { kind: 'missing' } {\n    switch (analyst.inputKind) {\n      case 'trace-store': {\n        const value = inputs.traceStore\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'artifact-dir': {\n        const value = inputs.artifactDir\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'run-record': {\n        const value = inputs.runRecord\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'judge-input': {\n        const value = inputs.judgeInput\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'custom': {\n        const custom = inputs.custom\n        const value = custom?.[analyst.id]\n        return value !== undefined ? { kind: 'present', value } : { kind: 'missing' }\n      }\n    }\n  }\n}\n\nconst exactRunFields = [\n  'analystIds',\n  'budget',\n  'totalTimeoutMs',\n  'signal',\n  'costLedger',\n  'costLedgerIdentity',\n  'costPhase',\n  'tags',\n  'priorFindings',\n  'chainFindings',\n  'missingInputMode',\n  'applyRegistryHooks',\n  'useRegistryChat',\n] as const\n\nconst exactNonEmptyString = z.string().min(1)\nconst exactFiniteNonnegative = z.number().finite().nonnegative()\nconst exactBudgetSchema = z.discriminatedUnion('kind', [\n  z.strictObject({\n    kind: z.literal('equal'),\n    totalUsd: exactFiniteNonnegative,\n  }),\n  z.strictObject({\n    kind: z.literal('weighted'),\n    totalUsd: exactFiniteNonnegative,\n    weights: z.record(exactNonEmptyString, exactFiniteNonnegative),\n  }),\n])\nconst exactRunDataSchema = z\n  .strictObject({\n    analystIds: z.array(exactNonEmptyString).min(1),\n    budget: exactBudgetSchema.nullable(),\n    totalTimeoutMs: z.number().int().positive().max(2_147_483_647).nullable(),\n    costLedgerIdentity: z.unknown().nullable(),\n    costPhase: exactNonEmptyString.nullable(),\n    tags: z.record(z.string(), z.string()).nullable(),\n    chainFindings: z.boolean(),\n    missingInputMode: z.enum(['skip', 'abort']),\n    applyRegistryHooks: z.boolean(),\n    useRegistryChat: z.boolean(),\n  })\n  .superRefine((policy, context) => {\n    const issue = (path: PropertyKey[], message: string): void =>\n      context.addIssue({ code: 'custom', path, message })\n    if (new Set(policy.analystIds).size !== policy.analystIds.length) {\n      issue(['analystIds'], 'must not contain duplicates')\n    }\n    if (\n      policy.budget?.kind === 'weighted' &&\n      Object.values(policy.budget.weights).every((weight) => weight === 0)\n    ) {\n      issue(['budget', 'weights'], 'must allocate positive weight to at least one analyst')\n    }\n    if (policy.budget?.kind === 'weighted') {\n      const selected = [...policy.analystIds].sort()\n      const weighted = Object.keys(policy.budget.weights).sort()\n      if (\n        selected.length !== weighted.length ||\n        selected.some((id, index) => id !== weighted[index])\n      ) {\n        issue(['budget', 'weights'], 'must name every selected analyst and no others')\n      }\n    }\n  })\n\nfunction snapshotExactRunId(value: unknown): string {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new TypeError('AnalystRegistry.runExact: runId must be a non-empty string')\n  }\n  return canonicalJsonSnapshot(value, 'AnalystRegistry.runExact runId')\n}\n\nfunction snapshotAnalystRunInputChannels(inputs: AnalystRunInputs): AnalystRunInputs {\n  if (!inputs || typeof inputs !== 'object' || Array.isArray(inputs)) {\n    throw new TypeError('AnalystRegistry.runExact: inputs must be an object')\n  }\n  const traceStore = inputs.traceStore\n  const artifactDir = inputs.artifactDir\n  const runRecord = inputs.runRecord\n  const judgeInput = inputs.judgeInput\n  const custom = inputs.custom\n  return Object.freeze({\n    traceStore,\n    artifactDir,\n    runRecord,\n    judgeInput,\n    custom,\n  })\n}\n\n/**\n * Read the untrusted caller object once, then validate and execute only this frozen snapshot.\n * Functions and resource handles retain identity; all data fields are copied canonically.\n */\nfunction snapshotExactRegistryRunOpts(value: unknown): ExactRegistryRunOpts {\n  const captured = readOwnFields(value, exactRunFields, 'ExactRegistryRunOpts')\n  const missing = exactRunFields.find((field) => !Object.hasOwn(captured, field))\n  if (missing) {\n    throw new TypeError(`ExactRegistryRunOpts.${missing} must be supplied explicitly`)\n  }\n  const { signal, costLedger, priorFindings, ...rawData } = captured\n  const data = canonicalJsonSnapshot(rawData, 'ExactRegistryRunOpts')\n  const parsed = exactRunDataSchema.safeParse(data)\n  if (!parsed.success) {\n    const issue = parsed.error.issues[0]\n    if (issue?.code === 'unrecognized_keys' && issue.path.join('.') === 'budget') {\n      const required =\n        isPlainRecord(data.budget) && data.budget.kind === 'weighted'\n          ? 'kind, totalUsd, weights'\n          : 'kind, totalUsd'\n      throw new TypeError(`ExactRegistryRunOpts.budget must contain exactly ${required}`)\n    }\n    const path = issue?.path.length ? `.${issue.path.join('.')}` : ''\n    throw new TypeError(`ExactRegistryRunOpts${path}: ${issue?.message ?? 'is invalid'}`)\n  }\n  if (\n    signal !== null &&\n    (!signal ||\n      typeof signal !== 'object' ||\n      typeof (signal as AbortSignal).addEventListener !== 'function')\n  ) {\n    throw new TypeError('ExactRegistryRunOpts.signal must be an AbortSignal or null')\n  }\n  if (costLedger !== null && (!costLedger || typeof costLedger !== 'object')) {\n    throw new TypeError('ExactRegistryRunOpts.costLedger must be a CostLedgerHandle or null')\n  }\n  if (costLedger === null && parsed.data.costLedgerIdentity !== null) {\n    throw new TypeError('ExactRegistryRunOpts.costLedgerIdentity must be null without costLedger')\n  }\n  if (costLedger !== null && parsed.data.costLedgerIdentity === null) {\n    throw new TypeError('ExactRegistryRunOpts.costLedgerIdentity is required with costLedger')\n  }\n  if (costLedger === null && parsed.data.costPhase !== null) {\n    throw new TypeError('ExactRegistryRunOpts.costPhase requires a non-null costLedger')\n  }\n  return Object.freeze({\n    ...deepFreezeCanonicalJson(parsed.data),\n    signal: signal as AbortSignal | null,\n    costLedger: costLedger as CostLedgerHandle | null,\n    priorFindings: snapshotExactPriorFindings(priorFindings),\n  }) as ExactRegistryRunOpts\n}\n\nfunction snapshotExactPriorFindings(value: unknown): ExactRegistryRunOpts['priorFindings'] {\n  if (value === null) return null\n  if (Array.isArray(value)) {\n    return snapshotAnalystFindings(value, 'ExactRegistryRunOpts.priorFindings')\n  }\n  if (!isPlainRecord(value)) {\n    throw new TypeError(\n      'ExactRegistryRunOpts.priorFindings must be an array, a findings record, or null',\n    )\n  }\n  const result: Record<string, ReadonlyArray<AnalystFinding>> = {}\n  for (const [key, findings] of Object.entries(value)) {\n    if (!Array.isArray(findings)) {\n      throw new TypeError(`ExactRegistryRunOpts.priorFindings.${key} must be an array`)\n    }\n    result[key] = snapshotAnalystFindings(findings, `ExactRegistryRunOpts.priorFindings.${key}`)\n  }\n  return deepFreezeCanonicalJson(result)\n}\n\nfunction normalizeExactAnalysts(\n  selections: ReadonlyArray<{ readonly registeredId: string; readonly analyst: Analyst }>,\n): ExactCapableAnalyst[] {\n  return selections.map(({ registeredId, analyst }) => {\n    const exactAnalyst = analyst as Analyst & {\n      readonly executionConfig?: Readonly<Record<string, unknown>>\n    }\n    const id = analyst.id\n    const description = analyst.description\n    const inputKind = analyst.inputKind\n    const rawCostValue = analyst.cost\n    const requiresValue = analyst.requires\n    const version = analyst.version\n    const executionConfigValue = exactAnalyst.executionConfig\n    const analyzeValue = analyst.analyze\n    if (id !== registeredId) {\n      throw new TypeError(\n        `AnalystRegistry.runExact: registered analyst \"${registeredId}\" changed id to \"${id}\"`,\n      )\n    }\n    if (executionConfigValue === undefined) {\n      throw new TypeError(`AnalystRegistry.runExact: analyst \"${id}\" must declare executionConfig`)\n    }\n    const executionConfig = canonicalJsonSnapshot(\n      executionConfigValue,\n      `AnalystRegistry.runExact analyst \"${id}\" executionConfig`,\n    )\n    if (!isPlainRecord(executionConfig)) {\n      throw new TypeError(\n        `AnalystRegistry.runExact analyst \"${id}\" executionConfig must be an object`,\n      )\n    }\n    const rawCost = canonicalJsonSnapshot(\n      rawCostValue,\n      `AnalystRegistry.runExact analyst \"${id}\" cost`,\n    )\n    const cost =\n      rawCost.kind === 'llm'\n        ? Object.freeze({\n            ...rawCost,\n            settlement_timeout_ms: validateUsageSettlementTimeout(rawCost.settlement_timeout_ms),\n          })\n        : rawCost\n    const requires =\n      requiresValue === undefined\n        ? undefined\n        : canonicalJsonSnapshot(\n            requiresValue,\n            `AnalystRegistry.runExact analyst \"${id}\" requirements`,\n          )\n    const analyze = analyzeValue.bind(analyst)\n    return Object.freeze({\n      id,\n      description,\n      inputKind,\n      cost,\n      ...(requires === undefined ? {} : { requires }),\n      version,\n      executionConfig,\n      analyze,\n    }) satisfies ExactCapableAnalyst\n  })\n}\n\nfunction hasRegistryHooks(hooks: AnalystHooks | undefined): hooks is AnalystHooks {\n  return Boolean(\n    hooks && (hooks.onBeforeAnalyze || hooks.onAfterAnalyze || hooks.onError || hooks.onComplete),\n  )\n}\n\nfunction snapshotHooks(hooks: AnalystHooks): AnalystHooks {\n  const onBeforeAnalyze = hooks.onBeforeAnalyze\n  const onAfterAnalyze = hooks.onAfterAnalyze\n  const onError = hooks.onError\n  const onComplete = hooks.onComplete\n  return Object.freeze({\n    ...(onBeforeAnalyze === undefined ? {} : { onBeforeAnalyze: onBeforeAnalyze.bind(hooks) }),\n    ...(onAfterAnalyze === undefined ? {} : { onAfterAnalyze: onAfterAnalyze.bind(hooks) }),\n    ...(onError === undefined ? {} : { onError: onError.bind(hooks) }),\n    ...(onComplete === undefined ? {} : { onComplete: onComplete.bind(hooks) }),\n  })\n}\n\nfunction snapshotChat(chat: ChatClient): ChatClient {\n  const transport = chat.transport\n  const defaultModel = chat.defaultModel\n  const maximumAttempts = chat.maximumAttempts\n  const call = chat.chat\n  return Object.freeze({\n    transport,\n    ...(defaultModel === undefined ? {} : { defaultModel }),\n    ...(maximumAttempts === undefined ? {} : { maximumAttempts }),\n    chat: call.bind(chat),\n  })\n}\n\nfunction requireExactComponentIdentity(\n  value: ExactExecutionComponentIdentity | undefined,\n  label: string,\n): ExactExecutionComponentSnapshot {\n  if (value === undefined) {\n    throw new TypeError(`AnalystRegistry.runExact: ${label} requires a versioned identity`)\n  }\n  return snapshotExactExecutionComponentIdentity(\n    value,\n    `AnalystRegistry.runExact ${label} identity`,\n  )\n}\n\nfunction exactExecutionSnapshot(\n  analysts: readonly ExactCapableAnalyst[],\n  opts: ExactRegistryRunOpts,\n  allocations: Readonly<Record<string, number | null>>,\n  costLedger: ExactExecutionComponentSnapshot | null,\n  hooks: ExactExecutionComponentSnapshot | null,\n  chat: ExactExecutionComponentSnapshot | null,\n): ExactAnalystExecutionPlanSnapshot {\n  const priorFindings = exactPriorFindingsSnapshot(opts.priorFindings)\n  const budget =\n    opts.budget === null\n      ? ({ kind: 'none' } as const)\n      : opts.budget.kind === 'equal'\n        ? ({\n            kind: 'equal',\n            total_usd: opts.budget.totalUsd,\n            allocations_usd: { ...allocations },\n          } as const)\n        : ({\n            kind: 'weighted',\n            total_usd: opts.budget.totalUsd,\n            weights: { ...opts.budget.weights },\n            allocations_usd: { ...allocations },\n          } as const)\n  const material = {\n    schema_version: '1.0.0' as const,\n    analysts: analysts.map((analyst) => ({\n      id: analyst.id,\n      version: analyst.version,\n      input_kind: analyst.inputKind,\n      cost: analyst.cost,\n      requirements: analyst.requires ?? null,\n      execution_config_digest: hashCanonical(analyst.executionConfig),\n    })),\n    policy: {\n      budget,\n      total_timeout_ms: opts.totalTimeoutMs,\n      signal_provided: opts.signal !== null,\n      cost_ledger: costLedger,\n      cost_phase: opts.costPhase,\n      tags: opts.tags === null ? null : { ...opts.tags },\n      prior_findings: priorFindings,\n      chain_findings: opts.chainFindings,\n      missing_input_mode: opts.missingInputMode,\n      registry_hooks: hooks,\n      registry_chat: chat,\n    },\n  }\n  return snapshotExactExecutionPlan(\n    { ...material, digest: hashCanonical(material) },\n    'AnalystRegistry.runExact execution plan',\n  )\n}\n\nfunction exactPriorFindingsSnapshot(\n  findings: ExactRegistryRunOpts['priorFindings'],\n): ExactAnalystExecutionPlanSnapshot['policy']['prior_findings'] {\n  if (findings === null) return { kind: 'none' }\n  if (Array.isArray(findings)) {\n    return {\n      kind: 'ordered',\n      count: findings.length,\n      digest: hashCanonical(findings),\n    }\n  }\n  const record = findings as Readonly<Record<string, ReadonlyArray<AnalystFinding>>>\n  const keys = Object.keys(record).sort()\n  return {\n    kind: 'by_analyst',\n    keys,\n    count: keys.reduce((sum, key) => sum + (record[key]?.length ?? 0), 0),\n    digest: hashCanonical(record),\n  }\n}\n\nfunction canonicalJsonSnapshot<T>(value: T, label: string): T {\n  let snapshot: T\n  try {\n    snapshot = JSON.parse(canonicalString(value)) as T\n  } catch (cause) {\n    throw new TypeError(`${label} must be canonical JSON`, { cause })\n  }\n  return deepFreezeCanonicalJson(snapshot)\n}\n\nfunction snapshotUsageReceiptOnce(\n  receipt: AnalystUsageReceipt,\n  context: string,\n): AnalystUsageReceipt {\n  const data = readOwnFields(receipt, ['calls', 'tokens', 'cost', 'knownCostUsd'], context)\n  data.tokens =\n    data.tokens === null\n      ? null\n      : readOwnFields(\n          data.tokens,\n          ['input', 'output', 'reasoning', 'cached', 'cacheWrite'],\n          `${context} tokens`,\n        )\n  data.cost = readOwnFields(data.cost, ['kind', 'usd'], `${context} cost`)\n  const snapshot = canonicalJsonSnapshot(data as unknown as AnalystUsageReceipt, context)\n  assertValidAnalystUsageReceipt(snapshot, context)\n  return snapshot\n}\n\nfunction readOwnFields(\n  value: unknown,\n  fields: readonly string[],\n  context: string,\n): Record<string, unknown> {\n  if (!isPlainRecord(value)) throw new TypeError(`${context} must be a plain object`)\n  const unexpected = Object.keys(value).filter((key) => !fields.includes(key))\n  if (unexpected.length > 0) {\n    throw new TypeError(`${context} contains unknown fields: ${unexpected.sort().join(', ')}`)\n  }\n  return Object.fromEntries(\n    fields.flatMap((field) => (Object.hasOwn(value, field) ? [[field, value[field]]] : [])),\n  )\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false\n  const prototype = Object.getPrototypeOf(value)\n  return prototype === Object.prototype || prototype === null\n}\n\nfunction exactFixedBudgets(\n  exact: ExactAnalystBudgetPolicy | null,\n  runnable: readonly Analyst[],\n  selected: readonly Analyst[],\n): Readonly<Record<string, number | null>> {\n  if (exact === null) return {}\n  const allocations: Record<string, number | null> = Object.fromEntries(\n    selected.map((analyst) => [analyst.id, null]),\n  )\n  if (runnable.length === 0) return deepFreezeCanonicalJson(allocations)\n  if (exact.kind === 'equal') {\n    const each = exact.totalUsd / runnable.length\n    for (const analyst of runnable) allocations[analyst.id] = each\n    return deepFreezeCanonicalJson(allocations)\n  }\n  const totalWeight = runnable.reduce((sum, analyst) => sum + exact.weights[analyst.id]!, 0)\n  if (totalWeight === 0) {\n    throw new Error(\n      'ExactRegistryRunOpts weighted budget must allocate positive weight to a runnable analyst',\n    )\n  }\n  for (const analyst of runnable) {\n    allocations[analyst.id] = (exact.totalUsd * exact.weights[analyst.id]!) / totalWeight\n  }\n  return deepFreezeCanonicalJson(allocations)\n}\n\ninterface AnalystExecution {\n  readonly summary: AnalystRunSummary\n  readonly findings: AnalystFinding[]\n  readonly budgetDebitUsd: number\n}\n\nfunction snapshotExecutionFindings(\n  findings: AnalystFinding[],\n  exact: boolean,\n  context: string,\n): AnalystFinding[] {\n  return exact ? deepFreezeCanonicalJson(snapshotAnalystFindings(findings, context)) : findings\n}\n\nfunction snapshotAfterHookValues(\n  summary: AnalystRunSummary,\n  findings: AnalystFinding[],\n  exact: boolean,\n): { summary: AnalystRunSummary; findings: AnalystFinding[] } {\n  if (!exact) return { summary, findings }\n  return {\n    summary: canonicalJsonSnapshot(summary, 'AnalystRegistry.runExact onAfterAnalyze summary'),\n    findings: deepFreezeCanonicalJson(\n      snapshotAnalystFindings(findings, 'AnalystRegistry.runExact onAfterAnalyze findings'),\n    ),\n  }\n}\n\nfunction exactPlannedAllocation(\n  plan: ExactAnalystExecutionPlanSnapshot,\n  analystId: string,\n): number | undefined {\n  const budget = plan.policy.budget\n  if (budget.kind === 'none') return undefined\n  const allocated = budget.allocations_usd[analystId]\n  return allocated === null ? undefined : allocated\n}\n\nfunction snapshotExecutionEvent<T extends InternalAnalystRunEvent>(event: T, exact: boolean): T {\n  return exact ? canonicalJsonSnapshot(event, 'AnalystRegistry.runExact event') : event\n}\n\nfunction logUncapturedBudgetWarning(args: {\n  analyst: Analyst\n  runId: string\n  budgetUsd: number | undefined\n  usage: AnalystUsageReceipt\n  log: (message: string, fields?: Record<string, unknown>) => void\n}): void {\n  if (args.budgetUsd === undefined || args.usage.cost.kind !== 'uncaptured') return\n  args.log(`[analyst] WARN ${args.analyst.id} — USD cost uncaptured; budget not reconciled`, {\n    runId: args.runId,\n    budget_usd: args.budgetUsd,\n    cost_captured: false,\n  })\n}\n\nfunction validateTimeout(timeoutMs: number | undefined): number | undefined {\n  if (timeoutMs === undefined) return undefined\n  if (!Number.isSafeInteger(timeoutMs) || timeoutMs <= 0 || timeoutMs > 2_147_483_647) {\n    throw new TypeError(\n      'RegistryRunOpts.timeoutMs must be a positive safe integer no greater than 2147483647',\n    )\n  }\n  return timeoutMs\n}\n\nasync function waitForOperation<T>(\n  operation: Promise<T>,\n  signal: AbortSignal | undefined,\n  abortGraceMs: number,\n): Promise<T> {\n  if (!signal) return operation\n  if (signal.aborted) {\n    void operation.catch(() => {})\n    throw abortReason(signal)\n  }\n  return new Promise<T>((resolve, reject) => {\n    let settlementTimer: ReturnType<typeof setTimeout> | undefined\n    const cleanup = (): void => {\n      signal.removeEventListener('abort', onAbort)\n      if (settlementTimer) clearTimeout(settlementTimer)\n    }\n    const onAbort = (): void => {\n      if (abortGraceMs === 0) {\n        cleanup()\n        reject(abortReason(signal))\n        return\n      }\n      settlementTimer = setTimeout(() => {\n        cleanup()\n        reject(abortReason(signal))\n      }, abortGraceMs)\n    }\n    signal.addEventListener('abort', onAbort, { once: true })\n    operation.then(\n      (value) => {\n        cleanup()\n        if (signal.aborted) reject(abortReason(signal))\n        else resolve(value)\n      },\n      (error) => {\n        cleanup()\n        reject(signal.aborted ? abortReason(signal) : error)\n      },\n    )\n  })\n}\n\nasync function waitForHook<T>(\n  operation: (() => T | Promise<T>) | undefined,\n  signal: AbortSignal | undefined,\n): Promise<T | undefined> {\n  if (operation === undefined || signal?.aborted) return undefined\n  try {\n    return await waitForOperation(\n      Promise.resolve().then(() => {\n        if (signal?.aborted) throw abortReason(signal)\n        return operation()\n      }),\n      signal,\n      0,\n    )\n  } catch (error) {\n    if (signal?.aborted) return undefined\n    throw error\n  }\n}\n\nfunction analystAbortGraceMs(analyst: Analyst): number {\n  if (analyst.cost.kind === 'deterministic') return 0\n  const settlementMs = validateUsageSettlementTimeout(analyst.cost.settlement_timeout_ms)\n  if (settlementMs === 0) return 0\n  return Math.min(settlementMs + 100, 2_147_483_647)\n}\n\nfunction abortedBeforeStartSummary(\n  analyst: Analyst,\n  signal: AbortSignal,\n  latencyMs = 0,\n): AnalystRunSummary {\n  const reason = abortReason(signal)\n  return {\n    analyst_id: analyst.id,\n    status: 'skipped',\n    reason: `${reason.name}: ${reason.message}`,\n    findings_count: 0,\n    latency_ms: latencyMs,\n    usage: zeroUsage(),\n  }\n}\n\nfunction abortReason(signal: AbortSignal): Error {\n  return signal.reason instanceof Error\n    ? signal.reason\n    : new DOMException('The operation was aborted', 'AbortError')\n}\n\n/**\n * Default budget allocator: prefer the custom `allocate` callback if\n * provided; else weighted split when weights are set; else equal split\n * across `runningCount`. Returns undefined when no totalUsd is known.\n */\nfunction allocateBudget(\n  policy: BudgetPolicy | undefined,\n  args: {\n    analyst: Analyst\n    remainingUsd: number | undefined\n    runningCount: number\n    totalWeight: number | undefined\n  },\n): number | undefined {\n  if (!policy) return undefined\n  if (policy.allocate) {\n    const allocated = policy.allocate({\n      analyst: args.analyst,\n      totalUsd: policy.totalUsd,\n      remainingUsd: args.remainingUsd,\n      runningCount: args.runningCount,\n    })\n    if (allocated === undefined) {\n      if (policy.totalUsd !== undefined) {\n        throw new Error(\n          `BudgetPolicy.allocate('${args.analyst.id}') cannot return undefined when totalUsd is set`,\n        )\n      }\n      return undefined\n    }\n    assertBudgetAmount(allocated, `BudgetPolicy.allocate('${args.analyst.id}')`)\n    return args.remainingUsd === undefined ? allocated : Math.min(allocated, args.remainingUsd)\n  }\n  if (policy.totalUsd == null) return undefined\n  const allocated = policy.weights\n    ? (policy.totalUsd * analystWeight(policy.weights, args.analyst.id)) / args.totalWeight!\n    : policy.totalUsd / Math.max(1, args.runningCount)\n  return args.remainingUsd === undefined ? allocated : Math.min(allocated, args.remainingUsd)\n}\n\nfunction validateBudgetPolicy(policy: BudgetPolicy | undefined): void {\n  if (!policy) return\n  if (policy.totalUsd !== undefined) assertBudgetAmount(policy.totalUsd, 'BudgetPolicy.totalUsd')\n  for (const [analystId, weight] of Object.entries(policy.weights ?? {})) {\n    assertBudgetAmount(weight, `BudgetPolicy.weights['${analystId}']`)\n  }\n}\n\nfunction assertBudgetAmount(value: number, field: string): void {\n  if (!Number.isFinite(value) || value < 0) {\n    throw new Error(`${field} must be a non-negative finite number`)\n  }\n}\n\nfunction validateEffectiveBudget(\n  budgetUsd: number | undefined,\n  remainingUsd: number | undefined,\n  analystId: string,\n): number | undefined {\n  if (budgetUsd !== undefined) {\n    assertBudgetAmount(budgetUsd, `AnalystContext.budgetUsd for '${analystId}'`)\n  }\n  if (remainingUsd === undefined) return budgetUsd\n  if (budgetUsd === undefined) {\n    throw new Error(\n      `AnalystContext.budgetUsd for '${analystId}' cannot be removed while an overall budget remains`,\n    )\n  }\n  if (budgetUsd > remainingUsd) {\n    throw new Error(\n      `AnalystContext.budgetUsd for '${analystId}' (${budgetUsd}) exceeds the remaining overall budget (${remainingUsd})`,\n    )\n  }\n  return budgetUsd\n}\n\nfunction analystWeight(weights: Record<string, number>, analystId: string): number {\n  const weight = weights[analystId] ?? 1\n  assertBudgetAmount(weight, `BudgetPolicy.weights['${analystId}']`)\n  return weight\n}\n\nfunction zeroUsage(): AnalystUsageReceipt {\n  return {\n    calls: 0,\n    tokens: { input: 0, output: 0 },\n    cost: { kind: 'observed', usd: 0 },\n  }\n}\n\nfunction resolveUsage(\n  analyst: Analyst,\n  receipts: ReadonlyArray<AnalystUsageReceipt>,\n  exact = false,\n): AnalystUsageReceipt {\n  if (receipts.length > 0) return mergeUsageReceipts(receipts, exact)\n  if (analyst.cost.kind === 'deterministic') return zeroUsage()\n  return { calls: null, tokens: null, cost: { kind: 'uncaptured', usd: null } }\n}\n\nfunction mergeUsageReceipts(\n  receipts: ReadonlyArray<AnalystUsageReceipt>,\n  exact = false,\n): AnalystUsageReceipt {\n  const calls = receipts.every((receipt) => receipt.calls !== null)\n    ? usageSum(\n        receipts.map((receipt) => receipt.calls ?? 0),\n        exact,\n        'calls',\n        true,\n      )\n    : null\n  const tokens = receipts.every((receipt) => receipt.tokens !== null)\n    ? (Object.fromEntries(\n        (['input', 'output', 'reasoning', 'cached', 'cacheWrite'] as const).flatMap((field) =>\n          field === 'input' ||\n          field === 'output' ||\n          receipts.some((receipt) => receipt.tokens?.[field] !== undefined)\n            ? [\n                [\n                  field,\n                  usageSum(\n                    receipts.map((receipt) => receipt.tokens?.[field] ?? 0),\n                    exact,\n                    `tokens.${field}`,\n                    true,\n                  ),\n                ],\n              ]\n            : [],\n        ),\n      ) as unknown as RunTokenUsage)\n    : null\n  const cost = aggregateCostProvenance(\n    receipts.map((receipt) => receipt.cost),\n    exact,\n  )\n  return {\n    calls,\n    tokens,\n    cost,\n    ...(cost.kind === 'uncaptured'\n      ? {\n          knownCostUsd: usageSum(receipts.map(knownCostUsd), exact, 'known cost'),\n        }\n      : {}),\n  }\n}\n\nfunction knownCostUsd(receipt: AnalystUsageReceipt): number {\n  return receipt.cost.kind === 'uncaptured' ? (receipt.knownCostUsd ?? 0) : receipt.cost.usd\n}\n\nfunction budgetDebit(receipt: AnalystUsageReceipt, allocatedUsd: number | undefined): number {\n  const known = knownCostUsd(receipt)\n  return receipt.cost.kind === 'uncaptured' && allocatedUsd !== undefined\n    ? Math.max(known, allocatedUsd)\n    : known\n}\n\nfunction aggregateCostProvenance(\n  costs: ReadonlyArray<RunCostProvenance>,\n  exact = false,\n): RunCostProvenance {\n  if (costs.some((cost) => cost.kind === 'uncaptured')) {\n    return { kind: 'uncaptured', usd: null }\n  }\n  const usd = usageSum(\n    costs.map((cost) => cost.usd ?? 0),\n    exact,\n    'captured cost',\n  )\n  return costs.some((cost) => cost.kind === 'estimated')\n    ? { kind: 'estimated', usd }\n    : { kind: 'observed', usd }\n}\n\nfunction executionCost(\n  executions: ReadonlyArray<AnalystExecution>,\n  exact: boolean,\n): { known: number; provenance: RunCostProvenance } {\n  const usages = executions.map((execution) => execution.summary.usage)\n  return {\n    known: usageSum(usages.map(knownCostUsd), exact, 'run known cost'),\n    provenance: aggregateCostProvenance(\n      usages.map((usage) => usage.cost),\n      exact,\n    ),\n  }\n}\n\nfunction usageSum(\n  values: readonly number[],\n  exact: boolean,\n  field: string,\n  integer = false,\n): number {\n  const sum = values.reduce((total, value) => total + value, 0)\n  if (exact && (integer ? !Number.isSafeInteger(sum) : !Number.isFinite(sum))) {\n    throw new RangeError(\n      `exact analyst usage ${field} aggregate ${integer ? 'exceeds a safe integer' : 'is not finite'}`,\n    )\n  }\n  return sum\n}\n\n/**\n * Resolve the `priorFindings` slice an analyst sees.\n *\n *   - Array form  → the analyst sees only findings whose `analyst_id`\n *                   matches its own id, so a kind never reads\n *                   another kind's history by accident.\n *   - Record form → the analyst gets the entry keyed by its id, with\n *                   the `'*'` wildcard appended (in that order). Use\n *                   the wildcard when several kinds should see the same\n *                   historical findings.\n */\nfunction selectPriorFindings(\n  source: RegistryRunOpts['priorFindings'],\n  analystId: string,\n): ReadonlyArray<AnalystFinding> | undefined {\n  if (!source) return undefined\n  if (Array.isArray(source)) {\n    const own = source.filter((f) => f.analyst_id === analystId)\n    return own.length > 0 ? own : undefined\n  }\n  const record = source as Record<string, ReadonlyArray<AnalystFinding>>\n  const own = record[analystId] ?? []\n  const wildcard = record['*'] ?? []\n  const merged = [...own, ...wildcard]\n  return merged.length > 0 ? merged : undefined\n}\n","import { type BehavioralAnalystOptions, behavioralAnalyst } from './behavioral-analyst'\nimport type { TraceAnalysisEngine } from './engine'\nimport { createTraceAnalyst, type TraceAnalystDefinition } from './kind-factory'\nimport { DEFAULT_TRACE_ANALYST_KINDS } from './kinds'\nimport { AnalystRegistry, type AnalystRegistryOptions } from './registry'\n\nexport interface DefaultAnalystRegistryOptions {\n  /**\n   * Recursive engine for model-backed trace analysts. When omitted, the\n   * registry contains only deterministic analysts. The engine's id, version,\n   * and model become the exact-run identity of every analyst it executes.\n   */\n  engine?: TraceAnalysisEngine\n  definitions?: readonly TraceAnalystDefinition[]\n  /** Set false to omit the deterministic behavioral analyst (default: include). */\n  includeBehavioral?: boolean\n  behavioral?: BehavioralAnalystOptions\n  registry?: AnalystRegistryOptions\n}\n\nexport function buildDefaultAnalystRegistry(\n  options: DefaultAnalystRegistryOptions = {},\n): AnalystRegistry {\n  if (options.definitions && !options.engine) {\n    throw new TypeError(\n      'buildDefaultAnalystRegistry: definitions require an engine — a definition cannot run without one',\n    )\n  }\n  const registry = new AnalystRegistry(options.registry)\n  if (options.includeBehavioral !== false) {\n    registry.register(behavioralAnalyst(options.behavioral))\n  }\n  if (options.engine) {\n    for (const definition of options.definitions ?? DEFAULT_TRACE_ANALYST_KINDS) {\n      registry.register(createTraceAnalyst(definition, { engine: options.engine }))\n    }\n  }\n  return registry\n}\n","/**\n * Provider-neutral chat contract for every model call made by agent-eval.\n *\n * The caller owns model execution. agent-eval issues no provider request and\n * holds no provider credential: `createChatClient` binds a transport the\n * caller supplies, and evaluation code receives canonical requests and results\n * without importing a provider SDK.\n */\n\nimport type { LlmCallRequest, LlmCallResult } from '../llm-client'\n\n/**\n * Unified chat interface using the package's canonical LLM request and result.\n */\nexport interface ChatClient {\n  /** Display name of the bound transport, included in telemetry. */\n  readonly transport: ChatTransport\n  /** Default model when the caller omits one. */\n  readonly defaultModel?: string\n  /** Total provider attempts this transport can make for one chat call. */\n  readonly maximumAttempts?: number\n\n  /** Implementations must enforce `req.maxTokens` when it is present. */\n  chat(req: ChatRequest, opts?: ChatCallOpts): Promise<ChatResponse>\n}\n\nexport type ChatTransport =\n  | 'sandbox-sdk' // box.streamPrompt() — chat completion via sandbox SDK\n  | 'custom' // caller-adapted SDK or transport\n  | 'mock' // test-time injection\n\nexport interface ChatRequest extends Omit<LlmCallRequest, 'model'> {\n  /** Optional — falls back to ChatClient.defaultModel. */\n  model?: string\n}\n\nexport type ChatResponse = LlmCallResult\n\nexport interface ChatCallOpts {\n  /** Cancel the in-flight request. */\n  signal?: AbortSignal\n  /** Hard USD ceiling for this single call (informational; the underlying transport may not enforce). */\n  maxCostUsd?: number\n  /** Correlation tag carried into request headers when the transport allows. */\n  correlationId?: string\n  /** Stable provider idempotency key for retries/redrives of one paid call. */\n  idempotencyKey?: string\n}\n\n// ── Factory ─────────────────────────────────────────────────────────\n\nexport type CreateChatClientOpts = SandboxSdkTransportOpts | CustomTransportOpts | MockTransportOpts\n\ninterface BaseTransportOpts {\n  defaultModel?: string\n  /** Total provider attempts. Required for opaque transports used in capped runs. */\n  maximumAttempts?: number\n}\n\n/**\n * Sandbox-SDK transport. The caller supplies a canonical chat function for an\n * already-configured Sandbox handle, so agent-eval does not import the SDK.\n */\nexport interface SandboxSdkTransportOpts extends BaseTransportOpts {\n  transport: 'sandbox-sdk'\n  chat: (req: ChatRequest, opts?: ChatCallOpts) => Promise<ChatResponse>\n}\n\n/** Caller-adapted SDK or transport returning the canonical ChatResponse shape. */\nexport interface CustomTransportOpts extends BaseTransportOpts {\n  transport: 'custom'\n  chat: (req: ChatRequest, opts?: ChatCallOpts) => Promise<ChatResponse>\n}\n\n/**\n * Mock transport for tests. The handler receives the request and returns\n * whatever the test wants. No retries, no JSON-schema degrade.\n */\nexport interface MockTransportOpts extends BaseTransportOpts {\n  transport: 'mock'\n  handler: (req: ChatRequest, opts?: ChatCallOpts) => Promise<ChatResponse>\n}\n\n/**\n * Build a ChatClient bound to a specific transport. The returned client\n * is safe to share across analysts in a single registry run.\n */\nexport function createChatClient(opts: CreateChatClientOpts): ChatClient {\n  switch (opts.transport) {\n    case 'sandbox-sdk':\n      return {\n        transport: 'sandbox-sdk',\n        defaultModel: opts.defaultModel,\n        maximumAttempts: opts.maximumAttempts,\n        chat: async (req, callOpts) => opts.chat(resolveModel(req, opts.defaultModel), callOpts),\n      }\n    case 'custom':\n      return {\n        transport: 'custom',\n        defaultModel: opts.defaultModel,\n        maximumAttempts: opts.maximumAttempts,\n        chat: async (req, callOpts) => opts.chat(resolveModel(req, opts.defaultModel), callOpts),\n      }\n    case 'mock':\n      return {\n        transport: 'mock',\n        defaultModel: opts.defaultModel,\n        maximumAttempts: 1,\n        chat: async (req, callOpts) => opts.handler(resolveModel(req, opts.defaultModel), callOpts),\n      }\n  }\n}\n\nfunction resolveModel(req: ChatRequest, defaultModel: string | undefined): ChatRequest {\n  if (req.model) return req\n  if (!defaultModel) {\n    throw new Error(\n      'ChatClient.chat: no model on request and no defaultModel on the client. ' +\n        'Either pass req.model or bind defaultModel at createChatClient().',\n    )\n  }\n  return { ...req, model: defaultModel }\n}\n"],"mappings":";;;;;;;;;;;AAqEA,SAAgB,qBAAqB,SAA+C;CAClF,OAAO,cAAc,uBAAuB,SAAS,iBAAiB,CAAC;AACzE;;AAGA,SAAgB,iBAAiB,KAAyC;CACxE,OAAO,cAAc,mBAAmB,KAAK,aAAa,CAAC;AAC7D;AAEA,SAAgB,mBAAmB,OAAgB,UAAU,eAAiC;CAC5F,MAAM,WAAW,yBAAyB,OAAO,OAAO;CACxD,IAAI,SAAS,mBAAmB,KAAA,GAC9B,OAAO,2BAA2B,UAAU,OAAO;CAErD,IAAI,SAAS,eAAe,KAAA,GAC1B,MAAM,IAAI,UAAU,GAAG,QAAQ,2CAA2C;CAE5E,OAAO;AACT;;AAGA,SAAgB,+BACd,OACA,UAAU,6BACa;CACvB,OAAO,2BAA2B,yBAAyB,OAAO,OAAO,GAAG,OAAO;AACrF;AAEA,SAAS,yBAAyB,OAAgB,SAA0C;CAC1F,IAAI;CACJ,IAAI;EACF,WAAW,KAAK,MAAM,gBAAgB,KAAK,CAAC;CAC9C,SAAS,OAAO;EACd,MAAM,IAAI,UAAU,GAAG,QAAQ,6CAA6C,EAAE,MAAM,CAAC;CACvF;CACA,IAAI,CAAC,SAAS,QAAQ,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CAC3E,eACE,UACA;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACA,OACF;CACA,eAAe,SAAS,QAAQ,GAAG,QAAQ,QAAQ;CACnD,eAAe,SAAS,gBAAgB,GAAG,QAAQ,gBAAgB;CACnE,mBAAmB,SAAS,YAAY,GAAG,QAAQ,YAAY;CAC/D,mBAAmB,SAAS,UAAU,GAAG,QAAQ,UAAU;CAC3D,SAAS,WAAW,wBAAwB,SAAS,UAAU,GAAG,QAAQ,UAAU;CACpF,IAAI,CAAC,MAAM,QAAQ,SAAS,WAAW,GACrC,MAAM,IAAI,UAAU,GAAG,QAAQ,8BAA8B;CAE/D,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,YAAY,QAAQ,GAC1D,wBAAwB,SAAS,GAAG,QAAQ,eAAe,OAAO;CAEpE,IACE,OAAO,SAAS,mBAAmB,YACnC,CAAC,OAAO,SAAS,SAAS,cAAc,KACxC,SAAS,iBAAiB,GAE1B,MAAM,IAAI,UAAU,GAAG,QAAQ,qDAAqD;CAEtF,IAAI,SAAS,0BAA0B,KAAA,GACrC,qBAAqB,SAAS,uBAAuB,GAAG,QAAQ,uBAAuB;CAEzF,OAAO;AACT;AAEA,SAAS,wBAAwB,OAAgB,SAAuB;CACtE,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eACE,OACA;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACA,OACF;CACA,eAAe,MAAM,YAAY,GAAG,QAAQ,YAAY;CACxD,IAAI,MAAM,WAAW,QAAQ,MAAM,WAAW,aAAa,MAAM,WAAW,UAC1E,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CAEpD,IAAI,MAAM,WAAW,KAAA,GAAW,eAAe,MAAM,QAAQ,GAAG,QAAQ,QAAQ;CAChF,IAAI,MAAM,WAAW,aAAa,MAAM,WAAW,KAAA,GACjD,MAAM,IAAI,UAAU,GAAG,QAAQ,iCAAiC;CAElE,uBAAuB,MAAM,gBAAgB,GAAG,QAAQ,gBAAgB;CACxE,kBAAkB,MAAM,YAAY,GAAG,QAAQ,YAAY;CAC3D,0BAA0B,MAAM,OAAO,GAAG,QAAQ,OAAO;CACzD,IAAI,MAAM,yBAAyB,KAAA,KAAa,MAAM,yBAAyB,MAC7E,kBAAkB,MAAM,sBAAsB,GAAG,QAAQ,sBAAsB;CAEjF,IAAI,MAAM,UAAU,KAAA,GAAW;EAC7B,IAAI,MAAM,WAAW,YAAY,CAAC,SAAS,MAAM,KAAK,GACpD,MAAM,IAAI,UAAU,GAAG,QAAQ,0CAA0C;EAE3E,eAAe,MAAM,OAAO,CAAC,SAAS,SAAS,GAAG,GAAG,QAAQ,OAAO;EACpE,eAAe,MAAM,MAAM,OAAO,GAAG,QAAQ,aAAa;EAC1D,eAAe,MAAM,MAAM,SAAS,GAAG,QAAQ,eAAe;CAChE,OAAO,IAAI,MAAM,WAAW,UAC1B,MAAM,IAAI,UAAU,GAAG,QAAQ,+BAA+B;AAElE;AAEA,SAAS,0BAA0B,OAAgB,SAAuB;CACxE,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eAAe,OAAO;EAAC;EAAS;EAAU;EAAQ;CAAc,GAAG,OAAO;CAC1E,KAAK,MAAM,SAAS;EAAC;EAAS;EAAU;CAAM,GAC5C,IAAI,CAAC,OAAO,OAAO,OAAO,KAAK,GAC7B,MAAM,IAAI,UAAU,GAAG,QAAQ,GAAG,MAAM,aAAa;CAGzD,IAAI,MAAM,WAAW,MAAM;EACzB,IAAI,CAAC,SAAS,MAAM,MAAM,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,kCAAkC;EAC9F,eACE,MAAM,QACN;GAAC;GAAS;GAAU;GAAa;GAAU;EAAY,GACvD,GAAG,QAAQ,QACb;CACF;CACA,qBAAqB,MAAM,MAAM,GAAG,QAAQ,MAAM;CAClD,+BAA+B,OAAyC,OAAO;AACjF;AAEA,SAAS,qBAAqB,OAAgB,SAAuB;CACnE,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eAAe,OAAO,CAAC,QAAQ,KAAK,GAAG,OAAO;CAC9C,IAAI,MAAM,SAAS,cAAc;EAC/B,IAAI,MAAM,QAAQ,MAAM,MAAM,IAAI,UAAU,GAAG,QAAQ,6BAA6B;EACpF;CACF;CACA,IAAI,MAAM,SAAS,cAAc,MAAM,SAAS,aAC9C,MAAM,IAAI,UAAU,GAAG,QAAQ,iBAAiB;CAElD,kBAAkB,MAAM,KAAK,GAAG,QAAQ,KAAK;AAC/C;AAEA,SAAS,2BACP,KACA,SACuB;CACvB,IAAI,IAAI,mBAAmB,KAAA,GACzB,MAAM,IAAI,UAAU,GAAG,QAAQ,mCAAmC;CAEpE,MAAM,OAAO,2BAA2B,IAAI,gBAAgB,GAAG,QAAQ,gBAAgB;CACvF,MAAM,aAAa,2BAA2B,IAAI,YAAY,GAAG,QAAQ,YAAY;CACrF,IAAI,iBAAiB;CACrB,IAAI,aAAa;CACjB,MAAM,YAAY,IAAI;CAOtB,MAAM,WAAW,IAAI;CACrB,MAAM,UAAU,KAAK,SAAS,KAAK,YAAY,QAAQ,EAAE;CACzD,MAAM,YAAY,UAAU,KAAK,YAAY,QAAQ,UAAU;CAE/D,IAAI,CADY,UAAU,OAAO,WAAW,UAAU,cAAc,QAAQ,MACjE,KAAM,WAAW,WAAW,cAAc,UAAU,WAAW,QAAQ,QAChF,MAAM,IAAI,UACR,WAAW,WAAW,aAClB,GAAG,QAAQ,8EACX,GAAG,QAAQ,6DACjB;CAEF,MAAM,eAAe,IAAI,IAAI,SAAS;CACtC,KAAK,MAAM,WAAW,UACpB,IAAI,CAAC,aAAa,IAAI,QAAQ,UAAU,GACtC,MAAM,IAAI,UAAU,GAAG,QAAQ,kDAAkD;CAGrF,KAAK,MAAM,WAAW,WAAW;EAC/B,MAAM,SAAS,SAAS,QAAQ,YAAY,QAAQ,eAAe,QAAQ,UAAU,CAAC,CAAC;EACvF,IAAI,QAAQ,mBAAmB,QAC7B,MAAM,IAAI,UACR,GAAG,QAAQ,+CAA+C,QAAQ,WAAW,EAC/E;EAEF,MAAM,gBAAgB,OAAO,OAAO,SAAS,sBAAsB;EACnE,IAAI,QAAQ,WAAW,WAAW;GAChC,IAAI,eACF,MAAM,IAAI,UACR,GAAG,QAAQ,oBAAoB,QAAQ,WAAW,oCACpD;GAEF;EACF;EACA,MAAM,aAAa,QAAQ;EAS3B,IAAI,EAPF,kBACC,KAAK,OAAO,OAAO,SAAS,SACzB,eAAe,OACf,OAAO,eAAe,YACtB,KAAK,OAAO,OAAO,gBAAgB,QAAQ,gBAAgB,QAC3D,KAAK,OAAO,OAAO,gBAAgB,QAAQ,gBAAgB,KAAA,KAC3D,cAAc,KAAK,OAAO,OAAO,gBAAgB,QAAQ,eAE7D,MAAM,IAAI,UACR,GAAG,QAAQ,YAAY,QAAQ,WAAW,+CAC5C;CAEJ;CACA,IAAI,YAAY;CAChB,KAAK,MAAM,WAAW,WAAW;EAC/B,MAAM,SACJ,QAAQ,MAAM,KAAK,SAAS,eACvB,QAAQ,MAAM,gBAAgB,IAC9B,QAAQ,MAAM,KAAK,OAAO;EACjC,YAAY,kBAAkB,YAAY,QAAQ,GAAG,QAAQ,sBAAsB;CACrF;CACA,IAAI,IAAI,mBAAmB,WACzB,MAAM,IAAI,UAAU,GAAG,QAAQ,iDAAiD;CAElF,IAAI,IAAI,0BAA0B,KAAA,GAChC,MAAM,IAAI,UAAU,GAAG,QAAQ,0CAA0C;CAE3E,MAAM,QAAQ,UAAU,KAAK,YAAY,QAAQ,MAAM,IAAI;CAC3D,MAAM,qBAAqB,MAAM,MAAM,SAAS,KAAK,SAAS,YAAY,IACtE;EAAE,MAAM;EAAc,KAAK;CAAK,IAChC;EACE,MAAM,MAAM,MAAM,SAAS,KAAK,SAAS,WAAW,IAAI,cAAc;EACtE,KAAK,MAAM,QACR,KAAK,SACJ,kBAAkB,OAAO,KAAK,OAAO,IAAI,GAAG,QAAQ,yBAAyB,GAC/E,CACF;CACF;CACJ,IAAI,cAAc,IAAI,qBAAqB,MAAM,cAAc,kBAAkB,GAC/E,MAAM,IAAI,UAAU,GAAG,QAAQ,wDAAwD;CAEzF,OAAO,wBAAwB,GAAuC;AACxE;AAEA,SAAS,2BACP,OACA,SACqC;CACrC,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,IAAI,MAAM,WAAW,YAAY;EAC/B,eAAe,OAAO,CAAC,QAAQ,GAAG,OAAO;EACzC,OAAO;CACT;CACA,IAAI,MAAM,WAAW,UACnB,MAAM,IAAI,UAAU,GAAG,QAAQ,mCAAmC;CAEpE,eAAe,OAAO,CAAC,UAAU,OAAO,GAAG,OAAO;CAClD,IAAI,CAAC,SAAS,MAAM,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,+BAA+B;CAC1F,eAAe,MAAM,OAAO,CAAC,SAAS,SAAS,GAAG,GAAG,QAAQ,OAAO;CACpE,eAAe,MAAM,MAAM,OAAO,GAAG,QAAQ,aAAa;CAC1D,eAAe,MAAM,MAAM,SAAS,GAAG,QAAQ,eAAe;CAC9D,OAAO;AACT;AAEA,SAAS,kBAAkB,OAAgB,SAAyB;CAClE,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GAClE,MAAM,IAAI,UAAU,GAAG,QAAQ,sCAAsC;CAEvE,OAAO;AACT;AAEA,SAAS,uBAAuB,OAAgB,SAAyB;CACvE,IAAI,CAAC,OAAO,cAAc,KAAK,KAAM,QAAmB,GACtD,MAAM,IAAI,UAAU,GAAG,QAAQ,qCAAqC;CAEtE,OAAO;AACT;AAEA,SAAgB,wBACd,OACA,UAAU,wBACQ;CAClB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,UAAU,GAAG,QAAQ,kBAAkB;CAEnD,MAAM,WAAW,MAAM,KAAK,SAAS,UACnC,uBAAuB,SAAS,GAAG,QAAQ,WAAW,OAAO,CAC/D;CACA,uBAAuB,SAAS,KAAK,YAAY,QAAQ,UAAU,CAAC;CACpE,OAAO;AACT;AAEA,SAAgB,kBAAkB,YAAiE;CACjG,MAAM,kBAAkB,WAAW,SAAS,QACzC,YAAY,SAAS,QAAQ,QAAQ,KAAK,QAAQ,SAAS,SAAS,aACvE;CACA,MAAM,WAAW,SAAS,WAAW,UAAU,QAAQ,IACnD,WAAW,SAAS,WACpB,KAAA;CACJ,IAAI,gBAAgB,WAAW,GAAG;EAChC,IAAI,UAAU,SAAS,eACrB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,8BACzE;EAEF;CACF;CACA,IAAI,gBAAgB,WAAW,GAC7B,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,wCACzE;CAEF,IAAI,UAAU,SAAS,eACrB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,0BACzE;CAGF,MAAM,WAAW,gBAAgB,EAAE,CAAE;CACrC,IAAI,CAAC,SAAS,QAAQ,GACpB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,8BACzE;CAEF,MAAM,QAAQ,eACZ,SAAS,cACT,uBAAuB,WAAW,GAAG,SACvC;CACA,IAAI,SAAS,UAAU,OACrB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,+CACzE;CAEF,MAAM,oBAAoB,eACxB,SAAS,WACT,uBAAuB,WAAW,GAAG,sBACvC;CACA,MAAM,kBAAkB,eACtB,SAAS,WACT,uBAAuB,WAAW,GAAG,oBACvC;CACA,IAAI,sBAAsB,iBACxB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,6CACzE;CAEF,MAAM,WAAW,wBACf,SAAS,UACT,uBAAuB,WAAW,GAAG,EACvC;CACA,MAAM,aAAa,SAAS,KAAK,YAAY,QAAQ,UAAU;CAC/D,MAAM,aAAa,YACjB,SAAS,YACT,uBAAuB,WAAW,GAAG,cACvC;CACA,MAAM,kBAAkB,gBAAgB,EAAE,CAAE;CAC5C,IAAI,CAAC,SAAS,eAAe,GAC3B,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,mCACzE;CAEF,MAAM,cAAc,mBAClB;EACE,QAAQ;EACR,gBAAgB,SAAS;EACzB,YAAY,SAAS;EACrB,UAAU,SAAS;EACnB;EACA,aAAa,gBAAgB;EAC7B,gBAAgB,SAAS;EACzB,GAAI,SAAS,mBAAmB,KAAA,IAC5B,CAAC,IACD,EAAE,uBAAuB,SAAS,eAAe;EACrD,GAAI,SAAS,kBAAkB,KAAA,IAC3B,CAAC,IACD;GACE,gBAAgB,SAAS;GACzB,YAAY,SAAS;EACvB;CACN,GACA,uBAAuB,WAAW,GAAG,eACvC;CACA,MAAM,kBAAkB,IAAI,IAAI,UAAU;CAC1C,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,QAAQ,GAC9C,IAAI,CAAC,gBAAgB,IAAI,QAAQ,UAAU,GACzC,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,8BAA8B,QAAQ,WAAW,eAAe,OACzI;CAGJ,MAAM,kBAAkB,+BAA+B;EACrD;EACA,WAAW;EACX;EACA;EACA,WAAW,SAAS;EACpB,iBAAiB;CACnB,CAAC;CACD,MAAM,oBAAoB,iBAAiB,WAAW;CACtD,IAAI,oBAAoB,mBACtB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,+BACzE;CAEF,OAAO;EACL;EACA,WAAW;EACX;EACA;EACA;EACA;CACF;AACF;AAEA,SAAgB,8BAA8B,QAAmD;CAC/F,MAAM,mBAAmB,OAAO,gBAAgB,QAC7C,aACC,SAAS,YAAY,uBACzB;CACA,MAAM,eAAe,OAAO,gBAAgB,QACzC,aACC,SAAS,YAAY,uBACzB;CACA,IAAI,aAAa,WAAW,GAC1B,MAAM,IAAI,UACR,+GACF;CAGF,MAAM,YAAY,iBAAiB,QAAQ,aAAa,SAAS,YAAY,WAAW,CAAC,CAAC;CAC1F,MAAM,WAAW,iBAAiB,SAAS;CAC3C,MAAM,UAAU,OAAO,WAAW;CAClC,MAAM,SAAS,aAAa,EAAE,CAAE,aAAa;CAC7C,MAAM,YAAY,YAAY,IAAI,IAAI,YAAY;CAClD,MAAM,oBAAoB,YAAY;CACtC,MAAM,SAAS,sBAAsB,IAAI,IAAI,YAAY;CAEzD,OAAO;EACL;EACA;EACA,IAJS,YAAY,WAAW,IAAI,IAAK,IAAI,YAAY,UAAW,YAAY;EAKhF,QAAQ;GAAE;GAAS;GAAW;GAAU;EAAO;CACjD;AACF;AAEA,SAAgB,+BAA+B,OAOnB;CAC1B,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,GAChC,MAAM,IAAI,UAAU,2CAA2C;CAEjE,MAAM,WAAW,wBAAwB,MAAM,QAAQ;CACvD,MAAM,oBAAoB,eAAe,MAAM,WAAW,2BAA2B;CACrF,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,YAAY,CAAC,QAAQ,YAAY,OAAO,CAAC,CAAC;CACrF,MAAM,uBAAuB,IAAI,IAAI,MAAM,UAAU;CACrD,MAAM,iCAAiB,IAAI,IAAY;CACvC,IAAI,oBAAoB;CAExB,MAAM,YAAY,MAAM,UAAU,KAAK,OAAO,UAAiC;EAC7E,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,UAAU,2BAA2B,MAAM,mBAAmB;EAE1E,MAAM,SAAS,eAAe,MAAM,QAAQ,2BAA2B,MAAM,QAAQ;EACrF,IAAI,CAAC,sBAAsB,MAAM,GAC/B,MAAM,IAAI,UACR,2BAA2B,MAAM,4DACnC;EAEF,MAAM,aAAa,eACjB,MAAM,YACN,2BAA2B,MAAM,YACnC;EACA,IAAI,qBAAqB,IAAI,UAAU,GACrC,MAAM,IAAI,UACR,2BAA2B,MAAM,oDACnC;EAEF,MAAM,WAAW,eAAe,MAAM,UAAU,2BAA2B,MAAM,UAAU;EAC3F,IAAI,aAAa,MAAM,OACrB,MAAM,IAAI,UACR,2BAA2B,MAAM,8CACnC;EAEF,MAAM,SAAS,eAAe,MAAM,QAAQ,2BAA2B,MAAM,QAAQ;EACrF,MAAM,YAAY,mBAChB,MAAM,WACN,2BAA2B,MAAM,WACnC;EACA,MAAM,YAAY,eAAe,MAAM,WAAW,2BAA2B,MAAM,WAAW;EAC9F,IAAI,cAAc,mBAChB,MAAM,IAAI,UAAU,2BAA2B,MAAM,qBAAqB;EAG5E,IAAI,MAAM,YAAY,yBAAyB;GAC7C,eACE,OACA;IACE;IACA;IACA;IACA;IACA;IACA;IACA;IACA;GACF,GACA,2BAA2B,OAC7B;GACA,qBAAqB;GACrB,IAAI,oBAAoB,GACtB,MAAM,IAAI,UAAU,yDAAyD;GAE/E,OAAO;IACL;IACA,SAAS;IACT,cAAc,qBACZ,MAAM,cACN,cACA,2BAA2B,OAC7B;IACA;IACA;IACA;IACA;IACA;GACF;EACF;EAEA,IAAI,MAAM,YAAY,eAAe,MAAM,YAAY,YACrD,MAAM,IAAI,UACR,2BAA2B,MAAM,+DACnC;EAEF,eACE,OACA;GACE;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF,GACA,2BAA2B,OAC7B;EACA,MAAM,YAAY,eAAe,MAAM,WAAW,2BAA2B,MAAM,WAAW;EAC9F,MAAM,UAAU,aAAa,IAAI,SAAS;EAC1C,IAAI,CAAC,SACH,MAAM,IAAI,UAAU,0DAA0D,UAAU,EAAE;EAE5F,IAAI,eAAe,IAAI,SAAS,GAC9B,MAAM,IAAI,UAAU,qDAAqD,UAAU,EAAE;EAEvF,eAAe,IAAI,SAAS;EAC5B,MAAM,gBAAgB,eACpB,MAAM,eACN,2BAA2B,MAAM,eACnC;EACA,MAAM,iBAAiB,qBAAqB,OAAO;EACnD,IAAI,kBAAkB,gBACpB,MAAM,IAAI,UACR,2BAA2B,MAAM,mCAAmC,UAAU,EAChF;EAEF,OAAO;GACL;GACA;GACA,eAAe;GACf,SAAS,MAAM;GACf;GACA;GACA;GACA;GACA;EACF;CACF,CAAC;CAED,IAAI,MAAM,iBAAiB;EACzB,MAAM,UAAU,SACb,KAAK,YAAY,QAAQ,UAAU,CAAC,CACpC,QAAQ,cAAc,CAAC,eAAe,IAAI,SAAS,CAAC;EACvD,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,UACR,oFAAoF,QAAQ,KAAK,IAAI,GACvG;EAEF,IAAI,sBAAsB,GACxB,MAAM,IAAI,UACR,+GACF;CAEJ;CACA,OAAO;AACT;AAEA,SAAgB,uBAAuB,YAAqC;CAC1E,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,aAAa,YAAY;EAClC,IAAI,UAAU,KAAK,CAAC,CAAC,WAAW,GAAG,MAAM,IAAI,UAAU,sCAAsC;EAC7F,IAAI,KAAK,IAAI,SAAS,GACpB,MAAM,IAAI,UAAU,8CAA8C,UAAU,EAAE;EAEhF,KAAK,IAAI,SAAS;CACpB;AACF;AAEA,SAAS,uBAAuB,OAAgB,SAAiC;CAC/E,IAAI;CACJ,IAAI;EACF,WAAW,KAAK,MAAM,gBAAgB,KAAK,CAAC;CAC9C,SAAS,OAAO;EACd,MAAM,IAAI,UAAU,GAAG,QAAQ,6CAA6C,EAAE,MAAM,CAAC;CACvF;CACA,qBAAqB,UAAU,OAAO;CACtC,OAAO;AACT;AAEA,SAAS,qBAAqB,OAAgB,SAAkD;CAC9F,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eACE,OACA;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACA,OACF;CACA,IAAI,MAAM,mBAAmB,SAC3B,MAAM,IAAI,UAAU,GAAG,QAAQ,gCAAgC;CAEjE,eAAe,MAAM,YAAY,GAAG,QAAQ,YAAY;CACxD,eAAe,MAAM,YAAY,GAAG,QAAQ,YAAY;CACxD,mBAAmB,MAAM,aAAa,GAAG,QAAQ,aAAa;CAC9D,IACE,MAAM,aAAa,cACnB,MAAM,aAAa,UACnB,MAAM,aAAa,YACnB,MAAM,aAAa,SACnB,MAAM,aAAa,QAEnB,MAAM,IAAI,UAAU,GAAG,QAAQ,qBAAqB;CAEtD,eAAe,MAAM,MAAM,GAAG,QAAQ,MAAM;CAC5C,eAAe,MAAM,OAAO,GAAG,QAAQ,OAAO;CAC9C,eAAe,MAAM,WAAW,GAAG,QAAQ,WAAW;CACtD,MAAM,gBAAgB,qBAAqB,MAAM,eAAe,GAAG,QAAQ,eAAe;CAC1F,eAAe,MAAM,oBAAoB,GAAG,QAAQ,oBAAoB;CACxE,eAAe,MAAM,iBAAiB,GAAG,QAAQ,iBAAiB;CAClE,IACE,OAAO,MAAM,eAAe,YAC5B,CAAC,OAAO,SAAS,MAAM,UAAU,KACjC,MAAM,aAAa,KACnB,MAAM,aAAa,GAEnB,MAAM,IAAI,UAAU,GAAG,QAAQ,qDAAqD;CAEtF,eAAe,MAAM,SAAS,GAAG,QAAQ,SAAS;CAClD,IAAI,MAAM,uBAAuB,KAAA,KAAa,OAAO,MAAM,uBAAuB,WAChF,MAAM,IAAI,UAAU,GAAG,QAAQ,sCAAsC;CAEvE,IAAI,MAAM,aAAa,KAAA,KAAa,CAAC,SAAS,MAAM,QAAQ,GAC1D,MAAM,IAAI,UAAU,GAAG,QAAQ,4BAA4B;AAE/D;AAEA,SAAS,qBACP,OACA,cACA,SACsB;CACtB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,UAAU,GAAG,QAAQ,+BAA+B;CAEhE,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,MAAM,KAAK,OAAO,UAAU;EACjC,MAAM,eAAe,GAAG,QAAQ,gBAAgB;EAChD,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,aAAa,mBAAmB;EAC7E,eAAe,OAAO;GAAC;GAAM;GAAU;EAAU,GAAG,YAAY;EAChE,MAAM,KAAK,eAAe,MAAM,IAAI,GAAG,aAAa,IAAI;EACxD,IAAI,aAAa,IAAI,EAAE,GACrB,MAAM,IAAI,UAAU,GAAG,aAAa,OAAO,GAAG,mCAAmC;EAEnF,IAAI,KAAK,IAAI,EAAE,GACb,MAAM,IAAI,UAAU,8BAA8B,GAAG,EAAE;EAEzD,KAAK,IAAI,EAAE;EAEX,OAAO;GACL;GACA,QAHa,eAAe,MAAM,QAAQ,GAAG,aAAa,QAGrD;GACL,GAAI,MAAM,aAAa,KAAA,IACnB,CAAC,IACD,EAAE,UAAU,qBAAqB,MAAM,UAAU,GAAG,aAAa,UAAU,EAAE;EACnF;CACF,CAAC;AACH;AAEA,SAAS,qBAAqB,OAAgB,SAAgC;CAC5E,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,kBAAkB;CAC5E,OAAO,MAAM,KAAK,UAAU,UAAU;EACpC,MAAM,kBAAkB,GAAG,QAAQ,GAAG;EACtC,IAAI,CAAC,SAAS,QAAQ,GAAG,MAAM,IAAI,UAAU,GAAG,gBAAgB,mBAAmB;EACnF,eAAe,UAAU;GAAC;GAAQ;GAAO;EAAS,GAAG,eAAe;EACpE,IACE,SAAS,SAAS,UAClB,SAAS,SAAS,WAClB,SAAS,SAAS,cAClB,SAAS,SAAS,aAClB,SAAS,SAAS,UAElB,MAAM,IAAI,UAAU,GAAG,gBAAgB,iBAAiB;EAE1D,MAAM,MAAM,eAAe,SAAS,KAAK,GAAG,gBAAgB,KAAK;EACjE,MAAM,UAAU,SAAS;EACzB,eAAe,SAAS,GAAG,gBAAgB,SAAS;EACpD,OAAO;GACL,MAAM,SAAS;GACf;GACA,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAW,QAAkB;EAChE;CACF,CAAC;AACH;AAEA,SAAS,eACP,OACA,SACA,MACM;CACN,MAAM,cAAc,IAAI,IAAI,OAAO;CACnC,MAAM,aAAa,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,QAAQ,CAAC,YAAY,IAAI,GAAG,CAAC;CAC3E,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B,WAAW,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG;AAE1F;AAEA,SAAS,YAAY,OAAgB,MAAwB;CAC3D,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,OAAO,SAAS,QAAQ,GACxE,MAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;CAE3D,MAAM,UAAU,MAAM,KAAK,SAAS,eAAe,MAAM,IAAI,CAAC;CAC9D,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC,SAAS,QAAQ,QACpC,MAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B;CAE1D,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,MAAsB;CAC5D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B;CAE1D,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,MAAgC;CACtE,MAAM,SAAS,eAAe,OAAO,IAAI;CACzC,IAAI,CAAC,wBAAwB,KAAK,MAAM,GACtC,MAAM,IAAI,UAAU,GAAG,KAAK,yBAAyB;CAEvD,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,MAAoB;CAC1D,IAAI,UAAU,KAAA,KAAa,OAAO,UAAU,UAC1C,MAAM,IAAI,UAAU,GAAG,KAAK,kBAAkB;AAElD;AAEA,SAAS,mBAAmB,OAAgB,MAAsB;CAChE,MAAM,YAAY,eAAe,OAAO,IAAI;CAC5C,MAAM,SAAS,IAAI,KAAK,SAAS;CACjC,IAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,KAAK,OAAO,YAAY,MAAM,WAC7D,MAAM,IAAI,UAAU,GAAG,KAAK,4CAA4C;CAE1E,OAAO;AACT;AAEA,SAAS,sBAAsB,OAA6C;CAC1E,OACE,UAAU,UACV,UAAU,WACV,UAAU,iBACV,UAAU,YACV,UAAU;AAEd;AAEA,SAAS,SAAS,OAAkD;CAClE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;;;;;;;;;;;;AC9yBA,MAAM,sBAAsB;;AAE5B,MAAM,iBAAiB;;;;;;;;;;;AAWvB,MAAM,6BAA6B;;;;;;;;;;AAUnC,MAAM,yCAAyC;;;;;;AAM/C,MAAM,YACJ;AAEF,SAAS,IAAI,GAA2B;CACtC,OAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAC3D;AACA,SAAS,QAAQ,OAAgC,MAAwC;CACvF,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,IAAI,MAAM,IAAI;EAC5B,IAAI,UAAU,MAAM,OAAO;CAC7B;CACA,OAAO;AACT;AACA,SAAS,cAAc,GAAoC;CACzD,MAAM,eAAe,IAAI,EAAE,WAAW,mBAAmB;CACzD,IAAI,iBAAiB,MAAM,OAAO;CAGlC,OACE,QAAQ,EAAE,YAAY,yBAAyB,KAAK,IAAI,EAAE,WAAW,yBAAyB;AAElG;AACA,SAAS,eAAe,GAAoC;CAC1D,OACE,QAAQ,EAAE,YAAY,0BAA0B,KAChD,IAAI,EAAE,WAAW,0BAA0B;AAE/C;AACA,SAAS,OAAO,GAAoC;CAClD,OAAO,IAAI,EAAE,WAAW,IAAI;AAC9B;AACA,SAAS,WAAW,GAAoC;CACtD,IAAI,EAAE,WAAW,OAAO,EAAE;CAC1B,KAAK,MAAM,OAAO,qBAAqB;EACrC,MAAM,IAAI,EAAE,WAAW;EACvB,IAAI,OAAO,MAAM,YAAY,EAAE,SAAS,GAAG,OAAO;CACpD;CACA,OAAO;AACT;;;;;AAMA,SAAgB,oBAAoB,OAAuD;CACzF,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC;CAC3D,IAAI,SAAS,OAAO,GAClB,MAAM,IAAI,MACR,gEAAgE,SAAS,KAAK,QAChF;CAEF,MAAM,UAAU,SAAS,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS;CAElD,MAAM,UAAyB,MAAM,KAAK,UAAU;EAClD;EACA,OAAO,cAAc,IAAI;EACzB,QAAQ,eAAe,IAAI;EAC3B,MAAM,OAAO,IAAI;CACnB,EAAE;CACF,MAAM,aAAa,QAAQ,QAAQ,WAAW,OAAO,KAAK,SAAS,KAAK;CACxE,MAAM,eACJ,WAAW,SAAS,IAChB,aACA,QAAQ,QAAQ,WAAW,OAAO,UAAU,QAAQ,OAAO,WAAW,IAAI;CAChF,MAAM,iBAAiB,oBAAoB,cAAc,KAAK;CAC9D,MAAM,kBAAkB,eAAe;CACvC,MAAM,uBACJ,iBAAiB,qBAAqB,QAAQ,UAA2B,UAAU,IAAI,KAAK,CAAC;CAC/F,MAAM,wBACJ,iBAAiB,sBAAsB,QAAQ,UAA2B,UAAU,IAAI,KAAK,CAAC;CAChG,MAAM,gBAAwC,CAAC;CAC/C,IAAI,sBAAsB;CAE1B,KAAK,MAAM,KAAK,OAAO;EACrB,MAAM,OAAO,WAAW,CAAC;EACzB,IAAI,MAAM;GACR,cAAc,SAAS,cAAc,SAAS,KAAK;GACnD,IAAI,UAAU,KAAK,IAAI,GAAG,sBAAsB;EAClD;CACF;CAEA,MAAM,iBAAiB,OAAO,OAAO,aAAa,CAAC,CAAC,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;CAC7E,MAAM,gBAAgB,OAAO,KAAK,aAAa,CAAC,CAAC;CACjD,MAAM,qBAAqB,mBAAmB,IAAI,IAAI,gBAAgB;CAEtE,MAAM,UAA8B,CAAC;CACrC,MAAM,mCAAmB,IAAI,IAAoB;CACjD,KAAK,MAAM,YAAY,gBACrB,KAAK,MAAM,UAAU,aAAa,QAAQ,GAAG;EAC3C,IAAI,iBAAiB,IAAI,OAAO,IAAI,GAAG;EACvC,iBAAiB,IAAI,OAAO,IAAI;EAChC,QAAQ,KAAK,MAAM;CACrB;CAGF,IAAI,kBAAkB,kBAAkB,kBAAkB,GAAG;EAC3D,MAAM,OAAO,OAAO,KAAK,aAAa,CAAC,CAAC;EACxC,QAAQ,KAAK;GACX,MAAM;GACN,UAAU;GACV,QAAQ,OAAO,eAAe,6BAA6B,KAAK;GAChE,UAAU;IAAE,MAAM;IAAM,OAAO;IAAgB,gBAAgB;GAAE;EACnE,CAAC;CACH;CAEA,IAAI,kBAAkB,kBAAkB,CAAC,qBACvC,QAAQ,KAAK;EACX,MAAM;EACN,UAAU;EACV,QAAQ,GAAG,eAAe;EAC1B,UAAU;GAAE,YAAY;GAAgB,oBAAoB;EAAE;CAChE,CAAC;CAGH,OAAO;EACL;EACA,cAAc,aAAa;EAC3B;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,oBACP,SACA,OAC2B;CAE3B,MAAM,oBAAoB,kCAAkC,IADtC,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,SAAS,IAAI,CAAC,CACE,CAAC;CACrE,MAAM,gBAAgB,QAAQ,KAAK,YAAY;EAC7C;EACA,GAAG,kBAAkB,OAAO,IAAI;CAClC,EAAE;CACF,MAAM,cAAc,qBAAqB,aAAa;CACtD,MAAM,0BAAU,IAAI,IAAyD;CAC7E,KAAK,MAAM,UAAU,eAAe;EAClC,MAAM,UAAU,YAAY,IAAI,OAAO,GAAG;EAC1C,MAAM,QAAQ,QAAQ,IAAI,OAAO,KAAK;GAAE,SAAS,OAAO;GAAS,SAAS,CAAC;EAAE;EAC7E,MAAM,QAAQ,KAAK,OAAO,MAAM;EAChC,QAAQ,IAAI,SAAS,KAAK;CAC5B;CAEA,MAAM,YAAuC,CAAC;CAC9C,KAAK,MAAM,EAAE,SAAS,SAAS,aAAa,QAAQ,OAAO,GAAG;EAC5D,MAAM,OAAO,gBAAgB,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,mBAAmB,CAAC;EACnE,KAAK,SAAS,KAAK,UAAU;GAC3B,UAAU,KAAK;IACb,SAAS,KAAK,WAAW,IAAI,UAAU,GAAG,QAAQ,GAAG,QAAQ;IAC7D,SAAS,IAAI,KAAK,WAAW,OAAO,KAAK,OAAO;IAChD,sBAAsB,IAAI,KAAK,WAAW,OAAO,KAAK;IACtD,uBAAuB,IAAI,KAAK,WAAW,OAAO,MAAM;GAC1D,CAAC;EACH,CAAC;CACH;CAEA,OAAO,UAAU,MACd,GAAG,MACF,EAAE,QAAQ,SAAS,EAAE,QAAQ,UAC7B,EAAE,QAAQ,cAAc,EAAE,OAAO,KACjC,EAAE,QAAQ,EAAE,CAAE,cAAc,EAAE,QAAQ,EAAG,CAC7C;AACF;AASA,SAAS,kCAAkC,WAQzC;CACA,MAAM,wBAAQ,IAAI,IAA2B;CAC7C,QAAQ,SAAS;EACf,MAAM,WAAW,qBAAqB,KAAK,gBAAgB,WAAW,KAAK;EAC3E,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,SAAS,UACrB,QAAQ,SAAS,YACjB,SAAS,kBACP,UAAU,SAAS,oBACnB,SACE,QAAQ,WACR,KAAK,aACH,SAAS,KAAK,eACd,SAAS,KAAK;EACxB,MAAM,cAAc,SAAS,WAAW,SAAS,mBAAmB;EACpE,MAAM,WAAW,SAAS,aAAa,UAAU,IAAI,SAAS,UAAU,IAAI,KAAA;EAC5E,MAAM,SAAS,gBAAgB,QAAQ,SAAS,eAAe;EAC/D,MAAM,YAAY,SAAS,OAAO;EAClC,OAAO;GACL,KAAK,KAAK,UAAU,CAAC,SAAS,SAAS,KAAK,UAAU,SAAS,UAAU,CAAC;GAC1E,UAAU;GACV;GACA,OAAO,YAAY,gBAAgB,UAAU,UAAU,IAAI;GAC3D,KAAK,YAAY,gBAAgB,UAAU,QAAQ,IAAI;EACzD;CACF;AACF;AAEA,SAAS,qBACP,SACA,WACA,OACe;CACf,MAAM,QAAuB;EAC3B,SAAS;EACT,QAAQ;EACR,iBAAiB;EACjB,YAAY;CACd;CACA,IAAI,CAAC,SAAS,OAAO;CAErB,MAAM,OAAiB,CAAC;CACxB,MAAM,4BAAY,IAAI,IAAoB;CAC1C,IAAI,YAA2B;CAC/B,IAAI,WAAW;CACf,OAAO,WAAW;EAChB,MAAM,SAAS,MAAM,IAAI,SAAS;EAClC,IAAI,QAAQ;GACV,WAAW;GACX;EACF;EACA,MAAM,aAAa,UAAU,IAAI,SAAS;EAC1C,IAAI,eAAe,KAAA,GAAW;GAC5B,WAAW;IACT,SAAS;IACT,QAAQ,CAAC,GAAG,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3C,iBAAiB;IACjB,YAAY,CAAC,GAAG,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;GACjD;GACA;EACF;EACA,MAAM,UAAU,UAAU,IAAI,SAAS;EACvC,IAAI,CAAC,SAAS;GACZ,WAAW;IACT,SAAS;IACT,QAAQ;IACR,iBAAiB;IACjB,YAAY;GACd;GACA;EACF;EACA,IAAI,QAAQ,SAAS,SAAS;GAC5B,WAAW;IACT,SAAS,QAAQ;IACjB,QAAQ;IACR,iBAAiB;IACjB,YAAY,QAAQ;GACtB;GACA;EACF;EACA,UAAU,IAAI,WAAW,KAAK,MAAM;EACpC,KAAK,KAAK,SAAS;EACnB,YAAY,QAAQ;CACtB;CAEA,KAAK,IAAI,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;EACxD,IAAI,SAAS,YAAY,QAAQ,SAAS,WAAW,MACnD,WAAW;GAAE,GAAG;GAAU,QAAQ,KAAK;GAAS,YAAY,KAAK;EAAQ;OACpE,IACL,SAAS,gBAAgB,SAAS,WAAW,SAAS,mBAAmB,SAAS,SAElF,WAAW;GAAE,GAAG;GAAU,YAAY,KAAK;EAAQ;EAErD,MAAM,IAAI,KAAK,QAAS,QAAQ;CAClC;CACA,OAAO;AACT;AAEA,SAAS,oBAAoB,GAAgB,GAAwB;CACnE,MAAM,SAAS,gBAAgB,EAAE,KAAK,UAAU;CAChD,MAAM,SAAS,gBAAgB,EAAE,KAAK,UAAU;CAChD,IAAI,WAAW,QAAQ,WAAW,MAAM,OAAO;CAC/C,IAAI,WAAW,QAAQ,WAAW,MAAM,OAAO;CAC/C,IAAI,WAAW,QAAQ,WAAW,QAAQ,WAAW,QAAQ,OAAO,SAAS;CAC7E,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,QAAQ,EAAE,SAAS,EAAE,MAAM,OAAO,EAAE,OAAO,EAAE;CAC/E,OAAO,EAAE,KAAK,QAAQ,cAAc,EAAE,KAAK,OAAO;AACpD;AAEA,SAAS,gBAAgB,SAAkD;CACzE,MAAM,OAAwB,CAAC;CAC/B,IAAI,SAAwB,CAAC;CAC7B,IAAI,UAAyB,CAAC;CAC9B,IAAI,aAAa,OAAO;CAExB,MAAM,oBAAoB;EACxB,IAAI,OAAO,SAAS,GAAG,KAAK,KAAK,MAAM;EACvC,SAAS,CAAC;CACZ;CACA,MAAM,qBAAqB;EACzB,IAAI,QAAQ,WAAW,GACrB,OAAO,KAAK,QAAQ,EAAG;OAClB,IAAI,QAAQ,SAAS,GAAG;GAC7B,YAAY;GACZ,KAAK,MAAM,UAAU,SAAS,KAAK,KAAK,CAAC,MAAM,CAAC;EAClD;EACA,UAAU,CAAC;EACX,aAAa,OAAO;CACtB;CAEA,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,QAAQ,gBAAgB,OAAO,KAAK,UAAU;EACpD,MAAM,MAAM,gBAAgB,OAAO,KAAK,QAAQ;EAChD,IAAI,UAAU,QAAQ,QAAQ,QAAQ,OAAO,KAAK,eAAe,KAAK,MAAM,OAAO;GACjF,aAAa;GACb,YAAY;GACZ,KAAK,KAAK,CAAC,MAAM,CAAC;GAClB;EACF;EACA,IAAI,QAAQ,SAAS,KAAK,SAAS,YAAY,aAAa;EAC5D,QAAQ,KAAK,MAAM;EACnB,aAAa,KAAK,IAAI,YAAY,GAAG;CACvC;CACA,aAAa;CACb,YAAY;CACZ,OAAO;AACT;AAEA,SAAS,aAAa,UAAuD;CAC3E,MAAM,UAA8B,CAAC;CACrC,MAAM,SAAS,SAAS;CACxB,MAAM,UAAU,SAAS;CACzB,IAAI,OAAO,UAAU,KAAK,OAAO,OAAO,UAA2B,UAAU,IAAI,GAAG;EAClF,MAAM,QAAQ,OAAO;EACrB,MAAM,OAAO,OAAO,OAAO,SAAS;EACpC,MAAM,cAAc,cAAc,SAAS,UAAU,YAAY,WAAW,QAAQ;EACpF,MAAM,iBAAiB,UAAU,KAAK,OAAO;EAC7C,MAAM,SAAS,iBAAiB,WAAW,QAAQ,IAAI,OAAO,QAAQ;EACtE,IAAI,eAAe,OAAO,SAAS,UAAU,qBAAqB;GAChE,MAAM,cAAc,iBAAiB,0BAA0B,GAAG,OAAO,QAAQ,CAAC,EAAE;GACpF,QAAQ,KAAK;IACX,MAAM;IACN,UAAU;IACV,QAAQ,yBAAyB,YAAY,IAAI,MAAM,GAAG,KAAK,WAAW,OAAO,OAAO;IACxF,UAAU;KACR;KACA;KACA,UAAU,iBAAiB,cAAc,OAAO,OAAO,QAAQ,CAAC,CAAC;KACjE,OAAO,OAAO;KACd,OAAO,SAAS;KAChB,eAAe,SAAS,QAAQ;KAChC,cAAc,SAAS,QAAQ,SAAS,QAAQ,SAAS;IAC3D;GACF,CAAC;EACH;CACF;CAEA,IACE,OAAO,UAAU,8BACjB,OAAO,WAAW,QAAQ,UAC1B,OAAO,OAAO,UAA2B,UAAU,IAAI,KACvD,QAAQ,OAAO,UAA2B,UAAU,IAAI,GACxD;EACA,MAAM,QAAQ,QAAQ;EACtB,MAAM,OAAO,QAAQ,QAAQ,SAAS;EACtC,MAAM,mBAAmB,cAAc,SAAS,UAAU,YAAY,WAAW,QAAQ;EACzF,MAAM,oBAAoB,cAAc,UAAU,UAAU,YAAY,WAAW,QAAQ;EAC3F,MAAM,YAAY,OAAO,OAAO,SAAS,KAAM,OAAO;EACtD,MAAM,kBAAkB,QAAQ,QAAQ;EACxC,IAAI,oBAAoB,aAAa,qBAAqB,iBACxD,QAAQ,KAAK;GACX,MAAM;GACN,UAAU;GACV,QAAQ,4BAA4B,MAAM,GAAG,KAAK,QAAQ,QAAQ,OAAO;GACzE,UAAU;IACR;IACA;IACA,OAAO,QAAQ;IACf,OAAO,SAAS;IAChB,eAAe,SAAS,QAAQ;IAChC,cAAc,SAAS,QAAQ,SAAS,QAAQ,SAAS;GAC3D;EACF,CAAC;CAEL;CACA,OAAO;AACT;AAEA,SAAS,cACP,QACA,WACS;CACT,OAAO,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,SAAS,UAAU,UAAU,OAAO,QAAS,OAAO,CAAC;AACrF;;;;;;;;AC9dA,MAAM,qBAAqD;CACzD,0BACE;CACF,uBACE;CACF,0BACE;CACF,wBACE;AACJ;AAEA,MAAMA,eAAa;AACnB,MAAM,qBAAqB;AAC3B,MAAM,4BAA4B;AAClC,MAAM,kBAAkB;AASxB,MAAM,kBAA0F;CAC9F,2BAA2B,UAAU,aACnC,GAAG,SAAS,GAAG,SAAS;CAC1B,wBAAwB,UAAU,aAChC,GAAG,SAAS,GAAG,SAAS;CAC1B,2BAA2B,UAAU,aACnC,GAAG,SAAS,GAAG,SAAS;CAC1B,yBAAyB,UAAU,aACjC,GAAG,SAAS,GAAG,SAAS;AAC5B;AAEA,eAAe,aACb,OACA,WACA,QACmB;CACnB,MAAM,2BAAW,IAAI,IAAY;CACjC,IAAI,SAAS;CACb,IAAI;CAEJ,OAAO,MAAM;EACX,QAAQ,eAAe;EACvB,MAAM,OAAO,MAAM,MAAM,YAAY;GAAE,OAAO;GAAiB;EAAO,CAAC;EACvE,IAAI,kBAAkB,KAAA,GAAW,gBAAgB,KAAK;EACtD,IAAI,KAAK,UAAU,eACjB,MAAM,IAAI,MACR,6DAA6D,cAAc,MAAM,KAAK,MAAM,EAC9F;EAEF,IAAI,KAAK,QAAQ,WACf,MAAM,IAAI,WACR,sBAAsB,KAAK,MAAM,2BAA2B,UAAU,+CACxE;EAEF,KAAK,MAAM,SAAS,KAAK,QAAQ,SAAS,IAAI,MAAM,QAAQ;EAC5D,IAAI,SAAS,OAAO,WAClB,MAAM,IAAI,WACR,0CAA0C,UAAU,6BACtD;EAEF,IAAI,CAAC,KAAK,UAAU;EACpB,IAAI,KAAK,OAAO,WAAW,GACzB,MAAM,IAAI,MAAM,0EAA0E;EAE5F,UAAU,KAAK,OAAO;CACxB;CAEA,IAAI,SAAS,SAAS,eACpB,MAAM,IAAI,MACR,0CAA0C,SAAS,KAAK,GAAG,iBAAiB,EAAE,eAChF;CAGF,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;AAC5B;;;;;AAMA,SAAgB,yBACd,SACA,OAAoD,CAAC,GACnC;CAClB,MAAM,YAAY,KAAK,aAAaA;CACpC,MAAM,UAAU,QAAQ;CACxB,OAAO,QAAQ,QAAQ,KAAK,QAC1B,YAAY;EACV,YAAY;EACZ,MAAM;EACN,SAAS,IAAI;EACb,OAAO,IAAI;EACX,UAAU,IAAI;EAEd,YAAY;EACZ,eAAe,CACb;GACE,MAAM;GACN,KAAK,UACD,kBAAkB,mBAAmB,OAAO,EAAE,cAAc,IAAI,SAChE,uBAAuB,IAAI;GAC/B,SAAS,KAAK,UAAU,IAAI,QAAQ;EACtC,CACF;EACA,oBAAoB,mBAAmB,IAAI;EAC3C,UAAU;GACR,eAAe;GACf,UAAU,IAAI;GACd,GAAI,UAAU,EAAE,UAAU,QAAQ,IAAI,CAAC;EACzC;EACA,UAAU,IAAI;EACd,GAAI,KAAK,aAAa,EAAE,aAAa,KAAK,WAAW,IAAI,CAAC;CAC5D,CAAC,CACH;AACF;;AAGA,SAAgB,kBACd,UAAoC,CAAC,GACI;CACzC,MAAM,YAAY,gBAAgB,QAAQ,aAAa,oBAAoB,WAAW;CACtF,MAAM,4BAA4B,gBAChC,QAAQ,6BAA6B,2BACrC,2BACF;CACA,OAAO;EACL,IAAIA;EACJ,aACE;EACF,WAAW;EACX,MAAM,EAAE,MAAM,gBAAgB;EAC9B,SAAS;EACT,iBAAiB;GACf,MAAM;GACN,YAAY;GACZ,+BAA+B;EACjC;EACA,MAAM,QAAQ,OAAO,SAAS;GAC5B,MAAM,mBAAmB,MAAM,aAAa,OAAO,WAAW,QAAQ,MAAM;GAC5E,MAAM,+BAAe,IAAI,IAQvB;GACF,KAAK,MAAM,WAAW,kBAAkB;IACtC,QAAQ,QAAQ,eAAe;IAC/B,MAAM,SAAS,MAAM,MAAM,UAAU,EAAE,UAAU,QAAQ,CAAC;IAC1D,IAAI,OAAO,aAAa,SACtB,MAAM,IAAI,MACR,uCAAuC,QAAQ,eAAe,OAAO,SAAS,EAChF;IAEF,IAAI,CAAC,OAAO,OACV,MAAM,IAAI,MACR,6BAA6B,QAAQ,4CACvC;IAEF,MAAM,UAAU,oBAAoB,OAAO,KAAK;IAChD,IAAI,QAAQ,YAAY,QAAQ,QAAQ,YAAY,SAClD,MAAM,IAAI,MACR,uCAAuC,QAAQ,eAAe,QAAQ,QAAQ,EAChF;IAEF,KAAK,MAAM,WAAW,yBAAyB,OAAO,GAAG;KACvD,MAAM,UAAU,aAAa,IAAI,QAAQ,UAAU;KACnD,IAAI,CAAC,SAAS;MACZ,aAAa,IAAI,QAAQ,YAAY;OACnC;OACA,oBAAoB;OACpB,kBAAkB,CAAC,OAAO;OAC1B,UAAU,CAAC,GAAG,QAAQ,aAAa;MACrC,CAAC;MACD;KACF;KACA,QAAQ,sBAAsB;KAC9B,IAAI,QAAQ,SAAS,SAAS,2BAA2B;MACvD,QAAQ,iBAAiB,KAAK,OAAO;MACrC,QAAQ,SAAS,KAAK,GAAG,QAAQ,aAAa;KAChD;IACF;GACF;GACA,OAAO,CAAC,GAAG,aAAa,OAAO,CAAC,CAAC,CAAC,KAC/B,EAAE,SAAS,oBAAoB,kBAAkB,gBAAgB;IAChE,GAAG;IACH,OAAO,gBAAgB,QAAQ,QAA0B,CACvD,oBACA,iBAAiB,MACnB;IACA,WAAW,GAAG,mBAAmB,GAAG,iBAAiB,OAAO;IAC5D,eAAe;IACf,UAAU;KACR,eAAe;KACf,oBAAoB;KACpB,8BAA8B,qBAAqB,iBAAiB;KACpE,sBAAsB;KACtB,sBAAsB,iBAAiB;IACzC;GACF,EACF;EACF;CACF;AACF;AAEA,SAAS,gBAAgB,OAAe,MAAsB;CAC5D,IAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAC1C,MAAM,IAAI,WAAW,sBAAsB,KAAK,iCAAiC;CAEnF,OAAO;AACT;;;AC9NA,MAAM,aAAa;AAEnB,SAAS,MAAM,OAAwB;CACrC,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,MAAM,UAAU,KAAK,UAAU,KAAK;CACpC,OAAO,YAAY,KAAA,IAAY,OAAO,KAAK,IAAI;AACjD;AAEA,SAAS,YAAY,WAAmB,OAAoD;CAC1F,OAAO;EACL,MAAM;EACN,KAAK,oBAAoB,mBAAmB,SAAS,EAAE,GAAG,MAAM;EAChE,SAAS,MAAM,MAAM,KAAK;CAC5B;AACF;;AAGA,SAAgB,6BACd,OACA,YACkB;CAClB,MAAM,SAAS,8BAA8B,OAAO,EAAE,YAAY,WAAW,CAAC;CAC9E,OAAO,OAAO,OAAO,KAAK,UACxB,YAAY;EACV,YAAY;EACZ,aAAa;EACb,MAAM,MAAM;EACZ,UAAU,MAAM;EAChB,SAAS,GAAG,OAAO,OAAO,GAAG,MAAM;EACnC,OAAO,MAAM;EACb,WAAW,MAAM;EACjB,eAAe,MAAM,SAAS,KAAK,UAAU,YAAY,OAAO,QAAQ,KAAK,CAAC;EAC9E,oBAAoB,MAAM;EAC1B,iBACE;EACF,YAAY;EACZ,UAAU;GACR,gBAAgB,MAAM;GACtB,iBAAiB,OAAO;GACxB,mBAAmB,OAAO;GAC1B,mBAAmB,MAAM;GACzB,GAAG,MAAM;EACX;CACF,CAAC,CACH;AACF;;AAGA,IAAa,0BAAb,MAEA;CACE,KAAc;CACd,cACE;CACF,YAAqB;CACrB,OAAgB;EAAE,MAAM;EAA0B,iBAAiB;CAAE;CACrE,UAAmB;CACnB,kBAA2B;EACzB,MAAM;EACN,oBAAoB;CACtB;CAEA,MAAM,QACJ,OACA,KAC2B;EAE3B,MAAM,WAAW,6BAA6B,OAD3B,IAAI,MAAM,+BAAc,IAAI,KAAK,EAAA,CAAE,YAAY,CACH;EAC/D,IAAI,MAAM,sBAAsB,SAAS,OAAO,cAAc,EAC5D,OAAO,WAAW,QAAQ,sBAAsB,uBAClD,CAAC;EACD,OAAO;CACT;AACF;AAEA,MAAa,4BAA4B,IAAI,wBAAwB;ACHrE,MAAa,yBAAiD;CAC5D,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;EA9CO,+BAA+B,cAIvC,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2Cf,WAAW;CAIX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;CAG9D,0BAA0B;AAC5B;AC1CA,MAAa,wBAAgD;CAC3D,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;;;EAtCO,+BAA+B,aAMvC,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;CAiCf,WAAW;CACX,QAAQ;EACN,aAAa;EACb,eAAe;EACf,cAAc;EACd,gBAAgB;CAClB;AACF;ACLA,MAAa,8BAAsD;CACjE,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;;;EAlCO,+BAA+B,mBAMvC,EAAE;;;;;;;;;;;;;;;;;;;;;CAgCf,WAAW;CACX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;CAI9D,0BAA0B;AAC5B;ACtBA,MAAa,0BAAkD;CAC7D,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;;;EAjCO,+BAA+B,eAMvC,EAAE;;;;;;;;;;;;;;;;;;;;CA4Bf,WAAW;CACX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;AAChE;AChBA,MAAa,gCAAwD;CACnE,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAc;;EAlCO,+BAA+B,qBAIvC,EAAE;;;;;;;;;;;;;;;;;;;;;;;CA+Bf,WAAW;CACX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;CAC9D,0BAA0B;AAC5B;;;;;;;;;;;;ACjBA,MAAa,8BAAiE;CAC5E;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;;;;;;;;;;;;AC+KA,IAAa,gCAAb,cAAmD,MAAM;CACvD,OAAwB;CACxB;CAEA,YAAY,SAAiB,QAA+B,SAAwB;EAClF,MAAM,SAAS,OAAO;EACtB,MAAM,WAAW,+BAA+B,QAAQ,sCAAsC;EAC9F,IAAI,SAAS,WAAW,WAAW,UACjC,MAAM,IAAI,UAAU,+DAA+D;EAErF,KAAK,SAAS;CAChB;AACF;AAEA,IAAa,kBAAb,MAA6B;CAC3B,2BAA4B,IAAI,IAAqB;CACrD;CAEA,YAAY,UAAkC,CAAC,GAAG;EAChD,KAAK,UAAU;CACjB;CAEA,SAAS,SAAwB;EAC/B,MAAM,KAAK,QAAQ;EACnB,MAAM,UAAU,QAAQ;EACxB,MAAM,OAAO,QAAQ;EACrB,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,kDAAkD;EAC3E,IAAI,KAAK,SAAS,IAAI,EAAE,GACtB,MAAM,IAAI,MAAM,mDAAmD,GAAG,EAAE;EAE1E,IAAI,CAAC,SACH,MAAM,IAAI,MAAM,sCAAsC,GAAG,yBAAyB;EAEpF,IAAI,KAAK,SAAS,mBAAmB,KAAK,0BAA0B,KAAA,GAClE,MAAM,IAAI,UACR,oDAAoD,GAAG,uCACzD;EAEF,IAAI,KAAK,0BAA0B,KAAA,GACjC,+BAA+B,KAAK,qBAAqB;EAE3D,KAAK,SAAS,IAAI,IAAI,OAAO;CAC/B;CAEA,OAKG;EACD,OAAO,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO;GACpD,IAAI,EAAE;GACN,aAAa,EAAE;GACf,SAAS,EAAE;GACX,MAAM,EAAE;EACV,EAAE;CACJ;CAEA,MAAM,IACJ,OACA,QACA,UAA2B,CAAC,GACD;EAG3B,WAAW,MAAM,MAAM,KAAK,UAAU,OAAO,QAAQ,OAAO,GAC1D,IAAI,GAAG,SAAS,iBAAiB,OAAO,GAAG;EAE7C,MAAM,IAAI,MAAM,mEAAmE;CACrF;;CAGA,MAAM,SACJ,OACA,QACA,SACgC;EAChC,WAAW,MAAM,MAAM,KAAK,eAAe,OAAO,QAAQ,OAAO,GAC/D,IAAI,GAAG,SAAS,iBAAiB,OAAO,GAAG;EAE7C,MAAM,IAAI,MAAM,wEAAwE;CAC1F;;CAGA,OAAO,eACL,OACA,QACA,SACkD;EAClD,WAAW,MAAM,SAAS,KAAK,kBAC7B,KAAK,mBAAmB,OAAO,QAAQ,OAAO,CAChD,GACE,MAAM;CAEV;;;;;;;;;;;;CAaA,OAAO,UACL,OACA,QACA,UAA2B,CAAC,GACiB;EAC7C,OAAO,KAAK,kBAAkB,KAAK,oBAAoB,OAAO,QAAQ,OAAO,CAAC;CAChF;CAEA,oBACE,OACA,QACA,SACsB;EACtB,MAAM,YAAY,gBAAgB,QAAQ,SAAS,KAAK;EACxD,MAAM,SAAS,QAAQ,UAAU,KAAK,QAAQ;EAC9C,qBAAqB,MAAM;EAE3B,OAAO;GACL;GACA,UAHe,KAAK,eAAe,OAGlB,CAAC,CAAC,KAAK,aAAa;IACnC;IACA,OAAO,KAAK,WAAW,SAAS,MAAM;GACxC,EAAE;GACF,QAAQ,SAAS;IAAE,MAAM;IAAW,QAAQ;GAAO,IAAI,EAAE,MAAM,OAAO;GACtE,gBAAgB;GAChB,QAAQ,QAAQ,UAAU;GAC1B,YAAY,QAAQ,cAAc;GAClC,WAAW,QAAQ,aAAa;GAChC,MAAM,QAAQ,QAAQ;GACtB,eAAe,QAAQ,iBAAiB;GACxC,eAAe,QAAQ,iBAAiB;GACxC,OAAO,KAAK,QAAQ,SAAS,CAAC;GAC9B,MAAM,KAAK,QAAQ;GACnB,KAAK,KAAK,QAAQ,cAAc,CAAC;GACjC,mBAAmB,KAAA;EACrB;CACF;CAEA,mBACE,OACA,QACA,SACsB;EACtB,MAAM,aAAa,mBAAmB,KAAK;EAC3C,MAAM,QAAQ,6BAA6B,OAAO;EAClD,MAAM,WAAW,uBAAuB,KAAK,oBAAoB,MAAM,UAAU,CAAC;EAClF,MAAM,eAAe,KAAK,QAAQ;EAClC,MAAM,uBAAuB,KAAK,QAAQ;EAC1C,MAAM,gBAAgB,KAAK,QAAQ;EACnC,MAAM,wBAAwB,KAAK,QAAQ;EAC3C,IAAI,MAAM,mBAAmB,iBAAiB,KAAA,GAC5C,MAAM,IAAI,UACR,kFACF;EAEF,IAAI,MAAM,sBAAsB,CAAC,iBAAiB,aAAa,GAC7D,MAAM,IAAI,UACR,yFACF;EAEF,MAAM,gBAAgB,gCAAgC,MAAM;EAC5D,MAAM,WAAW,SAAS,KAAK,aAAa;GAC1C;GACA,OAAO,KAAK,WAAW,SAAS,aAAa;EAC/C,EAAE;EACF,IAAI,MAAM,qBAAqB,SAAS;GACtC,MAAM,UAAU,SAAS,MAAM,cAAc,UAAU,MAAM,SAAS,SAAS,CAAC,EAAE;GAClF,IAAI,SACF,MAAM,IAAI,UACR,mEAAmE,QAAQ,UAAU,eAAe,QAAQ,GAAG,EACjH;EAEJ;EACA,MAAM,gBACJ,MAAM,sBAAsB,gBACxB,8BAA8B,uBAAuB,gBAAgB,IACrE;EACN,MAAM,eAAe,MAAM,kBACvB,8BAA8B,sBAAsB,eAAe,IACnE;EACJ,MAAM,qBACJ,MAAM,eAAe,OACjB,OACA,8BAA8B,MAAM,sBAAsB,KAAA,GAAW,aAAa;EAexF,MAAM,oBAAoB,uBACxB,UACA,OAhBkB,kBAClB,MAAM,QACN,SACG,QAEG,cAIG,UAAU,MAAM,SAAS,SAChC,CAAC,CACA,KAAK,cAAc,UAAU,OAAO,GACvC,QAKU,GACV,oBACA,eACA,YACF;EACA,OAAO;GACL,OAAO;GACP;GACA,QAAQ,EAAE,MAAM,OAAO;GACvB,gBAAgB,MAAM;GACtB,QAAQ,MAAM;GACd,YAAY,MAAM;GAClB,WAAW,MAAM;GACjB,MAAM,MAAM;GACZ,eAAe,MAAM;GACrB,eAAe,MAAM;GACrB,OAAO,MAAM,sBAAsB,gBAAgB,cAAc,aAAa,IAAI,CAAC;GACnF,MAAM,MAAM,mBAAmB,eAAe,aAAa,YAAY,IAAI,KAAA;GAG3E,WAAW,CAAC;GACZ;EACF;CACF;CAEA,OAAe,kBACb,MACqD;EACrD,MAAM,QAAQ,KAAK,sBAAsB,KAAA;EACzC,IAAI,SAAS,KAAK,QAAQ,SAAS,MAAM,YAAY,KAAK,MAAM;EAEhE,MAAM,gBAAgB,MAAM,WAAW,CAAC,CAAC,MAAM,GAAG,EAAE;EACpD,MAAM,MAAM,KAAK;EACjB,MAAM,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;EACzC,MAAM,UAAU,KAAK,IAAI;EACzB,MAAM,gBACJ,KAAK,mBAAmB,OAAO,KAAA,IAAY,YAAY,QAAQ,KAAK,cAAc;EACpF,MAAM,YAAY,oBAAoB,KAAK,UAAU,KAAA,GAAW,aAAa;EAC7E,MAAM,aAAa,KAAK,mBAAmB,OAAO,KAAA,IAAY,UAAU,KAAK;EAC7E,MAAM,WAAW,KAAK,SACnB,QAEG,cAIG,UAAU,MAAM,SAAS,SAChC,CAAC,CACA,KAAK,cAAc,UAAU,OAAO;EACvC,IAAI,eAAe,KAAK,OAAO,SAAS,YAAY,KAAK,OAAO,OAAO,WAAW,KAAA;EAClF,MAAM,UAAU,KAAK,OAAO,SAAS,YAAY,KAAK,OAAO,OAAO,UAAU,KAAA;EAC9E,MAAM,cACJ,WACA,KAAK,OAAO,SAAS,aACrB,KAAK,OAAO,OAAO,YAAY,QAC/B,CAAC,KAAK,OAAO,OAAO,YACpB,SAAS,SAAS,IACd,SAAS,QAAQ,KAAK,YAAY,MAAM,cAAc,SAAS,QAAQ,EAAE,GAAG,CAAC,IAC7E,KAAA;EACN,IAAI,gBAAgB,GAClB,MAAM,IAAI,MAAM,0EAA0E;EAE5F,MAAM,mBAAqC,CAAC;EAE5C,MAAM,uBACJ;GACE,MAAM;GACN,QAAQ,KAAK;GACb,gBAAgB;GAChB,YAAY;GACZ,aAAa,KAAK,SAAS,KAAK,EAAE,cAAc,QAAQ,EAAE;GAC1D,GAAI,KAAK,sBAAsB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB,KAAK,kBAAkB;EAC3F,GACA,KACF;EAEA,MAAM,aAAiC,CAAC;EACxC,IAAI;EAEJ,KAAK,MAAM,EAAE,SAAS,WAAW,KAAK,UAAU;GAC9C,MAAM,KAAK,KAAK,IAAI;GACpB,IAAI,WAAW,SAAS;IACtB,MAAM,UAAU,0BAA0B,SAAS,SAAS;IAC5D,WAAW,KAAK;KAAE;KAAS,UAAU,CAAC;KAAG,gBAAgB;IAAE,CAAC;IAC5D,IAAI,kBAAkB,QAAQ,GAAG,iBAAiB;KAChD,OAAO,KAAK;KACZ,QAAQ,QAAQ;IAClB,CAAC;IACD,MAAM,uBAAuB;KAAE,MAAM;KAAmB;IAAQ,GAAG,KAAK;IACxE,IAAI,OAAO;KACT,mBAAmB,YAAY,SAAS;KACxC;IACF;IACA;GACF;GAEA,IAAI,MAAM,SAAS,WAAW;IAC5B,MAAM,UAA6B;KACjC,YAAY,QAAQ;KACpB,QAAQ;KACR,QAAQ,0BAA0B,QAAQ,UAAU;KACpD,gBAAgB;KAChB,YAAY;KACZ,OAAO,UAAU;IACnB;IACA,MAAM,YAAY;KAAE;KAAS,UAAU,CAAC;KAAG,gBAAgB;IAAE;IAC7D,WAAW,KAAK,SAAS;IACzB,IAAI,kBAAkB,QAAQ,GAAG,mBAAmB;KAClD,OAAO,KAAK;KACZ,MAAM,QAAQ;IAChB,CAAC;IACD,MAAM,aAAa,wBAAwB,SAAS,CAAC,GAAG,KAAK;IAC7D,IAAI;KACF,MAAM,YACJ,KAAK,MAAM,uBAEL,KAAK,MAAM,iBAAiB;MAC1B;MACA,SAAS,WAAW;MACpB,UAAU,WAAW;MACrB,OAAO,KAAK;KACd,CAAC,IACH,KAAA,GACJ,SACF;IACF,SAAS,OAAO;KACd,IAAI,CAAC,OAAO,MAAM;KAClB,mBAAmB;IACrB;IACA,MAAM,uBAAuB;KAAE,MAAM;KAAmB;IAAQ,GAAG,KAAK;IACxE,IAAI,qBAAqB,KAAA,GAAW;IACpC;GACF;GAEA,MAAM,eACJ,KAAK,sBAAsB,KAAA,IACvB,eAAe,KAAK,OAAO,SAAS,YAAY,KAAK,OAAO,SAAS,KAAA,GAAW;IAC9E;IACA;IACA,cAAc,SAAS;IACvB;GACF,CAAC,IACD,uBAAuB,KAAK,mBAAmB,QAAQ,EAAE;GAC/D,MAAM,mBAAmB,KAAK,sBAAsB,KAAA,IAAY,eAAe;GAC/E,MAAM,gBAAuC,CAAC;GAC9C,MAAM,cAAc,KAAK,SAAS,OAAO,KAAA,IAAY,EAAE,GAAG,KAAK,KAAK;GACpE,MAAM,gBAAgB,oBAAoB,KAAK,iBAAiB,KAAA,GAAW,QAAQ,EAAE;GACrF,MAAM,kBACJ,KAAK,iBAAiB,iBAAiB,SAAS,IAAI,CAAC,GAAG,gBAAgB,IAAI,KAAA;GAC9E,MAAM,MAAsB;IAC1B,OAAO,KAAK;IACZ;IACA;IACA,WAAW;IACX,YAAY,KAAK,cAAc,KAAA;IAC/B,WAAW,KAAK,aAAa,KAAA;IAC7B,MAAM,KAAK;IACX,MAAM;IACN,MAAM,SAAS,WACb,IAAI,IAAI,QAAQ,GAAG,IAAI,WAAW;KAChC,OAAO,KAAK;KACZ;KACA,GAAG;IACL,CAAC;IACH,QAAQ;IACR;IACA,kBAAkB;IAClB,cAAc,YAAY;KACxB,IAAI,CAAC,OAAO;MACV,+BAA+B,OAAO;MACtC,cAAc,KAAK,OAAO;MAC1B;KACF;KACA,cAAc,KACZ,yBACE,SACA,qCAAqC,QAAQ,GAAG,QAClD,CACF;IACF;GACF;GACA,IAAI,OAAO;IACT,IAAI,aAAa,wBAAwB,WAAW;IACpD,IAAI,eAAe,wBAAwB,aAAa;IACxD,IAAI,iBAAiB,wBAAwB,eAAe;IAC5D,OAAO,OAAO,GAAG;GACnB;GAEA,IAAI;IACF,MAAM,YACJ,KAAK,MAAM,wBACD,KAAK,MAAM,kBAAkB;KAAE;KAAS;KAAK,OAAO,KAAK;IAAM,CAAC,IACtE,KAAA,GACJ,SACF;GACF,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,IAAI,WAAW,SAAS;IACtB,MAAM,UAAU,0BAA0B,SAAS,WAAW,KAAK,IAAI,IAAI,EAAE;IAC7E,WAAW,KAAK;KAAE;KAAS,UAAU,CAAC;KAAG,gBAAgB;IAAE,CAAC;IAC5D,MAAM,uBAAuB;KAAE,MAAM;KAAmB;IAAQ,GAAG,KAAK;IACxE,IAAI,OAAO;KACT,mBAAmB,YAAY,SAAS;KACxC;IACF;IACA;GACF;GACA,IAAI;GACJ,IAAI;IACF,kBAAkB,wBAAwB,IAAI,WAAW,kBAAkB,QAAQ,EAAE;GACvF,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,MAAM,iBAAiC,QAAQ,MAAM,EAAE,GAAG,IAAI;GAC9D,MAAM,kBAAkB,QAAQ,IAAI,SAAS;GAC7C,MAAM,uBACJ;IACE,MAAM;IACN,YAAY,QAAQ;IACpB,YAAY,IAAI,KAAK,EAAE,CAAC,CAAC,YAAY;GACvC,GACA,KACF;GAEA,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;IACF,IAAI,WAAW,SAAS,MAAM,YAAY,SAAS;IAMnD,WAAW,0BACT,MANqB,iBACpB,QAA6B,QAAQ,MAAM,OAAO,cAAc,GACjE,iBACA,oBAAoB,OAAO,CAC7B,GAGE,OACA,qCAAqC,QAAQ,GAAG,WAClD;GACF,SAAS,OAAO;IACd,MAAM,QAAQ,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;IACtE,kBAAkB;IAClB,IAAI,eAAiC,CAAC;IACtC,IAAI,CAAC,iBAAiB,SACpB,IAAI;KAaF,eAAe,0BAXZ,MAAM,YACL,KAAK,MAAM,gBAEL,KAAK,MAAM,UAAU;MACnB;MACA,OAAO;MACP,OAAO,KAAK;KACd,CAAC,IACH,KAAA,GACJ,eACF,KAAM,CAAC,GAGP,OACA,qCAAqC,QAAQ,GAAG,mBAClD;IACF,SAAS,OAAO;KACd,mBAAmB;IACrB;IAEF,WAAW;GACb;GAEA,IAAI;GACJ,IAAI;IACF,QAAQ,aAAa,SAAS,eAAe,KAAK;GACpD,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,IAAI,oBAAoB,KAAA,GAAW;IACjC,UAAU;KACR,YAAY,QAAQ;KACpB,QAAQ;KACR,gBAAgB,SAAS;KACzB,YAAY,KAAK,IAAI,IAAI;KACzB;KACA,GAAI,QAAQ,EAAE,sBAAsB,mBAAmB,KAAK,IAAI,CAAC;IACnE;IACA,IAAI,gBAAgB,QAAQ,MAAM;KAChC,OAAO,KAAK;KACZ,UAAU,SAAS;KACnB,YAAY,QAAQ;KACpB,UAAU,aAAa,KAAK;KAC5B,WAAW,MAAM,KAAK;KACtB,cAAc,MAAM,QAAQ,SAAS;KACrC,eAAe,MAAM,QAAQ,UAAU;IACzC,CAAC;GACH,OAAO;IACL,MAAM,aAAa,gBAAgB,YAAY,QAAQ;IACvD,MAAM,eACJ,SAAS,gBAAgB,QAAQ,WAAW,IACxC,4CACA,gBAAgB;IACtB,UAAU;KACR,YAAY,QAAQ;KACpB,QAAQ;KACR,gBAAgB,SAAS;KACzB,YAAY,KAAK,IAAI,IAAI;KACzB;KACA,GAAI,QAAQ,EAAE,sBAAsB,mBAAmB,KAAK,IAAI,CAAC;KACjE,OAAO;MAAE,OAAO;MAAY,SAAS;KAAa;IACpD;IACA,IAAI,kBAAkB,QAAQ,MAAM;KAClC,OAAO,KAAK;KACZ,aAAa;KACb,OAAO;KACP,UAAU,aAAa,KAAK;KAC5B,WAAW,MAAM,KAAK;IACxB,CAAC;GACH;GACA,2BAA2B;IACzB;IACA,OAAO,KAAK;IACZ,WAAW;IACX;IACA;GACF,CAAC;GAED,MAAM,YAAY;IAChB;IACA;IACA,gBAAgB,YAAY,QAAQ,OAAO,eAAe;GAC5D;GACA,IAAI,OACF,IAAI;IACF,cAAc,CAAC,GAAG,YAAY,SAAS,GAAG,IAAI;GAChD,SAAS,OAAO;IACd,mBAAmB;IACnB;GACF;GAEF,WAAW,KAAK,SAAS;GACzB,IAAI,KAAK,OAAO,SAAS,aAAa,iBAAiB,KAAA,GACrD,eAAe,KAAK,IAAI,GAAG,eAAe,UAAU,cAAc;GAEpE,IAAI,KAAK,eAAe,iBAAiB,KAAK,GAAG,QAAQ;GACzD,IAAI,qBAAqB,KAAA,GAAW;IAClC,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GAEA,MAAM,aAAa,wBAAwB,SAAS,UAAU,KAAK;GACnE,IAAI;IACF,MAAM,YACJ,KAAK,MAAM,uBAEL,KAAK,MAAM,iBAAiB;KAC1B;KACA,SAAS,WAAW;KACpB,UAAU,WAAW;KACrB,OAAO,KAAK;IACd,CAAC,IACH,KAAA,GACJ,eACF;GACF,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,MAAM,uBAAuB;IAAE,MAAM;IAAqB;IAAS;GAAS,GAAG,KAAK;GACpF,IAAI,SAAS,WAAW,SAAS;IAC/B,mBAAmB,YAAY,SAAS;IACxC;GACF;EACF;EAEA,MAAM,YAAY,WAAW,KAAK,EAAE,cAAc,OAAO;EACzD,MAAM,WAAW,WAAW,SAAS,cAAc,UAAU,QAAQ;EACrE,MAAM,OAAO,cAAc,YAAY,KAAK;EAC5C,MAAM,aAA+B;GACnC,QAAQ,KAAK;GACb,gBAAgB;GAChB,YAAY;GACZ,2BAAU,IAAI,KAAK,EAAA,CAAE,YAAY;GACjC;GACA,aAAa;GACb,gBAAgB,KAAK;GACrB,uBAAuB,KAAK;EAC9B;EACA,IAAI,KAAK,sBAAsB,KAAA,GAAW;GACxC,MAAM,YACJ,KAAK,MAAM,mBAAmB,KAAK,MAAM,aAAa,EAAE,QAAQ,WAAW,CAAC,IAAI,KAAA,GAChF,SACF;GACA,MAAM;IAAE,MAAM;IAAiB,QAAQ;GAAW;GAClD;EACF;EAEA,IAAI;EACJ,IAAI,qBAAqB,KAAA,GACvB,IAAI;GACF,iBAAiB,+BACf;IACE,GAAG;IACH,gBAAgB,KAAK;IACrB,YAAY,EAAE,QAAQ,WAAW;GACnC,GACA,iCACF;GACA,MAAM,YACJ,KAAK,MAAM,mBACD,KAAK,MAAM,aAAa,EAAE,QAAQ,eAAgB,CAAC,IACzD,KAAA,GACJ,SACF;EACF,SAAS,OAAO;GACd,mBAAmB;EACrB;EAEF,IAAI,WAAW,SAAS,qBAAqB,YAAY,SAAS;EAClE,IAAI,qBAAqB,KAAA,KAAa,gBAAgB;GACpD,MAAM,uBAAuB;IAAE,MAAM;IAAiB,QAAQ;GAAe,GAAG,IAAI;GACpF;EACF;EAEA,MAAM,QACJ,4BAA4B,QAAQ,mBAAmB,IAAI,MAAM,OAAO,gBAAgB,CAAC;EAC3F,MAAM,aAAa,MAAM,YAAY,QAAQ;EAC7C,MAAM,eACJ,MAAM,QAAQ,KAAK,CAAC,CAAC,WAAW,IAC5B,+CACA,MAAM;EACZ,MAAM,IAAI,8BACR,4CAA4C,aAAa,+BACzD;GACE,GAAG;GACH,gBAAgB,KAAK;GACrB,YAAY;IACV,QAAQ;IACR,OAAO;KAAE,OAAO;KAAY,SAAS;IAAa;GACpD;EACF,GACA,EAAE,MAAM,CACV;CACF;CAEA,eAAuB,MAAkC;EACvD,IAAI,aAAa,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC;EAClD,IAAI,KAAK,MAAM,QAAQ;GACrB,MAAM,OAAO,IAAI,IAAI,KAAK,IAAI;GAC9B,aAAa,WAAW,QAAQ,MAAM,KAAK,IAAI,EAAE,EAAE,CAAC;EACtD;EACA,IAAI,KAAK,MAAM,QAAQ;GACrB,MAAM,OAAO,IAAI,IAAI,KAAK,IAAI;GAC9B,aAAa,WAAW,QAAQ,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;EACvD;EACA,OAAO;CACT;CAEA,oBACE,KAC6E;EAC7E,OAAO,IAAI,KAAK,OAAO;GACrB,MAAM,UAAU,KAAK,SAAS,IAAI,EAAE;GACpC,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,0DAA0D,GAAG,EAAE;GAC7F,OAAO;IAAE,cAAc;IAAI;GAAQ;EACrC,CAAC;CACH;CAEA,WACE,SACA,QAC2D;EAC3D,QAAQ,QAAQ,WAAhB;GACE,KAAK,eAAe;IAClB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,gBAAgB;IACnB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,cAAc;IACjB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,eAAe;IAClB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,UAAU;IAEb,MAAM,QADS,OAAO,SACC,QAAQ;IAC/B,OAAO,UAAU,KAAA,IAAY;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAC9E;EACF;CACF;AACF;AAEA,MAAM,iBAAiB;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,sBAAsB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;AAC5C,MAAM,yBAAyB,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY;AAC/D,MAAM,oBAAoB,EAAE,mBAAmB,QAAQ,CACrD,EAAE,aAAa;CACb,MAAM,EAAE,QAAQ,OAAO;CACvB,UAAU;AACZ,CAAC,GACD,EAAE,aAAa;CACb,MAAM,EAAE,QAAQ,UAAU;CAC1B,UAAU;CACV,SAAS,EAAE,OAAO,qBAAqB,sBAAsB;AAC/D,CAAC,CACH,CAAC;AACD,MAAM,qBAAqB,EACxB,aAAa;CACZ,YAAY,EAAE,MAAM,mBAAmB,CAAC,CAAC,IAAI,CAAC;CAC9C,QAAQ,kBAAkB,SAAS;CACnC,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,UAAa,CAAC,CAAC,SAAS;CACxE,oBAAoB,EAAE,QAAQ,CAAC,CAAC,SAAS;CACzC,WAAW,oBAAoB,SAAS;CACxC,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAChD,eAAe,EAAE,QAAQ;CACzB,kBAAkB,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;CAC1C,oBAAoB,EAAE,QAAQ;CAC9B,iBAAiB,EAAE,QAAQ;AAC7B,CAAC,CAAC,CACD,aAAa,QAAQ,YAAY;CAChC,MAAM,SAAS,MAAqB,YAClC,QAAQ,SAAS;EAAE,MAAM;EAAU;EAAM;CAAQ,CAAC;CACpD,IAAI,IAAI,IAAI,OAAO,UAAU,CAAC,CAAC,SAAS,OAAO,WAAW,QACxD,MAAM,CAAC,YAAY,GAAG,6BAA6B;CAErD,IACE,OAAO,QAAQ,SAAS,cACxB,OAAO,OAAO,OAAO,OAAO,OAAO,CAAC,CAAC,OAAO,WAAW,WAAW,CAAC,GAEnE,MAAM,CAAC,UAAU,SAAS,GAAG,uDAAuD;CAEtF,IAAI,OAAO,QAAQ,SAAS,YAAY;EACtC,MAAM,WAAW,CAAC,GAAG,OAAO,UAAU,CAAC,CAAC,KAAK;EAC7C,MAAM,WAAW,OAAO,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK;EACzD,IACE,SAAS,WAAW,SAAS,UAC7B,SAAS,MAAM,IAAI,UAAU,OAAO,SAAS,MAAM,GAEnD,MAAM,CAAC,UAAU,SAAS,GAAG,gDAAgD;CAEjF;AACF,CAAC;AAEH,SAAS,mBAAmB,OAAwB;CAClD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,UAAU,4DAA4D;CAElF,OAAO,sBAAsB,OAAO,gCAAgC;AACtE;AAEA,SAAS,gCAAgC,QAA4C;CACnF,IAAI,CAAC,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAC/D,MAAM,IAAI,UAAU,oDAAoD;CAE1E,MAAM,aAAa,OAAO;CAC1B,MAAM,cAAc,OAAO;CAC3B,MAAM,YAAY,OAAO;CACzB,MAAM,aAAa,OAAO;CAC1B,MAAM,SAAS,OAAO;CACtB,OAAO,OAAO,OAAO;EACnB;EACA;EACA;EACA;EACA;CACF,CAAC;AACH;;;;;AAMA,SAAS,6BAA6B,OAAsC;CAC1E,MAAM,WAAW,cAAc,OAAO,gBAAgB,sBAAsB;CAC5E,MAAM,UAAU,eAAe,MAAM,UAAU,CAAC,OAAO,OAAO,UAAU,KAAK,CAAC;CAC9E,IAAI,SACF,MAAM,IAAI,UAAU,wBAAwB,QAAQ,6BAA6B;CAEnF,MAAM,EAAE,QAAQ,YAAY,eAAe,GAAG,YAAY;CAC1D,MAAM,OAAO,sBAAsB,SAAS,sBAAsB;CAClE,MAAM,SAAS,mBAAmB,UAAU,IAAI;CAChD,IAAI,CAAC,OAAO,SAAS;EACnB,MAAM,QAAQ,OAAO,MAAM,OAAO;EAClC,IAAI,OAAO,SAAS,uBAAuB,MAAM,KAAK,KAAK,GAAG,MAAM,UAAU;GAC5E,MAAM,WACJ,cAAc,KAAK,MAAM,KAAK,KAAK,OAAO,SAAS,aAC/C,4BACA;GACN,MAAM,IAAI,UAAU,oDAAoD,UAAU;EACpF;EACA,MAAM,OAAO,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,KAAK,GAAG,MAAM;EAC/D,MAAM,IAAI,UAAU,uBAAuB,KAAK,IAAI,OAAO,WAAW,cAAc;CACtF;CACA,IACE,WAAW,SACV,CAAC,UACA,OAAO,WAAW,YAClB,OAAQ,OAAuB,qBAAqB,aAEtD,MAAM,IAAI,UAAU,4DAA4D;CAElF,IAAI,eAAe,SAAS,CAAC,cAAc,OAAO,eAAe,WAC/D,MAAM,IAAI,UAAU,oEAAoE;CAE1F,IAAI,eAAe,QAAQ,OAAO,KAAK,uBAAuB,MAC5D,MAAM,IAAI,UAAU,yEAAyE;CAE/F,IAAI,eAAe,QAAQ,OAAO,KAAK,uBAAuB,MAC5D,MAAM,IAAI,UAAU,qEAAqE;CAE3F,IAAI,eAAe,QAAQ,OAAO,KAAK,cAAc,MACnD,MAAM,IAAI,UAAU,+DAA+D;CAErF,OAAO,OAAO,OAAO;EACnB,GAAG,wBAAwB,OAAO,IAAI;EAC9B;EACI;EACZ,eAAe,2BAA2B,aAAa;CACzD,CAAC;AACH;AAEA,SAAS,2BAA2B,OAAuD;CACzF,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,wBAAwB,OAAO,oCAAoC;CAE5E,IAAI,CAAC,cAAc,KAAK,GACtB,MAAM,IAAI,UACR,iFACF;CAEF,MAAM,SAAwD,CAAC;CAC/D,KAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,GAAG;EACnD,IAAI,CAAC,MAAM,QAAQ,QAAQ,GACzB,MAAM,IAAI,UAAU,sCAAsC,IAAI,kBAAkB;EAElF,OAAO,OAAO,wBAAwB,UAAU,sCAAsC,KAAK;CAC7F;CACA,OAAO,wBAAwB,MAAM;AACvC;AAEA,SAAS,uBACP,YACuB;CACvB,OAAO,WAAW,KAAK,EAAE,cAAc,cAAc;EACnD,MAAM,eAAe;EAGrB,MAAM,KAAK,QAAQ;EACnB,MAAM,cAAc,QAAQ;EAC5B,MAAM,YAAY,QAAQ;EAC1B,MAAM,eAAe,QAAQ;EAC7B,MAAM,gBAAgB,QAAQ;EAC9B,MAAM,UAAU,QAAQ;EACxB,MAAM,uBAAuB,aAAa;EAC1C,MAAM,eAAe,QAAQ;EAC7B,IAAI,OAAO,cACT,MAAM,IAAI,UACR,iDAAiD,aAAa,mBAAmB,GAAG,EACtF;EAEF,IAAI,yBAAyB,KAAA,GAC3B,MAAM,IAAI,UAAU,sCAAsC,GAAG,+BAA+B;EAE9F,MAAM,kBAAkB,sBACtB,sBACA,qCAAqC,GAAG,kBAC1C;EACA,IAAI,CAAC,cAAc,eAAe,GAChC,MAAM,IAAI,UACR,qCAAqC,GAAG,oCAC1C;EAEF,MAAM,UAAU,sBACd,cACA,qCAAqC,GAAG,OAC1C;EACA,MAAM,OACJ,QAAQ,SAAS,QACb,OAAO,OAAO;GACZ,GAAG;GACH,uBAAuB,+BAA+B,QAAQ,qBAAqB;EACrF,CAAC,IACD;EACN,MAAM,WACJ,kBAAkB,KAAA,IACd,KAAA,IACA,sBACE,eACA,qCAAqC,GAAG,eAC1C;EACN,MAAM,UAAU,aAAa,KAAK,OAAO;EACzC,OAAO,OAAO,OAAO;GACnB;GACA;GACA;GACA;GACA,GAAI,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS;GAC7C;GACA;GACA;EACF,CAAC;CACH,CAAC;AACH;AAEA,SAAS,iBAAiB,OAAwD;CAChF,OAAO,QACL,UAAU,MAAM,mBAAmB,MAAM,kBAAkB,MAAM,WAAW,MAAM,WACpF;AACF;AAEA,SAAS,cAAc,OAAmC;CACxD,MAAM,kBAAkB,MAAM;CAC9B,MAAM,iBAAiB,MAAM;CAC7B,MAAM,UAAU,MAAM;CACtB,MAAM,aAAa,MAAM;CACzB,OAAO,OAAO,OAAO;EACnB,GAAI,oBAAoB,KAAA,IAAY,CAAC,IAAI,EAAE,iBAAiB,gBAAgB,KAAK,KAAK,EAAE;EACxF,GAAI,mBAAmB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB,eAAe,KAAK,KAAK,EAAE;EACrF,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS,QAAQ,KAAK,KAAK,EAAE;EAChE,GAAI,eAAe,KAAA,IAAY,CAAC,IAAI,EAAE,YAAY,WAAW,KAAK,KAAK,EAAE;CAC3E,CAAC;AACH;AAEA,SAAS,aAAa,MAA8B;CAClD,MAAM,YAAY,KAAK;CACvB,MAAM,eAAe,KAAK;CAC1B,MAAM,kBAAkB,KAAK;CAC7B,MAAM,OAAO,KAAK;CAClB,OAAO,OAAO,OAAO;EACnB;EACA,GAAI,iBAAiB,KAAA,IAAY,CAAC,IAAI,EAAE,aAAa;EACrD,GAAI,oBAAoB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB;EAC3D,MAAM,KAAK,KAAK,IAAI;CACtB,CAAC;AACH;AAEA,SAAS,8BACP,OACA,OACiC;CACjC,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,UAAU,6BAA6B,MAAM,+BAA+B;CAExF,OAAO,wCACL,OACA,4BAA4B,MAAM,UACpC;AACF;AAEA,SAAS,uBACP,UACA,MACA,aACA,YACA,OACA,MACmC;CACnC,MAAM,gBAAgB,2BAA2B,KAAK,aAAa;CACnE,MAAM,SACJ,KAAK,WAAW,OACX,EAAE,MAAM,OAAO,IAChB,KAAK,OAAO,SAAS,UAClB;EACC,MAAM;EACN,WAAW,KAAK,OAAO;EACvB,iBAAiB,EAAE,GAAG,YAAY;CACpC,IACC;EACC,MAAM;EACN,WAAW,KAAK,OAAO;EACvB,SAAS,EAAE,GAAG,KAAK,OAAO,QAAQ;EAClC,iBAAiB,EAAE,GAAG,YAAY;CACpC;CACR,MAAM,WAAW;EACf,gBAAgB;EAChB,UAAU,SAAS,KAAK,aAAa;GACnC,IAAI,QAAQ;GACZ,SAAS,QAAQ;GACjB,YAAY,QAAQ;GACpB,MAAM,QAAQ;GACd,cAAc,QAAQ,YAAY;GAClC,yBAAyB,cAAc,QAAQ,eAAe;EAChE,EAAE;EACF,QAAQ;GACN;GACA,kBAAkB,KAAK;GACvB,iBAAiB,KAAK,WAAW;GACjC,aAAa;GACb,YAAY,KAAK;GACjB,MAAM,KAAK,SAAS,OAAO,OAAO,EAAE,GAAG,KAAK,KAAK;GACjD,gBAAgB;GAChB,gBAAgB,KAAK;GACrB,oBAAoB,KAAK;GACzB,gBAAgB;GAChB,eAAe;EACjB;CACF;CACA,OAAO,2BACL;EAAE,GAAG;EAAU,QAAQ,cAAc,QAAQ;CAAE,GAC/C,yCACF;AACF;AAEA,SAAS,2BACP,UAC+D;CAC/D,IAAI,aAAa,MAAM,OAAO,EAAE,MAAM,OAAO;CAC7C,IAAI,MAAM,QAAQ,QAAQ,GACxB,OAAO;EACL,MAAM;EACN,OAAO,SAAS;EAChB,QAAQ,cAAc,QAAQ;CAChC;CAEF,MAAM,SAAS;CACf,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK;CACtC,OAAO;EACL,MAAM;EACN;EACA,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAO,OAAO,IAAI,EAAE,UAAU,IAAI,CAAC;EACpE,QAAQ,cAAc,MAAM;CAC9B;AACF;AAEA,SAAS,sBAAyB,OAAU,OAAkB;CAC5D,IAAI;CACJ,IAAI;EACF,WAAW,KAAK,MAAM,gBAAgB,KAAK,CAAC;CAC9C,SAAS,OAAO;EACd,MAAM,IAAI,UAAU,GAAG,MAAM,0BAA0B,EAAE,MAAM,CAAC;CAClE;CACA,OAAO,wBAAwB,QAAQ;AACzC;AAEA,SAAS,yBACP,SACA,SACqB;CACrB,MAAM,OAAO,cAAc,SAAS;EAAC;EAAS;EAAU;EAAQ;CAAc,GAAG,OAAO;CACxF,KAAK,SACH,KAAK,WAAW,OACZ,OACA,cACE,KAAK,QACL;EAAC;EAAS;EAAU;EAAa;EAAU;CAAY,GACvD,GAAG,QAAQ,QACb;CACN,KAAK,OAAO,cAAc,KAAK,MAAM,CAAC,QAAQ,KAAK,GAAG,GAAG,QAAQ,MAAM;CACvE,MAAM,WAAW,sBAAsB,MAAwC,OAAO;CACtF,+BAA+B,UAAU,OAAO;CAChD,OAAO;AACT;AAEA,SAAS,cACP,OACA,QACA,SACyB;CACzB,IAAI,CAAC,cAAc,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,wBAAwB;CAClF,MAAM,aAAa,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,QAAQ,CAAC,OAAO,SAAS,GAAG,CAAC;CAC3E,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,UAAU,GAAG,QAAQ,4BAA4B,WAAW,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG;CAE3F,OAAO,OAAO,YACZ,OAAO,SAAS,UAAW,OAAO,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,OAAO,MAAM,MAAM,CAAC,IAAI,CAAC,CAAE,CACxF;AACF;AAEA,SAAS,cAAc,OAAkD;CACvE,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG,OAAO;CACxE,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;AAEA,SAAS,kBACP,OACA,UACA,UACyC;CACzC,IAAI,UAAU,MAAM,OAAO,CAAC;CAC5B,MAAM,cAA6C,OAAO,YACxD,SAAS,KAAK,YAAY,CAAC,QAAQ,IAAI,IAAI,CAAC,CAC9C;CACA,IAAI,SAAS,WAAW,GAAG,OAAO,wBAAwB,WAAW;CACrE,IAAI,MAAM,SAAS,SAAS;EAC1B,MAAM,OAAO,MAAM,WAAW,SAAS;EACvC,KAAK,MAAM,WAAW,UAAU,YAAY,QAAQ,MAAM;EAC1D,OAAO,wBAAwB,WAAW;CAC5C;CACA,MAAM,cAAc,SAAS,QAAQ,KAAK,YAAY,MAAM,MAAM,QAAQ,QAAQ,KAAM,CAAC;CACzF,IAAI,gBAAgB,GAClB,MAAM,IAAI,MACR,0FACF;CAEF,KAAK,MAAM,WAAW,UACpB,YAAY,QAAQ,MAAO,MAAM,WAAW,MAAM,QAAQ,QAAQ,MAAQ;CAE5E,OAAO,wBAAwB,WAAW;AAC5C;AAQA,SAAS,0BACP,UACA,OACA,SACkB;CAClB,OAAO,QAAQ,wBAAwB,wBAAwB,UAAU,OAAO,CAAC,IAAI;AACvF;AAEA,SAAS,wBACP,SACA,UACA,OAC4D;CAC5D,IAAI,CAAC,OAAO,OAAO;EAAE;EAAS;CAAS;CACvC,OAAO;EACL,SAAS,sBAAsB,SAAS,iDAAiD;EACzF,UAAU,wBACR,wBAAwB,UAAU,kDAAkD,CACtF;CACF;AACF;AAEA,SAAS,uBACP,MACA,WACoB;CACpB,MAAM,SAAS,KAAK,OAAO;CAC3B,IAAI,OAAO,SAAS,QAAQ,OAAO,KAAA;CACnC,MAAM,YAAY,OAAO,gBAAgB;CACzC,OAAO,cAAc,OAAO,KAAA,IAAY;AAC1C;AAEA,SAAS,uBAA0D,OAAU,OAAmB;CAC9F,OAAO,QAAQ,sBAAsB,OAAO,gCAAgC,IAAI;AAClF;AAEA,SAAS,2BAA2B,MAM3B;CACP,IAAI,KAAK,cAAc,KAAA,KAAa,KAAK,MAAM,KAAK,SAAS,cAAc;CAC3E,KAAK,IAAI,kBAAkB,KAAK,QAAQ,GAAG,gDAAgD;EACzF,OAAO,KAAK;EACZ,YAAY,KAAK;EACjB,eAAe;CACjB,CAAC;AACH;AAEA,SAAS,gBAAgB,WAAmD;CAC1E,IAAI,cAAc,KAAA,GAAW,OAAO,KAAA;CACpC,IAAI,CAAC,OAAO,cAAc,SAAS,KAAK,aAAa,KAAK,YAAY,YACpE,MAAM,IAAI,UACR,sFACF;CAEF,OAAO;AACT;AAEA,eAAe,iBACb,WACA,QACA,cACY;CACZ,IAAI,CAAC,QAAQ,OAAO;CACpB,IAAI,OAAO,SAAS;EAClB,UAAe,YAAY,CAAC,CAAC;EAC7B,MAAM,YAAY,MAAM;CAC1B;CACA,OAAO,IAAI,SAAY,SAAS,WAAW;EACzC,IAAI;EACJ,MAAM,gBAAsB;GAC1B,OAAO,oBAAoB,SAAS,OAAO;GAC3C,IAAI,iBAAiB,aAAa,eAAe;EACnD;EACA,MAAM,gBAAsB;GAC1B,IAAI,iBAAiB,GAAG;IACtB,QAAQ;IACR,OAAO,YAAY,MAAM,CAAC;IAC1B;GACF;GACA,kBAAkB,iBAAiB;IACjC,QAAQ;IACR,OAAO,YAAY,MAAM,CAAC;GAC5B,GAAG,YAAY;EACjB;EACA,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EACxD,UAAU,MACP,UAAU;GACT,QAAQ;GACR,IAAI,OAAO,SAAS,OAAO,YAAY,MAAM,CAAC;QACzC,QAAQ,KAAK;EACpB,IACC,UAAU;GACT,QAAQ;GACR,OAAO,OAAO,UAAU,YAAY,MAAM,IAAI,KAAK;EACrD,CACF;CACF,CAAC;AACH;AAEA,eAAe,YACb,WACA,QACwB;CACxB,IAAI,cAAc,KAAA,KAAa,QAAQ,SAAS,OAAO,KAAA;CACvD,IAAI;EACF,OAAO,MAAM,iBACX,QAAQ,QAAQ,CAAC,CAAC,WAAW;GAC3B,IAAI,QAAQ,SAAS,MAAM,YAAY,MAAM;GAC7C,OAAO,UAAU;EACnB,CAAC,GACD,QACA,CACF;CACF,SAAS,OAAO;EACd,IAAI,QAAQ,SAAS,OAAO,KAAA;EAC5B,MAAM;CACR;AACF;AAEA,SAAS,oBAAoB,SAA0B;CACrD,IAAI,QAAQ,KAAK,SAAS,iBAAiB,OAAO;CAClD,MAAM,eAAe,+BAA+B,QAAQ,KAAK,qBAAqB;CACtF,IAAI,iBAAiB,GAAG,OAAO;CAC/B,OAAO,KAAK,IAAI,eAAe,KAAK,UAAa;AACnD;AAEA,SAAS,0BACP,SACA,QACA,YAAY,GACO;CACnB,MAAM,SAAS,YAAY,MAAM;CACjC,OAAO;EACL,YAAY,QAAQ;EACpB,QAAQ;EACR,QAAQ,GAAG,OAAO,KAAK,IAAI,OAAO;EAClC,gBAAgB;EAChB,YAAY;EACZ,OAAO,UAAU;CACnB;AACF;AAEA,SAAS,YAAY,QAA4B;CAC/C,OAAO,OAAO,kBAAkB,QAC5B,OAAO,SACP,IAAI,aAAa,6BAA6B,YAAY;AAChE;;;;;;AAOA,SAAS,eACP,QACA,MAMoB;CACpB,IAAI,CAAC,QAAQ,OAAO,KAAA;CACpB,IAAI,OAAO,UAAU;EACnB,MAAM,YAAY,OAAO,SAAS;GAChC,SAAS,KAAK;GACd,UAAU,OAAO;GACjB,cAAc,KAAK;GACnB,cAAc,KAAK;EACrB,CAAC;EACD,IAAI,cAAc,KAAA,GAAW;GAC3B,IAAI,OAAO,aAAa,KAAA,GACtB,MAAM,IAAI,MACR,0BAA0B,KAAK,QAAQ,GAAG,gDAC5C;GAEF;EACF;EACA,mBAAmB,WAAW,0BAA0B,KAAK,QAAQ,GAAG,GAAG;EAC3E,OAAO,KAAK,iBAAiB,KAAA,IAAY,YAAY,KAAK,IAAI,WAAW,KAAK,YAAY;CAC5F;CACA,IAAI,OAAO,YAAY,MAAM,OAAO,KAAA;CACpC,MAAM,YAAY,OAAO,UACpB,OAAO,WAAW,cAAc,OAAO,SAAS,KAAK,QAAQ,EAAE,IAAK,KAAK,cAC1E,OAAO,WAAW,KAAK,IAAI,GAAG,KAAK,YAAY;CACnD,OAAO,KAAK,iBAAiB,KAAA,IAAY,YAAY,KAAK,IAAI,WAAW,KAAK,YAAY;AAC5F;AAEA,SAAS,qBAAqB,QAAwC;CACpE,IAAI,CAAC,QAAQ;CACb,IAAI,OAAO,aAAa,KAAA,GAAW,mBAAmB,OAAO,UAAU,uBAAuB;CAC9F,KAAK,MAAM,CAAC,WAAW,WAAW,OAAO,QAAQ,OAAO,WAAW,CAAC,CAAC,GACnE,mBAAmB,QAAQ,yBAAyB,UAAU,GAAG;AAErE;AAEA,SAAS,mBAAmB,OAAe,OAAqB;CAC9D,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GACrC,MAAM,IAAI,MAAM,GAAG,MAAM,sCAAsC;AAEnE;AAEA,SAAS,wBACP,WACA,cACA,WACoB;CACpB,IAAI,cAAc,KAAA,GAChB,mBAAmB,WAAW,iCAAiC,UAAU,EAAE;CAE7E,IAAI,iBAAiB,KAAA,GAAW,OAAO;CACvC,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MACR,iCAAiC,UAAU,oDAC7C;CAEF,IAAI,YAAY,cACd,MAAM,IAAI,MACR,iCAAiC,UAAU,KAAK,UAAU,0CAA0C,aAAa,EACnH;CAEF,OAAO;AACT;AAEA,SAAS,cAAc,SAAiC,WAA2B;CACjF,MAAM,SAAS,QAAQ,cAAc;CACrC,mBAAmB,QAAQ,yBAAyB,UAAU,GAAG;CACjE,OAAO;AACT;AAEA,SAAS,YAAiC;CACxC,OAAO;EACL,OAAO;EACP,QAAQ;GAAE,OAAO;GAAG,QAAQ;EAAE;EAC9B,MAAM;GAAE,MAAM;GAAY,KAAK;EAAE;CACnC;AACF;AAEA,SAAS,aACP,SACA,UACA,QAAQ,OACa;CACrB,IAAI,SAAS,SAAS,GAAG,OAAO,mBAAmB,UAAU,KAAK;CAClE,IAAI,QAAQ,KAAK,SAAS,iBAAiB,OAAO,UAAU;CAC5D,OAAO;EAAE,OAAO;EAAM,QAAQ;EAAM,MAAM;GAAE,MAAM;GAAc,KAAK;EAAK;CAAE;AAC9E;AAEA,SAAS,mBACP,UACA,QAAQ,OACa;CACrB,MAAM,QAAQ,SAAS,OAAO,YAAY,QAAQ,UAAU,IAAI,IAC5D,SACE,SAAS,KAAK,YAAY,QAAQ,SAAS,CAAC,GAC5C,OACA,SACA,IACF,IACA;CACJ,MAAM,SAAS,SAAS,OAAO,YAAY,QAAQ,WAAW,IAAI,IAC7D,OAAO,YACL;EAAC;EAAS;EAAU;EAAa;EAAU;CAAY,CAAC,CAAW,SAAS,UAC3E,UAAU,WACV,UAAU,YACV,SAAS,MAAM,YAAY,QAAQ,SAAS,WAAW,KAAA,CAAS,IAC5D,CACE,CACE,OACA,SACE,SAAS,KAAK,YAAY,QAAQ,SAAS,UAAU,CAAC,GACtD,OACA,UAAU,SACV,IACF,CACF,CACF,IACA,CAAC,CACP,CACF,IACA;CACJ,MAAM,OAAO,wBACX,SAAS,KAAK,YAAY,QAAQ,IAAI,GACtC,KACF;CACA,OAAO;EACL;EACA;EACA;EACA,GAAI,KAAK,SAAS,eACd,EACE,cAAc,SAAS,SAAS,IAAI,YAAY,GAAG,OAAO,YAAY,EACxE,IACA,CAAC;CACP;AACF;AAEA,SAAS,aAAa,SAAsC;CAC1D,OAAO,QAAQ,KAAK,SAAS,eAAgB,QAAQ,gBAAgB,IAAK,QAAQ,KAAK;AACzF;AAEA,SAAS,YAAY,SAA8B,cAA0C;CAC3F,MAAM,QAAQ,aAAa,OAAO;CAClC,OAAO,QAAQ,KAAK,SAAS,gBAAgB,iBAAiB,KAAA,IAC1D,KAAK,IAAI,OAAO,YAAY,IAC5B;AACN;AAEA,SAAS,wBACP,OACA,QAAQ,OACW;CACnB,IAAI,MAAM,MAAM,SAAS,KAAK,SAAS,YAAY,GACjD,OAAO;EAAE,MAAM;EAAc,KAAK;CAAK;CAEzC,MAAM,MAAM,SACV,MAAM,KAAK,SAAS,KAAK,OAAO,CAAC,GACjC,OACA,eACF;CACA,OAAO,MAAM,MAAM,SAAS,KAAK,SAAS,WAAW,IACjD;EAAE,MAAM;EAAa;CAAI,IACzB;EAAE,MAAM;EAAY;CAAI;AAC9B;AAEA,SAAS,cACP,YACA,OACkD;CAClD,MAAM,SAAS,WAAW,KAAK,cAAc,UAAU,QAAQ,KAAK;CACpE,OAAO;EACL,OAAO,SAAS,OAAO,IAAI,YAAY,GAAG,OAAO,gBAAgB;EACjE,YAAY,wBACV,OAAO,KAAK,UAAU,MAAM,IAAI,GAChC,KACF;CACF;AACF;AAEA,SAAS,SACP,QACA,OACA,OACA,UAAU,OACF;CACR,MAAM,MAAM,OAAO,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC;CAC5D,IAAI,UAAU,UAAU,CAAC,OAAO,cAAc,GAAG,IAAI,CAAC,OAAO,SAAS,GAAG,IACvE,MAAM,IAAI,WACR,uBAAuB,MAAM,aAAa,UAAU,2BAA2B,iBACjF;CAEF,OAAO;AACT;;;;;;;;;;;;AAaA,SAAS,oBACP,QACA,WAC2C;CAC3C,IAAI,CAAC,QAAQ,OAAO,KAAA;CACpB,IAAI,MAAM,QAAQ,MAAM,GAAG;EACzB,MAAM,MAAM,OAAO,QAAQ,MAAM,EAAE,eAAe,SAAS;EAC3D,OAAO,IAAI,SAAS,IAAI,MAAM,KAAA;CAChC;CACA,MAAM,SAAS;CACf,MAAM,MAAM,OAAO,cAAc,CAAC;CAClC,MAAM,WAAW,OAAO,QAAQ,CAAC;CACjC,MAAM,SAAS,CAAC,GAAG,KAAK,GAAG,QAAQ;CACnC,OAAO,OAAO,SAAS,IAAI,SAAS,KAAA;AACtC;;;AClsDA,SAAgB,4BACd,UAAyC,CAAC,GACzB;CACjB,IAAI,QAAQ,eAAe,CAAC,QAAQ,QAClC,MAAM,IAAI,UACR,kGACF;CAEF,MAAM,WAAW,IAAI,gBAAgB,QAAQ,QAAQ;CACrD,IAAI,QAAQ,sBAAsB,OAChC,SAAS,SAAS,kBAAkB,QAAQ,UAAU,CAAC;CAEzD,IAAI,QAAQ,QACV,KAAK,MAAM,cAAc,QAAQ,eAAe,6BAC9C,SAAS,SAAS,mBAAmB,YAAY,EAAE,QAAQ,QAAQ,OAAO,CAAC,CAAC;CAGhF,OAAO;AACT;;;;;;;ACiDA,SAAgB,iBAAiB,MAAwC;CACvE,QAAQ,KAAK,WAAb;EACE,KAAK,eACH,OAAO;GACL,WAAW;GACX,cAAc,KAAK;GACnB,iBAAiB,KAAK;GACtB,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK,aAAa,KAAK,KAAK,YAAY,GAAG,QAAQ;EACzF;EACF,KAAK,UACH,OAAO;GACL,WAAW;GACX,cAAc,KAAK;GACnB,iBAAiB,KAAK;GACtB,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK,aAAa,KAAK,KAAK,YAAY,GAAG,QAAQ;EACzF;EACF,KAAK,QACH,OAAO;GACL,WAAW;GACX,cAAc,KAAK;GACnB,iBAAiB;GACjB,MAAM,OAAO,KAAK,aAAa,KAAK,QAAQ,aAAa,KAAK,KAAK,YAAY,GAAG,QAAQ;EAC5F;CACJ;AACF;AAEA,SAAS,aAAa,KAAkB,cAA+C;CACrF,IAAI,IAAI,OAAO,OAAO;CACtB,IAAI,CAAC,cACH,MAAM,IAAI,MACR,2IAEF;CAEF,OAAO;EAAE,GAAG;EAAK,OAAO;CAAa;AACvC"}
+{"version":3,"file":"chat-client-DEtybj5i.js","names":["ANALYST_ID","ACTOR_PROMPT","ACTOR_PROMPT","ACTOR_PROMPT","ACTOR_PROMPT"],"sources":["../src/feedback-trajectory-review.ts","../src/trace-analyst/behavioral-metrics.ts","../src/analyst/behavioral-analyst.ts","../src/analyst/kinds/control-integrity.ts","../src/analyst/kinds/failure-mode.ts","../src/analyst/kinds/improvement.ts","../src/analyst/kinds/intent-divergence.ts","../src/analyst/kinds/knowledge-gap.ts","../src/analyst/kinds/knowledge-poisoning.ts","../src/analyst/kinds/index.ts","../src/analyst/registry.ts","../src/analyst/default-registry.ts","../src/analyst/chat-client.ts"],"sourcesContent":["import { type ExactAnalystRunResult, snapshotExactExecutionPlan } from './analyst/exact-types'\nimport type {\n  AnalystFinding,\n  AnalystRunResult,\n  AnalystUsageReceipt,\n  EvidenceRef,\n} from './analyst/types'\nimport { assertValidAnalystUsageReceipt } from './analyst/usage-receipt'\nimport type { FeedbackLabelSource, FeedbackTrajectory } from './feedback-trajectory'\nimport { canonicalString, hashCanonical } from './ledger-core/canonical'\nimport { deepFreezeCanonicalJson } from './ledger-core/deep-freeze'\n\nexport type AnalystReviewSource = Exclude<FeedbackLabelSource, 'system'>\nexport type AnalystFindingDigest = `sha256:${string}`\nexport type AnalystRunDigest = `sha256:${string}`\n\nexport interface AnalystMissedIssue {\n  id: string\n  reason: string\n  evidence?: EvidenceRef[]\n}\n\ninterface AnalystReviewDecisionBase {\n  runDigest: AnalystRunDigest\n  source: AnalystReviewSource\n  reviewerId: string\n  reviewId: string\n  reason: string\n  decidedAt: string\n}\n\nexport type AnalystReviewDecision =\n  | (AnalystReviewDecisionBase & {\n      findingId: string\n      findingDigest: AnalystFindingDigest\n      verdict: 'confirmed' | 'rejected'\n      missedIssues?: never\n    })\n  | (AnalystReviewDecisionBase & {\n      verdict: 'completeness_assessed'\n      missedIssues: AnalystMissedIssue[]\n      findingId?: never\n      findingDigest?: never\n    })\n\nexport interface AnalystReviewCounts {\n  emitted: number\n  confirmed: number\n  rejected: number\n  missed: number\n}\n\nexport interface AnalystReviewQuality {\n  precision: number\n  recall: number\n  f1: number\n  counts: AnalystReviewCounts\n}\n\nexport interface StoredAnalystReview {\n  runId: string\n  runDigest: AnalystRunDigest\n  findings: AnalystFinding[]\n  findingIds: string[]\n  analystIds: string[]\n  reviewDecisions: AnalystReviewDecision[]\n}\n\n/** Bind an analyst finding's complete canonical JSON content to a stable digest. */\nexport function analystFindingDigest(finding: AnalystFinding): AnalystFindingDigest {\n  return hashCanonical(snapshotAnalystFinding(finding, 'analyst finding'))\n}\n\n/** Bind the complete analyst result to one immutable review target. */\nexport function analystRunDigest(run: AnalystRunResult): AnalystRunDigest {\n  return hashCanonical(snapshotAnalystRun(run, 'analyst run'))\n}\n\nexport function snapshotAnalystRun(value: unknown, context = 'analyst run'): AnalystRunResult {\n  const snapshot = snapshotAnalystRunRecord(value, context)\n  if (snapshot.execution_plan !== undefined) {\n    return sealExactAnalystRunReceipt(snapshot, context)\n  }\n  if (snapshot.completion !== undefined) {\n    throw new TypeError(`${context} completion is valid only for an exact run`)\n  }\n  return snapshot as unknown as AnalystRunResult\n}\n\n/** Canonicalize, validate, and deeply freeze one complete or failed exact-run receipt. */\nexport function snapshotExactAnalystRunReceipt(\n  value: unknown,\n  context = 'exact analyst run receipt',\n): ExactAnalystRunResult {\n  return sealExactAnalystRunReceipt(snapshotAnalystRunRecord(value, context), context)\n}\n\nfunction snapshotAnalystRunRecord(value: unknown, context: string): Record<string, unknown> {\n  let snapshot: unknown\n  try {\n    snapshot = JSON.parse(canonicalString(value)) as unknown\n  } catch (cause) {\n    throw new TypeError(`${context} must have a canonical JSON representation`, { cause })\n  }\n  if (!isRecord(snapshot)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(\n    snapshot,\n    [\n      'run_id',\n      'correlation_id',\n      'started_at',\n      'ended_at',\n      'findings',\n      'per_analyst',\n      'total_cost_usd',\n      'total_cost_provenance',\n      'execution_plan',\n      'completion',\n    ],\n    context,\n  )\n  requiredString(snapshot.run_id, `${context} run_id`)\n  requiredString(snapshot.correlation_id, `${context} correlation_id`)\n  canonicalTimestamp(snapshot.started_at, `${context} started_at`)\n  canonicalTimestamp(snapshot.ended_at, `${context} ended_at`)\n  snapshot.findings = snapshotAnalystFindings(snapshot.findings, `${context} findings`)\n  if (!Array.isArray(snapshot.per_analyst)) {\n    throw new TypeError(`${context} per_analyst must be an array`)\n  }\n  for (const [index, summary] of snapshot.per_analyst.entries()) {\n    assertAnalystRunSummary(summary, `${context} per_analyst ${index}`)\n  }\n  if (\n    typeof snapshot.total_cost_usd !== 'number' ||\n    !Number.isFinite(snapshot.total_cost_usd) ||\n    snapshot.total_cost_usd < 0\n  ) {\n    throw new TypeError(`${context} total_cost_usd must be a finite non-negative number`)\n  }\n  if (snapshot.total_cost_provenance !== undefined) {\n    assertCostProvenance(snapshot.total_cost_provenance, `${context} total_cost_provenance`)\n  }\n  return snapshot\n}\n\nfunction assertAnalystRunSummary(value: unknown, context: string): void {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(\n    value,\n    [\n      'analyst_id',\n      'status',\n      'reason',\n      'findings_count',\n      'latency_ms',\n      'usage',\n      'allocated_budget_usd',\n      'error',\n    ],\n    context,\n  )\n  requiredString(value.analyst_id, `${context} analyst_id`)\n  if (value.status !== 'ok' && value.status !== 'skipped' && value.status !== 'failed') {\n    throw new TypeError(`${context} status is invalid`)\n  }\n  if (value.reason !== undefined) requiredString(value.reason, `${context} reason`)\n  if (value.status === 'skipped' && value.reason === undefined) {\n    throw new TypeError(`${context} skipped summary requires reason`)\n  }\n  nonnegativeSafeInteger(value.findings_count, `${context} findings_count`)\n  finiteNonnegative(value.latency_ms, `${context} latency_ms`)\n  assertAnalystUsageReceipt(value.usage, `${context} usage`)\n  if (value.allocated_budget_usd !== undefined && value.allocated_budget_usd !== null) {\n    finiteNonnegative(value.allocated_budget_usd, `${context} allocated_budget_usd`)\n  }\n  if (value.error !== undefined) {\n    if (value.status !== 'failed' || !isRecord(value.error)) {\n      throw new TypeError(`${context} error is valid only for failed summaries`)\n    }\n    assertOnlyKeys(value.error, ['class', 'message'], `${context} error`)\n    requiredString(value.error.class, `${context} error class`)\n    requiredString(value.error.message, `${context} error message`)\n  } else if (value.status === 'failed') {\n    throw new TypeError(`${context} failed summary requires error`)\n  }\n}\n\nfunction assertAnalystUsageReceipt(value: unknown, context: string): void {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(value, ['calls', 'tokens', 'cost', 'knownCostUsd'], context)\n  for (const field of ['calls', 'tokens', 'cost'] as const) {\n    if (!Object.hasOwn(value, field)) {\n      throw new TypeError(`${context} ${field} is required`)\n    }\n  }\n  if (value.tokens !== null) {\n    if (!isRecord(value.tokens)) throw new TypeError(`${context} tokens must be an object or null`)\n    assertOnlyKeys(\n      value.tokens,\n      ['input', 'output', 'reasoning', 'cached', 'cacheWrite'],\n      `${context} tokens`,\n    )\n  }\n  assertCostProvenance(value.cost, `${context} cost`)\n  assertValidAnalystUsageReceipt(value as unknown as AnalystUsageReceipt, context)\n}\n\nfunction assertCostProvenance(value: unknown, context: string): void {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(value, ['kind', 'usd'], context)\n  if (value.kind === 'uncaptured') {\n    if (value.usd !== null) throw new TypeError(`${context} uncaptured usd must be null`)\n    return\n  }\n  if (value.kind !== 'observed' && value.kind !== 'estimated') {\n    throw new TypeError(`${context} kind is invalid`)\n  }\n  finiteNonnegative(value.usd, `${context} usd`)\n}\n\nfunction sealExactAnalystRunReceipt(\n  run: Record<string, unknown>,\n  context: string,\n): ExactAnalystRunResult {\n  if (run.execution_plan === undefined) {\n    throw new TypeError(`${context} exact run requires execution_plan`)\n  }\n  const plan = snapshotExactExecutionPlan(run.execution_plan, `${context} execution_plan`)\n  const completion = snapshotExactRunCompletion(run.completion, `${context} completion`)\n  run.execution_plan = plan\n  run.completion = completion\n  const summaries = run.per_analyst as Array<{\n    analyst_id: string\n    status: 'ok' | 'skipped' | 'failed'\n    findings_count: number\n    usage: { cost: { kind: string; usd: number | null }; knownCostUsd?: number }\n    allocated_budget_usd?: number | null\n  }>\n  const findings = run.findings as AnalystFinding[]\n  const planned = plan.analysts.map((analyst) => analyst.id)\n  const completed = summaries.map((summary) => summary.analyst_id)\n  const ordered = completed.every((analystId, index) => analystId === planned[index])\n  if (!ordered || (completion.status === 'complete' && completed.length !== planned.length)) {\n    throw new TypeError(\n      completion.status === 'complete'\n        ? `${context} complete receipt must contain every execution_plan analyst in exact order`\n        : `${context} failed receipt per_analyst must be an execution_plan prefix`,\n    )\n  }\n  const completedIds = new Set(completed)\n  for (const finding of findings) {\n    if (!completedIds.has(finding.analyst_id)) {\n      throw new TypeError(`${context} finding names an analyst absent from per_analyst`)\n    }\n  }\n  for (const summary of summaries) {\n    const actual = findings.filter((finding) => finding.analyst_id === summary.analyst_id).length\n    if (summary.findings_count !== actual) {\n      throw new TypeError(\n        `${context} findings_count does not match findings for \"${summary.analyst_id}\"`,\n      )\n    }\n    const hasAllocation = Object.hasOwn(summary, 'allocated_budget_usd')\n    if (summary.status === 'skipped') {\n      if (hasAllocation) {\n        throw new TypeError(\n          `${context} skipped summary \"${summary.analyst_id}\" cannot report an allocated budget`,\n        )\n      }\n      continue\n    }\n    const allocation = summary.allocated_budget_usd\n    const validAllocation =\n      hasAllocation &&\n      (plan.policy.budget.kind === 'none'\n        ? allocation === null\n        : typeof allocation === 'number' &&\n          plan.policy.budget.allocations_usd[summary.analyst_id] !== null &&\n          plan.policy.budget.allocations_usd[summary.analyst_id] !== undefined &&\n          allocation <= plan.policy.budget.allocations_usd[summary.analyst_id]!)\n    if (!validAllocation) {\n      throw new TypeError(\n        `${context} summary \"${summary.analyst_id}\" allocation does not match its execution plan`,\n      )\n    }\n  }\n  let knownCost = 0\n  for (const summary of summaries) {\n    const amount =\n      summary.usage.cost.kind === 'uncaptured'\n        ? (summary.usage.knownCostUsd ?? 0)\n        : (summary.usage.cost.usd ?? 0)\n    knownCost = finiteNonnegative(knownCost + amount, `${context} aggregate known cost`)\n  }\n  if (run.total_cost_usd !== knownCost) {\n    throw new TypeError(`${context} total_cost_usd does not match per_analyst usage`)\n  }\n  if (run.total_cost_provenance === undefined) {\n    throw new TypeError(`${context} exact run requires total_cost_provenance`)\n  }\n  const costs = summaries.map((summary) => summary.usage.cost)\n  const expectedProvenance = costs.some((cost) => cost.kind === 'uncaptured')\n    ? { kind: 'uncaptured', usd: null }\n    : {\n        kind: costs.some((cost) => cost.kind === 'estimated') ? 'estimated' : 'observed',\n        usd: costs.reduce(\n          (sum, cost) =>\n            finiteNonnegative(sum + (cost.usd ?? 0), `${context} aggregate captured cost`),\n          0,\n        ),\n      }\n  if (hashCanonical(run.total_cost_provenance) !== hashCanonical(expectedProvenance)) {\n    throw new TypeError(`${context} total_cost_provenance does not match per_analyst usage`)\n  }\n  return deepFreezeCanonicalJson(run as unknown as ExactAnalystRunResult)\n}\n\nfunction snapshotExactRunCompletion(\n  value: unknown,\n  context: string,\n): ExactAnalystRunResult['completion'] {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  if (value.status === 'complete') {\n    assertOnlyKeys(value, ['status'], context)\n    return value as ExactAnalystRunResult['completion']\n  }\n  if (value.status !== 'failed') {\n    throw new TypeError(`${context} status must be complete or failed`)\n  }\n  assertOnlyKeys(value, ['status', 'error'], context)\n  if (!isRecord(value.error)) throw new TypeError(`${context} failed receipt requires error`)\n  assertOnlyKeys(value.error, ['class', 'message'], `${context} error`)\n  requiredString(value.error.class, `${context} error class`)\n  requiredString(value.error.message, `${context} error message`)\n  return value as unknown as ExactAnalystRunResult['completion']\n}\n\nfunction finiteNonnegative(value: unknown, context: string): number {\n  if (typeof value !== 'number' || !Number.isFinite(value) || value < 0) {\n    throw new TypeError(`${context} must be a non-negative finite number`)\n  }\n  return value\n}\n\nfunction nonnegativeSafeInteger(value: unknown, context: string): number {\n  if (!Number.isSafeInteger(value) || (value as number) < 0) {\n    throw new TypeError(`${context} must be a non-negative safe integer`)\n  }\n  return value as number\n}\n\nexport function snapshotAnalystFindings(\n  value: unknown,\n  context = 'analyst run findings',\n): AnalystFinding[] {\n  if (!Array.isArray(value)) {\n    throw new TypeError(`${context} must be an array`)\n  }\n  const findings = value.map((finding, index) =>\n    snapshotAnalystFinding(finding, `${context} finding ${index}`),\n  )\n  assertUniqueFindingIds(findings.map((finding) => finding.finding_id))\n  return findings\n}\n\nexport function readAnalystReview(trajectory: FeedbackTrajectory): StoredAnalystReview | undefined {\n  const analystAttempts = trajectory.attempts.filter(\n    (attempt) => isRecord(attempt.artifact) && attempt.artifact.type === 'analyst-run',\n  )\n  const analysis = isRecord(trajectory.metadata?.analysis)\n    ? trajectory.metadata.analysis\n    : undefined\n  if (analystAttempts.length === 0) {\n    if (analysis?.kind === 'analyst-run') {\n      throw new TypeError(\n        `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" is missing its archived run`,\n      )\n    }\n    return undefined\n  }\n  if (analystAttempts.length !== 1) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" must contain exactly one archived run`,\n    )\n  }\n  if (analysis?.kind !== 'analyst-run') {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" is missing review state`,\n    )\n  }\n\n  const artifact = analystAttempts[0]!.artifact\n  if (!isRecord(artifact)) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" has an invalid archived run`,\n    )\n  }\n  const runId = requiredString(\n    artifact.analystRunId,\n    `analyst trajectory \"${trajectory.id}\" run id`,\n  )\n  if (analysis.runId !== runId) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" run identity does not match its review state`,\n    )\n  }\n  const artifactRunDigest = requiredDigest(\n    artifact.runDigest,\n    `analyst trajectory \"${trajectory.id}\" archived run digest`,\n  )\n  const storedRunDigest = requiredDigest(\n    analysis.runDigest,\n    `analyst trajectory \"${trajectory.id}\" review run digest`,\n  )\n  if (artifactRunDigest !== storedRunDigest) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" run digest does not match its review state`,\n    )\n  }\n  const findings = snapshotAnalystFindings(\n    artifact.findings,\n    `analyst trajectory \"${trajectory.id}\"`,\n  )\n  const findingIds = findings.map((finding) => finding.finding_id)\n  const analystIds = stringArray(\n    artifact.analystIds,\n    `analyst trajectory \"${trajectory.id}\" analyst ids`,\n  )\n  const attemptMetadata = analystAttempts[0]!.metadata\n  if (!isRecord(attemptMetadata)) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" is missing archived run metadata`,\n    )\n  }\n  const archivedRun = snapshotAnalystRun(\n    {\n      run_id: runId,\n      correlation_id: artifact.correlationId,\n      started_at: analysis.startedAt,\n      ended_at: analysis.endedAt,\n      findings,\n      per_analyst: attemptMetadata.perAnalyst,\n      total_cost_usd: analysis.knownCostUsd,\n      ...(analysis.costProvenance === undefined\n        ? {}\n        : { total_cost_provenance: analysis.costProvenance }),\n      ...(artifact.executionPlan === undefined\n        ? {}\n        : {\n            execution_plan: artifact.executionPlan,\n            completion: artifact.completion,\n          }),\n    },\n    `analyst trajectory \"${trajectory.id}\" archived run`,\n  )\n  const knownAnalystIds = new Set(analystIds)\n  for (const [index, finding] of findings.entries()) {\n    if (!knownAnalystIds.has(finding.analyst_id)) {\n      throw new TypeError(\n        `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" omits generating analyst \"${finding.analyst_id}\" at finding ${index}`,\n      )\n    }\n  }\n  const reviewDecisions = validateAnalystReviewDecisions({\n    runId,\n    runDigest: storedRunDigest,\n    findings,\n    analystIds,\n    decisions: analysis.reviewDecisions,\n    requireComplete: true,\n  })\n  const expectedRunDigest = analystRunDigest(archivedRun)\n  if (storedRunDigest !== expectedRunDigest) {\n    throw new TypeError(\n      `feedbackTrajectoryToOptimizerRow: analyst trajectory \"${trajectory.id}\" archived run digest mismatch`,\n    )\n  }\n  return {\n    runId,\n    runDigest: expectedRunDigest,\n    findings,\n    findingIds,\n    analystIds,\n    reviewDecisions,\n  }\n}\n\nexport function completedAnalystReviewQuality(review: StoredAnalystReview): AnalystReviewQuality {\n  const findingDecisions = review.reviewDecisions.filter(\n    (decision): decision is Extract<AnalystReviewDecision, { verdict: 'confirmed' | 'rejected' }> =>\n      decision.verdict !== 'completeness_assessed',\n  )\n  const completeness = review.reviewDecisions.filter(\n    (decision): decision is Extract<AnalystReviewDecision, { verdict: 'completeness_assessed' }> =>\n      decision.verdict === 'completeness_assessed',\n  )\n  if (completeness.length !== 1) {\n    throw new TypeError(\n      'feedbackTrajectoryToOptimizerRow: analyst run requires exactly one independent completeness_assessed decision',\n    )\n  }\n\n  const confirmed = findingDecisions.filter((decision) => decision.verdict === 'confirmed').length\n  const rejected = findingDecisions.length - confirmed\n  const emitted = review.findingIds.length\n  const missed = completeness[0]!.missedIssues.length\n  const precision = emitted === 0 ? 1 : confirmed / emitted\n  const recallDenominator = confirmed + missed\n  const recall = recallDenominator === 0 ? 1 : confirmed / recallDenominator\n  const f1 = precision + recall === 0 ? 0 : (2 * precision * recall) / (precision + recall)\n  return {\n    precision,\n    recall,\n    f1,\n    counts: { emitted, confirmed, rejected, missed },\n  }\n}\n\nexport function validateAnalystReviewDecisions(input: {\n  runId: string\n  runDigest: AnalystRunDigest\n  findings: readonly AnalystFinding[]\n  analystIds: readonly string[]\n  decisions: unknown\n  requireComplete?: boolean\n}): AnalystReviewDecision[] {\n  if (!Array.isArray(input.decisions)) {\n    throw new TypeError('analyst review decisions must be an array')\n  }\n  const findings = snapshotAnalystFindings(input.findings)\n  const expectedRunDigest = requiredDigest(input.runDigest, 'analyst review run digest')\n  const findingsById = new Map(findings.map((finding) => [finding.finding_id, finding]))\n  const generatingAnalystIds = new Set(input.analystIds)\n  const seenFindingIds = new Set<string>()\n  let completenessCount = 0\n\n  const decisions = input.decisions.map((value, index): AnalystReviewDecision => {\n    if (!isRecord(value)) {\n      throw new TypeError(`analyst review decision ${index} must be an object`)\n    }\n    const source = requiredString(value.source, `analyst review decision ${index} source`)\n    if (!isAnalystReviewSource(source)) {\n      throw new TypeError(\n        `analyst review decision ${index} source must be user, judge, environment, metric, or policy`,\n      )\n    }\n    const reviewerId = requiredString(\n      value.reviewerId,\n      `analyst review decision ${index} reviewerId`,\n    )\n    if (generatingAnalystIds.has(reviewerId)) {\n      throw new TypeError(\n        `analyst review decision ${index} reviewerId must differ from the generating analyst`,\n      )\n    }\n    const reviewId = requiredString(value.reviewId, `analyst review decision ${index} reviewId`)\n    if (reviewId === input.runId) {\n      throw new TypeError(\n        `analyst review decision ${index} reviewId must identify an independent review`,\n      )\n    }\n    const reason = requiredString(value.reason, `analyst review decision ${index} reason`)\n    const decidedAt = canonicalTimestamp(\n      value.decidedAt,\n      `analyst review decision ${index} decidedAt`,\n    )\n    const runDigest = requiredDigest(value.runDigest, `analyst review decision ${index} runDigest`)\n    if (runDigest !== expectedRunDigest) {\n      throw new TypeError(`analyst review decision ${index} run digest mismatch`)\n    }\n\n    if (value.verdict === 'completeness_assessed') {\n      assertOnlyKeys(\n        value,\n        [\n          'runDigest',\n          'verdict',\n          'missedIssues',\n          'source',\n          'reviewerId',\n          'reviewId',\n          'reason',\n          'decidedAt',\n        ],\n        `analyst review decision ${index}`,\n      )\n      completenessCount += 1\n      if (completenessCount > 1) {\n        throw new TypeError('duplicate completeness_assessed analyst review decision')\n      }\n      return {\n        runDigest,\n        verdict: 'completeness_assessed',\n        missedIssues: validateMissedIssues(\n          value.missedIssues,\n          findingsById,\n          `analyst review decision ${index}`,\n        ),\n        source,\n        reviewerId,\n        reviewId,\n        reason,\n        decidedAt,\n      }\n    }\n\n    if (value.verdict !== 'confirmed' && value.verdict !== 'rejected') {\n      throw new TypeError(\n        `analyst review decision ${index} verdict must be confirmed, rejected, or completeness_assessed`,\n      )\n    }\n    assertOnlyKeys(\n      value,\n      [\n        'runDigest',\n        'findingId',\n        'findingDigest',\n        'verdict',\n        'source',\n        'reviewerId',\n        'reviewId',\n        'reason',\n        'decidedAt',\n      ],\n      `analyst review decision ${index}`,\n    )\n    const findingId = requiredString(value.findingId, `analyst review decision ${index} findingId`)\n    const finding = findingsById.get(findingId)\n    if (!finding) {\n      throw new TypeError(`analyst review decision references unknown finding id \"${findingId}\"`)\n    }\n    if (seenFindingIds.has(findingId)) {\n      throw new TypeError(`duplicate analyst review decision for finding id \"${findingId}\"`)\n    }\n    seenFindingIds.add(findingId)\n    const findingDigest = requiredString(\n      value.findingDigest,\n      `analyst review decision ${index} findingDigest`,\n    )\n    const expectedDigest = analystFindingDigest(finding)\n    if (findingDigest !== expectedDigest) {\n      throw new TypeError(\n        `analyst review decision ${index} digest mismatch for finding id \"${findingId}\"`,\n      )\n    }\n    return {\n      runDigest,\n      findingId,\n      findingDigest: expectedDigest,\n      verdict: value.verdict,\n      source,\n      reviewerId,\n      reviewId,\n      reason,\n      decidedAt,\n    }\n  })\n\n  if (input.requireComplete) {\n    const missing = findings\n      .map((finding) => finding.finding_id)\n      .filter((findingId) => !seenFindingIds.has(findingId))\n    if (missing.length > 0) {\n      throw new TypeError(\n        `feedbackTrajectoryToOptimizerRow: missing independent decisions for finding ids: ${missing.join(', ')}`,\n      )\n    }\n    if (completenessCount !== 1) {\n      throw new TypeError(\n        'feedbackTrajectoryToOptimizerRow: analyst run requires exactly one independent completeness_assessed decision',\n      )\n    }\n  }\n  return decisions\n}\n\nexport function assertUniqueFindingIds(findingIds: readonly string[]): void {\n  const seen = new Set<string>()\n  for (const findingId of findingIds) {\n    if (findingId.trim().length === 0) throw new TypeError('analyst finding id must not be empty')\n    if (seen.has(findingId)) {\n      throw new TypeError(`analyst run contains duplicate finding id \"${findingId}\"`)\n    }\n    seen.add(findingId)\n  }\n}\n\nfunction snapshotAnalystFinding(value: unknown, context: string): AnalystFinding {\n  let snapshot: unknown\n  try {\n    snapshot = JSON.parse(canonicalString(value)) as unknown\n  } catch (cause) {\n    throw new TypeError(`${context} must have a canonical JSON representation`, { cause })\n  }\n  assertAnalystFinding(snapshot, context)\n  return snapshot\n}\n\nfunction assertAnalystFinding(value: unknown, context: string): asserts value is AnalystFinding {\n  if (!isRecord(value)) throw new TypeError(`${context} must be an object`)\n  assertOnlyKeys(\n    value,\n    [\n      'schema_version',\n      'finding_id',\n      'analyst_id',\n      'produced_at',\n      'severity',\n      'area',\n      'claim',\n      'rationale',\n      'evidence_refs',\n      'recommended_action',\n      'validation_plan',\n      'confidence',\n      'subject',\n      'derived_from_judge',\n      'metadata',\n    ],\n    context,\n  )\n  if (value.schema_version !== '1.0.0') {\n    throw new TypeError(`${context} schema_version must be \"1.0.0\"`)\n  }\n  requiredString(value.finding_id, `${context} finding_id`)\n  requiredString(value.analyst_id, `${context} analyst_id`)\n  canonicalTimestamp(value.produced_at, `${context} produced_at`)\n  if (\n    value.severity !== 'critical' &&\n    value.severity !== 'high' &&\n    value.severity !== 'medium' &&\n    value.severity !== 'low' &&\n    value.severity !== 'info'\n  ) {\n    throw new TypeError(`${context} severity is invalid`)\n  }\n  requiredString(value.area, `${context} area`)\n  requiredString(value.claim, `${context} claim`)\n  optionalString(value.rationale, `${context} rationale`)\n  value.evidence_refs = validateEvidenceRefs(value.evidence_refs, `${context} evidence_refs`)\n  optionalString(value.recommended_action, `${context} recommended_action`)\n  optionalString(value.validation_plan, `${context} validation_plan`)\n  if (\n    typeof value.confidence !== 'number' ||\n    !Number.isFinite(value.confidence) ||\n    value.confidence < 0 ||\n    value.confidence > 1\n  ) {\n    throw new TypeError(`${context} confidence must be a finite number from 0 through 1`)\n  }\n  optionalString(value.subject, `${context} subject`)\n  if (value.derived_from_judge !== undefined && typeof value.derived_from_judge !== 'boolean') {\n    throw new TypeError(`${context} derived_from_judge must be a boolean`)\n  }\n  if (value.metadata !== undefined && !isRecord(value.metadata)) {\n    throw new TypeError(`${context} metadata must be an object`)\n  }\n}\n\nfunction validateMissedIssues(\n  value: unknown,\n  findingsById: ReadonlyMap<string, AnalystFinding>,\n  context: string,\n): AnalystMissedIssue[] {\n  if (!Array.isArray(value)) {\n    throw new TypeError(`${context} missedIssues must be an array`)\n  }\n  const seen = new Set<string>()\n  return value.map((issue, index) => {\n    const issueContext = `${context} missedIssues ${index}`\n    if (!isRecord(issue)) throw new TypeError(`${issueContext} must be an object`)\n    assertOnlyKeys(issue, ['id', 'reason', 'evidence'], issueContext)\n    const id = requiredString(issue.id, `${issueContext} id`)\n    if (findingsById.has(id)) {\n      throw new TypeError(`${issueContext} id \"${id}\" is already an emitted finding id`)\n    }\n    if (seen.has(id)) {\n      throw new TypeError(`duplicate missed issue id \"${id}\"`)\n    }\n    seen.add(id)\n    const reason = requiredString(issue.reason, `${issueContext} reason`)\n    return {\n      id,\n      reason,\n      ...(issue.evidence === undefined\n        ? {}\n        : { evidence: validateEvidenceRefs(issue.evidence, `${issueContext} evidence`) }),\n    }\n  })\n}\n\nfunction validateEvidenceRefs(value: unknown, context: string): EvidenceRef[] {\n  if (!Array.isArray(value)) throw new TypeError(`${context} must be an array`)\n  return value.map((evidence, index) => {\n    const evidenceContext = `${context} ${index}`\n    if (!isRecord(evidence)) throw new TypeError(`${evidenceContext} must be an object`)\n    assertOnlyKeys(evidence, ['kind', 'uri', 'excerpt'], evidenceContext)\n    if (\n      evidence.kind !== 'span' &&\n      evidence.kind !== 'event' &&\n      evidence.kind !== 'artifact' &&\n      evidence.kind !== 'finding' &&\n      evidence.kind !== 'metric'\n    ) {\n      throw new TypeError(`${evidenceContext} kind is invalid`)\n    }\n    const uri = requiredString(evidence.uri, `${evidenceContext} uri`)\n    const excerpt = evidence.excerpt\n    optionalString(excerpt, `${evidenceContext} excerpt`)\n    return {\n      kind: evidence.kind,\n      uri,\n      ...(excerpt === undefined ? {} : { excerpt: excerpt as string }),\n    }\n  })\n}\n\nfunction assertOnlyKeys(\n  value: Record<string, unknown>,\n  allowed: readonly string[],\n  name: string,\n): void {\n  const allowedKeys = new Set(allowed)\n  const unexpected = Object.keys(value).filter((key) => !allowedKeys.has(key))\n  if (unexpected.length > 0) {\n    throw new TypeError(`${name} contains unknown fields: ${unexpected.sort().join(', ')}`)\n  }\n}\n\nfunction stringArray(value: unknown, name: string): string[] {\n  if (!Array.isArray(value) || value.some((item) => typeof item !== 'string')) {\n    throw new TypeError(`${name} must be an array of strings`)\n  }\n  const strings = value.map((item) => requiredString(item, name))\n  if (new Set(strings).size !== strings.length) {\n    throw new TypeError(`${name} must contain unique values`)\n  }\n  return strings\n}\n\nfunction requiredString(value: unknown, name: string): string {\n  if (typeof value !== 'string' || value.trim().length === 0) {\n    throw new TypeError(`${name} must be a non-empty string`)\n  }\n  return value\n}\n\nfunction requiredDigest(value: unknown, name: string): AnalystRunDigest {\n  const digest = requiredString(value, name)\n  if (!/^sha256:[a-f0-9]{64}$/.test(digest)) {\n    throw new TypeError(`${name} must be a sha256 digest`)\n  }\n  return digest as AnalystRunDigest\n}\n\nfunction optionalString(value: unknown, name: string): void {\n  if (value !== undefined && typeof value !== 'string') {\n    throw new TypeError(`${name} must be a string`)\n  }\n}\n\nfunction canonicalTimestamp(value: unknown, name: string): string {\n  const timestamp = requiredString(value, name)\n  const parsed = new Date(timestamp)\n  if (Number.isNaN(parsed.valueOf()) || parsed.toISOString() !== timestamp) {\n    throw new TypeError(`${name} must be a canonical ISO 8601 UTC timestamp`)\n  }\n  return timestamp\n}\n\nfunction isAnalystReviewSource(value: string): value is AnalystReviewSource {\n  return (\n    value === 'user' ||\n    value === 'judge' ||\n    value === 'environment' ||\n    value === 'metric' ||\n    value === 'policy'\n  )\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n","/**\n * Deterministic behavioral metrics over OTLP spans — pure arithmetic, no LLM.\n *\n * It computes token growth, output decay, tool monoculture, and missing\n * self-verification once in TypeScript with no model judgment.\n *\n * General, not trace-specific: the detectors key off token trajectories and\n * tool usage present in any agentic OTLP trace, not any one benchmark.\n */\n\nimport { LLM_CONTEXT_TOKENS } from '../trace/attribute-vocabulary'\nimport { executionTrackByLane } from '../trace/execution-tracks'\nimport {\n  LLM_INPUT_TOKEN_ATTR_KEYS,\n  LLM_OUTPUT_TOKEN_ATTR_KEYS,\n  TOOL_NAME_ATTR_KEYS,\n} from '../trace/otlp-attributes'\nimport { spanEpochMillis } from './otlp-span'\nimport type { TraceAnalystSpan } from './types'\n\nexport type SuboptimalCode =\n  | 'monotonic-input-growth'\n  | 'output-length-decay'\n  | 'single-tool-dependency'\n  | 'no-self-verification'\n\nexport interface SuboptimalSignal {\n  code: SuboptimalCode\n  severity: 'high' | 'medium' | 'low'\n  /** Human-readable claim, with the backing numbers inlined. */\n  detail: string\n  /** The exact figures the detector fired on — auditable, no model in the loop. */\n  evidence: Record<string, number | string | boolean>\n}\n\nexport interface BehavioralMetrics {\n  /** The only trace represented by these metrics; null when spans are empty. */\n  traceId: string | null\n  llmCallCount: number\n  /** Causally serial LLM timelines. Parallel branches are never joined. */\n  tokenSequences: BehavioralTokenSequence[]\n  /** Token values from the longest serial timeline, retained for convenience. */\n  inputTokenTrajectory: number[]\n  outputTokenTrajectory: number[]\n  toolHistogram: Record<string, number>\n  totalToolCalls: number\n  distinctTools: number\n  /** distinct/total tool calls; 1.0 when there are no tool calls. */\n  toolDiversityRatio: number\n  hasSelfVerification: boolean\n  signals: SuboptimalSignal[]\n}\n\nexport interface BehavioralTokenSequence {\n  scopeId: string\n  spanIds: string[]\n  inputTokenTrajectory: Array<number | null>\n  outputTokenTrajectory: Array<number | null>\n}\n\ninterface TokenSample {\n  span: TraceAnalystSpan\n  input: number | null\n  output: number | null\n  step: number | null\n}\n\n/** ≥ this input-token growth ratio across a run, with no compression, fires. */\nconst INPUT_GROWTH_FACTOR = 3\n/** Tool-usage signals need at least this many calls to be meaningful. */\nconst MIN_TOOL_CALLS = 3\n/**\n * Serial calls required before a strictly-decreasing output run counts as decay.\n *\n * A run of n independent lengths is strictly decreasing by chance with\n * probability 1/n!, so the old minimum of 3 fired on roughly one sequence in\n * six. The paired `inputIsMonotonic && inputGrew` guard does not offset that:\n * context accumulates by construction in a serial agent loop, so input growth\n * is very nearly free evidence. At 5 calls chance alone accounts for under 1%,\n * which is the bar a signal reported at full confidence has to clear.\n */\nconst OUTPUT_DECAY_MINIMUM_CALLS = 5\n/**\n * The last output must fall to at most this fraction of the first.\n *\n * Length wanders between turns for reasons that are not degradation, so\n * direction alone is not a finding — an observed 784 → 646 run (18%) was\n * reported as decay and was noise. Requiring the response to lose most of its\n * length keeps the signal on the failure it names: late steps that quietly\n * stop doing the work.\n */\nconst OUTPUT_DECAY_MAXIMUM_RETAINED_FRACTION = 0.6\n/** Tool names that read or check state count as self-verification, not mutation.\n *  Covers the inspect verbs plus the read/search tools real harnesses use to\n *  verify (Claude Code Read/Grep/Glob, codex read_file/ls/cat, git status/diff,\n *  test/lint). A pure shell tool (Bash/exec_command) is intentionally NOT matched\n *  — its name can't tell a `pytest` from an `rm`. */\nconst VERIFY_RE =\n  /verif|eval|inspect|check|assert|validat|review|confirm|read|grep|glob|search|view|\\blist\\b|\\bls\\b|\\bcat\\b|\\bfind\\b|diff|status|\\btest|lint|typecheck/i\n\nfunction num(v: unknown): number | null {\n  return typeof v === 'number' && Number.isFinite(v) ? v : null\n}\nfunction numAttr(attrs: Record<string, unknown>, keys: readonly string[]): number | null {\n  for (const key of keys) {\n    const value = num(attrs[key])\n    if (value !== null) return value\n  }\n  return null\n}\nfunction inputTokensOf(s: TraceAnalystSpan): number | null {\n  const exactContext = num(s.attributes[LLM_CONTEXT_TOKENS])\n  if (exactContext !== null) return exactContext\n  // Foreign producers disagree on whether prompt includes cached tokens.\n  // Without an exact total, retain the reported prompt instead of guessing.\n  return (\n    numAttr(s.attributes, LLM_INPUT_TOKEN_ATTR_KEYS) ?? num(s.attributes['llm.usage.input_tokens'])\n  )\n}\nfunction outputTokensOf(s: TraceAnalystSpan): number | null {\n  return (\n    numAttr(s.attributes, LLM_OUTPUT_TOKEN_ATTR_KEYS) ??\n    num(s.attributes['llm.usage.output_tokens'])\n  )\n}\nfunction stepOf(s: TraceAnalystSpan): number | null {\n  return num(s.attributes.step)\n}\nfunction toolNameOf(s: TraceAnalystSpan): string | null {\n  if (s.tool_name) return s.tool_name\n  for (const key of TOOL_NAME_ATTR_KEYS) {\n    const t = s.attributes[key]\n    if (typeof t === 'string' && t.length > 0) return t\n  }\n  return null\n}\n\n/**\n * Reduce a span list to behavioral metrics + fired suboptimality signals.\n * Pure + deterministic: same spans → same output, on any machine, no model.\n */\nexport function computeTraceMetrics(spans: readonly TraceAnalystSpan[]): BehavioralMetrics {\n  const traceIds = new Set(spans.map((span) => span.trace_id))\n  if (traceIds.size > 1) {\n    throw new Error(\n      `computeTraceMetrics: expected spans from one trace, received ${traceIds.size} traces`,\n    )\n  }\n  const traceId = traceIds.values().next().value ?? null\n\n  const samples: TokenSample[] = spans.map((span) => ({\n    span,\n    input: inputTokensOf(span),\n    output: outputTokensOf(span),\n    step: stepOf(span),\n  }))\n  const llmSamples = samples.filter((sample) => sample.span.kind === 'LLM')\n  const tokenSamples =\n    llmSamples.length > 0\n      ? llmSamples\n      : samples.filter((sample) => sample.input !== null || sample.output !== null)\n  const tokenSequences = buildTokenSequences(tokenSamples, spans)\n  const primarySequence = tokenSequences[0]\n  const inputTokenTrajectory =\n    primarySequence?.inputTokenTrajectory.filter((value): value is number => value !== null) ?? []\n  const outputTokenTrajectory =\n    primarySequence?.outputTokenTrajectory.filter((value): value is number => value !== null) ?? []\n  const toolHistogram: Record<string, number> = {}\n  let hasSelfVerification = false\n\n  for (const s of spans) {\n    const tool = toolNameOf(s)\n    if (tool) {\n      toolHistogram[tool] = (toolHistogram[tool] ?? 0) + 1\n      if (VERIFY_RE.test(tool)) hasSelfVerification = true\n    }\n  }\n\n  const totalToolCalls = Object.values(toolHistogram).reduce((a, b) => a + b, 0)\n  const distinctTools = Object.keys(toolHistogram).length\n  const toolDiversityRatio = totalToolCalls === 0 ? 1 : distinctTools / totalToolCalls\n\n  const signals: SuboptimalSignal[] = []\n  const seenTokenSignals = new Set<SuboptimalCode>()\n  for (const sequence of tokenSequences) {\n    for (const signal of tokenSignals(sequence)) {\n      if (seenTokenSignals.has(signal.code)) continue\n      seenTokenSignals.add(signal.code)\n      signals.push(signal)\n    }\n  }\n\n  if (totalToolCalls >= MIN_TOOL_CALLS && distinctTools === 1) {\n    const only = Object.keys(toolHistogram)[0]!\n    signals.push({\n      code: 'single-tool-dependency',\n      severity: 'medium',\n      detail: `All ${totalToolCalls} observed tool calls are \\`${only}\\`; no alternate tool call was observed.`,\n      evidence: { tool: only, calls: totalToolCalls, distinct_tools: 1 },\n    })\n  }\n\n  if (totalToolCalls >= MIN_TOOL_CALLS && !hasSelfVerification) {\n    signals.push({\n      code: 'no-self-verification',\n      severity: 'medium',\n      detail: `${totalToolCalls} tool calls were observed without a verification-named tool call.`,\n      evidence: { tool_calls: totalToolCalls, verification_calls: 0 },\n    })\n  }\n\n  return {\n    traceId,\n    llmCallCount: tokenSamples.length,\n    tokenSequences,\n    inputTokenTrajectory,\n    outputTokenTrajectory,\n    toolHistogram,\n    totalToolCalls,\n    distinctTools,\n    toolDiversityRatio,\n    hasSelfVerification,\n    signals,\n  }\n}\n\nfunction buildTokenSequences(\n  samples: readonly TokenSample[],\n  spans: readonly TraceAnalystSpan[],\n): BehavioralTokenSequence[] {\n  const spansById = new Map(spans.map((span) => [span.span_id, span]))\n  const executionScopeFor = createTokenExecutionScopeResolver(spansById)\n  const scopedSamples = samples.map((sample) => ({\n    sample,\n    ...executionScopeFor(sample.span),\n  }))\n  const trackByLane = executionTrackByLane(scopedSamples)\n  const byTrack = new Map<string, { scopeId: string; samples: TokenSample[] }>()\n  for (const scoped of scopedSamples) {\n    const trackId = trackByLane.get(scoped.key)!\n    const track = byTrack.get(trackId) ?? { scopeId: scoped.scopeId, samples: [] }\n    track.samples.push(scoped.sample)\n    byTrack.set(trackId, track)\n  }\n\n  const sequences: BehavioralTokenSequence[] = []\n  for (const { scopeId, samples: tracked } of byTrack.values()) {\n    const runs = serialTokenRuns([...tracked].sort(compareTokenSamples))\n    runs.forEach((run, index) => {\n      sequences.push({\n        scopeId: runs.length === 1 ? scopeId : `${scopeId}#${index + 1}`,\n        spanIds: run.map((sample) => sample.span.span_id),\n        inputTokenTrajectory: run.map((sample) => sample.input),\n        outputTokenTrajectory: run.map((sample) => sample.output),\n      })\n    })\n  }\n\n  return sequences.sort(\n    (a, b) =>\n      b.spanIds.length - a.spanIds.length ||\n      a.scopeId.localeCompare(b.scopeId) ||\n      a.spanIds[0]!.localeCompare(b.spanIds[0]!),\n  )\n}\n\ninterface AncestorScope {\n  agentId: string | null\n  rootId: string | null\n  missingParentId: string | null\n  laneSpanId: string | null\n}\n\nfunction createTokenExecutionScopeResolver(spansById: ReadonlyMap<string, TraceAnalystSpan>): (\n  span: TraceAnalystSpan,\n) => {\n  key: string\n  scopeKey: string\n  scopeId: string\n  start: number | null\n  end: number | null\n} {\n  const cache = new Map<string, AncestorScope>()\n  return (span) => {\n    const ancestry = resolveAncestorScope(span.parent_span_id, spansById, cache)\n    const rootId = ancestry.rootId\n    const scopeId = ancestry.agentId\n      ? `span:${ancestry.agentId}`\n      : ancestry.missingParentId\n        ? `parent:${ancestry.missingParentId}`\n        : rootId\n          ? `root:${rootId}`\n          : span.agent_name\n            ? `agent:${span.agent_name}`\n            : `trace:${span.trace_id}`\n    const scopeSpanId = ancestry.agentId ?? ancestry.missingParentId ?? rootId\n    const laneSpan = ancestry.laneSpanId ? spansById.get(ancestry.laneSpanId) : undefined\n    const direct = scopeSpanId === null || ancestry.laneSpanId === scopeSpanId\n    const timedSpan = direct ? span : laneSpan\n    return {\n      key: JSON.stringify([scopeId, direct ? span.span_id : ancestry.laneSpanId]),\n      scopeKey: scopeId,\n      scopeId,\n      start: timedSpan ? spanEpochMillis(timedSpan.start_time) : null,\n      end: timedSpan ? spanEpochMillis(timedSpan.end_time) : null,\n    }\n  }\n}\n\nfunction resolveAncestorScope(\n  startId: string | null,\n  spansById: ReadonlyMap<string, TraceAnalystSpan>,\n  cache: Map<string, AncestorScope>,\n): AncestorScope {\n  const empty: AncestorScope = {\n    agentId: null,\n    rootId: null,\n    missingParentId: null,\n    laneSpanId: null,\n  }\n  if (!startId) return empty\n\n  const path: string[] = []\n  const pathIndex = new Map<string, number>()\n  let currentId: string | null = startId\n  let resolved = empty\n  while (currentId) {\n    const cached = cache.get(currentId)\n    if (cached) {\n      resolved = cached\n      break\n    }\n    const cycleStart = pathIndex.get(currentId)\n    if (cycleStart !== undefined) {\n      resolved = {\n        agentId: null,\n        rootId: [...path.slice(cycleStart)].sort()[0]!,\n        missingParentId: null,\n        laneSpanId: [...path.slice(cycleStart)].sort()[0]!,\n      }\n      break\n    }\n    const current = spansById.get(currentId)\n    if (!current) {\n      resolved = {\n        agentId: null,\n        rootId: null,\n        missingParentId: currentId,\n        laneSpanId: currentId,\n      }\n      break\n    }\n    if (current.kind === 'AGENT') {\n      resolved = {\n        agentId: current.span_id,\n        rootId: null,\n        missingParentId: null,\n        laneSpanId: current.span_id,\n      }\n      break\n    }\n    pathIndex.set(currentId, path.length)\n    path.push(currentId)\n    currentId = current.parent_span_id\n  }\n\n  for (let index = path.length - 1; index >= 0; index -= 1) {\n    if (resolved.agentId === null && resolved.rootId === null) {\n      resolved = { ...resolved, rootId: path[index]!, laneSpanId: path[index]! }\n    } else if (\n      resolved.laneSpanId === (resolved.agentId ?? resolved.missingParentId ?? resolved.rootId)\n    ) {\n      resolved = { ...resolved, laneSpanId: path[index]! }\n    }\n    cache.set(path[index]!, resolved)\n  }\n  return resolved\n}\n\nfunction compareTokenSamples(a: TokenSample, b: TokenSample): number {\n  const aStart = spanEpochMillis(a.span.start_time)\n  const bStart = spanEpochMillis(b.span.start_time)\n  if (aStart === null && bStart !== null) return 1\n  if (aStart !== null && bStart === null) return -1\n  if (aStart !== null && bStart !== null && aStart !== bStart) return aStart - bStart\n  if (a.step !== null && b.step !== null && a.step !== b.step) return a.step - b.step\n  return a.span.span_id.localeCompare(b.span.span_id)\n}\n\nfunction serialTokenRuns(ordered: readonly TokenSample[]): TokenSample[][] {\n  const runs: TokenSample[][] = []\n  let serial: TokenSample[] = []\n  let overlap: TokenSample[] = []\n  let overlapEnd = Number.NEGATIVE_INFINITY\n\n  const flushSerial = () => {\n    if (serial.length > 0) runs.push(serial)\n    serial = []\n  }\n  const flushOverlap = () => {\n    if (overlap.length === 1) {\n      serial.push(overlap[0]!)\n    } else if (overlap.length > 1) {\n      flushSerial()\n      for (const sample of overlap) runs.push([sample])\n    }\n    overlap = []\n    overlapEnd = Number.NEGATIVE_INFINITY\n  }\n\n  for (const sample of ordered) {\n    const start = spanEpochMillis(sample.span.start_time)\n    const end = spanEpochMillis(sample.span.end_time)\n    if (start === null || end === null || sample.span.duration_ms <= 0 || end < start) {\n      flushOverlap()\n      flushSerial()\n      runs.push([sample])\n      continue\n    }\n    if (overlap.length > 0 && start >= overlapEnd) flushOverlap()\n    overlap.push(sample)\n    overlapEnd = Math.max(overlapEnd, end)\n  }\n  flushOverlap()\n  flushSerial()\n  return runs\n}\n\nfunction tokenSignals(sequence: BehavioralTokenSequence): SuboptimalSignal[] {\n  const signals: SuboptimalSignal[] = []\n  const inputs = sequence.inputTokenTrajectory\n  const outputs = sequence.outputTokenTrajectory\n  if (inputs.length >= 3 && inputs.every((value): value is number => value !== null)) {\n    const first = inputs[0]!\n    const last = inputs[inputs.length - 1]!\n    const isMonotonic = everyAdjacent(inputs, (previous, current) => current >= previous)\n    const growthFromZero = first === 0 && last > 0\n    const growth = growthFromZero ? Infinity : first > 0 ? last / first : 0\n    if (isMonotonic && last > first && growth >= INPUT_GROWTH_FACTOR) {\n      const growthLabel = growthFromZero ? '0→nonzero (unbounded)' : `${growth.toFixed(1)}x`\n      signals.push({\n        code: 'monotonic-input-growth',\n        severity: 'high',\n        detail: `LLM input tokens grew ${growthLabel} (${first}→${last}) across ${inputs.length} serial calls without an intervening decrease.`,\n        evidence: {\n          first,\n          last,\n          growth_x: growthFromZero ? 'unbounded' : Number(growth.toFixed(2)),\n          calls: inputs.length,\n          scope: sequence.scopeId,\n          first_span_id: sequence.spanIds[0]!,\n          last_span_id: sequence.spanIds[sequence.spanIds.length - 1]!,\n        },\n      })\n    }\n  }\n\n  if (\n    inputs.length >= OUTPUT_DECAY_MINIMUM_CALLS &&\n    inputs.length === outputs.length &&\n    inputs.every((value): value is number => value !== null) &&\n    outputs.every((value): value is number => value !== null)\n  ) {\n    const first = outputs[0]!\n    const last = outputs[outputs.length - 1]!\n    const inputIsMonotonic = everyAdjacent(inputs, (previous, current) => current >= previous)\n    const outputIsMonotonic = everyAdjacent(outputs, (previous, current) => current <= previous)\n    const inputGrew = inputs[inputs.length - 1]! > inputs[0]!\n    const decayIsMaterial = last <= first * OUTPUT_DECAY_MAXIMUM_RETAINED_FRACTION\n    if (inputIsMonotonic && inputGrew && outputIsMonotonic && decayIsMaterial) {\n      signals.push({\n        code: 'output-length-decay',\n        severity: 'medium',\n        detail: `LLM output tokens shrank ${first}→${last} over ${outputs.length} serial calls while input tokens increased monotonically.`,\n        evidence: {\n          first,\n          last,\n          calls: outputs.length,\n          scope: sequence.scopeId,\n          first_span_id: sequence.spanIds[0]!,\n          last_span_id: sequence.spanIds[sequence.spanIds.length - 1]!,\n        },\n      })\n    }\n  }\n  return signals\n}\n\nfunction everyAdjacent(\n  values: readonly number[],\n  predicate: (previous: number, current: number) => boolean,\n): boolean {\n  return values.slice(1).every((current, index) => predicate(values[index]!, current))\n}\n","/**\n * Deterministic behavioral analysis over arithmetic in trace spans.\n * This pass is cheap and repeatable; semantic analysis remains the job of\n * model-backed analysts. Relative quality requires a labeled comparison.\n */\n\nimport {\n  type BehavioralMetrics,\n  computeTraceMetrics,\n  type SuboptimalCode,\n} from '../trace-analyst/behavioral-metrics'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { ExactCapableAnalyst } from './exact-types'\nimport { type AnalystFinding, makeFinding } from './types'\n\nconst RECOMMENDED_ACTION: Record<SuboptimalCode, string> = {\n  'monotonic-input-growth':\n    'Inspect context assembly; if prior history is repeatedly included, summarize completed work before the next model call.',\n  'output-length-decay':\n    'Check late-step completeness; if shorter responses omit required work, add explicit completion criteria to the agent instructions.',\n  'single-tool-dependency':\n    'Test whether an inspect or verification tool improves outcomes after the repeated call fails or returns no progress.',\n  'no-self-verification':\n    'After state-changing actions, require an observable check before the agent proceeds.',\n}\n\nconst ANALYST_ID = 'efficiency-behavioral'\nconst DEFAULT_MAX_TRACES = 1_000\nconst DEFAULT_MAX_EVIDENCE_REFS = 20\nconst TRACE_PAGE_SIZE = 200\n\nexport interface BehavioralAnalystOptions {\n  /** Refuse larger unfiltered datasets instead of sampling them silently. Default 1,000. */\n  maxTraces?: number\n  /** Evidence locations retained per finding. Counts still cover every analyzed trace. Default 20. */\n  maxEvidenceRefsPerFinding?: number\n}\n\nconst AGGREGATE_CLAIM: Record<SuboptimalCode, (observed: number, analyzed: number) => string> = {\n  'monotonic-input-growth': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces showed input tokens grow from zero to nonzero or to at least 3x their initial value across at least 3 serial model calls without a decrease.`,\n  'output-length-decay': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces showed output tokens decrease while input tokens increased monotonically across at least 3 serial model calls.`,\n  'single-tool-dependency': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces used only one named tool across at least 3 tool calls.`,\n  'no-self-verification': (observed, analyzed) =>\n    `${observed}/${analyzed} analyzed traces had at least 3 tool calls without a verification-named tool call.`,\n}\n\nasync function listTraceIds(\n  store: TraceAnalysisStore,\n  maxTraces: number,\n  signal?: AbortSignal,\n): Promise<string[]> {\n  const traceIds = new Set<string>()\n  let offset = 0\n  let expectedTotal: number | undefined\n\n  while (true) {\n    signal?.throwIfAborted()\n    const page = await store.queryTraces({ limit: TRACE_PAGE_SIZE, offset })\n    if (expectedTotal === undefined) expectedTotal = page.total\n    if (page.total !== expectedTotal) {\n      throw new Error(\n        `behavioralAnalyst: trace count changed during pagination (${expectedTotal} to ${page.total})`,\n      )\n    }\n    if (page.total > maxTraces) {\n      throw new RangeError(\n        `behavioralAnalyst: ${page.total} traces exceed maxTraces=${maxTraces}; filter the store or raise the explicit limit`,\n      )\n    }\n    for (const trace of page.traces) traceIds.add(trace.trace_id)\n    if (traceIds.size > maxTraces) {\n      throw new RangeError(\n        `behavioralAnalyst: more than maxTraces=${maxTraces} unique traces were returned`,\n      )\n    }\n    if (!page.has_more) break\n    if (page.traces.length === 0) {\n      throw new Error('behavioralAnalyst: trace store returned an empty page with has_more=true')\n    }\n    offset += page.traces.length\n  }\n\n  if (traceIds.size !== expectedTotal) {\n    throw new Error(\n      `behavioralAnalyst: pagination returned ${traceIds.size}/${expectedTotal ?? 0} unique traces`,\n    )\n  }\n\n  return [...traceIds].sort()\n}\n\n/**\n * Map computed signals → structured AnalystFindings. Pure: no LLM, no clock\n * dependence beyond `produced_at` (overridable for deterministic tests).\n */\nexport function deriveEfficiencyFindings(\n  metrics: BehavioralMetrics,\n  opts: { analystId?: string; producedAt?: string } = {},\n): AnalystFinding[] {\n  const analystId = opts.analystId ?? ANALYST_ID\n  const traceId = metrics.traceId\n  return metrics.signals.map((sig) =>\n    makeFinding({\n      analyst_id: analystId,\n      area: 'efficiency',\n      subject: sig.code,\n      claim: sig.detail,\n      severity: sig.severity,\n      // Deterministic arithmetic over spans, not a model judgment → certain.\n      confidence: 1,\n      evidence_refs: [\n        {\n          kind: 'metric',\n          uri: traceId\n            ? `metric://trace/${encodeURIComponent(traceId)}/efficiency/${sig.code}`\n            : `metric://efficiency/${sig.code}`,\n          excerpt: JSON.stringify(sig.evidence),\n        },\n      ],\n      recommended_action: RECOMMENDED_ACTION[sig.code],\n      metadata: {\n        deterministic: true,\n        evidence: sig.evidence,\n        ...(traceId ? { trace_id: traceId } : {}),\n      },\n      id_basis: sig.code,\n      ...(opts.producedAt ? { produced_at: opts.producedAt } : {}),\n    }),\n  )\n}\n\n/** The deterministic behavioral/efficiency analyst (no LLM, any-model). */\nexport function behavioralAnalyst(\n  options: BehavioralAnalystOptions = {},\n): ExactCapableAnalyst<TraceAnalysisStore> {\n  const maxTraces = positiveInteger(options.maxTraces ?? DEFAULT_MAX_TRACES, 'maxTraces')\n  const maxEvidenceRefsPerFinding = positiveInteger(\n    options.maxEvidenceRefsPerFinding ?? DEFAULT_MAX_EVIDENCE_REFS,\n    'maxEvidenceRefsPerFinding',\n  )\n  return {\n    id: ANALYST_ID,\n    description:\n      'Deterministic behavioral/efficiency findings over OTLP spans — token-growth, output-decay, tool-monoculture, missing self-verification. Zero LLM; model-agnostic by construction.',\n    inputKind: 'trace-store',\n    cost: { kind: 'deterministic' },\n    version: '2.0.0',\n    executionConfig: {\n      kind: 'behavioral-efficiency',\n      max_traces: maxTraces,\n      max_evidence_refs_per_finding: maxEvidenceRefsPerFinding,\n    },\n    async analyze(store, context) {\n      const analyzedTraceIds = await listTraceIds(store, maxTraces, context.signal)\n      const findingsById = new Map<\n        string,\n        {\n          finding: AnalystFinding\n          observedTraceCount: number\n          evidenceTraceIds: string[]\n          evidence: AnalystFinding['evidence_refs']\n        }\n      >()\n      for (const traceId of analyzedTraceIds) {\n        context.signal?.throwIfAborted()\n        const viewed = await store.viewTrace({ trace_id: traceId })\n        if (viewed.trace_id !== traceId) {\n          throw new Error(\n            `behavioralAnalyst: requested trace '${traceId}', received '${viewed.trace_id}'`,\n          )\n        }\n        if (!viewed.spans) {\n          throw new Error(\n            `behavioralAnalyst: trace '${traceId}' is oversized; complete spans are required`,\n          )\n        }\n        const metrics = computeTraceMetrics(viewed.spans)\n        if (metrics.traceId !== null && metrics.traceId !== traceId) {\n          throw new Error(\n            `behavioralAnalyst: requested trace '${traceId}', received '${metrics.traceId}'`,\n          )\n        }\n        for (const finding of deriveEfficiencyFindings(metrics)) {\n          const current = findingsById.get(finding.finding_id)\n          if (!current) {\n            findingsById.set(finding.finding_id, {\n              finding,\n              observedTraceCount: 1,\n              evidenceTraceIds: [traceId],\n              evidence: [...finding.evidence_refs],\n            })\n            continue\n          }\n          current.observedTraceCount += 1\n          if (current.evidence.length < maxEvidenceRefsPerFinding) {\n            current.evidenceTraceIds.push(traceId)\n            current.evidence.push(...finding.evidence_refs)\n          }\n        }\n      }\n      return [...findingsById.values()].map(\n        ({ finding, observedTraceCount, evidenceTraceIds, evidence }) => ({\n          ...finding,\n          claim: AGGREGATE_CLAIM[finding.subject as SuboptimalCode](\n            observedTraceCount,\n            analyzedTraceIds.length,\n          ),\n          rationale: `${observedTraceCount}/${analyzedTraceIds.length} analyzed traces exhibited this pattern.`,\n          evidence_refs: evidence,\n          metadata: {\n            deterministic: true,\n            evidence_trace_ids: evidenceTraceIds,\n            omitted_evidence_trace_count: observedTraceCount - evidenceTraceIds.length,\n            observed_trace_count: observedTraceCount,\n            analyzed_trace_count: analyzedTraceIds.length,\n          },\n        }),\n      )\n    },\n  }\n}\n\nfunction positiveInteger(value: number, name: string): number {\n  if (!Number.isSafeInteger(value) || value < 1) {\n    throw new RangeError(`behavioralAnalyst: ${name} must be a positive safe integer`)\n  }\n  return value\n}\n","import {\n  analyzeSupervisorRunIntegrity,\n  type SupervisorRunIntegrityEvidence,\n} from '../../supervisor-run/integrity'\nimport type { SupervisorRunSources, SupervisorRunTree } from '../../supervisor-run/types'\nimport type { ExactCapableAnalyst } from '../exact-types'\nimport { type AnalystContext, type AnalystFinding, type EvidenceRef, makeFinding } from '../types'\n\nconst ANALYST_ID = 'control-integrity'\n\nfunction shown(value: unknown): string {\n  if (value === undefined) return '<absent>'\n  const encoded = JSON.stringify(value)\n  return encoded === undefined ? String(value) : encoded\n}\n\nfunction evidenceRef(namespace: string, value: SupervisorRunIntegrityEvidence): EvidenceRef {\n  return {\n    kind: 'metric',\n    uri: `supervisor-run://${encodeURIComponent(namespace)}/${value.path}`,\n    excerpt: shown(value.value),\n  }\n}\n\n/** Translate typed supervisor-run integrity issues into the shared analyst envelope. */\nexport function emitControlIntegrityFindings(\n  input: SupervisorRunSources | SupervisorRunTree,\n  producedAt: string,\n): AnalystFinding[] {\n  const report = analyzeSupervisorRunIntegrity(input, { capturedAt: producedAt })\n  return report.issues.map((issue) =>\n    makeFinding({\n      analyst_id: ANALYST_ID,\n      produced_at: producedAt,\n      area: issue.area,\n      severity: issue.severity,\n      subject: `${report.runRef}/${issue.subject}`,\n      claim: issue.claim,\n      rationale: issue.detail,\n      evidence_refs: issue.evidence.map((value) => evidenceRef(report.runRef, value)),\n      recommended_action: issue.recommendedAction,\n      validation_plan:\n        'Re-run this deterministic analyst on the retained SupervisorRunSources or SupervisorRunTree after correcting the producer.',\n      confidence: 1,\n      metadata: {\n        integrity_code: issue.code,\n        integrity_input: report.input,\n        integrity_run_ref: report.runRef,\n        integrity_subject: issue.subject,\n        ...issue.metadata,\n      },\n    }),\n  )\n}\n\n/** Deterministic Analyst adapter for `SupervisorRunSources | SupervisorRunTree`. */\nexport class ControlIntegrityAnalyst\n  implements ExactCapableAnalyst<SupervisorRunSources | SupervisorRunTree>\n{\n  readonly id = ANALYST_ID\n  readonly description =\n    'Deterministic supervisor-run integrity checks with explicit unavailable evidence.'\n  readonly inputKind = 'custom' as const\n  readonly cost = { kind: 'deterministic' as const, est_usd_per_run: 0 }\n  readonly version = '2.0.0'\n  readonly executionConfig = {\n    kind: 'control-integrity',\n    produced_at_source: 'tags.producedAt-or-system-clock',\n  } as const\n\n  async analyze(\n    input: SupervisorRunSources | SupervisorRunTree,\n    ctx: AnalystContext,\n  ): Promise<AnalystFinding[]> {\n    const producedAt = ctx.tags?.producedAt ?? new Date().toISOString()\n    const findings = emitControlIntegrityFindings(input, producedAt)\n    ctx.log?.(`control-integrity: ${findings.length} finding(s)`, {\n      input: 'nodes' in input ? 'SupervisorRunTree' : 'SupervisorRunSources',\n    })\n    return findings\n  }\n}\n\nexport const CONTROL_INTEGRITY_ANALYST = new ControlIntegrityAnalyst()\n","/**\n * Failure-mode analyst — prices each failure by the work it burned.\n *\n * Brief: for every failure worth reporting, find the span where it\n * started, find the span where the agent resumed productive work, and\n * report the distance between them as the cost. Severity follows that\n * measured cost. Frequency does not set severity.\n *\n * Why the reframe: counting is already free. `getDatasetOverview`\n * returns `errors.trace_count`, `errors.span_count`, and an\n * `error_clusters[]` array carrying each signature's tool, trace and\n * span counts, prevalence, and exemplar ids — deterministically, before\n * a single model call. The 1.x prompt spent a recursive investigation\n * re-deriving exactly that and answered with \"Bash tool calls are the\n * dominant failure surface (54 error spans across 47 distinct\n * signatures)\" and \"79/5260 tool calls ended in errors\". Both numbers\n * were true, both were already on the overview, and neither told an\n * operator which failure to fix first.\n *\n * What is NOT free is attributing waste. An error the agent shrugged\n * off on the next span cost approximately nothing. An error that sent\n * it down a wrong path for twenty spans, or that ended with a human\n * typing the correction, cost real wall-clock and real tokens. Only a\n * reader that follows the trace forward from the error to the point of\n * resumption can measure that, and that walk is what the model is paid\n * for here.\n *\n * The bounding pair is enforced structurally rather than by prompt\n * alone: `minimumEvidenceCitations: 2` rejects any finding that cannot\n * cite both the error span and the span that closed it, so an\n * unmeasured cost claim cannot reach the registry.\n *\n * Eight bounded model subqueries let the actor adjudicate the one\n * genuine judgement call — is a given post-error span real progress or\n * more flailing? — over excerpts it has already loaded.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('failure-mode')\n\nconst ACTOR_PROMPT = `You are a failure-cost analyst for an OTLP trace dataset. Your job is to find the failures that **burned the most agent work** and to price each one in spans, model calls, and wall-clock. How often an error occurred is not its cost and is not your output.\n\n${subjectGrammar}\n\nUse a lowercase cluster label that names the cost shape, not the error string: \"human-corrected-file-overwrite\", \"unrecovered-auth-loop\", \"long-detour-schema-guess\".\n\nWORKLIST → RECOVERY BOUNDARY → PRICE → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Read \\`errors.trace_count\\`, \\`errors.span_count\\`, and \\`error_clusters[]\\` — each cluster carries \\`signature\\`, \\`tool_name\\`, \\`trace_count\\`, \\`span_count\\`, \\`prevalence\\`, \\`exemplar_trace_ids\\`, and \\`exemplar_span_ids\\`. This is the deterministic analyzer's output, already computed for free. It is your WORKLIST: the exemplar ids name the spans you go price. It is never your findings.\n2. Reach error-bearing traces the exemplars miss with \\`queryTraces(filters={\"has_errors\": true}, limit=...)\\`. Prefer long traces and traces whose errors sit early: a failure has room to be expensive only when work followed it.\n3. Take one candidate error span E and read its trace in order. \\`viewTrace\\` returns that trace's spans sorted by \\`start_time\\`, which is the ordering every distance below is counted in. When \\`viewTrace\\` returns \\`oversized\\` instead of spans, locate candidates with \\`searchTrace\\` and pull the exact ids with \\`viewSpans\\`; use \\`searchSpan\\` when one span's payload is truncated.\n4. Find the RECOVERY BOUNDARY R — the first span after E in which the agent resumed productive work. Productive means a different, task-advancing action. A retry of the same call with the same arguments, a re-read of the same file, a re-plan of the same step, and an apology are all still inside the failure. Then price it:\n   - spans_burned: spans strictly between E and R\n   - model_calls_burned: how many of those spans have kind \\`LLM\\`\n   - wall_clock_ms: R \\`end_time\\` minus E \\`start_time\\`\n   Report all three. If the agent never resumed, R is the trace's last span and the failure is UNRECOVERED.\n5. Set severity from what ENDED the failure and from the measured distance, never from how many times the signature appears:\n   - HUMAN-CORRECTED — a human turn after E supplies the correction. This is the most expensive class at any span count, because the failure escaped the agent entirely and reached the user: severity critical. Detect it as a new user-role message in a later \\`LLM\\` span's input attributes, or a new root-level \\`AGENT\\` span in which the user restates or repairs the task. Search with patterns like \\`\"role\"\\\\s*:\\\\s*\"user\"\\`, \\`(that|this) is (wrong|not what)\\`, \\`I (said|asked|told you)\\`, \\`stop\\`, \\`undo\\`, \\`revert\\`, \\`you (deleted|broke|missed|ignored)\\`, \\`try again\\`. Quote the human's words exactly.\n   - UNRECOVERED — the trace ends without resumption: severity critical.\n   - LONG DETOUR — 10 or more spans burned, or 3 or more \\`LLM\\` spans burned: severity high.\n   - SHORT DETOUR — 2 to 9 spans burned: severity medium.\n   - SELF-RECOVERED ON THE NEXT SPAN — cost is approximately zero. Do not emit it. That is resilience, and reporting it dilutes the ranking.\n   One error that cost 20 spans outranks 50 errors that each cost one retry. Frequency may appear in a finding only as a multiplier on a measured per-instance cost, never as the reason for its severity.\n6. **Cluster, do not enumerate.** Errors sharing a root cause AND a recovery shape are ONE finding: report the summed cost across instances, state how many instances it covers, and cite the bounding pair of the single most expensive instance. Two errors with the same signature but different recovery shapes — one shrugged off, one human-corrected — are NOT the same finding; the expensive one is the finding and the cheap one is noise.\n\nFORBIDDEN OUTPUT. Each of the following duplicates the deterministic pass, and a duplicate finding is worse than no finding because it costs a reviewer the same attention while carrying no new information:\n   - a count of errors by tool (\"Bash is the dominant failure surface, 54 error spans\")\n   - a count or inventory of error signatures (\"47 distinct error signatures\")\n   - an error rate (\"79 of 5260 tool calls ended in errors\")\n   - any restatement of \\`prevalence\\`, \\`trace_count\\`, or \\`span_count\\` from \\`error_clusters[]\\`\nEvery finding MUST state its measured cost — spans burned, model calls burned, wall-clock — in the claim, and MUST cite the two spans that bound it: the error span and the recovery span, or the escaping human turn, or the trace's last span when unrecovered. A failure you cannot bound with two spans is one you did not measure: drop it.\n\n**Adjudicate boundaries with subqueries.** The single judgement call in this protocol is whether a post-error span is genuine resumption or more flailing. Load E, the spans between, and the candidate R, then send one bounded \\`llm_query\\` per candidate carrying those exact excerpts and asking which span first advances the task. Subqueries cannot call trace tools, so a trace id tells them nothing — paste the excerpts. Accept a boundary only when the excerpts you loaded support the answer.\n\nConfidence 0.9+ when both bounding spans are quoted and the spans between them were counted directly; 0.6-0.8 when an oversized trace forced you to sample the interval and the distance is an estimate; below 0.5 does not belong in this analyst, because an unmeasurable cost is not a finding. Keep the recommended action a short imperative; the improvement analyst expands it.\n\nIf every error in this dataset was recovered on the next span, return an empty findings array. That is the correct answer for a dataset whose failures were all cheap. Do not backfill it with the counts listed above and do not pad it with speculation.`\n\nexport const FAILURE_MODE_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'failure-mode',\n  description:\n    'Ranks failures by the work each one burned — spans, model calls, and wall-clock between the error and the span where the agent resumed — and treats a failure that reached a human as the most expensive class.',\n  area: 'failure-mode',\n  version: '2.0.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'all',\n  // Pricing one failure costs a bounded trace read plus a span-pair read,\n  // where counting cost a single overview call; the read budget is sized for\n  // that walk, not for the recount it replaces.\n  limits: { maxLlmCalls: 8, maxIterations: 24, maxToolCalls: 80 },\n  // The error span and the span that closed it. A cost claim that cannot cite\n  // both was never measured.\n  minimumEvidenceCitations: 2,\n}\n","/**\n * Improvement analyst — actionable self-improvement findings.\n *\n * Brief: read findings from upstream analysts (failure-mode,\n * knowledge-gap, knowledge-poisoning) AND the trace dataset itself,\n * then propose **concrete edits** to the agent's runtime: prompt\n * additions, RAG documents to ingest, tool descriptions to rewrite,\n * scaffolding changes to make, memory entries to invalidate. Each\n * finding is one proposed edit with the locus, the diff, and the\n * expected effect.\n *\n * This is the self-improvement loop's last mile: the prior\n * kinds describe *what's wrong*; this kind describes *what to change*.\n *\n * Eight bounded model subqueries let the actor compare competing fix\n * directions over the same cited evidence before recommending one.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('improvement')\n\nconst ACTOR_PROMPT = `You are a self-improvement analyst. Your job is to propose **concrete, locus-named edits** the agent's runtime should adopt to fix the failure modes, knowledge gaps, and poisonings present in this dataset.\n\nUpstream analysts have already classified the problems. Your job is to convert each problem into a *change to make* and grade its expected leverage. Each finding is one proposed edit.\n\n${subjectGrammar}\n\nDISCOVERY → CANDIDATE-FIXES → COMPETE → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Note the agents, tools, and any system-prompt fingerprints (look for the prompt text echoed in early spans).\n2. For each high-severity failure pattern, generate 2-3 candidate fixes. Real candidate axes:\n   - **System-prompt edit** — add an instruction, remove a misleading one, restructure precedence\n   - **Tool description edit** — rewrite a tool's description so the agent picks it correctly / passes valid args\n   - **New tool** — add a tool the agent kept emulating in code\n   - **RAG ingestion** — add a document or correct a stale one\n   - **Memory invalidation** — clear cached prior-run decisions that no longer apply\n   - **Scaffolding** — add a precondition check, a retry policy, a turn budget, a verification step\n   - **Output schema** — narrow the agent's output to forbid the failure shape\n   - **Skill / MCP / hook / subagent** — change the reusable profile component responsible for the behavior\n   - **Workflow / rollout policy** — change orchestration, budget, sampling, or stopping behavior\n   - **Code** — change an implementation path when profile edits cannot repair the behavior\n3. **Compare candidate fixes with bounded subqueries.** Load the representative failure excerpts, then send one \\`llm_query\\` per candidate-fix axis the same evidence. Ask for likely effect, side effects, and implementation scope. Subqueries cannot call trace tools; trace ids alone are insufficient context.\n4. After the comparisons return, **pick the winning candidate per cluster** based on expected effect and risk, then emit ONE finding. Keep the alternatives and rejection reasons in the rationale so the recommendation is auditable.\n5. **Cross-reference upstream findings.** Cite prior failure-mode or knowledge-gap findings as \\`finding://<prior-finding-id>\\`. This builds the dependency graph that lets the dashboard show \"fix #X resolves failure modes A, B, C.\"\n\nFor each winning recommendation, emit ONE finding. Use one exact locus from the subject grammar and state the edit in one sentence. Match leverage to the source failure's severity; use medium for quality-of-life changes and info for cleanup with no behavioral effect. Cite the targeted \\`finding://<id>\\` when available and the most representative span when useful. Quote the problem being fixed. Use confidence 0.85+ for a mechanical fix to a well-evidenced failure, 0.6-0.8 when judgment is required, and <0.5 for speculation. Explain in at most two sentences why this candidate beat its alternatives. The recommended action must be the literal diff, quoted replacement, tool description, or setting change.\n\nIf no upstream failure findings exist in this run, derive your own from the trace dataset using the failure-mode protocol inline (\\`searchTrace\\` for STATUS_CODE_ERROR / MaxTurnsExceeded / etc.). Prefer upstream findings when present because the analysts are designed to chain.\n\nDo NOT propose a fix you cannot defend with evidence. \"Tighten the prompt\" is not a finding; \"Add 'When the user asks for X, always Y' to the system prompt section \"request-classification\"\" is.`\n\nexport const IMPROVEMENT_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'improvement',\n  description:\n    'Converts upstream failure / gap / poisoning findings into concrete locus-named edits (prompt, tool-doc, RAG, scaffolding) with leverage grades.',\n  area: 'improvement',\n  version: '1.2.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'all',\n  limits: {\n    maxLlmCalls: 8,\n    maxIterations: 30,\n    maxToolCalls: 80,\n    maxOutputChars: 12_000,\n  },\n}\n","/**\n * Intent-divergence analyst — was the agent doing what the user asked,\n * and how early was the drift knowable?\n *\n * Brief: unlike every other kind, this one has free ground truth sitting\n * in the trace. A corrective human turn (\"no, I meant…\", \"stop doing X\",\n * \"why are you still asking\") is an *observed, labelled* divergence\n * event — the user themself marked the moment the agent was off target.\n * The analyst takes that label and works BACKWARD to the earliest\n * assistant turn where the divergence was already detectable, names the\n * signal in the user's stated intent that turn contradicted, and counts\n * the turns burned in between.\n *\n * \"The user corrected the agent\" is counting, and the deterministic\n * behavioral pass already counts it. The finding this kind owes is the\n * backward-looking one: at turn N the agent did X against stated intent\n * Y, the user corrected at turn N+K, so K turns were burned. A finding\n * with no earliest-detectable turn and no burned-turn count carries no\n * cost estimate and no place to put the fix, so it is not emitted.\n *\n * Second locus: turns where the *user's own* request was ambiguous or\n * self-contradictory, evidenced by the user later clarifying rather than\n * correcting. Nothing misbehaved there — the fix is a clarifying-question\n * policy that spends one turn up front instead of K turns of rework, so\n * those findings target `scaffolding:*` rather than the agent's\n * instructions.\n *\n * Six bounded model subqueries let the actor test competing\n * earliest-detectable anchors against the same loaded turn excerpts.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('intent-divergence')\n\nconst ACTOR_PROMPT = `You are an intent-divergence analyst for an OTLP trace dataset. Your job is to find where the agent stopped doing what the user asked, and to establish **how early that was knowable**.\n\nThis dataset carries ground truth the other analysts do not have. When a human turn corrects the agent — \"no, I meant…\", \"stop doing X\", \"why are you still asking\" — the user has labelled a divergence for you. That label marks the END of the divergence, not its start. Your finding is the start: the earliest assistant turn already off-intent, the signal in the user's stated intent it contradicted, and the number of turns burned before the correction landed.\n\n${subjectGrammar}\n\nDISCOVERY → BACKTRACK → QUANTIFY → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Note the agent names and \\`sample_trace_ids\\`; conversational datasets carry several human turns per trace and those are the ones worth pulling.\n2. **DISCOVERY — find the corrective human turns.** Use \\`searchTrace\\` for user-authored corrections:\n   Every pattern MUST begin with \\`(?i)\\`. The trace store compiles a search pattern case-sensitively unless it opens with that flag, and corrections are overwhelmingly sentence-initial and capitalised (\"Stop\", \"No,\", \"I said\"), so a lowercase pattern silently returns zero hits.\n   - Imperative stops: \\`(?i)\\\\bstop\\\\b\\`, \\`(?i)\\\\b(don'?t|do not)\\\\b\\`, \\`(?i)^\\\\s*no[,.!]\\`, \\`(?i)\\\\bnot what I (wanted|asked|meant)\\\\b\\`, \\`(?i)\\\\bthat'?s not what\\\\b\\`, \\`(?i)\\\\brevert\\\\b\\`, \\`(?i)\\\\bstart over\\\\b\\`\n   - Repetition and frustration: \\`(?i)\\\\bI (said|asked|told you)\\\\b\\`, \\`(?i)\\\\balready told you\\\\b\\`, \\`(?i)\\\\bwhy are you (still )?\\\\w+ing\\\\b\\`, \\`(?i)\\\\bjust (do|use|write|make)\\\\b\\`, \\`(?i)\\\\bagain\\\\b\\`\n   - Clarification markers (second-order, see step 6): \\`(?i)\\\\bI mean(t)?\\\\b\\`, \\`(?i)\\\\bto be clear\\\\b\\`, \\`(?i)\\\\bactually,? I (want|need)\\\\b\\`, \\`(?i)\\\\bwhat I meant\\\\b\\`, \\`(?i)\\\\blet me rephrase\\\\b\\`\n   Attribute every match to a role before using it. The same phrases inside an assistant turn are hedging, not correction.\n3. **BACKTRACK — walk the trace backward from the correction.** Read the ordered turns preceding it with \\`viewTrace\\` / \\`viewSpans\\`. Locate the user's ORIGINAL statement of intent (usually the first human turn, sometimes a constraint added mid-run), then locate the FIRST assistant turn that contradicts it. That turn, not the correction, anchors the finding. Name the concrete signal already available at that turn: an explicit constraint the agent violated, a scope it exceeded, a different question it answered, a file or target the user never named, a decision the user had already made.\n4. **QUANTIFY — count the burned turns.** K = (index of the corrective human turn) − (index of the earliest detectable assistant turn). Report both indices and K. If you cannot locate an earliest-detectable turn, you have a correction and not a divergence: drop it.\n5. **CLUSTER.** Repeated corrections about the same misread intent are ONE finding citing all of them, not one finding per corrective turn. Corrections about genuinely different intents in the same trace are separate findings.\n6. **Second-order — the request itself was ambiguous.** When the user CLARIFIES rather than corrects (\"I mean the staging config, not prod\"), the agent's reading was defensible and the request was underspecified or self-contradictory. Emit those against a \\`scaffolding:*\\` locus — a clarifying-question policy or a plan checkpoint — because the fix is one sharp question before acting, priced against the K turns the ambiguity cost. Do not charge the agent's instructions for a request that could not be resolved from its own text.\n\n**Test competing anchors with subqueries.** After the backward walk, load the excerpts for the original intent turn, your candidate earliest-detectable turn, and the turn before it. Send one bounded \\`llm_query\\` per candidate anchor asking whether the divergence is already present in that turn's text alone. Subqueries cannot call trace tools, and a turn index alone is insufficient context. Take the EARLIEST candidate the loaded excerpts support.\n\nFor each cluster, emit ONE finding. Use an exact locus from the subject grammar — the surface whose edit prevents the divergence, not the surface where it surfaced. State the claim in the shape \"turn N did X against stated intent Y; user corrected at turn N+K, burning K turns.\" Rate it critical when the divergence produced a user-visible or irreversible action, high when K is 3 or more or the run ended without the intent satisfied, medium for one or two burned turns, and low for a cosmetic correction. Cite BOTH spans with exact quotes: the earliest-detectable assistant turn and the corrective human turn. Use confidence 0.85+ when the stated intent and the diverging turn are both quotable and the contradiction is explicit, and 0.6-0.8 when the earliest-detectable turn is inferred from surrounding context. The recommended action must be the literal instruction, question, or checkpoint to add.\n\nDo NOT report a divergence the agent noticed and reversed inside the same turn — that is self-correction and it cost the user nothing. Do NOT report a human turn that adds NEW scope; a changed mind is not a divergence. If the dataset holds no corrective or clarifying human turns, return an empty findings array instead of grading tone.`\n\nexport const INTENT_DIVERGENCE_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'intent-divergence',\n  description:\n    'Anchors each corrective human turn to the earliest assistant turn where the divergence from stated intent was already detectable, and prices it in burned turns.',\n  area: 'intent-divergence',\n  version: '1.0.0',\n  instructions: ACTOR_PROMPT,\n  // Backtracking reads the ordered turns BEFORE the correction, so the\n  // search-only group cannot serve this kind: discovery finds the label,\n  // viewTrace / viewSpans find the anchor.\n  toolGroup: 'all',\n  limits: { maxLlmCalls: 6, maxIterations: 22, maxToolCalls: 64 },\n  // Both ends of the divergence must be quoted — the anchor turn alone is an\n  // unlabelled guess, the corrective turn alone is the counting the\n  // deterministic pass already does.\n  minimumEvidenceCitations: 2,\n}\n","/**\n * Knowledge-gap analyst — what did the agent NOT know that it needed?\n *\n * Brief: find moments in the trace where the agent had to guess, ask\n * the user to fill in context, recover from a wrong assumption, or\n * loop on a retrieval. Each finding names a *missing or outdated piece\n * of knowledge* the agent's curated knowledge base should have held —\n * or a downstream lookup (web, docs, tool description) that surfaced\n * stale or outdated information.\n *\n * The primary expected store is `@tangle-network/agent-knowledge`: a\n * Karpathy-style wiki the agent maintains with raw ↔ curated pages,\n * source anchors, and claim/relation triples. A gap is anything the\n * agent had to discover at run-time that should already have lived\n * there. Secondary loci: web-search results that returned outdated\n * pages, tool descriptions that omitted critical behavior, system-\n * prompt sections that didn't cover the case.\n *\n * Distinct from failure-mode: failure-mode classifies *how* it broke;\n * knowledge-gap names the *information* whose absence (or staleness)\n * caused the break. One failure-mode often maps to several gaps.\n *\n * Five bounded model subqueries let the actor compare candidate gaps\n * across source layers after it has loaded the relevant excerpts.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('knowledge-gap')\n\nconst ACTOR_PROMPT = `You are a knowledge-gap analyst for an OTLP trace dataset. Your job is to identify the **specific pieces of information the agent lacked, or that were stale**, that caused poor decisions.\n\nThe agent under analysis maintains a curated knowledge base via \\`@tangle-network/agent-knowledge\\` — a wiki of \\`KnowledgePage\\`s with raw source anchors, claims, and relations. The primary expected store of agent-knowable facts IS that wiki. A \"knowledge gap\" is anything the agent had to discover or guess at run-time that the wiki should have held — or an outdated/contradictory fact the agent picked up from a non-wiki source.\n\n${subjectGrammar}\n\nDISCOVERY → ATTRIBUTE-TO-LAYER → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Note which agents, tools, and models appear.\n2. Pull traces where the agent shows gap signals. The strongest signals are:\n   - Self-correction turns (\"I assumed X but…\", \"let me re-check\", \"actually,\")\n   - Clarifying-question turns where the agent asked the user something the runtime should have surfaced\n   - Repeated retrieval / lookup calls for the same artifact with slightly varied queries\n   - Tool errors that name a missing argument or unknown resource\n   - Web-search calls returning pages dated before a known cutoff for content that changes (versioned APIs, schemas, policies)\n   - Agent quoting a tool's docs / system prompt incorrectly because the actual text was insufficient\n   - Fabricated identifiers that don't appear in dataset \\`sample_trace_ids\\`\n   Use \\`searchTrace\\` with patterns like \\`I (don.?t|do not) know\\`, \\`assumed\\`, \\`unclear\\`, \\`could you (clarify|tell me|provide)\\`, \\`not found\\`, \\`undefined\\`, \\`unknown\\`, \\`null\\`, dates older than the analysis window, or the agent's specific clarification phrases.\n3. For each gap, identify the **layer of the runtime that should have prevented it** and use its exact locus from the subject grammar above.\n4. For each defensible gap, emit ONE finding. Use an exact locus from the subject grammar and name the missing or stale knowledge (for example, \"wiki has no page on invoice line-item shape; agent re-derived it from raw spans\"). Rate it high when it caused failure or a clarifying question, medium for unnecessary turns, and low for minor inefficiency. Cite the span where the question, correction, retrieval miss, or stale result surfaced and quote it exactly. Use confidence 0.85+ when the agent articulated the gap and 0.6-0.8 when inferred. Recommend a concrete wiki edit for an agent-knowledge locus or a prompt/tool-description edit otherwise.\n\n**Compare layers over loaded evidence.** After the first scan, load the exact excerpts behind candidates across \\`agent-knowledge:*\\`, \\`websearch:outdated\\`, \\`tool-doc:*\\`, \\`system-prompt:*\\`, and \\`memory:*\\`. Use one bounded \\`llm_query\\` per layer to classify those excerpts. Subqueries cannot call trace tools. Merge their classifications into the final finding set only when the source excerpts support them.\n\nDo NOT report a gap that the agent later recovered from cleanly within the same turn. That is resilience, not a gap. Cite the non-recovery version when both exist.`\n\nexport const KNOWLEDGE_GAP_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'knowledge-gap',\n  description:\n    'Identifies missing or stale pieces of knowledge — primarily against the agent-knowledge wiki — and attributes each to the runtime layer (wiki page, claim, raw source, websearch, tool-doc, system-prompt, memory) that should have held it.',\n  area: 'knowledge-gap',\n  version: '1.2.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'discoveryAndSearch',\n  limits: { maxLlmCalls: 5, maxIterations: 18, maxToolCalls: 48 },\n}\n","/**\n * Knowledge-poisoning analyst — what FALSE information misled the agent?\n *\n * Brief: find moments where the agent acted on information that was\n * *wrong* — stale memory, RAG documents that contradicted ground truth,\n * tool descriptions that lied about return shapes, system-prompt\n * instructions that no longer matched reality, prior-run summaries that\n * cached a wrong decision.\n *\n * Distinct from knowledge-gap: a gap is \"the agent didn't know X\"; a\n * poisoning is \"the agent confidently used X, but X was wrong.\" Gaps\n * surface as questions / self-correction; poisonings surface as\n * confident-but-wrong actions that downstream evidence contradicts.\n *\n * Eight bounded model subqueries let the actor independently assess\n * the action and contradiction excerpts for candidate poisonings.\n */\n\nimport { findingSubjectGrammarPromptFor } from '../finding-subject'\nimport type { TraceAnalystDefinition } from '../kind-factory'\n\nconst subjectGrammar = findingSubjectGrammarPromptFor('knowledge-poisoning')\n\nconst ACTOR_PROMPT = `You are a knowledge-poisoning analyst for an OTLP trace dataset. Your job is to identify cases where the agent **confidently used wrong information** — not where it lacked information (that's the knowledge-gap analyst).\n\n${subjectGrammar}\n\nDISCOVERY → DUAL-VERIFY → CITE protocol:\n\n1. \\`getDatasetOverview({})\\` first. Identify the agents, models, and tools.\n2. Pull traces where the agent's confident action was later contradicted. Strongest signals:\n   - Agent stated a fact in one span; a later span surfaced contradictory evidence; the agent then proceeded anyway or fabricated reconciliation.\n   - Tool call with stale arguments (an id that no longer exists, an API shape that changed).\n   - Agent cited an \\`agent-knowledge\\` wiki page or claim whose content contradicts the trace's own evidence — the wiki itself drifted.\n   - Web-search result the agent cited that returned an outdated page; agent treated it as canonical.\n   - System-prompt instruction the agent followed that ground-truth evidence in the trace contradicts (e.g. prompt says \"use endpoint A\"; tool reply says \"endpoint A deprecated, use B\").\n   - Repeated wrong-shape parsing despite the tool's actual output proving the shape.\n3. Use \\`searchTrace\\` with regex on phrases like \\`actually\\`, \\`turns out\\`, \\`previously assumed\\`, \\`old version\\`, \\`deprecated\\`, \\`updated to\\`, \\`now uses\\`, or specific entity names you suspect have changed.\n4. For each candidate poisoning, **DUAL-VERIFY**:\n   - Confirm the agent actually acted on the false belief (cite the span where it did)\n   - Confirm the belief is actually false in this trace's own evidence (cite the span that contradicts it)\n   Only emit a finding when both halves are supported. If you can only support one, drop it because single-evidence poisoning findings are too speculative to be useful.\n\n**Independently assess both halves.** Load the action excerpt and contradicting excerpt yourself, then send bounded \\`llm_query\\` calls the exact evidence for \"did the agent act?\" and \"does the trace contradict the belief?\" Subqueries cannot call trace tools. Accept a poisoning only when both assessments and the source excerpts support it.\n\nFor each confirmed poisoning, emit ONE finding. Use the source of the false belief as the exact subject. State \"agent believed X (from source S); trace evidence shows X is false.\" Rate it critical for a wrong user-visible action, high when caught internally after significant waste, and medium for inefficiency. Cite BOTH the action span and the contradicting span with exact quotes. Use confidence 0.85+ when both halves have exact quotes and 0.6-0.8 when one half is inferred. Recommend the literal source correction: update the wiki claim, invalidate and re-curate the raw source, or replace the stale prompt/tool instruction.\n\nDo NOT report a finding if the agent caught and corrected the false belief in the same turn. Reserve poisoning for cases where the false belief shaped downstream action.`\n\nexport const KNOWLEDGE_POISONING_KIND_SPEC: TraceAnalystDefinition = {\n  id: 'knowledge-poisoning',\n  description:\n    'Identifies confident-but-wrong actions caused by stale memory, contradicting RAG, deprecated tool docs, or outdated system-prompt instructions.',\n  area: 'knowledge-poisoning',\n  version: '1.2.0',\n  instructions: ACTOR_PROMPT,\n  toolGroup: 'all',\n  limits: { maxLlmCalls: 8, maxIterations: 20, maxToolCalls: 64 },\n  minimumEvidenceCitations: 2,\n}\n","/**\n * Default analyst kinds focused on agent failure + recursive\n * self-improvement.\n *\n * The five kinds chain. Two independent classifiers partition the\n * outcome surface: failure-mode names how a run broke, intent-divergence\n * names where it drifted from what the user asked and how many turns\n * that cost. Knowledge-gap and knowledge-poisoning then explain *why* in\n * two orthogonal ways — missing information versus false information.\n * Improvement proposes the concrete edits. Register all five against the\n * same trace store in this order and run the registry with\n * `chainFindings: true` to pass each completed kind's findings to the\n * kinds that follow it.\n */\n\nexport {\n  CONTROL_INTEGRITY_ANALYST,\n  ControlIntegrityAnalyst,\n  emitControlIntegrityFindings,\n} from './control-integrity'\nexport { FAILURE_MODE_KIND_SPEC } from './failure-mode'\nexport { IMPROVEMENT_KIND_SPEC } from './improvement'\nexport { INTENT_DIVERGENCE_KIND_SPEC } from './intent-divergence'\nexport { KNOWLEDGE_GAP_KIND_SPEC } from './knowledge-gap'\nexport { KNOWLEDGE_POISONING_KIND_SPEC } from './knowledge-poisoning'\n\nimport type { TraceAnalystDefinition } from '../kind-factory'\nimport { FAILURE_MODE_KIND_SPEC } from './failure-mode'\nimport { IMPROVEMENT_KIND_SPEC } from './improvement'\nimport { INTENT_DIVERGENCE_KIND_SPEC } from './intent-divergence'\nimport { KNOWLEDGE_GAP_KIND_SPEC } from './knowledge-gap'\nimport { KNOWLEDGE_POISONING_KIND_SPEC } from './knowledge-poisoning'\n\n/**\n * The default kind suite. Order is the run order operators should use:\n * failure-mode and intent-divergence first (neither reads upstream\n * findings), gap + poisoning next (both explain the problems those two\n * found), improvement last (chains all four). Intent-divergence sits\n * ahead of improvement deliberately — a proposed edit should be able to\n * act on a priced divergence, and it is the only kind whose findings\n * carry a burned-turn cost to rank against.\n */\nexport const DEFAULT_TRACE_ANALYST_KINDS: readonly TraceAnalystDefinition[] = [\n  FAILURE_MODE_KIND_SPEC,\n  INTENT_DIVERGENCE_KIND_SPEC,\n  KNOWLEDGE_GAP_KIND_SPEC,\n  KNOWLEDGE_POISONING_KIND_SPEC,\n  IMPROVEMENT_KIND_SPEC,\n] as const\n","/**\n * AnalystRegistry — orchestrate N analysts against one run.\n *\n * Owns three responsibilities and only three:\n *   1. Registration — ids must be unique; bad registrations fail loudly\n *      at register-time, not run-time.\n *   2. Routing — each analyst declares its `inputKind`; the registry\n *      picks the matching field from AnalystRunInputs and skips the\n *      analyst with a logged reason if it's missing.\n *   3. Isolation — one analyst's exception MUST NOT stop other analysts.\n *      Failed analysts produce zero findings + a 'failed' summary row.\n *\n * Cross-cutting concerns (telemetry, error → finding conversion, cost\n * ingestion, storage rotation) live in `AnalystHooks`. Budget shaping\n * (equal split vs weighted vs custom) lives in `BudgetPolicy`. Both\n * have sensible defaults; consumers override only what they need.\n */\n\nimport { randomUUID } from 'node:crypto'\nimport { z } from 'zod'\nimport { combineAbortSignals } from '../abort-signal'\nimport type { CostLedgerHandle } from '../cost-ledger'\nimport {\n  snapshotAnalystFindings,\n  snapshotExactAnalystRunReceipt,\n} from '../feedback-trajectory-review'\nimport { canonicalString, hashCanonical } from '../ledger-core/canonical'\nimport { deepFreezeCanonicalJson } from '../ledger-core/deep-freeze'\nimport type { RunCostProvenance, RunTokenUsage } from '../run-record'\nimport type { ChatClient } from './chat-client'\nimport type {\n  ExactAnalystExecutionPlanSnapshot,\n  ExactAnalystRunEvent,\n  ExactAnalystRunResult,\n  ExactCapableAnalyst,\n  ExactExecutionComponentIdentity,\n  ExactExecutionComponentSnapshot,\n} from './exact-types'\nimport { snapshotExactExecutionComponentIdentity, snapshotExactExecutionPlan } from './exact-types'\nimport type {\n  Analyst,\n  AnalystContext,\n  AnalystFinding,\n  AnalystRunEvent,\n  AnalystRunInputs,\n  AnalystRunResult,\n  AnalystRunSummary,\n  AnalystUsageReceipt,\n} from './types'\nimport { assertValidAnalystUsageReceipt, validateUsageSettlementTimeout } from './usage-receipt'\n\n// ── Hook + policy surfaces ─────────────────────────────────────────\n\nexport interface AnalystHooks {\n  /** Legacy runs may mutate ctx; exact runs provide a frozen observational context. */\n  onBeforeAnalyze?(args: {\n    analyst: Analyst\n    ctx: AnalystContext\n    runId: string\n  }): void | Promise<void>\n  /** After every analyst (ok | failed | skipped). Use for telemetry, ingestion, rotation. */\n  onAfterAnalyze?(args: {\n    analyst: Analyst\n    summary: AnalystRunSummary\n    findings: AnalystFinding[]\n    runId: string\n  }): void | Promise<void>\n  /**\n   * On analyst exception. Hook MAY return findings to convert the\n   * error into structured findings; the summary still reports 'failed'.\n   * Return void to keep the default empty-findings behavior.\n   */\n  onError?(args: {\n    analyst: Analyst\n    error: Error\n    runId: string\n  }): AnalystFinding[] | undefined | Promise<AnalystFinding[] | undefined>\n  /** Once after registry.run() completes. Use for final aggregation, persistence. */\n  onComplete?(args: { result: AnalystRunResult }): void | Promise<void>\n}\n\nexport interface BudgetPolicy {\n  /** Overall USD cap across the registry.run(). */\n  totalUsd?: number\n  /** Per-analyst weight for the default allocator. Missing ids get weight 1. */\n  weights?: Record<string, number>\n  /**\n   * Custom allocator — receives the analyst, remaining/total budget, and\n   * the count of analysts that will run. Returns the per-analyst budget\n   * (or undefined only when the run has no overall cap). Overrides weights\n   * when set.\n   */\n  allocate?: (args: {\n    analyst: Analyst\n    totalUsd: number | undefined\n    remainingUsd: number | undefined\n    runningCount: number\n  }) => number | undefined\n}\n\nexport interface AnalystRegistryOptions {\n  /** Shared chat client passed to every LLM analyst via AnalystContext. */\n  chat?: ChatClient\n  /** Logger callback. Defaults to a no-op. */\n  log?: (msg: string, fields?: Record<string, unknown>) => void\n  /** Hooks invoked around analyze() — observability + customization seam. */\n  hooks?: AnalystHooks\n  /** Required identity/config when `runExact` applies `hooks`. */\n  hooksIdentity?: ExactExecutionComponentIdentity\n  /** Default budget when run() doesn't override. */\n  defaultBudget?: BudgetPolicy\n  /** Required identity/config when `runExact` provides `chat`. */\n  chatIdentity?: ExactExecutionComponentIdentity\n}\n\nexport interface RegistryRunOpts {\n  /** Restrict to a subset of registered analysts by id. */\n  only?: string[]\n  /** Skip these analysts even if registered. Useful for cheap iteration. */\n  skip?: string[]\n  /** Budget policy — totalUsd + optional weights/allocator. Falls back to options.defaultBudget. */\n  budget?: BudgetPolicy\n  /** Active-work cap for the complete registry run. Model receipt settlement may follow. */\n  timeoutMs?: number\n  /** Abort signal — forwarded into every analyst's context. */\n  signal?: AbortSignal\n  /** Shared paid-call account forwarded to every analyst. */\n  costLedger?: CostLedgerHandle\n  /** Attribution phase for calls written to `costLedger`. */\n  costPhase?: string\n  /** Tags echoed into AnalystContext.tags — useful for tracking environment/version in findings. */\n  tags?: Record<string, string>\n  /**\n   * Prior-run findings made available as retrieval context to every\n   * analyst via `ctx.priorFindings`. The registry forwards the slice\n   * whose `analyst_id` matches each registered analyst so a kind sees\n   * only its own history. Pass `{ '*': findings }` to broadcast to\n   * every analyst (useful when several kinds share the same historical\n   * context). For findings from this run, use `chainFindings` instead.\n   */\n  priorFindings?: ReadonlyArray<AnalystFinding> | Record<string, ReadonlyArray<AnalystFinding>>\n  /**\n   * Pass findings produced earlier in this registry run to each later analyst\n   * via `ctx.upstreamFindings`. Registration order is dependency order.\n   * Disabled by default because independent analyst suites must opt in.\n   */\n  chainFindings?: boolean\n}\n\n/** A caller-selected allocation rule for an exact analyst run. */\nexport type ExactAnalystBudgetPolicy =\n  | {\n      readonly kind: 'equal'\n      readonly totalUsd: number\n    }\n  | {\n      readonly kind: 'weighted'\n      readonly totalUsd: number\n      /** One explicit weight for every selected analyst id. */\n      readonly weights: Readonly<Record<string, number>>\n    }\n\n/**\n * Complete per-run analyst policy.\n *\n * Every field is required. `null` explicitly disables an optional resource or context channel.\n * `analystIds` is execution order; it is not filtered through registry insertion order.\n * Missing-input behavior is explicit so callers cannot accidentally inherit it by omission.\n * Exact runs are serial; more elaborate scheduling belongs in the caller's runtime.\n */\nexport interface ExactRegistryRunOpts {\n  readonly analystIds: readonly string[]\n  readonly budget: ExactAnalystBudgetPolicy | null\n  readonly totalTimeoutMs: number | null\n  readonly signal: AbortSignal | null\n  readonly costLedger: CostLedgerHandle | null\n  readonly costLedgerIdentity: ExactExecutionComponentIdentity | null\n  readonly costPhase: string | null\n  readonly tags: Readonly<Record<string, string>> | null\n  readonly priorFindings:\n    | ReadonlyArray<AnalystFinding>\n    | Readonly<Record<string, ReadonlyArray<AnalystFinding>>>\n    | null\n  readonly chainFindings: boolean\n  readonly missingInputMode: 'skip' | 'abort'\n  readonly applyRegistryHooks: boolean\n  readonly useRegistryChat: boolean\n}\n\ntype NormalizedBudgetPlan =\n  | { readonly kind: 'none' }\n  | { readonly kind: 'dynamic'; readonly policy: BudgetPolicy }\n\ninterface PreparedAnalyst {\n  readonly analyst: Analyst\n  readonly input:\n    | { readonly kind: 'present'; readonly value: unknown }\n    | { readonly kind: 'missing' }\n}\n\ninterface AnalystExecutionPlan {\n  readonly runId: string\n  readonly prepared: readonly PreparedAnalyst[]\n  readonly budget: NormalizedBudgetPlan\n  readonly totalTimeoutMs: number | null\n  readonly signal: AbortSignal | null\n  readonly costLedger: CostLedgerHandle | null\n  readonly costPhase: string | null\n  readonly tags: Readonly<Record<string, string>> | null\n  readonly priorFindings:\n    | ReadonlyArray<AnalystFinding>\n    | Readonly<Record<string, ReadonlyArray<AnalystFinding>>>\n    | null\n  readonly chainFindings: boolean\n  readonly hooks: AnalystHooks\n  readonly chat: ChatClient | undefined\n  readonly log: (msg: string, fields?: Record<string, unknown>) => void\n  readonly executionSnapshot: ExactAnalystExecutionPlanSnapshot | undefined\n}\n\ntype InternalAnalystRunEvent = AnalystRunEvent\n\n/** A post-start exact-run failure; completed work remains attached for accounting and review. */\nexport class ExactAnalystRunExecutionError extends Error {\n  readonly name: string = 'ExactAnalystRunExecutionError'\n  readonly result: ExactAnalystRunResult\n\n  constructor(message: string, result: ExactAnalystRunResult, options?: ErrorOptions) {\n    super(message, options)\n    const snapshot = snapshotExactAnalystRunReceipt(result, 'ExactAnalystRunExecutionError result')\n    if (snapshot.completion.status !== 'failed') {\n      throw new TypeError('ExactAnalystRunExecutionError result must be a failed receipt')\n    }\n    this.result = snapshot\n  }\n}\n\nexport class AnalystRegistry {\n  private readonly analysts = new Map<string, Analyst>()\n  private readonly options: AnalystRegistryOptions\n\n  constructor(options: AnalystRegistryOptions = {}) {\n    this.options = options\n  }\n\n  register(analyst: Analyst): void {\n    const id = analyst.id\n    const version = analyst.version\n    const cost = analyst.cost\n    if (!id) throw new Error('AnalystRegistry.register: analyst.id is required')\n    if (this.analysts.has(id)) {\n      throw new Error(`AnalystRegistry.register: duplicate analyst id \"${id}\"`)\n    }\n    if (!version) {\n      throw new Error(`AnalystRegistry.register: analyst \"${id}\" must declare a version`)\n    }\n    if (cost.kind === 'deterministic' && cost.settlement_timeout_ms !== undefined) {\n      throw new TypeError(\n        `AnalystRegistry.register: deterministic analyst \"${id}\" cannot declare settlement_timeout_ms`,\n      )\n    }\n    if (cost.settlement_timeout_ms !== undefined) {\n      validateUsageSettlementTimeout(cost.settlement_timeout_ms)\n    }\n    this.analysts.set(id, analyst)\n  }\n\n  list(): ReadonlyArray<{\n    id: string\n    description: string\n    version: string\n    cost: Analyst['cost']\n  }> {\n    return Array.from(this.analysts.values()).map((a) => ({\n      id: a.id,\n      description: a.description,\n      version: a.version,\n      cost: a.cost,\n    }))\n  }\n\n  async run(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: RegistryRunOpts = {},\n  ): Promise<AnalystRunResult> {\n    // Thin collector over `runStream`. Both surfaces share the same\n    // loop body so they cannot drift on isolation / hook order / cost.\n    for await (const ev of this.runStream(runId, inputs, runOpts)) {\n      if (ev.type === 'run-completed') return ev.result\n    }\n    throw new Error('AnalystRegistry.run: stream completed without run-completed event')\n  }\n\n  /** Run exactly the ordered analysts and complete policy supplied by the caller. */\n  async runExact(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: ExactRegistryRunOpts,\n  ): Promise<ExactAnalystRunResult> {\n    for await (const ev of this.runExactStream(runId, inputs, runOpts)) {\n      if (ev.type === 'run-completed') return ev.result\n    }\n    throw new Error('AnalystRegistry.runExact: stream completed without run-completed event')\n  }\n\n  /** Streaming counterpart to {@link runExact}. */\n  async *runExactStream(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: ExactRegistryRunOpts,\n  ): AsyncGenerator<ExactAnalystRunEvent, void, void> {\n    for await (const event of this.executePlanStream(\n      this.normalizeExactPlan(runId, inputs, runOpts),\n    )) {\n      yield event as ExactAnalystRunEvent\n    }\n  }\n\n  /**\n   * Streaming counterpart to `run()`. Emits `AnalystRunEvent` values\n   * in real time — `run-started`, then per-analyst `skipped` /\n   * `started` / `completed`, then a terminal `run-completed` whose\n   * payload is the full `AnalystRunResult`. UIs use this to render\n   * progress; persistence consumers use `run()` and read the result.\n   *\n   * Hooks (`onBeforeAnalyze` / `onAfterAnalyze` / `onError` /\n   * `onComplete`) fire as before — streaming is additive, not a hook\n   * replacement.\n   */\n  async *runStream(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: RegistryRunOpts = {},\n  ): AsyncGenerator<AnalystRunEvent, void, void> {\n    yield* this.executePlanStream(this.normalizeLegacyPlan(runId, inputs, runOpts))\n  }\n\n  private normalizeLegacyPlan(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: RegistryRunOpts,\n  ): AnalystExecutionPlan {\n    const timeoutMs = validateTimeout(runOpts.timeoutMs) ?? null\n    const budget = runOpts.budget ?? this.options.defaultBudget\n    validateBudgetPolicy(budget)\n    const selected = this.selectAnalysts(runOpts)\n    return {\n      runId,\n      prepared: selected.map((analyst) => ({\n        analyst,\n        input: this.routeInput(analyst, inputs),\n      })),\n      budget: budget ? { kind: 'dynamic', policy: budget } : { kind: 'none' },\n      totalTimeoutMs: timeoutMs,\n      signal: runOpts.signal ?? null,\n      costLedger: runOpts.costLedger ?? null,\n      costPhase: runOpts.costPhase ?? null,\n      tags: runOpts.tags ?? null,\n      priorFindings: runOpts.priorFindings ?? null,\n      chainFindings: runOpts.chainFindings ?? false,\n      hooks: this.options.hooks ?? {},\n      chat: this.options.chat,\n      log: this.options.log ?? (() => {}),\n      executionSnapshot: undefined,\n    }\n  }\n\n  private normalizeExactPlan(\n    runId: string,\n    inputs: AnalystRunInputs,\n    runOpts: ExactRegistryRunOpts,\n  ): AnalystExecutionPlan {\n    const exactRunId = snapshotExactRunId(runId)\n    const exact = snapshotExactRegistryRunOpts(runOpts)\n    const selected = normalizeExactAnalysts(this.selectExactAnalysts(exact.analystIds))\n    const registryChat = this.options.chat\n    const registryChatIdentity = this.options.chatIdentity\n    const registryHooks = this.options.hooks\n    const registryHooksIdentity = this.options.hooksIdentity\n    if (exact.useRegistryChat && registryChat === undefined) {\n      throw new TypeError(\n        'ExactRegistryRunOpts.useRegistryChat is true but the registry has no chat client',\n      )\n    }\n    if (exact.applyRegistryHooks && !hasRegistryHooks(registryHooks)) {\n      throw new TypeError(\n        'ExactRegistryRunOpts.applyRegistryHooks is true but the registry has no lifecycle hooks',\n      )\n    }\n    const inputSnapshot = snapshotAnalystRunInputChannels(inputs)\n    const prepared = selected.map((analyst) => ({\n      analyst,\n      input: this.routeInput(analyst, inputSnapshot),\n    }))\n    if (exact.missingInputMode === 'abort') {\n      const missing = prepared.find((candidate) => candidate.input.kind === 'missing')?.analyst\n      if (missing) {\n        throw new TypeError(\n          `ExactRegistryRunOpts.missingInputMode abort preflight found no \"${missing.inputKind}\" input for \"${missing.id}\"`,\n        )\n      }\n    }\n    const hooksIdentity =\n      exact.applyRegistryHooks && registryHooks\n        ? requireExactComponentIdentity(registryHooksIdentity, 'registry hooks')\n        : null\n    const chatIdentity = exact.useRegistryChat\n      ? requireExactComponentIdentity(registryChatIdentity, 'registry chat')\n      : null\n    const costLedgerIdentity =\n      exact.costLedger === null\n        ? null\n        : requireExactComponentIdentity(exact.costLedgerIdentity ?? undefined, 'cost ledger')\n    const allocations = exactFixedBudgets(\n      exact.budget,\n      prepared\n        .filter(\n          (\n            candidate,\n          ): candidate is {\n            analyst: ExactCapableAnalyst\n            input: { kind: 'present'; value: unknown }\n          } => candidate.input.kind === 'present',\n        )\n        .map((candidate) => candidate.analyst),\n      selected,\n    )\n    const executionSnapshot = exactExecutionSnapshot(\n      selected,\n      exact,\n      allocations,\n      costLedgerIdentity,\n      hooksIdentity,\n      chatIdentity,\n    )\n    return {\n      runId: exactRunId,\n      prepared,\n      budget: { kind: 'none' },\n      totalTimeoutMs: exact.totalTimeoutMs,\n      signal: exact.signal,\n      costLedger: exact.costLedger,\n      costPhase: exact.costPhase,\n      tags: exact.tags,\n      priorFindings: exact.priorFindings,\n      chainFindings: exact.chainFindings,\n      hooks: exact.applyRegistryHooks && registryHooks ? snapshotHooks(registryHooks) : {},\n      chat: exact.useRegistryChat && registryChat ? snapshotChat(registryChat) : undefined,\n      // Exact runs expose live events and versioned hooks. An inherited logger is intentionally\n      // excluded because an anonymous callback can throw, block, or mutate shared state.\n      log: () => {},\n      executionSnapshot,\n    }\n  }\n\n  private async *executePlanStream(\n    plan: AnalystExecutionPlan,\n  ): AsyncGenerator<InternalAnalystRunEvent, void, void> {\n    const exact = plan.executionSnapshot !== undefined\n    if (exact && plan.signal?.aborted) throw abortReason(plan.signal)\n\n    const correlationId = `ar_${randomUUID().slice(0, 12)}`\n    const log = plan.log\n    const startedAt = new Date().toISOString()\n    const started = Date.now()\n    const timeoutSignal =\n      plan.totalTimeoutMs === null ? undefined : AbortSignal.timeout(plan.totalTimeoutMs)\n    const runSignal = combineAbortSignals(plan.signal ?? undefined, timeoutSignal)\n    const deadlineMs = plan.totalTimeoutMs === null ? undefined : started + plan.totalTimeoutMs\n    const runnable = plan.prepared\n      .filter(\n        (\n          candidate,\n        ): candidate is {\n          analyst: Analyst\n          input: { kind: 'present'; value: unknown }\n        } => candidate.input.kind === 'present',\n      )\n      .map((candidate) => candidate.analyst)\n    let remainingUsd = plan.budget.kind === 'dynamic' ? plan.budget.policy.totalUsd : undefined\n    const weights = plan.budget.kind === 'dynamic' ? plan.budget.policy.weights : undefined\n    const totalWeight =\n      weights &&\n      plan.budget.kind === 'dynamic' &&\n      plan.budget.policy.totalUsd != null &&\n      !plan.budget.policy.allocate &&\n      runnable.length > 0\n        ? runnable.reduce((sum, analyst) => sum + analystWeight(weights, analyst.id), 0)\n        : undefined\n    if (totalWeight === 0) {\n      throw new Error('BudgetPolicy.weights must allocate positive weight to a runnable analyst')\n    }\n    const upstreamFindings: AnalystFinding[] = []\n\n    yield snapshotExecutionEvent(\n      {\n        type: 'run-started',\n        run_id: plan.runId,\n        correlation_id: correlationId,\n        started_at: startedAt,\n        analyst_ids: plan.prepared.map(({ analyst }) => analyst.id),\n        ...(plan.executionSnapshot === undefined ? {} : { execution_plan: plan.executionSnapshot }),\n      },\n      exact,\n    )\n\n    const executions: AnalystExecution[] = []\n    let executionFailure: unknown\n\n    for (const { analyst, input } of plan.prepared) {\n      const t0 = Date.now()\n      if (runSignal?.aborted) {\n        const summary = abortedBeforeStartSummary(analyst, runSignal)\n        executions.push({ summary, findings: [], budgetDebitUsd: 0 })\n        log(`[analyst] skip ${analyst.id} — run aborted`, {\n          runId: plan.runId,\n          reason: summary.reason,\n        })\n        yield snapshotExecutionEvent({ type: 'analyst-skipped', summary }, exact)\n        if (exact) {\n          executionFailure = abortReason(runSignal)\n          break\n        }\n        continue\n      }\n\n      if (input.kind === 'missing') {\n        const summary: AnalystRunSummary = {\n          analyst_id: analyst.id,\n          status: 'skipped',\n          reason: `missing input of kind '${analyst.inputKind}'`,\n          findings_count: 0,\n          latency_ms: 0,\n          usage: zeroUsage(),\n        }\n        const execution = { summary, findings: [], budgetDebitUsd: 0 } satisfies AnalystExecution\n        executions.push(execution)\n        log(`[analyst] skip ${analyst.id} — missing input`, {\n          runId: plan.runId,\n          kind: analyst.inputKind,\n        })\n        const hookValues = snapshotAfterHookValues(summary, [], exact)\n        try {\n          await waitForHook(\n            plan.hooks.onAfterAnalyze\n              ? () =>\n                  plan.hooks.onAfterAnalyze?.({\n                    analyst,\n                    summary: hookValues.summary,\n                    findings: hookValues.findings,\n                    runId: plan.runId,\n                  })\n              : undefined,\n            runSignal,\n          )\n        } catch (error) {\n          if (!exact) throw error\n          executionFailure = error\n        }\n        yield snapshotExecutionEvent({ type: 'analyst-skipped', summary }, exact)\n        if (executionFailure !== undefined) break\n        continue\n      }\n\n      const allocatedUsd =\n        plan.executionSnapshot === undefined\n          ? allocateBudget(plan.budget.kind === 'dynamic' ? plan.budget.policy : undefined, {\n              analyst,\n              remainingUsd,\n              runningCount: runnable.length,\n              totalWeight,\n            })\n          : exactPlannedAllocation(plan.executionSnapshot, analyst.id)\n      const budgetCeilingUsd = plan.executionSnapshot === undefined ? remainingUsd : allocatedUsd\n      const usageReceipts: AnalystUsageReceipt[] = []\n      const contextTags = plan.tags === null ? undefined : { ...plan.tags }\n      const priorFindings = selectPriorFindings(plan.priorFindings ?? undefined, analyst.id)\n      const chainedFindings =\n        plan.chainFindings && upstreamFindings.length > 0 ? [...upstreamFindings] : undefined\n      const ctx: AnalystContext = {\n        runId: plan.runId,\n        correlationId,\n        deadlineMs,\n        budgetUsd: allocatedUsd,\n        costLedger: plan.costLedger ?? undefined,\n        costPhase: plan.costPhase ?? undefined,\n        chat: plan.chat,\n        tags: contextTags,\n        log: (message, fields) =>\n          log(`[${analyst.id}] ${message}`, {\n            runId: plan.runId,\n            correlationId,\n            ...fields,\n          }),\n        signal: runSignal,\n        priorFindings,\n        upstreamFindings: chainedFindings,\n        recordUsage: (receipt) => {\n          if (!exact) {\n            assertValidAnalystUsageReceipt(receipt)\n            usageReceipts.push(receipt)\n            return\n          }\n          usageReceipts.push(\n            snapshotUsageReceiptOnce(\n              receipt,\n              `AnalystRegistry.runExact analyst \"${analyst.id}\" usage`,\n            ),\n          )\n        },\n      }\n      if (exact) {\n        if (contextTags) deepFreezeCanonicalJson(contextTags)\n        if (priorFindings) deepFreezeCanonicalJson(priorFindings)\n        if (chainedFindings) deepFreezeCanonicalJson(chainedFindings)\n        Object.freeze(ctx)\n      }\n\n      try {\n        await waitForHook(\n          plan.hooks.onBeforeAnalyze\n            ? () => plan.hooks.onBeforeAnalyze?.({ analyst, ctx, runId: plan.runId })\n            : undefined,\n          runSignal,\n        )\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      if (runSignal?.aborted) {\n        const summary = abortedBeforeStartSummary(analyst, runSignal, Date.now() - t0)\n        executions.push({ summary, findings: [], budgetDebitUsd: 0 })\n        yield snapshotExecutionEvent({ type: 'analyst-skipped', summary }, exact)\n        if (exact) {\n          executionFailure = abortReason(runSignal)\n          break\n        }\n        continue\n      }\n      let effectiveBudget: number | undefined\n      try {\n        effectiveBudget = validateEffectiveBudget(ctx.budgetUsd, budgetCeilingUsd, analyst.id)\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      const analystContext: AnalystContext = exact ? ctx : { ...ctx }\n      const executionSignal = exact ? ctx.signal : runSignal\n      yield snapshotExecutionEvent(\n        {\n          type: 'analyst-started',\n          analyst_id: analyst.id,\n          started_at: new Date(t0).toISOString(),\n        },\n        exact,\n      )\n\n      let findings: AnalystFinding[]\n      let summary: AnalystRunSummary\n      let lifecycleFailure: unknown\n      let analysisFailure: Error | undefined\n      try {\n        if (runSignal?.aborted) throw abortReason(runSignal)\n        const analyzed = await waitForOperation(\n          (analyst as Analyst<unknown>).analyze(input.value, analystContext),\n          executionSignal,\n          analystAbortGraceMs(analyst),\n        )\n        findings = snapshotExecutionFindings(\n          analyzed,\n          exact,\n          `AnalystRegistry.runExact analyst \"${analyst.id}\" findings`,\n        )\n      } catch (error) {\n        const cause = error instanceof Error ? error : new Error(String(error))\n        analysisFailure = cause\n        let hookFindings: AnalystFinding[] = []\n        if (!executionSignal?.aborted) {\n          try {\n            const rawHookFindings =\n              (await waitForHook(\n                plan.hooks.onError\n                  ? () =>\n                      plan.hooks.onError?.({\n                        analyst,\n                        error: cause,\n                        runId: plan.runId,\n                      })\n                  : undefined,\n                executionSignal,\n              )) ?? []\n            hookFindings = snapshotExecutionFindings(\n              rawHookFindings,\n              exact,\n              `AnalystRegistry.runExact analyst \"${analyst.id}\" onError findings`,\n            )\n          } catch (error) {\n            lifecycleFailure = error\n          }\n        }\n        findings = hookFindings\n      }\n\n      let usage: AnalystUsageReceipt\n      try {\n        usage = resolveUsage(analyst, usageReceipts, exact)\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      if (analysisFailure === undefined) {\n        summary = {\n          analyst_id: analyst.id,\n          status: 'ok',\n          findings_count: findings.length,\n          latency_ms: Date.now() - t0,\n          usage,\n          ...(exact ? { allocated_budget_usd: effectiveBudget ?? null } : {}),\n        }\n        log(`[analyst] ok ${analyst.id}`, {\n          runId: plan.runId,\n          findings: findings.length,\n          latency_ms: summary.latency_ms,\n          cost_usd: knownCostUsd(usage),\n          cost_kind: usage.cost.kind,\n          input_tokens: usage.tokens?.input ?? null,\n          output_tokens: usage.tokens?.output ?? null,\n        })\n      } else {\n        const errorClass = analysisFailure.constructor.name || 'Error'\n        const errorMessage =\n          exact && analysisFailure.message.length === 0\n            ? 'Analyst failed without an error message'\n            : analysisFailure.message\n        summary = {\n          analyst_id: analyst.id,\n          status: 'failed',\n          findings_count: findings.length,\n          latency_ms: Date.now() - t0,\n          usage,\n          ...(exact ? { allocated_budget_usd: effectiveBudget ?? null } : {}),\n          error: { class: errorClass, message: errorMessage },\n        }\n        log(`[analyst] FAIL ${analyst.id}`, {\n          runId: plan.runId,\n          error_class: errorClass,\n          error: errorMessage,\n          cost_usd: knownCostUsd(usage),\n          cost_kind: usage.cost.kind,\n        })\n      }\n      logUncapturedBudgetWarning({\n        analyst,\n        runId: plan.runId,\n        budgetUsd: effectiveBudget,\n        usage,\n        log,\n      })\n\n      const execution = {\n        summary,\n        findings,\n        budgetDebitUsd: budgetDebit(summary.usage, effectiveBudget),\n      } satisfies AnalystExecution\n      if (exact) {\n        try {\n          executionCost([...executions, execution], true)\n        } catch (error) {\n          executionFailure = error\n          break\n        }\n      }\n      executions.push(execution)\n      if (plan.budget.kind === 'dynamic' && remainingUsd !== undefined) {\n        remainingUsd = Math.max(0, remainingUsd - execution.budgetDebitUsd)\n      }\n      if (plan.chainFindings) upstreamFindings.push(...findings)\n      if (lifecycleFailure !== undefined) {\n        if (!exact) throw lifecycleFailure\n        executionFailure = lifecycleFailure\n        break\n      }\n\n      const hookValues = snapshotAfterHookValues(summary, findings, exact)\n      try {\n        await waitForHook(\n          plan.hooks.onAfterAnalyze\n            ? () =>\n                plan.hooks.onAfterAnalyze?.({\n                  analyst,\n                  summary: hookValues.summary,\n                  findings: hookValues.findings,\n                  runId: plan.runId,\n                })\n            : undefined,\n          executionSignal,\n        )\n      } catch (error) {\n        if (!exact) throw error\n        executionFailure = error\n        break\n      }\n      yield snapshotExecutionEvent({ type: 'analyst-completed', summary, findings }, exact)\n      if (exact && runSignal?.aborted) {\n        executionFailure = abortReason(runSignal)\n        break\n      }\n    }\n\n    const summaries = executions.map(({ summary }) => summary)\n    const findings = executions.flatMap((execution) => execution.findings)\n    const cost = executionCost(executions, exact)\n    const baseResult: AnalystRunResult = {\n      run_id: plan.runId,\n      correlation_id: correlationId,\n      started_at: startedAt,\n      ended_at: new Date().toISOString(),\n      findings,\n      per_analyst: summaries,\n      total_cost_usd: cost.known,\n      total_cost_provenance: cost.provenance,\n    }\n    if (plan.executionSnapshot === undefined) {\n      await waitForHook(\n        plan.hooks.onComplete ? () => plan.hooks.onComplete?.({ result: baseResult }) : undefined,\n        runSignal,\n      )\n      yield { type: 'run-completed', result: baseResult }\n      return\n    }\n\n    let completeResult: ExactAnalystRunResult | undefined\n    if (executionFailure === undefined) {\n      try {\n        completeResult = snapshotExactAnalystRunReceipt(\n          {\n            ...baseResult,\n            execution_plan: plan.executionSnapshot,\n            completion: { status: 'complete' },\n          },\n          'AnalystRegistry.runExact result',\n        )\n        await waitForHook(\n          plan.hooks.onComplete\n            ? () => plan.hooks.onComplete?.({ result: completeResult! })\n            : undefined,\n          runSignal,\n        )\n      } catch (error) {\n        executionFailure = error\n      }\n    }\n    if (runSignal?.aborted) executionFailure ??= abortReason(runSignal)\n    if (executionFailure === undefined && completeResult) {\n      yield snapshotExecutionEvent({ type: 'run-completed', result: completeResult }, true)\n      return\n    }\n\n    const cause =\n      executionFailure instanceof Error ? executionFailure : new Error(String(executionFailure))\n    const errorClass = cause.constructor.name || 'Error'\n    const errorMessage =\n      cause.message.trim().length === 0\n        ? 'Exact analyst run failed without a message'\n        : cause.message\n    throw new ExactAnalystRunExecutionError(\n      `exact analyst run failed after starting: ${errorMessage}; partial result is attached`,\n      {\n        ...baseResult,\n        execution_plan: plan.executionSnapshot,\n        completion: {\n          status: 'failed',\n          error: { class: errorClass, message: errorMessage },\n        },\n      },\n      { cause },\n    )\n  }\n\n  private selectAnalysts(opts: RegistryRunOpts): Analyst[] {\n    let candidates = Array.from(this.analysts.values())\n    if (opts.only?.length) {\n      const only = new Set(opts.only)\n      candidates = candidates.filter((a) => only.has(a.id))\n    }\n    if (opts.skip?.length) {\n      const skip = new Set(opts.skip)\n      candidates = candidates.filter((a) => !skip.has(a.id))\n    }\n    return candidates\n  }\n\n  private selectExactAnalysts(\n    ids: readonly string[],\n  ): ReadonlyArray<{ readonly registeredId: string; readonly analyst: Analyst }> {\n    return ids.map((id) => {\n      const analyst = this.analysts.get(id)\n      if (!analyst) throw new Error(`ExactRegistryRunOpts.analystIds names unknown analyst \"${id}\"`)\n      return { registeredId: id, analyst }\n    })\n  }\n\n  private routeInput(\n    analyst: Analyst,\n    inputs: AnalystRunInputs,\n  ): { kind: 'present'; value: unknown } | { kind: 'missing' } {\n    switch (analyst.inputKind) {\n      case 'trace-store': {\n        const value = inputs.traceStore\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'artifact-dir': {\n        const value = inputs.artifactDir\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'run-record': {\n        const value = inputs.runRecord\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'judge-input': {\n        const value = inputs.judgeInput\n        return value ? { kind: 'present', value } : { kind: 'missing' }\n      }\n      case 'custom': {\n        const custom = inputs.custom\n        const value = custom?.[analyst.id]\n        return value !== undefined ? { kind: 'present', value } : { kind: 'missing' }\n      }\n    }\n  }\n}\n\nconst exactRunFields = [\n  'analystIds',\n  'budget',\n  'totalTimeoutMs',\n  'signal',\n  'costLedger',\n  'costLedgerIdentity',\n  'costPhase',\n  'tags',\n  'priorFindings',\n  'chainFindings',\n  'missingInputMode',\n  'applyRegistryHooks',\n  'useRegistryChat',\n] as const\n\nconst exactNonEmptyString = z.string().min(1)\nconst exactFiniteNonnegative = z.number().finite().nonnegative()\nconst exactBudgetSchema = z.discriminatedUnion('kind', [\n  z.strictObject({\n    kind: z.literal('equal'),\n    totalUsd: exactFiniteNonnegative,\n  }),\n  z.strictObject({\n    kind: z.literal('weighted'),\n    totalUsd: exactFiniteNonnegative,\n    weights: z.record(exactNonEmptyString, exactFiniteNonnegative),\n  }),\n])\nconst exactRunDataSchema = z\n  .strictObject({\n    analystIds: z.array(exactNonEmptyString).min(1),\n    budget: exactBudgetSchema.nullable(),\n    totalTimeoutMs: z.number().int().positive().max(2_147_483_647).nullable(),\n    costLedgerIdentity: z.unknown().nullable(),\n    costPhase: exactNonEmptyString.nullable(),\n    tags: z.record(z.string(), z.string()).nullable(),\n    chainFindings: z.boolean(),\n    missingInputMode: z.enum(['skip', 'abort']),\n    applyRegistryHooks: z.boolean(),\n    useRegistryChat: z.boolean(),\n  })\n  .superRefine((policy, context) => {\n    const issue = (path: PropertyKey[], message: string): void =>\n      context.addIssue({ code: 'custom', path, message })\n    if (new Set(policy.analystIds).size !== policy.analystIds.length) {\n      issue(['analystIds'], 'must not contain duplicates')\n    }\n    if (\n      policy.budget?.kind === 'weighted' &&\n      Object.values(policy.budget.weights).every((weight) => weight === 0)\n    ) {\n      issue(['budget', 'weights'], 'must allocate positive weight to at least one analyst')\n    }\n    if (policy.budget?.kind === 'weighted') {\n      const selected = [...policy.analystIds].sort()\n      const weighted = Object.keys(policy.budget.weights).sort()\n      if (\n        selected.length !== weighted.length ||\n        selected.some((id, index) => id !== weighted[index])\n      ) {\n        issue(['budget', 'weights'], 'must name every selected analyst and no others')\n      }\n    }\n  })\n\nfunction snapshotExactRunId(value: unknown): string {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new TypeError('AnalystRegistry.runExact: runId must be a non-empty string')\n  }\n  return canonicalJsonSnapshot(value, 'AnalystRegistry.runExact runId')\n}\n\nfunction snapshotAnalystRunInputChannels(inputs: AnalystRunInputs): AnalystRunInputs {\n  if (!inputs || typeof inputs !== 'object' || Array.isArray(inputs)) {\n    throw new TypeError('AnalystRegistry.runExact: inputs must be an object')\n  }\n  const traceStore = inputs.traceStore\n  const artifactDir = inputs.artifactDir\n  const runRecord = inputs.runRecord\n  const judgeInput = inputs.judgeInput\n  const custom = inputs.custom\n  return Object.freeze({\n    traceStore,\n    artifactDir,\n    runRecord,\n    judgeInput,\n    custom,\n  })\n}\n\n/**\n * Read the untrusted caller object once, then validate and execute only this frozen snapshot.\n * Functions and resource handles retain identity; all data fields are copied canonically.\n */\nfunction snapshotExactRegistryRunOpts(value: unknown): ExactRegistryRunOpts {\n  const captured = readOwnFields(value, exactRunFields, 'ExactRegistryRunOpts')\n  const missing = exactRunFields.find((field) => !Object.hasOwn(captured, field))\n  if (missing) {\n    throw new TypeError(`ExactRegistryRunOpts.${missing} must be supplied explicitly`)\n  }\n  const { signal, costLedger, priorFindings, ...rawData } = captured\n  const data = canonicalJsonSnapshot(rawData, 'ExactRegistryRunOpts')\n  const parsed = exactRunDataSchema.safeParse(data)\n  if (!parsed.success) {\n    const issue = parsed.error.issues[0]\n    if (issue?.code === 'unrecognized_keys' && issue.path.join('.') === 'budget') {\n      const required =\n        isPlainRecord(data.budget) && data.budget.kind === 'weighted'\n          ? 'kind, totalUsd, weights'\n          : 'kind, totalUsd'\n      throw new TypeError(`ExactRegistryRunOpts.budget must contain exactly ${required}`)\n    }\n    const path = issue?.path.length ? `.${issue.path.join('.')}` : ''\n    throw new TypeError(`ExactRegistryRunOpts${path}: ${issue?.message ?? 'is invalid'}`)\n  }\n  if (\n    signal !== null &&\n    (!signal ||\n      typeof signal !== 'object' ||\n      typeof (signal as AbortSignal).addEventListener !== 'function')\n  ) {\n    throw new TypeError('ExactRegistryRunOpts.signal must be an AbortSignal or null')\n  }\n  if (costLedger !== null && (!costLedger || typeof costLedger !== 'object')) {\n    throw new TypeError('ExactRegistryRunOpts.costLedger must be a CostLedgerHandle or null')\n  }\n  if (costLedger === null && parsed.data.costLedgerIdentity !== null) {\n    throw new TypeError('ExactRegistryRunOpts.costLedgerIdentity must be null without costLedger')\n  }\n  if (costLedger !== null && parsed.data.costLedgerIdentity === null) {\n    throw new TypeError('ExactRegistryRunOpts.costLedgerIdentity is required with costLedger')\n  }\n  if (costLedger === null && parsed.data.costPhase !== null) {\n    throw new TypeError('ExactRegistryRunOpts.costPhase requires a non-null costLedger')\n  }\n  return Object.freeze({\n    ...deepFreezeCanonicalJson(parsed.data),\n    signal: signal as AbortSignal | null,\n    costLedger: costLedger as CostLedgerHandle | null,\n    priorFindings: snapshotExactPriorFindings(priorFindings),\n  }) as ExactRegistryRunOpts\n}\n\nfunction snapshotExactPriorFindings(value: unknown): ExactRegistryRunOpts['priorFindings'] {\n  if (value === null) return null\n  if (Array.isArray(value)) {\n    return snapshotAnalystFindings(value, 'ExactRegistryRunOpts.priorFindings')\n  }\n  if (!isPlainRecord(value)) {\n    throw new TypeError(\n      'ExactRegistryRunOpts.priorFindings must be an array, a findings record, or null',\n    )\n  }\n  const result: Record<string, ReadonlyArray<AnalystFinding>> = {}\n  for (const [key, findings] of Object.entries(value)) {\n    if (!Array.isArray(findings)) {\n      throw new TypeError(`ExactRegistryRunOpts.priorFindings.${key} must be an array`)\n    }\n    result[key] = snapshotAnalystFindings(findings, `ExactRegistryRunOpts.priorFindings.${key}`)\n  }\n  return deepFreezeCanonicalJson(result)\n}\n\nfunction normalizeExactAnalysts(\n  selections: ReadonlyArray<{ readonly registeredId: string; readonly analyst: Analyst }>,\n): ExactCapableAnalyst[] {\n  return selections.map(({ registeredId, analyst }) => {\n    const exactAnalyst = analyst as Analyst & {\n      readonly executionConfig?: Readonly<Record<string, unknown>>\n    }\n    const id = analyst.id\n    const description = analyst.description\n    const inputKind = analyst.inputKind\n    const rawCostValue = analyst.cost\n    const requiresValue = analyst.requires\n    const version = analyst.version\n    const executionConfigValue = exactAnalyst.executionConfig\n    const analyzeValue = analyst.analyze\n    if (id !== registeredId) {\n      throw new TypeError(\n        `AnalystRegistry.runExact: registered analyst \"${registeredId}\" changed id to \"${id}\"`,\n      )\n    }\n    if (executionConfigValue === undefined) {\n      throw new TypeError(`AnalystRegistry.runExact: analyst \"${id}\" must declare executionConfig`)\n    }\n    const executionConfig = canonicalJsonSnapshot(\n      executionConfigValue,\n      `AnalystRegistry.runExact analyst \"${id}\" executionConfig`,\n    )\n    if (!isPlainRecord(executionConfig)) {\n      throw new TypeError(\n        `AnalystRegistry.runExact analyst \"${id}\" executionConfig must be an object`,\n      )\n    }\n    const rawCost = canonicalJsonSnapshot(\n      rawCostValue,\n      `AnalystRegistry.runExact analyst \"${id}\" cost`,\n    )\n    const cost =\n      rawCost.kind === 'llm'\n        ? Object.freeze({\n            ...rawCost,\n            settlement_timeout_ms: validateUsageSettlementTimeout(rawCost.settlement_timeout_ms),\n          })\n        : rawCost\n    const requires =\n      requiresValue === undefined\n        ? undefined\n        : canonicalJsonSnapshot(\n            requiresValue,\n            `AnalystRegistry.runExact analyst \"${id}\" requirements`,\n          )\n    const analyze = analyzeValue.bind(analyst)\n    return Object.freeze({\n      id,\n      description,\n      inputKind,\n      cost,\n      ...(requires === undefined ? {} : { requires }),\n      version,\n      executionConfig,\n      analyze,\n    }) satisfies ExactCapableAnalyst\n  })\n}\n\nfunction hasRegistryHooks(hooks: AnalystHooks | undefined): hooks is AnalystHooks {\n  return Boolean(\n    hooks && (hooks.onBeforeAnalyze || hooks.onAfterAnalyze || hooks.onError || hooks.onComplete),\n  )\n}\n\nfunction snapshotHooks(hooks: AnalystHooks): AnalystHooks {\n  const onBeforeAnalyze = hooks.onBeforeAnalyze\n  const onAfterAnalyze = hooks.onAfterAnalyze\n  const onError = hooks.onError\n  const onComplete = hooks.onComplete\n  return Object.freeze({\n    ...(onBeforeAnalyze === undefined ? {} : { onBeforeAnalyze: onBeforeAnalyze.bind(hooks) }),\n    ...(onAfterAnalyze === undefined ? {} : { onAfterAnalyze: onAfterAnalyze.bind(hooks) }),\n    ...(onError === undefined ? {} : { onError: onError.bind(hooks) }),\n    ...(onComplete === undefined ? {} : { onComplete: onComplete.bind(hooks) }),\n  })\n}\n\nfunction snapshotChat(chat: ChatClient): ChatClient {\n  const transport = chat.transport\n  const defaultModel = chat.defaultModel\n  const maximumAttempts = chat.maximumAttempts\n  const call = chat.chat\n  return Object.freeze({\n    transport,\n    ...(defaultModel === undefined ? {} : { defaultModel }),\n    ...(maximumAttempts === undefined ? {} : { maximumAttempts }),\n    chat: call.bind(chat),\n  })\n}\n\nfunction requireExactComponentIdentity(\n  value: ExactExecutionComponentIdentity | undefined,\n  label: string,\n): ExactExecutionComponentSnapshot {\n  if (value === undefined) {\n    throw new TypeError(`AnalystRegistry.runExact: ${label} requires a versioned identity`)\n  }\n  return snapshotExactExecutionComponentIdentity(\n    value,\n    `AnalystRegistry.runExact ${label} identity`,\n  )\n}\n\nfunction exactExecutionSnapshot(\n  analysts: readonly ExactCapableAnalyst[],\n  opts: ExactRegistryRunOpts,\n  allocations: Readonly<Record<string, number | null>>,\n  costLedger: ExactExecutionComponentSnapshot | null,\n  hooks: ExactExecutionComponentSnapshot | null,\n  chat: ExactExecutionComponentSnapshot | null,\n): ExactAnalystExecutionPlanSnapshot {\n  const priorFindings = exactPriorFindingsSnapshot(opts.priorFindings)\n  const budget =\n    opts.budget === null\n      ? ({ kind: 'none' } as const)\n      : opts.budget.kind === 'equal'\n        ? ({\n            kind: 'equal',\n            total_usd: opts.budget.totalUsd,\n            allocations_usd: { ...allocations },\n          } as const)\n        : ({\n            kind: 'weighted',\n            total_usd: opts.budget.totalUsd,\n            weights: { ...opts.budget.weights },\n            allocations_usd: { ...allocations },\n          } as const)\n  const material = {\n    schema_version: '1.0.0' as const,\n    analysts: analysts.map((analyst) => ({\n      id: analyst.id,\n      version: analyst.version,\n      input_kind: analyst.inputKind,\n      cost: analyst.cost,\n      requirements: analyst.requires ?? null,\n      execution_config_digest: hashCanonical(analyst.executionConfig),\n    })),\n    policy: {\n      budget,\n      total_timeout_ms: opts.totalTimeoutMs,\n      signal_provided: opts.signal !== null,\n      cost_ledger: costLedger,\n      cost_phase: opts.costPhase,\n      tags: opts.tags === null ? null : { ...opts.tags },\n      prior_findings: priorFindings,\n      chain_findings: opts.chainFindings,\n      missing_input_mode: opts.missingInputMode,\n      registry_hooks: hooks,\n      registry_chat: chat,\n    },\n  }\n  return snapshotExactExecutionPlan(\n    { ...material, digest: hashCanonical(material) },\n    'AnalystRegistry.runExact execution plan',\n  )\n}\n\nfunction exactPriorFindingsSnapshot(\n  findings: ExactRegistryRunOpts['priorFindings'],\n): ExactAnalystExecutionPlanSnapshot['policy']['prior_findings'] {\n  if (findings === null) return { kind: 'none' }\n  if (Array.isArray(findings)) {\n    return {\n      kind: 'ordered',\n      count: findings.length,\n      digest: hashCanonical(findings),\n    }\n  }\n  const record = findings as Readonly<Record<string, ReadonlyArray<AnalystFinding>>>\n  const keys = Object.keys(record).sort()\n  return {\n    kind: 'by_analyst',\n    keys,\n    count: keys.reduce((sum, key) => sum + (record[key]?.length ?? 0), 0),\n    digest: hashCanonical(record),\n  }\n}\n\nfunction canonicalJsonSnapshot<T>(value: T, label: string): T {\n  let snapshot: T\n  try {\n    snapshot = JSON.parse(canonicalString(value)) as T\n  } catch (cause) {\n    throw new TypeError(`${label} must be canonical JSON`, { cause })\n  }\n  return deepFreezeCanonicalJson(snapshot)\n}\n\nfunction snapshotUsageReceiptOnce(\n  receipt: AnalystUsageReceipt,\n  context: string,\n): AnalystUsageReceipt {\n  const data = readOwnFields(receipt, ['calls', 'tokens', 'cost', 'knownCostUsd'], context)\n  data.tokens =\n    data.tokens === null\n      ? null\n      : readOwnFields(\n          data.tokens,\n          ['input', 'output', 'reasoning', 'cached', 'cacheWrite'],\n          `${context} tokens`,\n        )\n  data.cost = readOwnFields(data.cost, ['kind', 'usd'], `${context} cost`)\n  const snapshot = canonicalJsonSnapshot(data as unknown as AnalystUsageReceipt, context)\n  assertValidAnalystUsageReceipt(snapshot, context)\n  return snapshot\n}\n\nfunction readOwnFields(\n  value: unknown,\n  fields: readonly string[],\n  context: string,\n): Record<string, unknown> {\n  if (!isPlainRecord(value)) throw new TypeError(`${context} must be a plain object`)\n  const unexpected = Object.keys(value).filter((key) => !fields.includes(key))\n  if (unexpected.length > 0) {\n    throw new TypeError(`${context} contains unknown fields: ${unexpected.sort().join(', ')}`)\n  }\n  return Object.fromEntries(\n    fields.flatMap((field) => (Object.hasOwn(value, field) ? [[field, value[field]]] : [])),\n  )\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false\n  const prototype = Object.getPrototypeOf(value)\n  return prototype === Object.prototype || prototype === null\n}\n\nfunction exactFixedBudgets(\n  exact: ExactAnalystBudgetPolicy | null,\n  runnable: readonly Analyst[],\n  selected: readonly Analyst[],\n): Readonly<Record<string, number | null>> {\n  if (exact === null) return {}\n  const allocations: Record<string, number | null> = Object.fromEntries(\n    selected.map((analyst) => [analyst.id, null]),\n  )\n  if (runnable.length === 0) return deepFreezeCanonicalJson(allocations)\n  if (exact.kind === 'equal') {\n    const each = exact.totalUsd / runnable.length\n    for (const analyst of runnable) allocations[analyst.id] = each\n    return deepFreezeCanonicalJson(allocations)\n  }\n  const totalWeight = runnable.reduce((sum, analyst) => sum + exact.weights[analyst.id]!, 0)\n  if (totalWeight === 0) {\n    throw new Error(\n      'ExactRegistryRunOpts weighted budget must allocate positive weight to a runnable analyst',\n    )\n  }\n  for (const analyst of runnable) {\n    allocations[analyst.id] = (exact.totalUsd * exact.weights[analyst.id]!) / totalWeight\n  }\n  return deepFreezeCanonicalJson(allocations)\n}\n\ninterface AnalystExecution {\n  readonly summary: AnalystRunSummary\n  readonly findings: AnalystFinding[]\n  readonly budgetDebitUsd: number\n}\n\nfunction snapshotExecutionFindings(\n  findings: AnalystFinding[],\n  exact: boolean,\n  context: string,\n): AnalystFinding[] {\n  return exact ? deepFreezeCanonicalJson(snapshotAnalystFindings(findings, context)) : findings\n}\n\nfunction snapshotAfterHookValues(\n  summary: AnalystRunSummary,\n  findings: AnalystFinding[],\n  exact: boolean,\n): { summary: AnalystRunSummary; findings: AnalystFinding[] } {\n  if (!exact) return { summary, findings }\n  return {\n    summary: canonicalJsonSnapshot(summary, 'AnalystRegistry.runExact onAfterAnalyze summary'),\n    findings: deepFreezeCanonicalJson(\n      snapshotAnalystFindings(findings, 'AnalystRegistry.runExact onAfterAnalyze findings'),\n    ),\n  }\n}\n\nfunction exactPlannedAllocation(\n  plan: ExactAnalystExecutionPlanSnapshot,\n  analystId: string,\n): number | undefined {\n  const budget = plan.policy.budget\n  if (budget.kind === 'none') return undefined\n  const allocated = budget.allocations_usd[analystId]\n  return allocated === null ? undefined : allocated\n}\n\nfunction snapshotExecutionEvent<T extends InternalAnalystRunEvent>(event: T, exact: boolean): T {\n  return exact ? canonicalJsonSnapshot(event, 'AnalystRegistry.runExact event') : event\n}\n\nfunction logUncapturedBudgetWarning(args: {\n  analyst: Analyst\n  runId: string\n  budgetUsd: number | undefined\n  usage: AnalystUsageReceipt\n  log: (message: string, fields?: Record<string, unknown>) => void\n}): void {\n  if (args.budgetUsd === undefined || args.usage.cost.kind !== 'uncaptured') return\n  args.log(`[analyst] WARN ${args.analyst.id} — USD cost uncaptured; budget not reconciled`, {\n    runId: args.runId,\n    budget_usd: args.budgetUsd,\n    cost_captured: false,\n  })\n}\n\nfunction validateTimeout(timeoutMs: number | undefined): number | undefined {\n  if (timeoutMs === undefined) return undefined\n  if (!Number.isSafeInteger(timeoutMs) || timeoutMs <= 0 || timeoutMs > 2_147_483_647) {\n    throw new TypeError(\n      'RegistryRunOpts.timeoutMs must be a positive safe integer no greater than 2147483647',\n    )\n  }\n  return timeoutMs\n}\n\nasync function waitForOperation<T>(\n  operation: Promise<T>,\n  signal: AbortSignal | undefined,\n  abortGraceMs: number,\n): Promise<T> {\n  if (!signal) return operation\n  if (signal.aborted) {\n    void operation.catch(() => {})\n    throw abortReason(signal)\n  }\n  return new Promise<T>((resolve, reject) => {\n    let settlementTimer: ReturnType<typeof setTimeout> | undefined\n    const cleanup = (): void => {\n      signal.removeEventListener('abort', onAbort)\n      if (settlementTimer) clearTimeout(settlementTimer)\n    }\n    const onAbort = (): void => {\n      if (abortGraceMs === 0) {\n        cleanup()\n        reject(abortReason(signal))\n        return\n      }\n      settlementTimer = setTimeout(() => {\n        cleanup()\n        reject(abortReason(signal))\n      }, abortGraceMs)\n    }\n    signal.addEventListener('abort', onAbort, { once: true })\n    operation.then(\n      (value) => {\n        cleanup()\n        if (signal.aborted) reject(abortReason(signal))\n        else resolve(value)\n      },\n      (error) => {\n        cleanup()\n        reject(signal.aborted ? abortReason(signal) : error)\n      },\n    )\n  })\n}\n\nasync function waitForHook<T>(\n  operation: (() => T | Promise<T>) | undefined,\n  signal: AbortSignal | undefined,\n): Promise<T | undefined> {\n  if (operation === undefined || signal?.aborted) return undefined\n  try {\n    return await waitForOperation(\n      Promise.resolve().then(() => {\n        if (signal?.aborted) throw abortReason(signal)\n        return operation()\n      }),\n      signal,\n      0,\n    )\n  } catch (error) {\n    if (signal?.aborted) return undefined\n    throw error\n  }\n}\n\nfunction analystAbortGraceMs(analyst: Analyst): number {\n  if (analyst.cost.kind === 'deterministic') return 0\n  const settlementMs = validateUsageSettlementTimeout(analyst.cost.settlement_timeout_ms)\n  if (settlementMs === 0) return 0\n  return Math.min(settlementMs + 100, 2_147_483_647)\n}\n\nfunction abortedBeforeStartSummary(\n  analyst: Analyst,\n  signal: AbortSignal,\n  latencyMs = 0,\n): AnalystRunSummary {\n  const reason = abortReason(signal)\n  return {\n    analyst_id: analyst.id,\n    status: 'skipped',\n    reason: `${reason.name}: ${reason.message}`,\n    findings_count: 0,\n    latency_ms: latencyMs,\n    usage: zeroUsage(),\n  }\n}\n\nfunction abortReason(signal: AbortSignal): Error {\n  return signal.reason instanceof Error\n    ? signal.reason\n    : new DOMException('The operation was aborted', 'AbortError')\n}\n\n/**\n * Default budget allocator: prefer the custom `allocate` callback if\n * provided; else weighted split when weights are set; else equal split\n * across `runningCount`. Returns undefined when no totalUsd is known.\n */\nfunction allocateBudget(\n  policy: BudgetPolicy | undefined,\n  args: {\n    analyst: Analyst\n    remainingUsd: number | undefined\n    runningCount: number\n    totalWeight: number | undefined\n  },\n): number | undefined {\n  if (!policy) return undefined\n  if (policy.allocate) {\n    const allocated = policy.allocate({\n      analyst: args.analyst,\n      totalUsd: policy.totalUsd,\n      remainingUsd: args.remainingUsd,\n      runningCount: args.runningCount,\n    })\n    if (allocated === undefined) {\n      if (policy.totalUsd !== undefined) {\n        throw new Error(\n          `BudgetPolicy.allocate('${args.analyst.id}') cannot return undefined when totalUsd is set`,\n        )\n      }\n      return undefined\n    }\n    assertBudgetAmount(allocated, `BudgetPolicy.allocate('${args.analyst.id}')`)\n    return args.remainingUsd === undefined ? allocated : Math.min(allocated, args.remainingUsd)\n  }\n  if (policy.totalUsd == null) return undefined\n  const allocated = policy.weights\n    ? (policy.totalUsd * analystWeight(policy.weights, args.analyst.id)) / args.totalWeight!\n    : policy.totalUsd / Math.max(1, args.runningCount)\n  return args.remainingUsd === undefined ? allocated : Math.min(allocated, args.remainingUsd)\n}\n\nfunction validateBudgetPolicy(policy: BudgetPolicy | undefined): void {\n  if (!policy) return\n  if (policy.totalUsd !== undefined) assertBudgetAmount(policy.totalUsd, 'BudgetPolicy.totalUsd')\n  for (const [analystId, weight] of Object.entries(policy.weights ?? {})) {\n    assertBudgetAmount(weight, `BudgetPolicy.weights['${analystId}']`)\n  }\n}\n\nfunction assertBudgetAmount(value: number, field: string): void {\n  if (!Number.isFinite(value) || value < 0) {\n    throw new Error(`${field} must be a non-negative finite number`)\n  }\n}\n\nfunction validateEffectiveBudget(\n  budgetUsd: number | undefined,\n  remainingUsd: number | undefined,\n  analystId: string,\n): number | undefined {\n  if (budgetUsd !== undefined) {\n    assertBudgetAmount(budgetUsd, `AnalystContext.budgetUsd for '${analystId}'`)\n  }\n  if (remainingUsd === undefined) return budgetUsd\n  if (budgetUsd === undefined) {\n    throw new Error(\n      `AnalystContext.budgetUsd for '${analystId}' cannot be removed while an overall budget remains`,\n    )\n  }\n  if (budgetUsd > remainingUsd) {\n    throw new Error(\n      `AnalystContext.budgetUsd for '${analystId}' (${budgetUsd}) exceeds the remaining overall budget (${remainingUsd})`,\n    )\n  }\n  return budgetUsd\n}\n\nfunction analystWeight(weights: Record<string, number>, analystId: string): number {\n  const weight = weights[analystId] ?? 1\n  assertBudgetAmount(weight, `BudgetPolicy.weights['${analystId}']`)\n  return weight\n}\n\nfunction zeroUsage(): AnalystUsageReceipt {\n  return {\n    calls: 0,\n    tokens: { input: 0, output: 0 },\n    cost: { kind: 'observed', usd: 0 },\n  }\n}\n\nfunction resolveUsage(\n  analyst: Analyst,\n  receipts: ReadonlyArray<AnalystUsageReceipt>,\n  exact = false,\n): AnalystUsageReceipt {\n  if (receipts.length > 0) return mergeUsageReceipts(receipts, exact)\n  if (analyst.cost.kind === 'deterministic') return zeroUsage()\n  return { calls: null, tokens: null, cost: { kind: 'uncaptured', usd: null } }\n}\n\nfunction mergeUsageReceipts(\n  receipts: ReadonlyArray<AnalystUsageReceipt>,\n  exact = false,\n): AnalystUsageReceipt {\n  const calls = receipts.every((receipt) => receipt.calls !== null)\n    ? usageSum(\n        receipts.map((receipt) => receipt.calls ?? 0),\n        exact,\n        'calls',\n        true,\n      )\n    : null\n  const tokens = receipts.every((receipt) => receipt.tokens !== null)\n    ? (Object.fromEntries(\n        (['input', 'output', 'reasoning', 'cached', 'cacheWrite'] as const).flatMap((field) =>\n          field === 'input' ||\n          field === 'output' ||\n          receipts.some((receipt) => receipt.tokens?.[field] !== undefined)\n            ? [\n                [\n                  field,\n                  usageSum(\n                    receipts.map((receipt) => receipt.tokens?.[field] ?? 0),\n                    exact,\n                    `tokens.${field}`,\n                    true,\n                  ),\n                ],\n              ]\n            : [],\n        ),\n      ) as unknown as RunTokenUsage)\n    : null\n  const cost = aggregateCostProvenance(\n    receipts.map((receipt) => receipt.cost),\n    exact,\n  )\n  return {\n    calls,\n    tokens,\n    cost,\n    ...(cost.kind === 'uncaptured'\n      ? {\n          knownCostUsd: usageSum(receipts.map(knownCostUsd), exact, 'known cost'),\n        }\n      : {}),\n  }\n}\n\nfunction knownCostUsd(receipt: AnalystUsageReceipt): number {\n  return receipt.cost.kind === 'uncaptured' ? (receipt.knownCostUsd ?? 0) : receipt.cost.usd\n}\n\nfunction budgetDebit(receipt: AnalystUsageReceipt, allocatedUsd: number | undefined): number {\n  const known = knownCostUsd(receipt)\n  return receipt.cost.kind === 'uncaptured' && allocatedUsd !== undefined\n    ? Math.max(known, allocatedUsd)\n    : known\n}\n\nfunction aggregateCostProvenance(\n  costs: ReadonlyArray<RunCostProvenance>,\n  exact = false,\n): RunCostProvenance {\n  if (costs.some((cost) => cost.kind === 'uncaptured')) {\n    return { kind: 'uncaptured', usd: null }\n  }\n  const usd = usageSum(\n    costs.map((cost) => cost.usd ?? 0),\n    exact,\n    'captured cost',\n  )\n  return costs.some((cost) => cost.kind === 'estimated')\n    ? { kind: 'estimated', usd }\n    : { kind: 'observed', usd }\n}\n\nfunction executionCost(\n  executions: ReadonlyArray<AnalystExecution>,\n  exact: boolean,\n): { known: number; provenance: RunCostProvenance } {\n  const usages = executions.map((execution) => execution.summary.usage)\n  return {\n    known: usageSum(usages.map(knownCostUsd), exact, 'run known cost'),\n    provenance: aggregateCostProvenance(\n      usages.map((usage) => usage.cost),\n      exact,\n    ),\n  }\n}\n\nfunction usageSum(\n  values: readonly number[],\n  exact: boolean,\n  field: string,\n  integer = false,\n): number {\n  const sum = values.reduce((total, value) => total + value, 0)\n  if (exact && (integer ? !Number.isSafeInteger(sum) : !Number.isFinite(sum))) {\n    throw new RangeError(\n      `exact analyst usage ${field} aggregate ${integer ? 'exceeds a safe integer' : 'is not finite'}`,\n    )\n  }\n  return sum\n}\n\n/**\n * Resolve the `priorFindings` slice an analyst sees.\n *\n *   - Array form  → the analyst sees only findings whose `analyst_id`\n *                   matches its own id, so a kind never reads\n *                   another kind's history by accident.\n *   - Record form → the analyst gets the entry keyed by its id, with\n *                   the `'*'` wildcard appended (in that order). Use\n *                   the wildcard when several kinds should see the same\n *                   historical findings.\n */\nfunction selectPriorFindings(\n  source: RegistryRunOpts['priorFindings'],\n  analystId: string,\n): ReadonlyArray<AnalystFinding> | undefined {\n  if (!source) return undefined\n  if (Array.isArray(source)) {\n    const own = source.filter((f) => f.analyst_id === analystId)\n    return own.length > 0 ? own : undefined\n  }\n  const record = source as Record<string, ReadonlyArray<AnalystFinding>>\n  const own = record[analystId] ?? []\n  const wildcard = record['*'] ?? []\n  const merged = [...own, ...wildcard]\n  return merged.length > 0 ? merged : undefined\n}\n","import { type BehavioralAnalystOptions, behavioralAnalyst } from './behavioral-analyst'\nimport type { TraceAnalysisEngine } from './engine'\nimport { createTraceAnalyst, type TraceAnalystDefinition } from './kind-factory'\nimport { DEFAULT_TRACE_ANALYST_KINDS } from './kinds'\nimport { AnalystRegistry, type AnalystRegistryOptions } from './registry'\n\nexport interface DefaultAnalystRegistryOptions {\n  /**\n   * Recursive engine for model-backed trace analysts. When omitted, the\n   * registry contains only deterministic analysts. The engine's id, version,\n   * and model become the exact-run identity of every analyst it executes.\n   */\n  engine?: TraceAnalysisEngine\n  definitions?: readonly TraceAnalystDefinition[]\n  /** Set false to omit the deterministic behavioral analyst (default: include). */\n  includeBehavioral?: boolean\n  behavioral?: BehavioralAnalystOptions\n  registry?: AnalystRegistryOptions\n}\n\nexport function buildDefaultAnalystRegistry(\n  options: DefaultAnalystRegistryOptions = {},\n): AnalystRegistry {\n  if (options.definitions && !options.engine) {\n    throw new TypeError(\n      'buildDefaultAnalystRegistry: definitions require an engine — a definition cannot run without one',\n    )\n  }\n  const registry = new AnalystRegistry(options.registry)\n  if (options.includeBehavioral !== false) {\n    registry.register(behavioralAnalyst(options.behavioral))\n  }\n  if (options.engine) {\n    for (const definition of options.definitions ?? DEFAULT_TRACE_ANALYST_KINDS) {\n      registry.register(createTraceAnalyst(definition, { engine: options.engine }))\n    }\n  }\n  return registry\n}\n","/**\n * Provider-neutral chat contract for every model call made by agent-eval.\n *\n * The caller owns model execution. agent-eval issues no provider request and\n * holds no provider credential: `createChatClient` binds a transport the\n * caller supplies, and evaluation code receives canonical requests and results\n * without importing a provider SDK.\n */\n\nimport type { LlmCallRequest, LlmCallResult } from '../llm-client'\n\n/**\n * Unified chat interface using the package's canonical LLM request and result.\n */\nexport interface ChatClient {\n  /** Display name of the bound transport, included in telemetry. */\n  readonly transport: ChatTransport\n  /** Default model when the caller omits one. */\n  readonly defaultModel?: string\n  /** Total provider attempts this transport can make for one chat call. */\n  readonly maximumAttempts?: number\n\n  /** Implementations must enforce `req.maxTokens` when it is present. */\n  chat(req: ChatRequest, opts?: ChatCallOpts): Promise<ChatResponse>\n}\n\nexport type ChatTransport =\n  | 'sandbox-sdk' // box.streamPrompt() — chat completion via sandbox SDK\n  | 'custom' // caller-adapted SDK or transport\n  | 'mock' // test-time injection\n\nexport interface ChatRequest extends Omit<LlmCallRequest, 'model'> {\n  /** Optional — falls back to ChatClient.defaultModel. */\n  model?: string\n}\n\nexport type ChatResponse = LlmCallResult\n\nexport interface ChatCallOpts {\n  /** Cancel the in-flight request. */\n  signal?: AbortSignal\n  /** Hard USD ceiling for this single call (informational; the underlying transport may not enforce). */\n  maxCostUsd?: number\n  /** Correlation tag carried into request headers when the transport allows. */\n  correlationId?: string\n  /** Stable provider idempotency key for retries/redrives of one paid call. */\n  idempotencyKey?: string\n}\n\n// ── Factory ─────────────────────────────────────────────────────────\n\nexport type CreateChatClientOpts = SandboxSdkTransportOpts | CustomTransportOpts | MockTransportOpts\n\ninterface BaseTransportOpts {\n  defaultModel?: string\n  /** Total provider attempts. Required for opaque transports used in capped runs. */\n  maximumAttempts?: number\n}\n\n/**\n * Sandbox-SDK transport. The caller supplies a canonical chat function for an\n * already-configured Sandbox handle, so agent-eval does not import the SDK.\n */\nexport interface SandboxSdkTransportOpts extends BaseTransportOpts {\n  transport: 'sandbox-sdk'\n  chat: (req: ChatRequest, opts?: ChatCallOpts) => Promise<ChatResponse>\n}\n\n/** Caller-adapted SDK or transport returning the canonical ChatResponse shape. */\nexport interface CustomTransportOpts extends BaseTransportOpts {\n  transport: 'custom'\n  chat: (req: ChatRequest, opts?: ChatCallOpts) => Promise<ChatResponse>\n}\n\n/**\n * Mock transport for tests. The handler receives the request and returns\n * whatever the test wants. No retries, no JSON-schema degrade.\n */\nexport interface MockTransportOpts extends BaseTransportOpts {\n  transport: 'mock'\n  handler: (req: ChatRequest, opts?: ChatCallOpts) => Promise<ChatResponse>\n}\n\n/**\n * Build a ChatClient bound to a specific transport. The returned client\n * is safe to share across analysts in a single registry run.\n */\nexport function createChatClient(opts: CreateChatClientOpts): ChatClient {\n  switch (opts.transport) {\n    case 'sandbox-sdk':\n      return {\n        transport: 'sandbox-sdk',\n        defaultModel: opts.defaultModel,\n        maximumAttempts: opts.maximumAttempts,\n        chat: async (req, callOpts) => opts.chat(resolveModel(req, opts.defaultModel), callOpts),\n      }\n    case 'custom':\n      return {\n        transport: 'custom',\n        defaultModel: opts.defaultModel,\n        maximumAttempts: opts.maximumAttempts,\n        chat: async (req, callOpts) => opts.chat(resolveModel(req, opts.defaultModel), callOpts),\n      }\n    case 'mock':\n      return {\n        transport: 'mock',\n        defaultModel: opts.defaultModel,\n        maximumAttempts: 1,\n        chat: async (req, callOpts) => opts.handler(resolveModel(req, opts.defaultModel), callOpts),\n      }\n  }\n}\n\nfunction resolveModel(req: ChatRequest, defaultModel: string | undefined): ChatRequest {\n  if (req.model) return req\n  if (!defaultModel) {\n    throw new Error(\n      'ChatClient.chat: no model on request and no defaultModel on the client. ' +\n        'Either pass req.model or bind defaultModel at createChatClient().',\n    )\n  }\n  return { ...req, model: defaultModel }\n}\n"],"mappings":";;;;;;;;;;;AAqEA,SAAgB,qBAAqB,SAA+C;CAClF,OAAO,cAAc,uBAAuB,SAAS,iBAAiB,CAAC;AACzE;;AAGA,SAAgB,iBAAiB,KAAyC;CACxE,OAAO,cAAc,mBAAmB,KAAK,aAAa,CAAC;AAC7D;AAEA,SAAgB,mBAAmB,OAAgB,UAAU,eAAiC;CAC5F,MAAM,WAAW,yBAAyB,OAAO,OAAO;CACxD,IAAI,SAAS,mBAAmB,KAAA,GAC9B,OAAO,2BAA2B,UAAU,OAAO;CAErD,IAAI,SAAS,eAAe,KAAA,GAC1B,MAAM,IAAI,UAAU,GAAG,QAAQ,2CAA2C;CAE5E,OAAO;AACT;;AAGA,SAAgB,+BACd,OACA,UAAU,6BACa;CACvB,OAAO,2BAA2B,yBAAyB,OAAO,OAAO,GAAG,OAAO;AACrF;AAEA,SAAS,yBAAyB,OAAgB,SAA0C;CAC1F,IAAI;CACJ,IAAI;EACF,WAAW,KAAK,MAAM,gBAAgB,KAAK,CAAC;CAC9C,SAAS,OAAO;EACd,MAAM,IAAI,UAAU,GAAG,QAAQ,6CAA6C,EAAE,MAAM,CAAC;CACvF;CACA,IAAI,CAAC,SAAS,QAAQ,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CAC3E,eACE,UACA;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACA,OACF;CACA,eAAe,SAAS,QAAQ,GAAG,QAAQ,QAAQ;CACnD,eAAe,SAAS,gBAAgB,GAAG,QAAQ,gBAAgB;CACnE,mBAAmB,SAAS,YAAY,GAAG,QAAQ,YAAY;CAC/D,mBAAmB,SAAS,UAAU,GAAG,QAAQ,UAAU;CAC3D,SAAS,WAAW,wBAAwB,SAAS,UAAU,GAAG,QAAQ,UAAU;CACpF,IAAI,CAAC,MAAM,QAAQ,SAAS,WAAW,GACrC,MAAM,IAAI,UAAU,GAAG,QAAQ,8BAA8B;CAE/D,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,YAAY,QAAQ,GAC1D,wBAAwB,SAAS,GAAG,QAAQ,eAAe,OAAO;CAEpE,IACE,OAAO,SAAS,mBAAmB,YACnC,CAAC,OAAO,SAAS,SAAS,cAAc,KACxC,SAAS,iBAAiB,GAE1B,MAAM,IAAI,UAAU,GAAG,QAAQ,qDAAqD;CAEtF,IAAI,SAAS,0BAA0B,KAAA,GACrC,qBAAqB,SAAS,uBAAuB,GAAG,QAAQ,uBAAuB;CAEzF,OAAO;AACT;AAEA,SAAS,wBAAwB,OAAgB,SAAuB;CACtE,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eACE,OACA;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACA,OACF;CACA,eAAe,MAAM,YAAY,GAAG,QAAQ,YAAY;CACxD,IAAI,MAAM,WAAW,QAAQ,MAAM,WAAW,aAAa,MAAM,WAAW,UAC1E,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CAEpD,IAAI,MAAM,WAAW,KAAA,GAAW,eAAe,MAAM,QAAQ,GAAG,QAAQ,QAAQ;CAChF,IAAI,MAAM,WAAW,aAAa,MAAM,WAAW,KAAA,GACjD,MAAM,IAAI,UAAU,GAAG,QAAQ,iCAAiC;CAElE,uBAAuB,MAAM,gBAAgB,GAAG,QAAQ,gBAAgB;CACxE,kBAAkB,MAAM,YAAY,GAAG,QAAQ,YAAY;CAC3D,0BAA0B,MAAM,OAAO,GAAG,QAAQ,OAAO;CACzD,IAAI,MAAM,yBAAyB,KAAA,KAAa,MAAM,yBAAyB,MAC7E,kBAAkB,MAAM,sBAAsB,GAAG,QAAQ,sBAAsB;CAEjF,IAAI,MAAM,UAAU,KAAA,GAAW;EAC7B,IAAI,MAAM,WAAW,YAAY,CAAC,SAAS,MAAM,KAAK,GACpD,MAAM,IAAI,UAAU,GAAG,QAAQ,0CAA0C;EAE3E,eAAe,MAAM,OAAO,CAAC,SAAS,SAAS,GAAG,GAAG,QAAQ,OAAO;EACpE,eAAe,MAAM,MAAM,OAAO,GAAG,QAAQ,aAAa;EAC1D,eAAe,MAAM,MAAM,SAAS,GAAG,QAAQ,eAAe;CAChE,OAAO,IAAI,MAAM,WAAW,UAC1B,MAAM,IAAI,UAAU,GAAG,QAAQ,+BAA+B;AAElE;AAEA,SAAS,0BAA0B,OAAgB,SAAuB;CACxE,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eAAe,OAAO;EAAC;EAAS;EAAU;EAAQ;CAAc,GAAG,OAAO;CAC1E,KAAK,MAAM,SAAS;EAAC;EAAS;EAAU;CAAM,GAC5C,IAAI,CAAC,OAAO,OAAO,OAAO,KAAK,GAC7B,MAAM,IAAI,UAAU,GAAG,QAAQ,GAAG,MAAM,aAAa;CAGzD,IAAI,MAAM,WAAW,MAAM;EACzB,IAAI,CAAC,SAAS,MAAM,MAAM,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,kCAAkC;EAC9F,eACE,MAAM,QACN;GAAC;GAAS;GAAU;GAAa;GAAU;EAAY,GACvD,GAAG,QAAQ,QACb;CACF;CACA,qBAAqB,MAAM,MAAM,GAAG,QAAQ,MAAM;CAClD,+BAA+B,OAAyC,OAAO;AACjF;AAEA,SAAS,qBAAqB,OAAgB,SAAuB;CACnE,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eAAe,OAAO,CAAC,QAAQ,KAAK,GAAG,OAAO;CAC9C,IAAI,MAAM,SAAS,cAAc;EAC/B,IAAI,MAAM,QAAQ,MAAM,MAAM,IAAI,UAAU,GAAG,QAAQ,6BAA6B;EACpF;CACF;CACA,IAAI,MAAM,SAAS,cAAc,MAAM,SAAS,aAC9C,MAAM,IAAI,UAAU,GAAG,QAAQ,iBAAiB;CAElD,kBAAkB,MAAM,KAAK,GAAG,QAAQ,KAAK;AAC/C;AAEA,SAAS,2BACP,KACA,SACuB;CACvB,IAAI,IAAI,mBAAmB,KAAA,GACzB,MAAM,IAAI,UAAU,GAAG,QAAQ,mCAAmC;CAEpE,MAAM,OAAO,2BAA2B,IAAI,gBAAgB,GAAG,QAAQ,gBAAgB;CACvF,MAAM,aAAa,2BAA2B,IAAI,YAAY,GAAG,QAAQ,YAAY;CACrF,IAAI,iBAAiB;CACrB,IAAI,aAAa;CACjB,MAAM,YAAY,IAAI;CAOtB,MAAM,WAAW,IAAI;CACrB,MAAM,UAAU,KAAK,SAAS,KAAK,YAAY,QAAQ,EAAE;CACzD,MAAM,YAAY,UAAU,KAAK,YAAY,QAAQ,UAAU;CAE/D,IAAI,CADY,UAAU,OAAO,WAAW,UAAU,cAAc,QAAQ,MACjE,KAAM,WAAW,WAAW,cAAc,UAAU,WAAW,QAAQ,QAChF,MAAM,IAAI,UACR,WAAW,WAAW,aAClB,GAAG,QAAQ,8EACX,GAAG,QAAQ,6DACjB;CAEF,MAAM,eAAe,IAAI,IAAI,SAAS;CACtC,KAAK,MAAM,WAAW,UACpB,IAAI,CAAC,aAAa,IAAI,QAAQ,UAAU,GACtC,MAAM,IAAI,UAAU,GAAG,QAAQ,kDAAkD;CAGrF,KAAK,MAAM,WAAW,WAAW;EAC/B,MAAM,SAAS,SAAS,QAAQ,YAAY,QAAQ,eAAe,QAAQ,UAAU,CAAC,CAAC;EACvF,IAAI,QAAQ,mBAAmB,QAC7B,MAAM,IAAI,UACR,GAAG,QAAQ,+CAA+C,QAAQ,WAAW,EAC/E;EAEF,MAAM,gBAAgB,OAAO,OAAO,SAAS,sBAAsB;EACnE,IAAI,QAAQ,WAAW,WAAW;GAChC,IAAI,eACF,MAAM,IAAI,UACR,GAAG,QAAQ,oBAAoB,QAAQ,WAAW,oCACpD;GAEF;EACF;EACA,MAAM,aAAa,QAAQ;EAS3B,IAAI,EAPF,kBACC,KAAK,OAAO,OAAO,SAAS,SACzB,eAAe,OACf,OAAO,eAAe,YACtB,KAAK,OAAO,OAAO,gBAAgB,QAAQ,gBAAgB,QAC3D,KAAK,OAAO,OAAO,gBAAgB,QAAQ,gBAAgB,KAAA,KAC3D,cAAc,KAAK,OAAO,OAAO,gBAAgB,QAAQ,eAE7D,MAAM,IAAI,UACR,GAAG,QAAQ,YAAY,QAAQ,WAAW,+CAC5C;CAEJ;CACA,IAAI,YAAY;CAChB,KAAK,MAAM,WAAW,WAAW;EAC/B,MAAM,SACJ,QAAQ,MAAM,KAAK,SAAS,eACvB,QAAQ,MAAM,gBAAgB,IAC9B,QAAQ,MAAM,KAAK,OAAO;EACjC,YAAY,kBAAkB,YAAY,QAAQ,GAAG,QAAQ,sBAAsB;CACrF;CACA,IAAI,IAAI,mBAAmB,WACzB,MAAM,IAAI,UAAU,GAAG,QAAQ,iDAAiD;CAElF,IAAI,IAAI,0BAA0B,KAAA,GAChC,MAAM,IAAI,UAAU,GAAG,QAAQ,0CAA0C;CAE3E,MAAM,QAAQ,UAAU,KAAK,YAAY,QAAQ,MAAM,IAAI;CAC3D,MAAM,qBAAqB,MAAM,MAAM,SAAS,KAAK,SAAS,YAAY,IACtE;EAAE,MAAM;EAAc,KAAK;CAAK,IAChC;EACE,MAAM,MAAM,MAAM,SAAS,KAAK,SAAS,WAAW,IAAI,cAAc;EACtE,KAAK,MAAM,QACR,KAAK,SACJ,kBAAkB,OAAO,KAAK,OAAO,IAAI,GAAG,QAAQ,yBAAyB,GAC/E,CACF;CACF;CACJ,IAAI,cAAc,IAAI,qBAAqB,MAAM,cAAc,kBAAkB,GAC/E,MAAM,IAAI,UAAU,GAAG,QAAQ,wDAAwD;CAEzF,OAAO,wBAAwB,GAAuC;AACxE;AAEA,SAAS,2BACP,OACA,SACqC;CACrC,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,IAAI,MAAM,WAAW,YAAY;EAC/B,eAAe,OAAO,CAAC,QAAQ,GAAG,OAAO;EACzC,OAAO;CACT;CACA,IAAI,MAAM,WAAW,UACnB,MAAM,IAAI,UAAU,GAAG,QAAQ,mCAAmC;CAEpE,eAAe,OAAO,CAAC,UAAU,OAAO,GAAG,OAAO;CAClD,IAAI,CAAC,SAAS,MAAM,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,+BAA+B;CAC1F,eAAe,MAAM,OAAO,CAAC,SAAS,SAAS,GAAG,GAAG,QAAQ,OAAO;CACpE,eAAe,MAAM,MAAM,OAAO,GAAG,QAAQ,aAAa;CAC1D,eAAe,MAAM,MAAM,SAAS,GAAG,QAAQ,eAAe;CAC9D,OAAO;AACT;AAEA,SAAS,kBAAkB,OAAgB,SAAyB;CAClE,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GAClE,MAAM,IAAI,UAAU,GAAG,QAAQ,sCAAsC;CAEvE,OAAO;AACT;AAEA,SAAS,uBAAuB,OAAgB,SAAyB;CACvE,IAAI,CAAC,OAAO,cAAc,KAAK,KAAM,QAAmB,GACtD,MAAM,IAAI,UAAU,GAAG,QAAQ,qCAAqC;CAEtE,OAAO;AACT;AAEA,SAAgB,wBACd,OACA,UAAU,wBACQ;CAClB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,UAAU,GAAG,QAAQ,kBAAkB;CAEnD,MAAM,WAAW,MAAM,KAAK,SAAS,UACnC,uBAAuB,SAAS,GAAG,QAAQ,WAAW,OAAO,CAC/D;CACA,uBAAuB,SAAS,KAAK,YAAY,QAAQ,UAAU,CAAC;CACpE,OAAO;AACT;AAEA,SAAgB,kBAAkB,YAAiE;CACjG,MAAM,kBAAkB,WAAW,SAAS,QACzC,YAAY,SAAS,QAAQ,QAAQ,KAAK,QAAQ,SAAS,SAAS,aACvE;CACA,MAAM,WAAW,SAAS,WAAW,UAAU,QAAQ,IACnD,WAAW,SAAS,WACpB,KAAA;CACJ,IAAI,gBAAgB,WAAW,GAAG;EAChC,IAAI,UAAU,SAAS,eACrB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,8BACzE;EAEF;CACF;CACA,IAAI,gBAAgB,WAAW,GAC7B,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,wCACzE;CAEF,IAAI,UAAU,SAAS,eACrB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,0BACzE;CAGF,MAAM,WAAW,gBAAgB,EAAE,CAAE;CACrC,IAAI,CAAC,SAAS,QAAQ,GACpB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,8BACzE;CAEF,MAAM,QAAQ,eACZ,SAAS,cACT,uBAAuB,WAAW,GAAG,SACvC;CACA,IAAI,SAAS,UAAU,OACrB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,+CACzE;CAEF,MAAM,oBAAoB,eACxB,SAAS,WACT,uBAAuB,WAAW,GAAG,sBACvC;CACA,MAAM,kBAAkB,eACtB,SAAS,WACT,uBAAuB,WAAW,GAAG,oBACvC;CACA,IAAI,sBAAsB,iBACxB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,6CACzE;CAEF,MAAM,WAAW,wBACf,SAAS,UACT,uBAAuB,WAAW,GAAG,EACvC;CACA,MAAM,aAAa,SAAS,KAAK,YAAY,QAAQ,UAAU;CAC/D,MAAM,aAAa,YACjB,SAAS,YACT,uBAAuB,WAAW,GAAG,cACvC;CACA,MAAM,kBAAkB,gBAAgB,EAAE,CAAE;CAC5C,IAAI,CAAC,SAAS,eAAe,GAC3B,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,mCACzE;CAEF,MAAM,cAAc,mBAClB;EACE,QAAQ;EACR,gBAAgB,SAAS;EACzB,YAAY,SAAS;EACrB,UAAU,SAAS;EACnB;EACA,aAAa,gBAAgB;EAC7B,gBAAgB,SAAS;EACzB,GAAI,SAAS,mBAAmB,KAAA,IAC5B,CAAC,IACD,EAAE,uBAAuB,SAAS,eAAe;EACrD,GAAI,SAAS,kBAAkB,KAAA,IAC3B,CAAC,IACD;GACE,gBAAgB,SAAS;GACzB,YAAY,SAAS;EACvB;CACN,GACA,uBAAuB,WAAW,GAAG,eACvC;CACA,MAAM,kBAAkB,IAAI,IAAI,UAAU;CAC1C,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,QAAQ,GAC9C,IAAI,CAAC,gBAAgB,IAAI,QAAQ,UAAU,GACzC,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,8BAA8B,QAAQ,WAAW,eAAe,OACzI;CAGJ,MAAM,kBAAkB,+BAA+B;EACrD;EACA,WAAW;EACX;EACA;EACA,WAAW,SAAS;EACpB,iBAAiB;CACnB,CAAC;CACD,MAAM,oBAAoB,iBAAiB,WAAW;CACtD,IAAI,oBAAoB,mBACtB,MAAM,IAAI,UACR,yDAAyD,WAAW,GAAG,+BACzE;CAEF,OAAO;EACL;EACA,WAAW;EACX;EACA;EACA;EACA;CACF;AACF;AAEA,SAAgB,8BAA8B,QAAmD;CAC/F,MAAM,mBAAmB,OAAO,gBAAgB,QAC7C,aACC,SAAS,YAAY,uBACzB;CACA,MAAM,eAAe,OAAO,gBAAgB,QACzC,aACC,SAAS,YAAY,uBACzB;CACA,IAAI,aAAa,WAAW,GAC1B,MAAM,IAAI,UACR,+GACF;CAGF,MAAM,YAAY,iBAAiB,QAAQ,aAAa,SAAS,YAAY,WAAW,CAAC,CAAC;CAC1F,MAAM,WAAW,iBAAiB,SAAS;CAC3C,MAAM,UAAU,OAAO,WAAW;CAClC,MAAM,SAAS,aAAa,EAAE,CAAE,aAAa;CAC7C,MAAM,YAAY,YAAY,IAAI,IAAI,YAAY;CAClD,MAAM,oBAAoB,YAAY;CACtC,MAAM,SAAS,sBAAsB,IAAI,IAAI,YAAY;CAEzD,OAAO;EACL;EACA;EACA,IAJS,YAAY,WAAW,IAAI,IAAK,IAAI,YAAY,UAAW,YAAY;EAKhF,QAAQ;GAAE;GAAS;GAAW;GAAU;EAAO;CACjD;AACF;AAEA,SAAgB,+BAA+B,OAOnB;CAC1B,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,GAChC,MAAM,IAAI,UAAU,2CAA2C;CAEjE,MAAM,WAAW,wBAAwB,MAAM,QAAQ;CACvD,MAAM,oBAAoB,eAAe,MAAM,WAAW,2BAA2B;CACrF,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,YAAY,CAAC,QAAQ,YAAY,OAAO,CAAC,CAAC;CACrF,MAAM,uBAAuB,IAAI,IAAI,MAAM,UAAU;CACrD,MAAM,iCAAiB,IAAI,IAAY;CACvC,IAAI,oBAAoB;CAExB,MAAM,YAAY,MAAM,UAAU,KAAK,OAAO,UAAiC;EAC7E,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,UAAU,2BAA2B,MAAM,mBAAmB;EAE1E,MAAM,SAAS,eAAe,MAAM,QAAQ,2BAA2B,MAAM,QAAQ;EACrF,IAAI,CAAC,sBAAsB,MAAM,GAC/B,MAAM,IAAI,UACR,2BAA2B,MAAM,4DACnC;EAEF,MAAM,aAAa,eACjB,MAAM,YACN,2BAA2B,MAAM,YACnC;EACA,IAAI,qBAAqB,IAAI,UAAU,GACrC,MAAM,IAAI,UACR,2BAA2B,MAAM,oDACnC;EAEF,MAAM,WAAW,eAAe,MAAM,UAAU,2BAA2B,MAAM,UAAU;EAC3F,IAAI,aAAa,MAAM,OACrB,MAAM,IAAI,UACR,2BAA2B,MAAM,8CACnC;EAEF,MAAM,SAAS,eAAe,MAAM,QAAQ,2BAA2B,MAAM,QAAQ;EACrF,MAAM,YAAY,mBAChB,MAAM,WACN,2BAA2B,MAAM,WACnC;EACA,MAAM,YAAY,eAAe,MAAM,WAAW,2BAA2B,MAAM,WAAW;EAC9F,IAAI,cAAc,mBAChB,MAAM,IAAI,UAAU,2BAA2B,MAAM,qBAAqB;EAG5E,IAAI,MAAM,YAAY,yBAAyB;GAC7C,eACE,OACA;IACE;IACA;IACA;IACA;IACA;IACA;IACA;IACA;GACF,GACA,2BAA2B,OAC7B;GACA,qBAAqB;GACrB,IAAI,oBAAoB,GACtB,MAAM,IAAI,UAAU,yDAAyD;GAE/E,OAAO;IACL;IACA,SAAS;IACT,cAAc,qBACZ,MAAM,cACN,cACA,2BAA2B,OAC7B;IACA;IACA;IACA;IACA;IACA;GACF;EACF;EAEA,IAAI,MAAM,YAAY,eAAe,MAAM,YAAY,YACrD,MAAM,IAAI,UACR,2BAA2B,MAAM,+DACnC;EAEF,eACE,OACA;GACE;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF,GACA,2BAA2B,OAC7B;EACA,MAAM,YAAY,eAAe,MAAM,WAAW,2BAA2B,MAAM,WAAW;EAC9F,MAAM,UAAU,aAAa,IAAI,SAAS;EAC1C,IAAI,CAAC,SACH,MAAM,IAAI,UAAU,0DAA0D,UAAU,EAAE;EAE5F,IAAI,eAAe,IAAI,SAAS,GAC9B,MAAM,IAAI,UAAU,qDAAqD,UAAU,EAAE;EAEvF,eAAe,IAAI,SAAS;EAC5B,MAAM,gBAAgB,eACpB,MAAM,eACN,2BAA2B,MAAM,eACnC;EACA,MAAM,iBAAiB,qBAAqB,OAAO;EACnD,IAAI,kBAAkB,gBACpB,MAAM,IAAI,UACR,2BAA2B,MAAM,mCAAmC,UAAU,EAChF;EAEF,OAAO;GACL;GACA;GACA,eAAe;GACf,SAAS,MAAM;GACf;GACA;GACA;GACA;GACA;EACF;CACF,CAAC;CAED,IAAI,MAAM,iBAAiB;EACzB,MAAM,UAAU,SACb,KAAK,YAAY,QAAQ,UAAU,CAAC,CACpC,QAAQ,cAAc,CAAC,eAAe,IAAI,SAAS,CAAC;EACvD,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,UACR,oFAAoF,QAAQ,KAAK,IAAI,GACvG;EAEF,IAAI,sBAAsB,GACxB,MAAM,IAAI,UACR,+GACF;CAEJ;CACA,OAAO;AACT;AAEA,SAAgB,uBAAuB,YAAqC;CAC1E,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,aAAa,YAAY;EAClC,IAAI,UAAU,KAAK,CAAC,CAAC,WAAW,GAAG,MAAM,IAAI,UAAU,sCAAsC;EAC7F,IAAI,KAAK,IAAI,SAAS,GACpB,MAAM,IAAI,UAAU,8CAA8C,UAAU,EAAE;EAEhF,KAAK,IAAI,SAAS;CACpB;AACF;AAEA,SAAS,uBAAuB,OAAgB,SAAiC;CAC/E,IAAI;CACJ,IAAI;EACF,WAAW,KAAK,MAAM,gBAAgB,KAAK,CAAC;CAC9C,SAAS,OAAO;EACd,MAAM,IAAI,UAAU,GAAG,QAAQ,6CAA6C,EAAE,MAAM,CAAC;CACvF;CACA,qBAAqB,UAAU,OAAO;CACtC,OAAO;AACT;AAEA,SAAS,qBAAqB,OAAgB,SAAkD;CAC9F,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,mBAAmB;CACxE,eACE,OACA;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACA,OACF;CACA,IAAI,MAAM,mBAAmB,SAC3B,MAAM,IAAI,UAAU,GAAG,QAAQ,gCAAgC;CAEjE,eAAe,MAAM,YAAY,GAAG,QAAQ,YAAY;CACxD,eAAe,MAAM,YAAY,GAAG,QAAQ,YAAY;CACxD,mBAAmB,MAAM,aAAa,GAAG,QAAQ,aAAa;CAC9D,IACE,MAAM,aAAa,cACnB,MAAM,aAAa,UACnB,MAAM,aAAa,YACnB,MAAM,aAAa,SACnB,MAAM,aAAa,QAEnB,MAAM,IAAI,UAAU,GAAG,QAAQ,qBAAqB;CAEtD,eAAe,MAAM,MAAM,GAAG,QAAQ,MAAM;CAC5C,eAAe,MAAM,OAAO,GAAG,QAAQ,OAAO;CAC9C,eAAe,MAAM,WAAW,GAAG,QAAQ,WAAW;CACtD,MAAM,gBAAgB,qBAAqB,MAAM,eAAe,GAAG,QAAQ,eAAe;CAC1F,eAAe,MAAM,oBAAoB,GAAG,QAAQ,oBAAoB;CACxE,eAAe,MAAM,iBAAiB,GAAG,QAAQ,iBAAiB;CAClE,IACE,OAAO,MAAM,eAAe,YAC5B,CAAC,OAAO,SAAS,MAAM,UAAU,KACjC,MAAM,aAAa,KACnB,MAAM,aAAa,GAEnB,MAAM,IAAI,UAAU,GAAG,QAAQ,qDAAqD;CAEtF,eAAe,MAAM,SAAS,GAAG,QAAQ,SAAS;CAClD,IAAI,MAAM,uBAAuB,KAAA,KAAa,OAAO,MAAM,uBAAuB,WAChF,MAAM,IAAI,UAAU,GAAG,QAAQ,sCAAsC;CAEvE,IAAI,MAAM,aAAa,KAAA,KAAa,CAAC,SAAS,MAAM,QAAQ,GAC1D,MAAM,IAAI,UAAU,GAAG,QAAQ,4BAA4B;AAE/D;AAEA,SAAS,qBACP,OACA,cACA,SACsB;CACtB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,UAAU,GAAG,QAAQ,+BAA+B;CAEhE,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,MAAM,KAAK,OAAO,UAAU;EACjC,MAAM,eAAe,GAAG,QAAQ,gBAAgB;EAChD,IAAI,CAAC,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,aAAa,mBAAmB;EAC7E,eAAe,OAAO;GAAC;GAAM;GAAU;EAAU,GAAG,YAAY;EAChE,MAAM,KAAK,eAAe,MAAM,IAAI,GAAG,aAAa,IAAI;EACxD,IAAI,aAAa,IAAI,EAAE,GACrB,MAAM,IAAI,UAAU,GAAG,aAAa,OAAO,GAAG,mCAAmC;EAEnF,IAAI,KAAK,IAAI,EAAE,GACb,MAAM,IAAI,UAAU,8BAA8B,GAAG,EAAE;EAEzD,KAAK,IAAI,EAAE;EAEX,OAAO;GACL;GACA,QAHa,eAAe,MAAM,QAAQ,GAAG,aAAa,QAGrD;GACL,GAAI,MAAM,aAAa,KAAA,IACnB,CAAC,IACD,EAAE,UAAU,qBAAqB,MAAM,UAAU,GAAG,aAAa,UAAU,EAAE;EACnF;CACF,CAAC;AACH;AAEA,SAAS,qBAAqB,OAAgB,SAAgC;CAC5E,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,kBAAkB;CAC5E,OAAO,MAAM,KAAK,UAAU,UAAU;EACpC,MAAM,kBAAkB,GAAG,QAAQ,GAAG;EACtC,IAAI,CAAC,SAAS,QAAQ,GAAG,MAAM,IAAI,UAAU,GAAG,gBAAgB,mBAAmB;EACnF,eAAe,UAAU;GAAC;GAAQ;GAAO;EAAS,GAAG,eAAe;EACpE,IACE,SAAS,SAAS,UAClB,SAAS,SAAS,WAClB,SAAS,SAAS,cAClB,SAAS,SAAS,aAClB,SAAS,SAAS,UAElB,MAAM,IAAI,UAAU,GAAG,gBAAgB,iBAAiB;EAE1D,MAAM,MAAM,eAAe,SAAS,KAAK,GAAG,gBAAgB,KAAK;EACjE,MAAM,UAAU,SAAS;EACzB,eAAe,SAAS,GAAG,gBAAgB,SAAS;EACpD,OAAO;GACL,MAAM,SAAS;GACf;GACA,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAW,QAAkB;EAChE;CACF,CAAC;AACH;AAEA,SAAS,eACP,OACA,SACA,MACM;CACN,MAAM,cAAc,IAAI,IAAI,OAAO;CACnC,MAAM,aAAa,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,QAAQ,CAAC,YAAY,IAAI,GAAG,CAAC;CAC3E,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B,WAAW,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG;AAE1F;AAEA,SAAS,YAAY,OAAgB,MAAwB;CAC3D,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,OAAO,SAAS,QAAQ,GACxE,MAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;CAE3D,MAAM,UAAU,MAAM,KAAK,SAAS,eAAe,MAAM,IAAI,CAAC;CAC9D,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC,SAAS,QAAQ,QACpC,MAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B;CAE1D,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,MAAsB;CAC5D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B;CAE1D,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,MAAgC;CACtE,MAAM,SAAS,eAAe,OAAO,IAAI;CACzC,IAAI,CAAC,wBAAwB,KAAK,MAAM,GACtC,MAAM,IAAI,UAAU,GAAG,KAAK,yBAAyB;CAEvD,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,MAAoB;CAC1D,IAAI,UAAU,KAAA,KAAa,OAAO,UAAU,UAC1C,MAAM,IAAI,UAAU,GAAG,KAAK,kBAAkB;AAElD;AAEA,SAAS,mBAAmB,OAAgB,MAAsB;CAChE,MAAM,YAAY,eAAe,OAAO,IAAI;CAC5C,MAAM,SAAS,IAAI,KAAK,SAAS;CACjC,IAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,KAAK,OAAO,YAAY,MAAM,WAC7D,MAAM,IAAI,UAAU,GAAG,KAAK,4CAA4C;CAE1E,OAAO;AACT;AAEA,SAAS,sBAAsB,OAA6C;CAC1E,OACE,UAAU,UACV,UAAU,WACV,UAAU,iBACV,UAAU,YACV,UAAU;AAEd;AAEA,SAAS,SAAS,OAAkD;CAClE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;;;;;;;;;;;;AC9yBA,MAAM,sBAAsB;;AAE5B,MAAM,iBAAiB;;;;;;;;;;;AAWvB,MAAM,6BAA6B;;;;;;;;;;AAUnC,MAAM,yCAAyC;;;;;;AAM/C,MAAM,YACJ;AAEF,SAAS,IAAI,GAA2B;CACtC,OAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAC3D;AACA,SAAS,QAAQ,OAAgC,MAAwC;CACvF,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,IAAI,MAAM,IAAI;EAC5B,IAAI,UAAU,MAAM,OAAO;CAC7B;CACA,OAAO;AACT;AACA,SAAS,cAAc,GAAoC;CACzD,MAAM,eAAe,IAAI,EAAE,WAAW,mBAAmB;CACzD,IAAI,iBAAiB,MAAM,OAAO;CAGlC,OACE,QAAQ,EAAE,YAAY,yBAAyB,KAAK,IAAI,EAAE,WAAW,yBAAyB;AAElG;AACA,SAAS,eAAe,GAAoC;CAC1D,OACE,QAAQ,EAAE,YAAY,0BAA0B,KAChD,IAAI,EAAE,WAAW,0BAA0B;AAE/C;AACA,SAAS,OAAO,GAAoC;CAClD,OAAO,IAAI,EAAE,WAAW,IAAI;AAC9B;AACA,SAAS,WAAW,GAAoC;CACtD,IAAI,EAAE,WAAW,OAAO,EAAE;CAC1B,KAAK,MAAM,OAAO,qBAAqB;EACrC,MAAM,IAAI,EAAE,WAAW;EACvB,IAAI,OAAO,MAAM,YAAY,EAAE,SAAS,GAAG,OAAO;CACpD;CACA,OAAO;AACT;;;;;AAMA,SAAgB,oBAAoB,OAAuD;CACzF,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC;CAC3D,IAAI,SAAS,OAAO,GAClB,MAAM,IAAI,MACR,gEAAgE,SAAS,KAAK,QAChF;CAEF,MAAM,UAAU,SAAS,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS;CAElD,MAAM,UAAyB,MAAM,KAAK,UAAU;EAClD;EACA,OAAO,cAAc,IAAI;EACzB,QAAQ,eAAe,IAAI;EAC3B,MAAM,OAAO,IAAI;CACnB,EAAE;CACF,MAAM,aAAa,QAAQ,QAAQ,WAAW,OAAO,KAAK,SAAS,KAAK;CACxE,MAAM,eACJ,WAAW,SAAS,IAChB,aACA,QAAQ,QAAQ,WAAW,OAAO,UAAU,QAAQ,OAAO,WAAW,IAAI;CAChF,MAAM,iBAAiB,oBAAoB,cAAc,KAAK;CAC9D,MAAM,kBAAkB,eAAe;CACvC,MAAM,uBACJ,iBAAiB,qBAAqB,QAAQ,UAA2B,UAAU,IAAI,KAAK,CAAC;CAC/F,MAAM,wBACJ,iBAAiB,sBAAsB,QAAQ,UAA2B,UAAU,IAAI,KAAK,CAAC;CAChG,MAAM,gBAAwC,CAAC;CAC/C,IAAI,sBAAsB;CAE1B,KAAK,MAAM,KAAK,OAAO;EACrB,MAAM,OAAO,WAAW,CAAC;EACzB,IAAI,MAAM;GACR,cAAc,SAAS,cAAc,SAAS,KAAK;GACnD,IAAI,UAAU,KAAK,IAAI,GAAG,sBAAsB;EAClD;CACF;CAEA,MAAM,iBAAiB,OAAO,OAAO,aAAa,CAAC,CAAC,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;CAC7E,MAAM,gBAAgB,OAAO,KAAK,aAAa,CAAC,CAAC;CACjD,MAAM,qBAAqB,mBAAmB,IAAI,IAAI,gBAAgB;CAEtE,MAAM,UAA8B,CAAC;CACrC,MAAM,mCAAmB,IAAI,IAAoB;CACjD,KAAK,MAAM,YAAY,gBACrB,KAAK,MAAM,UAAU,aAAa,QAAQ,GAAG;EAC3C,IAAI,iBAAiB,IAAI,OAAO,IAAI,GAAG;EACvC,iBAAiB,IAAI,OAAO,IAAI;EAChC,QAAQ,KAAK,MAAM;CACrB;CAGF,IAAI,kBAAkB,kBAAkB,kBAAkB,GAAG;EAC3D,MAAM,OAAO,OAAO,KAAK,aAAa,CAAC,CAAC;EACxC,QAAQ,KAAK;GACX,MAAM;GACN,UAAU;GACV,QAAQ,OAAO,eAAe,6BAA6B,KAAK;GAChE,UAAU;IAAE,MAAM;IAAM,OAAO;IAAgB,gBAAgB;GAAE;EACnE,CAAC;CACH;CAEA,IAAI,kBAAkB,kBAAkB,CAAC,qBACvC,QAAQ,KAAK;EACX,MAAM;EACN,UAAU;EACV,QAAQ,GAAG,eAAe;EAC1B,UAAU;GAAE,YAAY;GAAgB,oBAAoB;EAAE;CAChE,CAAC;CAGH,OAAO;EACL;EACA,cAAc,aAAa;EAC3B;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,oBACP,SACA,OAC2B;CAE3B,MAAM,oBAAoB,kCAAkC,IADtC,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,SAAS,IAAI,CAAC,CACE,CAAC;CACrE,MAAM,gBAAgB,QAAQ,KAAK,YAAY;EAC7C;EACA,GAAG,kBAAkB,OAAO,IAAI;CAClC,EAAE;CACF,MAAM,cAAc,qBAAqB,aAAa;CACtD,MAAM,0BAAU,IAAI,IAAyD;CAC7E,KAAK,MAAM,UAAU,eAAe;EAClC,MAAM,UAAU,YAAY,IAAI,OAAO,GAAG;EAC1C,MAAM,QAAQ,QAAQ,IAAI,OAAO,KAAK;GAAE,SAAS,OAAO;GAAS,SAAS,CAAC;EAAE;EAC7E,MAAM,QAAQ,KAAK,OAAO,MAAM;EAChC,QAAQ,IAAI,SAAS,KAAK;CAC5B;CAEA,MAAM,YAAuC,CAAC;CAC9C,KAAK,MAAM,EAAE,SAAS,SAAS,aAAa,QAAQ,OAAO,GAAG;EAC5D,MAAM,OAAO,gBAAgB,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,mBAAmB,CAAC;EACnE,KAAK,SAAS,KAAK,UAAU;GAC3B,UAAU,KAAK;IACb,SAAS,KAAK,WAAW,IAAI,UAAU,GAAG,QAAQ,GAAG,QAAQ;IAC7D,SAAS,IAAI,KAAK,WAAW,OAAO,KAAK,OAAO;IAChD,sBAAsB,IAAI,KAAK,WAAW,OAAO,KAAK;IACtD,uBAAuB,IAAI,KAAK,WAAW,OAAO,MAAM;GAC1D,CAAC;EACH,CAAC;CACH;CAEA,OAAO,UAAU,MACd,GAAG,MACF,EAAE,QAAQ,SAAS,EAAE,QAAQ,UAC7B,EAAE,QAAQ,cAAc,EAAE,OAAO,KACjC,EAAE,QAAQ,EAAE,CAAE,cAAc,EAAE,QAAQ,EAAG,CAC7C;AACF;AASA,SAAS,kCAAkC,WAQzC;CACA,MAAM,wBAAQ,IAAI,IAA2B;CAC7C,QAAQ,SAAS;EACf,MAAM,WAAW,qBAAqB,KAAK,gBAAgB,WAAW,KAAK;EAC3E,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,SAAS,UACrB,QAAQ,SAAS,YACjB,SAAS,kBACP,UAAU,SAAS,oBACnB,SACE,QAAQ,WACR,KAAK,aACH,SAAS,KAAK,eACd,SAAS,KAAK;EACxB,MAAM,cAAc,SAAS,WAAW,SAAS,mBAAmB;EACpE,MAAM,WAAW,SAAS,aAAa,UAAU,IAAI,SAAS,UAAU,IAAI,KAAA;EAC5E,MAAM,SAAS,gBAAgB,QAAQ,SAAS,eAAe;EAC/D,MAAM,YAAY,SAAS,OAAO;EAClC,OAAO;GACL,KAAK,KAAK,UAAU,CAAC,SAAS,SAAS,KAAK,UAAU,SAAS,UAAU,CAAC;GAC1E,UAAU;GACV;GACA,OAAO,YAAY,gBAAgB,UAAU,UAAU,IAAI;GAC3D,KAAK,YAAY,gBAAgB,UAAU,QAAQ,IAAI;EACzD;CACF;AACF;AAEA,SAAS,qBACP,SACA,WACA,OACe;CACf,MAAM,QAAuB;EAC3B,SAAS;EACT,QAAQ;EACR,iBAAiB;EACjB,YAAY;CACd;CACA,IAAI,CAAC,SAAS,OAAO;CAErB,MAAM,OAAiB,CAAC;CACxB,MAAM,4BAAY,IAAI,IAAoB;CAC1C,IAAI,YAA2B;CAC/B,IAAI,WAAW;CACf,OAAO,WAAW;EAChB,MAAM,SAAS,MAAM,IAAI,SAAS;EAClC,IAAI,QAAQ;GACV,WAAW;GACX;EACF;EACA,MAAM,aAAa,UAAU,IAAI,SAAS;EAC1C,IAAI,eAAe,KAAA,GAAW;GAC5B,WAAW;IACT,SAAS;IACT,QAAQ,CAAC,GAAG,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3C,iBAAiB;IACjB,YAAY,CAAC,GAAG,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;GACjD;GACA;EACF;EACA,MAAM,UAAU,UAAU,IAAI,SAAS;EACvC,IAAI,CAAC,SAAS;GACZ,WAAW;IACT,SAAS;IACT,QAAQ;IACR,iBAAiB;IACjB,YAAY;GACd;GACA;EACF;EACA,IAAI,QAAQ,SAAS,SAAS;GAC5B,WAAW;IACT,SAAS,QAAQ;IACjB,QAAQ;IACR,iBAAiB;IACjB,YAAY,QAAQ;GACtB;GACA;EACF;EACA,UAAU,IAAI,WAAW,KAAK,MAAM;EACpC,KAAK,KAAK,SAAS;EACnB,YAAY,QAAQ;CACtB;CAEA,KAAK,IAAI,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;EACxD,IAAI,SAAS,YAAY,QAAQ,SAAS,WAAW,MACnD,WAAW;GAAE,GAAG;GAAU,QAAQ,KAAK;GAAS,YAAY,KAAK;EAAQ;OACpE,IACL,SAAS,gBAAgB,SAAS,WAAW,SAAS,mBAAmB,SAAS,SAElF,WAAW;GAAE,GAAG;GAAU,YAAY,KAAK;EAAQ;EAErD,MAAM,IAAI,KAAK,QAAS,QAAQ;CAClC;CACA,OAAO;AACT;AAEA,SAAS,oBAAoB,GAAgB,GAAwB;CACnE,MAAM,SAAS,gBAAgB,EAAE,KAAK,UAAU;CAChD,MAAM,SAAS,gBAAgB,EAAE,KAAK,UAAU;CAChD,IAAI,WAAW,QAAQ,WAAW,MAAM,OAAO;CAC/C,IAAI,WAAW,QAAQ,WAAW,MAAM,OAAO;CAC/C,IAAI,WAAW,QAAQ,WAAW,QAAQ,WAAW,QAAQ,OAAO,SAAS;CAC7E,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,QAAQ,EAAE,SAAS,EAAE,MAAM,OAAO,EAAE,OAAO,EAAE;CAC/E,OAAO,EAAE,KAAK,QAAQ,cAAc,EAAE,KAAK,OAAO;AACpD;AAEA,SAAS,gBAAgB,SAAkD;CACzE,MAAM,OAAwB,CAAC;CAC/B,IAAI,SAAwB,CAAC;CAC7B,IAAI,UAAyB,CAAC;CAC9B,IAAI,aAAa,OAAO;CAExB,MAAM,oBAAoB;EACxB,IAAI,OAAO,SAAS,GAAG,KAAK,KAAK,MAAM;EACvC,SAAS,CAAC;CACZ;CACA,MAAM,qBAAqB;EACzB,IAAI,QAAQ,WAAW,GACrB,OAAO,KAAK,QAAQ,EAAG;OAClB,IAAI,QAAQ,SAAS,GAAG;GAC7B,YAAY;GACZ,KAAK,MAAM,UAAU,SAAS,KAAK,KAAK,CAAC,MAAM,CAAC;EAClD;EACA,UAAU,CAAC;EACX,aAAa,OAAO;CACtB;CAEA,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,QAAQ,gBAAgB,OAAO,KAAK,UAAU;EACpD,MAAM,MAAM,gBAAgB,OAAO,KAAK,QAAQ;EAChD,IAAI,UAAU,QAAQ,QAAQ,QAAQ,OAAO,KAAK,eAAe,KAAK,MAAM,OAAO;GACjF,aAAa;GACb,YAAY;GACZ,KAAK,KAAK,CAAC,MAAM,CAAC;GAClB;EACF;EACA,IAAI,QAAQ,SAAS,KAAK,SAAS,YAAY,aAAa;EAC5D,QAAQ,KAAK,MAAM;EACnB,aAAa,KAAK,IAAI,YAAY,GAAG;CACvC;CACA,aAAa;CACb,YAAY;CACZ,OAAO;AACT;AAEA,SAAS,aAAa,UAAuD;CAC3E,MAAM,UAA8B,CAAC;CACrC,MAAM,SAAS,SAAS;CACxB,MAAM,UAAU,SAAS;CACzB,IAAI,OAAO,UAAU,KAAK,OAAO,OAAO,UAA2B,UAAU,IAAI,GAAG;EAClF,MAAM,QAAQ,OAAO;EACrB,MAAM,OAAO,OAAO,OAAO,SAAS;EACpC,MAAM,cAAc,cAAc,SAAS,UAAU,YAAY,WAAW,QAAQ;EACpF,MAAM,iBAAiB,UAAU,KAAK,OAAO;EAC7C,MAAM,SAAS,iBAAiB,WAAW,QAAQ,IAAI,OAAO,QAAQ;EACtE,IAAI,eAAe,OAAO,SAAS,UAAU,qBAAqB;GAChE,MAAM,cAAc,iBAAiB,0BAA0B,GAAG,OAAO,QAAQ,CAAC,EAAE;GACpF,QAAQ,KAAK;IACX,MAAM;IACN,UAAU;IACV,QAAQ,yBAAyB,YAAY,IAAI,MAAM,GAAG,KAAK,WAAW,OAAO,OAAO;IACxF,UAAU;KACR;KACA;KACA,UAAU,iBAAiB,cAAc,OAAO,OAAO,QAAQ,CAAC,CAAC;KACjE,OAAO,OAAO;KACd,OAAO,SAAS;KAChB,eAAe,SAAS,QAAQ;KAChC,cAAc,SAAS,QAAQ,SAAS,QAAQ,SAAS;IAC3D;GACF,CAAC;EACH;CACF;CAEA,IACE,OAAO,UAAU,8BACjB,OAAO,WAAW,QAAQ,UAC1B,OAAO,OAAO,UAA2B,UAAU,IAAI,KACvD,QAAQ,OAAO,UAA2B,UAAU,IAAI,GACxD;EACA,MAAM,QAAQ,QAAQ;EACtB,MAAM,OAAO,QAAQ,QAAQ,SAAS;EACtC,MAAM,mBAAmB,cAAc,SAAS,UAAU,YAAY,WAAW,QAAQ;EACzF,MAAM,oBAAoB,cAAc,UAAU,UAAU,YAAY,WAAW,QAAQ;EAC3F,MAAM,YAAY,OAAO,OAAO,SAAS,KAAM,OAAO;EACtD,MAAM,kBAAkB,QAAQ,QAAQ;EACxC,IAAI,oBAAoB,aAAa,qBAAqB,iBACxD,QAAQ,KAAK;GACX,MAAM;GACN,UAAU;GACV,QAAQ,4BAA4B,MAAM,GAAG,KAAK,QAAQ,QAAQ,OAAO;GACzE,UAAU;IACR;IACA;IACA,OAAO,QAAQ;IACf,OAAO,SAAS;IAChB,eAAe,SAAS,QAAQ;IAChC,cAAc,SAAS,QAAQ,SAAS,QAAQ,SAAS;GAC3D;EACF,CAAC;CAEL;CACA,OAAO;AACT;AAEA,SAAS,cACP,QACA,WACS;CACT,OAAO,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,SAAS,UAAU,UAAU,OAAO,QAAS,OAAO,CAAC;AACrF;;;;;;;;AC9dA,MAAM,qBAAqD;CACzD,0BACE;CACF,uBACE;CACF,0BACE;CACF,wBACE;AACJ;AAEA,MAAMA,eAAa;AACnB,MAAM,qBAAqB;AAC3B,MAAM,4BAA4B;AAClC,MAAM,kBAAkB;AASxB,MAAM,kBAA0F;CAC9F,2BAA2B,UAAU,aACnC,GAAG,SAAS,GAAG,SAAS;CAC1B,wBAAwB,UAAU,aAChC,GAAG,SAAS,GAAG,SAAS;CAC1B,2BAA2B,UAAU,aACnC,GAAG,SAAS,GAAG,SAAS;CAC1B,yBAAyB,UAAU,aACjC,GAAG,SAAS,GAAG,SAAS;AAC5B;AAEA,eAAe,aACb,OACA,WACA,QACmB;CACnB,MAAM,2BAAW,IAAI,IAAY;CACjC,IAAI,SAAS;CACb,IAAI;CAEJ,OAAO,MAAM;EACX,QAAQ,eAAe;EACvB,MAAM,OAAO,MAAM,MAAM,YAAY;GAAE,OAAO;GAAiB;EAAO,CAAC;EACvE,IAAI,kBAAkB,KAAA,GAAW,gBAAgB,KAAK;EACtD,IAAI,KAAK,UAAU,eACjB,MAAM,IAAI,MACR,6DAA6D,cAAc,MAAM,KAAK,MAAM,EAC9F;EAEF,IAAI,KAAK,QAAQ,WACf,MAAM,IAAI,WACR,sBAAsB,KAAK,MAAM,2BAA2B,UAAU,+CACxE;EAEF,KAAK,MAAM,SAAS,KAAK,QAAQ,SAAS,IAAI,MAAM,QAAQ;EAC5D,IAAI,SAAS,OAAO,WAClB,MAAM,IAAI,WACR,0CAA0C,UAAU,6BACtD;EAEF,IAAI,CAAC,KAAK,UAAU;EACpB,IAAI,KAAK,OAAO,WAAW,GACzB,MAAM,IAAI,MAAM,0EAA0E;EAE5F,UAAU,KAAK,OAAO;CACxB;CAEA,IAAI,SAAS,SAAS,eACpB,MAAM,IAAI,MACR,0CAA0C,SAAS,KAAK,GAAG,iBAAiB,EAAE,eAChF;CAGF,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;AAC5B;;;;;AAMA,SAAgB,yBACd,SACA,OAAoD,CAAC,GACnC;CAClB,MAAM,YAAY,KAAK,aAAaA;CACpC,MAAM,UAAU,QAAQ;CACxB,OAAO,QAAQ,QAAQ,KAAK,QAC1B,YAAY;EACV,YAAY;EACZ,MAAM;EACN,SAAS,IAAI;EACb,OAAO,IAAI;EACX,UAAU,IAAI;EAEd,YAAY;EACZ,eAAe,CACb;GACE,MAAM;GACN,KAAK,UACD,kBAAkB,mBAAmB,OAAO,EAAE,cAAc,IAAI,SAChE,uBAAuB,IAAI;GAC/B,SAAS,KAAK,UAAU,IAAI,QAAQ;EACtC,CACF;EACA,oBAAoB,mBAAmB,IAAI;EAC3C,UAAU;GACR,eAAe;GACf,UAAU,IAAI;GACd,GAAI,UAAU,EAAE,UAAU,QAAQ,IAAI,CAAC;EACzC;EACA,UAAU,IAAI;EACd,GAAI,KAAK,aAAa,EAAE,aAAa,KAAK,WAAW,IAAI,CAAC;CAC5D,CAAC,CACH;AACF;;AAGA,SAAgB,kBACd,UAAoC,CAAC,GACI;CACzC,MAAM,YAAY,gBAAgB,QAAQ,aAAa,oBAAoB,WAAW;CACtF,MAAM,4BAA4B,gBAChC,QAAQ,6BAA6B,2BACrC,2BACF;CACA,OAAO;EACL,IAAIA;EACJ,aACE;EACF,WAAW;EACX,MAAM,EAAE,MAAM,gBAAgB;EAC9B,SAAS;EACT,iBAAiB;GACf,MAAM;GACN,YAAY;GACZ,+BAA+B;EACjC;EACA,MAAM,QAAQ,OAAO,SAAS;GAC5B,MAAM,mBAAmB,MAAM,aAAa,OAAO,WAAW,QAAQ,MAAM;GAC5E,MAAM,+BAAe,IAAI,IAQvB;GACF,KAAK,MAAM,WAAW,kBAAkB;IACtC,QAAQ,QAAQ,eAAe;IAC/B,MAAM,SAAS,MAAM,MAAM,UAAU,EAAE,UAAU,QAAQ,CAAC;IAC1D,IAAI,OAAO,aAAa,SACtB,MAAM,IAAI,MACR,uCAAuC,QAAQ,eAAe,OAAO,SAAS,EAChF;IAEF,IAAI,CAAC,OAAO,OACV,MAAM,IAAI,MACR,6BAA6B,QAAQ,4CACvC;IAEF,MAAM,UAAU,oBAAoB,OAAO,KAAK;IAChD,IAAI,QAAQ,YAAY,QAAQ,QAAQ,YAAY,SAClD,MAAM,IAAI,MACR,uCAAuC,QAAQ,eAAe,QAAQ,QAAQ,EAChF;IAEF,KAAK,MAAM,WAAW,yBAAyB,OAAO,GAAG;KACvD,MAAM,UAAU,aAAa,IAAI,QAAQ,UAAU;KACnD,IAAI,CAAC,SAAS;MACZ,aAAa,IAAI,QAAQ,YAAY;OACnC;OACA,oBAAoB;OACpB,kBAAkB,CAAC,OAAO;OAC1B,UAAU,CAAC,GAAG,QAAQ,aAAa;MACrC,CAAC;MACD;KACF;KACA,QAAQ,sBAAsB;KAC9B,IAAI,QAAQ,SAAS,SAAS,2BAA2B;MACvD,QAAQ,iBAAiB,KAAK,OAAO;MACrC,QAAQ,SAAS,KAAK,GAAG,QAAQ,aAAa;KAChD;IACF;GACF;GACA,OAAO,CAAC,GAAG,aAAa,OAAO,CAAC,CAAC,CAAC,KAC/B,EAAE,SAAS,oBAAoB,kBAAkB,gBAAgB;IAChE,GAAG;IACH,OAAO,gBAAgB,QAAQ,QAA0B,CACvD,oBACA,iBAAiB,MACnB;IACA,WAAW,GAAG,mBAAmB,GAAG,iBAAiB,OAAO;IAC5D,eAAe;IACf,UAAU;KACR,eAAe;KACf,oBAAoB;KACpB,8BAA8B,qBAAqB,iBAAiB;KACpE,sBAAsB;KACtB,sBAAsB,iBAAiB;IACzC;GACF,EACF;EACF;CACF;AACF;AAEA,SAAS,gBAAgB,OAAe,MAAsB;CAC5D,IAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAC1C,MAAM,IAAI,WAAW,sBAAsB,KAAK,iCAAiC;CAEnF,OAAO;AACT;;;AC9NA,MAAM,aAAa;AAEnB,SAAS,MAAM,OAAwB;CACrC,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,MAAM,UAAU,KAAK,UAAU,KAAK;CACpC,OAAO,YAAY,KAAA,IAAY,OAAO,KAAK,IAAI;AACjD;AAEA,SAAS,YAAY,WAAmB,OAAoD;CAC1F,OAAO;EACL,MAAM;EACN,KAAK,oBAAoB,mBAAmB,SAAS,EAAE,GAAG,MAAM;EAChE,SAAS,MAAM,MAAM,KAAK;CAC5B;AACF;;AAGA,SAAgB,6BACd,OACA,YACkB;CAClB,MAAM,SAAS,8BAA8B,OAAO,EAAE,YAAY,WAAW,CAAC;CAC9E,OAAO,OAAO,OAAO,KAAK,UACxB,YAAY;EACV,YAAY;EACZ,aAAa;EACb,MAAM,MAAM;EACZ,UAAU,MAAM;EAChB,SAAS,GAAG,OAAO,OAAO,GAAG,MAAM;EACnC,OAAO,MAAM;EACb,WAAW,MAAM;EACjB,eAAe,MAAM,SAAS,KAAK,UAAU,YAAY,OAAO,QAAQ,KAAK,CAAC;EAC9E,oBAAoB,MAAM;EAC1B,iBACE;EACF,YAAY;EACZ,UAAU;GACR,gBAAgB,MAAM;GACtB,iBAAiB,OAAO;GACxB,mBAAmB,OAAO;GAC1B,mBAAmB,MAAM;GACzB,GAAG,MAAM;EACX;CACF,CAAC,CACH;AACF;;AAGA,IAAa,0BAAb,MAEA;CACE,KAAc;CACd,cACE;CACF,YAAqB;CACrB,OAAgB;EAAE,MAAM;EAA0B,iBAAiB;CAAE;CACrE,UAAmB;CACnB,kBAA2B;EACzB,MAAM;EACN,oBAAoB;CACtB;CAEA,MAAM,QACJ,OACA,KAC2B;EAE3B,MAAM,WAAW,6BAA6B,OAD3B,IAAI,MAAM,+BAAc,IAAI,KAAK,EAAA,CAAE,YAAY,CACH;EAC/D,IAAI,MAAM,sBAAsB,SAAS,OAAO,cAAc,EAC5D,OAAO,WAAW,QAAQ,sBAAsB,uBAClD,CAAC;EACD,OAAO;CACT;AACF;AAEA,MAAa,4BAA4B,IAAI,wBAAwB;ACHrE,MAAa,yBAAiD;CAC5D,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;EA9CO,+BAA+B,cAIvC,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2Cf,WAAW;CAIX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;CAG9D,0BAA0B;AAC5B;AC1CA,MAAa,wBAAgD;CAC3D,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;;;EAtCO,+BAA+B,aAMvC,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;CAiCf,WAAW;CACX,QAAQ;EACN,aAAa;EACb,eAAe;EACf,cAAc;EACd,gBAAgB;CAClB;AACF;ACLA,MAAa,8BAAsD;CACjE,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;;;EAlCO,+BAA+B,mBAMvC,EAAE;;;;;;;;;;;;;;;;;;;;;CAgCf,WAAW;CACX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;CAI9D,0BAA0B;AAC5B;ACtBA,MAAa,0BAAkD;CAC7D,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAcC;;;;EAjCO,+BAA+B,eAMvC,EAAE;;;;;;;;;;;;;;;;;;;;CA4Bf,WAAW;CACX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;AAChE;AChBA,MAAa,gCAAwD;CACnE,IAAI;CACJ,aACE;CACF,MAAM;CACN,SAAS;CACT,cAAc;;EAlCO,+BAA+B,qBAIvC,EAAE;;;;;;;;;;;;;;;;;;;;;;;CA+Bf,WAAW;CACX,QAAQ;EAAE,aAAa;EAAG,eAAe;EAAI,cAAc;CAAG;CAC9D,0BAA0B;AAC5B;;;;;;;;;;;;ACjBA,MAAa,8BAAiE;CAC5E;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;;;;;;;;;;;;AC+KA,IAAa,gCAAb,cAAmD,MAAM;CACvD,OAAwB;CACxB;CAEA,YAAY,SAAiB,QAA+B,SAAwB;EAClF,MAAM,SAAS,OAAO;EACtB,MAAM,WAAW,+BAA+B,QAAQ,sCAAsC;EAC9F,IAAI,SAAS,WAAW,WAAW,UACjC,MAAM,IAAI,UAAU,+DAA+D;EAErF,KAAK,SAAS;CAChB;AACF;AAEA,IAAa,kBAAb,MAA6B;CAC3B,2BAA4B,IAAI,IAAqB;CACrD;CAEA,YAAY,UAAkC,CAAC,GAAG;EAChD,KAAK,UAAU;CACjB;CAEA,SAAS,SAAwB;EAC/B,MAAM,KAAK,QAAQ;EACnB,MAAM,UAAU,QAAQ;EACxB,MAAM,OAAO,QAAQ;EACrB,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,kDAAkD;EAC3E,IAAI,KAAK,SAAS,IAAI,EAAE,GACtB,MAAM,IAAI,MAAM,mDAAmD,GAAG,EAAE;EAE1E,IAAI,CAAC,SACH,MAAM,IAAI,MAAM,sCAAsC,GAAG,yBAAyB;EAEpF,IAAI,KAAK,SAAS,mBAAmB,KAAK,0BAA0B,KAAA,GAClE,MAAM,IAAI,UACR,oDAAoD,GAAG,uCACzD;EAEF,IAAI,KAAK,0BAA0B,KAAA,GACjC,+BAA+B,KAAK,qBAAqB;EAE3D,KAAK,SAAS,IAAI,IAAI,OAAO;CAC/B;CAEA,OAKG;EACD,OAAO,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO;GACpD,IAAI,EAAE;GACN,aAAa,EAAE;GACf,SAAS,EAAE;GACX,MAAM,EAAE;EACV,EAAE;CACJ;CAEA,MAAM,IACJ,OACA,QACA,UAA2B,CAAC,GACD;EAG3B,WAAW,MAAM,MAAM,KAAK,UAAU,OAAO,QAAQ,OAAO,GAC1D,IAAI,GAAG,SAAS,iBAAiB,OAAO,GAAG;EAE7C,MAAM,IAAI,MAAM,mEAAmE;CACrF;;CAGA,MAAM,SACJ,OACA,QACA,SACgC;EAChC,WAAW,MAAM,MAAM,KAAK,eAAe,OAAO,QAAQ,OAAO,GAC/D,IAAI,GAAG,SAAS,iBAAiB,OAAO,GAAG;EAE7C,MAAM,IAAI,MAAM,wEAAwE;CAC1F;;CAGA,OAAO,eACL,OACA,QACA,SACkD;EAClD,WAAW,MAAM,SAAS,KAAK,kBAC7B,KAAK,mBAAmB,OAAO,QAAQ,OAAO,CAChD,GACE,MAAM;CAEV;;;;;;;;;;;;CAaA,OAAO,UACL,OACA,QACA,UAA2B,CAAC,GACiB;EAC7C,OAAO,KAAK,kBAAkB,KAAK,oBAAoB,OAAO,QAAQ,OAAO,CAAC;CAChF;CAEA,oBACE,OACA,QACA,SACsB;EACtB,MAAM,YAAY,gBAAgB,QAAQ,SAAS,KAAK;EACxD,MAAM,SAAS,QAAQ,UAAU,KAAK,QAAQ;EAC9C,qBAAqB,MAAM;EAE3B,OAAO;GACL;GACA,UAHe,KAAK,eAAe,OAGlB,CAAC,CAAC,KAAK,aAAa;IACnC;IACA,OAAO,KAAK,WAAW,SAAS,MAAM;GACxC,EAAE;GACF,QAAQ,SAAS;IAAE,MAAM;IAAW,QAAQ;GAAO,IAAI,EAAE,MAAM,OAAO;GACtE,gBAAgB;GAChB,QAAQ,QAAQ,UAAU;GAC1B,YAAY,QAAQ,cAAc;GAClC,WAAW,QAAQ,aAAa;GAChC,MAAM,QAAQ,QAAQ;GACtB,eAAe,QAAQ,iBAAiB;GACxC,eAAe,QAAQ,iBAAiB;GACxC,OAAO,KAAK,QAAQ,SAAS,CAAC;GAC9B,MAAM,KAAK,QAAQ;GACnB,KAAK,KAAK,QAAQ,cAAc,CAAC;GACjC,mBAAmB,KAAA;EACrB;CACF;CAEA,mBACE,OACA,QACA,SACsB;EACtB,MAAM,aAAa,mBAAmB,KAAK;EAC3C,MAAM,QAAQ,6BAA6B,OAAO;EAClD,MAAM,WAAW,uBAAuB,KAAK,oBAAoB,MAAM,UAAU,CAAC;EAClF,MAAM,eAAe,KAAK,QAAQ;EAClC,MAAM,uBAAuB,KAAK,QAAQ;EAC1C,MAAM,gBAAgB,KAAK,QAAQ;EACnC,MAAM,wBAAwB,KAAK,QAAQ;EAC3C,IAAI,MAAM,mBAAmB,iBAAiB,KAAA,GAC5C,MAAM,IAAI,UACR,kFACF;EAEF,IAAI,MAAM,sBAAsB,CAAC,iBAAiB,aAAa,GAC7D,MAAM,IAAI,UACR,yFACF;EAEF,MAAM,gBAAgB,gCAAgC,MAAM;EAC5D,MAAM,WAAW,SAAS,KAAK,aAAa;GAC1C;GACA,OAAO,KAAK,WAAW,SAAS,aAAa;EAC/C,EAAE;EACF,IAAI,MAAM,qBAAqB,SAAS;GACtC,MAAM,UAAU,SAAS,MAAM,cAAc,UAAU,MAAM,SAAS,SAAS,CAAC,EAAE;GAClF,IAAI,SACF,MAAM,IAAI,UACR,mEAAmE,QAAQ,UAAU,eAAe,QAAQ,GAAG,EACjH;EAEJ;EACA,MAAM,gBACJ,MAAM,sBAAsB,gBACxB,8BAA8B,uBAAuB,gBAAgB,IACrE;EACN,MAAM,eAAe,MAAM,kBACvB,8BAA8B,sBAAsB,eAAe,IACnE;EACJ,MAAM,qBACJ,MAAM,eAAe,OACjB,OACA,8BAA8B,MAAM,sBAAsB,KAAA,GAAW,aAAa;EAexF,MAAM,oBAAoB,uBACxB,UACA,OAhBkB,kBAClB,MAAM,QACN,SACG,QAEG,cAIG,UAAU,MAAM,SAAS,SAChC,CAAC,CACA,KAAK,cAAc,UAAU,OAAO,GACvC,QAKU,GACV,oBACA,eACA,YACF;EACA,OAAO;GACL,OAAO;GACP;GACA,QAAQ,EAAE,MAAM,OAAO;GACvB,gBAAgB,MAAM;GACtB,QAAQ,MAAM;GACd,YAAY,MAAM;GAClB,WAAW,MAAM;GACjB,MAAM,MAAM;GACZ,eAAe,MAAM;GACrB,eAAe,MAAM;GACrB,OAAO,MAAM,sBAAsB,gBAAgB,cAAc,aAAa,IAAI,CAAC;GACnF,MAAM,MAAM,mBAAmB,eAAe,aAAa,YAAY,IAAI,KAAA;GAG3E,WAAW,CAAC;GACZ;EACF;CACF;CAEA,OAAe,kBACb,MACqD;EACrD,MAAM,QAAQ,KAAK,sBAAsB,KAAA;EACzC,IAAI,SAAS,KAAK,QAAQ,SAAS,MAAM,YAAY,KAAK,MAAM;EAEhE,MAAM,gBAAgB,MAAM,WAAW,CAAC,CAAC,MAAM,GAAG,EAAE;EACpD,MAAM,MAAM,KAAK;EACjB,MAAM,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;EACzC,MAAM,UAAU,KAAK,IAAI;EACzB,MAAM,gBACJ,KAAK,mBAAmB,OAAO,KAAA,IAAY,YAAY,QAAQ,KAAK,cAAc;EACpF,MAAM,YAAY,oBAAoB,KAAK,UAAU,KAAA,GAAW,aAAa;EAC7E,MAAM,aAAa,KAAK,mBAAmB,OAAO,KAAA,IAAY,UAAU,KAAK;EAC7E,MAAM,WAAW,KAAK,SACnB,QAEG,cAIG,UAAU,MAAM,SAAS,SAChC,CAAC,CACA,KAAK,cAAc,UAAU,OAAO;EACvC,IAAI,eAAe,KAAK,OAAO,SAAS,YAAY,KAAK,OAAO,OAAO,WAAW,KAAA;EAClF,MAAM,UAAU,KAAK,OAAO,SAAS,YAAY,KAAK,OAAO,OAAO,UAAU,KAAA;EAC9E,MAAM,cACJ,WACA,KAAK,OAAO,SAAS,aACrB,KAAK,OAAO,OAAO,YAAY,QAC/B,CAAC,KAAK,OAAO,OAAO,YACpB,SAAS,SAAS,IACd,SAAS,QAAQ,KAAK,YAAY,MAAM,cAAc,SAAS,QAAQ,EAAE,GAAG,CAAC,IAC7E,KAAA;EACN,IAAI,gBAAgB,GAClB,MAAM,IAAI,MAAM,0EAA0E;EAE5F,MAAM,mBAAqC,CAAC;EAE5C,MAAM,uBACJ;GACE,MAAM;GACN,QAAQ,KAAK;GACb,gBAAgB;GAChB,YAAY;GACZ,aAAa,KAAK,SAAS,KAAK,EAAE,cAAc,QAAQ,EAAE;GAC1D,GAAI,KAAK,sBAAsB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB,KAAK,kBAAkB;EAC3F,GACA,KACF;EAEA,MAAM,aAAiC,CAAC;EACxC,IAAI;EAEJ,KAAK,MAAM,EAAE,SAAS,WAAW,KAAK,UAAU;GAC9C,MAAM,KAAK,KAAK,IAAI;GACpB,IAAI,WAAW,SAAS;IACtB,MAAM,UAAU,0BAA0B,SAAS,SAAS;IAC5D,WAAW,KAAK;KAAE;KAAS,UAAU,CAAC;KAAG,gBAAgB;IAAE,CAAC;IAC5D,IAAI,kBAAkB,QAAQ,GAAG,iBAAiB;KAChD,OAAO,KAAK;KACZ,QAAQ,QAAQ;IAClB,CAAC;IACD,MAAM,uBAAuB;KAAE,MAAM;KAAmB;IAAQ,GAAG,KAAK;IACxE,IAAI,OAAO;KACT,mBAAmB,YAAY,SAAS;KACxC;IACF;IACA;GACF;GAEA,IAAI,MAAM,SAAS,WAAW;IAC5B,MAAM,UAA6B;KACjC,YAAY,QAAQ;KACpB,QAAQ;KACR,QAAQ,0BAA0B,QAAQ,UAAU;KACpD,gBAAgB;KAChB,YAAY;KACZ,OAAO,UAAU;IACnB;IACA,MAAM,YAAY;KAAE;KAAS,UAAU,CAAC;KAAG,gBAAgB;IAAE;IAC7D,WAAW,KAAK,SAAS;IACzB,IAAI,kBAAkB,QAAQ,GAAG,mBAAmB;KAClD,OAAO,KAAK;KACZ,MAAM,QAAQ;IAChB,CAAC;IACD,MAAM,aAAa,wBAAwB,SAAS,CAAC,GAAG,KAAK;IAC7D,IAAI;KACF,MAAM,YACJ,KAAK,MAAM,uBAEL,KAAK,MAAM,iBAAiB;MAC1B;MACA,SAAS,WAAW;MACpB,UAAU,WAAW;MACrB,OAAO,KAAK;KACd,CAAC,IACH,KAAA,GACJ,SACF;IACF,SAAS,OAAO;KACd,IAAI,CAAC,OAAO,MAAM;KAClB,mBAAmB;IACrB;IACA,MAAM,uBAAuB;KAAE,MAAM;KAAmB;IAAQ,GAAG,KAAK;IACxE,IAAI,qBAAqB,KAAA,GAAW;IACpC;GACF;GAEA,MAAM,eACJ,KAAK,sBAAsB,KAAA,IACvB,eAAe,KAAK,OAAO,SAAS,YAAY,KAAK,OAAO,SAAS,KAAA,GAAW;IAC9E;IACA;IACA,cAAc,SAAS;IACvB;GACF,CAAC,IACD,uBAAuB,KAAK,mBAAmB,QAAQ,EAAE;GAC/D,MAAM,mBAAmB,KAAK,sBAAsB,KAAA,IAAY,eAAe;GAC/E,MAAM,gBAAuC,CAAC;GAC9C,MAAM,cAAc,KAAK,SAAS,OAAO,KAAA,IAAY,EAAE,GAAG,KAAK,KAAK;GACpE,MAAM,gBAAgB,oBAAoB,KAAK,iBAAiB,KAAA,GAAW,QAAQ,EAAE;GACrF,MAAM,kBACJ,KAAK,iBAAiB,iBAAiB,SAAS,IAAI,CAAC,GAAG,gBAAgB,IAAI,KAAA;GAC9E,MAAM,MAAsB;IAC1B,OAAO,KAAK;IACZ;IACA;IACA,WAAW;IACX,YAAY,KAAK,cAAc,KAAA;IAC/B,WAAW,KAAK,aAAa,KAAA;IAC7B,MAAM,KAAK;IACX,MAAM;IACN,MAAM,SAAS,WACb,IAAI,IAAI,QAAQ,GAAG,IAAI,WAAW;KAChC,OAAO,KAAK;KACZ;KACA,GAAG;IACL,CAAC;IACH,QAAQ;IACR;IACA,kBAAkB;IAClB,cAAc,YAAY;KACxB,IAAI,CAAC,OAAO;MACV,+BAA+B,OAAO;MACtC,cAAc,KAAK,OAAO;MAC1B;KACF;KACA,cAAc,KACZ,yBACE,SACA,qCAAqC,QAAQ,GAAG,QAClD,CACF;IACF;GACF;GACA,IAAI,OAAO;IACT,IAAI,aAAa,wBAAwB,WAAW;IACpD,IAAI,eAAe,wBAAwB,aAAa;IACxD,IAAI,iBAAiB,wBAAwB,eAAe;IAC5D,OAAO,OAAO,GAAG;GACnB;GAEA,IAAI;IACF,MAAM,YACJ,KAAK,MAAM,wBACD,KAAK,MAAM,kBAAkB;KAAE;KAAS;KAAK,OAAO,KAAK;IAAM,CAAC,IACtE,KAAA,GACJ,SACF;GACF,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,IAAI,WAAW,SAAS;IACtB,MAAM,UAAU,0BAA0B,SAAS,WAAW,KAAK,IAAI,IAAI,EAAE;IAC7E,WAAW,KAAK;KAAE;KAAS,UAAU,CAAC;KAAG,gBAAgB;IAAE,CAAC;IAC5D,MAAM,uBAAuB;KAAE,MAAM;KAAmB;IAAQ,GAAG,KAAK;IACxE,IAAI,OAAO;KACT,mBAAmB,YAAY,SAAS;KACxC;IACF;IACA;GACF;GACA,IAAI;GACJ,IAAI;IACF,kBAAkB,wBAAwB,IAAI,WAAW,kBAAkB,QAAQ,EAAE;GACvF,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,MAAM,iBAAiC,QAAQ,MAAM,EAAE,GAAG,IAAI;GAC9D,MAAM,kBAAkB,QAAQ,IAAI,SAAS;GAC7C,MAAM,uBACJ;IACE,MAAM;IACN,YAAY,QAAQ;IACpB,YAAY,IAAI,KAAK,EAAE,CAAC,CAAC,YAAY;GACvC,GACA,KACF;GAEA,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;IACF,IAAI,WAAW,SAAS,MAAM,YAAY,SAAS;IAMnD,WAAW,0BACT,MANqB,iBACpB,QAA6B,QAAQ,MAAM,OAAO,cAAc,GACjE,iBACA,oBAAoB,OAAO,CAC7B,GAGE,OACA,qCAAqC,QAAQ,GAAG,WAClD;GACF,SAAS,OAAO;IACd,MAAM,QAAQ,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;IACtE,kBAAkB;IAClB,IAAI,eAAiC,CAAC;IACtC,IAAI,CAAC,iBAAiB,SACpB,IAAI;KAaF,eAAe,0BAXZ,MAAM,YACL,KAAK,MAAM,gBAEL,KAAK,MAAM,UAAU;MACnB;MACA,OAAO;MACP,OAAO,KAAK;KACd,CAAC,IACH,KAAA,GACJ,eACF,KAAM,CAAC,GAGP,OACA,qCAAqC,QAAQ,GAAG,mBAClD;IACF,SAAS,OAAO;KACd,mBAAmB;IACrB;IAEF,WAAW;GACb;GAEA,IAAI;GACJ,IAAI;IACF,QAAQ,aAAa,SAAS,eAAe,KAAK;GACpD,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,IAAI,oBAAoB,KAAA,GAAW;IACjC,UAAU;KACR,YAAY,QAAQ;KACpB,QAAQ;KACR,gBAAgB,SAAS;KACzB,YAAY,KAAK,IAAI,IAAI;KACzB;KACA,GAAI,QAAQ,EAAE,sBAAsB,mBAAmB,KAAK,IAAI,CAAC;IACnE;IACA,IAAI,gBAAgB,QAAQ,MAAM;KAChC,OAAO,KAAK;KACZ,UAAU,SAAS;KACnB,YAAY,QAAQ;KACpB,UAAU,aAAa,KAAK;KAC5B,WAAW,MAAM,KAAK;KACtB,cAAc,MAAM,QAAQ,SAAS;KACrC,eAAe,MAAM,QAAQ,UAAU;IACzC,CAAC;GACH,OAAO;IACL,MAAM,aAAa,gBAAgB,YAAY,QAAQ;IACvD,MAAM,eACJ,SAAS,gBAAgB,QAAQ,WAAW,IACxC,4CACA,gBAAgB;IACtB,UAAU;KACR,YAAY,QAAQ;KACpB,QAAQ;KACR,gBAAgB,SAAS;KACzB,YAAY,KAAK,IAAI,IAAI;KACzB;KACA,GAAI,QAAQ,EAAE,sBAAsB,mBAAmB,KAAK,IAAI,CAAC;KACjE,OAAO;MAAE,OAAO;MAAY,SAAS;KAAa;IACpD;IACA,IAAI,kBAAkB,QAAQ,MAAM;KAClC,OAAO,KAAK;KACZ,aAAa;KACb,OAAO;KACP,UAAU,aAAa,KAAK;KAC5B,WAAW,MAAM,KAAK;IACxB,CAAC;GACH;GACA,2BAA2B;IACzB;IACA,OAAO,KAAK;IACZ,WAAW;IACX;IACA;GACF,CAAC;GAED,MAAM,YAAY;IAChB;IACA;IACA,gBAAgB,YAAY,QAAQ,OAAO,eAAe;GAC5D;GACA,IAAI,OACF,IAAI;IACF,cAAc,CAAC,GAAG,YAAY,SAAS,GAAG,IAAI;GAChD,SAAS,OAAO;IACd,mBAAmB;IACnB;GACF;GAEF,WAAW,KAAK,SAAS;GACzB,IAAI,KAAK,OAAO,SAAS,aAAa,iBAAiB,KAAA,GACrD,eAAe,KAAK,IAAI,GAAG,eAAe,UAAU,cAAc;GAEpE,IAAI,KAAK,eAAe,iBAAiB,KAAK,GAAG,QAAQ;GACzD,IAAI,qBAAqB,KAAA,GAAW;IAClC,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GAEA,MAAM,aAAa,wBAAwB,SAAS,UAAU,KAAK;GACnE,IAAI;IACF,MAAM,YACJ,KAAK,MAAM,uBAEL,KAAK,MAAM,iBAAiB;KAC1B;KACA,SAAS,WAAW;KACpB,UAAU,WAAW;KACrB,OAAO,KAAK;IACd,CAAC,IACH,KAAA,GACJ,eACF;GACF,SAAS,OAAO;IACd,IAAI,CAAC,OAAO,MAAM;IAClB,mBAAmB;IACnB;GACF;GACA,MAAM,uBAAuB;IAAE,MAAM;IAAqB;IAAS;GAAS,GAAG,KAAK;GACpF,IAAI,SAAS,WAAW,SAAS;IAC/B,mBAAmB,YAAY,SAAS;IACxC;GACF;EACF;EAEA,MAAM,YAAY,WAAW,KAAK,EAAE,cAAc,OAAO;EACzD,MAAM,WAAW,WAAW,SAAS,cAAc,UAAU,QAAQ;EACrE,MAAM,OAAO,cAAc,YAAY,KAAK;EAC5C,MAAM,aAA+B;GACnC,QAAQ,KAAK;GACb,gBAAgB;GAChB,YAAY;GACZ,2BAAU,IAAI,KAAK,EAAA,CAAE,YAAY;GACjC;GACA,aAAa;GACb,gBAAgB,KAAK;GACrB,uBAAuB,KAAK;EAC9B;EACA,IAAI,KAAK,sBAAsB,KAAA,GAAW;GACxC,MAAM,YACJ,KAAK,MAAM,mBAAmB,KAAK,MAAM,aAAa,EAAE,QAAQ,WAAW,CAAC,IAAI,KAAA,GAChF,SACF;GACA,MAAM;IAAE,MAAM;IAAiB,QAAQ;GAAW;GAClD;EACF;EAEA,IAAI;EACJ,IAAI,qBAAqB,KAAA,GACvB,IAAI;GACF,iBAAiB,+BACf;IACE,GAAG;IACH,gBAAgB,KAAK;IACrB,YAAY,EAAE,QAAQ,WAAW;GACnC,GACA,iCACF;GACA,MAAM,YACJ,KAAK,MAAM,mBACD,KAAK,MAAM,aAAa,EAAE,QAAQ,eAAgB,CAAC,IACzD,KAAA,GACJ,SACF;EACF,SAAS,OAAO;GACd,mBAAmB;EACrB;EAEF,IAAI,WAAW,SAAS,qBAAqB,YAAY,SAAS;EAClE,IAAI,qBAAqB,KAAA,KAAa,gBAAgB;GACpD,MAAM,uBAAuB;IAAE,MAAM;IAAiB,QAAQ;GAAe,GAAG,IAAI;GACpF;EACF;EAEA,MAAM,QACJ,4BAA4B,QAAQ,mBAAmB,IAAI,MAAM,OAAO,gBAAgB,CAAC;EAC3F,MAAM,aAAa,MAAM,YAAY,QAAQ;EAC7C,MAAM,eACJ,MAAM,QAAQ,KAAK,CAAC,CAAC,WAAW,IAC5B,+CACA,MAAM;EACZ,MAAM,IAAI,8BACR,4CAA4C,aAAa,+BACzD;GACE,GAAG;GACH,gBAAgB,KAAK;GACrB,YAAY;IACV,QAAQ;IACR,OAAO;KAAE,OAAO;KAAY,SAAS;IAAa;GACpD;EACF,GACA,EAAE,MAAM,CACV;CACF;CAEA,eAAuB,MAAkC;EACvD,IAAI,aAAa,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC;EAClD,IAAI,KAAK,MAAM,QAAQ;GACrB,MAAM,OAAO,IAAI,IAAI,KAAK,IAAI;GAC9B,aAAa,WAAW,QAAQ,MAAM,KAAK,IAAI,EAAE,EAAE,CAAC;EACtD;EACA,IAAI,KAAK,MAAM,QAAQ;GACrB,MAAM,OAAO,IAAI,IAAI,KAAK,IAAI;GAC9B,aAAa,WAAW,QAAQ,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;EACvD;EACA,OAAO;CACT;CAEA,oBACE,KAC6E;EAC7E,OAAO,IAAI,KAAK,OAAO;GACrB,MAAM,UAAU,KAAK,SAAS,IAAI,EAAE;GACpC,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,0DAA0D,GAAG,EAAE;GAC7F,OAAO;IAAE,cAAc;IAAI;GAAQ;EACrC,CAAC;CACH;CAEA,WACE,SACA,QAC2D;EAC3D,QAAQ,QAAQ,WAAhB;GACE,KAAK,eAAe;IAClB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,gBAAgB;IACnB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,cAAc;IACjB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,eAAe;IAClB,MAAM,QAAQ,OAAO;IACrB,OAAO,QAAQ;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAChE;GACA,KAAK,UAAU;IAEb,MAAM,QADS,OAAO,SACC,QAAQ;IAC/B,OAAO,UAAU,KAAA,IAAY;KAAE,MAAM;KAAW;IAAM,IAAI,EAAE,MAAM,UAAU;GAC9E;EACF;CACF;AACF;AAEA,MAAM,iBAAiB;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,sBAAsB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;AAC5C,MAAM,yBAAyB,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY;AAC/D,MAAM,oBAAoB,EAAE,mBAAmB,QAAQ,CACrD,EAAE,aAAa;CACb,MAAM,EAAE,QAAQ,OAAO;CACvB,UAAU;AACZ,CAAC,GACD,EAAE,aAAa;CACb,MAAM,EAAE,QAAQ,UAAU;CAC1B,UAAU;CACV,SAAS,EAAE,OAAO,qBAAqB,sBAAsB;AAC/D,CAAC,CACH,CAAC;AACD,MAAM,qBAAqB,EACxB,aAAa;CACZ,YAAY,EAAE,MAAM,mBAAmB,CAAC,CAAC,IAAI,CAAC;CAC9C,QAAQ,kBAAkB,SAAS;CACnC,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,UAAa,CAAC,CAAC,SAAS;CACxE,oBAAoB,EAAE,QAAQ,CAAC,CAAC,SAAS;CACzC,WAAW,oBAAoB,SAAS;CACxC,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAChD,eAAe,EAAE,QAAQ;CACzB,kBAAkB,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;CAC1C,oBAAoB,EAAE,QAAQ;CAC9B,iBAAiB,EAAE,QAAQ;AAC7B,CAAC,CAAC,CACD,aAAa,QAAQ,YAAY;CAChC,MAAM,SAAS,MAAqB,YAClC,QAAQ,SAAS;EAAE,MAAM;EAAU;EAAM;CAAQ,CAAC;CACpD,IAAI,IAAI,IAAI,OAAO,UAAU,CAAC,CAAC,SAAS,OAAO,WAAW,QACxD,MAAM,CAAC,YAAY,GAAG,6BAA6B;CAErD,IACE,OAAO,QAAQ,SAAS,cACxB,OAAO,OAAO,OAAO,OAAO,OAAO,CAAC,CAAC,OAAO,WAAW,WAAW,CAAC,GAEnE,MAAM,CAAC,UAAU,SAAS,GAAG,uDAAuD;CAEtF,IAAI,OAAO,QAAQ,SAAS,YAAY;EACtC,MAAM,WAAW,CAAC,GAAG,OAAO,UAAU,CAAC,CAAC,KAAK;EAC7C,MAAM,WAAW,OAAO,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK;EACzD,IACE,SAAS,WAAW,SAAS,UAC7B,SAAS,MAAM,IAAI,UAAU,OAAO,SAAS,MAAM,GAEnD,MAAM,CAAC,UAAU,SAAS,GAAG,gDAAgD;CAEjF;AACF,CAAC;AAEH,SAAS,mBAAmB,OAAwB;CAClD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,UAAU,4DAA4D;CAElF,OAAO,sBAAsB,OAAO,gCAAgC;AACtE;AAEA,SAAS,gCAAgC,QAA4C;CACnF,IAAI,CAAC,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAC/D,MAAM,IAAI,UAAU,oDAAoD;CAE1E,MAAM,aAAa,OAAO;CAC1B,MAAM,cAAc,OAAO;CAC3B,MAAM,YAAY,OAAO;CACzB,MAAM,aAAa,OAAO;CAC1B,MAAM,SAAS,OAAO;CACtB,OAAO,OAAO,OAAO;EACnB;EACA;EACA;EACA;EACA;CACF,CAAC;AACH;;;;;AAMA,SAAS,6BAA6B,OAAsC;CAC1E,MAAM,WAAW,cAAc,OAAO,gBAAgB,sBAAsB;CAC5E,MAAM,UAAU,eAAe,MAAM,UAAU,CAAC,OAAO,OAAO,UAAU,KAAK,CAAC;CAC9E,IAAI,SACF,MAAM,IAAI,UAAU,wBAAwB,QAAQ,6BAA6B;CAEnF,MAAM,EAAE,QAAQ,YAAY,eAAe,GAAG,YAAY;CAC1D,MAAM,OAAO,sBAAsB,SAAS,sBAAsB;CAClE,MAAM,SAAS,mBAAmB,UAAU,IAAI;CAChD,IAAI,CAAC,OAAO,SAAS;EACnB,MAAM,QAAQ,OAAO,MAAM,OAAO;EAClC,IAAI,OAAO,SAAS,uBAAuB,MAAM,KAAK,KAAK,GAAG,MAAM,UAAU;GAC5E,MAAM,WACJ,cAAc,KAAK,MAAM,KAAK,KAAK,OAAO,SAAS,aAC/C,4BACA;GACN,MAAM,IAAI,UAAU,oDAAoD,UAAU;EACpF;EACA,MAAM,OAAO,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,KAAK,GAAG,MAAM;EAC/D,MAAM,IAAI,UAAU,uBAAuB,KAAK,IAAI,OAAO,WAAW,cAAc;CACtF;CACA,IACE,WAAW,SACV,CAAC,UACA,OAAO,WAAW,YAClB,OAAQ,OAAuB,qBAAqB,aAEtD,MAAM,IAAI,UAAU,4DAA4D;CAElF,IAAI,eAAe,SAAS,CAAC,cAAc,OAAO,eAAe,WAC/D,MAAM,IAAI,UAAU,oEAAoE;CAE1F,IAAI,eAAe,QAAQ,OAAO,KAAK,uBAAuB,MAC5D,MAAM,IAAI,UAAU,yEAAyE;CAE/F,IAAI,eAAe,QAAQ,OAAO,KAAK,uBAAuB,MAC5D,MAAM,IAAI,UAAU,qEAAqE;CAE3F,IAAI,eAAe,QAAQ,OAAO,KAAK,cAAc,MACnD,MAAM,IAAI,UAAU,+DAA+D;CAErF,OAAO,OAAO,OAAO;EACnB,GAAG,wBAAwB,OAAO,IAAI;EAC9B;EACI;EACZ,eAAe,2BAA2B,aAAa;CACzD,CAAC;AACH;AAEA,SAAS,2BAA2B,OAAuD;CACzF,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,wBAAwB,OAAO,oCAAoC;CAE5E,IAAI,CAAC,cAAc,KAAK,GACtB,MAAM,IAAI,UACR,iFACF;CAEF,MAAM,SAAwD,CAAC;CAC/D,KAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,GAAG;EACnD,IAAI,CAAC,MAAM,QAAQ,QAAQ,GACzB,MAAM,IAAI,UAAU,sCAAsC,IAAI,kBAAkB;EAElF,OAAO,OAAO,wBAAwB,UAAU,sCAAsC,KAAK;CAC7F;CACA,OAAO,wBAAwB,MAAM;AACvC;AAEA,SAAS,uBACP,YACuB;CACvB,OAAO,WAAW,KAAK,EAAE,cAAc,cAAc;EACnD,MAAM,eAAe;EAGrB,MAAM,KAAK,QAAQ;EACnB,MAAM,cAAc,QAAQ;EAC5B,MAAM,YAAY,QAAQ;EAC1B,MAAM,eAAe,QAAQ;EAC7B,MAAM,gBAAgB,QAAQ;EAC9B,MAAM,UAAU,QAAQ;EACxB,MAAM,uBAAuB,aAAa;EAC1C,MAAM,eAAe,QAAQ;EAC7B,IAAI,OAAO,cACT,MAAM,IAAI,UACR,iDAAiD,aAAa,mBAAmB,GAAG,EACtF;EAEF,IAAI,yBAAyB,KAAA,GAC3B,MAAM,IAAI,UAAU,sCAAsC,GAAG,+BAA+B;EAE9F,MAAM,kBAAkB,sBACtB,sBACA,qCAAqC,GAAG,kBAC1C;EACA,IAAI,CAAC,cAAc,eAAe,GAChC,MAAM,IAAI,UACR,qCAAqC,GAAG,oCAC1C;EAEF,MAAM,UAAU,sBACd,cACA,qCAAqC,GAAG,OAC1C;EACA,MAAM,OACJ,QAAQ,SAAS,QACb,OAAO,OAAO;GACZ,GAAG;GACH,uBAAuB,+BAA+B,QAAQ,qBAAqB;EACrF,CAAC,IACD;EACN,MAAM,WACJ,kBAAkB,KAAA,IACd,KAAA,IACA,sBACE,eACA,qCAAqC,GAAG,eAC1C;EACN,MAAM,UAAU,aAAa,KAAK,OAAO;EACzC,OAAO,OAAO,OAAO;GACnB;GACA;GACA;GACA;GACA,GAAI,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS;GAC7C;GACA;GACA;EACF,CAAC;CACH,CAAC;AACH;AAEA,SAAS,iBAAiB,OAAwD;CAChF,OAAO,QACL,UAAU,MAAM,mBAAmB,MAAM,kBAAkB,MAAM,WAAW,MAAM,WACpF;AACF;AAEA,SAAS,cAAc,OAAmC;CACxD,MAAM,kBAAkB,MAAM;CAC9B,MAAM,iBAAiB,MAAM;CAC7B,MAAM,UAAU,MAAM;CACtB,MAAM,aAAa,MAAM;CACzB,OAAO,OAAO,OAAO;EACnB,GAAI,oBAAoB,KAAA,IAAY,CAAC,IAAI,EAAE,iBAAiB,gBAAgB,KAAK,KAAK,EAAE;EACxF,GAAI,mBAAmB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB,eAAe,KAAK,KAAK,EAAE;EACrF,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS,QAAQ,KAAK,KAAK,EAAE;EAChE,GAAI,eAAe,KAAA,IAAY,CAAC,IAAI,EAAE,YAAY,WAAW,KAAK,KAAK,EAAE;CAC3E,CAAC;AACH;AAEA,SAAS,aAAa,MAA8B;CAClD,MAAM,YAAY,KAAK;CACvB,MAAM,eAAe,KAAK;CAC1B,MAAM,kBAAkB,KAAK;CAC7B,MAAM,OAAO,KAAK;CAClB,OAAO,OAAO,OAAO;EACnB;EACA,GAAI,iBAAiB,KAAA,IAAY,CAAC,IAAI,EAAE,aAAa;EACrD,GAAI,oBAAoB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB;EAC3D,MAAM,KAAK,KAAK,IAAI;CACtB,CAAC;AACH;AAEA,SAAS,8BACP,OACA,OACiC;CACjC,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,UAAU,6BAA6B,MAAM,+BAA+B;CAExF,OAAO,wCACL,OACA,4BAA4B,MAAM,UACpC;AACF;AAEA,SAAS,uBACP,UACA,MACA,aACA,YACA,OACA,MACmC;CACnC,MAAM,gBAAgB,2BAA2B,KAAK,aAAa;CACnE,MAAM,SACJ,KAAK,WAAW,OACX,EAAE,MAAM,OAAO,IAChB,KAAK,OAAO,SAAS,UAClB;EACC,MAAM;EACN,WAAW,KAAK,OAAO;EACvB,iBAAiB,EAAE,GAAG,YAAY;CACpC,IACC;EACC,MAAM;EACN,WAAW,KAAK,OAAO;EACvB,SAAS,EAAE,GAAG,KAAK,OAAO,QAAQ;EAClC,iBAAiB,EAAE,GAAG,YAAY;CACpC;CACR,MAAM,WAAW;EACf,gBAAgB;EAChB,UAAU,SAAS,KAAK,aAAa;GACnC,IAAI,QAAQ;GACZ,SAAS,QAAQ;GACjB,YAAY,QAAQ;GACpB,MAAM,QAAQ;GACd,cAAc,QAAQ,YAAY;GAClC,yBAAyB,cAAc,QAAQ,eAAe;EAChE,EAAE;EACF,QAAQ;GACN;GACA,kBAAkB,KAAK;GACvB,iBAAiB,KAAK,WAAW;GACjC,aAAa;GACb,YAAY,KAAK;GACjB,MAAM,KAAK,SAAS,OAAO,OAAO,EAAE,GAAG,KAAK,KAAK;GACjD,gBAAgB;GAChB,gBAAgB,KAAK;GACrB,oBAAoB,KAAK;GACzB,gBAAgB;GAChB,eAAe;EACjB;CACF;CACA,OAAO,2BACL;EAAE,GAAG;EAAU,QAAQ,cAAc,QAAQ;CAAE,GAC/C,yCACF;AACF;AAEA,SAAS,2BACP,UAC+D;CAC/D,IAAI,aAAa,MAAM,OAAO,EAAE,MAAM,OAAO;CAC7C,IAAI,MAAM,QAAQ,QAAQ,GACxB,OAAO;EACL,MAAM;EACN,OAAO,SAAS;EAChB,QAAQ,cAAc,QAAQ;CAChC;CAEF,MAAM,SAAS;CACf,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK;CACtC,OAAO;EACL,MAAM;EACN;EACA,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAO,OAAO,IAAI,EAAE,UAAU,IAAI,CAAC;EACpE,QAAQ,cAAc,MAAM;CAC9B;AACF;AAEA,SAAS,sBAAyB,OAAU,OAAkB;CAC5D,IAAI;CACJ,IAAI;EACF,WAAW,KAAK,MAAM,gBAAgB,KAAK,CAAC;CAC9C,SAAS,OAAO;EACd,MAAM,IAAI,UAAU,GAAG,MAAM,0BAA0B,EAAE,MAAM,CAAC;CAClE;CACA,OAAO,wBAAwB,QAAQ;AACzC;AAEA,SAAS,yBACP,SACA,SACqB;CACrB,MAAM,OAAO,cAAc,SAAS;EAAC;EAAS;EAAU;EAAQ;CAAc,GAAG,OAAO;CACxF,KAAK,SACH,KAAK,WAAW,OACZ,OACA,cACE,KAAK,QACL;EAAC;EAAS;EAAU;EAAa;EAAU;CAAY,GACvD,GAAG,QAAQ,QACb;CACN,KAAK,OAAO,cAAc,KAAK,MAAM,CAAC,QAAQ,KAAK,GAAG,GAAG,QAAQ,MAAM;CACvE,MAAM,WAAW,sBAAsB,MAAwC,OAAO;CACtF,+BAA+B,UAAU,OAAO;CAChD,OAAO;AACT;AAEA,SAAS,cACP,OACA,QACA,SACyB;CACzB,IAAI,CAAC,cAAc,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,QAAQ,wBAAwB;CAClF,MAAM,aAAa,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,QAAQ,CAAC,OAAO,SAAS,GAAG,CAAC;CAC3E,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,UAAU,GAAG,QAAQ,4BAA4B,WAAW,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG;CAE3F,OAAO,OAAO,YACZ,OAAO,SAAS,UAAW,OAAO,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,OAAO,MAAM,MAAM,CAAC,IAAI,CAAC,CAAE,CACxF;AACF;AAEA,SAAS,cAAc,OAAkD;CACvE,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG,OAAO;CACxE,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;AAEA,SAAS,kBACP,OACA,UACA,UACyC;CACzC,IAAI,UAAU,MAAM,OAAO,CAAC;CAC5B,MAAM,cAA6C,OAAO,YACxD,SAAS,KAAK,YAAY,CAAC,QAAQ,IAAI,IAAI,CAAC,CAC9C;CACA,IAAI,SAAS,WAAW,GAAG,OAAO,wBAAwB,WAAW;CACrE,IAAI,MAAM,SAAS,SAAS;EAC1B,MAAM,OAAO,MAAM,WAAW,SAAS;EACvC,KAAK,MAAM,WAAW,UAAU,YAAY,QAAQ,MAAM;EAC1D,OAAO,wBAAwB,WAAW;CAC5C;CACA,MAAM,cAAc,SAAS,QAAQ,KAAK,YAAY,MAAM,MAAM,QAAQ,QAAQ,KAAM,CAAC;CACzF,IAAI,gBAAgB,GAClB,MAAM,IAAI,MACR,0FACF;CAEF,KAAK,MAAM,WAAW,UACpB,YAAY,QAAQ,MAAO,MAAM,WAAW,MAAM,QAAQ,QAAQ,MAAQ;CAE5E,OAAO,wBAAwB,WAAW;AAC5C;AAQA,SAAS,0BACP,UACA,OACA,SACkB;CAClB,OAAO,QAAQ,wBAAwB,wBAAwB,UAAU,OAAO,CAAC,IAAI;AACvF;AAEA,SAAS,wBACP,SACA,UACA,OAC4D;CAC5D,IAAI,CAAC,OAAO,OAAO;EAAE;EAAS;CAAS;CACvC,OAAO;EACL,SAAS,sBAAsB,SAAS,iDAAiD;EACzF,UAAU,wBACR,wBAAwB,UAAU,kDAAkD,CACtF;CACF;AACF;AAEA,SAAS,uBACP,MACA,WACoB;CACpB,MAAM,SAAS,KAAK,OAAO;CAC3B,IAAI,OAAO,SAAS,QAAQ,OAAO,KAAA;CACnC,MAAM,YAAY,OAAO,gBAAgB;CACzC,OAAO,cAAc,OAAO,KAAA,IAAY;AAC1C;AAEA,SAAS,uBAA0D,OAAU,OAAmB;CAC9F,OAAO,QAAQ,sBAAsB,OAAO,gCAAgC,IAAI;AAClF;AAEA,SAAS,2BAA2B,MAM3B;CACP,IAAI,KAAK,cAAc,KAAA,KAAa,KAAK,MAAM,KAAK,SAAS,cAAc;CAC3E,KAAK,IAAI,kBAAkB,KAAK,QAAQ,GAAG,gDAAgD;EACzF,OAAO,KAAK;EACZ,YAAY,KAAK;EACjB,eAAe;CACjB,CAAC;AACH;AAEA,SAAS,gBAAgB,WAAmD;CAC1E,IAAI,cAAc,KAAA,GAAW,OAAO,KAAA;CACpC,IAAI,CAAC,OAAO,cAAc,SAAS,KAAK,aAAa,KAAK,YAAY,YACpE,MAAM,IAAI,UACR,sFACF;CAEF,OAAO;AACT;AAEA,eAAe,iBACb,WACA,QACA,cACY;CACZ,IAAI,CAAC,QAAQ,OAAO;CACpB,IAAI,OAAO,SAAS;EAClB,UAAe,YAAY,CAAC,CAAC;EAC7B,MAAM,YAAY,MAAM;CAC1B;CACA,OAAO,IAAI,SAAY,SAAS,WAAW;EACzC,IAAI;EACJ,MAAM,gBAAsB;GAC1B,OAAO,oBAAoB,SAAS,OAAO;GAC3C,IAAI,iBAAiB,aAAa,eAAe;EACnD;EACA,MAAM,gBAAsB;GAC1B,IAAI,iBAAiB,GAAG;IACtB,QAAQ;IACR,OAAO,YAAY,MAAM,CAAC;IAC1B;GACF;GACA,kBAAkB,iBAAiB;IACjC,QAAQ;IACR,OAAO,YAAY,MAAM,CAAC;GAC5B,GAAG,YAAY;EACjB;EACA,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EACxD,UAAU,MACP,UAAU;GACT,QAAQ;GACR,IAAI,OAAO,SAAS,OAAO,YAAY,MAAM,CAAC;QACzC,QAAQ,KAAK;EACpB,IACC,UAAU;GACT,QAAQ;GACR,OAAO,OAAO,UAAU,YAAY,MAAM,IAAI,KAAK;EACrD,CACF;CACF,CAAC;AACH;AAEA,eAAe,YACb,WACA,QACwB;CACxB,IAAI,cAAc,KAAA,KAAa,QAAQ,SAAS,OAAO,KAAA;CACvD,IAAI;EACF,OAAO,MAAM,iBACX,QAAQ,QAAQ,CAAC,CAAC,WAAW;GAC3B,IAAI,QAAQ,SAAS,MAAM,YAAY,MAAM;GAC7C,OAAO,UAAU;EACnB,CAAC,GACD,QACA,CACF;CACF,SAAS,OAAO;EACd,IAAI,QAAQ,SAAS,OAAO,KAAA;EAC5B,MAAM;CACR;AACF;AAEA,SAAS,oBAAoB,SAA0B;CACrD,IAAI,QAAQ,KAAK,SAAS,iBAAiB,OAAO;CAClD,MAAM,eAAe,+BAA+B,QAAQ,KAAK,qBAAqB;CACtF,IAAI,iBAAiB,GAAG,OAAO;CAC/B,OAAO,KAAK,IAAI,eAAe,KAAK,UAAa;AACnD;AAEA,SAAS,0BACP,SACA,QACA,YAAY,GACO;CACnB,MAAM,SAAS,YAAY,MAAM;CACjC,OAAO;EACL,YAAY,QAAQ;EACpB,QAAQ;EACR,QAAQ,GAAG,OAAO,KAAK,IAAI,OAAO;EAClC,gBAAgB;EAChB,YAAY;EACZ,OAAO,UAAU;CACnB;AACF;AAEA,SAAS,YAAY,QAA4B;CAC/C,OAAO,OAAO,kBAAkB,QAC5B,OAAO,SACP,IAAI,aAAa,6BAA6B,YAAY;AAChE;;;;;;AAOA,SAAS,eACP,QACA,MAMoB;CACpB,IAAI,CAAC,QAAQ,OAAO,KAAA;CACpB,IAAI,OAAO,UAAU;EACnB,MAAM,YAAY,OAAO,SAAS;GAChC,SAAS,KAAK;GACd,UAAU,OAAO;GACjB,cAAc,KAAK;GACnB,cAAc,KAAK;EACrB,CAAC;EACD,IAAI,cAAc,KAAA,GAAW;GAC3B,IAAI,OAAO,aAAa,KAAA,GACtB,MAAM,IAAI,MACR,0BAA0B,KAAK,QAAQ,GAAG,gDAC5C;GAEF;EACF;EACA,mBAAmB,WAAW,0BAA0B,KAAK,QAAQ,GAAG,GAAG;EAC3E,OAAO,KAAK,iBAAiB,KAAA,IAAY,YAAY,KAAK,IAAI,WAAW,KAAK,YAAY;CAC5F;CACA,IAAI,OAAO,YAAY,MAAM,OAAO,KAAA;CACpC,MAAM,YAAY,OAAO,UACpB,OAAO,WAAW,cAAc,OAAO,SAAS,KAAK,QAAQ,EAAE,IAAK,KAAK,cAC1E,OAAO,WAAW,KAAK,IAAI,GAAG,KAAK,YAAY;CACnD,OAAO,KAAK,iBAAiB,KAAA,IAAY,YAAY,KAAK,IAAI,WAAW,KAAK,YAAY;AAC5F;AAEA,SAAS,qBAAqB,QAAwC;CACpE,IAAI,CAAC,QAAQ;CACb,IAAI,OAAO,aAAa,KAAA,GAAW,mBAAmB,OAAO,UAAU,uBAAuB;CAC9F,KAAK,MAAM,CAAC,WAAW,WAAW,OAAO,QAAQ,OAAO,WAAW,CAAC,CAAC,GACnE,mBAAmB,QAAQ,yBAAyB,UAAU,GAAG;AAErE;AAEA,SAAS,mBAAmB,OAAe,OAAqB;CAC9D,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GACrC,MAAM,IAAI,MAAM,GAAG,MAAM,sCAAsC;AAEnE;AAEA,SAAS,wBACP,WACA,cACA,WACoB;CACpB,IAAI,cAAc,KAAA,GAChB,mBAAmB,WAAW,iCAAiC,UAAU,EAAE;CAE7E,IAAI,iBAAiB,KAAA,GAAW,OAAO;CACvC,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MACR,iCAAiC,UAAU,oDAC7C;CAEF,IAAI,YAAY,cACd,MAAM,IAAI,MACR,iCAAiC,UAAU,KAAK,UAAU,0CAA0C,aAAa,EACnH;CAEF,OAAO;AACT;AAEA,SAAS,cAAc,SAAiC,WAA2B;CACjF,MAAM,SAAS,QAAQ,cAAc;CACrC,mBAAmB,QAAQ,yBAAyB,UAAU,GAAG;CACjE,OAAO;AACT;AAEA,SAAS,YAAiC;CACxC,OAAO;EACL,OAAO;EACP,QAAQ;GAAE,OAAO;GAAG,QAAQ;EAAE;EAC9B,MAAM;GAAE,MAAM;GAAY,KAAK;EAAE;CACnC;AACF;AAEA,SAAS,aACP,SACA,UACA,QAAQ,OACa;CACrB,IAAI,SAAS,SAAS,GAAG,OAAO,mBAAmB,UAAU,KAAK;CAClE,IAAI,QAAQ,KAAK,SAAS,iBAAiB,OAAO,UAAU;CAC5D,OAAO;EAAE,OAAO;EAAM,QAAQ;EAAM,MAAM;GAAE,MAAM;GAAc,KAAK;EAAK;CAAE;AAC9E;AAEA,SAAS,mBACP,UACA,QAAQ,OACa;CACrB,MAAM,QAAQ,SAAS,OAAO,YAAY,QAAQ,UAAU,IAAI,IAC5D,SACE,SAAS,KAAK,YAAY,QAAQ,SAAS,CAAC,GAC5C,OACA,SACA,IACF,IACA;CACJ,MAAM,SAAS,SAAS,OAAO,YAAY,QAAQ,WAAW,IAAI,IAC7D,OAAO,YACL;EAAC;EAAS;EAAU;EAAa;EAAU;CAAY,CAAC,CAAW,SAAS,UAC3E,UAAU,WACV,UAAU,YACV,SAAS,MAAM,YAAY,QAAQ,SAAS,WAAW,KAAA,CAAS,IAC5D,CACE,CACE,OACA,SACE,SAAS,KAAK,YAAY,QAAQ,SAAS,UAAU,CAAC,GACtD,OACA,UAAU,SACV,IACF,CACF,CACF,IACA,CAAC,CACP,CACF,IACA;CACJ,MAAM,OAAO,wBACX,SAAS,KAAK,YAAY,QAAQ,IAAI,GACtC,KACF;CACA,OAAO;EACL;EACA;EACA;EACA,GAAI,KAAK,SAAS,eACd,EACE,cAAc,SAAS,SAAS,IAAI,YAAY,GAAG,OAAO,YAAY,EACxE,IACA,CAAC;CACP;AACF;AAEA,SAAS,aAAa,SAAsC;CAC1D,OAAO,QAAQ,KAAK,SAAS,eAAgB,QAAQ,gBAAgB,IAAK,QAAQ,KAAK;AACzF;AAEA,SAAS,YAAY,SAA8B,cAA0C;CAC3F,MAAM,QAAQ,aAAa,OAAO;CAClC,OAAO,QAAQ,KAAK,SAAS,gBAAgB,iBAAiB,KAAA,IAC1D,KAAK,IAAI,OAAO,YAAY,IAC5B;AACN;AAEA,SAAS,wBACP,OACA,QAAQ,OACW;CACnB,IAAI,MAAM,MAAM,SAAS,KAAK,SAAS,YAAY,GACjD,OAAO;EAAE,MAAM;EAAc,KAAK;CAAK;CAEzC,MAAM,MAAM,SACV,MAAM,KAAK,SAAS,KAAK,OAAO,CAAC,GACjC,OACA,eACF;CACA,OAAO,MAAM,MAAM,SAAS,KAAK,SAAS,WAAW,IACjD;EAAE,MAAM;EAAa;CAAI,IACzB;EAAE,MAAM;EAAY;CAAI;AAC9B;AAEA,SAAS,cACP,YACA,OACkD;CAClD,MAAM,SAAS,WAAW,KAAK,cAAc,UAAU,QAAQ,KAAK;CACpE,OAAO;EACL,OAAO,SAAS,OAAO,IAAI,YAAY,GAAG,OAAO,gBAAgB;EACjE,YAAY,wBACV,OAAO,KAAK,UAAU,MAAM,IAAI,GAChC,KACF;CACF;AACF;AAEA,SAAS,SACP,QACA,OACA,OACA,UAAU,OACF;CACR,MAAM,MAAM,OAAO,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC;CAC5D,IAAI,UAAU,UAAU,CAAC,OAAO,cAAc,GAAG,IAAI,CAAC,OAAO,SAAS,GAAG,IACvE,MAAM,IAAI,WACR,uBAAuB,MAAM,aAAa,UAAU,2BAA2B,iBACjF;CAEF,OAAO;AACT;;;;;;;;;;;;AAaA,SAAS,oBACP,QACA,WAC2C;CAC3C,IAAI,CAAC,QAAQ,OAAO,KAAA;CACpB,IAAI,MAAM,QAAQ,MAAM,GAAG;EACzB,MAAM,MAAM,OAAO,QAAQ,MAAM,EAAE,eAAe,SAAS;EAC3D,OAAO,IAAI,SAAS,IAAI,MAAM,KAAA;CAChC;CACA,MAAM,SAAS;CACf,MAAM,MAAM,OAAO,cAAc,CAAC;CAClC,MAAM,WAAW,OAAO,QAAQ,CAAC;CACjC,MAAM,SAAS,CAAC,GAAG,KAAK,GAAG,QAAQ;CACnC,OAAO,OAAO,SAAS,IAAI,SAAS,KAAA;AACtC;;;AClsDA,SAAgB,4BACd,UAAyC,CAAC,GACzB;CACjB,IAAI,QAAQ,eAAe,CAAC,QAAQ,QAClC,MAAM,IAAI,UACR,kGACF;CAEF,MAAM,WAAW,IAAI,gBAAgB,QAAQ,QAAQ;CACrD,IAAI,QAAQ,sBAAsB,OAChC,SAAS,SAAS,kBAAkB,QAAQ,UAAU,CAAC;CAEzD,IAAI,QAAQ,QACV,KAAK,MAAM,cAAc,QAAQ,eAAe,6BAC9C,SAAS,SAAS,mBAAmB,YAAY,EAAE,QAAQ,QAAQ,OAAO,CAAC,CAAC;CAGhF,OAAO;AACT;;;;;;;ACiDA,SAAgB,iBAAiB,MAAwC;CACvE,QAAQ,KAAK,WAAb;EACE,KAAK,eACH,OAAO;GACL,WAAW;GACX,cAAc,KAAK;GACnB,iBAAiB,KAAK;GACtB,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK,aAAa,KAAK,KAAK,YAAY,GAAG,QAAQ;EACzF;EACF,KAAK,UACH,OAAO;GACL,WAAW;GACX,cAAc,KAAK;GACnB,iBAAiB,KAAK;GACtB,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK,aAAa,KAAK,KAAK,YAAY,GAAG,QAAQ;EACzF;EACF,KAAK,QACH,OAAO;GACL,WAAW;GACX,cAAc,KAAK;GACnB,iBAAiB;GACjB,MAAM,OAAO,KAAK,aAAa,KAAK,QAAQ,aAAa,KAAK,KAAK,YAAY,GAAG,QAAQ;EAC5F;CACJ;AACF;AAEA,SAAS,aAAa,KAAkB,cAA+C;CACrF,IAAI,IAAI,OAAO,OAAO;CACtB,IAAI,CAAC,cACH,MAAM,IAAI,MACR,2IAEF;CAEF,OAAO;EAAE,GAAG;EAAK,OAAO;CAAa;AACvC"}