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

package/dist/prod/core/core.js

@@ -1,6 +1,6 @@
 import { releaseFlightTeardown, handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settlePendingSource, settleErroredDependents } from "./async.js";
 
-import { EFFECT_TRACKED, EFFECT_USER, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_OPTIMISTIC, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, CONFIG_HAS_LANE, STATUS_PENDING, REACTIVE_MISSED_WAKE, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, CONFIG_DIRECT_COMMIT, OVERRIDE_UNDEFINED, CONFIG_AUTHORITATIVE_OBSERVED, CONFIG_HAS_COMPANIONS, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, CONFIG_FRESH_READ, CONFIG_AUTHORITATIVE_READ, CONFIG_HELD_TRUTH, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, defaultContext, CONFIG_IN_SNAPSHOT_SCOPE, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, CONFIG_FW_CHILDREN, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, REACTIVE_MANUAL_WRITE, CONFIG_SLOT_NODE, STORE_SNAPSHOT_PROPS } from "./constants.js";
+import { NOT_PENDING, EFFECT_TRACKED, EFFECT_USER, CONFIG_HELD_CHILDREN, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_OPTIMISTIC, CONFIG_DERIVED_OVERRIDE, STATUS_UNINITIALIZED, STATUS_ERROR, STATUS_PENDING, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, CONFIG_HAS_LANE, REACTIVE_MISSED_WAKE, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, CONFIG_DIRECT_COMMIT, CONFIG_HAS_COMPANIONS, CONFIG_PROMOTED, CONFIG_ADOPTED_UNFLUSHED, CONFIG_CHILDREN_FORBIDDEN, CONFIG_FRESH_READ, CONFIG_INPUTS_PUBLISHED, CONFIG_AUTO_DISPOSE, REACTIVE_LAZY, REACTIVE_DISPOSED, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, CONFIG_AUTHORITATIVE_READ, CONFIG_OVERRIDE_SUPERSEDED, CONFIG_AUTHORITATIVE_OBSERVED, defaultContext, CONFIG_HELD_TRUTH, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, CONFIG_IN_SNAPSHOT_SCOPE, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, REACTIVE_MANUAL_WRITE, CONFIG_FW_CHILDREN, CONFIG_SLOT_NODE, STORE_SNAPSHOT_PROPS } from "./constants.js";
 
 import { NotReadyError } from "./error.js";
 
@@ -8,7 +8,7 @@ import { trimStaleDeps, link, dormantNodes } from "./graph.js";
 
 import { deleteFromHeap, queueFor, insertIntoHeapHeight, enqueueSub, markNode, markHeap, insertIntoHeap } from "./heap.js";
 
-import { GlobalQueue, bumpNotifyEpoch, activeTransition, globalQueue, clock, insertSubs, queuePendingNode, runInTransition, schedule, notifyEpoch, dirtyQueue, projectionWriteActive, reaskArmed, armReaskClear } from "./scheduler.js";
+import { GlobalQueue, bumpNotifyEpoch, activeTransition, globalQueue, clock, currentTransition, insertSubs, queuePendingNode, wakeParked, heldTrims, runInTransition, schedule, batchJoins, notifyEpoch, dirtyQueue, projectionWriteActive, reaskArmed, armReaskClear } from "./scheduler.js";
 
 import "./invariants.js";
 
@@ -22,15 +22,15 @@ import { disposeChildren, markDisposal, inheritId } from "./owner.js";
 // render-effect callback stages its value for the next pass, but a wake pushed
 // directly into the user queue ran in the SAME pass, read the old value, and
 // nothing re-notified it when the value landed (#3291).
-GlobalQueue.Fe = e => {
-    if (e.ge === EFFECT_TRACKED) {
+GlobalQueue.We = e => {
+    if (e.Le === EFFECT_TRACKED) {
         deleteFromHeap(e, queueFor(e));
-        e.He = true;
-        e.C.enqueue(EFFECT_USER, e.Ve);
+        e.Ye = true;
+        e.C.enqueue(EFFECT_USER, e.Ke);
     } else recompute(e);
 };
 
-GlobalQueue.ke = disposeChildren;
+GlobalQueue.Be = disposeChildren;
 
 let tracking = false;
 
@@ -62,8 +62,8 @@ let snapshotSources = null;
 
 function ownerInSnapshotScope(e) {
     while (e) {
-        if (e.xe) return true;
-        e = e.Le;
+        if (e.Je) return true;
+        e = e._parent;
     }
     return false;
 }
@@ -74,44 +74,49 @@ function setSnapshotCapture(e) {
 }
 
 function markSnapshotScope(e) {
-    e.xe = true;
+    e.Je = true;
 }
 
 function releaseSnapshotScope(e) {
-    e.xe = false;
+    e.Je = false;
     releaseSubtree(e);
     schedule();
 }
 
 function releaseSubtree(e) {
-    let t = e.Qe;
+    let t = e.Xe;
     while (t) {
-        if (t.xe) {
-            t = t.We;
+        if (t.Je) {
+            t = t.$e;
             continue;
         }
-        if (t.oe) {
+        if (t.ce) {
             const e = t;
             e.T &= ~CONFIG_IN_SNAPSHOT_SCOPE;
-            if (e.ie & REACTIVE_SNAPSHOT_STALE) {
-                e.ie &= ~REACTIVE_SNAPSHOT_STALE;
-                e.ie |= REACTIVE_DIRTY;
-                if (dirtyQueue.Me > e.qe) dirtyQueue.Me = e.qe;
+            if (e.ue & REACTIVE_SNAPSHOT_STALE) {
+                e.ue &= ~REACTIVE_SNAPSHOT_STALE;
+                e.ue |= REACTIVE_DIRTY;
+                if (dirtyQueue.et > e.tt) dirtyQueue.et = e.tt;
                 insertIntoHeap(e, dirtyQueue);
             }
         }
         releaseSubtree(t);
-        t = t.We;
+        t = t.$e;
     }
 }
 
 function clearSnapshots() {
     if (snapshotSources) {
         for (const e of snapshotSources) {
-            delete e.o?.Ye;
+            // The extension is a fixed-shape object with `_snapshotValue`
+            // pre-initialized to undefined (see ext()), and every reader tests
+            // `!== undefined` — assign, don't `delete`: deleting a field pushes the
+            // object to dictionary mode for every later read of every field.
+            const t = e.o;
+            if (t != null) t.nt = undefined;
             // StoreNode targets share one pre-initialized hidden class (see
-            // createStoreProxy) — assign undefined instead of deleting, and only
-            // when present so signal-node sources don't grow the field.
+            // createStoreProxy) — same rule, and only when present so signal-node
+            // sources don't grow the field.
                         if (e[STORE_SNAPSHOT_PROPS] !== undefined) e[STORE_SNAPSHOT_PROPS] = undefined;
         }
         snapshotSources = null;
@@ -122,12 +127,16 @@ function clearSnapshots() {
 function recompute(e, t = false) {
     // §12d: any recompute can clean a marked subscriber — invalidate skips.
     bumpNotifyEpoch();
-    const n = e.ge;
+    const n = e.Le;
     if (!t) {
-        if (e.Ae && (!n || activeTransition) && activeTransition !== e.Ae) globalQueue.initTransition(e.Ae);
+        // A stamped memo re-enters its hold: its value is that transaction's work.
+        // An effect's pass belongs to whatever dirtied it (A15 corollary: effects
+        // don't entangle parallel transactions); it joins its stamp only when the
+        // pass observes the held flight — queue notification (#3407).
+        if (e.Ge && !n && activeTransition !== e.Ge) globalQueue.initTransition(e.Ge);
         deleteFromHeap(e, queueFor(e));
         if (e.o !== null) {
-            e.o.Ie = null;
+            e.o.Re = null;
             // Supersede is where an iterator flight dies (#3122): close it now.
             // Its cleanup(close) registration may sit in a zombie-deferred
             // disposal list that a held transition only drains when the
@@ -135,50 +144,66 @@ function recompute(e, t = false) {
             // work that replaced it. Idempotent with the cleanup-channel close.
                         releaseFlightTeardown(e);
         }
-        // Tracked effects run after finalizePureQueue, so dispose immediately instead of deferring
-                if (e.Ae || n === EFFECT_TRACKED) disposeChildren(e); else if (e.Qe !== null || e.Ge !== null) {
+        // Tracked effects run after finalizePureQueue, so dispose immediately
+        // instead of deferring. Children built by an uncommitted recompute
+        // (CONFIG_HELD_CHILDREN) die immediately too: no frame ever showed them.
+        // Everything else is the committed frame's and is deferred as zombies
+        // until this node's commit — a transaction-owned node included (#3404):
+        // a parked node's children predate the hold, and tearing them down when
+        // the source lands ran cleanups before the transaction's atomic reveal.
+                if (n === EFFECT_TRACKED || e.T & CONFIG_HELD_CHILDREN) disposeChildren(e); else if (e.Xe !== null || e.ke !== null) {
             markDisposal(e);
             const t = ext(e);
-            t.Ze = e.Ge;
-            t.Ke = e.Qe;
-            e.Ge = null;
-            e.Qe = null;
-            e.je = 0;
+            t.it = e.ke;
+            t.lt = e.Xe;
+            e.ke = null;
+            e.Xe = null;
+            e.ut = 0;
         } else ;
     }
-    let i = !!(e.ie & REACTIVE_OPTIMISTIC_DIRTY);
-    const u = (e.T & CONFIG_OPTIMISTIC) !== 0 && e.o?.Pe !== NOT_PENDING && e.o?.Pe !== undefined;
-    const l = !!(e.S & STATUS_UNINITIALIZED);
-    // Outgoing error, captured before the compute clears status: if this run
-    // recovers to an unchanged value, dependents still holding this object must
-    // be swept (settleErroredDependents, #2949).
+    let i = !!(e.ue & REACTIVE_OPTIMISTIC_DIRTY);
+    // A derived override (lanes stage, #3479) is override-covered like a written
+    // one: a plain pass over it — its source superseded (A18) — stages the truth
+    // and supersedes the override through the sync twin below.
+        const l = (e.T & (CONFIG_OPTIMISTIC | CONFIG_DERIVED_OVERRIDE)) !== 0 && e.o?.Ce !== NOT_PENDING && e.o?.Ce !== undefined;
+    const u = !!(e.S & STATUS_UNINITIALIZED);
+    // Capture both error and pending status before the compute clears them.
+    // A conditional can drop its pending source and recover to an unchanged
+    // value, leaving blocked dependents outside that source’s settle walk.
         const o = e.S & STATUS_ERROR ? e.o?._ : undefined;
+    const s = (e.S & STATUS_PENDING) !== 0;
+    const r = s ? e.o?.ae : undefined;
     // Pending SOURCE-hood, captured before the compute clears status: a node
     // whose own flight parked dependents self-registers in _pendingSources
     // (notifyStatus, isSource). If this recompute supersedes that flight and
     // settles synchronously, those dependents settle HERE — asyncWrite's
     // settlePendingSource walk never runs for a landing that was preempted
     // (#3181).
-        const s = e.o?.le?.has(e);
+        const a = e.o?.ae?.has(e);
     // Re-ask classification lives in the verdict module; capture the flag before
     // the recompute wipes _flags below.
-        const a = (e.ie & REACTIVE_REASK) !== 0;
+        const c = (e.ue & REACTIVE_REASK) !== 0;
     // Captured before the compute clears it on a sync landing: if that landing
     // is transition-held below, the window must stay open until the hold
     // commits (commitPendingNode) — a closed window plus a held value reads as
     // a pending frame to live observers of the verdict (#2990).
-        const r = e.Ne;
-    const _ = context;
+        const f = e.ge;
+    // Creation-time A29 (see enterStagedRead): a pass outside a flush that is
+    // served a live transaction's staged value records the transaction here
+    // and is staged INTO it below — "born held" — instead of committing.
+        const _ = stagedEntry;
+    stagedEntry = null;
+    const N = context;
     context = e;
-    e.Be = null;
-    e.ze++;
-    e.ie = REACTIVE_RECOMPUTING_DEPS;
-    e.Te = clock;
-    let c = e.Re === NOT_PENDING ? e.be : e.Re;
-    let f = e.qe;
+    e.ot = null;
+    e.Ze++;
+    e.ue = REACTIVE_RECOMPUTING_DEPS;
+    e.Pe = clock;
+    let d = e.ve === NOT_PENDING ? e.Qe : e.ve;
+    let E = e.tt;
     let I = false;
-    let E = tracking;
-    let N = currentOptimisticLane;
+    let T = tracking;
+    let S = currentOptimisticLane;
     tracking = true;
     // A computed's fn establishes its OWN dependencies, so it must never run
     // inside a latest() read window: read() short-circuits through the
@@ -186,67 +211,102 @@ function recompute(e, t = false) {
     // computed) inside latest(fn) came out permanently dependency-less (#2926).
     // latestRead() already suspends the flag for its pull-recomputes; this
     // covers creation-time computes and flushes that run inside the window.
-        const T = latestReadActive;
+        const O = latestReadActive;
     latestReadActive = false;
+    // A memo computes under its OWN lane posture, never the puller's (A31,
+    // #3442): its value is one shared slot every reader sees, so a pull from a
+    // lane-carrying reader (a probe effect on its companion lane pulling a sync
+    // memo) must not run it with that lane's read carve-outs — under a lane, a
+    // pending node on no lane serves its committed value instead of throwing,
+    // and the memo then published a stale "settled" value, dropped its
+    // pending status, and stopped holding its transaction. The branches below
+    // re-establish the posture the memo itself owns (OPT-dirty, or adopted
+    // through its deps). Effects keep the ambient lane: their runs are the
+    // lane's own view.
+        if (!n) currentOptimisticLane = null;
     // Lane posture lives with the engine: OPTIMISTIC_DIRTY is only ever set by
     // engine-driven paths, and _optimisticNodes is only pushed by
     // _optimisticWrite, so the hook is installed whenever either gate holds.
         if (i) {
-        const t = GlobalQueue.Je(e, true);
+        const t = GlobalQueue.st(e, true);
         if (t) currentOptimisticLane = t;
         // `false` = wake-only lane demotion: recompute plain so a mid-tick
         // latest()/isPending() pull stages instead of direct-committing (#3009).
         // The predicate lives with the engine (recomputeLane).
          else if (t === false) i = false;
-    } else if (activeTransition && !t && activeTransition.Xe.length) {
+    } else if (e.T & CONFIG_DERIVED_OVERRIDE) {
+        // Lanes stage (#3479): a pass over a live lane member carrying a derived
+        // override is the lane's pass whatever channel dirtied it (a boundary
+        // reset, an unrelated sync write) — its inputs serve the lane's view, so
+        // its result is the lane's and belongs in the override slot. Run plain,
+        // A18's sync twin below read that re-derived lane view as a differing
+        // truth (a fresh array), superseded the override and demoted the lane;
+        // the lane's next pass then dropped the staged "truth" and left the node
+        // flagged superseded with nothing to serve (fuzzer latest-1 #2481). A
+        // demoted node resolves no lane and stays plain: its pass IS the truth.
+        const t = GlobalQueue.st(e, true);
+        if (t) {
+            i = true;
+            currentOptimisticLane = t;
+        }
+    } else if (activeTransition && !t && activeTransition.rt.length) {
         // Lane adoption: parent-deeper-than-owned-child can run before its OPT-dirty
         // child propagates. Walk deps once and inherit the OPT lane so this node
         // recomputes under the right posture and propagates correctly.
-        const t = GlobalQueue.Je(e, false);
+        const t = GlobalQueue.st(e, false);
         if (t) {
             i = true;
             currentOptimisticLane = t;
         }
     }
-    const S = n && n !== EFFECT_USER;
-    const d = stale;
-    if (S) stale = true;
+    const C = n && n !== EFFECT_USER;
+    const A = stale;
+    if (C) stale = true;
+    // An effect recorded for this transaction's commit replay (it once read a
+    // node the transaction held and showed the committed value) and now
+    // recomputing UNDER the transaction sees its staged view: the value this
+    // run produces is applied by the commit itself, and the stale recording
+    // would publish the frame a second time. Drop it; the reads below re-record
+    // if they are served the committed view again (a lane's committed read).
+        if (n && activeTransition !== null && activeTransition.ct.size) activeTransition.ct.delete(e);
     try {
         if (!false && e.T & CONFIG_SYNC) {
-            c = e.oe(c);
-            if (e.o !== null) e.o.Ie = null;
-            e.Ne = false;
+            d = e.ce(d);
+            if (e.o !== null) e.o.Re = null;
+            e.ge = false;
         } else {
             // Snapshot `_inFlight` so we can detect whether `_fn` self-registered an async
             // subscription (e.g. `createProjection` calls `handleAsync` from inside its body
             // with a setter callback). In that case, the outer `handleAsync` call below would
             // clobber the fresh subscription, so we skip it and let the internally-registered
             // iteration drive updates.
-            const t = e.o?.Ie;
-            const n = e.oe(c);
+            const t = e.o?.Re;
+            const n = e.ce(d);
             const i = typeof n === "object" && n !== null;
-            const u = e.o?.Ie !== t;
-            c = u || !i ? n : handleAsync(e, n);
-            if (!u && !i) {
-                if (e.o !== null) e.o.Ie = null;
+            const l = e.o?.Re !== t;
+            d = l || !i ? n : handleAsync(e, n);
+            if (!l && !i) {
+                if (e.o !== null) e.o.Re = null;
                 // A sync (non-object) return is the first real answer; async-shaped
                 // results clear inside handleAsync at their own landing points, and a
                 // self-registered flight (inFlightChanged — projections) clears when
                 // its internal handleAsync lands.
-                                e.Ne = false;
+                                e.ge = false;
             }
         }
         // On a status-free node clearStatus is a guaranteed no-op: every field
         // its body gates on is either _statusFlags or lives in the cold
         // extension — no extension, no status to clear. (_x from an unrelated
         // installer just makes clearStatus a cheap re-verified no-op.)
-                if (e.S !== 0 || e.o !== null) clearStatus(e, t);
+        // A node born held keeps STATUS_UNINITIALIZED until its transaction
+        // commits: it has no committed value, and read() holds its readers.
+                if (e.S !== 0 || e.o !== null) clearStatus(e, t && stagedEntry === null);
         // _optimisticLane is only ever assigned by engine paths (CONFIG_HAS_LANE
         // is their sticky presence mark).
-                if (e.T & CONFIG_HAS_LANE && e.o?.$e) GlobalQueue.et(e);
+                if (e.T & CONFIG_HAS_LANE && e.o?.Ue) GlobalQueue.ft(e);
     } catch (t) {
         const n = t instanceof NotReadyError;
-        if (n && e.Ne) {
+        if (n && e.ge) {
             // Loading window with an unready sync dependency: register for the
             // source's settle (the settlePendingSource walk runs off
             // _pendingSources + _blocked alone) but take NO read-visible pending
@@ -258,37 +318,56 @@ function recompute(e, t = false) {
         } else {
             // Track pending async in the lane (not the lane's source — it creates the lane
             // but doesn't belong to it). Set lane BEFORE notifyStatus for downstream propagation.
-            if (n && currentOptimisticLane) GlobalQueue.tt(e);
+            if (n && currentOptimisticLane) GlobalQueue._t(e);
             let i = false;
             if (n) {
-                ext(e).fe = true;
-                if (GlobalQueue.nt !== null) i = GlobalQueue.nt(e, a);
+                ext(e).Ie = true;
+                if (GlobalQueue.Nt !== null) i = GlobalQueue.Nt(e, c);
             }
-            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.o?.$e : undefined);
+            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.o?.Ue : undefined);
             // The replacement source is fully propagated now. If no new flight
             // re-owned self, retire the superseded flight and its dependent copies.
-                        if (n && s && !e.o?.Ie) settlePendingSource(e);
+                        if (n && a && !e.o?.Re) settlePendingSource(e);
+            // A re-park drops what the earlier pass carried (#3456): a source this
+            // pass no longer reaches — its branch switched, or a fresh flight
+            // replaced the inputs' pending with its own — stays copied onto
+            // dependents that reached it only through here, and its landing walk
+            // stops at this node (nothing left to retire) before it finds them. A
+            // dependent then waits forever on a flight it has no path to. The
+            // re-park twin of the unchanged-value recovery sweep below; dependents
+            // with another path keep the source (retryReaches).
+                        if (n && r) for (const t of r) if (t !== e && !e.o?.ae?.has(t)) settlePendingSource(e, t);
             if (i) GlobalQueue.k(e);
         }
     } finally {
-        tracking = E;
-        latestReadActive = T;
-        if (S) stale = d;
+        tracking = T;
+        latestReadActive = O;
+        if (C) stale = A;
         // Consume the missed-wake latch (#3037, set by insertSubs): a dep write
         // landed beneath this pass on a link it had already validated. The wipe
         // below must not key off DIRTY/CHECK — the read-time pull protocol
         // (markNode(c) in read()) marks the running node as part of ordinary
         // bookkeeping, and those marks are correctly discarded here.
-                I = (e.ie & REACTIVE_MISSED_WAKE) !== 0;
-        e.ie = REACTIVE_NONE | (t ? e.ie & REACTIVE_SNAPSHOT_STALE : 0);
-        context = _;
+                I = (e.ue & REACTIVE_MISSED_WAKE) !== 0;
+        e.ue = REACTIVE_NONE | (t ? e.ue & REACTIVE_SNAPSHOT_STALE : 0);
+        context = N;
     }
+    // The cast re-widens: TS narrowed `stagedEntry` to `null` at the reset
+    // above and does not invalidate that across the compute call that
+    // `enterStagedRead` runs under. No emitted code.
+        const p = stagedEntry;
+    stagedEntry = _;
     if (!e.o?._) {
-        trimStaleDeps(e);
-        const a = u ? unwrapOverride(e.o?.Pe) : e.Re === NOT_PENDING ? e.be : e.Re;
-        let _ = false;
+        // INV-11 (#3330): the equality gate compares against the slot this run
+        // publishes to. An override-covered node publishes the override; a lane
+        // recompute (OPT-dirty) direct-commits `_value` — the lane's own reveal
+        // schedule — so a transaction-held `_pendingValue` that already equals
+        // the new result is not "unchanged": the screen still shows `_value`.
+        // Only a transaction-staged run compares against `_pendingValue`.
+        const s = l ? unwrapOverride(e.o?.Ce) : i || e.ve === NOT_PENDING ? e.Qe : e.ve;
+        let c = false;
         try {
-            _ = !n && l || !e.pe || !e.pe(a, c);
+            c = !n && u || !e.Fe || !e.Fe(s, d);
         } catch (t) {
             // A throwing user comparator is an error of this node's computation.
             // Route it through the same status path as a compute-phase throw so
@@ -301,15 +380,38 @@ function recompute(e, t = false) {
         // its runner — happen here instead. `!create` matches the previous `initialized`
         // gate: the explicit recompute(node, true) inside effect() does not enqueue, so
         // effect() can call its runner synchronously for the first run.
-                if (n && _) {
-            e.He = !e.o?._;
+                if (n && c) {
+            e.Ye = !e.o?._;
             // Reuse one bound runner per effect — runEffect no-ops on a stale
             // `_modified`, so re-enqueueing the same function is harmless.
-                        if (!t) e.C.enqueue(n, e.it ??= GlobalQueue.ut.bind(null, e));
+                        if (!t) {
+                e.C.enqueue(n, e.dt ??= GlobalQueue.Et.bind(null, e));
+                // Contested effect (#3322). Effects don't entangle transactions (a
+                // shared effect is not shared state), yet they have one value slot:
+                // when this write commits under a different transaction
+                // (`activeTransition`, null = mainline) than the one that produced the
+                // previous value (`_valueTransition`), that view is gone. Rather than
+                // merge the two, each commit re-derives the effect against its own
+                // committed world (Transition._contested, re-dirtied by
+                // finalizePureQueue ahead of the heap run). The previous owner always
+                // needs it if still live: its commit is silent (staging already
+                // notified) and the value it computed is gone. The new owner needs it
+                // too, for the same reason, unless it is mainline — mainline publishes
+                // what it computes. A previous owner that was mainline, or already
+                // committed, left nothing to protect.
+                                let t = e.It;
+                if (t !== activeTransition) {
+                    e.It = activeTransition;
+                    if (t !== null && (t = currentTransition(t)) !== activeTransition && !t.Tt) {
+                        (t.St ??= []).push(e);
+                        if (activeTransition !== null) (activeTransition.St ??= []).push(e);
+                    }
+                }
+            }
         }
-        if (e.o?._) ; else if (_) {
-            const l = u ? e.o?.Pe : undefined;
-            if (t || 
+        if (e.o?._) ; else if (c) {
+            const u = l ? e.o?.Ce : undefined;
+            if (t && p === null || 
             // Plain sync flush (no transition on either side) commits effect
             // values directly — the pending round-trip (queuePendingNode +
             // commitPendingNodes) exists to sequence transition reveals, and
@@ -318,48 +420,84 @@ function recompute(e, t = false) {
             // their own held transition: their applies deliver on a microtask,
             // not the stashed queues, so a staged value would hand the immediate
             // apply stale state — see CONFIG_DIRECT_COMMIT.
-            n && (activeTransition !== e.Ae || activeTransition === null || e.T & CONFIG_DIRECT_COMMIT) || i) {
-                e.be = c;
-                // Lane-propagated correction: upstream data is fresh, correct the
-                // override unconditionally. The direct _value commit is the lane's
-                // own reveal schedule; drop any superseded older hold so its queued
-                // commit can't clobber the fresh value.
-                                if (u && i) {
-                    ext(e).Pe = c === undefined ? OVERRIDE_UNDEFINED : c;
-                    e.Re = NOT_PENDING;
-                }
+            n && p === null && (activeTransition !== e.Ge || activeTransition === null || e.T & CONFIG_DIRECT_COMMIT) || i) {
+                // Lanes stage (#3479): a lane pass on a memo publishes its speculative
+                // result as an OVERRIDE — `_value` stays the committed truth, so a
+                // reader off the lane (A17's committed view, #3460) sees a whole
+                // committed frame: the source's shadow and its derivations together,
+                // never a committed shadow beside a speculative memo. The lane's own
+                // readers and untracked reads see the override (A17); the revert
+                // drops it and re-derives (resolveOptimisticNodes). Effects keep the
+                // direct commit — their `_value` is a run result the lane's queues
+                // already sequence. Either way the lane pass drops any superseded
+                // older hold so its queued commit can't clobber the fresh frame: a
+                // hold staged on an earlier, lane-free pass of the SAME transaction
+                // is superseded — left in place, the commit published the older
+                // frame over the fresh one (#3377). A reversion pass (OPT-dirty with
+                // no lane — the override dropped) commits directly: it IS the truth.
+                if (i && !n && currentOptimisticLane !== null) GlobalQueue.Ve(e, d, currentOptimisticLane); else e.Qe = d;
+                if (i) e.ve = NOT_PENDING;
             } else {
-                e.Re = c;
+                e.ve = d;
+                if (p !== null) {
+                    // Born held: the pass ran from mainline and derived from this
+                    // transaction's staged world (enterStagedRead). Its value is the
+                    // transaction's — staged into it directly, stamped, and committed
+                    // with it; mainline's batch never sees it. A born-held effect
+                    // skips its synchronous first run (effect()) and is replayed by
+                    // the commit like a stale reader that showed the committed frame.
+                    e.Ge = p;
+                    p.Ot.push(e);
+                    if (n) p.ct.add(e);
+                }
                 // A window landing that gets held re-opens the window until the hold
                 // commits — the verdict's held-value branch is window-gated (#2990).
-                                if (r) e.Ne = true;
-                // Transition-held sync recompute is a write path like setSignal/asyncWrite,
+                                if (f) e.ge = true;
+                // A staged sync recompute is a write path like setSignal/asyncWrite,
                 // so sync derivations of held sources stay visible to isPending()/latest()
                 // (#2831). Both companion writes are transition-scoped (optimistic) and
-                // auto-revert/re-derive at commit. Skipped for plain flushes where the
-                // pending value commits before effects run.
-                                if ((activeTransition || e.Ae) && GlobalQueue.Ue !== null) GlobalQueue.Ue(e, c);
+                // auto-revert/re-derive at commit. Not gated on an active transition:
+                // a plain flush can still become a hold after this recompute — an
+                // async memo downstream pends and the batch is adopted into a
+                // transaction (scheduler.enterTransition) — and nothing re-derives
+                // the companion at adoption, so a memo held that way read
+                // isPending() false while its held source read true (#3413).
+                                if (e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.me !== null) GlobalQueue.me(e, d);
             }
             // insertSubs only walks _subs (no scheduling of its own), so a
             // subscriber-less node has nothing to notify.
-                        if (e.u !== null && (!u || i || e.o?.Pe !== l)) insertSubs(e, i || u);
-        } else if (u) {
+                        if (e.u !== null && (!l || i || e.o?.Ce !== u)) insertSubs(e, i || l);
+            // A18 supersession, sync twin of asyncWrite's override branch (#3331):
+            // this pass published truth that differs from the override (the gate
+            // compared against it) into the transaction-held slot. Whether the
+            // source is this node's own async or an upstream node it derives from
+            // synchronously makes no difference — "the source recomputed". The
+            // override stays displayed until the commit; the graph moves to the
+            // staged truth now (plain channel, lane demoted). Ordering: "a new
+            // value from the source" postdates the override — an override written
+            // in this same tick (optimisticWrite stamps `_overrideTime`) is the
+            // newer intent over whatever this pass derives from the batch's staged
+            // inputs, and is not superseded by it.
+             else if (l && !i && e.o.Ct !== clock) GlobalQueue.we(e, d);
+        } else if (l) {
             // Unchanged value (equals the override) recomputed while the override
             // is active: _value may still be stale, so hold the authoritative value
             // for commit on its own transition's schedule — invisibly (A17/A18).
-            if (e.Re === NOT_PENDING) queuePendingNode(e);
-            e.Re = c;
-            if (r) e.Ne = true;
+            if (e.ve === NOT_PENDING) queuePendingNode(e);
+            e.ve = d;
+            if (f) e.ge = true;
  // see the held branch above (#2990)
-            // An authoritative-view reader (until()'s predicate, refresh()'s waiter)
-            // observed this node past its override — and "authoritative arrival
-            // equal to the override" is exactly the acknowledgment it waits for.
-            // Wake those readers only; A17 silence holds for every ordinary
-            // subscriber. (Hook installed by both setters of the gating bit, #3303.)
-                        if (e.T & CONFIG_AUTHORITATIVE_OBSERVED) GlobalQueue.he(e);
-        } else if (e.qe != f) {
-            for (let t = e.u; t !== null; t = t.ae) {
-                insertIntoHeapHeight(t.ce, queueFor(t.ce));
+            // A confirmation after a supersession restores the override as the
+            // graph's value and notifies; a plain confirmation wakes only an
+            // authoritative-view reader (until()'s predicate, refresh()'s waiter)
+            // that observed this node past its override — "authoritative arrival
+            // equal to the override" is exactly the acknowledgment it waits for;
+            // A17 silence holds for every ordinary subscriber. Both live in the
+            // engine's supersedeOverride.
+                        GlobalQueue.we(e, d);
+        } else if (e.tt != E) {
+            for (let t = e.u; t !== null; t = t.Ne) {
+                insertIntoHeapHeight(t._e, queueFor(t._e));
             }
         }
         // Silent recovery: errored → unchanged value fires no notification, but
@@ -367,21 +505,92 @@ function recompute(e, t = false) {
         // in an errored run and may sit on stale commits (#2949). Changed-value
         // recoveries ride insertSubs above; a comparator throw re-errored the node
         // (el._x?._error re-set), so this only runs on a genuinely clean recovery.
-                if (o !== undefined && !_ && !e.o?._) settleErroredDependents(e, o);
+                if (!c && !e.o?._) {
+            if (o !== undefined) settleErroredDependents(e, o);
+            // Self-registration (this node's own superseded flight) is the #3181
+            // sweep's business below — retiring it here too would walk twice.
+                        if (r) for (const t of r) if (t !== e) settlePendingSource(e, t);
+        }
         // #3181: a synchronous settle supersedes the old landing callback, so
         // recompute owns its pending-source sweep. An uninitialized node without
         // a replacement source still has no truth to reveal and must stay parked.
-                if (s && !(e.S & (STATUS_PENDING | STATUS_UNINITIALIZED))) settlePendingSource(e);
+                if (a && !(e.S & (STATUS_PENDING | STATUS_UNINITIALIZED))) settlePendingSource(e);
+    }
+    // A REPORTER whose pass stopped reading a source it reported on (a gate
+    // closed) stops counting for the transaction waiting on it (A15 / #3426:
+    // the hold lasts while a live reporter observes the flight). Nothing else
+    // re-judges a parked transaction (see wokenTransitions; the disposal
+    // (#3372) and boundary (#3375) twins of this site), so the writes it held
+    // stayed staged for as long as the flight stayed up — forever, for one
+    // that never lands (fuzzer #3446 P1, spec O3). The event is "this pass
+    // dropped a dep" — deps past `_depsTail` (trimmed below, or kept by A30
+    // for a staged pass), or a pass that read nothing — not "recovered from
+    // pending": a reporter registered by the stale-reader carve-out
+    // (heldFromStale, an INITIALIZED source refetching) displays the committed
+    // value and is never pending (fuzzer case 79). Every parked transaction,
+    // not the reporter's stamp: the transaction waiting on it registered it
+    // without stamping it. One idle pass per parked transaction; done ones
+    // return at re-entry. Effects only — reporters register from render-effect
+    // notification (INV-3).
+    // (`_depsTail` was reset at the top of the pass; TS keeps that narrowing.)
+        const R = e.ot;
+    if (n && (s && !(e.S & STATUS_PENDING) || (R === null ? e.Se !== null : R.de !== null))) wakeParked();
+    // Dependencies are the committed frame's until it is replaced (A30, #3410; the
+    // deps twin of the held children above): a pass that staged its value
+    // leaves the previous pass's tail linked for `commitPendingNode` to trim,
+    // so a write to a dependency the committed value still derives from
+    // reaches this node — and joins its hold if the stage is transaction-held
+    // by then (a plain flush decides nothing here: the transaction that holds
+    // the pass may open later in the same flush). A pass that published
+    // directly (a first pass, a lane's own reveal) trims now. An errored pass
+    // (a throw, NotReady included, or a comparator throw above) keeps its full
+    // list as before — `_depsTail` marks where it stopped — and the commit
+    // skips it by the same `_error`. An effect's frame is the run its value is
+    // applied by, not the value slot (#3438): a direct-committed pass that
+    // still owes a run (`_modified`) has not replaced what the last run
+    // published — the same flush may stash that run into a transaction it
+    // opens later — so its tail waits for `runEffect` to trim once the run
+    // applies. A pass that changed nothing replaced nothing either (#3469): the
+    // same flush may park with its inputs held, and the committed frame still
+    // derives from the tail — its trim waits on the flush's verdict (heldTrims).
+    // A tracked effect's pass IS its run (it bypasses the heap and runs after
+    // the commit): the frame is replaced, trim now.
+        if (!e.o?._ && e.ve === NOT_PENDING && !(n && e.Ye)) {
+        if (t || i || n === EFFECT_TRACKED) trimStaleDeps(e); else if (e.ot?.de ?? e.Se) heldTrims.push(e);
     }
-    currentOptimisticLane = N;
-    const A = e.Re !== NOT_PENDING || e.o !== null && (e.o.Ke !== null || e.o.Ze !== null) || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
+    currentOptimisticLane = S;
+    const G = e.ve !== NOT_PENDING || e.o !== null && (e.o.lt !== null || e.o.it !== null) || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
     // Override-covered holds (hasOverride) always queue: their commit belongs
     // to their own transition's schedule (A18 re-rule) and is unobservable
     // under the override (A17). Revert no longer commits anything, so an
     // unqueued covered hold would leak (INV-7) once the revert clears
     // _transition.
-        A && (!t || e.S & STATUS_PENDING) && (!e.Ae || u) && queuePendingNode(e);
-    e.Ae && n && activeTransition !== e.Ae && runInTransition(e.Ae, () => recompute(e));
+    
+    // While a pass's result waits on a commit, its children (and `_disposal`)
+    // wait with it, and a re-run may tear them down immediately
+    // (CONFIG_HELD_CHILDREN, #3404). One exception: a transaction-owned effect
+    // recomputed mainline (contested, #3322) published its value directly — a
+    // `_pendingValue` left from an earlier held pass is that transaction's,
+    // not this one's — so this pass's children are the frame's, and any
+    // zombies deferred at the top are superseded on that same frame. Its
+    // commit rides the transaction, not this flush: release them here rather
+    // than let two generations render at once.
+        let D = G && (!t || p !== null || (e.S & STATUS_PENDING) !== 0);
+    if (D && (!e.Ge || l)) queuePendingNode(e); else if (D && activeTransition === null && !(e.S & (STATUS_PENDING | STATUS_UNINITIALIZED))) {
+        D = false;
+        disposeChildren(e, false, true);
+    }
+    if (D) e.T |= CONFIG_HELD_CHILDREN; else e.T &= ~CONFIG_HELD_CHILDREN;
+    // (A born-held pass IS the transaction's staged view — nothing to refresh.)
+        if (e.Ge && n && activeTransition !== e.Ge && p === null) {
+        // The re-run refreshes the transaction's STAGED view (_pendingValue); the
+        // value this pass published in _value belongs to the run that just
+        // finished. Keep that ownership, or the effect phase parks a
+        // mainline-computed value with the transaction (#3412).
+        const t = e.It;
+        runInTransition(e.Ge, () => recompute(e));
+        e.It = t;
+    }
     // Missed-wake reschedule (see the finally above): values this pass read
     // before the nested commit are stale, so run again now that the heap will
     // accept the node. Equality gates stop same-value landings from cascading,
@@ -400,23 +609,23 @@ function updateIfNecessary(e) {
     // (#3037); readers meanwhile serve the values the pass has so far.
     // Never recompute a DISPOSED node either: recompute rewrites _flags and
     // would resurrect it (#2983) — readers serve its last value.
-    if (e.ie & (REACTIVE_RECOMPUTING_DEPS | REACTIVE_DISPOSED)) return;
-    if (e.ie & REACTIVE_CHECK) {
-        for (let t = e.lt; t; t = t.ot) {
-            const n = t.st;
-            const i = n.rt || n;
-            if (i.oe) {
+    if (e.ue & (REACTIVE_RECOMPUTING_DEPS | REACTIVE_DISPOSED)) return;
+    if (e.ue & REACTIVE_CHECK) {
+        for (let t = e.Se; t; t = t.de) {
+            const n = t.Ee;
+            const i = n.Te || n;
+            if (i.ce) {
                 updateIfNecessary(i);
             }
-            if (e.ie & REACTIVE_DIRTY) {
+            if (e.ue & REACTIVE_DIRTY) {
                 break;
             }
         }
     }
-    if (e.ie & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.o?._ && e.Te < clock && !e.o?.Ie) {
+    if (e.ue & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.o?._ && e.Pe < clock && !e.o?.Re) {
         recompute(e);
     }
-    e.ie = e.ie & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
+    e.ue = e.ue & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
 }
 
 function computed(e, t) {
@@ -425,45 +634,53 @@ function computed(e, t) {
     // `T | undefined` node is a real commit #0. The typeof guard tolerates
     // non-object option values that older call shapes force through `as any`.
         const i = t !== null && typeof t === "object" && "loadingValue" in t;
-    const u = {
+    // Two literals, one per tier, selected at build time (the observe flag is
+    // a literal after replacement; the untaken branch is dead code). The observe
+    // literal is the prod literal plus its `_name` slot — a slot in the
+    // boilerplate, because a post-construction `self._name = …` forces a
+    // hidden-class transition and an out-of-object property store on EVERY node
+    // (measured: the whole of the observe tier's creation overhead). Keep the
+    // two in sync — the dist artifact test pins observe's key set to prod's
+    // plus `_name`.
+        const l = {
         id: inheritId(t, n, context),
-        T: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.H ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        pe: t?.equals ?? isEqual,
-        Ge: null,
+        T: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.Z ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        Fe: t?.equals ?? isEqual,
+        ke: null,
         C: context?.C ?? globalQueue,
-        we: context?.we ?? defaultContext,
-        je: 0,
-        oe: e,
-        be: i ? t.loadingValue : undefined,
-        qe: 0,
-        _t: undefined,
-        ct: null,
-        lt: null,
-        Be: null,
-        ze: 0,
+        ze: context?.ze ?? defaultContext,
+        ut: 0,
+        ce: e,
+        Qe: i ? t.loadingValue : undefined,
+        tt: 0,
+        At: undefined,
+        Rt: null,
+        Se: null,
+        ot: null,
+        Ze: 0,
         u: null,
-        ft: null,
-        Le: context,
-        We: null,
-        It: null,
-        Qe: null,
-        ie: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
+        Gt: null,
+        _parent: context,
+        $e: null,
+        Dt: null,
+        Xe: null,
+        ue: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
         // A loadingValue node is born committed: commit #0 is already in _value.
         S: i ? 0 : STATUS_UNINITIALIZED,
-        Te: clock,
-        Re: NOT_PENDING,
-        Ae: null,
-        Et: -1,
-        Ne: i,
+        Pe: clock,
+        ve: NOT_PENDING,
+        Ge: null,
+        ht: -1,
+        ge: i,
         // Cold machinery (async/transition/optimistic/verdict slots) lives one
         // hop away in the lazily-allocated extension — the core literal MUST
         // stay under V8's in-object boundary (§12: past ~39 fields every
         // allocation spills to a backing store and creation cost ~4x's).
         o: null
     };
-    if (t?.unobserved) ext(u).Nt = t.unobserved;
-    setupComputedNode(u, t);
-    return u;
+    if (t?.unobserved) ext(l).Pt = t.unobserved;
+    setupComputedNode(l, t);
+    return l;
 }
 
 /** Lazily allocate a node's cold extension (ONE shape for signals and
@@ -471,26 +688,29 @@ function computed(e, t) {
  * this; hot paths read `el._x?._field` gated by the _config presence bits.
  * Never call ext() just to store a field's default. */ function ext(e) {
     return e.o ??= {
-        Pe: undefined,
-        Tt: undefined,
-        $e: undefined,
-        ye: undefined,
         Ce: undefined,
-        St: undefined,
+        Ft: undefined,
+        Ct: 0,
+        gt: NOT_PENDING,
+        vt: 0,
+        Ue: undefined,
+        je: undefined,
+        xe: undefined,
+        Ht: undefined,
         t: 0,
-        Ie: null,
-        Ee: null,
+        Re: null,
+        Ae: null,
         _: undefined,
-        fe: undefined,
-        le: undefined,
+        Ie: undefined,
+        ae: undefined,
         h: undefined,
-        De: false,
+        be: false,
         i: null,
-        Nt: undefined,
-        Ye: undefined,
-        Ze: null,
-        Ke: null,
-        dt: undefined
+        Pt: undefined,
+        nt: undefined,
+        it: null,
+        lt: null,
+        bt: undefined
     };
 }
 
@@ -499,43 +719,49 @@ function computed(e, t) {
  * so V8 sees the full hidden class shape at construction time. Effects always run in lazy
  * mode (recompute is called explicitly by `effect()`), so we hardcode the lazy bits and skip
  * the auto-dispose CONFIG bit (effect() previously cleared it post-construction).
- */ function createEffectNode(e, t, n, i, u) {
-    const l = u?.transparent ?? false;
-    const o = {
-        id: inheritId(u, l, context),
-        T: (l ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (u?.At ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        pe: false,
-        Ge: null,
+ */ function createEffectNode(e, t, n, i, l) {
+    const u = l?.transparent ?? false;
+    // Prod and observe boilerplates — see computed() for why the observe tier
+    // gets its `_name` as a literal slot rather than a write after the fact.
+    // The default label is the node kind (tracked effects relabel their computed
+    // in trackedEffect); the wrappers in signals.ts no longer spread a name into
+    // the options to get it.
+        const o = {
+        id: inheritId(l, u, context),
+        T: (u ? CONFIG_TRANSPARENT : 0) | (l?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (l?.sync ? CONFIG_SYNC : 0) | (l?.kt ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        Fe: false,
+        ke: null,
         C: context?.C ?? globalQueue,
-        we: context?.we ?? defaultContext,
-        je: 0,
-        oe: e,
-        be: undefined,
-        qe: 0,
-        _t: undefined,
-        ct: null,
-        lt: null,
-        Be: null,
-        ze: 0,
+        ze: context?.ze ?? defaultContext,
+        ut: 0,
+        ce: e,
+        Qe: undefined,
+        tt: 0,
+        At: undefined,
+        Rt: null,
+        Se: null,
+        ot: null,
+        Ze: 0,
         u: null,
-        ft: null,
-        Le: context,
-        We: null,
-        It: null,
-        Qe: null,
-        ie: REACTIVE_LAZY,
+        Gt: null,
+        _parent: context,
+        $e: null,
+        Dt: null,
+        Xe: null,
+        ue: REACTIVE_LAZY,
         S: STATUS_UNINITIALIZED,
-        Te: clock,
-        Re: NOT_PENDING,
-        Ae: null,
-        Et: -1,
-        Ne: false,
-        He: false,
-        Ot: undefined,
-        Ct: t,
-        Rt: n,
-        Gt: undefined,
-        ge: i,
+        Pe: clock,
+        ve: NOT_PENDING,
+        Ge: null,
+        ht: -1,
+        ge: false,
+        Ye: false,
+        Ut: undefined,
+        Lt: t,
+        Vt: n,
+        yt: undefined,
+        Le: i,
+        It: null,
         o: null
     };
     // Effects dispatch status through the SHARED notifier (statusNotifierOf,
@@ -543,7 +769,7 @@ function computed(e, t) {
     // allocation on EVERY effect at creation (an alloc + 19 field stores,
     // +23% effect creation, caught by the creation benches). Only genuinely
     // per-node channels (boundaries) live on _x.
-        if (u?.unobserved) ext(o).Nt = u.unobserved;
+        if (l?.unobserved) ext(o).Pt = l.unobserved;
     setupComputedNode(o, lazyOptions);
     return o;
 }
@@ -566,7 +792,7 @@ function setEffectStatusNotify(e) {
  * per-node field did when every effect carried one. */ function statusNotifierOf(e) {
     const t = e.o?.h;
     if (t !== undefined) return t;
-    return e.ge ? effectStatusNotify ?? undefined : undefined;
+    return e.Le ? effectStatusNotify ?? undefined : undefined;
 }
 
 const lazyOptions = {
@@ -574,24 +800,24 @@ const lazyOptions = {
 };
 
 function setupComputedNode(e, t) {
-    e.ct = e;
-    const n = context?.Dt ? context.Pt : context;
+    e.Rt = e;
+    const n = context?.xt ? context.Qt : context;
     if (context) {
-        const t = context.Qe;
+        const t = context.Xe;
         if (t === null) {
-            context.Qe = e;
+            context.Xe = e;
         } else {
-            e.We = t;
-            t.It = e;
-            context.Qe = e;
+            e.$e = t;
+            t.Dt = e;
+            context.Xe = e;
         }
     }
-    if (n) e.qe = n.qe + 1;
-    if (GlobalQueue.Ft !== null) GlobalQueue.Ft(e);
+    if (n) e.tt = n.tt + 1;
+    if (GlobalQueue.wt !== null) GlobalQueue.wt(e);
     !t?.lazy && recompute(e, true);
     if (snapshotCaptureActive && !t?.lazy) {
         if (!(e.S & STATUS_PENDING) && !(e.T & CONFIG_NO_SNAPSHOT)) {
-            ext(e).Ye = e.be === undefined ? NO_SNAPSHOT : e.be;
+            ext(e).nt = e.Qe === undefined ? NO_SNAPSHOT : e.Qe;
             e.T |= CONFIG_HAS_SNAPSHOT;
             snapshotSources.add(e);
         }
@@ -599,32 +825,34 @@ function setupComputedNode(e, t) {
 }
 
 function signal(e, t, n = null) {
+    // Prod and observe boilerplates — see computed(). The observe literal adds
+    // `_name` and `_owner` (the creating owner, stamped by registerGraph for
+    // createSignal nodes so ownerPath can locate signal subjects; null here,
+    // and staying null on internal signals — one shape either way).
     const i = {
-        pe: t?.equals ?? isEqual,
-        T: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.H ? CONFIG_NO_SNAPSHOT : 0),
-        be: e,
+        Fe: t?.equals ?? isEqual,
+        T: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.Z ? CONFIG_NO_SNAPSHOT : 0),
+        Qe: e,
         u: null,
-        ft: null,
-        Te: clock,
-        rt: n,
-        Se: n?.o?.i || null,
-        Re: NOT_PENDING,
+        Gt: null,
+        Pe: clock,
+        Te: n,
+        De: n?.o?.i || null,
+        Mt: null,
+        ve: NOT_PENDING,
         // Signal-literal diet (§12e): NO _time/_fn/_statusFlags slots. Stores
         // materialize one signal per touched leaf, so signal bytes are store
         // bytes. _time is write-only on signals (every read site is computed-
         // typed error-retry gating); _fn/_statusFlags read falsy-identically as
         // missing properties on the shared paths (undefined masks to 0).
-        Ae: null,
-        Et: -1,
+        Ge: null,
+        ht: -1,
         o: null
     };
-    if (t?.unobserved) ext(i).Nt = t.unobserved;
-    if (n) {
-        ext(n).i = i;
-        n.T |= CONFIG_FW_CHILDREN;
-    }
+    if (t?.unobserved) ext(i).Pt = t.unobserved;
+    if (n) linkFirewallChild(n, i);
     if (snapshotCaptureActive && !(i.T & CONFIG_NO_SNAPSHOT) && !((n?.S ?? 0) & STATUS_PENDING)) {
-        ext(i).Ye = e === undefined ? NO_SNAPSHOT : e;
+        ext(i).nt = e === undefined ? NO_SNAPSHOT : e;
         i.T |= CONFIG_HAS_SNAPSHOT;
         snapshotSources.add(i);
     }
@@ -649,34 +877,66 @@ function signal(e, t, n = null) {
     slotUnobservedHook = e;
 }
 
-function slotSignal(e, t, n, i, u, l = null) {
+/** Push a new node onto its firewall's child chain (the literal already
+ * points `_nextChild` at the old head). Doubly linked so a released leaf
+ * unlinks in O(1) — the chain is walked per mark of the projection and
+ * would otherwise grow by one node per leaf ever read (#3351). */ function linkFirewallChild(e, t) {
+    const n = t.De;
+    if (n !== null) n.Mt = t;
+    ext(e).i = t;
+    e.T |= CONFIG_FW_CHILDREN;
+}
+
+/** Release a firewall child the store no longer addresses (unobserved sweep
+ * dropped it from its target's cache): unlink it from the chain so the
+ * projection stops retaining it and its last value. The node keeps its own
+ * `_nextChild` so a walk that is mid-chain on it still terminates. It also
+ * leaves `_companionChildren` (#3503): the companions themselves are
+ * permanent on the node, but the node is unreachable through the store, so
+ * the set would only retain it and its last value. */ function unlinkFirewallChild(e) {
+    const t = e;
+    const n = t.Te;
+    if (!n) return;
+    const i = t.Mt;
+    const l = t.De;
+    if (i !== null) i.De = l; else if (n.o.i === t) n.o.i = l;
+    if (l !== null) l.Mt = i;
+    t.Mt = null;
+    // #3503: the companion set is the last projection-side reference to a
+    // released leaf; leaving it there kept the leaf and its last value alive
+    // for the projection's lifetime after every latest()/isPending() reader
+    // was disposed.
+        n.o.bt?.delete(t);
+}
+
+function slotSignal(e, t, n, i, l, u = null) {
+    // Prod and observe boilerplates — see computed(). The store relabels the
+    // observe slot (`store.<key>`) when the attribution engine is installed.
     const o = {
-        pe: t,
+        Fe: t,
         T: CONFIG_OWNED_WRITE | CONFIG_SLOT_NODE,
-        be: e,
+        Qe: e,
         u: null,
-        ft: null,
-        Te: clock,
-        rt: l,
-        Se: l?.o?.i || null,
-        Re: NOT_PENDING,
-        Ae: null,
-        Et: -1,
+        Gt: null,
+        Pe: clock,
+        Te: u,
+        De: u?.o?.i || null,
+        Mt: null,
+        ve: NOT_PENDING,
+        Ge: null,
+        ht: -1,
         o: null,
         // Slot backrefs: what the equals/unobserved closures used to capture.
-        ht: n,
-        Ht: i,
+        Wt: n,
+        qt: i,
         // Store read-path caches, pre-shaped (were post-construction expandos).
-        acc: u,
+        acc: l,
         px: undefined,
         pxv: undefined
     };
-    if (l) {
-        ext(l).i = o;
-        l.T |= CONFIG_FW_CHILDREN;
-    }
-    if (snapshotCaptureActive && !((l?.S ?? 0) & STATUS_PENDING)) {
-        ext(o).Ye = e === undefined ? NO_SNAPSHOT : e;
+    if (u) linkFirewallChild(u, o);
+    if (snapshotCaptureActive && !((u?.S ?? 0) & STATUS_PENDING)) {
+        ext(o).nt = e === undefined ? NO_SNAPSHOT : e;
         o.T |= CONFIG_HAS_SNAPSHOT;
         snapshotSources.add(o);
     }
@@ -685,14 +945,14 @@ function slotSignal(e, t, n, i, u, l = null) {
 
 function optimisticSignal(e, t) {
     const n = signal(e, t);
-    ext(n).Pe = NOT_PENDING;
+    ext(n).Ce = NOT_PENDING;
     n.T |= CONFIG_OPTIMISTIC;
     return n;
 }
 
 function optimisticComputed(e, t) {
     const n = computed(e, t);
-    ext(n).Pe = NOT_PENDING;
+    ext(n).Ce = NOT_PENDING;
     n.T |= CONFIG_OPTIMISTIC;
     return n;
 }
@@ -723,26 +983,51 @@ function isEqual(e, t) {
  * );
  * ```
  */ function untrack(e, t) {
-    if (GlobalQueue.gt === null && !tracking && true) return e();
+    if (GlobalQueue.Yt === null && !tracking && true) return e();
     const n = tracking;
     tracking = false;
     try {
-        if (GlobalQueue.gt !== null) return GlobalQueue.gt(e);
+        if (GlobalQueue.Yt !== null) return GlobalQueue.Yt(e);
         return e();
     } finally {
         tracking = n;
     }
 }
 
+/**
+ * Set while runtime bookkeeping evaluates a user accessor inside another
+ * node's pass (a loading boundary's `on` key, read from `notify` while the
+ * node that went pending is still recomputing). `context` is that node, but
+ * the read is nobody's: the value is compared, never derived from, so the
+ * untracked-pending re-run link (`read`, `!tracking`) must not be recorded on
+ * it — it made the key's source a dependency of an unrelated async memo
+ * (#3528: `isPending(m2)` through a memo in `on()` linked the memo into `m2`,
+ * a cycle that re-derived `m2` on every pending mark and never converged).
+ */ let spectating = false;
+
+/**
+ * Evaluates `fn` untracked and without recording a dependency for the
+ * untracked-pending re-run rule on the current `context`. For bookkeeping
+ * reads made mid-propagation on behalf of no node — see `spectating`.
+ */ function spectate(e) {
+    const t = spectating;
+    spectating = true;
+    try {
+        return untrack(e);
+    } finally {
+        spectating = t;
+    }
+}
+
 /**
  * Bring a computed to a readable state: lazy/disposed nodes are (re)computed;
  * an isPending() probe (`refresh`) additionally pulls the node fully up to
  * date so its status flags reflect the current graph.
  */ function prepareComputed(e, t) {
-    if (e.ie & REACTIVE_LAZY) {
-        e.ie &= ~REACTIVE_LAZY;
+    if (e.ue & REACTIVE_LAZY) {
+        e.ue &= ~REACTIVE_LAZY;
         recompute(e, true);
-    } else if (e.ie & REACTIVE_DISPOSED) {
+    } else if (e.ue & REACTIVE_DISPOSED) {
         // Two disposal lifecycles share the flag (#3024). Observation-lifecycle
         // nodes (CONFIG_AUTO_DISPOSE) are dormant — torn down by unobserved()
         // when the last subscriber left — and reads reawaken them; that is the
@@ -777,14 +1062,14 @@ function isEqual(e, t) {
  * Pay-for-use: reached through GlobalQueue._notifyAuthoritativeObservers,
  * installed at first until() call — apps that never use until() shake it.
  */ function notifyAuthoritativeObservers(e) {
-    for (let t = e.u; t !== null; t = t.ae) {
-        const e = t.ce;
+    for (let t = e.u; t !== null; t = t.Ne) {
+        const e = t._e;
         if (!(e.T & CONFIG_AUTHORITATIVE_READ)) continue;
         // Missed-wake latch (#3037), same contract as insertSubs: the reader may
         // itself have pulled this recompute (updateIfNecessary from its own
         // read), and the heap refuses RECOMPUTING nodes — latch so recompute's
         // tail reschedules it with the staged value visible.
-                if (e.ie & REACTIVE_RECOMPUTING_DEPS && t.vt === e.ze && t !== e.Be) e.ie |= REACTIVE_MISSED_WAKE;
+                if (e.ue & REACTIVE_RECOMPUTING_DEPS && t.qe === e.Ze && t !== e.ot) e.ue |= REACTIVE_MISSED_WAKE;
         enqueueSub(e);
     }
     schedule();
@@ -795,19 +1080,272 @@ function isEqual(e, t) {
  * before its first read (same late-binding contract as the optimistic engine;
  * the gating bit is only ever set by such a read, so the `!` call sites are
  * safe once every setter installs, #3303). */ function installAuthoritativeRead() {
-    if (GlobalQueue.he === null) GlobalQueue.he = notifyAuthoritativeObservers;
+    if (GlobalQueue.Zt === null) GlobalQueue.Zt = notifyAuthoritativeObservers;
+}
+
+/**
+ * Stale-reader term of the value selections below: a render effect reading a
+ * node some OTHER live transaction has staged sees the committed value. The
+ * commit is silent — the staging walk was the notification — so a reader
+ * that linked AFTER that walk (an effect created during the hold, a store
+ * key first read under it) would show the old value past the reveal: record
+ * it for the transaction's commit replay (the `_gatedSubs` contract lanes
+ * already use). An effect the transaction itself computed re-derives at its
+ * commit on its own (parked run, or the contested re-derive, #3322) and is
+ * not recorded — replaying it too would publish the frame twice.
+ *
+ * Flight twin (the pending-branch carve-out): the reader is served the
+ * node's committed, pre-flight value and now observes that flight — A15:
+ * async work observed by a reader settles as one unit with the writes that
+ * asked it — so it joins the transaction's reporters for the node. The
+ * reporter the transaction recorded when the flight started may be gone (a
+ * keyed remount disposed it, #3374); a completion check that found no live
+ * reporter committed the writes ahead of the answer, tearing the new
+ * reader's frame (`Count: 1` beside `Details: 0`). Joins an entry the
+ * transaction already holds; a flight nobody had observed yet has none (the
+ * reader is its first observer — a conditional that just revealed it, #3458)
+ * and is notified up the reader's own queue chain under that transaction,
+ * the one sanctioned registration site (INV-3): a collecting boundary above
+ * the reader consumes it as it would any pending, an unboundaried reader
+ * opens the entry — and the transaction, judged complete on its other
+ * flights, revealed the inputs beside the reader's pre-flight value
+ * otherwise (`Count: 1 | A: 1` beside `B: 0`). A staged signal or a settled
+ * node registers nothing. Every reporter dies with its reader
+ * (reporterBlocksSource: the read linked it as a dep). The node's own entry
+ * is the only one that can matter: a chain's intermediate memo is re-pulled
+ * by the read (updateIfNecessary's retry) and enters the transaction, so the
+ * reader holds through the normal path; a node with its own flight that is
+ * also pending on an upstream re-ask blocks through that flight until it
+ * lands, and its landing re-runs the reader into the normal path.
+ */
+/** The replay half of the stale-of-foreign clause (A15 / A26): a stale reader
+ * served the committed value because `txn` holds what it read re-runs at
+ * txn's commit, when the value it was denied becomes the frame — unless its
+ * own last value already came from that transaction. One registration for
+ * the node path (heldFromStale) and the store's backing paths, which have
+ * no node to carry the hold (heldFromReader, the adoption hold view). */ function recordStaleReplay(e, t) {
+    const n = t.It;
+    if (n == null || currentTransition(n) !== e) e.ct.add(t);
+}
+
+/**
+ * The ownership relation (DESIGN-CONSOLIDATION §6, ruled 2026-09-17): is
+ * `hold` part of the running pass's world? A plain reader's world is the
+ * transaction it runs under, through merges. A lane reader's world is its
+ * lane AND the transition that owns the lane — the one asymmetry between a
+ * lane and a separate transaction (a lane sees what lands from its parent as
+ * its own; a separate transaction would wait for the parent to settle) —
+ * see `ownsLane` in lanes.ts, built on this. One relation for the
+ * stale-of-foreign clause (heldFromStale), the lane arm (readsHeldCommitted)
+ * and the store's backing holds (foreignHold); `serve` has no lane arm of
+ * its own, the lane's extra visibility lives here.
+ */ function ownsHold(e) {
+    return activeTransition !== null && currentTransition(e) === currentTransition(activeTransition);
+}
+
+function heldFromStale(e, t) {
+    const n = e.Ge;
+    if (n === null || ownsHold(n)) return false;
+    const i = currentTransition(n);
+    recordStaleReplay(i, t);
+    const l = i.oe.get(e);
+    if (l) l.add(t); else if (e.S & STATUS_PENDING) runInTransition(i, () => t.C.notify(t, STATUS_PENDING, STATUS_PENDING, e.o._));
+    return true;
+}
+
+/**
+ * A tracked computation about to be served a live transaction's staged value
+ * derives from that transaction's world, so it enters the transaction and
+ * this pass's result is held with it (A29, #3408). The write side (`setSignal`)
+ * and a stamped node's recompute already enter; a reader that only now
+ * starts reading the held node — a conditional memo whose branch flipped —
+ * was the gap: it published a value derived from the staged world into the
+ * mainline frame. Not for a probe (`isPending(() => x())` observes, it does
+ * not derive) and a no-op for the ambient batch (`_transition` null) or the
+ * transaction already active.
+ */
+/** The transaction a pass running OUTSIDE a flush was served a staged value
+ * from (A29, creation-time form). Inside a flush the pass enters through
+ * initTransition; outside one — a memo or effect created from mainline code
+ * while a hold is live — entering would leave `activeTransition` and the
+ * batch pointed at the transaction for the rest of the synchronous block,
+ * so an unrelated write made after the mount was held with someone else's
+ * action. The entry is the pass's alone: recompute stages the node into the
+ * transaction (born held) and mainline is never touched. */ let stagedEntry = null;
+
+function enterStagedRead(e, t = e.Ge) {
+    if (!t || t === activeTransition || pendingCheckActive) return;
+    // A companion (the latest() shadow, the isPending() verdict signal) is the
+    // engine's mirror of the flushed world — reading it, or being it, is an
+    // observation, not a derivation from the hold: latest(x) never enters x's
+    // transaction, and the shadow's own pass never enters either (it would
+    // flip activeTransition under the reader that pulled it). (`el` is null for
+    // a store backing served under a hold — no node, the transaction is the
+    // fold's.)
+        if (e?.o?.Ht || context?.o?.Ht) return;
+    // Verdict machinery (GlobalQueue._verdictPull: companion creation and the
+    // latest()/isPending() pulls — the latest() shadow is created before it is
+    // marked optimistic, so the bit alone cannot tell) and optimistic nodes
+    // (own lane posture, A31) read staged truth by design; they keep the
+    // entering path.
+    // (`context` is non-null here: every caller selected a value for a reader.)
+        const n = context;
+    if (activeTransition === null && !globalQueue.Kt) {
+        // Verdict pulls are observations, not derivations: a latest() /
+        // isPending() call from mainline must never enter a transaction (it
+        // would capture the rest of the caller's synchronous block).
+        if (GlobalQueue.jt) return;
+        if (n.ue & REACTIVE_RECOMPUTING_DEPS && !(n.T & CONFIG_OPTIMISTIC) && (stagedEntry === null || stagedEntry === t)) {
+            stagedEntry = t;
+            return;
+        }
+    }
+    globalQueue.initTransition(t);
+}
+
+/**
+ * Rule 1 (value selection), the full arm: does this reader see a STAGED
+ * node's COMMITTED value? One implementation of the rule the fast paths
+ * (readNodeFast, read's fast block) carry as their trivial ternary and that
+ * every slow site — read's tail, the store's backing selection, the lane and
+ * verdict arms — used to restate by hand (docs/DESIGN-CONSOLIDATION.md, move 3b). In order:
+ * - no reader at all (an untracked read) — the committed frame;
+ * - a reader under an optimistic lane the engine says reads committed
+ *   (laneReadsCommitted: another lane's hold, #3460);
+ * - nothing staged;
+ * - a children-forbidden reader (createTrackedEffect / onSettled: the frame,
+ *   never the graph — A32);
+ * - a stale reader (render effect) of a FOREIGN transaction's staged write —
+ *   committed, no entanglement (heldFromStale registers the replay; a node
+ *   born held has no committed frame to fall back to, `noCommitted`);
+ * - A17 for HELD truth (#3164, CONFIG_HELD_TRUTH): staged confirming truth —
+ *   fold-staged onto an armed family, or entangle-stolen by an awaited
+ *   until() — is masked from ordinary readers until its transaction's
+ *   reveal, the retaining transaction's own speculative recomputes included
+ *   (partial override coverage would otherwise compose override + staged
+ *   truth into a state no timeline contains). Authoritative readers
+ *   (until()'s predicate) and latest() see the staged truth — the tunnel that
+ *   keeps the hold deadlock-free.
+ * False means the reader derives from the staged value and enters its
+ * transaction (enterStagedRead, A29).
+ */ function readerSeesCommitted(e, t, n, i) {
+    return !!(!t || currentOptimisticLane !== null && GlobalQueue.Bt(e, n, t) || e.ve === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && !i && heldFromStale(e, t) || e.T & CONFIG_HELD_TRUTH && !latestReadActive && !(t.T & CONFIG_AUTHORITATIVE_READ));
+}
+
+/** A28 — set when a node is staged (queuePendingNode) or a held node rewritten
+ * (stashHeldRewrite) OUTSIDE a flush; cleared when the next flush begins. The
+ * read sites test this one module boolean instead of `globalQueue._running`:
+ * inside a flush it is false and the A28 arm costs nothing; outside, only a
+ * tick with unflushed writes pays the staged-node check. */ let unflushedStaged = false;
+
+function markUnflushedStaged() {
+    unflushedStaged = true;
+}
+
+/** A28 — a write becomes visible at flush. Outside a flush, a node holding an
+ * AMBIENT staged value (no transaction stamp) was written since the last
+ * flush: ambient staging commits at flush end, so nothing else leaves a node
+ * in this state; a stamped value is the flushed held world, which A28 says
+ * latest() serves. Inside a flush the rule does not apply (A28 (4): promoted
+ * within the round). Structural — no marker on the write path. */ function unflushed(e) {
+    return unflushedValue(e) !== NOT_PENDING;
+}
+
+/** The value an unflushed node serves — the committed value for an ambient
+ * write, the flushed staged value for a rewrite of a held node — or
+ * NOT_PENDING when nothing is unflushed. Exempt: owned-write nodes (A28 (4):
+ * a write issued inside a recompute is promoted at that recompute's end —
+ * boundary and loading machinery, until()'s internals, signals declared for
+ * in-computation writes) and engine companions (the isPending() verdict
+ * signal, the latest() shadow: the system's own writes, made at the source's
+ * write to mirror it, installing eagerly — A28, A8). */ function unflushedValue(e, t = e.Qe) {
+    if (globalQueue.Kt || e.ve === NOT_PENDING || e.T & CONFIG_PROMOTED || e.o?.Ht) return NOT_PENDING;
+    // Ambient, or adopted by a transaction before any flush carried the staging
+    // (CONFIG_ADOPTED_UNFLUSHED): nothing flushed is staged — the committed
+    // value answers (the caller's notion of committed: a store node's backing).
+    // A held node: unflushed only if rewritten since the last flush (stash).
+        if (e.Ge === null || e.T & CONFIG_ADOPTED_UNFLUSHED) return t;
+    return e.o === null ? NOT_PENDING : e.o.gt;
+}
+
+/** Held nodes rewritten since the last flush (setSignal); the flush clears
+ * their stash — from then on latest() answers with the rewrite. */ const unflushedRewrites = [];
+
+/** Nodes written inside a creation-time recompute (CONFIG_PROMOTED). */ const promotedWrites = [];
+
+/** A28 (5): an optimistic write becomes the ACTIVE override at the flush that
+ * carries it. `_overrideTime` is stamped with `clock` at the write and `clock`
+ * advances after every flush, so "this tick, outside a flush" is unflushed. */ function unflushedOverride(e) {
+    // Companions are optimistic signals written by the engine (see unflushed).
+    return !globalQueue.Kt && e.o?.Ct === clock && !e.o?.Ht;
+}
+
+/** Active optimistic override on an armed node (an armed slot idles at
+ * NOT_PENDING; undefined = unarmed plain node). The writer's own channels —
+ * the draft, `in`/keys inside the setter — compose on this regardless of
+ * flush state. */ function hasActiveOverride(e) {
+    const t = e.o;
+    return t !== null && t.Ce !== undefined && t.Ce !== NOT_PENDING;
+}
+
+/** The override a READER sees: installed, and carried by a flush (A28 (5) —
+ * an optimistic write is a write; until its flush no reader sees it). One
+ * implementation for read()'s override arm, the verdict channels
+ * (latestRead, computePendingState) and the store's selection
+ * (docs/DESIGN-CONSOLIDATION.md, move 3b). */ function visibleOverride(e) {
+    return hasActiveOverride(e) && !unflushedOverride(e);
+}
+
+/** A derivation served the committed value because of an unflushed write
+ * (A28) must run again in the flush that carries it — the late-linker case
+ * (#3337's reason to defer the walk): it linked after the write walked. */ function markLateLinker(e) {
+    // The pass's own tail re-enqueues on this latch (recompute's finally) —
+    // a direct enqueue here would be wiped by the pass's flag reset.
+    e.ue |= REACTIVE_MISSED_WAKE;
+    return true;
+}
+
+/** Companion-bearing nodes written outside a flush (setSignal); the flush
+ * that carries their writes re-syncs their companions (A28). */ const unflushedCompanions = [];
+
+function resyncUnflushedCompanions() {
+    unflushedStaged = false;
+    // Length-guarded: the common flush has nothing here, and must allocate nothing.
+    // Length-guarded: the common flush has nothing here and allocates nothing.
+        if (unflushedRewrites.length !== 0) {
+        for (const e of unflushedRewrites) e.o.gt = NOT_PENDING;
+        unflushedRewrites.length = 0;
+    }
+    if (promotedWrites.length !== 0) {
+        for (const e of promotedWrites) e.T &= ~CONFIG_PROMOTED;
+        promotedWrites.length = 0;
+    }
+    if (unflushedCompanions.length !== 0) {
+        for (const e of unflushedCompanions) GlobalQueue.me(e, e.ve !== NOT_PENDING ? e.ve : e.Qe);
+        unflushedCompanions.length = 0;
+    }
 }
 
 function readNodeFast(e) {
-    if (latestReadActive || pendingCheckActive || e.oe || e.rt || e.o?.Pe !== undefined || e.o?.Ye !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
+    if (latestReadActive || pendingCheckActive || e.ce || e.Te || e.o?.Ce !== undefined || e.o?.nt !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || 
+    // A28: a staged node read outside a flush may serve its committed value;
+    // that arm lives on the slow path so this body stays inlinable.
+    unflushedStaged && e.ve !== NOT_PENDING || false) return READ_SLOW;
     let t = context;
-    if (t?.Dt) t = t.Pt;
+    if (t?.xt) t = t.Qt;
     if (t && tracking) link(e, t);
     // Children-forbidden readers (createTrackedEffect / onSettled callbacks) get
     // committed visibility: like the effect half of createEffect and event
     // handlers, effect-phase code never observes its own unsettled write — the
     // write lands in the same flush's continuation (#3006).
-        return !t || e.Re === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Re;
+    // A stale reader (render effect) recomputing with no transaction active is
+    // mainline: a write staged by a live transaction (`_transition` stamped —
+    // ambient staging never is) stays masked until that transaction's reveal,
+    // the same rule the slow path applies (#3322). Without it a zombie
+    // recompute, or a commit-time re-derive of a contested effect, published
+    // another transaction's uncommitted value.
+        return !t || e.ve === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && heldFromStale(e, t) ? e.Qe : (enterStagedRead(e), 
+    e.ve);
 }
 
 function read(e) {
@@ -815,33 +1353,36 @@ function read(e) {
     // Checked before isPending so that isPending(() => latest(x)) checks
     // the _pendingSignal of _latestValueComputed (async in flight) rather
     // than the original node (which stays "pending" while held in a transition).
-    if (latestReadActive) return GlobalQueue.Vt(e);
+    if (latestReadActive) return GlobalQueue.zt(e);
     let t = context;
-    if (t?.Dt) t = t.Pt;
+    if (t?.xt) t = t.Qt;
     const n = e;
-    const i = e.rt;
-    const u = i || e;
+    const i = e.Te;
+    const l = i || e;
     // Handle isPending() mode: collect pending state while preserving normal read semantics.
     // Probe mode is suspended while preparing the node so nested reads during a
     // recompute don't collect into the probe.
         if (pendingCheckActive) {
-        GlobalQueue.bt(e, t, u, i);
-    } else if (typeof n.oe === "function") {
+        GlobalQueue.Jt(e, t, l, i);
+    } else if (typeof n.ce === "function") {
         prepareComputed(e, false);
     }
-    if (!n.oe && u === e && e.o?.Pe === undefined && e.o?.Ye === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
+    if (!n.ce && l === e && e.o?.Ce === undefined && e.o?.nt === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && (!unflushedStaged || e.ve === NOT_PENDING) && // A28, see readNodeFast
+    true) {
         if (t && tracking) link(e, t);
-        // Committed visibility for children-forbidden readers — see readNodeFast.
-                return !t || e.Re === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Re;
+        // Committed visibility for children-forbidden readers and for stale
+        // readers of a foreign transaction's staged write — see readNodeFast.
+                return !t || e.ve === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && heldFromStale(e, t) ? e.Qe : (enterStagedRead(e), 
+        e.ve);
     }
     if (t && tracking) {
         link(e, t, pendingCheckActive);
-        if (u.oe) {
+        if (l.ce) {
             const n = queueFor(e);
-            if (u.qe >= n.Me) {
+            if (l.tt >= n.et) {
                 markNode(t);
                 markHeap(n);
-                updateIfNecessary(u);
+                updateIfNecessary(l);
             }
             // Fresh-pull readers (awaitable refresh's waiter) recompute a dirty
             // source inline even when the height gate defers to the flush: the
@@ -849,66 +1390,106 @@ function read(e) {
             // never read the PRE-re-ask value as settled. Self-guarded: a clean
             // node no-ops and updateIfNecessary refuses disposed nodes (#2983) —
             // a dead target serves its last value, which is already quiescent.
-             else if (t.T & CONFIG_FRESH_READ) updateIfNecessary(u);
-            const i = u.qe;
+             else if (t.T & CONFIG_FRESH_READ) updateIfNecessary(l);
+            const i = l.tt;
             // parent check is shallow, might need to be recursive
-                        if (i >= t.qe && e.Le !== t) {
-                t.qe = i + 1;
+                        if (i >= t.tt && e._parent !== t) {
+                t.tt = i + 1;
             }
         }
     }
-    if (u.S & STATUS_PENDING) {
-        if (t && !(stale && u.Ae && activeTransition !== u.Ae)) {
+    if (l.S & STATUS_PENDING) {
+        // A reader landing on a pending node throws — the reveal that discovered
+        // the flight holds on it (A15: observed async settles as one unit) — with
+        // one carve-out: a stale (render) reader of a node pending in some OTHER
+        // transaction keeps showing the node's committed value, no entanglement
+        // (parallel transactions; the reader is recorded for that transaction's
+        // commit replay, `heldFromStale`). The carve-out is sound only while the
+        // committed value is coherent with the visible frame, i.e. while the
+        // flight's inputs are themselves unpublished: the stamp alone does not
+        // say so (it is pending-node bookkeeping), so it is refused when the
+        // inputs are on screen — committed by a batch that left the flight in
+        // the air (CONFIG_INPUTS_PUBLISHED, #3305) or revealed through a lane
+        // (optimistic / latest, #3334) — and the reader holds instead. An
+        // UNINITIALIZED node has no committed value to show and holds too
+        // (firewall-backed store reads always did; plain memos since the #3043
+        // port): falling through served `undefined` as if settled and stranded
+        // the reader outside both transactions, so it never re-ran.
+        if (t && !(stale && !(l.S & STATUS_UNINITIALIZED) && !(l.T & CONFIG_INPUTS_PUBLISHED) && !(l.T & CONFIG_HAS_LANE && GlobalQueue.Xt(l)) && heldFromStale(l, t))) {
             // Per-lane suspension lives with the engine (a non-null lane implies it
             // is installed): under a lane, only same-lane pending async without an
             // active override throws — plus uninitialized sources regardless of
             // lane (#3276); that check rides laneSuspends so floor bundles don't
             // pay for it.
-            if (currentOptimisticLane === null || GlobalQueue.kt(u)) {
-                if (!tracking && e !== t) link(e, t);
-                throw u.o?._;
+            if (currentOptimisticLane === null || GlobalQueue.$t(l)) {
+                // An untracked read of a pending node still re-runs its reader when
+                // the node settles — unless nobody is reading (`spectating`, #3528)
+                // or the reader is the node itself.
+                if (!tracking && !spectating && e !== t) link(e, t);
+                throw l.o?._;
             }
-        } else if (t && u.S & STATUS_UNINITIALIZED) {
-            // A stale (render) reader of a node held pending in ANOTHER transition
-            // normally keeps showing the node's committed value instead of
-            // entangling the two transactions — but an uninitialized node has no
-            // committed value to show. Suspend on it (firewall-backed store reads
-            // always took this branch; plain memos now do too): the reader
-            // registers as a reporter of that source, and its pending-node stamp
-            // ties it to the active transaction, so the two transactions merge
-            // when the source settles. Falling through served `undefined` as if
-            // settled and stranded the reader outside both transactions, so it
-            // never re-ran when either landed (#3043 port).
-            if (!tracking && e !== t) link(e, t);
-            throw u.o?._;
-        } else if (!t && u.S & STATUS_UNINITIALIZED) {
-            throw u.o?._;
+        } else if (!t && l.S & STATUS_UNINITIALIZED) {
+            throw l.o?._;
         }
     }
     // `owner` is the computed itself, or the firewall behind a store node —
     // firewall-backed reads follow the same rules (memo parity, #2897 ruling):
     // an errored derive throws for every late reader instead of silently
     // serving node values (the seed, or last-good data after a failed refetch).
-        if (u.oe && u.S & STATUS_ERROR) {
+        if (l.ce && l.S & STATUS_ERROR) {
         // Only a genuine reactive re-read may retry an errored async source:
         // - tracking: owned/tracked scope only (never events / `untrack` / effect side-effect phase)
         // - !pendingCheckActive: an `isPending` probe observes the error, never refetches
         // - owner._time < clock: only on a later cycle than the one the error was found
-        if (tracking && !pendingCheckActive && u.Te < clock) {
-            recompute(u);
+        if (tracking && !pendingCheckActive && l.Pe < clock) {
+            recompute(l);
             return read(e);
-        } else throw u.o?._;
+        } else throw l.o?._;
     }
     if (snapshotCaptureActive && t && t.T & CONFIG_IN_SNAPSHOT_SCOPE) {
-        const n = e.o?.Ye;
+        const n = e.o?.nt;
         if (n !== undefined) {
             const i = n === NO_SNAPSHOT ? undefined : n;
-            const u = e.Re !== NOT_PENDING ? e.Re : e.be;
-            if (u !== i) t.ie |= REACTIVE_SNAPSHOT_STALE;
+            const l = e.ve !== NOT_PENDING ? e.ve : e.Qe;
+            if (l !== i) t.ue |= REACTIVE_SNAPSHOT_STALE;
             return i;
         }
     }
-    if (e.o?.Pe !== undefined && e.o?.Pe !== NOT_PENDING) {
+    const u = serve(e, t, l, e.Qe);
+    if (!t && l === e && typeof n.ce === "function" && e.T & CONFIG_AUTO_DISPOSE && !(l.S & STATUS_PENDING) && !e.u && 
+    // An untracked read served a visible override returned before this
+    // sweep registration when the arm was inline; keep that.
+    !visibleOverride(e)) {
+        // Deferred, not inline (#3078): an inline unobserved() here made untracked
+        // reads destructive — dispose on this read, full revival recompute on the
+        // next — so consecutive reads could answer differently with no write in
+        // between (the revival samples the ambient transition/lane context).
+        // The sweep at flush finalization re-validates and reclaims; schedule()
+        // guarantees that flush happens even if nothing else is queued.
+        dormantNodes.add(e);
+        schedule();
+    }
+    return u;
+}
+
+/**
+ * Rule 1, the one slow implementation (DESIGN-CONSOLIDATION move 3b, step
+ * 6c): the value a reader `c` (null = untracked, no pass) is served from
+ * `el`, whose committed value is `committed` — the node's own `_value` for
+ * a signal or memo, the BACKING for a store property node (single-home rule,
+ * O6: committed truth lives in the backing and a node's `_value` is never
+ * served for one). Called by read()'s slow tail and by the store's untracked
+ * node path (nodeValue); the fast paths (readNodeFast, read's fast block)
+ * keep their trivial ternary by design (perf, see the doc). Arms, in order:
+ * - the override (A17), routed through the engine for a tracked reader under
+ *   a lane or a supersession (A18), an authoritative reader marked instead;
+ * - the lane entanglement gate (committed, recorded for replay);
+ * - a node born held has nothing for an untracked reader (A19 exception 1);
+ * - an unflushed write serves committed and re-runs the reader in the
+ *   carrying flush (A28);
+ * - readerSeesCommitted, else the staged value and the transaction (A29).
+ */ function serve(e, t, n, i) {
+    if (hasActiveOverride(e)) {
         // A17: the override IS the value for every reader — except an authoritative
         // reader (until()'s predicate carries CONFIG_AUTHORITATIVE_READ): it must
         // observe independently-arriving truth, and serving it the caller's own
@@ -919,7 +1500,19 @@ function read(e) {
         // authoritative — optimism never lives there); the sticky mark makes the
         // A17-silent "landing equals override" paths notify this node's subs so
         // the reader re-runs when truth arrives.
-        if (!(t && t.T & CONFIG_AUTHORITATIVE_READ)) return unwrapOverride(e.o?.Pe);
+        // A28 (5): an optimistic write written this tick, outside a flush, is not
+        // yet the active override — fall through to the normal selection (the
+        // authoritative mark below still applies: until() must wake on landing).
+        if (!(t && t.T & CONFIG_AUTHORITATIVE_READ) && !unflushedOverride(e)) {
+            // A tracked read of an override is the engine's selection (a lane or a
+            // supersession implies the engine): a render effect OFF the override's
+            // held lane sees the committed value (#3460, lanes mirror transitions);
+            // a node whose own source answered with a DIFFERENT value hands a
+            // tracked reader the staged truth (A18 supersession, #3331). Untracked
+            // reads display the override.
+            if (t && e.T & (CONFIG_HAS_LANE | CONFIG_OVERRIDE_SUPERSEDED)) return GlobalQueue.en(e, t);
+            return unwrapOverride(e.o?.Ce);
+        }
         e.T |= CONFIG_AUTHORITATIVE_OBSERVED;
     }
     // Entanglement gate: a reader recomputing under an optimistic lane that reads
@@ -929,8 +1522,8 @@ function read(e) {
     // _pendingValue for correct fetching. The sub is recorded for replay at commit
     // so it re-runs with the new committed view. (Gate details live with the
     // engine — a non-null lane implies it is installed.)
-        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.Ut(e, u, t)) {
-        return e.be;
+        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.tn(e, n, t)) {
+        return i;
     }
     // In optimistic lane context, return _value for optimistic/lane-assigned signals
     // and for regular signals in stale mode (render effects). Non-stale readers (user
@@ -938,64 +1531,110 @@ function read(e) {
     // (The lane-context clause lives with the engine.) Children-forbidden readers
     // (createTrackedEffect / onSettled callbacks) get committed visibility — see
     // readNodeFast (#3006).
-        const l = !t || currentOptimisticLane !== null && GlobalQueue.xt(e, u, t) || e.Re === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && e.Ae && activeTransition !== e.Ae || 
-    // A17 for HELD truth (#3164, see CONFIG_HELD_TRUTH): staged confirming
-    // truth — fold-staged onto an armed family, or entangle-stolen by an
-    // awaited until() — is masked from ordinary readers until its
-    // transaction's reveal; the retaining transaction's own speculative
-    // recomputes included (partial override coverage would otherwise
-    // compose override + staged truth into a state no timeline contains).
-    // Authoritative readers (until()'s predicate) and latest() see the
-    // staged truth — the tunnel that keeps the hold deadlock-free.
-    e.T & CONFIG_HELD_TRUTH && !latestReadActive && !(t.T & CONFIG_AUTHORITATIVE_READ) ? e.be : e.Re;
+    // A node born held (recompute) has a staged value and no committed one: a
+    // stale reader cannot fall back to the committed frame, so it takes the
+    // staged value and enters like a tracked reader (A29); an untracked reader
+    // has nothing to serve and holds (A19 exception 1).
+        const l = e.ve !== NOT_PENDING && (e.S & STATUS_UNINITIALIZED) !== 0;
+    if (l && !t) throw new NotReadyError(null);
+    const u = t && unflushedStaged ? unflushedValue(e, i) : NOT_PENDING;
+    if (u !== NOT_PENDING) {
+        markLateLinker(t);
+        if (pendingCheckActive) GlobalQueue.nn(e, u);
+        return u;
+    }
+    const o = readerSeesCommitted(e, t, n, l) ? i : (enterStagedRead(e), e.ve);
     // Record that this isPending() probe observed the fresh pending value, so
     // the probe doesn't pair "pending" with the new value (#2831).
-        if (pendingCheckActive) GlobalQueue.Lt(e, l);
-    if (!t && u === e && typeof n.oe === "function" && e.T & CONFIG_AUTO_DISPOSE && !(u.S & STATUS_PENDING) && !e.u) {
-        // Deferred, not inline (#3078): an inline unobserved() here made untracked
-        // reads destructive — dispose on this read, full revival recompute on the
-        // next — so consecutive reads could answer differently with no write in
-        // between (the revival samples the ambient transition/lane context).
-        // The sweep at flush finalization re-validates and reclaims; schedule()
-        // guarantees that flush happens even if nothing else is queued.
-        dormantNodes.add(e);
-        schedule();
+        if (pendingCheckActive) GlobalQueue.nn(e, o);
+    return o;
+}
+
+/** A28 — a rewrite of a HELD node outside a flush keeps the staged value the
+ * last flush left, for latest()/verdicts, until the next flush carries it
+ * (stash, cleared at that flush). Cold: only stamped nodes reach here. */ function stashHeldRewrite(e) {
+    if (globalQueue.Kt) return;
+    const t = ext(e);
+    if (t.gt === NOT_PENDING) {
+        t.gt = e.ve;
+        unflushedRewrites.push(e);
+        unflushedStaged = true;
     }
-    return l;
+}
+
+/** A28 (4) — written inside a recompute that runs OUTSIDE a flush (a
+ * creation-time compute): promoted at that pass's end, visible to the rest of
+ * the block. Cold: only contextual writes reach here. */ function notePromotedWrite(e) {
+    if (globalQueue.Kt || e.T & CONFIG_PROMOTED) return;
+    e.T |= CONFIG_PROMOTED;
+    promotedWrites.push(e);
 }
 
 function setSignal(e, t) {
-    if (e.Ae && activeTransition !== e.Ae) globalQueue.initTransition(e.Ae);
+    // A write to a held node is a second proposal on a contested node (A34, #3494):
+    // the writer's tick reveals with the hold, the same value or another. Inside
+    // a flush the round enters now; from mainline the entry waits for the next
+    // flush's start (batchJoins) — entering here left activeTransition set for
+    // the rest of the caller's block, so a memo created after the write became
+    // the transaction's instead of mainline's (A28, A29). Before the equality
+    // gate below: repeating the held value proposes it too — and that repeat
+    // leaves through the gate, so the join schedules its own flush here; left
+    // for the next flush to find, it adopted an unrelated tick (#3519 review).
+    if (e.Ge && activeTransition !== e.Ge) {
+        if (globalQueue.Kt) globalQueue.initTransition(e.Ge); else {
+            batchJoins.push(e.Ge);
+ // dupes: a bare return in initTransition
+                        schedule();
+        }
+    }
     // The optimistic write path lives with the engine: only optimisticSignal /
     // optimisticComputed callers and optimistic store nodes carry an
     // _overrideValue slot (flagged by CONFIG_OPTIMISTIC — a masked read of the
     // always-present config instead of a missing-property probe), and every
     // module that installs one installs the engine first.
-        if (e.T & CONFIG_OPTIMISTIC && !projectionWriteActive) return GlobalQueue.yt(e, t);
-    const n = e.Re === NOT_PENDING ? e.be : e.Re;
+        if (e.T & CONFIG_OPTIMISTIC) {
+        if (!projectionWriteActive) return GlobalQueue.ln(e, t);
+        // An authoritative store landing on an override-covered node: the store
+        // twin of asyncWrite's override branch, decided by the engine (#3331).
+                const n = e.o?.Ce;
+        if (n !== undefined && n !== NOT_PENDING) return GlobalQueue.un(e, t);
+    }
+    const n = e.ve === NOT_PENDING ? e.Qe : e.ve;
     if (typeof t === "function") t = t(n);
     // Uninitialized check first: the first commit has no previous value, so the
     // user comparator must not run against `undefined` (matches recompute).
-        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.pe || !e.pe(n, t);
+        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.Fe || !e.Fe(n, t);
     if (!i) return t;
-    const u = e.Re !== NOT_PENDING;
-    if (!u) queuePendingNode(e);
-    e.Re = t;
+    const l = e.ve !== NOT_PENDING;
+    if (!l) queuePendingNode(e);
+    // A28 arms, gated on the loads the write already pays for (a plain ambient
+    // rewrite outside a flush — the write-loop shape — costs `_transition` and
+    // `context` here and nothing else; the arms themselves are cold helpers so
+    // setSignal stays within every setter's inlining budget, ~300 B bytecode).
+     else if (e.Ge !== null) stashHeldRewrite(e);
+    e.ve = t;
+    if (context !== null) notePromotedWrite(e);
     // syncCompanions only pokes _pendingSignal/_latestValueComputed — with
     // neither companion present the call is a guaranteed no-op (companions are
     // only ever created, never removed, and creating one installs the hook and
     // sets CONFIG_HAS_COMPANIONS — one masked read replaces two optional-field
     // probes on every write).
-        e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.Ue !== null && GlobalQueue.Ue(e, t);
+        if (e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.me !== null) {
+        GlobalQueue.me(e, t);
+        // A28 (2): the verdict computed here is the PRE-flush one (an unflushed
+        // write is not pending); the flush that carries the write re-syncs so
+        // the companions mirror the flushed world. Only companion nodes pay.
+                if (!globalQueue.Kt) unflushedCompanions.push(e);
+    }
     // _time is a computed-only slot (§12e): writing it on a signal would fork
     // the lean shape. Every read site is computed-typed.
-        if (e.oe !== undefined) e.Te = clock;
+        if (e.ce !== undefined) e.Pe = clock;
     // Staged-rewrite fast path (§12d): a re-write to a node whose subscribers
     // were already walked — and where nothing has recomputed or linked since
     // (epoch) — re-stages the value and stops. The walk is idempotent (subs
     // marked, heap entries flag-guarded, effects queued once); lane and reask
     // contexts change what a walk MEANS, so they always walk.
-        if (u && e.Et === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return t;
+        if (l && e.ht === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return t;
     insertSubs(e);
     schedule();
     return t;
@@ -1009,12 +1648,12 @@ function setSignal(e, t) {
  * cleanup point.
  */ function suppressComputedRecompute(e) {
     deleteFromHeap(e, queueFor(e));
-    if (!(e.ie & REACTIVE_MANUAL_WRITE) && e.Re === NOT_PENDING) {
+    if (!(e.ue & REACTIVE_MANUAL_WRITE) && e.ve === NOT_PENDING) {
         queuePendingNode(e);
         schedule();
     }
-    e.ie = e.ie & -4 | REACTIVE_MANUAL_WRITE;
-    e.Qt = clock;
+    e.ue = e.ue & -4 | REACTIVE_MANUAL_WRITE;
+    e.sn = clock;
 }
 
 /**
@@ -1076,16 +1715,16 @@ function staleValues(e, t = true) {
  * recompute as a quiet re-ask and schedules it; no-ops for non-derived or
  * disposed targets and for same-tick manual writes.
  */ function markRefresh(e) {
-    if (typeof e.oe === "function" && !(e.ie & REACTIVE_DISPOSED)) {
-        if (e.ie & REACTIVE_MANUAL_WRITE) {
+    if (typeof e.ce === "function" && !(e.ue & REACTIVE_DISPOSED)) {
+        if (e.ue & REACTIVE_MANUAL_WRITE) {
             // A manual write in the CURRENT tick wins over the refresh (#2692).
             // A mask stamped in an earlier tick only survives because a
             // transaction (action) is holding the pending drain open; there the
             // refresh is a later, explicit re-ask and lifts the mask — otherwise
             // any setStore early in an action silently swallows every refresh()
             // for the rest of the transaction (#3026).
-            if (e.Qt === clock) return;
-            e.ie &= ~REACTIVE_MANUAL_WRITE;
+            if (e.sn === clock) return;
+            e.ue &= ~REACTIVE_MANUAL_WRITE;
             // The lift falls through to the re-ask classification below. The held
             // write's value change already rides the transaction; the refetch it
             // asks for is the same question with unchanged inputs. Skipping the
@@ -1102,14 +1741,14 @@ function staleValues(e, t = true) {
         // REACTIVE_IN_HEAP counts as dirt: insertSubs schedules subscribers by
         // heap insertion alone (no DIRTY/CHECK flag), so a same-batch value
         // change followed by refresh() must not be laundered into a quiet re-ask.
-                if (!(e.ie & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
-            e.ie |= REACTIVE_REASK;
+                if (!(e.ue & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
+            e.ue |= REACTIVE_REASK;
             armReaskClear();
         }
-        e.ie = e.ie & ~REACTIVE_CHECK | REACTIVE_DIRTY;
+        e.ue = e.ue & ~REACTIVE_CHECK | REACTIVE_DIRTY;
         insertIntoHeap(e, queueFor(e));
         schedule();
     }
 }
 
-export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, effectStatusNotify, ext, installAuthoritativeRead, isEqual, latestReadActive, markRefresh, markSnapshotScope, notifyAuthoritativeObservers, optimisticComputed, optimisticSignal, pendingCheckActive, prepareComputed, read, readNodeFast, recompute, releaseSnapshotScope, runWithOwner, setContextInternal, setEffectStatusNotify, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSlotUnobserved, setSnapshotCapture, signal, slotSignal, slotUnobservedHook, snapshotCaptureActive, snapshotSources, stale, staleValues, statusNotifierOf, suppressComputedRecompute, tracking, untrack };
+export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, effectStatusNotify, enterStagedRead, ext, hasActiveOverride, installAuthoritativeRead, isEqual, latestReadActive, markLateLinker, markRefresh, markSnapshotScope, markUnflushedStaged, notifyAuthoritativeObservers, optimisticComputed, optimisticSignal, ownsHold, pendingCheckActive, prepareComputed, read, readNodeFast, readerSeesCommitted, recompute, recordStaleReplay, releaseSnapshotScope, resyncUnflushedCompanions, runWithOwner, serve, setContextInternal, setEffectStatusNotify, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSlotUnobserved, setSnapshotCapture, signal, slotSignal, slotUnobservedHook, snapshotCaptureActive, snapshotSources, spectate, spectating, stale, staleValues, statusNotifierOf, suppressComputedRecompute, tracking, unflushed, unflushedCompanions, unflushedOverride, unflushedStaged, unflushedValue, unlinkFirewallChild, untrack, visibleOverride };