@solidjs/signals 2.0.0-rc.7 → 2.0.0-rc.9

package/dist/prod/core/async.js

@@ -1,6 +1,6 @@
-import { STATUS_UNINITIALIZED, CONFIG_CHILD_COMPANIONS, STATUS_ERROR, STATUS_PENDING, REACTIVE_DIRTY, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, CONFIG_AUTHORITATIVE_OBSERVED, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, REACTIVE_DISPOSED } from "./constants.js";
+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 { untrack, ext, statusNotifierOf, setSignal, context } from "./core.js";
+import { untrack, ext, statusNotifierOf, hasActiveOverride, setSignal, context } from "./core.js";
 
 import "./invariants.js";
 
@@ -10,11 +10,11 @@ import { trimStaleDeps, unobserved } from "./graph.js";
 
 import { enqueueSub } from "./heap.js";
 
-import { hasActiveOverride, assignOrMergeLane, resolveLane, resolveTransition } from "./lanes.js";
+import { assignOrMergeLane, resolveLane, resolveTransition } from "./lanes.js";
 
 import { cleanup } from "./owner.js";
 
-import { GlobalQueue, schedule, flush, queuePendingNode, insertSubs, clock, currentTransition, globalQueue } from "./scheduler.js";
+import { GlobalQueue, schedule, flush, queuePendingNode, insertSubs, clock, waitingTransition, currentTransition, globalQueue, enterWaiting, setOrigin, origin } 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 —
@@ -22,22 +22,35 @@ import { GlobalQueue, schedule, flush, queuePendingNode, insertSubs, clock, curr
 // 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?.le?.has(n)) return false;
-    (ext(e).le ??= new Set).add(n);
+    if (e.o?.ae?.has(n)) return false;
+    (ext(e).ae ??= new Set).add(n);
     return true;
 }
 
 function removePendingSource(e, n) {
-    const t = e.o?.le;
+    const t = e.o?.ae;
     if (!t?.delete(n)) return false;
-    if (!t.size) e.o.le = undefined;
+    if (!t.size) e.o.ae = 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.le = undefined;
+    if (e.o !== null) e.o.ae = undefined;
+}
+
+// A rejection-pending only resolves through the settle sweep over the
+// SOURCE's subscribers, so it is retryable iff a tracked read created that
+// 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.Se; t; t = t.de) {
+        const e = t.Ee.Te || t.Ee;
+        if (e === n || e.o?.ae?.has(n)) return true;
+    }
+    return false;
 }
 
 /**
@@ -47,7 +60,7 @@ function clearPendingSources(e) {
  * with NO read-visible pending status, no downstream propagation, no
  * transition, no lane registration. Commit #0 keeps serving.
  */ function parkLoadingWindow(e, n) {
-    ext(e).fe = true;
+    ext(e).Ie = true;
     if (n.source) addPendingSource(e, n.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
@@ -72,10 +85,10 @@ function setPendingError(e, n, t) {
 }
 
 function forEachDependent(e, n) {
-    for (let t = e.u; t !== null; t = t.ae) n(t.ce, t);
+    for (let t = e.u; t !== null; t = t.Ne) n(t._e, t);
     // `?? null`: affects() marks route plain signals (no `_child` slot) through here.
-        for (let t = e.o?.i ?? null; t !== null; t = t.Se) {
-        for (let e = t.u; e !== null; e = e.ae) n(e.ce, e);
+        for (let t = e.o?.i ?? null; t !== null; t = t.De) {
+        for (let e = t.u; e !== null; e = e.Ne) n(e._e, e);
     }
 }
 
@@ -90,7 +103,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.oe && e.T & CONFIG_AUTO_DISPOSE && !e.u && !(e.ie & REACTIVE_ZOMBIE) && !(e.S & STATUS_PENDING) && unobserved(e);
+    e.ce && e.T & CONFIG_AUTO_DISPOSE && !e.u && !(e.ue & REACTIVE_ZOMBIE) && !(e.S & STATUS_PENDING) && unobserved(e);
 }
 
 // Error-path sweep: notifyStatus(STATUS_ERROR) clears dependents' pending
@@ -119,9 +132,9 @@ function releaseSettledDependents(e) {
 // object identity down the whole dependent tree, and holding it is exactly
 // the "blocked on this error" marker — re-enqueue those holders so they
 // re-run: fresh values commit and flow, and a dependent with another
-// still-broken source simply re-errors. The async dimension needs no twin of
-// its own: recovery there passes through a pending window whose re-runners
-// set _blocked and ride settlePendingSource. Walks the full dependent graph
+// still-broken source simply re-errors. Pending recovery uses
+// settlePendingSource to clear inherited status and retry blocked readers.
+// Walks the full dependent graph
 // (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).
@@ -141,51 +154,63 @@ function settleErroredDependents(e, n) {
     if (t) schedule();
 }
 
-function settlePendingSource(e) {
-    // The normal landing path already cleared the source's own set. Superseded
-    // re-parks arrive here with an abandoned self entry, which must retire in
-    // the same walk as its propagated copies.
-    removePendingSource(e, e);
-    let n = false;
-    let t;
-    const r = new Set;
+// 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) {
+    // 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;
+    let r;
+    const i = new Set;
     // Companion updates no-op without the verdict layer (null hook).
-        const o = GlobalQueue.de;
-    const settle = i => {
-        if (r.has(i) || !removePendingSource(i, e)) return;
-        r.add(i);
-        i.Te = clock;
-        const l = i.o?.le?.values().next().value;
+        const o = GlobalQueue.Oe;
+    const settle = s => {
+        if (i.has(s)) return;
+        // 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.Pe = clock;
+        const u = s.o?.ae?.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 s = i.S & STATUS_ERROR;
-        if (l) {
-            if (!s) setPendingError(i, l);
-            o?.(i);
+                const l = s.S & STATUS_ERROR;
+        if (u) {
+            if (!l) setPendingError(s, u);
+            o?.(s);
         } else {
-            i.S &= ~STATUS_PENDING;
-            if (!s) setPendingError(i);
-            o?.(i);
-            if (i.o?.fe) {
-                enqueueSub(i);
-                n = true;
+            s.S &= ~STATUS_PENDING;
+            if (!l) setPendingError(s);
+            o?.(s);
+            if (s.o?.Ie) {
+                enqueueSub(s);
+                t = true;
             }
-            if (i.o !== null) i.o.fe = false;
+            if (s.o !== null) s.o.Ie = 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 (!i.u && i.T & CONFIG_AUTO_DISPOSE) (t ??= []).push(i);
+                        if (!s.u && s.T & CONFIG_AUTO_DISPOSE) (r ??= []).push(s);
         }
-        forEachDependent(i, settle);
+        forEachDependent(s, 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 (t) for (const e of t) releaseIfSettledUnobserved(e);
-    if (n) schedule();
+        if (r) for (const e of r) releaseIfSettledUnobserved(e);
+    if (t) schedule();
 }
 
 // Object-thenable detection (Promises/A+ shape).
@@ -194,26 +219,26 @@ function isThenable(e) {
 }
 
 /** Fire and clear a node's iterator-flight cancellation hook (#3122). */ function releaseFlightTeardown(e) {
-    const n = e.o?.Ee;
+    const n = e.o?.Ae;
     if (n != null) {
-        e.o.Ee = null;
+        e.o.Ae = null;
         n();
     }
 }
 
 function handleAsync(e, n, t) {
     let r = false;
-    let o = false;
+    let i = false;
     if (typeof n === "object" && n !== null) {
         untrack(() => {
             r = n[Symbol.asyncIterator];
-            o = !r && isThenable(n);
+            i = !r && isThenable(n);
         });
     }
-    if (!o && !r) {
-        if (e.o !== null) e.o.Ie = null;
+    if (!i && !r) {
+        if (e.o !== null) e.o.Re = null;
         // A sync landing is the first real answer for a loadingValue node.
-                e.Ne = false;
+                e.ge = false;
         return n;
     }
     // Flight replacement relies on recompute's supersede release for iterator
@@ -221,8 +246,20 @@ function handleAsync(e, n, t) {
     // 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).Ie = n;
-    let i;
+        ext(e).Re = n;
+    // 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.ae = 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
@@ -234,27 +271,41 @@ function handleAsync(e, n, t) {
     // keeps transition scheduling; initialized (value-holding) pending settles
     // are the transaction's reveal machinery and always re-enter.
         const settleTransition = () => {
-        const n = resolveTransition(e);
-        if (n && e.S & STATUS_UNINITIALIZED && !currentTransition(n)._e.has(e)) {
+        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?.Ue) n = waitingTransition(e) ?? n;
+        if (n && e.S & STATUS_UNINITIALIZED && !currentTransition(n).oe.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.Ae = null;
+            e.Ge = null;
             return;
         }
         globalQueue.initTransition(n);
+        enterWaiting(e);
     };
     const handleError = t => {
-        if (e.o?.Ie !== n) return;
+        if (e.o?.Re !== n) return;
         // NotReadyError from rejected promises should be treated as pending, not error
                 let r = t instanceof NotReadyError;
-        if (r && e.Ne) {
+        if (r && e.ge) {
             // 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.Ie = null;
+            if (e.o !== null) e.o.Re = null;
             parkLoadingWindow(e, t);
-            e.Te = clock;
+            e.Pe = clock;
             return;
         }
         settleTransition();
@@ -263,32 +314,34 @@ function handleAsync(e, n, t) {
         // rejected flight will never settle its self entry, so transfer ownership
         // after notifyStatus has propagated the replacement source.
                 if (r) settlePendingSource(e);
-        e.Te = clock;
+        e.Pe = 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);
     };
-    const asyncWrite = (r, o) => {
-        if (e.o?.Ie !== n) return;
+    const asyncWrite = (r, i) => {
+        if (e.o?.Re !== n) 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.ie & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
+                if (e.ue & (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 i = !!(e.S & STATUS_UNINITIALIZED);
+        const s = !!(e.S & 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 l = e.o?.De;
-        trimStaleDeps(e);
-        clearStatus(e);
-        if (l) e.o.De = true;
-        const s = resolveLane(e);
-        if (s) s.Oe.delete(e);
+                const u = e.o?.be;
+        landStatus(e);
+        if (u) e.o.be = true;
+        const l = resolveLane(e);
+        if (l) l.ye.delete(e);
         if (t) {
             try {
                 t(r);
@@ -296,8 +349,12 @@ function handleAsync(e, n, t) {
                 handleError(e);
                 return;
             }
-            if (i) clearStatus(e, true);
-        } else if (e.o?.Pe !== undefined) {
+            if (s) landStatus(e, true);
+        } else if (e.o?.Ce !== undefined && !(l && e.T & 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
@@ -307,8 +364,8 @@ function handleAsync(e, n, t) {
             // (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.Re === NOT_PENDING) queuePendingNode(e);
-            e.Re = r;
+            if (e.ve === NOT_PENDING) queuePendingNode(e);
+            e.ve = 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)
@@ -316,35 +373,37 @@ function handleAsync(e, n, t) {
             // 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.
-                        GlobalQueue.Ue?.(e, r);
+            // 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.me?.(e, r);
             if (!hasActiveOverride(e)) {
                 insertSubs(e);
-            } else if (e.T & CONFIG_AUTHORITATIVE_OBSERVED) {
-                // A17 silence is stated over ordinary readers; an authoritative-view
-                // reader (until()'s predicate) observed this node PAST its override
-                // and is waiting for exactly this staged truth. Without the wake the
-                // hold deadlocks: the landing waits on the transaction, the
-                // transaction on the action, the action on an until() that was never
-                // re-notified (#3164). Same selective wake as the equal-landing
-                // branch in recompute(). Optional call: the bit implies the
-                // optimistic engine WAS consulted, but the hook only installs with
-                // it — a bare-core build must not crash here.
-                GlobalQueue.he?.(e);
-            }
-            e.Te = clock;
-        } else if (s) {
+            } else GlobalQueue.we(e, r);
+            e.Pe = clock;
+        } else if (l) {
             // Route through lane's effect queue for independent flushing
-            const n = e.ge;
-            const t = e.be;
-            const o = e.pe;
+            const n = e.Le;
+            const t = hasActiveOverride(e) ? unwrapOverride(e.o.Ce) : e.Qe;
+            const i = e.Fe;
             try {
-                if (!n && i || !o || !o(r, t)) {
-                    e.be = r;
-                    e.Te = clock;
+                if (!n && s || !i || !i(r, t)) {
+                    // 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.Qe = r; else GlobalQueue.Ve(e, r, l);
+                    e.Pe = 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.Ue?.(e, r);
+                                        GlobalQueue.me?.(e, r);
                     insertSubs(e, true);
                 }
             } catch (n) {
@@ -370,14 +429,23 @@ function handleAsync(e, n, t) {
         // 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.Re === NOT_PENDING) {
-            e.Ne = false;
-            if (l) e.o.De = false;
+                if (e.ve === NOT_PENDING) {
+            e.ge = false;
+            if (u) e.o.be = 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.
+                        trimStaleDeps(e);
         }
         settlePendingSource(e);
         schedule();
         flush();
-        o?.();
+        i?.();
     };
     // A pending node's in-flight promise is an observer: `unlinkSubs` skips
     // autodispose while STATUS_PENDING so subscriber churn can't orphan the
@@ -405,15 +473,15 @@ function handleAsync(e, n, t) {
     // Returns whether a sync answer landed (first yield or empty completion) —
     // meaningful only in the live posture.
         const consumeIterator = (t, r) => {
-        const o = t[Symbol.asyncIterator]();
-        let l = false;
-        let s = false;
-        let u = !r;
+        const i = t[Symbol.asyncIterator]();
+        let o = false;
+        let u = false;
+        let l = !r;
         const close = () => {
-            if (s) return;
-            s = true;
+            if (u) return;
+            u = true;
             try {
-                const e = o.return?.();
+                const e = i.return?.();
                 if (isThenable(e)) e.then(undefined, () => {});
             } catch {}
         };
@@ -422,7 +490,7 @@ function handleAsync(e, n, t) {
         // 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).Ee = close;
+                ext(e).Ae = 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).
@@ -436,7 +504,7 @@ function handleAsync(e, n, t) {
             // 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 = o.next();
+                        const S = i.next();
             const d = isThenable(S) ? S : {
                 then: e => void e(S)
             };
@@ -448,18 +516,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 && u) {
+                if (c && l) {
                     t = r;
                     f = true;
-                    if (r.done) s = true;
-                } else if (e.o?.Ie !== n) {
+                    if (r.done) u = true;
+                } else if (e.o?.Re !== n) {
                     return;
                 } else if (!r.done) {
-                    l = true;
+                    o = true;
                     asyncWrite(r.value, iterateOrRelease);
                 } else {
-                    s = true;
-                    if (l) {
+                    u = true;
+                    if (o) {
                         schedule();
                         flush();
                     } else {
@@ -469,11 +537,11 @@ function handleAsync(e, n, t) {
                     settleAutodispose();
                 }
             }, t => {
-                if (c && u) {
+                if (c && l) {
                     r = t;
                     a = true;
-                } else if (e.o?.Ie === n) {
-                    s = true;
+                } else if (e.o?.Re === n) {
+                    u = true;
                     handleError(t);
                     settleAutodispose();
                 }
@@ -481,27 +549,27 @@ function handleAsync(e, n, t) {
             c = false;
             if (a) {
                 // Match the promise branch, but only rethrow during the initial read.
-                s = true;
+                u = true;
                 handleError(r);
-                if (u) throw r;
+                if (l) throw r;
                 return true;
             }
             if (f && !t.done) {
-                i = t.value;
-                l = true;
+                s = t.value;
+                o = true;
                 return iterate();
             }
             return f && t.done;
         };
         const f = iterate();
         // Later iterate() calls run from asyncWrite, where rethrowing would be unhandled.
-                u = false;
-        return l || f;
+                l = false;
+        return o || f;
     };
     // 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 l = null;
+        let u = 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
@@ -516,11 +584,11 @@ function handleAsync(e, n, t) {
         }
         if (!t) return false;
         const r = consumeIterator(e, n);
-        if (!n) l = r;
+        if (!n) u = r;
         return true;
     };
-    if (o) {
-        let t = false, r = false, o, l = true;
+    if (i) {
+        let t = false, r = false, i, o = 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
@@ -532,107 +600,154 @@ function handleAsync(e, n, t) {
         // becomes disposal-bearing, which is exactly the class a directly
         // returned iterable already occupies.
                 const registerDeferredClose = n => {
-            if (!e.Ge) e.Ge = n; else if (Array.isArray(e.Ge)) e.Ge.push(n); else e.Ge = [ e.Ge, n ];
+            if (!e.ke) e.ke = n; else if (Array.isArray(e.ke)) e.ke.push(n); else e.ke = [ e.ke, n ];
         };
         n.then(r => {
-            if (l) {
-                i = r;
+            if (o) {
+                s = r;
                 t = true;
-            } else if (e.o?.Ie === n && !(e.ie & REACTIVE_DISPOSED) && flattenIfIterable(r, registerDeferredClose)) ; else {
+            } else if (e.o?.Re === n && !(e.ue & REACTIVE_DISPOSED) && flattenIfIterable(r, registerDeferredClose)) ; else {
                 asyncWrite(r);
                 settleAutodispose();
             }
         }, e => {
-            if (l) {
-                o = e;
+            if (o) {
+                i = e;
                 r = true;
             } else {
                 handleError(e);
                 settleAutodispose();
             }
         });
-        l = false;
+        o = 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(o);
-            throw o;
+            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.Ne) return e.be;
+            if (e.ge) return e.Qe;
             globalQueue.initTransition(resolveTransition(e));
             throw new NotReadyError(context);
-        } else if (!flattenIfIterable(i)) {
+        } else if (!flattenIfIterable(s)) {
             // Synchronously-resolved promise: the first real answer landed.
-            e.Ne = false;
+            e.ge = 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 (l !== null) {
-        if (!l) {
+    if (u !== null) {
+        if (!u) {
             // Loading window: serve commit #0 (see the promise branch above).
-            if (e.Ne) return e.be;
+            if (e.ge) return e.Qe;
             globalQueue.initTransition(resolveTransition(e));
             throw new NotReadyError(context);
         }
         // A sync first yield (or immediate empty completion) is the first real
         // answer; async yields clear inside asyncWrite.
-                e.Ne = false;
+                e.ge = false;
     }
-    return i;
+    return s;
 }
 
 function clearStatus(e, n = false) {
-    if (e.o?.le) clearPendingSources(e);
-    if (e.o?.fe) if (e.o !== null) e.o.fe = false;
+    if (e.o?.ae) clearPendingSources(e);
+    if (e.o?.Ie) if (e.o !== null) e.o.Ie = 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.De = false;
+        if (e.o !== null) e.o.be = false;
     e.S = n ? 0 : e.S & 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?.ye || e.o?.Ce) GlobalQueue.de(e);
-    if (e.o?.i && e.T & CONFIG_CHILD_COMPANIONS && GlobalQueue.me !== null) GlobalQueue.me(e);
+        if (e.o?.je || e.o?.xe) GlobalQueue.Oe(e);
+    if (e.o?.i && e.T & CONFIG_CHILD_COMPANIONS && GlobalQueue.Me !== null) GlobalQueue.Me(e);
     const t = statusNotifierOf(e);
     if (t) t.call(e);
 }
 
-function notifyStatus(e, n, t, r, o) {
+/**
+ * Status clear for a flight LANDING (asyncWrite). A landing answers the
+ * node's OWN question — it retires the node's self entry, not the pending
+ * state its sources propagated onto it. An input re-asked while this flight
+ * was up (a second write to the signal feeding `a` while `b`'s first flight
+ * 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).
+ * 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
+ * releases it, or its value change recomputes the node into a fresh flight.
+ * `_blocked` clears like a full clear: a landing that passed the `_inFlight`
+ * guard was not superseded by a re-run (recompute nulls `_inFlight` first),
+ * so the flag is the flight's own registration throw — the input settling
+ * unchanged must not re-run the node (an extra flight for the same inputs).
+ * The node is already STATUS_PENDING in that branch (only notifyStatus fills
+ * the set, with status; a loading-window park cannot coexist with a live
+ * flight since registration drops the set), so the flags only change when
+ * 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?.ae;
+    // (The full clear below drops the set whether or not self was retired first.)
+        if (t && (t.delete(e), t.size)) {
+        e.o.Ie = false;
+        if (n) e.S = STATUS_PENDING;
+        setPendingError(e, t.values().next().value);
+    } else clearStatus(e, n);
+}
+
+function notifyStatus(e, n, t, r, i) {
     // Wrap regular errors to track source node
     if (n === STATUS_ERROR && !(t instanceof StatusError) && !(t instanceof NotReadyError)) t = new StatusError(e, t);
-    const i = n === STATUS_PENDING && t instanceof NotReadyError ? t.source : undefined;
-    const l = i === e;
-    const s = n === STATUS_PENDING && e.o?.Pe !== undefined && !l;
-    const u = s && hasActiveOverride(e);
+    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?.Ce !== undefined && !(e.T & CONFIG_DERIVED_OVERRIDE) && !s;
+    const l = u && hasActiveOverride(e);
     if (!r) {
-        if (n === STATUS_PENDING && i) {
-            addPendingSource(e, i);
+        // 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) {
+            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.S & STATUS_PENDING)) e.T &= ~CONFIG_INPUTS_PUBLISHED;
             e.S = STATUS_PENDING | e.S & STATUS_UNINITIALIZED;
             // Preserve the current source on this propagation so render-effect notification
             // can register every distinct pending source with the transition.
-                        setPendingError(e, i, t);
+                        setPendingError(e, o, t);
         } else {
             clearPendingSources(e);
             e.S = n | (n !== STATUS_ERROR ? e.S & STATUS_UNINITIALIZED : 0);
             ext(e)._ = t;
         }
-        GlobalQueue.de?.(e);
-        if (e.o?.i && e.T & CONFIG_CHILD_COMPANIONS && GlobalQueue.me !== null) GlobalQueue.me(e);
-    }
-    if (o && !r) {
-        assignOrMergeLane(e, o);
+        GlobalQueue.Oe?.(e);
+        if (e.o?.i && e.T & CONFIG_CHILD_COMPANIONS && GlobalQueue.Me !== null) GlobalQueue.Me(e);
     }
-    const f = r || u;
-    const a = r || s ? undefined : o;
+    const f = r || l;
+    const a = r || u ? undefined : i;
     const c = statusNotifierOf(e);
     if (c) {
         if (r && n === STATUS_PENDING) {
@@ -646,19 +761,56 @@ function notifyStatus(e, n, t, r, o) {
         return;
     }
     forEachDependent(e, (e, r) => {
-        e.Te = clock;
-        if (n === STATUS_PENDING && i && !e.o?.le?.has(i) || n !== STATUS_PENDING && (e.o?._ !== t || e.o?.le)) {
+        e.Pe = 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
+        // 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.qe !== e.Ze) {
+            enqueueSub(e);
+            schedule();
+            return;
+        }
+        if (n === STATUS_PENDING && o && !e.o?.ae?.has(o) || n !== STATUS_PENDING && (e.o?._ !== t || e.o?.ae)) {
             // 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.ve && n !== STATUS_PENDING && !(t instanceof NotReadyError)) {
+            if (r.He && n !== STATUS_PENDING && !(t instanceof NotReadyError)) {
                 enqueueSub(e);
                 schedule();
                 return;
             }
-            if (!f && !e.Ae) queuePendingNode(e);
+            // 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.Ge ? o && !e.Le && (e.S & STATUS_PENDING || e.ve !== NOT_PENDING) && globalQueue.initTransition(e.Ge) : queuePendingNode(e);
             notifyStatus(e, n, t, f, a);
         }
     });