@voltro/workflow 0.62.3 → 0.64.0

package/dist/{primitives-B-HlFCap.js → primitives-CqHxfASq.js}

@@ -1,16 +1,17 @@
 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 te, Schedule as _, Schema as ne } from "effect";
+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 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), v = (e) => e?.cancelOn !== void 0 && e.cancelOn.length > 0, y = [
+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 = [
 	"debounce",
 	"batch",
 	"throttle",
 	"concurrency"
-], b = (e) => {
+], S = (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;
-}, x = (e, t, n) => {
+}, C = (e, t, n) => {
 	let r;
 	try {
 		r = p.toMillis(p.decode(e));
@@ -19,26 +20,26 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 	}
 	if (!Number.isFinite(r) || r <= 0) throw Error(`workflow '${n}': ${t} must be a positive finite duration, got ${String(e)}`);
 	return r;
-}, S = (e, t, n) => {
+}, w = (e, t, n) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`workflow '${n}': ${t} must be a positive integer, got ${String(e)}`);
 	return e;
-}, C = (e, t, n) => {
+}, T = (e, t, n) => {
 	if (typeof e != "function") throw Error(`workflow '${n}': ${t} must be a function of the payload`);
 	return e;
-}, w = (e) => {
+}, E = (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";
-}, T = (e) => {
+}, D = (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 = x(e.period, "debounce.period", t), a = e.timeout === void 0 ? void 0 : x(e.timeout, "debounce.timeout", t);
+		let e = n.debounce, i = C(e.period, "debounce.period", t), a = e.timeout === void 0 ? void 0 : C(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: C(e.key, "debounce.key", t),
+			key: T(e.key, "debounce.key", t),
 			periodMs: i,
 			...a === void 0 ? {} : { timeoutMs: a }
 		};
@@ -47,7 +48,7 @@ var re = (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: C(e.key, "singleton.key", t),
+			key: T(e.key, "singleton.key", t),
 			mode: e.mode
 		};
 	}
@@ -55,34 +56,34 @@ var re = (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: S(e.limit, "concurrency.limit", t),
-			...e.key === void 0 ? {} : { key: C(e.key, "concurrency.key", t) },
+			limit: w(e.limit, "concurrency.limit", t),
+			...e.key === void 0 ? {} : { key: T(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: S(e.limit, "throttle.limit", t),
-			periodMs: x(e.period, "throttle.period", t),
-			...e.key === void 0 ? {} : { key: C(e.key, "throttle.key", t) }
+			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) }
 		};
 	}
 	if (n.rateLimit !== void 0) {
 		let e = n.rateLimit;
 		r.rateLimit = {
-			limit: S(e.limit, "rateLimit.limit", t),
-			periodMs: x(e.period, "rateLimit.period", t),
-			...e.key === void 0 ? {} : { key: C(e.key, "rateLimit.key", t) }
+			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) }
 		};
 	}
 	if (n.batch !== void 0) {
 		let i = n.batch;
-		if (e.payloadSchema !== void 0 && !w(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 && !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.`);
 		r.batch = {
-			...i.key === void 0 ? {} : { key: C(i.key, "batch.key", t) },
-			maxSize: S(i.maxSize, "batch.maxSize", t),
-			timeoutMs: x(i.timeout, "batch.timeout", t),
+			...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.item === void 0 ? {} : { item: i.item }
 		};
 	}
@@ -91,7 +92,7 @@ var re = (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 : x(e.start, "timeouts.start", t), a = e.finish === void 0 ? void 0 : x(e.finish, "timeouts.finish", t);
+		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);
 		(i !== void 0 || a !== void 0) && (r.timeouts = {
 			...i === void 0 ? {} : { startMs: i },
 			...a === void 0 ? {} : { finishMs: a }
@@ -111,7 +112,7 @@ var re = (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 : x(e.within, `${r}.within`, t);
+			let i = e.within === void 0 ? void 0 : C(e.within, `${r}.within`, t);
 			return {
 				event: e.event,
 				schema: e.schema,
@@ -122,9 +123,9 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		});
 		e.length > 0 && (r.cancelOn = e);
 	}
-	if (r.timeouts?.startMs !== void 0 && b(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 && 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.`);
 	return r;
-}, E = (e) => {
+}, O = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e) {
 		let e = n?.concurrency;
@@ -137,25 +138,25 @@ var re = (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);
 	}
-}, D = class extends d.Tag("@voltro/WorkflowRunRecorder")() {}, O = g.unsafeMake(void 0), k = g.unsafeMake(void 0), A = g.unsafeMake(void 0), j = g.unsafeMake([]), M = () => g.get(O), N = () => g.get(k), P = class extends d.Tag("@voltro/WorkflowStepInterceptor")() {}, F = 864e5, ie = /* @__PURE__ */ new Set([
+}, 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([
 	"skip",
 	"buffer",
 	"cancelOther"
-]), ae = /* @__PURE__ */ new Set([
+]), L = /* @__PURE__ */ new Set([
 	"skip",
 	"latest",
 	"all"
-]), I = (e, t) => {
+]), R = (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 r = t.onOverlap ?? "skip";
-	if (!ie.has(r)) throw Error(`workflow '${e}': schedule.onOverlap must be 'skip' | 'buffer' | 'cancelOther', got ${JSON.stringify(r)}`);
+	if (!ae.has(r)) throw Error(`workflow '${e}': schedule.onOverlap must be 'skip' | 'buffer' | 'cancelOther', got ${JSON.stringify(r)}`);
 	let i = t.backfill ?? "skip";
-	if (!ae.has(i)) throw Error(`workflow '${e}': schedule.backfill must be 'skip' | 'latest' | 'all', got ${JSON.stringify(i)}`);
-	let a = F;
-	return t.maxRuntime !== void 0 && (a = L(t.maxRuntime, e)), {
+	if (!L.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)), {
 		cron: t.cron,
 		timezone: t.timezone,
 		...t.payload === void 0 ? {} : { payload: t.payload },
@@ -163,7 +164,7 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		backfill: i,
 		maxRuntimeMs: a
 	};
-}, L = (e, t) => {
+}, z = (e, t) => {
 	let n;
 	try {
 		n = p.toMillis(p.decode(e));
@@ -172,11 +173,11 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 	}
 	if (!Number.isFinite(n) || n <= 0) throw Error(`workflow '${t}': schedule.maxRuntime must be a positive finite duration`);
 	return n;
-}, R = "__voltroWorkflowSchedule", z = (e) => {
+}, B = "__voltroWorkflowSchedule", V = (e) => {
 	if (typeof e != "object" || !e) return;
-	let t = e[R];
+	let t = e[B];
 	return t === void 0 ? void 0 : t;
-}, B = (e) => {
+}, H = (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);
@@ -205,79 +206,79 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 			return e;
 		}
 	};
-}, V = g.unsafeMake(void 0), H = (e) => ({
+}, U = g.unsafeMake(void 0), W = (e) => ({
 	kind: e.kind,
 	stepName: e.stepName,
 	recorded: e.recorded,
 	reached: e.reached,
 	detail: e.detail
-}), U = (e) => m.gen(function* () {
+}), G = (e) => m.gen(function* () {
 	if (e.length === 0) return;
-	let t = yield* g.get(O), n = yield* m.serviceOption(D);
+	let t = yield* g.get(A), n = yield* m.serviceOption(k);
 	if (t === void 0 || n._tag !== "Some") return;
 	let r = n.value;
 	for (let n of e) yield* m.promise(() => r.recordEvent({
 		runId: t,
 		eventType: "nondeterminism-suspected",
-		payload: H(n)
+		payload: W(n)
 	}).then(() => void 0).catch(() => void 0));
-}), W = (e) => {
+}), K = (e) => {
 	if (typeof e != "object" || !e) return;
 	let t = e.retryAfterMillis;
 	if (typeof t == "number" && Number.isFinite(t) && t >= 0) return p.millis(t);
 	let n = e.retryAfter;
 	if (typeof n == "number" && Number.isFinite(n) && n >= 0) return p.seconds(n);
-}, G = (e) => p.decode(e), K = (e) => typeof e == "object" && e && "_tag" in e ? String(e._tag) : void 0, q = (e) => e !== void 0 && (e.maxAttempts ?? 3) > 1, J = (e) => {
+}, 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 (e.retryable) return e.retryable;
 	if (e.retryableErrors && e.retryableErrors.length > 0) {
 		let t = new Set(e.retryableErrors);
 		return (e) => {
-			let n = K(e);
+			let n = J(e);
 			return n !== void 0 && t.has(n);
 		};
 	}
 	return () => !0;
-}, oe = (e) => {
-	let t = e.baseDelay ?? "200 millis", n = e.strategy ?? "exponential", r = e.maxAttempts ?? 3, i = n === "linear" ? _.linear(G(e.step ?? t)) : n === "fixed" ? _.spaced(G(t)) : _.exponential(G(t), e.factor ?? 2);
+}, 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);
 	if (e.maxDelay !== void 0) {
-		let t = G(e.maxDelay);
-		i = _.modifyDelay(i, (e, n) => p.min(n, t));
+		let t = q(e.maxDelay);
+		i = v.modifyDelay(i, (e, n) => p.min(n, t));
 	}
-	(e.jitter ?? !0) === !0 && (i = _.jittered(i));
-	let a = _.intersect(i, _.recurs(Math.max(0, r - 1)));
-	return e.maxElapsed !== void 0 && (a = _.upTo(G(e.maxElapsed))(a)), a;
-}, se = (e, t) => {
-	let n = p.toMillis(G(e.baseDelay ?? "200 millis")), r = e.strategy ?? "exponential", i = r === "fixed" ? n : r === "linear" ? n + p.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, p.toMillis(G(e.maxDelay)))), (e.jitter ?? !0) === !0 && (i *= Math.random()), i;
-}, ce = (e, t, n, r) => m.gen(function* () {
-	let i = t.maxAttempts ?? 3, a = t.maxElapsed === void 0 ? Infinity : p.toMillis(G(t.maxElapsed)), o = yield* m.sync(() => Date.now()), s = 0;
+	(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;
 	for (;;) {
 		let c = yield* m.exit(e);
 		if (ee.isSuccess(c)) return c.value;
-		let l = c.cause, d = u.failureOption(l), f = te.isSome(d) ? d.value : u.squash(l);
+		let l = c.cause, d = u.failureOption(l), f = _.isSome(d) ? d.value : u.squash(l);
 		s += 1;
 		let h = (yield* m.sync(() => Date.now())) - o;
 		if (s >= i || !n(f) || h >= a) return yield* m.failCause(l);
 		r?.(f);
-		let g = W(f), _ = g === void 0 ? se(t, s) : p.toMillis(g);
-		yield* m.sleep(p.millis(_));
+		let g = K(f), v = g === void 0 ? le(t, s) : p.toMillis(g);
+		yield* m.sleep(p.millis(v));
 	}
-}), le = (e, t, n) => {
-	if (!q(t)) return e;
-	let r = J(t);
-	if (t.respectRetryAfter === !0) return ce(e, t, r, n);
-	let i = oe(t), a = n ? m.tapError(e, (e) => m.sync(() => {
+}), 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(() => {
 		r(e) && n(e);
 	})) : e;
 	return m.retry(a, {
 		schedule: i,
 		while: r
 	});
-}, Y = Symbol.for("voltro.workflow.workerLayer"), X = Symbol.for("voltro.workflow.version"), Z = "__voltroWorkflowMessages", Q = "__voltroWorkflowFlowControl", ue = (e) => typeof e == "object" && !!e && e[Y] === !0, de = (e) => typeof e == "object" && e && e[X] !== void 0 ? e[X] : {
+}, 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] : {
 	version: "1",
 	compatibleWith: ["1"],
 	patches: []
-}, fe = ((e) => {
+}, me = ((e) => {
 	let t = c.make(e), n = e.suspendOnFailure === !0 ? t.annotate(c.SuspendOnFailure, !0) : t, r = String(e.version ?? "1"), i = {
 		version: r,
 		compatibleWith: (e.compatibleWith ?? [r]).map(String),
@@ -292,8 +293,8 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 	}), Object.defineProperty(n, Z, {
 		value: a,
 		enumerable: !1
-	});
-	let o = T({
+	}), te(n, ne(e.name, e));
+	let o = D({
 		workflowName: e.name,
 		payloadSchema: e.payload,
 		control: e
@@ -302,25 +303,25 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		value: o,
 		enumerable: !1
 	});
-	let s = I(e.name, e.schedule);
-	return s !== void 0 && Object.defineProperty(n, R, {
+	let s = R(e.name, e.schedule);
+	return s !== void 0 && Object.defineProperty(n, B, {
 		value: s,
 		enumerable: !1
 	}), n;
-}), pe = (e) => {
+}), he = (e) => {
 	if (typeof e != "object" || !e) return;
 	let t = e[Q];
 	return t === void 0 ? void 0 : t;
-}, me = i.make, he = i.process, ge = ((...e) => {
+}, ge = i.make, _e = i.process, ve = ((...e) => {
 	let t = i.worker(...e);
 	return Object.defineProperty(t, Y, {
 		value: !0,
 		enumerable: !1
 	}), t;
-}), _e = o.rateLimit, $ = (e) => m.gen(function* () {
-	let t = yield* O, r = yield* m.serviceOption(D), i = p.toMillis(p.decode(e.duration));
+}), ye = o.rateLimit, $ = (e) => m.gen(function* () {
+	let t = yield* A, r = yield* m.serviceOption(k), i = p.toMillis(p.decode(e.duration));
 	if (t !== void 0 && r._tag === "Some") {
-		let a = r.value, o = new Date(Date.now() + i).toISOString(), s = yield* A;
+		let a = r.value, o = new Date(Date.now() + i).toISOString(), s = yield* M;
 		yield* m.promise(() => a.recordEvent({
 			runId: t,
 			eventType: "timer-set",
@@ -344,18 +345,18 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		return;
 	}
 	yield* n.sleep(e);
-}), ve = (t) => m.gen(function* () {
+}), be = (t) => m.gen(function* () {
 	let n = (yield* e.make({
 		name: `sleepUntil:${t.name}`,
-		success: ne.Number,
+		success: y.Number,
 		execute: m.sync(() => t.until instanceof Date ? t.until.getTime() : t.until)
 	})) - Date.now();
 	n <= 0 || (yield* $({
 		name: t.name,
 		duration: `${n} millis`
 	}));
-}), ye = (t, n, r, i) => m.gen(function* () {
-	let a = yield* O, o = yield* e.CurrentAttempt, s = yield* m.serviceOption(D), c = yield* m.serviceOption(P), l = c._tag === "Some" ? c.value.interceptor(n, {
+}), 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, {
 		runId: a ?? "unrecorded",
 		stepName: t,
 		attempt: o
@@ -376,7 +377,7 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 		}
 	}
 	let p = Date.now();
-	return yield* le(l, i).pipe(m.tap((e) => d && f ? m.promise(async () => {
+	return yield* de(l, i).pipe(m.tap((e) => d && f ? m.promise(async () => {
 		try {
 			await f.endStepSuccess({
 				stepRecordId: d,
@@ -400,23 +401,23 @@ var re = (e) => e !== void 0 && (e.debounce !== void 0 || e.singleton !== void 0
 			});
 		} catch {}
 	}) : m.void));
-}), be = (e) => m.gen(function* () {
-	let t = yield* g.get(V);
+}), Se = (e) => m.gen(function* () {
+	let t = yield* g.get(U);
 	if (t === void 0) return;
 	let n = t.reach(e);
-	n !== void 0 && (yield* U([n]));
-}), xe = (e, t) => {
+	n !== void 0 && (yield* G([n]));
+}), Ce = (e, t) => {
 	let n = e;
 	return {
 		...e,
-		commit: () => m.zipRight(be(t), n)
+		commit: () => m.zipRight(Se(t), n)
 	};
-}, Se = (t) => {
+}, we = (t) => {
 	let { input: n, retry: r, ...i } = t;
-	return xe(e.make({
+	return Ce(e.make({
 		...i,
-		execute: ye(i.name, i.execute, n, r)
+		execute: xe(i.name, i.execute, n, r)
 	}), i.name);
-}, Ce = (e) => m.map(g.get(j), (t) => t.includes(e)), we = c.withCompensation, Te = e.idempotencyKey;
+}, Te = (e) => m.map(g.get(N), (t) => t.includes(e)), Ee = c.withCompensation, De = e.idempotencyKey;
 //#endregion
-export { z as A, y as B, l as C, U as D, H as E, A as F, T as G, b as H, D as I, P as L, k as M, j as N, F as O, O as P, N as R, fe as S, B as T, v as U, E as V, re as W, ve as _, r as a, t as b, s as c, ue as d, Ce as f, $ as g, _e as h, Y as i, I as j, R as k, pe as l, ge as m, Z as n, me as o, he as p, X as r, a as s, Q as t, de as u, Se as v, V as w, we as x, Te as y, M as z };
+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 };

package/dist/primitives.d.ts

@@ -6,6 +6,7 @@ import { Effect } from 'effect';
 import { FiberRef } from 'effect';
 import { Schema } from 'effect';
 import { Activity as stepModule } from '@effect/workflow';
+import { WorkflowAccessOptions } from '@voltro/protocol';
 import { Workflow as workflowModule } from '@effect/workflow';
 
 /**
@@ -881,7 +882,7 @@ declare type WorkflowFn = <const Name extends string, Payload extends WorkflowPa
     readonly schedule?: WorkflowScheduleDeclaration<DecodedPayload<Payload>>;
 } & Omit<WorkflowBaseOptions, 'name' | 'payload' | 'idempotencyKey' | 'success' | 'error'> & WorkflowVersionOptions & {
     readonly messages?: Messages;
-} & WorkflowFlowControl<DecodedPayload<Payload>>) => workflowModule.Workflow<Name, PayloadSchemaOf<Payload>, Success, Error> & WorkflowMessagesCarrier<NormaliseWorkflowMessages<Messages>>;
+} & WorkflowFlowControl<DecodedPayload<Payload>> & WorkflowAccessOptions<DecodedPayload<Payload>>) => workflowModule.Workflow<Name, PayloadSchemaOf<Payload>, Success, Error> & WorkflowMessagesCarrier<NormaliseWorkflowMessages<Messages>>;
 
 declare type WorkflowMake = typeof workflowModule.make;
 

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-B-HlFCap.js";
+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 };