@solidjs/signals 2.0.0-rc.13 → 2.0.0-rc.15

package/dist/prod/core/async.js

@@ -1,43 +1,39 @@
-import { STATUS_UNINITIALIZED, CONFIG_CHILD_COMPANIONS, STATUS_ERROR, STATUS_PENDING, CONFIG_DERIVED_OVERRIDE, CONFIG_INPUTS_PUBLISHED, REACTIVE_DIRTY, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, unwrapOverride, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, REACTIVE_DISPOSED } from "./constants.js";
+import { STATUS_UNINITIALIZED, STATUS_ERROR, STATUS_PENDING, CONFIG_GUESS, CONFIG_AUTO_DISPOSE, REACTIVE_DIRTY, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_HELD, CONFIG_OVERRIDE, REACTIVE_ZOMBIE } from "./constants.js";
 
-import { untrack, ext, statusNotifierOf, hasActiveOverride, setSignal, context } from "./core.js";
+import { untrack, ext, context, statusNotifierOf, setSignal } from "./core.js";
 
-import "./invariants.js";
-
-import { StatusError, NotReadyError } from "./error.js";
+import { NotReadyError, StatusError } from "./error.js";
 
 import { trimStaleDeps, unobserved } from "./graph.js";
 
 import { enqueueSub } from "./heap.js";
 
-import { assignOrMergeLane, resolveLane, resolveTransition } from "./lanes.js";
-
 import { cleanup } from "./owner.js";
 
-import { GlobalQueue, schedule, flush, queuePendingNode, insertSubs, clock, waitingTransition, currentTransition, globalQueue, enterWaiting, setOrigin, origin } from "./scheduler.js";
+import { question, MAINLINE_QUESTION, passLane, joinFuture, clock, schedule, flush, globalQueue, txOf, GlobalQueue, queuePendingNode } from "./scheduler.js";
 
 // The lazily-created Set is the ONE container for pending sources. Its
 // predecessor — a singular slot promoted to a Set on the second source —
 // created dual state whose migration invariant was easy to break: a third
 // overlapping source landed beside the Set and removePendingSource refused
 // to clear it, stranding the Set members' pending forever (#2893).
-function addPendingSource(e, n) {
-    if (e.o?.ue?.has(n)) return false;
-    (ext(e).ue ??= new Set).add(n);
+function addPendingSource(e, t) {
+    if (e.m?.Se?.has(t)) return false;
+    (ext(e).Se ??= new Set).add(t);
     return true;
 }
 
-function removePendingSource(e, n) {
-    const t = e.o?.ue;
-    if (!t?.delete(n)) return false;
-    if (!t.size) e.o.ue = undefined;
+function removePendingSource(e, t) {
+    const n = e.m?.Se;
+    if (!n?.delete(t)) return false;
+    if (!n.size) e.m.Se = undefined;
     return true;
 }
 
 function clearPendingSources(e) {
     // This set is node-owned and never shared; dropping the sole reference
     // releases the set and every entry without a redundant clear() walk.
-    if (e.o !== null) e.o.ue = undefined;
+    if (e.m !== null) e.m.Se = undefined;
 }
 
 // A rejection-pending only resolves through the settle sweep over the
@@ -45,10 +41,10 @@ function clearPendingSources(e) {
 // edge: a dep that IS the source, or one whose own pending chain carries it
 // (pending sources propagate the origin node, so this covers any depth).
 // Also guards branch-local recovery: another dependency may still need the source.
-function retryReaches(e, n) {
-    for (let t = e.Ie; t; t = t.Ne) {
-        const e = t.Oe.De || t.Oe;
-        if (e === n || e.o?.ue?.has(n)) return true;
+function retryReaches(e, t) {
+    for (let n = e.p; n; n = n._) {
+        const e = n.I;
+        if (e === t || e.m?.Se?.has(t)) return true;
     }
     return false;
 }
@@ -57,39 +53,35 @@ function retryReaches(e, n) {
  * A loading-window node hit an unready source (sync throw in recompute, or a
  * NotReadyError-rejected flight): register for the source's settle — the
  * settlePendingSource walk runs off `_pendingSources` + `_blocked` alone —
- * with NO read-visible pending status, no downstream propagation, no
- * transition, no lane registration. Commit #0 keeps serving.
- */ function parkLoadingWindow(e, n) {
-    ext(e).Pe = true;
-    if (n.source) addPendingSource(e, n.source);
+ * with NO read-visible pending status and no downstream propagation. Commit
+ * #0 keeps serving.
+ */ function parkLoadingWindow(e, t) {
+    ext(e).de = true;
+    if (t.source) addPendingSource(e, t.source);
     // A settled error is the node's answer ("the error stays the answer until
     // this retry can actually run") — the park must not replace it: reads
     // throw `_error` while STATUS_ERROR is set, and overwriting it here leaks
     // a pending-class NotReadyError from a read-invisible park (#2989).
-        if (!(e.h & STATUS_ERROR)) setPendingError(e, n.source, n);
+        if (!(e.S & STATUS_ERROR)) setPendingError(e, t.source, t);
 }
 
-function setPendingError(e, n, t) {
-    if (!n) {
-        if (e.o !== null) e.o._ = null;
+function setPendingError(e, t, n) {
+    if (!t) {
+        if (e.m !== null) e.m.F = null;
         return;
     }
-    if (t instanceof NotReadyError && t.source === n) {
-        ext(e)._ = t;
+    if (n instanceof NotReadyError && n.source === t) {
+        ext(e).F = n;
         return;
     }
-    const r = e.o?._;
-    if (!(r instanceof NotReadyError) || r.source !== n) {
-        ext(e)._ = new NotReadyError(n);
+    const r = e.m?.F;
+    if (!(r instanceof NotReadyError) || r.source !== t) {
+        ext(e).F = new NotReadyError(t);
     }
 }
 
-function forEachDependent(e, n) {
-    for (let t = e.u; t !== null; t = t.Ae) n(t.ge, t);
-    // `?? null`: affects() marks route plain signals (no `_child` slot) through here.
-        for (let t = e.o?.i ?? null; t !== null; t = t.Ue) {
-        for (let e = t.u; e !== null; e = e.Ae) n(e.ge, e);
-    }
+function forEachDependent(e, t) {
+    for (let n = e.t; n !== null; n = n.o) t(n.l, n);
 }
 
 // Queue a node to re-run on the next flush (used both when a pending source
@@ -103,7 +95,7 @@ function forEachDependent(e, n) {
 // callbacks handle their own release (settleAutodispose in handleAsync); this
 // covers derivatively-pending dependents, which have no callbacks of their own.
 function releaseIfSettledUnobserved(e) {
-    e.he && e.C & CONFIG_AUTO_DISPOSE && !e.u && !(e.oe & REACTIVE_ZOMBIE) && !(e.h & STATUS_PENDING) && unobserved(e);
+    e.ee && e.i & CONFIG_AUTO_DISPOSE && !e.t && !(e.R & REACTIVE_ZOMBIE) && !(e.S & STATUS_PENDING) && unobserved(e);
 }
 
 // Error-path sweep: notifyStatus(STATUS_ERROR) clears dependents' pending
@@ -111,16 +103,16 @@ function releaseIfSettledUnobserved(e) {
 // the propagation completes, walk the same graph for stranded lazy nodes.
 // Collect-then-release so unobserved() never unlinks under the walk.
 function releaseSettledDependents(e) {
-    let n;
-    const t = new Set;
+    let t;
+    const n = new Set;
     const visit = e => {
-        if (t.has(e)) return;
-        t.add(e);
-        if (!e.u && e.C & CONFIG_AUTO_DISPOSE) (n ??= []).push(e);
+        if (n.has(e)) return;
+        n.add(e);
+        if (!e.t && e.i & CONFIG_AUTO_DISPOSE) (t ??= []).push(e);
         forEachDependent(e, visit);
     };
     forEachDependent(e, visit);
-    if (n) for (const e of n) releaseIfSettledUnobserved(e);
+    if (t) for (const e of t) releaseIfSettledUnobserved(e);
 }
 
 // Error-dimension twin of settlePendingSource's blocked re-enqueue (#2949):
@@ -138,79 +130,84 @@ function releaseSettledDependents(e) {
 // (releaseSettledDependents shape): identity holders can sit below an
 // intermediate whose own error state has since been scrubbed or replaced
 // (e.g. an error boundary's tree node).
-function settleErroredDependents(e, n) {
-    let t = false;
+function settleErroredDependents(e, t) {
+    let n = false;
     const r = new Set;
     const visit = e => {
         if (r.has(e)) return;
         r.add(e);
-        if (e.o?._ === n) {
+        if (e.m?.F === t) {
             enqueueSub(e);
-            t = true;
+            n = true;
         }
         forEachDependent(e, visit);
     };
     forEachDependent(e, visit);
-    if (t) schedule();
+    if (n) schedule();
 }
 
 // Retire `source` from pending state along the dependent graph rooted at `el`.
 // By default, `el` is the source whose flight settled or was superseded.
 // With a distinct `source`, `el` is a recovered computation that dropped it:
 // the source may still be pending, so dependents with another path to it stay pending.
-function settlePendingSource(e, n = e) {
+function settlePendingSource(e, t = e) {
     // Landing and branch recovery already cleared el's own set. Superseded
     // re-parks can retain an abandoned self entry (source === el), which must
     // retire in the same walk as its propagated copies.
-    removePendingSource(e, n);
-    let t = false;
+    removePendingSource(e, t);
+    let n = false;
     let r;
-    const i = new Set;
-    // Companion updates no-op without the verdict layer (null hook).
-        const o = GlobalQueue.Ge;
-    const settle = s => {
-        if (i.has(s)) return;
+    const o = new Set;
+    const settle = f => {
+        if (o.has(f) || 
         // A conditional dropped this source, but another dependency can still
         // carry it. Only retire pending state inherited through the recovered
         // branch. Deliberately NOT marked visited on this early return: the
         // carrying dependency may itself be a later branch of this same walk
         // (two unchanged memos converging), and its visit must be free to
         // re-examine this node once that branch has retired the source.
-                if (n !== e && retryReaches(s, n)) return;
-        if (!removePendingSource(s, n)) return;
-        i.add(s);
-        s.be = clock;
-        const u = s.o?.ue?.values().next().value;
+        t !== e && retryReaches(f, t) || !removePendingSource(f, t)) 
+        // A19: a verdict reader holds no pending of its own (it was re-derived
+        // when the source went pending, `propagateStatus`), and a landing
+        // equal to the committed value notifies nobody — the source settling
+        // is its verdict changing: it runs again.
+        return f.i & CONFIG_VERDICT && enqueueSub(f);
+        o.add(f);
+        f.Ie = clock;
+        const u = f.m?.Se?.values().next().value;
         // STATUS_ERROR + pending sources only coexist via an errored loading
         // window's park (notifyStatus(STATUS_ERROR) clears pending sources
         // otherwise): the settled error stays the answer through the settle —
         // nulling it here would have reads throw `null` until the re-enqueued
         // retry lands, or lose it entirely if that retry parks again (#2989).
-                const l = s.h & STATUS_ERROR;
+                const i = f.S & STATUS_ERROR;
         if (u) {
-            if (!l) setPendingError(s, u);
-            o?.(s);
+            if (!i) setPendingError(f, u);
         } else {
-            s.h &= ~STATUS_PENDING;
-            if (!l) setPendingError(s);
-            o?.(s);
-            if (s.o?.Pe) {
-                enqueueSub(s);
-                t = true;
+            f.S &= ~STATUS_PENDING;
+            if (!i) setPendingError(f);
+            // L2: a landing resumes the transaction waiting on it (maintainer: "it
+            // resumes the sync frame") — a held reader's re-pass over the landed
+            // value is that transaction's work, and the flush that carries it
+            // parks into it.
+                        if (f.i & CONFIG_HELD) joinFuture(txOf(f));
+            if (f.m?.de) {
+                enqueueSub(f);
+                n = true;
             }
-            if (s.o !== null) s.o.Pe = false;
+            if (f.m !== null) f.m.de = false;
             // Fully settled with nobody watching: release candidate (#2934). Checked
             // again at release time — deferred so unobserved() can't unlink subs
             // lists this walk is still iterating.
-                        if (!s.u && s.C & CONFIG_AUTO_DISPOSE) (r ??= []).push(s);
+                        if (!f.t && f.i & CONFIG_AUTO_DISPOSE) (r ??= []).push(f);
         }
-        forEachDependent(s, settle);
+        forEachDependent(f, settle);
     };
     forEachDependent(e, settle);
     // Release before the flush schedule below: unobserved() pulls the node back
     // out of the heap, so the enqueueSub above never recomputes a released node.
         if (r) for (const e of r) releaseIfSettledUnobserved(e);
-    if (t) schedule();
+    if (n) schedule();
 }
 
 // Object-thenable detection (Promises/A+ shape).
@@ -219,236 +216,121 @@ function isThenable(e) {
 }
 
 /** Fire and clear a node's iterator-flight cancellation hook (#3122). */ function releaseFlightTeardown(e) {
-    const n = e.o?.ye;
-    if (n != null) {
-        e.o.ye = null;
-        n();
+    const t = e.m?.Ne;
+    if (t != null) {
+        e.m.Ne = null;
+        t();
     }
 }
 
-function handleAsync(e, n, t) {
-    let r = false;
-    let i = false;
-    if (typeof n === "object" && n !== null) {
+function handleAsync(e, t, n, 
+// The flight rejected (after the node's status is set): a projection
+// tells its leaves' readers, who are not the node's dependents
+// (store/projection.ts). `pending`: a NotReady rejection — the node is
+// pending on another source, not errored.
+r) {
+    let o = false;
+    let f = false;
+    if (typeof t === "object" && t !== null) {
         untrack(() => {
-            r = n[Symbol.asyncIterator];
-            i = !r && isThenable(n);
+            o = t[Symbol.asyncIterator];
+            f = !o && isThenable(t);
         });
     }
-    if (!i && !r) {
-        if (e.o !== null) e.o.Ce = null;
+    if (!f && !o) {
+        if (e.m !== null) e.m.Te = null;
         // A sync landing is the first real answer for a loadingValue node.
-                e.ve = false;
-        return n;
+                e.De = false;
+        return t;
     }
     // Flight replacement relies on recompute's supersede release for iterator
     // teardown (#3122): every handleAsync call — including the projection
     // self-registration — runs during a recompute of `el`, which has already
     // fired _flightTeardown. A future non-recompute registration path must
     // release it here before overwriting _inFlight.
-        ext(e).Ce = n;
+        ext(e).Te = t;
+    // The question this flight answers (A18 provenance, lanes.ts): the action
+    // whose slice asked it; mainline is always the current question.
+        e.m._e = question || MAINLINE_QUESTION;
     // The run that asked this flight read every input without throwing: an
     // input still in flight was masked for it (an active override, A17), so
     // pending state those inputs propagated onto the node earlier does not
     // describe this answer. Drop it — the flight is the node's pending now.
     // The landing retires only the flight's own entry (landStatus, #3373), so
     // an entry that survived here would hold the node past its own answer.
-        e.o.ue = undefined;
-    // Provenance of the question this flight asks (#3331): the action whose
-    // window is registering it, or the flight whose landing is. Its landings
-    // propagate under it (asyncWrite) so an override downstream can tell a
-    // stale answer from its own.
-        const o = origin;
-    let s;
-    // Settle-time transition re-entry. The loading rail is invisible to
-    // transactions (#2933): a boundary-caught first load never registers as an
-    // async reporter, so its settle — the boundary's fallback -> content
-    // reveal — must flow ambiently. The node can still carry a `_transition`
-    // stamp (pending-node bookkeeping rides through the stamping sites), and
-    // blindly re-entering that stamped, still-incomplete transaction stashed
-    // the reveal with it — a deadlock when the transaction's completion
-    // depended on the reveal (#2937). An ESCAPED first load did register and
-    // keeps transition scheduling; initialized (value-holding) pending settles
-    // are the transaction's reveal machinery and always re-enter.
-        const settleTransition = () => {
-        let n = resolveTransition(e);
-        // A lane-routed node's landing is revealed by its lane, ahead of the
-        // transaction that owns the lane (whose own commit is only the override's
-        // confirm/revert). Entering that owner here would fold every transaction
-        // waiting on this flight into it at the landing — a reveal that
-        // discovered the flight (#3305) would then wait on the owner's action
-        // instead of on the flight (#3334). Enter the waiter: the transaction
-        // whose blocker this landing clears. Then every transaction waiting on
-        // the flight folds in (enterWaiting): a reveal that discovered it
-        // completes at its landing (A15) — a stampless node's fresh batch
-        // included (its flight started under a batch that committed beneath it,
-        // #3305). The fold used to happen as each stamped reader recomputed,
-        // which effects no longer do (#3407).
-                if (e.o?.me) n = waitingTransition(e) ?? n;
-        if (n && e.h & STATUS_UNINITIALIZED && !currentTransition(n).le.has(e)) {
-            // Drop the stale stamp too: the plain settle write (setSignal) and the
-            // stash-path restamp both re-enter the transaction through it.
-            e.we = null;
-            return;
-        }
-        globalQueue.initTransition(n);
-        enterWaiting(e);
-    };
-    const handleError = t => {
-        if (e.o?.Ce !== n) return;
+        e.m.Se = undefined;
+    let u;
+    const handleError = n => {
+        if (e.m?.Te !== t) return;
         // NotReadyError from rejected promises should be treated as pending, not error
-                let r = t instanceof NotReadyError;
-        if (r && e.ve) {
+                let o = n instanceof NotReadyError;
+        if (o && e.De) {
             // Loading window: the flight died waiting on an unready source. Keep
             // serving commit #0 — same parking as recompute's catch for sync
             // dependency throws. The dead flight is released so the clock-gated
             // error-retry pull (updateIfNecessary) can also re-ask.
-            if (e.o !== null) e.o.Ce = null;
-            parkLoadingWindow(e, t);
-            e.be = clock;
+            if (e.m !== null) e.m.Te = null;
+            parkLoadingWindow(e, n);
+            e.Ie = clock;
             return;
         }
-        settleTransition();
-        notifyStatus(e, r ? STATUS_PENDING : STATUS_ERROR, t);
+        notifyStatus(e, o ? STATUS_PENDING : STATUS_ERROR, n);
         // A NotReady rejection is a landing into another pending source. The
         // rejected flight will never settle its self entry, so transfer ownership
         // after notifyStatus has propagated the replacement source.
-                if (r) settlePendingSource(e);
-        e.be = clock;
+                if (o) settlePendingSource(e);
+        e.Ie = clock;
         // A real error settles derivatively-pending dependents (notifyStatus
         // cleared their pending sources), so stranded lazy ones release here —
         // the error twin of settlePendingSource's release (#2934).
-                if (!r) releaseSettledDependents(e);
+                if (!o) releaseSettledDependents(e);
+        r?.(n, o);
     };
-    const asyncWrite = (r, i) => {
-        if (e.o?.Ce !== n) return;
+    const asyncWrite = (r, o) => {
+        if (e.m?.Te !== t) return;
         // If the node was dirtied by a newer write (optimistic override or regular),
         // skip this stale async result — the upcoming flush will recompute the node
         // with the new value, creating a fresh Promise that supersedes this one.
-                if (e.oe & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
-        // The landing propagates under the flight's provenance (#3331) — through
-        // the flush below, which clears it.
-                setOrigin(o);
-        settleTransition();
-        const s = !!(e.h & STATUS_UNINITIALIZED);
-        // Captured before clearStatus wipes it: a quiet re-ask's landing may be
-        // transition-held below, and the displayed value keeps answering the same
-        // question until the hold commits — the classification must survive to
-        // that reveal or companion synchronization briefly classifies the held
-        // old value as pending, a one-frame pulse to direct observers (#3178).
-        // A truthy capture implies `_x` exists, so the restore writes it directly.
-                const u = e.o?.Le;
+                if (e.R & REACTIVE_DIRTY) return;
+        const f = !!(e.S & STATUS_UNINITIALIZED);
         landStatus(e);
-        if (u) e.o.Le = true;
-        const l = resolveLane(e);
-        if (l) l.Qe.delete(e);
-        if (t) {
+        if (n) {
             try {
-                t(r);
+                n(r);
             } catch (e) {
                 handleError(e);
                 return;
             }
-            if (s) landStatus(e, true);
-        } else if (e.o?.Fe !== undefined && !(l && e.C & CONFIG_DERIVED_OVERRIDE)) {
-            // A derived override's landing UNDER its lane is the lane's own work
-            // (the branch below); demoted — its source superseded (A18) — the
-            // landing is the truth the correction asked for, and holds and
-            // supersedes here like the sync twin (recompute). Otherwise:
-            // Optimistic node — resting OR covered by an active override — holds
-            // through the shared pending-node path, exactly like a plain async memo,
-            // so the commit clears STATUS_UNINITIALIZED (#2806) and elevation to
-            // _value happens on this value's OWN transition schedule (A18 as
-            // re-ruled 2026-07-07: _value only changes at commit points). With an
-            // override active the hold and its eventual commit are unobservable
-            // (A17 — every reader sees the override); the revert reveals whatever
-            // has committed by then, so corrections reveal atomically with their
-            // transition rather than escaping it.
-            if (e._e === NOT_PENDING) queuePendingNode(e);
-            e._e = r;
-            // The hold is a companion-visible write like any other (A13/A19): the
-            // clearStatus() above computed its verdict before the hold existed, so
-            // isPending must re-derive (the value is not final until commit — V1)
-            // and latest() must see the fresh in-flight value (V2). Subscribers are
-            // only notified when the hold is visible to them: under an active
-            // override every reader sees the override (A17), so waking subs would
-            // re-show an unchanged view — the revert is the notification point.
-            // Under an override the landing is handed to the engine's
-            // supersedeOverride (A18 supersession, #3331): own-source truth that
-            // differs from the override ends the optimism for the graph now (plain
-            // channel, lane demoted); a matching arrival is silent except to an
-            // authoritative-view reader (until()'s predicate) waiting on exactly
-            // this staged truth (#3164 — without the wake the hold deadlocks: the
-            // landing waits on the transaction, the transaction on the action, the
-            // action on an until() never re-notified). The hook is installed with
-            // the engine, which an active override implies. The propagation runs
-            // under this flight's provenance (setOrigin above).
-                        GlobalQueue.Ve?.(e, r);
-            if (!hasActiveOverride(e)) {
-                insertSubs(e);
-            } else GlobalQueue.ke(e, r);
-            e.be = clock;
-        } else if (l) {
-            // Route through lane's effect queue for independent flushing
-            const n = e.je;
-            const t = hasActiveOverride(e) ? unwrapOverride(e.o.Fe) : e.ce;
-            const i = e.xe;
-            try {
-                // `(prev, next)`, as every other commit path calls the comparator — a
-                // user comparator keyed on which side is incoming (dynamic's binding
-                // gate) reads the lane landing the same way it reads a sync commit.
-                if (!n && s || !i || !i(t, r)) {
-                    // Lanes stage (#3479): a memo's landing under its lane is a derived
-                    // override, as its sync pass's result is (recompute) — `_value`
-                    // stays the committed truth for readers off the lane.
-                    if (n) e.ce = r; else GlobalQueue.Me(e, r, l);
-                    e.be = clock;
-                    // The latest() shadow write gives latest() effects independent lanes; the
-                    // _pendingSignal update is a no-op repeat of the clearStatus() call above
-                    // (computePendingState doesn't read _value).
-                                        GlobalQueue.Ve?.(e, r);
-                    insertSubs(e, true);
-                }
-            } catch (n) {
-                // A user comparator throwing during async resolution has no caller to
-                // surface to (we're in promise machinery) — route it through the node's
-                // error status so boundaries contain it instead of an unhandled
-                // rejection (#2837).
-                notifyStatus(e, STATUS_ERROR, n);
-            }
+            if (f) landStatus(e, true);
         } else {
+            // CARVE 2: the override-covered landing (hold + A18 supersession) and the
+            // lane-routed landing (derived override, lane effect queue) went with
+            // the optimistic engine; every landing is the plain setSignal. A node
+            // already held stages its answer into that hold (`setSignal`).
             try {
                 setSignal(e, () => r);
-            } catch (n) {
+            } catch (t) {
                 // Same containment as above: setSignal's comparator throw is the only
                 // pre-commit failure here, and there is no user callsite to throw to.
-                notifyStatus(e, STATUS_ERROR, n);
+                notifyStatus(e, STATUS_ERROR, t);
             }
         }
         // First real answer landing: the window closes when the answer becomes
-        // OBSERVABLE. A direct commit is observable now; a transition-held write
-        // (`_pendingValue` set above or inside setSignal) is not — the verdict's
-        // held-value branch is window-gated, and commitPendingNode closes the
-        // window when the hold commits, so no one-frame isPending pulse can leak
-        // to live observers between the landing and its commit (#2990). The
-        // quiet re-ask classification follows the same schedule (#3178).
-                if (e._e === NOT_PENDING) {
-            e.ve = false;
-            if (u) e.o.Le = false;
+        // OBSERVABLE. A direct commit is observable now; a staged write
+        // (`_pendingValue` set inside setSignal) is not — commitPendingNode closes
+        // the window when the flush commits it, so no one-frame pulse can leak to
+        // observers between the landing and its commit (#2990).
+                if (e.Oe === NOT_PENDING) {
+            e.De = false;
             // The landing published: the dependency tail the flight's pass left
-            // linked goes now (A30, #3410). A transition-held landing has not
-            // replaced the committed frame — the committed value still derives
-            // from the previous pass's inputs, and a mainline write to one of them
-            // must reach this node and join its hold (its stamp) instead of
-            // publishing beside the stale derivation (#3461: `b() ? b() : a()`
-            // held on `b` dropped `a` at its landing, and `A: 1` then committed
-            // beside `Selected: 0`). `commitPendingNode` trims a held landing.
+            // linked goes now (A30, #3410). A staged landing has not replaced the
+            // committed frame yet; `commitPendingNode` trims it.
                         trimStaleDeps(e);
         }
         settlePendingSource(e);
         schedule();
         flush();
-        i?.();
+        o?.();
     };
     // A pending node's in-flight promise is an observer: `unlinkSubs` skips
     // autodispose while STATUS_PENDING so subscriber churn can't orphan the
@@ -458,7 +340,7 @@ function handleAsync(e, n, t) {
     // Returns whether the node released, so the iterator branch can stop
     // pulling values instead of pumping an unobserved stream forever (#2935).
         const settleAutodispose = () => {
-        if (e.C & CONFIG_AUTO_DISPOSE && !e.u && !(e.h & STATUS_PENDING)) {
+        if (e.i & CONFIG_AUTO_DISPOSE && !e.t && !(e.S & STATUS_PENDING)) {
             unobserved(e);
             return true;
         }
@@ -475,25 +357,24 @@ function handleAsync(e, n, t) {
     // the thenable branch pre-registered while it still owned the context.
     // Returns whether a sync answer landed (first yield or empty completion) —
     // meaningful only in the live posture.
-        const consumeIterator = (t, r) => {
-        const i = t[Symbol.asyncIterator]();
-        let o = false;
-        let u = false;
-        let l = !r;
+        const consumeIterator = (n, r) => {
+        const o = n[Symbol.asyncIterator]();
+        let f = false;
+        let i = false;
+        let s = !r;
         const close = () => {
-            if (u) return;
-            u = true;
+            if (i) return;
+            i = true;
             try {
-                const e = i.return?.();
+                const e = o.return?.();
                 if (isThenable(e)) e.then(undefined, () => {});
             } catch {}
         };
         r ? r(close) : cleanup(close);
         // Flight-identity cancellation (#3122): the registration above is the
-        // owner-death backstop, but its disposal list can be zombie-deferred
-        // until the SUPERSEDING flight settles. The teardown slot fires at the
-        // _inFlight release sites so supersede stops this stream immediately.
-                ext(e).ye = close;
+        // owner-death backstop; the teardown slot fires at the _inFlight release
+        // sites so supersede stops this stream immediately.
+                ext(e).Ne = close;
         // Release check before each next pull: an unobserved lazy node must tear
         // down (its close above runs via disposal, closing the iterator) instead
         // of pumping the stream forever with zero subscribers (#2935).
@@ -501,17 +382,17 @@ function handleAsync(e, n, t) {
             if (!settleAutodispose()) iterate();
         };
         const iterate = () => {
-            let t, r, f = false, a = false, c = true;
+            let n, r, l = false, a = false, c = true;
             // Protocol tolerance, matching `for await`: `await` unwraps whatever
             // next() returns — a thenable OR a bare IteratorResult. Real producers
             // use the bare form as a promise-free fast path when a value is already
             // buffered (seroval's deserialized streams do), so a bare result is
             // assimilated as an already-settled step instead of crashing on `.then`.
-                        const S = i.next();
-            const d = isThenable(S) ? S : {
+                        const S = o.next();
+            const E = isThenable(S) ? S : {
                 then: e => void e(S)
             };
-            d.then(r => {
+            E.then(r => {
                 // The sync stash only serves the INITIAL drain (handleAsync's caller
                 // consumes syncValue / throws NotReady from it). A sync-settled step
                 // after an async gap — seroval buffering values between pulls, a
@@ -519,18 +400,18 @@ function handleAsync(e, n, t) {
                 // stash: it must write through the async path or the value is
                 // silently dropped. (The deferred posture never has a caller, so
                 // initialRead starts false there and everything writes through.)
-                if (c && l) {
-                    t = r;
-                    f = true;
-                    if (r.done) u = true;
-                } else if (e.o?.Ce !== n) {
+                if (c && s) {
+                    n = r;
+                    l = true;
+                    if (r.done) i = true;
+                } else if (e.m?.Te !== t) {
                     return;
                 } else if (!r.done) {
-                    o = true;
+                    f = true;
                     asyncWrite(r.value, iterateOrRelease);
                 } else {
-                    u = true;
-                    if (o) {
+                    i = true;
+                    if (f) {
                         schedule();
                         flush();
                     } else {
@@ -539,142 +420,128 @@ function handleAsync(e, n, t) {
                     }
                     settleAutodispose();
                 }
-            }, t => {
-                if (c && l) {
-                    r = t;
+            }, n => {
+                if (c && s) {
+                    r = n;
                     a = true;
-                } else if (e.o?.Ce === n) {
-                    u = true;
-                    handleError(t);
+                } else if (e.m?.Te === t) {
+                    i = true;
+                    handleError(n);
                     settleAutodispose();
                 }
             });
             c = false;
             if (a) {
                 // Match the promise branch, but only rethrow during the initial read.
-                u = true;
+                i = true;
                 handleError(r);
-                if (l) throw r;
+                if (s) throw r;
                 return true;
             }
-            if (f && !t.done) {
-                s = t.value;
-                o = true;
+            if (l && !n.done) {
+                u = n.value;
+                f = true;
                 return iterate();
             }
-            return f && t.done;
+            return l && n.done;
         };
-        const f = iterate();
+        const l = iterate();
         // Later iterate() calls run from asyncWrite, where rethrowing would be unhandled.
-                l = false;
-        return o || f;
+                s = false;
+        return f || l;
     };
     // Landed-synchronously verdict for a LIVE iterator drain; null when no live
     // drain ran (plain promise flight, or a deferred flatten). Drives the
     // shared NotReady/loading tail below.
-        let u = null;
+        let i = null;
     // Flatten one async level: a thenable that RESOLVES to an AsyncIterable —
     // the shape every async stub returning a stream produces — consumes as the
     // stream itself rather than settling on the iterable object. One level
     // only: A+ `then` already collapses nested thenables, so the resolved
     // value is never itself a thenable.
-        const flattenIfIterable = (e, n) => {
-        let t = false;
+        const flattenIfIterable = (e, t) => {
+        let n = false;
         if (typeof e === "object" && e !== null) {
             untrack(() => {
-                t = e[Symbol.asyncIterator];
+                n = e[Symbol.asyncIterator];
             });
         }
-        if (!t) return false;
-        const r = consumeIterator(e, n);
-        if (!n) u = r;
+        if (!n) return false;
+        const r = consumeIterator(e, t);
+        if (!t) i = r;
         return true;
     };
-    if (i) {
-        let t = false, r = false, i, o = true;
+    if (f) {
+        let n = false, r = false, o, f = true;
         // Close registration for the flattening path. Consumption starts in a
         // microtask where the ambient owner is gone (or worse, someone else's),
         // so `cleanup()` can't be used — the close targets el's disposal list
         // directly, exactly where a live cleanup() during this recompute would
-        // have put it. Deliberately NOT pre-registered at flight start: a
-        // non-null `_disposal` reclassifies the node into recompute's deferred
-        // (zombie) disposal path, and plain promise flights — the overwhelming
-        // majority — must not pay that. Only a flight that actually flattens
-        // becomes disposal-bearing, which is exactly the class a directly
-        // returned iterable already occupies.
-                const registerDeferredClose = n => {
-            if (!e.qe) e.qe = n; else if (Array.isArray(e.qe)) e.qe.push(n); else e.qe = [ e.qe, n ];
+        // have put it. Only a flight that actually flattens becomes
+        // disposal-bearing.
+                const registerDeferredClose = t => {
+            if (!e.Re) e.Re = t; else if (Array.isArray(e.Re)) e.Re.push(t); else e.Re = [ e.Re, t ];
         };
-        n.then(r => {
-            if (o) {
-                s = r;
-                t = true;
-            } else if (e.o?.Ce === n && !(e.oe & REACTIVE_DISPOSED) && flattenIfIterable(r, registerDeferredClose)) ; else {
+        t.then(r => {
+            if (f) {
+                u = r;
+                n = true;
+            } else if (e.m?.Te === t && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, registerDeferredClose)) ; else {
                 asyncWrite(r);
                 settleAutodispose();
             }
         }, e => {
-            if (o) {
-                i = e;
+            if (f) {
+                o = e;
                 r = true;
             } else {
                 handleError(e);
                 settleAutodispose();
             }
         });
-        o = false;
+        f = false;
         if (r) {
             // Settle through the same status path an async rejection uses, then
             // unwind the in-progress synchronous read so the errored node isn't
             // momentarily read as `undefined`.
-            handleError(i);
-            throw i;
-        } else if (!t) {
-            // Loading window: serve commit #0 instead of suspending. No transition
-            // is opened — first-flight work on a loadingValue node is loading-class
-            // (invisible to boundaries and transitions); the flight itself is
-            // already registered in _inFlight and lands through asyncWrite.
-            if (e.ve) return e.ce;
-            globalQueue.initTransition(resolveTransition(e));
+            handleError(o);
+            throw o;
+        } else if (!n) {
+            // Loading window: serve commit #0 instead of suspending — first-flight
+            // work on a loadingValue node is loading-class (invisible to
+            // boundaries); the flight itself is already registered in _inFlight and
+            // lands through asyncWrite.
+            if (e.De) return e.Ae;
             throw new NotReadyError(context);
-        } else if (!flattenIfIterable(s)) {
+        } else if (!flattenIfIterable(u)) {
             // Synchronously-resolved promise: the first real answer landed.
-            e.ve = false;
+            e.De = false;
         }
         // A sync-resolved promise holding an AsyncIterable flattened LIVE (we
         // are still inside the synchronous read): full initial-drain semantics
         // apply and the shared tail below settles the verdict.
         }
-    if (r) flattenIfIterable(n);
-    if (u !== null) {
-        if (!u) {
+    if (o) flattenIfIterable(t);
+    if (i !== null) {
+        if (!i) {
             // Loading window: serve commit #0 (see the promise branch above).
-            if (e.ve) return e.ce;
-            globalQueue.initTransition(resolveTransition(e));
+            if (e.De) return e.Ae;
             throw new NotReadyError(context);
         }
         // A sync first yield (or immediate empty completion) is the first real
         // answer; async yields clear inside asyncWrite.
-                e.ve = false;
+                e.De = false;
     }
-    return s;
+    return u;
 }
 
-function clearStatus(e, n = false) {
-    if (e.o?.ue) clearPendingSources(e);
-    if (e.o?.Pe) if (e.o !== null) e.o.Pe = false;
-    // The pending window is over; its quiet classification dies with it.
-    // (Unconditional: _reask is baked into the node literals, so this is a
-    // plain store to an existing slot — no shape change.)
-        if (e.o !== null) e.o.Le = false;
-    e.h = n ? 0 : e.h & STATUS_UNINITIALIZED;
-    if (e.o?._) setPendingError(e);
-    // Update pending signal for isPending() reactivity (companions only exist
-    // once the verdict layer created them, which installs the hooks).
-        if (e.o?.Ze || e.o?.He) GlobalQueue.Ge(e);
-    if (e.o?.i && e.C & CONFIG_CHILD_COMPANIONS && GlobalQueue.We !== null) GlobalQueue.We(e);
-    const t = statusNotifierOf(e);
-    if (t) t.call(e);
+function clearStatus(e, t = false) {
+    if (e.m?.Se) clearPendingSources(e);
+    if (e.m?.de) if (e.m !== null) e.m.de = false;
+    e.S = t ? 0 : e.S & STATUS_UNINITIALIZED;
+    if (e.m?.F) setPendingError(e);
+    const n = statusNotifierOf(e);
+    if (n) n.call(e);
 }
 
 /**
@@ -685,9 +552,8 @@ function clearStatus(e, n = false) {
  * is in the air, #3373) marks `b` pending on `a` by propagation, with `b`'s
  * flight still current: nothing superseded it (the re-ask only changed `a`'s
  * status, not yet its value), so the landing arrives, and a full clear made
- * `b` answer with the stale value — the transaction's reporter for `a` found
- * nothing pending below it and committed the newer signal beside the older
- * derived value (`2 / 1`); `isPending(b)` read false for the gap (#3376).
+ * `b` answer with the stale value — the newer signal committed beside the
+ * older derived value (`2 / 1`) for the gap (#3376).
  * With another source still pending the node stays derivatively pending on
  * it; the landed value is written below (the staged answer is still the
  * answer for the inputs it was asked with) and the input's own settle
@@ -702,121 +568,117 @@ function clearStatus(e, n = false) {
  * the first landing retires UNINITIALIZED. `_error` must move off self: a
  * reader thrown NotReady(self) would park on a retired entry. Companions
  * keep their verdict (pending before and after; the write re-syncs them).
- */ function landStatus(e, n = false) {
-    const t = e.o?.ue;
+ */ function landStatus(e, t = false) {
+    const n = e.m?.Se;
     // (The full clear below drops the set whether or not self was retired first.)
-        if (t && (t.delete(e), t.size)) {
-        e.o.Pe = false;
-        if (n) e.h = STATUS_PENDING;
-        setPendingError(e, t.values().next().value);
-    } else clearStatus(e, n);
+        if (n && (n.delete(e), n.size)) {
+        e.m.de = false;
+        if (t) e.S = STATUS_PENDING;
+        setPendingError(e, n.values().next().value);
+    } else clearStatus(e, t);
 }
 
-function notifyStatus(e, n, t, r, i) {
+function notifyStatus(e, t, n, r) {
     // Wrap regular errors to track source node
-    if (n === STATUS_ERROR && !(t instanceof StatusError) && !(t instanceof NotReadyError)) t = new StatusError(e, t);
-    const o = n === STATUS_PENDING && t instanceof NotReadyError ? t.source : undefined;
-    const s = o === e;
-    // An optimistic node (a WRITTEN override slot) pending derivatively is a
-    // boundary: its override is the answer, pending stops here (A17). A
-    // derived override (#3479) is a previous speculative answer on a plain
-    // member — pending flows through it as through any memo.
-        const u = n === STATUS_PENDING && e.o?.Fe !== undefined && !(e.C & CONFIG_DERIVED_OVERRIDE) && !s;
-    const l = u && hasActiveOverride(e);
-    if (!r) {
-        // Lane before companions: the companion pokes below may create the
-        // node's pending-signal lane, whose parent is read from the node's lane
-        // at creation. Assigned after them (as it was), a node made pending by
-        // propagation before it rode the lane got a parentless companion lane,
-        // and the isPending reader that also depends on the node merged it into
-        // the held lane — the verdict then waited on the async it reports (#3379).
-        if (i) assignOrMergeLane(e, i);
-        if (n === STATUS_PENDING && o) {
+    if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError)) n = new StatusError(e, n);
+    const o = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
+    // (CARVE 2: the lane assignment went with the engine.)
+        {
+        if (t === STATUS_PENDING && o) {
             addPendingSource(e, o);
-            // A fresh flight from a settled state starts with its inputs unpublished
-            // (a replacement flight while still pending keeps the mark: the first
-            // flight's committed inputs are still the frame).
-                        if (!(e.h & STATUS_PENDING)) e.C &= ~CONFIG_INPUTS_PUBLISHED;
-            e.h = STATUS_PENDING | e.h & STATUS_UNINITIALIZED;
-            // Preserve the current source on this propagation so render-effect notification
-            // can register every distinct pending source with the transition.
-                        setPendingError(e, o, t);
+            e.S = STATUS_PENDING | e.S & STATUS_UNINITIALIZED;
+            // Preserve the current source on this propagation so readers park on
+            // the distinct pending source.
+                        setPendingError(e, o, n);
         } else {
             clearPendingSources(e);
-            e.h = n | (n !== STATUS_ERROR ? e.h & STATUS_UNINITIALIZED : 0);
-            ext(e)._ = t;
+            e.S = t | (t !== STATUS_ERROR ? e.S & STATUS_UNINITIALIZED : 0);
+            ext(e).F = n;
         }
-        GlobalQueue.Ge?.(e);
-        if (e.o?.i && e.C & CONFIG_CHILD_COMPANIONS && GlobalQueue.We !== null) GlobalQueue.We(e);
     }
-    const f = r || l;
-    const a = r || u ? undefined : i;
-    const c = statusNotifierOf(e);
-    if (c) {
-        if (r && n === STATUS_PENDING) {
-            return;
-        }
-        if (f) {
-            c.call(e, n, t);
-        } else {
-            c.call(e);
+    // Lanes: a written guess is an optimistic boundary (A17 — "the optimistic
+    // future value until we know otherwise"). Its own source in flight is its
+    // status, not its readers': they read the guess. The flight is the parent
+    // transition's to wait on — the frame it was asked in holds (A17: "a
+    // transition whose optimistic node is still pending on its own fetch is
+    // not complete"), through the node itself (`blocked`).
+        if (t === STATUS_PENDING && e.i & CONFIG_GUESS) {
+        if (passLane === null) joinFuture(null);
+        return;
+    }
+    const f = statusNotifierOf(e);
+    if (f) {
+        {
+            f.call(e);
         }
         return;
     }
-    forEachDependent(e, (e, r) => {
-        e.be = clock;
+    propagateStatus(e, t, n);
+}
+
+/** The dependents' half of `notifyStatus`: `el`'s status reaches each
+ * subscriber as a propagated mark (or a re-derive). On its own for a store
+ * family's leaves, which are not the derive's dependents — the family
+ * propagates the derive's status from each leaf to the leaf's readers
+ * (store/projection.ts `wakeFamily`), exactly as a memo's would reach its. */ function propagateStatus(e, t, n, r) {
+    const o = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
+    forEachDependent(e, (r, f) => {
+        r.Ie = clock;
         // A pending mark on a kept-tail link re-derives the subscriber instead of
         // marking it (A30, #3494 review; fuzzer latest-1 #2141; #3519 review).
         // Past `_depsTail` lie the committed frame's deps, kept by A30 because
         // that frame still derives from them while the pass that dropped them is
-        // held (staged, or unchanged and parked). A source going pending there is
-        // a question for the node's NEXT pass, not a fact about its current one:
-        // marked, the node was registered as the flight's reporter and its holder
-        // entangled with the flight (the A15 arm below) on a dep the held frame
-        // never reads — an orphaned fetch held the truth (a hide joined to a
-        // parked action, A34), and a manual flight nobody awaited held a gated
-        // reader hidden forever (fuzzer branches-1 #1105). Skipped, the committed
-        // frame published stale beside its new inputs (`query=1` beside a
-        // `selected` derived from `remote(0)`). Re-derived, the pass decides: it
-        // reads the dep and registers through its own read, or reads a held input
-        // and enters that transaction (A29), or reads neither and is done. Clears
-        // and errors still ride every link. A link inside the prefix carries the
+        // staged. A source going pending there is a question for the node's NEXT
+        // pass, not a fact about its current one. Re-derived, the pass decides:
+        // it reads the dep and registers through its own read, or reads neither
+        // and is done. Clears and errors still ride every link. A link inside the prefix carries the
         // pass's generation (`link()`), so the test is O(1); mid-pass the prefix
         // is what the pass has read so far, and the heap refuses a recomputing
         // node — a dep it has yet to reach registers through its own read.
-                if (n === STATUS_PENDING && r.Be !== e.Ye) {
-            enqueueSub(e);
+        // A verdict reader likewise (CONFIG_VERDICT), for either status: the
+        // dependency going pending or erroring changed what `isPending`/`latest`
+        // answer, so its pass runs again — it decides, breaking out as the
+        // verdict lane's, going pending through a plain read of its own, or
+        // answering an errored source (`isPending` false; `latest` throws it).
+        // Inheriting the error would make a probe's reader errored. A boundary's
+        // output (CONFIG_REDERIVE, boundaries.ts) the same: content or fallback
+        // is its pass's call.
+                if (r.i & (CONFIG_REDERIVE | CONFIG_VERDICT) || t === STATUS_PENDING && f.Pe !== r.pe) {
+            enqueueSub(r);
             schedule();
             return;
         }
-        if (n === STATUS_PENDING && o && !e.o?.ue?.has(o) || n !== STATUS_PENDING && (e.o?._ !== t || e.o?.ue)) {
-            // A pending-observer link is the subscription an `isPending` read created.
-            // It exists so the observer re-runs when the source settles, but it must
-            // not carry a real (non-NotReadyError) error — the synchronous `isPending`
-            // read swallows those, and the async path must match. Re-run the observer
-            // so `isPending` re-evaluates (to not-pending) instead of forwarding.
-            if (r.ze && n !== STATUS_PENDING && !(t instanceof NotReadyError)) {
-                enqueueSub(e);
-                schedule();
-                return;
+        // Already pending on this source (a re-ask of its flight): the status is
+        // unchanged and nothing re-notifies. The re-asking write is held with the
+        // flight the observer waits on (fuzzer #3446 P1): the propagation joins
+        // the observer's transaction. An independent render effect in the same
+        // frame still passes through — its pass is the frame's (#3372, compiled
+        // shape: the unmount it stages makes the observer a zombie whose say is
+        // moot for this transaction, A15 #3463).
+                if (t === STATUS_PENDING && o && r.m?.Se?.has(o)) {
+            if (passLane === null && (r.i & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.X) joinFuture(txOf(r));
+            return;
+        }
+        if (t === STATUS_PENDING && o || t !== STATUS_PENDING && (r.m?.F !== n || r.m?.Se)) {
+            // The marked subscriber is queued for the commit sweep so its status
+            // bookkeeping (loading window, uninitialized clear) runs with the flush
+            // — with the lane, when the pass propagating is the lane's work and
+            // the dependent's pending is the lane's own flight (`laneStage`).
+            {
+                // (No answer: a pending propagation leaves a written guess a guess.)
+                if (passLane !== null) GlobalQueue.W(r, passLane, true, e); else {
+                    queuePendingNode(r);
+                    // A15 (#3443): pending propagates onto a held memo without
+                    // recomputing it, and the propagation itself enters the memo's
+                    // transaction — the flight flows into a memo that transaction
+                    // holds, so the write that started it is held with it. A render
+                    // effect's membership is its pass's (`notify`), never sticky.
+                                        if (t === STATUS_PENDING && (r.i & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !r.u) joinFuture(txOf(r));
+                }
             }
-            // A memo another live transaction HOLDS — pending on its work, or
-            // staged by it — made pending by THIS flight cannot reveal before the
-            // flight lands: the two settle as one unit (A15, a shared derivation of
-            // both — #3443). Propagation marks the held memo without recomputing it
-            // (its inputs' values are unchanged), so this is the one moment the
-            // entanglement is known; the memo's stamped re-entry at its next pass
-            // came too late — the holder's own flight landed first and revealed the
-            // inputs beside the stale sum. The stamp alone decides nothing (#3334):
-            // a node the transaction once queued but holds nothing of — a switch's
-            // shared output whose first flight the second write superseded — must
-            // not drag the older flight into the newer reveal. Effects entangle
-            // nothing (A15 shared-hole corollary): their reader registers with the
-            // flight's transaction at queue notification.
-                        if (!f) e.we ? o && !e.je && (e.h & STATUS_PENDING || e._e !== NOT_PENDING) && globalQueue.initTransition(e.we) : queuePendingNode(e);
-            notifyStatus(e, n, t, f, a);
+            notifyStatus(r, t, n);
         }
     });
 }
 
-export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, parkLoadingWindow, releaseFlightTeardown, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource };
+export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource };