@smthrs/engine-store 1.0.0-rc.4 → 1.0.0-rc.6

package/dist/esm/RunChangeFeed.js.map

@@ -1 +1 @@
-{"version":3,"file":"RunChangeFeed.js","sourceRoot":"","sources":["../../src/RunChangeFeed.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAA;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AACvD,OAAO,KAAK,SAAS,MAAM,+BAA+B,CAAA;AAE1D,OAAO,KAAK,IAAI,MAAM,qCAAqC,CAAA;AAkC3D;;;;;GAKG;AACH,MAAM,OAAO,aAAc,SAAQ,OAAO,CAAC,OAAO,EAA0B,CAAC,oCAAoC,CAAC;CAAG;AACrH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAA;AACnC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,QAAQ,EAAE,IAAI,CAAC,OAAO;IACtB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;CACpF,CAAC,CAAA;AACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AAEtH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,GAAuD,EAAE,CAC3E,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,SAAS,CAAA;IACtC,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACnE,YAAY,EAAE,CAAC,OAAO,EAAE,EAAE,CACxB,IAAI,CAAC,QAAQ,CACX,4BAA4B,EAC5B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;YAClD,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAC5B,GAAG,EACH,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAClB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;gBACpC,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,IAAI,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;oBAC/D,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,aAAa,CAAC;wBAChB,MAAM,EAAE,4BAA4B;wBACpC,IAAI,EAAE,aAAa;wBACnB,OAAO,EAAE,mDAAmD;wBAC5D,KAAK,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE;qBAC1C,CAAC,CACH,CAAA;gBACH,CAAC;gBACD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAA;6BACV,KAAK,CAAC,QAAQ,oBAAoB,EAAE,CAAC,QAAQ;oCACtC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAA;gBACrC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAA;gBACjF,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBAC1D,KAAK,EAAE,GAAG,CAAC,MAAM;oBACjB,MAAM,EAAE,EAAE,CAAC,MAAM;oBACjB,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,OAAO,EAAE,GAAG,CAAC,OAAO,KAAK,CAAC;iBAC3B,CAAC,CAAC,CAAA;gBACH,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAA;gBAC5C,OAAO;oBACL,GAAG,EAAE;oBACL,OAAO;oBACP,OAAO;oBACP,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ;iBAC5E,CAAA;YACH,CAAC,CAAC,CACH,CAAA;QACH,CAAC,CAAC,CACH;KACJ,CAAA;AACH,CAAC,CAAC,CAAA;AACJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAA2D,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA","sourcesContent":["/**\n * Coalesced execution catch-up with permanent deletion evidence.\n *\n * @since 1.0.0\n */\n\nimport { RunStoreError } from \"@smthrs/run-store/RunStore\"\nimport { Context, Effect, Layer, Schema } from \"effect\"\nimport * as SqlClient from \"effect/unstable/sql/SqlClient\"\nimport type { Position } from \"./ExecutionSnapshot.ts\"\nimport * as Read from \"./internal/ExecutionSnapshotRead.ts\"\n\n/**\n * A live-row change or retained tombstone.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Change extends Position {\n  readonly runId: string\n  readonly deleted: boolean\n}\n/**\n * One catch-up page at an engine watermark.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Page extends Position {\n  readonly changes: ReadonlyArray<Change>\n  /** Resume here, including across gaps from coalesced changes. */\n  readonly nextRevision: number\n  readonly hasMore: boolean\n}\n/**\n * Bounded state-feed operations.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Service {\n  readonly current: Effect.Effect<Position, RunStoreError>\n  readonly changesSince: (options: Position & { readonly limit: number }) => Effect.Effect<Page, RunStoreError>\n}\n/**\n * Durable change-feed service.\n *\n * @category services\n * @since 1.0.0\n */\nexport class RunChangeFeed extends Context.Service<RunChangeFeed, Service>()(\"@smthrs/engine-store/RunChangeFeed\") {}\n/**\n * Maximum change-feed page size.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const maximumPageSize = 1000\nconst Options = Schema.Struct({\n  source: Read.Source,\n  revision: Read.Natural,\n  limit: Schema.Int.check(Schema.isBetween({ minimum: 1, maximum: maximumPageSize }))\n})\nconst ChangeRow = Schema.Struct({ run_id: Read.Identifier, revision: Read.Natural, deleted: Schema.Literals([0, 1]) })\n\n/**\n * Constructs the feed without polling or retention timers.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const make = (): Effect.Effect<Service, never, SqlClient.SqlClient> =>\n  Effect.gen(function*() {\n    const sql = yield* SqlClient.SqlClient\n    return {\n      current: Read.boundary(\"RunChangeFeed.current\", Read.position(sql)),\n      changesSince: (options) =>\n        Read.boundary(\n          \"RunChangeFeed.changesSince\",\n          Effect.gen(function*() {\n            const input = yield* Read.decode(Options, options)\n            return yield* Read.transaction(\n              sql,\n              Effect.gen(function*() {\n                const at = yield* Read.position(sql)\n                if (input.source !== at.source || input.revision > at.revision) {\n                  return yield* Effect.fail(\n                    new RunStoreError({\n                      method: \"RunChangeFeed.changesSince\",\n                      code: \"invalid_run\",\n                      message: \"change cursor requires an explicit source rebuild\",\n                      cause: { requested: input, observed: at }\n                    })\n                  )\n                }\n                const rows = yield* sql`SELECT run_id, revision, deleted FROM flows_run_changes\n          WHERE revision > ${input.revision} AND revision <= ${at.revision}\n          ORDER BY revision LIMIT ${input.limit + 1}`\n                const decoded = yield* Effect.forEach(rows, (row) => Read.decode(ChangeRow, row))\n                const changes = decoded.slice(0, input.limit).map((row) => ({\n                  runId: row.run_id,\n                  source: at.source,\n                  revision: row.revision,\n                  deleted: row.deleted === 1\n                }))\n                const hasMore = decoded.length > input.limit\n                return {\n                  ...at,\n                  changes,\n                  hasMore,\n                  nextRevision: hasMore ? changes[changes.length - 1]!.revision : at.revision\n                }\n              })\n            )\n          })\n        )\n    }\n  })\n/**\n * Provides the SQL feed.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layer: Layer.Layer<RunChangeFeed, never, SqlClient.SqlClient> = Layer.effect(RunChangeFeed)(make())\n"]}
+{"version":3,"file":"RunChangeFeed.js","sourceRoot":"","sources":["../../src/RunChangeFeed.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAA;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AACvD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAA;AAEjD,OAAO,KAAK,IAAI,MAAM,qCAAqC,CAAA;AAkC3D;;;;;GAKG;AACH,MAAM,OAAO,aAAc,SAAQ,OAAO,CAAC,OAAO,EAA0B,CAAC,oCAAoC,CAAC;CAAG;AACrH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAA;AACnC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,QAAQ,EAAE,IAAI,CAAC,OAAO;IACtB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;CACpF,CAAC,CAAA;AACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AAEtH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,GAAuD,EAAE,CAC3E,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,SAAS,CAAA;IACtC,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACnE,YAAY,EAAE,CAAC,OAAO,EAAE,EAAE,CACxB,IAAI,CAAC,QAAQ,CACX,4BAA4B,EAC5B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;YAClD,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAC5B,GAAG,EACH,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAClB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;gBACpC,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,IAAI,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;oBAC/D,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,aAAa,CAAC;wBAChB,MAAM,EAAE,4BAA4B;wBACpC,IAAI,EAAE,aAAa;wBACnB,OAAO,EAAE,mDAAmD;wBAC5D,KAAK,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE;qBAC1C,CAAC,CACH,CAAA;gBACH,CAAC;gBACD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAA;6BACV,KAAK,CAAC,QAAQ,oBAAoB,EAAE,CAAC,QAAQ;oCACtC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAA;gBACrC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAA;gBACjF,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBAC1D,KAAK,EAAE,GAAG,CAAC,MAAM;oBACjB,MAAM,EAAE,EAAE,CAAC,MAAM;oBACjB,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,OAAO,EAAE,GAAG,CAAC,OAAO,KAAK,CAAC;iBAC3B,CAAC,CAAC,CAAA;gBACH,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAA;gBAC5C,OAAO;oBACL,GAAG,EAAE;oBACL,OAAO;oBACP,OAAO;oBACP,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ;iBAC5E,CAAA;YACH,CAAC,CAAC,CACH,CAAA;QACH,CAAC,CAAC,CACH;KACJ,CAAA;AACH,CAAC,CAAC,CAAA;AACJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAA2D,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA","sourcesContent":["/**\n * Coalesced execution catch-up with permanent deletion evidence.\n *\n * @since 1.0.0\n */\n\nimport { RunStoreError } from \"@smthrs/run-store/RunStore\"\nimport { Context, Effect, Layer, Schema } from \"effect\"\nimport * as SqlClient from \"effect/sql/SqlClient\"\nimport type { Position } from \"./ExecutionSnapshot.ts\"\nimport * as Read from \"./internal/ExecutionSnapshotRead.ts\"\n\n/**\n * A live-row change or retained tombstone.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Change extends Position {\n  readonly runId: string\n  readonly deleted: boolean\n}\n/**\n * One catch-up page at an engine watermark.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Page extends Position {\n  readonly changes: ReadonlyArray<Change>\n  /** Resume here, including across gaps from coalesced changes. */\n  readonly nextRevision: number\n  readonly hasMore: boolean\n}\n/**\n * Bounded state-feed operations.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Service {\n  readonly current: Effect.Effect<Position, RunStoreError>\n  readonly changesSince: (options: Position & { readonly limit: number }) => Effect.Effect<Page, RunStoreError>\n}\n/**\n * Durable change-feed service.\n *\n * @category services\n * @since 1.0.0\n */\nexport class RunChangeFeed extends Context.Service<RunChangeFeed, Service>()(\"@smthrs/engine-store/RunChangeFeed\") {}\n/**\n * Maximum change-feed page size.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const maximumPageSize = 1000\nconst Options = Schema.Struct({\n  source: Read.Source,\n  revision: Read.Natural,\n  limit: Schema.Int.check(Schema.isBetween({ minimum: 1, maximum: maximumPageSize }))\n})\nconst ChangeRow = Schema.Struct({ run_id: Read.Identifier, revision: Read.Natural, deleted: Schema.Literals([0, 1]) })\n\n/**\n * Constructs the feed without polling or retention timers.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const make = (): Effect.Effect<Service, never, SqlClient.SqlClient> =>\n  Effect.gen(function*() {\n    const sql = yield* SqlClient.SqlClient\n    return {\n      current: Read.boundary(\"RunChangeFeed.current\", Read.position(sql)),\n      changesSince: (options) =>\n        Read.boundary(\n          \"RunChangeFeed.changesSince\",\n          Effect.gen(function*() {\n            const input = yield* Read.decode(Options, options)\n            return yield* Read.transaction(\n              sql,\n              Effect.gen(function*() {\n                const at = yield* Read.position(sql)\n                if (input.source !== at.source || input.revision > at.revision) {\n                  return yield* Effect.fail(\n                    new RunStoreError({\n                      method: \"RunChangeFeed.changesSince\",\n                      code: \"invalid_run\",\n                      message: \"change cursor requires an explicit source rebuild\",\n                      cause: { requested: input, observed: at }\n                    })\n                  )\n                }\n                const rows = yield* sql`SELECT run_id, revision, deleted FROM flows_run_changes\n          WHERE revision > ${input.revision} AND revision <= ${at.revision}\n          ORDER BY revision LIMIT ${input.limit + 1}`\n                const decoded = yield* Effect.forEach(rows, (row) => Read.decode(ChangeRow, row))\n                const changes = decoded.slice(0, input.limit).map((row) => ({\n                  runId: row.run_id,\n                  source: at.source,\n                  revision: row.revision,\n                  deleted: row.deleted === 1\n                }))\n                const hasMore = decoded.length > input.limit\n                return {\n                  ...at,\n                  changes,\n                  hasMore,\n                  nextRevision: hasMore ? changes[changes.length - 1]!.revision : at.revision\n                }\n              })\n            )\n          })\n        )\n    }\n  })\n/**\n * Provides the SQL feed.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layer: Layer.Layer<RunChangeFeed, never, SqlClient.SqlClient> = Layer.effect(RunChangeFeed)(make())\n"]}

package/dist/esm/SelectionStore.d.ts

@@ -24,7 +24,7 @@ import * as Context from "effect/Context";
 import * as Effect from "effect/Effect";
 import * as Layer from "effect/Layer";
 import * as Schema from "effect/Schema";
-import * as SqlClient from "effect/unstable/sql/SqlClient";
+import * as SqlClient from "effect/sql/SqlClient";
 import * as Selection from "./Selection.ts";
 /**
  * Training outcomes for a suspected edge: a `hit` is a recertified deferral

package/dist/esm/SelectionStore.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SelectionStore.d.ts","sourceRoot":"","sources":["../../src/SelectionStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAA;AAE9D,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,SAAS,MAAM,+BAA+B,CAAA;AAC1D,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,2CAAmC,CAAA;AAE/D;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GAAG,OAAO,eAAe,CAAC,IAAI,CAAA;AAEzD;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB;;;;EAI9B,CAAA;AAEF;;;;;GAKG;AACH,MAAM,MAAM,mBAAmB,GAAG,OAAO,mBAAmB,CAAC,IAAI,CAAA;AAEjE;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,oFAIlC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,MAAM,uBAAuB,GAAG,OAAO,uBAAuB,CAAC,IAAI,CAAA;;;;;;;;AAEzE;;;;;GAKG;AACH,qBAAa,mBAAoB,SAAQ,wBASxC;CAAG;AAEJ;;;;;;;;;;GAUG;AACH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,CACf,KAAK,EAAE,aAAa,CAAC,SAAS,CAAC,aAAa,CAAC,KAC1C,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAA;IAC7C,QAAQ,CAAC,IAAI,EAAE,MAAM,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,mBAAmB,CAAC,CAAA;IAC/F,QAAQ,CAAC,QAAQ,EAAE,MAAM,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAA;IACrF,QAAQ,CAAC,KAAK,EAAE,CACd,YAAY,EAAE,aAAa,CAAC,mBAAmB,CAAC,KAC7C,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAA;CAC9C;;AAED;;;;;GAKG;AACH,qBAAa,cAAe,SAAQ,mBAEnC;CAAG;AA2FJ;;;;;;;GAOG;AACH,eAAO,MAAM,kBAAkB,MAAM,CAAA;AAErC;;;;;GAKG;AACH,eAAO,MAAM,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,aAAa,GAAG,SAAS,CAAC,SAAS,CAoGlF,CAAA;AAEF;;;;;GAKG;AACH,eAAO,MAAM,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,aAAa,GAAG,SAAS,CAAC,SAAS,CAEnF,CAAA"}
+{"version":3,"file":"SelectionStore.d.ts","sourceRoot":"","sources":["../../src/SelectionStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAA;AAE9D,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAA;AACjD,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,2CAAmC,CAAA;AAE/D;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GAAG,OAAO,eAAe,CAAC,IAAI,CAAA;AAEzD;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB;;;;EAI9B,CAAA;AAEF;;;;;GAKG;AACH,MAAM,MAAM,mBAAmB,GAAG,OAAO,mBAAmB,CAAC,IAAI,CAAA;AAEjE;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,oFAIlC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,MAAM,uBAAuB,GAAG,OAAO,uBAAuB,CAAC,IAAI,CAAA;;;;;;;;AAEzE;;;;;GAKG;AACH,qBAAa,mBAAoB,SAAQ,wBASxC;CAAG;AAEJ;;;;;;;;;;GAUG;AACH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,CACf,KAAK,EAAE,aAAa,CAAC,SAAS,CAAC,aAAa,CAAC,KAC1C,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAA;IAC7C,QAAQ,CAAC,IAAI,EAAE,MAAM,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,mBAAmB,CAAC,CAAA;IAC/F,QAAQ,CAAC,QAAQ,EAAE,MAAM,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAA;IACrF,QAAQ,CAAC,KAAK,EAAE,CACd,YAAY,EAAE,aAAa,CAAC,mBAAmB,CAAC,KAC7C,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAA;CAC9C;;AAED;;;;;GAKG;AACH,qBAAa,cAAe,SAAQ,mBAEnC;CAAG;AA2FJ;;;;;;;GAOG;AACH,eAAO,MAAM,kBAAkB,MAAM,CAAA;AAErC;;;;;GAKG;AACH,eAAO,MAAM,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,aAAa,GAAG,SAAS,CAAC,SAAS,CAoGlF,CAAA;AAEF;;;;;GAKG;AACH,eAAO,MAAM,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,aAAa,GAAG,SAAS,CAAC,SAAS,CAEnF,CAAA"}

package/dist/esm/SelectionStore.js

@@ -25,7 +25,7 @@ import * as Context from "effect/Context";
 import * as Effect from "effect/Effect";
 import * as Layer from "effect/Layer";
 import * as Schema from "effect/Schema";
-import * as SqlClient from "effect/unstable/sql/SqlClient";
+import * as SqlClient from "effect/sql/SqlClient";
 import * as Selection from "./Selection.js";
 /**
  * Training outcomes for a suspected edge: a `hit` is a recertified deferral

package/dist/esm/SelectionStore.js.map

@@ -1 +1 @@
-{"version":3,"file":"SelectionStore.js","sourceRoot":"","sources":["../../src/SelectionStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAA;AAC9D,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,SAAS,MAAM,+BAA+B,CAAA;AAC1D,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AAU/D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC/C,KAAK,EAAE,MAAM,CAAC,cAAc;IAC5B,OAAO,EAAE,MAAM,CAAC,cAAc;IAC9B,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,MAAM,CAAC,QAAQ,CAAC;IACrD,eAAe;IACf,eAAe;IACf,oBAAoB;CACrB,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,OAAO,mBAAoB,SAAQ,MAAM,CAAC,WAAW,EAAuB,CAChF,0CAA0C,EAC1C;IACE,IAAI,EAAE,uBAAuB;IAC7B,OAAO,EAAE,MAAM,CAAC,MAAM;IACtB,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACrC,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACvC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;CACvC,CACF;CAAG;AAwBJ;;;;;GAKG;AACH,MAAM,OAAO,cAAe,SAAQ,OAAO,CAAC,OAAO,EAA2B,CAC5E,qCAAqC,CACtC;CAAG;AAEJ,MAAM,0BAA0B,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAA;AAErF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC,cAAc;IAC5B,OAAO,EAAE,MAAM,CAAC,cAAc;IAC9B,UAAU,EAAE,MAAM,CAAC,MAAM;IACzB,WAAW,EAAE,SAAS,CAAC,kBAAkB;IACzC,YAAY,EAAE,MAAM,CAAC,MAAM;CAC5B,CAAC,CAAA;AAIF,MAAM,YAAY,GAAG,CAAC,OAAe,EAAE,KAAc,EAAuB,EAAE,CAC5E,IAAI,mBAAmB,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAA;AAEpE,MAAM,iBAAiB,GAAG,CAAC,OAAe,EAAE,KAAc,EAAuB,EAAE,CACjF,KAAK,YAAY,mBAAmB;IAClC,CAAC,CAAC,KAAK;IACP,CAAC,CAAC,IAAI,mBAAmB,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAA;AAE7E,MAAM,iBAAiB,GAAG,CAAC,KAAc,EAA2D,EAAE,CACpG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CACzD,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,mCAAmC,EAAE,KAAK,CAAC,CAAC,CACrF,CAAA;AAEH,MAAM,UAAU,GAAG,CAAC,KAAc,EAA+D,EAAE,CACjG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAC7D,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,6BAA6B,EAAE,KAAK,CAAC,CAAC,CAC/E,CAAA;AAEH,6EAA6E;AAC7E,yEAAyE;AACzE,0EAA0E;AAC1E,MAAM,cAAc,GAAG,CAAC,QAA+B,EAAyB,EAAE,CAChF,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAA;AAE1C,MAAM,cAAc,GAAG,CACrB,YAAoB,EACpB,GAAuC,EACoB,EAAE,CAC7D,MAAM,CAAC,mBAAmB,CAAC,0BAA0B,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,CACvE,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,OAAO,EAAE,eAAe,GAAG,CAAC,KAAK,OAAO,GAAG,CAAC,OAAO,uBAAuB;IAC1E,KAAK,EAAE,GAAG,CAAC,KAAK;IAChB,OAAO,EAAE,GAAG,CAAC,OAAO;IACpB,KAAK;CACN,CAAC,CACH,CACF,CAAA;AAEH,MAAM,SAAS,GAAG,CAAC,KAAc,EAA+D,EAAE,CAChG,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAC7C,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,OAAO,EAAE,wCAAwC;IACjD,KAAK;CACN,CAAC,CACH,EACD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CACrB,cAAc,CAAC,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,IAAI,CACxC,MAAM,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAC1B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;IAClD,KAAK,EAAE,GAAG,CAAC,KAAK;IAChB,OAAO,EAAE,GAAG,CAAC,OAAO;IACpB,UAAU,EAAE,GAAG,CAAC,UAAU;IAC1B,WAAW,EAAE,GAAG,CAAC,WAAW;IAC5B,QAAQ;CACT,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAChC,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,OAAO,EAAE,eAAe,GAAG,CAAC,KAAK,OAAO,GAAG,CAAC,OAAO,aAAa;IAChE,KAAK,EAAE,GAAG,CAAC,KAAK;IAChB,OAAO,EAAE,GAAG,CAAC,OAAO;IACpB,KAAK;CACN,CAAC,CACH,CAAC,CACH,CACF,CACF,CACF,CAAA;AAEH,MAAM,eAAe,GAAG,CAAC,UAAkB,EAAE,OAAwB,EAAU,EAAE,CAC/E,OAAO,KAAK,KAAK;IACf,CAAC,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;IACtC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAA;AAEtB;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAErC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAuE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAC1G,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,SAAS,CAAA;IACtC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,aAAa,CAAA;IAEnC,MAAM,UAAU,GAAG,CAAC,WAAgC,EAAE,EAAE,CACtD,GAAG,CAAS;;;;;;;;sBAQM,WAAW,CAAC,KAAK;wBACf,WAAW,CAAC,OAAO;KACtC,CAAA;IAEH,MAAM,SAAS,GAAG,CAAC,IAA6B,EAA4C,EAAE,CAC5F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QACzD,KAAK,CAAC,CAAC,GAAG,CAAA;;;;YAIJ,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,WAAW,KAAK,YAAY;;;;;OAK1F,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAC/B,iBAAiB,CACf,0BAA0B,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,OAAO,EAAE,EACzD,KAAK,CACN,CACF,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEJ,MAAM,MAAM,GAAsB,MAAM,CAAC,EAAE,CAAC,uBAAuB,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7E,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QACxD,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAC7E,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,mCAAmC,EAAE,KAAK,CAAC,CAAC,CAC1F,CAAA;IACH,CAAC,CAAC,CACH,CAAA;IAED,MAAM,IAAI,GAAoB,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAClE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAS;;;;;;;;;OAS/B,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,gCAAgC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;QAC9F,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IAC/C,CAAC,CAAC,CACH,CAAA;IAED,MAAM,QAAQ,GAAwB,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,GAAG,EAAE,CAC9E,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QAC9E,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAA;QAC3B,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAA;IAC9B,CAAC,CAAC,CACH,CAAA;IAED,MAAM,KAAK,GAAqB,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,CACjF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,iBAAiB,CAAC,CAAA;QACtE,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAChC,OAAO,EACP,CAAC,WAAW,EAAE,EAAE,CACd,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,IAAI,CAC9C,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,iBAAiB,CACf,uBAAuB,WAAW,CAAC,KAAK,OAAO,WAAW,CAAC,OAAO,EAAE,EACpE,KAAK,CACN,CACF,CACF,CAAA;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,GAAG,KAAK,SAAS;gBAAE,OAAM;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;YAClC,KAAK,CAAC,CAAC,SAAS,CAAC;gBACf,GAAG,IAAI;gBACP,UAAU,EAAE,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,OAAO,CAAC;gBACjE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,kBAAkB,CAAC;aACrF,CAAC,CAAA;QACJ,CAAC,CAAC,EACJ,EAAE,OAAO,EAAE,IAAI,EAAE,CAClB,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,iCAAiC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;IAClG,CAAC,CAAC,CACH,CAAA;IAED,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;AAC1C,CAAC,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAA4E,KAAK,CAAC,MAAM,CACxG,cAAc,CACf,CAAC,IAAI,CAAC,CAAA","sourcesContent":["/**\n * Durable suspected-edge storage for probabilistic selection.\n *\n * The store persists advisory beliefs only: training moves edge confidence and\n * appends evidence, but it never writes scheduler journal records, step keys,\n * or cache rows (law 5). The edge and snapshot schemas are `Selection`'s own —\n * one source of truth, so a stored edge is by construction what\n * `Selection.select` consumes. Evidence entries stay strings: training appends\n * the observation JSON-encoded, so audits can replay the asymmetric rule\n * without the schema forking from `Selection.SuspectedEdge`.\n *\n * Model-backed selection, CLI verbs, approval routing, auto-appending\n * proposals, and scheduled recertification cadence are deliberately out of\n * scope here: `engine-store` must not grow a model dependency, no selection\n * CLI verbs are exposed yet, approval routing belongs to\n * `@smthrs/control`, proposal admission still needs human product review, and\n * cadence belongs to a system-flow/product layer rather than the primitive\n * store.\n *\n * @since 0.1.0\n */\n\nimport { DurableWriter } from \"@smthrs/database/DurableWriter\"\nimport * as Clock from \"effect/Clock\"\nimport * as Context from \"effect/Context\"\nimport * as Effect from \"effect/Effect\"\nimport * as Layer from \"effect/Layer\"\nimport * as Schema from \"effect/Schema\"\nimport * as SqlClient from \"effect/unstable/sql/SqlClient\"\nimport * as Selection from \"./Selection.ts\"\n\n/**\n * Training outcomes for a suspected edge: a `hit` is a recertified deferral\n * that passed, a `miss` is one that failed — the guess was confidently wrong.\n *\n * @category schemas\n * @since 0.1.0\n */\nexport const TrainingOutcome = Schema.Literals([\"hit\", \"miss\"])\n\n/**\n * Training outcomes for a suspected edge.\n *\n * @category models\n * @since 0.1.0\n */\nexport type TrainingOutcome = typeof TrainingOutcome.Type\n\n/**\n * One observed result for a stored suspected edge.\n *\n * @category schemas\n * @since 0.1.0\n */\nexport const TrainingObservation = Schema.Struct({\n  scope: Schema.NonEmptyString,\n  affects: Schema.NonEmptyString,\n  outcome: TrainingOutcome\n})\n\n/**\n * One observed result for a stored suspected edge.\n *\n * @category models\n * @since 0.1.0\n */\nexport type TrainingObservation = typeof TrainingObservation.Type\n\n/**\n * Stable selection-store failure codes.\n *\n * @category schemas\n * @since 1.0.0\n */\nexport const SelectionStoreErrorCode = Schema.Literals([\n  \"invalid_input\",\n  \"decode_failed\",\n  \"persistence_failed\"\n])\n\n/**\n * Stable selection-store failure codes.\n *\n * @category models\n * @since 1.0.0\n */\nexport type SelectionStoreErrorCode = typeof SelectionStoreErrorCode.Type\n\n/**\n * A rejected public value, corrupt stored row, or unavailable database.\n *\n * @category errors\n * @since 1.0.0\n */\nexport class SelectionStoreError extends Schema.TaggedError<SelectionStoreError>()(\n  \"@smthrs/engine-store/SelectionStoreError\",\n  {\n    code: SelectionStoreErrorCode,\n    message: Schema.String,\n    scope: Schema.optional(Schema.String),\n    affects: Schema.optional(Schema.String),\n    cause: Schema.optional(Schema.Unknown)\n  }\n) {}\n\n/**\n * Durable suspected-edge persistence operations. `snapshot` pins the injected\n * clock's now, never `Date.now()`; `train` applies the asymmetric rule — a\n * hit gains five percent of the remaining headroom, a miss halves — to\n * matching stored edges only, ignoring unknown pairs rather than creating\n * them. Training retains at most {@link maxEvidenceEntries} newest evidence\n * entries per edge.\n *\n * @category models\n * @since 0.1.0\n */\nexport interface Service {\n  readonly upsert: (\n    edges: ReadonlyArray<Selection.SuspectedEdge>\n  ) => Effect.Effect<void, SelectionStoreError>\n  readonly list: () => Effect.Effect<ReadonlyArray<Selection.SuspectedEdge>, SelectionStoreError>\n  readonly snapshot: () => Effect.Effect<Selection.BeliefSnapshot, SelectionStoreError>\n  readonly train: (\n    observations: ReadonlyArray<TrainingObservation>\n  ) => Effect.Effect<void, SelectionStoreError>\n}\n\n/**\n * Service tag for the durable suspected-edge store.\n *\n * @category services\n * @since 0.1.0\n */\nexport class SelectionStore extends Context.Service<SelectionStore, Service>()(\n  \"@smthrs/engine-store/SelectionStore\"\n) {}\n\nconst EvidenceListFromJsonString = Schema.fromJsonString(Schema.Array(Schema.String))\n\nconst EdgeRow = Schema.Struct({\n  scope: Schema.NonEmptyString,\n  affects: Schema.NonEmptyString,\n  confidence: Schema.Number,\n  validFromMs: Selection.NonNegativeSafeInt,\n  evidenceJson: Schema.String\n})\n\ntype EdgeRow = typeof EdgeRow.Type\n\nconst invalidInput = (message: string, cause: unknown): SelectionStoreError =>\n  new SelectionStoreError({ code: \"invalid_input\", message, cause })\n\nconst persistenceFailed = (message: string, cause: unknown): SelectionStoreError =>\n  cause instanceof SelectionStoreError\n    ? cause\n    : new SelectionStoreError({ code: \"persistence_failed\", message, cause })\n\nconst decodeObservation = (input: unknown): Effect.Effect<TrainingObservation, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(TrainingObservation)(input).pipe(\n    Effect.mapError((cause) => invalidInput(\"a training observation is invalid\", cause))\n  )\n\nconst decodeEdge = (input: unknown): Effect.Effect<Selection.SuspectedEdge, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(Selection.SuspectedEdge)(input).pipe(\n    Effect.mapError((cause) => invalidInput(\"a suspected edge is invalid\", cause))\n  )\n\n// `decodeEdge` has already copied and validated this as an array of strings.\n// JSON encoding that closed value cannot fail, so retaining a fictitious\n// schema-error branch here only obscures the actual persistence failures.\nconst encodeEvidence = (evidence: ReadonlyArray<string>): Effect.Effect<string> =>\n  Effect.succeed(JSON.stringify(evidence))\n\nconst decodeEvidence = (\n  evidenceJson: string,\n  row: Pick<EdgeRow, \"scope\" | \"affects\">\n): Effect.Effect<ReadonlyArray<string>, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(EvidenceListFromJsonString)(evidenceJson).pipe(\n    Effect.mapError((cause) =>\n      new SelectionStoreError({\n        code: \"decode_failed\",\n        message: `stored edge ${row.scope} -> ${row.affects} has invalid evidence`,\n        scope: row.scope,\n        affects: row.affects,\n        cause\n      })\n    )\n  )\n\nconst decodeRow = (input: unknown): Effect.Effect<Selection.SuspectedEdge, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(EdgeRow)(input).pipe(\n    Effect.mapError((cause) =>\n      new SelectionStoreError({\n        code: \"decode_failed\",\n        message: \"a stored selection edge row is invalid\",\n        cause\n      })\n    ),\n    Effect.flatMap((row) =>\n      decodeEvidence(row.evidenceJson, row).pipe(\n        Effect.flatMap((evidence) =>\n          Schema.decodeUnknownEffect(Selection.SuspectedEdge)({\n            scope: row.scope,\n            affects: row.affects,\n            confidence: row.confidence,\n            validFromMs: row.validFromMs,\n            evidence\n          }).pipe(Effect.mapError((cause) =>\n            new SelectionStoreError({\n              code: \"decode_failed\",\n              message: `stored edge ${row.scope} -> ${row.affects} is invalid`,\n              scope: row.scope,\n              affects: row.affects,\n              cause\n            })\n          ))\n        )\n      )\n    )\n  )\n\nconst trainConfidence = (confidence: number, outcome: TrainingOutcome): number =>\n  outcome === \"hit\"\n    ? confidence + 0.05 * (1 - confidence)\n    : confidence * 0.5\n\n/**\n * Maximum evidence entries retained for one suspected edge. Training drops\n * the oldest entries after this bound and preserves the newest entries in\n * observation order.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const maxEvidenceEntries = 128\n\n/**\n * Builds the SQL-backed suspected-edge store.\n *\n * @category constructors\n * @since 0.1.0\n */\nexport const make: Effect.Effect<Service, never, DurableWriter | SqlClient.SqlClient> = Effect.gen(function*() {\n  const sql = yield* SqlClient.SqlClient\n  const writer = yield* DurableWriter\n\n  const selectEdge = (observation: TrainingObservation) =>\n    sql<EdgeRow>`\n      SELECT\n        scope,\n        affects,\n        confidence,\n        valid_from_ms AS \"validFromMs\",\n        evidence_json AS \"evidenceJson\"\n      FROM flows_selection_suspected_edges\n      WHERE scope = ${observation.scope}\n        AND affects = ${observation.affects}\n    `\n\n  const writeEdge = (edge: Selection.SuspectedEdge): Effect.Effect<void, SelectionStoreError> =>\n    Effect.gen(function*() {\n      const evidenceJson = yield* encodeEvidence(edge.evidence)\n      yield* sql`\n        INSERT INTO flows_selection_suspected_edges (\n          scope, affects, confidence, valid_from_ms, evidence_json\n        ) VALUES (\n          ${edge.scope}, ${edge.affects}, ${edge.confidence}, ${edge.validFromMs}, ${evidenceJson}\n        ) ON CONFLICT (scope, affects) DO UPDATE SET\n          confidence = excluded.confidence,\n          valid_from_ms = excluded.valid_from_ms,\n          evidence_json = excluded.evidence_json\n      `.pipe(Effect.mapError((cause) =>\n        persistenceFailed(\n          `could not persist edge ${edge.scope} -> ${edge.affects}`,\n          cause\n        )\n      ))\n    })\n\n  const upsert: Service[\"upsert\"] = Effect.fn(\"SelectionStore.upsert\")((edges) =>\n    Effect.gen(function*() {\n      const decoded = yield* Effect.forEach(edges, decodeEdge)\n      yield* writer.write(Effect.forEach(decoded, writeEdge, { discard: true })).pipe(\n        Effect.mapError((cause) => persistenceFailed(\"could not persist suspected edges\", cause))\n      )\n    })\n  )\n\n  const list: Service[\"list\"] = Effect.fn(\"SelectionStore.list\")(() =>\n    Effect.gen(function*() {\n      const rows = yield* sql<EdgeRow>`\n        SELECT\n          scope,\n          affects,\n          confidence,\n          valid_from_ms AS \"validFromMs\",\n          evidence_json AS \"evidenceJson\"\n        FROM flows_selection_suspected_edges\n        ORDER BY scope, affects\n      `.pipe(Effect.mapError((cause) => persistenceFailed(\"could not list suspected edges\", cause)))\n      return yield* Effect.forEach(rows, decodeRow)\n    })\n  )\n\n  const snapshot: Service[\"snapshot\"] = Effect.fn(\"SelectionStore.snapshot\")(() =>\n    Effect.gen(function*() {\n      const pinnedAtMs = yield* Clock.currentTimeMillis.pipe(Effect.map(Math.floor))\n      const edges = yield* list()\n      return { pinnedAtMs, edges }\n    })\n  )\n\n  const train: Service[\"train\"] = Effect.fn(\"SelectionStore.train\")((observations) =>\n    Effect.gen(function*() {\n      const decoded = yield* Effect.forEach(observations, decodeObservation)\n      yield* writer.write(Effect.forEach(\n        decoded,\n        (observation) =>\n          Effect.gen(function*() {\n            const rows = yield* selectEdge(observation).pipe(\n              Effect.mapError((cause) =>\n                persistenceFailed(\n                  `could not read edge ${observation.scope} -> ${observation.affects}`,\n                  cause\n                )\n              )\n            )\n            const row = rows[0]\n            if (row === undefined) return\n            const edge = yield* decodeRow(row)\n            yield* writeEdge({\n              ...edge,\n              confidence: trainConfidence(edge.confidence, observation.outcome),\n              evidence: [...edge.evidence, JSON.stringify(observation)].slice(-maxEvidenceEntries)\n            })\n          }),\n        { discard: true }\n      )).pipe(Effect.mapError((cause) => persistenceFailed(\"could not train suspected edges\", cause)))\n    })\n  )\n\n  return { upsert, list, snapshot, train }\n})\n\n/**\n * Provides the SQL-backed suspected-edge store.\n *\n * @category layers\n * @since 0.1.0\n */\nexport const layer: Layer.Layer<SelectionStore, never, DurableWriter | SqlClient.SqlClient> = Layer.effect(\n  SelectionStore\n)(make)\n"]}
+{"version":3,"file":"SelectionStore.js","sourceRoot":"","sources":["../../src/SelectionStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAA;AAC9D,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAA;AACjD,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AAU/D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC/C,KAAK,EAAE,MAAM,CAAC,cAAc;IAC5B,OAAO,EAAE,MAAM,CAAC,cAAc;IAC9B,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,MAAM,CAAC,QAAQ,CAAC;IACrD,eAAe;IACf,eAAe;IACf,oBAAoB;CACrB,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,OAAO,mBAAoB,SAAQ,MAAM,CAAC,WAAW,EAAuB,CAChF,0CAA0C,EAC1C;IACE,IAAI,EAAE,uBAAuB;IAC7B,OAAO,EAAE,MAAM,CAAC,MAAM;IACtB,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACrC,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACvC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;CACvC,CACF;CAAG;AAwBJ;;;;;GAKG;AACH,MAAM,OAAO,cAAe,SAAQ,OAAO,CAAC,OAAO,EAA2B,CAC5E,qCAAqC,CACtC;CAAG;AAEJ,MAAM,0BAA0B,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAA;AAErF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC,cAAc;IAC5B,OAAO,EAAE,MAAM,CAAC,cAAc;IAC9B,UAAU,EAAE,MAAM,CAAC,MAAM;IACzB,WAAW,EAAE,SAAS,CAAC,kBAAkB;IACzC,YAAY,EAAE,MAAM,CAAC,MAAM;CAC5B,CAAC,CAAA;AAIF,MAAM,YAAY,GAAG,CAAC,OAAe,EAAE,KAAc,EAAuB,EAAE,CAC5E,IAAI,mBAAmB,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAA;AAEpE,MAAM,iBAAiB,GAAG,CAAC,OAAe,EAAE,KAAc,EAAuB,EAAE,CACjF,KAAK,YAAY,mBAAmB;IAClC,CAAC,CAAC,KAAK;IACP,CAAC,CAAC,IAAI,mBAAmB,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAA;AAE7E,MAAM,iBAAiB,GAAG,CAAC,KAAc,EAA2D,EAAE,CACpG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CACzD,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,mCAAmC,EAAE,KAAK,CAAC,CAAC,CACrF,CAAA;AAEH,MAAM,UAAU,GAAG,CAAC,KAAc,EAA+D,EAAE,CACjG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAC7D,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,6BAA6B,EAAE,KAAK,CAAC,CAAC,CAC/E,CAAA;AAEH,6EAA6E;AAC7E,yEAAyE;AACzE,0EAA0E;AAC1E,MAAM,cAAc,GAAG,CAAC,QAA+B,EAAyB,EAAE,CAChF,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAA;AAE1C,MAAM,cAAc,GAAG,CACrB,YAAoB,EACpB,GAAuC,EACoB,EAAE,CAC7D,MAAM,CAAC,mBAAmB,CAAC,0BAA0B,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,CACvE,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,OAAO,EAAE,eAAe,GAAG,CAAC,KAAK,OAAO,GAAG,CAAC,OAAO,uBAAuB;IAC1E,KAAK,EAAE,GAAG,CAAC,KAAK;IAChB,OAAO,EAAE,GAAG,CAAC,OAAO;IACpB,KAAK;CACN,CAAC,CACH,CACF,CAAA;AAEH,MAAM,SAAS,GAAG,CAAC,KAAc,EAA+D,EAAE,CAChG,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAC7C,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,OAAO,EAAE,wCAAwC;IACjD,KAAK;CACN,CAAC,CACH,EACD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CACrB,cAAc,CAAC,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,IAAI,CACxC,MAAM,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAC1B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;IAClD,KAAK,EAAE,GAAG,CAAC,KAAK;IAChB,OAAO,EAAE,GAAG,CAAC,OAAO;IACpB,UAAU,EAAE,GAAG,CAAC,UAAU;IAC1B,WAAW,EAAE,GAAG,CAAC,WAAW;IAC5B,QAAQ;CACT,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAChC,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,OAAO,EAAE,eAAe,GAAG,CAAC,KAAK,OAAO,GAAG,CAAC,OAAO,aAAa;IAChE,KAAK,EAAE,GAAG,CAAC,KAAK;IAChB,OAAO,EAAE,GAAG,CAAC,OAAO;IACpB,KAAK;CACN,CAAC,CACH,CAAC,CACH,CACF,CACF,CACF,CAAA;AAEH,MAAM,eAAe,GAAG,CAAC,UAAkB,EAAE,OAAwB,EAAU,EAAE,CAC/E,OAAO,KAAK,KAAK;IACf,CAAC,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;IACtC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAA;AAEtB;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAErC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAuE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAC1G,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,SAAS,CAAA;IACtC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,aAAa,CAAA;IAEnC,MAAM,UAAU,GAAG,CAAC,WAAgC,EAAE,EAAE,CACtD,GAAG,CAAS;;;;;;;;sBAQM,WAAW,CAAC,KAAK;wBACf,WAAW,CAAC,OAAO;KACtC,CAAA;IAEH,MAAM,SAAS,GAAG,CAAC,IAA6B,EAA4C,EAAE,CAC5F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QACzD,KAAK,CAAC,CAAC,GAAG,CAAA;;;;YAIJ,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,WAAW,KAAK,YAAY;;;;;OAK1F,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAC/B,iBAAiB,CACf,0BAA0B,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,OAAO,EAAE,EACzD,KAAK,CACN,CACF,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEJ,MAAM,MAAM,GAAsB,MAAM,CAAC,EAAE,CAAC,uBAAuB,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7E,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QACxD,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAC7E,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,mCAAmC,EAAE,KAAK,CAAC,CAAC,CAC1F,CAAA;IACH,CAAC,CAAC,CACH,CAAA;IAED,MAAM,IAAI,GAAoB,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAClE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAS;;;;;;;;;OAS/B,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,gCAAgC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;QAC9F,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IAC/C,CAAC,CAAC,CACH,CAAA;IAED,MAAM,QAAQ,GAAwB,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,GAAG,EAAE,CAC9E,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QAC9E,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAA;QAC3B,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAA;IAC9B,CAAC,CAAC,CACH,CAAA;IAED,MAAM,KAAK,GAAqB,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,CACjF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,iBAAiB,CAAC,CAAA;QACtE,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAChC,OAAO,EACP,CAAC,WAAW,EAAE,EAAE,CACd,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,IAAI,CAC9C,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,iBAAiB,CACf,uBAAuB,WAAW,CAAC,KAAK,OAAO,WAAW,CAAC,OAAO,EAAE,EACpE,KAAK,CACN,CACF,CACF,CAAA;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,GAAG,KAAK,SAAS;gBAAE,OAAM;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;YAClC,KAAK,CAAC,CAAC,SAAS,CAAC;gBACf,GAAG,IAAI;gBACP,UAAU,EAAE,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,OAAO,CAAC;gBACjE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,kBAAkB,CAAC;aACrF,CAAC,CAAA;QACJ,CAAC,CAAC,EACJ,EAAE,OAAO,EAAE,IAAI,EAAE,CAClB,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,iCAAiC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;IAClG,CAAC,CAAC,CACH,CAAA;IAED,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;AAC1C,CAAC,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAA4E,KAAK,CAAC,MAAM,CACxG,cAAc,CACf,CAAC,IAAI,CAAC,CAAA","sourcesContent":["/**\n * Durable suspected-edge storage for probabilistic selection.\n *\n * The store persists advisory beliefs only: training moves edge confidence and\n * appends evidence, but it never writes scheduler journal records, step keys,\n * or cache rows (law 5). The edge and snapshot schemas are `Selection`'s own —\n * one source of truth, so a stored edge is by construction what\n * `Selection.select` consumes. Evidence entries stay strings: training appends\n * the observation JSON-encoded, so audits can replay the asymmetric rule\n * without the schema forking from `Selection.SuspectedEdge`.\n *\n * Model-backed selection, CLI verbs, approval routing, auto-appending\n * proposals, and scheduled recertification cadence are deliberately out of\n * scope here: `engine-store` must not grow a model dependency, no selection\n * CLI verbs are exposed yet, approval routing belongs to\n * `@smthrs/control`, proposal admission still needs human product review, and\n * cadence belongs to a system-flow/product layer rather than the primitive\n * store.\n *\n * @since 0.1.0\n */\n\nimport { DurableWriter } from \"@smthrs/database/DurableWriter\"\nimport * as Clock from \"effect/Clock\"\nimport * as Context from \"effect/Context\"\nimport * as Effect from \"effect/Effect\"\nimport * as Layer from \"effect/Layer\"\nimport * as Schema from \"effect/Schema\"\nimport * as SqlClient from \"effect/sql/SqlClient\"\nimport * as Selection from \"./Selection.ts\"\n\n/**\n * Training outcomes for a suspected edge: a `hit` is a recertified deferral\n * that passed, a `miss` is one that failed — the guess was confidently wrong.\n *\n * @category schemas\n * @since 0.1.0\n */\nexport const TrainingOutcome = Schema.Literals([\"hit\", \"miss\"])\n\n/**\n * Training outcomes for a suspected edge.\n *\n * @category models\n * @since 0.1.0\n */\nexport type TrainingOutcome = typeof TrainingOutcome.Type\n\n/**\n * One observed result for a stored suspected edge.\n *\n * @category schemas\n * @since 0.1.0\n */\nexport const TrainingObservation = Schema.Struct({\n  scope: Schema.NonEmptyString,\n  affects: Schema.NonEmptyString,\n  outcome: TrainingOutcome\n})\n\n/**\n * One observed result for a stored suspected edge.\n *\n * @category models\n * @since 0.1.0\n */\nexport type TrainingObservation = typeof TrainingObservation.Type\n\n/**\n * Stable selection-store failure codes.\n *\n * @category schemas\n * @since 1.0.0\n */\nexport const SelectionStoreErrorCode = Schema.Literals([\n  \"invalid_input\",\n  \"decode_failed\",\n  \"persistence_failed\"\n])\n\n/**\n * Stable selection-store failure codes.\n *\n * @category models\n * @since 1.0.0\n */\nexport type SelectionStoreErrorCode = typeof SelectionStoreErrorCode.Type\n\n/**\n * A rejected public value, corrupt stored row, or unavailable database.\n *\n * @category errors\n * @since 1.0.0\n */\nexport class SelectionStoreError extends Schema.TaggedError<SelectionStoreError>()(\n  \"@smthrs/engine-store/SelectionStoreError\",\n  {\n    code: SelectionStoreErrorCode,\n    message: Schema.String,\n    scope: Schema.optional(Schema.String),\n    affects: Schema.optional(Schema.String),\n    cause: Schema.optional(Schema.Unknown)\n  }\n) {}\n\n/**\n * Durable suspected-edge persistence operations. `snapshot` pins the injected\n * clock's now, never `Date.now()`; `train` applies the asymmetric rule — a\n * hit gains five percent of the remaining headroom, a miss halves — to\n * matching stored edges only, ignoring unknown pairs rather than creating\n * them. Training retains at most {@link maxEvidenceEntries} newest evidence\n * entries per edge.\n *\n * @category models\n * @since 0.1.0\n */\nexport interface Service {\n  readonly upsert: (\n    edges: ReadonlyArray<Selection.SuspectedEdge>\n  ) => Effect.Effect<void, SelectionStoreError>\n  readonly list: () => Effect.Effect<ReadonlyArray<Selection.SuspectedEdge>, SelectionStoreError>\n  readonly snapshot: () => Effect.Effect<Selection.BeliefSnapshot, SelectionStoreError>\n  readonly train: (\n    observations: ReadonlyArray<TrainingObservation>\n  ) => Effect.Effect<void, SelectionStoreError>\n}\n\n/**\n * Service tag for the durable suspected-edge store.\n *\n * @category services\n * @since 0.1.0\n */\nexport class SelectionStore extends Context.Service<SelectionStore, Service>()(\n  \"@smthrs/engine-store/SelectionStore\"\n) {}\n\nconst EvidenceListFromJsonString = Schema.fromJsonString(Schema.Array(Schema.String))\n\nconst EdgeRow = Schema.Struct({\n  scope: Schema.NonEmptyString,\n  affects: Schema.NonEmptyString,\n  confidence: Schema.Number,\n  validFromMs: Selection.NonNegativeSafeInt,\n  evidenceJson: Schema.String\n})\n\ntype EdgeRow = typeof EdgeRow.Type\n\nconst invalidInput = (message: string, cause: unknown): SelectionStoreError =>\n  new SelectionStoreError({ code: \"invalid_input\", message, cause })\n\nconst persistenceFailed = (message: string, cause: unknown): SelectionStoreError =>\n  cause instanceof SelectionStoreError\n    ? cause\n    : new SelectionStoreError({ code: \"persistence_failed\", message, cause })\n\nconst decodeObservation = (input: unknown): Effect.Effect<TrainingObservation, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(TrainingObservation)(input).pipe(\n    Effect.mapError((cause) => invalidInput(\"a training observation is invalid\", cause))\n  )\n\nconst decodeEdge = (input: unknown): Effect.Effect<Selection.SuspectedEdge, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(Selection.SuspectedEdge)(input).pipe(\n    Effect.mapError((cause) => invalidInput(\"a suspected edge is invalid\", cause))\n  )\n\n// `decodeEdge` has already copied and validated this as an array of strings.\n// JSON encoding that closed value cannot fail, so retaining a fictitious\n// schema-error branch here only obscures the actual persistence failures.\nconst encodeEvidence = (evidence: ReadonlyArray<string>): Effect.Effect<string> =>\n  Effect.succeed(JSON.stringify(evidence))\n\nconst decodeEvidence = (\n  evidenceJson: string,\n  row: Pick<EdgeRow, \"scope\" | \"affects\">\n): Effect.Effect<ReadonlyArray<string>, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(EvidenceListFromJsonString)(evidenceJson).pipe(\n    Effect.mapError((cause) =>\n      new SelectionStoreError({\n        code: \"decode_failed\",\n        message: `stored edge ${row.scope} -> ${row.affects} has invalid evidence`,\n        scope: row.scope,\n        affects: row.affects,\n        cause\n      })\n    )\n  )\n\nconst decodeRow = (input: unknown): Effect.Effect<Selection.SuspectedEdge, SelectionStoreError> =>\n  Schema.decodeUnknownEffect(EdgeRow)(input).pipe(\n    Effect.mapError((cause) =>\n      new SelectionStoreError({\n        code: \"decode_failed\",\n        message: \"a stored selection edge row is invalid\",\n        cause\n      })\n    ),\n    Effect.flatMap((row) =>\n      decodeEvidence(row.evidenceJson, row).pipe(\n        Effect.flatMap((evidence) =>\n          Schema.decodeUnknownEffect(Selection.SuspectedEdge)({\n            scope: row.scope,\n            affects: row.affects,\n            confidence: row.confidence,\n            validFromMs: row.validFromMs,\n            evidence\n          }).pipe(Effect.mapError((cause) =>\n            new SelectionStoreError({\n              code: \"decode_failed\",\n              message: `stored edge ${row.scope} -> ${row.affects} is invalid`,\n              scope: row.scope,\n              affects: row.affects,\n              cause\n            })\n          ))\n        )\n      )\n    )\n  )\n\nconst trainConfidence = (confidence: number, outcome: TrainingOutcome): number =>\n  outcome === \"hit\"\n    ? confidence + 0.05 * (1 - confidence)\n    : confidence * 0.5\n\n/**\n * Maximum evidence entries retained for one suspected edge. Training drops\n * the oldest entries after this bound and preserves the newest entries in\n * observation order.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const maxEvidenceEntries = 128\n\n/**\n * Builds the SQL-backed suspected-edge store.\n *\n * @category constructors\n * @since 0.1.0\n */\nexport const make: Effect.Effect<Service, never, DurableWriter | SqlClient.SqlClient> = Effect.gen(function*() {\n  const sql = yield* SqlClient.SqlClient\n  const writer = yield* DurableWriter\n\n  const selectEdge = (observation: TrainingObservation) =>\n    sql<EdgeRow>`\n      SELECT\n        scope,\n        affects,\n        confidence,\n        valid_from_ms AS \"validFromMs\",\n        evidence_json AS \"evidenceJson\"\n      FROM flows_selection_suspected_edges\n      WHERE scope = ${observation.scope}\n        AND affects = ${observation.affects}\n    `\n\n  const writeEdge = (edge: Selection.SuspectedEdge): Effect.Effect<void, SelectionStoreError> =>\n    Effect.gen(function*() {\n      const evidenceJson = yield* encodeEvidence(edge.evidence)\n      yield* sql`\n        INSERT INTO flows_selection_suspected_edges (\n          scope, affects, confidence, valid_from_ms, evidence_json\n        ) VALUES (\n          ${edge.scope}, ${edge.affects}, ${edge.confidence}, ${edge.validFromMs}, ${evidenceJson}\n        ) ON CONFLICT (scope, affects) DO UPDATE SET\n          confidence = excluded.confidence,\n          valid_from_ms = excluded.valid_from_ms,\n          evidence_json = excluded.evidence_json\n      `.pipe(Effect.mapError((cause) =>\n        persistenceFailed(\n          `could not persist edge ${edge.scope} -> ${edge.affects}`,\n          cause\n        )\n      ))\n    })\n\n  const upsert: Service[\"upsert\"] = Effect.fn(\"SelectionStore.upsert\")((edges) =>\n    Effect.gen(function*() {\n      const decoded = yield* Effect.forEach(edges, decodeEdge)\n      yield* writer.write(Effect.forEach(decoded, writeEdge, { discard: true })).pipe(\n        Effect.mapError((cause) => persistenceFailed(\"could not persist suspected edges\", cause))\n      )\n    })\n  )\n\n  const list: Service[\"list\"] = Effect.fn(\"SelectionStore.list\")(() =>\n    Effect.gen(function*() {\n      const rows = yield* sql<EdgeRow>`\n        SELECT\n          scope,\n          affects,\n          confidence,\n          valid_from_ms AS \"validFromMs\",\n          evidence_json AS \"evidenceJson\"\n        FROM flows_selection_suspected_edges\n        ORDER BY scope, affects\n      `.pipe(Effect.mapError((cause) => persistenceFailed(\"could not list suspected edges\", cause)))\n      return yield* Effect.forEach(rows, decodeRow)\n    })\n  )\n\n  const snapshot: Service[\"snapshot\"] = Effect.fn(\"SelectionStore.snapshot\")(() =>\n    Effect.gen(function*() {\n      const pinnedAtMs = yield* Clock.currentTimeMillis.pipe(Effect.map(Math.floor))\n      const edges = yield* list()\n      return { pinnedAtMs, edges }\n    })\n  )\n\n  const train: Service[\"train\"] = Effect.fn(\"SelectionStore.train\")((observations) =>\n    Effect.gen(function*() {\n      const decoded = yield* Effect.forEach(observations, decodeObservation)\n      yield* writer.write(Effect.forEach(\n        decoded,\n        (observation) =>\n          Effect.gen(function*() {\n            const rows = yield* selectEdge(observation).pipe(\n              Effect.mapError((cause) =>\n                persistenceFailed(\n                  `could not read edge ${observation.scope} -> ${observation.affects}`,\n                  cause\n                )\n              )\n            )\n            const row = rows[0]\n            if (row === undefined) return\n            const edge = yield* decodeRow(row)\n            yield* writeEdge({\n              ...edge,\n              confidence: trainConfidence(edge.confidence, observation.outcome),\n              evidence: [...edge.evidence, JSON.stringify(observation)].slice(-maxEvidenceEntries)\n            })\n          }),\n        { discard: true }\n      )).pipe(Effect.mapError((cause) => persistenceFailed(\"could not train suspected edges\", cause)))\n    })\n  )\n\n  return { upsert, list, snapshot, train }\n})\n\n/**\n * Provides the SQL-backed suspected-edge store.\n *\n * @category layers\n * @since 0.1.0\n */\nexport const layer: Layer.Layer<SelectionStore, never, DurableWriter | SqlClient.SqlClient> = Layer.effect(\n  SelectionStore\n)(make)\n"]}

package/dist/esm/StepBoundary.js

@@ -14,7 +14,7 @@ import { DerivedKey } from "@smthrs/keys";
 import * as FileSet from "@smthrs/plan/FileSet";
 import * as Context from "effect/Context";
 import * as Effect from "effect/Effect";
-import * as Encoding from "effect/Encoding";
+import * as Base64 from "effect/encoding/Base64";
 import * as FileSystem from "effect/FileSystem";
 import * as Layer from "effect/Layer";
 import * as Path from "effect/Path";
@@ -505,7 +505,7 @@ export const makeFileSystem = (fs, platformPath, artifacts, options = {}) => {
                     path,
                     digest,
                     sizeBytes: bytes.length,
-                    content: Encoding.encodeBase64(bytes)
+                    content: Base64.encode(bytes)
                 },
                 inlinedBytes: bytes.length
             };
@@ -537,7 +537,7 @@ export const makeFileSystem = (fs, platformPath, artifacts, options = {}) => {
             return;
         let bytes;
         if (output.content !== undefined) {
-            const decoded = Encoding.decodeBase64(output.content);
+            const decoded = Base64.decode(output.content);
             if (Result.isFailure(decoded)) {
                 // Inline content is cache-origin bytes: an undecodable payload is a
                 // tampered durable row, classified exactly like a digest mismatch so

package/dist/esm/StepBoundary.js.map

@@ -1 +1 @@
-{"version":3,"file":"StepBoundary.js","sourceRoot":"","sources":["../../src/StepBoundary.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,aAAa,MAAM,iCAAiC,CAAA;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAA;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAA;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAA;AAClD,OAAO,KAAK,gBAAgB,MAAM,2BAA2B,CAAA;AAC7D,OAAO,EAAE,SAAS,IAAI,eAAe,EAAE,MAAM,0BAA0B,CAAA;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,KAAK,OAAO,MAAM,sBAAsB,CAAA;AAC/C,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AAEzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,QAAQ,MAAM,iBAAiB,CAAA;AAC3C,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAC/C,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,IAAI,MAAM,aAAa,CAAA;AACnC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,oBAAoB,MAAM,oCAAoC,CAAA;AAC1E,OAAO,KAAK,eAAe,MAAM,+BAA+B,CAAA;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAA;AAEpD;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5C,UAAU,EAAE,YAAY;IACxB;;;;;OAKG;IACH,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC;CACtC,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,UAAwB,EAA4B,EAAE,CAC/E,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAsB,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;AAElF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,QAA0B,EAAW,EAAE;IACpE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAA;IACpD,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAChD,IAAI,OAAO,KAAK,SAAS;YAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;;YAClF,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;IACnC,CAAC;IACD,OAAO,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CACjD,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;QACtB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,IAAI,CAC1D,CAAA;AACH,CAAC,CAAA;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,MAAM,CAAC,YAAY,CAAC,sBAAsB,EAAE;IAC9E,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CAAC,CAAA;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,MAAM,CAAC,YAAY,CAAC,uBAAuB,EAAE;IACjF,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CAAC,CAAA;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,MAAM,CAAC,YAAY,CAAC,0BAA0B,EAAE;IACvF,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,oBAAoB,EAAE,sBAAsB,EAAE,yBAAyB,CAAC,CAAC,CAAA;AAUxH;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5C,eAAe,EAAE,MAAM,CAAC,OAAO;IAC/B,YAAY,EAAE,MAAM,CAAC,cAAc;IACnC;;;;;OAKG;IACH,uBAAuB,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9D,8DAA8D;IAC9D,qBAAqB,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5D,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAC;CAC9C,CAAC,CAAA;AAUF;;;;;;;;;;GAUG;AACH,MAAM,OAAO,eAAgB,SAAQ,MAAM,CAAC,WAAW,EAAmB,CACxE,sCAAsC,EACtC;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC;IACxC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CACF;CAAG;AAEJ;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,qBAAsB,SAAQ,MAAM,CAAC,WAAW,EAAyB,CACpF,4CAA4C,EAC5C;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,yBAAyB,CAAC;IAC/C,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CACF;CAAG;AAEJ;;;;;;;;;;GAUG;AACH,MAAM,OAAO,wBAAyB,SAAQ,MAAM,CAAC,WAAW,EAA4B,CAC1F,+CAA+C,EAC/C;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,4BAA4B,CAAC;IAClD,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CACF;CAAG;AAEJ;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,mBAAoB,SAAQ,MAAM,CAAC,WAAW,EAAuB,CAChF,0CAA0C,EAC1C;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,sBAAsB,CAAC;IAC5C,OAAO,EAAE,MAAM,CAAC,MAAM;IACtB;;;;OAIG;IACH,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;CACxC,CACF;CAAG;AAEJ;;;;;;;;;GASG;AACH,MAAM,OAAO,kBAAmB,SAAQ,MAAM,CAAC,WAAW,EAAsB,CAC9E,yCAAyC,EACzC;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC;IAC3C,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,cAAc,EAAE,MAAM,CAAC,MAAM;IAC7B,cAAc,EAAE,MAAM,CAAC,MAAM;CAC9B,CACF;CAAG;AAEJ;;;;;;;;;;GAUG;AACH,MAAM,OAAO,eAAgB,SAAQ,MAAM,CAAC,WAAW,EAAmB,CACxE,sCAAsC,EACtC;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC;IACxC,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,MAAM,EAAE,MAAM,CAAC,MAAM;CACtB,CACF;CAAG;AA8BJ;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,YAAY,GAAsC,OAAO,CAAC,OAAO,CAC5E,mCAAmC,CACpC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,OAAgB,EAAW,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,OAAO,CAAC,CAAA;AAE3E;;;;;GAKG;AACH,MAAM,YAAY,GAAG,QAAQ,CAAA;AAE7B;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,sBAAsB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC;IAC3C,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACzC,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;CACxC,CAAC,CAAA;AAEF,MAAM,mBAAmB,GAAG,MAAM,CAAC,MAAM,CAAC;IACxC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,sBAAsB,CAAC;IAC7C,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;QAChD,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,QAAQ,EAAE,MAAM,CAAC,MAAM;KACxB,CAAC,CAAC,CAAC;CACL,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,IAAY,EAAsB,EAAE;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IACnC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AACtD,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAAC,KAAc,EAAuB,EAAE,CAC1D,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,yDAAyD;IAClE,KAAK;CACN,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,KAAuC,EAAuB,EAAE,CACvF,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,yDAAyD,KAAK,CAAC,OAAO,EAAE;IACjF,KAAK;CACN,CAAC,CAAA;AAEJ;;;;;;GAMG;AACH,MAAM,gBAAgB,GAAG,CAAC,IAAY,EAAE,cAAsB,EAAsB,EAAE,CACpF,IAAI,kBAAkB,CAAC;IACrB,IAAI,EAAE,qBAAqB;IAC3B,IAAI;IACJ,cAAc;IACd,cAAc,EAAE,gBAAgB;CACjC,CAAC,CAAA;AAyCJ,MAAM,qBAAqB,GAAG,IAAI,GAAG,IAAI,CAAA;AACzC,MAAM,0BAA0B,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAA;AAclD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,QAA0B,EAAuC,EAAE;IACnG,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAA;IACzF,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,CAAA;IACzC,MAAM,OAAO,GAAgC,EAAE,CAAA;IAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;YAAE,SAAQ;QACpE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,EAAyB,EACzB,YAAuB,EACvB,SAAgC,EAChC,UAA6B,EAAE,EACtB,EAAE;IACX,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,qBAAqB,CAAA;IACtE,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,0BAA0B,CAAA;IACrF,2EAA2E;IAC3E,0DAA0D;IAC1D,MAAM,cAAc,GAAG,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,QAAQ,CAAC,EAAC,IAA2B,EAAE,IAAY;QAC7G,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAClF,OAAO,EAAE,MAAM,EAAE,KAAK,EAA2B,CAAA;IACnD,CAAC,CAAC,CAAA;IACF,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;IAC7D,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACxC,MAAM,YAAY,GAAG,MAAM,CAAC,EAAE,CAAC,2BAA2B,CAAC,CACzD,QAAQ,CAAC,EAAC,KAA4B,EAAE,OAAgB;QACtD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC3C,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CACnB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAiB,EAAE,CAAC,CAAC;gBACpC,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;gBAC7B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3C,CAAC,CAAC,EACH,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAChF,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B,EAAE,EAAE,WAAW,EAAE,gBAAgB,CAAC,mBAAmB,EAAE,CAAC,CAAA;QAC7D,CAAC;QACD,MAAM,MAAM,GAAqC,EAAE,CAAA;QACnD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACpE,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CACnC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBACzD,SAAS,EAAE,QAAQ;gBACnB,IAAI;gBACJ,OAAO;aACR,CAAC,CAAC,CACJ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;YACpC,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5E,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAC1D,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAChF,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B,CAAA;gBACD,IAAI,QAAQ,KAAK,SAAS;oBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;qBAC7C,IAAI,QAAQ,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;oBACzC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,CAAC,CAAA;gBAC9F,CAAC;;oBAAM,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,MAA8B,EAAE,CAAC,CAAA;YACtF,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC,CACF,CAAA;IACD;;;;;;;;OAQG;IACH,MAAM,OAAO,GAAG,CACd,IAAY,EACZ,OAA8B,EAAE,EAC2B,EAAE,CAC7D,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EACzC,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,EACnF,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B,CAAA;IACH,sEAAsE;IACtE,yEAAyE;IACzE,yEAAyE;IACzE,yEAAyE;IACzE,kBAAkB;IAClB,MAAM,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,QAAQ,CAAC,EAAC,IAAkB;QAClF,OAAO,KAAK,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;IACvF,CAAC,CAAC,CAAA;IACF,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,0BAA0B,CAAC,CAAC,QAAQ,CAAC,EAAC,IAA2B,EAAE,IAAY;QAC3G,OAAO,KAAK,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;IAC3F,CAAC,CAAC,CAAA;IACF,4EAA4E;IAC5E,6EAA6E;IAC7E,6EAA6E;IAC7E,0EAA0E;IAC1E,2EAA2E;IAC3E,0EAA0E;IAC1E,oCAAoC;IACpC,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,IAAI,IAAI,GAAG,CAAA;IAC3E,MAAM,UAAU,GAA8D,gBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC;QAC7G,CAAC,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,IAAI,CAC9C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,EAC9C,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B;QACD,CAAC,CAAC,MAAM,CAAC,IAAI,CACX,IAAI,mBAAmB,CAAC;YACtB,IAAI,EAAE,sBAAsB;YAC5B,OAAO,EACL,0HAA0H;SAC7H,CAAC,CACH,CAAA;IACH,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAC/C,QAAQ,CAAC,EAAC,IAAY,EAAE,YAAoB,EAAE,QAAmC;QAC/E,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;QAC3C,qEAAqE;QACrE,uEAAuE;QACvE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAA+B,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;QACzF,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;QAC5B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC,CAAC,CAAA;QAClH,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAA;QAC9B,wEAAwE;QACxE,mEAAmE;QACnE,IAAI,KAAK,CAAC,MAAM,IAAI,cAAc,IAAI,KAAK,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;YACnE,OAAO;gBACL,MAAM,EAAE;oBACN,IAAI;oBACJ,MAAM;oBACN,SAAS,EAAE,KAAK,CAAC,MAAM;oBACvB,OAAO,EAAE,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC;iBACT;gBAC9B,YAAY,EAAE,KAAK,CAAC,MAAM;aAC3B,CAAA;QACH,CAAC;QACD,mEAAmE;QACnE,yEAAyE;QACzE,oEAAoE;QACpE,yEAAyE;QACzE,yCAAyC;QACzC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAA;QACjF,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,kBAAkB,CAAC;gBACrB,IAAI,EAAE,qBAAqB;gBAC3B,IAAI;gBACJ,cAAc,EAAE,GAAG,MAAM,EAAE;gBAC3B,cAAc,EAAE,MAAM;aACvB,CAAC,CACH,CAAA;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAA+B,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IAC5G,CAAC,CACF,CAAA;IACD,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,0BAA0B,CAAC,CAAC,QAAQ,CAAC,EACjE,IAA2B,EAC3B,MAA0B;QAE1B,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAA;QACxD,uEAAuE;QACvE,yEAAyE;QACzE,mEAAmE;QACnE,qEAAqE;QACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CACpD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,YAAY,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,EAC3E,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAC1C,CAAA;QACD,IAAI,OAAO;YAAE,OAAM;QACnB,IAAI,KAAiB,CAAA;QACrB,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;YACrD,IAAI,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9B,oEAAoE;gBACpE,qEAAqE;gBACrE,gEAAgE;gBAChE,wDAAwD;gBACxD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;YAC9E,CAAC;YACD,KAAK,GAAG,OAAO,CAAC,OAAO,CAAA;YACvB,uEAAuE;YACvE,uEAAuE;YACvE,uEAAuE;YACvE,iDAAiD;YACjD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACpF,IAAI,QAAQ,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC/B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,kBAAkB,CAAC;oBACrB,IAAI,EAAE,qBAAqB;oBAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,cAAc,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE;oBAClC,cAAc,EAAE,QAAQ;iBACzB,CAAC,CACH,CAAA;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACnD,MAAM,CAAC,SAAS,CAAC;gBACf,gEAAgE;gBAChE,+DAA+D;gBAC/D,iEAAiE;gBACjE,+BAA+B;gBAC/B,mCAAmC,EAAE,CAAC,OAAO,EAAE,EAAE,CAC/C,MAAM,CAAC,IAAI,CACT,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAC7F;gBACH,+DAA+D;gBAC/D,gEAAgE;gBAChE,oEAAoE;gBACpE,sCAAsC,EAAE,CAAC,OAAO,EAAE,EAAE,CAClD,MAAM,CAAC,IAAI,CACT,IAAI,kBAAkB,CAAC;oBACrB,IAAI,EAAE,qBAAqB;oBAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,cAAc,EAAE,OAAO,CAAC,cAAc;oBACtC,cAAc,EAAE,OAAO,CAAC,cAAc;iBACvC,CAAC,CACH;gBACH,sCAAsC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;aAC3F,CAAC,CACH,CAAA;QACH,CAAC;QACD,sEAAsE;QACtE,mEAAmE;QACnE,oDAAoD;QACpD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC3C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;QAC3F,CAAC;QACD,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;IAC9E,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,CAAC;QACV,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,QAAQ,CAAC,EAAC,UAAU;YAC7D,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YACtD,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC;gBAChC,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,MAAM;gBAC9B,YAAY,EAAE,QAAQ,CAAC,YAAY;aACpC,CAAC,CAAA;YACF,iEAAiE;YACjE,mEAAmE;YACnE,mEAAmE;YACnE,kEAAkE;YAClE,gBAAgB;YAChB,MAAM,YAAY,GAAqB,EAAE,CAAA;YACzC,MAAM,KAAK,GAAkB,EAAE,CAAA;YAC/B,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACrC,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAA;gBACzC,CAAC;;oBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAC/B,CAAC;YACD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YAClD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5C,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,YAAY,EAAE,CAAC,CAAA;YAC9E,CAAC;YACD,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;YACtE,OAAO,MAAM,CAAC,MAAM,CAAC;gBACnB,UAAU,EAAE,QAAQ;gBACpB,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;aACtF,CAAC,CAAA;QACJ,CAAC,CAAC;QACF,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACzD,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC;gBAChC,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM;gBAC3C,YAAY,EAAE,QAAQ,CAAC,UAAU,CAAC,YAAY;aAC/C,CAAC,CAAA;YACF,mEAAmE;YACnE,sEAAsE;YACtE,qEAAqE;YACrE,6DAA6D;YAC7D,oEAAoE;YACpE,iDAAiD;YACjD,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,IAAI,EAAE,CAAA;YACjD,MAAM,cAAc,GAAG,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAA;YACpE,MAAM,cAAc,GAAG,CAAC,IAAY,EAAE,EAAE,CACtC,cAAc,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAC5B,OAAO,KAAK,KAAK,QAAQ;gBACvB,CAAC,CAAC,KAAK,KAAK,IAAI;gBAChB,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,cAAc;oBAC/B,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC;oBAC1D,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CACrC,CAAA;YACH,MAAM,UAAU,GAAkB,EAAE,CAAA;YACpC,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;YACzF,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAA;YACxF,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,KAAK,CAAC,MAAM;oBAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACjG,CAAC;YACD,MAAM,OAAO,GAA8B,EAAE,CAAA;YAC7C,qEAAqE;YACrE,yEAAyE;YACzE,yEAAyE;YACzE,MAAM,OAAO,GAAkB,EAAE,CAAA;YACjC,MAAM,SAAS,GAAkB,EAAE,CAAA;YACnC,IAAI,YAAY,GAAG,CAAC,CAAA;YACpB,MAAM,WAAW,GAAkB,EAAE,CAAA;YACrC,MAAM,WAAW,GAA4E,EAAE,CAAA;YAC/F,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACjD,IAAI,OAAO,KAAK,KAAK,QAAQ;oBAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;qBACjD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;oBAAE,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAA;qBACxE,CAAC;oBACJ,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAA;oBACxD,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;oBAC1B,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;gBAC/C,CAAC;YACH,CAAC;YACD,WAAW,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAA;YAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAA;YACtD,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;YAC/D,wEAAwE;YACxE,0EAA0E;YAC1E,wEAAwE;YACxE,MAAM,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;YACvF,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC;gBAClD,IAAI,GAAG,GAAG,MAAM,CAAA;gBAChB,IAAI,aAAa,GAAG,GAAG,CAAA;gBACvB,MAAM,IAAI,GAAG,KAAK,EAAE,OAAO,IAAI,gBAAgB,CAAC,mBAAmB,CAAA;gBACnE,OAAO,GAAG,GAAG,WAAW,CAAC,MAAM,IAAI,GAAG,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;oBACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC;wBAC3E,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;oBACnD,IAAI,GAAG,GAAG,MAAM,IAAI,KAAK,KAAK,SAAS,IAAI,aAAa,GAAG,QAAQ,GAAG,KAAK,CAAC,gBAAgB;wBAAE,MAAK;oBACnG,aAAa,IAAI,QAAQ,CAAA;oBACzB,GAAG,EAAE,CAAA;gBACP,CAAC;gBACD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;gBAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBACjD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;oBAChC,IAAI,KAAK,KAAK,SAAS,IAAI,QAAQ,EAAE,MAAM,KAAK,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;wBAC9E,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,sCAAsC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;oBACjG,CAAC;oBACD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,mBAAmB,GAAG,YAAY,EAAE,QAAQ,CAAC,CAAA;oBACjF,8DAA8D;oBAC9D,+DAA+D;oBAC/D,6CAA6C;oBAC7C,YAAY,IAAI,MAAM,CAAC,YAAY,CAAA;oBACnC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;oBAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;oBACjC,IACE,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,IAAI;wBAC7B,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;wBACvB,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC;wBACzF,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACpB,sEAAsE;oBACtE,mEAAmE;oBACnE,kDAAkD;oBAClD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnF,CAAC;gBACD,MAAM,GAAG,GAAG,CAAA;YACd,CAAC;YACD,wEAAwE;YACxE,qEAAqE;YACrE,mEAAmE;YACnE,sEAAsE;YACtE,iEAAiE;YACjE,mCAAmC;YACnC,MAAM,KAAK,GAAgE,EAAE,CAAA;YAC7E,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACpC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,MAAM,IAAI,YAAY,CAAU,CACxF,CAAA;gBACD,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CACnG,MAAM,CAAC,KAAK,CACb;iBACF,CAAC,CAAA;YACJ,CAAC;YACD,gFAAgF;YAChF,kEAAkE;YAClE,oDAAoD;YACpD,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,EAAE,eAAe;gBACrB,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC9D,KAAK;aACN,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACrB,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,YAAY,EAAE,CAAC,CAAA;YACnD,IAAI,QAAQ,CAAC,UAAU,CAAC,YAAY,KAAK,MAAM,EAAE,CAAC;gBAChD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CACnF,CAAA;gBACH,CAAC;gBACD,sEAAsE;gBACtE,qEAAqE;gBACrE,iEAAiE;gBACjE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,qBAAqB,CAAC,EAAE,IAAI,EAAE,yBAAyB,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAC7F,CAAA;gBACH,CAAC;gBACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,wBAAwB,CAAC,EAAE,IAAI,EAAE,4BAA4B,EAAE,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC,CACrG,CAAA;gBACH,CAAC;YACH,CAAC;YACD,OAAO;gBACL,eAAe,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;gBACtE,YAAY;gBACZ,mEAAmE;gBACnE,iEAAiE;gBACjE,mEAAmE;gBACnE,EAAE;gBACF,mEAAmE;gBACnE,oEAAoE;gBACpE,sEAAsE;gBACtE,qCAAqC;gBACrC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;oBACvB,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,sBAA+B,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,EAAE;oBAC3F,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;wBACpB,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,uBAAgC,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE;wBACzF,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;4BACtB,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,0BAAmC,EAAE,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE;4BAC9F,CAAC,CAAC,EAAE,CAAC;aACR,CAAA;QACH,CAAC,CAAC;QACF,aAAa,EAAE,MAAM,CAAC,EAAE,CAAC,4BAA4B,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACvE,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAA;YAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAA;YACzF,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC/B,mEAAmE;gBACnE,+DAA+D;gBAC/D,iEAAiE;gBACjE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,mBAAmB,CAAC;oBACtB,IAAI,EAAE,sBAAsB;oBAC5B,OAAO,EAAE,kEAAkE;iBAC5E,CAAC,CACH,CAAA;YACH,CAAC;YACD,sEAAsE;YACtE,qEAAqE;YACrE,qEAAqE;YACrE,wEAAwE;YACxE,uEAAuE;YACvE,MAAM,OAAO,GAAG;gBACd,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;gBACzD,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;aACxD,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAA;YACpD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,mBAAmB,CAAC;oBACtB,IAAI,EAAE,sBAAsB;oBAC5B,OAAO,EAAE,qEAAqE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBACnG,CAAC,CACH,CAAA;YACH,CAAC;YACD,wEAAwE;YACxE,yDAAyD;YACzD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,UAAU,CAAA;YAC9B,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAU,CAAA;YAClD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;gBAC/C,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;gBACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,OAAO,CAAC,OAAO,CAAC,OAAO;qBACpB,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;qBAC5B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAC7C,CAAA;gBACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;oBACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;gBACtF,CAAC;gBACD,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,WAAW;oBAAE,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YACtF,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;oBAC3B,oEAAoE;oBACpE,iEAAiE;oBACjE,mEAAmE;oBACnE,6DAA6D;oBAC7D,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;gBACrF,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;gBAClC,CAAC;YACH,CAAC;YACD,yDAAyD;YACzD,sEAAsE;YACtE,oEAAoE;YACpE,MAAM,WAAW,GAAG,CAAC,GAAG,wBAAwB,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACrE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CACvD,CAAA;YACD,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;gBACvF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;YAC5F,CAAC;QACH,CAAC,CAAC;KACH,CAAC,CAAA;AACJ,CAAC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,MAAM,KAAK,GAId,KAAK,CAAC,MAAM,CACd,YAAY,EACZ,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IACvC,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IACrC,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,aAAa,CAAC,aAAa,CAAA;IACpD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;IAC9D,OAAO,cAAc,CAAC,EAAE,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AACrH,CAAC,CAAC,CACH,CAAA;AAuCD,MAAM,WAAW,GAAG,GAAwB,EAAE,CAC5C,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,oDAAoD;CAC9D,CAAC,CAAA;AAEJ;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,UAAuB,EAAE,EAAwB,EAAE;IAC3E,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,WAAW,CAAA;IACxD,MAAM,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,QAAQ,CAAC,EAAC,UAAU;YAC7D,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAA;YACzE,OAAO;gBACL,UAAU;gBACV,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,UAAU,CAAC,UAAU,CAAC;aAC7D,CAAA;QACH,CAAC,CAAC;QACF,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACzD,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAA;YACzE,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YAC7E,OAAO;gBACL,eAAe,EAAE,OAAO,CAAC,eAAe,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE;gBACnF,YAAY;gBACZ,GAAG,CAAC,OAAO,CAAC,uBAAuB,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,uBAAuB,EAAE,IAAa,EAAE,CAAC;gBAChG,GAAG,CAAC,OAAO,CAAC,qBAAqB,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,EAAE,IAAa,EAAE,CAAC;gBAC5F,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;aAC7E,CAAA;QACH,CAAC,CAAC;QACF,aAAa,EAAE,MAAM,CAAC,EAAE,CAAC,4BAA4B,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACvE,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAA;YACzE,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;gBACtB,OAAO,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAA;YAC9B,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC;KACH,CAAC,CAAA;IACF,OAAO,KAAK,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;AAC7C,CAAC,CAAA","sourcesContent":["/**\n * Hermetic step boundary contracts, the filesystem-backed production\n * implementation, and the deterministic test implementation.\n *\n * @since 0.1.0\n */\n\nimport * as ArtifactStore from \"@smthrs/artifacts/ArtifactStore\"\nimport { Sha256 } from \"@smthrs/crypto\"\nimport { FileBoundary } from \"@smthrs/flow/FileBoundary\"\nimport { FileInput } from \"@smthrs/flow/FileInput\"\nimport * as KernelFileSystem from \"@smthrs/kernel/FileSystem\"\nimport { Workspace as KernelWorkspace } from \"@smthrs/kernel/Workspace\"\nimport { DerivedKey } from \"@smthrs/keys\"\nimport * as FileSet from \"@smthrs/plan/FileSet\"\nimport * as Context from \"effect/Context\"\nimport type * as Crypto from \"effect/Crypto\"\nimport * as Effect from \"effect/Effect\"\nimport * as Encoding from \"effect/Encoding\"\nimport * as FileSystem from \"effect/FileSystem\"\nimport * as Layer from \"effect/Layer\"\nimport * as Path from \"effect/Path\"\nimport * as Result from \"effect/Result\"\nimport * as Schema from \"effect/Schema\"\nimport * as FileBoundarySnapshot from \"./internal/FileBoundarySnapshot.ts\"\nimport * as FileEnumeration from \"./internal/FileEnumeration.ts\"\nimport { compareText } from \"./internal/Ordering.ts\"\n\n/**\n * A file boundary that has been measured but not yet run: the caller's\n * declaration, paired with what the host actually found on disk for it.\n *\n * `prepare` produces one of these before a step executes and `settle` consumes\n * it afterwards, which is what lets the boundary say whether the world moved\n * underneath the declaration. Check it with {@link readSetMatches}.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const PreparedBoundary = Schema.Struct({\n  descriptor: FileBoundary,\n  /**\n   * What the host actually measured for the declared read set at prepare\n   * time. The declared digests are caller metadata folded into the step key;\n   * this is the evidence that they still describe reality, and a sealed\n   * cache hit is refused when the two disagree (issue #90).\n   */\n  readSnapshot: Schema.Array(FileInput)\n})\n\n/**\n * The value form of {@link PreparedBoundary}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type PreparedBoundary = typeof PreparedBoundary.Type\n\n/**\n * Exact read inputs from a boundary after ignoring declarations that still need expansion.\n *\n * @category accessors\n * @since 0.1.0\n */\nexport const exactReads = (descriptor: FileBoundary): ReadonlyArray<FileInput> =>\n  descriptor.readSet.filter((entry): entry is FileInput => !FileSet.isGlob(entry))\n\n/**\n * Whether every declared read still matches what the host measured.\n *\n * Reads the host reports but the declaration never claimed are ignored: the\n * declaration is the dependency edge set, and an incidental extra read is not\n * one of its edges. A declared path missing from the measurement counts as a\n * mismatch — its value is unknown, so reuse cannot be justified.\n *\n * @since 0.1.0\n * @category predicates\n */\nexport const readSetMatches = (prepared: PreparedBoundary): boolean => {\n  const digestsByPath = new Map<string, Set<string>>()\n  for (const measured of prepared.readSnapshot) {\n    const digests = digestsByPath.get(measured.path)\n    if (digests === undefined) digestsByPath.set(measured.path, new Set([measured.digest]))\n    else digests.add(measured.digest)\n  }\n  return prepared.descriptor.readSet.every((entry) =>\n    !FileSet.isGlob(entry) &&\n    digestsByPath.get(entry.path)?.has(entry.digest) === true\n  )\n}\n\n/**\n * The paths a step wrote that its `expected` write set did not name, together\n * with the diff identity they were observed under.\n *\n * An expected-mode boundary reports these rather than failing: the declaration\n * is a prediction, and a wrong prediction is evidence to journal, not an\n * error. A hard-mode boundary raises {@link UndeclaredWrite} for the same\n * observation.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const ExpectedSetDeviation = Schema.TaggedStruct(\"ExpectedSetDeviation\", {\n  paths: Schema.Array(Schema.String),\n  diffIdentity: Schema.NonEmptyString\n})\n\n/**\n * Declared writes an expected-mode step did not produce, and did not declare\n * as removals.\n *\n * The absence itself is the defect: recording it as valid evidence caches the\n * claim \"this file should not exist\", which `replayOutputs` then acts on by\n * deleting the path on a workspace that never ran the step. A hard-mode\n * boundary raises {@link MissingDeclaredOutput} for the same observation.\n *\n * Expected mode records it rather than failing because the declaration there is\n * a prediction — and because a deviation of any variant already bars the\n * evidence from the shared cache (`ActionPersistence` gates `recordCache` on\n * `deviation === undefined`), so an unexplained absence never reaches another\n * host either way.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const MissingOutputDeviation = Schema.TaggedStruct(\"MissingDeclaredOutput\", {\n  paths: Schema.Array(Schema.String),\n  diffIdentity: Schema.NonEmptyString\n})\n\n/**\n * Declared removals an expected-mode step left in place.\n *\n * The dual of {@link MissingOutputDeviation}: a removal is a promise about the\n * post-state exactly as a write is. A path that was promised absent but is\n * still present — possibly mutated — must not settle as valid evidence, or\n * the mutation is cached under a declaration that disclaimed it and replay\n * materializes it everywhere. A hard-mode boundary raises\n * {@link SurvivingDeclaredRemoval} for the same observation.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const SurvivingRemovalDeviation = Schema.TaggedStruct(\"SurvivingDeclaredRemoval\", {\n  paths: Schema.Array(Schema.String),\n  diffIdentity: Schema.NonEmptyString\n})\n\n/**\n * What a settled boundary observed that its declaration did not predict.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const BoundaryDeviation = Schema.Union([ExpectedSetDeviation, MissingOutputDeviation, SurvivingRemovalDeviation])\n\n/**\n * The value form of {@link BoundaryDeviation}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BoundaryDeviation = typeof BoundaryDeviation.Type\n\n/**\n * What a settled boundary proved about a step's writes — the record the\n * journal keeps and a later cache hit is justified against.\n *\n * `diffIdentity` names the post-state the step produced; `declaredOutputs`\n * carries whatever the implementation needs to reproduce it on a workspace\n * that never ran the step. The two optional fields are the honest gaps:\n * `wholeTreeWritesVerified` is present only when the boundary could observe\n * the entire execution tree, and `deviation` only when it saw writes the\n * declaration did not predict.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const BoundaryEvidence = Schema.Struct({\n  declaredOutputs: Schema.Unknown,\n  diffIdentity: Schema.NonEmptyString,\n  /**\n   * The boundary observed the whole execution tree and proved that every\n   * write was covered by the descriptor's write set. Only evidence carrying\n   * this explicit proof may enter the cross-run cache. Older evidence and\n   * boundaries that can inspect declared paths only omit it.\n   */\n  wholeTreeWritesVerified: Schema.optional(Schema.Literal(true)),\n  /** The body could observe only declared filesystem inputs. */\n  hermeticReadsVerified: Schema.optional(Schema.Literal(true)),\n  deviation: Schema.optional(BoundaryDeviation)\n})\n\n/**\n * The value form of {@link BoundaryEvidence}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BoundaryEvidence = typeof BoundaryEvidence.Type\n\n/**\n * A hard-mode step wrote outside its declared write set.\n *\n * Hard mode treats the declaration as a contract, so this is a refusal, not a\n * report: the step's evidence is never journaled and never becomes a cache\n * entry. An expected-mode boundary records the same observation as a\n * {@link BoundaryDeviation} instead.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class UndeclaredWrite extends Schema.TaggedError<UndeclaredWrite>()(\n  \"@smthrs/engine-store/UndeclaredWrite\",\n  {\n    code: Schema.Literal(\"undeclared_write\"),\n    paths: Schema.Array(Schema.String),\n    diffIdentity: Schema.NonEmptyString\n  }\n) {}\n\n/**\n * A step finished without producing a path its write set declared, and did not\n * declare that path as a removal.\n *\n * Bazel hard-fails the same observation — `SkyframeActionExecutor.checkOutputs`\n * reports \"output was not created\" — and for the same reason: the alternative\n * is to record `digest: null` as valid evidence, which caches the claim \"this\n * file should not exist\" and makes every later replay delete the path. A step\n * that crashed after declaring its writes would poison the cache with an\n * eraser.\n *\n * Declaring the path in {@link FileBoundary}'s `removes` is how a deliberate\n * deletion says so, and it is the only thing that makes the absence legitimate.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class MissingDeclaredOutput extends Schema.TaggedError<MissingDeclaredOutput>()(\n  \"@smthrs/engine-store/MissingDeclaredOutput\",\n  {\n    code: Schema.Literal(\"missing_declared_output\"),\n    paths: Schema.Array(Schema.String),\n    diffIdentity: Schema.NonEmptyString\n  }\n) {}\n\n/**\n * A hard-mode step left a declared removal in place.\n *\n * The dual of {@link MissingDeclaredOutput}: `removes` promises the path is\n * absent afterwards, and a path that survived — or was quietly rewritten —\n * is a post-state the declaration disclaimed. Settling it as evidence would\n * cache the surviving bytes under a removal and hand them to every replay.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class SurvivingDeclaredRemoval extends Schema.TaggedError<SurvivingDeclaredRemoval>()(\n  \"@smthrs/engine-store/SurvivingDeclaredRemoval\",\n  {\n    code: Schema.Literal(\"surviving_declared_removal\"),\n    paths: Schema.Array(Schema.String),\n    diffIdentity: Schema.NonEmptyString\n  }\n) {}\n\n/**\n * The host could not honour the boundary at all — a filesystem that cannot be\n * measured, a path that cannot be read, a transient I/O failure.\n *\n * It is the catch-all host refusal, deliberately kept distinct from the two\n * refusals a caller can act on: {@link BoundaryCorruption} (the bytes changed\n * under a recorded digest) and {@link MissingArtifact} (the bytes might be\n * fetchable from a shared tier).\n *\n * @since 0.1.0\n * @category errors\n */\nexport class UnsupportedBoundary extends Schema.TaggedError<UnsupportedBoundary>()(\n  \"@smthrs/engine-store/UnsupportedBoundary\",\n  {\n    code: Schema.Literal(\"unsupported_boundary\"),\n    message: Schema.String,\n    /**\n     * The refusing host or artifact-store failure, carried whole rather than\n     * flattened into the message (`PlatformError`'s own convention), so the\n     * journal record and a live debugger both see the original error.\n     */\n    cause: Schema.optional(Schema.Defect())\n  }\n) {}\n\n/**\n * Recorded boundary evidence whose bytes no longer match their recorded\n * digest — an integrity violation of the store's strongest invariant, as\n * opposed to a transient host failure (issue #150). The two classes were\n * previously conflated under one `UnsupportedBoundary` tag, so a failing\n * disk corrupting many blobs journalled identically to a one-off EIO.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class BoundaryCorruption extends Schema.TaggedError<BoundaryCorruption>()(\n  \"@smthrs/engine-store/BoundaryCorruption\",\n  {\n    code: Schema.Literal(\"boundary_corruption\"),\n    path: Schema.String,\n    recordedDigest: Schema.String,\n    measuredDigest: Schema.String\n  }\n) {}\n\n/**\n * Recorded evidence references an artifact this host's store does not hold\n * (issue #172). Distinct from {@link UnsupportedBoundary} because it is the one\n * replay refusal a *shared artifact tier* can repair: the caller fetches the\n * blob from the remote store, writes it back locally, and retries the replay\n * once before falling through to a real execution. Every other host refusal\n * says nothing about where the bytes might be.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class MissingArtifact extends Schema.TaggedError<MissingArtifact>()(\n  \"@smthrs/engine-store/MissingArtifact\",\n  {\n    code: Schema.Literal(\"missing_artifact\"),\n    path: Schema.String,\n    digest: Schema.String\n  }\n) {}\n\n/**\n * The three-call lifecycle of a hermetic step boundary.\n *\n * `prepare` measures the declared read set before the step runs; `settle`\n * measures the writes afterwards and turns them into {@link BoundaryEvidence};\n * `replayOutputs` reproduces a previous step's outputs from that evidence, so\n * a cache hit can materialize results on a workspace that never executed\n * anything.\n *\n * @since 0.1.0\n * @category services\n */\nexport interface Service {\n  readonly prepare: (\n    descriptor: FileBoundary\n  ) => Effect.Effect<PreparedBoundary, UnsupportedBoundary, Crypto.Crypto>\n  readonly settle: (\n    prepared: PreparedBoundary\n  ) => Effect.Effect<\n    BoundaryEvidence,\n    UndeclaredWrite | MissingDeclaredOutput | SurvivingDeclaredRemoval | UnsupportedBoundary | BoundaryCorruption,\n    Crypto.Crypto\n  >\n  readonly replayOutputs: (\n    evidence: BoundaryEvidence\n  ) => Effect.Effect<void, UnsupportedBoundary | BoundaryCorruption | MissingArtifact, Crypto.Crypto>\n}\n\n/**\n * The service key for a {@link Service}. Provide it with `layer` for\n * a real workspace or `layerTest` for a deterministic in-memory one.\n *\n * @since 0.1.0\n * @category services\n */\nexport const StepBoundary: Context.Service<Service, Service> = Context.Service<Service>(\n  \"@smthrs/engine-store/StepBoundary\"\n)\n\n/**\n * Brands a {@link Service} implementation as a `StepBoundary`, so a new\n * boundary backend is type-checked where it is written rather than where it is\n * provided.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make = (service: Service): Service => StepBoundary.of(service)\n\n/**\n * The digest a measurement reports for a declared path that does not exist.\n * Declared digests are hex SHA-256 strings, so the sentinel can never\n * collide with a real measurement — a declaration naming a vanished file\n * always mismatches and the cache hit is refused.\n */\nconst absentDigest = \"absent\"\n\n/**\n * The persisted shape of the production layer's `declaredOutputs`: the\n * declared write set's materialized post-state, so a cache-hit replay can\n * reproduce the outputs on a workspace that never ran the step.\n *\n * Outputs are recorded by content digest, never inlined unbounded\n * (issue #113): a `null` digest records that the path did not exist at\n * settle time; `content` (base64) is present only when the payload fits the\n * configured inline bound, otherwise the bytes live in the host's\n * content-addressed object directory under the digest and the row carries\n * only the reference. Temporal's blob-size limits are the prior art — the\n * evidence is persisted into every attempt row and cache entry.\n *\n * The digest is decoded against the store's strict address schema\n * (`ArtifactStore.Digest`), so a persisted row carrying a malformed address\n * fails the decode here instead of reaching the store or the sync RPCs.\n */\nconst DigestReferencedOutput = Schema.Struct({\n  path: Schema.String,\n  digest: Schema.NullOr(ArtifactStore.Digest),\n  sizeBytes: Schema.optional(Schema.Number),\n  content: Schema.optional(Schema.String)\n})\n\nconst MaterializedOutputs = Schema.Struct({\n  outputs: Schema.Array(DigestReferencedOutput),\n  trees: Schema.optional(Schema.Array(Schema.Struct({\n    path: Schema.String,\n    identity: Schema.String\n  })))\n})\n\n/**\n * The directory portion of a slash-separated path, or `undefined` for a\n * bare filename (nothing to create). Boundary paths are workspace-relative\n * and slash-separated — the same normalization the kernel `FileSystem`\n * layer applies.\n */\nconst parentDirectory = (path: string): string | undefined => {\n  const index = path.lastIndexOf(\"/\")\n  return index <= 0 ? undefined : path.slice(0, index)\n}\n\nconst hostFailure = (cause: unknown): UnsupportedBoundary =>\n  new UnsupportedBoundary({\n    code: \"unsupported_boundary\",\n    message: \"the host filesystem could not enforce the step boundary\",\n    cause\n  })\n\n/**\n * An artifact store that refused the operation outright — a failing disk, an\n * unreachable shared tier, an address that is not a content address. Unlike a\n * miss or a corruption it says nothing about the artifact, so it stays the\n * ordinary retryable host refusal the issue-#107 call sites already handle.\n */\nconst artifactFailure = (cause: ArtifactStore.ArtifactStoreError): UnsupportedBoundary =>\n  new UnsupportedBoundary({\n    code: \"unsupported_boundary\",\n    message: `the artifact store could not serve the step boundary: ${cause.message}`,\n    cause\n  })\n\n/**\n * Corruption of an *inline* evidence payload (issue #159): the recorded\n * base64 no longer decodes, so there are no bytes to measure a digest of —\n * the `invalid_base64` sentinel records that the measurement itself was\n * impossible, which is still cache-origin corruption and never a transient\n * host refusal.\n */\nconst inlineCorruption = (path: string, recordedDigest: string): BoundaryCorruption =>\n  new BoundaryCorruption({\n    code: \"boundary_corruption\",\n    path,\n    recordedDigest,\n    measuredDigest: \"invalid_base64\"\n  })\n\n/**\n * The two size bounds that decide when a settled output is inlined into\n * boundary evidence and when it is spilled to the `ArtifactStore` by digest.\n *\n * Both default to values that keep an evidence row small enough to journal;\n * raise them only when the workspace's outputs are known to be small and the\n * extra artifact round-trip is measurably costing something.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface FileSystemOptions {\n  /**\n   * The largest output (in bytes) inlined into the boundary evidence\n   * itself. Anything larger is handed to the `ArtifactStore` and recorded by\n   * digest reference only (issue #113). Defaults to 1 MiB.\n   */\n  readonly maxInlineBytes?: number | undefined\n  /**\n   * The largest *aggregate* inline payload (in bytes) a single settle may\n   * fold into its boundary evidence (issue #122). A per-output bound alone\n   * still let a wide write set multiply many individually-small payloads\n   * into an unbounded evidence row; once an output would push the running\n   * total past this bound it is spilled to the `ArtifactStore` and\n   * recorded by digest reference only, even though it individually fits\n   * {@link maxInlineBytes}. Defaults to 8 MiB.\n   */\n  readonly maxTotalInlineBytes?: number | undefined\n  /**\n   * The workspace root cache replay confines its writes, removals, and prune\n   * walk to. A filesystem already confined to a root (the kernel-guarded\n   * layer's service, or a `confined` view) keeps its own root and ignores\n   * this. Otherwise it defaults to the process working directory, the root a\n   * path-based host resolves `prepare` and `settle` against. {@link layer}\n   * passes the kernel `Workspace` root when one is in context.\n   */\n  readonly root?: string | undefined\n}\n\nconst defaultMaxInlineBytes = 1024 * 1024\nconst defaultMaxTotalInlineBytes = 8 * 1024 * 1024\ninterface MeasuredDigest {\n  readonly digest: ArtifactStore.Digest\n  readonly bytes: Uint8Array\n}\n\ninterface BatchedDigest {\n  readonly digest: ArtifactStore.Digest\n  readonly sizeBytes: number\n  readonly bytes?: Uint8Array\n}\n\ntype MaterializedOutput = typeof DigestReferencedOutput.Type\n\n/**\n * The digests this evidence references rather than inlines — the set that must\n * be durable in a shared artifact tier before the evidence's cache entry\n * becomes observable there, and the set a replay on a fresh host has to fetch.\n *\n * Evidence recorded by a foreign boundary implementation references nothing\n * this store can name, so it yields the empty list rather than failing: the\n * caller's replay path already refuses such evidence with\n * {@link UnsupportedBoundary}.\n *\n * @since 0.1.0\n * @category accessors\n */\nexport const referencedDigests = (evidence: BoundaryEvidence): ReadonlyArray<ArtifactStore.Digest> => {\n  const decoded = Schema.decodeUnknownResult(MaterializedOutputs)(evidence.declaredOutputs)\n  if (decoded._tag === \"Failure\") return []\n  const digests: Array<ArtifactStore.Digest> = []\n  for (const output of decoded.success.outputs) {\n    if (output.digest === null || output.content !== undefined) continue\n    digests.push(output.digest)\n  }\n  return digests\n}\n\n/**\n * Builds the filesystem-backed boundary service.\n *\n * The blob mechanics — content addressing, atomic publication, digest\n * verification, dedupe — belong to `artifacts` and were extracted into\n * `@smthrs/artifacts` (`packages/smithers/flows/artifacts/docs/api.md`). What stays here\n * is the *policy* that decides which outputs become blobs at all: the\n * inline-versus-spill budgets are a property of how large an evidence row may\n * get, not of how bytes are stored.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const makeFileSystem = (\n  fs: FileSystem.FileSystem,\n  platformPath: Path.Path,\n  artifacts: ArtifactStore.Service,\n  options: FileSystemOptions = {}\n): Service => {\n  const maxInlineBytes = options.maxInlineBytes ?? defaultMaxInlineBytes\n  const maxTotalInlineBytes = options.maxTotalInlineBytes ?? defaultMaxTotalInlineBytes\n  // Stat tuples are not content identities: a same-size rewrite can preserve\n  // mtime, device, and inode on every supported filesystem.\n  const readDigestFrom = Effect.fn(\"StepBoundary.readDigest\")(function*(host: FileSystem.FileSystem, path: string) {\n    const bytes = yield* host.readFile(path)\n    const digest = yield* Schema.decodeUnknownEffect(Sha256)(bytes).pipe(Effect.orDie)\n    return { digest, bytes } satisfies MeasuredDigest\n  })\n  const readDigest = (path: string) => readDigestFrom(fs, path)\n  const batch = KernelFileSystem.batch(fs)\n  const measurements = Effect.fn(\"StepBoundary.measurements\")(\n    function*(paths: ReadonlyArray<string>, content: boolean) {\n      if (batch === undefined) {\n        return yield* Effect.forEach(paths, (path) =>\n          readDigest(path).pipe(\n            Effect.map((value): BatchedDigest => ({\n              digest: value.digest,\n              sizeBytes: value.bytes.length,\n              ...(content ? { bytes: value.bytes } : {})\n            })),\n            Effect.catchReason(\"PlatformError\", \"NotFound\", () => Effect.succeed(undefined)),\n            Effect.mapError(hostFailure)\n          ), { concurrency: KernelFileSystem.fallbackConcurrency })\n      }\n      const values: Array<BatchedDigest | undefined> = []\n      for (let offset = 0; offset < paths.length; offset += batch.maxSize) {\n        const response = yield* batch.execute(\n          paths.slice(offset, offset + batch.maxSize).map((path) => ({\n            operation: \"digest\",\n            path,\n            content\n          }))\n        ).pipe(Effect.mapError(hostFailure))\n        for (const entry of [...response.entries].sort((a, b) => a.index - b.index)) {\n          const measured = yield* Effect.fromResult(entry.result).pipe(\n            Effect.catchReason(\"PlatformError\", \"NotFound\", () => Effect.succeed(undefined)),\n            Effect.mapError(hostFailure)\n          )\n          if (measured === undefined) values.push(undefined)\n          else if (measured.operation !== \"digest\") {\n            return yield* Effect.fail(hostFailure(new Error(\"host returned a non-digest batch result\")))\n          } else values.push({ ...measured, digest: measured.digest as ArtifactStore.Digest })\n        }\n      }\n      return values\n    }\n  )\n  /**\n   * One host call, never two. An `exists` probe ahead of the read asked\n   * exactly what the read itself answers — a path that is not there refuses\n   * with `NotFound` — and every declared read was therefore measured twice.\n   * On the confined host that is two CPython forks per path\n   * (`@smthrs/platform-node/AtomicFileSystem` spawns one interpreter per\n   * operation, ~130 ms each), so the probe doubled the cost of every\n   * `prepare`, every post-body change check, and every materialization.\n   */\n  const measure = (\n    path: string,\n    host: FileSystem.FileSystem = fs\n  ): Effect.Effect<string, UnsupportedBoundary, Crypto.Crypto> =>\n    readDigestFrom(host, path).pipe(\n      Effect.map((measured) => measured.digest),\n      Effect.catchReason(\"PlatformError\", \"NotFound\", () => Effect.succeed(absentDigest)),\n      Effect.mapError(hostFailure)\n    )\n  // Both expansions enumerate through `FileEnumeration`, never the host\n  // `glob`: host results are absolute under the kernel FileSystem and skip\n  // dotfiles under Node's matcher, so trusting them silently emptied every\n  // workspace-relative expansion and let a tree replay delete dotfiles the\n  // producer wrote.\n  const expandGlob = Effect.fn(\"StepBoundary.expandGlob\")(function*(glob: FileSet.Glob) {\n    return yield* FileEnumeration.expandGlob(fs, glob).pipe(Effect.mapError(hostFailure))\n  })\n  const treeEntries = Effect.fn(\"StepBoundary.treeEntries\")(function*(host: FileSystem.FileSystem, path: string) {\n    return yield* FileEnumeration.entriesUnder(host, path).pipe(Effect.mapError(hostFailure))\n  })\n  // Replay writes and deletes what evidence names, so the lexical check alone\n  // is not a boundary: a symlink planted on a lexically valid path would carry\n  // the mutation outside the workspace. Every replay mutation, its probes, and\n  // its prune walk go through a view pinned to the root, where each call is\n  // one descriptor-relative, no-follow request and a symlink anywhere on the\n  // path is refused rather than followed. `prepare` and `settle` only read,\n  // and keep the caller's filesystem.\n  const replayRoot = KernelFileSystem.confinedRoot(fs) ?? options.root ?? \".\"\n  const replayHost: Effect.Effect<FileSystem.FileSystem, UnsupportedBoundary> = KernelFileSystem.isConfinable(fs)\n    ? KernelFileSystem.confined(fs, replayRoot).pipe(\n      Effect.provideService(Path.Path, platformPath),\n      Effect.mapError(hostFailure)\n    )\n    : Effect.fail(\n      new UnsupportedBoundary({\n        code: \"unsupported_boundary\",\n        message:\n          \"cache replay needs a confined host filesystem; the host carries no descriptor-relative executor or isolation attestation\"\n      })\n    )\n  const capture = Effect.fn(\"StepBoundary.capture\")(\n    function*(path: string, inlineBudget: number, measured: BatchedDigest | undefined) {\n      yield* Effect.annotateCurrentSpan({ path })\n      // As in `measure`: the read reports absence itself, so the output is\n      // captured in one host call rather than an `exists` probe plus a read.\n      if (measured === undefined) {\n        return { output: { path, digest: null } satisfies MaterializedOutput, inlinedBytes: 0 }\n      }\n      const bytes = measured.bytes\n      if (bytes === undefined) return yield* Effect.fail(hostFailure(new Error(\"host omitted requested batch content\")))\n      const digest = measured.digest\n      // Inline only while both bounds hold (issue #122): the per-output bound\n      // and the settle-wide aggregate budget the caller threads through.\n      if (bytes.length <= maxInlineBytes && bytes.length <= inlineBudget) {\n        return {\n          output: {\n            path,\n            digest,\n            sizeBytes: bytes.length,\n            content: Encoding.encodeBase64(bytes)\n          } satisfies MaterializedOutput,\n          inlinedBytes: bytes.length\n        }\n      }\n      // Over the inline bound: the payload goes to the content-addressed\n      // artifact store and the persisted row carries only the reference. Every\n      // property that used to live here — atomic publication, verify-once\n      // dedupe, healing rewrite of a corrupt address — is now the store's, and\n      // is tested there (`@smthrs/artifacts`).\n      const stored = yield* artifacts.put(bytes).pipe(Effect.mapError(artifactFailure))\n      if (stored !== digest) {\n        return yield* Effect.fail(\n          new BoundaryCorruption({\n            code: \"boundary_corruption\",\n            path,\n            recordedDigest: `${stored}`,\n            measuredDigest: digest\n          })\n        )\n      }\n      return { output: { path, digest, sizeBytes: bytes.length } satisfies MaterializedOutput, inlinedBytes: 0 }\n    }\n  )\n  const materialize = Effect.fn(\"StepBoundary.materialize\")(function*(\n    host: FileSystem.FileSystem,\n    output: MaterializedOutput\n  ) {\n    yield* Effect.annotateCurrentSpan({ path: output.path })\n    // The filesystem is the cheapest source of truth for a warm workspace.\n    // Probe before decoding inline bytes or consulting the artifact store; a\n    // transient probe refusal merely forfeits the optimization and the\n    // ordinary materialization path retains its existing typed failures.\n    const current = yield* measure(output.path, host).pipe(\n      Effect.map((digest) => digest !== absentDigest && digest === output.digest),\n      Effect.catch(() => Effect.succeed(false))\n    )\n    if (current) return\n    let bytes: Uint8Array\n    if (output.content !== undefined) {\n      const decoded = Encoding.decodeBase64(output.content)\n      if (Result.isFailure(decoded)) {\n        // Inline content is cache-origin bytes: an undecodable payload is a\n        // tampered durable row, classified exactly like a digest mismatch so\n        // the caller routes it to the Inconsistency receiver instead of\n        // retrying it as a transient host refusal (issue #159).\n        return yield* Effect.fail(inlineCorruption(output.path, `${output.digest}`))\n      }\n      bytes = decoded.success\n      // Inline evidence is verified here because nothing else can: the bytes\n      // travel inside the row rather than at a content address. A referenced\n      // artifact is verified by the store on the way out, so the check below\n      // would be a second read+hash of the same bytes.\n      const measured = yield* Schema.decodeUnknownEffect(Sha256)(bytes).pipe(Effect.orDie)\n      if (measured !== output.digest) {\n        return yield* Effect.fail(\n          new BoundaryCorruption({\n            code: \"boundary_corruption\",\n            path: output.path,\n            recordedDigest: `${output.digest}`,\n            measuredDigest: measured\n          })\n        )\n      }\n    } else {\n      bytes = yield* artifacts.get(`${output.digest}`).pipe(\n        Effect.catchTags({\n          // A reference this host cannot resolve is not a host refusal: a\n          // shared artifact tier may still hold it, so the caller gets a\n          // typed, repairable failure and fetches before falling back to a\n          // real execution (issue #172).\n          \"@smthrs/artifacts/ArtifactMissing\": (missing) =>\n            Effect.fail(\n              new MissingArtifact({ code: \"missing_artifact\", path: output.path, digest: missing.digest })\n            ),\n          // Corruption is a distinct typed failure from a transient host\n          // error (issue #150): the caller routes it to the Inconsistency\n          // receiver instead of treating it as an ordinary retryable refusal.\n          \"@smthrs/artifacts/ArtifactCorruption\": (corrupt) =>\n            Effect.fail(\n              new BoundaryCorruption({\n                code: \"boundary_corruption\",\n                path: output.path,\n                recordedDigest: corrupt.recordedDigest,\n                measuredDigest: corrupt.measuredDigest\n              })\n            ),\n          \"@smthrs/artifacts/ArtifactStoreError\": (failure) => Effect.fail(artifactFailure(failure))\n        })\n      )\n    }\n    // The original body may have created the output's directory itself; a\n    // fresh workspace replaying the evidence has no such directory and\n    // `writeFile` does not create parents (issue #107).\n    const parent = parentDirectory(output.path)\n    if (parent !== undefined) {\n      yield* host.makeDirectory(parent, { recursive: true }).pipe(Effect.mapError(hostFailure))\n    }\n    yield* host.writeFile(output.path, bytes).pipe(Effect.mapError(hostFailure))\n  })\n  return make({\n    prepare: Effect.fn(\"StepBoundary.prepare\")(function*(descriptor) {\n      const boundary = FileBoundarySnapshot.make(descriptor)\n      yield* Effect.annotateCurrentSpan({\n        reads: boundary.readSet.length,\n        boundaryMode: boundary.boundaryMode\n      })\n      // The dirty check's evidence (issue #90): what the host actually\n      // measured for every declared read, never the declaration itself —\n      // defaulting the snapshot to the declaration made `readSetMatches`\n      // compare the declaration against itself and pass unconditionally\n      // (issue #104).\n      const readSnapshot: Array<FileInput> = []\n      const paths: Array<string> = []\n      for (const entry of boundary.readSet) {\n        if (FileSet.isGlob(entry)) {\n          paths.push(...yield* expandGlob(entry))\n        } else paths.push(entry.path)\n      }\n      const measured = yield* measurements(paths, false)\n      for (const [index, path] of paths.entries()) {\n        readSnapshot.push({ path, digest: measured[index]?.digest ?? absentDigest })\n      }\n      readSnapshot.sort((left, right) => compareText(left.path, right.path))\n      return Object.freeze({\n        descriptor: boundary,\n        readSnapshot: Object.freeze(readSnapshot.map((entry) => Object.freeze({ ...entry })))\n      })\n    }),\n    settle: Effect.fn(\"StepBoundary.settle\")(function*(prepared) {\n      yield* Effect.annotateCurrentSpan({\n        writes: prepared.descriptor.writeSet.length,\n        boundaryMode: prepared.descriptor.boundaryMode\n      })\n      // Undeclared-write detection is scoped to the declared read set: a\n      // declared read whose content moved during the body and is not also a\n      // declared write was mutated outside the contract. Whole-tree change\n      // detection needs the jj diff surface and stays a documented\n      // limitation of this layer rather than a silent pass — the read set\n      // is exactly the material cacheability rests on.\n      const removes = prepared.descriptor.removes ?? []\n      const declaredWrites = [...prepared.descriptor.writeSet, ...removes]\n      const declaredCovers = (path: string) =>\n        declaredWrites.some((entry) =>\n          typeof entry === \"string\"\n            ? entry === path\n            : entry._tag === \"TreeArtifact\"\n            ? path === entry.path || path.startsWith(`${entry.path}/`)\n            : FileSet.matchesGlob(entry, path)\n        )\n      const undeclared: Array<string> = []\n      const checkedReads = prepared.readSnapshot.filter((entry) => !declaredCovers(entry.path))\n      const currentReads = yield* measurements(checkedReads.map((entry) => entry.path), false)\n      for (const [index, entry] of checkedReads.entries()) {\n        if ((currentReads[index]?.digest ?? absentDigest) !== entry.digest) undeclared.push(entry.path)\n      }\n      const outputs: Array<MaterializedOutput> = []\n      // Declared removals are captured on the same path and under the same\n      // `digest: null` semantics they have always had — the difference is that\n      // here the absence was declared, so it is evidence rather than a defect.\n      const missing: Array<string> = []\n      const surviving: Array<string> = []\n      let inlinedBytes = 0\n      const outputPaths: Array<string> = []\n      const treeMembers: Array<{ readonly path: string; readonly files: ReadonlyArray<string> }> = []\n      for (const entry of prepared.descriptor.writeSet) {\n        if (typeof entry === \"string\") outputPaths.push(entry)\n        else if (entry._tag === \"Glob\") outputPaths.push(...yield* expandGlob(entry))\n        else {\n          const files = (yield* treeEntries(fs, entry.path)).files\n          outputPaths.push(...files)\n          treeMembers.push({ path: entry.path, files })\n        }\n      }\n      outputPaths.push(...removes)\n      const captured = new Map<string, MaterializedOutput>()\n      const sortedPaths = [...new Set(outputPaths)].sort(compareText)\n      // Digest-only preflight bounds content batches by bytes as well as path\n      // count. Both measurements share the guarded host's pinned root identity;\n      // a rewrite between them is a refusal, never mismatched cached content.\n      const sizes = batch === undefined ? undefined : yield* measurements(sortedPaths, false)\n      for (let offset = 0; offset < sortedPaths.length;) {\n        let end = offset\n        let responseBytes = 256\n        const size = batch?.maxSize ?? KernelFileSystem.fallbackConcurrency\n        while (end < sortedPaths.length && end - offset < size) {\n          const estimate = 4096 + new TextEncoder().encode(sortedPaths[end]).length * 6 +\n            Math.ceil((sizes?.[end]?.sizeBytes ?? 0) / 3) * 4\n          if (end > offset && batch !== undefined && responseBytes + estimate > batch.maxResponseBytes) break\n          responseBytes += estimate\n          end++\n        }\n        const group = sortedPaths.slice(offset, end)\n        const contents = yield* measurements(group, true)\n        for (const [index, path] of group.entries()) {\n          const measured = contents[index]\n          if (sizes !== undefined && measured?.digest !== sizes[offset + index]?.digest) {\n            return yield* Effect.fail(hostFailure(new Error(`output changed during measurement: ${path}`)))\n          }\n          const output = yield* capture(path, maxTotalInlineBytes - inlinedBytes, measured)\n          // `capture` reports the bytes it actually inlined (zero for a\n          // digest-only reference), so the aggregate budget never has to\n          // re-derive them from the row it just built.\n          inlinedBytes += output.inlinedBytes\n          outputs.push(output.output)\n          captured.set(path, output.output)\n          if (\n            output.output.digest === null &&\n            !removes.includes(path) &&\n            prepared.descriptor.writeSet.some((entry) => typeof entry === \"string\" && entry === path)\n          ) missing.push(path)\n          // The dual check: a removal promised the path absent, and it is still\n          // here — possibly rewritten. Settling it would cache the surviving\n          // bytes under a declaration that disclaimed them.\n          if (output.output.digest !== null && removes.includes(path)) surviving.push(path)\n        }\n        offset = end\n      }\n      // A tree member is already one of the captured outputs, so its identity\n      // is folded from the digest that capture measured rather than from a\n      // second read of the same bytes. `capture` spells an absent member\n      // `null` where `measure` spells it `absentDigest`; the identity keeps\n      // the `measure` spelling, so a tree recorded before this and one\n      // recorded after hash identically.\n      const trees: Array<{ readonly path: string; readonly identity: string }> = []\n      for (const tree of treeMembers) {\n        const pairs = tree.files.map((path) =>\n          [path.slice(tree.path.length + 1), captured.get(path)!.digest ?? absentDigest] as const\n        )\n        trees.push({\n          path: tree.path,\n          identity: yield* Schema.decodeUnknownEffect(DerivedKey)({ kind: \"tree-artifact\", files: pairs }).pipe(\n            Effect.orDie\n          )\n        })\n      }\n      // Through `DerivedKey` — the repo's one hashing chokepoint — so the identity is\n      // a digest of the RFC 8785 canonical form rather than of whatever\n      // `JSON.stringify` happened to emit for this shape.\n      const diffIdentity = yield* Schema.decodeUnknownEffect(DerivedKey)({\n        kind: \"diff-identity\",\n        outputs: outputs.map((output) => [output.path, output.digest]),\n        trees\n      }).pipe(Effect.orDie)\n      yield* Effect.annotateCurrentSpan({ diffIdentity })\n      if (prepared.descriptor.boundaryMode === \"hard\") {\n        if (undeclared.length > 0) {\n          return yield* Effect.fail(\n            new UndeclaredWrite({ code: \"undeclared_write\", paths: undeclared, diffIdentity })\n          )\n        }\n        // A declared output that was never produced is a defect, not evidence\n        // (Bazel's `checkOutputs`). Recording it would cache `digest: null`,\n        // which every later `replayOutputs` reads as \"delete this path\".\n        if (missing.length > 0) {\n          return yield* Effect.fail(\n            new MissingDeclaredOutput({ code: \"missing_declared_output\", paths: missing, diffIdentity })\n          )\n        }\n        if (surviving.length > 0) {\n          return yield* Effect.fail(\n            new SurvivingDeclaredRemoval({ code: \"surviving_declared_removal\", paths: surviving, diffIdentity })\n          )\n        }\n      }\n      return {\n        declaredOutputs: { outputs, ...(trees.length === 0 ? {} : { trees }) },\n        diffIdentity,\n        // This filesystem-only boundary cannot observe writes elsewhere in\n        // the tree. Omission is deliberate: ActionPersistence treats the\n        // result as run-local and will not publish it to the shared cache.\n        //\n        // An undeclared write is reported ahead of a missing output, and a\n        // missing output ahead of a surviving removal: each is the stronger\n        // claim about the same execution, and every variant bars the evidence\n        // from the shared cache identically.\n        ...(undeclared.length > 0\n          ? { deviation: { _tag: \"ExpectedSetDeviation\" as const, paths: undeclared, diffIdentity } }\n          : missing.length > 0\n          ? { deviation: { _tag: \"MissingDeclaredOutput\" as const, paths: missing, diffIdentity } }\n          : surviving.length > 0\n          ? { deviation: { _tag: \"SurvivingDeclaredRemoval\" as const, paths: surviving, diffIdentity } }\n          : {})\n      }\n    }),\n    replayOutputs: Effect.fn(\"StepBoundary.replayOutputs\")(function*(evidence) {\n      yield* Effect.annotateCurrentSpan({ diffIdentity: evidence.diffIdentity })\n      const decoded = Schema.decodeUnknownResult(MaterializedOutputs)(evidence.declaredOutputs)\n      if (decoded._tag === \"Failure\") {\n        // Evidence recorded by a different boundary implementation carries\n        // no materializable outputs; refusing is honest — the caller's\n        // dispatch path falls back to a real execution or fails visibly.\n        return yield* Effect.fail(\n          new UnsupportedBoundary({\n            code: \"unsupported_boundary\",\n            message: \"the recorded boundary evidence carries no materializable outputs\"\n          })\n        )\n      }\n      // Replay writes and DELETES whatever the evidence names, so a path is\n      // honored only in the coordinate system declarations are written in.\n      // Evidence can arrive from a foreign producer through cache sync; an\n      // absolute or upward spelling is an eraser aimed outside the workspace,\n      // and refusing it here is what keeps that a refusal instead of a wipe.\n      const foreign = [\n        ...(decoded.success.trees ?? []).map((tree) => tree.path),\n        ...decoded.success.outputs.map((output) => output.path)\n      ].filter((path) => !FileSet.workspaceRelative(path))\n      if (foreign.length > 0) {\n        return yield* Effect.fail(\n          new UnsupportedBoundary({\n            code: \"unsupported_boundary\",\n            message: `the recorded boundary evidence names paths outside the workspace: ${foreign.join(\", \")}`\n          })\n        )\n      }\n      // Before any mutation: a host that cannot be confined refuses the whole\n      // replay, and the caller falls back to a real execution.\n      const host = yield* replayHost\n      const emptyDirectoryCandidates = new Set<string>()\n      for (const tree of decoded.success.trees ?? []) {\n        const prefix = `${tree.path}/`.replace(/\\/{2,}$/g, \"/\")\n        const recorded = new Set(\n          decoded.success.outputs\n            .map((output) => output.path)\n            .filter((path) => path.startsWith(prefix))\n        )\n        const entries = yield* treeEntries(host, tree.path)\n        for (const path of entries.files) {\n          if (!recorded.has(path)) yield* host.remove(path).pipe(Effect.mapError(hostFailure))\n        }\n        for (const directory of entries.directories) emptyDirectoryCandidates.add(directory)\n      }\n      for (const output of decoded.success.outputs) {\n        if (output.digest === null) {\n          // `force` IS the probe: the evidence says this path must not exist,\n          // and a removal that finds it already gone has done its job. The\n          // `exists` call that used to precede it was a second host call — a\n          // second process on the confined host — for the same answer.\n          yield* host.remove(output.path, { force: true }).pipe(Effect.mapError(hostFailure))\n        } else {\n          yield* materialize(host, output)\n        }\n      }\n      // Remove only directories proven empty after pruning and\n      // materialization. Deepest-first preserves every directory that still\n      // contains a recorded child while clearing stale empty scaffolding.\n      const directories = [...emptyDirectoryCandidates].sort((left, right) =>\n        right.length - left.length || compareText(left, right)\n      )\n      for (const directory of directories) {\n        const entries = yield* host.readDirectory(directory).pipe(Effect.mapError(hostFailure))\n        if (entries.length === 0) yield* host.remove(directory).pipe(Effect.mapError(hostFailure))\n      }\n    })\n  })\n}\n\n/**\n * Provides the filesystem-backed production boundary: `prepare` measures the\n * declared read set for real, `settle` detects reads mutated outside the\n * declared write set and captures the write set's post-state, and\n * `replayOutputs` re-materializes those outputs on cache-hit replay.\n *\n * Host access arrives through Effect's `FileSystem` tag, which the capability\n * kernel decorates in place — the same seam every host implementation (node,\n * bun, browser, sandbox) already provides. Blob storage arrives through\n * `@smthrs/artifacts`, so the same boundary runs over a purely local store or\n * over a local-plus-shared composition without knowing which it got.\n *\n * Replay confines its own mutations rather than trusting the composition:\n * they run through `@smthrs/kernel/FileSystem`'s `confined` view, rooted at\n * the kernel `Workspace` when one is in context. A symlink on a replayed path\n * (a parent, the final component, or a member of a replayed tree) and a host\n * with no descriptor-relative executor or isolation attestation both refuse\n * with {@link UnsupportedBoundary}, which the caller journals as\n * `replay_failed` before executing the step for real.\n *\n * @since 0.1.0\n * @category layers\n */\nexport const layer: Layer.Layer<\n  Service,\n  never,\n  FileSystem.FileSystem | Path.Path | ArtifactStore.ArtifactStore\n> = Layer.effect(\n  StepBoundary,\n  Effect.gen(function*() {\n    const fs = yield* FileSystem.FileSystem\n    const platformPath = yield* Path.Path\n    const artifacts = yield* ArtifactStore.ArtifactStore\n    const workspace = yield* Effect.serviceOption(KernelWorkspace)\n    return makeFileSystem(fs, platformPath, artifacts, workspace._tag === \"Some\" ? { root: workspace.value.root } : {})\n  })\n)\n\n/**\n * What the deterministic test boundary should pretend the host observed.\n *\n * Every field is a fixture, not a classification rule: a test supplies settlement\n * evidence or failure, the read snapshot, and whether the host claims\n * to support the boundary at all — then asserts on the resulting evidence or\n * refusal. Defaults describe a well-behaved, fully-supported host.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface TestOptions {\n  /** A settlement failure supplied verbatim by an integration fixture. */\n  readonly failure?: UndeclaredWrite | MissingDeclaredOutput | SurvivingDeclaredRemoval | undefined\n  /** Settlement evidence supplied verbatim; classification belongs to the real layer. */\n  readonly deviation?: BoundaryDeviation | undefined\n  /**\n   * What `prepare` reports as measured for the declared read set. Defaults\n   * to the declaration itself; a test supplies a different snapshot to stand\n   * for a file whose content moved out from under a stale declaration\n   * (issue #90).\n   */\n  readonly readSnapshot?: ReadonlyArray<FileInput> | undefined\n  /** The opaque replay payload recorded in the evidence. */\n  readonly declaredOutputs?: unknown\n  /** The post-state identity the evidence names. Defaults to a fixed string. */\n  readonly diffIdentity?: string | undefined\n  /** When false, every call fails with {@link UnsupportedBoundary}. Defaults to true. */\n  readonly supported?: boolean | undefined\n  /** Whether the fixture attests a whole-tree observation. Defaults to true. */\n  readonly wholeTreeWriteDetection?: boolean | undefined\n  /** Whether the fixture models an isolated read surface. Defaults to true. */\n  readonly hermeticReadDetection?: boolean | undefined\n  /** Observes each `replayOutputs` call, so a test can assert replay happened. */\n  readonly onReplay?: (evidence: BoundaryEvidence) => void\n}\n\nconst unsupported = (): UnsupportedBoundary =>\n  new UnsupportedBoundary({\n    code: \"unsupported_boundary\",\n    message: \"the host cannot enforce the declared step boundary\"\n  })\n\n/**\n * Deterministic in-memory boundary suitable only for tests. Production\n * wiring uses {@link layer}, the filesystem-backed implementation.\n *\n * Whole-tree change detection is supplied by sandboxed settlement, not by any\n * boundary layer: an isolated execution's transaction IS the tree, so\n * `ActionPersistence` compares its diff against the declared sets and sets\n * `wholeTreeWritesVerified` structurally (the retired piece-6 limitation).\n * {@link layer} still detects mutations within the declared read set only,\n * which is why unsandboxed evidence stays run-local.\n *\n * @since 0.1.0\n * @category layers\n */\nexport const layerTest = (options: TestOptions = {}): Layer.Layer<Service> => {\n  const diffIdentity = options.diffIdentity ?? \"test-diff\"\n  const service = make({\n    prepare: Effect.fn(\"StepBoundary.prepare\")(function*(descriptor) {\n      if (options.supported === false) return yield* Effect.fail(unsupported())\n      return {\n        descriptor,\n        readSnapshot: options.readSnapshot ?? exactReads(descriptor)\n      }\n    }),\n    settle: Effect.fn(\"StepBoundary.settle\")(function*(prepared) {\n      if (options.supported === false) return yield* Effect.fail(unsupported())\n      if (options.failure !== undefined) return yield* Effect.fail(options.failure)\n      return {\n        declaredOutputs: options.declaredOutputs ?? { paths: prepared.descriptor.writeSet },\n        diffIdentity,\n        ...(options.wholeTreeWriteDetection === false ? {} : { wholeTreeWritesVerified: true as const }),\n        ...(options.hermeticReadDetection === false ? {} : { hermeticReadsVerified: true as const }),\n        ...(options.deviation === undefined ? {} : { deviation: options.deviation })\n      }\n    }),\n    replayOutputs: Effect.fn(\"StepBoundary.replayOutputs\")(function*(evidence) {\n      if (options.supported === false) return yield* Effect.fail(unsupported())\n      yield* Effect.sync(() => {\n        options.onReplay?.(evidence)\n      })\n    })\n  })\n  return Layer.succeed(StepBoundary, service)\n}\n"]}
+{"version":3,"file":"StepBoundary.js","sourceRoot":"","sources":["../../src/StepBoundary.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,aAAa,MAAM,iCAAiC,CAAA;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAA;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAA;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAA;AAClD,OAAO,KAAK,gBAAgB,MAAM,2BAA2B,CAAA;AAC7D,OAAO,EAAE,SAAS,IAAI,eAAe,EAAE,MAAM,0BAA0B,CAAA;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,KAAK,OAAO,MAAM,sBAAsB,CAAA;AAC/C,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AAEzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,wBAAwB,CAAA;AAChD,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAC/C,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,IAAI,MAAM,aAAa,CAAA;AACnC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,oBAAoB,MAAM,oCAAoC,CAAA;AAC1E,OAAO,KAAK,eAAe,MAAM,+BAA+B,CAAA;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAA;AAEpD;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5C,UAAU,EAAE,YAAY;IACxB;;;;;OAKG;IACH,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC;CACtC,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,UAAwB,EAA4B,EAAE,CAC/E,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAsB,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;AAElF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,QAA0B,EAAW,EAAE;IACpE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAA;IACpD,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAChD,IAAI,OAAO,KAAK,SAAS;YAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;;YAClF,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;IACnC,CAAC;IACD,OAAO,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CACjD,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;QACtB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,IAAI,CAC1D,CAAA;AACH,CAAC,CAAA;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,MAAM,CAAC,YAAY,CAAC,sBAAsB,EAAE;IAC9E,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CAAC,CAAA;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,MAAM,CAAC,YAAY,CAAC,uBAAuB,EAAE;IACjF,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CAAC,CAAA;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,MAAM,CAAC,YAAY,CAAC,0BAA0B,EAAE;IACvF,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,oBAAoB,EAAE,sBAAsB,EAAE,yBAAyB,CAAC,CAAC,CAAA;AAUxH;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5C,eAAe,EAAE,MAAM,CAAC,OAAO;IAC/B,YAAY,EAAE,MAAM,CAAC,cAAc;IACnC;;;;;OAKG;IACH,uBAAuB,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9D,8DAA8D;IAC9D,qBAAqB,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5D,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAC;CAC9C,CAAC,CAAA;AAUF;;;;;;;;;;GAUG;AACH,MAAM,OAAO,eAAgB,SAAQ,MAAM,CAAC,WAAW,EAAmB,CACxE,sCAAsC,EACtC;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC;IACxC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CACF;CAAG;AAEJ;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,qBAAsB,SAAQ,MAAM,CAAC,WAAW,EAAyB,CACpF,4CAA4C,EAC5C;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,yBAAyB,CAAC;IAC/C,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CACF;CAAG;AAEJ;;;;;;;;;;GAUG;AACH,MAAM,OAAO,wBAAyB,SAAQ,MAAM,CAAC,WAAW,EAA4B,CAC1F,+CAA+C,EAC/C;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,4BAA4B,CAAC;IAClD,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC,cAAc;CACpC,CACF;CAAG;AAEJ;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,mBAAoB,SAAQ,MAAM,CAAC,WAAW,EAAuB,CAChF,0CAA0C,EAC1C;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,sBAAsB,CAAC;IAC5C,OAAO,EAAE,MAAM,CAAC,MAAM;IACtB;;;;OAIG;IACH,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;CACxC,CACF;CAAG;AAEJ;;;;;;;;;GASG;AACH,MAAM,OAAO,kBAAmB,SAAQ,MAAM,CAAC,WAAW,EAAsB,CAC9E,yCAAyC,EACzC;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC;IAC3C,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,cAAc,EAAE,MAAM,CAAC,MAAM;IAC7B,cAAc,EAAE,MAAM,CAAC,MAAM;CAC9B,CACF;CAAG;AAEJ;;;;;;;;;;GAUG;AACH,MAAM,OAAO,eAAgB,SAAQ,MAAM,CAAC,WAAW,EAAmB,CACxE,sCAAsC,EACtC;IACE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC;IACxC,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,MAAM,EAAE,MAAM,CAAC,MAAM;CACtB,CACF;CAAG;AA8BJ;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,YAAY,GAAsC,OAAO,CAAC,OAAO,CAC5E,mCAAmC,CACpC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,OAAgB,EAAW,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,OAAO,CAAC,CAAA;AAE3E;;;;;GAKG;AACH,MAAM,YAAY,GAAG,QAAQ,CAAA;AAE7B;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,sBAAsB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC;IAC3C,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACzC,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;CACxC,CAAC,CAAA;AAEF,MAAM,mBAAmB,GAAG,MAAM,CAAC,MAAM,CAAC;IACxC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,sBAAsB,CAAC;IAC7C,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;QAChD,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,QAAQ,EAAE,MAAM,CAAC,MAAM;KACxB,CAAC,CAAC,CAAC;CACL,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,IAAY,EAAsB,EAAE;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IACnC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AACtD,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAAC,KAAc,EAAuB,EAAE,CAC1D,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,yDAAyD;IAClE,KAAK;CACN,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,KAAuC,EAAuB,EAAE,CACvF,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,yDAAyD,KAAK,CAAC,OAAO,EAAE;IACjF,KAAK;CACN,CAAC,CAAA;AAEJ;;;;;;GAMG;AACH,MAAM,gBAAgB,GAAG,CAAC,IAAY,EAAE,cAAsB,EAAsB,EAAE,CACpF,IAAI,kBAAkB,CAAC;IACrB,IAAI,EAAE,qBAAqB;IAC3B,IAAI;IACJ,cAAc;IACd,cAAc,EAAE,gBAAgB;CACjC,CAAC,CAAA;AAyCJ,MAAM,qBAAqB,GAAG,IAAI,GAAG,IAAI,CAAA;AACzC,MAAM,0BAA0B,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAA;AAclD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,QAA0B,EAAuC,EAAE;IACnG,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAA;IACzF,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,CAAA;IACzC,MAAM,OAAO,GAAgC,EAAE,CAAA;IAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;YAAE,SAAQ;QACpE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,EAAyB,EACzB,YAAuB,EACvB,SAAgC,EAChC,UAA6B,EAAE,EACtB,EAAE;IACX,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,qBAAqB,CAAA;IACtE,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,0BAA0B,CAAA;IACrF,2EAA2E;IAC3E,0DAA0D;IAC1D,MAAM,cAAc,GAAG,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,QAAQ,CAAC,EAAC,IAA2B,EAAE,IAAY;QAC7G,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAClF,OAAO,EAAE,MAAM,EAAE,KAAK,EAA2B,CAAA;IACnD,CAAC,CAAC,CAAA;IACF,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;IAC7D,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACxC,MAAM,YAAY,GAAG,MAAM,CAAC,EAAE,CAAC,2BAA2B,CAAC,CACzD,QAAQ,CAAC,EAAC,KAA4B,EAAE,OAAgB;QACtD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC3C,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CACnB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAiB,EAAE,CAAC,CAAC;gBACpC,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;gBAC7B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3C,CAAC,CAAC,EACH,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAChF,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B,EAAE,EAAE,WAAW,EAAE,gBAAgB,CAAC,mBAAmB,EAAE,CAAC,CAAA;QAC7D,CAAC;QACD,MAAM,MAAM,GAAqC,EAAE,CAAA;QACnD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACpE,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CACnC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBACzD,SAAS,EAAE,QAAQ;gBACnB,IAAI;gBACJ,OAAO;aACR,CAAC,CAAC,CACJ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;YACpC,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5E,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAC1D,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAChF,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B,CAAA;gBACD,IAAI,QAAQ,KAAK,SAAS;oBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;qBAC7C,IAAI,QAAQ,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;oBACzC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,CAAC,CAAA;gBAC9F,CAAC;;oBAAM,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,MAA8B,EAAE,CAAC,CAAA;YACtF,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC,CACF,CAAA;IACD;;;;;;;;OAQG;IACH,MAAM,OAAO,GAAG,CACd,IAAY,EACZ,OAA8B,EAAE,EAC2B,EAAE,CAC7D,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EACzC,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,EACnF,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B,CAAA;IACH,sEAAsE;IACtE,yEAAyE;IACzE,yEAAyE;IACzE,yEAAyE;IACzE,kBAAkB;IAClB,MAAM,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,QAAQ,CAAC,EAAC,IAAkB;QAClF,OAAO,KAAK,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;IACvF,CAAC,CAAC,CAAA;IACF,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,0BAA0B,CAAC,CAAC,QAAQ,CAAC,EAAC,IAA2B,EAAE,IAAY;QAC3G,OAAO,KAAK,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;IAC3F,CAAC,CAAC,CAAA;IACF,4EAA4E;IAC5E,6EAA6E;IAC7E,6EAA6E;IAC7E,0EAA0E;IAC1E,2EAA2E;IAC3E,0EAA0E;IAC1E,oCAAoC;IACpC,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,IAAI,IAAI,GAAG,CAAA;IAC3E,MAAM,UAAU,GAA8D,gBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC;QAC7G,CAAC,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,IAAI,CAC9C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,EAC9C,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC7B;QACD,CAAC,CAAC,MAAM,CAAC,IAAI,CACX,IAAI,mBAAmB,CAAC;YACtB,IAAI,EAAE,sBAAsB;YAC5B,OAAO,EACL,0HAA0H;SAC7H,CAAC,CACH,CAAA;IACH,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAC/C,QAAQ,CAAC,EAAC,IAAY,EAAE,YAAoB,EAAE,QAAmC;QAC/E,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;QAC3C,qEAAqE;QACrE,uEAAuE;QACvE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAA+B,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;QACzF,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;QAC5B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC,CAAC,CAAA;QAClH,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAA;QAC9B,wEAAwE;QACxE,mEAAmE;QACnE,IAAI,KAAK,CAAC,MAAM,IAAI,cAAc,IAAI,KAAK,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;YACnE,OAAO;gBACL,MAAM,EAAE;oBACN,IAAI;oBACJ,MAAM;oBACN,SAAS,EAAE,KAAK,CAAC,MAAM;oBACvB,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;iBACD;gBAC9B,YAAY,EAAE,KAAK,CAAC,MAAM;aAC3B,CAAA;QACH,CAAC;QACD,mEAAmE;QACnE,yEAAyE;QACzE,oEAAoE;QACpE,yEAAyE;QACzE,yCAAyC;QACzC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAA;QACjF,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,kBAAkB,CAAC;gBACrB,IAAI,EAAE,qBAAqB;gBAC3B,IAAI;gBACJ,cAAc,EAAE,GAAG,MAAM,EAAE;gBAC3B,cAAc,EAAE,MAAM;aACvB,CAAC,CACH,CAAA;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAA+B,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IAC5G,CAAC,CACF,CAAA;IACD,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,0BAA0B,CAAC,CAAC,QAAQ,CAAC,EACjE,IAA2B,EAC3B,MAA0B;QAE1B,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAA;QACxD,uEAAuE;QACvE,yEAAyE;QACzE,mEAAmE;QACnE,qEAAqE;QACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CACpD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,YAAY,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,EAC3E,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAC1C,CAAA;QACD,IAAI,OAAO;YAAE,OAAM;QACnB,IAAI,KAAiB,CAAA;QACrB,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;YAC7C,IAAI,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9B,oEAAoE;gBACpE,qEAAqE;gBACrE,gEAAgE;gBAChE,wDAAwD;gBACxD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;YAC9E,CAAC;YACD,KAAK,GAAG,OAAO,CAAC,OAAO,CAAA;YACvB,uEAAuE;YACvE,uEAAuE;YACvE,uEAAuE;YACvE,iDAAiD;YACjD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACpF,IAAI,QAAQ,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC/B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,kBAAkB,CAAC;oBACrB,IAAI,EAAE,qBAAqB;oBAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,cAAc,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE;oBAClC,cAAc,EAAE,QAAQ;iBACzB,CAAC,CACH,CAAA;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACnD,MAAM,CAAC,SAAS,CAAC;gBACf,gEAAgE;gBAChE,+DAA+D;gBAC/D,iEAAiE;gBACjE,+BAA+B;gBAC/B,mCAAmC,EAAE,CAAC,OAAO,EAAE,EAAE,CAC/C,MAAM,CAAC,IAAI,CACT,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAC7F;gBACH,+DAA+D;gBAC/D,gEAAgE;gBAChE,oEAAoE;gBACpE,sCAAsC,EAAE,CAAC,OAAO,EAAE,EAAE,CAClD,MAAM,CAAC,IAAI,CACT,IAAI,kBAAkB,CAAC;oBACrB,IAAI,EAAE,qBAAqB;oBAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,cAAc,EAAE,OAAO,CAAC,cAAc;oBACtC,cAAc,EAAE,OAAO,CAAC,cAAc;iBACvC,CAAC,CACH;gBACH,sCAAsC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;aAC3F,CAAC,CACH,CAAA;QACH,CAAC;QACD,sEAAsE;QACtE,mEAAmE;QACnE,oDAAoD;QACpD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC3C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;QAC3F,CAAC;QACD,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;IAC9E,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,CAAC;QACV,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,QAAQ,CAAC,EAAC,UAAU;YAC7D,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YACtD,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC;gBAChC,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,MAAM;gBAC9B,YAAY,EAAE,QAAQ,CAAC,YAAY;aACpC,CAAC,CAAA;YACF,iEAAiE;YACjE,mEAAmE;YACnE,mEAAmE;YACnE,kEAAkE;YAClE,gBAAgB;YAChB,MAAM,YAAY,GAAqB,EAAE,CAAA;YACzC,MAAM,KAAK,GAAkB,EAAE,CAAA;YAC/B,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACrC,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAA;gBACzC,CAAC;;oBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAC/B,CAAC;YACD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YAClD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5C,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,YAAY,EAAE,CAAC,CAAA;YAC9E,CAAC;YACD,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;YACtE,OAAO,MAAM,CAAC,MAAM,CAAC;gBACnB,UAAU,EAAE,QAAQ;gBACpB,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;aACtF,CAAC,CAAA;QACJ,CAAC,CAAC;QACF,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACzD,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC;gBAChC,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM;gBAC3C,YAAY,EAAE,QAAQ,CAAC,UAAU,CAAC,YAAY;aAC/C,CAAC,CAAA;YACF,mEAAmE;YACnE,sEAAsE;YACtE,qEAAqE;YACrE,6DAA6D;YAC7D,oEAAoE;YACpE,iDAAiD;YACjD,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,IAAI,EAAE,CAAA;YACjD,MAAM,cAAc,GAAG,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAA;YACpE,MAAM,cAAc,GAAG,CAAC,IAAY,EAAE,EAAE,CACtC,cAAc,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAC5B,OAAO,KAAK,KAAK,QAAQ;gBACvB,CAAC,CAAC,KAAK,KAAK,IAAI;gBAChB,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,cAAc;oBAC/B,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC;oBAC1D,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CACrC,CAAA;YACH,MAAM,UAAU,GAAkB,EAAE,CAAA;YACpC,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;YACzF,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAA;YACxF,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,KAAK,CAAC,MAAM;oBAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACjG,CAAC;YACD,MAAM,OAAO,GAA8B,EAAE,CAAA;YAC7C,qEAAqE;YACrE,yEAAyE;YACzE,yEAAyE;YACzE,MAAM,OAAO,GAAkB,EAAE,CAAA;YACjC,MAAM,SAAS,GAAkB,EAAE,CAAA;YACnC,IAAI,YAAY,GAAG,CAAC,CAAA;YACpB,MAAM,WAAW,GAAkB,EAAE,CAAA;YACrC,MAAM,WAAW,GAA4E,EAAE,CAAA;YAC/F,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACjD,IAAI,OAAO,KAAK,KAAK,QAAQ;oBAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;qBACjD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;oBAAE,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAA;qBACxE,CAAC;oBACJ,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAA;oBACxD,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;oBAC1B,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;gBAC/C,CAAC;YACH,CAAC;YACD,WAAW,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAA;YAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAA;YACtD,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;YAC/D,wEAAwE;YACxE,0EAA0E;YAC1E,wEAAwE;YACxE,MAAM,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;YACvF,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC;gBAClD,IAAI,GAAG,GAAG,MAAM,CAAA;gBAChB,IAAI,aAAa,GAAG,GAAG,CAAA;gBACvB,MAAM,IAAI,GAAG,KAAK,EAAE,OAAO,IAAI,gBAAgB,CAAC,mBAAmB,CAAA;gBACnE,OAAO,GAAG,GAAG,WAAW,CAAC,MAAM,IAAI,GAAG,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;oBACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC;wBAC3E,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;oBACnD,IAAI,GAAG,GAAG,MAAM,IAAI,KAAK,KAAK,SAAS,IAAI,aAAa,GAAG,QAAQ,GAAG,KAAK,CAAC,gBAAgB;wBAAE,MAAK;oBACnG,aAAa,IAAI,QAAQ,CAAA;oBACzB,GAAG,EAAE,CAAA;gBACP,CAAC;gBACD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;gBAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBACjD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;oBAChC,IAAI,KAAK,KAAK,SAAS,IAAI,QAAQ,EAAE,MAAM,KAAK,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;wBAC9E,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,sCAAsC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;oBACjG,CAAC;oBACD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,mBAAmB,GAAG,YAAY,EAAE,QAAQ,CAAC,CAAA;oBACjF,8DAA8D;oBAC9D,+DAA+D;oBAC/D,6CAA6C;oBAC7C,YAAY,IAAI,MAAM,CAAC,YAAY,CAAA;oBACnC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;oBAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;oBACjC,IACE,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,IAAI;wBAC7B,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;wBACvB,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC;wBACzF,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACpB,sEAAsE;oBACtE,mEAAmE;oBACnE,kDAAkD;oBAClD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnF,CAAC;gBACD,MAAM,GAAG,GAAG,CAAA;YACd,CAAC;YACD,wEAAwE;YACxE,qEAAqE;YACrE,mEAAmE;YACnE,sEAAsE;YACtE,iEAAiE;YACjE,mCAAmC;YACnC,MAAM,KAAK,GAAgE,EAAE,CAAA;YAC7E,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACpC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,MAAM,IAAI,YAAY,CAAU,CACxF,CAAA;gBACD,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CACnG,MAAM,CAAC,KAAK,CACb;iBACF,CAAC,CAAA;YACJ,CAAC;YACD,gFAAgF;YAChF,kEAAkE;YAClE,oDAAoD;YACpD,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,EAAE,eAAe;gBACrB,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC9D,KAAK;aACN,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACrB,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,YAAY,EAAE,CAAC,CAAA;YACnD,IAAI,QAAQ,CAAC,UAAU,CAAC,YAAY,KAAK,MAAM,EAAE,CAAC;gBAChD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CACnF,CAAA;gBACH,CAAC;gBACD,sEAAsE;gBACtE,qEAAqE;gBACrE,iEAAiE;gBACjE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,qBAAqB,CAAC,EAAE,IAAI,EAAE,yBAAyB,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAC7F,CAAA;gBACH,CAAC;gBACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,wBAAwB,CAAC,EAAE,IAAI,EAAE,4BAA4B,EAAE,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC,CACrG,CAAA;gBACH,CAAC;YACH,CAAC;YACD,OAAO;gBACL,eAAe,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;gBACtE,YAAY;gBACZ,mEAAmE;gBACnE,iEAAiE;gBACjE,mEAAmE;gBACnE,EAAE;gBACF,mEAAmE;gBACnE,oEAAoE;gBACpE,sEAAsE;gBACtE,qCAAqC;gBACrC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;oBACvB,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,sBAA+B,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,EAAE;oBAC3F,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;wBACpB,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,uBAAgC,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE;wBACzF,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;4BACtB,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,0BAAmC,EAAE,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE;4BAC9F,CAAC,CAAC,EAAE,CAAC;aACR,CAAA;QACH,CAAC,CAAC;QACF,aAAa,EAAE,MAAM,CAAC,EAAE,CAAC,4BAA4B,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACvE,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAA;YAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAA;YACzF,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC/B,mEAAmE;gBACnE,+DAA+D;gBAC/D,iEAAiE;gBACjE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,mBAAmB,CAAC;oBACtB,IAAI,EAAE,sBAAsB;oBAC5B,OAAO,EAAE,kEAAkE;iBAC5E,CAAC,CACH,CAAA;YACH,CAAC;YACD,sEAAsE;YACtE,qEAAqE;YACrE,qEAAqE;YACrE,wEAAwE;YACxE,uEAAuE;YACvE,MAAM,OAAO,GAAG;gBACd,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;gBACzD,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;aACxD,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAA;YACpD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,mBAAmB,CAAC;oBACtB,IAAI,EAAE,sBAAsB;oBAC5B,OAAO,EAAE,qEAAqE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBACnG,CAAC,CACH,CAAA;YACH,CAAC;YACD,wEAAwE;YACxE,yDAAyD;YACzD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,UAAU,CAAA;YAC9B,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAU,CAAA;YAClD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;gBAC/C,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;gBACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,OAAO,CAAC,OAAO,CAAC,OAAO;qBACpB,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;qBAC5B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAC7C,CAAA;gBACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;oBACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;gBACtF,CAAC;gBACD,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,WAAW;oBAAE,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YACtF,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;oBAC3B,oEAAoE;oBACpE,iEAAiE;oBACjE,mEAAmE;oBACnE,6DAA6D;oBAC7D,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;gBACrF,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;gBAClC,CAAC;YACH,CAAC;YACD,yDAAyD;YACzD,sEAAsE;YACtE,oEAAoE;YACpE,MAAM,WAAW,GAAG,CAAC,GAAG,wBAAwB,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACrE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CACvD,CAAA;YACD,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;gBACvF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;YAC5F,CAAC;QACH,CAAC,CAAC;KACH,CAAC,CAAA;AACJ,CAAC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,MAAM,KAAK,GAId,KAAK,CAAC,MAAM,CACd,YAAY,EACZ,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IACvC,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IACrC,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,aAAa,CAAC,aAAa,CAAA;IACpD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;IAC9D,OAAO,cAAc,CAAC,EAAE,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AACrH,CAAC,CAAC,CACH,CAAA;AAuCD,MAAM,WAAW,GAAG,GAAwB,EAAE,CAC5C,IAAI,mBAAmB,CAAC;IACtB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,oDAAoD;CAC9D,CAAC,CAAA;AAEJ;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,UAAuB,EAAE,EAAwB,EAAE;IAC3E,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,WAAW,CAAA;IACxD,MAAM,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,QAAQ,CAAC,EAAC,UAAU;YAC7D,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAA;YACzE,OAAO;gBACL,UAAU;gBACV,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,UAAU,CAAC,UAAU,CAAC;aAC7D,CAAA;QACH,CAAC,CAAC;QACF,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACzD,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAA;YACzE,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YAC7E,OAAO;gBACL,eAAe,EAAE,OAAO,CAAC,eAAe,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE;gBACnF,YAAY;gBACZ,GAAG,CAAC,OAAO,CAAC,uBAAuB,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,uBAAuB,EAAE,IAAa,EAAE,CAAC;gBAChG,GAAG,CAAC,OAAO,CAAC,qBAAqB,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,EAAE,IAAa,EAAE,CAAC;gBAC5F,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;aAC7E,CAAA;QACH,CAAC,CAAC;QACF,aAAa,EAAE,MAAM,CAAC,EAAE,CAAC,4BAA4B,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAQ;YACvE,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAA;YACzE,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;gBACtB,OAAO,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAA;YAC9B,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC;KACH,CAAC,CAAA;IACF,OAAO,KAAK,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;AAC7C,CAAC,CAAA","sourcesContent":["/**\n * Hermetic step boundary contracts, the filesystem-backed production\n * implementation, and the deterministic test implementation.\n *\n * @since 0.1.0\n */\n\nimport * as ArtifactStore from \"@smthrs/artifacts/ArtifactStore\"\nimport { Sha256 } from \"@smthrs/crypto\"\nimport { FileBoundary } from \"@smthrs/flow/FileBoundary\"\nimport { FileInput } from \"@smthrs/flow/FileInput\"\nimport * as KernelFileSystem from \"@smthrs/kernel/FileSystem\"\nimport { Workspace as KernelWorkspace } from \"@smthrs/kernel/Workspace\"\nimport { DerivedKey } from \"@smthrs/keys\"\nimport * as FileSet from \"@smthrs/plan/FileSet\"\nimport * as Context from \"effect/Context\"\nimport type * as Crypto from \"effect/Crypto\"\nimport * as Effect from \"effect/Effect\"\nimport * as Base64 from \"effect/encoding/Base64\"\nimport * as FileSystem from \"effect/FileSystem\"\nimport * as Layer from \"effect/Layer\"\nimport * as Path from \"effect/Path\"\nimport * as Result from \"effect/Result\"\nimport * as Schema from \"effect/Schema\"\nimport * as FileBoundarySnapshot from \"./internal/FileBoundarySnapshot.ts\"\nimport * as FileEnumeration from \"./internal/FileEnumeration.ts\"\nimport { compareText } from \"./internal/Ordering.ts\"\n\n/**\n * A file boundary that has been measured but not yet run: the caller's\n * declaration, paired with what the host actually found on disk for it.\n *\n * `prepare` produces one of these before a step executes and `settle` consumes\n * it afterwards, which is what lets the boundary say whether the world moved\n * underneath the declaration. Check it with {@link readSetMatches}.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const PreparedBoundary = Schema.Struct({\n  descriptor: FileBoundary,\n  /**\n   * What the host actually measured for the declared read set at prepare\n   * time. The declared digests are caller metadata folded into the step key;\n   * this is the evidence that they still describe reality, and a sealed\n   * cache hit is refused when the two disagree (issue #90).\n   */\n  readSnapshot: Schema.Array(FileInput)\n})\n\n/**\n * The value form of {@link PreparedBoundary}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type PreparedBoundary = typeof PreparedBoundary.Type\n\n/**\n * Exact read inputs from a boundary after ignoring declarations that still need expansion.\n *\n * @category accessors\n * @since 0.1.0\n */\nexport const exactReads = (descriptor: FileBoundary): ReadonlyArray<FileInput> =>\n  descriptor.readSet.filter((entry): entry is FileInput => !FileSet.isGlob(entry))\n\n/**\n * Whether every declared read still matches what the host measured.\n *\n * Reads the host reports but the declaration never claimed are ignored: the\n * declaration is the dependency edge set, and an incidental extra read is not\n * one of its edges. A declared path missing from the measurement counts as a\n * mismatch — its value is unknown, so reuse cannot be justified.\n *\n * @since 0.1.0\n * @category predicates\n */\nexport const readSetMatches = (prepared: PreparedBoundary): boolean => {\n  const digestsByPath = new Map<string, Set<string>>()\n  for (const measured of prepared.readSnapshot) {\n    const digests = digestsByPath.get(measured.path)\n    if (digests === undefined) digestsByPath.set(measured.path, new Set([measured.digest]))\n    else digests.add(measured.digest)\n  }\n  return prepared.descriptor.readSet.every((entry) =>\n    !FileSet.isGlob(entry) &&\n    digestsByPath.get(entry.path)?.has(entry.digest) === true\n  )\n}\n\n/**\n * The paths a step wrote that its `expected` write set did not name, together\n * with the diff identity they were observed under.\n *\n * An expected-mode boundary reports these rather than failing: the declaration\n * is a prediction, and a wrong prediction is evidence to journal, not an\n * error. A hard-mode boundary raises {@link UndeclaredWrite} for the same\n * observation.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const ExpectedSetDeviation = Schema.TaggedStruct(\"ExpectedSetDeviation\", {\n  paths: Schema.Array(Schema.String),\n  diffIdentity: Schema.NonEmptyString\n})\n\n/**\n * Declared writes an expected-mode step did not produce, and did not declare\n * as removals.\n *\n * The absence itself is the defect: recording it as valid evidence caches the\n * claim \"this file should not exist\", which `replayOutputs` then acts on by\n * deleting the path on a workspace that never ran the step. A hard-mode\n * boundary raises {@link MissingDeclaredOutput} for the same observation.\n *\n * Expected mode records it rather than failing because the declaration there is\n * a prediction — and because a deviation of any variant already bars the\n * evidence from the shared cache (`ActionPersistence` gates `recordCache` on\n * `deviation === undefined`), so an unexplained absence never reaches another\n * host either way.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const MissingOutputDeviation = Schema.TaggedStruct(\"MissingDeclaredOutput\", {\n  paths: Schema.Array(Schema.String),\n  diffIdentity: Schema.NonEmptyString\n})\n\n/**\n * Declared removals an expected-mode step left in place.\n *\n * The dual of {@link MissingOutputDeviation}: a removal is a promise about the\n * post-state exactly as a write is. A path that was promised absent but is\n * still present — possibly mutated — must not settle as valid evidence, or\n * the mutation is cached under a declaration that disclaimed it and replay\n * materializes it everywhere. A hard-mode boundary raises\n * {@link SurvivingDeclaredRemoval} for the same observation.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const SurvivingRemovalDeviation = Schema.TaggedStruct(\"SurvivingDeclaredRemoval\", {\n  paths: Schema.Array(Schema.String),\n  diffIdentity: Schema.NonEmptyString\n})\n\n/**\n * What a settled boundary observed that its declaration did not predict.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const BoundaryDeviation = Schema.Union([ExpectedSetDeviation, MissingOutputDeviation, SurvivingRemovalDeviation])\n\n/**\n * The value form of {@link BoundaryDeviation}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BoundaryDeviation = typeof BoundaryDeviation.Type\n\n/**\n * What a settled boundary proved about a step's writes — the record the\n * journal keeps and a later cache hit is justified against.\n *\n * `diffIdentity` names the post-state the step produced; `declaredOutputs`\n * carries whatever the implementation needs to reproduce it on a workspace\n * that never ran the step. The two optional fields are the honest gaps:\n * `wholeTreeWritesVerified` is present only when the boundary could observe\n * the entire execution tree, and `deviation` only when it saw writes the\n * declaration did not predict.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const BoundaryEvidence = Schema.Struct({\n  declaredOutputs: Schema.Unknown,\n  diffIdentity: Schema.NonEmptyString,\n  /**\n   * The boundary observed the whole execution tree and proved that every\n   * write was covered by the descriptor's write set. Only evidence carrying\n   * this explicit proof may enter the cross-run cache. Older evidence and\n   * boundaries that can inspect declared paths only omit it.\n   */\n  wholeTreeWritesVerified: Schema.optional(Schema.Literal(true)),\n  /** The body could observe only declared filesystem inputs. */\n  hermeticReadsVerified: Schema.optional(Schema.Literal(true)),\n  deviation: Schema.optional(BoundaryDeviation)\n})\n\n/**\n * The value form of {@link BoundaryEvidence}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BoundaryEvidence = typeof BoundaryEvidence.Type\n\n/**\n * A hard-mode step wrote outside its declared write set.\n *\n * Hard mode treats the declaration as a contract, so this is a refusal, not a\n * report: the step's evidence is never journaled and never becomes a cache\n * entry. An expected-mode boundary records the same observation as a\n * {@link BoundaryDeviation} instead.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class UndeclaredWrite extends Schema.TaggedError<UndeclaredWrite>()(\n  \"@smthrs/engine-store/UndeclaredWrite\",\n  {\n    code: Schema.Literal(\"undeclared_write\"),\n    paths: Schema.Array(Schema.String),\n    diffIdentity: Schema.NonEmptyString\n  }\n) {}\n\n/**\n * A step finished without producing a path its write set declared, and did not\n * declare that path as a removal.\n *\n * Bazel hard-fails the same observation — `SkyframeActionExecutor.checkOutputs`\n * reports \"output was not created\" — and for the same reason: the alternative\n * is to record `digest: null` as valid evidence, which caches the claim \"this\n * file should not exist\" and makes every later replay delete the path. A step\n * that crashed after declaring its writes would poison the cache with an\n * eraser.\n *\n * Declaring the path in {@link FileBoundary}'s `removes` is how a deliberate\n * deletion says so, and it is the only thing that makes the absence legitimate.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class MissingDeclaredOutput extends Schema.TaggedError<MissingDeclaredOutput>()(\n  \"@smthrs/engine-store/MissingDeclaredOutput\",\n  {\n    code: Schema.Literal(\"missing_declared_output\"),\n    paths: Schema.Array(Schema.String),\n    diffIdentity: Schema.NonEmptyString\n  }\n) {}\n\n/**\n * A hard-mode step left a declared removal in place.\n *\n * The dual of {@link MissingDeclaredOutput}: `removes` promises the path is\n * absent afterwards, and a path that survived — or was quietly rewritten —\n * is a post-state the declaration disclaimed. Settling it as evidence would\n * cache the surviving bytes under a removal and hand them to every replay.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class SurvivingDeclaredRemoval extends Schema.TaggedError<SurvivingDeclaredRemoval>()(\n  \"@smthrs/engine-store/SurvivingDeclaredRemoval\",\n  {\n    code: Schema.Literal(\"surviving_declared_removal\"),\n    paths: Schema.Array(Schema.String),\n    diffIdentity: Schema.NonEmptyString\n  }\n) {}\n\n/**\n * The host could not honour the boundary at all — a filesystem that cannot be\n * measured, a path that cannot be read, a transient I/O failure.\n *\n * It is the catch-all host refusal, deliberately kept distinct from the two\n * refusals a caller can act on: {@link BoundaryCorruption} (the bytes changed\n * under a recorded digest) and {@link MissingArtifact} (the bytes might be\n * fetchable from a shared tier).\n *\n * @since 0.1.0\n * @category errors\n */\nexport class UnsupportedBoundary extends Schema.TaggedError<UnsupportedBoundary>()(\n  \"@smthrs/engine-store/UnsupportedBoundary\",\n  {\n    code: Schema.Literal(\"unsupported_boundary\"),\n    message: Schema.String,\n    /**\n     * The refusing host or artifact-store failure, carried whole rather than\n     * flattened into the message (`PlatformError`'s own convention), so the\n     * journal record and a live debugger both see the original error.\n     */\n    cause: Schema.optional(Schema.Defect())\n  }\n) {}\n\n/**\n * Recorded boundary evidence whose bytes no longer match their recorded\n * digest — an integrity violation of the store's strongest invariant, as\n * opposed to a transient host failure (issue #150). The two classes were\n * previously conflated under one `UnsupportedBoundary` tag, so a failing\n * disk corrupting many blobs journalled identically to a one-off EIO.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class BoundaryCorruption extends Schema.TaggedError<BoundaryCorruption>()(\n  \"@smthrs/engine-store/BoundaryCorruption\",\n  {\n    code: Schema.Literal(\"boundary_corruption\"),\n    path: Schema.String,\n    recordedDigest: Schema.String,\n    measuredDigest: Schema.String\n  }\n) {}\n\n/**\n * Recorded evidence references an artifact this host's store does not hold\n * (issue #172). Distinct from {@link UnsupportedBoundary} because it is the one\n * replay refusal a *shared artifact tier* can repair: the caller fetches the\n * blob from the remote store, writes it back locally, and retries the replay\n * once before falling through to a real execution. Every other host refusal\n * says nothing about where the bytes might be.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class MissingArtifact extends Schema.TaggedError<MissingArtifact>()(\n  \"@smthrs/engine-store/MissingArtifact\",\n  {\n    code: Schema.Literal(\"missing_artifact\"),\n    path: Schema.String,\n    digest: Schema.String\n  }\n) {}\n\n/**\n * The three-call lifecycle of a hermetic step boundary.\n *\n * `prepare` measures the declared read set before the step runs; `settle`\n * measures the writes afterwards and turns them into {@link BoundaryEvidence};\n * `replayOutputs` reproduces a previous step's outputs from that evidence, so\n * a cache hit can materialize results on a workspace that never executed\n * anything.\n *\n * @since 0.1.0\n * @category services\n */\nexport interface Service {\n  readonly prepare: (\n    descriptor: FileBoundary\n  ) => Effect.Effect<PreparedBoundary, UnsupportedBoundary, Crypto.Crypto>\n  readonly settle: (\n    prepared: PreparedBoundary\n  ) => Effect.Effect<\n    BoundaryEvidence,\n    UndeclaredWrite | MissingDeclaredOutput | SurvivingDeclaredRemoval | UnsupportedBoundary | BoundaryCorruption,\n    Crypto.Crypto\n  >\n  readonly replayOutputs: (\n    evidence: BoundaryEvidence\n  ) => Effect.Effect<void, UnsupportedBoundary | BoundaryCorruption | MissingArtifact, Crypto.Crypto>\n}\n\n/**\n * The service key for a {@link Service}. Provide it with `layer` for\n * a real workspace or `layerTest` for a deterministic in-memory one.\n *\n * @since 0.1.0\n * @category services\n */\nexport const StepBoundary: Context.Service<Service, Service> = Context.Service<Service>(\n  \"@smthrs/engine-store/StepBoundary\"\n)\n\n/**\n * Brands a {@link Service} implementation as a `StepBoundary`, so a new\n * boundary backend is type-checked where it is written rather than where it is\n * provided.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make = (service: Service): Service => StepBoundary.of(service)\n\n/**\n * The digest a measurement reports for a declared path that does not exist.\n * Declared digests are hex SHA-256 strings, so the sentinel can never\n * collide with a real measurement — a declaration naming a vanished file\n * always mismatches and the cache hit is refused.\n */\nconst absentDigest = \"absent\"\n\n/**\n * The persisted shape of the production layer's `declaredOutputs`: the\n * declared write set's materialized post-state, so a cache-hit replay can\n * reproduce the outputs on a workspace that never ran the step.\n *\n * Outputs are recorded by content digest, never inlined unbounded\n * (issue #113): a `null` digest records that the path did not exist at\n * settle time; `content` (base64) is present only when the payload fits the\n * configured inline bound, otherwise the bytes live in the host's\n * content-addressed object directory under the digest and the row carries\n * only the reference. Temporal's blob-size limits are the prior art — the\n * evidence is persisted into every attempt row and cache entry.\n *\n * The digest is decoded against the store's strict address schema\n * (`ArtifactStore.Digest`), so a persisted row carrying a malformed address\n * fails the decode here instead of reaching the store or the sync RPCs.\n */\nconst DigestReferencedOutput = Schema.Struct({\n  path: Schema.String,\n  digest: Schema.NullOr(ArtifactStore.Digest),\n  sizeBytes: Schema.optional(Schema.Number),\n  content: Schema.optional(Schema.String)\n})\n\nconst MaterializedOutputs = Schema.Struct({\n  outputs: Schema.Array(DigestReferencedOutput),\n  trees: Schema.optional(Schema.Array(Schema.Struct({\n    path: Schema.String,\n    identity: Schema.String\n  })))\n})\n\n/**\n * The directory portion of a slash-separated path, or `undefined` for a\n * bare filename (nothing to create). Boundary paths are workspace-relative\n * and slash-separated — the same normalization the kernel `FileSystem`\n * layer applies.\n */\nconst parentDirectory = (path: string): string | undefined => {\n  const index = path.lastIndexOf(\"/\")\n  return index <= 0 ? undefined : path.slice(0, index)\n}\n\nconst hostFailure = (cause: unknown): UnsupportedBoundary =>\n  new UnsupportedBoundary({\n    code: \"unsupported_boundary\",\n    message: \"the host filesystem could not enforce the step boundary\",\n    cause\n  })\n\n/**\n * An artifact store that refused the operation outright — a failing disk, an\n * unreachable shared tier, an address that is not a content address. Unlike a\n * miss or a corruption it says nothing about the artifact, so it stays the\n * ordinary retryable host refusal the issue-#107 call sites already handle.\n */\nconst artifactFailure = (cause: ArtifactStore.ArtifactStoreError): UnsupportedBoundary =>\n  new UnsupportedBoundary({\n    code: \"unsupported_boundary\",\n    message: `the artifact store could not serve the step boundary: ${cause.message}`,\n    cause\n  })\n\n/**\n * Corruption of an *inline* evidence payload (issue #159): the recorded\n * base64 no longer decodes, so there are no bytes to measure a digest of —\n * the `invalid_base64` sentinel records that the measurement itself was\n * impossible, which is still cache-origin corruption and never a transient\n * host refusal.\n */\nconst inlineCorruption = (path: string, recordedDigest: string): BoundaryCorruption =>\n  new BoundaryCorruption({\n    code: \"boundary_corruption\",\n    path,\n    recordedDigest,\n    measuredDigest: \"invalid_base64\"\n  })\n\n/**\n * The two size bounds that decide when a settled output is inlined into\n * boundary evidence and when it is spilled to the `ArtifactStore` by digest.\n *\n * Both default to values that keep an evidence row small enough to journal;\n * raise them only when the workspace's outputs are known to be small and the\n * extra artifact round-trip is measurably costing something.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface FileSystemOptions {\n  /**\n   * The largest output (in bytes) inlined into the boundary evidence\n   * itself. Anything larger is handed to the `ArtifactStore` and recorded by\n   * digest reference only (issue #113). Defaults to 1 MiB.\n   */\n  readonly maxInlineBytes?: number | undefined\n  /**\n   * The largest *aggregate* inline payload (in bytes) a single settle may\n   * fold into its boundary evidence (issue #122). A per-output bound alone\n   * still let a wide write set multiply many individually-small payloads\n   * into an unbounded evidence row; once an output would push the running\n   * total past this bound it is spilled to the `ArtifactStore` and\n   * recorded by digest reference only, even though it individually fits\n   * {@link maxInlineBytes}. Defaults to 8 MiB.\n   */\n  readonly maxTotalInlineBytes?: number | undefined\n  /**\n   * The workspace root cache replay confines its writes, removals, and prune\n   * walk to. A filesystem already confined to a root (the kernel-guarded\n   * layer's service, or a `confined` view) keeps its own root and ignores\n   * this. Otherwise it defaults to the process working directory, the root a\n   * path-based host resolves `prepare` and `settle` against. {@link layer}\n   * passes the kernel `Workspace` root when one is in context.\n   */\n  readonly root?: string | undefined\n}\n\nconst defaultMaxInlineBytes = 1024 * 1024\nconst defaultMaxTotalInlineBytes = 8 * 1024 * 1024\ninterface MeasuredDigest {\n  readonly digest: ArtifactStore.Digest\n  readonly bytes: Uint8Array\n}\n\ninterface BatchedDigest {\n  readonly digest: ArtifactStore.Digest\n  readonly sizeBytes: number\n  readonly bytes?: Uint8Array\n}\n\ntype MaterializedOutput = typeof DigestReferencedOutput.Type\n\n/**\n * The digests this evidence references rather than inlines — the set that must\n * be durable in a shared artifact tier before the evidence's cache entry\n * becomes observable there, and the set a replay on a fresh host has to fetch.\n *\n * Evidence recorded by a foreign boundary implementation references nothing\n * this store can name, so it yields the empty list rather than failing: the\n * caller's replay path already refuses such evidence with\n * {@link UnsupportedBoundary}.\n *\n * @since 0.1.0\n * @category accessors\n */\nexport const referencedDigests = (evidence: BoundaryEvidence): ReadonlyArray<ArtifactStore.Digest> => {\n  const decoded = Schema.decodeUnknownResult(MaterializedOutputs)(evidence.declaredOutputs)\n  if (decoded._tag === \"Failure\") return []\n  const digests: Array<ArtifactStore.Digest> = []\n  for (const output of decoded.success.outputs) {\n    if (output.digest === null || output.content !== undefined) continue\n    digests.push(output.digest)\n  }\n  return digests\n}\n\n/**\n * Builds the filesystem-backed boundary service.\n *\n * The blob mechanics — content addressing, atomic publication, digest\n * verification, dedupe — belong to `artifacts` and were extracted into\n * `@smthrs/artifacts` (`packages/smithers/flows/artifacts/docs/api.md`). What stays here\n * is the *policy* that decides which outputs become blobs at all: the\n * inline-versus-spill budgets are a property of how large an evidence row may\n * get, not of how bytes are stored.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const makeFileSystem = (\n  fs: FileSystem.FileSystem,\n  platformPath: Path.Path,\n  artifacts: ArtifactStore.Service,\n  options: FileSystemOptions = {}\n): Service => {\n  const maxInlineBytes = options.maxInlineBytes ?? defaultMaxInlineBytes\n  const maxTotalInlineBytes = options.maxTotalInlineBytes ?? defaultMaxTotalInlineBytes\n  // Stat tuples are not content identities: a same-size rewrite can preserve\n  // mtime, device, and inode on every supported filesystem.\n  const readDigestFrom = Effect.fn(\"StepBoundary.readDigest\")(function*(host: FileSystem.FileSystem, path: string) {\n    const bytes = yield* host.readFile(path)\n    const digest = yield* Schema.decodeUnknownEffect(Sha256)(bytes).pipe(Effect.orDie)\n    return { digest, bytes } satisfies MeasuredDigest\n  })\n  const readDigest = (path: string) => readDigestFrom(fs, path)\n  const batch = KernelFileSystem.batch(fs)\n  const measurements = Effect.fn(\"StepBoundary.measurements\")(\n    function*(paths: ReadonlyArray<string>, content: boolean) {\n      if (batch === undefined) {\n        return yield* Effect.forEach(paths, (path) =>\n          readDigest(path).pipe(\n            Effect.map((value): BatchedDigest => ({\n              digest: value.digest,\n              sizeBytes: value.bytes.length,\n              ...(content ? { bytes: value.bytes } : {})\n            })),\n            Effect.catchReason(\"PlatformError\", \"NotFound\", () => Effect.succeed(undefined)),\n            Effect.mapError(hostFailure)\n          ), { concurrency: KernelFileSystem.fallbackConcurrency })\n      }\n      const values: Array<BatchedDigest | undefined> = []\n      for (let offset = 0; offset < paths.length; offset += batch.maxSize) {\n        const response = yield* batch.execute(\n          paths.slice(offset, offset + batch.maxSize).map((path) => ({\n            operation: \"digest\",\n            path,\n            content\n          }))\n        ).pipe(Effect.mapError(hostFailure))\n        for (const entry of [...response.entries].sort((a, b) => a.index - b.index)) {\n          const measured = yield* Effect.fromResult(entry.result).pipe(\n            Effect.catchReason(\"PlatformError\", \"NotFound\", () => Effect.succeed(undefined)),\n            Effect.mapError(hostFailure)\n          )\n          if (measured === undefined) values.push(undefined)\n          else if (measured.operation !== \"digest\") {\n            return yield* Effect.fail(hostFailure(new Error(\"host returned a non-digest batch result\")))\n          } else values.push({ ...measured, digest: measured.digest as ArtifactStore.Digest })\n        }\n      }\n      return values\n    }\n  )\n  /**\n   * One host call, never two. An `exists` probe ahead of the read asked\n   * exactly what the read itself answers — a path that is not there refuses\n   * with `NotFound` — and every declared read was therefore measured twice.\n   * On the confined host that is two CPython forks per path\n   * (`@smthrs/platform-node/AtomicFileSystem` spawns one interpreter per\n   * operation, ~130 ms each), so the probe doubled the cost of every\n   * `prepare`, every post-body change check, and every materialization.\n   */\n  const measure = (\n    path: string,\n    host: FileSystem.FileSystem = fs\n  ): Effect.Effect<string, UnsupportedBoundary, Crypto.Crypto> =>\n    readDigestFrom(host, path).pipe(\n      Effect.map((measured) => measured.digest),\n      Effect.catchReason(\"PlatformError\", \"NotFound\", () => Effect.succeed(absentDigest)),\n      Effect.mapError(hostFailure)\n    )\n  // Both expansions enumerate through `FileEnumeration`, never the host\n  // `glob`: host results are absolute under the kernel FileSystem and skip\n  // dotfiles under Node's matcher, so trusting them silently emptied every\n  // workspace-relative expansion and let a tree replay delete dotfiles the\n  // producer wrote.\n  const expandGlob = Effect.fn(\"StepBoundary.expandGlob\")(function*(glob: FileSet.Glob) {\n    return yield* FileEnumeration.expandGlob(fs, glob).pipe(Effect.mapError(hostFailure))\n  })\n  const treeEntries = Effect.fn(\"StepBoundary.treeEntries\")(function*(host: FileSystem.FileSystem, path: string) {\n    return yield* FileEnumeration.entriesUnder(host, path).pipe(Effect.mapError(hostFailure))\n  })\n  // Replay writes and deletes what evidence names, so the lexical check alone\n  // is not a boundary: a symlink planted on a lexically valid path would carry\n  // the mutation outside the workspace. Every replay mutation, its probes, and\n  // its prune walk go through a view pinned to the root, where each call is\n  // one descriptor-relative, no-follow request and a symlink anywhere on the\n  // path is refused rather than followed. `prepare` and `settle` only read,\n  // and keep the caller's filesystem.\n  const replayRoot = KernelFileSystem.confinedRoot(fs) ?? options.root ?? \".\"\n  const replayHost: Effect.Effect<FileSystem.FileSystem, UnsupportedBoundary> = KernelFileSystem.isConfinable(fs)\n    ? KernelFileSystem.confined(fs, replayRoot).pipe(\n      Effect.provideService(Path.Path, platformPath),\n      Effect.mapError(hostFailure)\n    )\n    : Effect.fail(\n      new UnsupportedBoundary({\n        code: \"unsupported_boundary\",\n        message:\n          \"cache replay needs a confined host filesystem; the host carries no descriptor-relative executor or isolation attestation\"\n      })\n    )\n  const capture = Effect.fn(\"StepBoundary.capture\")(\n    function*(path: string, inlineBudget: number, measured: BatchedDigest | undefined) {\n      yield* Effect.annotateCurrentSpan({ path })\n      // As in `measure`: the read reports absence itself, so the output is\n      // captured in one host call rather than an `exists` probe plus a read.\n      if (measured === undefined) {\n        return { output: { path, digest: null } satisfies MaterializedOutput, inlinedBytes: 0 }\n      }\n      const bytes = measured.bytes\n      if (bytes === undefined) return yield* Effect.fail(hostFailure(new Error(\"host omitted requested batch content\")))\n      const digest = measured.digest\n      // Inline only while both bounds hold (issue #122): the per-output bound\n      // and the settle-wide aggregate budget the caller threads through.\n      if (bytes.length <= maxInlineBytes && bytes.length <= inlineBudget) {\n        return {\n          output: {\n            path,\n            digest,\n            sizeBytes: bytes.length,\n            content: Base64.encode(bytes)\n          } satisfies MaterializedOutput,\n          inlinedBytes: bytes.length\n        }\n      }\n      // Over the inline bound: the payload goes to the content-addressed\n      // artifact store and the persisted row carries only the reference. Every\n      // property that used to live here — atomic publication, verify-once\n      // dedupe, healing rewrite of a corrupt address — is now the store's, and\n      // is tested there (`@smthrs/artifacts`).\n      const stored = yield* artifacts.put(bytes).pipe(Effect.mapError(artifactFailure))\n      if (stored !== digest) {\n        return yield* Effect.fail(\n          new BoundaryCorruption({\n            code: \"boundary_corruption\",\n            path,\n            recordedDigest: `${stored}`,\n            measuredDigest: digest\n          })\n        )\n      }\n      return { output: { path, digest, sizeBytes: bytes.length } satisfies MaterializedOutput, inlinedBytes: 0 }\n    }\n  )\n  const materialize = Effect.fn(\"StepBoundary.materialize\")(function*(\n    host: FileSystem.FileSystem,\n    output: MaterializedOutput\n  ) {\n    yield* Effect.annotateCurrentSpan({ path: output.path })\n    // The filesystem is the cheapest source of truth for a warm workspace.\n    // Probe before decoding inline bytes or consulting the artifact store; a\n    // transient probe refusal merely forfeits the optimization and the\n    // ordinary materialization path retains its existing typed failures.\n    const current = yield* measure(output.path, host).pipe(\n      Effect.map((digest) => digest !== absentDigest && digest === output.digest),\n      Effect.catch(() => Effect.succeed(false))\n    )\n    if (current) return\n    let bytes: Uint8Array\n    if (output.content !== undefined) {\n      const decoded = Base64.decode(output.content)\n      if (Result.isFailure(decoded)) {\n        // Inline content is cache-origin bytes: an undecodable payload is a\n        // tampered durable row, classified exactly like a digest mismatch so\n        // the caller routes it to the Inconsistency receiver instead of\n        // retrying it as a transient host refusal (issue #159).\n        return yield* Effect.fail(inlineCorruption(output.path, `${output.digest}`))\n      }\n      bytes = decoded.success\n      // Inline evidence is verified here because nothing else can: the bytes\n      // travel inside the row rather than at a content address. A referenced\n      // artifact is verified by the store on the way out, so the check below\n      // would be a second read+hash of the same bytes.\n      const measured = yield* Schema.decodeUnknownEffect(Sha256)(bytes).pipe(Effect.orDie)\n      if (measured !== output.digest) {\n        return yield* Effect.fail(\n          new BoundaryCorruption({\n            code: \"boundary_corruption\",\n            path: output.path,\n            recordedDigest: `${output.digest}`,\n            measuredDigest: measured\n          })\n        )\n      }\n    } else {\n      bytes = yield* artifacts.get(`${output.digest}`).pipe(\n        Effect.catchTags({\n          // A reference this host cannot resolve is not a host refusal: a\n          // shared artifact tier may still hold it, so the caller gets a\n          // typed, repairable failure and fetches before falling back to a\n          // real execution (issue #172).\n          \"@smthrs/artifacts/ArtifactMissing\": (missing) =>\n            Effect.fail(\n              new MissingArtifact({ code: \"missing_artifact\", path: output.path, digest: missing.digest })\n            ),\n          // Corruption is a distinct typed failure from a transient host\n          // error (issue #150): the caller routes it to the Inconsistency\n          // receiver instead of treating it as an ordinary retryable refusal.\n          \"@smthrs/artifacts/ArtifactCorruption\": (corrupt) =>\n            Effect.fail(\n              new BoundaryCorruption({\n                code: \"boundary_corruption\",\n                path: output.path,\n                recordedDigest: corrupt.recordedDigest,\n                measuredDigest: corrupt.measuredDigest\n              })\n            ),\n          \"@smthrs/artifacts/ArtifactStoreError\": (failure) => Effect.fail(artifactFailure(failure))\n        })\n      )\n    }\n    // The original body may have created the output's directory itself; a\n    // fresh workspace replaying the evidence has no such directory and\n    // `writeFile` does not create parents (issue #107).\n    const parent = parentDirectory(output.path)\n    if (parent !== undefined) {\n      yield* host.makeDirectory(parent, { recursive: true }).pipe(Effect.mapError(hostFailure))\n    }\n    yield* host.writeFile(output.path, bytes).pipe(Effect.mapError(hostFailure))\n  })\n  return make({\n    prepare: Effect.fn(\"StepBoundary.prepare\")(function*(descriptor) {\n      const boundary = FileBoundarySnapshot.make(descriptor)\n      yield* Effect.annotateCurrentSpan({\n        reads: boundary.readSet.length,\n        boundaryMode: boundary.boundaryMode\n      })\n      // The dirty check's evidence (issue #90): what the host actually\n      // measured for every declared read, never the declaration itself —\n      // defaulting the snapshot to the declaration made `readSetMatches`\n      // compare the declaration against itself and pass unconditionally\n      // (issue #104).\n      const readSnapshot: Array<FileInput> = []\n      const paths: Array<string> = []\n      for (const entry of boundary.readSet) {\n        if (FileSet.isGlob(entry)) {\n          paths.push(...yield* expandGlob(entry))\n        } else paths.push(entry.path)\n      }\n      const measured = yield* measurements(paths, false)\n      for (const [index, path] of paths.entries()) {\n        readSnapshot.push({ path, digest: measured[index]?.digest ?? absentDigest })\n      }\n      readSnapshot.sort((left, right) => compareText(left.path, right.path))\n      return Object.freeze({\n        descriptor: boundary,\n        readSnapshot: Object.freeze(readSnapshot.map((entry) => Object.freeze({ ...entry })))\n      })\n    }),\n    settle: Effect.fn(\"StepBoundary.settle\")(function*(prepared) {\n      yield* Effect.annotateCurrentSpan({\n        writes: prepared.descriptor.writeSet.length,\n        boundaryMode: prepared.descriptor.boundaryMode\n      })\n      // Undeclared-write detection is scoped to the declared read set: a\n      // declared read whose content moved during the body and is not also a\n      // declared write was mutated outside the contract. Whole-tree change\n      // detection needs the jj diff surface and stays a documented\n      // limitation of this layer rather than a silent pass — the read set\n      // is exactly the material cacheability rests on.\n      const removes = prepared.descriptor.removes ?? []\n      const declaredWrites = [...prepared.descriptor.writeSet, ...removes]\n      const declaredCovers = (path: string) =>\n        declaredWrites.some((entry) =>\n          typeof entry === \"string\"\n            ? entry === path\n            : entry._tag === \"TreeArtifact\"\n            ? path === entry.path || path.startsWith(`${entry.path}/`)\n            : FileSet.matchesGlob(entry, path)\n        )\n      const undeclared: Array<string> = []\n      const checkedReads = prepared.readSnapshot.filter((entry) => !declaredCovers(entry.path))\n      const currentReads = yield* measurements(checkedReads.map((entry) => entry.path), false)\n      for (const [index, entry] of checkedReads.entries()) {\n        if ((currentReads[index]?.digest ?? absentDigest) !== entry.digest) undeclared.push(entry.path)\n      }\n      const outputs: Array<MaterializedOutput> = []\n      // Declared removals are captured on the same path and under the same\n      // `digest: null` semantics they have always had — the difference is that\n      // here the absence was declared, so it is evidence rather than a defect.\n      const missing: Array<string> = []\n      const surviving: Array<string> = []\n      let inlinedBytes = 0\n      const outputPaths: Array<string> = []\n      const treeMembers: Array<{ readonly path: string; readonly files: ReadonlyArray<string> }> = []\n      for (const entry of prepared.descriptor.writeSet) {\n        if (typeof entry === \"string\") outputPaths.push(entry)\n        else if (entry._tag === \"Glob\") outputPaths.push(...yield* expandGlob(entry))\n        else {\n          const files = (yield* treeEntries(fs, entry.path)).files\n          outputPaths.push(...files)\n          treeMembers.push({ path: entry.path, files })\n        }\n      }\n      outputPaths.push(...removes)\n      const captured = new Map<string, MaterializedOutput>()\n      const sortedPaths = [...new Set(outputPaths)].sort(compareText)\n      // Digest-only preflight bounds content batches by bytes as well as path\n      // count. Both measurements share the guarded host's pinned root identity;\n      // a rewrite between them is a refusal, never mismatched cached content.\n      const sizes = batch === undefined ? undefined : yield* measurements(sortedPaths, false)\n      for (let offset = 0; offset < sortedPaths.length;) {\n        let end = offset\n        let responseBytes = 256\n        const size = batch?.maxSize ?? KernelFileSystem.fallbackConcurrency\n        while (end < sortedPaths.length && end - offset < size) {\n          const estimate = 4096 + new TextEncoder().encode(sortedPaths[end]).length * 6 +\n            Math.ceil((sizes?.[end]?.sizeBytes ?? 0) / 3) * 4\n          if (end > offset && batch !== undefined && responseBytes + estimate > batch.maxResponseBytes) break\n          responseBytes += estimate\n          end++\n        }\n        const group = sortedPaths.slice(offset, end)\n        const contents = yield* measurements(group, true)\n        for (const [index, path] of group.entries()) {\n          const measured = contents[index]\n          if (sizes !== undefined && measured?.digest !== sizes[offset + index]?.digest) {\n            return yield* Effect.fail(hostFailure(new Error(`output changed during measurement: ${path}`)))\n          }\n          const output = yield* capture(path, maxTotalInlineBytes - inlinedBytes, measured)\n          // `capture` reports the bytes it actually inlined (zero for a\n          // digest-only reference), so the aggregate budget never has to\n          // re-derive them from the row it just built.\n          inlinedBytes += output.inlinedBytes\n          outputs.push(output.output)\n          captured.set(path, output.output)\n          if (\n            output.output.digest === null &&\n            !removes.includes(path) &&\n            prepared.descriptor.writeSet.some((entry) => typeof entry === \"string\" && entry === path)\n          ) missing.push(path)\n          // The dual check: a removal promised the path absent, and it is still\n          // here — possibly rewritten. Settling it would cache the surviving\n          // bytes under a declaration that disclaimed them.\n          if (output.output.digest !== null && removes.includes(path)) surviving.push(path)\n        }\n        offset = end\n      }\n      // A tree member is already one of the captured outputs, so its identity\n      // is folded from the digest that capture measured rather than from a\n      // second read of the same bytes. `capture` spells an absent member\n      // `null` where `measure` spells it `absentDigest`; the identity keeps\n      // the `measure` spelling, so a tree recorded before this and one\n      // recorded after hash identically.\n      const trees: Array<{ readonly path: string; readonly identity: string }> = []\n      for (const tree of treeMembers) {\n        const pairs = tree.files.map((path) =>\n          [path.slice(tree.path.length + 1), captured.get(path)!.digest ?? absentDigest] as const\n        )\n        trees.push({\n          path: tree.path,\n          identity: yield* Schema.decodeUnknownEffect(DerivedKey)({ kind: \"tree-artifact\", files: pairs }).pipe(\n            Effect.orDie\n          )\n        })\n      }\n      // Through `DerivedKey` — the repo's one hashing chokepoint — so the identity is\n      // a digest of the RFC 8785 canonical form rather than of whatever\n      // `JSON.stringify` happened to emit for this shape.\n      const diffIdentity = yield* Schema.decodeUnknownEffect(DerivedKey)({\n        kind: \"diff-identity\",\n        outputs: outputs.map((output) => [output.path, output.digest]),\n        trees\n      }).pipe(Effect.orDie)\n      yield* Effect.annotateCurrentSpan({ diffIdentity })\n      if (prepared.descriptor.boundaryMode === \"hard\") {\n        if (undeclared.length > 0) {\n          return yield* Effect.fail(\n            new UndeclaredWrite({ code: \"undeclared_write\", paths: undeclared, diffIdentity })\n          )\n        }\n        // A declared output that was never produced is a defect, not evidence\n        // (Bazel's `checkOutputs`). Recording it would cache `digest: null`,\n        // which every later `replayOutputs` reads as \"delete this path\".\n        if (missing.length > 0) {\n          return yield* Effect.fail(\n            new MissingDeclaredOutput({ code: \"missing_declared_output\", paths: missing, diffIdentity })\n          )\n        }\n        if (surviving.length > 0) {\n          return yield* Effect.fail(\n            new SurvivingDeclaredRemoval({ code: \"surviving_declared_removal\", paths: surviving, diffIdentity })\n          )\n        }\n      }\n      return {\n        declaredOutputs: { outputs, ...(trees.length === 0 ? {} : { trees }) },\n        diffIdentity,\n        // This filesystem-only boundary cannot observe writes elsewhere in\n        // the tree. Omission is deliberate: ActionPersistence treats the\n        // result as run-local and will not publish it to the shared cache.\n        //\n        // An undeclared write is reported ahead of a missing output, and a\n        // missing output ahead of a surviving removal: each is the stronger\n        // claim about the same execution, and every variant bars the evidence\n        // from the shared cache identically.\n        ...(undeclared.length > 0\n          ? { deviation: { _tag: \"ExpectedSetDeviation\" as const, paths: undeclared, diffIdentity } }\n          : missing.length > 0\n          ? { deviation: { _tag: \"MissingDeclaredOutput\" as const, paths: missing, diffIdentity } }\n          : surviving.length > 0\n          ? { deviation: { _tag: \"SurvivingDeclaredRemoval\" as const, paths: surviving, diffIdentity } }\n          : {})\n      }\n    }),\n    replayOutputs: Effect.fn(\"StepBoundary.replayOutputs\")(function*(evidence) {\n      yield* Effect.annotateCurrentSpan({ diffIdentity: evidence.diffIdentity })\n      const decoded = Schema.decodeUnknownResult(MaterializedOutputs)(evidence.declaredOutputs)\n      if (decoded._tag === \"Failure\") {\n        // Evidence recorded by a different boundary implementation carries\n        // no materializable outputs; refusing is honest — the caller's\n        // dispatch path falls back to a real execution or fails visibly.\n        return yield* Effect.fail(\n          new UnsupportedBoundary({\n            code: \"unsupported_boundary\",\n            message: \"the recorded boundary evidence carries no materializable outputs\"\n          })\n        )\n      }\n      // Replay writes and DELETES whatever the evidence names, so a path is\n      // honored only in the coordinate system declarations are written in.\n      // Evidence can arrive from a foreign producer through cache sync; an\n      // absolute or upward spelling is an eraser aimed outside the workspace,\n      // and refusing it here is what keeps that a refusal instead of a wipe.\n      const foreign = [\n        ...(decoded.success.trees ?? []).map((tree) => tree.path),\n        ...decoded.success.outputs.map((output) => output.path)\n      ].filter((path) => !FileSet.workspaceRelative(path))\n      if (foreign.length > 0) {\n        return yield* Effect.fail(\n          new UnsupportedBoundary({\n            code: \"unsupported_boundary\",\n            message: `the recorded boundary evidence names paths outside the workspace: ${foreign.join(\", \")}`\n          })\n        )\n      }\n      // Before any mutation: a host that cannot be confined refuses the whole\n      // replay, and the caller falls back to a real execution.\n      const host = yield* replayHost\n      const emptyDirectoryCandidates = new Set<string>()\n      for (const tree of decoded.success.trees ?? []) {\n        const prefix = `${tree.path}/`.replace(/\\/{2,}$/g, \"/\")\n        const recorded = new Set(\n          decoded.success.outputs\n            .map((output) => output.path)\n            .filter((path) => path.startsWith(prefix))\n        )\n        const entries = yield* treeEntries(host, tree.path)\n        for (const path of entries.files) {\n          if (!recorded.has(path)) yield* host.remove(path).pipe(Effect.mapError(hostFailure))\n        }\n        for (const directory of entries.directories) emptyDirectoryCandidates.add(directory)\n      }\n      for (const output of decoded.success.outputs) {\n        if (output.digest === null) {\n          // `force` IS the probe: the evidence says this path must not exist,\n          // and a removal that finds it already gone has done its job. The\n          // `exists` call that used to precede it was a second host call — a\n          // second process on the confined host — for the same answer.\n          yield* host.remove(output.path, { force: true }).pipe(Effect.mapError(hostFailure))\n        } else {\n          yield* materialize(host, output)\n        }\n      }\n      // Remove only directories proven empty after pruning and\n      // materialization. Deepest-first preserves every directory that still\n      // contains a recorded child while clearing stale empty scaffolding.\n      const directories = [...emptyDirectoryCandidates].sort((left, right) =>\n        right.length - left.length || compareText(left, right)\n      )\n      for (const directory of directories) {\n        const entries = yield* host.readDirectory(directory).pipe(Effect.mapError(hostFailure))\n        if (entries.length === 0) yield* host.remove(directory).pipe(Effect.mapError(hostFailure))\n      }\n    })\n  })\n}\n\n/**\n * Provides the filesystem-backed production boundary: `prepare` measures the\n * declared read set for real, `settle` detects reads mutated outside the\n * declared write set and captures the write set's post-state, and\n * `replayOutputs` re-materializes those outputs on cache-hit replay.\n *\n * Host access arrives through Effect's `FileSystem` tag, which the capability\n * kernel decorates in place — the same seam every host implementation (node,\n * bun, browser, sandbox) already provides. Blob storage arrives through\n * `@smthrs/artifacts`, so the same boundary runs over a purely local store or\n * over a local-plus-shared composition without knowing which it got.\n *\n * Replay confines its own mutations rather than trusting the composition:\n * they run through `@smthrs/kernel/FileSystem`'s `confined` view, rooted at\n * the kernel `Workspace` when one is in context. A symlink on a replayed path\n * (a parent, the final component, or a member of a replayed tree) and a host\n * with no descriptor-relative executor or isolation attestation both refuse\n * with {@link UnsupportedBoundary}, which the caller journals as\n * `replay_failed` before executing the step for real.\n *\n * @since 0.1.0\n * @category layers\n */\nexport const layer: Layer.Layer<\n  Service,\n  never,\n  FileSystem.FileSystem | Path.Path | ArtifactStore.ArtifactStore\n> = Layer.effect(\n  StepBoundary,\n  Effect.gen(function*() {\n    const fs = yield* FileSystem.FileSystem\n    const platformPath = yield* Path.Path\n    const artifacts = yield* ArtifactStore.ArtifactStore\n    const workspace = yield* Effect.serviceOption(KernelWorkspace)\n    return makeFileSystem(fs, platformPath, artifacts, workspace._tag === \"Some\" ? { root: workspace.value.root } : {})\n  })\n)\n\n/**\n * What the deterministic test boundary should pretend the host observed.\n *\n * Every field is a fixture, not a classification rule: a test supplies settlement\n * evidence or failure, the read snapshot, and whether the host claims\n * to support the boundary at all — then asserts on the resulting evidence or\n * refusal. Defaults describe a well-behaved, fully-supported host.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface TestOptions {\n  /** A settlement failure supplied verbatim by an integration fixture. */\n  readonly failure?: UndeclaredWrite | MissingDeclaredOutput | SurvivingDeclaredRemoval | undefined\n  /** Settlement evidence supplied verbatim; classification belongs to the real layer. */\n  readonly deviation?: BoundaryDeviation | undefined\n  /**\n   * What `prepare` reports as measured for the declared read set. Defaults\n   * to the declaration itself; a test supplies a different snapshot to stand\n   * for a file whose content moved out from under a stale declaration\n   * (issue #90).\n   */\n  readonly readSnapshot?: ReadonlyArray<FileInput> | undefined\n  /** The opaque replay payload recorded in the evidence. */\n  readonly declaredOutputs?: unknown\n  /** The post-state identity the evidence names. Defaults to a fixed string. */\n  readonly diffIdentity?: string | undefined\n  /** When false, every call fails with {@link UnsupportedBoundary}. Defaults to true. */\n  readonly supported?: boolean | undefined\n  /** Whether the fixture attests a whole-tree observation. Defaults to true. */\n  readonly wholeTreeWriteDetection?: boolean | undefined\n  /** Whether the fixture models an isolated read surface. Defaults to true. */\n  readonly hermeticReadDetection?: boolean | undefined\n  /** Observes each `replayOutputs` call, so a test can assert replay happened. */\n  readonly onReplay?: (evidence: BoundaryEvidence) => void\n}\n\nconst unsupported = (): UnsupportedBoundary =>\n  new UnsupportedBoundary({\n    code: \"unsupported_boundary\",\n    message: \"the host cannot enforce the declared step boundary\"\n  })\n\n/**\n * Deterministic in-memory boundary suitable only for tests. Production\n * wiring uses {@link layer}, the filesystem-backed implementation.\n *\n * Whole-tree change detection is supplied by sandboxed settlement, not by any\n * boundary layer: an isolated execution's transaction IS the tree, so\n * `ActionPersistence` compares its diff against the declared sets and sets\n * `wholeTreeWritesVerified` structurally (the retired piece-6 limitation).\n * {@link layer} still detects mutations within the declared read set only,\n * which is why unsandboxed evidence stays run-local.\n *\n * @since 0.1.0\n * @category layers\n */\nexport const layerTest = (options: TestOptions = {}): Layer.Layer<Service> => {\n  const diffIdentity = options.diffIdentity ?? \"test-diff\"\n  const service = make({\n    prepare: Effect.fn(\"StepBoundary.prepare\")(function*(descriptor) {\n      if (options.supported === false) return yield* Effect.fail(unsupported())\n      return {\n        descriptor,\n        readSnapshot: options.readSnapshot ?? exactReads(descriptor)\n      }\n    }),\n    settle: Effect.fn(\"StepBoundary.settle\")(function*(prepared) {\n      if (options.supported === false) return yield* Effect.fail(unsupported())\n      if (options.failure !== undefined) return yield* Effect.fail(options.failure)\n      return {\n        declaredOutputs: options.declaredOutputs ?? { paths: prepared.descriptor.writeSet },\n        diffIdentity,\n        ...(options.wholeTreeWriteDetection === false ? {} : { wholeTreeWritesVerified: true as const }),\n        ...(options.hermeticReadDetection === false ? {} : { hermeticReadsVerified: true as const }),\n        ...(options.deviation === undefined ? {} : { deviation: options.deviation })\n      }\n    }),\n    replayOutputs: Effect.fn(\"StepBoundary.replayOutputs\")(function*(evidence) {\n      if (options.supported === false) return yield* Effect.fail(unsupported())\n      yield* Effect.sync(() => {\n        options.onReplay?.(evidence)\n      })\n    })\n  })\n  return Layer.succeed(StepBoundary, service)\n}\n"]}

package/dist/esm/StepCacheFold.d.ts

@@ -41,7 +41,7 @@ import { CacheStore } from "@smthrs/step-cache";
 import * as Effect from "effect/Effect";
 import * as HashMap from "effect/HashMap";
 import * as HashSet from "effect/HashSet";
-import * as SqlClient from "effect/unstable/sql/SqlClient";
+import * as SqlClient from "effect/sql/SqlClient";
 /**
  * The journal event type the fold reads.
  *
@@ -144,5 +144,5 @@ export declare const rebuild: () => Effect.Effect<{
     admitted: number;
     retired: number;
     heads: number;
-}, import("effect/unstable/sql/SqlError").SqlError | CacheStore.CacheStoreError | Journal.JournalError, SqlClient.SqlClient | import("@smthrs/database/DurableWriter").DurableWriter | Journal.Journal>;
+}, import("effect/sql/SqlError").SqlError | CacheStore.CacheStoreError | Journal.JournalError, SqlClient.SqlClient | import("@smthrs/database/DurableWriter").DurableWriter | Journal.Journal>;
 //# sourceMappingURL=StepCacheFold.d.ts.map