@tangle-network/agent-runtime 0.189.0 → 0.190.0

package/dist/candidate-execution-CQYU8E5a.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"candidate-execution-CQYU8E5a.js","names":[],"sources":["../src/candidate-execution/builder.ts","../src/candidate-execution/claim-file-store.ts","../src/candidate-execution/dispose.ts","../src/candidate-execution/protected-model-grant.ts","../src/candidate-execution/recover.ts"],"sourcesContent":["import type { CodeSurface } from '@tangle-network/agent-eval/campaign'\nimport { verifyCodeSurface } from '@tangle-network/agent-eval/campaign'\nimport type {\n  AgentCandidateCodeDisabled,\n  AgentCandidateCodeNoOp,\n  AgentCandidateExecution,\n  AgentCandidateGitHubRepository,\n  AgentCandidateKnowledge,\n  AgentCandidateMemoryPolicy,\n  AgentCandidateProfile,\n  AgentProfile,\n  AgentProfileDiff,\n} from '@tangle-network/agent-interface'\nimport { type AgentCandidateBundleInput, sealAgentCandidateBundle } from './bundle'\nimport { embeddedCandidateArtifact } from './digest'\nimport {\n  applyExactAgentProfileDiff,\n  freezeGenericAgentCandidateProfile,\n  parseExactAgentProfile,\n  parseExactAgentProfileDiff,\n  parseExactCandidateProfile,\n} from './profile'\n\n/** A complete profile that can be frozen without losing behavior. */\nexport type AgentCandidateProfileSource =\n  | {\n      kind: 'profile'\n      profile: AgentProfile\n    }\n  | {\n      kind: 'profile-diffs'\n      base: AgentProfile\n      /** Applied in order before the resulting profile is frozen into the bundle. */\n      diffs: readonly AgentProfileDiff[]\n    }\n  | {\n      kind: 'candidate-profile'\n      /** Already converted to the closed, secret-free candidate profile contract. */\n      profile: AgentCandidateProfile\n    }\n\n/** The only accepted path from an agent-eval code candidate to executable bytes. */\nexport interface AgentCandidateCodeSurfaceSource {\n  kind: 'code-surface'\n  surface: CodeSurface\n  repository: AgentCandidateGitHubRepository\n  /** Optional parent directory used to resolve a relative `surface.worktreeRef`. */\n  worktreeDir?: string\n}\n\n/** Explicit control/no-op code or one finalized CodeSurface whose bytes must still verify. */\nexport type AgentCandidateCodeSource =\n  | AgentCandidateCodeDisabled\n  | AgentCandidateCodeNoOp\n  | AgentCandidateCodeSurfaceSource\n\n/** Complete measured surfaces and execution policy compiled into one candidate bundle. */\nexport interface BuildAgentCandidateBundleInput {\n  profile: AgentCandidateProfileSource\n  code: AgentCandidateCodeSource\n  execution: AgentCandidateExecution\n  knowledge?: AgentCandidateKnowledge\n  memory: AgentCandidateMemoryPolicy\n}\n\n/**\n * Compile one measured profile/code candidate into the immutable execution\n * contract. Code bytes are re-read and verified by agent-eval before they are\n * embedded. The returned bundle is schema-validated, canonically digested, and\n * deeply immutable; call `verifyAgentCandidateBundle` at the execution boundary\n * to re-read external memory, repository, and workspace artifacts.\n */\nexport function buildAgentCandidateBundle(\n  input: BuildAgentCandidateBundleInput,\n): ReturnType<typeof sealAgentCandidateBundle> {\n  const bundle: AgentCandidateBundleInput = {\n    kind: 'agent-candidate-bundle',\n    digestAlgorithm: 'rfc8785-sha256',\n    profile: compileCandidateProfile(input.profile),\n    code: compileCandidateCode(input.code),\n    execution: input.execution,\n    ...(input.knowledge !== undefined ? { knowledge: input.knowledge } : {}),\n    memory: input.memory,\n  }\n  return sealAgentCandidateBundle(bundle)\n}\n\nfunction compileCandidateProfile(source: AgentCandidateProfileSource): AgentCandidateProfile {\n  if (source.kind === 'candidate-profile') {\n    return parseExactCandidateProfile(source.profile)\n  }\n\n  if (source.kind === 'profile') {\n    return freezeGenericAgentCandidateProfile(source.profile)\n  }\n\n  if (source.kind !== 'profile-diffs') {\n    throw new Error(\n      `unsupported candidate profile source: ${String((source as { kind?: unknown }).kind)}`,\n    )\n  }\n  if (source.diffs.length === 0) {\n    throw new Error('profile-diffs source requires at least one AgentProfileDiff')\n  }\n  let profile = parseExactAgentProfile(source.base, 'base profile')\n  for (const [index, inputDiff] of source.diffs.entries()) {\n    const diff = parseExactAgentProfileDiff(inputDiff, `profile diff ${index}`)\n    profile = applyExactAgentProfileDiff(profile, diff, `profile diff ${index}`)\n  }\n  return freezeGenericAgentCandidateProfile(profile)\n}\n\nfunction compileCandidateCode(source: AgentCandidateCodeSource): AgentCandidateBundleInput['code'] {\n  if (source.kind === 'disabled' || source.kind === 'no-op') return source\n  if (source.kind !== 'code-surface') {\n    throw new Error(\n      `unsupported candidate code source: ${String((source as { kind?: unknown }).kind)}`,\n    )\n  }\n\n  const verified = verifyCodeSurface(source.surface, source.worktreeDir)\n  const patch = embeddedCandidateArtifact(verified.patchBytes)\n  if (\n    patch.sha256 !== source.surface.patch.sha256 ||\n    patch.byteLength !== source.surface.patch.byteLength\n  ) {\n    throw new Error('verified CodeSurface patch bytes do not match its content identity')\n  }\n  return {\n    kind: 'git-patch',\n    repository: source.repository,\n    baseCommit: source.surface.baseCommit,\n    baseTree: source.surface.baseTree,\n    candidateTree: source.surface.candidateTree,\n    patch: { format: 'git-diff-binary', artifact: patch },\n  }\n}\n","import { randomUUID } from 'node:crypto'\nimport { linkSync } from 'node:fs'\nimport { mkdir, open, unlink } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport type { Sha256Digest } from '@tangle-network/agent-interface'\n\nimport {\n  type AgentCandidateExecutionAttemptRecord,\n  type AgentCandidateExecutionAttemptRef,\n  type AgentCandidateExecutionClaim,\n  type AgentCandidateExecutionClaimResult,\n  type AgentCandidateExecutionClaimStore,\n  type AgentCandidateExecutionFinishResult,\n  type AgentCandidateExecutionLease,\n  type AgentCandidateExecutionPhase,\n  type AgentCandidateExecutionPhaseResult,\n  type AgentCandidateExecutionRecoveryEvidence,\n  type AgentCandidateExecutionStageResult,\n  type AgentCandidateExecutionTerminalRecord,\n  type AgentCandidateExecutionTerminalResult,\n  type AgentCandidateRetryRejection,\n  candidateClaimFileInternals,\n} from './claim'\nimport {\n  assertRecoveryMatchesStaged,\n  assertTerminalAllowedInPhase,\n  assertTerminalMatchesClaim,\n  assertTerminalMatchesStaged,\n  recoveredTerminalRecord,\n  rejectedFinish,\n  rejectedStage,\n  requireStagedTerminal,\n  sealTerminalDigest,\n  terminalRecord,\n} from './claim-terminal'\nimport { canonicalCandidateBytes } from './digest'\n\nconst {\n  assertExpiredLease,\n  assertLease,\n  assertSameSlot,\n  assertUnexpiredLease,\n  attemptRecord,\n  claimSlot,\n  leaseDigest,\n  newLease,\n  readClaim,\n  readClaimIfPresent,\n  readTerminal,\n  readTerminalIfPresent,\n  readTransitionIfPresent,\n  rejectedExistingClaim,\n  rejectedRetry,\n  retryRejection,\n  sealAttemptRef,\n  sealClaim,\n  sealLease,\n} = candidateClaimFileInternals\n\nexport interface FileAgentCandidateExecutionClaimStoreOptions {\n  /** Evaluator-owned directory shared by every process allowed to execute candidates. */\n  directory: string\n  /** Testable evaluator clock; defaults to `Date.now`. */\n  now?: () => number\n}\n\n/** Cross-process lifecycle implemented as fsynced, create-if-absent records. */\nexport class FileAgentCandidateExecutionClaimStore implements AgentCandidateExecutionClaimStore {\n  private readonly directory: string\n  private readonly now: () => number\n\n  constructor(options: FileAgentCandidateExecutionClaimStoreOptions) {\n    if (options.directory.length === 0) {\n      throw new Error('candidate execution claim directory must not be empty')\n    }\n    this.directory = options.directory\n    this.now = options.now ?? Date.now\n  }\n\n  async tryClaim(\n    requested: AgentCandidateExecutionClaim,\n  ): Promise<AgentCandidateExecutionClaimResult> {\n    const claim = sealClaim(requested)\n    await mkdir(this.directory, { recursive: true })\n    const claimPath = this.claimPath(claim)\n    const existing = await readClaimIfPresent(claimPath)\n    if (existing) {\n      assertSameSlot(existing.claim, claim, claimPath)\n      return rejectedExistingClaim(existing.claim, claim)\n    }\n    assertUnexpiredLease(claim.leaseExpiresAtMs, this.now())\n    const retryFailure = await this.retryFailure(claim)\n    if (retryFailure) return rejectedRetry(claim, retryFailure)\n\n    const lease = newLease(claim)\n    const acquired = await writeRecordIfAbsent(this.directory, claimPath, {\n      ...claim,\n      phase: 'claimed',\n      leaseDigest: leaseDigest(lease),\n    })\n    if (acquired) return Object.freeze({ acquired: true, claim, lease })\n\n    const winner = await readClaim(claimPath)\n    assertSameSlot(winner.claim, claim, claimPath)\n    return rejectedExistingClaim(winner.claim, claim)\n  }\n\n  async getAttempt(\n    requestedAttempt: AgentCandidateExecutionAttemptRef,\n  ): Promise<AgentCandidateExecutionAttemptRecord | undefined> {\n    return await this.storedAttempt(sealAttemptRef(requestedAttempt))\n  }\n\n  async markCandidateMayRun(\n    requestedLease: AgentCandidateExecutionLease,\n  ): Promise<AgentCandidateExecutionPhaseResult> {\n    const lease = sealLease(requestedLease)\n    const claimPath = this.claimPath(lease)\n    const stored = await readClaim(claimPath)\n    assertSameSlot(stored.claim, lease, claimPath)\n    assertLease(stored.leaseDigest, stored.claim.leaseExpiresAtMs, lease)\n    const state = await this.transitionState(stored.claim)\n    if (state.phase === 'candidate-may-run') {\n      return Object.freeze({ marked: false, phase: 'candidate-may-run' })\n    }\n    if (state.staged) {\n      throw new Error('candidate execution terminal was staged before candidate-may-run phase')\n    }\n    assertUnexpiredLease(stored.claim.leaseExpiresAtMs, this.now())\n    const marked = await writeRecordIfAbsent(\n      this.directory,\n      this.transitionPath(stored.claim, 1),\n      {\n        kind: 'candidate-execution-phase',\n        executionId: stored.claim.executionId,\n        attempt: stored.claim.attempt,\n        executionPlanDigest: stored.claim.executionPlanDigest,\n        phase: 'candidate-may-run',\n      },\n      this.ownerPublication(stored.claim),\n    )\n    if (marked) return Object.freeze({ marked: true, phase: 'candidate-may-run' })\n    const winner = await this.transitionState(stored.claim)\n    if (winner.phase === 'candidate-may-run') {\n      return Object.freeze({ marked: false, phase: 'candidate-may-run' })\n    }\n    throw new Error('candidate execution terminal was staged before candidate-may-run phase')\n  }\n\n  async stageTerminal(\n    requestedLease: AgentCandidateExecutionLease,\n    result: AgentCandidateExecutionTerminalResult,\n  ): Promise<AgentCandidateExecutionStageResult> {\n    const lease = sealLease(requestedLease)\n    const claimPath = this.claimPath(lease)\n    const stored = await readClaim(claimPath)\n    assertSameSlot(stored.claim, lease, claimPath)\n    assertLease(stored.leaseDigest, stored.claim.leaseExpiresAtMs, lease)\n    const terminal = terminalRecord(stored.claim, result)\n    const state = await this.transitionState(stored.claim)\n    if (state.staged) return rejectedStage(state.staged, terminal)\n    assertTerminalAllowedInPhase(state.phase, terminal)\n    assertUnexpiredLease(stored.claim.leaseExpiresAtMs, this.now())\n    const transition = state.phase === 'claimed' ? 1 : 2\n    const staged = await writeRecordIfAbsent(\n      this.directory,\n      this.transitionPath(stored.claim, transition),\n      {\n        kind: 'candidate-execution-pending-terminal',\n        terminal,\n      },\n      this.ownerPublication(stored.claim),\n    )\n    if (staged) return Object.freeze({ staged: true, terminal })\n    const winner = await this.transitionState(stored.claim)\n    if (!winner.staged) {\n      throw new Error('candidate execution phase transition won while staging terminal')\n    }\n    return rejectedStage(winner.staged, terminal)\n  }\n\n  async finish(\n    requestedLease: AgentCandidateExecutionLease,\n    requestedTerminalDigest: Sha256Digest,\n  ): Promise<AgentCandidateExecutionFinishResult> {\n    const lease = sealLease(requestedLease)\n    const terminalDigest = sealTerminalDigest(requestedTerminalDigest)\n    const claimPath = this.claimPath(lease)\n    const stored = await readClaim(claimPath)\n    assertSameSlot(stored.claim, lease, claimPath)\n    assertLease(stored.leaseDigest, stored.claim.leaseExpiresAtMs, lease)\n    const state = await this.transitionState(stored.claim)\n    const staged = requireStagedTerminal(state.staged, terminalDigest)\n    const terminalPath = this.terminalPath(lease)\n    const existing = await readTerminalIfPresent(terminalPath)\n    if (existing) {\n      assertTerminalMatchesClaim(existing, stored.claim, terminalPath)\n      assertTerminalMatchesStaged(existing, staged, terminalPath)\n      return rejectedFinish(existing, terminalDigest)\n    }\n    assertUnexpiredLease(stored.claim.leaseExpiresAtMs, this.now())\n    const finished = await writeRecordIfAbsent(\n      this.directory,\n      terminalPath,\n      {\n        terminal: staged,\n      },\n      this.ownerPublication(stored.claim),\n    )\n    if (finished) return Object.freeze({ finished: true, terminal: staged })\n    const winner = await readTerminal(terminalPath)\n    assertSameSlot(winner, lease, terminalPath)\n    assertTerminalMatchesClaim(winner, stored.claim, terminalPath)\n    assertTerminalMatchesStaged(winner, staged, terminalPath)\n    return rejectedFinish(winner, terminalDigest)\n  }\n\n  async recoverExpired(\n    requestedAttempt: AgentCandidateExecutionAttemptRef,\n    evidence: AgentCandidateExecutionRecoveryEvidence,\n  ): Promise<AgentCandidateExecutionFinishResult> {\n    const attempt = sealAttemptRef(requestedAttempt)\n    const record = await this.storedAttempt(attempt)\n    if (!record) throw new Error('candidate execution recovery does not name an acquired attempt')\n    const recovered = recoveredTerminalRecord(record.claim, record.phase, evidence)\n    if (record.staged) assertRecoveryMatchesStaged(record.staged, recovered)\n    const requestedDigest = record.staged?.terminalDigest ?? recovered.terminalDigest\n    if (record.terminal) return rejectedFinish(record.terminal, requestedDigest)\n    assertExpiredLease(record.claim.leaseExpiresAtMs, this.now())\n\n    let staged = record.staged\n    if (!staged) {\n      const transition = record.phase === 'claimed' ? 1 : 2\n      const didStage = await writeRecordIfAbsent(\n        this.directory,\n        this.transitionPath(record.claim, transition),\n        {\n          kind: 'candidate-execution-pending-terminal',\n          terminal: recovered,\n        },\n      )\n      if (didStage) {\n        staged = recovered\n      } else {\n        const winner = await this.transitionState(record.claim)\n        if (!winner.staged) {\n          throw new Error(\n            'candidate execution recovery lost terminal staging to a phase transition',\n          )\n        }\n        assertRecoveryMatchesStaged(winner.staged, recovered)\n        staged = winner.staged\n      }\n    }\n\n    const terminalPath = this.terminalPath(attempt)\n    const didFinish = await writeRecordIfAbsent(this.directory, terminalPath, {\n      terminal: staged,\n    })\n    if (didFinish) return Object.freeze({ finished: true, terminal: staged })\n    const winner = await readTerminal(terminalPath)\n    assertSameSlot(winner, attempt, terminalPath)\n    assertTerminalMatchesClaim(winner, record.claim, terminalPath)\n    assertTerminalMatchesStaged(winner, staged, terminalPath)\n    return rejectedFinish(winner, staged.terminalDigest)\n  }\n\n  private async storedAttempt(\n    claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>,\n  ): Promise<AgentCandidateExecutionAttemptRecord | undefined> {\n    const claimPath = this.claimPath(claim)\n    const stored = await readClaimIfPresent(claimPath)\n    if (!stored) return undefined\n    assertSameSlot(stored.claim, claim, claimPath)\n    const state = await this.transitionState(stored.claim)\n    const terminalPath = this.terminalPath(claim)\n    const terminal = await readTerminalIfPresent(terminalPath)\n    if (terminal) {\n      assertTerminalMatchesClaim(terminal, stored.claim, terminalPath)\n      if (!state.staged) {\n        throw new Error(\n          `candidate execution terminal record at ${terminalPath} has no staged outbox`,\n        )\n      }\n      assertTerminalMatchesStaged(terminal, state.staged, terminalPath)\n    }\n    return attemptRecord(stored.claim, state.phase, state.staged, terminal)\n  }\n\n  private async transitionState(claim: AgentCandidateExecutionClaim): Promise<{\n    phase: AgentCandidateExecutionPhase\n    staged?: AgentCandidateExecutionTerminalRecord\n  }> {\n    const firstPath = this.transitionPath(claim, 1)\n    const first = await readTransitionIfPresent(firstPath, claim)\n    if (!first) return { phase: 'claimed' }\n    if (first.kind === 'pending') return { phase: 'claimed', staged: first.terminal }\n    const secondPath = this.transitionPath(claim, 2)\n    const second = await readTransitionIfPresent(secondPath, claim)\n    if (!second) return { phase: 'candidate-may-run' }\n    if (second.kind !== 'pending') {\n      throw new Error(`candidate execution transition at ${secondPath} repeats the phase marker`)\n    }\n    return { phase: 'candidate-may-run', staged: second.terminal }\n  }\n\n  private async retryFailure(\n    claim: AgentCandidateExecutionClaim,\n  ): Promise<AgentCandidateRetryRejection | undefined> {\n    if (claim.attempt === 1) return undefined\n    return retryRejection(\n      claim,\n      await this.storedAttempt({\n        executionId: claim.executionId,\n        attempt: claim.attempt - 1,\n      }),\n    )\n  }\n\n  private ownerPublication(claim: AgentCandidateExecutionClaim): {\n    authorizePublish: () => true\n  } {\n    return {\n      authorizePublish: () => {\n        assertUnexpiredLease(claim.leaseExpiresAtMs, this.now())\n        return true\n      },\n    }\n  }\n\n  private claimPath(claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>): string {\n    return join(this.directory, `${claimSlot(claim)}.claim.json`)\n  }\n\n  private terminalPath(\n    claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>,\n  ): string {\n    return join(this.directory, `${claimSlot(claim)}.terminal.json`)\n  }\n\n  private transitionPath(\n    claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>,\n    ordinal: 1 | 2,\n  ): string {\n    return join(this.directory, `${claimSlot(claim)}.transition-${ordinal}.json`)\n  }\n}\n\n/**\n * Candidate records keep this async writer because lease authorization must run after the\n * asynchronous temp-file fsync and immediately before synchronous link publication. The\n * supervisor durability helper is synchronous and has no lease hook, so combining them would\n * either move authorization earlier or add an async race to the claim boundary.\n */\nasync function writeRecordIfAbsent(\n  directory: string,\n  destination: string,\n  record: object,\n  options: {\n    /** Synchronous authorization checked after temp fsync, immediately before atomic publication. */\n    authorizePublish?: () => true\n  } = {},\n): Promise<boolean> {\n  const temporaryPath = join(directory, `.candidate-execution-${process.pid}-${randomUUID()}.tmp`)\n  const handle = await open(temporaryPath, 'wx', 0o600)\n  try {\n    await handle.writeFile(\n      Buffer.concat([Buffer.from(canonicalCandidateBytes(record)), Buffer.from('\\n')]),\n    )\n    await handle.sync()\n  } finally {\n    await handle.close()\n  }\n\n  let written = false\n  try {\n    if (options.authorizePublish && options.authorizePublish() !== true) {\n      throw new Error('candidate execution record publication was not authorized')\n    }\n    // Authorization and the atomic filesystem call are one synchronous critical\n    // section so the event loop cannot advance an injected lease clock between them.\n    linkSync(temporaryPath, destination)\n    written = true\n    await syncDirectory(directory)\n  } catch (error) {\n    if (!isNodeError(error, 'EEXIST')) throw error\n  } finally {\n    await unlink(temporaryPath).catch((error: unknown) => {\n      if (!isNodeError(error, 'ENOENT')) throw error\n    })\n  }\n  return written\n}\n\nasync function syncDirectory(directory: string): Promise<void> {\n  const handle = await open(directory, 'r')\n  try {\n    await handle.sync()\n  } finally {\n    await handle.close()\n  }\n}\n\nfunction isNodeError(error: unknown, code: string): boolean {\n  return (\n    error !== null &&\n    typeof error === 'object' &&\n    'code' in error &&\n    (error as { code?: unknown }).code === code\n  )\n}\n","import { candidateCleanupDeadline, withinCandidateCleanupDeadline } from './cleanup'\nimport { sealAgentCandidateModelSettlement } from './model-settlement'\nimport {\n  assertPreparedCandidateIntegrity,\n  beginPreparedCandidateDisposal,\n  consumePreparedCandidateExecution,\n} from './prepared-state'\nimport type { PreparedAgentCandidateExecution } from './types'\n\nexport interface DisposePreparedAgentCandidateOptions {\n  cleanupTimeoutMs?: number\n}\n\n/** Revoke reservations held by a prepared candidate that will not be executed. */\nexport async function disposePreparedAgentCandidateExecution(\n  prepared: PreparedAgentCandidateExecution,\n  options: DisposePreparedAgentCandidateOptions = {},\n): Promise<{ disposed: true }> {\n  const initialState = assertPreparedCandidateIntegrity(prepared)\n  const cleanupTimeoutMs = options.cleanupTimeoutMs ?? initialState.cleanupTimeoutMs\n  if (cleanupTimeoutMs > initialState.cleanupTimeoutMs) {\n    throw new Error('disposal cleanup timeout exceeds the frozen preparation bound')\n  }\n  const cleanupDeadlineAtMs = candidateCleanupDeadline(cleanupTimeoutMs)\n  const state = beginPreparedCandidateDisposal(prepared)\n  const cleanup: Array<Promise<unknown>> = []\n\n  if (state.memory.mode === 'isolated') {\n    const reservation = state.memoryReservation\n    if (!reservation) throw new Error('isolated memory reservation is missing')\n    cleanup.push(\n      withinCandidateCleanupDeadline(\n        async () => {\n          const closed = await state.ports.memory.close({\n            executionId: state.executionId,\n            preparationId: reservation.preparationId,\n            accessDigest: reservation.accessDigest,\n            effectiveNamespace: reservation.effectiveNamespace,\n            reason: 'abandoned',\n          })\n          if (closed.closed !== true || Object.keys(closed).some((key) => key !== 'closed')) {\n            throw new Error('abandoned isolated memory access did not acknowledge closure')\n          }\n        },\n        cleanupDeadlineAtMs,\n        'isolated memory disposal',\n      ),\n    )\n  }\n\n  cleanup.push(\n    withinCandidateCleanupDeadline(\n      async () => {\n        const settlement = sealAgentCandidateModelSettlement(\n          await state.ports.models.settleGrant({\n            executionId: state.executionId,\n            preparationId: state.preparationId,\n            grantDigest: state.modelReservation.digest,\n            resolved: state.resolvedModel,\n            reason: 'abandoned',\n          }),\n          {\n            preparationId: state.preparationId,\n            grantDigest: state.modelReservation.digest,\n            model: state.resolvedModel.model,\n          },\n        )\n        if (settlement.usage.modelCalls !== 0) {\n          throw new Error('unexecuted model reservation unexpectedly contains calls')\n        }\n      },\n      cleanupDeadlineAtMs,\n      'model reservation disposal',\n    ),\n  )\n\n  const results = await Promise.allSettled(cleanup)\n  const failures = results\n    .filter((result): result is PromiseRejectedResult => result.status === 'rejected')\n    .map((result) => result.reason)\n  if (failures.length > 0) {\n    consumePreparedCandidateExecution(prepared, 'disposal-failed')\n    throw new AggregateError(failures, 'candidate preparation disposal failed')\n  }\n\n  consumePreparedCandidateExecution(prepared, 'disposed')\n  return Object.freeze({ disposed: true as const })\n}\n","import type { AgentCandidateResolvedModel } from '@tangle-network/agent-interface'\n\nimport type {\n  AgentCandidateModelGrantActivateInput,\n  AgentCandidateModelGrantReserveInput,\n  AgentCandidateModelGrantSettleInput,\n} from './protected-model-port'\nimport type {\n  AgentCandidateModelPort,\n  AgentCandidateProtectedModelActivation,\n  AgentCandidateProtectedModelReservation,\n  AgentCandidateProtectedModelSettlement,\n} from './types'\n\n/** Reservation fields supplied by a caller before Runtime resolves the model. */\nexport type AgentCandidateModelGrantRunReservationInput = Omit<\n  AgentCandidateModelGrantReserveInput,\n  'resolved'\n>\n\n/** Values available only while one protected model grant is active. */\nexport interface ProtectedAgentCandidateModelGrantContext {\n  readonly activation: AgentCandidateProtectedModelActivation\n  readonly reservation: AgentCandidateProtectedModelReservation\n  readonly resolved: AgentCandidateResolvedModel\n}\n\n/** Inputs for one protected grant scoped to one bounded caller unit. */\nexport interface RunProtectedAgentCandidateModelGrantOptions<TResult> {\n  /** Runtime port that validates and settles the evaluator-owned grant. */\n  readonly port: AgentCandidateModelPort\n  /** Provider-neutral model request resolved before any grant is reserved. */\n  readonly resolve: Parameters<AgentCandidateModelPort['resolve']>[0]\n  /** One bounded unit's immutable identity, attempt, expiry, and limits. */\n  readonly reserve: AgentCandidateModelGrantRunReservationInput\n  /** Must be no later than the reservation expiry. */\n  readonly deadlineAtMs: AgentCandidateModelGrantActivateInput['deadlineAtMs']\n  /** Execute exactly one bounded unit while the activated environment is valid. */\n  readonly execute: (context: ProtectedAgentCandidateModelGrantContext) => Promise<TResult>\n}\n\n/** Result and sealed settlement returned after one protected grant closes. */\nexport interface RunProtectedAgentCandidateModelGrantResult<TResult> {\n  readonly value: TResult\n  readonly resolved: AgentCandidateResolvedModel\n  readonly reservation: AgentCandidateProtectedModelReservation\n  readonly settlement: AgentCandidateProtectedModelSettlement\n}\n\nconst SETTLEMENT_RETRY_INITIAL_DELAY_MS = 25\nconst SETTLEMENT_RETRY_MAX_DELAY_MS = 1_000\n\n/**\n * Run one bounded unit under a protected model grant.\n *\n * Runtime owns the grant lifecycle; callers own the unit boundary and any\n * durable scheduling or accounting around it. A reserved grant is settled\n * after activation failure or callback failure, and the callback error is\n * preserved when settlement also fails.\n */\nexport async function runProtectedAgentCandidateModelGrant<TResult>(\n  options: RunProtectedAgentCandidateModelGrantOptions<TResult>,\n): Promise<RunProtectedAgentCandidateModelGrantResult<TResult>> {\n  if (typeof options.execute !== 'function') {\n    throw new TypeError('protected model grant execute callback is required')\n  }\n\n  const resolved = await options.port.resolve(options.resolve)\n  const reservation = await options.port.reserveGrant({\n    ...options.reserve,\n    resolved,\n  })\n\n  let value!: TResult\n  let executionError: unknown\n  let executionFailed = false\n  let activated = false\n  let reason: AgentCandidateModelGrantSettleInput['reason'] = 'preparation-failed'\n\n  try {\n    const activation = await options.port.activateGrant({\n      executionId: options.reserve.executionId,\n      preparationId: options.reserve.preparationId,\n      grantDigest: reservation.digest,\n      resolved,\n      deadlineAtMs: options.deadlineAtMs,\n    })\n    activated = true\n    value = await options.execute({ activation, reservation, resolved })\n    reason = 'completed'\n  } catch (error) {\n    executionError = error\n    executionFailed = true\n    if (activated) reason = 'failed'\n  }\n\n  let settlement: AgentCandidateProtectedModelSettlement\n  try {\n    settlement = await settleProtectedModelGrant(options, {\n      executionId: options.reserve.executionId,\n      preparationId: options.reserve.preparationId,\n      grantDigest: reservation.digest,\n      resolved,\n      reason,\n    })\n  } catch (settlementError) {\n    if (executionFailed) {\n      throw new AggregateError(\n        [executionError, settlementError],\n        'protected model execution failed and its grant did not settle',\n      )\n    }\n    throw settlementError\n  }\n\n  if (executionFailed) throw executionError\n  return { value, resolved, reservation, settlement }\n}\n\nasync function settleProtectedModelGrant<TResult>(\n  options: RunProtectedAgentCandidateModelGrantOptions<TResult>,\n  input: AgentCandidateModelGrantSettleInput,\n): Promise<AgentCandidateProtectedModelSettlement> {\n  let delayMs = SETTLEMENT_RETRY_INITIAL_DELAY_MS\n  for (;;) {\n    try {\n      return await options.port.settleGrant(input)\n    } catch (error) {\n      if (!isCandidateGrantDrainingError(error)) throw error\n      const remainingMs = options.deadlineAtMs - Date.now()\n      if (remainingMs <= 0) throw error\n      await waitForSettlementRetry(Math.min(delayMs, remainingMs))\n      if (Date.now() >= options.deadlineAtMs) throw error\n      delayMs = Math.min(delayMs * 2, SETTLEMENT_RETRY_MAX_DELAY_MS)\n    }\n  }\n}\n\nfunction waitForSettlementRetry(delayMs: number): Promise<void> {\n  return new Promise((resolve) => setTimeout(resolve, delayMs))\n}\n\n/** Only the gateway's explicit draining state is retryable; auth and ledger errors fail closed. */\nfunction isCandidateGrantDrainingError(error: unknown): boolean {\n  if (typeof error !== 'object' || error === null) return false\n  const candidate = error as { code?: unknown; message?: unknown }\n  if (candidate.code === 'candidate_grant_draining') return true\n  return (\n    typeof candidate.message === 'string' && /\\bcandidate_grant_draining\\b/u.test(candidate.message)\n  )\n}\n","import type { TraceStore } from '@tangle-network/agent-eval'\nimport type {\n  AgentCandidateExecutionPlanMaterial,\n  AgentCandidateMaterializationReceipt,\n} from '@tangle-network/agent-interface'\nimport {\n  agentCandidateExecutionPlanMaterialSchema,\n  agentCandidateMaterializationReceiptSchema,\n} from '@tangle-network/agent-interface'\n\nimport { readVerifiedArtifact } from './artifacts'\nimport type {\n  AgentCandidateExecutionAttemptRef,\n  AgentCandidateExecutionClaim,\n  AgentCandidateExecutionClaimStore,\n  AgentCandidateExecutionFinishResult,\n} from './claim'\nimport {\n  candidateCleanupDeadline,\n  candidateCleanupTimeout,\n  withinCandidateCleanupDeadline,\n} from './cleanup'\nimport { canonicalCandidateBytes } from './digest'\nimport { sealAgentCandidateExecutorStopAcknowledgement } from './executor-capture'\nimport { sealAgentCandidateModelSettlement } from './model-settlement'\nimport { persistCandidateModelSettlementEvidence } from './outcome-evidence'\nimport { persistCandidateOutputArtifact } from './output-artifacts'\nimport { RecoveryAgentCandidateTraceStore } from './protected-trace-store'\nimport type {\n  AgentCandidateExecutionPorts,\n  AgentCandidateExecutorPort,\n  AgentCandidateOutputArtifactPort,\n} from './types'\n\nexport interface RecoverExpiredAgentCandidateOptions {\n  attempt: AgentCandidateExecutionAttemptRef\n  claimStore: AgentCandidateExecutionClaimStore\n  executor: AgentCandidateExecutorPort\n  traceStore: TraceStore\n  ports: Pick<AgentCandidateExecutionPorts, 'models' | 'memory'>\n  outputArtifacts: AgentCandidateOutputArtifactPort\n  cleanupTimeoutMs?: number\n  /** Evaluator clock; must be the same clock used by the claim store. */\n  now?: () => number\n}\n\n/** Close an expired crashed attempt from persisted non-secret handles, then record failure. */\nexport async function recoverExpiredAgentCandidateExecution(\n  options: RecoverExpiredAgentCandidateOptions,\n): Promise<AgentCandidateExecutionFinishResult> {\n  const record = await options.claimStore.getAttempt(options.attempt)\n  if (!record) throw new Error('candidate execution recovery attempt is missing')\n  if (record.terminal) {\n    return Object.freeze({ finished: false, terminal: record.terminal, exactReplay: true })\n  }\n  const cleanupTimeoutMs = candidateCleanupTimeout(\n    options.cleanupTimeoutMs ?? record.claim.cleanup.cleanupTimeoutMs,\n  )\n  if (cleanupTimeoutMs > record.claim.cleanup.cleanupTimeoutMs) {\n    throw new Error('recovery cleanup timeout exceeds the frozen preparation bound')\n  }\n\n  const now = options.now ?? Date.now\n  if (now() < record.claim.leaseExpiresAtMs) {\n    throw new Error('candidate execution lease has not expired')\n  }\n\n  const cleanupDeadlineAtMs = candidateCleanupDeadline(cleanupTimeoutMs)\n  const recoveryTraceStore = new RecoveryAgentCandidateTraceStore(options.traceStore)\n  const preparation = withinCandidateCleanupDeadline(\n    () => readRecoveryPreparation(record.claim, options.outputArtifacts),\n    cleanupDeadlineAtMs,\n    'expired candidate preparation evidence read',\n  )\n  const processClosure = withinCandidateCleanupDeadline(\n    async (cleanupSignal) => {\n      const stopped = await options.executor.stop(\n        {\n          executionId: record.claim.executionId,\n          executionPlanDigest: record.claim.executionPlanDigest,\n        },\n        {\n          traceStore: recoveryTraceStore,\n          reason: 'failed',\n          signal: cleanupSignal,\n          deadlineAtMs: cleanupDeadlineAtMs,\n        },\n      )\n      sealAgentCandidateExecutorStopAcknowledgement(stopped)\n      if (options.executor.dispose) {\n        const disposed = await options.executor.dispose(\n          {\n            executionId: record.claim.executionId,\n            executionPlanDigest: record.claim.executionPlanDigest,\n          },\n          { signal: cleanupSignal },\n        )\n        if (disposed.disposed !== true || Object.keys(disposed).some((key) => key !== 'disposed')) {\n          throw new Error('expired candidate executor did not acknowledge resource disposal')\n        }\n      }\n      return { stopped: true as const }\n    },\n    cleanupDeadlineAtMs,\n    'expired candidate process termination',\n  )\n\n  const modelClosure = withinCandidateCleanupDeadline(\n    async () =>\n      sealAgentCandidateModelSettlement(\n        await options.ports.models.settleGrant({\n          executionId: record.claim.executionId,\n          preparationId: record.claim.cleanup.preparationId,\n          grantDigest: record.claim.cleanup.modelGrantDigest,\n          resolved: record.claim.cleanup.resolvedModel,\n          reason: 'failed',\n        }),\n        {\n          preparationId: record.claim.cleanup.preparationId,\n          grantDigest: record.claim.cleanup.modelGrantDigest,\n          model: record.claim.cleanup.resolvedModel.model,\n        },\n      ),\n    cleanupDeadlineAtMs,\n    'expired candidate model settlement',\n  )\n\n  const memoryClosure = record.claim.cleanup.memory\n    ? withinCandidateCleanupDeadline(\n        async () => {\n          const memory = record.claim.cleanup.memory\n          if (!memory) throw new Error('expired candidate memory handle is missing')\n          const closed = await options.ports.memory.close({\n            executionId: record.claim.executionId,\n            preparationId: record.claim.cleanup.preparationId,\n            accessDigest: memory.accessDigest,\n            effectiveNamespace: memory.effectiveNamespace,\n            reason: 'failed',\n          })\n          if (closed.closed !== true || Object.keys(closed).some((key) => key !== 'closed')) {\n            throw new Error('expired candidate memory did not acknowledge closure')\n          }\n          return { closed: true as const }\n        },\n        cleanupDeadlineAtMs,\n        'expired candidate memory closure',\n      )\n    : undefined\n\n  const closureOutcomes = Promise.allSettled([\n    modelClosure,\n    memoryClosure ?? Promise.resolve(undefined),\n  ] as const)\n  const [preparationOutcome, processOutcome] = await Promise.allSettled([\n    preparation,\n    processClosure,\n  ] as const)\n  const failures: unknown[] = [preparationOutcome, processOutcome]\n    .filter((outcome): outcome is PromiseRejectedResult => outcome.status === 'rejected')\n    .map((outcome) => outcome.reason)\n  const [modelOutcome, memoryOutcome] = await closureOutcomes\n  for (const outcome of [modelOutcome, memoryOutcome]) {\n    if (outcome.status === 'rejected') failures.push(outcome.reason)\n  }\n  if (failures.length > 0) {\n    throw new AggregateError(failures, 'expired candidate cleanup could not be proven')\n  }\n\n  if (modelOutcome.status !== 'fulfilled') {\n    throw new Error('expired candidate model settlement was not recovered')\n  }\n  const model = modelOutcome.value\n  const modelSettlement = await withinCandidateCleanupDeadline(\n    () =>\n      persistCandidateModelSettlementEvidence(\n        {\n          executionId: record.claim.executionId,\n          executionPlanDigest: record.claim.executionPlanDigest,\n          resolvedModel: record.claim.cleanup.resolvedModel,\n        },\n        model,\n        options.outputArtifacts,\n      ),\n    cleanupDeadlineAtMs,\n    'expired candidate model-settlement persistence',\n  )\n  const failureClass =\n    record.phase === 'claimed' && model.usage.modelCalls === 0\n      ? 'pre-model-infrastructure'\n      : 'unknown'\n  const failureEvidence = await withinCandidateCleanupDeadline(\n    () =>\n      persistCandidateOutputArtifact(options.outputArtifacts, {\n        executionId: record.claim.executionId,\n        purpose: 'failure-evidence',\n        bytes: canonicalCandidateBytes({\n          kind: 'agent-candidate-recovery-failure',\n          executionId: record.claim.executionId,\n          attempt: record.claim.attempt,\n          bundleDigest: record.claim.bundleDigest,\n          executionPlanDigest: record.claim.executionPlanDigest,\n          materializationReceiptDigest:\n            record.claim.preparationEvidence.materializationReceipt.sha256,\n          failureClass,\n          processStopped: true,\n          modelSettlementDigest: modelSettlement.digest,\n          memoryClosed: record.claim.cleanup.memory !== undefined,\n        }),\n      }),\n    cleanupDeadlineAtMs,\n    'expired candidate failure-evidence persistence',\n  )\n  const memory = record.claim.cleanup.memory\n  return await options.claimStore.recoverExpired(options.attempt, {\n    failureClass,\n    usage: model.usage,\n    modelSettlement: modelSettlement.artifact,\n    failureEvidence,\n    process: {\n      stopped: true,\n      executionPlanDigest: record.claim.executionPlanDigest,\n    },\n    model: {\n      closed: true,\n      preparationId: record.claim.cleanup.preparationId,\n      grantDigest: record.claim.cleanup.modelGrantDigest,\n    },\n    ...(memory\n      ? {\n          memory: {\n            closed: true,\n            preparationId: record.claim.cleanup.preparationId,\n            accessDigest: memory.accessDigest,\n            effectiveNamespace: memory.effectiveNamespace,\n          },\n        }\n      : {}),\n  })\n}\n\nasync function readRecoveryPreparation(\n  claim: AgentCandidateExecutionClaim,\n  artifacts: AgentCandidateOutputArtifactPort,\n): Promise<{\n  plan: AgentCandidateExecutionPlanMaterial\n  receipt: AgentCandidateMaterializationReceipt\n}> {\n  const [planBytes, receiptBytes] = await Promise.all([\n    readVerifiedArtifact(claim.preparationEvidence.executionPlan, artifacts),\n    readVerifiedArtifact(claim.preparationEvidence.materializationReceipt, artifacts),\n  ])\n  const plan = agentCandidateExecutionPlanMaterialSchema.parse(\n    parseCanonicalBytes(planBytes, 'plan'),\n  )\n  if (claim.preparationEvidence.executionPlan.sha256 !== claim.executionPlanDigest) {\n    throw new Error('recovery execution plan artifact does not match the claimed digest')\n  }\n  const receiptMaterial = parseCanonicalBytes(receiptBytes, 'materialization receipt')\n  const receipt = agentCandidateMaterializationReceiptSchema.parse({\n    ...receiptMaterial,\n    digest: claim.preparationEvidence.materializationReceipt.sha256,\n  })\n  if (\n    receipt.bundleDigest !== claim.bundleDigest ||\n    receipt.executionPlan.digest !== claim.executionPlanDigest ||\n    plan.runCell.bundleDigest !== claim.bundleDigest ||\n    plan.executionId !== claim.executionId\n  ) {\n    throw new Error('recovery preparation evidence does not match the durable claim')\n  }\n  return { plan, receipt }\n}\n\nfunction parseCanonicalBytes(bytes: Uint8Array, label: string): Record<string, unknown> {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(Buffer.from(bytes).toString('utf8'))\n  } catch (error) {\n    throw new Error(`candidate recovery ${label} is not JSON`, { cause: error })\n  }\n  if (!parsed || typeof parsed !== 'object' || Array.isArray(parsed)) {\n    throw new Error(`candidate recovery ${label} must be an object`)\n  }\n  if (!Buffer.from(canonicalCandidateBytes(parsed)).equals(Buffer.from(bytes))) {\n    throw new Error(`candidate recovery ${label} bytes are not canonical`)\n  }\n  return parsed as Record<string, unknown>\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAwEA,SAAgB,0BACd,OAC6C;CAU7C,OAAO,yBAAyB;EAR9B,MAAM;EACN,iBAAiB;EACjB,SAAS,wBAAwB,MAAM,OAAO;EAC9C,MAAM,qBAAqB,MAAM,IAAI;EACrC,WAAW,MAAM;EACjB,GAAI,MAAM,cAAc,KAAA,IAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;EACtE,QAAQ,MAAM;CAEqB,CAAC;AACxC;AAEA,SAAS,wBAAwB,QAA4D;CAC3F,IAAI,OAAO,SAAS,qBAClB,OAAO,2BAA2B,OAAO,OAAO;CAGlD,IAAI,OAAO,SAAS,WAClB,OAAO,mCAAmC,OAAO,OAAO;CAG1D,IAAI,OAAO,SAAS,iBAClB,MAAM,IAAI,MACR,yCAAyC,OAAQ,OAA8B,IAAI,GACrF;CAEF,IAAI,OAAO,MAAM,WAAW,GAC1B,MAAM,IAAI,MAAM,6DAA6D;CAE/E,IAAI,UAAU,uBAAuB,OAAO,MAAM,cAAc;CAChE,KAAK,MAAM,CAAC,OAAO,cAAc,OAAO,MAAM,QAAQ,GAAG;EACvD,MAAM,OAAO,2BAA2B,WAAW,gBAAgB,OAAO;EAC1E,UAAU,2BAA2B,SAAS,MAAM,gBAAgB,OAAO;CAC7E;CACA,OAAO,mCAAmC,OAAO;AACnD;AAEA,SAAS,qBAAqB,QAAqE;CACjG,IAAI,OAAO,SAAS,cAAc,OAAO,SAAS,SAAS,OAAO;CAClE,IAAI,OAAO,SAAS,gBAClB,MAAM,IAAI,MACR,sCAAsC,OAAQ,OAA8B,IAAI,GAClF;CAIF,MAAM,QAAQ,0BADG,kBAAkB,OAAO,SAAS,OAAO,WACX,CAAC,CAAC,UAAU;CAC3D,IACE,MAAM,WAAW,OAAO,QAAQ,MAAM,UACtC,MAAM,eAAe,OAAO,QAAQ,MAAM,YAE1C,MAAM,IAAI,MAAM,oEAAoE;CAEtF,OAAO;EACL,MAAM;EACN,YAAY,OAAO;EACnB,YAAY,OAAO,QAAQ;EAC3B,UAAU,OAAO,QAAQ;EACzB,eAAe,OAAO,QAAQ;EAC9B,OAAO;GAAE,QAAQ;GAAmB,UAAU;EAAM;CACtD;AACF;;;ACnGA,MAAM,EACJ,oBACA,aACA,gBACA,sBACA,eACA,WACA,aACA,UACA,WACA,oBACA,cACA,uBACA,yBACA,uBACA,eACA,gBACA,gBACA,WACA,cACE;;AAUJ,IAAa,wCAAb,MAAgG;CAC9F;CACA;CAEA,YAAY,SAAuD;EACjE,IAAI,QAAQ,UAAU,WAAW,GAC/B,MAAM,IAAI,MAAM,uDAAuD;EAEzE,KAAK,YAAY,QAAQ;EACzB,KAAK,MAAM,QAAQ,OAAO,KAAK;CACjC;CAEA,MAAM,SACJ,WAC6C;EAC7C,MAAM,QAAQ,UAAU,SAAS;EACjC,MAAM,MAAM,KAAK,WAAW,EAAE,WAAW,KAAK,CAAC;EAC/C,MAAM,YAAY,KAAK,UAAU,KAAK;EACtC,MAAM,WAAW,MAAM,mBAAmB,SAAS;EACnD,IAAI,UAAU;GACZ,eAAe,SAAS,OAAO,OAAO,SAAS;GAC/C,OAAO,sBAAsB,SAAS,OAAO,KAAK;EACpD;EACA,qBAAqB,MAAM,kBAAkB,KAAK,IAAI,CAAC;EACvD,MAAM,eAAe,MAAM,KAAK,aAAa,KAAK;EAClD,IAAI,cAAc,OAAO,cAAc,OAAO,YAAY;EAE1D,MAAM,QAAQ,SAAS,KAAK;EAM5B,IAAI,MALmB,oBAAoB,KAAK,WAAW,WAAW;GACpE,GAAG;GACH,OAAO;GACP,aAAa,YAAY,KAAK;EAChC,CAAC,GACa,OAAO,OAAO,OAAO;GAAE,UAAU;GAAM;GAAO;EAAM,CAAC;EAEnE,MAAM,SAAS,MAAM,UAAU,SAAS;EACxC,eAAe,OAAO,OAAO,OAAO,SAAS;EAC7C,OAAO,sBAAsB,OAAO,OAAO,KAAK;CAClD;CAEA,MAAM,WACJ,kBAC2D;EAC3D,OAAO,MAAM,KAAK,cAAc,eAAe,gBAAgB,CAAC;CAClE;CAEA,MAAM,oBACJ,gBAC6C;EAC7C,MAAM,QAAQ,UAAU,cAAc;EACtC,MAAM,YAAY,KAAK,UAAU,KAAK;EACtC,MAAM,SAAS,MAAM,UAAU,SAAS;EACxC,eAAe,OAAO,OAAO,OAAO,SAAS;EAC7C,YAAY,OAAO,aAAa,OAAO,MAAM,kBAAkB,KAAK;EACpE,MAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;EACrD,IAAI,MAAM,UAAU,qBAClB,OAAO,OAAO,OAAO;GAAE,QAAQ;GAAO,OAAO;EAAoB,CAAC;EAEpE,IAAI,MAAM,QACR,MAAM,IAAI,MAAM,wEAAwE;EAE1F,qBAAqB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;EAa9D,IAAI,MAZiB,oBACnB,KAAK,WACL,KAAK,eAAe,OAAO,OAAO,CAAC,GACnC;GACE,MAAM;GACN,aAAa,OAAO,MAAM;GAC1B,SAAS,OAAO,MAAM;GACtB,qBAAqB,OAAO,MAAM;GAClC,OAAO;EACT,GACA,KAAK,iBAAiB,OAAO,KAAK,CACpC,GACY,OAAO,OAAO,OAAO;GAAE,QAAQ;GAAM,OAAO;EAAoB,CAAC;EAE7E,KAAI,MADiB,KAAK,gBAAgB,OAAO,KAAK,EAAA,CAC3C,UAAU,qBACnB,OAAO,OAAO,OAAO;GAAE,QAAQ;GAAO,OAAO;EAAoB,CAAC;EAEpE,MAAM,IAAI,MAAM,wEAAwE;CAC1F;CAEA,MAAM,cACJ,gBACA,QAC6C;EAC7C,MAAM,QAAQ,UAAU,cAAc;EACtC,MAAM,YAAY,KAAK,UAAU,KAAK;EACtC,MAAM,SAAS,MAAM,UAAU,SAAS;EACxC,eAAe,OAAO,OAAO,OAAO,SAAS;EAC7C,YAAY,OAAO,aAAa,OAAO,MAAM,kBAAkB,KAAK;EACpE,MAAM,WAAW,eAAe,OAAO,OAAO,MAAM;EACpD,MAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;EACrD,IAAI,MAAM,QAAQ,OAAO,cAAc,MAAM,QAAQ,QAAQ;EAC7D,6BAA6B,MAAM,OAAO,QAAQ;EAClD,qBAAqB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;EAC9D,MAAM,aAAa,MAAM,UAAU,YAAY,IAAI;EAUnD,IAAI,MATiB,oBACnB,KAAK,WACL,KAAK,eAAe,OAAO,OAAO,UAAU,GAC5C;GACE,MAAM;GACN;EACF,GACA,KAAK,iBAAiB,OAAO,KAAK,CACpC,GACY,OAAO,OAAO,OAAO;GAAE,QAAQ;GAAM;EAAS,CAAC;EAC3D,MAAM,SAAS,MAAM,KAAK,gBAAgB,OAAO,KAAK;EACtD,IAAI,CAAC,OAAO,QACV,MAAM,IAAI,MAAM,iEAAiE;EAEnF,OAAO,cAAc,OAAO,QAAQ,QAAQ;CAC9C;CAEA,MAAM,OACJ,gBACA,yBAC8C;EAC9C,MAAM,QAAQ,UAAU,cAAc;EACtC,MAAM,iBAAiB,mBAAmB,uBAAuB;EACjE,MAAM,YAAY,KAAK,UAAU,KAAK;EACtC,MAAM,SAAS,MAAM,UAAU,SAAS;EACxC,eAAe,OAAO,OAAO,OAAO,SAAS;EAC7C,YAAY,OAAO,aAAa,OAAO,MAAM,kBAAkB,KAAK;EAEpE,MAAM,SAAS,uBAAsB,MADjB,KAAK,gBAAgB,OAAO,KAAK,EAAA,CACV,QAAQ,cAAc;EACjE,MAAM,eAAe,KAAK,aAAa,KAAK;EAC5C,MAAM,WAAW,MAAM,sBAAsB,YAAY;EACzD,IAAI,UAAU;GACZ,2BAA2B,UAAU,OAAO,OAAO,YAAY;GAC/D,4BAA4B,UAAU,QAAQ,YAAY;GAC1D,OAAO,eAAe,UAAU,cAAc;EAChD;EACA,qBAAqB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;EAS9D,IAAI,MARmB,oBACrB,KAAK,WACL,cACA,EACE,UAAU,OACZ,GACA,KAAK,iBAAiB,OAAO,KAAK,CACpC,GACc,OAAO,OAAO,OAAO;GAAE,UAAU;GAAM,UAAU;EAAO,CAAC;EACvE,MAAM,SAAS,MAAM,aAAa,YAAY;EAC9C,eAAe,QAAQ,OAAO,YAAY;EAC1C,2BAA2B,QAAQ,OAAO,OAAO,YAAY;EAC7D,4BAA4B,QAAQ,QAAQ,YAAY;EACxD,OAAO,eAAe,QAAQ,cAAc;CAC9C;CAEA,MAAM,eACJ,kBACA,UAC8C;EAC9C,MAAM,UAAU,eAAe,gBAAgB;EAC/C,MAAM,SAAS,MAAM,KAAK,cAAc,OAAO;EAC/C,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,gEAAgE;EAC7F,MAAM,YAAY,wBAAwB,OAAO,OAAO,OAAO,OAAO,QAAQ;EAC9E,IAAI,OAAO,QAAQ,4BAA4B,OAAO,QAAQ,SAAS;EACvE,MAAM,kBAAkB,OAAO,QAAQ,kBAAkB,UAAU;EACnE,IAAI,OAAO,UAAU,OAAO,eAAe,OAAO,UAAU,eAAe;EAC3E,mBAAmB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;EAE5D,IAAI,SAAS,OAAO;EACpB,IAAI,CAAC,QAAQ;GACX,MAAM,aAAa,OAAO,UAAU,YAAY,IAAI;GASpD,IAAI,MARmB,oBACrB,KAAK,WACL,KAAK,eAAe,OAAO,OAAO,UAAU,GAC5C;IACE,MAAM;IACN,UAAU;GACZ,CACF,GAEE,SAAS;QACJ;IACL,MAAM,SAAS,MAAM,KAAK,gBAAgB,OAAO,KAAK;IACtD,IAAI,CAAC,OAAO,QACV,MAAM,IAAI,MACR,0EACF;IAEF,4BAA4B,OAAO,QAAQ,SAAS;IACpD,SAAS,OAAO;GAClB;EACF;EAEA,MAAM,eAAe,KAAK,aAAa,OAAO;EAI9C,IAAI,MAHoB,oBAAoB,KAAK,WAAW,cAAc,EACxE,UAAU,OACZ,CAAC,GACc,OAAO,OAAO,OAAO;GAAE,UAAU;GAAM,UAAU;EAAO,CAAC;EACxE,MAAM,SAAS,MAAM,aAAa,YAAY;EAC9C,eAAe,QAAQ,SAAS,YAAY;EAC5C,2BAA2B,QAAQ,OAAO,OAAO,YAAY;EAC7D,4BAA4B,QAAQ,QAAQ,YAAY;EACxD,OAAO,eAAe,QAAQ,OAAO,cAAc;CACrD;CAEA,MAAc,cACZ,OAC2D;EAC3D,MAAM,YAAY,KAAK,UAAU,KAAK;EACtC,MAAM,SAAS,MAAM,mBAAmB,SAAS;EACjD,IAAI,CAAC,QAAQ,OAAO,KAAA;EACpB,eAAe,OAAO,OAAO,OAAO,SAAS;EAC7C,MAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;EACrD,MAAM,eAAe,KAAK,aAAa,KAAK;EAC5C,MAAM,WAAW,MAAM,sBAAsB,YAAY;EACzD,IAAI,UAAU;GACZ,2BAA2B,UAAU,OAAO,OAAO,YAAY;GAC/D,IAAI,CAAC,MAAM,QACT,MAAM,IAAI,MACR,0CAA0C,aAAa,sBACzD;GAEF,4BAA4B,UAAU,MAAM,QAAQ,YAAY;EAClE;EACA,OAAO,cAAc,OAAO,OAAO,MAAM,OAAO,MAAM,QAAQ,QAAQ;CACxE;CAEA,MAAc,gBAAgB,OAG3B;EACD,MAAM,YAAY,KAAK,eAAe,OAAO,CAAC;EAC9C,MAAM,QAAQ,MAAM,wBAAwB,WAAW,KAAK;EAC5D,IAAI,CAAC,OAAO,OAAO,EAAE,OAAO,UAAU;EACtC,IAAI,MAAM,SAAS,WAAW,OAAO;GAAE,OAAO;GAAW,QAAQ,MAAM;EAAS;EAChF,MAAM,aAAa,KAAK,eAAe,OAAO,CAAC;EAC/C,MAAM,SAAS,MAAM,wBAAwB,YAAY,KAAK;EAC9D,IAAI,CAAC,QAAQ,OAAO,EAAE,OAAO,oBAAoB;EACjD,IAAI,OAAO,SAAS,WAClB,MAAM,IAAI,MAAM,qCAAqC,WAAW,0BAA0B;EAE5F,OAAO;GAAE,OAAO;GAAqB,QAAQ,OAAO;EAAS;CAC/D;CAEA,MAAc,aACZ,OACmD;EACnD,IAAI,MAAM,YAAY,GAAG,OAAO,KAAA;EAChC,OAAO,eACL,OACA,MAAM,KAAK,cAAc;GACvB,aAAa,MAAM;GACnB,SAAS,MAAM,UAAU;EAC3B,CAAC,CACH;CACF;CAEA,iBAAyB,OAEvB;EACA,OAAO,EACL,wBAAwB;GACtB,qBAAqB,MAAM,kBAAkB,KAAK,IAAI,CAAC;GACvD,OAAO;EACT,EACF;CACF;CAEA,UAAkB,OAA8E;EAC9F,OAAO,KAAK,KAAK,WAAW,GAAG,UAAU,KAAK,EAAE,YAAY;CAC9D;CAEA,aACE,OACQ;EACR,OAAO,KAAK,KAAK,WAAW,GAAG,UAAU,KAAK,EAAE,eAAe;CACjE;CAEA,eACE,OACA,SACQ;EACR,OAAO,KAAK,KAAK,WAAW,GAAG,UAAU,KAAK,EAAE,cAAc,QAAQ,MAAM;CAC9E;AACF;;;;;;;AAQA,eAAe,oBACb,WACA,aACA,QACA,UAGI,CAAC,GACa;CAClB,MAAM,gBAAgB,KAAK,WAAW,wBAAwB,QAAQ,IAAI,GAAG,WAAW,EAAE,KAAK;CAC/F,MAAM,SAAS,MAAM,KAAK,eAAe,MAAM,GAAK;CACpD,IAAI;EACF,MAAM,OAAO,UACX,OAAO,OAAO,CAAC,OAAO,KAAK,wBAAwB,MAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CACjF;EACA,MAAM,OAAO,KAAK;CACpB,UAAU;EACR,MAAM,OAAO,MAAM;CACrB;CAEA,IAAI,UAAU;CACd,IAAI;EACF,IAAI,QAAQ,oBAAoB,QAAQ,iBAAiB,MAAM,MAC7D,MAAM,IAAI,MAAM,2DAA2D;EAI7E,SAAS,eAAe,WAAW;EACnC,UAAU;EACV,MAAM,cAAc,SAAS;CAC/B,SAAS,OAAO;EACd,IAAI,CAAC,YAAY,OAAO,QAAQ,GAAG,MAAM;CAC3C,UAAU;EACR,MAAM,OAAO,aAAa,CAAC,CAAC,OAAO,UAAmB;GACpD,IAAI,CAAC,YAAY,OAAO,QAAQ,GAAG,MAAM;EAC3C,CAAC;CACH;CACA,OAAO;AACT;AAEA,eAAe,cAAc,WAAkC;CAC7D,MAAM,SAAS,MAAM,KAAK,WAAW,GAAG;CACxC,IAAI;EACF,MAAM,OAAO,KAAK;CACpB,UAAU;EACR,MAAM,OAAO,MAAM;CACrB;AACF;AAEA,SAAS,YAAY,OAAgB,MAAuB;CAC1D,OACE,UAAU,QACV,OAAO,UAAU,YACjB,UAAU,SACT,MAA6B,SAAS;AAE3C;;;;AC5YA,eAAsB,uCACpB,UACA,UAAgD,CAAC,GACpB;CAC7B,MAAM,eAAe,iCAAiC,QAAQ;CAC9D,MAAM,mBAAmB,QAAQ,oBAAoB,aAAa;CAClE,IAAI,mBAAmB,aAAa,kBAClC,MAAM,IAAI,MAAM,+DAA+D;CAEjF,MAAM,sBAAsB,yBAAyB,gBAAgB;CACrE,MAAM,QAAQ,+BAA+B,QAAQ;CACrD,MAAM,UAAmC,CAAC;CAE1C,IAAI,MAAM,OAAO,SAAS,YAAY;EACpC,MAAM,cAAc,MAAM;EAC1B,IAAI,CAAC,aAAa,MAAM,IAAI,MAAM,wCAAwC;EAC1E,QAAQ,KACN,+BACE,YAAY;GACV,MAAM,SAAS,MAAM,MAAM,MAAM,OAAO,MAAM;IAC5C,aAAa,MAAM;IACnB,eAAe,YAAY;IAC3B,cAAc,YAAY;IAC1B,oBAAoB,YAAY;IAChC,QAAQ;GACV,CAAC;GACD,IAAI,OAAO,WAAW,QAAQ,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,QAAQ,QAAQ,QAAQ,GAC9E,MAAM,IAAI,MAAM,8DAA8D;EAElF,GACA,qBACA,0BACF,CACF;CACF;CAEA,QAAQ,KACN,+BACE,YAAY;EAeV,IAdmB,kCACjB,MAAM,MAAM,MAAM,OAAO,YAAY;GACnC,aAAa,MAAM;GACnB,eAAe,MAAM;GACrB,aAAa,MAAM,iBAAiB;GACpC,UAAU,MAAM;GAChB,QAAQ;EACV,CAAC,GACD;GACE,eAAe,MAAM;GACrB,aAAa,MAAM,iBAAiB;GACpC,OAAO,MAAM,cAAc;EAC7B,CAEW,CAAC,CAAC,MAAM,eAAe,GAClC,MAAM,IAAI,MAAM,0DAA0D;CAE9E,GACA,qBACA,4BACF,CACF;CAGA,MAAM,YAAW,MADK,QAAQ,WAAW,OAAO,EAAA,CAE7C,QAAQ,WAA4C,OAAO,WAAW,UAAU,CAAC,CACjF,KAAK,WAAW,OAAO,MAAM;CAChC,IAAI,SAAS,SAAS,GAAG;EACvB,kCAAkC,UAAU,iBAAiB;EAC7D,MAAM,IAAI,eAAe,UAAU,uCAAuC;CAC5E;CAEA,kCAAkC,UAAU,UAAU;CACtD,OAAO,OAAO,OAAO,EAAE,UAAU,KAAc,CAAC;AAClD;;;ACtCA,MAAM,oCAAoC;AAC1C,MAAM,gCAAgC;;;;;;;;;AAUtC,eAAsB,qCACpB,SAC8D;CAC9D,IAAI,OAAO,QAAQ,YAAY,YAC7B,MAAM,IAAI,UAAU,oDAAoD;CAG1E,MAAM,WAAW,MAAM,QAAQ,KAAK,QAAQ,QAAQ,OAAO;CAC3D,MAAM,cAAc,MAAM,QAAQ,KAAK,aAAa;EAClD,GAAG,QAAQ;EACX;CACF,CAAC;CAED,IAAI;CACJ,IAAI;CACJ,IAAI,kBAAkB;CACtB,IAAI,YAAY;CAChB,IAAI,SAAwD;CAE5D,IAAI;EACF,MAAM,aAAa,MAAM,QAAQ,KAAK,cAAc;GAClD,aAAa,QAAQ,QAAQ;GAC7B,eAAe,QAAQ,QAAQ;GAC/B,aAAa,YAAY;GACzB;GACA,cAAc,QAAQ;EACxB,CAAC;EACD,YAAY;EACZ,QAAQ,MAAM,QAAQ,QAAQ;GAAE;GAAY;GAAa;EAAS,CAAC;EACnE,SAAS;CACX,SAAS,OAAO;EACd,iBAAiB;EACjB,kBAAkB;EAClB,IAAI,WAAW,SAAS;CAC1B;CAEA,IAAI;CACJ,IAAI;EACF,aAAa,MAAM,0BAA0B,SAAS;GACpD,aAAa,QAAQ,QAAQ;GAC7B,eAAe,QAAQ,QAAQ;GAC/B,aAAa,YAAY;GACzB;GACA;EACF,CAAC;CACH,SAAS,iBAAiB;EACxB,IAAI,iBACF,MAAM,IAAI,eACR,CAAC,gBAAgB,eAAe,GAChC,+DACF;EAEF,MAAM;CACR;CAEA,IAAI,iBAAiB,MAAM;CAC3B,OAAO;EAAE;EAAO;EAAU;EAAa;CAAW;AACpD;AAEA,eAAe,0BACb,SACA,OACiD;CACjD,IAAI,UAAU;CACd,SACE,IAAI;EACF,OAAO,MAAM,QAAQ,KAAK,YAAY,KAAK;CAC7C,SAAS,OAAO;EACd,IAAI,CAAC,8BAA8B,KAAK,GAAG,MAAM;EACjD,MAAM,cAAc,QAAQ,eAAe,KAAK,IAAI;EACpD,IAAI,eAAe,GAAG,MAAM;EAC5B,MAAM,uBAAuB,KAAK,IAAI,SAAS,WAAW,CAAC;EAC3D,IAAI,KAAK,IAAI,KAAK,QAAQ,cAAc,MAAM;EAC9C,UAAU,KAAK,IAAI,UAAU,GAAG,6BAA6B;CAC/D;AAEJ;AAEA,SAAS,uBAAuB,SAAgC;CAC9D,OAAO,IAAI,SAAS,YAAY,WAAW,SAAS,OAAO,CAAC;AAC9D;;AAGA,SAAS,8BAA8B,OAAyB;CAC9D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,MAAM,YAAY;CAClB,IAAI,UAAU,SAAS,4BAA4B,OAAO;CAC1D,OACE,OAAO,UAAU,YAAY,YAAY,gCAAgC,KAAK,UAAU,OAAO;AAEnG;;;;ACvGA,eAAsB,sCACpB,SAC8C;CAC9C,MAAM,SAAS,MAAM,QAAQ,WAAW,WAAW,QAAQ,OAAO;CAClE,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,iDAAiD;CAC9E,IAAI,OAAO,UACT,OAAO,OAAO,OAAO;EAAE,UAAU;EAAO,UAAU,OAAO;EAAU,aAAa;CAAK,CAAC;CAExF,MAAM,mBAAmB,wBACvB,QAAQ,oBAAoB,OAAO,MAAM,QAAQ,gBACnD;CACA,IAAI,mBAAmB,OAAO,MAAM,QAAQ,kBAC1C,MAAM,IAAI,MAAM,+DAA+D;CAIjF,KADY,QAAQ,OAAO,KAAK,IAAA,CACxB,IAAI,OAAO,MAAM,kBACvB,MAAM,IAAI,MAAM,2CAA2C;CAG7D,MAAM,sBAAsB,yBAAyB,gBAAgB;CACrE,MAAM,qBAAqB,IAAI,iCAAiC,QAAQ,UAAU;CAClF,MAAM,cAAc,qCACZ,wBAAwB,OAAO,OAAO,QAAQ,eAAe,GACnE,qBACA,6CACF;CACA,MAAM,iBAAiB,+BACrB,OAAO,kBAAkB;EAavB,8CAA8C,MAZxB,QAAQ,SAAS,KACrC;GACE,aAAa,OAAO,MAAM;GAC1B,qBAAqB,OAAO,MAAM;EACpC,GACA;GACE,YAAY;GACZ,QAAQ;GACR,QAAQ;GACR,cAAc;EAChB,CACF,CACqD;EACrD,IAAI,QAAQ,SAAS,SAAS;GAC5B,MAAM,WAAW,MAAM,QAAQ,SAAS,QACtC;IACE,aAAa,OAAO,MAAM;IAC1B,qBAAqB,OAAO,MAAM;GACpC,GACA,EAAE,QAAQ,cAAc,CAC1B;GACA,IAAI,SAAS,aAAa,QAAQ,OAAO,KAAK,QAAQ,CAAC,CAAC,MAAM,QAAQ,QAAQ,UAAU,GACtF,MAAM,IAAI,MAAM,kEAAkE;EAEtF;EACA,OAAO,EAAE,SAAS,KAAc;CAClC,GACA,qBACA,uCACF;CAEA,MAAM,eAAe,+BACnB,YACE,kCACE,MAAM,QAAQ,MAAM,OAAO,YAAY;EACrC,aAAa,OAAO,MAAM;EAC1B,eAAe,OAAO,MAAM,QAAQ;EACpC,aAAa,OAAO,MAAM,QAAQ;EAClC,UAAU,OAAO,MAAM,QAAQ;EAC/B,QAAQ;CACV,CAAC,GACD;EACE,eAAe,OAAO,MAAM,QAAQ;EACpC,aAAa,OAAO,MAAM,QAAQ;EAClC,OAAO,OAAO,MAAM,QAAQ,cAAc;CAC5C,CACF,GACF,qBACA,oCACF;CAEA,MAAM,gBAAgB,OAAO,MAAM,QAAQ,SACvC,+BACE,YAAY;EACV,MAAM,SAAS,OAAO,MAAM,QAAQ;EACpC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,4CAA4C;EACzE,MAAM,SAAS,MAAM,QAAQ,MAAM,OAAO,MAAM;GAC9C,aAAa,OAAO,MAAM;GAC1B,eAAe,OAAO,MAAM,QAAQ;GACpC,cAAc,OAAO;GACrB,oBAAoB,OAAO;GAC3B,QAAQ;EACV,CAAC;EACD,IAAI,OAAO,WAAW,QAAQ,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,QAAQ,QAAQ,QAAQ,GAC9E,MAAM,IAAI,MAAM,sDAAsD;EAExE,OAAO,EAAE,QAAQ,KAAc;CACjC,GACA,qBACA,kCACF,IACA,KAAA;CAEJ,MAAM,kBAAkB,QAAQ,WAAW,CACzC,cACA,iBAAiB,QAAQ,QAAQ,KAAA,CAAS,CAC5C,CAAU;CACV,MAAM,CAAC,oBAAoB,kBAAkB,MAAM,QAAQ,WAAW,CACpE,aACA,cACF,CAAU;CACV,MAAM,WAAsB,CAAC,oBAAoB,cAAc,CAAC,CAC7D,QAAQ,YAA8C,QAAQ,WAAW,UAAU,CAAC,CACpF,KAAK,YAAY,QAAQ,MAAM;CAClC,MAAM,CAAC,cAAc,iBAAiB,MAAM;CAC5C,KAAK,MAAM,WAAW,CAAC,cAAc,aAAa,GAChD,IAAI,QAAQ,WAAW,YAAY,SAAS,KAAK,QAAQ,MAAM;CAEjE,IAAI,SAAS,SAAS,GACpB,MAAM,IAAI,eAAe,UAAU,+CAA+C;CAGpF,IAAI,aAAa,WAAW,aAC1B,MAAM,IAAI,MAAM,sDAAsD;CAExE,MAAM,QAAQ,aAAa;CAC3B,MAAM,kBAAkB,MAAM,qCAE1B,wCACE;EACE,aAAa,OAAO,MAAM;EAC1B,qBAAqB,OAAO,MAAM;EAClC,eAAe,OAAO,MAAM,QAAQ;CACtC,GACA,OACA,QAAQ,eACV,GACF,qBACA,gDACF;CACA,MAAM,eACJ,OAAO,UAAU,aAAa,MAAM,MAAM,eAAe,IACrD,6BACA;CACN,MAAM,kBAAkB,MAAM,qCAE1B,+BAA+B,QAAQ,iBAAiB;EACtD,aAAa,OAAO,MAAM;EAC1B,SAAS;EACT,OAAO,wBAAwB;GAC7B,MAAM;GACN,aAAa,OAAO,MAAM;GAC1B,SAAS,OAAO,MAAM;GACtB,cAAc,OAAO,MAAM;GAC3B,qBAAqB,OAAO,MAAM;GAClC,8BACE,OAAO,MAAM,oBAAoB,uBAAuB;GAC1D;GACA,gBAAgB;GAChB,uBAAuB,gBAAgB;GACvC,cAAc,OAAO,MAAM,QAAQ,WAAW,KAAA;EAChD,CAAC;CACH,CAAC,GACH,qBACA,gDACF;CACA,MAAM,SAAS,OAAO,MAAM,QAAQ;CACpC,OAAO,MAAM,QAAQ,WAAW,eAAe,QAAQ,SAAS;EAC9D;EACA,OAAO,MAAM;EACb,iBAAiB,gBAAgB;EACjC;EACA,SAAS;GACP,SAAS;GACT,qBAAqB,OAAO,MAAM;EACpC;EACA,OAAO;GACL,QAAQ;GACR,eAAe,OAAO,MAAM,QAAQ;GACpC,aAAa,OAAO,MAAM,QAAQ;EACpC;EACA,GAAI,SACA,EACE,QAAQ;GACN,QAAQ;GACR,eAAe,OAAO,MAAM,QAAQ;GACpC,cAAc,OAAO;GACrB,oBAAoB,OAAO;EAC7B,EACF,IACA,CAAC;CACP,CAAC;AACH;AAEA,eAAe,wBACb,OACA,WAIC;CACD,MAAM,CAAC,WAAW,gBAAgB,MAAM,QAAQ,IAAI,CAClD,qBAAqB,MAAM,oBAAoB,eAAe,SAAS,GACvE,qBAAqB,MAAM,oBAAoB,wBAAwB,SAAS,CAClF,CAAC;CACD,MAAM,OAAO,0CAA0C,MACrD,oBAAoB,WAAW,MAAM,CACvC;CACA,IAAI,MAAM,oBAAoB,cAAc,WAAW,MAAM,qBAC3D,MAAM,IAAI,MAAM,oEAAoE;CAEtF,MAAM,kBAAkB,oBAAoB,cAAc,yBAAyB;CACnF,MAAM,UAAU,2CAA2C,MAAM;EAC/D,GAAG;EACH,QAAQ,MAAM,oBAAoB,uBAAuB;CAC3D,CAAC;CACD,IACE,QAAQ,iBAAiB,MAAM,gBAC/B,QAAQ,cAAc,WAAW,MAAM,uBACvC,KAAK,QAAQ,iBAAiB,MAAM,gBACpC,KAAK,gBAAgB,MAAM,aAE3B,MAAM,IAAI,MAAM,gEAAgE;CAElF,OAAO;EAAE;EAAM;CAAQ;AACzB;AAEA,SAAS,oBAAoB,OAAmB,OAAwC;CACtF,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,MAAM,CAAC;CACzD,SAAS,OAAO;EACd,MAAM,IAAI,MAAM,sBAAsB,MAAM,eAAe,EAAE,OAAO,MAAM,CAAC;CAC7E;CACA,IAAI,CAAC,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAC/D,MAAM,IAAI,MAAM,sBAAsB,MAAM,mBAAmB;CAEjE,IAAI,CAAC,OAAO,KAAK,wBAAwB,MAAM,CAAC,CAAC,CAAC,OAAO,OAAO,KAAK,KAAK,CAAC,GACzE,MAAM,IAAI,MAAM,sBAAsB,MAAM,yBAAyB;CAEvE,OAAO;AACT"}

package/dist/graph-DzkWh1BI.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-DzkWh1BI.js","names":[],"sources":["../src/runtime/supervise/graph.ts"],"sourcesContent":["/**\n *\n * `runGraph` — agent graphs: profiles as nodes, registry-backed prompt directives as edges.\n *\n * A topology is PLAIN DATA an agent can author in a few lines: nodes are canonical\n * `AgentProfile`s (the ONLY way a node is described — no role-builder functions), edges are typed\n * values carrying versioned {@link PromptHandle} directives, `deliverable` (termination) and\n * `budget` (one conserved pool) are mandatory. Driver↔worker is the two-node cyclic instance;\n * \"agent 3 analyzes 1 and 2 and reports to 1\" is ONE edge, not a framework.\n *\n * NOT A SECOND SCHEDULER. `runGraph` is an interpretation layer over what already runs:\n * `supervise()` is the execution core — the same `supervisorAgent`/`driverAgent` machinery,\n * backend-derived worker path (authorized, classified, recursive), conserved-pool budget, and\n * deliverable-gated settlement every\n * supervised run uses. (`runAgentRounds` is deliberately NOT the substrate here.) What the graph\n * layer ADDS is exactly what a bespoke driver loop never\n * had:\n *\n *  1. **Node pinning** — a spawn names a node (`profile.name` = node id) and the node's canonical\n *     profile is what runs; a driver cannot smuggle capabilities into a worker it did not define.\n *  2. **Observable edges** — every delegates/analyzes traversal lands in an EDGE LEDGER\n *     (`delivered | stripped | empty | unpropagated`, with byte counts), in memory on\n *     the result AND as `edge` events in the run journal. The motivating incident: a filter\n *     silently replaced 1,700-char steering with 241 chars of boilerplate for three rounds and\n *     NO artifact said so — an unobservable edge cannot be trusted and its directive cannot be\n *     optimized.\n *  3. **Directives as data** — edge text lives in the prompt registry (`<surface>/v<n>`), so every\n *     edge is a versioned optimization target, never prose hardcoded in a builder function.\n *  4. **Per-edge traversal caps** — the cyclic-graph backstop. A delegates edge whose cap is\n *     exhausted REFUSES further traversals (fail loud), so a cycle cannot spin the pool dry.\n *  5. **Continuity as data** — a delegates edge may declare `continuity: 'resume'`, so each spawn\n *     after the node's first re-attaches to its latest SETTLED session (the spawn context hands\n *     the executor seam `resume: { ofWorker, sequence }`; the kernel keeps identity, ordering,\n *     ledger truth, and the one conserved pool). Every ledger row states how its hop continued:\n *     `'fresh' | 'resume'` for spawns, `'steer'` for mid-run deliveries — fresh respawns, session\n *     resumes, and live steers are all plain data, each a ledgered fact.\n *\n * ORACLES ARE ENVIRONMENT, NEVER WORKERS. Graders/verifiers must not be spawnable in the graph —\n * a delegates edge to them leaks the rubric. An `analyzes` edge names its analyst in one of two\n * forms: a LENS id from the environment's registry (a pure function over trace evidence), or the\n * id of a graph NODE — a tool-equipped analyst AGENT spawned on each matching settle with the\n * node's pinned profile, whose settle output IS the findings. Either way the oracle doctrine\n * holds: an analyst node can never be a delegates target (refused loudly), so no driver can hand\n * it work, and an id living in both the registry and the nodes is refused as ambiguous.\n *\n * @experimental\n */\n\nimport {\n  type AgentProfile,\n  agentProfileSchema,\n  canonicalCandidateDigest,\n} from '@tangle-network/agent-interface'\nimport { InMemoryResultBlobStore, InMemorySpawnJournal } from '../../durable/spawn-journal'\nimport { ConfigError, ValidationError } from '../../errors'\nimport type {\n  AnalystRegistry,\n  AnalyzeOnSettleRoute,\n  ContinuityMode,\n  CoordinationEvent,\n  MakeWorkerAgent,\n} from '../../mcp/tools/coordination'\nimport { composeRuntimeHooks, type RuntimeHooks } from '../../runtime-hooks'\nimport { harnessRunsAgent } from '../harness-role'\nimport type { ToolLoopChat } from '../tool-loop'\nimport type { DeliverableSpec } from './completion-gate'\nimport {\n  formatPromptHandle,\n  kernelPromptRegistry,\n  type PromptHandle,\n  type PromptRegistry,\n} from './prompt-registry'\nimport { type SuperviseOptions, supervise, superviseWithTestBrain } from './supervise'\nimport type { Budget, NodeId, ResultBlobStore, SpawnJournal, SupervisedResult } from './types'\n\n// ── The algebra ────────────────────────────────────────────────────────────────\n\n/** A graph node: an id and a canonical `AgentProfile`. The profile is the ONLY way a node is\n *  described — its `prompt.systemPrompt` is the standing role (the 0.117 canonical resolution;\n *  never a legacy top-level-only reduction), its tools/mcp/resources are its capabilities. */\nexport interface GraphNode {\n  readonly id: NodeId\n  readonly profile: AgentProfile\n}\n\nexport type GraphEdge =\n  /** Work flows down. The delegation directive is DATA → versionable, sweepable, optimizable.\n   *  Each spawn of `to` by `from` — and each mid-run steer from `from` to a live `to` worker —\n   *  is one traversal. */\n  | {\n      readonly kind: 'delegates'\n      readonly from: NodeId\n      readonly to: NodeId\n      readonly directive: PromptHandle\n      /** Cyclic-graph backstop: traversals beyond this REFUSE (fail loud). Default\n       *  {@link defaultEdgeTraversalCap}. */\n      readonly maxTraversals?: number\n      /** Default continuity for this edge's SPAWN traversals. `'resume'` makes every spawn after\n       *  the node's first re-attach to its most recent SETTLED worker: a NEW live worker whose\n       *  spawn context carries `resume: { ofWorker, sequence }` for the executor seam, spending\n       *  from the same conserved pool — the node's first spawn is effectively `'fresh'`, and a\n       *  spawn while a prior worker is still live refuses loudly (steer is the live channel).\n       *  The driver's per-call `spawn_worker` `continuity` argument overrides either way. Omit =\n       *  `'fresh'` (today's behavior, byte-identical). Caps count resumes exactly like fresh\n       *  spawns. */\n      readonly continuity?: ContinuityMode\n    }\n  /** Findings flow anywhere: an analyst over N nodes' settled traces, delivered to ONE node.\n   *  With a LENS analyst the directive wraps the findings for the recipient; with a NODE analyst\n   *  the directive is the analyst agent's task and the findings are its settle output. */\n  | {\n      readonly kind: 'analyzes'\n      /** The analyst REFERENCE, in one of two forms: a lens id resolved against\n       *  `RunGraphOptions.analysts` (environment), or the id of a graph NODE with no delegates\n       *  edge pointing at it — then each matching settle spawns that node's pinned profile as a\n       *  tool-equipped analyst WORKER (same spawn machinery, conserved budget, trace join) whose\n       *  task is this edge's directive plus the settled worker's trace evidence and whose settle\n       *  output is the findings. An id that is both a node and a registry lens is refused. */\n      readonly analyst: string\n      readonly over: ReadonlyArray<NodeId>\n      readonly to: NodeId\n      readonly directive: PromptHandle\n      /** Observability cap: traversals beyond this are LEDGERED as exhausted (`unpropagated`).\n       *  Only delegates caps refuse traversal — they are what close the spawn cycle. */\n      readonly maxTraversals?: number\n    }\n\nexport interface AgentGraph {\n  readonly nodes: ReadonlyArray<GraphNode>\n  readonly edges: ReadonlyArray<GraphEdge>\n  /** Termination is mandatory, not optional: the independent completion oracle. */\n  readonly deliverable: DeliverableSpec<unknown>\n  /** One conserved pool across the whole graph — cycles without conservation never terminate. */\n  readonly budget: Budget\n}\n\n// ── The edge ledger ────────────────────────────────────────────────────────────\n\nexport type EdgeDeliveryOutcome = 'delivered' | 'stripped' | 'empty' | 'unpropagated'\n\n/** How one ledgered hop CONTINUED: a spawn traversal stamps its effective spawn mode\n *  (`'fresh'` | `'resume'`), and every mid-run delivery into an already-live recipient — a\n *  driver steer leg and every analyzes delivery (routed steer or driver-destined finding) —\n *  stamps `'steer'`. Zero ambiguity: every row carries exactly one of the three. */\nexport type TraversalContinuity = ContinuityMode | 'steer'\n\n/** One recorded edge traversal — the in-memory row; the journal twin is the `edge` SpawnEvent. */\nexport interface EdgeTraversal {\n  /** Stable edge id: `delegates:<from>-><to>` or `analyzes:<analyst>:<over…>-><to>`. */\n  readonly edge: string\n  readonly kind: 'delegates' | 'analyzes'\n  readonly from: string\n  readonly to: string\n  /** The resolved directive reference (`<surface>/v<n>`). */\n  readonly directive: string\n  /** 1-based per-edge ordinal. */\n  readonly traversal: number\n  readonly outcome: EdgeDeliveryOutcome\n  /** How this hop continued — see {@link TraversalContinuity}. */\n  readonly continuity: TraversalContinuity\n  /** Bytes of directive + payload that actually crossed the edge. */\n  readonly bytes: number\n  readonly reason?: string\n  /** The concrete worker node id, once known. */\n  readonly workerId?: string\n}\n\n/** Default per-edge traversal cap — the cyclic-graph backstop when an edge names none. */\nexport const defaultEdgeTraversalCap = 32\n\n/** A delegates edge exhausted its traversal cap and the run produced no winner: the cap, not the\n *  task, ended it. Carries the full evidence so failing loud loses nothing. */\nexport class GraphEdgeCapError extends Error {\n  readonly exhaustedEdges: ReadonlyArray<string>\n  readonly ledger: ReadonlyArray<EdgeTraversal>\n  readonly result: SupervisedResult<unknown>\n  constructor(\n    exhaustedEdges: ReadonlyArray<string>,\n    ledger: ReadonlyArray<EdgeTraversal>,\n    result: SupervisedResult<unknown>,\n  ) {\n    super(\n      `runGraph: edge traversal cap exhausted on ${exhaustedEdges.join(', ')} and the run ` +\n        'delivered no winner — the cap (the cyclic-graph backstop), not the task, ended this run. ' +\n        'Raise maxTraversals on the edge or fix the cycle; the full edge ledger and the ' +\n        'supervised result ride on this error.',\n    )\n    this.name = 'GraphEdgeCapError'\n    this.exhaustedEdges = exhaustedEdges\n    this.ledger = ledger\n    this.result = result\n  }\n}\n\n// ── Options / result ───────────────────────────────────────────────────────────\n\n/**\n * Every `SuperviseOptions` key, partitioned by what `runGraph` does with it.\n *\n * `runGraph` starts one `supervise()` run, so every option that run honors is a graph option too\n * unless the graph itself owns the value. This used to be an opt-in list written by hand, and the\n * hand lost: 25 of 49 keys never reached `supervise()` from a graph, including `childSettleGraceMs`\n * (a root-driver failure tore down children that had ALREADY computed the deliverable) and\n * `driverRetry` (agent-runtime#963). Each absence was discovered by losing a run.\n *\n * The four lists below must cover `keyof SuperviseOptions` exactly. `everySuperviseOptionIsClassified`\n * below fails to COMPILE, naming the offender, when a key belongs to none of them — so the next\n * option added to `supervise()` cannot go missing here silently. It has to be classified, and\n * classifying it as forwarded is one word.\n */\n\n/** The graph derives these from the `AgentGraph` itself; a caller value would be overwritten. */\nconst GRAPH_OWNED_SUPERVISE_OPTIONS = [\n  'rootDriverFromBackend',\n  'resolveSpawnProfile',\n  'budget',\n  'deliverable',\n  'makeWorkerAgent',\n  'onCoordinationEvent',\n  'analyzeOnSettle',\n  'continuityByProfile',\n] as const\n\n/** Caller-facing on `RunGraphOptions`, but the graph wraps or defaults the value before it goes in:\n *  `hooks` composes with the graph's own spawn-binding hook, `authorizeMessage` is wrapped so a\n *  narrowed instruction ledgers `stripped`, `authorizeSpawn` runs AFTER the graph has pinned the\n *  node (so a product sees the canonical profile, never the driver's stub), `makeLeafAgent` is the\n *  caller's leaf override slotted under the graph's pinning, `analysts` rides only with analyze\n *  routes, and `journal`/`blobs`/`runId` get graph defaults. */\nconst GRAPH_TRANSFORMED_SUPERVISE_OPTIONS = [\n  'hooks',\n  'authorizeMessage',\n  'authorizeSpawn',\n  'makeLeafAgent',\n  'analysts',\n  'journal',\n  'blobs',\n  'runId',\n] as const\n\n/** Not reachable from a graph, with the reason. `registry` is a NAME COLLISION, not a policy:\n *  `RunGraphOptions.registry` is the directive `PromptRegistry` and `SuperviseOptions.registry` is\n *  the `SuperviseRegistry` name→value table. Two different types under one name; the graph's wins.\n *  Giving the supervise one a graph channel means renaming a public option, so it is recorded here\n *  rather than silently dropped. */\nconst GRAPH_REFUSED_SUPERVISE_OPTIONS = ['registry'] as const\n\n/**\n * Forwarded to the root `supervise()` VERBATIM. Everything not owned, transformed, or refused\n * above belongs here — the default is \"a graph honors it\", not \"someone remembered to add it\".\n */\nconst GRAPH_FORWARDED_SUPERVISE_OPTIONS = [\n  'backend',\n  'rootHandle',\n  'signal',\n  'execution',\n  'resolveDeliverable',\n  'coordination',\n  'peerMail',\n  'driverBackend',\n  'profileSecurity',\n  'authorizeSpawn',\n  'isDriverProfile',\n  'router',\n  'driveHarness',\n  'driverRetry',\n  'onDriverAttempt',\n  'repromptOnUnmet',\n  'onUnmetContract',\n  'childSettleGraceMs',\n  'resolveDriveHarness',\n  'driveHarnessMaterialization',\n  'resolveSupervisorTools',\n  'extraTools',\n  'executeExtraTool',\n  'perWorker',\n  'maxLiveWorkers',\n  'watchWorkers',\n  'stallAfterMs',\n  'runDir',\n  'probes',\n  'stopRule',\n  'onProgressStop',\n  'maxDepth',\n  'maxTurns',\n  'compaction',\n  'now',\n  'allowedModels',\n  'finalizer',\n  'otel',\n] as const\n\ntype ClassifiedSuperviseOption =\n  | (typeof GRAPH_OWNED_SUPERVISE_OPTIONS)[number]\n  | (typeof GRAPH_TRANSFORMED_SUPERVISE_OPTIONS)[number]\n  | (typeof GRAPH_REFUSED_SUPERVISE_OPTIONS)[number]\n  | (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number]\n\n/**\n * Every key `RunGraphOptions` accepts, as data: the forwarded and transformed `SuperviseOptions`\n * keys, the name-colliding `registry`, and the graph's own `brain`. `GRAPH_OWNED_SUPERVISE_OPTIONS`\n * is deliberately absent — a caller value for one of those is overwritten by the graph, so it is\n * refused by name rather than discarded.\n *\n * The assignment below fails to COMPILE, naming the key, when `RunGraphOptions` declares something\n * this list does not carry.\n */\nconst runGraphOptionKeys = [\n  ...GRAPH_FORWARDED_SUPERVISE_OPTIONS,\n  ...GRAPH_TRANSFORMED_SUPERVISE_OPTIONS,\n  ...GRAPH_REFUSED_SUPERVISE_OPTIONS,\n  'brain',\n] as const\n\ntype UnlistedRunGraphOption = Exclude<keyof RunGraphOptions, (typeof runGraphOptionKeys)[number]>\nconst everyRunGraphOptionIsListed: UnlistedRunGraphOption extends never\n  ? true\n  : UnlistedRunGraphOption = true\nvoid everyRunGraphOptionIsListed\n\nconst runGraphOptionKeySet: ReadonlySet<string> = new Set<string>(runGraphOptionKeys)\nconst graphOwnedOptionKeySet: ReadonlySet<string> = new Set<string>(GRAPH_OWNED_SUPERVISE_OPTIONS)\n\n/**\n * Refuse an option key the graph would not read, naming it and saying which kind it is.\n *\n * A graph-owned key is the sharper case: it type-checks against a widened `SuperviseOptions`\n * value, the graph derives its own value and overwrites the caller's, the run succeeds, and the\n * capability the caller asked for is not there. The rename of the leaf seam from `makeWorkerAgent`\n * to `makeLeafAgent` is the shape of the failure — the old name stayed a valid `SuperviseOptions`\n * key AND a graph-owned one, so a caller that kept passing it got a run with no leaf override and\n * no complaint.\n */\nfunction assertRunGraphOptionKeys(opts: RunGraphOptions): void {\n  const graphOwned: string[] = []\n  const unknown: string[] = []\n  for (const key of Object.keys(opts)) {\n    if (runGraphOptionKeySet.has(key)) continue\n    if (graphOwnedOptionKeySet.has(key)) graphOwned.push(key)\n    else unknown.push(key)\n  }\n  if (graphOwned.length > 0) {\n    throw new ConfigError(\n      `runGraph: ${graphOwned.sort().join(', ')} — the graph derives this from the AgentGraph ` +\n        'itself, so a caller value is overwritten and the capability it asks for would silently ' +\n        'be absent',\n    )\n  }\n  if (unknown.length > 0) {\n    throw new ConfigError(\n      `runGraph: unknown option ${unknown.sort().join(', ')} — no reader consults that name, so ` +\n        'the value would be discarded and the capability it asks for would silently be absent',\n    )\n  }\n}\n\n/** A `SuperviseOptions` key in none of the four lists makes this assignment fail, and the compiler\n *  error names the key. Classify it — `GRAPH_FORWARDED_SUPERVISE_OPTIONS` is usually the answer. */\ntype UnclassifiedSuperviseOption = Exclude<keyof SuperviseOptions, ClassifiedSuperviseOption>\nconst everySuperviseOptionIsClassified: UnclassifiedSuperviseOption extends never\n  ? true\n  : UnclassifiedSuperviseOption = true\nvoid everySuperviseOptionIsClassified\n\n/** `backend` and `driverBackend` keep graph-specific documentation below.\n *\n * Do not inherit and redeclare them through an indexed access type.\n * TypeScript 7 correctly treats `SuperviseOptions['backend']` as including `undefined`, which makes\n * that redeclaration wider than the exact optional property inherited from `SuperviseOptions`.\n */\ntype GraphInheritedSuperviseOption = Exclude<\n  (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number],\n  'backend' | 'driverBackend'\n>\n\n/** Copy every forwarded option the caller actually set. Absent stays absent: `supervise()` and the\n *  graph must not disagree about what \"unset\" means. */\nfunction forwardedSuperviseOptions(\n  opts: RunGraphOptions,\n): Pick<SuperviseOptions, (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number]> {\n  const forwarded: Record<string, unknown> = {}\n  for (const key of GRAPH_FORWARDED_SUPERVISE_OPTIONS) {\n    const value = (opts as Record<string, unknown>)[key]\n    if (value !== undefined) forwarded[key] = value\n  }\n  return forwarded as Pick<SuperviseOptions, (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number]>\n}\n\n/**\n * Options for one `runGraph` run.\n *\n * Extends every forwarded `SuperviseOptions` key, so a graph honors what a `supervise()` run\n * honors WITHOUT anyone restating it here. Only the graph-specific members and the ones whose\n * graph semantics differ are declared below; everything else inherits its type AND its\n * documentation from `SuperviseOptions`, which is the one owner of both.\n */\nexport interface RunGraphOptions extends Pick<SuperviseOptions, GraphInheritedSuperviseOption> {\n  /** WHERE worker nodes run — the executor backend. Provide this OR `makeLeafAgent`. Forwarded to\n   *  `supervise()`, which derives every authorized LEAF from it; a node declared `role: 'driver'`\n   *  becomes a nested supervisor instead, whose own leaves are derived the same way. */\n  readonly backend?: Exclude<SuperviseOptions['backend'], undefined>\n  /** WHERE the ROOT node's harness brain runs — forwarded to `supervise()` verbatim (see\n   *  `SuperviseOptions.driverBackend`). Needed when the root node's profile declares an external\n   *  harness (`codex`, `claude-code`, `opencode`): that root is driven by the harness, not by the\n   *  router brain, and automatic execution supports a local `bridge`. Unlike `supervise()`, this\n   *  does NOT default to `backend`: a graph's `backend` places WORKER nodes, so the root driver\n   *  is selected only by this field. Omit = no harness driver, which is correct for a root whose\n   *  `profile.harness` is omitted or `cli-base` (that root runs on the router brain). */\n  readonly driverBackend?: Exclude<SuperviseOptions['driverBackend'], undefined>\n  /** Leaf-execution override (offline tests / advanced). `runGraph` still owns node pinning,\n   *  directive delivery, and the edge ledger AROUND this seam — only the leaf `act` is yours.\n   *  Slots INSIDE the kernel's authorized path (`SuperviseOptions.makeLeafAgent`), so a node\n   *  declared `role: 'driver'` still becomes a nested supervisor even under an offline leaf. */\n  readonly makeLeafAgent?: MakeWorkerAgent\n  /** The ROOT driver's inference seam — a caller-owned `ToolLoopChat` that makes every root\n   *  model call. Use it when the root's decisions must be caller-owned orchestration (a\n   *  deterministic conversation driver, a persona loop with its own LLM calls) rather than a\n   *  router-derived model call. The graph machinery around the seam is unchanged: node pinning,\n   *  directive delivery, the edge ledger, and the journal twin all run the same shipped path,\n   *  and the root profile keeps prompt control (`prompt-control-execution` materialization —\n   *  `systemPrompt`/`instructions` still apply). What moves to the caller with the brain:\n   *  model selection and provider-identity validation (`expectedModel` cannot be enforced on a\n   *  call the runtime did not place) and per-turn usage reporting (a brain that reports no\n   *  usage meters nothing into the pool). Omit = the router brain derived from the root\n   *  profile — the unchanged default. Mutually exclusive with `driverBackend`, and refused\n   *  when the root profile declares an external harness (that root is driven BY the harness). */\n  readonly brain?: ToolLoopChat\n  /** Caller-side runtime hooks (telemetry, policy, product extensions). Composed AFTER the\n   *  graph's own spawn-binding hook on the SAME event stream — the graph never swallows the\n   *  seam supervise() exposes. */\n  readonly hooks?: RuntimeHooks\n  /** The analyst lens registry `analyzes` edges resolve against. ENVIRONMENT — needed only for\n   *  lens analysts; an analyzes edge naming a graph NODE as its analyst needs no registry. */\n  readonly analysts?: AnalystRegistry\n  /** Directive registry. Default: the seeded kernel registry (`kernelPromptRegistry()`).\n   *\n   *  NOT `SuperviseOptions.registry`, which is the `SuperviseRegistry` name→value table for\n   *  code-valued options. The two share a name and nothing else, and this one wins here — see\n   *  `GRAPH_REFUSED_SUPERVISE_OPTIONS`. */\n  readonly registry?: PromptRegistry\n  /** The run journal the edge ledger and every spawn/settle ride. Default: in-memory. */\n  readonly journal?: SpawnJournal\n  readonly blobs?: ResultBlobStore\n  readonly runId?: string\n  /** Product authority over every steer/answer instruction (the filter seam). `runGraph` observes\n   *  what it CHANGES: a narrowed instruction ledgers its steer traversal as `stripped`. */\n  readonly authorizeMessage?: SuperviseOptions['authorizeMessage']\n}\n\nexport interface GraphResult<Out = unknown> {\n  readonly result: SupervisedResult<Out>\n  /** Every edge traversal, in occurrence order — the observable-edge contract. */\n  readonly ledger: ReadonlyArray<EdgeTraversal>\n  /** Edge ids whose traversal cap was hit — analyzes exhaustion included (observable here, never\n   *  a refusal). A DELEGATES cap paired with a `no-winner` result THROWS\n   *  ({@link GraphEdgeCapError}) instead of returning: only delegates caps refuse spawns, so only\n   *  they can have ended the run. A LIFECYCLE no-winner (`aborted` / `budget-exhausted`) returns\n   *  normally even with an exhausted delegates cap — the abort or the pool, not the cap, ended\n   *  that run, and the exhaustion stays observable here. */\n  readonly exhaustedEdges: ReadonlyArray<string>\n  readonly runId: string\n}\n\n/** `RunGraphOptions` with the brain REQUIRED — the shape the `/testing` entry's\n *  `runGraphWithTestBrain` keeps accepting now that `brain` is a production option. */\nexport interface RunGraphTestOptions extends RunGraphOptions {\n  readonly brain: ToolLoopChat\n}\n\n// ── Validation ─────────────────────────────────────────────────────────────────\n\ninterface ValidatedGraph {\n  readonly root: GraphNode\n  readonly workers: ReadonlyMap<NodeId, GraphNode>\n  readonly delegatesByWorker: ReadonlyMap<NodeId, Extract<GraphEdge, { kind: 'delegates' }>>\n  readonly analyzes: ReadonlyArray<Extract<GraphEdge, { kind: 'analyzes' }>>\n  /** Nodes referenced as an analyzes edge's ANALYST (the analyst-agent form): reachable through\n   *  their analyzes edge (spawned on settle), never through a delegates edge. */\n  readonly analystNodes: ReadonlyMap<NodeId, GraphNode>\n}\n\nfunction edgeId(edge: GraphEdge): string {\n  return edge.kind === 'delegates'\n    ? `delegates:${edge.from}->${edge.to}`\n    : `analyzes:${edge.analyst}:${edge.over.join('+')}->${edge.to}`\n}\n\n/** Validate the graph and resolve every directive BEFORE any compute is spent — an invalid\n *  topology or an unknown directive is a configuration fault, never a mid-run surprise. */\nfunction validateGraph(\n  graph: AgentGraph,\n  registry: PromptRegistry,\n  analysts: AnalystRegistry | undefined,\n): ValidatedGraph {\n  if (!Array.isArray(graph.nodes) || graph.nodes.length === 0) {\n    throw new ValidationError('runGraph: graph.nodes must be a non-empty array')\n  }\n  if (!Array.isArray(graph.edges) || graph.edges.length === 0) {\n    throw new ValidationError('runGraph: graph.edges must be a non-empty array')\n  }\n  if (typeof graph.deliverable?.check !== 'function') {\n    throw new ValidationError('runGraph: graph.deliverable is mandatory (termination oracle)')\n  }\n  if (typeof graph.budget !== 'object' || graph.budget === null) {\n    throw new ValidationError('runGraph: graph.budget is mandatory (the conserved pool)')\n  }\n  const byId = new Map<NodeId, GraphNode>()\n  for (const node of graph.nodes) {\n    if (typeof node.id !== 'string' || node.id.length === 0) {\n      throw new ValidationError('runGraph: every node needs a non-empty string id')\n    }\n    if (byId.has(node.id)) throw new ValidationError(`runGraph: duplicate node id '${node.id}'`)\n    const parsed = agentProfileSchema.safeParse(node.profile)\n    if (!parsed.success) {\n      throw new ValidationError(\n        `runGraph: node '${node.id}' has an invalid AgentProfile: ${parsed.error.message}`,\n      )\n    }\n    // The profile NAME is the node identity everywhere downstream: node pinning resolves a\n    // spawn's `profile.name` against node ids, and the coordination layer matches analyst\n    // routes (`over`/`to`) against the settled worker's PROFILE NAME. A divergent name would\n    // make every analyzes edge touching this node silently never match — refuse it up front.\n    if (node.profile.name !== node.id) {\n      throw new ValidationError(\n        `runGraph: node '${node.id}' has profile.name ${JSON.stringify(node.profile.name)} — ` +\n          'profile.name IS the node identity (node pinning and analyst routing match on it) and ' +\n          'must equal the node id',\n      )\n    }\n    byId.set(node.id, node)\n  }\n  const requireNode = (id: NodeId, where: string): GraphNode => {\n    const node = byId.get(id)\n    if (!node) throw new ValidationError(`runGraph: ${where} references unknown node '${id}'`)\n    return node\n  }\n  const delegates = graph.edges.filter(\n    (edge): edge is Extract<GraphEdge, { kind: 'delegates' }> => edge.kind === 'delegates',\n  )\n  const analyzes = graph.edges.filter(\n    (edge): edge is Extract<GraphEdge, { kind: 'analyzes' }> => edge.kind === 'analyzes',\n  )\n  if (delegates.length === 0) {\n    throw new ValidationError('runGraph: at least one delegates edge is required (who spawns whom)')\n  }\n  for (const edge of graph.edges) registry.resolve(edge.directive)\n  for (const edge of delegates) {\n    requireNode(edge.from, edgeId(edge))\n    requireNode(edge.to, edgeId(edge))\n    if (edge.from === edge.to) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} delegates to itself — the driver↔worker cycle is the ` +\n          'settle-return loop, not a self-edge',\n      )\n    }\n    // The type admits only 'fresh' | 'resume', but a graph is plain data that often arrives\n    // through JSON — refuse a nonsense mode here, never let it reach the spawn tool as a string.\n    if (\n      edge.continuity !== undefined &&\n      edge.continuity !== 'fresh' &&\n      edge.continuity !== 'resume'\n    ) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} has invalid continuity ${JSON.stringify(edge.continuity)} — ` +\n          \"a delegates edge's continuity is 'fresh' or 'resume'\",\n      )\n    }\n  }\n  // Root: the one node that delegates and is never delegated TO. P0 executes the star/2-node\n  // cyclic family (one driver, N workers); nested driver graphs are the recorded P3 absorption.\n  const delegatedTo = new Set(delegates.map((edge) => edge.to))\n  const roots = [...new Set(delegates.map((edge) => edge.from))].filter(\n    (id) => !delegatedTo.has(id),\n  )\n  if (roots.length !== 1) {\n    throw new ValidationError(\n      `runGraph: expected exactly ONE root (a node that delegates and is never delegated to), ` +\n        `found ${roots.length === 0 ? 'none — delegates edges form a cycle with no entry' : roots.join(', ')}. ` +\n        'P0 executes driver↔worker(s); nested driver graphs are P3.',\n    )\n  }\n  const root = requireNode(roots[0] as string, 'root resolution')\n  for (const edge of delegates) {\n    if (edge.from !== root.id) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} delegates from a non-root node — P0 executes one driver over ` +\n          'its workers (the 2-node cyclic case, star-generalized); deeper delegation is P3',\n      )\n    }\n  }\n  const analystIds = new Set<string>()\n  const analystNodes = new Map<NodeId, GraphNode>()\n  for (const edge of analyzes) {\n    // Continuity is a delegates-edge axis ONLY: analysts (lens or node) are spawned by the\n    // analyst-on-settle machinery, each run a fresh session over settled evidence — an analyzes\n    // edge carrying continuity would silently mean nothing, so it is refused as data.\n    if ((edge as { continuity?: unknown }).continuity !== undefined) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} carries continuity — analysts are spawned by the analyst ` +\n          'machinery (every analyst run is a fresh session over settled evidence), so ' +\n          'continuity is a delegates-edge axis only',\n      )\n    }\n    // The runner's traversal ledger resolves a finding/steer back to its edge BY ANALYST ID\n    // alone, so a second edge sharing an analyst would silently absorb the first edge's\n    // traversals (last-registered wins). Multi-edge-per-analyst is not yet supported; refuse it\n    // rather than mis-ledger it.\n    if (analystIds.has(edge.analyst)) {\n      throw new ValidationError(\n        `runGraph: two analyzes edges share analyst '${edge.analyst}' — one analyzes edge per ` +\n          'analyst lens (traversals are ledgered by analyst id; a second edge would silently ' +\n          \"absorb the first's). Register the lens under a second id for a second edge.\",\n      )\n    }\n    analystIds.add(edge.analyst)\n    // The analyst REFERENCE has two forms — a registry lens id or a graph node id — and the id\n    // itself is what distinguishes them, so an id living in both is refused as ambiguous rather\n    // than silently resolved by precedence.\n    const analystNode = byId.get(edge.analyst)\n    const inRegistry = analysts?.kinds.some((kind) => kind.id === edge.analyst) === true\n    if (analystNode !== undefined && inRegistry) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} analyst '${edge.analyst}' is BOTH a graph node and a lens in ` +\n          'the analysts registry — the id alone distinguishes the two analyst forms, so this is ' +\n          'ambiguous; rename the node or register the lens under another id',\n      )\n    }\n    if (analystNode !== undefined) {\n      // The analyst-AGENT form. Oracle doctrine holds structurally: the analyst node can never\n      // receive work — not from the root (a delegates edge to it is refused) and not by being\n      // the root (the root delegates by definition).\n      if (analystNode.id === root.id) {\n        throw new ValidationError(\n          `runGraph: ${edgeId(edge)} names the ROOT as its analyst — the root is the driver; ` +\n            'give the analyst its own node with no delegates edge pointing at it',\n        )\n      }\n      if (delegatedTo.has(analystNode.id)) {\n        throw new ValidationError(\n          `runGraph: ${edgeId(edge)} names node '${edge.analyst}' as its analyst, but that node ` +\n            'is a delegates target — oracle doctrine: an analyst is never delegated to. An ' +\n            'analyst NODE is legal only with NO delegates edge pointing at it; give the analyst ' +\n            'its own delegates-free node or pass a lens id from RunGraphOptions.analysts.',\n        )\n      }\n      analystNodes.set(analystNode.id, analystNode)\n    } else if (!analysts) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} analyst '${edge.analyst}' is not a graph node, and no ` +\n          'RunGraphOptions.analysts registry was provided to resolve it as a lens',\n      )\n    } else if (!inRegistry) {\n      throw new ValidationError(\n        `runGraph: ${edgeId(edge)} analyst '${edge.analyst}' is neither a graph node nor in the ` +\n          `analysts registry (known lenses: ${analysts.kinds.map((kind) => kind.id).join(', ') || 'none'})`,\n      )\n    }\n    if (edge.over.length === 0) {\n      throw new ValidationError(`runGraph: ${edgeId(edge)} must analyze at least one node`)\n    }\n    for (const over of edge.over) {\n      requireNode(over, edgeId(edge))\n      // Analysts observe SETTLED WORKERS, matched by profile name — the root drives and never\n      // settles as a worker, so an edge over the root would silently never fire; refuse it.\n      if (over === root.id) {\n        throw new ValidationError(\n          `runGraph: ${edgeId(edge)} analyzes the ROOT — analysts observe settled workers, and ` +\n            'the root never settles as one, so this edge would silently never fire; list ' +\n            'delegates-target nodes only',\n        )\n      }\n    }\n    requireNode(edge.to, edgeId(edge))\n  }\n  // Second pass, once every analyst NODE is known: an analyst run's settlement is a FINDING,\n  // never a worker settle, so an analyzes edge OVER an analyst node would silently never fire —\n  // refuse it rather than let it rot unobserved.\n  for (const edge of analyzes) {\n    for (const over of edge.over) {\n      if (analystNodes.has(over)) {\n        throw new ValidationError(\n          `runGraph: ${edgeId(edge)} analyzes '${over}', which is an analyst node — an analyst ` +\n            'run settles as a finding, never as a worker, so this edge would silently never ' +\n            'fire; analyst nodes are not analyzable',\n        )\n      }\n    }\n  }\n  const workers = new Map<NodeId, GraphNode>()\n  const delegatesByWorker = new Map<NodeId, Extract<GraphEdge, { kind: 'delegates' }>>()\n  for (const edge of delegates) {\n    if (delegatesByWorker.has(edge.to)) {\n      throw new ValidationError(\n        `runGraph: node '${edge.to}' is the target of two delegates edges — one delegation ` +\n          'directive per worker node (version the directive instead of forking the edge)',\n      )\n    }\n    delegatesByWorker.set(edge.to, edge)\n    workers.set(edge.to, requireNode(edge.to, edgeId(edge)))\n  }\n  // Every non-root node must be reachable by SOME edge, or it can never run. A worker node is\n  // reached by its delegates edge; an analyst node by its analyzes edge (spawned on settle).\n  for (const node of graph.nodes) {\n    if (node.id !== root.id && !workers.has(node.id) && !analystNodes.has(node.id)) {\n      throw new ValidationError(\n        `runGraph: node '${node.id}' has no delegates edge to it — an unreachable node never runs`,\n      )\n    }\n  }\n  return { root, workers, delegatesByWorker, analyzes, analystNodes }\n}\n\n// ── The runner ─────────────────────────────────────────────────────────────────\n\nconst byteLength = (text: string): number => Buffer.byteLength(text, 'utf8')\n\nfunction stringifyPayload(payload: unknown): string {\n  if (typeof payload === 'string') return payload\n  try {\n    return JSON.stringify(payload) ?? String(payload)\n  } catch {\n    return String(payload)\n  }\n}\n\n/**\n * Execute an {@link AgentGraph}. The root node becomes the supervisor (`supervise()` — the\n * execution core), each worker node is spawnable BY NODE ID (`spawn_worker` with\n * `profile: { name: '<node id>' }`; the node's canonical profile is pinned by the graph), each\n * delegates directive is appended to the worker profile's `prompt.instructions` per traversal,\n * and each analyzes edge becomes an analyst-on-settle route with a real DESTINATION. Every\n * traversal is ledgered and journaled.\n */\nexport function runGraph(graph: AgentGraph, opts: RunGraphOptions): Promise<GraphResult> {\n  const { brain, ...runtimeOptions } = opts\n  return superviseAgentGraph(graph, runtimeOptions, brain)\n}\n\n/** Alias for graph tests written before `RunGraphOptions.brain` was production. The production\n *  entry accepts the same shape; this wrapper only keeps the `/testing` import path working. */\nexport function runGraphWithTestBrain(\n  graph: AgentGraph,\n  opts: RunGraphTestOptions,\n): Promise<GraphResult> {\n  const { brain, ...runtimeOptions } = opts\n  return superviseAgentGraph(graph, runtimeOptions, brain)\n}\n\n/**\n * The graph supervise run, as its own entry: the engine's `run-graph` preset node executes exactly\n * this, so the preset and `runGraph` are the same code path by construction (agent-runtime#982).\n */\n/**\n * Every refusal a graph earns before any compute, in one place: the authoring contract. `runGraph`\n * calls it FIRST so a malformed graph throws synchronously, exactly as it did before the engine\n * preset (agent-runtime#982) moved execution behind a promise.\n */\nexport function assertRunGraphAuthoring(\n  graph: AgentGraph,\n  opts: RunGraphOptions,\n  brain?: ToolLoopChat,\n): ReturnType<typeof validateGraph> {\n  assertRunGraphOptionKeys(opts)\n  const registry = opts.registry ?? kernelPromptRegistry()\n  const validated = validateGraph(graph, registry, opts.analysts)\n  const { root } = validated\n  // A caller brain and a harness driver are two answers to WHO makes the root's calls: refuse the\n  // contradiction before any compute, and refuse a harness-driven root outright — the harness IS\n  // that root's brain, so a supplied one would be silently ignored downstream.\n  if (brain && opts.driverBackend) {\n    throw new ValidationError(\n      'runGraph: brain and driverBackend are mutually exclusive — a caller brain makes the root model calls, a driverBackend places a harness that makes its own',\n    )\n  }\n  if (brain && harnessRunsAgent(root.profile.harness)) {\n    throw new ValidationError(\n      `runGraph: root node '${root.id}' declares harness '${root.profile.harness}', so the harness drives it — a caller brain applies only to a router-brained root (profile.harness omitted or 'cli-base')`,\n    )\n  }\n  if (!opts.backend && !opts.makeLeafAgent) {\n    throw new ValidationError(\n      'runGraph: provide opts.backend (where nodes run) or opts.makeLeafAgent',\n    )\n  }\n  return validated\n}\n\nexport function superviseAgentGraph(\n  graph: AgentGraph,\n  opts: RunGraphOptions,\n  brain?: ToolLoopChat,\n): Promise<GraphResult> {\n  const registry = opts.registry ?? kernelPromptRegistry()\n  const { root, workers, delegatesByWorker, analyzes, analystNodes } = assertRunGraphAuthoring(\n    graph,\n    opts,\n    brain,\n  )\n  const journal = opts.journal ?? new InMemorySpawnJournal()\n  const blobs = opts.blobs ?? new InMemoryResultBlobStore()\n  const runId =\n    opts.runId ??\n    `graph-${canonicalCandidateDigest(graph.nodes.map((n) => n.id)).slice('sha256:'.length, 'sha256:'.length + 12)}`\n  const now = opts.now ?? Date.now\n\n  // ── Ledger state ──\n  const ledger: EdgeTraversal[] = []\n  const journaled = new Set<EdgeTraversal>()\n  const traversalCounts = new Map<string, number>()\n  const exhausted = new Set<string>()\n  // The subset of `exhausted` that REFUSED work. Only a delegates cap closes the spawn cycle, so\n  // only it can be the reason a run ended winnerless — an analyzes cap refuses nothing.\n  const exhaustedDelegates = new Set<string>()\n  const journalWrites: Promise<void>[] = []\n  let ledgerSeq = 0\n  const appendJournal = (entry: EdgeTraversal, nodeIdForEvent: string): Promise<void> => {\n    if (journaled.has(entry)) return Promise.resolve()\n    journaled.add(entry)\n    const write = journal.appendEvent(runId, {\n      kind: 'edge',\n      id: nodeIdForEvent,\n      edge: { kind: entry.kind, from: entry.from, to: entry.to, directive: entry.directive },\n      traversal: entry.traversal,\n      outcome: entry.outcome,\n      continuity: entry.continuity,\n      bytes: entry.bytes,\n      ...(entry.reason !== undefined ? { reason: entry.reason } : {}),\n      seq: ledgerSeq++,\n      at: new Date(now()).toISOString(),\n    })\n    journalWrites.push(write)\n    return write\n  }\n  const record = (entry: Omit<EdgeTraversal, 'traversal'>, journalNow: boolean): EdgeTraversal => {\n    const count = (traversalCounts.get(entry.edge) ?? 0) + 1\n    traversalCounts.set(entry.edge, count)\n    const row: EdgeTraversal = { ...entry, traversal: count }\n    ledger.push(row)\n    if (journalNow) void appendJournal(row, row.workerId ?? `graph:${row.to}`)\n    return row\n  }\n\n  // ── Node pinning + delegates spawn traversals (the authorizeSpawn wrapper) ──\n  // Pinning lives in `authorizeSpawn`, which the kernel runs BEFORE it decides whether a child is\n  // a leaf or a nested supervisor. That is what lets a node declared `role: 'driver'` become a real\n  // supervisor carrying its canonical profile: the kernel's `isDriver` reads the PINNED profile,\n  // not the driver-authored `{ name }` stub. (It used to live in `makeWorkerAgent`, a leaf-only\n  // seam, which made every node a leaf no matter what its profile declared — #965.)\n  const nodeByWorkerId = new Map<string, NodeId>()\n  const pendingByAssignment = new Map<string, EdgeTraversal>()\n  type SpawnAuthorizationInput = Parameters<NonNullable<SuperviseOptions['authorizeSpawn']>>[0]\n  const pinNode = (input: SpawnAuthorizationInput): AgentProfile => {\n    const requested =\n      typeof (input.profile as { name?: unknown } | undefined)?.name === 'string'\n        ? (input.profile as { name: string }).name\n        : undefined\n    // An analyst-AGENT run: the coordination settle hook — never the driver; the marker is\n    // authored by the runtime, not accepted from model arguments — spawns the analyst NODE.\n    // Pin the node's canonical profile; the analysis directive travels as the TASK (composed by\n    // the coordination layer with the settled worker's trace evidence), so nothing is appended\n    // to the profile's instructions here. Its traversal is ledgered on the finding/steer it\n    // produces, exactly like a registry analyst's.\n    if (input.analyst !== undefined) {\n      const analystNode = analystNodes.get(input.analyst)\n      if (!analystNode || requested !== analystNode.id) {\n        throw new ValidationError(\n          `runGraph: analyst run for ${JSON.stringify(input.analyst)} does not name an ` +\n            `analyst node of this graph (analyst nodes: ${[...analystNodes.keys()].join(', ') || 'none'})`,\n        )\n      }\n      return analystNode.profile\n    }\n    const node = requested !== undefined ? workers.get(requested) : undefined\n    if (!node) {\n      throw new ValidationError(\n        `runGraph: spawn_worker named profile ${JSON.stringify(requested)} which is not a worker ` +\n          `node of this graph (nodes: ${[...workers.keys()].join(', ')}). Spawn by node id: ` +\n          'profile.name selects the node; the node profile itself is pinned by the graph.',\n      )\n    }\n    const edge = delegatesByWorker.get(node.id) as Extract<GraphEdge, { kind: 'delegates' }>\n    const id = edgeId(edge)\n    const cap = edge.maxTraversals ?? defaultEdgeTraversalCap\n    const used = traversalCounts.get(id) ?? 0\n    // The EFFECTIVE spawn mode the coordination layer resolved (per-call override, else this\n    // edge's declared default, else fresh) — stamped on the row so the ledger states how each\n    // hop continued, never how it was merely configured to.\n    const spawnContinuity = input.continuity ?? 'fresh'\n    if (used >= cap) {\n      exhausted.add(id)\n      exhaustedDelegates.add(id)\n      record(\n        {\n          edge: id,\n          kind: 'delegates',\n          from: edge.from,\n          to: edge.to,\n          directive: formatPromptHandle(edge.directive),\n          outcome: 'unpropagated',\n          continuity: spawnContinuity,\n          bytes: 0,\n          reason: `traversal-cap-exhausted (max ${cap})`,\n        },\n        true,\n      )\n      throw new ValidationError(\n        `runGraph: delegates edge ${id} exhausted its traversal cap (${cap}) — the ` +\n          'cyclic-graph backstop refused this spawn',\n      )\n    }\n    const directiveText = registry.resolve(edge.directive).text\n    const taskText = stringifyPayload(input.task)\n    const bytes = byteLength(directiveText) + byteLength(taskText)\n    const row = record(\n      {\n        edge: id,\n        kind: 'delegates',\n        from: edge.from,\n        to: edge.to,\n        directive: formatPromptHandle(edge.directive),\n        outcome: bytes === 0 ? 'empty' : 'delivered',\n        continuity: spawnContinuity,\n        bytes,\n        ...(bytes === 0 ? { reason: 'no directive text and no task payload' } : {}),\n      },\n      false,\n    )\n    pendingByAssignment.set(input.assignmentId, row)\n    // The delegation directive is a STANDING instruction of this traversal: appended to the\n    // node's canonical prompt instructions, so the worker runs under node profile + edge\n    // directive, and the driver-authored profile contributes ONLY the node selection.\n    return directiveText.length === 0\n      ? node.profile\n      : {\n          ...node.profile,\n          prompt: {\n            ...(node.profile.prompt ?? {}),\n            instructions: [\n              ...((node.profile.prompt?.instructions as readonly string[] | undefined) ?? []),\n              directiveText,\n            ],\n          },\n        }\n  }\n  // The pre-journal gate (a bridge backend's route/admission check) must judge the profile that\n  // will run, not the `{ name }` stub — otherwise every graph spawn over a bridge is refused\n  // `model-route` before the graph ever pins it. This resolver is PURE: it answers \"which node\"\n  // without ledgering, because the gate may refuse and nothing may be journaled for a refusal.\n  const resolveSpawnProfile = (authored: AgentProfile): AgentProfile => {\n    const requested = typeof authored.name === 'string' ? authored.name : undefined\n    const node =\n      (requested !== undefined ? workers.get(requested) : undefined) ??\n      (requested !== undefined ? analystNodes.get(requested) : undefined)\n    // Unknown names fall through to authorizeSpawn, which refuses them with the full message and\n    // a ledger row; the gate just sees the stub and lets that later refusal speak.\n    return node?.profile ?? authored\n  }\n  // Graph authority first, then the caller's: a product authorizing spawns sees the CANONICAL\n  // node profile (what will actually run), never the driver's `{ name }` stub.\n  const graphAuthorizeSpawn: NonNullable<SuperviseOptions['authorizeSpawn']> = (input) => {\n    const pinned = pinNode(input)\n    if (!opts.authorizeSpawn) return { profile: pinned }\n    return opts.authorizeSpawn({ ...input, profile: pinned })\n  }\n\n  // ── Analyzes edges → analyst-on-settle routes with destinations ──\n  // A LENS edge's directive wraps the findings for the recipient (so a driver-destined lens\n  // route carries no directive — it becomes the driver brief below). A NODE edge's directive is\n  // the analyst AGENT's task, so it always rides the route, wherever the findings go.\n  const routes: Array<string | AnalyzeOnSettleRoute> = analyzes.map((edge) => {\n    const analystNode = analystNodes.get(edge.analyst)\n    if (analystNode) {\n      return {\n        kind: edge.analyst,\n        over: edge.over,\n        agent: analystNode.profile,\n        directive: registry.resolve(edge.directive).text,\n        ...(edge.to === root.id ? {} : { to: edge.to }),\n      }\n    }\n    return edge.to === root.id\n      ? { kind: edge.analyst, over: edge.over }\n      : {\n          kind: edge.analyst,\n          over: edge.over,\n          to: edge.to,\n          directive: registry.resolve(edge.directive).text,\n        }\n  })\n  // Driver-destined analyzes findings are standing knowledge for the ROOT: the findings arrive\n  // as bus events. For a lens edge the directive tells the driver what to do with them; for a\n  // node edge the directive already went to the analyst agent as its task.\n  const driverAnalyzesBriefs = analyzes\n    .filter((edge) => edge.to === root.id)\n    .map((edge) =>\n      analystNodes.has(edge.analyst)\n        ? `Findings from analyst '${edge.analyst}' (a tool-equipped analyst agent node, over: ` +\n          `${edge.over.join(', ')}) will arrive as finding events.`\n        : `Findings from analyst '${edge.analyst}' (over: ${edge.over.join(', ')}) will arrive as ` +\n          `finding events.\\n${registry.resolve(edge.directive).text}`,\n    )\n\n  // ── Edge continuity defaults, threaded to the spawn tool by node id (= profile name) ──\n  const continuityByProfile: Record<string, ContinuityMode> = {}\n  for (const [nodeId, edge] of delegatesByWorker) {\n    if (edge.continuity !== undefined) continuityByProfile[nodeId] = edge.continuity\n  }\n\n  // ── The driver graph brief: which nodes it may spawn, by exact name ──\n  const workerLines = [...workers.values()].map((node) => {\n    const edge = delegatesByWorker.get(node.id) as Extract<GraphEdge, { kind: 'delegates' }>\n    const cap = edge.maxTraversals ?? defaultEdgeTraversalCap\n    const description =\n      typeof node.profile.description === 'string' && node.profile.description.length > 0\n        ? ` — ${node.profile.description}`\n        : ''\n    const continuityNote =\n      edge.continuity === 'resume'\n        ? \"; continuity: resume — each spawn after the first re-attaches to this node's latest \" +\n          'settled session (spawn again to continue it; steer while it is live)'\n        : ''\n    return `- '${node.id}'${description} (delegation cap: ${cap} traversals${continuityNote})`\n  })\n  const graphBrief = [\n    'AGENT GRAPH: you are the driver node of a fixed topology. You may spawn ONLY these worker',\n    \"nodes, by EXACT name (spawn_worker with profile: { name: '<node id>' }; the node's full\",\n    'profile is pinned by the graph — any other profile fields you author are ignored):',\n    ...workerLines,\n    ...(driverAnalyzesBriefs.length > 0 ? ['', ...driverAnalyzesBriefs] : []),\n  ].join('\\n')\n  const rootProfile: AgentProfile = {\n    ...root.profile,\n    prompt: {\n      ...(root.profile.prompt ?? {}),\n      instructions: [\n        ...((root.profile.prompt?.instructions as readonly string[] | undefined) ?? []),\n        graphBrief,\n      ],\n    },\n  }\n\n  // ── Steer + finding observation (delegates steers, analyzes traversals) ──\n  // The filter seam: when the caller's authorizeMessage NARROWS an instruction, the delivered\n  // bytes differ from the composed bytes — that steer traversal is `stripped` (the VB incident:\n  // authored steering silently replaced by boilerplate, byte-indistinguishable downstream).\n  const strippedByDigest = new Map<string, { composedBytes: number }>()\n  // Always present: the kernel refuses steer/answer whenever spawn authorization is on (the\n  // graph's pinning IS spawn authorization), so a graph with no caller filter passes instructions\n  // through unchanged rather than losing its steer channel. Only a caller filter can strip.\n  const authorizeMessage: NonNullable<SuperviseOptions['authorizeMessage']> = (input) => {\n    if (!opts.authorizeMessage) return { instruction: input.instruction }\n    const decision = opts.authorizeMessage(input)\n    if (decision.instruction !== input.instruction) {\n      strippedByDigest.set(canonicalCandidateDigest(decision.instruction), {\n        composedBytes: byteLength(input.instruction),\n      })\n    }\n    return decision\n  }\n\n  const routedAnalyzesByAnalyst = new Map<string, Extract<GraphEdge, { kind: 'analyzes' }>>()\n  const driverAnalyzesByAnalyst = new Map<string, Extract<GraphEdge, { kind: 'analyzes' }>>()\n  for (const edge of analyzes) {\n    ;(edge.to === root.id ? driverAnalyzesByAnalyst : routedAnalyzesByAnalyst).set(\n      edge.analyst,\n      edge,\n    )\n  }\n  const analyzesCapReached = (edge: Extract<GraphEdge, { kind: 'analyzes' }>): boolean => {\n    const cap = edge.maxTraversals ?? defaultEdgeTraversalCap\n    const used = traversalCounts.get(edgeId(edge)) ?? 0\n    if (used < cap) return false\n    exhausted.add(edgeId(edge))\n    return true\n  }\n  const ledgerAnalyzes = (\n    edge: Extract<GraphEdge, { kind: 'analyzes' }>,\n    outcome: EdgeDeliveryOutcome,\n    bytes: number,\n    reason: string | undefined,\n    workerId: string | undefined,\n  ): void => {\n    const capped = analyzesCapReached(edge)\n    record(\n      {\n        edge: edgeId(edge),\n        kind: 'analyzes',\n        from: edge.over.join('+'),\n        to: edge.to,\n        directive: formatPromptHandle(edge.directive),\n        outcome: capped ? 'unpropagated' : outcome,\n        // Every analyzes traversal is a mid-run delivery into an already-live recipient (a\n        // routed steer leg, or the finding reaching the live driver) — never a spawn.\n        continuity: 'steer',\n        bytes,\n        ...(capped\n          ? {\n              reason: `traversal-cap-exhausted (max ${edge.maxTraversals ?? defaultEdgeTraversalCap})`,\n            }\n          : reason !== undefined\n            ? { reason }\n            : {}),\n        ...(workerId !== undefined ? { workerId } : {}),\n      },\n      true,\n    )\n  }\n\n  const onCoordinationEvent = async (\n    _context: unknown,\n    _eventId: unknown,\n    recordEnvelope: { readonly event: CoordinationEvent },\n  ): Promise<void> => {\n    const event = recordEnvelope.event\n    if (event.type === 'finding') {\n      // A routed edge's traversal is ledgered on its STEER (the delivery); the finding event is\n      // its audit copy. A driver-destined edge's traversal IS the finding reaching the bus.\n      const edge = driverAnalyzesByAnalyst.get(event.finding.analyst)\n      if (!edge) return\n      const sourceNode = nodeByWorkerId.get(event.finding.fromWorker)\n      if (sourceNode === undefined || !edge.over.includes(sourceNode)) return\n      // Absent findings (the analyst returned `undefined` — the producer omits the key so the\n      // event stays digestable) contribute ZERO bytes, never the text \"undefined\".\n      const findingsText =\n        event.finding.findings === undefined ? '' : stringifyPayload(event.finding.findings)\n      const directiveBytes = byteLength(registry.resolve(edge.directive).text)\n      const empty = findingsText.length === 0\n      ledgerAnalyzes(\n        edge,\n        empty ? 'empty' : 'delivered',\n        directiveBytes + byteLength(findingsText),\n        empty ? 'analyst returned no findings' : undefined,\n        event.finding.fromWorker,\n      )\n      return\n    }\n    if (event.type === 'steer') {\n      const down = event.down\n      if (event.analyst !== undefined) {\n        const edge = routedAnalyzesByAnalyst.get(event.analyst)\n        if (!edge) return\n        ledgerAnalyzes(\n          edge,\n          down.delivered ? 'delivered' : 'unpropagated',\n          byteLength(down.instruction),\n          down.delivered ? undefined : down.outcome,\n          down.toWorker,\n        )\n        return\n      }\n      // A driver-authored steer to a live worker node is a delegates traversal too — the\n      // mid-run leg of the same edge (the leg the motivating incident lost).\n      const nodeId = nodeByWorkerId.get(down.toWorker)\n      if (nodeId === undefined) return\n      const edge = delegatesByWorker.get(nodeId)\n      if (!edge) return\n      const stripped = strippedByDigest.get(down.instructionDigest)\n      record(\n        {\n          edge: edgeId(edge),\n          kind: 'delegates',\n          from: edge.from,\n          to: edge.to,\n          directive: formatPromptHandle(edge.directive),\n          outcome: !down.delivered ? 'unpropagated' : stripped ? 'stripped' : 'delivered',\n          // The mid-run leg of the edge: a delivery into the LIVE worker, never a spawn.\n          continuity: 'steer',\n          bytes: byteLength(down.instruction),\n          ...(!down.delivered\n            ? { reason: down.outcome }\n            : stripped\n              ? { reason: `authorization narrowed ${stripped.composedBytes} composed bytes` }\n              : {}),\n          workerId: down.toWorker,\n        },\n        true,\n      )\n    }\n  }\n\n  // ── Spawn-hook: bind ledger rows to concrete worker ids, then journal them ──\n  const graphHooks = {\n    onEvent: (event: {\n      target?: string\n      phase?: string\n      payload?: unknown\n    }): void | Promise<void> => {\n      if (event.target !== 'agent.spawn' || event.phase !== 'after') return\n      const payload = event.payload as { childId?: unknown; assignmentId?: unknown } | undefined\n      if (typeof payload?.childId !== 'string' || typeof payload.assignmentId !== 'string') return\n      const pending = pendingByAssignment.get(payload.assignmentId)\n      if (!pending) return\n      pendingByAssignment.delete(payload.assignmentId)\n      const bound: EdgeTraversal = { ...pending, workerId: payload.childId }\n      ledger[ledger.indexOf(pending)] = bound\n      nodeByWorkerId.set(payload.childId, bound.to)\n      return appendJournal(bound, payload.childId)\n    },\n  }\n  const hooks = composeRuntimeHooks(graphHooks, opts.hooks)\n\n  // Every configuration fault above throws SYNCHRONOUSLY (matching `supervise()`'s own\n  // contract); only the run itself is asynchronous.\n  const start = async (): Promise<GraphResult> => {\n    const superviseOptions = {\n      // Every forwarded option the caller set, including the ones nobody thought to list here.\n      // `backend` rides along: the kernel derives every authorized LEAF from it, under the graph's\n      // pinning. The root driver stays an explicit `driverBackend` choice: `rootDriverFromBackend:\n      // false` stops supervise() defaulting one from the other, so where workers run never selects\n      // where the root runs (the axis split every graph caller relies on).\n      ...forwardedSuperviseOptions(opts),\n      rootDriverFromBackend: false,\n      // Graph-owned values come after the spread: the graph, not the caller, decides these.\n      budget: graph.budget,\n      deliverable: graph.deliverable,\n      authorizeSpawn: graphAuthorizeSpawn,\n      resolveSpawnProfile,\n      ...(opts.makeLeafAgent ? { makeLeafAgent: opts.makeLeafAgent } : {}),\n      journal,\n      blobs,\n      runId,\n      hooks,\n      onCoordinationEvent,\n      // Lens routes resolve against the registry; agent routes carry their own analyst profile,\n      // so a graph whose only analysts are nodes needs no registry at all.\n      ...(routes.length > 0\n        ? { analyzeOnSettle: routes, ...(opts.analysts ? { analysts: opts.analysts } : {}) }\n        : {}),\n      ...(Object.keys(continuityByProfile).length > 0 ? { continuityByProfile } : {}),\n      authorizeMessage,\n    } satisfies SuperviseOptions\n    const result =\n      brain === undefined\n        ? await supervise(rootProfile, graphTask(graph, root), superviseOptions)\n        : await superviseWithTestBrain(rootProfile, graphTask(graph, root), {\n            ...superviseOptions,\n            brain,\n          })\n\n    // A spawn row is PROVISIONAL until the `agent.spawn` hook (fired synchronously once a worker\n    // exists) binds it to a live worker id. A row still unbound here means the factory ran but no\n    // NEW worker went live: the spawn was refused after the factory (identity conflict, runtime\n    // floor) or a keyed re-spawn deduplicated to an already-completed result (prepare() runs the\n    // factory, no hook fires). Both state the same truth every unpropagated row states — the\n    // directive never reached a live worker — so rewrite rather than mint a new outcome. Then\n    // settle every journal write, so the ledger's journal twin is complete when this returns.\n    for (const pending of pendingByAssignment.values()) {\n      const refused: EdgeTraversal = {\n        ...pending,\n        outcome: 'unpropagated',\n        bytes: 0,\n        reason: `no-live-worker-bound (spawn refused after the factory, or a keyed re-spawn deduplicated to a completed result; ${pending.bytes} composed bytes never crossed)`,\n      }\n      ledger[ledger.indexOf(pending)] = refused\n      await appendJournal(refused, `graph:${refused.to}`)\n    }\n    pendingByAssignment.clear()\n    await Promise.all(journalWrites)\n\n    const exhaustedEdges = Object.freeze([...exhausted])\n    const frozenLedger = Object.freeze(ledger.map((row) => Object.freeze({ ...row })))\n    // A LIFECYCLE ending (caller abort, exhausted budget) is its own complete explanation: the\n    // cap did not end that run even when it was exhausted along the way, and blaming it would\n    // misattribute the ending (and turn a caller-initiated abort into a throw). The exhaustion\n    // stays observable in `exhaustedEdges` either way.\n    const lifecycleEnded =\n      result.kind === 'no-winner' &&\n      (result.reason === 'aborted' || result.reason === 'budget-exhausted')\n    if (result.kind !== 'winner' && !lifecycleEnded && exhaustedDelegates.size > 0) {\n      // Fail LOUD: the backstop, not the task, ended this run. The evidence rides on the error.\n      // Only DELEGATES caps refuse spawns, so only they can be the cause named here.\n      throw new GraphEdgeCapError(Object.freeze([...exhaustedDelegates]), frozenLedger, result)\n    }\n    return { result, ledger: frozenLedger, exhaustedEdges, runId }\n  }\n\n  return start()\n}\n\n/** The root task: the graph's own framing. The deliverable (mandatory) is the termination; the\n *  task names what the topology exists to produce. */\nfunction graphTask(graph: AgentGraph, root: GraphNode): string {\n  const describe = graph.deliverable.describe\n  return (\n    describe ?? `Deliver the graph's deliverable by driving your worker nodes (root: '${root.id}').`\n  )\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwKA,MAAa,0BAA0B;;;AAIvC,IAAa,oBAAb,cAAuC,MAAM;CAC3C;CACA;CACA;CACA,YACE,gBACA,QACA,QACA;EACA,MACE,6CAA6C,eAAe,KAAK,IAAI,EAAE,2NAIzE;EACA,KAAK,OAAO;EACZ,KAAK,iBAAiB;EACtB,KAAK,SAAS;EACd,KAAK,SAAS;CAChB;AACF;;;;;;;;;;;;;;;;AAoBA,MAAM,gCAAgC;CACpC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;AAQA,MAAM,sCAAsC;CAC1C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;AAOA,MAAM,kCAAkC,CAAC,UAAU;;;;;AAMnD,MAAM,oCAAoC;CACxC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;AAiBA,MAAM,qBAAqB;CACzB,GAAG;CACH,GAAG;CACH,GAAG;CACH;AACF;AAQA,MAAM,uBAA4C,IAAI,IAAY,kBAAkB;AACpF,MAAM,yBAA8C,IAAI,IAAY,6BAA6B;;;;;;;;;;;AAYjG,SAAS,yBAAyB,MAA6B;CAC7D,MAAM,aAAuB,CAAC;CAC9B,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAAG;EACnC,IAAI,qBAAqB,IAAI,GAAG,GAAG;EACnC,IAAI,uBAAuB,IAAI,GAAG,GAAG,WAAW,KAAK,GAAG;OACnD,QAAQ,KAAK,GAAG;CACvB;CACA,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,YACR,aAAa,WAAW,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,+IAG5C;CAEF,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,YACR,4BAA4B,QAAQ,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,yHAExD;AAEJ;;;AAuBA,SAAS,0BACP,MAC4E;CAC5E,MAAM,YAAqC,CAAC;CAC5C,KAAK,MAAM,OAAO,mCAAmC;EACnD,MAAM,QAAS,KAAiC;EAChD,IAAI,UAAU,KAAA,GAAW,UAAU,OAAO;CAC5C;CACA,OAAO;AACT;AA+FA,SAAS,OAAO,MAAyB;CACvC,OAAO,KAAK,SAAS,cACjB,aAAa,KAAK,KAAK,IAAI,KAAK,OAChC,YAAY,KAAK,QAAQ,GAAG,KAAK,KAAK,KAAK,GAAG,EAAE,IAAI,KAAK;AAC/D;;;AAIA,SAAS,cACP,OACA,UACA,UACgB;CAChB,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,WAAW,GACxD,MAAM,IAAI,gBAAgB,iDAAiD;CAE7E,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,WAAW,GACxD,MAAM,IAAI,gBAAgB,iDAAiD;CAE7E,IAAI,OAAO,MAAM,aAAa,UAAU,YACtC,MAAM,IAAI,gBAAgB,+DAA+D;CAE3F,IAAI,OAAO,MAAM,WAAW,YAAY,MAAM,WAAW,MACvD,MAAM,IAAI,gBAAgB,0DAA0D;CAEtF,MAAM,uBAAO,IAAI,IAAuB;CACxC,KAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,IAAI,OAAO,KAAK,OAAO,YAAY,KAAK,GAAG,WAAW,GACpD,MAAM,IAAI,gBAAgB,kDAAkD;EAE9E,IAAI,KAAK,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,gBAAgB,gCAAgC,KAAK,GAAG,EAAE;EAC3F,MAAM,SAAS,mBAAmB,UAAU,KAAK,OAAO;EACxD,IAAI,CAAC,OAAO,SACV,MAAM,IAAI,gBACR,mBAAmB,KAAK,GAAG,iCAAiC,OAAO,MAAM,SAC3E;EAMF,IAAI,KAAK,QAAQ,SAAS,KAAK,IAC7B,MAAM,IAAI,gBACR,mBAAmB,KAAK,GAAG,qBAAqB,KAAK,UAAU,KAAK,QAAQ,IAAI,EAAE,+GAGpF;EAEF,KAAK,IAAI,KAAK,IAAI,IAAI;CACxB;CACA,MAAM,eAAe,IAAY,UAA6B;EAC5D,MAAM,OAAO,KAAK,IAAI,EAAE;EACxB,IAAI,CAAC,MAAM,MAAM,IAAI,gBAAgB,aAAa,MAAM,4BAA4B,GAAG,EAAE;EACzF,OAAO;CACT;CACA,MAAM,YAAY,MAAM,MAAM,QAC3B,SAA4D,KAAK,SAAS,WAC7E;CACA,MAAM,WAAW,MAAM,MAAM,QAC1B,SAA2D,KAAK,SAAS,UAC5E;CACA,IAAI,UAAU,WAAW,GACvB,MAAM,IAAI,gBAAgB,qEAAqE;CAEjG,KAAK,MAAM,QAAQ,MAAM,OAAO,SAAS,QAAQ,KAAK,SAAS;CAC/D,KAAK,MAAM,QAAQ,WAAW;EAC5B,YAAY,KAAK,MAAM,OAAO,IAAI,CAAC;EACnC,YAAY,KAAK,IAAI,OAAO,IAAI,CAAC;EACjC,IAAI,KAAK,SAAS,KAAK,IACrB,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,0FAE5B;EAIF,IACE,KAAK,eAAe,KAAA,KACpB,KAAK,eAAe,WACpB,KAAK,eAAe,UAEpB,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,0BAA0B,KAAK,UAAU,KAAK,UAAU,EAAE,wDAEtF;CAEJ;CAGA,MAAM,cAAc,IAAI,IAAI,UAAU,KAAK,SAAS,KAAK,EAAE,CAAC;CAC5D,MAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,UAAU,KAAK,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,QAC5D,OAAO,CAAC,YAAY,IAAI,EAAE,CAC7B;CACA,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,gBACR,gGACW,MAAM,WAAW,IAAI,sDAAsD,MAAM,KAAK,IAAI,EAAE,6DAEzG;CAEF,MAAM,OAAO,YAAY,MAAM,IAAc,iBAAiB;CAC9D,KAAK,MAAM,QAAQ,WACjB,IAAI,KAAK,SAAS,KAAK,IACrB,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,8IAE5B;CAGJ,MAAM,6BAAa,IAAI,IAAY;CACnC,MAAM,+BAAe,IAAI,IAAuB;CAChD,KAAK,MAAM,QAAQ,UAAU;EAI3B,IAAK,KAAkC,eAAe,KAAA,GACpD,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,8KAG5B;EAMF,IAAI,WAAW,IAAI,KAAK,OAAO,GAC7B,MAAM,IAAI,gBACR,+CAA+C,KAAK,QAAQ,wLAG9D;EAEF,WAAW,IAAI,KAAK,OAAO;EAI3B,MAAM,cAAc,KAAK,IAAI,KAAK,OAAO;EACzC,MAAM,aAAa,UAAU,MAAM,MAAM,SAAS,KAAK,OAAO,KAAK,OAAO,MAAM;EAChF,IAAI,gBAAgB,KAAA,KAAa,YAC/B,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,YAAY,KAAK,QAAQ,2LAGrD;EAEF,IAAI,gBAAgB,KAAA,GAAW;GAI7B,IAAI,YAAY,OAAO,KAAK,IAC1B,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,6HAE5B;GAEF,IAAI,YAAY,IAAI,YAAY,EAAE,GAChC,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,eAAe,KAAK,QAAQ,8QAIxD;GAEF,aAAa,IAAI,YAAY,IAAI,WAAW;EAC9C,OAAO,IAAI,CAAC,UACV,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,YAAY,KAAK,QAAQ,qGAErD;OACK,IAAI,CAAC,YACV,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,YAAY,KAAK,QAAQ,wEACb,SAAS,MAAM,KAAK,SAAS,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,OAAO,EACnG;EAEF,IAAI,KAAK,KAAK,WAAW,GACvB,MAAM,IAAI,gBAAgB,aAAa,OAAO,IAAI,EAAE,gCAAgC;EAEtF,KAAK,MAAM,QAAQ,KAAK,MAAM;GAC5B,YAAY,MAAM,OAAO,IAAI,CAAC;GAG9B,IAAI,SAAS,KAAK,IAChB,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,mKAG5B;EAEJ;EACA,YAAY,KAAK,IAAI,OAAO,IAAI,CAAC;CACnC;CAIA,KAAK,MAAM,QAAQ,UACjB,KAAK,MAAM,QAAQ,KAAK,MACtB,IAAI,aAAa,IAAI,IAAI,GACvB,MAAM,IAAI,gBACR,aAAa,OAAO,IAAI,EAAE,aAAa,KAAK,+JAG9C;CAIN,MAAM,0BAAU,IAAI,IAAuB;CAC3C,MAAM,oCAAoB,IAAI,IAAuD;CACrF,KAAK,MAAM,QAAQ,WAAW;EAC5B,IAAI,kBAAkB,IAAI,KAAK,EAAE,GAC/B,MAAM,IAAI,gBACR,mBAAmB,KAAK,GAAG,sIAE7B;EAEF,kBAAkB,IAAI,KAAK,IAAI,IAAI;EACnC,QAAQ,IAAI,KAAK,IAAI,YAAY,KAAK,IAAI,OAAO,IAAI,CAAC,CAAC;CACzD;CAGA,KAAK,MAAM,QAAQ,MAAM,OACvB,IAAI,KAAK,OAAO,KAAK,MAAM,CAAC,QAAQ,IAAI,KAAK,EAAE,KAAK,CAAC,aAAa,IAAI,KAAK,EAAE,GAC3E,MAAM,IAAI,gBACR,mBAAmB,KAAK,GAAG,+DAC7B;CAGJ,OAAO;EAAE;EAAM;EAAS;EAAmB;EAAU;CAAa;AACpE;AAIA,MAAM,cAAc,SAAyB,OAAO,WAAW,MAAM,MAAM;AAE3E,SAAS,iBAAiB,SAA0B;CAClD,IAAI,OAAO,YAAY,UAAU,OAAO;CACxC,IAAI;EACF,OAAO,KAAK,UAAU,OAAO,KAAK,OAAO,OAAO;CAClD,QAAQ;EACN,OAAO,OAAO,OAAO;CACvB;AACF;;;;;;;;;AAUA,SAAgB,SAAS,OAAmB,MAA6C;CACvF,MAAM,EAAE,OAAO,GAAG,mBAAmB;CACrC,OAAO,oBAAoB,OAAO,gBAAgB,KAAK;AACzD;;;AAIA,SAAgB,sBACd,OACA,MACsB;CACtB,MAAM,EAAE,OAAO,GAAG,mBAAmB;CACrC,OAAO,oBAAoB,OAAO,gBAAgB,KAAK;AACzD;;;;;;;;;;AAWA,SAAgB,wBACd,OACA,MACA,OACkC;CAClC,yBAAyB,IAAI;CAE7B,MAAM,YAAY,cAAc,OADf,KAAK,YAAY,qBAAqB,GACN,KAAK,QAAQ;CAC9D,MAAM,EAAE,SAAS;CAIjB,IAAI,SAAS,KAAK,eAChB,MAAM,IAAI,gBACR,2JACF;CAEF,IAAI,SAAS,iBAAiB,KAAK,QAAQ,OAAO,GAChD,MAAM,IAAI,gBACR,wBAAwB,KAAK,GAAG,sBAAsB,KAAK,QAAQ,QAAQ,2HAC7E;CAEF,IAAI,CAAC,KAAK,WAAW,CAAC,KAAK,eACzB,MAAM,IAAI,gBACR,wEACF;CAEF,OAAO;AACT;AAEA,SAAgB,oBACd,OACA,MACA,OACsB;CACtB,MAAM,WAAW,KAAK,YAAY,qBAAqB;CACvD,MAAM,EAAE,MAAM,SAAS,mBAAmB,UAAU,iBAAiB,wBACnE,OACA,MACA,KACF;CACA,MAAM,UAAU,KAAK,WAAW,IAAI,qBAAqB;CACzD,MAAM,QAAQ,KAAK,SAAS,IAAI,wBAAwB;CACxD,MAAM,QACJ,KAAK,SACL,SAAS,yBAAyB,MAAM,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAkB,EAAqB;CAC/G,MAAM,MAAM,KAAK,OAAO,KAAK;CAG7B,MAAM,SAA0B,CAAC;CACjC,MAAM,4BAAY,IAAI,IAAmB;CACzC,MAAM,kCAAkB,IAAI,IAAoB;CAChD,MAAM,4BAAY,IAAI,IAAY;CAGlC,MAAM,qCAAqB,IAAI,IAAY;CAC3C,MAAM,gBAAiC,CAAC;CACxC,IAAI,YAAY;CAChB,MAAM,iBAAiB,OAAsB,mBAA0C;EACrF,IAAI,UAAU,IAAI,KAAK,GAAG,OAAO,QAAQ,QAAQ;EACjD,UAAU,IAAI,KAAK;EACnB,MAAM,QAAQ,QAAQ,YAAY,OAAO;GACvC,MAAM;GACN,IAAI;GACJ,MAAM;IAAE,MAAM,MAAM;IAAM,MAAM,MAAM;IAAM,IAAI,MAAM;IAAI,WAAW,MAAM;GAAU;GACrF,WAAW,MAAM;GACjB,SAAS,MAAM;GACf,YAAY,MAAM;GAClB,OAAO,MAAM;GACb,GAAI,MAAM,WAAW,KAAA,IAAY,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;GAC7D,KAAK;GACL,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,YAAY;EAClC,CAAC;EACD,cAAc,KAAK,KAAK;EACxB,OAAO;CACT;CACA,MAAM,UAAU,OAAyC,eAAuC;EAC9F,MAAM,SAAS,gBAAgB,IAAI,MAAM,IAAI,KAAK,KAAK;EACvD,gBAAgB,IAAI,MAAM,MAAM,KAAK;EACrC,MAAM,MAAqB;GAAE,GAAG;GAAO,WAAW;EAAM;EACxD,OAAO,KAAK,GAAG;EACf,IAAI,YAAY,cAAmB,KAAK,IAAI,YAAY,SAAS,IAAI,IAAI;EACzE,OAAO;CACT;CAQA,MAAM,iCAAiB,IAAI,IAAoB;CAC/C,MAAM,sCAAsB,IAAI,IAA2B;CAE3D,MAAM,WAAW,UAAiD;EAChE,MAAM,YACJ,OAAQ,MAAM,SAA4C,SAAS,WAC9D,MAAM,QAA6B,OACpC,KAAA;EAON,IAAI,MAAM,YAAY,KAAA,GAAW;GAC/B,MAAM,cAAc,aAAa,IAAI,MAAM,OAAO;GAClD,IAAI,CAAC,eAAe,cAAc,YAAY,IAC5C,MAAM,IAAI,gBACR,6BAA6B,KAAK,UAAU,MAAM,OAAO,EAAE,+DACX,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,OAAO,EAChG;GAEF,OAAO,YAAY;EACrB;EACA,MAAM,OAAO,cAAc,KAAA,IAAY,QAAQ,IAAI,SAAS,IAAI,KAAA;EAChE,IAAI,CAAC,MACH,MAAM,IAAI,gBACR,wCAAwC,KAAK,UAAU,SAAS,EAAE,oDAClC,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,oGAEjE;EAEF,MAAM,OAAO,kBAAkB,IAAI,KAAK,EAAE;EAC1C,MAAM,KAAK,OAAO,IAAI;EACtB,MAAM,MAAM,KAAK,iBAAA;EACjB,MAAM,OAAO,gBAAgB,IAAI,EAAE,KAAK;EAIxC,MAAM,kBAAkB,MAAM,cAAc;EAC5C,IAAI,QAAQ,KAAK;GACf,UAAU,IAAI,EAAE;GAChB,mBAAmB,IAAI,EAAE;GACzB,OACE;IACE,MAAM;IACN,MAAM;IACN,MAAM,KAAK;IACX,IAAI,KAAK;IACT,WAAW,mBAAmB,KAAK,SAAS;IAC5C,SAAS;IACT,YAAY;IACZ,OAAO;IACP,QAAQ,gCAAgC,IAAI;GAC9C,GACA,IACF;GACA,MAAM,IAAI,gBACR,4BAA4B,GAAG,gCAAgC,IAAI,iDAErE;EACF;EACA,MAAM,gBAAgB,SAAS,QAAQ,KAAK,SAAS,CAAC,CAAC;EACvD,MAAM,WAAW,iBAAiB,MAAM,IAAI;EAC5C,MAAM,QAAQ,WAAW,aAAa,IAAI,WAAW,QAAQ;EAC7D,MAAM,MAAM,OACV;GACE,MAAM;GACN,MAAM;GACN,MAAM,KAAK;GACX,IAAI,KAAK;GACT,WAAW,mBAAmB,KAAK,SAAS;GAC5C,SAAS,UAAU,IAAI,UAAU;GACjC,YAAY;GACZ;GACA,GAAI,UAAU,IAAI,EAAE,QAAQ,wCAAwC,IAAI,CAAC;EAC3E,GACA,KACF;EACA,oBAAoB,IAAI,MAAM,cAAc,GAAG;EAI/C,OAAO,cAAc,WAAW,IAC5B,KAAK,UACL;GACE,GAAG,KAAK;GACR,QAAQ;IACN,GAAI,KAAK,QAAQ,UAAU,CAAC;IAC5B,cAAc,CACZ,GAAK,KAAK,QAAQ,QAAQ,gBAAkD,CAAC,GAC7E,aACF;GACF;EACF;CACN;CAKA,MAAM,uBAAuB,aAAyC;EACpE,MAAM,YAAY,OAAO,SAAS,SAAS,WAAW,SAAS,OAAO,KAAA;EAMtE,SAJG,cAAc,KAAA,IAAY,QAAQ,IAAI,SAAS,IAAI,KAAA,OACnD,cAAc,KAAA,IAAY,aAAa,IAAI,SAAS,IAAI,KAAA,GAAA,EAG9C,WAAW;CAC1B;CAGA,MAAM,uBAAwE,UAAU;EACtF,MAAM,SAAS,QAAQ,KAAK;EAC5B,IAAI,CAAC,KAAK,gBAAgB,OAAO,EAAE,SAAS,OAAO;EACnD,OAAO,KAAK,eAAe;GAAE,GAAG;GAAO,SAAS;EAAO,CAAC;CAC1D;CAMA,MAAM,SAA+C,SAAS,KAAK,SAAS;EAC1E,MAAM,cAAc,aAAa,IAAI,KAAK,OAAO;EACjD,IAAI,aACF,OAAO;GACL,MAAM,KAAK;GACX,MAAM,KAAK;GACX,OAAO,YAAY;GACnB,WAAW,SAAS,QAAQ,KAAK,SAAS,CAAC,CAAC;GAC5C,GAAI,KAAK,OAAO,KAAK,KAAK,CAAC,IAAI,EAAE,IAAI,KAAK,GAAG;EAC/C;EAEF,OAAO,KAAK,OAAO,KAAK,KACpB;GAAE,MAAM,KAAK;GAAS,MAAM,KAAK;EAAK,IACtC;GACE,MAAM,KAAK;GACX,MAAM,KAAK;GACX,IAAI,KAAK;GACT,WAAW,SAAS,QAAQ,KAAK,SAAS,CAAC,CAAC;EAC9C;CACN,CAAC;CAID,MAAM,uBAAuB,SAC1B,QAAQ,SAAS,KAAK,OAAO,KAAK,EAAE,CAAC,CACrC,KAAK,SACJ,aAAa,IAAI,KAAK,OAAO,IACzB,0BAA0B,KAAK,QAAQ,+CACpC,KAAK,KAAK,KAAK,IAAI,EAAE,oCACxB,0BAA0B,KAAK,QAAQ,WAAW,KAAK,KAAK,KAAK,IAAI,EAAE,oCACnD,SAAS,QAAQ,KAAK,SAAS,CAAC,CAAC,MAC3D;CAGF,MAAM,sBAAsD,CAAC;CAC7D,KAAK,MAAM,CAAC,QAAQ,SAAS,mBAC3B,IAAI,KAAK,eAAe,KAAA,GAAW,oBAAoB,UAAU,KAAK;CAkBxE,MAAM,aAAa;EACjB;EACA;EACA;EACA,GAlBkB,CAAC,GAAG,QAAQ,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS;GACtD,MAAM,OAAO,kBAAkB,IAAI,KAAK,EAAE;GAC1C,MAAM,MAAM,KAAK,iBAAA;GACjB,MAAM,cACJ,OAAO,KAAK,QAAQ,gBAAgB,YAAY,KAAK,QAAQ,YAAY,SAAS,IAC9E,MAAM,KAAK,QAAQ,gBACnB;GACN,MAAM,iBACJ,KAAK,eAAe,WAChB,6JAEA;GACN,OAAO,MAAM,KAAK,GAAG,GAAG,YAAY,oBAAoB,IAAI,aAAa,eAAe;EAC1F,CAKe;EACb,GAAI,qBAAqB,SAAS,IAAI,CAAC,IAAI,GAAG,oBAAoB,IAAI,CAAC;CACzE,CAAC,CAAC,KAAK,IAAI;CACX,MAAM,cAA4B;EAChC,GAAG,KAAK;EACR,QAAQ;GACN,GAAI,KAAK,QAAQ,UAAU,CAAC;GAC5B,cAAc,CACZ,GAAK,KAAK,QAAQ,QAAQ,gBAAkD,CAAC,GAC7E,UACF;EACF;CACF;CAMA,MAAM,mCAAmB,IAAI,IAAuC;CAIpE,MAAM,oBAAuE,UAAU;EACrF,IAAI,CAAC,KAAK,kBAAkB,OAAO,EAAE,aAAa,MAAM,YAAY;EACpE,MAAM,WAAW,KAAK,iBAAiB,KAAK;EAC5C,IAAI,SAAS,gBAAgB,MAAM,aACjC,iBAAiB,IAAI,yBAAyB,SAAS,WAAW,GAAG,EACnE,eAAe,WAAW,MAAM,WAAW,EAC7C,CAAC;EAEH,OAAO;CACT;CAEA,MAAM,0CAA0B,IAAI,IAAsD;CAC1F,MAAM,0CAA0B,IAAI,IAAsD;CAC1F,KAAK,MAAM,QAAQ,UAChB,CAAC,KAAK,OAAO,KAAK,KAAK,0BAA0B,wBAAA,CAAyB,IACzE,KAAK,SACL,IACF;CAEF,MAAM,sBAAsB,SAA4D;EACtF,MAAM,MAAM,KAAK,iBAAA;EAEjB,KADa,gBAAgB,IAAI,OAAO,IAAI,CAAC,KAAK,KACvC,KAAK,OAAO;EACvB,UAAU,IAAI,OAAO,IAAI,CAAC;EAC1B,OAAO;CACT;CACA,MAAM,kBACJ,MACA,SACA,OACA,QACA,aACS;EACT,MAAM,SAAS,mBAAmB,IAAI;EACtC,OACE;GACE,MAAM,OAAO,IAAI;GACjB,MAAM;GACN,MAAM,KAAK,KAAK,KAAK,GAAG;GACxB,IAAI,KAAK;GACT,WAAW,mBAAmB,KAAK,SAAS;GAC5C,SAAS,SAAS,iBAAiB;GAGnC,YAAY;GACZ;GACA,GAAI,SACA,EACE,QAAQ,gCAAgC,KAAK,iBAAA,GAAyC,GACxF,IACA,WAAW,KAAA,IACT,EAAE,OAAO,IACT,CAAC;GACP,GAAI,aAAa,KAAA,IAAY,EAAE,SAAS,IAAI,CAAC;EAC/C,GACA,IACF;CACF;CAEA,MAAM,sBAAsB,OAC1B,UACA,UACA,mBACkB;EAClB,MAAM,QAAQ,eAAe;EAC7B,IAAI,MAAM,SAAS,WAAW;GAG5B,MAAM,OAAO,wBAAwB,IAAI,MAAM,QAAQ,OAAO;GAC9D,IAAI,CAAC,MAAM;GACX,MAAM,aAAa,eAAe,IAAI,MAAM,QAAQ,UAAU;GAC9D,IAAI,eAAe,KAAA,KAAa,CAAC,KAAK,KAAK,SAAS,UAAU,GAAG;GAGjE,MAAM,eACJ,MAAM,QAAQ,aAAa,KAAA,IAAY,KAAK,iBAAiB,MAAM,QAAQ,QAAQ;GACrF,MAAM,iBAAiB,WAAW,SAAS,QAAQ,KAAK,SAAS,CAAC,CAAC,IAAI;GACvE,MAAM,QAAQ,aAAa,WAAW;GACtC,eACE,MACA,QAAQ,UAAU,aAClB,iBAAiB,WAAW,YAAY,GACxC,QAAQ,iCAAiC,KAAA,GACzC,MAAM,QAAQ,UAChB;GACA;EACF;EACA,IAAI,MAAM,SAAS,SAAS;GAC1B,MAAM,OAAO,MAAM;GACnB,IAAI,MAAM,YAAY,KAAA,GAAW;IAC/B,MAAM,OAAO,wBAAwB,IAAI,MAAM,OAAO;IACtD,IAAI,CAAC,MAAM;IACX,eACE,MACA,KAAK,YAAY,cAAc,gBAC/B,WAAW,KAAK,WAAW,GAC3B,KAAK,YAAY,KAAA,IAAY,KAAK,SAClC,KAAK,QACP;IACA;GACF;GAGA,MAAM,SAAS,eAAe,IAAI,KAAK,QAAQ;GAC/C,IAAI,WAAW,KAAA,GAAW;GAC1B,MAAM,OAAO,kBAAkB,IAAI,MAAM;GACzC,IAAI,CAAC,MAAM;GACX,MAAM,WAAW,iBAAiB,IAAI,KAAK,iBAAiB;GAC5D,OACE;IACE,MAAM,OAAO,IAAI;IACjB,MAAM;IACN,MAAM,KAAK;IACX,IAAI,KAAK;IACT,WAAW,mBAAmB,KAAK,SAAS;IAC5C,SAAS,CAAC,KAAK,YAAY,iBAAiB,WAAW,aAAa;IAEpE,YAAY;IACZ,OAAO,WAAW,KAAK,WAAW;IAClC,GAAI,CAAC,KAAK,YACN,EAAE,QAAQ,KAAK,QAAQ,IACvB,WACE,EAAE,QAAQ,0BAA0B,SAAS,cAAc,iBAAiB,IAC5E,CAAC;IACP,UAAU,KAAK;GACjB,GACA,IACF;EACF;CACF;CAqBA,MAAM,QAAQ,oBAAoB,EAjBhC,UAAU,UAIkB;EAC1B,IAAI,MAAM,WAAW,iBAAiB,MAAM,UAAU,SAAS;EAC/D,MAAM,UAAU,MAAM;EACtB,IAAI,OAAO,SAAS,YAAY,YAAY,OAAO,QAAQ,iBAAiB,UAAU;EACtF,MAAM,UAAU,oBAAoB,IAAI,QAAQ,YAAY;EAC5D,IAAI,CAAC,SAAS;EACd,oBAAoB,OAAO,QAAQ,YAAY;EAC/C,MAAM,QAAuB;GAAE,GAAG;GAAS,UAAU,QAAQ;EAAQ;EACrE,OAAO,OAAO,QAAQ,OAAO,KAAK;EAClC,eAAe,IAAI,QAAQ,SAAS,MAAM,EAAE;EAC5C,OAAO,cAAc,OAAO,QAAQ,OAAO;CAC7C,EAEyC,GAAG,KAAK,KAAK;CAIxD,MAAM,QAAQ,YAAkC;EAC9C,MAAM,mBAAmB;GAMvB,GAAG,0BAA0B,IAAI;GACjC,uBAAuB;GAEvB,QAAQ,MAAM;GACd,aAAa,MAAM;GACnB,gBAAgB;GAChB;GACA,GAAI,KAAK,gBAAgB,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;GAClE;GACA;GACA;GACA;GACA;GAGA,GAAI,OAAO,SAAS,IAChB;IAAE,iBAAiB;IAAQ,GAAI,KAAK,WAAW,EAAE,UAAU,KAAK,SAAS,IAAI,CAAC;GAAG,IACjF,CAAC;GACL,GAAI,OAAO,KAAK,mBAAmB,CAAC,CAAC,SAAS,IAAI,EAAE,oBAAoB,IAAI,CAAC;GAC7E;EACF;EACA,MAAM,SACJ,UAAU,KAAA,IACN,MAAM,UAAU,aAAa,UAAU,OAAO,IAAI,GAAG,gBAAgB,IACrE,MAAM,uBAAuB,aAAa,UAAU,OAAO,IAAI,GAAG;GAChE,GAAG;GACH;EACF,CAAC;EASP,KAAK,MAAM,WAAW,oBAAoB,OAAO,GAAG;GAClD,MAAM,UAAyB;IAC7B,GAAG;IACH,SAAS;IACT,OAAO;IACP,QAAQ,kHAAkH,QAAQ,MAAM;GAC1I;GACA,OAAO,OAAO,QAAQ,OAAO,KAAK;GAClC,MAAM,cAAc,SAAS,SAAS,QAAQ,IAAI;EACpD;EACA,oBAAoB,MAAM;EAC1B,MAAM,QAAQ,IAAI,aAAa;EAE/B,MAAM,iBAAiB,OAAO,OAAO,CAAC,GAAG,SAAS,CAAC;EACnD,MAAM,eAAe,OAAO,OAAO,OAAO,KAAK,QAAQ,OAAO,OAAO,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;EAKjF,MAAM,iBACJ,OAAO,SAAS,gBACf,OAAO,WAAW,aAAa,OAAO,WAAW;EACpD,IAAI,OAAO,SAAS,YAAY,CAAC,kBAAkB,mBAAmB,OAAO,GAG3E,MAAM,IAAI,kBAAkB,OAAO,OAAO,CAAC,GAAG,kBAAkB,CAAC,GAAG,cAAc,MAAM;EAE1F,OAAO;GAAE;GAAQ,QAAQ;GAAc;GAAgB;EAAM;CAC/D;CAEA,OAAO,MAAM;AACf;;;AAIA,SAAS,UAAU,OAAmB,MAAyB;CAE7D,OADiB,MAAM,YAAY,YAErB,wEAAwE,KAAK,GAAG;AAEhG"}