@smthrs/flow 0.0.0-stage → 1.0.0-rc.12

package/dist/cjs/internal/JsonSchemaSubset.js

@@ -0,0 +1,229 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var JsonSchemaSubset_exports = {};
+__export(JsonSchemaSubset_exports, {
+  answerLimits: () => answerLimits,
+  check: () => check,
+  maxAnswerBytes: () => maxAnswerBytes,
+  maxAnswerDepth: () => maxAnswerDepth,
+  maxAnswerNodes: () => maxAnswerNodes,
+  maxDiagnosticChars: () => maxDiagnosticChars,
+  maxJsonKeyBytes: () => maxJsonKeyBytes,
+  maxJsonMembers: () => maxJsonMembers,
+  maxJsonStringBytes: () => maxJsonStringBytes,
+  maxSchemaBytes: () => maxSchemaBytes,
+  maxSchemaDepth: () => maxSchemaDepth,
+  maxSchemaNodes: () => maxSchemaNodes,
+  maxSchemaValueDepth: () => maxSchemaValueDepth,
+  maxSchemaValueNodes: () => maxSchemaValueNodes,
+  renderDiagnostic: () => renderDiagnostic,
+  schemaLimits: () => schemaLimits,
+  truncateDiagnostic: () => truncateDiagnostic,
+  validateSchema: () => validateSchema
+});
+module.exports = __toCommonJS(JsonSchemaSubset_exports);
+var BoundedJson = __toESM(require("./BoundedJson.js"), 1);
+const maxSchemaDepth = 32;
+const maxSchemaNodes = 512;
+const maxSchemaValueNodes = 1e4;
+const maxSchemaValueDepth = 64;
+const maxAnswerNodes = 1e4;
+const maxAnswerBytes = 256 * 1024;
+const maxSchemaBytes = 256 * 1024;
+const maxAnswerDepth = 64;
+const maxJsonStringBytes = 128 * 1024;
+const maxJsonKeyBytes = 4 * 1024;
+const maxJsonMembers = 1e4;
+const maxDiagnosticChars = 512;
+const supportedTypes = /* @__PURE__ */ new Set(["object", "array", "string", "number", "integer", "boolean", "null"]);
+const supportedKeywords = [
+  "type",
+  "enum",
+  "properties",
+  "required",
+  "items",
+  "nullable",
+  "description",
+  "title"
+];
+const truncateDiagnostic = (rendered) => {
+  const prefix = BoundedJson.scalarPrefix(rendered, maxDiagnosticChars);
+  return prefix.length === rendered.length ? prefix : `${prefix} [${rendered.length - prefix.length} characters dropped]`;
+};
+const renderDiagnostic = (value) => BoundedJson.render(value, maxDiagnosticChars);
+const renderDiagnosticList = (values) => truncateDiagnostic(
+  values.slice(0, maxDiagnosticChars).map((value) => BoundedJson.render(value, maxDiagnosticChars)).join(", ")
+);
+const at = (path) => path.length === 0 ? "the answer" : `"${truncateDiagnostic(path.join("."))}"`;
+const isObject = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+const jsonEquals = (left, right) => {
+  const pending = [[left, right]];
+  while (pending.length > 0) {
+    const [a, b] = pending.pop();
+    if (a === b) continue;
+    if (Array.isArray(a)) {
+      if (!Array.isArray(b) || a.length !== b.length) return false;
+      for (let index = a.length - 1; index >= 0; index--) pending.push([a[index], b[index]]);
+      continue;
+    }
+    if (!isObject(a) || !isObject(b)) return false;
+    const aKeys = Object.keys(a).sort();
+    const bKeys = Object.keys(b).sort();
+    if (aKeys.length !== bKeys.length) return false;
+    for (let index = aKeys.length - 1; index >= 0; index--) {
+      const aKey = aKeys[index];
+      const bKey = bKeys[index];
+      if (aKey !== bKey) return false;
+      pending.push([a[aKey], b[bKey]]);
+    }
+  }
+  return true;
+};
+const answerLimits = {
+  maxNodes: maxAnswerNodes,
+  maxDepth: maxAnswerDepth,
+  maxBytes: maxAnswerBytes,
+  maxStringBytes: maxJsonStringBytes,
+  maxKeyBytes: maxJsonKeyBytes,
+  maxMembers: maxJsonMembers
+};
+const schemaLimits = {
+  maxNodes: maxSchemaValueNodes,
+  maxDepth: maxSchemaValueDepth,
+  maxBytes: maxSchemaBytes,
+  maxStringBytes: maxJsonStringBytes,
+  maxKeyBytes: maxJsonKeyBytes,
+  maxMembers: maxJsonMembers
+};
+const checkAt = (value, schema, path) => {
+  const nullable = schema["nullable"] === true;
+  const enumeration = schema["enum"];
+  if (enumeration !== void 0) {
+    const matches = enumeration.some((allowed) => jsonEquals(allowed, value));
+    if (!matches) return `${at(path)} must be one of ${renderDiagnosticList(enumeration)}.`;
+  }
+  const type = schema["type"];
+  if (!(nullable && value === null) && type !== void 0) {
+    const typeComplaint = type === "object" ? isObject(value) ? void 0 : `${at(path)} must be an object.` : type === "array" ? Array.isArray(value) ? void 0 : `${at(path)} must be an array.` : type === "integer" ? Number.isInteger(value) ? void 0 : `${at(path)} must be an integer.` : type === "number" ? typeof value === "number" ? void 0 : `${at(path)} must be a number.` : type === "string" ? typeof value === "string" ? void 0 : `${at(path)} must be a string.` : type === "boolean" ? typeof value === "boolean" ? void 0 : `${at(path)} must be a boolean.` : value === null ? void 0 : `${at(path)} must be null.`;
+    if (typeComplaint !== void 0) return typeComplaint;
+  }
+  if (isObject(value)) {
+    const required = schema["required"];
+    if (Array.isArray(required)) {
+      const missing = required.find((key) => !Object.hasOwn(value, key));
+      if (missing !== void 0) {
+        return `${at(path)} is missing the required property "${truncateDiagnostic(String(missing))}".`;
+      }
+    }
+    const properties = schema["properties"];
+    if (isObject(properties)) {
+      for (const [key, property] of Object.entries(properties)) {
+        if (!Object.hasOwn(value, key)) continue;
+        const rejection = checkAt(value[key], property, [...path, key]);
+        if (rejection !== void 0) return rejection;
+      }
+    }
+  }
+  if (Array.isArray(value)) {
+    const items = schema["items"];
+    if (items !== void 0) {
+      for (const [index, element] of value.entries()) {
+        const rejection = checkAt(element, items, [...path, String(index)]);
+        if (rejection !== void 0) return rejection;
+      }
+    }
+  }
+  return void 0;
+};
+const check = (value, schema) => {
+  const admittedSchema = BoundedJson.admit(schema, schemaLimits);
+  if (!admittedSchema.ok) return admittedSchema.complaint;
+  const schemaComplaint = validateSchemaAt(admittedSchema.value, [], 0, { visited: 0 });
+  if (schemaComplaint !== void 0) return schemaComplaint;
+  const admittedAnswer = BoundedJson.admit(value, answerLimits);
+  if (!admittedAnswer.ok) return admittedAnswer.complaint;
+  return checkAt(admittedAnswer.value, admittedSchema.value, []);
+};
+const validateSchemaAt = (schema, path, depth, budget) => {
+  if (depth > maxSchemaDepth) {
+    return `${at(path)} exceeds the maximum JSON Schema depth of ${maxSchemaDepth}.`;
+  }
+  budget.visited++;
+  if (budget.visited > maxSchemaNodes) {
+    return `${at(path)} exceeds the maximum JSON Schema node count of ${maxSchemaNodes}.`;
+  }
+  if (!isObject(schema)) return `${at(path)} is described by something that is not a JSON Schema object.`;
+  const unsupported = Object.keys(schema).find((keyword) => !supportedKeywords.includes(keyword));
+  if (unsupported !== void 0) {
+    return `${at(path)} uses the unsupported JSON Schema keyword "${truncateDiagnostic(unsupported)}".`;
+  }
+  const enumeration = schema["enum"];
+  if (enumeration !== void 0 && !Array.isArray(enumeration)) {
+    return `${at(path)} declares an "enum" that is not an array.`;
+  }
+  if (Array.isArray(enumeration) && enumeration.length === 0) {
+    return `${at(path)} declares an empty "enum".`;
+  }
+  if (Object.hasOwn(schema, "required")) {
+    const required = schema["required"];
+    if (!Array.isArray(required)) return `${at([...path, "required"])} is not an array.`;
+    const invalid = required.findIndex((key) => typeof key !== "string");
+    if (invalid !== -1) return `${at([...path, "required", String(invalid)])} is not a string.`;
+    if (new Set(required).size !== required.length) {
+      return `${at([...path, "required"])} contains a duplicate property name.`;
+    }
+  }
+  if (Object.hasOwn(schema, "nullable") && typeof schema["nullable"] !== "boolean") {
+    return `${at([...path, "nullable"])} is not a boolean.`;
+  }
+  const type = schema["type"];
+  if (type !== void 0 && (typeof type !== "string" || !supportedTypes.has(type))) {
+    return `${at(path)} declares the unsupported JSON Schema type ${renderDiagnostic(type)}.`;
+  }
+  for (const keyword of ["description", "title"]) {
+    if (Object.hasOwn(schema, keyword) && typeof schema[keyword] !== "string") {
+      return `${at([...path, keyword])} is not a string.`;
+    }
+  }
+  const properties = schema["properties"];
+  if (properties !== void 0) {
+    if (!isObject(properties)) return `${at(path)} declares "properties" that is not an object.`;
+    for (const [key, property] of Object.entries(properties)) {
+      const complaint = validateSchemaAt(property, [...path, key], depth + 1, budget);
+      if (complaint !== void 0) return complaint;
+    }
+  }
+  const items = schema["items"];
+  return items === void 0 ? void 0 : validateSchemaAt(items, [...path, "items"], depth + 1, budget);
+};
+const validateSchema = (schema, path) => {
+  const admitted = BoundedJson.admit(schema, schemaLimits);
+  return admitted.ok ? validateSchemaAt(admitted.value, path, 0, { visited: 0 }) : admitted.complaint;
+};
+//# sourceMappingURL=JsonSchemaSubset.js.map

package/dist/cjs/internal/JsonSchemaSubset.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/internal/JsonSchemaSubset.ts"],
+  "sourcesContent": ["/**\n * The bounded JSON Schema subset a human-task answer is checked against.\n *\n * `HumanTask` asks a person for a value and refuses one that does not fit the\n * question. The fit for a `json` question is decided here: a schema is kept\n * inside a deliberately small subset, an answer is checked against it under\n * the same size bounds every human-task value is admitted under, and every\n * rejection is rendered within one diagnostic budget. `HumanTask` re-exports\n * the limits and the two public entry points; this file is the mechanism.\n *\n * @since 1.0.0\n */\n\nimport * as BoundedJson from \"./BoundedJson.ts\"\n\n/**\n * The deepest supported JSON Schema path, counting the root as depth zero.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaDepth = 32\n\n/**\n * The most schema objects one human-task request may contain.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaNodes = 512\n\n/**\n * The most JSON values embedded across schema keywords such as `enum`.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaValueNodes = 10_000\n\n/**\n * The deepest JSON value embedded in a schema, including enum members.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaValueDepth = 64\n\n/**\n * The most JSON values one answer validation may visit.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxAnswerNodes = 10_000\n\n/**\n * The largest encoded JSON answer that can enter the durable store.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxAnswerBytes = 256 * 1024\n\n/**\n * The largest encoded JSON Schema carried by one question.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaBytes = 256 * 1024\n\n/**\n * The deepest admitted answer tree.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxAnswerDepth = 64\n\n/**\n * The largest encoded string value admitted in a request or answer.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxJsonStringBytes = 128 * 1024\n\n/**\n * The largest encoded object key admitted in a request or answer.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxJsonKeyBytes = 4 * 1024\n\n/**\n * The most members admitted in one JSON array or object.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxJsonMembers = 10_000\n\n/**\n * The most caller-supplied characters retained in one rendered diagnostic.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxDiagnosticChars = 512\n\n/** The JSON Schema types the bounded subset understands. */\nconst supportedTypes = new Set([\"object\", \"array\", \"string\", \"number\", \"integer\", \"boolean\", \"null\"])\n\n/** The JSON Schema keywords the bounded subset understands. */\nconst supportedKeywords = [\n  \"type\",\n  \"enum\",\n  \"properties\",\n  \"required\",\n  \"items\",\n  \"nullable\",\n  \"description\",\n  \"title\"\n]\n\n/** Truncates a caller-supplied diagnostic while stating exactly what was dropped.\n * @private\n * @since 1.0.0\n */\nexport const truncateDiagnostic = (rendered: string): string => {\n  const prefix = BoundedJson.scalarPrefix(rendered, maxDiagnosticChars)\n  return prefix.length === rendered.length\n    ? prefix\n    : `${prefix} [${rendered.length - prefix.length} characters dropped]`\n}\n\n/** Renders one JSON value for a bounded rejection message.\n * @private\n * @since 1.0.0\n */\nexport const renderDiagnostic = (value: unknown): string => BoundedJson.render(value, maxDiagnosticChars)\n\n/**\n * Renders a value list in its comma-separated diagnostic shape.\n *\n * Every member renders to at least one character, so members past the\n * diagnostic budget can never survive truncation and are not rendered at all.\n */\nconst renderDiagnosticList = (values: ReadonlyArray<unknown>): string =>\n  truncateDiagnostic(\n    values.slice(0, maxDiagnosticChars).map((value) => BoundedJson.render(value, maxDiagnosticChars)).join(\", \")\n  )\n\n/** Renders a JSON pointer-ish path for a rejection message. */\nconst at = (path: ReadonlyArray<string>): string =>\n  path.length === 0 ? \"the answer\" : `\"${truncateDiagnostic(path.join(\".\"))}\"`\n\n/** Whether a value is a plain JSON object rather than an array or a null. */\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value)\n\n/** Compares two JSON values structurally without depending on object key order. */\nconst jsonEquals = (left: unknown, right: unknown): boolean => {\n  const pending: Array<readonly [unknown, unknown]> = [[left, right]]\n  while (pending.length > 0) {\n    const [a, b] = pending.pop()!\n    if (a === b) continue\n    if (Array.isArray(a)) {\n      if (!Array.isArray(b) || a.length !== b.length) return false\n      for (let index = a.length - 1; index >= 0; index--) pending.push([a[index], b[index]])\n      continue\n    }\n    if (!isObject(a) || !isObject(b)) return false\n    const aKeys = Object.keys(a).sort()\n    const bKeys = Object.keys(b).sort()\n    if (aKeys.length !== bKeys.length) return false\n    for (let index = aKeys.length - 1; index >= 0; index--) {\n      const aKey = aKeys[index]!\n      const bKey = bKeys[index]!\n      if (aKey !== bKey) return false\n      pending.push([a[aKey], b[bKey]])\n    }\n  }\n  return true\n}\n\n/** The bounds one answer is admitted under.\n * @private\n * @since 1.0.0\n */\nexport const answerLimits: BoundedJson.Limits = {\n  maxNodes: maxAnswerNodes,\n  maxDepth: maxAnswerDepth,\n  maxBytes: maxAnswerBytes,\n  maxStringBytes: maxJsonStringBytes,\n  maxKeyBytes: maxJsonKeyBytes,\n  maxMembers: maxJsonMembers\n}\n\n/** The bounds one schema is admitted under, enum members included.\n * @private\n * @since 1.0.0\n */\nexport const schemaLimits: BoundedJson.Limits = {\n  maxNodes: maxSchemaValueNodes,\n  maxDepth: maxSchemaValueDepth,\n  maxBytes: maxSchemaBytes,\n  maxStringBytes: maxJsonStringBytes,\n  maxKeyBytes: maxJsonKeyBytes,\n  maxMembers: maxJsonMembers\n}\n\n/**\n * Checks a value against the bounded JSON Schema subset, returning the first\n * reason it does not fit.\n *\n * The subset is `type` (`object`, `array`, `string`, `number`, `integer`,\n * `boolean`, `null`), `enum`, `properties`, `required`, `items`, and\n * `nullable`. It is deliberately small: a human-task schema exists to say what\n * shape an answer takes, and every keyword beyond these describes a constraint\n * a person cannot be usefully re-asked about. A schema that reaches outside it\n * is refused as `request_invalid` rather than silently ignored, because a\n * quietly dropped constraint reads as a validation that passed.\n *\n * Presence is `Object.hasOwn`, never the `in` operator. An answer is a decoded\n * JSON object, so every property it really has is its own; `in` also reports\n * `Object.prototype`'s members, which would accept a missing required\n * `toString` and check a `constructor` nobody answered against the schema for\n * one.\n *\n * @private\n */\nconst checkAt = (\n  value: unknown,\n  schema: Record<string, unknown>,\n  path: ReadonlyArray<string>\n): string | undefined => {\n  const nullable = schema[\"nullable\"] === true\n  const enumeration = schema[\"enum\"]\n  if (enumeration !== undefined) {\n    const matches = (enumeration as ReadonlyArray<unknown>).some((allowed) => jsonEquals(allowed, value))\n    if (!matches) return `${at(path)} must be one of ${renderDiagnosticList(enumeration as ReadonlyArray<unknown>)}.`\n  }\n  const type = schema[\"type\"]\n  if (!(nullable && value === null) && type !== undefined) {\n    const typeComplaint = type === \"object\"\n      ? isObject(value) ? undefined : `${at(path)} must be an object.`\n      : type === \"array\"\n      ? Array.isArray(value) ? undefined : `${at(path)} must be an array.`\n      : type === \"integer\"\n      ? Number.isInteger(value) ? undefined : `${at(path)} must be an integer.`\n      : type === \"number\"\n      // Bounded JSON admission already rejected every non-finite number.\n      ? typeof value === \"number\" ? undefined : `${at(path)} must be a number.`\n      : type === \"string\"\n      ? typeof value === \"string\" ? undefined : `${at(path)} must be a string.`\n      : type === \"boolean\"\n      ? typeof value === \"boolean\" ? undefined : `${at(path)} must be a boolean.`\n      : value === null\n      ? undefined\n      : `${at(path)} must be null.`\n    if (typeComplaint !== undefined) return typeComplaint\n  }\n\n  // Object and array keywords are independent constraints. JSON Schema does\n  // not require a sibling `type`; they apply whenever the instance has the\n  // relevant shape and are otherwise ignored.\n  if (isObject(value)) {\n    const required = schema[\"required\"]\n    if (Array.isArray(required)) {\n      const missing = required.find((key) => !Object.hasOwn(value, key as string))\n      if (missing !== undefined) {\n        return `${at(path)} is missing the required property \"${truncateDiagnostic(String(missing))}\".`\n      }\n    }\n    const properties = schema[\"properties\"]\n    if (isObject(properties)) {\n      for (const [key, property] of Object.entries(properties)) {\n        if (!Object.hasOwn(value, key)) continue\n        const rejection = checkAt(value[key], property as Record<string, unknown>, [...path, key])\n        if (rejection !== undefined) return rejection\n      }\n    }\n  }\n  if (Array.isArray(value)) {\n    const items = schema[\"items\"]\n    if (items !== undefined) {\n      for (const [index, element] of value.entries()) {\n        const rejection = checkAt(element, items as Record<string, unknown>, [...path, String(index)])\n        if (rejection !== undefined) return rejection\n      }\n    }\n  }\n  return undefined\n}\n\n/** Checks schema validity and snapshots both inputs before walking them together.\n * @private\n * @since 1.0.0\n */\nexport const check = (value: unknown, schema: unknown): string | undefined => {\n  const admittedSchema = BoundedJson.admit(schema, schemaLimits)\n  if (!admittedSchema.ok) return admittedSchema.complaint\n  const schemaComplaint = validateSchemaAt(admittedSchema.value, [], 0, { visited: 0 })\n  if (schemaComplaint !== undefined) return schemaComplaint\n  const admittedAnswer = BoundedJson.admit(value, answerLimits)\n  if (!admittedAnswer.ok) return admittedAnswer.complaint\n  return checkAt(admittedAnswer.value, admittedSchema.value as Record<string, unknown>, [])\n}\n\ninterface SchemaBudget {\n  visited: number\n}\n\n/** Walks one schema node under a shared depth and node budget. */\nconst validateSchemaAt = (\n  schema: unknown,\n  path: ReadonlyArray<string>,\n  depth: number,\n  budget: SchemaBudget\n): string | undefined => {\n  if (depth > maxSchemaDepth) {\n    return `${at(path)} exceeds the maximum JSON Schema depth of ${maxSchemaDepth}.`\n  }\n  budget.visited++\n  if (budget.visited > maxSchemaNodes) {\n    return `${at(path)} exceeds the maximum JSON Schema node count of ${maxSchemaNodes}.`\n  }\n  if (!isObject(schema)) return `${at(path)} is described by something that is not a JSON Schema object.`\n  const unsupported = Object.keys(schema).find((keyword) => !supportedKeywords.includes(keyword))\n  if (unsupported !== undefined) {\n    return `${at(path)} uses the unsupported JSON Schema keyword \"${truncateDiagnostic(unsupported)}\".`\n  }\n  const enumeration = schema[\"enum\"]\n  if (enumeration !== undefined && !Array.isArray(enumeration)) {\n    return `${at(path)} declares an \"enum\" that is not an array.`\n  }\n  if (Array.isArray(enumeration) && enumeration.length === 0) {\n    return `${at(path)} declares an empty \"enum\".`\n  }\n  if (Object.hasOwn(schema, \"required\")) {\n    const required = schema[\"required\"]\n    if (!Array.isArray(required)) return `${at([...path, \"required\"])} is not an array.`\n    const invalid = required.findIndex((key) => typeof key !== \"string\")\n    if (invalid !== -1) return `${at([...path, \"required\", String(invalid)])} is not a string.`\n    if (new Set(required).size !== required.length) {\n      return `${at([...path, \"required\"])} contains a duplicate property name.`\n    }\n  }\n  if (Object.hasOwn(schema, \"nullable\") && typeof schema[\"nullable\"] !== \"boolean\") {\n    return `${at([...path, \"nullable\"])} is not a boolean.`\n  }\n  const type = schema[\"type\"]\n  if (type !== undefined && (typeof type !== \"string\" || !supportedTypes.has(type))) {\n    return `${at(path)} declares the unsupported JSON Schema type ${renderDiagnostic(type)}.`\n  }\n  for (const keyword of [\"description\", \"title\"] as const) {\n    if (Object.hasOwn(schema, keyword) && typeof schema[keyword] !== \"string\") {\n      return `${at([...path, keyword])} is not a string.`\n    }\n  }\n  const properties = schema[\"properties\"]\n  if (properties !== undefined) {\n    if (!isObject(properties)) return `${at(path)} declares \"properties\" that is not an object.`\n    for (const [key, property] of Object.entries(properties)) {\n      const complaint = validateSchemaAt(property, [...path, key], depth + 1, budget)\n      if (complaint !== undefined) return complaint\n    }\n  }\n  const items = schema[\"items\"]\n  return items === undefined ? undefined : validateSchemaAt(items, [...path, \"items\"], depth + 1, budget)\n}\n\n/**\n * Checks that a JSON Schema stays inside the bounded subset, at every depth.\n *\n * Returns the first reason the schema is out of bounds, or `undefined` when the\n * whole tree is inside it.\n *\n * @private\n * @since 1.0.0\n */\nexport const validateSchema = (\n  schema: unknown,\n  path: ReadonlyArray<string>\n): string | undefined => {\n  const admitted = BoundedJson.admit(schema, schemaLimits)\n  return admitted.ok\n    ? validateSchemaAt(admitted.value, path, 0, { visited: 0 })\n    : admitted.complaint\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaA,kBAA6B;AAQtB,MAAM,iBAAiB;AAQvB,MAAM,iBAAiB;AAQvB,MAAM,sBAAsB;AAQ5B,MAAM,sBAAsB;AAQ5B,MAAM,iBAAiB;AAQvB,MAAM,iBAAiB,MAAM;AAQ7B,MAAM,iBAAiB,MAAM;AAQ7B,MAAM,iBAAiB;AAQvB,MAAM,qBAAqB,MAAM;AAQjC,MAAM,kBAAkB,IAAI;AAQ5B,MAAM,iBAAiB;AAQvB,MAAM,qBAAqB;AAGlC,MAAM,iBAAiB,oBAAI,IAAI,CAAC,UAAU,SAAS,UAAU,UAAU,WAAW,WAAW,MAAM,CAAC;AAGpG,MAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAMO,MAAM,qBAAqB,CAAC,aAA6B;AAC9D,QAAM,SAAS,YAAY,aAAa,UAAU,kBAAkB;AACpE,SAAO,OAAO,WAAW,SAAS,SAC9B,SACA,GAAG,MAAM,KAAK,SAAS,SAAS,OAAO,MAAM;AACnD;AAMO,MAAM,mBAAmB,CAAC,UAA2B,YAAY,OAAO,OAAO,kBAAkB;AAQxG,MAAM,uBAAuB,CAAC,WAC5B;AAAA,EACE,OAAO,MAAM,GAAG,kBAAkB,EAAE,IAAI,CAAC,UAAU,YAAY,OAAO,OAAO,kBAAkB,CAAC,EAAE,KAAK,IAAI;AAC7G;AAGF,MAAM,KAAK,CAAC,SACV,KAAK,WAAW,IAAI,eAAe,IAAI,mBAAmB,KAAK,KAAK,GAAG,CAAC,CAAC;AAG3E,MAAM,WAAW,CAAC,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAGrE,MAAM,aAAa,CAAC,MAAe,UAA4B;AAC7D,QAAM,UAA8C,CAAC,CAAC,MAAM,KAAK,CAAC;AAClE,SAAO,QAAQ,SAAS,GAAG;AACzB,UAAM,CAAC,GAAG,CAAC,IAAI,QAAQ,IAAI;AAC3B,QAAI,MAAM,EAAG;AACb,QAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,UAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,OAAQ,QAAO;AACvD,eAAS,QAAQ,EAAE,SAAS,GAAG,SAAS,GAAG,QAAS,SAAQ,KAAK,CAAC,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC,CAAC;AACrF;AAAA,IACF;AACA,QAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAG,QAAO;AACzC,UAAM,QAAQ,OAAO,KAAK,CAAC,EAAE,KAAK;AAClC,UAAM,QAAQ,OAAO,KAAK,CAAC,EAAE,KAAK;AAClC,QAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAC1C,aAAS,QAAQ,MAAM,SAAS,GAAG,SAAS,GAAG,SAAS;AACtD,YAAM,OAAO,MAAM,KAAK;AACxB,YAAM,OAAO,MAAM,KAAK;AACxB,UAAI,SAAS,KAAM,QAAO;AAC1B,cAAQ,KAAK,CAAC,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC;AAAA,IACjC;AAAA,EACF;AACA,SAAO;AACT;AAMO,MAAM,eAAmC;AAAA,EAC9C,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,YAAY;AACd;AAMO,MAAM,eAAmC;AAAA,EAC9C,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,YAAY;AACd;AAsBA,MAAM,UAAU,CACd,OACA,QACA,SACuB;AACvB,QAAM,WAAW,OAAO,UAAU,MAAM;AACxC,QAAM,cAAc,OAAO,MAAM;AACjC,MAAI,gBAAgB,QAAW;AAC7B,UAAM,UAAW,YAAuC,KAAK,CAAC,YAAY,WAAW,SAAS,KAAK,CAAC;AACpG,QAAI,CAAC,QAAS,QAAO,GAAG,GAAG,IAAI,CAAC,mBAAmB,qBAAqB,WAAqC,CAAC;AAAA,EAChH;AACA,QAAM,OAAO,OAAO,MAAM;AAC1B,MAAI,EAAE,YAAY,UAAU,SAAS,SAAS,QAAW;AACvD,UAAM,gBAAgB,SAAS,WAC3B,SAAS,KAAK,IAAI,SAAY,GAAG,GAAG,IAAI,CAAC,wBACzC,SAAS,UACT,MAAM,QAAQ,KAAK,IAAI,SAAY,GAAG,GAAG,IAAI,CAAC,uBAC9C,SAAS,YACT,OAAO,UAAU,KAAK,IAAI,SAAY,GAAG,GAAG,IAAI,CAAC,yBACjD,SAAS,WAET,OAAO,UAAU,WAAW,SAAY,GAAG,GAAG,IAAI,CAAC,uBACnD,SAAS,WACT,OAAO,UAAU,WAAW,SAAY,GAAG,GAAG,IAAI,CAAC,uBACnD,SAAS,YACT,OAAO,UAAU,YAAY,SAAY,GAAG,GAAG,IAAI,CAAC,wBACpD,UAAU,OACV,SACA,GAAG,GAAG,IAAI,CAAC;AACf,QAAI,kBAAkB,OAAW,QAAO;AAAA,EAC1C;AAKA,MAAI,SAAS,KAAK,GAAG;AACnB,UAAM,WAAW,OAAO,UAAU;AAClC,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,YAAM,UAAU,SAAS,KAAK,CAAC,QAAQ,CAAC,OAAO,OAAO,OAAO,GAAa,CAAC;AAC3E,UAAI,YAAY,QAAW;AACzB,eAAO,GAAG,GAAG,IAAI,CAAC,sCAAsC,mBAAmB,OAAO,OAAO,CAAC,CAAC;AAAA,MAC7F;AAAA,IACF;AACA,UAAM,aAAa,OAAO,YAAY;AACtC,QAAI,SAAS,UAAU,GAAG;AACxB,iBAAW,CAAC,KAAK,QAAQ,KAAK,OAAO,QAAQ,UAAU,GAAG;AACxD,YAAI,CAAC,OAAO,OAAO,OAAO,GAAG,EAAG;AAChC,cAAM,YAAY,QAAQ,MAAM,GAAG,GAAG,UAAqC,CAAC,GAAG,MAAM,GAAG,CAAC;AACzF,YAAI,cAAc,OAAW,QAAO;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,QAAQ,OAAO,OAAO;AAC5B,QAAI,UAAU,QAAW;AACvB,iBAAW,CAAC,OAAO,OAAO,KAAK,MAAM,QAAQ,GAAG;AAC9C,cAAM,YAAY,QAAQ,SAAS,OAAkC,CAAC,GAAG,MAAM,OAAO,KAAK,CAAC,CAAC;AAC7F,YAAI,cAAc,OAAW,QAAO;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAMO,MAAM,QAAQ,CAAC,OAAgB,WAAwC;AAC5E,QAAM,iBAAiB,YAAY,MAAM,QAAQ,YAAY;AAC7D,MAAI,CAAC,eAAe,GAAI,QAAO,eAAe;AAC9C,QAAM,kBAAkB,iBAAiB,eAAe,OAAO,CAAC,GAAG,GAAG,EAAE,SAAS,EAAE,CAAC;AACpF,MAAI,oBAAoB,OAAW,QAAO;AAC1C,QAAM,iBAAiB,YAAY,MAAM,OAAO,YAAY;AAC5D,MAAI,CAAC,eAAe,GAAI,QAAO,eAAe;AAC9C,SAAO,QAAQ,eAAe,OAAO,eAAe,OAAkC,CAAC,CAAC;AAC1F;AAOA,MAAM,mBAAmB,CACvB,QACA,MACA,OACA,WACuB;AACvB,MAAI,QAAQ,gBAAgB;AAC1B,WAAO,GAAG,GAAG,IAAI,CAAC,6CAA6C,cAAc;AAAA,EAC/E;AACA,SAAO;AACP,MAAI,OAAO,UAAU,gBAAgB;AACnC,WAAO,GAAG,GAAG,IAAI,CAAC,kDAAkD,cAAc;AAAA,EACpF;AACA,MAAI,CAAC,SAAS,MAAM,EAAG,QAAO,GAAG,GAAG,IAAI,CAAC;AACzC,QAAM,cAAc,OAAO,KAAK,MAAM,EAAE,KAAK,CAAC,YAAY,CAAC,kBAAkB,SAAS,OAAO,CAAC;AAC9F,MAAI,gBAAgB,QAAW;AAC7B,WAAO,GAAG,GAAG,IAAI,CAAC,8CAA8C,mBAAmB,WAAW,CAAC;AAAA,EACjG;AACA,QAAM,cAAc,OAAO,MAAM;AACjC,MAAI,gBAAgB,UAAa,CAAC,MAAM,QAAQ,WAAW,GAAG;AAC5D,WAAO,GAAG,GAAG,IAAI,CAAC;AAAA,EACpB;AACA,MAAI,MAAM,QAAQ,WAAW,KAAK,YAAY,WAAW,GAAG;AAC1D,WAAO,GAAG,GAAG,IAAI,CAAC;AAAA,EACpB;AACA,MAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AACrC,UAAM,WAAW,OAAO,UAAU;AAClC,QAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG,QAAO,GAAG,GAAG,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;AACjE,UAAM,UAAU,SAAS,UAAU,CAAC,QAAQ,OAAO,QAAQ,QAAQ;AACnE,QAAI,YAAY,GAAI,QAAO,GAAG,GAAG,CAAC,GAAG,MAAM,YAAY,OAAO,OAAO,CAAC,CAAC,CAAC;AACxE,QAAI,IAAI,IAAI,QAAQ,EAAE,SAAS,SAAS,QAAQ;AAC9C,aAAO,GAAG,GAAG,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;AAAA,IACrC;AAAA,EACF;AACA,MAAI,OAAO,OAAO,QAAQ,UAAU,KAAK,OAAO,OAAO,UAAU,MAAM,WAAW;AAChF,WAAO,GAAG,GAAG,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;AAAA,EACrC;AACA,QAAM,OAAO,OAAO,MAAM;AAC1B,MAAI,SAAS,WAAc,OAAO,SAAS,YAAY,CAAC,eAAe,IAAI,IAAI,IAAI;AACjF,WAAO,GAAG,GAAG,IAAI,CAAC,8CAA8C,iBAAiB,IAAI,CAAC;AAAA,EACxF;AACA,aAAW,WAAW,CAAC,eAAe,OAAO,GAAY;AACvD,QAAI,OAAO,OAAO,QAAQ,OAAO,KAAK,OAAO,OAAO,OAAO,MAAM,UAAU;AACzE,aAAO,GAAG,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC;AAAA,IAClC;AAAA,EACF;AACA,QAAM,aAAa,OAAO,YAAY;AACtC,MAAI,eAAe,QAAW;AAC5B,QAAI,CAAC,SAAS,UAAU,EAAG,QAAO,GAAG,GAAG,IAAI,CAAC;AAC7C,eAAW,CAAC,KAAK,QAAQ,KAAK,OAAO,QAAQ,UAAU,GAAG;AACxD,YAAM,YAAY,iBAAiB,UAAU,CAAC,GAAG,MAAM,GAAG,GAAG,QAAQ,GAAG,MAAM;AAC9E,UAAI,cAAc,OAAW,QAAO;AAAA,IACtC;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,OAAO;AAC5B,SAAO,UAAU,SAAY,SAAY,iBAAiB,OAAO,CAAC,GAAG,MAAM,OAAO,GAAG,QAAQ,GAAG,MAAM;AACxG;AAWO,MAAM,iBAAiB,CAC5B,QACA,SACuB;AACvB,QAAM,WAAW,YAAY,MAAM,QAAQ,YAAY;AACvD,SAAO,SAAS,KACZ,iBAAiB,SAAS,OAAO,MAAM,GAAG,EAAE,SAAS,EAAE,CAAC,IACxD,SAAS;AACf;",
+  "names": []
+}

package/dist/cjs/internal/OutcomeMarker.d.ts

@@ -0,0 +1,18 @@
+/**
+ * The two markers that let `Flow.isOutcome` tell an authored `done`/`to`/`park`
+ * from ordinary data. `Flow/Outcome.ts` stamps the node marker, `Graph.build`
+ * and the interpreter stamp the value marker, and `isOutcome` reads it.
+ *
+ * @since 0.1.0
+ */
+/** Stamped on the AST of a node built by `done`/`to`/`park`.
+ * @private
+ * @since 0.1.0
+ */
+export declare const OutcomeNodeTypeId: unique symbol;
+/** Stamped on a resolved outcome value.
+ * @private
+ * @since 0.1.0
+ */
+export declare const OutcomeValueTypeId: unique symbol;
+//# sourceMappingURL=OutcomeMarker.d.ts.map

package/dist/cjs/internal/OutcomeMarker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OutcomeMarker.d.ts","sourceRoot":"","sources":["../../../src/internal/OutcomeMarker.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,eAAO,MAAM,iBAAiB,EAAE,OAAO,MAAoD,CAAA;AAE3F;;;GAGG;AACH,eAAO,MAAM,kBAAkB,EAAE,OAAO,MAAqD,CAAA"}

package/dist/cjs/internal/OutcomeMarker.js

@@ -0,0 +1,27 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var OutcomeMarker_exports = {};
+__export(OutcomeMarker_exports, {
+  OutcomeNodeTypeId: () => OutcomeNodeTypeId,
+  OutcomeValueTypeId: () => OutcomeValueTypeId
+});
+module.exports = __toCommonJS(OutcomeMarker_exports);
+const OutcomeNodeTypeId = /* @__PURE__ */ Symbol.for("@smthrs/flow/Flow/OutcomeNode");
+const OutcomeValueTypeId = /* @__PURE__ */ Symbol.for("@smthrs/flow/Flow/OutcomeValue");
+//# sourceMappingURL=OutcomeMarker.js.map

package/dist/cjs/internal/OutcomeMarker.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/internal/OutcomeMarker.ts"],
+  "sourcesContent": ["/**\n * The two markers that let `Flow.isOutcome` tell an authored `done`/`to`/`park`\n * from ordinary data. `Flow/Outcome.ts` stamps the node marker, `Graph.build`\n * and the interpreter stamp the value marker, and `isOutcome` reads it.\n *\n * @since 0.1.0\n */\n\n/** Stamped on the AST of a node built by `done`/`to`/`park`.\n * @private\n * @since 0.1.0\n */\nexport const OutcomeNodeTypeId: unique symbol = Symbol.for(\"@smthrs/flow/Flow/OutcomeNode\")\n\n/** Stamped on a resolved outcome value.\n * @private\n * @since 0.1.0\n */\nexport const OutcomeValueTypeId: unique symbol = Symbol.for(\"@smthrs/flow/Flow/OutcomeValue\")\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYO,MAAM,oBAAmC,uBAAO,IAAI,+BAA+B;AAMnF,MAAM,qBAAoC,uBAAO,IAAI,gCAAgC;",
+  "names": []
+}

package/dist/cjs/package.json

@@ -0,0 +1 @@
+{"type":"commonjs"}

package/dist/esm/Action/Action.d.ts

@@ -0,0 +1,250 @@
+/**
+ * Defines the schemas and interfaces of a durable action.
+ *
+ * @since 0.1.0
+ */
+import * as Effects from "@smthrs/plan/Effects";
+import type * as Node from "@smthrs/plan/Node";
+import type * as Planned from "@smthrs/plan/Planned";
+import type * as Context from "effect/Context";
+import type * as Crypto from "effect/Crypto";
+import type * as Effect from "effect/Effect";
+import type * as Layer from "effect/Layer";
+import * as Schema from "effect/Schema";
+import type { Scope } from "effect/Scope";
+import type { AnyStructSchema } from "../Flow/Flow.ts";
+import type { FlowInstance, FlowRuntime } from "../FlowRuntime/index.ts";
+import type * as RetryPolicy from "../RetryPolicy.ts";
+import type { FileBoundary } from "./FileBoundary.ts";
+import type { Implementation } from "./Implementations.ts";
+import type { TypeId } from "./TypeId.ts";
+/**
+ * The durability and retry semantics of an action.
+ *
+ * The schema is `@smthrs/plan`'s `Effects.Tier`: an action's durability, a
+ * declared envelope's ceiling and `KeyMaterial.kind` are the same three words,
+ * and they are declared once.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export declare const Tier: Schema.Literals<readonly ["sealed", "compensable", "irreversible"]>;
+/**
+ * The durability and retry semantics of an action.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type Tier = Effects.Tier;
+/**
+ * Schema for caller-declared sealed action identity.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export declare const IdempotencyKey: Schema.Union<readonly [Schema.String, Schema.$Record<Schema.String, Schema.Codec<Schema.Json, Schema.Json, never, never>>]>;
+/**
+ * Caller-declared sealed action identity.
+ *
+ * A string is namespaced by the action declaration. A JSON object is
+ * caller-owned and remains stable across action renames. Runtime
+ * environment and filesystem facts are always added by the engine. An explicit
+ * implementation version is also separate engine key material; a caller-owned
+ * object cannot mask it with a field of the same name.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type IdempotencyKey = typeof IdempotencyKey.Type;
+/**
+ * Recursively permits planned references wherever a declared action payload
+ * accepts a concrete value.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type PlannedPayload<T> = Planned.Planned<T> | ([T] extends [ReadonlyArray<infer Value>] ? ReadonlyArray<PlannedPayload<Value>> : [T] extends [object] ? {
+    readonly [Key in keyof T]: PlannedPayload<T[Key]>;
+} : T);
+/**
+ * The requirement one declared action mints for itself, identified by its
+ * tag.
+ *
+ * A declaration is data that travels everywhere and carries no code, so a body
+ * that calls it names an implementation it does not hold. This type is that
+ * "does not hold", stated to the compiler: `Charge.call(...)` produces a node
+ * requiring `Requirement<"payments/Charge">`, `Charge.toLayer(...)` produces a
+ * layer providing it, and `Flow.execute` is where the two have to meet. It is
+ * phantom — nothing reads it, and nothing about planning, keying, or replay
+ * changes with it.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export interface Requirement<Tag extends string> {
+    readonly _: unique symbol;
+    readonly _tag: Tag;
+}
+/**
+ * A named action declaration whose implementation is supplied separately
+ * through a layer and whose calls only add nodes to a plan.
+ *
+ * `Requires` is what `.call()` puts in the requirement channel of the node it
+ * records. It is this action's own {@link Requirement} for an ordinary
+ * declaration, and `never` for a system declaration the engine itself
+ * implements ({@link module:make.makeSystem}).
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export interface Declared<Tag extends string, Payload extends AnyStructSchema, Success extends Schema.Top, Error extends Schema.Top, Requires = Requirement<Tag>> {
+    readonly [TypeId]: typeof TypeId;
+    readonly name: Tag;
+    /**
+     * Semantic implementation identity. Changing it requires a newly planned
+     * execution; it is not an in-place upgrade of a persisted run. Canonical
+     * composition requires it for sealed actions with an idempotency key.
+     * Invocation-scoped actions may omit it; low-level keyed legacy callers
+     * retain their old handler-reuse contract when it is absent.
+     */
+    readonly implementationVersion: string | undefined;
+    readonly payloadSchema: Payload;
+    readonly successSchema: Success;
+    readonly errorSchema: Error;
+    readonly tier: Tier;
+    readonly idempotencyKey: IdempotencyKey | ((payload: Payload["Type"]) => IdempotencyKey) | undefined;
+    /** Allows multiple legitimate sealed results to race under one cache key. */
+    readonly nondeterministic: true | undefined;
+    /** Durable retry policy applied to every implementation invocation. */
+    readonly retryPolicy: RetryPolicy.RetryPolicy | undefined;
+    /** Milliseconds one attempt may run before it fails with `AttemptTimedOut`. */
+    readonly attemptTimeoutMs: number | undefined;
+    /** Milliseconds one attempt may go without `Action.heartbeat` before it fails. */
+    readonly heartbeatTimeoutMs: number | undefined;
+    /** Filesystem declaration, optionally derived from the decoded payload. */
+    readonly fileBoundary: FileBoundary | ((payload: Payload["Type"]) => FileBoundary) | undefined;
+    readonly annotations: Context.Context<never>;
+    /**
+     * The context key this declaration's implementation is provided under, and
+     * the identity behind {@link Requirement}.
+     *
+     * `toLayer` provides it; a composition that would rather hand the runtime an
+     * implementation directly can provide it itself with `Layer.succeed`. Its
+     * string key is derived from the action tag, so two declarations of one tag
+     * name one slot.
+     */
+    readonly requirement: Context.Service<Requirement<Tag>, Implementation>;
+    annotate<I, S>(key: Context.Key<I, S>, value: S): Declared<Tag, Payload, Success, Error, Requires>;
+    annotateMerge<I>(annotations: Context.Context<I>): Declared<Tag, Payload, Success, Error, Requires>;
+    readonly call: (payload: PlannedPayload<Payload["~type.make.in"]>) => Node.Node<Success["Type"], Error["Type"], Requires>;
+    /**
+     * Attaches the implementation and yields the layer that provides this
+     * declaration's {@link Requirement}. A versioned declaration requires the
+     * same `implementationVersion` here; a mismatch throws
+     * `ImplementationVersionMismatch` before registration. The version must cover
+     * handler semantics and semantic service/configuration changes, not merely a
+     * package publication label. Source text is never inferred as that identity.
+     *
+     * Let inference name the returned layer's requirements. The requirement
+     * channel is what a composition trusts: a layer type that under-declares it
+     * still typechecks at `Effect.provide` and dies at runtime as a missing
+     * service. A concrete hand annotation cannot lie — dropping a service from
+     * it is a compile error — but a GENERIC one can: when the annotated
+     * requirement union keeps a deferred member such as
+     * `Output["DecodingServices"]` (constrained only as `unknown` through
+     * `Schema.Top`), TypeScript lets that member absorb every concrete service
+     * the annotation dropped, and the drop compiles. A wrapper that must
+     * annotate — a public interface naming its layer's type, say — therefore
+     * pins the set at a concrete instantiation, where the check works again:
+     *
+     * ```ts
+     * // Wrapped.layer is the wrapper's hand-annotated toLayer result, held
+     * // here with every schema argument concrete.
+     * type Needed = Layer.Services<typeof Wrapped.layer>
+     * expectTypeOf<Meter extends Needed ? true : false>().toEqualTypeOf<true>()
+     * ```
+     */
+    readonly toLayer: <R>(execute: (payload: Payload["Type"]) => Effect.Effect<Success["Type"], Error["Type"], R>, options?: {
+        readonly override?: boolean;
+        /** Must exactly match the declaration, including absence on legacy declarations. */
+        readonly implementationVersion?: string | undefined;
+    }) => Layer.Layer<Requires, never, FlowRuntime | Exclude<R, FlowRuntime | FlowInstance | Scope> | Payload["DecodingServices"] | Payload["EncodingServices"] | Success["DecodingServices"] | Success["EncodingServices"] | Error["DecodingServices"] | Error["EncodingServices"]>;
+}
+/**
+ * Durable flow action that behaves as an `Effect` and records its name,
+ * result schemas, annotations, and encoded execution form for the flow
+ * engine.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export interface Action<Success extends Schema.Constraint = Schema.Void, Error extends Schema.Constraint = Schema.Never, R = never> extends Effect.Effect<Success["Type"], Error["Type"], Success["DecodingServices"] | Error["DecodingServices"] | R | Crypto.Crypto | FlowRuntime | FlowInstance> {
+    readonly [TypeId]: typeof TypeId;
+    readonly name: string;
+    readonly implementationVersion?: string | undefined;
+    readonly successSchema: Success;
+    readonly errorSchema: Error;
+    readonly exitSchema: Schema.Exit<Success, Error, Schema.Defect>;
+    readonly exitSchemaPartial: Schema.Exit<Success, Error, Schema.Unknown>;
+    readonly annotations: Context.Context<never>;
+    readonly tier: Tier;
+    readonly idempotencyKey: IdempotencyKey | undefined;
+    /** Allows multiple legitimate sealed results to race under one cache key. */
+    readonly nondeterministic: true | undefined;
+    readonly metadata: unknown;
+    /** Typed filesystem boundary used by the durable engine. */
+    readonly fileBoundary: FileBoundary | undefined;
+    readonly retryPolicy: RetryPolicy.RetryPolicy | undefined;
+    /** Milliseconds one attempt may run before it fails with `AttemptTimedOut`. */
+    readonly attemptTimeoutMs: number | undefined;
+    /** Milliseconds one attempt may go without `Action.heartbeat` before it fails. */
+    readonly heartbeatTimeoutMs: number | undefined;
+    annotate<I, S>(key: Context.Key<I, S>, value: S): Action<Success, Error, R>;
+    annotateMerge<I>(annotations: Context.Context<I>): Action<Success, Error, R>;
+    readonly execute: Effect.Effect<Success["Type"], Error["Type"], Success["DecodingServices"] | Success["EncodingServices"] | Error["DecodingServices"] | Error["EncodingServices"] | R | Crypto.Crypto | Scope | FlowRuntime | FlowInstance>;
+    readonly executeEncoded: Effect.Effect<unknown, unknown, Success["DecodingServices"] | Success["EncodingServices"] | Error["DecodingServices"] | Error["EncodingServices"] | R | Crypto.Crypto | Scope | FlowRuntime | FlowInstance>;
+}
+/**
+ * Type-erased action shape for APIs that only need the action identity,
+ * name, annotations, and encoded execution.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export interface Any {
+    readonly [TypeId]: typeof TypeId;
+    readonly name: string;
+    readonly implementationVersion?: string | undefined;
+    readonly executeEncoded: Effect.Effect<any, any, any>;
+    readonly annotations: Context.Context<never>;
+    readonly tier: Tier;
+    readonly idempotencyKey: IdempotencyKey | undefined;
+    readonly nondeterministic: true | undefined;
+    readonly metadata: unknown;
+    /** Typed filesystem boundary used by the durable engine. */
+    readonly fileBoundary: FileBoundary | undefined;
+    readonly retryPolicy: RetryPolicy.RetryPolicy | undefined;
+}
+/**
+ * Type-erased action shape that also exposes success and error schemas for
+ * derived flow APIs.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export interface AnyWithProps {
+    readonly [TypeId]: typeof TypeId;
+    readonly name: string;
+    readonly implementationVersion?: string | undefined;
+    readonly successSchema: Schema.Top;
+    readonly errorSchema: Schema.Top;
+    readonly executeEncoded: Effect.Effect<any, any, any>;
+    readonly tier: Tier;
+    readonly idempotencyKey: IdempotencyKey | undefined;
+    readonly nondeterministic: true | undefined;
+    readonly metadata: unknown;
+    /** Typed filesystem boundary used by the durable engine. */
+    readonly fileBoundary: FileBoundary | undefined;
+    readonly retryPolicy: RetryPolicy.RetryPolicy | undefined;
+}
+//# sourceMappingURL=Action.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Action.d.ts","sourceRoot":"","sources":["../../../src/Action/Action.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,OAAO,MAAM,sBAAsB,CAAA;AAC/C,OAAO,KAAK,KAAK,IAAI,MAAM,mBAAmB,CAAA;AAC9C,OAAO,KAAK,KAAK,OAAO,MAAM,sBAAsB,CAAA;AACpD,OAAO,KAAK,KAAK,OAAO,MAAM,gBAAgB,CAAA;AAC9C,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAA;AAC5C,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAA;AAC5C,OAAO,KAAK,KAAK,KAAK,MAAM,cAAc,CAAA;AAC1C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAA;AACtD,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAA;AACxE,OAAO,KAAK,KAAK,WAAW,MAAM,mBAAmB,CAAA;AACrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AAC1D,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAA;AAEzC;;;;;;;;;GASG;AACH,eAAO,MAAM,IAAI,qEAAe,CAAA;AAEhC;;;;;GAKG;AACH,MAAM,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAA;AAE/B;;;;;GAKG;AACH,eAAO,MAAM,cAAc,6HAGzB,CAAA;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,cAAc,GAAG,OAAO,cAAc,CAAC,IAAI,CAAA;AAEvD;;;;;;GAMG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,IACxB,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAClB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,GAC9E,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG;IAAE,QAAQ,EAAE,GAAG,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CAAE,GAC5E,CAAC,CAAC,CAAA;AAER;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,WAAW,CAAC,GAAG,SAAS,MAAM;IAC7C,QAAQ,CAAC,CAAC,EAAE,OAAO,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAA;CACnB;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,QAAQ,CACvB,GAAG,SAAS,MAAM,EAClB,OAAO,SAAS,eAAe,EAC/B,OAAO,SAAS,MAAM,CAAC,GAAG,EAC1B,KAAK,SAAS,MAAM,CAAC,GAAG,EACxB,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC;IAE3B,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAA;IAClB;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,MAAM,GAAG,SAAS,CAAA;IAClD,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,WAAW,EAAE,KAAK,CAAA;IAC3B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,cAAc,EAAE,cAAc,GAAG,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK,cAAc,CAAC,GAAG,SAAS,CAAA;IACpG,6EAA6E;IAC7E,QAAQ,CAAC,gBAAgB,EAAE,IAAI,GAAG,SAAS,CAAA;IAC3C,uEAAuE;IACvE,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,GAAG,SAAS,CAAA;IACzD,+EAA+E;IAC/E,QAAQ,CAAC,gBAAgB,EAAE,MAAM,GAAG,SAAS,CAAA;IAC7C,kFAAkF;IAClF,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,SAAS,CAAA;IAC/C,2EAA2E;IAC3E,QAAQ,CAAC,YAAY,EAAE,YAAY,GAAG,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK,YAAY,CAAC,GAAG,SAAS,CAAA;IAC9F,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAC5C;;;;;;;;OAQG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAA;IACvE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;IAClG,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;IACnG,QAAQ,CAAC,IAAI,EAAE,CACb,OAAO,EAAE,cAAc,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,KAC9C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAA;IACxD;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACH,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,EAClB,OAAO,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EACvF,OAAO,CAAC,EAAE;QACR,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAA;QAC3B,oFAAoF;QACpF,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;KACpD,KACE,KAAK,CAAC,KAAK,CACd,QAAQ,EACR,KAAK,EACH,WAAW,GACX,OAAO,CAAC,CAAC,EAAE,WAAW,GAAG,YAAY,GAAG,KAAK,CAAC,GAC9C,OAAO,CAAC,kBAAkB,CAAC,GAC3B,OAAO,CAAC,kBAAkB,CAAC,GAC3B,OAAO,CAAC,kBAAkB,CAAC,GAC3B,OAAO,CAAC,kBAAkB,CAAC,GAC3B,KAAK,CAAC,kBAAkB,CAAC,GACzB,KAAK,CAAC,kBAAkB,CAAC,CAC5B,CAAA;CACF;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,MAAM,CACrB,OAAO,SAAS,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,IAAI,EAC/C,KAAK,SAAS,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,EAC9C,CAAC,GAAG,KAAK,CACT,SACA,MAAM,CAAC,MAAM,CACX,OAAO,CAAC,MAAM,CAAC,EACf,KAAK,CAAC,MAAM,CAAC,EACX,OAAO,CAAC,kBAAkB,CAAC,GAC3B,KAAK,CAAC,kBAAkB,CAAC,GACzB,CAAC,GACD,MAAM,CAAC,MAAM,GACb,WAAW,GACX,YAAY,CACf;IAED,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnD,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,WAAW,EAAE,KAAK,CAAA;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;IAC/D,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAA;IACvE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAC5C,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,cAAc,EAAE,cAAc,GAAG,SAAS,CAAA;IACnD,6EAA6E;IAC7E,QAAQ,CAAC,gBAAgB,EAAE,IAAI,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,EAAE,YAAY,GAAG,SAAS,CAAA;IAC/C,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,GAAG,SAAS,CAAA;IACzD,+EAA+E;IAC/E,QAAQ,CAAC,gBAAgB,EAAE,MAAM,GAAG,SAAS,CAAA;IAC7C,kFAAkF;IAClF,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,SAAS,CAAA;IAC/C,QAAQ,CAAC,CAAC,EAAE,CAAC,EACX,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,KAAK,EAAE,CAAC,GACP,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;IAC5B,aAAa,CAAC,CAAC,EACb,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAC9B,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAC7B,OAAO,CAAC,MAAM,CAAC,EACf,KAAK,CAAC,MAAM,CAAC,EACX,OAAO,CAAC,kBAAkB,CAAC,GAC3B,OAAO,CAAC,kBAAkB,CAAC,GAC3B,KAAK,CAAC,kBAAkB,CAAC,GACzB,KAAK,CAAC,kBAAkB,CAAC,GACzB,CAAC,GACD,MAAM,CAAC,MAAM,GACb,KAAK,GACL,WAAW,GACX,YAAY,CACf,CAAA;IACD,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC,MAAM,CACpC,OAAO,EACP,OAAO,EACL,OAAO,CAAC,kBAAkB,CAAC,GAC3B,OAAO,CAAC,kBAAkB,CAAC,GAC3B,KAAK,CAAC,kBAAkB,CAAC,GACzB,KAAK,CAAC,kBAAkB,CAAC,GACzB,CAAC,GACD,MAAM,CAAC,MAAM,GACb,KAAK,GACL,WAAW,GACX,YAAY,CACf,CAAA;CACF;AAED;;;;;;GAMG;AACH,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnD,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IACrD,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAC5C,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,cAAc,EAAE,cAAc,GAAG,SAAS,CAAA;IACnD,QAAQ,CAAC,gBAAgB,EAAE,IAAI,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,EAAE,YAAY,GAAG,SAAS,CAAA;IAC/C,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,GAAG,SAAS,CAAA;CAC1D;AAED;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC,GAAG,CAAA;IAClC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,GAAG,CAAA;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IACrD,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,cAAc,EAAE,cAAc,GAAG,SAAS,CAAA;IACnD,QAAQ,CAAC,gBAAgB,EAAE,IAAI,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,EAAE,YAAY,GAAG,SAAS,CAAA;IAC/C,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,GAAG,SAAS,CAAA;CAC1D"}

package/dist/esm/Action/Action.js

@@ -0,0 +1,30 @@
+// Deep reviewed and polished by a human on 2026-08-10.
+/**
+ * Defines the schemas and interfaces of a durable action.
+ *
+ * @since 0.1.0
+ */
+import * as Effects from "@smthrs/plan/Effects";
+import * as Schema from "effect/Schema";
+/**
+ * The durability and retry semantics of an action.
+ *
+ * The schema is `@smthrs/plan`'s `Effects.Tier`: an action's durability, a
+ * declared envelope's ceiling and `KeyMaterial.kind` are the same three words,
+ * and they are declared once.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export const Tier = Effects.Tier;
+/**
+ * Schema for caller-declared sealed action identity.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export const IdempotencyKey = Schema.Union([
+    Schema.String,
+    Schema.Record(Schema.String, Schema.Json)
+]);
+//# sourceMappingURL=Action.js.map