@stakekit/widget 0.0.287 → 0.0.289

package/dist/package/{wagmi-connect-result-BJ91_jis.js → wagmi-connect-result-Bh6qH5iI.js}

@@ -1,6 +1,6 @@
 "use client";
-import { A as constEmptyAnnotations, At as isNotUndefined, B as isCause, Bt as constNull, C as TaggedError$1, Ct as hasProperty, D as causeEmpty, E as causeAnnotate, F as evaluate, G as isInterruptReason, Gt as dual, H as isEffect$1, Ht as constUndefined, I as exitDie, It as isTagged, J as withFiber$1, K as makePrimitive, L as exitFail, M as contAll, N as contE, O as causeFail, Ot as isIterable, P as done$2, Q as internalCall, Qt as pipeArguments, R as exitFailCause, S as StackTraceKey, St as symbol$1, T as args, Tt as isBoolean, U as isExit$1, Ut as constVoid, V as isDone$1, Vt as constTrue, W as isFailReason$1, Wt as constant, X as assignProperty, Y as assignProperties, Z as SingleShotGen, Zt as Class$1, _ as Fail, _t as hash, a as isFailure$1, b as PipeInspectableProto, bt as string, d as succeed$6, ft as equals$1, g as ExitTypeId, gt as combine, h as Error$2, it as format, j as contA, jt as isNumber, k as causeFromReasons, lt as currentFiberTypeId, m as Done, mt as symbol, nt as toJson, ot as formatJson, p as CauseImpl, q as makePrimitiveProto, qt as identity, rt as toStringUnknown, s as isSuccess$1, t as fail$6, tt as NodeInspectSymbol, u as match$3, v as InterruptorStackTrace$1, vt as number, w as Yield, x as ReasonBase, xt as structure, y as NoSuchElementError$1, yt as random, z as exitSucceed, zt as constFalse } from "./Result-Cem4lYBf.js";
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Effectable.js
+import { $ as internalCall, A as causeFromReasons, At as isIterable, B as exitSucceed, C as TaggedError$1, Ct as structure, D as causeDie, Dt as isBoolean, E as causeAnnotate, F as done$2, G as isFailReason$1, Gt as constUndefined, H as isDone$1, Ht as constFalse, I as evaluate, J as makePrimitiveProto, Jt as dual, K as isInterruptReason, Kt as constVoid, L as exitDie, M as contA, N as contAll, Nt as isNotUndefined, O as causeEmpty, P as contE, Pt as isNumber, Q as SingleShotGen, R as exitFail, S as StackTraceKey, St as string, T as args, Tt as hasProperty, U as isEffect$1, Ut as constNull, V as isCause, W as isExit$1, Wt as constTrue, X as assignProperties, Xt as identity, Y as withFiber$1, Z as assignProperty, _ as Fail, a as isFailure$1, at as toJson, b as PipeInspectableProto, bt as number, d as succeed$6, en as Class$1, et as getStackTraceLimit, ft as currentFiberTypeId, g as ExitTypeId, gt as symbol, h as Error$2, ht as equals$1, it as NodeInspectSymbol, j as constEmptyAnnotations, k as causeFail, lt as formatJson, m as Done, ot as toStringUnknown, p as CauseImpl, q as makePrimitive, qt as constant, s as isSuccess$1, st as format, t as fail$6, tn as pipeArguments, tt as setStackTraceLimit, u as match$3, v as InterruptorStackTrace$1, vt as combine, w as Yield, wt as symbol$1, x as ReasonBase, xt as random, y as NoSuchElementError$1, yt as hash, z as exitFailCause, zt as isTagged } from "./Result-BA6lrqKV.js";
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Effectable.js
 /**
 * Create a low-level `Effect` prototype.
 *
@@ -15,6 +15,7 @@ import { A as constEmptyAnnotations, At as isNotUndefined, B as isCause, Bt as c
 * When the effect is evaluated, it calls `evaluate` with the current fiber.
 *
 * @see {@link Class} for a class-based approach to defining custom Effect values
+* @see {@link Mixin} for wrapping an existing class constructor
 *
 * @category prototypes
 * @since 4.0.0
@@ -24,7 +25,7 @@ var Prototype = (options) => makePrimitiveProto({
 	[evaluate]: options.evaluate
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Equivalence.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Equivalence.js
 /**
 * Creates a custom equivalence relation with an optimized reference equality check.
 *
@@ -198,11 +199,11 @@ function Array_(item) {
 	});
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/option.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/option.js
 /**
 * @since 2.0.0
 */
-var TypeId$11 = "~effect/data/Option";
+var TypeId$11 = "~effect/Option";
 var CommonProto = {
 	[TypeId$11]: { _A: (_) => _ },
 	...PipeInspectableProto,
@@ -262,13 +263,14 @@ var isSome$1 = (fa) => fa._tag === "Some";
 /** @internal */
 var none$1 = /*#__PURE__*/ Object.create(NoneProto);
 /** @internal */
-var some$1 = (value) => {
-	const a = Object.create(SomeProto);
-	a.value = value;
-	return a;
+var SomeImpl = function(value) {
+	this.value = value;
 };
+SomeImpl.prototype = SomeProto;
+/** @internal */
+var some$1 = (value) => new SomeImpl(value);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Order.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Order.js
 /**
 * Defines comparison functions for ordered values.
 *
@@ -632,7 +634,7 @@ var min$1 = (O) => dual(2, (self, that) => self === that || O(self, that) < 1 ?
 */
 var max$1 = (O) => dual(2, (self, that) => self === that || O(self, that) > -1 ? self : that);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Option.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Option.js
 /**
 * Creates an `Option` representing the absence of a value.
 *
@@ -1147,7 +1149,7 @@ var filter$6 = /*#__PURE__*/ dual(2, (self, predicate) => isNone(self) ? none()
 */
 var exists = /*#__PURE__*/ dual(2, (self, refinement) => isNone(self) ? false : refinement(self.value));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Context.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Context.js
 /**
 * Runtime type identifier attached to `Context` service keys and used by
 * `isKey` to recognize them.
@@ -1744,14 +1746,29 @@ var mergeAll$1 = (...ctxs) => {
 */
 var Reference = Service;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/array.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/array.js
 /**
 * @since 2.0.0
 */
 /** @internal */
 var isArrayNonEmpty$1 = (self) => self.length > 0;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Iterable.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/count.js
+/**
+* Normalizes a collection count to a non-negative integer. `NaN` and
+* non-positive values become `0`; positive infinity is preserved.
+*
+* @internal
+*/
+var normalize = (n) => n > 0 ? Math.floor(n) : 0;
+/**
+* Normalizes a collection count to an integer greater than or equal to `1`.
+*
+* @internal
+*/
+var normalizeNonEmpty = (n) => Math.max(1, normalize(n));
+//#endregion
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Iterable.js
 /**
 * Gets the first element of an `Iterable` without returning an `Option`.
 *
@@ -1872,18 +1889,7 @@ var constEmptyIterator = { next() {
 */
 var empty$3 = () => constEmpty;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Array.js
-/**
-* Works with JavaScript arrays, readonly arrays, and non-empty arrays.
-*
-* The helpers cover common collection work such as creating arrays, reading
-* elements, transforming values, sorting, grouping, splitting, combining, and
-* reducing many values to one result. Helpers that change contents return new
-* arrays and preserve non-empty array types when the result is guaranteed to
-* contain values.
-*
-* @since 2.0.0
-*/
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Array.js
 /**
 * Exposes the global array constructor.
 *
@@ -2338,6 +2344,10 @@ var chop = /*#__PURE__*/ dual(2, (self, f) => {
 * Use when downstream code requires the left side of the split to contain at
 * least one element.
 *
+* **Details**
+*
+* `n` is rounded down and clamped to `[1, length]`. `NaN` is treated as `1`.
+*
 * **Example** (Splitting a non-empty array)
 *
 * ```ts import.meta.vitest
@@ -2352,7 +2362,7 @@ var chop = /*#__PURE__*/ dual(2, (self, f) => {
 * @since 4.0.0
 */
 var splitAtNonEmpty = /*#__PURE__*/ dual(2, (self, n) => {
-	const _n = Math.max(1, Math.floor(n));
+	const _n = normalizeNonEmpty(n);
 	return _n >= self.length ? [copy(self), []] : [prepend$1(self.slice(1, _n), headNonEmpty(self)), self.slice(_n)];
 });
 /**
@@ -2397,8 +2407,10 @@ var copy = (self) => self.slice();
 *
 * **Details**
 *
-* `chunksOf(n)([])` is `[]`, not `[[]]`. Each chunk is a `NonEmptyArray`, and
-* the outer return type preserves `NonEmptyArray`.
+* `n` is rounded down and normalized to at least `1`; `NaN` and non-positive
+* values therefore produce singleton chunks. `chunksOf(n)([])` is `[]`, not
+* `[[]]`. Each chunk is a `NonEmptyArray`, and the outer return type preserves
+* `NonEmptyArray`.
 *
 * **Example** (Chunking an array)
 *
@@ -2419,42 +2431,6 @@ var chunksOf = /*#__PURE__*/ dual(2, (self, n) => {
 	if (isReadonlyArrayNonEmpty(input)) return chop(input, splitAtNonEmpty(n));
 	return [];
 });
-var hashBucketsAdd = (buckets, value) => {
-	const hash$1 = hash(value);
-	const bucket = buckets.get(hash$1);
-	if (bucket === void 0) {
-		buckets.set(hash$1, [value]);
-		return true;
-	}
-	for (const previous of bucket) if (equals$1(previous, value)) return false;
-	bucket.push(value);
-	return true;
-};
-/**
-* Computes the union of two arrays, removing duplicates using
-* `Equal.equivalence()`.
-*
-* **Example** (Computing array unions)
-*
-* ```ts import.meta.vitest
-* import { Array } from "effect"
-*
-* Array.union([1, 2], [2, 3]) // => [1, 2, 3]
-* ```
-*
-* @see {@link unionWith} — use custom equality
-* @see {@link intersection} — elements in both arrays
-* @see {@link difference} — elements only in the first array
-*
-* @category set operations
-* @since 2.0.0
-*/
-var union = /*#__PURE__*/ dual(2, (self, that) => {
-	const a = fromIterable(self);
-	const b = fromIterable(that);
-	if (isReadonlyArrayNonEmpty(a)) return isReadonlyArrayNonEmpty(b) ? dedupe(appendAll$1(a, b)) : a;
-	return b;
-});
 /**
 * Creates an empty array.
 *
@@ -2706,40 +2682,9 @@ var dedupeWith = /*#__PURE__*/ dual(2, (self, isEquivalent) => {
 	}
 	return [];
 });
-/**
-* Removes duplicates using `Equal.equivalence()`, preserving the order of the
-* first occurrence.
-*
-* **When to use**
-*
-* Use to remove repeated values from an iterable when Effect's default equality
-* is the right comparison, preserving the first occurrence.
-*
-* **Example** (Removing duplicates)
-*
-* ```ts import.meta.vitest
-* import { Array } from "effect"
-*
-* Array.dedupe([1, 2, 1, 3, 2, 4]) // => [1, 2, 3, 4]
-* ```
-*
-* @see {@link dedupeWith} — use custom equality
-* @see {@link dedupeAdjacent} — only dedupes consecutive elements
-*
-* @category deduplication
-* @since 2.0.0
-*/
-var dedupe = (self) => {
-	const input = fromIterable(self);
-	if (input.length < 2) return [...input];
-	const buckets = /* @__PURE__ */ new Map();
-	const out = [];
-	for (const value of input) if (hashBucketsAdd(buckets, value)) out.push(value);
-	return out;
-};
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Duration.js
-var TypeId$9 = "~effect/time/Duration";
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Duration.js
+var TypeId$9 = "~effect/Duration";
 var bigint0$1 = /*#__PURE__*/ BigInt(0);
 var bigint1 = /*#__PURE__*/ BigInt(1);
 var bigint2 = /*#__PURE__*/ BigInt(2);
@@ -3432,7 +3377,7 @@ var isLessThanOrEqualTo = /*#__PURE__*/ isLessThanOrEqualTo$1(Order);
 */
 var equals = /*#__PURE__*/ dual(2, (self, that) => Equivalence(self, that));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Filter.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Filter.js
 /**
 * Converts a Filter into a predicate function.
 *
@@ -3511,7 +3456,7 @@ var toOption = (self) => (input) => {
 	return isFailure$1(result) ? none() : some(result.success);
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Scheduler.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Scheduler.js
 /**
 * Controls how runnable Effect fiber tasks are dispatched.
 *
@@ -3543,13 +3488,6 @@ var Scheduler = /*#__PURE__*/ Reference("effect/Scheduler", {
 	fiberCached: true,
 	defaultValue: () => new MixedScheduler()
 });
-var setImmediate = "setImmediate" in globalThis ? (f) => {
-	const timer = globalThis.setImmediate(f);
-	return () => globalThis.clearImmediate(timer);
-} : (f) => {
-	const timer = setTimeout(f, 0);
-	return () => clearTimeout(timer);
-};
 var setMicrotask = (f) => {
 	let cancelled = false;
 	Promise.resolve().then(() => {
@@ -3559,6 +3497,20 @@ var setMicrotask = (f) => {
 		cancelled = true;
 	};
 };
+var setTimer = "setImmediate" in globalThis ? (f) => {
+	const timer = globalThis.setImmediate(f);
+	return () => globalThis.clearImmediate(timer);
+} : (f) => {
+	const timer = setTimeout(f, 0);
+	return () => clearTimeout(timer);
+};
+var setImmediate = (f) => {
+	try {
+		return setTimer(f);
+	} catch {
+		return setMicrotask(f);
+	}
+};
 var PriorityBuckets = class {
 	buckets = [];
 	scheduleTask(task, priority) {
@@ -3617,7 +3569,7 @@ var MixedScheduler = class {
 	* @since 2.0.0
 	*/
 	shouldYield(fiber) {
-		return fiber.currentOpCount >= fiber.maxOpsBeforeYield;
+		return fiber.currentOpCount >= fiber.cache.maxOpsBeforeYield;
 	}
 	/**
 	* Creates a dispatcher that schedules work through this scheduler.
@@ -3727,7 +3679,7 @@ var PreventSchedulerYield = /*#__PURE__*/ Reference("effect/Scheduler/PreventSch
 	defaultValue: () => false
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Data.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Data.js
 /**
 * Provides a base class for immutable data types.
 *
@@ -3884,7 +3836,7 @@ var Error$1 = Error$2;
 */
 var TaggedError = TaggedError$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Encoding.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Encoding.js
 /**
 * Encoding and decoding helpers for Base64, Base64Url, and hexadecimal text.
 * The functions convert between strings, UTF-8 text, and `Uint8Array` bytes.
@@ -3913,7 +3865,7 @@ var TaggedError = TaggedError$1;
 * @category type IDs
 * @since 4.0.0
 */
-var EncodingErrorTypeId = "~effect/encoding/EncodingError";
+var EncodingErrorTypeId = "~effect/Encoding/EncodingError";
 /**
 * Error returned when an encoding or decoding operation cannot process its
 * input.
@@ -4043,6 +3995,8 @@ var decodeBase64 = (str) => {
 * Generates a random lowercase hexadecimal string, optimized for lengths that
 * are multiples of 8.
 *
+* **Details**
+*
 * `length` is not validated. The function generates `length >>> 3` random
 * 8-character words, so non-negative lengths below `2 ** 32` are rounded down
 * to a multiple of 8 and other values follow JavaScript's unsigned 32-bit
@@ -4056,12 +4010,33 @@ var decodeBase64 = (str) => {
 * @since 4.0.0
 */
 var randomHex = (length) => {
-	let result = "";
-	for (let i = length >>> 3; i > 0; i--) {
-		const word = Math.random() * 4294967296 >>> 0;
-		result += byteToHex[word >>> 24] + byteToHex[word >>> 16 & 255] + byteToHex[word >>> 8 & 255] + byteToHex[word & 255];
+	switch (length) {
+		case 16: return randomHex16();
+		case 32: return randomHex32();
+		default: {
+			let result = "";
+			for (let i = length >>> 3; i > 0; i--) result += randomHex8();
+			return result;
+		}
 	}
-	return result;
+};
+var hexCharCodes = /*#__PURE__*/ Uint8Array.from("0123456789abcdef", (c) => c.charCodeAt(0));
+var randomWord = () => Math.random() * 4294967296 >>> 0;
+var randomHex8 = () => {
+	const a = randomWord();
+	return String.fromCharCode(hexCharCodes[a >>> 28], hexCharCodes[a >>> 24 & 15], hexCharCodes[a >>> 20 & 15], hexCharCodes[a >>> 16 & 15], hexCharCodes[a >>> 12 & 15], hexCharCodes[a >>> 8 & 15], hexCharCodes[a >>> 4 & 15], hexCharCodes[a & 15]);
+};
+var randomHex16 = () => {
+	const a = randomWord();
+	const b = randomWord();
+	return String.fromCharCode(hexCharCodes[a >>> 28], hexCharCodes[a >>> 24 & 15], hexCharCodes[a >>> 20 & 15], hexCharCodes[a >>> 16 & 15], hexCharCodes[a >>> 12 & 15], hexCharCodes[a >>> 8 & 15], hexCharCodes[a >>> 4 & 15], hexCharCodes[a & 15], hexCharCodes[b >>> 28], hexCharCodes[b >>> 24 & 15], hexCharCodes[b >>> 20 & 15], hexCharCodes[b >>> 16 & 15], hexCharCodes[b >>> 12 & 15], hexCharCodes[b >>> 8 & 15], hexCharCodes[b >>> 4 & 15], hexCharCodes[b & 15]);
+};
+var randomHex32 = () => {
+	const a = randomWord();
+	const b = randomWord();
+	const c = randomWord();
+	const d = randomWord();
+	return String.fromCharCode(hexCharCodes[a >>> 28], hexCharCodes[a >>> 24 & 15], hexCharCodes[a >>> 20 & 15], hexCharCodes[a >>> 16 & 15], hexCharCodes[a >>> 12 & 15], hexCharCodes[a >>> 8 & 15], hexCharCodes[a >>> 4 & 15], hexCharCodes[a & 15], hexCharCodes[b >>> 28], hexCharCodes[b >>> 24 & 15], hexCharCodes[b >>> 20 & 15], hexCharCodes[b >>> 16 & 15], hexCharCodes[b >>> 12 & 15], hexCharCodes[b >>> 8 & 15], hexCharCodes[b >>> 4 & 15], hexCharCodes[b & 15], hexCharCodes[c >>> 28], hexCharCodes[c >>> 24 & 15], hexCharCodes[c >>> 20 & 15], hexCharCodes[c >>> 16 & 15], hexCharCodes[c >>> 12 & 15], hexCharCodes[c >>> 8 & 15], hexCharCodes[c >>> 4 & 15], hexCharCodes[c & 15], hexCharCodes[d >>> 28], hexCharCodes[d >>> 24 & 15], hexCharCodes[d >>> 20 & 15], hexCharCodes[d >>> 16 & 15], hexCharCodes[d >>> 12 & 15], hexCharCodes[d >>> 8 & 15], hexCharCodes[d >>> 4 & 15], hexCharCodes[d & 15]);
 };
 var encoder = /*#__PURE__*/ new TextEncoder();
 var stripCrlf = (str) => str.replace(/[\n\r]/g, "");
@@ -4285,10 +4260,8 @@ var base64codes = [
 	50,
 	51
 ];
-var byteToHex = [];
-for (let i = 0; i < 256; i++) byteToHex.push(i.toString(16).padStart(2, "0"));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Tracer.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Tracer.js
 /**
 * Defines the low-level tracing model used by Effect.
 *
@@ -4475,18 +4448,34 @@ var TracerKey = "effect/Tracer";
 */
 var Tracer = /*#__PURE__*/ Reference(TracerKey, {
 	fiberCached: true,
-	defaultValue: () => make$9({ span: (options) => new NativeSpan(options) })
+	defaultValue: () => nativeTracer
 });
 /**
+* The default `Tracer` implementation backing the `Tracer` reference. It
+* creates in-memory `NativeSpan` instances and does not export them anywhere.
+*
+* **Details**
+*
+* Runtime code can compare the active tracer against `nativeTracer` to detect
+* that no tracing backend is installed and skip work that only a backend could
+* observe, such as recording span attributes.
+*
+* @category references
+* @since 4.0.0
+*/
+var nativeTracer = /*#__PURE__*/ make$9({ span: (options) => new NativeSpan(options) });
+/**
 * Default in-memory `Span` implementation used by the native tracer. It
 * generates span and trace identifiers, stores attributes, events, and links,
 * and records `Started` or `Ended` status.
 *
 * **Details**
 *
-* The constructor initializes the span with `Started` status, inherits the
-* parent trace id or generates a new one, and always generates a new span id.
-* Attributes, events, links, and status are then mutated through `Span` methods.
+* The constructor initializes the span with `Started` status. Trace and span
+* identifiers, the attribute map, and the event list are created lazily on
+* first access, so spans that are never inspected allocate as little as
+* possible. Attributes, events, links, and status are mutated through `Span`
+* methods.
 *
 * @see {@link Span} for the interface implemented by native spans
 *
@@ -4495,8 +4484,6 @@ var Tracer = /*#__PURE__*/ Reference(TracerKey, {
 */
 var NativeSpan = class {
 	_tag = "Span";
-	spanId;
-	traceId = "native";
 	sampled;
 	name;
 	parent;
@@ -4505,8 +4492,10 @@ var NativeSpan = class {
 	startTime;
 	kind;
 	status;
-	attributes;
-	events = [];
+	_traceId = void 0;
+	_spanId = void 0;
+	_attributes = void 0;
+	_events = void 0;
 	constructor(options) {
 		this.name = options.name;
 		this.parent = options.parent;
@@ -4519,9 +4508,18 @@ var NativeSpan = class {
 			_tag: "Started",
 			startTime: options.startTime
 		};
-		this.attributes = /* @__PURE__ */ new Map();
-		this.traceId = getOrUndefined$1(options.parent)?.traceId ?? randomHex(32);
-		this.spanId = randomHex(16);
+	}
+	get traceId() {
+		return this._traceId ??= getOrUndefined$1(this.parent)?.traceId ?? randomHex(32);
+	}
+	get spanId() {
+		return this._spanId ??= randomHex(16);
+	}
+	get attributes() {
+		return this._attributes ??= /* @__PURE__ */ new Map();
+	}
+	get events() {
+		return this._events ??= [];
 	}
 	end(endTime, exit) {
 		this.status = {
@@ -4546,18 +4544,21 @@ var NativeSpan = class {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/metric.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/metric.js
 /** @internal */
-var FiberRuntimeMetricsKey = "effect/observability/Metric/FiberRuntimeMetricsKey";
+var FiberRuntimeMetricsKey = "effect/Metric/FiberRuntimeMetrics";
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/references.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/references.js
 /** @internal */
 var CurrentStackFrame = /*#__PURE__*/ Reference("effect/References/CurrentStackFrame", {
 	fiberCached: true,
 	defaultValue: constUndefined
 });
 /** @internal */
-var TracerEnabled = /*#__PURE__*/ Reference("effect/References/TracerEnabled", { defaultValue: constTrue });
+var TracerEnabled = /*#__PURE__*/ Reference("effect/References/TracerEnabled", {
+	fiberCached: true,
+	defaultValue: constTrue
+});
 /** @internal */
 var TracerTimingEnabled = /*#__PURE__*/ Reference("effect/References/TracerTimingEnabled", { defaultValue: constTrue });
 /** @internal */
@@ -4579,44 +4580,16 @@ var MinimumLogLevel = /*#__PURE__*/ Reference("effect/References/MinimumLogLevel
 /** @internal */
 var CurrentLogSpans = /*#__PURE__*/ Reference("effect/References/CurrentLogSpans", { defaultValue: () => [] });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/stackTraceLimit.js
-/**
-* Check if `Error.stackTraceLimit` is writable.
-* Returns `false` if the property is frozen, non-writable, or `Error` is non-extensible.
-*
-* @internal
-*/
-var isStackTraceLimitWritable = () => {
-	const desc = Object.getOwnPropertyDescriptor(Error, "stackTraceLimit");
-	if (desc === void 0) return Object.isExtensible(Error);
-	return Object.hasOwn(desc, "writable") ? desc.writable === true : desc.set !== void 0;
-};
-var canWriteStackTraceLimit = /*#__PURE__*/ isStackTraceLimitWritable();
-/**
-* Get the current `Error.stackTraceLimit` value.
-* Returns `undefined` if the property doesn't exist.
-*
-* @internal
-*/
-var getStackTraceLimit = () => Error.stackTraceLimit;
-/**
-* Safely set `Error.stackTraceLimit` if possible, otherwise no-op.
-*
-* Accepts `undefined` so a value read via {@link getStackTraceLimit} can be
-* restored faithfully.
-*
-* @internal
-*/
-var setStackTraceLimit = (value) => {
-	if (canWriteStackTraceLimit) Error.stackTraceLimit = value;
-};
-//#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/tracer.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/tracer.js
 /** @internal */
 var addSpanStackTrace = (options) => {
 	if (options?.captureStackTrace === false) return options;
 	else if (options?.captureStackTrace !== void 0 && typeof options.captureStackTrace !== "boolean") return options;
 	const limit = getStackTraceLimit();
+	if (limit === 0 && options?.captureStackTrace !== true) return {
+		...options,
+		captureStackTrace: false
+	};
 	setStackTraceLimit(3);
 	const traceError = /* @__PURE__ */ new Error();
 	setStackTraceLimit(limit);
@@ -4641,10 +4614,9 @@ var makeStackCleaner = (line) => (stack) => {
 };
 var spanCleaner = /*#__PURE__*/ makeStackCleaner(3);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/effect.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/effect.js
 /** @internal */
 var Interrupt = class extends ReasonBase {
-	fiberId;
 	constructor(fiberId, annotations = constEmptyAnnotations) {
 		super("Interrupt", annotations, "Interrupted");
 		this.fiberId = fiberId;
@@ -4697,11 +4669,24 @@ var causeFilterInterruptors = (self) => {
 };
 /** @internal */
 var hasInterruptsOnly$1 = (self) => self.reasons.length > 0 && self.reasons.every(isInterruptReason);
+var dedupeReasons = (self, that) => {
+	const buckets = /* @__PURE__ */ new Map();
+	const out = [];
+	for (const reason of self.concat(that)) {
+		const hash$1 = hash(reason);
+		const bucket = buckets.get(hash$1);
+		if (bucket === void 0) buckets.set(hash$1, [reason]);
+		else if (bucket.some((previous) => equals$1(previous, reason))) continue;
+		else bucket.push(reason);
+		out.push(reason);
+	}
+	return out;
+};
 /** @internal */
 var causeCombine = /*#__PURE__*/ dual(2, (self, that) => {
 	if (self.reasons.length === 0) return that;
 	else if (that.reasons.length === 0) return self;
-	const newCause = new CauseImpl(union(self.reasons, that.reasons));
+	const newCause = new CauseImpl(dedupeReasons(self.reasons, that.reasons));
 	return equals$1(self, newCause) ? self : newCause;
 });
 /** @internal */
@@ -4740,7 +4725,7 @@ var causePrettyErrors = (self, options) => {
 	const interrupts = [];
 	if (self.reasons.length === 0) return errors;
 	const prevStackLimit = getStackTraceLimit();
-	setStackTraceLimit(1);
+	if (prevStackLimit !== 0) setStackTraceLimit(1);
 	for (const failure of self.reasons) {
 		if (failure._tag === "Interrupt") {
 			interrupts.push(failure);
@@ -4757,7 +4742,7 @@ var causePrettyErrors = (self, options) => {
 		error.stack = `${error.name}: ${error.message}`;
 		errors.push(causePrettyError(error, interrupts[0].annotations, options));
 	}
-	setStackTraceLimit(prevStackLimit);
+	if (prevStackLimit !== 0) setStackTraceLimit(prevStackLimit);
 	return errors;
 };
 /** @internal */
@@ -4858,14 +4843,15 @@ var FiberImpl = class {
 		this.currentOpCount = 0;
 		this.interruptible = interruptible;
 		this._stack = [];
-		this._observers = [];
+		this._observers = void 0;
 		this._exit = void 0;
 		this._children = void 0;
 		this._interruptedCause = void 0;
 		this._yielded = void 0;
 		this._running = false;
 		this._deferredInterrupt = false;
-		this.runtimeMetrics?.recordFiberStart(this.context);
+		this._parent = void 0;
+		this.cache.runtimeMetrics?.recordFiberStart(this.context);
 	}
 	[FiberTypeId];
 	id;
@@ -4879,19 +4865,12 @@ var FiberImpl = class {
 	_yielded;
 	_running;
 	_deferredInterrupt;
+	_parent;
 	context;
-	currentScheduler;
-	currentTracerContext;
-	currentSpan;
-	currentLogLevel;
-	minimumLogLevel;
-	currentStackFrame;
-	runtimeMetrics;
-	maxOpsBeforeYield;
-	currentPreventYield;
+	cache;
 	_dispatcher = void 0;
 	get currentDispatcher() {
-		return this._dispatcher ??= this.currentScheduler.makeDispatcher();
+		return this._dispatcher ??= this.cache.scheduler.makeDispatcher();
 	}
 	getRef(ref) {
 		return get$4(this.context, ref);
@@ -4901,9 +4880,10 @@ var FiberImpl = class {
 			cb(this._exit);
 			return constVoid;
 		}
-		this._observers.push(cb);
+		if (this._observers === void 0) this._observers = [cb];
+		else this._observers.push(cb);
 		return () => {
-			if (this._exit) return;
+			if (this._exit || this._observers === void 0) return;
 			const index = this._observers.indexOf(cb);
 			if (index >= 0) this._observers.splice(index, 1);
 		};
@@ -4911,7 +4891,7 @@ var FiberImpl = class {
 	interruptUnsafe(fiberId, annotations) {
 		if (this._exit) return;
 		let cause = causeInterrupt(fiberId);
-		if (this.currentStackFrame) cause = causeAnnotate(cause, make$11(StackTraceKey, this.currentStackFrame));
+		if (this.cache.stackFrame) cause = causeAnnotate(cause, make$11(StackTraceKey, this.cache.stackFrame));
 		if (annotations) cause = causeAnnotate(cause, annotations);
 		this._interruptedCause = this._interruptedCause ? causeCombine(this._interruptedCause, cause) : cause;
 		if (this.interruptible) {
@@ -4934,9 +4914,16 @@ var FiberImpl = class {
 		const interruptChildren = fiberMiddleware.interruptChildren && fiberMiddleware.interruptChildren(this);
 		if (interruptChildren !== void 0) return this.evaluate(flatMap$1(interruptChildren, () => exit));
 		this._exit = exit;
-		this.runtimeMetrics?.recordFiberEnd(this.context, this._exit);
-		for (let i = 0; i < this._observers.length; i++) this._observers[i](exit);
-		this._observers.length = 0;
+		this.cache.runtimeMetrics?.recordFiberEnd(this.context, this._exit);
+		if (this._parent) {
+			this._parent._children?.delete(this);
+			this._parent = void 0;
+		}
+		if (this._observers !== void 0) {
+			const observers = this._observers;
+			this._observers = void 0;
+			for (let i = 0; i < observers.length; i++) observers[i](exit);
+		}
 		this._stack.length = 0;
 		this._children = void 0;
 		this.context = empty$4();
@@ -4956,12 +4943,13 @@ var FiberImpl = class {
 					current = failCause$5(this._interruptedCause);
 				}
 				this.currentOpCount++;
-				if (!yielding && !this.currentPreventYield && this.currentScheduler.shouldYield(this)) {
+				const cache = this.cache;
+				if (!yielding && !cache.preventYield && cache.scheduler.shouldYield(this)) {
 					yielding = true;
 					const prev = current;
 					current = flatMap$1(yieldNow$1, () => prev);
 				}
-				current = this.currentTracerContext ? this.currentTracerContext(current, this) : current[evaluate](this);
+				current = cache.tracerContext ? cache.tracerContext(current, this) : current[evaluate](this);
 				if (current === Yield) {
 					const yielded = this._yielded;
 					if (ExitTypeId in yielded) {
@@ -4992,10 +4980,13 @@ var FiberImpl = class {
 		while (true) {
 			const op = this._stack.pop();
 			if (!op) return void 0;
-			const cont = op[contAll] && op[contAll](this);
-			if (cont) {
-				cont[symbol] = cont;
-				return cont;
+			const all = op[contAll];
+			if (all !== void 0) {
+				const cont = all.call(op, this);
+				if (cont) {
+					cont[symbol] = cont;
+					return cont;
+				}
 			}
 			if (op[symbol]) return op;
 		}
@@ -5014,25 +5005,32 @@ var FiberImpl = class {
 		const previous = this.context;
 		this.context = context;
 		if (previous !== void 0 && hasSameCache(previous, context)) return;
-		const scheduler = this.getRef(Scheduler);
-		if (scheduler !== this.currentScheduler) {
-			this.currentScheduler = scheduler;
-			this._dispatcher = void 0;
-		}
-		this.currentSpan = getOrUndefinedUnsafe(context, ParentSpanKey);
-		this.currentLogLevel = this.getRef(CurrentLogLevel);
-		this.minimumLogLevel = this.getRef(MinimumLogLevel);
-		this.currentStackFrame = this.getRef(CurrentStackFrame);
-		this.maxOpsBeforeYield = this.getRef(MaxOpsBeforeYield);
-		this.currentPreventYield = this.getRef(PreventSchedulerYield);
-		this.runtimeMetrics = getOrUndefinedUnsafe(context, FiberRuntimeMetricsKey);
-		const currentTracer = getOrUndefinedUnsafe(context, TracerKey);
-		this.currentTracerContext = currentTracer ? currentTracer["context"] : void 0;
+		const root = context.cacheRoot;
+		const cache = root._fiberCache ??= makeFiberContextCache(context);
+		if (this.cache !== void 0 && this.cache.scheduler !== cache.scheduler) this._dispatcher = void 0;
+		this.cache = cache;
 	}
 	get currentSpanLocal() {
-		return this.currentSpan?._tag === "Span" ? this.currentSpan : void 0;
+		const span = this.cache.span;
+		return span?._tag === "Span" ? span : void 0;
 	}
 };
+var makeFiberContextCache = (context) => {
+	const currentTracer = getOrUndefinedUnsafe(context, TracerKey);
+	return {
+		scheduler: get$4(context, Scheduler),
+		tracer: currentTracer,
+		tracerContext: currentTracer ? currentTracer["context"] : void 0,
+		tracerEnabled: get$4(context, TracerEnabled),
+		span: getOrUndefinedUnsafe(context, ParentSpanKey),
+		logLevel: get$4(context, CurrentLogLevel),
+		minimumLogLevel: get$4(context, MinimumLogLevel),
+		stackFrame: get$4(context, CurrentStackFrame),
+		runtimeMetrics: getOrUndefinedUnsafe(context, FiberRuntimeMetricsKey),
+		maxOpsBeforeYield: get$4(context, MaxOpsBeforeYield),
+		preventYield: get$4(context, PreventSchedulerYield)
+	};
+};
 var deferredInterruptCont = {
 	[contA](_value, fiber) {
 		return failCause$5(fiber._interruptedCause);
@@ -5043,9 +5041,9 @@ var deferredInterruptCont = {
 };
 var fiberMiddleware = { interruptChildren: void 0 };
 var fiberStackAnnotations = (fiber) => {
-	if (!fiber.currentStackFrame) return void 0;
+	if (!fiber.cache.stackFrame) return void 0;
 	const annotations = /* @__PURE__ */ new Map();
-	annotations.set(InterruptorStackTrace$1.key, fiber.currentStackFrame);
+	annotations.set(InterruptorStackTrace$1.key, fiber.cache.stackFrame);
 	return makeUnsafe$4(annotations);
 };
 var fiberInterruptChildren = (fiber) => {
@@ -5229,34 +5227,43 @@ var tryPromise$1 = (options) => {
 };
 /** @internal */
 var withFiberId = (f) => withFiber$1((fiber) => f(fiber.id));
-var callbackOptions = /*#__PURE__*/ makePrimitive({
-	op: "Async",
-	single: false,
-	[evaluate](fiber) {
-		const register = internalCall(() => this[args][0].bind(fiber.currentScheduler));
-		let resumed = false;
-		let yielded = false;
-		const controller = this[args][1] ? new AbortController() : void 0;
-		const onCancel = register((effect) => {
-			if (resumed) return;
-			resumed = true;
-			if (yielded) fiber.evaluate(effect);
-			else yielded = effect;
-		}, controller?.signal);
-		if (yielded !== false) return yielded;
-		yielded = true;
-		fiber._yielded = () => {
-			resumed = true;
-		};
-		if (controller === void 0 && onCancel === void 0) return Yield;
-		fiber._stack.push(asyncFinalizer(() => {
-			resumed = true;
-			controller?.abort();
-			return onCancel ?? exitVoid;
-		}));
-		return Yield;
-	}
-});
+var callbackOptions = /*#__PURE__*/ function() {
+	const Proto = /*#__PURE__*/ makePrimitiveProto({
+		op: "Async",
+		[evaluate](fiber) {
+			const register = internalCall(() => this.register.bind(fiber.cache.scheduler));
+			let resumed = false;
+			let yielded = false;
+			const controller = this.withSignal ? new AbortController() : void 0;
+			const onCancel = register((effect) => {
+				if (resumed) return;
+				resumed = true;
+				if (yielded) fiber.evaluate(effect);
+				else yielded = effect;
+			}, controller?.signal);
+			if (yielded !== false) return yielded;
+			yielded = true;
+			fiber._yielded = () => {
+				resumed = true;
+			};
+			if (controller === void 0 && onCancel === void 0) return Yield;
+			fiber._stack.push(asyncFinalizer(() => {
+				resumed = true;
+				controller?.abort();
+				return onCancel ?? exitVoid;
+			}));
+			return Yield;
+		}
+	});
+	const AsyncImpl = function(register, withSignal) {
+		this.register = register;
+		this.withSignal = withSignal;
+	};
+	AsyncImpl.prototype = Proto;
+	return function(register, withSignal) {
+		return new AsyncImpl(register, withSignal);
+	};
+}();
 var asyncFinalizer = /*#__PURE__*/ makePrimitive({
 	op: "AsyncFinalizer",
 	[contAll](fiber) {
@@ -5274,7 +5281,14 @@ var callback$2 = (register) => callbackOptions(register, register.length >= 2);
 /** @internal */
 var never$3 = /*#__PURE__*/ callback$2(constVoid);
 /** @internal */
-var gen$1 = (...args) => suspend$3(() => fromIteratorUnsafe(args.length === 1 ? args[0]() : args[1].call(args[0].self)));
+var gen$1 = (...args) => {
+	if (args.length === 1) {
+		const body = args[0];
+		return suspend$3(() => fromIteratorUnsafe(body()));
+	}
+	const [options, body] = args;
+	return suspend$3(() => fromIteratorUnsafe(body.call(options.self)));
+};
 /** @internal */
 var fnUntraced$1 = (body, ...pipeables) => {
 	const fn = pipeables.length === 0 ? function() {
@@ -5297,9 +5311,12 @@ var fn$1 = function() {
 	const name = nameFirst ? arguments[0] : "Effect.fn";
 	const spanOptions = nameFirst ? arguments[1] : void 0;
 	const prevLimit = getStackTraceLimit();
-	setStackTraceLimit(2);
-	const defError = new globalThis.Error();
-	setStackTraceLimit(prevLimit);
+	let defError;
+	if (prevLimit !== 0) {
+		setStackTraceLimit(2);
+		defError = new globalThis.Error();
+		setStackTraceLimit(prevLimit);
+	}
 	if (nameFirst) return (body, ...pipeables) => makeFn(name, body, defError, pipeables, nameFirst, spanOptions);
 	return makeFn(name, arguments[0], defError, Array.prototype.slice.call(arguments, 1), nameFirst, spanOptions);
 };
@@ -5313,15 +5330,18 @@ var makeFn = (name, bodyOrOptions, defError, pipeables, addSpan, spanOptions) =>
 		for (let i = 0; i < pipeables.length; i++) result = pipeables[i](result, ...args);
 		if (!isEffect$1(result)) return result;
 		const prevLimit = getStackTraceLimit();
-		setStackTraceLimit(2);
-		const callError = new globalThis.Error();
-		setStackTraceLimit(prevLimit);
+		let callError;
+		if (prevLimit !== 0) {
+			setStackTraceLimit(2);
+			callError = new globalThis.Error();
+			setStackTraceLimit(prevLimit);
+		}
 		return updateService(addSpan ? useSpan$1(name, spanOptions, (span) => provideParentSpan(result, span)) : result, CurrentStackFrame, (prev) => ({
 			name,
-			stack: fnStackCleaner(() => callError.stack),
+			stack: callError ? fnStackCleaner(() => callError.stack) : constUndefined,
 			parent: {
 				name: `${name} (definition)`,
-				stack: fnStackCleaner(() => defError.stack),
+				stack: defError ? fnStackCleaner(() => defError.stack) : constUndefined,
 				parent: prev
 			}
 		}));
@@ -5332,7 +5352,7 @@ var fnUntracedEager$1 = (body, ...pipeables) => defineFunctionLength(body.length
 	return fromIteratorEagerUnsafe(() => body.apply(this, arguments));
 } : function() {
 	let effect = fromIteratorEagerUnsafe(() => body.apply(this, arguments));
-	for (const pipeable of pipeables) effect = pipeable(effect);
+	for (const pipeable of pipeables) effect = pipeable(effect, ...arguments);
 	return effect;
 });
 var fromIteratorEagerUnsafe = (evaluate) => {
@@ -5361,38 +5381,81 @@ var fromIteratorEagerUnsafe = (evaluate) => {
 		return die$1(error);
 	}
 };
-var fromIteratorUnsafe = /*#__PURE__*/ makePrimitive({
-	op: "Iterator",
-	single: false,
-	[contA](value, fiber) {
-		const iter = this[args][0];
-		while (true) {
-			const state = iter.next(value);
-			if (state.done) return succeed$5(state.value);
-			if (!effectIsExit(state.value)) {
-				fiber._stack.push(this);
-				return state.value;
-			} else if (state.value._tag === "Failure") return state.value;
-			value = state.value.value;
+var fromIteratorUnsafe = /*#__PURE__*/ function() {
+	const Proto = /*#__PURE__*/ makePrimitiveProto({
+		op: "Iterator",
+		[contA](value, fiber) {
+			const iter = this.iterator;
+			while (true) {
+				const state = iter.next(value);
+				if (state.done) return succeed$5(state.value);
+				if (!effectIsExit(state.value)) {
+					fiber._stack.push(this);
+					return state.value;
+				} else if (state.value._tag === "Failure") return state.value;
+				value = state.value.value;
+			}
+		},
+		[evaluate](fiber) {
+			return this[contA](this.initial, fiber);
 		}
-	},
-	[evaluate](fiber) {
-		return this[contA](this[args][1], fiber);
-	}
-});
+	});
+	const IteratorImpl = function(iterator, initial) {
+		this.iterator = iterator;
+		this.initial = initial;
+	};
+	IteratorImpl.prototype = Proto;
+	return function(iterator, initial) {
+		return new IteratorImpl(iterator, initial);
+	};
+}();
 /** @internal */
-var as$1 = /*#__PURE__*/ dual(2, (self, value) => {
-	const b = succeed$5(value);
-	return flatMap$1(self, (_) => b);
+var as$1 = /*#__PURE__*/ dual(2, (self, value) => new ContImpl(self, returnPayload, succeed$5(value)));
+var evaluateCont = function(fiber) {
+	fiber._stack.push(this);
+	return this[args];
+};
+var OnSuccessProto = /*#__PURE__*/ makePrimitiveProto({
+	op: "OnSuccess",
+	[evaluate]: evaluateCont
 });
+var OnSuccessImpl = function(self, f) {
+	this[args] = self;
+	this[contA] = f;
+};
+OnSuccessImpl.prototype = OnSuccessProto;
+var ContImpl = function(self, cont, payload) {
+	this[args] = self;
+	this[contA] = cont;
+	this.payload = payload;
+};
+ContImpl.prototype = OnSuccessProto;
+var returnPayload = function() {
+	return this.payload;
+};
+var mapCont = function(value) {
+	const f = this.payload;
+	return succeed$5(internalCall(() => f(value)));
+};
+var andThenCont = function(value) {
+	const f = this.payload;
+	return internalCall(() => f(value));
+};
+var tapCont = function(value) {
+	const f = this.payload;
+	return new ContImpl(internalCall(() => f(value)), returnPayload, exitSucceed(value));
+};
+var tapEffectCont = function(value) {
+	return new ContImpl(this.payload, returnPayload, exitSucceed(value));
+};
 /** @internal */
 var asSome$1 = (self) => map$4(self, some);
 /** @internal */
-var andThen$1 = /*#__PURE__*/ dual(2, (self, f) => flatMap$1(self, (a) => isEffect$1(f) ? f : internalCall(() => f(a))));
+var andThen$1 = /*#__PURE__*/ dual(2, (self, f) => new ContImpl(self, isEffect$1(f) ? returnPayload : andThenCont, f));
 /** @internal */
-var tap$2 = /*#__PURE__*/ dual(2, (self, f) => flatMap$1(self, (a) => as$1(isEffect$1(f) ? f : internalCall(() => f(a)), a)));
+var tap$2 = /*#__PURE__*/ dual(2, (self, f) => new ContImpl(self, isEffect$1(f) ? tapEffectCont : tapCont, f));
 /** @internal */
-var asVoid$1 = (self) => flatMap$1(self, (_) => exitVoid);
+var asVoid$1 = (self) => new ContImpl(self, returnPayload, exitVoid);
 /** @internal */
 var raceAll = (all, options) => withFiber$1((parent) => callback$2((resume) => {
 	const effects = fromIterable(all);
@@ -5460,21 +5523,9 @@ var race$1 = /*#__PURE__*/ dual((args) => isEffect$1(args[1]), (self, that, opti
 /** @internal */
 var raceFirst$1 = /*#__PURE__*/ dual((args) => isEffect$1(args[1]), (self, that, options) => raceAllFirst([self, that], options));
 /** @internal */
-var flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => {
-	const onSuccess = Object.create(OnSuccessProto);
-	onSuccess[args] = self;
-	onSuccess[contA] = f.length !== 1 ? (a) => f(a) : f;
-	return onSuccess;
-});
-var OnSuccessProto = /*#__PURE__*/ makePrimitiveProto({
-	op: "OnSuccess",
-	[evaluate](fiber) {
-		fiber._stack.push(this);
-		return this[args];
-	}
-});
+var flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => new OnSuccessImpl(self, f.length !== 1 ? (a) => f(a) : f));
 /** @internal */
-var effectIsExit = (effect) => ExitTypeId in effect;
+var effectIsExit = (effect) => effect[ExitTypeId] !== void 0;
 /** @internal */
 var flatMapEager$1 = /*#__PURE__*/ dual(2, (self, f) => {
 	if (effectIsExit(self)) return self._tag === "Success" ? f(self.value) : self;
@@ -5483,7 +5534,7 @@ var flatMapEager$1 = /*#__PURE__*/ dual(2, (self, f) => {
 /** @internal */
 var flatten$1 = (self) => flatMap$1(self, identity);
 /** @internal */
-var map$4 = /*#__PURE__*/ dual(2, (self, f) => flatMap$1(self, (a) => succeed$5(internalCall(() => f(a)))));
+var map$4 = /*#__PURE__*/ dual(2, (self, f) => new ContImpl(self, mapCont, f));
 /** @internal */
 var mapEager$1 = /*#__PURE__*/ dual(2, (self, f) => effectIsExit(self) ? exitMap(self, f) : map$4(self, f));
 /** @internal */
@@ -5569,6 +5620,7 @@ var provideService$1 = function() {
 	return dual(3, (self, service, impl) => provideServiceImpl(self, service, impl)).apply(this, arguments);
 };
 var provideServiceImpl = (self, service, implementation) => updateContext$1(self, add(service, implementation));
+/** @internal */
 var filterOrFail$1 = /*#__PURE__*/ dual((args) => isEffect$1(args[0]), (self, predicate, orFailWith) => filterOrElse(self, predicate, orFailWith ? (a) => fail$5(orFailWith(a)) : () => fail$5(new NoSuchElementError$1())));
 /** @internal */
 var when$1 = /*#__PURE__*/ dual(2, (self, condition) => flatMap$1(condition, (pass) => pass ? asSome$1(self) : succeedNone$1));
@@ -5579,19 +5631,16 @@ var forever$2 = /*#__PURE__*/ dual((args) => isEffect$1(args[0]), (self, options
 	step: constVoid
 }));
 /** @internal */
-var catchCause$3 = /*#__PURE__*/ dual(2, (self, f) => {
-	const onFailure = Object.create(OnFailureProto);
-	onFailure[args] = self;
-	onFailure[contE] = f.length !== 1 ? (cause) => f(cause) : f;
-	return onFailure;
-});
+var catchCause$3 = /*#__PURE__*/ dual(2, (self, f) => new OnFailureImpl(self, f.length !== 1 ? (cause) => f(cause) : f));
 var OnFailureProto = /*#__PURE__*/ makePrimitiveProto({
 	op: "OnFailure",
-	[evaluate](fiber) {
-		fiber._stack.push(this);
-		return this[args];
-	}
+	[evaluate]: evaluateCont
 });
+var OnFailureImpl = function(self, f) {
+	this[args] = self;
+	this[contE] = f;
+};
+OnFailureImpl.prototype = OnFailureProto;
 /** @internal */
 var catchCauseFilter$1 = /*#__PURE__*/ dual(3, (self, filter, f) => catchCause$3(self, (cause) => {
 	const eb = filter(cause);
@@ -5620,6 +5669,7 @@ var catchTag$1 = /*#__PURE__*/ dual((args) => isEffect$1(args[0]), (self, k, f,
 });
 /** @internal */
 var mapError$3 = /*#__PURE__*/ dual(2, (self, f) => catch_$2(self, (error) => failSync(() => f(error))));
+/** @internal */
 var mapBoth = /*#__PURE__*/ dual(2, (self, options) => matchEffect$2(self, {
 	onFailure: (e) => failSync(() => options.onFailure(e)),
 	onSuccess: (a) => sync$1(() => options.onSuccess(a))
@@ -5649,20 +5699,17 @@ var result$1 = (self) => matchEager(self, {
 	onSuccess: succeed$6
 });
 /** @internal */
-var matchCauseEffect$1 = /*#__PURE__*/ dual(2, (self, options) => {
-	const primitive = Object.create(OnSuccessAndFailureProto);
-	primitive[args] = self;
-	primitive[contA] = options.onSuccess.length !== 1 ? (a) => options.onSuccess(a) : options.onSuccess;
-	primitive[contE] = options.onFailure.length !== 1 ? (cause) => options.onFailure(cause) : options.onFailure;
-	return primitive;
-});
+var matchCauseEffect$1 = /*#__PURE__*/ dual(2, (self, options) => new OnSuccessAndFailureImpl(self, options.onSuccess.length !== 1 ? (a) => options.onSuccess(a) : options.onSuccess, options.onFailure.length !== 1 ? (cause) => options.onFailure(cause) : options.onFailure));
 var OnSuccessAndFailureProto = /*#__PURE__*/ makePrimitiveProto({
 	op: "OnSuccessAndFailure",
-	[evaluate](fiber) {
-		fiber._stack.push(this);
-		return this[args];
-	}
+	[evaluate]: evaluateCont
 });
+var OnSuccessAndFailureImpl = function(self, onSuccess, onFailure) {
+	this[args] = self;
+	this[contA] = onSuccess;
+	this[contE] = onFailure;
+};
+OnSuccessAndFailureImpl.prototype = OnSuccessAndFailureProto;
 /** @internal */
 var matchEffect$2 = /*#__PURE__*/ dual(2, (self, options) => matchCauseEffect$1(self, {
 	onFailure: (cause) => {
@@ -5817,30 +5864,40 @@ var acquireRelease$1 = (acquire, release, options) => contextWith$1((context) =>
 /** @internal */
 var addFinalizer$2 = (finalizer) => flatMap$1(scope$1, (scope) => contextWith$1((context) => scopeAddFinalizerExit(scope, (exit) => provideContext$1(finalizer(exit), context))));
 /** @internal */
-var onExitPrimitive = /*#__PURE__*/ makePrimitive({
-	op: "OnExit",
-	single: false,
-	[evaluate](fiber) {
-		fiber._stack.push(this);
-		return this[args][0];
-	},
-	[contAll](fiber) {
-		if (fiber.interruptible && this[args][2] !== true) {
-			fiber._stack.push(setInterruptibleTrue);
-			fiber.interruptible = false;
+var onExitPrimitive = /*#__PURE__*/ function() {
+	const Proto = /*#__PURE__*/ makePrimitiveProto({
+		op: "OnExit",
+		[evaluate](fiber) {
+			fiber._stack.push(this);
+			return this.effect;
+		},
+		[contAll](fiber) {
+			if (fiber.interruptible && this.interruptible !== true) {
+				fiber._stack.push(setInterruptibleTrue);
+				fiber.interruptible = false;
+			}
+		},
+		[contA](value, _, exit) {
+			exit ??= exitSucceed(value);
+			const eff = this.onExit(exit);
+			return eff ? flatMap$1(eff, (_) => exit) : exit;
+		},
+		[contE](cause, _, exit) {
+			exit ??= exitFailCause(cause);
+			const eff = this.onExit(exit);
+			return eff ? flatMap$1(combineFinalizerCause(exit, eff), (_) => exit) : exit;
 		}
-	},
-	[contA](value, _, exit) {
-		exit ??= exitSucceed(value);
-		const eff = this[args][1](exit);
-		return eff ? flatMap$1(eff, (_) => exit) : exit;
-	},
-	[contE](cause, _, exit) {
-		exit ??= exitFailCause(cause);
-		const eff = this[args][1](exit);
-		return eff ? flatMap$1(combineFinalizerCause(exit, eff), (_) => exit) : exit;
-	}
-});
+	});
+	const OnExitImpl = function(effect, onExit, interruptible) {
+		this.effect = effect;
+		this.onExit = onExit;
+		this.interruptible = interruptible;
+	};
+	OnExitImpl.prototype = Proto;
+	return function(effect, onExit, interruptible) {
+		return new OnExitImpl(effect, onExit, interruptible);
+	};
+}();
 /** @internal */
 var onExit$2 = /*#__PURE__*/ dual(2, onExitPrimitive);
 /** @internal */
@@ -5862,8 +5919,7 @@ var onErrorFilter = /*#__PURE__*/ dual(3, (self, filter, f) => onExit$2(self, (e
 var onInterrupt$1 = /*#__PURE__*/ dual(2, (self, finalizer) => onErrorFilter(causeFilterInterruptors, finalizer)(self));
 /** @internal */
 var cachedInvalidateWithTTL = /*#__PURE__*/ dual(2, (self, ttl) => sync$1(() => {
-	const ttlMillis = toMillis(fromInputUnsafe(ttl));
-	const isFinite = Number.isFinite(ttlMillis);
+	const ttlMillis = typeof ttl === "function" ? (exit) => toMillis(fromInputUnsafe(ttl(exit))) : constant(toMillis(fromInputUnsafe(ttl)));
 	const latch = makeLatchUnsafe(false);
 	let expiresAt = 0;
 	let running = false;
@@ -5871,16 +5927,24 @@ var cachedInvalidateWithTTL = /*#__PURE__*/ dual(2, (self, ttl) => sync$1(() =>
 	const wait = flatMap$1(latch.await, () => exit);
 	return [withFiber$1((fiber) => {
 		const clock = fiber.getRef(ClockRef);
-		const now = isFinite ? clock.currentTimeMillisUnsafe() : 0;
+		const now = expiresAt === Infinity ? 0 : clock.currentTimeMillisUnsafe();
 		if (running || now < expiresAt) return exit ?? wait;
 		running = true;
 		latch.closeUnsafe();
 		exit = void 0;
 		return onExit$2(self, (exit_) => sync$1(() => {
-			running = false;
-			expiresAt = clock.currentTimeMillisUnsafe() + ttlMillis;
-			exit = exit_;
-			latch.openUnsafe();
+			try {
+				const duration = ttlMillis(exit_);
+				expiresAt = clock.currentTimeMillisUnsafe() + duration;
+				exit = exit_;
+			} catch (error) {
+				const cause = causeDie(error);
+				exit = exitFailCause(exitIsFailure(exit_) ? causeCombine(exit_.cause, cause) : cause);
+				throw error;
+			} finally {
+				running = false;
+				latch.openUnsafe();
+			}
 		}));
 	}), sync$1(() => {
 		expiresAt = 0;
@@ -5891,7 +5955,21 @@ var cachedInvalidateWithTTL = /*#__PURE__*/ dual(2, (self, ttl) => sync$1(() =>
 /** @internal */
 var cachedWithTTL$1 = /*#__PURE__*/ dual(2, (self, timeToLive) => map$4(cachedInvalidateWithTTL(self, timeToLive), (tuple) => tuple[0]));
 /** @internal */
-var cached$1 = (self) => cachedWithTTL$1(self, infinity);
+var cached$1 = (self) => sync$1(() => {
+	const latch = makeLatchUnsafe(false);
+	let started = false;
+	let exit;
+	const wait = flatMap$1(latch.await, () => exit);
+	return suspend$3(() => {
+		if (exit !== void 0) return exit;
+		if (started) return wait;
+		started = true;
+		return onExit$2(self, (result) => sync$1(() => {
+			exit = result;
+			latch.openUnsafe();
+		}));
+	});
+});
 /** @internal */
 var interrupt$4 = /*#__PURE__*/ withFiber$1((fiber) => failCause$5(causeInterrupt(fiber.id)));
 /** @internal */
@@ -5962,8 +6040,7 @@ var whileLoop$1 = /*#__PURE__*/ makePrimitive({
 });
 /** @internal */
 var forEach$1 = /*#__PURE__*/ dual((args) => typeof args[1] === "function", (iterable, f, options) => suspend$3(() => {
-	const concurrencyOption = options?.concurrency ?? 1;
-	const concurrency = concurrencyOption === "unbounded" ? Number.POSITIVE_INFINITY : Math.max(1, concurrencyOption);
+	const concurrency = resolveConcurrency(options?.concurrency);
 	if (concurrency === 1) return forEachSequential(iterable, f, options);
 	const items = fromIterable(iterable);
 	let length = items.length;
@@ -5989,10 +6066,13 @@ var forEachSequential = (iterable, f, options) => suspend$3(() => {
 		}
 	}), out);
 });
-var iterateEagerImpl = (options) => {
+/** @internal */
+var resolveConcurrency = (concurrency) => concurrency === "unbounded" ? Number.POSITIVE_INFINITY : Math.max(1, concurrency ?? 1);
+/** @internal */
+var iterateEager = () => (options) => {
 	const onItem = options.onItem;
 	const step = options.step;
-	const runSequential = (state, items, index, end) => {
+	const runSequential = (state, items, index = 0, end = items.length) => {
 		for (; index < end; index++) {
 			const item = items[index];
 			const effect = onItem(state, item, index);
@@ -6001,12 +6081,15 @@ var iterateEagerImpl = (options) => {
 			if (terminal) return terminal._tag === "Failure" ? terminal : void 0;
 		}
 	};
+	return runSequential;
+};
+var iterateConcurrentImpl = (options) => {
+	const onItem = options.onItem;
+	const step = options.step;
 	return (state, items, opts) => {
 		let index = 0;
-		const end = opts?.end ?? items.length;
-		const concurrency = opts?.concurrency ?? 1;
-		if (concurrency === 1) return runSequential(state, items, 0, end);
-		const orderedStep = opts?.orderedStep === true;
+		const end = opts.end ?? items.length;
+		const concurrency = opts.concurrency;
 		let done = false;
 		let parentFiber;
 		let fibers;
@@ -6014,8 +6097,6 @@ var iterateEagerImpl = (options) => {
 		let interrupted = false;
 		let terminal;
 		let effect;
-		let nextIndex = index;
-		const exits = orderedStep ? new Array(end) : void 0;
 		const failDefect = (error) => {
 			const defect = exitDie(error);
 			terminal = defect;
@@ -6023,26 +6104,13 @@ var iterateEagerImpl = (options) => {
 			interrupted = true;
 			return fibers && fibers.size > 0 ? flatMap$1(uninterruptible$1(fiberInterruptAll(Array.from(fibers))), () => defect) : defect;
 		};
-		const runStep = (item, exit, currentIndex) => {
-			if (!orderedStep) return step(state, item, exit, currentIndex);
-			if (terminal) return terminal;
-			exits[currentIndex] = exit;
-			while (nextIndex < end) {
-				const nextExit = exits[nextIndex];
-				if (nextExit === void 0) return;
-				exits[nextIndex] = void 0;
-				const index = nextIndex++;
-				const result = step(state, items[index], nextExit, index);
-				if (result) return result;
-			}
-		};
 		const go = () => {
 			let paused = false;
 			for (; !terminal && index < end; index++) {
 				const item = items[index];
 				const eff = effect ?? onItem(state, item, index);
 				if (effectIsExit(eff)) {
-					terminal = runStep(item, eff, index);
+					terminal = step(state, item, eff, index);
 					if (terminal) break;
 				} else if (!parentFiber) return callback$2((cb) => {
 					parentFiber = getCurrentFiber();
@@ -6066,7 +6134,7 @@ var iterateEagerImpl = (options) => {
 					effect = void 0;
 					const fiber = forkUnsafe$1(parentFiber, eff, true, true, "inherit");
 					if (fiber._exit) {
-						terminal = runStep(item, fiber._exit, index);
+						terminal = step(state, item, fiber._exit, index);
 						if (terminal) break;
 						continue;
 					}
@@ -6080,7 +6148,7 @@ var iterateEagerImpl = (options) => {
 								else if (terminal._tag === "Failure") terminal.cause.reasons.push(reason);
 								else terminal = exitFailCause(causeFromReasons([reason]));
 							} else {
-								const result = runStep(item, exit, currentIndex);
+								const result = step(state, item, exit, currentIndex);
 								if (result) {
 									terminal = result._tag === "Failure" ? exitFailCause(causeFromReasons(result.cause.reasons.slice())) : result;
 									go();
@@ -6117,8 +6185,8 @@ var iterateEagerImpl = (options) => {
 	};
 };
 /** @internal */
-var iterateEager = () => iterateEagerImpl;
-var forEachConcurrent = /*#__PURE__*/ iterateEagerImpl({
+var iterateConcurrent = () => (options) => iterateConcurrentImpl(options);
+var forEachConcurrent = /*#__PURE__*/ iterateConcurrentImpl({
 	onItem(state, item, index) {
 		return state.f(item, index);
 	},
@@ -6127,6 +6195,7 @@ var forEachConcurrent = /*#__PURE__*/ iterateEagerImpl({
 		else if (state.out) state.out[index] = exit.value;
 	}
 });
+/** @internal */
 var filterOrElse = /*#__PURE__*/ dual(3, (self, predicate, orElse) => flatMap$1(self, (a) => predicate(a) ? succeed$5(a) : orElse(a)));
 /** @internal */
 var filter$4 = /*#__PURE__*/ dual((args) => isIterable(args[0]) && !isEffect$1(args[0]), (elements, predicate, options) => suspend$3(() => {
@@ -6159,7 +6228,7 @@ var forkUnsafe$1 = (parent, effect, immediate = false, daemon = false, uninterru
 	else parentRuntime.currentDispatcher.scheduleTask(() => child.evaluate(effect), 0);
 	if (!daemon && !child._exit) {
 		parentRuntime.children().add(child);
-		child.addObserver(() => parentRuntime._children.delete(child));
+		child._parent = parentRuntime;
 	}
 	return child;
 };
@@ -6365,7 +6434,7 @@ var filterDisablePropagation = (span) => {
 /** @internal */
 var makeSpanUnsafe = (fiber, name, options) => {
 	const disablePropagation = !fiber.getRef(TracerEnabled) || options?.annotations && get$4(options.annotations, DisablePropagation);
-	const parent = options?.parent !== void 0 ? some(options.parent) : options?.root ? none() : filterDisablePropagation(fiber.currentSpan);
+	const parent = options?.parent !== void 0 ? some(options.parent) : options?.root ? none() : filterDisablePropagation(fiber.cache.span);
 	let span;
 	if (disablePropagation) span = noopSpan({
 		name,
@@ -6385,7 +6454,7 @@ var makeSpanUnsafe = (fiber, name, options) => {
 			parent,
 			annotations: options?.annotations ?? empty$4(),
 			links,
-			startTime: timingEnabled ? clock.currentTimeNanosUnsafe() : BigInt(0),
+			startTime: timingEnabled ? clock.currentTimeNanosUnsafe() : bigint0,
 			kind: options?.kind ?? "internal",
 			root: options?.root ?? isNone(parent),
 			sampled: options?.sampled ?? (isSome(parent) && parent.value.sampled === false ? false : !isLogLevelGreaterThan(fiber.getRef(MinimumTraceLevel), level))
@@ -6416,7 +6485,7 @@ var useSpan$1 = (name, ...args) => {
 		const span = makeSpanUnsafe(fiber, name, options);
 		const clock = fiber.getRef(ClockRef);
 		const timingEnabled = fiber.getRef(TracerTimingEnabled);
-		return onExit$2(internalCall(() => evaluate(span)), (exit) => endSpan(span, exit, clock, timingEnabled));
+		return onExit$2(suspend$3(() => internalCall(() => evaluate(span))), (exit) => endSpan(span, exit, clock, timingEnabled));
 	});
 };
 var provideParentSpan = /*#__PURE__*/ provideService$1(ParentSpan);
@@ -6547,7 +6616,7 @@ var UnknownError = class extends TaggedError$1("UnknownError") {
 	}
 };
 /** @internal */
-var ConsoleRef = /*#__PURE__*/ Reference("effect/Console/CurrentConsole", { defaultValue: () => globalThis.console });
+var ConsoleRef = /*#__PURE__*/ Reference("effect/Console", { defaultValue: () => globalThis.console });
 /** @internal */
 var logLevelToOrder = (level) => {
 	switch (level) {
@@ -6564,7 +6633,7 @@ var logLevelToOrder = (level) => {
 /** @internal */
 var isLogLevelGreaterThan = /*#__PURE__*/ isGreaterThan(/* @__PURE__ */ mapInput(Number$2, logLevelToOrder));
 /** @internal */
-var CurrentLoggers = /*#__PURE__*/ Reference("effect/Loggers/CurrentLoggers", { defaultValue: () => /* @__PURE__ */ new Set([defaultLogger, tracerLogger]) });
+var CurrentLoggers = /*#__PURE__*/ Reference("effect/Logger/CurrentLoggers", { defaultValue: () => /* @__PURE__ */ new Set([defaultLogger, tracerLogger]) });
 /** @internal */
 var LogToStderr = /*#__PURE__*/ Reference("effect/Logger/LogToStderr", { defaultValue: constFalse });
 var LoggerProto = {
@@ -6611,8 +6680,8 @@ var logWithLevel = (level) => (...message) => {
 	}
 	if (cause === void 0) cause = causeEmpty;
 	return withFiber$1((fiber) => {
-		const logLevel = level ?? fiber.currentLogLevel;
-		if (isLogLevelGreaterThan(fiber.minimumLogLevel, logLevel)) return void_$2;
+		const logLevel = level ?? fiber.cache.logLevel;
+		if (isLogLevelGreaterThan(fiber.cache.minimumLogLevel, logLevel)) return void_$2;
 		const clock = fiber.getRef(ClockRef);
 		const loggers = fiber.getRef(CurrentLoggers);
 		if (loggers.size > 0) {
@@ -6659,7 +6728,7 @@ var defaultLogger = /*#__PURE__*/ loggerMake(({ cause, date, fiber, logLevel, me
 var tracerLogger = /*#__PURE__*/ loggerMake(({ cause, fiber, logLevel, message }) => {
 	const clock = fiber.getRef(ClockRef);
 	const annotations = fiber.getRef(CurrentLogAnnotations$1);
-	const span = fiber.currentSpan;
+	const span = fiber.cache.span;
 	if (span === void 0 || span._tag === "ExternalSpan") return;
 	const attributes = {};
 	for (const [key, value] of Object.entries(annotations)) assignProperty(attributes, key, value);
@@ -6675,7 +6744,7 @@ function interruptChildrenPatch() {
 /** @internal */
 var undefined_$1 = /*#__PURE__*/ succeed$5(void 0);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Cause.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Cause.js
 /**
 * Records the full reason an `Effect` failed.
 *
@@ -7084,7 +7153,7 @@ var IllegalArgumentError = IllegalArgumentError$1;
 Service()("effect/Cause/StackTrace");
 Service()("effect/Cause/InterruptorStackTrace");
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Exit.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Exit.js
 /**
 * Checks whether an unknown value is an Exit.
 *
@@ -7290,6 +7359,11 @@ var DeferredProto = {
 		return pipeArguments(this, arguments);
 	}
 };
+var DeferredImpl = function() {
+	this.resumes = void 0;
+	this.effect = void 0;
+};
+DeferredImpl.prototype = DeferredProto;
 /**
 * Creates an empty `Deferred` synchronously outside the `Effect` runtime.
 *
@@ -7310,12 +7384,7 @@ var DeferredProto = {
 * @category unsafe
 * @since 4.0.0
 */
-var makeUnsafe$3 = () => {
-	const self = Object.create(DeferredProto);
-	self.resumes = void 0;
-	self.effect = void 0;
-	return self;
-};
+var makeUnsafe$3 = () => new DeferredImpl();
 /**
 * Creates a new `Deferred`.
 *
@@ -7560,7 +7629,7 @@ var doneUnsafe = (self, effect) => {
 */
 var into = /*#__PURE__*/ dual(2, (self, deferred) => uninterruptibleMask$1((restore) => flatMap$1(exit$1(restore(self)), (exit) => done(deferred, exit))));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/References.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/References.js
 /**
 * Context reference for managing log annotations that are automatically added to all log entries.
 * These annotations provide contextual metadata that appears in every log message.
@@ -7621,7 +7690,7 @@ var into = /*#__PURE__*/ dual(2, (self, deferred) => uninterruptibleMask$1((rest
 */
 var CurrentLogAnnotations = CurrentLogAnnotations$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Scope.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Scope.js
 /**
 * Controls how long resources stay open.
 *
@@ -7867,7 +7936,7 @@ var forkUnsafe = scopeForkUnsafe;
 */
 var close = scopeClose;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Clock.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Clock.js
 /**
 * Context reference for the active time service in the environment.
 *
@@ -7971,7 +8040,7 @@ var nextPow2 = (n) => {
 	return Math.max(Math.pow(2, nextPow), 2);
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Pull.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Pull.js
 /**
 * Models one low-level pull step for stream-like consumers.
 *
@@ -8141,7 +8210,7 @@ var matchEffect$1 = /*#__PURE__*/ dual(2, (self, options) => matchCauseEffect$1(
 	}
 }));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Schedule.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Schedule.js
 var TypeId$7 = "~effect/Schedule";
 /**
 * Context reference containing metadata for the currently running schedule step.
@@ -8574,7 +8643,7 @@ var while_ = /*#__PURE__*/ dual(2, (self, predicate) => fromStep(map$4(toStep(se
 */
 var forever$1 = /*#__PURE__*/ spaced(zero);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/schedule.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/schedule.js
 /** @internal */
 var repeatOrElse = /*#__PURE__*/ dual(3, (self, schedule, orElse) => flatMap$1(toStepWithMetadata(schedule), (step) => {
 	let meta = CurrentMetadata.defaultValue();
@@ -8619,7 +8688,7 @@ var buildFromOptions = (options) => {
 	return schedule;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Effect.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Effect.js
 /**
 * Checks whether a value is an `Effect`.
 *
@@ -11094,6 +11163,8 @@ var onError = onError$1;
 * Ensures that a cleanup function runs whether this effect succeeds, fails, or
 * is interrupted.
 *
+* **Details**
+*
 * If both the effect and the cleanup function fail, the two causes are merged.
 *
 * **Example** (Observing every exit)
@@ -11171,8 +11242,8 @@ var onExit$1 = onExit$2;
 */
 var cached = cached$1;
 /**
-* Returns an effect that caches its result for a specified `Duration`,
-* known as "timeToLive" (TTL).
+* Returns an effect that caches its result for a fixed duration or a duration
+* computed from its `Exit`, known as "timeToLive" (TTL).
 *
 * **When to use**
 *
@@ -11191,6 +11262,17 @@ var cached = cached$1;
 * After the specified duration has passed, the cache expires, and the effect
 * will be recomputed upon the next evaluation.
 *
+* `timeToLive` accepts a `Duration.Input` or a function from `Exit<A, E>` to
+* `Duration.Input`. The function runs once after each fresh computation,
+* including failures, so successes and failures can have different TTLs. It
+* does not run when the cache is created or when a cached result is reused.
+* The callback also receives interruption exits, which are cached for the
+* returned duration.
+*
+* The TTL starts when the computation completes. Concurrent callers share the
+* pending computation. A zero TTL expires immediately, and an infinite TTL
+* keeps the result indefinitely.
+*
 * **Example** (Memoizing an effect with TTL)
 *
 * ```ts import.meta.vitest
@@ -11215,6 +11297,26 @@ var cached = cached$1;
 * output // => ["expensive task...", "result 1", "result 1", "result 1"]
 * ```
 *
+* **Example** (Caching successes while retrying failures)
+*
+* ```ts import.meta.vitest
+* import { Effect, Exit } from "effect"
+*
+* let attempts = 0
+* const task = Effect.suspend(() =>
+*   ++attempts === 1 ? Effect.fail("temporary failure") : Effect.succeed(42)
+* )
+* const program = Effect.gen(function*() {
+*   const cached = yield* task.pipe(
+*     Effect.cachedWithTTL((exit) => Exit.isSuccess(exit) ? "1 hour" : 0)
+*   )
+*   yield* Effect.exit(cached)
+*   return yield* cached
+* })
+*
+* Effect.runSync(program) // => 42
+* ```
+*
 * @see {@link cached} for a similar function that caches the result
 * indefinitely.
 * @see {@link cachedInvalidateWithTTL} for a similar function that includes an
@@ -12484,7 +12586,7 @@ var catchEager = catchEager$1;
 */
 var fnUntracedEager = fnUntracedEager$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Fiber.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Fiber.js
 /**
 * Joins a fiber, blocking until it completes. If the fiber succeeds,
 * returns its value. If it fails, the error is propagated.
@@ -12680,7 +12782,7 @@ var getCurrent = getCurrentFiber;
 */
 var runIn = fiberRunIn;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Latch.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Latch.js
 /**
 * Creates a `Latch` synchronously, outside of `Effect`.
 *
@@ -12751,7 +12853,7 @@ var makeUnsafe$1 = makeLatchUnsafe;
 */
 var make$7 = makeLatch;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/MutableRef.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/MutableRef.js
 var TypeId$6 = "~effect/MutableRef";
 var MutableRefProto = {
 	[TypeId$6]: TypeId$6,
@@ -12892,7 +12994,7 @@ var set = /*#__PURE__*/ dual(2, (self, value) => {
 	return self;
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/MutableList.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/MutableList.js
 /**
 * Mutable lists for collecting ordered values and draining them from the front.
 * A `MutableList<A>` can append values to the end, prepend values to the
@@ -13114,6 +13216,11 @@ var clear = (self) => {
 * The taken elements are removed from the list. This operation is optimized for performance
 * and includes zero-copy optimizations when possible.
 *
+* **Details**
+*
+* Finite fractional values of `n` are rounded down. `NaN` and non-positive
+* values leave the list unchanged and return an empty array.
+*
 * **Example** (Taking batches)
 *
 * ```ts import.meta.vitest
@@ -13131,6 +13238,7 @@ var clear = (self) => {
 * @since 4.0.0
 */
 var takeN = (self, n) => {
+	n = normalize(n);
 	if (n <= 0 || !self.head) return [];
 	n = Math.min(n, self.length);
 	if (n === self.length && self.head?.offset === 0 && !self.head.next) {
@@ -13286,7 +13394,7 @@ var filter$2 = (self, f) => {
 */
 var remove = (self, value) => filter$2(self, (v) => v !== value);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/PubSub.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/PubSub.js
 /**
 * Broadcasts values from publishers to many subscribers.
 *
@@ -13962,6 +14070,7 @@ var BoundedPubSubArbSubscription = class {
 		return Empty;
 	}
 	pollUpTo(n) {
+		n = normalize(n);
 		if (this.unsubscribed) return [];
 		this.subscriberIndex = Math.max(this.subscriberIndex, this.self.subscribersIndex);
 		const size = this.self.publisherIndex - this.subscriberIndex;
@@ -14113,6 +14222,7 @@ var BoundedPubSubPow2Subscription = class {
 		return Empty;
 	}
 	pollUpTo(n) {
+		n = normalize(n);
 		if (this.unsubscribed) return [];
 		this.subscriberIndex = Math.max(this.subscriberIndex, this.self.subscribersIndex);
 		const size = this.self.publisherIndex - this.subscriberIndex;
@@ -14230,22 +14340,18 @@ var BoundedPubSubSingleSubscription = class {
 		const elem = this.self.value;
 		this.self.subscribers -= 1;
 		if (this.self.subscribers === 0) this.self.value = AbsentValue;
-		this.subscriberIndex += 1;
+		this.subscriberIndex = this.self.publisherIndex;
 		return elem;
 	}
 	pollUpTo(n) {
-		if (this.isEmpty() || n < 1) return [];
-		const a = this.self.value;
-		this.self.subscribers -= 1;
-		if (this.self.subscribers === 0) this.self.value = AbsentValue;
-		this.subscriberIndex += 1;
-		return [a];
+		if (normalize(n) < 1 || this.isEmpty()) return [];
+		return [this.poll()];
 	}
 	unsubscribe() {
 		if (!this.unsubscribed) {
 			this.unsubscribed = true;
 			this.self.subscriberCount -= 1;
-			if (this.subscriberIndex !== this.self.publisherIndex) {
+			if (this.self.subscribers !== 0 && this.subscriberIndex !== this.self.publisherIndex) {
 				this.self.subscribers -= 1;
 				if (this.self.subscribers === 0) this.self.value = AbsentValue;
 			}
@@ -14367,6 +14473,7 @@ var UnboundedPubSubSubscription = class {
 		return polled;
 	}
 	pollUpTo(n) {
+		n = normalize(n);
 		const builder = [];
 		let i = 0;
 		while (i !== n) {
@@ -14789,6 +14896,7 @@ var ReplayWindowImpl = class {
 		return value;
 	}
 	takeN(n) {
+		n = normalize(n);
 		const len = Math.min(n, this.remaining);
 		const items = new Array(len);
 		for (let i = 0; i < len; i++) items[i] = this.take();
@@ -14806,7 +14914,7 @@ var emptyReplayWindow = {
 	close: () => void 0
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Queue.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Queue.js
 /**
 * Passes values asynchronously between fibers.
 *
@@ -15385,9 +15493,10 @@ var takeAll = (self) => takeBetween(self, 1, Number.POSITIVE_INFINITY);
 * **Details**
 *
 * The operation waits when fewer than the required minimum messages are
-* available. It returns at most `max` messages. If the queue completes or fails
-* before the minimum can be satisfied, the effect fails with the queue's
-* terminal error.
+* available. It returns at most `max` messages. Finite fractional bounds are
+* rounded down, while `NaN` and non-positive bounds are treated as `0`. If the
+* queue completes or fails before the minimum can be satisfied, the effect
+* fails with the queue's terminal error.
 *
 * **Example** (Taking a bounded batch of values)
 *
@@ -15417,7 +15526,11 @@ var takeAll = (self) => takeBetween(self, 1, Number.POSITIVE_INFINITY);
 * @category taking
 * @since 2.0.0
 */
-var takeBetween = (self, min, max) => suspend$3(() => takeBetweenUnsafe(self, min, max) ?? andThen$1(awaitTake(self), takeBetween(self, 1, max)));
+var takeBetween = (self, min, max) => {
+	min = normalize(min);
+	max = normalize(max);
+	return suspend$3(() => takeBetweenUnsafe(self, min, max) ?? andThen$1(awaitTake(self), takeBetween(self, 1, max)));
+};
 /**
 * Takes a single message from the queue, or wait for a message to be
 * available.
@@ -15508,10 +15621,7 @@ var takeUnsafe = (self) => {
 		releaseCapacity(self);
 		return exitSucceed(message);
 	} else if (self.capacity <= 0 && self.state.offers.size > 0) {
-		self.capacity = 1;
-		releaseCapacity(self);
-		self.capacity = 0;
-		const message = take$3(self.messages);
+		const message = takeOfferUnsafe(self.state.offers);
 		releaseCapacity(self);
 		return exitSucceed(message);
 	}
@@ -15570,7 +15680,6 @@ var exitTrue = /*#__PURE__*/ exitSucceed(true);
 var exitFailDone = /*#__PURE__*/ exitFail(/*#__PURE__*/ Done());
 var exitInterrupt = /*#__PURE__*/ exitInterrupt$1();
 var releaseTakers = (self) => {
-	self.scheduleRunning = false;
 	if (self.state._tag === "Done" || self.state.takers.size === 0) return;
 	for (const taker of self.state.takers) {
 		self.state.takers.delete(taker);
@@ -15581,16 +15690,16 @@ var releaseTakers = (self) => {
 var scheduleReleaseTaker = (self) => {
 	if (self.scheduleRunning || self.state._tag === "Done" || self.state.takers.size === 0) return;
 	self.scheduleRunning = true;
-	self.dispatcher.scheduleTask(() => releaseTakers(self), 0);
+	self.dispatcher.scheduleTask(() => {
+		self.scheduleRunning = false;
+		releaseTakers(self);
+	}, 0);
 };
 var takeBetweenUnsafe = (self, min, max) => {
 	if (self.state._tag === "Done") return self.state.exit;
 	else if (max <= 0 || min <= 0) return exitSucceed([]);
-	else if (self.capacity <= 0 && self.state.offers.size > 0) {
-		self.capacity = 1;
-		releaseCapacity(self);
-		self.capacity = 0;
-		const messages = [take$3(self.messages)];
+	else if (self.capacity <= 0 && self.messages.length === 0 && self.state.offers.size > 0) {
+		const messages = [takeOfferUnsafe(self.state.offers)];
 		releaseCapacity(self);
 		return exitSucceed(messages);
 	}
@@ -15630,6 +15739,20 @@ var offerRemainingArray = (self, remaining) => {
 		});
 	});
 };
+var takeOfferUnsafe = (offers) => {
+	const entry = offers.values().next().value;
+	if (entry._tag === "Single") {
+		offers.delete(entry);
+		entry.resume(exitTrue);
+		return entry.message;
+	}
+	const message = entry.remaining[entry.offset++];
+	if (entry.offset === entry.remaining.length) {
+		offers.delete(entry);
+		entry.resume(exitSucceed([]));
+	}
+	return message;
+};
 var releaseCapacity = (self) => {
 	if (self.state._tag === "Done") return isDoneCause(self.state.exit.cause);
 	else if (self.state.offers.size === 0) {
@@ -15639,21 +15762,22 @@ var releaseCapacity = (self) => {
 		}
 		return false;
 	}
-	let n = self.capacity - self.messages.length;
-	for (const entry of self.state.offers) if (n === 0) break;
-	else if (entry._tag === "Single") {
-		append(self.messages, entry.message);
-		n--;
-		entry.resume(exitTrue);
-		self.state.offers.delete(entry);
-	} else {
-		for (; entry.offset < entry.remaining.length; entry.offset++) {
-			if (n === 0) return false;
-			append(self.messages, entry.remaining[entry.offset]);
-			n--;
+	for (const entry of self.state.offers) {
+		let n = self.capacity - self.messages.length;
+		if (n <= 0) break;
+		else if (entry._tag === "Single") {
+			append(self.messages, entry.message);
+			self.state.offers.delete(entry);
+			entry.resume(exitTrue);
+		} else {
+			for (; entry.offset < entry.remaining.length; entry.offset++) {
+				if (n === 0) return false;
+				append(self.messages, entry.remaining[entry.offset]);
+				n--;
+			}
+			self.state.offers.delete(entry);
+			entry.resume(exitSucceed([]));
 		}
-		entry.resume(exitSucceed([]));
-		self.state.offers.delete(entry);
 	}
 	return false;
 };
@@ -15677,7 +15801,7 @@ var finalize = (self, exit) => {
 	openState.awaiters.clear();
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Semaphore.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Semaphore.js
 /**
 * Creates a `Semaphore` synchronously with the specified total
 * number of permits.
@@ -15838,7 +15962,7 @@ var SemaphoreImpl = class {
 */
 var make$2 = (permits) => sync$1(() => new SemaphoreImpl(permits));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Take.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Take.js
 /**
 * Converts a `Take` into a `Pull`, succeeding with value batches, failing with
 * failure exits, and translating successful exits into pull completion.
@@ -15853,7 +15977,7 @@ var make$2 = (permits) => sync$1(() => new SemaphoreImpl(permits));
 */
 var toPull$2 = (take) => isExit(take) ? isSuccess(take) ? done$1(take.value) : take : succeed$2(take);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Channel.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Channel.js
 /**
 * Provides low-level building blocks for streaming data through Effect.
 *
@@ -17378,27 +17502,26 @@ var toPubSubTake$1 = /*#__PURE__*/ dual(2, /*#__PURE__*/ fnUntraced(function* (s
 	return pubsub;
 }));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/stream.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/stream.js
 var TypeId$2 = "~effect/Stream";
 var streamVariance = {
 	_R: identity,
 	_E: identity,
 	_A: identity
 };
-var StreamProto = {
+var Stream = function(channel) {
+	this.channel = channel;
+};
+Stream.prototype = {
 	[TypeId$2]: streamVariance,
 	pipe() {
 		return pipeArguments(this, arguments);
 	}
 };
 /** @internal */
-var fromChannel$1 = (channel) => {
-	const self = Object.create(StreamProto);
-	self.channel = channel;
-	return self;
-};
+var fromChannel$1 = (channel) => new Stream(channel);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/internal/rcRef.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/internal/rcRef.js
 var TypeId$1 = "~effect/RcRef";
 var stateEmpty = { _tag: "Empty" };
 var stateClosed = { _tag: "Closed" };
@@ -17445,7 +17568,8 @@ var getState = (self) => uninterruptibleMask(function loop(restore) {
 			const scope = makeUnsafe$2();
 			return self.semaphore.withPermit(suspend$2(() => {
 				if (self.state._tag !== "Empty") return loop(restore);
-				return restore(provideContext(self.acquire, add(self.context, Scope, scope))).pipe(map$2((value) => {
+				return restore(provideContext(self.acquire, add(self.context, Scope, scope))).pipe(flatMap((value) => {
+					if (self.state._tag === "Closed") return interrupt$1;
 					const state = {
 						_tag: "Acquired",
 						value,
@@ -17455,7 +17579,7 @@ var getState = (self) => uninterruptibleMask(function loop(restore) {
 						invalidated: false
 					};
 					self.state = state;
-					return state;
+					return succeed$2(state);
 				}), onExit$1((exit) => isFailure(exit) ? close(scope, exit) : void_));
 			}));
 		}
@@ -17470,13 +17594,12 @@ var get$1 = /*#__PURE__*/ fnUntraced(function* (self_) {
 	yield* addFinalizerExit(scope$3, () => {
 		state.refCount--;
 		if (state.refCount > 0) return void_;
-		if (self.idleTimeToLive === void 0) {
-			self.state = stateEmpty;
+		if (self.idleTimeToLive === void 0 || state.invalidated) {
+			if (self.state === state) self.state = stateEmpty;
 			return close(state.scope, void_$1);
-		} else if (state.invalidated) return close(state.scope, void_$1);
-		else if (!isFinite$1) return void_;
+		} else if (!isFinite$1) return void_;
 		state.fiber = sleep(self.idleTimeToLive).pipe(flatMap(() => {
-			if (self.state._tag === "Acquired" && self.state.refCount === 0) {
+			if (self.state === state && state.refCount === 0) {
 				self.state = stateEmpty;
 				return close(state.scope, void_$1);
 			}
@@ -17489,7 +17612,7 @@ var get$1 = /*#__PURE__*/ fnUntraced(function* (self_) {
 	return state.value;
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/RcRef.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/RcRef.js
 /**
 * Creates an `RcRef` from an acquire effect.
 *
@@ -17583,7 +17706,7 @@ var make = make$1;
 */
 var get = get$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.112/node_modules/effect/dist/Stream.js
+//#region ../../node_modules/.pnpm/effect@4.0.0-rc.115/node_modules/effect/dist/Stream.js
 /**
 * Describes effectful sources that emit values over time.
 *
@@ -18368,7 +18491,12 @@ var catchCause = /*#__PURE__*/ dual(2, (self, f) => self.channel.pipe(catchCause
 */
 var mapError = /*#__PURE__*/ dual(2, (self, f) => fromChannel(mapError$1(self.channel, f)));
 /**
-* Takes the first `n` elements from this stream, returning `Stream.empty` when `n < 1`.
+* Takes the first `n` elements from this stream.
+*
+* **Details**
+*
+* Finite fractional values of `n` are rounded down. `NaN` and non-positive
+* values return `Stream.empty` without evaluating the source stream.
 *
 * **Example** (Taking values from the left)
 *
@@ -18389,7 +18517,10 @@ var mapError = /*#__PURE__*/ dual(2, (self, f) => fromChannel(mapError$1(self.ch
 * @category filtering
 * @since 2.0.0
 */
-var take = /*#__PURE__*/ dual(2, (self, n) => n < 1 ? empty : takeUntil(self, (_, i) => i === n - 1));
+var take = /*#__PURE__*/ dual(2, (self, n) => {
+	const count = normalize(n);
+	return count === 0 ? empty : takeUntil(self, (_, i) => i === count - 1);
+});
 /**
 * Takes elements until the predicate matches.
 *
@@ -19015,4 +19146,4 @@ var wagmiConnectResult = (withCapabilities, accounts, chainId) => ({
 	chainId
 });
 //#endregion
-export { shutdown$1 as $, merge$1 as $i, upTo as $n, encodeBase64 as $r, mapEager as $t, share as A, filter$5 as Ai, succeedSome as An, isFailReason as Ar, fail$2 as At, zipLatestAll as B, isReadonlyArrayNonEmpty as Bi, updateContext as Bn, onExit$2 as Br, forever as Bt, mapError as C, isLessThanOrEqualTo$1 as Ca, toSeconds as Ci, runSyncWith as Cn, NoSuchElementError as Cr, catchTag as Ct, runForEach as D, strictEqual as Da, chunksOf as Di, sleep as Dn, hasInterrupts as Dr, die as Dt, runDrain as E, make$13 as Ea, appendAll$1 as Ei, service as En, findErrorOption as Er, contextWith as Et, tap as F, get$3 as Fi, tryPromise as Fn, effectIsExit as Fr, flatMapEager as Ft, failCauseUnsafe as G, Reference as Gi, withParentSpan as Gn, succeed$5 as Gr, gen as Gt, make$2 as H, makeEquivalence as Hi, void_ as Hn, provideContext$1 as Hr, forkIn as Ht, toPull as I, getSomes as Ii, try_ as In, flatMap$1 as Ir, fn as It, offerUnsafe as J, empty$4 as Ji, exponential as Jn, void_$2 as Jr, isEffect as Jt, make$3 as K, Service as Ki, withSpan as Kn, suspend$3 as Kr, ignore as Kt, toQueue as L, head as Li, undefined_ as Ln, forEach$1 as Lr, fnUntraced as Lt, suspend as M, findFirst as Mi, sync as Mn, map$3 as Mr, failCauseSync as Mt, switchMap as N, flatMap$2 as Ni, tap$1 as Nn, squash as Nr, filterOrFail as Nt, runForEachArray as O, dedupeWith as Oi, succeed$2 as On, hasInterruptsOnly as Or, ensuring$2 as Ot, take as P, fromIterable as Pi, tapError as Pn, andThen$1 as Pr, flatMap as Pt, publishUnsafe as Q, make$11 as Qi, spaced as Qn, decodeBase64 as Qr, mapBothEager as Qt, toReadableStreamEffect as R, headNonEmpty as Ri, uninterruptible as Rn, iterateEager as Rr, fnUntracedEager as Rt, mapEffect as S, isLessThan$1 as Sa, toMinutes as Si, runSyncExit as Sn, IllegalArgumentError as Sr, catchIf as St, paginate as T, Tuple as Ta, append$1 as Ti, scopedWith as Tn, filterInterruptors as Tr, context as Tt, makeUnsafe as U, map$5 as Ui, whileLoop as Un, provideService$1 as Ur, forkScoped as Ut, toPullScoped as V, lastNonEmpty as Vi, useSpan as Vn, orDie$1 as Vr, forkDetach as Vt, dropping as W, empty$3 as Wi, withFiber as Wn, scopeAddFinalizerExit as Wr, fromResult as Wt, take$1 as X, getOrUndefined as Xi, modifyDelay as Xn, setStackTraceLimit as Xr, logWarning as Xt, shutdown as Y, get$4 as Yi, isSchedule as Yn, getStackTraceLimit as Yr, logError as Yt, publish as Z, getUnsafe$1 as Zi, passthrough as Zn, DisablePropagation as Zr, map$2 as Zt, fromReadableStream as _, BigInt$1 as _a, minutes as _i, runCallbackWith as _n, isExit as _r, cached as _t, changes as a, fromNullishOr as aa, Scheduler as ai, onError as an, forkUnsafe as ar, interruptAll as at, isStream as b, isGreaterThan as ba, toHours as bi, runPromiseExit as bn, succeed$4 as br, catchCause$2 as bt, empty as c, getOrThrowWith as ca, toPredicate as ci, orDie as cn, _await as cr, runIn as ct, filter as d, isSome as da, hours as di, provideService as dn, into as dr, all as dt, mergeAll$1 as ea, Class as ei, mapError$2 as en, isDoneCause as er, unbounded as et, filterEffect as f, liftThrowable as fa, isFinite as fi, race as fn, make$8 as fr, andThen as ft, fromQueue as g, some as ga, min as gi, retry as gn, failCause$4 as gr, asVoid as gt, fromPubSub as h, none as ha, millis as hi, result as hn, fail$3 as hr, asSome as ht, catchCause as i, flatMapNullishOr as ia, MixedScheduler as ii, never$2 as in, close as ir, interrupt as it, succeed as j, filterMap as ji, suspend$2 as jn, isTimeoutError as jr, failCause$2 as jt, runHead as k, empty$2 as ki, succeedNone as kn, interrupt$3 as kr, exit as kt, ensuring as l, getOrUndefined$1 as la, days as li, orElseSucceed as ln, done as lr, acquireRelease as lt, fromEffectSchedule as m, match$2 as ma, max as mi, repeat as mn, succeed$3 as mr, as as mt, createConnector as n, filter$6 as na, TaggedClass as ni, matchCauseEffect as nn, Scope as nr, set as nt, changesWith as o, getOrElse as oa, compose as oi, onExit$1 as on, makeUnsafe$2 as or, join as ot, fromEffect as p, map$6 as pa, isLessThan as pi, raceFirst as pn, makeUnsafe$3 as pr, annotateLogs as pt, offer as q, add as qi, yieldNow as qn, sync$1 as qr, interrupt$1 as qt, callback as r, flatMap$3 as ra, TaggedError as ri, matchEffect as rn, addFinalizer$1 as rr, getCurrent as rt, debounce as s, getOrNull as sa, has as si, onInterrupt as sn, provide as sr, joinAll as st, wagmiConnectResult as t, exists as ta, Error$1 as ti, mapErrorEager as tn, currentTimeMillis as tr, make$6 as tt, fail as u, isNone as ua, fromInputUnsafe as ui, promise as un, doneUnsafe as ur, addFinalizer as ut, fromSchedule as v, Date$1 as va, seconds as vi, runFork as vn, isFailure as vr, cachedWithTTL as vt, never as w, make$12 as wa, zero as wi, scope as wn, fail$4 as wr, catch_$1 as wt, map as x, isGreaterThanOrEqualTo as xa, toMillis as xi, runSync as xn, void_$1 as xr, catchEager as xt, interruptWhen as y, Number$2 as ya, toDays as yi, runForkWith as yn, isSuccess as yr, callback$1 as yt, unwrap as z, isArrayNonEmpty as zi, uninterruptibleMask as zn, map$4 as zr, forEach as zt };
+export { shutdown$1 as $, merge$1 as $i, upTo as $n, encodeBase64 as $r, mapEager as $t, share as A, filter$5 as Ai, succeedSome as An, isFailReason as Ar, fail$2 as At, zipLatestAll as B, isReadonlyArrayNonEmpty as Bi, updateContext as Bn, map$4 as Br, forever as Bt, mapError as C, isLessThanOrEqualTo$1 as Ca, toSeconds as Ci, runSyncWith as Cn, NoSuchElementError as Cr, catchTag as Ct, runForEach as D, strictEqual as Da, chunksOf as Di, sleep as Dn, hasInterrupts as Dr, die as Dt, runDrain as E, make$13 as Ea, appendAll$1 as Ei, service as En, findErrorOption as Er, contextWith as Et, tap as F, get$3 as Fi, tryPromise as Fn, effectIsExit as Fr, flatMapEager as Ft, failCauseUnsafe as G, Reference as Gi, withParentSpan as Gn, resolveConcurrency as Gr, gen as Gt, make$2 as H, makeEquivalence as Hi, void_ as Hn, orDie$1 as Hr, forkIn as Ht, toPull as I, getSomes as Ii, try_ as In, flatMap$1 as Ir, fn as It, offerUnsafe as J, empty$4 as Ji, exponential as Jn, suspend$3 as Jr, isEffect as Jt, make$3 as K, Service as Ki, withSpan as Kn, scopeAddFinalizerExit as Kr, ignore as Kt, toQueue as L, head as Li, undefined_ as Ln, forEach$1 as Lr, fnUntraced as Lt, suspend as M, findFirst as Mi, sync as Mn, map$3 as Mr, failCauseSync as Mt, switchMap as N, flatMap$2 as Ni, tap$1 as Nn, squash as Nr, filterOrFail as Nt, runForEachArray as O, dedupeWith as Oi, succeed$2 as On, hasInterruptsOnly as Or, ensuring$2 as Ot, take as P, fromIterable as Pi, tapError as Pn, andThen$1 as Pr, flatMap as Pt, publishUnsafe as Q, make$11 as Qi, spaced as Qn, decodeBase64 as Qr, mapBothEager as Qt, toReadableStreamEffect as R, headNonEmpty as Ri, uninterruptible as Rn, iterateConcurrent as Rr, fnUntracedEager as Rt, mapEffect as S, isLessThan$1 as Sa, toMinutes as Si, runSyncExit as Sn, IllegalArgumentError as Sr, catchIf as St, paginate as T, Tuple as Ta, append$1 as Ti, scopedWith as Tn, filterInterruptors as Tr, context as Tt, makeUnsafe as U, map$5 as Ui, whileLoop as Un, provideContext$1 as Ur, forkScoped as Ut, toPullScoped as V, lastNonEmpty as Vi, useSpan as Vn, onExit$2 as Vr, forkDetach as Vt, dropping as W, empty$3 as Wi, withFiber as Wn, provideService$1 as Wr, fromResult as Wt, take$1 as X, getOrUndefined as Xi, modifyDelay as Xn, void_$2 as Xr, logWarning as Xt, shutdown as Y, get$4 as Yi, isSchedule as Yn, sync$1 as Yr, logError as Yt, publish as Z, getUnsafe$1 as Zi, passthrough as Zn, DisablePropagation as Zr, map$2 as Zt, fromReadableStream as _, BigInt$1 as _a, minutes as _i, runCallbackWith as _n, isExit as _r, cached as _t, changes as a, fromNullishOr as aa, Scheduler as ai, onError as an, forkUnsafe as ar, interruptAll as at, isStream as b, isGreaterThan as ba, toHours as bi, runPromiseExit as bn, succeed$4 as br, catchCause$2 as bt, empty as c, getOrThrowWith as ca, toPredicate as ci, orDie as cn, _await as cr, runIn as ct, filter as d, isSome as da, hours as di, provideService as dn, into as dr, all as dt, mergeAll$1 as ea, Class as ei, mapError$2 as en, isDoneCause as er, unbounded as et, filterEffect as f, liftThrowable as fa, isFinite as fi, race as fn, make$8 as fr, andThen as ft, fromQueue as g, some as ga, min as gi, retry as gn, failCause$4 as gr, asVoid as gt, fromPubSub as h, none as ha, millis as hi, result as hn, fail$3 as hr, asSome as ht, catchCause as i, flatMapNullishOr as ia, MixedScheduler as ii, never$2 as in, close as ir, interrupt as it, succeed as j, filterMap as ji, suspend$2 as jn, isTimeoutError as jr, failCause$2 as jt, runHead as k, empty$2 as ki, succeedNone as kn, interrupt$3 as kr, exit as kt, ensuring as l, getOrUndefined$1 as la, days as li, orElseSucceed as ln, done as lr, acquireRelease as lt, fromEffectSchedule as m, match$2 as ma, max as mi, repeat as mn, succeed$3 as mr, as as mt, createConnector as n, filter$6 as na, TaggedClass as ni, matchCauseEffect as nn, Scope as nr, set as nt, changesWith as o, getOrElse as oa, compose as oi, onExit$1 as on, makeUnsafe$2 as or, join as ot, fromEffect as p, map$6 as pa, isLessThan as pi, raceFirst as pn, makeUnsafe$3 as pr, annotateLogs as pt, offer as q, add as qi, yieldNow as qn, succeed$5 as qr, interrupt$1 as qt, callback as r, flatMap$3 as ra, TaggedError as ri, matchEffect as rn, addFinalizer$1 as rr, getCurrent as rt, debounce as s, getOrNull as sa, has as si, onInterrupt as sn, provide as sr, joinAll as st, wagmiConnectResult as t, exists as ta, Error$1 as ti, mapErrorEager as tn, currentTimeMillis as tr, make$6 as tt, fail as u, isNone as ua, fromInputUnsafe as ui, promise as un, doneUnsafe as ur, addFinalizer as ut, fromSchedule as v, Date$1 as va, seconds as vi, runFork as vn, isFailure as vr, cachedWithTTL as vt, never as w, make$12 as wa, zero as wi, scope as wn, fail$4 as wr, catch_$1 as wt, map as x, isGreaterThanOrEqualTo as xa, toMillis as xi, runSync as xn, void_$1 as xr, catchEager as xt, interruptWhen as y, Number$2 as ya, toDays as yi, runForkWith as yn, isSuccess as yr, callback$1 as yt, unwrap as z, isArrayNonEmpty as zi, uninterruptibleMask as zn, iterateEager as zr, forEach as zt };