@voltro/workflow 0.84.0 → 0.85.0

package/dist/{primitives-Btjhjm8P.js → primitives-DX04WTWh.js}

@@ -1,55 +1,56 @@
-import { T as e, d as t, f as n, p as r, s as i, t as a, w as o, y as s } from "./journalEncryption--n5VDdYO.js";
-import { Activity as c, Activity as l, DurableClock as u, DurableClock as d, DurableQueue as f, DurableQueue as p, DurableRateLimiter as m, DurableRateLimiter as ee, Workflow as h, Workflow as te, WorkflowEngine as ne } from "@effect/workflow";
-import { Cause as g, Context as _, Cron as re, Duration as v, Effect as y, Either as ie, Exit as b, FiberRef as x, Option as ae, Schedule as S, Schema as C } from "effect";
-import { attachWorkflowAccess as w, resolveWorkflowAccess as oe } from "@voltro/protocol";
+import { O as e, T as t, d as n, f as r, p as i, s as a, t as o, w as s, y as c } from "./journalEncryption-DTyhUzaS.js";
+import { Activity as l, Activity as u, DurableClock as d, DurableClock as f, DurableQueue as p, DurableQueue as m, Workflow as h, Workflow as ee, WorkflowEngine as te } from "effect/workflow";
+import { RateLimiter as g } from "effect/persistence";
+import { Cause as _, Context as v, Cron as ne, Duration as y, Effect as b, Effectable as re, Exit as x, Option as ie, Result as ae, Schedule as S, Schema as C } from "effect";
+import { attachWorkflowAccess as oe, resolveWorkflowAccess as se } from "@voltro/protocol";
 //#region src/preparedExecution.ts
-var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
-	Object.defineProperty(e, T, {
+var w = Symbol.for("@voltro/workflow/PreparedExecution"), T = (e, t) => {
+	Object.defineProperty(e, w, {
 		value: t,
 		enumerable: !0
 	});
-}, se = (e) => typeof e == "object" && !!e && typeof e[T] == "function", ce = (e, t, n, r) => y.suspend(() => {
-	if (n.length === 0) return y.die(/* @__PURE__ */ Error("Prepared workflow execution requires a non-empty identity"));
-	let i = e[T];
-	return typeof i == "function" ? i(t, n, r?.discard ?? !0) : y.die(/* @__PURE__ */ Error("Workflow definition has no prepared-execution capability"));
-}), le = (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), ue = (e) => e?.cancelOn !== void 0 && e.cancelOn.length > 0, de = [
+}, ce = (e) => (typeof e == "object" || typeof e == "function") && e !== null && typeof e[w] == "function", le = (e, t, n, r) => b.suspend(() => {
+	if (n.length === 0) return b.die(/* @__PURE__ */ Error("Prepared workflow execution requires a non-empty identity"));
+	let i = e[w];
+	return typeof i == "function" ? i(t, n, r?.discard ?? !0) : b.die(/* @__PURE__ */ Error("Workflow definition has no prepared-execution capability"));
+}), ue = (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), de = (e) => e?.cancelOn !== void 0 && e.cancelOn.length > 0, fe = [
 	"debounce",
 	"batch",
 	"throttle",
 	"concurrency"
-], D = (e) => {
+], E = (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;
-}, O = (e, t, n) => {
+}, D = (e, t, n) => {
 	let r;
 	try {
-		r = v.toMillis(v.decode(e));
+		r = y.toMillis(y.fromInputUnsafe(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;
-}, k = (e, t, n) => {
+}, O = (e, t, n) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`workflow '${n}': ${t} must be a positive integer, got ${String(e)}`);
 	return e;
-}, A = (e, t, n) => {
+}, k = (e, t, n) => {
 	if (typeof e != "function") throw Error(`workflow '${n}': ${t} must be a function of the payload`);
 	return e;
-}, fe = (e) => {
+}, pe = (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";
-}, j = (t) => {
-	let { workflowName: n, control: r } = t;
+	return n !== void 0 && n.type?._tag === "Arrays";
+}, A = (e) => {
+	let { workflowName: n, control: r } = e;
 	if (r === void 0) return;
 	let i = { workflowName: n };
 	if (r.debounce !== void 0) {
-		let e = r.debounce, t = O(e.period, "debounce.period", n), a = e.timeout === void 0 ? void 0 : O(e.timeout, "debounce.timeout", n);
+		let e = r.debounce, t = D(e.period, "debounce.period", n), a = e.timeout === void 0 ? void 0 : D(e.timeout, "debounce.timeout", n);
 		if (a !== void 0 && a < t) throw Error(`workflow '${n}': debounce.timeout (${a}ms) is shorter than debounce.period (${t}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.`);
 		i.debounce = {
-			key: A(e.key, "debounce.key", n),
+			key: k(e.key, "debounce.key", n),
 			periodMs: t,
 			...a === void 0 ? {} : { timeoutMs: a }
 		};
@@ -58,7 +59,7 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		let e = r.singleton;
 		if (e.mode !== "skip" && e.mode !== "cancel") throw Error(`workflow '${n}': 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.`);
 		i.singleton = {
-			key: A(e.key, "singleton.key", n),
+			key: k(e.key, "singleton.key", n),
 			mode: e.mode
 		};
 	}
@@ -66,35 +67,35 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		let e = r.concurrency;
 		if (e.pool !== void 0 && (typeof e.pool != "string" || e.pool.trim() === "")) throw Error(`workflow '${n}': 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.`);
 		i.concurrency = {
-			limit: k(e.limit, "concurrency.limit", n),
-			...e.key === void 0 ? {} : { key: A(e.key, "concurrency.key", n) },
+			limit: O(e.limit, "concurrency.limit", n),
+			...e.key === void 0 ? {} : { key: k(e.key, "concurrency.key", n) },
 			...e.pool === void 0 ? {} : { pool: e.pool.trim() }
 		};
 	}
 	if (r.throttle !== void 0) {
 		let e = r.throttle;
 		i.throttle = {
-			limit: k(e.limit, "throttle.limit", n),
-			periodMs: O(e.period, "throttle.period", n),
-			...e.key === void 0 ? {} : { key: A(e.key, "throttle.key", n) }
+			limit: O(e.limit, "throttle.limit", n),
+			periodMs: D(e.period, "throttle.period", n),
+			...e.key === void 0 ? {} : { key: k(e.key, "throttle.key", n) }
 		};
 	}
 	if (r.rateLimit !== void 0) {
 		let e = r.rateLimit;
 		i.rateLimit = {
-			limit: k(e.limit, "rateLimit.limit", n),
-			periodMs: O(e.period, "rateLimit.period", n),
-			...e.key === void 0 ? {} : { key: A(e.key, "rateLimit.key", n) }
+			limit: O(e.limit, "rateLimit.limit", n),
+			periodMs: D(e.period, "rateLimit.period", n),
+			...e.key === void 0 ? {} : { key: k(e.key, "rateLimit.key", n) }
 		};
 	}
 	if (r.batch !== void 0) {
 		let a = r.batch;
-		if (t.payloadSchema !== void 0 && !fe(t.payloadSchema)) throw Error(`workflow '${n}': 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 && !pe(e.payloadSchema)) throw Error(`workflow '${n}': 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.`);
 		i.batch = {
-			...a.key === void 0 ? {} : { key: A(a.key, "batch.key", n) },
-			maxSize: k(a.maxSize, "batch.maxSize", n),
-			timeoutMs: O(a.timeout, "batch.timeout", n),
-			...a.item === void 0 ? {} : { item: r.encrypted === !0 && C.isSchema(a.item) ? e(a.item, `workflow '${n}' batch item`) : a.item }
+			...a.key === void 0 ? {} : { key: k(a.key, "batch.key", n) },
+			maxSize: O(a.maxSize, "batch.maxSize", n),
+			timeoutMs: D(a.timeout, "batch.timeout", n),
+			...a.item === void 0 ? {} : { item: r.encrypted === !0 && C.isSchema(a.item) ? t(a.item, `workflow '${n}' batch item`) : a.item }
 		};
 	}
 	if (r.priority !== void 0) {
@@ -102,7 +103,7 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		i.priority = r.priority;
 	}
 	if (r.timeouts !== void 0) {
-		let e = r.timeouts, t = e.start === void 0 ? void 0 : O(e.start, "timeouts.start", n), a = e.finish === void 0 ? void 0 : O(e.finish, "timeouts.finish", n);
+		let e = r.timeouts, t = e.start === void 0 ? void 0 : D(e.start, "timeouts.start", n), a = e.finish === void 0 ? void 0 : D(e.finish, "timeouts.finish", n);
 		(t !== void 0 || a !== void 0) && (i.timeouts = {
 			...t === void 0 ? {} : { startMs: t },
 			...a === void 0 ? {} : { finishMs: a }
@@ -122,7 +123,7 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 			if (typeof e?.event != "string" || e.event.length === 0) throw Error(`workflow '${n}': ${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 '${n}': ${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 '${n}': ${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 : O(e.within, `${r}.within`, n);
+			let i = e.within === void 0 ? void 0 : D(e.within, `${r}.within`, n);
 			return {
 				event: e.event,
 				schema: e.schema,
@@ -133,9 +134,9 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		});
 		e.length > 0 && (i.cancelOn = e);
 	}
-	if (i.timeouts?.startMs !== void 0 && D(i).length === 0) throw Error(`workflow '${n}': 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 (i.timeouts?.startMs !== void 0 && E(i).length === 0) throw Error(`workflow '${n}': 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 i;
-}, pe = (e) => {
+}, me = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e) {
 		let e = n?.concurrency;
@@ -148,31 +149,31 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		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);
 	}
-}, M = class extends _.Tag("@voltro/WorkflowRunRecorder")() {}, N = x.unsafeMake(void 0), P = x.unsafeMake(void 0), F = x.unsafeMake(void 0), me = y.gen(function* () {
-	let e = yield* x.get(P), t = yield* x.get(F);
+}, j = class extends v.Service()("@voltro/WorkflowRunRecorder") {}, M = v.Reference("@voltro/workflow/CurrentWorkflowRunId", { defaultValue: () => void 0 }), N = v.Reference("@voltro/workflow/CurrentWorkflowExecutionId", { defaultValue: () => void 0 }), P = v.Reference("@voltro/workflow/CurrentWorkflowStep", { defaultValue: () => void 0 }), he = b.gen(function* () {
+	let e = yield* N, t = yield* P;
 	return e === void 0 || t === void 0 ? void 0 : {
 		executionId: e,
 		step: t
 	};
-}), he = x.unsafeMake(void 0), I = x.unsafeMake(void 0), L = x.unsafeMake([]), R = () => x.get(N), ge = () => x.get(P), z = class extends _.Tag("@voltro/WorkflowStepInterceptor")() {}, B = 864e5, _e = /* @__PURE__ */ new Set([
+}), ge = v.Reference("@voltro/workflow/CurrentWorkflowGeneration", { defaultValue: () => void 0 }), F = v.Reference("@voltro/workflow/CurrentWorkflowWakeTenant", { defaultValue: () => void 0 }), I = v.Reference("@voltro/workflow/CurrentWorkflowPatches", { defaultValue: () => [] }), L = () => M, _e = () => N, R = class extends v.Service()("@voltro/WorkflowStepInterceptor") {}, z = 864e5, ve = /* @__PURE__ */ new Set([
 	"skip",
 	"buffer",
 	"cancelOther"
-]), ve = /* @__PURE__ */ new Set([
+]), ye = /* @__PURE__ */ new Set([
 	"skip",
 	"latest",
 	"all"
-]), V = (e, t) => {
+]), B = (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 = re.parse(t.cron, t.timezone);
-	if (ie.isLeft(n)) throw Error(`workflow '${e}': schedule.cron "${t.cron}" (tz="${t.timezone}") is not a valid cron expression — ${String(n.left)}`);
+	let n = ne.parse(t.cron, t.timezone);
+	if (ae.isFailure(n)) throw Error(`workflow '${e}': schedule.cron "${t.cron}" (tz="${t.timezone}") is not a valid cron expression — ${String(n.failure)}`);
 	let r = t.onOverlap ?? "skip";
-	if (!_e.has(r)) throw Error(`workflow '${e}': schedule.onOverlap must be 'skip' | 'buffer' | 'cancelOther', got ${JSON.stringify(r)}`);
+	if (!ve.has(r)) throw Error(`workflow '${e}': schedule.onOverlap must be 'skip' | 'buffer' | 'cancelOther', got ${JSON.stringify(r)}`);
 	let i = t.backfill ?? "skip";
-	if (!ve.has(i)) throw Error(`workflow '${e}': schedule.backfill must be 'skip' | 'latest' | 'all', got ${JSON.stringify(i)}`);
-	let a = B;
-	return t.maxRuntime !== void 0 && (a = ye(t.maxRuntime, e)), {
+	if (!ye.has(i)) throw Error(`workflow '${e}': schedule.backfill must be 'skip' | 'latest' | 'all', got ${JSON.stringify(i)}`);
+	let a = z;
+	return t.maxRuntime !== void 0 && (a = be(t.maxRuntime, e)), {
 		cron: t.cron,
 		timezone: t.timezone,
 		...t.payload === void 0 ? {} : { payload: t.payload },
@@ -180,20 +181,20 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		backfill: i,
 		maxRuntimeMs: a
 	};
-}, ye = (e, t) => {
+}, be = (e, t) => {
 	let n;
 	try {
-		n = v.toMillis(v.decode(e));
+		n = y.toMillis(y.fromInputUnsafe(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;
-}, H = "__voltroWorkflowSchedule", be = (e) => {
-	if (typeof e != "object" || !e) return;
-	let t = e[H];
+}, V = "__voltroWorkflowSchedule", xe = (e) => {
+	if (typeof e != "object" && typeof e != "function" || e === null) return;
+	let t = e[V];
 	return t === void 0 ? void 0 : t;
-}, xe = (e) => {
+}, Se = (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);
@@ -222,158 +223,178 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 			return e;
 		}
 	};
-}, U = x.unsafeMake(void 0), W = (e) => ({
+}, H = v.Reference("@voltro/workflow/CurrentWorkflowReplayShape", { defaultValue: () => void 0 }), U = (e) => ({
 	kind: e.kind,
 	stepName: e.stepName,
 	recorded: e.recorded,
 	reached: e.reached,
 	detail: e.detail
-}), G = (e) => y.gen(function* () {
+}), W = (e) => b.gen(function* () {
 	if (e.length === 0) return;
-	let t = yield* x.get(N), n = yield* y.serviceOption(M);
+	let t = yield* M, n = yield* b.serviceOption(j);
 	if (t === void 0 || n._tag !== "Some") return;
 	let r = n.value;
-	for (let n of e) yield* y.promise(() => r.recordEvent({
+	for (let n of e) yield* b.promise(() => r.recordEvent({
 		runId: t,
 		eventType: "nondeterminism-suspected",
-		payload: W(n)
+		payload: U(n)
 	}).then(() => void 0).catch(() => void 0));
-}), Se = (e) => {
+}), Ce = (e) => {
 	if (typeof e != "object" || !e) return;
 	let t = e.retryAfterMillis;
-	if (typeof t == "number" && Number.isFinite(t) && t >= 0) return v.millis(t);
+	if (typeof t == "number" && Number.isFinite(t) && t >= 0) return y.millis(t);
 	let n = e.retryAfter;
-	if (typeof n == "number" && Number.isFinite(n) && n >= 0) return v.seconds(n);
-}, K = (e) => v.decode(e), Ce = (e) => typeof e == "object" && e && "_tag" in e ? String(e._tag) : void 0, we = (e) => e !== void 0 && (e.maxAttempts ?? 3) > 1, Te = (e) => {
+	if (typeof n == "number" && Number.isFinite(n) && n >= 0) return y.seconds(n);
+}, G = (e) => y.fromInputUnsafe(e), we = (e) => typeof e == "object" && e && "_tag" in e ? String(e._tag) : void 0, Te = (e) => e !== void 0 && (e.maxAttempts ?? 3) > 1, Ee = (e) => {
 	if (e.retryable) return e.retryable;
 	if (e.retryableErrors && e.retryableErrors.length > 0) {
 		let t = new Set(e.retryableErrors);
 		return (e) => {
-			let n = Ce(e);
+			let n = we(e);
 			return n !== void 0 && t.has(n);
 		};
 	}
 	return () => !0;
-}, Ee = (e) => {
-	let t = e.baseDelay ?? "200 millis", n = e.strategy ?? "exponential", r = e.maxAttempts ?? 3, i = n === "linear" ? S.linear(K(e.step ?? t)) : n === "fixed" ? S.spaced(K(t)) : S.exponential(K(t), e.factor ?? 2);
+}, De = (e) => {
+	let t = e.baseDelay ?? "200 millis", n = e.strategy ?? "exponential", r = e.maxAttempts ?? 3, i = n === "linear" ? S.modifyDelay(S.spaced(G(e.step ?? t)), (n) => b.succeed(y.times(G(e.step ?? t), n.attempt))) : n === "fixed" ? S.spaced(G(t)) : S.exponential(G(t), e.factor ?? 2);
 	if (e.maxDelay !== void 0) {
-		let t = K(e.maxDelay);
-		i = S.modifyDelay(i, (e, n) => v.min(n, t));
+		let t = G(e.maxDelay);
+		i = S.modifyDelay(i, (e) => b.succeed(y.min(e.duration, t)));
 	}
 	(e.jitter ?? !0) === !0 && (i = S.jittered(i));
-	let a = S.intersect(i, S.recurs(Math.max(0, r - 1)));
-	return e.maxElapsed !== void 0 && (a = S.upTo(K(e.maxElapsed))(a)), a;
-}, De = (e, t) => {
-	let n = v.toMillis(K(e.baseDelay ?? "200 millis")), r = e.strategy ?? "exponential", i = r === "fixed" ? n : r === "linear" ? n + v.toMillis(K(e.step ?? e.baseDelay ?? "200 millis")) * (t - 1) : n * (e.factor ?? 2) ** (t - 1);
-	return e.maxDelay !== void 0 && (i = Math.min(i, v.toMillis(K(e.maxDelay)))), (e.jitter ?? !0) === !0 && (i *= Math.random()), i;
-}, Oe = (e, t, n, r) => y.gen(function* () {
-	let i = t.maxAttempts ?? 3, a = t.maxElapsed === void 0 ? Infinity : v.toMillis(K(t.maxElapsed)), o = yield* y.sync(() => Date.now()), s = 0;
+	let a = S.max([i, S.recurs(Math.max(0, r - 1))]);
+	return e.maxElapsed !== void 0 && (a = S.upTo({ duration: G(e.maxElapsed) })(a)), a;
+}, Oe = (e, t) => {
+	let n = y.toMillis(G(e.baseDelay ?? "200 millis")), r = e.strategy ?? "exponential", i = r === "fixed" ? n : r === "linear" ? n + y.toMillis(G(e.step ?? e.baseDelay ?? "200 millis")) * (t - 1) : n * (e.factor ?? 2) ** (t - 1);
+	return e.maxDelay !== void 0 && (i = Math.min(i, y.toMillis(G(e.maxDelay)))), (e.jitter ?? !0) === !0 && (i *= Math.random()), i;
+}, ke = (e, t, n, r) => b.gen(function* () {
+	let i = t.maxAttempts ?? 3, a = t.maxElapsed === void 0 ? Infinity : y.toMillis(G(t.maxElapsed)), o = yield* b.sync(() => Date.now()), s = 0;
 	for (;;) {
-		let c = yield* y.exit(e);
-		if (b.isSuccess(c)) return c.value;
-		let l = c.cause, u = g.failureOption(l), d = ae.isSome(u) ? u.value : g.squash(l);
+		let c = yield* b.exit(e);
+		if (x.isSuccess(c)) return c.value;
+		let l = c.cause, u = _.findErrorOption(l), d = ie.isSome(u) ? u.value : _.squash(l);
 		s += 1;
-		let f = (yield* y.sync(() => Date.now())) - o;
-		if (s >= i || !n(d) || f >= a) return yield* y.failCause(l);
+		let f = (yield* b.sync(() => Date.now())) - o;
+		if (s >= i || !n(d) || f >= a) return yield* b.failCause(l);
 		r?.(d);
-		let p = Se(d), m = p === void 0 ? De(t, s) : v.toMillis(p);
-		yield* y.sleep(v.millis(m));
+		let p = Ce(d), m = p === void 0 ? Oe(t, s) : y.toMillis(p);
+		yield* b.sleep(y.millis(m));
 	}
-}), ke = (e, t, n) => {
-	if (!we(t)) return e;
-	let r = Te(t);
-	if (t.respectRetryAfter === !0) return Oe(e, t, r, n);
-	let i = Ee(t), a = n ? y.tapError(e, (e) => y.sync(() => {
+}), Ae = (e, t, n) => {
+	if (!Te(t)) return e;
+	let r = Ee(t);
+	if (t.respectRetryAfter === !0) return ke(e, t, r, n);
+	let i = De(t), a = n ? b.tapError(e, (e) => b.sync(() => {
 		r(e) && n(e);
 	})) : e;
-	return y.retry(a, {
+	return b.retry(a, {
 		schedule: i,
 		while: r
 	});
-}, q = Symbol.for("voltro.workflow.workerLayer"), J = Symbol.for("voltro.workflow.version"), Y = "__voltroWorkflowMessages", X = "__voltroWorkflowFlowControl", Ae = (e) => typeof e == "object" && !!e && e[q] === !0, je = (e) => typeof e == "object" && e && e[J] !== void 0 ? e[J] : {
+}, K = Symbol.for("voltro.workflow.workerLayer"), q = Symbol.for("voltro.workflow.version"), J = "__voltroWorkflowMessages", Y = "__voltroWorkflowFlowControl", je = (e) => typeof e == "object" && !!e && e[K] === !0, X = (e) => (typeof e == "object" || typeof e == "function") && e !== null, Me = (e) => X(e) && e[q] !== void 0 ? e[q] : {
 	version: "1",
 	compatibleWith: ["1"],
 	patches: []
 }, Z = (e) => {
 	let t = e, n = `workflow '${e.name}' defect`;
 	return Object.assign(Object.create(Object.getPrototypeOf(e)), e, {
-		toLayer: (e) => t.toLayer((t, r) => y.locally(e(t, r), a, !0).pipe(y.catchAllDefect((e) => y.die(s(e, n))))),
-		execute: (...e) => t.execute(...e).pipe(y.catchAllDefect((e) => y.die(r(e, n)))),
+		toLayer: (e) => t.toLayer((t, r) => b.provideService(e(t, r), o, !0).pipe(b.catchDefect((e) => b.die(c(e, n))))),
+		execute: (...e) => t.execute(...e).pipe(b.catchDefect((e) => b.die(i(e, n)))),
 		annotate: (...e) => Z(t.annotate(...e)),
 		annotateContext: (...e) => Z(t.annotateContext(...e))
 	});
-}, Me = ((t) => {
-	let r = t.encrypted === !0, i = h.make(r ? {
-		...t,
-		payload: o(t.name, t.payload),
-		...t.success === void 0 ? {} : { success: e(t.success, `workflow '${t.name}' result`) },
-		...t.error === void 0 ? {} : { error: e(t.error, `workflow '${t.name}' failure`) }
-	} : t);
-	r && n(t.name);
-	let a = t.suspendOnFailure === !0 ? i.annotate(h.SuspendOnFailure, !0) : i, s = r ? Z(a) : a;
-	E(s, (e, n, r) => y.gen(function* () {
-		let i = s.payloadSchema.make(e), a = yield* ne.WorkflowEngine;
-		return yield* y.annotateCurrentSpan({ executionId: n }), yield* a.execute(s, {
+}, Ne = ((e) => {
+	let n = e.encrypted === !0, i = h.make(e.name, n ? {
+		...e,
+		payload: s(e.name, e.payload),
+		...e.success === void 0 ? {} : { success: t(e.success, `workflow '${e.name}' result`) },
+		...e.error === void 0 ? {} : { error: t(e.error, `workflow '${e.name}' failure`) }
+	} : e);
+	n && r(e.name);
+	let a = e.suspendOnFailure === !0 ? i.annotate(h.SuspendOnFailure, !0) : i, o = n ? Z(a) : a;
+	Object.defineProperty(o, "name", {
+		value: e.name,
+		enumerable: !0
+	}), T(o, (t, n, r) => b.gen(function* () {
+		let i = o.payloadSchema.make(t), a = yield* te.WorkflowEngine;
+		return yield* b.annotateCurrentSpan({ executionId: n }), yield* a.execute(o, {
 			executionId: n,
 			payload: i,
 			discard: r,
-			suspendedRetrySchedule: t.suspendedRetrySchedule
+			suspendedRetrySchedule: e.suspendedRetrySchedule
 		});
-	}).pipe(y.withSpan(`${t.name}.execute`, { captureStackTrace: !1 })));
-	let c = String(t.version ?? "1"), l = {
+	}).pipe(b.withSpan(`${e.name}.execute`)));
+	let c = String(e.version ?? "1"), l = {
 		version: c,
-		compatibleWith: (t.compatibleWith ?? [c]).map(String),
-		patches: [...t.patches ?? []]
+		compatibleWith: (e.compatibleWith ?? [c]).map(String),
+		patches: [...e.patches ?? []]
 	}, u = {
-		signals: { ...t.messages?.signals ?? {} },
-		updates: { ...t.messages?.updates ?? {} }
+		signals: { ...e.messages?.signals ?? {} },
+		updates: { ...e.messages?.updates ?? {} }
 	};
-	Object.defineProperty(s, J, {
+	Object.defineProperty(o, q, {
 		value: l,
 		enumerable: !1
-	}), Object.defineProperty(s, Y, {
+	}), Object.defineProperty(o, J, {
 		value: u,
 		enumerable: !1
-	}), w(s, oe(t.name, t));
-	let d = j({
-		workflowName: t.name,
-		payloadSchema: C.isSchema(t.payload) ? t.payload : C.Struct(t.payload),
-		control: t
+	}), oe(o, se(e.name, e));
+	let d = A({
+		workflowName: e.name,
+		payloadSchema: C.isSchema(e.payload) ? e.payload : C.Struct(e.payload),
+		control: e
 	});
-	d !== void 0 && Object.defineProperty(s, X, {
+	d !== void 0 && Object.defineProperty(o, Y, {
 		value: d,
 		enumerable: !1
 	});
-	let f = V(t.name, t.schedule);
-	return f !== void 0 && Object.defineProperty(s, H, {
+	let f = B(e.name, e.schedule);
+	return f !== void 0 && Object.defineProperty(o, V, {
 		value: f,
 		enumerable: !1
-	}), s;
-}), Ne = (e) => {
-	if (typeof e != "object" || !e) return;
-	let t = e[X];
+	}), o;
+}), Pe = (e) => {
+	if (!X(e)) return;
+	let t = e[Y];
 	return t === void 0 ? void 0 : t;
-}, Q = ((n) => {
-	if (n.encrypted !== !0) return f.make(n);
-	t(n.name);
-	let r = C.isSchema(n.payload) ? n.payload : C.Struct(n.payload);
-	return f.make({
-		...n,
-		payload: e(r, `queue '${n.name}' payload`),
-		success: e(n.success ?? C.Void, `queue '${n.name}' result`),
-		error: e(n.error ?? C.Never, `queue '${n.name}' failure`)
+}, Q = (e) => {
+	if (e.encrypted !== !0) return p.make(e);
+	n(e.name);
+	let r = C.isSchema(e.payload) ? e.payload : C.Struct(e.payload);
+	return p.make({
+		...e,
+		payload: t(r, `queue '${e.name}' payload`),
+		success: t(e.success ?? C.Void, `queue '${e.name}' result`),
+		error: t(e.error ?? C.Never, `queue '${e.name}' failure`)
 	});
-}), Pe = ((e, ...t) => y.flatMap(x.get(a), (n) => n && !i(e.name) ? y.die(/* @__PURE__ */ Error(`an encrypted workflow enqueued into durable queue '${e.name}', which is not encrypted: the queue's journal would hold the value in plaintext. Declare \`durableQueue({ …, encrypted: true })\`.`)) : f.process(e, ...t))), Fe = ((...e) => {
-	let t = f.worker(...e);
-	return Object.defineProperty(t, q, {
+}, Fe = ((e, ...t) => b.flatMap(o, (n) => n && !a(e.name) ? b.die(/* @__PURE__ */ Error(`an encrypted workflow enqueued into durable queue '${e.name}', which is not encrypted: the queue's journal would hold the value in plaintext. Declare \`durableQueue({ …, encrypted: true })\`.`)) : p.process(e, ...t))), Ie = ((...e) => {
+	let t = p.worker(...e);
+	return Object.defineProperty(t, K, {
 		value: !0,
 		enumerable: !1
 	}), t;
-}), Ie = m.rateLimit, $ = (e) => y.gen(function* () {
-	let t = yield* N, n = yield* y.serviceOption(M), r = v.toMillis(v.decode(e.duration));
+}), Le = (e) => b.gen(function* () {
+	let t = yield* l.make({
+		name: `${e.name}/rateLimit`,
+		success: C.Number,
+		error: g.RateLimiterError,
+		execute: b.gen(function* () {
+			let t = yield* (yield* g.RateLimiter).consume({
+				...e,
+				onExceeded: "delay"
+			});
+			return y.toMillis(t.delay);
+		})
+	});
+	t > 0 && (yield* d.sleep({
+		name: `${e.name}/rateLimit`,
+		duration: y.millis(t)
+	}));
+}), $ = (e) => b.gen(function* () {
+	let t = yield* M, n = yield* b.serviceOption(j), r = y.toMillis(y.fromInputUnsafe(e.duration));
 	if (t !== void 0 && n._tag === "Some") {
-		let i = n.value, a = new Date(Date.now() + r).toISOString(), o = yield* I;
-		yield* y.promise(() => i.recordEvent({
+		let i = n.value, a = new Date(Date.now() + r).toISOString(), o = yield* F;
+		yield* b.promise(() => i.recordEvent({
 			runId: t,
 			eventType: "timer-set",
 			payload: {
@@ -384,7 +405,7 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 			}
 		}).catch(() => {}));
 		let s = Date.now();
-		yield* u.sleep(e), yield* y.promise(() => i.recordEvent({
+		yield* d.sleep(e), yield* b.promise(() => i.recordEvent({
 			runId: t,
 			eventType: "timer-fired",
 			payload: {
@@ -395,89 +416,92 @@ var T = Symbol.for("@voltro/workflow/PreparedExecution"), E = (e, t) => {
 		}).catch(() => {}));
 		return;
 	}
-	yield* u.sleep(e);
-}), Le = (e) => y.gen(function* () {
-	let t = (yield* c.make({
+	yield* d.sleep(e);
+}), Re = (e) => b.gen(function* () {
+	let t = (yield* l.make({
 		name: `sleepUntil:${e.name}`,
 		success: C.Number,
-		execute: y.sync(() => e.until instanceof Date ? e.until.getTime() : e.until)
+		execute: b.sync(() => e.until instanceof Date ? e.until.getTime() : e.until)
 	})) - Date.now();
 	t <= 0 || (yield* $({
 		name: e.name,
 		duration: `${t} millis`
 	}));
-}), Re = (e, t, n, r) => y.gen(function* () {
-	let i = yield* N, o = yield* c.CurrentAttempt, s = yield* y.serviceOption(M), l = yield* y.serviceOption(z), u = l._tag === "Some" ? l.value.interceptor(t, {
-		runId: i ?? "unrecorded",
-		stepName: e,
-		attempt: o
-	}) : t, d, f, p = !1;
-	if (i !== void 0 && s._tag === "Some") {
-		f = s.value;
-		let t = r === void 0 ? void 0 : (({ retryable: e, ...t }) => t)(r);
-		p = yield* x.get(a);
+}), ze = (t, n, r, i) => b.gen(function* () {
+	let a = yield* M, s = yield* l.CurrentAttempt, c = yield* b.serviceOption(j), u = yield* b.serviceOption(R), d = u._tag === "Some" ? u.value.interceptor(n, {
+		runId: a ?? "unrecorded",
+		stepName: t,
+		attempt: s
+	}) : n, f, p, m = !1;
+	if (a !== void 0 && c._tag === "Some") {
+		p = c.value;
+		let e = i === void 0 ? void 0 : (({ retryable: e, ...t }) => t)(i);
+		m = yield* o;
 		try {
-			d = yield* y.promise(() => f.startStep({
-				runId: i,
-				stepName: e,
-				attempt: o,
-				stepInput: n,
-				sealed: p,
-				...t === void 0 ? {} : { retryPolicy: t }
+			f = yield* b.promise(() => p.startStep({
+				runId: a,
+				stepName: t,
+				attempt: s,
+				stepInput: r,
+				sealed: m,
+				...e === void 0 ? {} : { retryPolicy: e }
 			}));
 		} catch {
-			d = void 0;
+			f = void 0;
 		}
 	}
-	let m = Date.now();
-	return yield* y.locally(ke(u, r), F, e).pipe(y.tap((e) => d && f ? y.promise(async () => {
+	let h = Date.now();
+	return yield* b.provideService(Ae(d, i), P, t).pipe(b.tap((e) => f && p ? b.promise(async () => {
 		try {
-			await f.endStepSuccess({
-				stepRecordId: d,
-				sealed: p,
+			await p.endStepSuccess({
+				stepRecordId: f,
+				sealed: m,
 				output: e,
-				durationMs: Date.now() - m
+				durationMs: Date.now() - h
 			});
 		} catch {}
-	}) : y.void), y.tapErrorCause((e) => d && f && !g.isInterruptedOnly(e) ? y.promise(async () => {
+	}) : b.void), b.tapCause((t) => f && p && !_.hasInterruptsOnly(t) ? b.promise(async () => {
 		try {
-			let t = g.failureOption(e), n = Array.from(g.failures(e)), r = Array.from(g.defects(e)), i = t._tag === "Some" ? t.value : r[0] ?? g.squash(e), a = i?.message ?? String(i), o = i && typeof i == "object" && "_tag" in i ? String(i._tag) : null;
-			await f.endStepFailure({
-				stepRecordId: d,
-				sealed: p,
-				errorTag: o,
-				errorMessage: a,
+			let n = _.findErrorOption(t), r = t.reasons.filter(_.isFailReason).map((e) => e.error), i = t.reasons.filter(_.isDieReason).map((e) => e.defect), a = n._tag === "Some" ? n.value : i[0] ?? _.squash(t), o = e(a), s = a && typeof a == "object" && "_tag" in a ? String(a._tag) : null;
+			await p.endStepFailure({
+				stepRecordId: f,
+				sealed: m,
+				errorTag: s,
+				errorMessage: o,
 				errorCause: {
-					pretty: g.pretty(e),
-					failures: n,
-					defects: r
+					pretty: _.pretty(t),
+					failures: r,
+					defects: i
 				},
-				durationMs: Date.now() - m
+				durationMs: Date.now() - h
 			});
 		} catch {}
-	}) : y.void));
-}), ze = (e) => y.gen(function* () {
-	let t = yield* x.get(U);
+	}) : b.void));
+}), Be = (e) => b.gen(function* () {
+	let t = yield* H;
 	if (t === void 0) return;
 	let n = t.reach(e);
-	n !== void 0 && (yield* G([n]));
-}), Be = (e, t, n) => {
-	let i = e;
+	n !== void 0 && (yield* W([n]));
+}), Ve = (e, t, n) => {
+	let r = e;
 	return {
 		...e,
-		commit: () => y.zipRight(ze(t), n === void 0 ? i : y.flatMap(x.get(a), (e) => e ? n().pipe(y.catchAllDefect((e) => y.die(r(e, `step '${t}' defect`)))) : i))
+		...re.Prototype({
+			label: "Activity",
+			evaluate: () => b.andThen(Be(t), n === void 0 ? r : b.flatMap(o, (e) => e ? n().pipe(b.catchDefect((e) => b.die(i(e, `step '${t}' defect`)))) : r))
+		})
 	};
-}, Ve = (t) => {
-	let { input: n, retry: r, ...i } = t, a = Re(i.name, i.execute, n, r), o = c.make({
+}, He = (e) => {
+	let { input: n, retry: r, ...i } = e, a = ze(i.name, i.execute, n, r), o = l.make({
 		...i,
 		execute: a
-	}), l, u = `step '${i.name}' defect`;
-	return Be(o, i.name, () => l ??= c.make({
+	}), s, u = `step '${i.name}' defect`;
+	return Ve(o, i.name, () => s ??= l.make({
 		...i,
-		success: e(i.success ?? C.Void, `step '${i.name}' result`),
-		error: e(i.error ?? C.Never, `step '${i.name}' failure`),
-		execute: a.pipe(y.catchAllDefect((e) => y.die(s(e, u))))
+		success: t(i.success ?? C.Void, `step '${i.name}' result`),
+		error: t(i.error ?? C.Never, `step '${i.name}' failure`),
+		execute: a.pipe(b.catchDefect((e) => b.die(c(e, u))))
 	}));
-}, He = (e) => y.map(x.get(L), (t) => t.includes(e)), Ue = h.withCompensation, We = c.idempotencyKey;
+}, Ue = (e) => b.map(I, (t) => t.includes(e)), We = h.withCompensation, Ge = l.idempotencyKey;
 //#endregion
-export { be as A, me as B, te as C, G as D, W as E, N as F, D as G, R as H, F as I, j as J, ue as K, I as L, P as M, he as N, B as O, L as P, M as R, Me as S, xe as T, de as U, ge as V, pe as W, ce as X, E as Y, se as Z, Le as _, d as a, l as b, ee as c, Ae as d, He as f, $ as g, Ie as h, q as i, V as j, H as k, Ne as l, Fe as m, Y as n, Q as o, Pe as p, le as q, J as r, p as s, X as t, je as u, Ve as v, U as w, Ue as x, We as y, z };
+export { xe as A, he as B, ee as C, W as D, U as E, M as F, E as G, L as H, P as I, A as J, de as K, F as L, N as M, ge as N, z as O, I as P, j as R, Ne as S, Se as T, fe as U, _e as V, me as W, le as X, T as Y, ce as Z, Re as _, f as a, u as b, Pe as c, je as d, Ue as f, $ as g, Le as h, K as i, B as j, V as k, Me as l, Ie as m, J as n, Q as o, Fe as p, ue as q, q as r, m as s, Y as t, X as u, He as v, H as w, We as x, Ge as y, R as z };