@voltro/workflow 0.70.0 → 0.71.0

package/dist/index.js

@@ -1,4 +1,4 @@
-import { A as e, B as t, C as n, D as r, E as i, G as a, H as o, I as s, L as c, M as l, N as u, O as d, P as f, R as p, S as m, T as h, U as g, V as _, W as v, _ as y, a as b, b as x, c as S, d as C, f as w, g as T, h as E, i as D, j as O, k, l as A, m as j, n as M, o as N, p as P, r as F, s as I, t as L, u as R, v as z, w as B, x as V, y as H, z as U } from "./primitives-CqHxfASq.js";
-import { $ as W, A as G, At as K, B as q, Bt as J, C as Y, Ct as X, D as Z, Dt as Q, E as $, Et as ee, F as te, Ft as ne, G as re, H as ie, I as ae, It as oe, J as se, K as ce, L as le, Lt as ue, M as de, Mt as fe, N as pe, Nt as me, O as he, Ot as ge, P as _e, Pt as ve, Q as ye, R as be, Rt as xe, S as Se, St as Ce, T as we, Tt as Te, U as Ee, V as De, Vt as Oe, W as ke, X as Ae, Y as je, Z as Me, _ as Ne, _t as Pe, a as Fe, at as Ie, b as Le, bt as Re, c as ze, ct as Be, d as Ve, dt as He, et as Ue, f as We, ft as Ge, g as Ke, gt as qe, h as Je, ht as Ye, i as Xe, it as Ze, j as Qe, jt as $e, k as et, kt as tt, l as nt, lt as rt, m as it, mt as at, n as ot, nt as st, o as ct, ot as lt, p as ut, pt as dt, q as ft, r as pt, rt as mt, s as ht, st as gt, t as _t, tt as vt, u as yt, ut as bt, v as xt, vt as St, w as Ct, wt, x as Tt, xt as Et, y as Dt, yt as Ot, z as kt, zt as At } from "./src-TRpoU54e.js";
-import { n as jt, r as Mt, t as Nt } from "./clusterDiagnostics-CNtl5LX9.js";
-export { mt as ADMISSIONS_TABLE, ut as BUDGET_HOLDS_TABLE, it as BudgetHoldExpired, ke as CANCEL_ON_WATERMARK, Nt as CLUSTER_REREAD_WINDOW_MS, jt as ClusterDiagnostics, l as CurrentWorkflowExecutionId, u as CurrentWorkflowPatches, B as CurrentWorkflowReplayShape, f as CurrentWorkflowRunId, Je as DEFAULT_BUDGET_HOLD_TIMEOUT_MS, re as DEFAULT_COLD_LOOKBACK_MS, be as DEFAULT_DRAIN_BATCH, ce as DEFAULT_EVENT_BATCH, Ze as DEFAULT_LEASE_MS, Xe as DEFAULT_MAX_RUN_RECLAIMS, Fe as DEFAULT_REPLAY_SHAPE_LIMIT, q as DEFAULT_STALL_AFTER_MS, De as DEFAULT_STALL_EVENT_LOOKBACK, ie as DEFAULT_STALL_RUN_PAGE, pe as DEFAULT_SUSPEND_HINT_MS, d as DEFAULT_WORKFLOW_SCHEDULE_MAX_RUNTIME_MS, t as DEFERRING_CONTROLS, ft as EVENTS_TABLE, ee as FlowControlKeyError, Ie as PAUSES_TABLE, lt as PENDING_TABLE, se as WATERMARKS_TABLE, L as WorkflowFlowControlProperty, M as WorkflowMessagesProperty, s as WorkflowRunRecorder, k as WorkflowScheduleProperty, c as WorkflowStepInterceptorTag, F as WorkflowVersionTypeId, D as WorkflowWorkerLayerTypeId, Ke as _voltroBudgetHoldsTable, ve as _voltroWorkflowAdmissionsTable, ne as _voltroWorkflowPausesTable, oe as _voltroWorkflowPendingTable, xe as _voltroWorkflowRunEventsTable, At as _voltroWorkflowRunStepsTable, J as _voltroWorkflowRunsTable, ue as _voltroWorkflowStartContextsTable, Ue as _voltroWorkflowWatermarksTable, vt as admitStart, gt as allIntents, _ as assertConsistentPools, Qe as awaitEvent, de as awaitSignal, Ct as awaitSignalSuspending, We as awaitUpdate, Ne as budgetHoldGeneration, xt as budgetHoldKey, Dt as budgetHoldSignalName, pt as closeWorkflowChildrenForParent, Q as comparePendingOrder, we as completeSuspendingSignal, Be as deadLetterIntent, ge as decideAdmission, o as deferringControlsOf, rt as deleteIntent, Mt as describeStalledRun, bt as discardIntent, kt as drainTick, He as dueIntents, b as durableClock, N as durableQueue, I as durableQueueModule, S as durableRateLimiterModule, Ge as evaluateAdmission, p as getCurrentWorkflowExecutionId, U as getCurrentWorkflowRunId, A as getWorkflowFlowControl, e as getWorkflowSchedule, R as getWorkflowVersionMetadata, g as hasCancelOn, v as hasFlowControl, Le as heldBudgets, Oe as inMemoryWorkflowEngineLayer, ot as inspectWorkflow, tt as isFinishExpired, K as isStartExpired, C as isWorkflowWorkerLayer, st as linkExecution, _t as makeInMemoryRecorder, h as makeReplayShapeTracker, ct as makeWorkflowRunRecorder, Z as makeWorkflowUpdateId, _e as maybeHintSuspendingSignal, ye as newestEventAt, $e as nextSlotAt, i as nondeterminismEventPayload, ht as normaliseWorkflowPatches, dt as noteIntentAttempt, at as parkDelayedStart, w as patch, Ye as pauseWorkflow, Tt as pendingBudgetHolds, qe as pendingSlotId, Pe as pendingWindow, St as persistDefer, W as planCancellations, fe as pooledConcurrencyKey, P as processQueue, Ot as pruneAdmissions, j as queueWorker, E as rateLimit, Re as readAdmissionState, Et as readPausedWorkflows, je as readWatermark, Ce as recordAdmission, Se as releaseBudgetHolds, X as releaseLease, r as reportNondeterminism, te as resetSuspendHintsForTest, me as resolveAdmissionKeys, ze as resolveRunGuardTuning, ae as resolveSuspendHintMs, he as resolveWorkflowMessageRun, wt as resumeWorkflow, Te as retryDeadLetterIntent, et as sendWorkflowSignal, G as sendWorkflowUpdate, nt as serialiseWorkflowRowForWire, le as setSuspendSignalHintMs, T as sleep, y as sleepUntil, z as step, H as stepIdempotencyKey, x as stepModule, Y as suspendForBudget, $ as suspendingSignalDeferredName, Ae as sweepCancelOn, Ee as sweepStalledRuns, yt as truncateWorkflowValue, a as validateFlowControl, O as validateWorkflowSchedule, V as withCompensation, m as workflow, n as workflowModule, Ve as wrapWorkflowExecuteWithRunRecording, Me as writeWatermark };
+import { A as e, B as t, C as n, D as r, E as i, F as a, G as o, H as s, K as c, L as l, M as u, O as d, P as f, R as p, S as m, T as h, U as g, V as _, W as v, _ as y, a as b, b as x, c as S, d as C, f as w, g as T, h as E, i as D, j as O, k, l as A, m as j, n as M, o as N, p as P, q as F, r as I, s as L, t as R, u as z, v as B, w as V, x as H, y as U, z as W } from "./primitives-DsMsMr5S.js";
+import { $ as G, $t as K, A as q, At as J, B as Y, Bt as X, C as Z, Ct as Q, D as $, Dt as ee, E as te, Et as ne, F as re, Ft as ie, G as ae, Gt as oe, H as se, Ht as ce, I as le, It as ue, J as de, Jt as fe, K as pe, Kt as me, L as he, Lt as ge, M as _e, Mt as ve, N as ye, Nt as be, O as xe, Ot as Se, P as Ce, Pt as we, Q as Te, Qt as Ee, R as De, Rt as Oe, S as ke, St as Ae, T as je, Tt as Me, U as Ne, Ut as Pe, V as Fe, Vt as Ie, W as Le, Wt as Re, X as ze, Xt as Be, Y as Ve, Yt as He, Z as Ue, Zt as We, _ as Ge, _n as Ke, _t as qe, a as Je, an as Ye, at as Xe, b as Ze, bn as Qe, bt as $e, c as et, cn as tt, ct as nt, d as rt, dn as it, dt as at, en as ot, et as st, f as ct, fn as lt, ft as ut, g as dt, gn as ft, gt as pt, h as mt, hn as ht, ht as gt, i as _t, in as vt, it as yt, j as bt, jt as xt, k as St, kt as Ct, l as wt, ln as Tt, lt as Et, m as Dt, mn as Ot, mt as kt, n as At, nn as jt, nt as Mt, o as Nt, on as Pt, ot as Ft, p as It, pn as Lt, pt as Rt, q as zt, qt as Bt, r as Vt, rn as Ht, rt as Ut, s as Wt, sn as Gt, st as Kt, t as qt, tn as Jt, tt as Yt, u as Xt, un as Zt, ut as Qt, v as $t, vn as en, vt as tn, w as nn, wt as rn, x as an, xt as on, y as sn, yn as cn, yt as ln, z as un, zt as dn } from "./src-OEBqLBJl.js";
+import { c as fn, l as pn, n as mn, p as hn, r as gn, s as _n, t as vn } from "./clusterDiagnostics-jpkNVay6.js";
+export { ut as ADMISSIONS_TABLE, ct as BUDGET_HOLDS_TABLE, It as BudgetHoldExpired, Le as CANCEL_ON_WATERMARK, vn as CLUSTER_REREAD_WINDOW_MS, mn as ClusterDiagnostics, u as CurrentWorkflowExecutionId, f as CurrentWorkflowPatches, V as CurrentWorkflowReplayShape, a as CurrentWorkflowRunId, Dt as DEFAULT_BUDGET_HOLD_TIMEOUT_MS, ae as DEFAULT_COLD_LOOKBACK_MS, he as DEFAULT_DRAIN_BATCH, pe as DEFAULT_EVENT_BATCH, Rt as DEFAULT_LEASE_MS, qt as DEFAULT_MAX_RUN_RECLAIMS, At as DEFAULT_REPLAY_SHAPE_LIMIT, Y as DEFAULT_STALL_AFTER_MS, Fe as DEFAULT_STALL_EVENT_LOOKBACK, se as DEFAULT_STALL_RUN_PAGE, _e as DEFAULT_SUSPEND_HINT_MS, d as DEFAULT_WORKFLOW_SCHEDULE_MAX_RUNTIME_MS, _ as DEFERRING_CONTROLS, zt as EVENTS_TABLE, Ee as FlowControlKeyError, kt as PAUSES_TABLE, gt as PENDING_TABLE, de as WATERMARKS_TABLE, R as WorkflowFlowControlProperty, M as WorkflowMessagesProperty, l as WorkflowRunRecorder, k as WorkflowScheduleProperty, p as WorkflowStepInterceptorTag, I as WorkflowVersionTypeId, D as WorkflowWorkerLayerTypeId, mt as _voltroBudgetHoldsTable, Gt as _voltroWorkflowAdmissionLocksTable, tt as _voltroWorkflowAdmissionsTable, Tt as _voltroWorkflowControlRequestsTable, Zt as _voltroWorkflowFailureReportsTable, it as _voltroWorkflowParentClosuresTable, lt as _voltroWorkflowPausesTable, Lt as _voltroWorkflowPendingTable, Ke as _voltroWorkflowRunEventsTable, en as _voltroWorkflowRunStepsTable, cn as _voltroWorkflowRunsTable, ft as _voltroWorkflowStartContextsTable, Ot as _voltroWorkflowStartReceiptsTable, ht as _voltroWorkflowSubmissionsTable, st as _voltroWorkflowWatermarksTable, De as acceptAdmissionSubmission, _n as acceptWorkflowControlInTransaction, X as acknowledgeAdmissionSubmission, Yt as admitStart, pt as allIntents, s as assertConsistentPools, q as awaitEvent, bt as awaitSignal, Z as awaitSignalSuspending, rt as awaitUpdate, Ie as beginAdmissionSubmissionDispatchInTransaction, fn as beginWorkflowControlDispatchInTransaction, pn as bindWorkflowResumeJournalInTransaction, ue as bindWorkflowStartReceipts, dt as budgetHoldGeneration, Ge as budgetHoldKey, $t as budgetHoldSignalName, Xe as cancelQueuedWorkflowStartInTransaction, nt as cancelSuspendedWorkflowRunInTransaction, K as comparePendingOrder, nn as completeSuspendingSignal, Et as completeWorkflowRunGenerationInTransaction, qe as deadLetterIntent, ot as decideAdmission, g as deferringControlsOf, tn as deleteIntent, gn as describeStalledRun, ln as discardIntent, $e as discardIntentInTransaction, un as drainTick, on as dueIntents, b as durableClock, N as durableQueue, L as durableQueueModule, S as durableRateLimiterModule, Qt as enterWorkflowRunGenerationInTransaction, Ae as evaluateAdmission, F as executePreparedWorkflow, W as getCurrentWorkflowExecutionId, t as getCurrentWorkflowRunId, A as getWorkflowFlowControl, e as getWorkflowSchedule, z as getWorkflowVersionMetadata, fe as handoffWorkflowFailureInTransaction, v as hasCancelOn, o as hasFlowControl, sn as heldBudgets, Qe as inMemoryWorkflowEngineLayer, Xt as inspectWorkflow, Jt as isFinishExpired, jt as isStartExpired, C as isWorkflowWorkerLayer, Mt as linkExecution, wt as makeInMemoryRecorder, h as makeReplayShapeTracker, Vt as makeWorkflowRunRecorder, te as makeWorkflowUpdateId, ye as maybeHintSuspendingSignal, Te as newestEventAt, Ht as nextSlotAt, i as nondeterminismEventPayload, _t as normaliseWorkflowPatches, ce as noteAdmissionSubmissionFailure, Q as noteIntentAttempt, rn as parkDelayedStart, w as patch, Me as pauseWorkflow, Pe as pendingAdmissionSubmissions, Ze as pendingBudgetHolds, ne as pendingSlotId, ee as pendingWindow, Se as persistDefer, G as planCancellations, vt as pooledConcurrencyKey, Re as prepareAdmissionSubmissionExecutionInTransaction, P as processQueue, Ct as pruneAdmissions, j as queueWorker, Kt as queuedCancellationRequestsTable, E as rateLimit, J as readAdmissionState, oe as readAdmissionSubmission, xt as readPausedWorkflows, Ft as readQueuedWorkflowCancellationInTransaction, Ve as readWatermark, hn as readWorkflowControlInTransaction, Be as readWorkflowFailureRecord, ge as readWorkflowStartReceipt, He as reconcileWorkflowFailureInTransaction, ve as recordAdmission, We as recordWorkflowFailureInTransaction, Oe as recordWorkflowStartReceipt, me as rejectAdmissionSubmissionInTransaction, an as releaseBudgetHolds, be as releaseLease, r as reportNondeterminism, Bt as reserveAdmissionSubmission, Ce as resetSuspendHintsForTest, Ye as resolveAdmissionKeys, Je as resolveRunGuardTuning, re as resolveSuspendHintMs, $ as resolveWorkflowMessageRun, dn as resolveWorkflowStartReceipt, we as resumeWorkflow, ie as retryDeadLetterIntent, xe as sendWorkflowSignal, St as sendWorkflowUpdate, Nt as serialiseWorkflowRowForWire, le as setSuspendSignalHintMs, T as sleep, y as sleepUntil, at as stageWorkflowParentClosureInTransaction, B as step, U as stepIdempotencyKey, x as stepModule, ke as suspendForBudget, je as suspendingSignalDeferredName, ze as sweepCancelOn, Ne as sweepStalledRuns, Ut as takeAdmittedSubmissionInTransaction, yt as takePendingAdmissionSubmission, Wt as truncateWorkflowValue, c as validateFlowControl, O as validateWorkflowSchedule, Pt as withAdmissionTransaction, H as withCompensation, m as workflow, n as workflowModule, et as wrapWorkflowExecuteWithRunRecording, Ue as writeWatermark };

package/dist/{primitives-CqHxfASq.js → primitives-DsMsMr5S.js}

@@ -1,45 +1,54 @@
-import { Activity as e, Activity as t, DurableClock as n, DurableClock as r, DurableQueue as i, DurableQueue as a, DurableRateLimiter as o, DurableRateLimiter as s, Workflow as c, Workflow as l } from "@effect/workflow";
-import { Cause as u, Context as d, Cron as f, Duration as p, Effect as m, Either as h, Exit as ee, FiberRef as g, Option as _, Schedule as v, Schema as y } from "effect";
-import { attachWorkflowAccess as te, resolveWorkflowAccess as ne } from "@voltro/protocol";
-//#region src/flowControl.ts
-var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0 || e.concurrency !== void 0 || e.throttle !== void 0 || e.rateLimit !== void 0 || e.batch !== void 0 || e.timeouts?.startMs !== void 0 || e.timeouts?.finishMs !== void 0), x = (e) => e?.cancelOn !== void 0 && e.cancelOn.length > 0, re = [
+import { Activity as e, Activity as t, DurableClock as n, DurableClock as r, DurableQueue as i, DurableQueue as a, DurableRateLimiter as o, DurableRateLimiter as s, Workflow as c, Workflow as l, WorkflowEngine as u } from "@effect/workflow";
+import { Cause as d, Context as f, Cron as p, Duration as m, Effect as h, Either as g, Exit as _, FiberRef as v, Option as ee, Schedule as y, Schema as b } from "effect";
+import { attachWorkflowAccess as x, resolveWorkflowAccess as S } from "@voltro/protocol";
+//#region src/preparedExecution.ts
+var C = Symbol.for("@voltro/workflow/PreparedExecution"), te = (e, t) => {
+	Object.defineProperty(e, C, {
+		value: t,
+		enumerable: !0
+	});
+}, ne = (e, t, n, r) => h.suspend(() => {
+	if (n.length === 0) return h.die(/* @__PURE__ */ Error("Prepared workflow execution requires a non-empty identity"));
+	let i = e[C];
+	return typeof i == "function" ? i(t, n, r?.discard ?? !0) : h.die(/* @__PURE__ */ Error("Workflow definition has no prepared-execution capability"));
+}), re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0 || e.concurrency !== void 0 || e.throttle !== void 0 || e.rateLimit !== void 0 || e.batch !== void 0 || e.timeouts?.startMs !== void 0 || e.timeouts?.finishMs !== void 0), ie = (e) => e?.cancelOn !== void 0 && e.cancelOn.length > 0, ae = [
 	"debounce",
 	"batch",
 	"throttle",
 	"concurrency"
-], S = (e) => {
+], w = (e) => {
 	if (e === void 0) return [];
 	let t = [];
 	return e.debounce !== void 0 && t.push("debounce"), e.batch !== void 0 && t.push("batch"), e.throttle !== void 0 && t.push("throttle"), e.concurrency !== void 0 && t.push("concurrency"), t;
-}, C = (e, t, n) => {
+}, T = (e, t, n) => {
 	let r;
 	try {
-		r = p.toMillis(p.decode(e));
+		r = m.toMillis(m.decode(e));
 	} catch {
 		throw Error(`workflow '${n}': ${t} is not a duration Effect can read (got ${JSON.stringify(e)}). Use a spelled-out unit ('15 minutes', '1 hour', '30 seconds'), a number of milliseconds, or a Duration — the abbreviated forms ('15m', '1h') are NOT accepted.`);
 	}
 	if (!Number.isFinite(r) || r <= 0) throw Error(`workflow '${n}': ${t} must be a positive finite duration, got ${String(e)}`);
 	return r;
-}, w = (e, t, n) => {
+}, E = (e, t, n) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`workflow '${n}': ${t} must be a positive integer, got ${String(e)}`);
 	return e;
-}, T = (e, t, n) => {
+}, D = (e, t, n) => {
 	if (typeof e != "function") throw Error(`workflow '${n}': ${t} must be a function of the payload`);
 	return e;
-}, E = (e) => {
+}, O = (e) => {
 	let t = e?.ast?.propertySignatures;
 	if (!Array.isArray(t)) return !1;
 	let n = t.find((e) => e.name === "items");
 	return n !== void 0 && n.type?._tag === "TupleType";
-}, D = (e) => {
+}, k = (e) => {
 	let { workflowName: t, control: n } = e;
 	if (n === void 0) return;
 	let r = { workflowName: t };
 	if (n.debounce !== void 0) {
-		let e = n.debounce, i = C(e.period, "debounce.period", t), a = e.timeout === void 0 ? void 0 : C(e.timeout, "debounce.timeout", t);
+		let e = n.debounce, i = T(e.period, "debounce.period", t), a = e.timeout === void 0 ? void 0 : T(e.timeout, "debounce.timeout", t);
 		if (a !== void 0 && a < i) throw Error(`workflow '${t}': debounce.timeout (${a}ms) is shorter than debounce.period (${i}ms), so the burst can never be collapsed — the run would be admitted before the quiet period could ever elapse. Raise the timeout or lower the period.`);
 		r.debounce = {
-			key: T(e.key, "debounce.key", t),
+			key: D(e.key, "debounce.key", t),
 			periodMs: i,
 			...a === void 0 ? {} : { timeoutMs: a }
 		};
@@ -48,7 +57,7 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		let e = n.singleton;
 		if (e.mode !== "skip" && e.mode !== "cancel") throw Error(`workflow '${t}': singleton.mode must be 'skip' or 'cancel'. There is no default — 'skip' discards the incoming request and 'cancel' discards the running one, and choosing for you would silently throw away work either way.`);
 		r.singleton = {
-			key: T(e.key, "singleton.key", t),
+			key: D(e.key, "singleton.key", t),
 			mode: e.mode
 		};
 	}
@@ -56,34 +65,34 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		let e = n.concurrency;
 		if (e.pool !== void 0 && (typeof e.pool != "string" || e.pool.trim() === "")) throw Error(`workflow '${t}': concurrency.pool must be a non-empty name — it is the identity other workflows declare to share this budget, and an empty one would silently merge every empty-named pool in the deployment into one.`);
 		r.concurrency = {
-			limit: w(e.limit, "concurrency.limit", t),
-			...e.key === void 0 ? {} : { key: T(e.key, "concurrency.key", t) },
+			limit: E(e.limit, "concurrency.limit", t),
+			...e.key === void 0 ? {} : { key: D(e.key, "concurrency.key", t) },
 			...e.pool === void 0 ? {} : { pool: e.pool.trim() }
 		};
 	}
 	if (n.throttle !== void 0) {
 		let e = n.throttle;
 		r.throttle = {
-			limit: w(e.limit, "throttle.limit", t),
-			periodMs: C(e.period, "throttle.period", t),
-			...e.key === void 0 ? {} : { key: T(e.key, "throttle.key", t) }
+			limit: E(e.limit, "throttle.limit", t),
+			periodMs: T(e.period, "throttle.period", t),
+			...e.key === void 0 ? {} : { key: D(e.key, "throttle.key", t) }
 		};
 	}
 	if (n.rateLimit !== void 0) {
 		let e = n.rateLimit;
 		r.rateLimit = {
-			limit: w(e.limit, "rateLimit.limit", t),
-			periodMs: C(e.period, "rateLimit.period", t),
-			...e.key === void 0 ? {} : { key: T(e.key, "rateLimit.key", t) }
+			limit: E(e.limit, "rateLimit.limit", t),
+			periodMs: T(e.period, "rateLimit.period", t),
+			...e.key === void 0 ? {} : { key: D(e.key, "rateLimit.key", t) }
 		};
 	}
 	if (n.batch !== void 0) {
 		let i = n.batch;
-		if (e.payloadSchema !== void 0 && !E(e.payloadSchema)) throw Error(`workflow '${t}': batch is declared, so the workflow's own \`payload\` must be the BATCH shape — \`Schema.Struct({ items: Schema.Array(Item) })\` — while callers start it with a SINGLE item. Declare the item's schema as \`batch.item\`. Checked here rather than at admission because a decode failure on the batching replica is a failure nobody is watching.`);
+		if (e.payloadSchema !== void 0 && !O(e.payloadSchema)) throw Error(`workflow '${t}': batch is declared, so the workflow's own \`payload\` must be the BATCH shape — \`Schema.Struct({ items: Schema.Array(Item) })\` — while callers start it with a SINGLE item. Declare the item's schema as \`batch.item\`. Checked here rather than at admission because a decode failure on the batching replica is a failure nobody is watching.`);
 		r.batch = {
-			...i.key === void 0 ? {} : { key: T(i.key, "batch.key", t) },
-			maxSize: w(i.maxSize, "batch.maxSize", t),
-			timeoutMs: C(i.timeout, "batch.timeout", t),
+			...i.key === void 0 ? {} : { key: D(i.key, "batch.key", t) },
+			maxSize: E(i.maxSize, "batch.maxSize", t),
+			timeoutMs: T(i.timeout, "batch.timeout", t),
 			...i.item === void 0 ? {} : { item: i.item }
 		};
 	}
@@ -92,7 +101,7 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		r.priority = n.priority;
 	}
 	if (n.timeouts !== void 0) {
-		let e = n.timeouts, i = e.start === void 0 ? void 0 : C(e.start, "timeouts.start", t), a = e.finish === void 0 ? void 0 : C(e.finish, "timeouts.finish", t);
+		let e = n.timeouts, i = e.start === void 0 ? void 0 : T(e.start, "timeouts.start", t), a = e.finish === void 0 ? void 0 : T(e.finish, "timeouts.finish", t);
 		(i !== void 0 || a !== void 0) && (r.timeouts = {
 			...i === void 0 ? {} : { startMs: i },
 			...a === void 0 ? {} : { finishMs: a }
@@ -112,7 +121,7 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 			if (typeof e?.event != "string" || e.event.length === 0) throw Error(`workflow '${t}': ${r}.event must be a non-empty event name, exactly as ctx.events.publish writes it.`);
 			if (e.schema === void 0 || typeof e.schema.ast != "object") throw Error(`workflow '${t}': ${r}.schema must be a Schema for the event payload. It is decoded before \`match\` runs, so the predicate reads the domain type rather than raw JSON.`);
 			if (typeof e.match != "function") throw Error(`workflow '${t}': ${r}.match is required. Omitting it would mean "cancel every live run of this workflow whenever '${e.event}' is published" — write \`match: () => true\` if that is what you mean, so it is visible in review.`);
-			let i = e.within === void 0 ? void 0 : C(e.within, `${r}.within`, t);
+			let i = e.within === void 0 ? void 0 : T(e.within, `${r}.within`, t);
 			return {
 				event: e.event,
 				schema: e.schema,
@@ -123,9 +132,9 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		});
 		e.length > 0 && (r.cancelOn = e);
 	}
-	if (r.timeouts?.startMs !== void 0 && S(r).length === 0) throw Error(`workflow '${t}': timeouts.start bounds how long a run may sit in the ADMISSION queue, but this workflow declares no control that can defer one (debounce, batch, throttle, concurrency). It would never fire. Use timeouts.finish to bound the run itself.`);
+	if (r.timeouts?.startMs !== void 0 && w(r).length === 0) throw Error(`workflow '${t}': timeouts.start bounds how long a run may sit in the ADMISSION queue, but this workflow declares no control that can defer one (debounce, batch, throttle, concurrency). It would never fire. Use timeouts.finish to bound the run itself.`);
 	return r;
-}, O = (e) => {
+}, oe = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e) {
 		let e = n?.concurrency;
@@ -138,25 +147,25 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		else if (r.limit !== e.limit) throw Error(`concurrency pool '${e.pool}': '${n.workflowName}' declares limit ${e.limit}, but ${r.workflows.map((e) => `'${e}'`).join(", ")} declare${r.workflows.length === 1 ? "s" : ""} limit ${r.limit}. A pool is ONE budget — every member must declare the same number, or the enforced limit would depend on which workflow's start arrived first. Align the limits, or give the workflows different pool names if they were never meant to share.`);
 		else r.workflows.push(n.workflowName);
 	}
-}, k = class extends d.Tag("@voltro/WorkflowRunRecorder")() {}, A = g.unsafeMake(void 0), j = g.unsafeMake(void 0), M = g.unsafeMake(void 0), N = g.unsafeMake([]), P = () => g.get(A), ie = () => g.get(j), F = class extends d.Tag("@voltro/WorkflowStepInterceptor")() {}, I = 864e5, ae = /* @__PURE__ */ new Set([
+}, A = class extends f.Tag("@voltro/WorkflowRunRecorder")() {}, j = v.unsafeMake(void 0), M = v.unsafeMake(void 0), se = v.unsafeMake(void 0), N = v.unsafeMake(void 0), P = v.unsafeMake([]), ce = () => v.get(j), le = () => v.get(M), F = class extends f.Tag("@voltro/WorkflowStepInterceptor")() {}, I = 864e5, L = /* @__PURE__ */ new Set([
 	"skip",
 	"buffer",
 	"cancelOther"
-]), L = /* @__PURE__ */ new Set([
+]), R = /* @__PURE__ */ new Set([
 	"skip",
 	"latest",
 	"all"
-]), R = (e, t) => {
+]), z = (e, t) => {
 	if (t === void 0) return;
 	if (typeof t.timezone != "string" || t.timezone.trim() === "") throw Error(`workflow '${e}': schedule.timezone is required (e.g. "UTC", "Europe/Berlin") — never server-local, which differs between your machine and the container.`);
-	let n = f.parse(t.cron, t.timezone);
-	if (h.isLeft(n)) throw Error(`workflow '${e}': schedule.cron "${t.cron}" (tz="${t.timezone}") is not a valid cron expression — ${String(n.left)}`);
+	let n = p.parse(t.cron, t.timezone);
+	if (g.isLeft(n)) throw Error(`workflow '${e}': schedule.cron "${t.cron}" (tz="${t.timezone}") is not a valid cron expression — ${String(n.left)}`);
 	let r = t.onOverlap ?? "skip";
-	if (!ae.has(r)) throw Error(`workflow '${e}': schedule.onOverlap must be 'skip' | 'buffer' | 'cancelOther', got ${JSON.stringify(r)}`);
+	if (!L.has(r)) throw Error(`workflow '${e}': schedule.onOverlap must be 'skip' | 'buffer' | 'cancelOther', got ${JSON.stringify(r)}`);
 	let i = t.backfill ?? "skip";
-	if (!L.has(i)) throw Error(`workflow '${e}': schedule.backfill must be 'skip' | 'latest' | 'all', got ${JSON.stringify(i)}`);
+	if (!R.has(i)) throw Error(`workflow '${e}': schedule.backfill must be 'skip' | 'latest' | 'all', got ${JSON.stringify(i)}`);
 	let a = I;
-	return t.maxRuntime !== void 0 && (a = z(t.maxRuntime, e)), {
+	return t.maxRuntime !== void 0 && (a = B(t.maxRuntime, e)), {
 		cron: t.cron,
 		timezone: t.timezone,
 		...t.payload === void 0 ? {} : { payload: t.payload },
@@ -164,20 +173,20 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		backfill: i,
 		maxRuntimeMs: a
 	};
-}, z = (e, t) => {
+}, B = (e, t) => {
 	let n;
 	try {
-		n = p.toMillis(p.decode(e));
+		n = m.toMillis(m.decode(e));
 	} catch {
 		throw Error(`workflow '${t}': schedule.maxRuntime is not a duration Effect can read (got ${JSON.stringify(e)}). Use '2 hours', a number of milliseconds, or a Duration.`);
 	}
 	if (!Number.isFinite(n) || n <= 0) throw Error(`workflow '${t}': schedule.maxRuntime must be a positive finite duration`);
 	return n;
-}, B = "__voltroWorkflowSchedule", V = (e) => {
+}, V = "__voltroWorkflowSchedule", H = (e) => {
 	if (typeof e != "object" || !e) return;
-	let t = e[B];
+	let t = e[V];
 	return t === void 0 ? void 0 : t;
-}, H = (e) => {
+}, U = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e) t.set(n.stepName, (t.get(n.stepName) ?? 0) + 1);
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set(), i = (e) => !r.has(e) && (r.add(e), !0);
@@ -206,80 +215,90 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 			return e;
 		}
 	};
-}, U = g.unsafeMake(void 0), W = (e) => ({
+}, W = v.unsafeMake(void 0), G = (e) => ({
 	kind: e.kind,
 	stepName: e.stepName,
 	recorded: e.recorded,
 	reached: e.reached,
 	detail: e.detail
-}), G = (e) => m.gen(function* () {
+}), K = (e) => h.gen(function* () {
 	if (e.length === 0) return;
-	let t = yield* g.get(A), n = yield* m.serviceOption(k);
+	let t = yield* v.get(j), n = yield* h.serviceOption(A);
 	if (t === void 0 || n._tag !== "Some") return;
 	let r = n.value;
-	for (let n of e) yield* m.promise(() => r.recordEvent({
+	for (let n of e) yield* h.promise(() => r.recordEvent({
 		runId: t,
 		eventType: "nondeterminism-suspected",
-		payload: W(n)
+		payload: G(n)
 	}).then(() => void 0).catch(() => void 0));
-}), K = (e) => {
+}), ue = (e) => {
 	if (typeof e != "object" || !e) return;
 	let t = e.retryAfterMillis;
-	if (typeof t == "number" && Number.isFinite(t) && t >= 0) return p.millis(t);
+	if (typeof t == "number" && Number.isFinite(t) && t >= 0) return m.millis(t);
 	let n = e.retryAfter;
-	if (typeof n == "number" && Number.isFinite(n) && n >= 0) return p.seconds(n);
-}, q = (e) => p.decode(e), J = (e) => typeof e == "object" && e && "_tag" in e ? String(e._tag) : void 0, oe = (e) => e !== void 0 && (e.maxAttempts ?? 3) > 1, se = (e) => {
+	if (typeof n == "number" && Number.isFinite(n) && n >= 0) return m.seconds(n);
+}, q = (e) => m.decode(e), de = (e) => typeof e == "object" && e && "_tag" in e ? String(e._tag) : void 0, fe = (e) => e !== void 0 && (e.maxAttempts ?? 3) > 1, pe = (e) => {
 	if (e.retryable) return e.retryable;
 	if (e.retryableErrors && e.retryableErrors.length > 0) {
 		let t = new Set(e.retryableErrors);
 		return (e) => {
-			let n = J(e);
+			let n = de(e);
 			return n !== void 0 && t.has(n);
 		};
 	}
 	return () => !0;
-}, ce = (e) => {
-	let t = e.baseDelay ?? "200 millis", n = e.strategy ?? "exponential", r = e.maxAttempts ?? 3, i = n === "linear" ? v.linear(q(e.step ?? t)) : n === "fixed" ? v.spaced(q(t)) : v.exponential(q(t), e.factor ?? 2);
+}, me = (e) => {
+	let t = e.baseDelay ?? "200 millis", n = e.strategy ?? "exponential", r = e.maxAttempts ?? 3, i = n === "linear" ? y.linear(q(e.step ?? t)) : n === "fixed" ? y.spaced(q(t)) : y.exponential(q(t), e.factor ?? 2);
 	if (e.maxDelay !== void 0) {
 		let t = q(e.maxDelay);
-		i = v.modifyDelay(i, (e, n) => p.min(n, t));
+		i = y.modifyDelay(i, (e, n) => m.min(n, t));
 	}
-	(e.jitter ?? !0) === !0 && (i = v.jittered(i));
-	let a = v.intersect(i, v.recurs(Math.max(0, r - 1)));
-	return e.maxElapsed !== void 0 && (a = v.upTo(q(e.maxElapsed))(a)), a;
-}, le = (e, t) => {
-	let n = p.toMillis(q(e.baseDelay ?? "200 millis")), r = e.strategy ?? "exponential", i = r === "fixed" ? n : r === "linear" ? n + p.toMillis(q(e.step ?? e.baseDelay ?? "200 millis")) * (t - 1) : n * (e.factor ?? 2) ** (t - 1);
-	return e.maxDelay !== void 0 && (i = Math.min(i, p.toMillis(q(e.maxDelay)))), (e.jitter ?? !0) === !0 && (i *= Math.random()), i;
-}, ue = (e, t, n, r) => m.gen(function* () {
-	let i = t.maxAttempts ?? 3, a = t.maxElapsed === void 0 ? Infinity : p.toMillis(q(t.maxElapsed)), o = yield* m.sync(() => Date.now()), s = 0;
+	(e.jitter ?? !0) === !0 && (i = y.jittered(i));
+	let a = y.intersect(i, y.recurs(Math.max(0, r - 1)));
+	return e.maxElapsed !== void 0 && (a = y.upTo(q(e.maxElapsed))(a)), a;
+}, he = (e, t) => {
+	let n = m.toMillis(q(e.baseDelay ?? "200 millis")), r = e.strategy ?? "exponential", i = r === "fixed" ? n : r === "linear" ? n + m.toMillis(q(e.step ?? e.baseDelay ?? "200 millis")) * (t - 1) : n * (e.factor ?? 2) ** (t - 1);
+	return e.maxDelay !== void 0 && (i = Math.min(i, m.toMillis(q(e.maxDelay)))), (e.jitter ?? !0) === !0 && (i *= Math.random()), i;
+}, ge = (e, t, n, r) => h.gen(function* () {
+	let i = t.maxAttempts ?? 3, a = t.maxElapsed === void 0 ? Infinity : m.toMillis(q(t.maxElapsed)), o = yield* h.sync(() => Date.now()), s = 0;
 	for (;;) {
-		let c = yield* m.exit(e);
-		if (ee.isSuccess(c)) return c.value;
-		let l = c.cause, d = u.failureOption(l), f = _.isSome(d) ? d.value : u.squash(l);
+		let c = yield* h.exit(e);
+		if (_.isSuccess(c)) return c.value;
+		let l = c.cause, u = d.failureOption(l), f = ee.isSome(u) ? u.value : d.squash(l);
 		s += 1;
-		let h = (yield* m.sync(() => Date.now())) - o;
-		if (s >= i || !n(f) || h >= a) return yield* m.failCause(l);
+		let p = (yield* h.sync(() => Date.now())) - o;
+		if (s >= i || !n(f) || p >= a) return yield* h.failCause(l);
 		r?.(f);
-		let g = K(f), v = g === void 0 ? le(t, s) : p.toMillis(g);
-		yield* m.sleep(p.millis(v));
+		let g = ue(f), v = g === void 0 ? he(t, s) : m.toMillis(g);
+		yield* h.sleep(m.millis(v));
 	}
-}), de = (e, t, n) => {
-	if (!oe(t)) return e;
-	let r = se(t);
-	if (t.respectRetryAfter === !0) return ue(e, t, r, n);
-	let i = ce(t), a = n ? m.tapError(e, (e) => m.sync(() => {
+}), _e = (e, t, n) => {
+	if (!fe(t)) return e;
+	let r = pe(t);
+	if (t.respectRetryAfter === !0) return ge(e, t, r, n);
+	let i = me(t), a = n ? h.tapError(e, (e) => h.sync(() => {
 		r(e) && n(e);
 	})) : e;
-	return m.retry(a, {
+	return h.retry(a, {
 		schedule: i,
 		while: r
 	});
-}, Y = Symbol.for("voltro.workflow.workerLayer"), X = Symbol.for("voltro.workflow.version"), Z = "__voltroWorkflowMessages", Q = "__voltroWorkflowFlowControl", fe = (e) => typeof e == "object" && !!e && e[Y] === !0, pe = (e) => typeof e == "object" && e && e[X] !== void 0 ? e[X] : {
+}, J = Symbol.for("voltro.workflow.workerLayer"), Y = Symbol.for("voltro.workflow.version"), X = "__voltroWorkflowMessages", Z = "__voltroWorkflowFlowControl", ve = (e) => typeof e == "object" && !!e && e[J] === !0, ye = (e) => typeof e == "object" && e && e[Y] !== void 0 ? e[Y] : {
 	version: "1",
 	compatibleWith: ["1"],
 	patches: []
-}, me = ((e) => {
-	let t = c.make(e), n = e.suspendOnFailure === !0 ? t.annotate(c.SuspendOnFailure, !0) : t, r = String(e.version ?? "1"), i = {
+}, be = ((e) => {
+	let t = c.make(e), n = e.suspendOnFailure === !0 ? t.annotate(c.SuspendOnFailure, !0) : t;
+	te(n, (t, r, i) => h.gen(function* () {
+		let a = n.payloadSchema.make(t), o = yield* u.WorkflowEngine;
+		return yield* h.annotateCurrentSpan({ executionId: r }), yield* o.execute(n, {
+			executionId: r,
+			payload: a,
+			discard: i,
+			suspendedRetrySchedule: e.suspendedRetrySchedule
+		});
+	}).pipe(h.withSpan(`${e.name}.execute`, { captureStackTrace: !1 })));
+	let r = String(e.version ?? "1"), i = {
 		version: r,
 		compatibleWith: (e.compatibleWith ?? [r]).map(String),
 		patches: [...e.patches ?? []]
@@ -287,42 +306,42 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		signals: { ...e.messages?.signals ?? {} },
 		updates: { ...e.messages?.updates ?? {} }
 	};
-	Object.defineProperty(n, X, {
+	Object.defineProperty(n, Y, {
 		value: i,
 		enumerable: !1
-	}), Object.defineProperty(n, Z, {
+	}), Object.defineProperty(n, X, {
 		value: a,
 		enumerable: !1
-	}), te(n, ne(e.name, e));
-	let o = D({
+	}), x(n, S(e.name, e));
+	let o = k({
 		workflowName: e.name,
 		payloadSchema: e.payload,
 		control: e
 	});
-	o !== void 0 && Object.defineProperty(n, Q, {
+	o !== void 0 && Object.defineProperty(n, Z, {
 		value: o,
 		enumerable: !1
 	});
-	let s = R(e.name, e.schedule);
-	return s !== void 0 && Object.defineProperty(n, B, {
+	let s = z(e.name, e.schedule);
+	return s !== void 0 && Object.defineProperty(n, V, {
 		value: s,
 		enumerable: !1
 	}), n;
-}), he = (e) => {
+}), xe = (e) => {
 	if (typeof e != "object" || !e) return;
-	let t = e[Q];
+	let t = e[Z];
 	return t === void 0 ? void 0 : t;
-}, ge = i.make, _e = i.process, ve = ((...e) => {
+}, Q = i.make, Se = i.process, Ce = ((...e) => {
 	let t = i.worker(...e);
-	return Object.defineProperty(t, Y, {
+	return Object.defineProperty(t, J, {
 		value: !0,
 		enumerable: !1
 	}), t;
-}), ye = o.rateLimit, $ = (e) => m.gen(function* () {
-	let t = yield* A, r = yield* m.serviceOption(k), i = p.toMillis(p.decode(e.duration));
+}), we = o.rateLimit, $ = (e) => h.gen(function* () {
+	let t = yield* j, r = yield* h.serviceOption(A), i = m.toMillis(m.decode(e.duration));
 	if (t !== void 0 && r._tag === "Some") {
-		let a = r.value, o = new Date(Date.now() + i).toISOString(), s = yield* M;
-		yield* m.promise(() => a.recordEvent({
+		let a = r.value, o = new Date(Date.now() + i).toISOString(), s = yield* N;
+		yield* h.promise(() => a.recordEvent({
 			runId: t,
 			eventType: "timer-set",
 			payload: {
@@ -333,7 +352,7 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 			}
 		}).catch(() => {}));
 		let c = Date.now();
-		yield* n.sleep(e), yield* m.promise(() => a.recordEvent({
+		yield* n.sleep(e), yield* h.promise(() => a.recordEvent({
 			runId: t,
 			eventType: "timer-fired",
 			payload: {
@@ -345,27 +364,27 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		return;
 	}
 	yield* n.sleep(e);
-}), be = (t) => m.gen(function* () {
+}), Te = (t) => h.gen(function* () {
 	let n = (yield* e.make({
 		name: `sleepUntil:${t.name}`,
-		success: y.Number,
-		execute: m.sync(() => t.until instanceof Date ? t.until.getTime() : t.until)
+		success: b.Number,
+		execute: h.sync(() => t.until instanceof Date ? t.until.getTime() : t.until)
 	})) - Date.now();
 	n <= 0 || (yield* $({
 		name: t.name,
 		duration: `${n} millis`
 	}));
-}), xe = (t, n, r, i) => m.gen(function* () {
-	let a = yield* A, o = yield* e.CurrentAttempt, s = yield* m.serviceOption(k), c = yield* m.serviceOption(F), l = c._tag === "Some" ? c.value.interceptor(n, {
+}), Ee = (t, n, r, i) => h.gen(function* () {
+	let a = yield* j, o = yield* e.CurrentAttempt, s = yield* h.serviceOption(A), c = yield* h.serviceOption(F), l = c._tag === "Some" ? c.value.interceptor(n, {
 		runId: a ?? "unrecorded",
 		stepName: t,
 		attempt: o
-	}) : n, d, f;
+	}) : n, u, f;
 	if (a !== void 0 && s._tag === "Some") {
 		f = s.value;
 		let e = i === void 0 ? void 0 : (({ retryable: e, ...t }) => t)(i);
 		try {
-			d = yield* m.promise(() => f.startStep({
+			u = yield* h.promise(() => f.startStep({
 				runId: a,
 				stepName: t,
 				attempt: o,
@@ -373,51 +392,51 @@ var b = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 				...e === void 0 ? {} : { retryPolicy: e }
 			}));
 		} catch {
-			d = void 0;
+			u = void 0;
 		}
 	}
 	let p = Date.now();
-	return yield* de(l, i).pipe(m.tap((e) => d && f ? m.promise(async () => {
+	return yield* _e(l, i).pipe(h.tap((e) => u && f ? h.promise(async () => {
 		try {
 			await f.endStepSuccess({
-				stepRecordId: d,
+				stepRecordId: u,
 				output: e,
 				durationMs: Date.now() - p
 			});
 		} catch {}
-	}) : m.void), m.tapErrorCause((e) => d && f && !u.isInterruptedOnly(e) ? m.promise(async () => {
+	}) : h.void), h.tapErrorCause((e) => u && f && !d.isInterruptedOnly(e) ? h.promise(async () => {
 		try {
-			let t = u.failureOption(e), n = Array.from(u.failures(e)), r = Array.from(u.defects(e)), i = t._tag === "Some" ? t.value : r[0] ?? u.squash(e), a = i?.message ?? String(i), o = i && typeof i == "object" && "_tag" in i ? String(i._tag) : null;
+			let t = d.failureOption(e), n = Array.from(d.failures(e)), r = Array.from(d.defects(e)), i = t._tag === "Some" ? t.value : r[0] ?? d.squash(e), a = i?.message ?? String(i), o = i && typeof i == "object" && "_tag" in i ? String(i._tag) : null;
 			await f.endStepFailure({
-				stepRecordId: d,
+				stepRecordId: u,
 				errorTag: o,
 				errorMessage: a,
 				errorCause: {
-					pretty: u.pretty(e),
+					pretty: d.pretty(e),
 					failures: n,
 					defects: r
 				},
 				durationMs: Date.now() - p
 			});
 		} catch {}
-	}) : m.void));
-}), Se = (e) => m.gen(function* () {
-	let t = yield* g.get(U);
+	}) : h.void));
+}), De = (e) => h.gen(function* () {
+	let t = yield* v.get(W);
 	if (t === void 0) return;
 	let n = t.reach(e);
-	n !== void 0 && (yield* G([n]));
-}), Ce = (e, t) => {
+	n !== void 0 && (yield* K([n]));
+}), Oe = (e, t) => {
 	let n = e;
 	return {
 		...e,
-		commit: () => m.zipRight(Se(t), n)
+		commit: () => h.zipRight(De(t), n)
 	};
-}, we = (t) => {
+}, ke = (t) => {
 	let { input: n, retry: r, ...i } = t;
-	return Ce(e.make({
+	return Oe(e.make({
 		...i,
-		execute: xe(i.name, i.execute, n, r)
+		execute: Ee(i.name, i.execute, n, r)
 	}), i.name);
-}, Te = (e) => m.map(g.get(N), (t) => t.includes(e)), Ee = c.withCompensation, De = e.idempotencyKey;
+}, Ae = (e) => h.map(v.get(P), (t) => t.includes(e)), je = c.withCompensation, Me = e.idempotencyKey;
 //#endregion
-export { V as A, re as B, l as C, G as D, W as E, M as F, D as G, S as H, k as I, F as L, j as M, N, I as O, A as P, ie as R, me as S, H as T, x as U, O as V, b as W, be as _, r as a, t as b, s as c, fe as d, Te as f, $ as g, ye as h, Y as i, R as j, B as k, he as l, ve as m, Z as n, ge as o, _e as p, X as r, a as s, Q as t, pe as u, we as v, U as w, Ee as x, De as y, P as z };
+export { H as A, ce as B, l as C, K as D, G as E, j as F, re as G, oe as H, N as I, k as K, A as L, M, se as N, I as O, P, F as R, be as S, U as T, w as U, ae as V, ie as W, Te as _, r as a, t as b, s as c, ve as d, Ae as f, $ as g, we as h, J as i, z as j, V as k, xe as l, Ce as m, X as n, Q as o, Se as p, ne as q, Y as r, a as s, Z as t, ye as u, ke as v, W as w, je as x, Me as y, le as z };

package/dist/primitives.js

@@ -1,2 +1,2 @@
-import { A as e, B as t, C as n, D as r, E as i, G as a, H as o, O as s, S as c, T as l, U as u, V as d, W as f, _ as p, a as m, b as h, c as g, d as _, f as v, g as y, h as b, i as x, j as S, k as C, l as w, m as T, n as E, o as D, p as O, r as k, s as A, t as j, u as M, v as N, w as P, x as F, y as I } from "./primitives-CqHxfASq.js";
-export { P as CurrentWorkflowReplayShape, s as DEFAULT_WORKFLOW_SCHEDULE_MAX_RUNTIME_MS, t as DEFERRING_CONTROLS, j as WorkflowFlowControlProperty, E as WorkflowMessagesProperty, C as WorkflowScheduleProperty, k as WorkflowVersionTypeId, x as WorkflowWorkerLayerTypeId, d as assertConsistentPools, o as deferringControlsOf, m as durableClock, D as durableQueue, A as durableQueueModule, g as durableRateLimiterModule, w as getWorkflowFlowControl, e as getWorkflowSchedule, M as getWorkflowVersionMetadata, u as hasCancelOn, f as hasFlowControl, _ as isWorkflowWorkerLayer, l as makeReplayShapeTracker, i as nondeterminismEventPayload, v as patch, O as processQueue, T as queueWorker, b as rateLimit, r as reportNondeterminism, y as sleep, p as sleepUntil, N as step, I as stepIdempotencyKey, h as stepModule, a as validateFlowControl, S as validateWorkflowSchedule, F as withCompensation, c as workflow, n as workflowModule };
+import { A as e, C as t, D as n, E as r, G as i, H as a, K as o, O as s, S as c, T as l, U as u, V as d, W as f, _ as p, a as m, b as h, c as g, d as _, f as v, g as y, h as b, i as x, j as S, k as C, l as w, m as T, n as E, o as D, p as O, r as k, s as A, t as j, u as M, v as N, w as P, x as F, y as I } from "./primitives-DsMsMr5S.js";
+export { P as CurrentWorkflowReplayShape, s as DEFAULT_WORKFLOW_SCHEDULE_MAX_RUNTIME_MS, d as DEFERRING_CONTROLS, j as WorkflowFlowControlProperty, E as WorkflowMessagesProperty, C as WorkflowScheduleProperty, k as WorkflowVersionTypeId, x as WorkflowWorkerLayerTypeId, a as assertConsistentPools, u as deferringControlsOf, m as durableClock, D as durableQueue, A as durableQueueModule, g as durableRateLimiterModule, w as getWorkflowFlowControl, e as getWorkflowSchedule, M as getWorkflowVersionMetadata, f as hasCancelOn, i as hasFlowControl, _ as isWorkflowWorkerLayer, l as makeReplayShapeTracker, r as nondeterminismEventPayload, v as patch, O as processQueue, T as queueWorker, b as rateLimit, n as reportNondeterminism, y as sleep, p as sleepUntil, N as step, I as stepIdempotencyKey, h as stepModule, o as validateFlowControl, S as validateWorkflowSchedule, F as withCompensation, c as workflow, t as workflowModule };