@effect-agent/testing 0.1.0-beta.45 → 0.1.0-beta.47

package/src/fixtures/travel-planner/phase4.ts

@@ -1,20 +1,20 @@
-import { Agent, AgentPolicy, type ThreadId } from "@effect-agent/core";
-import { ToolExecutionClass } from "@effect-agent/engine";
+import * as Agent from "@effect-agent/core/Agent";
+import { AgentPolicy } from "@effect-agent/core/AgentPolicy";
+import { type ThreadId } from "@effect-agent/core/Identifiers";
+import { ToolExecutionClass } from "@effect-agent/engine/DurableStep";
+import { type DurableSubmitOptions, type Receipt } from "@effect-agent/thread/DurableAgentRuntime";
 import {
   CanonicalRecordEnvelope,
   DefinitionDigests,
   DeploymentId,
   Digest,
-  Principal,
   ProducerId,
-  type DurableSubmitOptions,
-  type IdempotencyKey,
-  type Receipt,
-} from "@effect-agent/thread";
+} from "@effect-agent/thread/Records";
+import { Principal, type IdempotencyKey } from "@effect-agent/thread/SubmissionLedger";
 import { Effect, Layer, Schema } from "effect";
 import { Model, Tool, Toolkit } from "effect/unstable/ai";
 
-import { ScriptedModel, type ScriptedTurnInput } from "../../scripted-model.ts";
+import { ScriptedModel, type ScriptedTurnInput } from "../../ScriptedModel.ts";
 import {
   ActivityCatalog,
   ActivityQuery,

package/src/fixtures/travel-planner/phase5.ts

@@ -1,21 +1,28 @@
-import { Agent, AgentPolicy, type ThreadId } from "@effect-agent/core";
-import { DurableStep, DurableStepError, ToolExecutionClass } from "@effect-agent/engine";
+import * as Agent from "@effect-agent/core/Agent";
+import { AgentPolicy } from "@effect-agent/core/AgentPolicy";
+import { type ThreadId } from "@effect-agent/core/Identifiers";
+import {
+  DurableStep,
+  DurableStepError,
+  ToolExecutionClass,
+} from "@effect-agent/engine/DurableStep";
+import { type DurableSubmitOptions } from "@effect-agent/thread/DurableAgentRuntime";
 import {
   DefinitionDigests,
   DeploymentId,
   Digest,
   PersistedJson,
-  Principal,
   ProducerId,
+  type CanonicalRecordEnvelope,
+} from "@effect-agent/thread/Records";
+import { Principal, type IdempotencyKey } from "@effect-agent/thread/SubmissionLedger";
+import {
   ReconciliationCompleted,
   ReconciliationSafeToRetry,
   ReconciliationUncertain,
   ToolReconciler,
   ToolReconcilerError,
-  type CanonicalRecordEnvelope,
-  type DurableSubmitOptions,
-  type IdempotencyKey,
-} from "@effect-agent/thread";
+} from "@effect-agent/thread/ToolReconciler";
 import { Effect, Layer, Option, Schema } from "effect";
 import { Tool, Toolkit } from "effect/unstable/ai";
 

package/src/fixtures/travel-planner/phase6.ts

@@ -1,16 +1,15 @@
-import { SubagentReservationsMemoryLive } from "@effect-agent/capabilities";
-import { Agent } from "@effect-agent/core";
+import { SubagentReservationsMemoryLive } from "@effect-agent/capabilities/SubagentReservations";
+import * as Agent from "@effect-agent/core/Agent";
+import { DurableWorkerBinding, type ResolvedBinding } from "@effect-agent/thread/AgentRegistration";
+import { type Receipt } from "@effect-agent/thread/DurableAgentRuntime";
 import {
   DefinitionDigests,
   DeploymentId,
   Digest,
-  DurableWorkerBinding,
   ProducerId,
   type CanonicalRecordEnvelope,
-  type Receipt,
-  type ResolvedBinding,
-  type ToolReconciler,
-} from "@effect-agent/thread";
+} from "@effect-agent/thread/Records";
+import { type ToolReconciler } from "@effect-agent/thread/ToolReconciler";
 import { Duration, Effect, Layer, Schema, Stream } from "effect";
 import { LanguageModel, Model, type Response } from "effect/unstable/ai";
 

package/src/fixtures/travel-planner/scenarios.ts

@@ -1,6 +1,6 @@
 import { Schema } from "effect";
 
-import type { ScriptedTurnInput } from "../../scripted-model.ts";
+import type { ScriptedTurnInput } from "../../ScriptedModel.ts";
 import { TravelPlan, TripRequest, type TravelPlan as TravelPlanValue } from "./definition.ts";
 
 const usage = { inputTokens: { total: 128 }, outputTokens: { total: 96 } };

package/src/fixtures/travel-planner/subagents-durable.ts

@@ -1,21 +1,15 @@
 import {
   delegationAllocationFromPolicy,
-  SubagentReservationsMemoryLive,
   SubagentRuntime,
-} from "@effect-agent/capabilities";
-import { Agent, type ThreadId } from "@effect-agent/core";
-import type { RuntimeBinding } from "@effect-agent/engine";
-import {
-  DefinitionDigests,
-  DeploymentId,
-  Digest,
-  DurableWorkerBinding,
-  Principal,
-  ProducerId,
-  type DurableSubmitOptions,
-  type IdempotencyKey,
-  type ResolvedBinding,
-} from "@effect-agent/thread";
+} from "@effect-agent/capabilities/Subagent";
+import { SubagentReservationsMemoryLive } from "@effect-agent/capabilities/SubagentReservations";
+import * as Agent from "@effect-agent/core/Agent";
+import { type ThreadId } from "@effect-agent/core/Identifiers";
+import { type RuntimeBinding } from "@effect-agent/engine/AgentRuntime";
+import { DurableWorkerBinding, type ResolvedBinding } from "@effect-agent/thread/AgentRegistration";
+import { type DurableSubmitOptions } from "@effect-agent/thread/DurableAgentRuntime";
+import { DefinitionDigests, DeploymentId, Digest, ProducerId } from "@effect-agent/thread/Records";
+import { Principal, type IdempotencyKey } from "@effect-agent/thread/SubmissionLedger";
 import { Effect, Layer, Ref, Schema, Stream } from "effect";
 import { LanguageModel, Model, type Response, type Toolkit } from "effect/unstable/ai";
 

package/src/fixtures/travel-planner/subagents.ts

@@ -1,10 +1,12 @@
-import { Subagent, SubagentPolicy, SubagentRuntime } from "@effect-agent/capabilities";
-import { Agent, AgentPolicy } from "@effect-agent/core";
-import type { RuntimeBinding } from "@effect-agent/engine";
+import * as Subagent from "@effect-agent/capabilities/Subagent";
+import { SubagentPolicy, SubagentRuntime } from "@effect-agent/capabilities/Subagent";
+import * as Agent from "@effect-agent/core/Agent";
+import { AgentPolicy } from "@effect-agent/core/AgentPolicy";
+import { type RuntimeBinding } from "@effect-agent/engine/AgentRuntime";
 import { Context, Deferred, Effect, Layer, Ref, Schema, Stream } from "effect";
 import { LanguageModel, Model, type Response, Tool, Toolkit } from "effect/unstable/ai";
 
-import type { ScriptedTurnInput } from "../../scripted-model.ts";
+import type { ScriptedTurnInput } from "../../ScriptedModel.ts";
 import { AirportCode } from "./definition.ts";
 import { CatalogLifecycle } from "./deterministic-layers.ts";
 

package/src/index.ts

@@ -1,2 +1 @@
-/** Scripted model support. Fixtures and specialized harnesses have dedicated subpaths. */
-export * from "./scripted-model.ts";
+export * as ScriptedModel from "./ScriptedModel.ts";

package/dist/certification.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"certification.mjs","names":[],"sources":["../src/certification.ts"],"sourcesContent":["import {\n  Subagent,\n  SubagentPolicy,\n  SubagentReservationsMemoryLive,\n  SubagentRuntime,\n} from \"@effect-agent/capabilities\";\nimport {\n  Agent,\n  AgentPolicy,\n  ThreadId,\n  IdGenerator,\n  RunId,\n  ToolCallId,\n  TurnId,\n  type AgentId,\n  type SubmissionId,\n} from \"@effect-agent/core\";\nimport { DurableStep, DurableStepError, RunToolAuthorization } from \"@effect-agent/engine\";\nimport {\n  ApprovalDecisionCommand,\n  ThreadExportRequest,\n  ThreadStore,\n  DefinitionDigests,\n  DeploymentId,\n  Digest,\n  DurableAgentRuntime,\n  DurableRuntimeConfig,\n  DurableRuntimeFailpointError,\n  DurableRuntimeFailpointLocation,\n  DurableWorkerBinding,\n  IdempotencyKey,\n  LoadCheckpointRequest,\n  Principal,\n  ProducerId,\n  ResolutionSafeToRetry,\n  SubmissionLedger,\n  SubmissionLookupById,\n  ToolReconciler,\n  UnknownResolutionCommand,\n  WakeScheduler,\n  DEFAULT_OWNERSHIP_LEASE_DURATION,\n  childThreadIdFor,\n  verifyThreadInvariants,\n  type BatchId,\n  type DurableSubmitFailure,\n  type DurableSubmitOptions,\n  type Receipt,\n  type ResolvedBinding,\n  type SubmissionSnapshot,\n} from \"@effect-agent/thread\";\nimport {\n  DurableRuntimeFailpointTestControl,\n  type CertificationCaseResult,\n  CertificationReport,\n  CertificationSweepResult,\n  CertificationTierThreeReport,\n  CertifiedAdapterIdentity,\n  certifyPorts,\n  type CertificationScenario,\n} from \"@effect-agent/thread/testing\";\nimport type { Crypto } from \"effect\";\nimport {\n  Cause,\n  Clock,\n  DateTime,\n  Duration,\n  Effect,\n  Exit,\n  Layer,\n  Option,\n  Ref,\n  Schema,\n  Stream,\n} from \"effect\";\nimport { TestClock } from \"effect/testing\";\nimport { LanguageModel, Model, Tool, Toolkit, type Response } from \"effect/unstable/ai\";\n\n/**\n * P7 WP2 — `certifyDurableAdapters` (plan §1): the one certification entry point a durable\n * adapter pair runs to earn a Schema-encoded certificate.\n *\n * - **Tier 1 — port contract**: the two shared conformance case arrays, verbatim, through\n *   `certifyPorts` (TEST-004/STORE-010).\n * - **Tier 2 — coordinator protocol + failpoint convergence**: the durable coordinator is\n *   assembled over the CANDIDATE Layer pair with a scripted deterministic model; every\n *   `DurableRuntimeFailpointLocation` is armed one-shot across the six scenario shapes\n *   (plain / uncertain-tool / durable-steps / approval / join / delegation). After the injected\n *   fault the runner asserts the state stays CLASSIFIABLE (recovery + the public unblocking\n *   operations `resolveUnknown`/`resolveApproval` are the only levers used) and that the\n *   re-drive CONVERGES to `verifyThreadInvariants` with `requireAllSettled` — including a\n *   fully discharged digest-chain check, because the runner captures per-batch producer\n *   identity at append time.\n * - **Tier 3 — real loss lever**: recorded honestly. A durable adapter either supplies a\n *   `CertificationCrashLever` executed in this run, cites its committed real-loss evidence\n *   (process-kill / eviction suites), or the certificate says `not-exercised`. A non-durable\n *   reference adapter records `not-applicable`.\n *\n * The runner is adapter-neutral and platform-neutral: it imports nothing Node-only, so the\n * same entry point runs under `@effect/vitest` on Node and inside workerd (storage-cloudflare's\n * in-workerd runner). It must run under a TestClock (Tier 1 drives lease expiry through\n * virtual time), and requires only `Crypto.Crypto` from the environment.\n */\n\n// ---------------------------------------------------------------------------\n// Options\n// ---------------------------------------------------------------------------\n\n/**\n * A real-loss lever supplied by an adapter that wants Tier 3 exercised IN this certification\n * run (kill/evict/reopen around a designated row subset). Rows report with\n * `suite: \"real-loss\"`. Failures must be captured per-row — the lever's error channel is\n * `never` so a certificate is always produced.\n */\nexport type CertificationCrashLever = Effect.Effect<ReadonlyArray<CertificationCaseResult>>;\n\nexport interface CertifyDurableAdaptersOptions<LedgerE = never, StoreE = never> {\n  /** Adapter pair identity named by the certificate (durability is read from the ledger). */\n  readonly adapter: {\n    readonly name: string;\n    readonly version?: string | undefined;\n  };\n  /**\n   * The candidate Layer pair. When both ports must share one connection root (the ADR-0011\n   * \"same file\" rule), pass the SAME combined Layer instance for both fields — Layer\n   * memoization builds it once. A candidate may require `Crypto.Crypto` (the memory reference\n   * does); the certification's own environment supplies nothing else.\n   */\n  readonly submissionLedger: Layer.Layer<SubmissionLedger, LedgerE, Crypto.Crypto>;\n  readonly threadStore: Layer.Layer<ThreadStore, StoreE, Crypto.Crypto>;\n  /** Defaults to `WakeScheduler.layerNoop`; the runner re-drives lanes explicitly. */\n  readonly wakeScheduler?: Layer.Layer<WakeScheduler> | undefined;\n  /** Executes Tier 3 in this run; takes precedence over `tierThreeEvidence`. */\n  readonly crashLever?: CertificationCrashLever | undefined;\n  /** Repository-relative citations of committed real-loss suites (Tier 3 `recorded-evidence`). */\n  readonly tierThreeEvidence?: ReadonlyArray<string> | undefined;\n  /**\n   * The candidate ledger's configured ownership lease (defaults to the D5 default, 30s).\n   * Every Tier-2 re-drive round advances the TestClock past this lease before reclaiming:\n   * a live lease may block ALL new claims (the SQL adapters do; the memory reference also\n   * allows same-producer reclaim), so the adapter-NEUTRAL recovery lever after a mid-Attempt\n   * fault is lease expiry — exactly the documented D5 liveness mechanism, driven through\n   * virtual time.\n   */\n  readonly ownershipLeaseDuration?: Duration.Duration | undefined;\n}\n\n/** The six Tier-2 scenario shapes in sweep order. */\nexport const CERTIFICATION_SCENARIOS: ReadonlyArray<CertificationScenario> = [\n  \"plain\",\n  \"uncertain-tool\",\n  \"durable-steps\",\n  \"approval\",\n  \"join\",\n  \"delegation\",\n];\n\n/**\n * Coordinator failpoint locations that none of the six scenario shapes can reach, recorded\n * honestly instead of silently claimed: all three sit on operator/abort paths the shapes do\n * not take. They are pinned in-process by the P5/S2 suites\n * (`packages/testing/test/durable-tools.test.ts` \"resolveUnknown is idempotent across the\n * intent failpoint\", `durable-runtime.test.ts` abort rows,\n * `durable-subagents.test.ts` abort propagation) and by the process-kill/eviction crash\n * matrices. Runner tests assert the observed never-fired set equals EXACTLY this list, so a\n * protocol change that silently stops exercising a location fails the certification.\n */\nexport const TIER2_UNREACHED_LOCATIONS: ReadonlyArray<DurableRuntimeFailpointLocation> = [\n  \"abort:after-intent\",\n  // Compaction requires a `contextTokenLimit` policy plus prior-Run history\n  // none of the six scenario shapes carries; pinned in-process by the\n  // RUN-026 rows in `packages/testing/test/durable-runtime.test.ts`\n  // (compaction failpoint idempotence across re-drive).\n  \"compaction:after-canonical-append\",\n  // These shapes use neither programmatic Tools nor grace finalization. Their reservations\n  // are exercised before/after append in the public durable-runtime regression suite.\n  \"policy:before-reservation-append\",\n  \"policy:after-reservation-append\",\n  \"resolve:after-intent\",\n  \"subagent:after-child-abort-intent\",\n];\n\n/** Locations of `tier2` rows whose armed fault never fired in ANY scenario, sorted. */\nexport const tier2NeverFiredLocations = (\n  tier2: ReadonlyArray<CertificationSweepResult>,\n): ReadonlyArray<DurableRuntimeFailpointLocation> => {\n  const fired = new Set<DurableRuntimeFailpointLocation>();\n\n  for (const row of tier2) {\n    if (row.failpointFired) fired.add(row.location);\n  }\n\n  return DurableRuntimeFailpointLocation.literals.filter((location) => !fired.has(location)).sort();\n};\n\n// ---------------------------------------------------------------------------\n// Deterministic fixtures (scripted prompt-shape models, agents, delegation)\n// ---------------------------------------------------------------------------\n\nconst SHA_A = Schema.decodeSync(Digest)(\"a\".repeat(64));\nconst DIGESTS = DefinitionDigests.make({ agent: SHA_A, model: SHA_A, tools: SHA_A });\n\nconst CHILD_DIGEST_STRINGS = {\n  agent: \"b\".repeat(64),\n  model: \"c\".repeat(64),\n  tools: \"d\".repeat(64),\n} as const;\n\nconst CHILD_DIGESTS = DefinitionDigests.make({\n  agent: Schema.decodeSync(Digest)(CHILD_DIGEST_STRINGS.agent),\n  model: Schema.decodeSync(Digest)(CHILD_DIGEST_STRINGS.model),\n  tools: Schema.decodeSync(Digest)(CHILD_DIGEST_STRINGS.tools),\n});\n\nconst PRINCIPAL = Schema.decodeSync(Principal)(\"principal-certification\");\nconst decodeThreadId = Schema.decodeSync(ThreadId);\nconst decodeIdempotencyKey = Schema.decodeSync(IdempotencyKey);\nconst decodeToolCallId = Schema.decodeSync(ToolCallId);\n\nconst usage = { inputTokens: {}, outputTokens: {} };\n\nconst finalParts = (text: string): ReadonlyArray<Response.StreamPartEncoded> => [\n  { type: \"text-start\", id: \"answer\" },\n  { type: \"text-delta\", id: \"answer\", delta: text },\n  { type: \"text-end\", id: \"answer\" },\n  { type: \"finish\", reason: \"stop\", usage },\n];\n\nconst toolCallPart = (id: string, name: string, params: unknown): Response.StreamPartEncoded => ({\n  type: \"tool-call\",\n  id,\n  name,\n  params,\n  providerExecuted: false,\n});\n\nconst toolTurn = (\n  ...calls: ReadonlyArray<Response.StreamPartEncoded>\n): ReadonlyArray<Response.StreamPartEncoded> => [\n  ...calls,\n  { type: \"finish\", reason: \"tool-calls\", usage },\n];\n\n/**\n * Stateless scripted model that decides by PROMPT SHAPE instead of call count: while the\n * prompt carries no committed tool result the model declares `toolParts` (when given),\n * otherwise it answers with the final text. Deciding on the canonical prompt keeps every cell\n * deterministic regardless of where the injected fault fell — a re-invoked Turn re-declares\n * the same batch and a resumed batch flows into the final answer, so every scenario always\n * exercises its tool path and always converges.\n */\nconst promptShapeModel = (\n  name: string,\n  finalText: string,\n  toolParts?: ReadonlyArray<Response.StreamPartEncoded>,\n) =>\n  Model.make(\n    \"scripted\",\n    name,\n    Layer.effect(\n      LanguageModel.LanguageModel,\n      LanguageModel.make({\n        generateText: () => Effect.succeed([]),\n        streamText: (request) => {\n          const hasToolResult = request.prompt.content.some((message) => message.role === \"tool\");\n\n          const parts =\n            toolParts === undefined || hasToolResult ? finalParts(finalText) : toolParts;\n\n          return Stream.fromIterable(parts);\n        },\n      }),\n    ),\n  );\n\n// Tier-2 intentionally advances virtual time past a 30-second ownership lease on every\n// re-drive round. Keep its business-policy duration above the full eight-round sweep so this\n// fixture certifies crash convergence rather than accidentally relying on a fresh duration\n// allowance per replacement Attempt. RUN-030 owns the dedicated duration-expiry coverage.\nconst CERTIFICATION_MAX_DURATION = \"10 minutes\" as const;\n\nconst policy = AgentPolicy.make({\n  maxTurns: 4,\n  maxToolCalls: 4,\n  maxDuration: CERTIFICATION_MAX_DURATION,\n  toolConcurrency: 2,\n});\n\nconst QuestionInput = Schema.Struct({ question: Schema.String });\nconst AnswerOutput = Schema.Struct({ answer: Schema.String });\n\n/** plain / join: no tools — the pure Turn/submission/join seams. */\nconst plainDefinition = Agent.make(\"certify-plain\", {\n  input: QuestionInput,\n  output: AnswerOutput,\n  instructions: \"Answer as JSON.\",\n  toolkit: Toolkit.empty,\n  policy,\n});\n\n/** uncertain-tool: unannotated → fail-closed `uncertain`, enters the prepared/settled protocol. */\nconst Book = Tool.make(\"book\", {\n  parameters: Schema.Struct({ ref: Schema.String }),\n  success: Schema.Struct({ confirmation: Schema.String }),\n});\n\nconst bookToolkit = Toolkit.make(Book);\n\nconst uncertainDefinition = Agent.make(\"certify-uncertain\", {\n  input: QuestionInput,\n  output: AnswerOutput,\n  instructions: \"Book it.\",\n  toolkit: bookToolkit,\n  policy,\n});\n\n/** durable-steps: declaring `DurableStep` as a dependency is what makes the Tool durable. */\nconst Itinerary = Tool.make(\"itinerary\", {\n  parameters: Schema.Struct({ ref: Schema.String }),\n  success: Schema.Struct({ state: Schema.String }),\n  failure: DurableStepError,\n  dependencies: [DurableStep],\n});\n\nconst itineraryToolkit = Toolkit.make(Itinerary);\n\nconst stepsDefinition = Agent.make(\"certify-steps\", {\n  input: QuestionInput,\n  output: AnswerOutput,\n  instructions: \"Reserve the itinerary.\",\n  toolkit: itineraryToolkit,\n  policy,\n});\n\n/** approval: fail-closed — no `DurableApprovalResolver` Layer, so undecided approvals suspend. */\nconst BookApproval = Tool.make(\"book\", {\n  parameters: Schema.Struct({ ref: Schema.String }),\n  success: Schema.Struct({ confirmation: Schema.String }),\n  needsApproval: true,\n});\n\nconst approvalToolkit = Toolkit.make(BookApproval);\n\nconst approvalDefinition = Agent.make(\"certify-approval\", {\n  input: QuestionInput,\n  output: AnswerOutput,\n  instructions: \"Book after approval.\",\n  toolkit: approvalToolkit,\n  policy,\n});\n\n/** delegation: durable attached child plus an ordinary uncertain sibling in ONE batch. */\nconst childDefinition = Agent.make(\"certify-child\", {\n  input: QuestionInput,\n  output: AnswerOutput,\n  instructions: \"Answer as JSON.\",\n  toolkit: Toolkit.empty,\n  policy: AgentPolicy.make({\n    maxTurns: 2,\n    maxToolCalls: 1,\n    maxDuration: CERTIFICATION_MAX_DURATION,\n    toolConcurrency: 1,\n  }),\n});\n\nclass CertifyDelegationFailed extends Schema.TaggedError<CertifyDelegationFailed>()(\n  \"CertifyDelegationFailed\",\n  { childErrorTag: Schema.String },\n) {}\n\nconst researchDelegation = Subagent.define(\"delegate_research\", {\n  description: \"Research one bounded question and return findings.\",\n  target: childDefinition,\n  parameters: Schema.Struct({ topic: Schema.String }),\n  success: Schema.Struct({ summary: Schema.String }),\n  failure: CertifyDelegationFailed,\n  prepareInput: ({ topic }) => Effect.succeed({ question: `research:${topic}` }),\n  projectResult: (output) => Effect.succeed({ summary: `finding:${output.answer}` }),\n  policy: SubagentPolicy.make({\n    maxChildren: 2,\n    maxConcurrency: 2,\n    maxTurns: 4,\n    maxToolCalls: 4,\n    maxDuration: CERTIFICATION_MAX_DURATION,\n  }),\n});\n\nconst Lookup = Tool.make(\"lookup\", {\n  parameters: Schema.Struct({ key: Schema.String }),\n  success: Schema.Struct({ value: Schema.String }),\n});\n\nconst coordinatorDefinition = Agent.make(\"certify-coordinator\", {\n  input: Schema.Struct({ mission: Schema.String }),\n  output: Schema.Struct({ report: Schema.String }),\n  instructions: \"Delegate and look up, then answer as JSON.\",\n  toolkit: Toolkit.make(researchDelegation.tool, Lookup),\n  policy: AgentPolicy.make({\n    maxTurns: 4,\n    maxToolCalls: 3,\n    maxDuration: CERTIFICATION_MAX_DURATION,\n    toolConcurrency: 2,\n  }),\n});\n\nconst mapChildFailure = (failure: { readonly _tag: string }) =>\n  CertifyDelegationFailed.make({ childErrorTag: failure._tag });\n\nconst DELEGATE_CALL = decodeToolCallId(\"delegate-1\");\n\n/** Fixture-only identity source consumed by the delegation Layer's ephemeral capture. */\nconst identifiers = Layer.effect(\n  IdGenerator,\n  Effect.gen(function* () {\n    const counter = yield* Ref.make(0);\n\n    const next = <A>(decode: (value: string) => A, prefix: string) =>\n      Ref.getAndUpdate(counter, (value) => value + 1).pipe(\n        Effect.map((value) => decode(`${prefix}-${value}`)),\n      );\n\n    return {\n      nextThreadId: next(decodeThreadId, \"certify-fixture-thread\"),\n      nextRunId: next(Schema.decodeSync(RunId), \"certify-fixture-run\"),\n      nextTurnId: next(Schema.decodeSync(TurnId), \"certify-fixture-turn\"),\n    };\n  }),\n);\n\nconst delegationSupport = Layer.mergeAll(SubagentReservationsMemoryLive, identifiers);\n\n// ---------------------------------------------------------------------------\n// Tier 2 — scenario cells\n// ---------------------------------------------------------------------------\n\ninterface CertificationCell {\n  readonly bindings: ReadonlyArray<ResolvedBinding>;\n  /** Idempotent submission batch — safe to replay verbatim after a submit-boundary fault. */\n  readonly submit: Effect.Effect<ReadonlyArray<Receipt>, DurableSubmitFailure, DurableAgentRuntime>;\n  /** All lanes of the cell in drive order, computed from the (possibly replayed) receipts. */\n  readonly lanes: (receipts: ReadonlyArray<Receipt>) => ReadonlyArray<ThreadId>;\n}\n\nconst submitOptionsFor = (slug: string, threadId: ThreadId): DurableSubmitOptions => ({\n  threadId,\n  principal: PRINCIPAL,\n  idempotencyKey: decodeIdempotencyKey(`certify-key-${slug}`),\n  definitions: DIGESTS,\n});\n\n/** One single-agent cell: one lane, one Submission, one registered exact-digest binding. */\nconst makeSingleAgentCell = (\n  definition: { readonly id: AgentId; readonly input: typeof QuestionInput },\n  resolved: ResolvedBinding,\n  slug: string,\n): CertificationCell => {\n  const threadId = decodeThreadId(`certify-${slug}`);\n\n  const submit = Effect.gen(function* () {\n    const runtime = yield* DurableAgentRuntime;\n\n    const receipt = yield* runtime.submit(\n      { definition: { id: definition.id, input: definition.input } },\n      { question: `certify ${slug}` },\n      submitOptionsFor(slug, threadId),\n    );\n\n    return [receipt];\n  });\n\n  return {\n    bindings: [resolved],\n    submit,\n    lanes: () => [threadId],\n  };\n};\n\nconst makeCell = Effect.fn(\"Certification.makeCell\")(function* (\n  scenario: CertificationScenario,\n  slug: string,\n) {\n  switch (scenario) {\n    case \"plain\": {\n      const binding = Agent.withModel(\n        plainDefinition,\n        promptShapeModel(\"certify-plain\", '{\"answer\":\"done\"}'),\n      );\n\n      const resolved = yield* DurableWorkerBinding.make(binding, DIGESTS);\n\n      return makeSingleAgentCell(plainDefinition, resolved, slug);\n    }\n    case \"uncertain-tool\": {\n      const binding = Agent.withModel(\n        uncertainDefinition,\n        promptShapeModel(\n          \"certify-uncertain\",\n          '{\"answer\":\"booked\"}',\n          toolTurn(toolCallPart(\"book-1\", \"book\", { ref: `r-${slug}` })),\n        ),\n      );\n\n      const toolLayer = bookToolkit.toLayer({\n        book: ({ ref }) => Effect.succeed({ confirmation: `confirmed-${ref}` }),\n      });\n\n      const resolved = yield* DurableWorkerBinding.make(binding, DIGESTS).pipe(\n        Effect.provide(toolLayer),\n      );\n\n      return makeSingleAgentCell(uncertainDefinition, resolved, slug);\n    }\n    case \"durable-steps\": {\n      const binding = Agent.withModel(\n        stepsDefinition,\n        promptShapeModel(\n          \"certify-steps\",\n          '{\"answer\":\"reserved\"}',\n          toolTurn(toolCallPart(\"itinerary-1\", \"itinerary\", { ref: `trip-${slug}` })),\n        ),\n      );\n\n      const toolLayer = itineraryToolkit.toLayer({\n        itinerary: ({ ref }) =>\n          Effect.gen(function* () {\n            const step = yield* DurableStep;\n\n            const flight = yield* step.do(\n              \"reserve-flight\",\n              Schema.String,\n              Effect.succeed(`flight-${ref}`),\n            );\n\n            const lodging = yield* step.do(\n              \"reserve-lodging\",\n              Schema.String,\n              Effect.succeed(`lodging-${ref}`),\n            );\n\n            return { state: `${flight}+${lodging}` };\n          }),\n      });\n\n      const resolved = yield* DurableWorkerBinding.make(binding, DIGESTS).pipe(\n        Effect.provide(toolLayer),\n      );\n\n      return makeSingleAgentCell(stepsDefinition, resolved, slug);\n    }\n    case \"approval\": {\n      const binding = Agent.withModel(\n        approvalDefinition,\n        promptShapeModel(\n          \"certify-approval\",\n          '{\"answer\":\"approved\"}',\n          toolTurn(toolCallPart(\"book-1\", \"book\", { ref: `r-${slug}` })),\n        ),\n      );\n\n      const toolLayer = approvalToolkit.toLayer({\n        book: ({ ref }) => Effect.succeed({ confirmation: `confirmed-${ref}` }),\n      });\n\n      const resolved = yield* DurableWorkerBinding.make(binding, DIGESTS).pipe(\n        Effect.provide(toolLayer),\n      );\n\n      return makeSingleAgentCell(approvalDefinition, resolved, slug);\n    }\n    case \"join\": {\n      const binding = Agent.withModel(\n        plainDefinition,\n        promptShapeModel(\"certify-join\", '{\"answer\":\"host answer\"}'),\n      );\n\n      const resolved = yield* DurableWorkerBinding.make(binding, DIGESTS);\n      const threadId = decodeThreadId(`certify-${slug}`);\n\n      const submitOne = Effect.fn(\"Certification.submitOne\")(function* (\n        key: string,\n        question: string,\n      ) {\n        const runtime = yield* DurableAgentRuntime;\n\n        return yield* runtime.submit(\n          { definition: { id: plainDefinition.id, input: plainDefinition.input } },\n          { question },\n          {\n            threadId,\n            principal: PRINCIPAL,\n            idempotencyKey: decodeIdempotencyKey(key),\n            definitions: DIGESTS,\n          },\n        );\n      });\n\n      const cell: CertificationCell = {\n        bindings: [resolved],\n        submit: Effect.gen(function* () {\n          const host = yield* submitOne(`certify-key-${slug}-host`, \"host question\");\n          const queued = yield* submitOne(`certify-key-${slug}-queued`, \"queued question\");\n\n          return [host, queued];\n        }),\n        lanes: () => [threadId],\n      };\n\n      return cell;\n    }\n    case \"delegation\": {\n      const childBinding = Agent.withModel(\n        childDefinition,\n        promptShapeModel(\"certify-child\", '{\"answer\":\"child-answer\"}'),\n      );\n\n      const parentBinding = Agent.withModel(\n        coordinatorDefinition,\n        promptShapeModel(\n          \"certify-parent\",\n          '{\"report\":\"done\"}',\n          toolTurn(\n            toolCallPart(\"delegate-1\", \"delegate_research\", { topic: \"paris\" }),\n            toolCallPart(\"lookup-1\", \"lookup\", { key: \"hotels\" }),\n          ),\n        ),\n      );\n\n      const delegationLayer = SubagentRuntime.layer(researchDelegation, childBinding, {\n        mapChildFailure,\n        durable: { targetDigests: CHILD_DIGEST_STRINGS },\n      }).pipe(Layer.provide(delegationSupport));\n\n      const lookupLayer = Toolkit.make(Lookup).toLayer({\n        lookup: ({ key }) => Effect.succeed({ value: `found-${key}` }),\n      });\n\n      const parentResolved = yield* DurableWorkerBinding.make(parentBinding, DIGESTS).pipe(\n        Effect.provide(Layer.mergeAll(delegationLayer, lookupLayer)),\n      );\n\n      const childResolved = yield* DurableWorkerBinding.make(childBinding, CHILD_DIGESTS);\n      const threadId = decodeThreadId(`certify-${slug}`);\n\n      const cell: CertificationCell = {\n        bindings: [parentResolved, childResolved],\n        submit: Effect.gen(function* () {\n          const runtime = yield* DurableAgentRuntime;\n\n          const receipt = yield* runtime.submit(\n            { definition: { id: coordinatorDefinition.id, input: coordinatorDefinition.input } },\n            { mission: \"plan\" },\n            submitOptionsFor(slug, threadId),\n          );\n\n          return [receipt];\n        }),\n        lanes: (receipts) => {\n          const parent = receipts.at(0);\n\n          return parent === undefined\n            ? [threadId]\n            : [threadId, childThreadIdFor(parent.submissionId, DELEGATE_CALL)];\n        },\n      };\n\n      return cell;\n    }\n  }\n});\n\n/** Maximum recovery/drive/unblock rounds before a cell is reported non-convergent. */\nconst MAX_REDRIVE_ROUNDS = 8;\n\n/**\n * Verify one lane after convergence: canonical export + every lane Submission the ledger or\n * the log names (the same collection rule as the admin `verify` member), fed to the shared\n * invariant checker in convergence mode WITH the captured per-batch producer directory, so\n * the digest chain is fully recomputed instead of skipped.\n */\nconst verifyLane = Effect.fn(\"Certification.verifyLane\")(function* (\n  lane: ThreadId,\n  batchProducers: ReadonlyMap<BatchId, ProducerId>,\n) {\n  const store = yield* ThreadStore;\n  const ledger = yield* SubmissionLedger;\n  const exported = yield* store.export(ThreadExportRequest.make({ threadId: lane }));\n  const rows = new Map<SubmissionId, SubmissionSnapshot>();\n  const nonterminal = yield* Stream.runCollect(ledger.scanNonterminal);\n\n  for (const submission of nonterminal) {\n    if (submission.threadId === lane) rows.set(submission.submissionId, submission);\n  }\n  const named = new Set<SubmissionId>();\n\n  for (const envelope of exported.records) {\n    const payload = envelope.record.payload;\n\n    if (\n      payload._tag === \"UserInputRecorded\" ||\n      payload._tag === \"SubmissionSettled\" ||\n      payload._tag === \"AbortRequested\"\n    ) {\n      if (payload.submissionId !== undefined) named.add(payload.submissionId);\n    }\n  }\n  for (const submissionId of named) {\n    if (rows.has(submissionId)) continue;\n    const found = yield* ledger.lookup(SubmissionLookupById.make({ submissionId }));\n\n    if (Option.isSome(found) && found.value.threadId === lane) {\n      rows.set(submissionId, found.value);\n    }\n  }\n\n  const checkpoint =\n    store.checkpoints === undefined\n      ? Option.none()\n      : yield* store.checkpoints.load(LoadCheckpointRequest.make({ threadId: lane }));\n\n  return yield* verifyThreadInvariants({\n    export: exported,\n    submissions: [...rows.values()],\n    batchProducers,\n    checkpoint: Option.getOrUndefined(checkpoint),\n    checkpointsSupported: store.checkpoints !== undefined,\n    requireAllSettled: true,\n  });\n});\n\nconst failureTagOf = <E>(cause: Cause.Cause<E>): string => {\n  const failure = Cause.findErrorOption(cause);\n\n  if (Option.isSome(failure)) {\n    const error: unknown = failure.value;\n\n    if (typeof error === \"object\" && error !== null && \"_tag\" in error) {\n      return String(error._tag);\n    }\n\n    return String(error).slice(0, 256);\n  }\n\n  return \"defect\";\n};\n\n/** One Tier-2 sweep cell: arm `location` one-shot, drive `scenario`, converge, verify. */\nconst runSweepCell = Effect.fn(\"Certification.runSweepCell\")(function* (\n  scenario: CertificationScenario,\n  location: DurableRuntimeFailpointLocation,\n  batchProducers: ReadonlyMap<BatchId, ProducerId>,\n  leaseAdvance: Duration.Duration,\n) {\n  const ledger = yield* SubmissionLedger;\n  const control = yield* DurableRuntimeFailpointTestControl;\n  const slug = `${scenario}-${location.replaceAll(\":\", \"-\")}`;\n\n  const failed = (detail: string, fired: boolean): CertificationSweepResult =>\n    CertificationSweepResult.make({\n      scenario,\n      location,\n      failpointFired: fired,\n      status: \"failed\",\n      digestChainVerified: false,\n      detail: detail.slice(0, 4_096),\n    });\n\n  const cell = yield* makeCell(scenario, slug);\n\n  const runtime = yield* DurableAgentRuntime.pipe(\n    Effect.provide(\n      DurableAgentRuntime.layerWithBindings(cell.bindings).pipe(\n        Layer.provide(RunToolAuthorization.allowAll),\n      ),\n    ),\n  );\n\n  const submit = cell.submit.pipe(Effect.provideService(DurableAgentRuntime, runtime));\n\n  // One-shot arm: the fault fires at most once anywhere in the cell (initial drive OR a\n  // re-drive round's public unblocking operation), modelling one crash at this boundary.\n  const fired = yield* Ref.make(false);\n\n  yield* control.setHandler((hit) =>\n    hit !== location\n      ? Effect.void\n      : Ref.getAndSet(fired, true).pipe(\n          Effect.flatMap((already) =>\n            already\n              ? Effect.void\n              : Effect.fail(DurableRuntimeFailpointError.make({ location: hit })),\n          ),\n        ),\n  );\n\n  // Submissions are idempotent (DUR-001): one replay recovers a submit-boundary fault.\n  let receipts: ReadonlyArray<Receipt>;\n  const firstSubmit = yield* Effect.exit(submit);\n\n  if (Exit.isSuccess(firstSubmit)) {\n    receipts = firstSubmit.value;\n  } else {\n    const secondSubmit = yield* Effect.exit(submit);\n\n    if (Exit.isFailure(secondSubmit)) {\n      yield* control.clear;\n\n      return failed(\n        `submission replay did not recover: ${failureTagOf(secondSubmit.cause)}`,\n        yield* Ref.get(fired),\n      );\n    }\n    receipts = secondSubmit.value;\n  }\n  const lanes = cell.lanes(receipts);\n\n  const driveLane = (lane: ThreadId) => runtime.processThreadResolved(lane);\n\n  const allSettled = Effect.gen(function* () {\n    for (const receipt of receipts) {\n      const snapshot = yield* ledger.lookup(\n        SubmissionLookupById.make({ submissionId: receipt.submissionId }),\n      );\n\n      if (Option.isNone(snapshot) || snapshot.value.state !== \"settled\") return false;\n    }\n\n    return true;\n  });\n\n  // Re-drive to convergence using ONLY public operations: worker drives, recovery passes,\n  // and the authorized DUR-017/approval unblocking paths chosen from `explainThread`.\n  let converged = false;\n\n  for (let round = 0; round < MAX_REDRIVE_ROUNDS && !converged; round++) {\n    // Expire any lease a faulted Attempt left behind (D5): virtual time is the\n    // adapter-neutral reclaim lever — a live lease may block every new claim.\n    yield* TestClock.adjust(leaseAdvance);\n    yield* Effect.exit(runtime.runRecovery);\n    for (const lane of lanes) {\n      yield* Effect.exit(driveLane(lane));\n    }\n    for (const lane of lanes) {\n      const explains = yield* Effect.exit(runtime.explainThread(lane));\n\n      if (Exit.isFailure(explains)) continue;\n      for (const explanation of explains.value) {\n        for (const unknown of explanation.evidence.unknownCalls) {\n          if (unknown.resolved) continue;\n          yield* Effect.exit(\n            runtime.resolveUnknown(\n              UnknownResolutionCommand.make({\n                submissionId: explanation.submission.submissionId,\n                toolCallId: unknown.toolCallId,\n                author: \"certification-runner\",\n                reason: `re-drive after injected fault at ${location}`,\n                resolution: ResolutionSafeToRetry.make(),\n              }),\n            ),\n          );\n        }\n        for (const pending of explanation.evidence.approvalsPending) {\n          const decided = explanation.evidence.approvalDecisions.some(\n            (decision) => decision.toolCallId === pending.toolCallId,\n          );\n\n          if (decided) continue;\n          yield* Effect.exit(\n            runtime.resolveApproval(\n              ApprovalDecisionCommand.make({\n                submissionId: explanation.submission.submissionId,\n                toolCallId: pending.toolCallId,\n                decision: \"approved\",\n                resolver: \"certification-runner\",\n                reason: `re-drive after injected fault at ${location}`,\n              }),\n            ),\n          );\n        }\n      }\n    }\n    const settled = yield* Effect.exit(allSettled);\n\n    converged = Exit.isSuccess(settled) && settled.value;\n  }\n  yield* control.clear;\n  const wasFired = yield* Ref.get(fired);\n\n  if (!converged) {\n    return failed(`did not converge within ${MAX_REDRIVE_ROUNDS} re-drive rounds`, wasFired);\n  }\n\n  // Every lane of the cell must verify in convergence mode with a recomputed digest chain.\n  let digestChainVerified = true;\n  const failedChecks: Array<string> = [];\n\n  for (const lane of lanes) {\n    const verdict = yield* Effect.exit(verifyLane(lane, batchProducers));\n\n    if (Exit.isFailure(verdict)) {\n      return failed(`lane ${lane} could not be verified: ${failureTagOf(verdict.cause)}`, wasFired);\n    }\n    for (const check of verdict.value.checks) {\n      if (check.status === \"failed\") {\n        failedChecks.push(\n          `${lane}:${check.name}${check.detail === undefined ? \"\" : ` (${check.detail})`}`,\n        );\n      }\n      if (check.name === \"digest-chain\" && check.status !== \"passed\") {\n        digestChainVerified = false;\n      }\n    }\n  }\n  if (failedChecks.length > 0 || !digestChainVerified) {\n    return failed(\n      failedChecks.length > 0\n        ? `invariant checks failed: ${failedChecks.join(\"; \")}`\n        : \"the digest chain was not fully recomputed\",\n      wasFired,\n    );\n  }\n\n  return CertificationSweepResult.make({\n    scenario,\n    location,\n    failpointFired: wasFired,\n    status: wasFired ? \"converged\" : \"not-triggered\",\n    digestChainVerified,\n  });\n});\n\n// ---------------------------------------------------------------------------\n// Tier 3 — real loss lever record\n// ---------------------------------------------------------------------------\n\n/**\n * Resolve the Tier-3 record honestly (plan §1): a non-durable reference adapter has no real\n * loss to exercise (`not-applicable`); a supplied lever runs NOW (`exercised`); committed\n * real-loss citations are recorded (`recorded-evidence`); otherwise the certificate says\n * `not-exercised` — a scoped statement, never a silent claim.\n */\nexport const resolveTierThree = Effect.fn(\"Certification.resolveTierThree\")(function* (\n  durability: CertifiedAdapterIdentity[\"durability\"],\n  options: {\n    readonly crashLever?: CertificationCrashLever | undefined;\n    readonly tierThreeEvidence?: ReadonlyArray<string> | undefined;\n  },\n): Effect.fn.Return<CertificationTierThreeReport, never> {\n  if (durability === \"non-durable\") {\n    return CertificationTierThreeReport.make({\n      status: \"not-applicable\",\n      evidence: [],\n      cases: [],\n      detail:\n        \"the adapter declares non-durable state (reference/conformance adapter); there is no real loss to exercise\",\n    });\n  }\n  if (options.crashLever !== undefined) {\n    const cases = yield* options.crashLever;\n\n    return CertificationTierThreeReport.make({\n      status: cases.length === 0 ? \"not-exercised\" : \"exercised\",\n      evidence: options.tierThreeEvidence ?? [],\n      cases,\n      ...(cases.length === 0\n        ? { detail: \"the supplied crash lever executed no real-loss cases\" }\n        : {}),\n    });\n  }\n  if (options.tierThreeEvidence !== undefined && options.tierThreeEvidence.length > 0) {\n    return CertificationTierThreeReport.make({\n      status: \"recorded-evidence\",\n      evidence: options.tierThreeEvidence,\n      cases: [],\n    });\n  }\n\n  return CertificationTierThreeReport.make({\n    status: \"not-exercised\",\n    evidence: [],\n    cases: [],\n    detail:\n      \"no crash lever was supplied and no committed real-loss evidence was cited; Tier 3 is NOT discharged for this adapter\",\n  });\n});\n\n// ---------------------------------------------------------------------------\n// Entry point\n// ---------------------------------------------------------------------------\n\nconst nowUtc: Effect.Effect<DateTime.Utc> = Effect.map(Clock.currentTimeMillis, (millis) =>\n  DateTime.toUtc(DateTime.makeUnsafe(millis)),\n);\n\n/**\n * Certify one durable adapter pair (plan §1, §8 WP2). Runs Tier 2 FIRST over pristine\n * storage (each cell converges to all-settled before the next starts, so the recovery scan\n * never sees foreign leftovers), then Tier 1's port contract cases (whose lanes deliberately\n * end in every nonterminal shape), then records Tier 3. Requires `Crypto.Crypto` and a\n * TestClock-backed environment; the candidate Layers are built exactly once.\n */\nexport const certifyDurableAdapters = <LedgerE = never, StoreE = never>(\n  options: CertifyDurableAdaptersOptions<LedgerE, StoreE>,\n): Effect.Effect<CertificationReport, LedgerE | StoreE, Crypto.Crypto> => {\n  const batchProducers = new Map<BatchId, ProducerId>();\n\n  // Interpose the candidate store with an append-time capture of each batch's producer\n  // identity — the one value the ThreadStore port deliberately does not export — so\n  // Tier 2's invariant verification recomputes the FULL digest chain instead of skipping it.\n  const capturingStore = Layer.effect(ThreadStore)(\n    Effect.gen(function* () {\n      const inner = yield* ThreadStore;\n\n      return ThreadStore.of({\n        ...inner,\n        append: (request) =>\n          Effect.sync(() => {\n            batchProducers.set(request.batch.batchId, request.batch.producerId);\n          }).pipe(Effect.andThen(inner.append(request))),\n      });\n    }),\n  ).pipe(Layer.provide(options.threadStore));\n\n  // RUN-036: certification uses the default-none Tool failure observer. Trusted application\n  // reporting adds no durable transition and is verified separately from adapter certification.\n  const environment = Layer.mergeAll(\n    options.submissionLedger,\n    capturingStore,\n    options.wakeScheduler ?? WakeScheduler.layerNoop,\n    DurableRuntimeFailpointTestControl.layer,\n    ToolReconciler.uncertain,\n    DurableRuntimeConfig.layer({\n      deploymentId: Schema.decodeSync(DeploymentId)(\"deployment-certification\"),\n      producerId: Schema.decodeSync(ProducerId)(\"producer-certification\"),\n      settlementPollInterval: Duration.millis(50),\n      leaseRenewalInterval: Duration.seconds(5),\n      abortPollInterval: Duration.millis(50),\n    }),\n  );\n\n  const leaseAdvance = Duration.millis(\n    Duration.toMillis(options.ownershipLeaseDuration ?? DEFAULT_OWNERSHIP_LEASE_DURATION) + 1_000,\n  );\n\n  const program = Effect.gen(function* () {\n    const ledger = yield* SubmissionLedger;\n\n    // Tier 2 — coordinator failpoint convergence sweep.\n    const tier2: Array<CertificationSweepResult> = [];\n\n    for (const scenario of CERTIFICATION_SCENARIOS) {\n      for (const location of DurableRuntimeFailpointLocation.literals) {\n        tier2.push(yield* runSweepCell(scenario, location, batchProducers, leaseAdvance));\n      }\n    }\n\n    // Tier 1 — the shared port contract suites, verbatim.\n    const tier1 = yield* certifyPorts();\n\n    // Tier 3 — the real loss lever record.\n    const capabilities = yield* ledger.capabilities;\n    const tier3 = yield* resolveTierThree(capabilities.durability, options);\n\n    const generatedAt = yield* nowUtc;\n\n    const ok =\n      tier1.every((result) => result.status === \"passed\") &&\n      tier2.every((result) => result.status !== \"failed\") &&\n      tier3.cases.every((result) => result.status === \"passed\");\n\n    return CertificationReport.make({\n      format: \"effect-agent/certification@2\",\n      adapter: CertifiedAdapterIdentity.make({\n        name: options.adapter.name,\n        ...(options.adapter.version === undefined ? {} : { version: options.adapter.version }),\n        durability: capabilities.durability,\n      }),\n      generatedAt,\n      tier1,\n      tier2,\n      tier3,\n      ok,\n      fullyCertified:\n        ok &&\n        capabilities.durability !== \"non-durable\" &&\n        tier3.status === \"exercised\" &&\n        tier3.cases.length > 0 &&\n        tier3.cases.every((result) => result.suite === \"real-loss\"),\n    });\n  });\n\n  return program.pipe(Effect.provide(environment));\n};\n"],"mappings":";;;;;;;;;;AAmJA,MAAa,0BAAgE;CAC3E;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;;AAYA,MAAa,4BAA4E;CACvF;CAKA;CAGA;CACA;CACA;CACA;AACF;;AAGA,MAAa,4BACX,UACmD;CACnD,MAAM,wBAAQ,IAAI,IAAqC;CAEvD,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,gBAAgB,MAAM,IAAI,IAAI,QAAQ;CAGhD,OAAO,gCAAgC,SAAS,QAAQ,aAAa,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK;AAClG;AAMA,MAAM,QAAQ,OAAO,WAAW,MAAM,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;AACtD,MAAM,UAAU,kBAAkB,KAAK;CAAE,OAAO;CAAO,OAAO;CAAO,OAAO;AAAM,CAAC;AAEnF,MAAM,uBAAuB;CAC3B,OAAO,IAAI,OAAO,EAAE;CACpB,OAAO,IAAI,OAAO,EAAE;CACpB,OAAO,IAAI,OAAO,EAAE;AACtB;AAEA,MAAM,gBAAgB,kBAAkB,KAAK;CAC3C,OAAO,OAAO,WAAW,MAAM,CAAC,CAAC,qBAAqB,KAAK;CAC3D,OAAO,OAAO,WAAW,MAAM,CAAC,CAAC,qBAAqB,KAAK;CAC3D,OAAO,OAAO,WAAW,MAAM,CAAC,CAAC,qBAAqB,KAAK;AAC7D,CAAC;AAED,MAAM,YAAY,OAAO,WAAW,SAAS,CAAC,CAAC,yBAAyB;AACxE,MAAM,iBAAiB,OAAO,WAAW,QAAQ;AACjD,MAAM,uBAAuB,OAAO,WAAW,cAAc;AAC7D,MAAM,mBAAmB,OAAO,WAAW,UAAU;AAErD,MAAM,QAAQ;CAAE,aAAa,CAAC;CAAG,cAAc,CAAC;AAAE;AAElD,MAAM,cAAc,SAA4D;CAC9E;EAAE,MAAM;EAAc,IAAI;CAAS;CACnC;EAAE,MAAM;EAAc,IAAI;EAAU,OAAO;CAAK;CAChD;EAAE,MAAM;EAAY,IAAI;CAAS;CACjC;EAAE,MAAM;EAAU,QAAQ;EAAQ;CAAM;AAC1C;AAEA,MAAM,gBAAgB,IAAY,MAAc,YAAiD;CAC/F,MAAM;CACN;CACA;CACA;CACA,kBAAkB;AACpB;AAEA,MAAM,YACJ,GAAG,UAC2C,CAC9C,GAAG,OACH;CAAE,MAAM;CAAU,QAAQ;CAAc;AAAM,CAChD;;;;;;;;;AAUA,MAAM,oBACJ,MACA,WACA,cAEA,MAAM,KACJ,YACA,MACA,MAAM,OACJ,cAAc,eACd,cAAc,KAAK;CACjB,oBAAoB,OAAO,QAAQ,CAAC,CAAC;CACrC,aAAa,YAAY;EACvB,MAAM,gBAAgB,QAAQ,OAAO,QAAQ,MAAM,YAAY,QAAQ,SAAS,MAAM;EAEtF,MAAM,QACJ,cAAc,KAAA,KAAa,gBAAgB,WAAW,SAAS,IAAI;EAErE,OAAO,OAAO,aAAa,KAAK;CAClC;AACF,CAAC,CACH,CACF;AAMF,MAAM,6BAA6B;AAEnC,MAAM,SAAS,YAAY,KAAK;CAC9B,UAAU;CACV,cAAc;CACd,aAAa;CACb,iBAAiB;AACnB,CAAC;AAED,MAAM,gBAAgB,OAAO,OAAO,EAAE,UAAU,OAAO,OAAO,CAAC;AAC/D,MAAM,eAAe,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,CAAC;;AAG5D,MAAM,kBAAkB,MAAM,KAAK,iBAAiB;CAClD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS,QAAQ;CACjB;AACF,CAAC;;AAGD,MAAM,OAAO,KAAK,KAAK,QAAQ;CAC7B,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,cAAc,OAAO,OAAO,CAAC;AACxD,CAAC;AAED,MAAM,cAAc,QAAQ,KAAK,IAAI;AAErC,MAAM,sBAAsB,MAAM,KAAK,qBAAqB;CAC1D,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS;CACT;AACF,CAAC;;AAGD,MAAM,YAAY,KAAK,KAAK,aAAa;CACvC,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,CAAC;CAC/C,SAAS;CACT,cAAc,CAAC,WAAW;AAC5B,CAAC;AAED,MAAM,mBAAmB,QAAQ,KAAK,SAAS;AAE/C,MAAM,kBAAkB,MAAM,KAAK,iBAAiB;CAClD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS;CACT;AACF,CAAC;;AAGD,MAAM,eAAe,KAAK,KAAK,QAAQ;CACrC,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,cAAc,OAAO,OAAO,CAAC;CACtD,eAAe;AACjB,CAAC;AAED,MAAM,kBAAkB,QAAQ,KAAK,YAAY;AAEjD,MAAM,qBAAqB,MAAM,KAAK,oBAAoB;CACxD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS;CACT;AACF,CAAC;;AAGD,MAAM,kBAAkB,MAAM,KAAK,iBAAiB;CAClD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS,QAAQ;CACjB,QAAQ,YAAY,KAAK;EACvB,UAAU;EACV,cAAc;EACd,aAAa;EACb,iBAAiB;CACnB,CAAC;AACH,CAAC;AAED,IAAM,0BAAN,cAAsC,OAAO,YAAqC,CAAC,CACjF,2BACA,EAAE,eAAe,OAAO,OAAO,CACjC,CAAC,CAAC,CAAC;AAEH,MAAM,qBAAqB,SAAS,OAAO,qBAAqB;CAC9D,aAAa;CACb,QAAQ;CACR,YAAY,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,CAAC;CAClD,SAAS,OAAO,OAAO,EAAE,SAAS,OAAO,OAAO,CAAC;CACjD,SAAS;CACT,eAAe,EAAE,YAAY,OAAO,QAAQ,EAAE,UAAU,YAAY,QAAQ,CAAC;CAC7E,gBAAgB,WAAW,OAAO,QAAQ,EAAE,SAAS,WAAW,OAAO,SAAS,CAAC;CACjF,QAAQ,eAAe,KAAK;EAC1B,aAAa;EACb,gBAAgB;EAChB,UAAU;EACV,cAAc;EACd,aAAa;CACf,CAAC;AACH,CAAC;AAED,MAAM,SAAS,KAAK,KAAK,UAAU;CACjC,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,CAAC;AACjD,CAAC;AAED,MAAM,wBAAwB,MAAM,KAAK,uBAAuB;CAC9D,OAAO,OAAO,OAAO,EAAE,SAAS,OAAO,OAAO,CAAC;CAC/C,QAAQ,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,CAAC;CAC/C,cAAc;CACd,SAAS,QAAQ,KAAK,mBAAmB,MAAM,MAAM;CACrD,QAAQ,YAAY,KAAK;EACvB,UAAU;EACV,cAAc;EACd,aAAa;EACb,iBAAiB;CACnB,CAAC;AACH,CAAC;AAED,MAAM,mBAAmB,YACvB,wBAAwB,KAAK,EAAE,eAAe,QAAQ,KAAK,CAAC;AAE9D,MAAM,gBAAgB,iBAAiB,YAAY;;AAGnD,MAAM,cAAc,MAAM,OACxB,aACA,OAAO,IAAI,aAAa;CACtB,MAAM,UAAU,OAAO,IAAI,KAAK,CAAC;CAEjC,MAAM,QAAW,QAA8B,WAC7C,IAAI,aAAa,UAAU,UAAU,QAAQ,CAAC,CAAC,CAAC,KAC9C,OAAO,KAAK,UAAU,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC,CACpD;CAEF,OAAO;EACL,cAAc,KAAK,gBAAgB,wBAAwB;EAC3D,WAAW,KAAK,OAAO,WAAW,KAAK,GAAG,qBAAqB;EAC/D,YAAY,KAAK,OAAO,WAAW,MAAM,GAAG,sBAAsB;CACpE;AACF,CAAC,CACH;AAEA,MAAM,oBAAoB,MAAM,SAAS,gCAAgC,WAAW;AAcpF,MAAM,oBAAoB,MAAc,cAA8C;CACpF;CACA,WAAW;CACX,gBAAgB,qBAAqB,eAAe,MAAM;CAC1D,aAAa;AACf;;AAGA,MAAM,uBACJ,YACA,UACA,SACsB;CACtB,MAAM,WAAW,eAAe,WAAW,MAAM;CAEjD,MAAM,SAAS,OAAO,IAAI,aAAa;EASrC,OAAO,CAAC,QANe,OAFA,oBAAA,CAEQ,OAC7B,EAAE,YAAY;GAAE,IAAI,WAAW;GAAI,OAAO,WAAW;EAAM,EAAE,GAC7D,EAAE,UAAU,WAAW,OAAO,GAC9B,iBAAiB,MAAM,QAAQ,CACjC,CAEe;CACjB,CAAC;CAED,OAAO;EACL,UAAU,CAAC,QAAQ;EACnB;EACA,aAAa,CAAC,QAAQ;CACxB;AACF;AAEA,MAAM,WAAW,OAAO,GAAG,wBAAwB,CAAC,CAAC,WACnD,UACA,MACA;CACA,QAAQ,UAAR;EACE,KAAK,SAAS;GACZ,MAAM,UAAU,MAAM,UACpB,iBACA,iBAAiB,iBAAiB,uBAAmB,CACvD;GAEA,MAAM,WAAW,OAAO,qBAAqB,KAAK,SAAS,OAAO;GAElE,OAAO,oBAAoB,iBAAiB,UAAU,IAAI;EAC5D;EACA,KAAK,kBAAkB;GACrB,MAAM,UAAU,MAAM,UACpB,qBACA,iBACE,qBACA,2BACA,SAAS,aAAa,UAAU,QAAQ,EAAE,KAAK,KAAK,OAAO,CAAC,CAAC,CAC/D,CACF;GAEA,MAAM,YAAY,YAAY,QAAQ,EACpC,OAAO,EAAE,UAAU,OAAO,QAAQ,EAAE,cAAc,aAAa,MAAM,CAAC,EACxE,CAAC;GAED,MAAM,WAAW,OAAO,qBAAqB,KAAK,SAAS,OAAO,CAAC,CAAC,KAClE,OAAO,QAAQ,SAAS,CAC1B;GAEA,OAAO,oBAAoB,qBAAqB,UAAU,IAAI;EAChE;EACA,KAAK,iBAAiB;GACpB,MAAM,UAAU,MAAM,UACpB,iBACA,iBACE,iBACA,6BACA,SAAS,aAAa,eAAe,aAAa,EAAE,KAAK,QAAQ,OAAO,CAAC,CAAC,CAC5E,CACF;GAEA,MAAM,YAAY,iBAAiB,QAAQ,EACzC,YAAY,EAAE,UACZ,OAAO,IAAI,aAAa;IACtB,MAAM,OAAO,OAAO;IAcpB,OAAO,EAAE,OAAO,GAAG,OAZG,KAAK,GACzB,kBACA,OAAO,QACP,OAAO,QAAQ,UAAU,KAAK,CAChC,EAQ0B,GAAG,OANN,KAAK,GAC1B,mBACA,OAAO,QACP,OAAO,QAAQ,WAAW,KAAK,CACjC,IAEuC;GACzC,CAAC,EACL,CAAC;GAED,MAAM,WAAW,OAAO,qBAAqB,KAAK,SAAS,OAAO,CAAC,CAAC,KAClE,OAAO,QAAQ,SAAS,CAC1B;GAEA,OAAO,oBAAoB,iBAAiB,UAAU,IAAI;EAC5D;EACA,KAAK,YAAY;GACf,MAAM,UAAU,MAAM,UACpB,oBACA,iBACE,oBACA,6BACA,SAAS,aAAa,UAAU,QAAQ,EAAE,KAAK,KAAK,OAAO,CAAC,CAAC,CAC/D,CACF;GAEA,MAAM,YAAY,gBAAgB,QAAQ,EACxC,OAAO,EAAE,UAAU,OAAO,QAAQ,EAAE,cAAc,aAAa,MAAM,CAAC,EACxE,CAAC;GAED,MAAM,WAAW,OAAO,qBAAqB,KAAK,SAAS,OAAO,CAAC,CAAC,KAClE,OAAO,QAAQ,SAAS,CAC1B;GAEA,OAAO,oBAAoB,oBAAoB,UAAU,IAAI;EAC/D;EACA,KAAK,QAAQ;GACX,MAAM,UAAU,MAAM,UACpB,iBACA,iBAAiB,gBAAgB,8BAA0B,CAC7D;GAEA,MAAM,WAAW,OAAO,qBAAqB,KAAK,SAAS,OAAO;GAClE,MAAM,WAAW,eAAe,WAAW,MAAM;GAEjD,MAAM,YAAY,OAAO,GAAG,yBAAyB,CAAC,CAAC,WACrD,KACA,UACA;IAGA,OAAO,QAAO,OAFS,oBAAA,CAED,OACpB,EAAE,YAAY;KAAE,IAAI,gBAAgB;KAAI,OAAO,gBAAgB;IAAM,EAAE,GACvE,EAAE,SAAS,GACX;KACE;KACA,WAAW;KACX,gBAAgB,qBAAqB,GAAG;KACxC,aAAa;IACf,CACF;GACF,CAAC;GAaD,OAAO;IAVL,UAAU,CAAC,QAAQ;IACnB,QAAQ,OAAO,IAAI,aAAa;KAI9B,OAAO,CAAC,OAHY,UAAU,eAAe,KAAK,QAAQ,eAAe,GAG3D,OAFQ,UAAU,eAAe,KAAK,UAAU,iBAAiB,CAE3D;IACtB,CAAC;IACD,aAAa,CAAC,QAAQ;GAGd;EACZ;EACA,KAAK,cAAc;GACjB,MAAM,eAAe,MAAM,UACzB,iBACA,iBAAiB,iBAAiB,+BAA2B,CAC/D;GAEA,MAAM,gBAAgB,MAAM,UAC1B,uBACA,iBACE,kBACA,yBACA,SACE,aAAa,cAAc,qBAAqB,EAAE,OAAO,QAAQ,CAAC,GAClE,aAAa,YAAY,UAAU,EAAE,KAAK,SAAS,CAAC,CACtD,CACF,CACF;GAEA,MAAM,kBAAkB,gBAAgB,MAAM,oBAAoB,cAAc;IAC9E;IACA,SAAS,EAAE,eAAe,qBAAqB;GACjD,CAAC,CAAC,CAAC,KAAK,MAAM,QAAQ,iBAAiB,CAAC;GAExC,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC,QAAQ,EAC/C,SAAS,EAAE,UAAU,OAAO,QAAQ,EAAE,OAAO,SAAS,MAAM,CAAC,EAC/D,CAAC;GAED,MAAM,iBAAiB,OAAO,qBAAqB,KAAK,eAAe,OAAO,CAAC,CAAC,KAC9E,OAAO,QAAQ,MAAM,SAAS,iBAAiB,WAAW,CAAC,CAC7D;GAEA,MAAM,gBAAgB,OAAO,qBAAqB,KAAK,cAAc,aAAa;GAClF,MAAM,WAAW,eAAe,WAAW,MAAM;GAwBjD,OAAO;IArBL,UAAU,CAAC,gBAAgB,aAAa;IACxC,QAAQ,OAAO,IAAI,aAAa;KAS9B,OAAO,CAAC,QANe,OAFA,oBAAA,CAEQ,OAC7B,EAAE,YAAY;MAAE,IAAI,sBAAsB;MAAI,OAAO,sBAAsB;KAAM,EAAE,GACnF,EAAE,SAAS,OAAO,GAClB,iBAAiB,MAAM,QAAQ,CACjC,CAEe;IACjB,CAAC;IACD,QAAQ,aAAa;KACnB,MAAM,SAAS,SAAS,GAAG,CAAC;KAE5B,OAAO,WAAW,KAAA,IACd,CAAC,QAAQ,IACT,CAAC,UAAU,iBAAiB,OAAO,cAAc,aAAa,CAAC;IACrE;GAGQ;EACZ;CACF;AACF,CAAC;;AAGD,MAAM,qBAAqB;;;;;;;AAQ3B,MAAM,aAAa,OAAO,GAAG,0BAA0B,CAAC,CAAC,WACvD,MACA,gBACA;CACA,MAAM,QAAQ,OAAO;CACrB,MAAM,SAAS,OAAO;CACtB,MAAM,WAAW,OAAO,MAAM,OAAO,oBAAoB,KAAK,EAAE,UAAU,KAAK,CAAC,CAAC;CACjF,MAAM,uBAAO,IAAI,IAAsC;CACvD,MAAM,cAAc,OAAO,OAAO,WAAW,OAAO,eAAe;CAEnE,KAAK,MAAM,cAAc,aACvB,IAAI,WAAW,aAAa,MAAM,KAAK,IAAI,WAAW,cAAc,UAAU;CAEhF,MAAM,wBAAQ,IAAI,IAAkB;CAEpC,KAAK,MAAM,YAAY,SAAS,SAAS;EACvC,MAAM,UAAU,SAAS,OAAO;EAEhC,IACE,QAAQ,SAAS,uBACjB,QAAQ,SAAS,uBACjB,QAAQ,SAAS,kBAEb;OAAA,QAAQ,iBAAiB,KAAA,GAAW,MAAM,IAAI,QAAQ,YAAY;EAAA;CAE1E;CACA,KAAK,MAAM,gBAAgB,OAAO;EAChC,IAAI,KAAK,IAAI,YAAY,GAAG;EAC5B,MAAM,QAAQ,OAAO,OAAO,OAAO,qBAAqB,KAAK,EAAE,aAAa,CAAC,CAAC;EAE9E,IAAI,OAAO,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,MACnD,KAAK,IAAI,cAAc,MAAM,KAAK;CAEtC;CAEA,MAAM,aACJ,MAAM,gBAAgB,KAAA,IAClB,OAAO,KAAK,IACZ,OAAO,MAAM,YAAY,KAAK,sBAAsB,KAAK,EAAE,UAAU,KAAK,CAAC,CAAC;CAElF,OAAO,OAAO,uBAAuB;EACnC,QAAQ;EACR,aAAa,CAAC,GAAG,KAAK,OAAO,CAAC;EAC9B;EACA,YAAY,OAAO,eAAe,UAAU;EAC5C,sBAAsB,MAAM,gBAAgB,KAAA;EAC5C,mBAAmB;CACrB,CAAC;AACH,CAAC;AAED,MAAM,gBAAmB,UAAkC;CACzD,MAAM,UAAU,MAAM,gBAAgB,KAAK;CAE3C,IAAI,OAAO,OAAO,OAAO,GAAG;EAC1B,MAAM,QAAiB,QAAQ;EAE/B,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,OAC3D,OAAO,OAAO,MAAM,IAAI;EAG1B,OAAO,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,GAAG;CACnC;CAEA,OAAO;AACT;;AAGA,MAAM,eAAe,OAAO,GAAG,4BAA4B,CAAC,CAAC,WAC3D,UACA,UACA,gBACA,cACA;CACA,MAAM,SAAS,OAAO;CACtB,MAAM,UAAU,OAAO;CACvB,MAAM,OAAO,GAAG,SAAS,GAAG,SAAS,WAAW,KAAK,GAAG;CAExD,MAAM,UAAU,QAAgB,UAC9B,yBAAyB,KAAK;EAC5B;EACA;EACA,gBAAgB;EAChB,QAAQ;EACR,qBAAqB;EACrB,QAAQ,OAAO,MAAM,GAAG,IAAK;CAC/B,CAAC;CAEH,MAAM,OAAO,OAAO,SAAS,UAAU,IAAI;CAE3C,MAAM,UAAU,OAAO,oBAAoB,KACzC,OAAO,QACL,oBAAoB,kBAAkB,KAAK,QAAQ,CAAC,CAAC,KACnD,MAAM,QAAQ,qBAAqB,QAAQ,CAC7C,CACF,CACF;CAEA,MAAM,SAAS,KAAK,OAAO,KAAK,OAAO,eAAe,qBAAqB,OAAO,CAAC;CAInF,MAAM,QAAQ,OAAO,IAAI,KAAK,KAAK;CAEnC,OAAO,QAAQ,YAAY,QACzB,QAAQ,WACJ,OAAO,OACP,IAAI,UAAU,OAAO,IAAI,CAAC,CAAC,KACzB,OAAO,SAAS,YACd,UACI,OAAO,OACP,OAAO,KAAK,6BAA6B,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC,CACtE,CACF,CACN;CAGA,IAAI;CACJ,MAAM,cAAc,OAAO,OAAO,KAAK,MAAM;CAE7C,IAAI,KAAK,UAAU,WAAW,GAC5B,WAAW,YAAY;MAClB;EACL,MAAM,eAAe,OAAO,OAAO,KAAK,MAAM;EAE9C,IAAI,KAAK,UAAU,YAAY,GAAG;GAChC,OAAO,QAAQ;GAEf,OAAO,OACL,sCAAsC,aAAa,aAAa,KAAK,KACrE,OAAO,IAAI,IAAI,KAAK,CACtB;EACF;EACA,WAAW,aAAa;CAC1B;CACA,MAAM,QAAQ,KAAK,MAAM,QAAQ;CAEjC,MAAM,aAAa,SAAmB,QAAQ,sBAAsB,IAAI;CAExE,MAAM,aAAa,OAAO,IAAI,aAAa;EACzC,KAAK,MAAM,WAAW,UAAU;GAC9B,MAAM,WAAW,OAAO,OAAO,OAC7B,qBAAqB,KAAK,EAAE,cAAc,QAAQ,aAAa,CAAC,CAClE;GAEA,IAAI,OAAO,OAAO,QAAQ,KAAK,SAAS,MAAM,UAAU,WAAW,OAAO;EAC5E;EAEA,OAAO;CACT,CAAC;CAID,IAAI,YAAY;CAEhB,KAAK,IAAI,QAAQ,GAAG,QAAQ,sBAAsB,CAAC,WAAW,SAAS;EAGrE,OAAO,UAAU,OAAO,YAAY;EACpC,OAAO,OAAO,KAAK,QAAQ,WAAW;EACtC,KAAK,MAAM,QAAQ,OACjB,OAAO,OAAO,KAAK,UAAU,IAAI,CAAC;EAEpC,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,WAAW,OAAO,OAAO,KAAK,QAAQ,cAAc,IAAI,CAAC;GAE/D,IAAI,KAAK,UAAU,QAAQ,GAAG;GAC9B,KAAK,MAAM,eAAe,SAAS,OAAO;IACxC,KAAK,MAAM,WAAW,YAAY,SAAS,cAAc;KACvD,IAAI,QAAQ,UAAU;KACtB,OAAO,OAAO,KACZ,QAAQ,eACN,yBAAyB,KAAK;MAC5B,cAAc,YAAY,WAAW;MACrC,YAAY,QAAQ;MACpB,QAAQ;MACR,QAAQ,oCAAoC;MAC5C,YAAY,sBAAsB,KAAK;KACzC,CAAC,CACH,CACF;IACF;IACA,KAAK,MAAM,WAAW,YAAY,SAAS,kBAAkB;KAK3D,IAJgB,YAAY,SAAS,kBAAkB,MACpD,aAAa,SAAS,eAAe,QAAQ,UAGtC,GAAG;KACb,OAAO,OAAO,KACZ,QAAQ,gBACN,wBAAwB,KAAK;MAC3B,cAAc,YAAY,WAAW;MACrC,YAAY,QAAQ;MACpB,UAAU;MACV,UAAU;MACV,QAAQ,oCAAoC;KAC9C,CAAC,CACH,CACF;IACF;GACF;EACF;EACA,MAAM,UAAU,OAAO,OAAO,KAAK,UAAU;EAE7C,YAAY,KAAK,UAAU,OAAO,KAAK,QAAQ;CACjD;CACA,OAAO,QAAQ;CACf,MAAM,WAAW,OAAO,IAAI,IAAI,KAAK;CAErC,IAAI,CAAC,WACH,OAAO,OAAO,2BAA2B,mBAAmB,mBAAmB,QAAQ;CAIzF,IAAI,sBAAsB;CAC1B,MAAM,eAA8B,CAAC;CAErC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,OAAO,OAAO,KAAK,WAAW,MAAM,cAAc,CAAC;EAEnE,IAAI,KAAK,UAAU,OAAO,GACxB,OAAO,OAAO,QAAQ,KAAK,0BAA0B,aAAa,QAAQ,KAAK,KAAK,QAAQ;EAE9F,KAAK,MAAM,SAAS,QAAQ,MAAM,QAAQ;GACxC,IAAI,MAAM,WAAW,UACnB,aAAa,KACX,GAAG,KAAK,GAAG,MAAM,OAAO,MAAM,WAAW,KAAA,IAAY,KAAK,KAAK,MAAM,OAAO,IAC9E;GAEF,IAAI,MAAM,SAAS,kBAAkB,MAAM,WAAW,UACpD,sBAAsB;EAE1B;CACF;CACA,IAAI,aAAa,SAAS,KAAK,CAAC,qBAC9B,OAAO,OACL,aAAa,SAAS,IAClB,4BAA4B,aAAa,KAAK,IAAI,MAClD,6CACJ,QACF;CAGF,OAAO,yBAAyB,KAAK;EACnC;EACA;EACA,gBAAgB;EAChB,QAAQ,WAAW,cAAc;EACjC;CACF,CAAC;AACH,CAAC;;;;;;;AAYD,MAAa,mBAAmB,OAAO,GAAG,gCAAgC,CAAC,CAAC,WAC1E,YACA,SAIuD;CACvD,IAAI,eAAe,eACjB,OAAO,6BAA6B,KAAK;EACvC,QAAQ;EACR,UAAU,CAAC;EACX,OAAO,CAAC;EACR,QACE;CACJ,CAAC;CAEH,IAAI,QAAQ,eAAe,KAAA,GAAW;EACpC,MAAM,QAAQ,OAAO,QAAQ;EAE7B,OAAO,6BAA6B,KAAK;GACvC,QAAQ,MAAM,WAAW,IAAI,kBAAkB;GAC/C,UAAU,QAAQ,qBAAqB,CAAC;GACxC;GACA,GAAI,MAAM,WAAW,IACjB,EAAE,QAAQ,uDAAuD,IACjE,CAAC;EACP,CAAC;CACH;CACA,IAAI,QAAQ,sBAAsB,KAAA,KAAa,QAAQ,kBAAkB,SAAS,GAChF,OAAO,6BAA6B,KAAK;EACvC,QAAQ;EACR,UAAU,QAAQ;EAClB,OAAO,CAAC;CACV,CAAC;CAGH,OAAO,6BAA6B,KAAK;EACvC,QAAQ;EACR,UAAU,CAAC;EACX,OAAO,CAAC;EACR,QACE;CACJ,CAAC;AACH,CAAC;AAMD,MAAM,SAAsC,OAAO,IAAI,MAAM,oBAAoB,WAC/E,SAAS,MAAM,SAAS,WAAW,MAAM,CAAC,CAC5C;;;;;;;;AASA,MAAa,0BACX,YACwE;CACxE,MAAM,iCAAiB,IAAI,IAAyB;CAKpD,MAAM,iBAAiB,MAAM,OAAO,WAAW,CAAC,CAC9C,OAAO,IAAI,aAAa;EACtB,MAAM,QAAQ,OAAO;EAErB,OAAO,YAAY,GAAG;GACpB,GAAG;GACH,SAAS,YACP,OAAO,WAAW;IAChB,eAAe,IAAI,QAAQ,MAAM,SAAS,QAAQ,MAAM,UAAU;GACpE,CAAC,CAAC,CAAC,KAAK,OAAO,QAAQ,MAAM,OAAO,OAAO,CAAC,CAAC;EACjD,CAAC;CACH,CAAC,CACH,CAAC,CAAC,KAAK,MAAM,QAAQ,QAAQ,WAAW,CAAC;CAIzC,MAAM,cAAc,MAAM,SACxB,QAAQ,kBACR,gBACA,QAAQ,iBAAiB,cAAc,WACvC,mCAAmC,OACnC,eAAe,WACf,qBAAqB,MAAM;EACzB,cAAc,OAAO,WAAW,YAAY,CAAC,CAAC,0BAA0B;EACxE,YAAY,OAAO,WAAW,UAAU,CAAC,CAAC,wBAAwB;EAClE,wBAAwB,SAAS,OAAO,EAAE;EAC1C,sBAAsB,SAAS,QAAQ,CAAC;EACxC,mBAAmB,SAAS,OAAO,EAAE;CACvC,CAAC,CACH;CAEA,MAAM,eAAe,SAAS,OAC5B,SAAS,SAAS,QAAQ,0BAA0B,gCAAgC,IAAI,GAC1F;CAiDA,OA/CgB,OAAO,IAAI,aAAa;EACtC,MAAM,SAAS,OAAO;EAGtB,MAAM,QAAyC,CAAC;EAEhD,KAAK,MAAM,YAAY,yBACrB,KAAK,MAAM,YAAY,gCAAgC,UACrD,MAAM,KAAK,OAAO,aAAa,UAAU,UAAU,gBAAgB,YAAY,CAAC;EAKpF,MAAM,QAAQ,OAAO,aAAa;EAGlC,MAAM,eAAe,OAAO,OAAO;EACnC,MAAM,QAAQ,OAAO,iBAAiB,aAAa,YAAY,OAAO;EAEtE,MAAM,cAAc,OAAO;EAE3B,MAAM,KACJ,MAAM,OAAO,WAAW,OAAO,WAAW,QAAQ,KAClD,MAAM,OAAO,WAAW,OAAO,WAAW,QAAQ,KAClD,MAAM,MAAM,OAAO,WAAW,OAAO,WAAW,QAAQ;EAE1D,OAAO,oBAAoB,KAAK;GAC9B,QAAQ;GACR,SAAS,yBAAyB,KAAK;IACrC,MAAM,QAAQ,QAAQ;IACtB,GAAI,QAAQ,QAAQ,YAAY,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS,QAAQ,QAAQ,QAAQ;IACpF,YAAY,aAAa;GAC3B,CAAC;GACD;GACA;GACA;GACA;GACA;GACA,gBACE,MACA,aAAa,eAAe,iBAC5B,MAAM,WAAW,eACjB,MAAM,MAAM,SAAS,KACrB,MAAM,MAAM,OAAO,WAAW,OAAO,UAAU,WAAW;EAC9D,CAAC;CACH,CAEa,CAAC,CAAC,KAAK,OAAO,QAAQ,WAAW,CAAC;AACjD"}

package/dist/chaos.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"chaos.mjs","names":[],"sources":["../src/chaos.ts"],"sourcesContent":["import {\n  Subagent,\n  SubagentPolicy,\n  SubagentReservationsMemoryLive,\n  SubagentRuntime,\n} from \"@effect-agent/capabilities\";\nimport {\n  Agent,\n  AgentPolicy,\n  ThreadId,\n  IdGenerator,\n  RunId,\n  ToolCallId,\n  TurnId,\n  type SubmissionId,\n} from \"@effect-agent/core\";\nimport {\n  DurableStep,\n  DurableStepError,\n  RunToolAuthorization,\n  ToolExecutionClass,\n} from \"@effect-agent/engine\";\nimport {\n  AbortCommand,\n  ApprovalDecisionCommand,\n  ThreadExportRequest,\n  ThreadStore,\n  DefinitionDigests,\n  Digest,\n  DurableAgentRuntime,\n  DurableRuntimeConfig,\n  DurableRuntimeFailpointError,\n  DurableRuntimeFailpointLocation,\n  DurableWorkerBinding,\n  IdempotencyKey,\n  ObligationThresholds,\n  Principal,\n  ResolutionAbortSubmission,\n  ResolutionCompletedWithResult,\n  ResolutionNeverHappened,\n  SubmissionLedger,\n  SubmissionLookupById,\n  UnknownResolutionCommand,\n  childThreadIdFor,\n  verifyThreadInvariants,\n  type CanonicalRecordEnvelope,\n  type BatchId,\n  type DurableBindingFailure,\n  type DurableSubmitFailure,\n  type DurableWorkerFailure,\n  type ProducerId,\n  type Receipt,\n  type ResolvedBinding,\n  type Settlement,\n  type SubmissionSnapshot,\n  type UnknownResolution,\n} from \"@effect-agent/thread\";\nimport { DurableRuntimeFailpointTestControl } from \"@effect-agent/thread/testing\";\nimport { Cause, Effect, Exit, Layer, Option, Ref, Schema, Stream } from \"effect\";\nimport { FastCheck } from \"effect/testing\";\nimport {\n  LanguageModel,\n  Model,\n  Tool,\n  Toolkit,\n  type Prompt,\n  type Response,\n} from \"effect/unstable/ai\";\n\n/**\n * P7 WP4 chaos machinery (plan §5): a Schema-first `ChaosPlan`, a seeded generator over\n * `effect/testing/FastCheck` (already inside the pinned Effect — no new dependency), and a\n * deterministic runner that drives the durable coordinator over whatever adapter pair the test\n * provides. Every plan ends in the SAME claims the crash matrices make:\n *\n * 1. `verifyThreadInvariants` in convergence mode over every touched Thread (the\n *    shared WP1 checker — one set of claims for admin verify, certification, chaos, and soak);\n * 2. `scanObligations` returning ZERO entries (everything settled; nothing invisibly stuck);\n * 3. supplier non-fabrication wherever the deterministic desk was in play (durability §10: no\n *    canonical Tool success exists that the external store did not actually produce).\n *\n * Replay contract: the memory/SQLite chaos tests derive every plan from one root seed\n * (`CHAOS_SEED` env override; see `chaosSeedFromEnv`) and print that seed plus the failing\n * plan's own seed in the failure output, so any red run is replayable byte-for-byte.\n */\n\n// ---------------------------------------------------------------------------\n// ChaosPlan schema\n// ---------------------------------------------------------------------------\n\n/** The six durable scenario flavors a chaos lane can exercise (plan §5). */\nexport const ChaosScenarioKind = Schema.Literals([\n  \"plain\",\n  \"uncertain-tool\",\n  \"durable-steps\",\n  \"approval\",\n  \"join\",\n  \"delegation\",\n]);\n\nexport type ChaosScenarioKind = typeof ChaosScenarioKind.Type;\n\nconst LaneIndex = Schema.Int.check(Schema.isGreaterThanOrEqualTo(0), Schema.isLessThanOrEqualTo(7));\n\n/** One Submission of a plan: which lane it queues into and that lane's scenario flavor. */\nexport class ChaosSubmissionSpec extends Schema.Class<ChaosSubmissionSpec>(\n  \"@effect-agent/testing/ChaosSubmissionSpec\",\n)({\n  lane: LaneIndex,\n  /** The lane's flavor; the FIRST spec of a lane fixes the lane's agent. */\n  kind: ChaosScenarioKind,\n}) {}\n\n/** How the runner resolves a durable Unknown Outcome it encounters (DUR-017 driver). */\nexport const ChaosResolutionKind = Schema.Literals([\n  /** The call provably never started: the batch resumes and executes it. */\n  \"never-happened\",\n  /**\n   * Recovered supplier truth: resolve with the EXACT value the desk produced. Falls back to\n   * `never-happened` when the desk holds no value for the call, so the runner never fabricates.\n   */\n  \"completed-from-supplier\",\n  /** Unresolvable: route into the abort path (settles aborted, audit retained). */\n  \"abort-submission\",\n]);\n\nexport type ChaosResolutionKind = typeof ChaosResolutionKind.Type;\n\nexport const ChaosApprovalDecision = Schema.Literals([\"approved\", \"denied\"]);\nexport type ChaosApprovalDecision = typeof ChaosApprovalDecision.Type;\n\nconst BoundedAdapterArm = Schema.String.check(Schema.isMaxLength(128));\n\n/**\n * One seeded chaos plan (plan §5): the full fault schedule is data, so a failing run replays\n * from the plan alone. `failpointArms` are coordinator locations; `adapterArms` are\n * adapter-owned location names the adapter test validates (the memory runner has none).\n */\nexport class ChaosPlan extends Schema.Class<ChaosPlan>(\"@effect-agent/testing/ChaosPlan\")({\n  /** Identifies this plan in failure output; derived from the root seed plus the plan index. */\n  seed: Schema.Int,\n  /** Lane count; submissions address lanes `0..lanes-1`. */\n  lanes: Schema.Int.check(Schema.isGreaterThanOrEqualTo(1), Schema.isLessThanOrEqualTo(8)),\n  submissions: Schema.NonEmptyArray(ChaosSubmissionSpec),\n  /** Coordinator failpoint arms, consumed one per round (each fails every hit that round). */\n  failpointArms: Schema.Array(DurableRuntimeFailpointLocation),\n  /** Adapter-owned failpoint arms (e.g. SQLite `ledger:*`/`append:*` locations). */\n  adapterArms: Schema.Array(BoundedAdapterArm),\n  /** Flattened submission indices to abort mid-plan (modulo the submission count). */\n  abortInjections: Schema.Array(Schema.Int.check(Schema.isGreaterThanOrEqualTo(0))),\n  /** Resolution choices for Unknown Outcomes, indexed deterministically per open call. */\n  resolutionInjections: Schema.Array(ChaosResolutionKind),\n  /** Approval decisions for suspended approval lanes, indexed deterministically per call. */\n  approvalDecisions: Schema.Array(ChaosApprovalDecision),\n}) {}\n\n/** Per-lane verification result inside a plan report. */\nexport class ChaosLaneReport extends Schema.Class<ChaosLaneReport>(\n  \"@effect-agent/testing/ChaosLaneReport\",\n)({\n  threadId: ThreadId,\n  kind: ChaosScenarioKind,\n  submissionCount: Schema.Int.check(Schema.isGreaterThanOrEqualTo(0)),\n  /** Verdict of `verifyThreadInvariants` in convergence mode. */\n  verified: Schema.Boolean,\n}) {}\n\n/** The Schema-first outcome of one executed chaos plan. */\nexport class ChaosPlanReport extends Schema.Class<ChaosPlanReport>(\n  \"@effect-agent/testing/ChaosPlanReport\",\n)({\n  seed: Schema.Int,\n  rounds: Schema.Int.check(Schema.isGreaterThanOrEqualTo(0)),\n  lanes: Schema.Array(ChaosLaneReport),\n  /** `scanObligations` entries after convergence — MUST be zero. */\n  openObligations: Schema.Int.check(Schema.isGreaterThanOrEqualTo(0)),\n}) {}\n\n/** Typed convergence/verification failure of one chaos plan (never a bare defect). */\nexport class ChaosConvergenceFailure extends Schema.TaggedError<ChaosConvergenceFailure>()(\n  \"ChaosConvergenceFailure\",\n  {\n    seed: Schema.Int,\n    message: Schema.String.check(Schema.isMaxLength(16_384)),\n  },\n) {}\n\n// ---------------------------------------------------------------------------\n// Seeded generation\n// ---------------------------------------------------------------------------\n\n/** Default root seed for chaos suites; override with the `CHAOS_SEED` environment variable. */\nexport const DEFAULT_CHAOS_SEED = 20260813;\n\nconst ChaosSeedFromEnvironment = Schema.FiniteFromString.check(Schema.isInt());\nconst decodeChaosSeedFromEnvironment = Schema.decodeUnknownOption(ChaosSeedFromEnvironment);\n\n/** The root seed for this run: `CHAOS_SEED` when set to an integer, the default otherwise. */\nexport const chaosSeedFromEnv = (env: Record<string, string | undefined>): number => {\n  const raw = env[\"CHAOS_SEED\"];\n\n  if (raw === undefined || raw === \"\") return DEFAULT_CHAOS_SEED;\n\n  return Option.getOrElse(decodeChaosSeedFromEnvironment(raw), () => DEFAULT_CHAOS_SEED);\n};\n\nexport interface ChaosGeneratorOptions {\n  /** Root seed (print this in failure output for replay). */\n  readonly seed: number;\n  /** How many plans to derive. */\n  readonly count: number;\n  /** Adapter failpoint location names available to arm (empty for memory). */\n  readonly adapterArms?: ReadonlyArray<string> | undefined;\n}\n\ninterface GeneratedLane {\n  readonly kind: ChaosScenarioKind;\n  readonly depth: number;\n}\n\nconst laneArbitrary: FastCheck.Arbitrary<GeneratedLane> = FastCheck.constantFrom<ChaosScenarioKind>(\n  \"plain\",\n  \"uncertain-tool\",\n  \"durable-steps\",\n  \"approval\",\n  \"join\",\n  \"delegation\",\n).chain((kind): FastCheck.Arbitrary<GeneratedLane> =>\n  kind === \"join\"\n    ? FastCheck.integer({ min: 2, max: 3 }).map((depth): GeneratedLane => ({ kind, depth }))\n    : kind === \"plain\"\n      ? FastCheck.integer({ min: 1, max: 2 }).map((depth): GeneratedLane => ({ kind, depth }))\n      : FastCheck.constant<GeneratedLane>({ kind, depth: 1 }),\n);\n\ninterface ChaosPlanShape {\n  readonly lanes: number;\n  readonly submissions: readonly [ChaosSubmissionSpec, ...Array<ChaosSubmissionSpec>];\n  readonly failpointArms: ReadonlyArray<DurableRuntimeFailpointLocation>;\n  readonly adapterArms: ReadonlyArray<string>;\n  readonly abortInjections: ReadonlyArray<number>;\n  readonly resolutionInjections: ReadonlyArray<ChaosResolutionKind>;\n  readonly approvalDecisions: ReadonlyArray<ChaosApprovalDecision>;\n}\n\nconst planShapeArbitrary = (\n  adapterArms: ReadonlyArray<string>,\n): FastCheck.Arbitrary<ChaosPlanShape> =>\n  FastCheck.record({\n    lanes: FastCheck.array(laneArbitrary, { minLength: 1, maxLength: 3 }),\n    failpointArms: FastCheck.uniqueArray(\n      FastCheck.constantFrom(...DurableRuntimeFailpointLocation.literals),\n      { maxLength: 3 },\n    ),\n    adapterArms:\n      adapterArms.length === 0\n        ? FastCheck.constant<Array<string>>([])\n        : FastCheck.uniqueArray(FastCheck.constantFrom(...adapterArms), { maxLength: 2 }),\n    abortInjections: FastCheck.uniqueArray(FastCheck.integer({ min: 0, max: 15 }), {\n      maxLength: 2,\n    }),\n    resolutionInjections: FastCheck.array(\n      FastCheck.constantFrom<ChaosResolutionKind>(\n        \"never-happened\",\n        \"completed-from-supplier\",\n        \"abort-submission\",\n      ),\n      { maxLength: 4 },\n    ),\n    approvalDecisions: FastCheck.array(\n      FastCheck.constantFrom<ChaosApprovalDecision>(\"approved\", \"denied\"),\n      { maxLength: 2 },\n    ),\n  }).map((shape) => {\n    const submissions = shape.lanes.flatMap((lane, index) =>\n      Array.from({ length: lane.depth }, () =>\n        ChaosSubmissionSpec.make({ lane: index, kind: lane.kind }),\n      ),\n    );\n\n    const [first, ...rest] = submissions;\n\n    // `lanes` >= 1 and every lane has depth >= 1, so `first` always exists.\n    if (first === undefined) throw new Error(\"chaos generator produced an empty plan\");\n\n    return {\n      lanes: shape.lanes.length,\n      submissions: [first, ...rest] as const,\n      failpointArms: shape.failpointArms,\n      adapterArms: shape.adapterArms,\n      abortInjections: shape.abortInjections,\n      resolutionInjections: shape.resolutionInjections,\n      approvalDecisions: shape.approvalDecisions,\n    };\n  });\n\n/**\n * Derive `count` chaos plans deterministically from one root seed. The same\n * `{seed, count, adapterArms}` triple always yields byte-identical plans, so a failure line\n * `CHAOS_SEED=<seed>` replays the exact schedule.\n */\nexport const generateChaosPlans = (options: ChaosGeneratorOptions): ReadonlyArray<ChaosPlan> => {\n  const sampled = FastCheck.sample(planShapeArbitrary(options.adapterArms ?? []), {\n    seed: options.seed,\n    numRuns: options.count,\n  });\n\n  return sampled.map((shape, index) =>\n    ChaosPlan.make({ ...shape, seed: (Math.imul(options.seed, 31) + index) | 0 }),\n  );\n};\n\n/** Deterministic PRNG for the runner's small ordering choices (lane drive order). */\nconst mulberry32 = (seed: number): (() => number) => {\n  let state = seed | 0;\n\n  return () => {\n    state = (state + 0x6d2b79f5) | 0;\n    let t = Math.imul(state ^ (state >>> 15), 1 | state);\n\n    t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;\n\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n  };\n};\n\n// ---------------------------------------------------------------------------\n// Lane fixtures (agents, scripted models, deterministic desk)\n// ---------------------------------------------------------------------------\n\nconst usage = { inputTokens: {}, outputTokens: {} };\n\nconst finalParts = (text: string): ReadonlyArray<Response.StreamPartEncoded> => [\n  { type: \"text-start\", id: \"answer\" },\n  { type: \"text-delta\", id: \"answer\", delta: text },\n  { type: \"text-end\", id: \"answer\" },\n  { type: \"finish\", reason: \"stop\", usage },\n];\n\nconst toolTurn = (\n  ...calls: ReadonlyArray<Response.StreamPartEncoded>\n): ReadonlyArray<Response.StreamPartEncoded> => [\n  ...calls,\n  { type: \"finish\", reason: \"tool-calls\", usage },\n];\n\nconst toolCallPart = (id: string, name: string, params: unknown): Response.StreamPartEncoded => ({\n  type: \"tool-call\",\n  id,\n  name,\n  params,\n  providerExecuted: false,\n});\n\n/**\n * Prompt-shaped scripted model: the response depends ONLY on the request prompt, so it stays\n * deterministic across Attempt re-invocations, batch resumes, and joined steering — no counter\n * to drift when chaos re-enters a Turn.\n */\nconst promptScriptedModel = (\n  label: string,\n  script: (prompt: Prompt.Prompt) => ReadonlyArray<Response.StreamPartEncoded>,\n) =>\n  Model.make(\n    \"scripted\",\n    label,\n    Layer.effect(\n      LanguageModel.LanguageModel,\n      LanguageModel.make({\n        generateText: () => Effect.succeed([]),\n        streamText: (request) => Stream.fromIterable(script(request.prompt)),\n      }),\n    ),\n  );\n\nconst lastRole = (prompt: Prompt.Prompt): string | undefined => prompt.content.at(-1)?.role;\n\nconst policy = AgentPolicy.make({\n  maxTurns: 3,\n  maxToolCalls: 4,\n  maxDuration: \"30 seconds\",\n  toolConcurrency: 2,\n});\n\nconst PlainInput = Schema.Struct({ question: Schema.String });\nconst PlainOutput = Schema.Struct({ answer: Schema.String });\n\nconst plainDefinition = Agent.make(\"chaos-plain\", {\n  input: PlainInput,\n  output: PlainOutput,\n  instructions: \"Answer as JSON.\",\n  toolkit: Toolkit.empty,\n  policy,\n});\n\n/** Unannotated → fail-closed `uncertain`: enters the prepared/settled protocol (DUR-009). */\nconst BookUncertain = Tool.make(\"book\", {\n  parameters: Schema.Struct({ ref: Schema.String }),\n  success: Schema.Struct({ confirmation: Schema.String }),\n});\n\nconst bookTools = Toolkit.make(BookUncertain);\n\nconst bookDefinition = Agent.make(\"chaos-book\", {\n  input: PlainInput,\n  output: PlainOutput,\n  instructions: \"Book it.\",\n  toolkit: bookTools,\n  policy,\n});\n\nconst BookApproval = Tool.make(\"book\", {\n  parameters: Schema.Struct({ ref: Schema.String }),\n  success: Schema.Struct({ confirmation: Schema.String }),\n  needsApproval: true,\n});\n\nconst approvalTools = Toolkit.make(BookApproval);\n\nconst approvalDefinition = Agent.make(\"chaos-approval\", {\n  input: PlainInput,\n  output: PlainOutput,\n  instructions: \"Book after approval.\",\n  toolkit: approvalTools,\n  policy,\n});\n\nconst Itinerary = Tool.make(\"itinerary\", {\n  parameters: Schema.Struct({ ref: Schema.String }),\n  success: Schema.Struct({ state: Schema.String }),\n  failure: DurableStepError,\n  dependencies: [DurableStep],\n}).annotate(ToolExecutionClass, \"uncertain\");\n\nconst itineraryTools = Toolkit.make(Itinerary);\n\nconst itineraryDefinition = Agent.make(\"chaos-itinerary\", {\n  input: PlainInput,\n  output: PlainOutput,\n  instructions: \"Reserve the itinerary.\",\n  toolkit: itineraryTools,\n  policy,\n});\n\nconst childDefinition = Agent.make(\"chaos-child\", {\n  input: PlainInput,\n  output: PlainOutput,\n  instructions: \"Answer as JSON.\",\n  toolkit: Toolkit.empty,\n  policy: AgentPolicy.make({\n    maxTurns: 2,\n    maxToolCalls: 1,\n    maxDuration: \"30 seconds\",\n    toolConcurrency: 1,\n  }),\n});\n\nclass ChaosDelegationFailed extends Schema.TaggedError<ChaosDelegationFailed>()(\n  \"ChaosDelegationFailed\",\n  { childErrorTag: Schema.String },\n) {}\n\nconst chaosDelegation = Subagent.define(\"delegate_chaos\", {\n  description: \"Delegate one bounded chaos question.\",\n  target: childDefinition,\n  parameters: Schema.Struct({ topic: Schema.String }),\n  success: Schema.Struct({ summary: Schema.String }),\n  failure: ChaosDelegationFailed,\n  prepareInput: ({ topic }) => Effect.succeed({ question: `chaos:${topic}` }),\n  projectResult: (output) => Effect.succeed({ summary: `finding:${output.answer}` }),\n  policy: SubagentPolicy.make({\n    maxChildren: 2,\n    maxConcurrency: 2,\n    maxTurns: 4,\n    maxToolCalls: 4,\n    maxDuration: \"30 seconds\",\n  }),\n});\n\nconst coordinatorDefinition = Agent.make(\"chaos-coordinator\", {\n  input: Schema.Struct({ mission: Schema.String }),\n  output: Schema.Struct({ report: Schema.String }),\n  instructions: \"Delegate, then report as JSON.\",\n  toolkit: Toolkit.make(chaosDelegation.tool),\n  policy,\n});\n\nconst DELEGATE_CALL_ID = \"chaos-delegate-1\";\n\nconst HEX = \"0123456789abcdef\";\nconst decodeDigest = Schema.decodeSync(Digest);\n\nconst laneDigests = (lane: number): DefinitionDigests => {\n  const digest = decodeDigest(HEX.charAt(lane % 8).repeat(64));\n\n  return DefinitionDigests.make({ agent: digest, model: digest, tools: digest });\n};\n\nconst childDigestStrings = (lane: number) => {\n  const char = HEX.charAt(8 + (lane % 8));\n\n  return { agent: char.repeat(64), model: char.repeat(64), tools: char.repeat(64) } as const;\n};\n\nconst childLaneDigests = (lane: number): DefinitionDigests => {\n  const strings = childDigestStrings(lane);\n\n  return DefinitionDigests.make({\n    agent: decodeDigest(strings.agent),\n    model: decodeDigest(strings.model),\n    tools: decodeDigest(strings.tools),\n  });\n};\n\nconst CHAOS_PRINCIPAL = Schema.decodeSync(Principal)(\"principal-chaos\");\nconst decodeThreadId = Schema.decodeSync(ThreadId);\nconst decodeIdempotencyKey = Schema.decodeSync(IdempotencyKey);\nconst decodeToolCallId = Schema.decodeSync(ToolCallId);\nconst decodeRunId = Schema.decodeSync(RunId);\nconst decodeTurnId = Schema.decodeSync(TurnId);\n\n/** Fixture-only identity source consumed by the delegation Layer's ephemeral capture. */\nconst chaosIdentifiers = Layer.effect(\n  IdGenerator,\n  Effect.gen(function* () {\n    const counter = yield* Ref.make(0);\n\n    const next = <A>(decode: (value: string) => A, prefix: string) =>\n      Ref.getAndUpdate(counter, (value) => value + 1).pipe(\n        Effect.map((value) => decode(`${prefix}-${value}`)),\n      );\n\n    return {\n      nextThreadId: next(decodeThreadId, \"chaos-fixture-thread\"),\n      nextRunId: next(decodeRunId, \"chaos-fixture-run\"),\n      nextTurnId: next(decodeTurnId, \"chaos-fixture-turn\"),\n    };\n  }),\n);\n\nconst delegationSupport = Layer.mergeAll(SubagentReservationsMemoryLive, chaosIdentifiers);\n\n/**\n * The deterministic external desk of one plan: every produced value is recorded so the final\n * non-fabrication sweep can prove each canonical Tool success came from here (durability §10).\n */\ninterface ChaosDesk {\n  readonly produced: Effect.Effect<ReadonlySet<string>>;\n  readonly record: (value: string) => Effect.Effect<void>;\n}\n\nconst makeChaosDesk: Effect.Effect<ChaosDesk> = Effect.gen(function* () {\n  const produced = yield* Ref.make<ReadonlySet<string>>(new Set());\n\n  return {\n    produced: Ref.get(produced),\n    record: (value: string) => Ref.update(produced, (current) => new Set(current).add(value)),\n  };\n});\n\nconst bookConfirmation = (ref: string): string => `confirmed-${ref}`;\nconst flightValue = (ref: string): string => `flight-${ref}`;\nconst lodgingValue = (ref: string): string => `lodging-${ref}`;\n\n// ---------------------------------------------------------------------------\n// Runner\n// ---------------------------------------------------------------------------\n\n/** Adapter-owned failpoint control the SQLite runner supplies; memory has none. */\nexport interface ChaosAdapterFailpoints {\n  readonly arm: (location: string) => Effect.Effect<void>;\n  readonly clear: Effect.Effect<void>;\n}\n\nexport interface ChaosRunOptions {\n  readonly adapterFailpoints?: ChaosAdapterFailpoints | undefined;\n  /**\n   * Executed at the end of every round. Adapters whose ownership leases block every new claim\n   * until expiry (the SQLite ledger's D5 semantics — expiry only revokes the liveness\n   * assumption; producer epochs stay the correctness fence) pass a deterministic\n   * `TestClock.adjust` here so a dead Attempt's lane becomes reclaimable next round. The memory\n   * ledger needs nothing: it allows same-producer reclaim under a live lease.\n   */\n  readonly betweenRounds?: Effect.Effect<void> | undefined;\n}\n\n/** Success → Some; typed failure → None (chaos tolerates it); defect → rethrown loudly. */\nconst tolerateTyped = <A, E, R>(\n  effect: Effect.Effect<A, E, R>,\n): Effect.Effect<Option.Option<A>, never, R> =>\n  effect.pipe(\n    Effect.exit,\n    Effect.flatMap((exit) => {\n      if (Exit.isSuccess(exit)) return Effect.succeed(Option.some(exit.value));\n      if (Option.isSome(Cause.findErrorOption(exit.cause))) {\n        return Effect.succeed(Option.none<A>());\n      }\n\n      return Effect.die(new Error(`chaos step died: ${Cause.pretty(exit.cause)}`));\n    }),\n  );\n\ninterface LaneFixture {\n  readonly index: number;\n  readonly kind: ChaosScenarioKind;\n  readonly threadId: ThreadId;\n  readonly ref: string;\n  readonly deskInPlay: boolean;\n  readonly submissionIndexes: ReadonlyArray<number>;\n  readonly submitOne: (flatIndex: number) => Effect.Effect<Receipt, DurableSubmitFailure>;\n  readonly drives: (\n    firstReceipt: Receipt | undefined,\n  ) => ReadonlyArray<\n    Effect.Effect<ReadonlyArray<Settlement>, DurableWorkerFailure | DurableBindingFailure>\n  >;\n  readonly childThreadOf: (firstReceipt: Receipt) => ThreadId | undefined;\n}\n\ninterface SubmissionState {\n  readonly flatIndex: number;\n  readonly lane: LaneFixture;\n  receipt: Receipt | undefined;\n}\n\nconst scriptFor = (\n  kind: ChaosScenarioKind,\n  ref: string,\n): ((prompt: Prompt.Prompt) => ReadonlyArray<Response.StreamPartEncoded>) => {\n  switch (kind) {\n    case \"plain\":\n    case \"join\":\n      return () => finalParts('{\"answer\":\"chaos\"}');\n    case \"uncertain-tool\":\n    case \"approval\":\n      return (prompt) =>\n        lastRole(prompt) === \"tool\"\n          ? finalParts('{\"answer\":\"booked\"}')\n          : toolTurn(toolCallPart(`book-${ref}`, \"book\", { ref }));\n    case \"durable-steps\":\n      return (prompt) =>\n        lastRole(prompt) === \"tool\"\n          ? finalParts('{\"answer\":\"reserved\"}')\n          : toolTurn(toolCallPart(`itinerary-${ref}`, \"itinerary\", { ref }));\n    case \"delegation\":\n      return (prompt) =>\n        lastRole(prompt) === \"tool\"\n          ? finalParts('{\"report\":\"done\"}')\n          : toolTurn(toolCallPart(DELEGATE_CALL_ID, \"delegate_chaos\", { topic: ref }));\n  }\n};\n\nconst makeLaneFixture = Effect.fn(\"Chaos.makeLaneFixture\")(function* (\n  plan: ChaosPlan,\n  laneIndex: number,\n  kind: ChaosScenarioKind,\n  submissionIndexes: ReadonlyArray<number>,\n  desk: ChaosDesk,\n) {\n  const runtime = yield* DurableAgentRuntime;\n  const threadId = decodeThreadId(`chaos-${plan.seed}-lane-${laneIndex}`);\n  const ref = `ref-l${laneIndex}`;\n  const script = scriptFor(kind, ref);\n  const model = promptScriptedModel(`chaos-${kind}-${laneIndex}`, script);\n  const digests = laneDigests(laneIndex);\n\n  const submitOptionsFor = (flatIndex: number) => ({\n    threadId,\n    principal: CHAOS_PRINCIPAL,\n    idempotencyKey: decodeIdempotencyKey(`chaos-${plan.seed}-s${flatIndex}`),\n    definitions: digests,\n  });\n\n  const bookToolLayerFor = (tools: typeof bookTools | typeof approvalTools) =>\n    tools.toLayer({\n      book: ({ ref: called }) =>\n        desk\n          .record(bookConfirmation(called))\n          .pipe(Effect.as({ confirmation: bookConfirmation(called) })),\n    });\n\n  const plainLaneFixture = (\n    deskInPlay: boolean,\n    drive: Effect.Effect<ReadonlyArray<Settlement>, DurableWorkerFailure | DurableBindingFailure>,\n    submitOne: (flatIndex: number) => Effect.Effect<Receipt, DurableSubmitFailure>,\n  ): LaneFixture => ({\n    index: laneIndex,\n    kind,\n    threadId,\n    ref,\n    deskInPlay,\n    submissionIndexes,\n    submitOne,\n    drives: () => [drive],\n    childThreadOf: () => undefined,\n  });\n\n  switch (kind) {\n    case \"plain\":\n    case \"join\": {\n      const agent = Agent.withModel(plainDefinition, model);\n\n      return plainLaneFixture(false, runtime.processThread(agent, threadId), (flatIndex) =>\n        runtime.submit(agent, { question: `chaos ${flatIndex}` }, submitOptionsFor(flatIndex)),\n      );\n    }\n    case \"uncertain-tool\": {\n      const agent = Agent.withModel(bookDefinition, model);\n\n      return plainLaneFixture(\n        true,\n        runtime.processThread(agent, threadId).pipe(Effect.provide(bookToolLayerFor(bookTools))),\n        (flatIndex) =>\n          runtime.submit(agent, { question: `chaos ${flatIndex}` }, submitOptionsFor(flatIndex)),\n      );\n    }\n    case \"approval\": {\n      const agent = Agent.withModel(approvalDefinition, model);\n\n      return plainLaneFixture(\n        true,\n        runtime\n          .processThread(agent, threadId)\n          .pipe(Effect.provide(bookToolLayerFor(approvalTools))),\n        (flatIndex) =>\n          runtime.submit(agent, { question: `chaos ${flatIndex}` }, submitOptionsFor(flatIndex)),\n      );\n    }\n    case \"durable-steps\": {\n      const agent = Agent.withModel(itineraryDefinition, model);\n\n      const toolLayer = itineraryTools.toLayer({\n        itinerary: ({ ref: called }) =>\n          Effect.gen(function* () {\n            const step = yield* DurableStep;\n\n            const flight = yield* step.do(\n              \"reserve-flight\",\n              Schema.String,\n              desk.record(flightValue(called)).pipe(Effect.as(flightValue(called))),\n            );\n\n            const lodging = yield* step.do(\n              \"reserve-lodging\",\n              Schema.String,\n              desk.record(lodgingValue(called)).pipe(Effect.as(lodgingValue(called))),\n            );\n\n            return { state: `${flight}+${lodging}` };\n          }),\n      });\n\n      return plainLaneFixture(\n        true,\n        runtime.processThread(agent, threadId).pipe(Effect.provide(toolLayer)),\n        (flatIndex) =>\n          runtime.submit(agent, { question: `chaos ${flatIndex}` }, submitOptionsFor(flatIndex)),\n      );\n    }\n    case \"delegation\": {\n      const parentBinding = Agent.withModel(coordinatorDefinition, model);\n\n      const childModel = promptScriptedModel(`chaos-child-${laneIndex}`, () =>\n        finalParts('{\"answer\":\"child\"}'),\n      );\n\n      const childBinding = Agent.withModel(childDefinition, childModel);\n\n      const delegationLayer = SubagentRuntime.layer(chaosDelegation, childBinding, {\n        mapChildFailure: (failure) => ChaosDelegationFailed.make({ childErrorTag: failure._tag }),\n        durable: { targetDigests: childDigestStrings(laneIndex) },\n      }).pipe(Layer.provide(delegationSupport));\n\n      const parentResolved: ResolvedBinding = yield* DurableWorkerBinding.make(\n        parentBinding,\n        digests,\n      ).pipe(Effect.provide(delegationLayer));\n\n      const childResolved: ResolvedBinding = yield* DurableWorkerBinding.make(\n        childBinding,\n        childLaneDigests(laneIndex),\n      );\n\n      const registeredRuntime = yield* DurableAgentRuntime.pipe(\n        Effect.provide(\n          DurableAgentRuntime.layerWithBindings([parentResolved, childResolved]).pipe(\n            Layer.provide(RunToolAuthorization.allowAll),\n          ),\n        ),\n      );\n\n      const driveResolved = (thread: ThreadId) => registeredRuntime.processThreadResolved(thread);\n\n      const fixture: LaneFixture = {\n        index: laneIndex,\n        kind,\n        threadId,\n        ref,\n        deskInPlay: false,\n        submissionIndexes,\n        submitOne: (flatIndex) =>\n          runtime.submit(\n            { definition: { id: coordinatorDefinition.id, input: coordinatorDefinition.input } },\n            { mission: `chaos ${flatIndex}` },\n            submitOptionsFor(flatIndex),\n          ),\n        drives: (firstReceipt) => {\n          const drives: Array<\n            Effect.Effect<ReadonlyArray<Settlement>, DurableWorkerFailure | DurableBindingFailure>\n          > = [driveResolved(threadId)];\n\n          if (firstReceipt !== undefined) {\n            drives.push(\n              driveResolved(\n                childThreadIdFor(firstReceipt.submissionId, decodeToolCallId(DELEGATE_CALL_ID)),\n              ),\n            );\n          }\n\n          return drives;\n        },\n        childThreadOf: (firstReceipt) =>\n          childThreadIdFor(firstReceipt.submissionId, decodeToolCallId(DELEGATE_CALL_ID)),\n      };\n\n      return fixture;\n    }\n  }\n});\n\n/** Stable per-call index into an injection list (identical across resolution passes). */\nconst injectionIndex = (submissionFlatIndex: number, callId: string, length: number): number => {\n  let hash = submissionFlatIndex + 1;\n\n  for (const char of callId) hash = (Math.imul(hash, 31) + char.charCodeAt(0)) | 0;\n\n  return ((hash % length) + length) % length;\n};\n\nconst resolutionFor = (\n  kind: ChaosResolutionKind,\n  toolName: string,\n  ref: string,\n  produced: ReadonlySet<string>,\n): UnknownResolution => {\n  switch (kind) {\n    case \"abort-submission\":\n      return ResolutionAbortSubmission.make();\n    case \"completed-from-supplier\": {\n      if (toolName === \"book\" && produced.has(bookConfirmation(ref))) {\n        return ResolutionCompletedWithResult.make({\n          result: { confirmation: bookConfirmation(ref) },\n          isFailure: false,\n        });\n      }\n      if (\n        toolName === \"itinerary\" &&\n        produced.has(flightValue(ref)) &&\n        produced.has(lodgingValue(ref))\n      ) {\n        return ResolutionCompletedWithResult.make({\n          result: { state: `${flightValue(ref)}+${lodgingValue(ref)}` },\n          isFailure: false,\n        });\n      }\n\n      // The desk never produced a value for this call — resolving \"completed\" would fabricate.\n      return ResolutionNeverHappened.make();\n    }\n    case \"never-happened\":\n      return ResolutionNeverHappened.make();\n  }\n};\n\n/** Drive one DUR-017 pass: resolve Unknown Outcomes and pending approvals from the plan. */\nconst resolutionPass = Effect.fn(\"Chaos.resolutionPass\")(function* (\n  plan: ChaosPlan,\n  states: ReadonlyArray<SubmissionState>,\n  desk: ChaosDesk,\n) {\n  const runtime = yield* DurableAgentRuntime;\n  const ledger = yield* SubmissionLedger;\n  const produced = yield* desk.produced;\n  const nonterminal = yield* tolerateTyped(Stream.runCollect(ledger.scanNonterminal));\n\n  if (Option.isNone(nonterminal)) return;\n  const byId = new Map<SubmissionId, SubmissionState>();\n\n  for (const state of states) {\n    if (state.receipt !== undefined) byId.set(state.receipt.submissionId, state);\n  }\n  for (const row of nonterminal.value) {\n    if (row.state !== \"unknown\" && row.state !== \"suspended\") continue;\n    const state = byId.get(row.submissionId);\n    const explanation = yield* tolerateTyped(runtime.explain(row.submissionId));\n\n    if (Option.isNone(explanation)) continue;\n    const flatIndex = state?.flatIndex ?? 0;\n    const ref = state?.lane.ref ?? \"ref-child\";\n\n    if (row.state === \"unknown\") {\n      for (const call of explanation.value.evidence.unknownCalls) {\n        if (call.resolved) continue;\n\n        const kind =\n          plan.resolutionInjections.length === 0\n            ? \"never-happened\"\n            : (plan.resolutionInjections.at(\n                injectionIndex(flatIndex, call.toolCallId, plan.resolutionInjections.length),\n              ) ?? \"never-happened\");\n\n        yield* tolerateTyped(\n          runtime.resolveUnknown(\n            UnknownResolutionCommand.make({\n              submissionId: row.submissionId,\n              toolCallId: call.toolCallId,\n              author: \"chaos-runner\",\n              reason: `chaos plan ${plan.seed} resolution (${kind})`,\n              resolution: resolutionFor(kind, call.toolName, ref, produced),\n            }),\n          ),\n        );\n      }\n    } else {\n      for (const pending of explanation.value.evidence.approvalsPending) {\n        const decision =\n          plan.approvalDecisions.length === 0\n            ? \"approved\"\n            : (plan.approvalDecisions.at(\n                injectionIndex(flatIndex, pending.toolCallId, plan.approvalDecisions.length),\n              ) ?? \"approved\");\n\n        yield* tolerateTyped(\n          runtime.resolveApproval(\n            ApprovalDecisionCommand.make({\n              submissionId: row.submissionId,\n              toolCallId: pending.toolCallId,\n              decision,\n              resolver: \"chaos-runner\",\n              reason: `chaos plan ${plan.seed} approval (${decision})`,\n            }),\n          ),\n        );\n      }\n    }\n  }\n});\n\nconst submissionIdsNamedBy = (\n  records: ReadonlyArray<CanonicalRecordEnvelope>,\n): ReadonlySet<SubmissionId> => {\n  const named = new Set<SubmissionId>();\n\n  for (const envelope of records) {\n    const payload = envelope.record.payload;\n\n    if (\n      payload._tag === \"UserInputRecorded\" ||\n      payload._tag === \"SubmissionSettled\" ||\n      payload._tag === \"AbortRequested\"\n    ) {\n      if (payload.submissionId !== undefined) named.add(payload.submissionId);\n    }\n  }\n\n  return named;\n};\n\n/**\n * The final non-fabrication sweep (durability §10): every canonical Tool success recorded on a\n * desk-backed lane must be a value the desk actually produced.\n */\nconst BookResult = Schema.Struct({ confirmation: Schema.String });\nconst ItineraryResult = Schema.Struct({ state: Schema.String });\nconst decodeBookResult = Schema.decodeUnknownOption(BookResult);\nconst decodeItineraryResult = Schema.decodeUnknownOption(ItineraryResult);\nconst decodeStepOutput = Schema.decodeUnknownOption(Schema.String);\n\nconst assertNoFabrication = (\n  plan: ChaosPlan,\n  records: ReadonlyArray<CanonicalRecordEnvelope>,\n  produced: ReadonlySet<string>,\n): Effect.Effect<void, ChaosConvergenceFailure> => {\n  const fabricated: Array<string> = [];\n\n  const requireProduced = (value: string, label: string): void => {\n    if (!produced.has(value)) fabricated.push(`${label} \"${value}\"`);\n  };\n\n  for (const envelope of records) {\n    const payload = envelope.record.payload;\n\n    if (payload._tag === \"ToolCallSettled\" && !payload.isFailure) {\n      if (payload.toolName === \"book\") {\n        const result = decodeBookResult(payload.result);\n\n        if (Option.isSome(result)) requireProduced(result.value.confirmation, \"book result\");\n      }\n      if (payload.toolName === \"itinerary\") {\n        const result = decodeItineraryResult(payload.result);\n\n        if (Option.isSome(result)) {\n          for (const part of result.value.state.split(\"+\")) {\n            requireProduced(part, \"itinerary step result\");\n          }\n        }\n      }\n    }\n    if (payload._tag === \"ToolStepSettled\") {\n      const output = decodeStepOutput(payload.output);\n\n      if (Option.isSome(output)) requireProduced(output.value, \"step output\");\n    }\n  }\n\n  return fabricated.length === 0\n    ? Effect.void\n    : Effect.fail(\n        ChaosConvergenceFailure.make({\n          seed: plan.seed,\n          message: `fabricated Tool results absent from the desk: ${fabricated.join(\", \")}`,\n        }),\n      );\n};\n\n/**\n * Execute one chaos plan against whatever adapters the ambient Layer provides and end in the\n * shared invariant claims. Deterministic: same plan + same adapters → same schedule.\n */\nexport const runChaosPlan = Effect.fn(\"Chaos.runChaosPlan\")(function* (\n  plan: ChaosPlan,\n  options?: ChaosRunOptions,\n) {\n  const runtime = yield* DurableAgentRuntime;\n  const ledger = yield* SubmissionLedger;\n  const store = yield* ThreadStore;\n  const config = yield* DurableRuntimeConfig;\n  const failpoints = yield* DurableRuntimeFailpointTestControl;\n  const random = mulberry32(plan.seed);\n  const desk = yield* makeChaosDesk;\n\n  // Lane fixtures: the FIRST spec of each lane fixes the lane's agent kind.\n  const laneKinds = new Map<number, ChaosScenarioKind>();\n  const laneSubmissions = new Map<number, Array<number>>();\n\n  plan.submissions.forEach((spec, flatIndex) => {\n    const lane = spec.lane % plan.lanes;\n\n    if (!laneKinds.has(lane)) laneKinds.set(lane, spec.kind);\n    const list = laneSubmissions.get(lane) ?? [];\n\n    list.push(flatIndex);\n    laneSubmissions.set(lane, list);\n  });\n  const lanes: Array<LaneFixture> = [];\n\n  for (const [lane, kind] of laneKinds) {\n    lanes.push(yield* makeLaneFixture(plan, lane, kind, laneSubmissions.get(lane) ?? [], desk));\n  }\n\n  const lanesByIndex = new Map(lanes.map((lane) => [lane.index, lane]));\n  const states: Array<SubmissionState> = [];\n\n  for (const [flatIndex, spec] of plan.submissions.entries()) {\n    const laneIndex = spec.lane % plan.lanes;\n    const lane = lanesByIndex.get(laneIndex);\n\n    if (lane === undefined) {\n      return yield* ChaosConvergenceFailure.make({\n        seed: plan.seed,\n        message: `submission ${flatIndex} addresses missing lane ${laneIndex}`,\n      });\n    }\n    states.push({ flatIndex, lane, receipt: undefined });\n  }\n  const appliedAborts = new Set<number>();\n\n  type ArmEntry =\n    | { readonly family: \"coordinator\"; readonly location: DurableRuntimeFailpointLocation }\n    | { readonly family: \"adapter\"; readonly location: string };\n\n  const armQueue: Array<ArmEntry> = [\n    ...plan.failpointArms.map((location): ArmEntry => ({ family: \"coordinator\", location })),\n    ...plan.adapterArms.map((location): ArmEntry => ({ family: \"adapter\", location })),\n  ];\n\n  const allSettled = Effect.gen(function* () {\n    if (states.some((state) => state.receipt === undefined)) return false;\n    const nonterminal = yield* tolerateTyped(Stream.runCollect(ledger.scanNonterminal));\n\n    return Option.isSome(nonterminal) && Array.from(nonterminal.value).length === 0;\n  });\n\n  const maxRounds = armQueue.length + states.length * 2 + 12;\n  let rounds = 0;\n  let converged = false;\n\n  for (let round = 0; round < maxRounds; round++) {\n    rounds = round + 1;\n    const arm = armQueue[round];\n\n    if (arm?.family === \"coordinator\") {\n      const location = arm.location;\n\n      yield* failpoints.setHandler((hit) =>\n        hit === location\n          ? Effect.fail(DurableRuntimeFailpointError.make({ location: hit }))\n          : Effect.void,\n      );\n    } else if (arm?.family === \"adapter\" && options?.adapterFailpoints !== undefined) {\n      yield* options.adapterFailpoints.arm(arm.location);\n    }\n\n    // Admission chaos: pending submissions retry under the active arm until a Receipt lands;\n    // the identical (thread, principal, key) triple reattaches, never duplicates.\n    for (const state of states) {\n      if (state.receipt !== undefined) continue;\n      const receipt = yield* tolerateTyped(state.lane.submitOne(state.flatIndex));\n\n      if (Option.isSome(receipt)) state.receipt = receipt.value;\n    }\n\n    // Drive every lane (and discovered child lanes) in seeded order under the active arm.\n    const order = lanes\n      .map((lane) => ({ lane, rank: random() }))\n      .sort((left, right) => left.rank - right.rank || left.lane.index - right.lane.index)\n      .map(({ lane }) => lane);\n\n    for (const lane of order) {\n      const firstFlat = lane.submissionIndexes[0];\n      const firstReceipt = firstFlat === undefined ? undefined : states[firstFlat]?.receipt;\n\n      for (const drive of lane.drives(firstReceipt)) {\n        yield* tolerateTyped(drive);\n      }\n    }\n\n    // Abort injections fire once, while arms may still be active (abort:after-intent etc.).\n    if (round >= 1) {\n      for (const rawIndex of plan.abortInjections) {\n        const index = rawIndex % states.length;\n\n        if (appliedAborts.has(index)) continue;\n        const receipt = states[index]?.receipt;\n\n        if (receipt === undefined) continue;\n        appliedAborts.add(index);\n        yield* tolerateTyped(\n          runtime.abort(\n            AbortCommand.make({\n              submissionId: receipt.submissionId,\n              author: \"chaos-runner\",\n              reason: `chaos plan ${plan.seed} abort injection`,\n            }),\n          ),\n        );\n      }\n    }\n\n    // First resolution pass runs under the arm so resolve:* locations can fire.\n    yield* resolutionPass(plan, states, desk);\n\n    yield* failpoints.clear;\n    if (options?.adapterFailpoints !== undefined) yield* options.adapterFailpoints.clear;\n\n    yield* tolerateTyped(runtime.runRecovery);\n    // Second, unarmed pass guarantees forward progress for newly marked Unknown lanes.\n    yield* resolutionPass(plan, states, desk);\n\n    if (yield* allSettled) {\n      converged = true;\n      break;\n    }\n    if (options?.betweenRounds !== undefined) yield* options.betweenRounds;\n  }\n\n  if (!converged) {\n    const nonterminal = yield* tolerateTyped(Stream.runCollect(ledger.scanNonterminal));\n\n    const detail = Option.isSome(nonterminal)\n      ? Array.from(nonterminal.value)\n          .map((row: SubmissionSnapshot) => `${row.submissionId}(${row.state})`)\n          .join(\", \")\n      : \"ledger scan failed\";\n\n    return yield* ChaosConvergenceFailure.make({\n      seed: plan.seed,\n      message: `plan did not converge within ${maxRounds} rounds; nonterminal: [${detail}]; pending receipts: ${states.filter((state) => state.receipt === undefined).length}`,\n    });\n  }\n\n  // Final claims: the shared invariant checker per touched Thread, in convergence mode,\n  // with the full digest chain (single known producer), plus the desk non-fabrication sweep.\n  const produced = yield* desk.produced;\n  const laneReports: Array<ChaosLaneReport> = [];\n\n  const verifyThread = Effect.fn(\"Chaos.verifyThread\")(function* (\n    threadId: ThreadId,\n    kind: ChaosScenarioKind,\n    deskInPlay: boolean,\n  ) {\n    const exported = yield* store.export(ThreadExportRequest.make({ threadId })).pipe(\n      Effect.mapError((error) =>\n        ChaosConvergenceFailure.make({\n          seed: plan.seed,\n          message: `export of ${threadId} failed: ${String(error)}`,\n        }),\n      ),\n    );\n\n    const rows: Array<SubmissionSnapshot> = [];\n\n    for (const submissionId of submissionIdsNamedBy(exported.records)) {\n      const found = yield* ledger.lookup(SubmissionLookupById.make({ submissionId })).pipe(\n        Effect.mapError((error) =>\n          ChaosConvergenceFailure.make({\n            seed: plan.seed,\n            message: `lookup of ${submissionId} failed: ${String(error)}`,\n          }),\n        ),\n      );\n\n      if (Option.isSome(found)) rows.push(found.value);\n    }\n\n    const batchProducers = new Map<BatchId, ProducerId>(\n      exported.records.map((envelope) => [envelope.batchId, config.producerId]),\n    );\n\n    const report = yield* verifyThreadInvariants({\n      export: exported,\n      submissions: rows,\n      batchProducers,\n      requireAllSettled: true,\n    });\n\n    if (!report.ok) {\n      const failed = report.checks\n        .filter((check) => check.status === \"failed\")\n        .map((check) => `${check.name}: ${check.detail ?? \"failed\"}`)\n        .join(\"; \");\n\n      return yield* ChaosConvergenceFailure.make({\n        seed: plan.seed,\n        message: `invariants failed for ${threadId} (${kind}): ${failed}`,\n      });\n    }\n    if (deskInPlay) {\n      yield* assertNoFabrication(plan, exported.records, produced);\n    }\n    laneReports.push(\n      ChaosLaneReport.make({\n        threadId,\n        kind,\n        submissionCount: rows.length,\n        verified: report.ok,\n      }),\n    );\n  });\n\n  for (const lane of lanes) {\n    yield* verifyThread(lane.threadId, lane.kind, lane.deskInPlay);\n    // Delegation lanes: verify every materialized child Thread too.\n    for (const flatIndex of lane.submissionIndexes) {\n      const receipt = states[flatIndex]?.receipt;\n\n      if (receipt === undefined) continue;\n      const child = lane.childThreadOf(receipt);\n\n      if (child === undefined) continue;\n\n      const childExport = yield* Effect.exit(\n        store.export(ThreadExportRequest.make({ threadId: child })),\n      );\n\n      if (Exit.isSuccess(childExport) && childExport.value.records.length > 0) {\n        yield* verifyThread(child, \"plain\", false);\n      }\n    }\n  }\n\n  const obligations = yield* runtime\n    .scanObligations(ObligationThresholds.make({ agingSeconds: 0, overdueSeconds: 0 }))\n    .pipe(\n      Effect.mapError((error) =>\n        ChaosConvergenceFailure.make({\n          seed: plan.seed,\n          message: `scanObligations failed: ${String(error)}`,\n        }),\n      ),\n    );\n\n  if (obligations.entries.length > 0) {\n    return yield* ChaosConvergenceFailure.make({\n      seed: plan.seed,\n      message: `open obligations after convergence: ${obligations.entries\n        .map((entry) => `${entry.submissionId}(${entry.blockedOn})`)\n        .join(\", \")}`,\n    });\n  }\n\n  return ChaosPlanReport.make({\n    seed: plan.seed,\n    rounds,\n    lanes: laneReports,\n    openObligations: obligations.entries.length,\n  });\n});\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AA2FA,MAAa,oBAAoB,OAAO,SAAS;CAC/C;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAID,MAAM,YAAY,OAAO,IAAI,MAAM,OAAO,uBAAuB,CAAC,GAAG,OAAO,oBAAoB,CAAC,CAAC;;AAGlG,IAAa,sBAAb,cAAyC,OAAO,MAC9C,2CACF,CAAC,CAAC;CACA,MAAM;;CAEN,MAAM;AACR,CAAC,CAAC,CAAC,CAAC;;AAGJ,MAAa,sBAAsB,OAAO,SAAS;CAEjD;CAKA;CAEA;AACF,CAAC;AAID,MAAa,wBAAwB,OAAO,SAAS,CAAC,YAAY,QAAQ,CAAC;AAG3E,MAAM,oBAAoB,OAAO,OAAO,MAAM,OAAO,YAAY,GAAG,CAAC;;;;;;AAOrE,IAAa,YAAb,cAA+B,OAAO,MAAiB,iCAAiC,CAAC,CAAC;;CAExF,MAAM,OAAO;;CAEb,OAAO,OAAO,IAAI,MAAM,OAAO,uBAAuB,CAAC,GAAG,OAAO,oBAAoB,CAAC,CAAC;CACvF,aAAa,OAAO,cAAc,mBAAmB;;CAErD,eAAe,OAAO,MAAM,+BAA+B;;CAE3D,aAAa,OAAO,MAAM,iBAAiB;;CAE3C,iBAAiB,OAAO,MAAM,OAAO,IAAI,MAAM,OAAO,uBAAuB,CAAC,CAAC,CAAC;;CAEhF,sBAAsB,OAAO,MAAM,mBAAmB;;CAEtD,mBAAmB,OAAO,MAAM,qBAAqB;AACvD,CAAC,CAAC,CAAC,CAAC;;AAGJ,IAAa,kBAAb,cAAqC,OAAO,MAC1C,uCACF,CAAC,CAAC;CACA,UAAU;CACV,MAAM;CACN,iBAAiB,OAAO,IAAI,MAAM,OAAO,uBAAuB,CAAC,CAAC;;CAElE,UAAU,OAAO;AACnB,CAAC,CAAC,CAAC,CAAC;;AAGJ,IAAa,kBAAb,cAAqC,OAAO,MAC1C,uCACF,CAAC,CAAC;CACA,MAAM,OAAO;CACb,QAAQ,OAAO,IAAI,MAAM,OAAO,uBAAuB,CAAC,CAAC;CACzD,OAAO,OAAO,MAAM,eAAe;;CAEnC,iBAAiB,OAAO,IAAI,MAAM,OAAO,uBAAuB,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC,CAAC;;AAGJ,IAAa,0BAAb,cAA6C,OAAO,YAAqC,CAAC,CACxF,2BACA;CACE,MAAM,OAAO;CACb,SAAS,OAAO,OAAO,MAAM,OAAO,YAAY,KAAM,CAAC;AACzD,CACF,CAAC,CAAC,CAAC;;AAOH,MAAa,qBAAqB;AAElC,MAAM,2BAA2B,OAAO,iBAAiB,MAAM,OAAO,MAAM,CAAC;AAC7E,MAAM,iCAAiC,OAAO,oBAAoB,wBAAwB;;AAG1F,MAAa,oBAAoB,QAAoD;CACnF,MAAM,MAAM,IAAI;CAEhB,IAAI,QAAQ,KAAA,KAAa,QAAQ,IAAI,OAAO;CAE5C,OAAO,OAAO,UAAU,+BAA+B,GAAG,SAAS,kBAAkB;AACvF;AAgBA,MAAM,gBAAoD,UAAU,aAClE,SACA,kBACA,iBACA,YACA,QACA,YACF,CAAC,CAAC,OAAO,SACP,SAAS,SACL,UAAU,QAAQ;CAAE,KAAK;CAAG,KAAK;AAAE,CAAC,CAAC,CAAC,KAAK,WAA0B;CAAE;CAAM;AAAM,EAAE,IACrF,SAAS,UACP,UAAU,QAAQ;CAAE,KAAK;CAAG,KAAK;AAAE,CAAC,CAAC,CAAC,KAAK,WAA0B;CAAE;CAAM;AAAM,EAAE,IACrF,UAAU,SAAwB;CAAE;CAAM,OAAO;AAAE,CAAC,CAC5D;AAYA,MAAM,sBACJ,gBAEA,UAAU,OAAO;CACf,OAAO,UAAU,MAAM,eAAe;EAAE,WAAW;EAAG,WAAW;CAAE,CAAC;CACpE,eAAe,UAAU,YACvB,UAAU,aAAa,GAAG,gCAAgC,QAAQ,GAClE,EAAE,WAAW,EAAE,CACjB;CACA,aACE,YAAY,WAAW,IACnB,UAAU,SAAwB,CAAC,CAAC,IACpC,UAAU,YAAY,UAAU,aAAa,GAAG,WAAW,GAAG,EAAE,WAAW,EAAE,CAAC;CACpF,iBAAiB,UAAU,YAAY,UAAU,QAAQ;EAAE,KAAK;EAAG,KAAK;CAAG,CAAC,GAAG,EAC7E,WAAW,EACb,CAAC;CACD,sBAAsB,UAAU,MAC9B,UAAU,aACR,kBACA,2BACA,kBACF,GACA,EAAE,WAAW,EAAE,CACjB;CACA,mBAAmB,UAAU,MAC3B,UAAU,aAAoC,YAAY,QAAQ,GAClE,EAAE,WAAW,EAAE,CACjB;AACF,CAAC,CAAC,CAAC,KAAK,UAAU;CAOhB,MAAM,CAAC,OAAO,GAAG,QANG,MAAM,MAAM,SAAS,MAAM,UAC7C,MAAM,KAAK,EAAE,QAAQ,KAAK,MAAM,SAC9B,oBAAoB,KAAK;EAAE,MAAM;EAAO,MAAM,KAAK;CAAK,CAAC,CAC3D,CAGiC;CAGnC,IAAI,UAAU,KAAA,GAAW,MAAM,IAAI,MAAM,wCAAwC;CAEjF,OAAO;EACL,OAAO,MAAM,MAAM;EACnB,aAAa,CAAC,OAAO,GAAG,IAAI;EAC5B,eAAe,MAAM;EACrB,aAAa,MAAM;EACnB,iBAAiB,MAAM;EACvB,sBAAsB,MAAM;EAC5B,mBAAmB,MAAM;CAC3B;AACF,CAAC;;;;;;AAOH,MAAa,sBAAsB,YAA6D;CAM9F,OALgB,UAAU,OAAO,mBAAmB,QAAQ,eAAe,CAAC,CAAC,GAAG;EAC9E,MAAM,QAAQ;EACd,SAAS,QAAQ;CACnB,CAEa,CAAC,CAAC,KAAK,OAAO,UACzB,UAAU,KAAK;EAAE,GAAG;EAAO,MAAO,KAAK,KAAK,QAAQ,MAAM,EAAE,IAAI,QAAS;CAAE,CAAC,CAC9E;AACF;;AAGA,MAAM,cAAc,SAAiC;CACnD,IAAI,QAAQ,OAAO;CAEnB,aAAa;EACX,QAAS,QAAQ,aAAc;EAC/B,IAAI,IAAI,KAAK,KAAK,QAAS,UAAU,IAAK,IAAI,KAAK;EAEnD,IAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,KAAK,CAAC,IAAK;EAE7C,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;AAMA,MAAM,QAAQ;CAAE,aAAa,CAAC;CAAG,cAAc,CAAC;AAAE;AAElD,MAAM,cAAc,SAA4D;CAC9E;EAAE,MAAM;EAAc,IAAI;CAAS;CACnC;EAAE,MAAM;EAAc,IAAI;EAAU,OAAO;CAAK;CAChD;EAAE,MAAM;EAAY,IAAI;CAAS;CACjC;EAAE,MAAM;EAAU,QAAQ;EAAQ;CAAM;AAC1C;AAEA,MAAM,YACJ,GAAG,UAC2C,CAC9C,GAAG,OACH;CAAE,MAAM;CAAU,QAAQ;CAAc;AAAM,CAChD;AAEA,MAAM,gBAAgB,IAAY,MAAc,YAAiD;CAC/F,MAAM;CACN;CACA;CACA;CACA,kBAAkB;AACpB;;;;;;AAOA,MAAM,uBACJ,OACA,WAEA,MAAM,KACJ,YACA,OACA,MAAM,OACJ,cAAc,eACd,cAAc,KAAK;CACjB,oBAAoB,OAAO,QAAQ,CAAC,CAAC;CACrC,aAAa,YAAY,OAAO,aAAa,OAAO,QAAQ,MAAM,CAAC;AACrE,CAAC,CACH,CACF;AAEF,MAAM,YAAY,WAA8C,OAAO,QAAQ,GAAG,EAAE,CAAC,EAAE;AAEvF,MAAM,SAAS,YAAY,KAAK;CAC9B,UAAU;CACV,cAAc;CACd,aAAa;CACb,iBAAiB;AACnB,CAAC;AAED,MAAM,aAAa,OAAO,OAAO,EAAE,UAAU,OAAO,OAAO,CAAC;AAC5D,MAAM,cAAc,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,CAAC;AAE3D,MAAM,kBAAkB,MAAM,KAAK,eAAe;CAChD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS,QAAQ;CACjB;AACF,CAAC;;AAGD,MAAM,gBAAgB,KAAK,KAAK,QAAQ;CACtC,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,cAAc,OAAO,OAAO,CAAC;AACxD,CAAC;AAED,MAAM,YAAY,QAAQ,KAAK,aAAa;AAE5C,MAAM,iBAAiB,MAAM,KAAK,cAAc;CAC9C,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS;CACT;AACF,CAAC;AAED,MAAM,eAAe,KAAK,KAAK,QAAQ;CACrC,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,cAAc,OAAO,OAAO,CAAC;CACtD,eAAe;AACjB,CAAC;AAED,MAAM,gBAAgB,QAAQ,KAAK,YAAY;AAE/C,MAAM,qBAAqB,MAAM,KAAK,kBAAkB;CACtD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS;CACT;AACF,CAAC;AAED,MAAM,YAAY,KAAK,KAAK,aAAa;CACvC,YAAY,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC;CAChD,SAAS,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,CAAC;CAC/C,SAAS;CACT,cAAc,CAAC,WAAW;AAC5B,CAAC,CAAC,CAAC,SAAS,oBAAoB,WAAW;AAE3C,MAAM,iBAAiB,QAAQ,KAAK,SAAS;AAE7C,MAAM,sBAAsB,MAAM,KAAK,mBAAmB;CACxD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS;CACT;AACF,CAAC;AAED,MAAM,kBAAkB,MAAM,KAAK,eAAe;CAChD,OAAO;CACP,QAAQ;CACR,cAAc;CACd,SAAS,QAAQ;CACjB,QAAQ,YAAY,KAAK;EACvB,UAAU;EACV,cAAc;EACd,aAAa;EACb,iBAAiB;CACnB,CAAC;AACH,CAAC;AAED,IAAM,wBAAN,cAAoC,OAAO,YAAmC,CAAC,CAC7E,yBACA,EAAE,eAAe,OAAO,OAAO,CACjC,CAAC,CAAC,CAAC;AAEH,MAAM,kBAAkB,SAAS,OAAO,kBAAkB;CACxD,aAAa;CACb,QAAQ;CACR,YAAY,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,CAAC;CAClD,SAAS,OAAO,OAAO,EAAE,SAAS,OAAO,OAAO,CAAC;CACjD,SAAS;CACT,eAAe,EAAE,YAAY,OAAO,QAAQ,EAAE,UAAU,SAAS,QAAQ,CAAC;CAC1E,gBAAgB,WAAW,OAAO,QAAQ,EAAE,SAAS,WAAW,OAAO,SAAS,CAAC;CACjF,QAAQ,eAAe,KAAK;EAC1B,aAAa;EACb,gBAAgB;EAChB,UAAU;EACV,cAAc;EACd,aAAa;CACf,CAAC;AACH,CAAC;AAED,MAAM,wBAAwB,MAAM,KAAK,qBAAqB;CAC5D,OAAO,OAAO,OAAO,EAAE,SAAS,OAAO,OAAO,CAAC;CAC/C,QAAQ,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,CAAC;CAC/C,cAAc;CACd,SAAS,QAAQ,KAAK,gBAAgB,IAAI;CAC1C;AACF,CAAC;AAED,MAAM,mBAAmB;AAEzB,MAAM,MAAM;AACZ,MAAM,eAAe,OAAO,WAAW,MAAM;AAE7C,MAAM,eAAe,SAAoC;CACvD,MAAM,SAAS,aAAa,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;CAE3D,OAAO,kBAAkB,KAAK;EAAE,OAAO;EAAQ,OAAO;EAAQ,OAAO;CAAO,CAAC;AAC/E;AAEA,MAAM,sBAAsB,SAAiB;CAC3C,MAAM,OAAO,IAAI,OAAO,IAAK,OAAO,CAAE;CAEtC,OAAO;EAAE,OAAO,KAAK,OAAO,EAAE;EAAG,OAAO,KAAK,OAAO,EAAE;EAAG,OAAO,KAAK,OAAO,EAAE;CAAE;AAClF;AAEA,MAAM,oBAAoB,SAAoC;CAC5D,MAAM,UAAU,mBAAmB,IAAI;CAEvC,OAAO,kBAAkB,KAAK;EAC5B,OAAO,aAAa,QAAQ,KAAK;EACjC,OAAO,aAAa,QAAQ,KAAK;EACjC,OAAO,aAAa,QAAQ,KAAK;CACnC,CAAC;AACH;AAEA,MAAM,kBAAkB,OAAO,WAAW,SAAS,CAAC,CAAC,iBAAiB;AACtE,MAAM,iBAAiB,OAAO,WAAW,QAAQ;AACjD,MAAM,uBAAuB,OAAO,WAAW,cAAc;AAC7D,MAAM,mBAAmB,OAAO,WAAW,UAAU;AACrD,MAAM,cAAc,OAAO,WAAW,KAAK;AAC3C,MAAM,eAAe,OAAO,WAAW,MAAM;;AAG7C,MAAM,mBAAmB,MAAM,OAC7B,aACA,OAAO,IAAI,aAAa;CACtB,MAAM,UAAU,OAAO,IAAI,KAAK,CAAC;CAEjC,MAAM,QAAW,QAA8B,WAC7C,IAAI,aAAa,UAAU,UAAU,QAAQ,CAAC,CAAC,CAAC,KAC9C,OAAO,KAAK,UAAU,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC,CACpD;CAEF,OAAO;EACL,cAAc,KAAK,gBAAgB,sBAAsB;EACzD,WAAW,KAAK,aAAa,mBAAmB;EAChD,YAAY,KAAK,cAAc,oBAAoB;CACrD;AACF,CAAC,CACH;AAEA,MAAM,oBAAoB,MAAM,SAAS,gCAAgC,gBAAgB;AAWzF,MAAM,gBAA0C,OAAO,IAAI,aAAa;CACtE,MAAM,WAAW,OAAO,IAAI,qBAA0B,IAAI,IAAI,CAAC;CAE/D,OAAO;EACL,UAAU,IAAI,IAAI,QAAQ;EAC1B,SAAS,UAAkB,IAAI,OAAO,WAAW,YAAY,IAAI,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC;CAC1F;AACF,CAAC;AAED,MAAM,oBAAoB,QAAwB,aAAa;AAC/D,MAAM,eAAe,QAAwB,UAAU;AACvD,MAAM,gBAAgB,QAAwB,WAAW;;AAyBzD,MAAM,iBACJ,WAEA,OAAO,KACL,OAAO,MACP,OAAO,SAAS,SAAS;CACvB,IAAI,KAAK,UAAU,IAAI,GAAG,OAAO,OAAO,QAAQ,OAAO,KAAK,KAAK,KAAK,CAAC;CACvE,IAAI,OAAO,OAAO,MAAM,gBAAgB,KAAK,KAAK,CAAC,GACjD,OAAO,OAAO,QAAQ,OAAO,KAAQ,CAAC;CAGxC,OAAO,OAAO,oBAAI,IAAI,MAAM,oBAAoB,MAAM,OAAO,KAAK,KAAK,GAAG,CAAC;AAC7E,CAAC,CACH;AAwBF,MAAM,aACJ,MACA,QAC2E;CAC3E,QAAQ,MAAR;EACE,KAAK;EACL,KAAK,QACH,aAAa,WAAW,wBAAoB;EAC9C,KAAK;EACL,KAAK,YACH,QAAQ,WACN,SAAS,MAAM,MAAM,SACjB,WAAW,yBAAqB,IAChC,SAAS,aAAa,QAAQ,OAAO,QAAQ,EAAE,IAAI,CAAC,CAAC;EAC7D,KAAK,iBACH,QAAQ,WACN,SAAS,MAAM,MAAM,SACjB,WAAW,2BAAuB,IAClC,SAAS,aAAa,aAAa,OAAO,aAAa,EAAE,IAAI,CAAC,CAAC;EACvE,KAAK,cACH,QAAQ,WACN,SAAS,MAAM,MAAM,SACjB,WAAW,uBAAmB,IAC9B,SAAS,aAAa,kBAAkB,kBAAkB,EAAE,OAAO,IAAI,CAAC,CAAC;CACnF;AACF;AAEA,MAAM,kBAAkB,OAAO,GAAG,uBAAuB,CAAC,CAAC,WACzD,MACA,WACA,MACA,mBACA,MACA;CACA,MAAM,UAAU,OAAO;CACvB,MAAM,WAAW,eAAe,SAAS,KAAK,KAAK,QAAQ,WAAW;CACtE,MAAM,MAAM,QAAQ;CACpB,MAAM,SAAS,UAAU,MAAM,GAAG;CAClC,MAAM,QAAQ,oBAAoB,SAAS,KAAK,GAAG,aAAa,MAAM;CACtE,MAAM,UAAU,YAAY,SAAS;CAErC,MAAM,oBAAoB,eAAuB;EAC/C;EACA,WAAW;EACX,gBAAgB,qBAAqB,SAAS,KAAK,KAAK,IAAI,WAAW;EACvE,aAAa;CACf;CAEA,MAAM,oBAAoB,UACxB,MAAM,QAAQ,EACZ,OAAO,EAAE,KAAK,aACZ,KACG,OAAO,iBAAiB,MAAM,CAAC,CAAC,CAChC,KAAK,OAAO,GAAG,EAAE,cAAc,iBAAiB,MAAM,EAAE,CAAC,CAAC,EACjE,CAAC;CAEH,MAAM,oBACJ,YACA,OACA,eACiB;EACjB,OAAO;EACP;EACA;EACA;EACA;EACA;EACA;EACA,cAAc,CAAC,KAAK;EACpB,qBAAqB,KAAA;CACvB;CAEA,QAAQ,MAAR;EACE,KAAK;EACL,KAAK,QAAQ;GACX,MAAM,QAAQ,MAAM,UAAU,iBAAiB,KAAK;GAEpD,OAAO,iBAAiB,OAAO,QAAQ,cAAc,OAAO,QAAQ,IAAI,cACtE,QAAQ,OAAO,OAAO,EAAE,UAAU,SAAS,YAAY,GAAG,iBAAiB,SAAS,CAAC,CACvF;EACF;EACA,KAAK,kBAAkB;GACrB,MAAM,QAAQ,MAAM,UAAU,gBAAgB,KAAK;GAEnD,OAAO,iBACL,MACA,QAAQ,cAAc,OAAO,QAAQ,CAAC,CAAC,KAAK,OAAO,QAAQ,iBAAiB,SAAS,CAAC,CAAC,IACtF,cACC,QAAQ,OAAO,OAAO,EAAE,UAAU,SAAS,YAAY,GAAG,iBAAiB,SAAS,CAAC,CACzF;EACF;EACA,KAAK,YAAY;GACf,MAAM,QAAQ,MAAM,UAAU,oBAAoB,KAAK;GAEvD,OAAO,iBACL,MACA,QACG,cAAc,OAAO,QAAQ,CAAC,CAC9B,KAAK,OAAO,QAAQ,iBAAiB,aAAa,CAAC,CAAC,IACtD,cACC,QAAQ,OAAO,OAAO,EAAE,UAAU,SAAS,YAAY,GAAG,iBAAiB,SAAS,CAAC,CACzF;EACF;EACA,KAAK,iBAAiB;GACpB,MAAM,QAAQ,MAAM,UAAU,qBAAqB,KAAK;GAExD,MAAM,YAAY,eAAe,QAAQ,EACvC,YAAY,EAAE,KAAK,aACjB,OAAO,IAAI,aAAa;IACtB,MAAM,OAAO,OAAO;IAcpB,OAAO,EAAE,OAAO,GAAG,OAZG,KAAK,GACzB,kBACA,OAAO,QACP,KAAK,OAAO,YAAY,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,YAAY,MAAM,CAAC,CAAC,CACtE,EAQ0B,GAAG,OANN,KAAK,GAC1B,mBACA,OAAO,QACP,KAAK,OAAO,aAAa,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,aAAa,MAAM,CAAC,CAAC,CACxE,IAEuC;GACzC,CAAC,EACL,CAAC;GAED,OAAO,iBACL,MACA,QAAQ,cAAc,OAAO,QAAQ,CAAC,CAAC,KAAK,OAAO,QAAQ,SAAS,CAAC,IACpE,cACC,QAAQ,OAAO,OAAO,EAAE,UAAU,SAAS,YAAY,GAAG,iBAAiB,SAAS,CAAC,CACzF;EACF;EACA,KAAK,cAAc;GACjB,MAAM,gBAAgB,MAAM,UAAU,uBAAuB,KAAK;GAElE,MAAM,aAAa,oBAAoB,eAAe,mBACpD,WAAW,wBAAoB,CACjC;GAEA,MAAM,eAAe,MAAM,UAAU,iBAAiB,UAAU;GAEhE,MAAM,kBAAkB,gBAAgB,MAAM,iBAAiB,cAAc;IAC3E,kBAAkB,YAAY,sBAAsB,KAAK,EAAE,eAAe,QAAQ,KAAK,CAAC;IACxF,SAAS,EAAE,eAAe,mBAAmB,SAAS,EAAE;GAC1D,CAAC,CAAC,CAAC,KAAK,MAAM,QAAQ,iBAAiB,CAAC;GAExC,MAAM,iBAAkC,OAAO,qBAAqB,KAClE,eACA,OACF,CAAC,CAAC,KAAK,OAAO,QAAQ,eAAe,CAAC;GAEtC,MAAM,gBAAiC,OAAO,qBAAqB,KACjE,cACA,iBAAiB,SAAS,CAC5B;GAEA,MAAM,oBAAoB,OAAO,oBAAoB,KACnD,OAAO,QACL,oBAAoB,kBAAkB,CAAC,gBAAgB,aAAa,CAAC,CAAC,CAAC,KACrE,MAAM,QAAQ,qBAAqB,QAAQ,CAC7C,CACF,CACF;GAEA,MAAM,iBAAiB,WAAqB,kBAAkB,sBAAsB,MAAM;GAkC1F,OAAO;IA/BL,OAAO;IACP;IACA;IACA;IACA,YAAY;IACZ;IACA,YAAY,cACV,QAAQ,OACN,EAAE,YAAY;KAAE,IAAI,sBAAsB;KAAI,OAAO,sBAAsB;IAAM,EAAE,GACnF,EAAE,SAAS,SAAS,YAAY,GAChC,iBAAiB,SAAS,CAC5B;IACF,SAAS,iBAAiB;KACxB,MAAM,SAEF,CAAC,cAAc,QAAQ,CAAC;KAE5B,IAAI,iBAAiB,KAAA,GACnB,OAAO,KACL,cACE,iBAAiB,aAAa,cAAc,iBAAiB,gBAAgB,CAAC,CAChF,CACF;KAGF,OAAO;IACT;IACA,gBAAgB,iBACd,iBAAiB,aAAa,cAAc,iBAAiB,gBAAgB,CAAC;GAGrE;EACf;CACF;AACF,CAAC;;AAGD,MAAM,kBAAkB,qBAA6B,QAAgB,WAA2B;CAC9F,IAAI,OAAO,sBAAsB;CAEjC,KAAK,MAAM,QAAQ,QAAQ,OAAQ,KAAK,KAAK,MAAM,EAAE,IAAI,KAAK,WAAW,CAAC,IAAK;CAE/E,QAAS,OAAO,SAAU,UAAU;AACtC;AAEA,MAAM,iBACJ,MACA,UACA,KACA,aACsB;CACtB,QAAQ,MAAR;EACE,KAAK,oBACH,OAAO,0BAA0B,KAAK;EACxC,KAAK;GACH,IAAI,aAAa,UAAU,SAAS,IAAI,iBAAiB,GAAG,CAAC,GAC3D,OAAO,8BAA8B,KAAK;IACxC,QAAQ,EAAE,cAAc,iBAAiB,GAAG,EAAE;IAC9C,WAAW;GACb,CAAC;GAEH,IACE,aAAa,eACb,SAAS,IAAI,YAAY,GAAG,CAAC,KAC7B,SAAS,IAAI,aAAa,GAAG,CAAC,GAE9B,OAAO,8BAA8B,KAAK;IACxC,QAAQ,EAAE,OAAO,GAAG,YAAY,GAAG,EAAE,GAAG,aAAa,GAAG,IAAI;IAC5D,WAAW;GACb,CAAC;GAIH,OAAO,wBAAwB,KAAK;EAEtC,KAAK,kBACH,OAAO,wBAAwB,KAAK;CACxC;AACF;;AAGA,MAAM,iBAAiB,OAAO,GAAG,sBAAsB,CAAC,CAAC,WACvD,MACA,QACA,MACA;CACA,MAAM,UAAU,OAAO;CACvB,MAAM,SAAS,OAAO;CACtB,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,cAAc,OAAO,cAAc,OAAO,WAAW,OAAO,eAAe,CAAC;CAElF,IAAI,OAAO,OAAO,WAAW,GAAG;CAChC,MAAM,uBAAO,IAAI,IAAmC;CAEpD,KAAK,MAAM,SAAS,QAClB,IAAI,MAAM,YAAY,KAAA,GAAW,KAAK,IAAI,MAAM,QAAQ,cAAc,KAAK;CAE7E,KAAK,MAAM,OAAO,YAAY,OAAO;EACnC,IAAI,IAAI,UAAU,aAAa,IAAI,UAAU,aAAa;EAC1D,MAAM,QAAQ,KAAK,IAAI,IAAI,YAAY;EACvC,MAAM,cAAc,OAAO,cAAc,QAAQ,QAAQ,IAAI,YAAY,CAAC;EAE1E,IAAI,OAAO,OAAO,WAAW,GAAG;EAChC,MAAM,YAAY,OAAO,aAAa;EACtC,MAAM,MAAM,OAAO,KAAK,OAAO;EAE/B,IAAI,IAAI,UAAU,WAChB,KAAK,MAAM,QAAQ,YAAY,MAAM,SAAS,cAAc;GAC1D,IAAI,KAAK,UAAU;GAEnB,MAAM,OACJ,KAAK,qBAAqB,WAAW,IACjC,mBACC,KAAK,qBAAqB,GACzB,eAAe,WAAW,KAAK,YAAY,KAAK,qBAAqB,MAAM,CAC7E,KAAK;GAEX,OAAO,cACL,QAAQ,eACN,yBAAyB,KAAK;IAC5B,cAAc,IAAI;IAClB,YAAY,KAAK;IACjB,QAAQ;IACR,QAAQ,cAAc,KAAK,KAAK,eAAe,KAAK;IACpD,YAAY,cAAc,MAAM,KAAK,UAAU,KAAK,QAAQ;GAC9D,CAAC,CACH,CACF;EACF;OAEA,KAAK,MAAM,WAAW,YAAY,MAAM,SAAS,kBAAkB;GACjE,MAAM,WACJ,KAAK,kBAAkB,WAAW,IAC9B,aACC,KAAK,kBAAkB,GACtB,eAAe,WAAW,QAAQ,YAAY,KAAK,kBAAkB,MAAM,CAC7E,KAAK;GAEX,OAAO,cACL,QAAQ,gBACN,wBAAwB,KAAK;IAC3B,cAAc,IAAI;IAClB,YAAY,QAAQ;IACpB;IACA,UAAU;IACV,QAAQ,cAAc,KAAK,KAAK,aAAa,SAAS;GACxD,CAAC,CACH,CACF;EACF;CAEJ;AACF,CAAC;AAED,MAAM,wBACJ,YAC8B;CAC9B,MAAM,wBAAQ,IAAI,IAAkB;CAEpC,KAAK,MAAM,YAAY,SAAS;EAC9B,MAAM,UAAU,SAAS,OAAO;EAEhC,IACE,QAAQ,SAAS,uBACjB,QAAQ,SAAS,uBACjB,QAAQ,SAAS,kBAEb;OAAA,QAAQ,iBAAiB,KAAA,GAAW,MAAM,IAAI,QAAQ,YAAY;EAAA;CAE1E;CAEA,OAAO;AACT;;;;;AAMA,MAAM,aAAa,OAAO,OAAO,EAAE,cAAc,OAAO,OAAO,CAAC;AAChE,MAAM,kBAAkB,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,CAAC;AAC9D,MAAM,mBAAmB,OAAO,oBAAoB,UAAU;AAC9D,MAAM,wBAAwB,OAAO,oBAAoB,eAAe;AACxE,MAAM,mBAAmB,OAAO,oBAAoB,OAAO,MAAM;AAEjE,MAAM,uBACJ,MACA,SACA,aACiD;CACjD,MAAM,aAA4B,CAAC;CAEnC,MAAM,mBAAmB,OAAe,UAAwB;EAC9D,IAAI,CAAC,SAAS,IAAI,KAAK,GAAG,WAAW,KAAK,GAAG,MAAM,IAAI,MAAM,EAAE;CACjE;CAEA,KAAK,MAAM,YAAY,SAAS;EAC9B,MAAM,UAAU,SAAS,OAAO;EAEhC,IAAI,QAAQ,SAAS,qBAAqB,CAAC,QAAQ,WAAW;GAC5D,IAAI,QAAQ,aAAa,QAAQ;IAC/B,MAAM,SAAS,iBAAiB,QAAQ,MAAM;IAE9C,IAAI,OAAO,OAAO,MAAM,GAAG,gBAAgB,OAAO,MAAM,cAAc,aAAa;GACrF;GACA,IAAI,QAAQ,aAAa,aAAa;IACpC,MAAM,SAAS,sBAAsB,QAAQ,MAAM;IAEnD,IAAI,OAAO,OAAO,MAAM,GACtB,KAAK,MAAM,QAAQ,OAAO,MAAM,MAAM,MAAM,GAAG,GAC7C,gBAAgB,MAAM,uBAAuB;GAGnD;EACF;EACA,IAAI,QAAQ,SAAS,mBAAmB;GACtC,MAAM,SAAS,iBAAiB,QAAQ,MAAM;GAE9C,IAAI,OAAO,OAAO,MAAM,GAAG,gBAAgB,OAAO,OAAO,aAAa;EACxE;CACF;CAEA,OAAO,WAAW,WAAW,IACzB,OAAO,OACP,OAAO,KACL,wBAAwB,KAAK;EAC3B,MAAM,KAAK;EACX,SAAS,iDAAiD,WAAW,KAAK,IAAI;CAChF,CAAC,CACH;AACN;;;;;AAMA,MAAa,eAAe,OAAO,GAAG,oBAAoB,CAAC,CAAC,WAC1D,MACA,SACA;CACA,MAAM,UAAU,OAAO;CACvB,MAAM,SAAS,OAAO;CACtB,MAAM,QAAQ,OAAO;CACrB,MAAM,SAAS,OAAO;CACtB,MAAM,aAAa,OAAO;CAC1B,MAAM,SAAS,WAAW,KAAK,IAAI;CACnC,MAAM,OAAO,OAAO;CAGpB,MAAM,4BAAY,IAAI,IAA+B;CACrD,MAAM,kCAAkB,IAAI,IAA2B;CAEvD,KAAK,YAAY,SAAS,MAAM,cAAc;EAC5C,MAAM,OAAO,KAAK,OAAO,KAAK;EAE9B,IAAI,CAAC,UAAU,IAAI,IAAI,GAAG,UAAU,IAAI,MAAM,KAAK,IAAI;EACvD,MAAM,OAAO,gBAAgB,IAAI,IAAI,KAAK,CAAC;EAE3C,KAAK,KAAK,SAAS;EACnB,gBAAgB,IAAI,MAAM,IAAI;CAChC,CAAC;CACD,MAAM,QAA4B,CAAC;CAEnC,KAAK,MAAM,CAAC,MAAM,SAAS,WACzB,MAAM,KAAK,OAAO,gBAAgB,MAAM,MAAM,MAAM,gBAAgB,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC;CAG5F,MAAM,eAAe,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,OAAO,IAAI,CAAC,CAAC;CACpE,MAAM,SAAiC,CAAC;CAExC,KAAK,MAAM,CAAC,WAAW,SAAS,KAAK,YAAY,QAAQ,GAAG;EAC1D,MAAM,YAAY,KAAK,OAAO,KAAK;EACnC,MAAM,OAAO,aAAa,IAAI,SAAS;EAEvC,IAAI,SAAS,KAAA,GACX,OAAO,OAAO,wBAAwB,KAAK;GACzC,MAAM,KAAK;GACX,SAAS,cAAc,UAAU,0BAA0B;EAC7D,CAAC;EAEH,OAAO,KAAK;GAAE;GAAW;GAAM,SAAS,KAAA;EAAU,CAAC;CACrD;CACA,MAAM,gCAAgB,IAAI,IAAY;CAMtC,MAAM,WAA4B,CAChC,GAAG,KAAK,cAAc,KAAK,cAAwB;EAAE,QAAQ;EAAe;CAAS,EAAE,GACvF,GAAG,KAAK,YAAY,KAAK,cAAwB;EAAE,QAAQ;EAAW;CAAS,EAAE,CACnF;CAEA,MAAM,aAAa,OAAO,IAAI,aAAa;EACzC,IAAI,OAAO,MAAM,UAAU,MAAM,YAAY,KAAA,CAAS,GAAG,OAAO;EAChE,MAAM,cAAc,OAAO,cAAc,OAAO,WAAW,OAAO,eAAe,CAAC;EAElF,OAAO,OAAO,OAAO,WAAW,KAAK,MAAM,KAAK,YAAY,KAAK,CAAC,CAAC,WAAW;CAChF,CAAC;CAED,MAAM,YAAY,SAAS,SAAS,OAAO,SAAS,IAAI;CACxD,IAAI,SAAS;CACb,IAAI,YAAY;CAEhB,KAAK,IAAI,QAAQ,GAAG,QAAQ,WAAW,SAAS;EAC9C,SAAS,QAAQ;EACjB,MAAM,MAAM,SAAS;EAErB,IAAI,KAAK,WAAW,eAAe;GACjC,MAAM,WAAW,IAAI;GAErB,OAAO,WAAW,YAAY,QAC5B,QAAQ,WACJ,OAAO,KAAK,6BAA6B,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC,IAChE,OAAO,IACb;EACF,OAAO,IAAI,KAAK,WAAW,aAAa,SAAS,sBAAsB,KAAA,GACrE,OAAO,QAAQ,kBAAkB,IAAI,IAAI,QAAQ;EAKnD,KAAK,MAAM,SAAS,QAAQ;GAC1B,IAAI,MAAM,YAAY,KAAA,GAAW;GACjC,MAAM,UAAU,OAAO,cAAc,MAAM,KAAK,UAAU,MAAM,SAAS,CAAC;GAE1E,IAAI,OAAO,OAAO,OAAO,GAAG,MAAM,UAAU,QAAQ;EACtD;EAGA,MAAM,QAAQ,MACX,KAAK,UAAU;GAAE;GAAM,MAAM,OAAO;EAAE,EAAE,CAAC,CACzC,MAAM,MAAM,UAAU,KAAK,OAAO,MAAM,QAAQ,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,CAAC,CACnF,KAAK,EAAE,WAAW,IAAI;EAEzB,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,YAAY,KAAK,kBAAkB;GACzC,MAAM,eAAe,cAAc,KAAA,IAAY,KAAA,IAAY,OAAO,UAAU,EAAE;GAE9E,KAAK,MAAM,SAAS,KAAK,OAAO,YAAY,GAC1C,OAAO,cAAc,KAAK;EAE9B;EAGA,IAAI,SAAS,GACX,KAAK,MAAM,YAAY,KAAK,iBAAiB;GAC3C,MAAM,QAAQ,WAAW,OAAO;GAEhC,IAAI,cAAc,IAAI,KAAK,GAAG;GAC9B,MAAM,UAAU,OAAO,MAAM,EAAE;GAE/B,IAAI,YAAY,KAAA,GAAW;GAC3B,cAAc,IAAI,KAAK;GACvB,OAAO,cACL,QAAQ,MACN,aAAa,KAAK;IAChB,cAAc,QAAQ;IACtB,QAAQ;IACR,QAAQ,cAAc,KAAK,KAAK;GAClC,CAAC,CACH,CACF;EACF;EAIF,OAAO,eAAe,MAAM,QAAQ,IAAI;EAExC,OAAO,WAAW;EAClB,IAAI,SAAS,sBAAsB,KAAA,GAAW,OAAO,QAAQ,kBAAkB;EAE/E,OAAO,cAAc,QAAQ,WAAW;EAExC,OAAO,eAAe,MAAM,QAAQ,IAAI;EAExC,IAAI,OAAO,YAAY;GACrB,YAAY;GACZ;EACF;EACA,IAAI,SAAS,kBAAkB,KAAA,GAAW,OAAO,QAAQ;CAC3D;CAEA,IAAI,CAAC,WAAW;EACd,MAAM,cAAc,OAAO,cAAc,OAAO,WAAW,OAAO,eAAe,CAAC;EAElF,MAAM,SAAS,OAAO,OAAO,WAAW,IACpC,MAAM,KAAK,YAAY,KAAK,CAAC,CAC1B,KAAK,QAA4B,GAAG,IAAI,aAAa,GAAG,IAAI,MAAM,EAAE,CAAC,CACrE,KAAK,IAAI,IACZ;EAEJ,OAAO,OAAO,wBAAwB,KAAK;GACzC,MAAM,KAAK;GACX,SAAS,gCAAgC,UAAU,yBAAyB,OAAO,uBAAuB,OAAO,QAAQ,UAAU,MAAM,YAAY,KAAA,CAAS,CAAC,CAAC;EAClK,CAAC;CACH;CAIA,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,cAAsC,CAAC;CAE7C,MAAM,eAAe,OAAO,GAAG,oBAAoB,CAAC,CAAC,WACnD,UACA,MACA,YACA;EACA,MAAM,WAAW,OAAO,MAAM,OAAO,oBAAoB,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,KAC3E,OAAO,UAAU,UACf,wBAAwB,KAAK;GAC3B,MAAM,KAAK;GACX,SAAS,aAAa,SAAS,WAAW,OAAO,KAAK;EACxD,CAAC,CACH,CACF;EAEA,MAAM,OAAkC,CAAC;EAEzC,KAAK,MAAM,gBAAgB,qBAAqB,SAAS,OAAO,GAAG;GACjE,MAAM,QAAQ,OAAO,OAAO,OAAO,qBAAqB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,KAC9E,OAAO,UAAU,UACf,wBAAwB,KAAK;IAC3B,MAAM,KAAK;IACX,SAAS,aAAa,aAAa,WAAW,OAAO,KAAK;GAC5D,CAAC,CACH,CACF;GAEA,IAAI,OAAO,OAAO,KAAK,GAAG,KAAK,KAAK,MAAM,KAAK;EACjD;EAEA,MAAM,iBAAiB,IAAI,IACzB,SAAS,QAAQ,KAAK,aAAa,CAAC,SAAS,SAAS,OAAO,UAAU,CAAC,CAC1E;EAEA,MAAM,SAAS,OAAO,uBAAuB;GAC3C,QAAQ;GACR,aAAa;GACb;GACA,mBAAmB;EACrB,CAAC;EAED,IAAI,CAAC,OAAO,IAAI;GACd,MAAM,SAAS,OAAO,OACnB,QAAQ,UAAU,MAAM,WAAW,QAAQ,CAAC,CAC5C,KAAK,UAAU,GAAG,MAAM,KAAK,IAAI,MAAM,UAAU,UAAU,CAAC,CAC5D,KAAK,IAAI;GAEZ,OAAO,OAAO,wBAAwB,KAAK;IACzC,MAAM,KAAK;IACX,SAAS,yBAAyB,SAAS,IAAI,KAAK,KAAK;GAC3D,CAAC;EACH;EACA,IAAI,YACF,OAAO,oBAAoB,MAAM,SAAS,SAAS,QAAQ;EAE7D,YAAY,KACV,gBAAgB,KAAK;GACnB;GACA;GACA,iBAAiB,KAAK;GACtB,UAAU,OAAO;EACnB,CAAC,CACH;CACF,CAAC;CAED,KAAK,MAAM,QAAQ,OAAO;EACxB,OAAO,aAAa,KAAK,UAAU,KAAK,MAAM,KAAK,UAAU;EAE7D,KAAK,MAAM,aAAa,KAAK,mBAAmB;GAC9C,MAAM,UAAU,OAAO,UAAU,EAAE;GAEnC,IAAI,YAAY,KAAA,GAAW;GAC3B,MAAM,QAAQ,KAAK,cAAc,OAAO;GAExC,IAAI,UAAU,KAAA,GAAW;GAEzB,MAAM,cAAc,OAAO,OAAO,KAChC,MAAM,OAAO,oBAAoB,KAAK,EAAE,UAAU,MAAM,CAAC,CAAC,CAC5D;GAEA,IAAI,KAAK,UAAU,WAAW,KAAK,YAAY,MAAM,QAAQ,SAAS,GACpE,OAAO,aAAa,OAAO,SAAS,KAAK;EAE7C;CACF;CAEA,MAAM,cAAc,OAAO,QACxB,gBAAgB,qBAAqB,KAAK;EAAE,cAAc;EAAG,gBAAgB;CAAE,CAAC,CAAC,CAAC,CAClF,KACC,OAAO,UAAU,UACf,wBAAwB,KAAK;EAC3B,MAAM,KAAK;EACX,SAAS,2BAA2B,OAAO,KAAK;CAClD,CAAC,CACH,CACF;CAEF,IAAI,YAAY,QAAQ,SAAS,GAC/B,OAAO,OAAO,wBAAwB,KAAK;EACzC,MAAM,KAAK;EACX,SAAS,uCAAuC,YAAY,QACzD,KAAK,UAAU,GAAG,MAAM,aAAa,GAAG,MAAM,UAAU,EAAE,CAAC,CAC3D,KAAK,IAAI;CACd,CAAC;CAGH,OAAO,gBAAgB,KAAK;EAC1B,MAAM,KAAK;EACX;EACA,OAAO;EACP,iBAAiB,YAAY,QAAQ;CACvC,CAAC;AACH,CAAC"}

package/dist/code-executor.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"code-executor.mjs","names":[],"sources":["../src/code-executor-conformance.ts","../src/code-executor-substitute.ts"],"sourcesContent":["import {\n  CodeExecutionHost,\n  CodeExecutionLimits,\n  CodeExecutionNamespace,\n  CodeExecutionRequest,\n  CodeExecutor,\n  CodeHostCallFailure,\n  CodeHostCallSuccess,\n  NetworkAllowlist,\n  NetworkDisabled,\n  type CodeExecutionError,\n  type CodeExecutionResult,\n  type CodeHostCall,\n  type CodeHostCallResult,\n  type SandboxImplementation,\n} from \"@effect-agent/sandbox\";\nimport { Deferred, Duration, Effect, Fiber, Schema } from \"effect\";\n\n/**\n * Shared `CodeExecutor` conformance (TEST-015). Every adapter — the\n * deterministic `unisolated` substitute and each isolated adapter — runs\n * `codeExecutorConformanceCases` verbatim. Enforcement cases that only genuine\n * isolation can prove (ambient network denial, synchronous CPU runaway\n * termination) are NOT here; they belong to isolated adapters only\n * (testing spec §8.1).\n *\n * Cases assume the live `Clock` (the wall-clock case uses a short real\n * deadline) and take one fresh executor pass per case, so a suite may share\n * one executor Layer across cases.\n */\nexport class CodeExecutorConformanceViolation extends Schema.TaggedError<CodeExecutorConformanceViolation>()(\n  \"CodeExecutorConformanceViolation\",\n  {\n    caseName: Schema.String,\n    message: Schema.String,\n  },\n) {}\n\nexport interface CodeExecutorConformanceCase {\n  readonly name: string;\n  readonly run: Effect.Effect<void, CodeExecutorConformanceViolation, CodeExecutor>;\n}\n\nexport interface CodeExecutorConformanceOptions {\n  /** The posture the adapter under test must stamp on results and errors. */\n  readonly implementation: SandboxImplementation;\n}\n\nconst baseLimits = CodeExecutionLimits.make({\n  maxSourceBytes: 64 * 1024,\n  maxWallTime: Duration.seconds(10),\n  maxLogBytes: 16 * 1024,\n  maxResultBytes: 64 * 1024,\n  maxHostCalls: 8,\n  maxHostCallArgumentBytes: 16 * 1024,\n  maxHostCallResultBytes: 32 * 1024,\n});\n\nconst warehouseNamespace = CodeExecutionNamespace.make({\n  name: \"warehouse\",\n  methods: [\"query\", \"count\"],\n});\n\nconst makeRequest = (\n  source: string,\n  overrides?: {\n    readonly limits?: CodeExecutionLimits;\n    readonly namespaces?: ReadonlyArray<CodeExecutionNamespace>;\n    readonly network?: CodeExecutionRequest[\"network\"];\n  },\n): CodeExecutionRequest =>\n  CodeExecutionRequest.make({\n    language: \"javascript\",\n    source,\n    namespaces: overrides?.namespaces ?? [],\n    network: overrides?.network ?? NetworkDisabled.make(),\n    limits: overrides?.limits ?? baseLimits,\n  });\n\nconst unusedHost: CodeExecutionHost[\"Service\"] = {\n  call: () =>\n    Effect.die(\n      new Error(\"this conformance case expected no host call to reach the CodeExecutionHost\"),\n    ),\n};\n\nconst respondingHost = (\n  respond: (call: CodeHostCall) => CodeHostCallResult,\n): { readonly host: CodeExecutionHost[\"Service\"]; readonly calls: Array<CodeHostCall> } => {\n  const calls: Array<CodeHostCall> = [];\n\n  return {\n    calls,\n    host: {\n      call: (call) =>\n        Effect.sync(() => {\n          calls.push(call);\n\n          return respond(call);\n        }),\n    },\n  };\n};\n\nconst runPass = (\n  request: CodeExecutionRequest,\n  host: CodeExecutionHost[\"Service\"],\n): Effect.Effect<CodeExecutionResult, CodeExecutionError, CodeExecutor> =>\n  Effect.gen(function* () {\n    const executor = yield* CodeExecutor;\n\n    return yield* executor\n      .execute(request)\n      .pipe(Effect.provideService(CodeExecutionHost, CodeExecutionHost.of(host)));\n  }).pipe(Effect.scoped);\n\nconst violation = (caseName: string, message: string) =>\n  CodeExecutorConformanceViolation.make({ caseName, message });\n\nconst preview = (value: unknown): string => {\n  try {\n    return JSON.stringify(value)?.slice(0, 200) ?? String(value).slice(0, 200);\n  } catch {\n    return String(value).slice(0, 200);\n  }\n};\n\nconst expectSuccess = (\n  caseName: string,\n  request: CodeExecutionRequest,\n  host: CodeExecutionHost[\"Service\"],\n  check: (result: CodeExecutionResult) => string | undefined,\n): Effect.Effect<void, CodeExecutorConformanceViolation, CodeExecutor> =>\n  runPass(request, host).pipe(\n    Effect.mapError((error) =>\n      violation(caseName, `expected success, got ${error._tag}: ${preview(error)}`),\n    ),\n    Effect.flatMap((result) => {\n      const complaint = check(result);\n\n      return complaint === undefined ? Effect.void : Effect.fail(violation(caseName, complaint));\n    }),\n  );\n\nconst expectFailure = (\n  caseName: string,\n  request: CodeExecutionRequest,\n  host: CodeExecutionHost[\"Service\"],\n  tag: CodeExecutionError[\"_tag\"],\n  check?: (error: CodeExecutionError) => string | undefined,\n): Effect.Effect<void, CodeExecutorConformanceViolation, CodeExecutor> =>\n  runPass(request, host).pipe(\n    Effect.flip,\n    Effect.mapError((result) =>\n      violation(caseName, `expected ${tag}, but the pass succeeded with ${preview(result.value)}`),\n    ),\n    Effect.flatMap((error) => {\n      if (error._tag !== tag) {\n        return Effect.fail(\n          violation(caseName, `expected ${tag}, got ${error._tag}: ${preview(error)}`),\n        );\n      }\n      const complaint = check?.(error);\n\n      return complaint === undefined ? Effect.void : Effect.fail(violation(caseName, complaint));\n    }),\n  );\n\nexport const codeExecutorConformanceCases = (\n  options: CodeExecutorConformanceOptions,\n): ReadonlyArray<CodeExecutorConformanceCase> => {\n  const posture = options.implementation;\n\n  return [\n    {\n      name: \"TEST-015 executes bounded JSON computation and returns the program value\",\n      run: expectSuccess(\n        \"TEST-015 executes bounded JSON computation and returns the program value\",\n        makeRequest(\n          \"async () => { const xs = [1, 2, 3].map((n) => n * 2); return { xs, sum: xs.reduce((a, b) => a + b, 0) }; }\",\n        ),\n        unusedHost,\n        (result) =>\n          JSON.stringify(result.value) === JSON.stringify({ xs: [2, 4, 6], sum: 12 })\n            ? undefined\n            : `unexpected program value ${preview(result.value)}`,\n      ),\n    },\n    {\n      name: \"CAP-015 reports its isolation posture honestly in results and errors\",\n      run: Effect.gen(function* () {\n        const caseName = \"CAP-015 reports its isolation posture honestly in results and errors\";\n\n        const result = yield* runPass(makeRequest(\"async () => 1\"), unusedHost).pipe(\n          Effect.mapError((error) => violation(caseName, `expected success, got ${error._tag}`)),\n        );\n\n        if (\n          result.implementation.isolation !== posture.isolation ||\n          result.implementation.identity !== posture.identity\n        ) {\n          return yield* violation(\n            caseName,\n            `result posture ${preview(result.implementation)} does not match the declared ${preview(posture)}`,\n          );\n        }\n\n        const error = yield* runPass(makeRequest(\"async () => {\"), unusedHost).pipe(\n          Effect.flip,\n          Effect.mapError(() => violation(caseName, \"expected the invalid-source pass to fail\")),\n        );\n\n        // Every expected execution failure carries the posture; an adapter\n        // omitting the field must fail this case, not slip past a probe.\n        if (\n          error.implementation === undefined ||\n          error.implementation.isolation !== posture.isolation ||\n          error.implementation.identity !== posture.identity\n        ) {\n          return yield* violation(\n            caseName,\n            `error posture ${preview(error.implementation)} does not match the declared ${preview(posture)}`,\n          );\n        }\n      }),\n    },\n    {\n      name: \"TEST-015 routes host calls through the CodeExecutionHost in program order\",\n      run: Effect.gen(function* () {\n        const caseName =\n          \"TEST-015 routes host calls through the CodeExecutionHost in program order\";\n\n        const { host, calls } = respondingHost((call) =>\n          call.method === \"query\"\n            ? CodeHostCallSuccess.make({ value: { rows: [1, 2, 3] } })\n            : CodeHostCallSuccess.make({ value: 3 }),\n        );\n\n        const result = yield* runPass(\n          makeRequest(\n            \"async () => { const q = await warehouse.query({ sql: 'select' }); const c = await warehouse.count({ table: 't' }); return { rows: q.rows, count: c }; }\",\n            { namespaces: [warehouseNamespace] },\n          ),\n          host,\n        ).pipe(\n          Effect.mapError((error) =>\n            violation(caseName, `expected success, got ${error._tag}: ${preview(error)}`),\n          ),\n        );\n\n        if (JSON.stringify(result.value) !== JSON.stringify({ rows: [1, 2, 3], count: 3 })) {\n          return yield* violation(caseName, `unexpected value ${preview(result.value)}`);\n        }\n        const observed = calls.map((call) => `${call.namespace}.${call.method}`);\n\n        if (JSON.stringify(observed) !== JSON.stringify([\"warehouse.query\", \"warehouse.count\"])) {\n          return yield* violation(caseName, `unexpected host call order ${preview(observed)}`);\n        }\n        if (result.resourceUse.hostCalls !== 2) {\n          return yield* violation(\n            caseName,\n            `expected 2 accounted host calls, got ${result.resourceUse.hostCalls}`,\n          );\n        }\n      }),\n    },\n    {\n      name: \"TEST-015 a caught failed host call lets the program branch on the envelope\",\n      run: expectSuccess(\n        \"TEST-015 a caught failed host call lets the program branch on the envelope\",\n        makeRequest(\n          \"async () => { try { await warehouse.query({ sql: 'x' }); return 'unreachable'; } catch (envelope) { return { caught: envelope }; } }\",\n          { namespaces: [warehouseNamespace] },\n        ),\n        respondingHost(() =>\n          CodeHostCallFailure.make({ error: { _tag: \"ToolInputError\", message: \"bad input\" } }),\n        ).host,\n        (result) =>\n          JSON.stringify(result.value) ===\n          JSON.stringify({ caught: { _tag: \"ToolInputError\", message: \"bad input\" } })\n            ? undefined\n            : `the envelope did not round-trip: ${preview(result.value)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 an uncaught failed host call fails the program with the envelope\",\n      run: expectFailure(\n        \"TEST-015 an uncaught failed host call fails the program with the envelope\",\n        makeRequest(\"async () => warehouse.query({ sql: 'x' })\", {\n          namespaces: [warehouseNamespace],\n        }),\n        respondingHost(() =>\n          CodeHostCallFailure.make({ error: { _tag: \"PolicyDenied\", message: \"denied\" } }),\n        ).host,\n        \"CodeProgramFailedError\",\n        (error) =>\n          error._tag === \"CodeProgramFailedError\" &&\n          error.reason === \"rejected\" &&\n          JSON.stringify(error.thrown) ===\n            JSON.stringify({ _tag: \"PolicyDenied\", message: \"denied\" })\n            ? undefined\n            : `unexpected failure detail ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed on syntactically invalid source\",\n      run: expectFailure(\n        \"TEST-015 fails typed on syntactically invalid source\",\n        makeRequest(\"async () => {\"),\n        unusedHost,\n        \"CodeSourceError\",\n        (error) =>\n          error._tag === \"CodeSourceError\" && error.reason === \"invalid\"\n            ? undefined\n            : `expected reason invalid, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed when the expression is not one async function\",\n      run: expectFailure(\n        \"TEST-015 fails typed when the expression is not one async function\",\n        makeRequest(\"1 + 1\"),\n        unusedHost,\n        \"CodeSourceError\",\n        (error) =>\n          error._tag === \"CodeSourceError\" && error.reason === \"not-a-function\"\n            ? undefined\n            : `expected reason not-a-function, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed on source larger than the declared byte limit\",\n      run: expectFailure(\n        \"TEST-015 fails typed on source larger than the declared byte limit\",\n        makeRequest(`async () => \"${\"x\".repeat(2_000)}\"`, {\n          limits: CodeExecutionLimits.make({ ...baseLimits, maxSourceBytes: 256 }),\n        }),\n        unusedHost,\n        \"CodeSourceError\",\n        (error) =>\n          error._tag === \"CodeSourceError\" && error.reason === \"oversized\"\n            ? undefined\n            : `expected reason oversized, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 terminates a never-settling program at the wall-clock deadline\",\n      run: expectFailure(\n        \"TEST-015 terminates a never-settling program at the wall-clock deadline\",\n        makeRequest(\"async () => { await new Promise(() => {}); return 1; }\", {\n          limits: CodeExecutionLimits.make({ ...baseLimits, maxWallTime: Duration.millis(250) }),\n        }),\n        unusedHost,\n        \"CodeExecutionTimeoutError\",\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed when console output exceeds its byte budget\",\n      run: expectFailure(\n        \"TEST-015 fails typed when console output exceeds its byte budget\",\n        makeRequest(\n          \"async () => { for (let i = 0; i < 64; i += 1) { console.log('x'.repeat(256)); } return 1; }\",\n          { limits: CodeExecutionLimits.make({ ...baseLimits, maxLogBytes: 2_048 }) },\n        ),\n        unusedHost,\n        \"CodeOutputLimitError\",\n        (error) =>\n          error._tag === \"CodeOutputLimitError\" && error.surface === \"logs\"\n            ? undefined\n            : `expected surface logs, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed when the final result exceeds its byte budget\",\n      run: expectFailure(\n        \"TEST-015 fails typed when the final result exceeds its byte budget\",\n        makeRequest(\"async () => 'y'.repeat(4096)\", {\n          limits: CodeExecutionLimits.make({ ...baseLimits, maxResultBytes: 1_024 }),\n        }),\n        unusedHost,\n        \"CodeOutputLimitError\",\n        (error) =>\n          error._tag === \"CodeOutputLimitError\" && error.surface === \"result\"\n            ? undefined\n            : `expected surface result, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed when host calls exceed the executor cap\",\n      run: Effect.gen(function* () {\n        const caseName = \"TEST-015 fails typed when host calls exceed the executor cap\";\n        const { host, calls } = respondingHost(() => CodeHostCallSuccess.make({ value: null }));\n\n        yield* expectFailure(\n          caseName,\n          makeRequest(\n            \"async () => { await warehouse.query({}); await warehouse.query({}); await warehouse.query({}); return 1; }\",\n            {\n              namespaces: [warehouseNamespace],\n              limits: CodeExecutionLimits.make({ ...baseLimits, maxHostCalls: 2 }),\n            },\n          ),\n          host,\n          \"CodeHostCallLimitError\",\n        );\n        // The cap is enforced before dispatch: the over-limit call must never\n        // have reached the host, or an unauthorized side effect already ran.\n        if (calls.length !== 2) {\n          return yield* violation(\n            caseName,\n            `expected exactly 2 dispatched host calls under a cap of 2, observed ${calls.length}`,\n          );\n        }\n      }),\n    },\n    {\n      name: \"TEST-015 fails typed on a host outcome outside the protocol schema\",\n      run: expectFailure(\n        \"TEST-015 fails typed on a host outcome outside the protocol schema\",\n        makeRequest(\"async () => warehouse.query({})\", { namespaces: [warehouseNamespace] }),\n        {\n          // Deliberately violate the compile-time host contract to verify that an adapter\n          // independently decodes the runtime protocol boundary.\n          call: () => Effect.succeed({ bogus: true } as unknown as CodeHostCallResult),\n        },\n        \"CodeExecutionProtocolError\",\n      ),\n    },\n    {\n      name: \"TEST-015 surfaces an uncaught program throw with its bounded log capture\",\n      run: expectFailure(\n        \"TEST-015 surfaces an uncaught program throw with its bounded log capture\",\n        makeRequest(\n          \"async () => { console.log('before the failure'); throw new Error('deliberate'); }\",\n        ),\n        unusedHost,\n        \"CodeProgramFailedError\",\n        (error) =>\n          error._tag === \"CodeProgramFailedError\" &&\n          error.reason === \"threw\" &&\n          error.logs.some((line) => line.includes(\"before the failure\"))\n            ? undefined\n            : `expected a threw failure carrying the log capture, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 fails typed when the program returns a non-JSON value\",\n      run: expectFailure(\n        \"TEST-015 fails typed when the program returns a non-JSON value\",\n        makeRequest(\"async () => (() => 1)\"),\n        unusedHost,\n        \"CodeProgramFailedError\",\n        (error) =>\n          error._tag === \"CodeProgramFailedError\" && error.reason === \"non-json-result\"\n            ? undefined\n            : `expected reason non-json-result, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"CAP-015 rejects a network allowlist it cannot enforce with a typed unsupported error\",\n      run: expectFailure(\n        \"CAP-015 rejects a network allowlist it cannot enforce with a typed unsupported error\",\n        makeRequest(\"async () => 1\", {\n          network: NetworkAllowlist.make({ domains: [\"example.com\"], ports: [443] }),\n        }),\n        unusedHost,\n        \"CodeExecutorUnsupportedError\",\n        (error) =>\n          error._tag === \"CodeExecutorUnsupportedError\" && error.feature === \"network\"\n            ? undefined\n            : `expected feature network, got ${preview(error)}`,\n      ),\n    },\n    {\n      name: \"TEST-015 interruption reaches in-flight host calls and pass teardown\",\n      run: Effect.gen(function* () {\n        const caseName = \"TEST-015 interruption reaches in-flight host calls and pass teardown\";\n        const started = yield* Deferred.make<void>();\n        const witness = { hostCallInterrupted: false };\n\n        const host: CodeExecutionHost[\"Service\"] = {\n          call: () =>\n            Deferred.succeed(started, undefined).pipe(\n              Effect.andThen(Effect.never),\n              Effect.ensuring(\n                Effect.sync(() => {\n                  witness.hostCallInterrupted = true;\n                }),\n              ),\n            ),\n        };\n\n        const fiber = yield* runPass(\n          makeRequest(\"async () => warehouse.query({})\", { namespaces: [warehouseNamespace] }),\n          host,\n        ).pipe(Effect.forkChild);\n\n        // Guard against a broken adapter that settles the pass without ever\n        // reaching the host: the case must report a violation, not hang.\n        const winner = yield* Effect.raceFirst(\n          Deferred.await(started).pipe(Effect.as(\"started\" as const)),\n          Fiber.join(fiber).pipe(Effect.exit, Effect.as(\"exited\" as const)),\n        );\n\n        if (winner === \"exited\") {\n          return yield* violation(\n            caseName,\n            \"the pass settled before any host call reached the CodeExecutionHost\",\n          );\n        }\n        yield* Fiber.interrupt(fiber);\n        if (!witness.hostCallInterrupted) {\n          return yield* violation(\n            caseName,\n            \"interrupting the pass did not interrupt the in-flight host call\",\n          );\n        }\n      }),\n    },\n  ];\n};\n","import {\n  CodeExecutionHost,\n  CodeExecutionProtocolError,\n  CodeExecutionResourceUse,\n  CodeExecutionResult,\n  CodeExecutionTimeoutError,\n  CodeExecutor,\n  type CodeExecutorExecute,\n  CodeExecutorUnsupportedError,\n  CodeHostCall,\n  CodeHostCallLimitError,\n  CodeHostCallResult,\n  CodeOutputLimitError,\n  CodeProgramFailedError,\n  CodeSourceError,\n  SandboxImplementation,\n  type CodeExecutionLimits,\n  type CodeExecutionNamespace,\n  type CodeExecutionRequest,\n} from \"@effect-agent/sandbox\";\nimport { Clock, Duration, Effect, Fiber, Layer, Option, Queue, Schema } from \"effect\";\n\n/**\n * The deterministic in-process executor substitute (C1 of ADR-0017). It runs\n * the generated program on the host JavaScript engine with best-effort global\n * shadowing only, so it self-identifies as `unisolated` and is never a\n * security boundary (CAP-010, CAP-015). It exists to prove the public\n * `CodeExecutor` contract and to drive deterministic capability tests.\n */\nexport const inProcessCodeExecutorImplementation = SandboxImplementation.make({\n  isolation: \"unisolated\",\n  identity: \"in-process-javascript\",\n});\n\n// These two caps mirror the wire schema bounds (`BoundedLogs` is at most\n// 4096 lines of at most 16 KiB each): capture must stay inside what\n// `CodeExecutionResult` can carry. A line over the per-line cap is truncated\n// with an explicit `…` marker; exceeding either the byte budget or the line\n// cap fails the pass typed.\nconst MAX_LOG_LINES = 4_096;\nconst MAX_LOG_LINE_CHARACTERS = 16_000;\nconst MAX_THROWN_CHARACTERS = 4_000;\n\nconst utf8ByteLength = (value: string): number => new TextEncoder().encode(value).byteLength;\n\n/**\n * Ambient globals shadowed inside the harness. Shadowing blocks the obvious\n * identifier paths only; a determined program can still escape, which is\n * exactly why this executor reports `unisolated` and the isolated network and\n * CPU enforcement conformance cases run only against isolated adapters.\n */\nconst shadowedGlobals = [\n  \"fetch\",\n  \"process\",\n  \"require\",\n  \"module\",\n  \"exports\",\n  \"global\",\n  \"globalThis\",\n  \"XMLHttpRequest\",\n  \"WebSocket\",\n  \"Deno\",\n  \"Bun\",\n] as const;\n\nclass LogLimitSignal {\n  constructor(readonly observed: number) {}\n}\n\nclass EvaluationThrew {\n  constructor(readonly inner: unknown) {}\n}\n\nclass NotAFunction {\n  constructor(readonly actual: string) {}\n}\n\ninterface LogCapture {\n  readonly lines: Array<string>;\n  bytes: number;\n}\n\n/**\n * Total, defect-free rendering of untrusted values: a hostile Proxy can throw\n * from property access, `toString`, and `Symbol.toPrimitive`, and an expected\n * program failure must never escape the typed channel as a defect while its\n * diagnostics are being serialized.\n */\nconst formatLogValue = (value: unknown): string => {\n  try {\n    if (typeof value === \"string\") {\n      return value;\n    }\n\n    return JSON.stringify(value) ?? String(value);\n  } catch {\n    try {\n      return String(value);\n    } catch {\n      return \"[unprintable value]\";\n    }\n  }\n};\n\nconst makeConsole = (capture: LogCapture, limits: CodeExecutionLimits) => {\n  const write = (...values: ReadonlyArray<unknown>): void => {\n    const joined = values.map(formatLogValue).join(\" \");\n\n    const line =\n      joined.length > MAX_LOG_LINE_CHARACTERS\n        ? `${joined.slice(0, MAX_LOG_LINE_CHARACTERS - 1)}…`\n        : joined;\n\n    const bytes = utf8ByteLength(line);\n\n    if (capture.lines.length >= MAX_LOG_LINES || capture.bytes + bytes > limits.maxLogBytes) {\n      throw new LogLimitSignal(capture.bytes + bytes);\n    }\n    capture.lines.push(line);\n    capture.bytes += bytes;\n  };\n\n  return { debug: write, error: write, info: write, log: write, warn: write };\n};\n\ninterface PendingHostCall {\n  readonly namespace: string;\n  readonly method: string;\n  readonly argument: unknown;\n  readonly resolve: (value: unknown) => void;\n  readonly reject: (reason: unknown) => void;\n}\n\nconst buildNamespaceObject = (\n  namespace: CodeExecutionNamespace,\n  offer: (pending: PendingHostCall) => void,\n): Record<string, unknown> => {\n  const methods: Record<string, unknown> = {};\n\n  for (const method of namespace.methods) {\n    methods[method] = (argument: unknown) =>\n      new Promise((resolve, reject) => {\n        offer({ namespace: namespace.name, method, argument, resolve, reject });\n      });\n  }\n\n  return methods;\n};\n\nconst boundedText = (value: unknown): string => {\n  try {\n    const text = value instanceof Error ? `${value.name}: ${value.message}` : formatLogValue(value);\n\n    return text.slice(0, MAX_THROWN_CHARACTERS);\n  } catch {\n    return \"[unserializable thrown value]\";\n  }\n};\n\n/** Schema decoding of hostile values may itself throw through trap getters. */\nconst safeDecodeJson = (value: unknown): Option.Option<Schema.Json> => {\n  try {\n    return Schema.decodeUnknownOption(Schema.Json)(value);\n  } catch {\n    return Option.none();\n  }\n};\n\nconst boundedThrown = (value: unknown): Schema.Json => {\n  const decoded = safeDecodeJson(value);\n\n  if (Option.isSome(decoded)) {\n    try {\n      const encoded = JSON.stringify(decoded.value);\n\n      if (encoded !== undefined && encoded.length <= MAX_THROWN_CHARACTERS) {\n        return decoded.value;\n      }\n    } catch {\n      // fall through to the bounded string form\n    }\n  }\n\n  return boundedText(value);\n};\n\nconst encodedJsonByteLength = (value: Schema.Json): number | undefined => {\n  try {\n    const encoded = JSON.stringify(value);\n\n    return encoded === undefined ? undefined : utf8ByteLength(encoded);\n  } catch {\n    return undefined;\n  }\n};\n\n/** Host outcomes are protocol input; a hostile value must not defect mid-decode. */\nconst decodeHostOutcome = (value: unknown): Option.Option<CodeHostCallResult> => {\n  try {\n    return Schema.decodeUnknownOption(CodeHostCallResult)(value);\n  } catch {\n    return Option.none();\n  }\n};\n\nconst validateRequest = (\n  request: CodeExecutionRequest,\n): Effect.Effect<void, CodeExecutorUnsupportedError | CodeSourceError> =>\n  Effect.gen(function* () {\n    if (request.network._tag !== \"NetworkDisabled\") {\n      return yield* CodeExecutorUnsupportedError.make({\n        implementation: inProcessCodeExecutorImplementation,\n        feature: \"network\",\n        message:\n          \"The unisolated in-process executor cannot enforce an egress allowlist; only NetworkDisabled is accepted, and even that is shadowed rather than enforced\",\n      });\n    }\n    if (request.limits.cpuMillis !== undefined) {\n      return yield* CodeExecutorUnsupportedError.make({\n        implementation: inProcessCodeExecutorImplementation,\n        feature: \"cpu-limit\",\n        message:\n          \"The unisolated in-process executor shares the host engine and cannot enforce a CPU limit\",\n      });\n    }\n    const reservedNames = new Set<string>([...shadowedGlobals, \"console\"]);\n    const seen = new Set<string>();\n\n    for (const namespace of request.namespaces) {\n      if (reservedNames.has(namespace.name) || seen.has(namespace.name)) {\n        return yield* CodeExecutorUnsupportedError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          feature: \"namespaces\",\n          message: `Namespace ${namespace.name} collides with a harness binding or another namespace`,\n        });\n      }\n      seen.add(namespace.name);\n    }\n    const sourceBytes = utf8ByteLength(request.source);\n\n    if (sourceBytes > request.limits.maxSourceBytes) {\n      return yield* CodeSourceError.make({\n        implementation: inProcessCodeExecutorImplementation,\n        reason: \"oversized\",\n        message: `Source is ${sourceBytes} bytes; the request allows ${request.limits.maxSourceBytes}`,\n      });\n    }\n  });\n\nconst serveHostCalls = (\n  host: CodeExecutionHost[\"Service\"],\n  queue: Queue.Queue<PendingHostCall>,\n  limits: CodeExecutionLimits,\n  capture: LogCapture,\n  counter: { calls: number },\n): Effect.Effect<\n  never,\n  CodeHostCallLimitError | CodeOutputLimitError | CodeExecutionProtocolError\n> =>\n  Effect.gen(function* () {\n    while (true) {\n      const pending = yield* Queue.take(queue);\n\n      counter.calls += 1;\n      if (counter.calls > limits.maxHostCalls) {\n        return yield* CodeHostCallLimitError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          limit: limits.maxHostCalls,\n          logs: [...capture.lines],\n        });\n      }\n      const argument = safeDecodeJson(pending.argument);\n\n      if (Option.isNone(argument)) {\n        pending.reject(new TypeError(\"host call arguments must be JSON values\"));\n        continue;\n      }\n      const argumentBytes = encodedJsonByteLength(argument.value);\n\n      if (argumentBytes === undefined || argumentBytes > limits.maxHostCallArgumentBytes) {\n        return yield* CodeOutputLimitError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          surface: \"host-call-argument\",\n          limit: limits.maxHostCallArgumentBytes,\n          observed: argumentBytes ?? 0,\n          logs: [...capture.lines],\n        });\n      }\n\n      const rawOutcome = yield* host.call(\n        CodeHostCall.make({\n          namespace: pending.namespace,\n          method: pending.method,\n          argument: argument.value,\n        }),\n      );\n\n      const outcome = decodeHostOutcome(rawOutcome);\n\n      if (Option.isNone(outcome)) {\n        return yield* CodeExecutionProtocolError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          message: \"The execution host returned a value outside the CodeHostCallResult schema\",\n        });\n      }\n      if (outcome.value._tag === \"CodeHostCallFailure\") {\n        pending.reject(outcome.value.error);\n        continue;\n      }\n      const resultBytes = encodedJsonByteLength(outcome.value.value);\n\n      if (resultBytes === undefined || resultBytes > limits.maxHostCallResultBytes) {\n        return yield* CodeOutputLimitError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          surface: \"host-call-result\",\n          limit: limits.maxHostCallResultBytes,\n          observed: resultBytes ?? 0,\n          logs: [...capture.lines],\n        });\n      }\n      pending.resolve(outcome.value.value);\n    }\n  });\n\nconst classifyProgramFailure = (\n  thrown: unknown,\n  limits: CodeExecutionLimits,\n  capture: LogCapture,\n): CodeOutputLimitError | CodeSourceError | CodeProgramFailedError => {\n  const inner = thrown instanceof EvaluationThrew ? thrown.inner : thrown;\n\n  if (inner instanceof LogLimitSignal) {\n    return CodeOutputLimitError.make({\n      implementation: inProcessCodeExecutorImplementation,\n      surface: \"logs\",\n      limit: limits.maxLogBytes,\n      observed: inner.observed,\n      logs: [...capture.lines],\n    });\n  }\n  if (inner instanceof NotAFunction) {\n    return CodeSourceError.make({\n      implementation: inProcessCodeExecutorImplementation,\n      reason: \"not-a-function\",\n      message: `The source expression evaluated to ${inner.actual}; it must evaluate to one async function`,\n    });\n  }\n  // An async function converts a body-level `throw` into a rejection, so the\n  // split is by value shape: exception-like values read as `threw`, plain\n  // rejection values (an uncaught host failure envelope) read as `rejected`.\n  const reason = thrown instanceof EvaluationThrew || inner instanceof Error ? \"threw\" : \"rejected\";\n\n  return CodeProgramFailedError.make({\n    implementation: inProcessCodeExecutorImplementation,\n    reason,\n    thrown: boundedThrown(inner),\n    message: boundedText(inner),\n    logs: [...capture.lines],\n  });\n};\n\nconst executeInProcess: CodeExecutorExecute = Effect.fn(\"InProcessCodeExecutor.execute\")(\n  function* (request) {\n    yield* validateRequest(request);\n    const host = yield* CodeExecutionHost;\n    const capture: LogCapture = { lines: [], bytes: 0 };\n    const counter = { calls: 0 };\n    const queue = yield* Queue.unbounded<PendingHostCall>();\n\n    const factory = yield* Effect.try({\n      try: () =>\n        // This substitute intentionally evaluates authored test programs in-process and reports\n        // an `unisolated` posture. Real adapters own the security boundary and never use this path.\n        // oxlint-disable-next-line typescript/no-implied-eval\n        new Function(\n          ...shadowedGlobals,\n          \"console\",\n          ...request.namespaces.map((namespace) => namespace.name),\n          `\"use strict\";\\nreturn (\\n${request.source}\\n);`,\n        ),\n      catch: (cause) =>\n        CodeSourceError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          reason: \"invalid\",\n          message: boundedText(cause),\n        }),\n    });\n\n    const harnessConsole = makeConsole(capture, request.limits);\n    // Admission is enforced at call creation, not only at the single-consumer\n    // dequeue: a burst of unawaited calls can enqueue at most one entry past\n    // the cap (the entry the server fails the pass on); everything beyond is\n    // rejected synchronously, so the queue stays bounded against hostile\n    // programs.\n    let issuedHostCalls = 0;\n\n    const namespaceObjects = request.namespaces.map((namespace) =>\n      buildNamespaceObject(namespace, (pending) => {\n        issuedHostCalls += 1;\n        if (issuedHostCalls > request.limits.maxHostCalls + 1) {\n          pending.reject(new Error(`host-call limit of ${request.limits.maxHostCalls} exceeded`));\n\n          return;\n        }\n        Queue.offerUnsafe(queue, pending);\n      }),\n    );\n\n    const server = yield* serveHostCalls(host, queue, request.limits, capture, counter).pipe(\n      Effect.forkScoped,\n    );\n\n    const program = Effect.tryPromise({\n      try: async () => {\n        let candidate: unknown;\n\n        try {\n          candidate = factory(\n            ...shadowedGlobals.map(() => undefined),\n            harnessConsole,\n            ...namespaceObjects,\n          );\n        } catch (cause) {\n          throw new EvaluationThrew(cause);\n        }\n        if (typeof candidate !== \"function\") {\n          throw new EvaluationThrew(new NotAFunction(typeof candidate));\n        }\n        let outcome: unknown;\n\n        try {\n          outcome = candidate();\n        } catch (cause) {\n          throw new EvaluationThrew(cause);\n        }\n\n        return await Promise.resolve(outcome);\n      },\n      catch: (thrown) => classifyProgramFailure(thrown, request.limits, capture),\n    });\n\n    const startedAt = yield* Clock.currentTimeMillis;\n\n    // The wall-clock deadline interrupts only at asynchronous suspension\n    // points: a synchronous runaway shares the host thread and cannot be\n    // stopped in-process — exactly why the platform CPU enforcement cases\n    // belong to isolated adapters only (testing spec §8.1). The server fiber\n    // is interrupted when the pass settles so no host call outlives the\n    // program that issued it.\n    const returned = yield* Effect.raceFirst(program, Fiber.join(server)).pipe(\n      Effect.timeoutOrElse({\n        duration: request.limits.maxWallTime,\n        orElse: () =>\n          CodeExecutionTimeoutError.make({\n            implementation: inProcessCodeExecutorImplementation,\n            kind: \"wall-clock\",\n            maxWallTime: request.limits.maxWallTime,\n            logs: [...capture.lines],\n          }),\n      }),\n      Effect.ensuring(Fiber.interrupt(server)),\n    );\n\n    const finishedAt = yield* Clock.currentTimeMillis;\n\n    // An unawaited burst can outrun the server: the program may return before\n    // the over-limit entry is dequeued, so the admission counter is the\n    // authority — a pass that ISSUED more calls than the cap fails even when\n    // its promise settled first.\n    if (issuedHostCalls > request.limits.maxHostCalls) {\n      return yield* CodeHostCallLimitError.make({\n        implementation: inProcessCodeExecutorImplementation,\n        limit: request.limits.maxHostCalls,\n        logs: [...capture.lines],\n      });\n    }\n\n    const value = yield* Schema.decodeUnknownEffect(Schema.Json)(returned).pipe(\n      Effect.mapError(() =>\n        CodeProgramFailedError.make({\n          implementation: inProcessCodeExecutorImplementation,\n          reason: \"non-json-result\",\n          thrown: null,\n          message: \"The program must return a JSON value\",\n          logs: [...capture.lines],\n        }),\n      ),\n    );\n\n    const resultBytes = encodedJsonByteLength(value);\n\n    if (resultBytes === undefined || resultBytes > request.limits.maxResultBytes) {\n      return yield* CodeOutputLimitError.make({\n        implementation: inProcessCodeExecutorImplementation,\n        surface: \"result\",\n        limit: request.limits.maxResultBytes,\n        observed: resultBytes ?? 0,\n        logs: [...capture.lines],\n      });\n    }\n\n    return CodeExecutionResult.make({\n      implementation: inProcessCodeExecutorImplementation,\n      value,\n      logs: [...capture.lines],\n      resourceUse: CodeExecutionResourceUse.make({\n        wallTime: Duration.millis(Math.max(0, finishedAt - startedAt)),\n        hostCalls: counter.calls,\n        logBytes: capture.bytes,\n        resultBytes,\n      }),\n    });\n  },\n);\n\n/**\n * Layer providing the unisolated in-process `CodeExecutor` substitute. The\n * per-pass `CodeExecutionHost` stays in the caller's requirement channel, the\n * same as every real adapter.\n */\nexport const inProcessCodeExecutorLayer: Layer.Layer<CodeExecutor> = Layer.succeed(CodeExecutor)(\n  CodeExecutor.of({ execute: executeInProcess }),\n);\n"],"mappings":";;;;;;;;;;;;;;;AA8BA,IAAa,mCAAb,cAAsD,OAAO,YAA8C,CAAC,CAC1G,oCACA;CACE,UAAU,OAAO;CACjB,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;AAYH,MAAM,aAAa,oBAAoB,KAAK;CAC1C,gBAAgB;CAChB,aAAa,SAAS,QAAQ,EAAE;CAChC,aAAa;CACb,gBAAgB;CAChB,cAAc;CACd,0BAA0B;CAC1B,wBAAwB;AAC1B,CAAC;AAED,MAAM,qBAAqB,uBAAuB,KAAK;CACrD,MAAM;CACN,SAAS,CAAC,SAAS,OAAO;AAC5B,CAAC;AAED,MAAM,eACJ,QACA,cAMA,qBAAqB,KAAK;CACxB,UAAU;CACV;CACA,YAAY,WAAW,cAAc,CAAC;CACtC,SAAS,WAAW,WAAW,gBAAgB,KAAK;CACpD,QAAQ,WAAW,UAAU;AAC/B,CAAC;AAEH,MAAM,aAA2C,EAC/C,YACE,OAAO,oBACL,IAAI,MAAM,4EAA4E,CACxF,EACJ;AAEA,MAAM,kBACJ,YACyF;CACzF,MAAM,QAA6B,CAAC;CAEpC,OAAO;EACL;EACA,MAAM,EACJ,OAAO,SACL,OAAO,WAAW;GAChB,MAAM,KAAK,IAAI;GAEf,OAAO,QAAQ,IAAI;EACrB,CAAC,EACL;CACF;AACF;AAEA,MAAM,WACJ,SACA,SAEA,OAAO,IAAI,aAAa;CAGtB,OAAO,QAAO,OAFU,aAAA,CAGrB,QAAQ,OAAO,CAAC,CAChB,KAAK,OAAO,eAAe,mBAAmB,kBAAkB,GAAG,IAAI,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC,KAAK,OAAO,MAAM;AAEvB,MAAM,aAAa,UAAkB,YACnC,iCAAiC,KAAK;CAAE;CAAU;AAAQ,CAAC;AAE7D,MAAM,WAAW,UAA2B;CAC1C,IAAI;EACF,OAAO,KAAK,UAAU,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG,KAAK,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,GAAG;CAC3E,QAAQ;EACN,OAAO,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,GAAG;CACnC;AACF;AAEA,MAAM,iBACJ,UACA,SACA,MACA,UAEA,QAAQ,SAAS,IAAI,CAAC,CAAC,KACrB,OAAO,UAAU,UACf,UAAU,UAAU,yBAAyB,MAAM,KAAK,IAAI,QAAQ,KAAK,GAAG,CAC9E,GACA,OAAO,SAAS,WAAW;CACzB,MAAM,YAAY,MAAM,MAAM;CAE9B,OAAO,cAAc,KAAA,IAAY,OAAO,OAAO,OAAO,KAAK,UAAU,UAAU,SAAS,CAAC;AAC3F,CAAC,CACH;AAEF,MAAM,iBACJ,UACA,SACA,MACA,KACA,UAEA,QAAQ,SAAS,IAAI,CAAC,CAAC,KACrB,OAAO,MACP,OAAO,UAAU,WACf,UAAU,UAAU,YAAY,IAAI,gCAAgC,QAAQ,OAAO,KAAK,GAAG,CAC7F,GACA,OAAO,SAAS,UAAU;CACxB,IAAI,MAAM,SAAS,KACjB,OAAO,OAAO,KACZ,UAAU,UAAU,YAAY,IAAI,QAAQ,MAAM,KAAK,IAAI,QAAQ,KAAK,GAAG,CAC7E;CAEF,MAAM,YAAY,QAAQ,KAAK;CAE/B,OAAO,cAAc,KAAA,IAAY,OAAO,OAAO,OAAO,KAAK,UAAU,UAAU,SAAS,CAAC;AAC3F,CAAC,CACH;AAEF,MAAa,gCACX,YAC+C;CAC/C,MAAM,UAAU,QAAQ;CAExB,OAAO;EACL;GACE,MAAM;GACN,KAAK,cACH,4EACA,YACE,4GACF,GACA,aACC,WACC,KAAK,UAAU,OAAO,KAAK,MAAM,KAAK,UAAU;IAAE,IAAI;KAAC;KAAG;KAAG;IAAC;IAAG,KAAK;GAAG,CAAC,IACtE,KAAA,IACA,4BAA4B,QAAQ,OAAO,KAAK,GACxD;EACF;EACA;GACE,MAAM;GACN,KAAK,OAAO,IAAI,aAAa;IAC3B,MAAM,WAAW;IAEjB,MAAM,SAAS,OAAO,QAAQ,YAAY,eAAe,GAAG,UAAU,CAAC,CAAC,KACtE,OAAO,UAAU,UAAU,UAAU,UAAU,yBAAyB,MAAM,MAAM,CAAC,CACvF;IAEA,IACE,OAAO,eAAe,cAAc,QAAQ,aAC5C,OAAO,eAAe,aAAa,QAAQ,UAE3C,OAAO,OAAO,UACZ,UACA,kBAAkB,QAAQ,OAAO,cAAc,EAAE,+BAA+B,QAAQ,OAAO,GACjG;IAGF,MAAM,QAAQ,OAAO,QAAQ,YAAY,eAAe,GAAG,UAAU,CAAC,CAAC,KACrE,OAAO,MACP,OAAO,eAAe,UAAU,UAAU,0CAA0C,CAAC,CACvF;IAIA,IACE,MAAM,mBAAmB,KAAA,KACzB,MAAM,eAAe,cAAc,QAAQ,aAC3C,MAAM,eAAe,aAAa,QAAQ,UAE1C,OAAO,OAAO,UACZ,UACA,iBAAiB,QAAQ,MAAM,cAAc,EAAE,+BAA+B,QAAQ,OAAO,GAC/F;GAEJ,CAAC;EACH;EACA;GACE,MAAM;GACN,KAAK,OAAO,IAAI,aAAa;IAC3B,MAAM,WACJ;IAEF,MAAM,EAAE,MAAM,UAAU,gBAAgB,SACtC,KAAK,WAAW,UACZ,oBAAoB,KAAK,EAAE,OAAO,EAAE,MAAM;KAAC;KAAG;KAAG;IAAC,EAAE,EAAE,CAAC,IACvD,oBAAoB,KAAK,EAAE,OAAO,EAAE,CAAC,CAC3C;IAEA,MAAM,SAAS,OAAO,QACpB,YACE,2JACA,EAAE,YAAY,CAAC,kBAAkB,EAAE,CACrC,GACA,IACF,CAAC,CAAC,KACA,OAAO,UAAU,UACf,UAAU,UAAU,yBAAyB,MAAM,KAAK,IAAI,QAAQ,KAAK,GAAG,CAC9E,CACF;IAEA,IAAI,KAAK,UAAU,OAAO,KAAK,MAAM,KAAK,UAAU;KAAE,MAAM;MAAC;MAAG;MAAG;KAAC;KAAG,OAAO;IAAE,CAAC,GAC/E,OAAO,OAAO,UAAU,UAAU,oBAAoB,QAAQ,OAAO,KAAK,GAAG;IAE/E,MAAM,WAAW,MAAM,KAAK,SAAS,GAAG,KAAK,UAAU,GAAG,KAAK,QAAQ;IAEvE,IAAI,KAAK,UAAU,QAAQ,MAAM,KAAK,UAAU,CAAC,mBAAmB,iBAAiB,CAAC,GACpF,OAAO,OAAO,UAAU,UAAU,8BAA8B,QAAQ,QAAQ,GAAG;IAErF,IAAI,OAAO,YAAY,cAAc,GACnC,OAAO,OAAO,UACZ,UACA,wCAAwC,OAAO,YAAY,WAC7D;GAEJ,CAAC;EACH;EACA;GACE,MAAM;GACN,KAAK,cACH,8EACA,YACE,wIACA,EAAE,YAAY,CAAC,kBAAkB,EAAE,CACrC,GACA,qBACE,oBAAoB,KAAK,EAAE,OAAO;IAAE,MAAM;IAAkB,SAAS;GAAY,EAAE,CAAC,CACtF,CAAC,CAAC,OACD,WACC,KAAK,UAAU,OAAO,KAAK,MAC3B,KAAK,UAAU,EAAE,QAAQ;IAAE,MAAM;IAAkB,SAAS;GAAY,EAAE,CAAC,IACvE,KAAA,IACA,oCAAoC,QAAQ,OAAO,KAAK,GAChE;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,6EACA,YAAY,6CAA6C,EACvD,YAAY,CAAC,kBAAkB,EACjC,CAAC,GACD,qBACE,oBAAoB,KAAK,EAAE,OAAO;IAAE,MAAM;IAAgB,SAAS;GAAS,EAAE,CAAC,CACjF,CAAC,CAAC,MACF,2BACC,UACC,MAAM,SAAS,4BACf,MAAM,WAAW,cACjB,KAAK,UAAU,MAAM,MAAM,MACzB,KAAK,UAAU;IAAE,MAAM;IAAgB,SAAS;GAAS,CAAC,IACxD,KAAA,IACA,6BAA6B,QAAQ,KAAK,GAClD;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,wDACA,YAAY,eAAe,GAC3B,YACA,oBACC,UACC,MAAM,SAAS,qBAAqB,MAAM,WAAW,YACjD,KAAA,IACA,gCAAgC,QAAQ,KAAK,GACrD;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,sEACA,YAAY,OAAO,GACnB,YACA,oBACC,UACC,MAAM,SAAS,qBAAqB,MAAM,WAAW,mBACjD,KAAA,IACA,uCAAuC,QAAQ,KAAK,GAC5D;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,sEACA,YAAY,gBAAgB,IAAI,OAAO,GAAK,EAAE,IAAI,EAChD,QAAQ,oBAAoB,KAAK;IAAE,GAAG;IAAY,gBAAgB;GAAI,CAAC,EACzE,CAAC,GACD,YACA,oBACC,UACC,MAAM,SAAS,qBAAqB,MAAM,WAAW,cACjD,KAAA,IACA,kCAAkC,QAAQ,KAAK,GACvD;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,2EACA,YAAY,0DAA0D,EACpE,QAAQ,oBAAoB,KAAK;IAAE,GAAG;IAAY,aAAa,SAAS,OAAO,GAAG;GAAE,CAAC,EACvF,CAAC,GACD,YACA,2BACF;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,oEACA,YACE,+FACA,EAAE,QAAQ,oBAAoB,KAAK;IAAE,GAAG;IAAY,aAAa;GAAM,CAAC,EAAE,CAC5E,GACA,YACA,yBACC,UACC,MAAM,SAAS,0BAA0B,MAAM,YAAY,SACvD,KAAA,IACA,8BAA8B,QAAQ,KAAK,GACnD;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,sEACA,YAAY,gCAAgC,EAC1C,QAAQ,oBAAoB,KAAK;IAAE,GAAG;IAAY,gBAAgB;GAAM,CAAC,EAC3E,CAAC,GACD,YACA,yBACC,UACC,MAAM,SAAS,0BAA0B,MAAM,YAAY,WACvD,KAAA,IACA,gCAAgC,QAAQ,KAAK,GACrD;EACF;EACA;GACE,MAAM;GACN,KAAK,OAAO,IAAI,aAAa;IAC3B,MAAM,WAAW;IACjB,MAAM,EAAE,MAAM,UAAU,qBAAqB,oBAAoB,KAAK,EAAE,OAAO,KAAK,CAAC,CAAC;IAEtF,OAAO,cACL,UACA,YACE,8GACA;KACE,YAAY,CAAC,kBAAkB;KAC/B,QAAQ,oBAAoB,KAAK;MAAE,GAAG;MAAY,cAAc;KAAE,CAAC;IACrE,CACF,GACA,MACA,wBACF;IAGA,IAAI,MAAM,WAAW,GACnB,OAAO,OAAO,UACZ,UACA,uEAAuE,MAAM,QAC/E;GAEJ,CAAC;EACH;EACA;GACE,MAAM;GACN,KAAK,cACH,sEACA,YAAY,mCAAmC,EAAE,YAAY,CAAC,kBAAkB,EAAE,CAAC,GACnF,EAGE,YAAY,OAAO,QAAQ,EAAE,OAAO,KAAK,CAAkC,EAC7E,GACA,4BACF;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,4EACA,YACE,mFACF,GACA,YACA,2BACC,UACC,MAAM,SAAS,4BACf,MAAM,WAAW,WACjB,MAAM,KAAK,MAAM,SAAS,KAAK,SAAS,oBAAoB,CAAC,IACzD,KAAA,IACA,0DAA0D,QAAQ,KAAK,GAC/E;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,kEACA,YAAY,uBAAuB,GACnC,YACA,2BACC,UACC,MAAM,SAAS,4BAA4B,MAAM,WAAW,oBACxD,KAAA,IACA,wCAAwC,QAAQ,KAAK,GAC7D;EACF;EACA;GACE,MAAM;GACN,KAAK,cACH,wFACA,YAAY,iBAAiB,EAC3B,SAAS,iBAAiB,KAAK;IAAE,SAAS,CAAC,aAAa;IAAG,OAAO,CAAC,GAAG;GAAE,CAAC,EAC3E,CAAC,GACD,YACA,iCACC,UACC,MAAM,SAAS,kCAAkC,MAAM,YAAY,YAC/D,KAAA,IACA,iCAAiC,QAAQ,KAAK,GACtD;EACF;EACA;GACE,MAAM;GACN,KAAK,OAAO,IAAI,aAAa;IAC3B,MAAM,WAAW;IACjB,MAAM,UAAU,OAAO,SAAS,KAAW;IAC3C,MAAM,UAAU,EAAE,qBAAqB,MAAM;IAc7C,MAAM,QAAQ,OAAO,QACnB,YAAY,mCAAmC,EAAE,YAAY,CAAC,kBAAkB,EAAE,CAAC,GACnF,EAbA,YACE,SAAS,QAAQ,SAAS,KAAA,CAAS,CAAC,CAAC,KACnC,OAAO,QAAQ,OAAO,KAAK,GAC3B,OAAO,SACL,OAAO,WAAW;KAChB,QAAQ,sBAAsB;IAChC,CAAC,CACH,CACF,EAKC,CACL,CAAC,CAAC,KAAK,OAAO,SAAS;IASvB,KAAI,OALkB,OAAO,UAC3B,SAAS,MAAM,OAAO,CAAC,CAAC,KAAK,OAAO,GAAG,SAAkB,CAAC,GAC1D,MAAM,KAAK,KAAK,CAAC,CAAC,KAAK,OAAO,MAAM,OAAO,GAAG,QAAiB,CAAC,CAClE,OAEe,UACb,OAAO,OAAO,UACZ,UACA,qEACF;IAEF,OAAO,MAAM,UAAU,KAAK;IAC5B,IAAI,CAAC,QAAQ,qBACX,OAAO,OAAO,UACZ,UACA,iEACF;GAEJ,CAAC;EACH;CACF;AACF;;;;;;;;;;AC3eA,MAAa,sCAAsC,sBAAsB,KAAK;CAC5E,WAAW;CACX,UAAU;AACZ,CAAC;AAOD,MAAM,gBAAgB;AACtB,MAAM,0BAA0B;AAChC,MAAM,wBAAwB;AAE9B,MAAM,kBAAkB,UAA0B,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC;;;;;;;AAQlF,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,IAAM,iBAAN,MAAqB;CACE;CAArB,YAAY,UAA2B;EAAlB,KAAA,WAAA;CAAmB;AAC1C;AAEA,IAAM,kBAAN,MAAsB;CACC;CAArB,YAAY,OAAyB;EAAhB,KAAA,QAAA;CAAiB;AACxC;AAEA,IAAM,eAAN,MAAmB;CACI;CAArB,YAAY,QAAyB;EAAhB,KAAA,SAAA;CAAiB;AACxC;;;;;;;AAaA,MAAM,kBAAkB,UAA2B;CACjD,IAAI;EACF,IAAI,OAAO,UAAU,UACnB,OAAO;EAGT,OAAO,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK;CAC9C,QAAQ;EACN,IAAI;GACF,OAAO,OAAO,KAAK;EACrB,QAAQ;GACN,OAAO;EACT;CACF;AACF;AAEA,MAAM,eAAe,SAAqB,WAAgC;CACxE,MAAM,SAAS,GAAG,WAAyC;EACzD,MAAM,SAAS,OAAO,IAAI,cAAc,CAAC,CAAC,KAAK,GAAG;EAElD,MAAM,OACJ,OAAO,SAAS,0BACZ,GAAG,OAAO,MAAM,GAAG,KAA2B,EAAE,KAChD;EAEN,MAAM,QAAQ,eAAe,IAAI;EAEjC,IAAI,QAAQ,MAAM,UAAU,iBAAiB,QAAQ,QAAQ,QAAQ,OAAO,aAC1E,MAAM,IAAI,eAAe,QAAQ,QAAQ,KAAK;EAEhD,QAAQ,MAAM,KAAK,IAAI;EACvB,QAAQ,SAAS;CACnB;CAEA,OAAO;EAAE,OAAO;EAAO,OAAO;EAAO,MAAM;EAAO,KAAK;EAAO,MAAM;CAAM;AAC5E;AAUA,MAAM,wBACJ,WACA,UAC4B;CAC5B,MAAM,UAAmC,CAAC;CAE1C,KAAK,MAAM,UAAU,UAAU,SAC7B,QAAQ,WAAW,aACjB,IAAI,SAAS,SAAS,WAAW;EAC/B,MAAM;GAAE,WAAW,UAAU;GAAM;GAAQ;GAAU;GAAS;EAAO,CAAC;CACxE,CAAC;CAGL,OAAO;AACT;AAEA,MAAM,eAAe,UAA2B;CAC9C,IAAI;EAGF,QAFa,iBAAiB,QAAQ,GAAG,MAAM,KAAK,IAAI,MAAM,YAAY,eAAe,KAAK,EAAA,CAElF,MAAM,GAAG,qBAAqB;CAC5C,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,MAAM,kBAAkB,UAA+C;CACrE,IAAI;EACF,OAAO,OAAO,oBAAoB,OAAO,IAAI,CAAC,CAAC,KAAK;CACtD,QAAQ;EACN,OAAO,OAAO,KAAK;CACrB;AACF;AAEA,MAAM,iBAAiB,UAAgC;CACrD,MAAM,UAAU,eAAe,KAAK;CAEpC,IAAI,OAAO,OAAO,OAAO,GACvB,IAAI;EACF,MAAM,UAAU,KAAK,UAAU,QAAQ,KAAK;EAE5C,IAAI,YAAY,KAAA,KAAa,QAAQ,UAAU,uBAC7C,OAAO,QAAQ;CAEnB,QAAQ,CAER;CAGF,OAAO,YAAY,KAAK;AAC1B;AAEA,MAAM,yBAAyB,UAA2C;CACxE,IAAI;EACF,MAAM,UAAU,KAAK,UAAU,KAAK;EAEpC,OAAO,YAAY,KAAA,IAAY,KAAA,IAAY,eAAe,OAAO;CACnE,QAAQ;EACN;CACF;AACF;;AAGA,MAAM,qBAAqB,UAAsD;CAC/E,IAAI;EACF,OAAO,OAAO,oBAAoB,kBAAkB,CAAC,CAAC,KAAK;CAC7D,QAAQ;EACN,OAAO,OAAO,KAAK;CACrB;AACF;AAEA,MAAM,mBACJ,YAEA,OAAO,IAAI,aAAa;CACtB,IAAI,QAAQ,QAAQ,SAAS,mBAC3B,OAAO,OAAO,6BAA6B,KAAK;EAC9C,gBAAgB;EAChB,SAAS;EACT,SACE;CACJ,CAAC;CAEH,IAAI,QAAQ,OAAO,cAAc,KAAA,GAC/B,OAAO,OAAO,6BAA6B,KAAK;EAC9C,gBAAgB;EAChB,SAAS;EACT,SACE;CACJ,CAAC;CAEH,MAAM,gCAAgB,IAAI,IAAY,CAAC,GAAG,iBAAiB,SAAS,CAAC;CACrE,MAAM,uBAAO,IAAI,IAAY;CAE7B,KAAK,MAAM,aAAa,QAAQ,YAAY;EAC1C,IAAI,cAAc,IAAI,UAAU,IAAI,KAAK,KAAK,IAAI,UAAU,IAAI,GAC9D,OAAO,OAAO,6BAA6B,KAAK;GAC9C,gBAAgB;GAChB,SAAS;GACT,SAAS,aAAa,UAAU,KAAK;EACvC,CAAC;EAEH,KAAK,IAAI,UAAU,IAAI;CACzB;CACA,MAAM,cAAc,eAAe,QAAQ,MAAM;CAEjD,IAAI,cAAc,QAAQ,OAAO,gBAC/B,OAAO,OAAO,gBAAgB,KAAK;EACjC,gBAAgB;EAChB,QAAQ;EACR,SAAS,aAAa,YAAY,6BAA6B,QAAQ,OAAO;CAChF,CAAC;AAEL,CAAC;AAEH,MAAM,kBACJ,MACA,OACA,QACA,SACA,YAKA,OAAO,IAAI,aAAa;CACtB,OAAO,MAAM;EACX,MAAM,UAAU,OAAO,MAAM,KAAK,KAAK;EAEvC,QAAQ,SAAS;EACjB,IAAI,QAAQ,QAAQ,OAAO,cACzB,OAAO,OAAO,uBAAuB,KAAK;GACxC,gBAAgB;GAChB,OAAO,OAAO;GACd,MAAM,CAAC,GAAG,QAAQ,KAAK;EACzB,CAAC;EAEH,MAAM,WAAW,eAAe,QAAQ,QAAQ;EAEhD,IAAI,OAAO,OAAO,QAAQ,GAAG;GAC3B,QAAQ,uBAAO,IAAI,UAAU,yCAAyC,CAAC;GACvE;EACF;EACA,MAAM,gBAAgB,sBAAsB,SAAS,KAAK;EAE1D,IAAI,kBAAkB,KAAA,KAAa,gBAAgB,OAAO,0BACxD,OAAO,OAAO,qBAAqB,KAAK;GACtC,gBAAgB;GAChB,SAAS;GACT,OAAO,OAAO;GACd,UAAU,iBAAiB;GAC3B,MAAM,CAAC,GAAG,QAAQ,KAAK;EACzB,CAAC;EAGH,MAAM,aAAa,OAAO,KAAK,KAC7B,aAAa,KAAK;GAChB,WAAW,QAAQ;GACnB,QAAQ,QAAQ;GAChB,UAAU,SAAS;EACrB,CAAC,CACH;EAEA,MAAM,UAAU,kBAAkB,UAAU;EAE5C,IAAI,OAAO,OAAO,OAAO,GACvB,OAAO,OAAO,2BAA2B,KAAK;GAC5C,gBAAgB;GAChB,SAAS;EACX,CAAC;EAEH,IAAI,QAAQ,MAAM,SAAS,uBAAuB;GAChD,QAAQ,OAAO,QAAQ,MAAM,KAAK;GAClC;EACF;EACA,MAAM,cAAc,sBAAsB,QAAQ,MAAM,KAAK;EAE7D,IAAI,gBAAgB,KAAA,KAAa,cAAc,OAAO,wBACpD,OAAO,OAAO,qBAAqB,KAAK;GACtC,gBAAgB;GAChB,SAAS;GACT,OAAO,OAAO;GACd,UAAU,eAAe;GACzB,MAAM,CAAC,GAAG,QAAQ,KAAK;EACzB,CAAC;EAEH,QAAQ,QAAQ,QAAQ,MAAM,KAAK;CACrC;AACF,CAAC;AAEH,MAAM,0BACJ,QACA,QACA,YACoE;CACpE,MAAM,QAAQ,kBAAkB,kBAAkB,OAAO,QAAQ;CAEjE,IAAI,iBAAiB,gBACnB,OAAO,qBAAqB,KAAK;EAC/B,gBAAgB;EAChB,SAAS;EACT,OAAO,OAAO;EACd,UAAU,MAAM;EAChB,MAAM,CAAC,GAAG,QAAQ,KAAK;CACzB,CAAC;CAEH,IAAI,iBAAiB,cACnB,OAAO,gBAAgB,KAAK;EAC1B,gBAAgB;EAChB,QAAQ;EACR,SAAS,sCAAsC,MAAM,OAAO;CAC9D,CAAC;CAKH,MAAM,SAAS,kBAAkB,mBAAmB,iBAAiB,QAAQ,UAAU;CAEvF,OAAO,uBAAuB,KAAK;EACjC,gBAAgB;EAChB;EACA,QAAQ,cAAc,KAAK;EAC3B,SAAS,YAAY,KAAK;EAC1B,MAAM,CAAC,GAAG,QAAQ,KAAK;CACzB,CAAC;AACH;AAEA,MAAM,mBAAwC,OAAO,GAAG,+BAA+B,CAAC,CACtF,WAAW,SAAS;CAClB,OAAO,gBAAgB,OAAO;CAC9B,MAAM,OAAO,OAAO;CACpB,MAAM,UAAsB;EAAE,OAAO,CAAC;EAAG,OAAO;CAAE;CAClD,MAAM,UAAU,EAAE,OAAO,EAAE;CAC3B,MAAM,QAAQ,OAAO,MAAM,UAA2B;CAEtD,MAAM,UAAU,OAAO,OAAO,IAAI;EAChC,WAIE,IAAI,SACF,GAAG,iBACH,WACA,GAAG,QAAQ,WAAW,KAAK,cAAc,UAAU,IAAI,GACvD,4BAA4B,QAAQ,OAAO,KAC7C;EACF,QAAQ,UACN,gBAAgB,KAAK;GACnB,gBAAgB;GAChB,QAAQ;GACR,SAAS,YAAY,KAAK;EAC5B,CAAC;CACL,CAAC;CAED,MAAM,iBAAiB,YAAY,SAAS,QAAQ,MAAM;CAM1D,IAAI,kBAAkB;CAEtB,MAAM,mBAAmB,QAAQ,WAAW,KAAK,cAC/C,qBAAqB,YAAY,YAAY;EAC3C,mBAAmB;EACnB,IAAI,kBAAkB,QAAQ,OAAO,eAAe,GAAG;GACrD,QAAQ,uBAAO,IAAI,MAAM,sBAAsB,QAAQ,OAAO,aAAa,UAAU,CAAC;GAEtF;EACF;EACA,MAAM,YAAY,OAAO,OAAO;CAClC,CAAC,CACH;CAEA,MAAM,SAAS,OAAO,eAAe,MAAM,OAAO,QAAQ,QAAQ,SAAS,OAAO,CAAC,CAAC,KAClF,OAAO,UACT;CAEA,MAAM,UAAU,OAAO,WAAW;EAChC,KAAK,YAAY;GACf,IAAI;GAEJ,IAAI;IACF,YAAY,QACV,GAAG,gBAAgB,UAAU,KAAA,CAAS,GACtC,gBACA,GAAG,gBACL;GACF,SAAS,OAAO;IACd,MAAM,IAAI,gBAAgB,KAAK;GACjC;GACA,IAAI,OAAO,cAAc,YACvB,MAAM,IAAI,gBAAgB,IAAI,aAAa,OAAO,SAAS,CAAC;GAE9D,IAAI;GAEJ,IAAI;IACF,UAAU,UAAU;GACtB,SAAS,OAAO;IACd,MAAM,IAAI,gBAAgB,KAAK;GACjC;GAEA,OAAO,MAAM,QAAQ,QAAQ,OAAO;EACtC;EACA,QAAQ,WAAW,uBAAuB,QAAQ,QAAQ,QAAQ,OAAO;CAC3E,CAAC;CAED,MAAM,YAAY,OAAO,MAAM;CAQ/B,MAAM,WAAW,OAAO,OAAO,UAAU,SAAS,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,KACpE,OAAO,cAAc;EACnB,UAAU,QAAQ,OAAO;EACzB,cACE,0BAA0B,KAAK;GAC7B,gBAAgB;GAChB,MAAM;GACN,aAAa,QAAQ,OAAO;GAC5B,MAAM,CAAC,GAAG,QAAQ,KAAK;EACzB,CAAC;CACL,CAAC,GACD,OAAO,SAAS,MAAM,UAAU,MAAM,CAAC,CACzC;CAEA,MAAM,aAAa,OAAO,MAAM;CAMhC,IAAI,kBAAkB,QAAQ,OAAO,cACnC,OAAO,OAAO,uBAAuB,KAAK;EACxC,gBAAgB;EAChB,OAAO,QAAQ,OAAO;EACtB,MAAM,CAAC,GAAG,QAAQ,KAAK;CACzB,CAAC;CAGH,MAAM,QAAQ,OAAO,OAAO,oBAAoB,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,KACrE,OAAO,eACL,uBAAuB,KAAK;EAC1B,gBAAgB;EAChB,QAAQ;EACR,QAAQ;EACR,SAAS;EACT,MAAM,CAAC,GAAG,QAAQ,KAAK;CACzB,CAAC,CACH,CACF;CAEA,MAAM,cAAc,sBAAsB,KAAK;CAE/C,IAAI,gBAAgB,KAAA,KAAa,cAAc,QAAQ,OAAO,gBAC5D,OAAO,OAAO,qBAAqB,KAAK;EACtC,gBAAgB;EAChB,SAAS;EACT,OAAO,QAAQ,OAAO;EACtB,UAAU,eAAe;EACzB,MAAM,CAAC,GAAG,QAAQ,KAAK;CACzB,CAAC;CAGH,OAAO,oBAAoB,KAAK;EAC9B,gBAAgB;EAChB;EACA,MAAM,CAAC,GAAG,QAAQ,KAAK;EACvB,aAAa,yBAAyB,KAAK;GACzC,UAAU,SAAS,OAAO,KAAK,IAAI,GAAG,aAAa,SAAS,CAAC;GAC7D,WAAW,QAAQ;GACnB,UAAU,QAAQ;GAClB;EACF,CAAC;CACH,CAAC;AACH,CACF;;;;;;AAOA,MAAa,6BAAwD,MAAM,QAAQ,YAAY,CAAC,CAC9F,aAAa,GAAG,EAAE,SAAS,iBAAiB,CAAC,CAC/C"}