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

package/dist/prod/core/core.js

@@ -1,20 +1,16 @@
 import { releaseFlightTeardown, handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settlePendingSource, settleErroredDependents } from "./async.js";
 
-import { NOT_PENDING, EFFECT_TRACKED, EFFECT_USER, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_DERIVED_OVERRIDE, CONFIG_HELD_CHILDREN, CONFIG_LANE_FRAME, CONFIG_OPTIMISTIC, STATUS_UNINITIALIZED, STATUS_ERROR, STATUS_PENDING, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, REACTIVE_ZOMBIE, CONFIG_SYNC, CONFIG_HAS_LANE, REACTIVE_MISSED_WAKE, REACTIVE_DISPOSED, 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_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, REACTIVE_MANUAL_WRITE, CONFIG_AUTHORITATIVE_READ, CONFIG_OVERRIDE_SUPERSEDED, CONFIG_AUTHORITATIVE_OBSERVED, defaultContext, REACTIVE_NONE, CONFIG_HELD_TRUTH, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, CONFIG_IN_SNAPSHOT_SCOPE, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, CONFIG_FW_CHILDREN, CONFIG_SLOT_NODE, STORE_SNAPSHOT_PROPS } from "./constants.js";
+import { STATUS_UNINITIALIZED, REACTIVE_LAZY, REACTIVE_NONE, defaultContext, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_AUTO_DISPOSE, CONFIG_SYNC, CONFIG_NO_SNAPSHOT, CONFIG_IN_SNAPSHOT_SCOPE, NOT_PENDING, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, CONFIG_HELD, REACTIVE_MANUAL_WRITE, REACTIVE_DIRTY, CONFIG_OVERRIDE, REACTIVE_DISPOSED, REACTIVE_CHECK, REACTIVE_IN_HEAP, REACTIVE_REASK, REACTIVE_SNAPSHOT_STALE, REACTIVE_LANE_DIRTY, CONFIG_GUESS, REACTIVE_RECOMPUTING_DEPS, EFFECT_RENDER, CONFIG_VERDICT, EFFECT_TRACKED, CONFIG_STAGED, STATUS_ERROR, STATUS_PENDING, REACTIVE_ZOMBIE, REACTIVE_MISSED_WAKE, REACTIVE_JOINED, REACTIVE_PROBED, REACTIVE_FRAME_READ, REACTIVE_STAGED_READ, REACTIVE_LANE_READ, REACTIVE_SCREEN_READ, REACTIVE_PROBE_UNANSWERED, CONFIG_CHILDREN_FORBIDDEN, CONFIG_PROMOTED, CONFIG_INPUTS_PUBLISHED, CONFIG_FRESH_READ, REACTIVE_IN_HEAP_HEIGHT, CONFIG_SLOT_NODE, EFFECT_USER } from "./constants.js";
 
 import { NotReadyError } from "./error.js";
 
 import { clearDeps, trimStaleDeps, link, dormantNodes } from "./graph.js";
 
-import { deleteFromHeap, queueFor, insertIntoHeapHeight, enqueueSub, markNode, markHeap, insertIntoHeap } from "./heap.js";
+import { insertIntoHeap, deleteFromHeap, insertIntoHeapHeight, enqueueSub, markNode, markHeap } from "./heap.js";
 
-import { findLane } from "./lanes.js";
+import { inheritId, disposeChildren, linkChild, markDisposal } from "./owner.js";
 
-import "./invariants.js";
-
-import { disposeChildren, markDisposal, linkChild, inheritId } from "./owner.js";
-
-import { GlobalQueue, bumpNotifyEpoch, activeTransition, globalQueue, clock, currentTransition, insertSubs, queuePendingNode, wakeParked, heldTrims, runInTransition, schedule, batchJoins, notifyEpoch, dirtyQueue, projectionWriteActive, reaskArmed, armReaskClear } from "./scheduler.js";
+import { schedule, GlobalQueue, clock, txOf, flushTransaction, joinFuture, queuePendingNode, globalQueue, notifyEpoch, insertSubs, dirtyQueue, bumpNotifyEpoch, setPassLane, passLane, joinPassTx, passTx, holdNode, laneDirty, heldTrim, staleReader, stagedReaders, deferZombie } from "./scheduler.js";
 
 // The heap's per-node step. A tracked effect's heap visit is its compute
 // phase — empty, like a user effect whose compute reads nothing — and hands
@@ -24,62 +20,34 @@ import { GlobalQueue, bumpNotifyEpoch, activeTransition, globalQueue, clock, cur
 // 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.Ke = e => {
-    if (e.je === EFFECT_TRACKED) {
-        deleteFromHeap(e, queueFor(e));
-        e.Xe = true;
-        e.T.enqueue(EFFECT_USER, e.$e);
-    } else recompute(e);
+GlobalQueue.Ce = e => {
+    if (e.i === EFFECT_TRACKED) {
+        deleteFromHeap(e, dirtyQueue);
+        e.Fe = true;
+        globalQueue.enqueue(EFFECT_USER, e.q);
+    }
+    // L2: a zombie's fate is the seam's — its owner's commit disposes it, or
+    // the park cancels the pass (the write that dirtied it is held). It runs
+    // only past a seam that left it alive (a live write to a frame whose
+    // owner is held in the future). Its lane's own re-staging is a live write
+    // (REACTIVE_LANE_DIRTY — a lane shows ahead of any park): it runs now, as
+    // the lane's work, for the reveal this seam (#3463).
+     else if (e.R & REACTIVE_ZOMBIE && !(e.R & REACTIVE_LANE_DIRTY)) deferZombie(e); else recompute(e);
 };
 
-GlobalQueue.en = disposeChildren;
+GlobalQueue.he = disposeChildren;
 
 let tracking = false;
 
-/** @internal verdict-module glue */ function setPendingCheckActive(e) {
-    pendingCheckActive = e;
-}
-
-/** @internal verdict-module glue */ function setLatestReadActive(e) {
-    latestReadActive = e;
-}
-
-/** @internal verdict-module glue */ function setContextInternal(e) {
-    context = e;
-}
-
-let stale = false;
-
-let pendingCheckActive = false;
-
-let latestReadActive = false;
-
 let context = null;
 
-let currentOptimisticLane = null;
-
-/** Notify `node`'s subscribers on `lane`'s channel: they recompute as the
- * lane's passes — a memo publishes a derived override (lanes stage, #3479),
- * an effect runs from the lane's queue, at the park, ahead of the
- * transaction — the display-ahead view. The write itself is already staged
- * (setSignal) and commits with the frame; this walk shows it now. Used by a
- * boundary re-armed from a lane pass (boundaries.ts `_swap`, #3540). */ function notifyOnLane(e, n) {
-    const t = currentOptimisticLane;
-    currentOptimisticLane = n;
-    try {
-        insertSubs(e, true);
-    } finally {
-        currentOptimisticLane = t;
-    }
-}
-
 let snapshotCaptureActive = false;
 
 let snapshotSources = null;
 
 function ownerInSnapshotScope(e) {
     while (e) {
-        if (e.nn) return true;
+        if (e.Ve) return true;
         e = e._parent;
     }
     return false;
@@ -91,34 +59,34 @@ function setSnapshotCapture(e) {
 }
 
 function markSnapshotScope(e) {
-    e.nn = true;
+    e.Ve = true;
 }
 
 function releaseSnapshotScope(e) {
-    e.nn = false;
+    e.Ve = false;
     releaseSubtree(e);
     schedule();
 }
 
 function releaseSubtree(e) {
-    let n = e.tn;
-    while (n) {
-        if (n.nn) {
-            n = n.un;
+    let t = e.ge;
+    while (t) {
+        if (t.Ve) {
+            t = t.me;
             continue;
         }
-        if (n.he) {
-            const e = n;
-            e.C &= ~CONFIG_IN_SNAPSHOT_SCOPE;
-            if (e.oe & REACTIVE_SNAPSHOT_STALE) {
-                e.oe &= ~REACTIVE_SNAPSHOT_STALE;
-                e.oe |= REACTIVE_DIRTY;
-                if (dirtyQueue.ln > e.rn) dirtyQueue.ln = e.rn;
+        if (t.re) {
+            const e = t;
+            e.u &= ~CONFIG_IN_SNAPSHOT_SCOPE;
+            if (e.R & REACTIVE_SNAPSHOT_STALE) {
+                e.R &= ~REACTIVE_SNAPSHOT_STALE;
+                e.R |= REACTIVE_DIRTY;
+                if (dirtyQueue.He > e.Le) dirtyQueue.He = e.Le;
                 insertIntoHeap(e, dirtyQueue);
             }
         }
-        releaseSubtree(n);
-        n = n.un;
+        releaseSubtree(t);
+        t = t.me;
     }
 }
 
@@ -129,256 +97,160 @@ function clearSnapshots() {
             // 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 n = e.o;
-            if (n != null) n.sn = undefined;
-            // StoreNode targets share one pre-initialized hidden class (see
-            // 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;
+            const t = e.m;
+            if (t != null) t.xe = undefined;
         }
         snapshotSources = null;
     }
     snapshotCaptureActive = false;
 }
 
-function recompute(e, n = false) {
+function recompute(e, t = false) {
     // §12d: any recompute can clean a marked subscriber — invalidate skips.
     bumpNotifyEpoch();
-    const t = e.je;
-    // Lane posture is resolved BEFORE the previous frame is parked below: a
-    // lane pass parks a lane frame, not a transaction zombie (#3662, #3698;
-    // see the parking site), so the decision must be known there. `lane` is applied to
-    // `currentOptimisticLane` further down, once the previous posture is saved.
-        let i = !!(e.oe & REACTIVE_OPTIMISTIC_DIRTY);
-    let u = null;
-    if (i) {
-        u = GlobalQueue.an(e, true);
-        // `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).
-                if (u === false) i = false;
-    } else if (e.C & 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.
-        u = GlobalQueue.an(e, true);
-        if (u) i = true;
-    } else if (activeTransition && !n && activeTransition.cn.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.
-        u = GlobalQueue.an(e, false);
-        if (u) i = true;
-    }
-    if (!n) {
-        // 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.we && !t && activeTransition !== e.we) globalQueue.initTransition(e.we);
-        deleteFromHeap(e, queueFor(e));
-        if (e.o !== null) {
-            e.o.Ce = null;
+    const n = e.i;
+    // Lanes (plan sec. 28): the seat of a pass is its node's. A node carrying a lane's
+    // derived value runs as the lane's whoever dirtied it — a sync write, a
+    // boundary reset, a frame rerun — so its children and its result are the
+    // lane's; so does a member the lane's own re-staging dirtied
+    // (REACTIVE_LANE_DIRTY, lanes.ts — a leaf the lane owns). A written guess's
+    // own pass is its truth arriving (A18), the frame's. A first pass is its
+    // creator's (ruling A: a lane pass's children are the lane's frame), and
+    // under a guess's lane it reads as the lane's too — a binding the lane
+    // mounts sees the screen, like the pass that mounted it (#3835). Not
+    // under a verdict lane, for its reads or its result: a verdict lane holds
+    // verdicts, and a mount it makes is a mainline mount (A29's boundary
+    // exemption, #3851). A tracked read of a lane's value moves a
+    // derivation's pass into the lane (`read`); a leaf's never moves.
+    // Restored at the end, after this pass's staging and runs have been
+    // routed.
+        const E = passLane;
+    setPassLane((e.R & REACTIVE_LANE_DIRTY || (e.u & (CONFIG_OVERRIDE | CONFIG_GUESS)) === CONFIG_OVERRIDE) && e.m?.ke?.Z ? e.m.ke : // Loose `!=`: false with no creator lane (undefined == null).
+    t && E?._parent.ye != E && (creatorPass(context)?.R ?? 0) & REACTIVE_RECOMPUTING_DEPS ? E : null);
+    // CARVE 2: lane posture resolution (OPTIMISTIC_DIRTY, derived-override
+    // re-derivation, lane adoption through deps) went with the optimistic engine.
+        if (!t) {
+        deleteFromHeap(e, dirtyQueue);
+        if (e.m !== null) {
+            e.m.De = 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
-            // SUPERSEDING flight settles — cancellation must not wait for the
-            // work that replaced it. Idempotent with the cleanup-channel close.
+            // Idempotent with the cleanup-channel close.
                         releaseFlightTeardown(e);
         }
-        // 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. Which frame retires it is
-        // decided by who owns the pass, never by the node's kind (A15 lane work
-        // and transaction work, ruled 2026-09-28, #3698). Transaction work — a
-        // pass under a held transaction — defers them 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.
-        // Lane work — a pass over a lane, effect or memo alike — parks a LANE
-        // frame instead (CONFIG_LANE_FRAME, #3662, #3698): the frame it replaces
-        // leaves the screen when the lane's queue applies this pass (A30) — not
-        // at the action's commit — and a held lane defers that with the frame
-        // still displayed. The drain is the lane's first render entry for this
-        // pass, pushed before the pass builds the new frame: cleanups before
-        // side effects — the retired frame's `onCleanup`s run ahead of every
-        // effect callback of the new frame. While the frame waits, the live
-        // children were never shown: a superseding pass disposes them here like
-        // held children, and the parked frame stays. Zombies exist for
-        // transaction work only: #3662 gated the lane frame on `isEffect`, and a
-        // memo's lane pass (its value a derived override, A17) parked a
-        // transaction zombie that made the memo a pending node of the action,
-        // stamped it, and sent its next mainline recompute through the
-        // stamped-memo arm above — a `Show` whose `when` getter owns a
-        // compiler-emitted memo held an unrelated sync write for the action's
-        // lifetime, against the #3460 ruling that a lane never holds a sync write.
-                if (t === EFFECT_TRACKED || e.C & (CONFIG_HELD_CHILDREN | CONFIG_LANE_FRAME)) disposeChildren(e); else if (e.tn !== null || e.qe !== null) {
-            markDisposal(e);
-            const n = ext(e);
-            n.fn = e.qe;
-            n._n = e.tn;
-            e.qe = null;
-            e.tn = null;
-            e.En = 0;
-            if (u) {
-                e.C |= CONFIG_LANE_FRAME;
-                findLane(u).dn[0].push(() => {
-                    e.C &= ~CONFIG_LANE_FRAME;
-                    disposeChildren(e, false, true);
-                });
+        // L2: a pass over a held derivation joins its transaction — the
+        // propagation that reached this node reached the transaction, and this
+        // pass's answer replaces the held one there. A node held with nothing
+        // staged — pending when its flush parked, or a member of a held frame —
+        // joins all the same. Not a render effect (rule 3): it is the frame.
+        // Re-run outside its transaction's flush it publishes mainline — the
+        // value it staged there is superseded (`frameRead` remembers it for the
+        // landing). A frame born into the transaction (uninitialized: never run,
+        // A29) keeps staging: live writes keep it current, it effects at the
+        // swap (ruling A).
+                if (e.u & CONFIG_HELD) {
+            const t = txOf(e);
+            // Held by a blocked lane: the frame joins nothing — a lane never holds
+            // a sync write (#3460). The pass is the lane's if it reads the lane's
+            // world (`read`), and has left it otherwise.
+                        if (t.Z) ; else if (n !== EFFECT_RENDER && !(e.u & CONFIG_VERDICT)) joinPassTx(t); else if (t !== flushTransaction && !(e.G & STATUS_UNINITIALIZED)) {
+                // Published mainline, it is not held: the frame this pass builds is
+                // replaced on the spot (#3404) — this flush's commit retires the
+                // committed frame the held pass had parked (`commitPendingNode`),
+                // after the new frame's first runs, and the held pass's own
+                // children die below (`disposeChildren`). The landing re-derives a
+                // fresh held frame for the reveal (`_reruns`).
+                e.Ae = NOT_PENDING;
+                if (n === EFFECT_RENDER) e.u &= ~CONFIG_HELD;
             }
-        } else ;
+        }
+        // The previous pass's frame. If that pass is still awaiting its commit
+        // (CONFIG_STAGED) its children were never shown and die on the spot — the
+        // frame parked before it stays parked. Otherwise they ARE the frame:
+        // park them until this pass commits. Tracked effects run after the seam
+        // and own nothing to park.
+                if (n === EFFECT_TRACKED || e.u & CONFIG_STAGED) disposeChildren(e); else if (e.ge !== null || e.Pe !== null) parkChildren(e);
     }
-    // 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.C & (CONFIG_OPTIMISTIC | CONFIG_DERIVED_OVERRIDE)) !== 0 && e.o?.Fe !== NOT_PENDING && e.o?.Fe !== undefined;
-    const r = !!(e.h & STATUS_UNINITIALIZED);
+    const u = !!(e.G & 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.h & STATUS_ERROR ? e.o?._ : undefined;
-    const s = (e.h & STATUS_PENDING) !== 0;
-    const a = s ? e.o?.ue : undefined;
+        const s = e.G & STATUS_ERROR ? e.m?.V : undefined;
+    const i = (e.G & STATUS_PENDING) !== 0;
+    const l = i ? e.m?.Se : 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 c = e.o?.ue?.has(e);
-    // Re-ask classification lives in the verdict module; capture the flag before
-    // the recompute wipes _flags below.
-        const f = (e.oe & 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 _ = e.ve;
-    // 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 E = stagedEntry;
-    stagedEntry = null;
-    const d = context;
+        const _ = e.m?.Se?.has(e);
+    // A19 exc. 2: a `refresh()` re-asks the question already answered — quiet
+    // for the verdict — unless the question in flight is a new one, which the
+    // re-ask does not launder (a poll during a quiet confirm stays quiet).
+        const o = (e.R & REACTIVE_REASK) !== 0 && !(e.G & STATUS_PENDING && e.m !== null && !e.m.be);
+    const r = context;
     context = e;
-    e.Nn = null;
-    e.Ye++;
-    // REACTIVE_ZOMBIE is position, not scheduling state: it says the node sits
-    // on its owner's `_pendingFirstChild` chain, and `disposeChildren` keys its
-    // parent-chain splice off it. A zombie reruns for mainline writes until the
-    // commit that disposes it (#3463), so the per-pass wipe here — and in the
-    // finally below and in updateIfNecessary — must carry it (#3543): a
-    // de-flagged zombie spliced itself out of the LIVE chain at disposal,
-    // orphaning the owner's current child, which stayed subscribed forever.
-        e.oe = REACTIVE_RECOMPUTING_DEPS | e.oe & REACTIVE_ZOMBIE;
-    e.be = clock;
-    let N = e._e === NOT_PENDING ? e.ce : e._e;
-    let I = e.rn;
-    let T = false;
-    let S = tracking;
-    let O = currentOptimisticLane;
+    e.S = null;
+    e.Ge++;
+    // REACTIVE_ZOMBIE is position: it says the node sits on its owner's parked
+    // frame, and the splice/reawaken paths key off it. A zombie reruns for
+    // live writes until the commit that disposes it, so every per-pass wipe
+    // — here, the finally below, updateIfNecessary — carries it (#3543).
+        e.R = REACTIVE_RECOMPUTING_DEPS | e.R & REACTIVE_ZOMBIE;
+    e.Ne = clock;
+    // The pass's previous value: its staging, else the lane's value for a
+    // lane's node (lanes.ts), else the committed one.
+        let I = e.Ae !== NOT_PENDING ? e.Ae : e.u & CONFIG_OVERRIDE ? e.m.Z : e.pe;
+    let a = e.Le;
+    let N = false;
+    // L2: did this pass read the future (REACTIVE_JOINED, set by read)?
+        let f = false;
+    let T = tracking;
     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
-    // companion path before dependency linking, so a memo created (eagerly
-    // 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 A = 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 (!t) 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.
-    // (Resolved at the top of this pass, ahead of the parking site.)
-        if (u) currentOptimisticLane = u;
-    const C = t && t !== EFFECT_USER;
-    const p = 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 (t && activeTransition !== null && activeTransition.In.size) activeTransition.In.delete(e);
     try {
-        if (!false && e.C & CONFIG_SYNC) {
-            N = e.he(N);
-            if (e.o !== null) e.o.Ce = null;
-            e.ve = false;
+        if (!false && e.u & CONFIG_SYNC) {
+            I = e.re(I);
+            if (e.m !== null) e.m.De = null;
+            e._e = 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 n = e.o?.Ce;
-            const t = e.he(N);
-            const i = typeof t === "object" && t !== null;
-            const u = e.o?.Ce !== n;
-            N = u || !i ? t : handleAsync(e, t);
-            if (!u && !i) {
-                if (e.o !== null) e.o.Ce = null;
+            // A projection's body self-registers its flight through handleAsync
+            // (with the commit as setter): its undefined return is not a sync
+            // answer, and the outer handleAsync must not clobber the registration.
+            const t = e.m?.De;
+            const n = e.re(I);
+            const E = typeof n === "object" && n !== null;
+            const u = e.m?.De !== t;
+            I = u || !E ? n : handleAsync(e, n);
+            if (!u && !E) {
+                if (e.m !== null) e.m.De = 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.ve = false;
+                // self-registered flight clears when its own handleAsync lands.
+                                e._e = 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.)
-        // A node born held keeps STATUS_UNINITIALIZED until its transaction
-        // commits: it has no committed value, and read() holds its readers.
-                if (e.h !== 0 || e.o !== null) clearStatus(e, n && stagedEntry === null);
-        // _optimisticLane is only ever assigned by engine paths (CONFIG_HAS_LANE
-        // is their sticky presence mark).
-                if (e.C & CONFIG_HAS_LANE && e.o?.me) GlobalQueue.Tn(e);
-    } catch (n) {
-        const t = n instanceof NotReadyError;
-        if (t && e.ve) {
+                if (e.G !== 0 || e.m !== null) clearStatus(e, t);
+    } catch (t) {
+        const n = t instanceof NotReadyError;
+        if (n && e._e) {
             // 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
-            // status, no downstream propagation, no transition, no lane
-            // registration — the committed loading value keeps serving. If the
+            // status and no downstream propagation — the committed loading value
+            // keeps serving. If the
             // node is currently errored the error stays the answer until this
             // retry can actually run.
-            parkLoadingWindow(e, n);
+            parkLoadingWindow(e, t);
         } 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 (t && currentOptimisticLane) GlobalQueue.Sn(e);
-            let i = false;
-            if (t) {
-                ext(e).Pe = true;
-                if (GlobalQueue.On !== null) i = GlobalQueue.On(e, f);
-            }
-            notifyStatus(e, t ? STATUS_PENDING : STATUS_ERROR, n, undefined, t ? e.o?.me : undefined);
+            if (n) ext(e).Ie = true;
+            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t);
             // The replacement source is fully propagated now. If no new flight
             // re-owned self, retire the superseded flight and its dependent copies.
-                        if (t && c && !e.o?.Ce) settlePendingSource(e);
+                        if (n && _ && !e.m?.De) 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
@@ -387,32 +259,34 @@ function recompute(e, n = false) {
             // 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 (t && a) for (const n of a) if (n !== e && !e.o?.ue?.has(n)) settlePendingSource(e, n);
-            if (i) GlobalQueue.k(e);
+                        if (n && l) for (const t of l) if (t !== e && !e.m?.Se?.has(t)) settlePendingSource(e, t);
         }
     } finally {
-        tracking = S;
-        latestReadActive = A;
-        if (C) stale = p;
+        tracking = T;
         // 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.
-                T = (e.oe & REACTIVE_MISSED_WAKE) !== 0;
+                N = (e.R & REACTIVE_MISSED_WAKE) !== 0;
+        f = (e.R & REACTIVE_JOINED) !== 0;
+        // A verdict reader is one for as long as it probes: a pass that entered
+        // no window (REACTIVE_PROBED) is an ordinary derivation again.
+                if (!(e.R & REACTIVE_PROBED)) e.u &= ~CONFIG_VERDICT;
         // REACTIVE_DISPOSED survives too (#3621): the pass may have disposed its
         // own owner (a memo calling its root's `dispose()`, a cleanup doing so
         // #3601/#3606), and `disposeChildren` set the flag on this node
         // reentrantly. Dropped, the node read as live — `refresh()` re-ran it
-        // and `isDisposed()` lied.
-                e.oe = e.oe & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED) | (n ? e.oe & REACTIVE_SNAPSHOT_STALE : 0);
-        context = d;
+        // and `isDisposed()` lied. REACTIVE_FRAME_READ (A15 stale reader) is
+        // this pass's verdict for the landing; the next pass's wipe at the top
+        // clears it.
+                e.R = e.R & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED | REACTIVE_FRAME_READ | REACTIVE_STAGED_READ | REACTIVE_LANE_READ | REACTIVE_SCREEN_READ | REACTIVE_PROBE_UNANSWERED) | (t ? e.R & REACTIVE_SNAPSHOT_STALE : 0);
+        context = r;
+        // A19 exc. 2: a pass that went pending on a `refresh()` re-asks the
+        // question already answered — quiet for the verdict; any other pending
+        // pass is a new question. Settled, there is nothing to classify.
+                if (e.m !== null) e.m.be = o && (e.G & STATUS_PENDING) !== 0;
     }
-    // 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 R = stagedEntry;
-    stagedEntry = E;
     // A node that died during its own pass (#3621) is dead at the end of it,
     // and the pass is void. Its owner's teardown already unlinked its deps,
     // removed it from the heap and ran its cleanups; what remains is what the
@@ -424,278 +298,185 @@ function recompute(e, n = false) {
     // so nothing is staged, committed, or propagated to subscribers, and an
     // effect's run is not enqueued (runEffect would refuse it anyway). The
     // attribution frame opened at the top is still closed.
-        if (e.oe & REACTIVE_DISPOSED) {
+        if (e.R & REACTIVE_DISPOSED) {
         clearDeps(e);
-        if (e.o !== null) e.o.Ce = null;
-        currentOptimisticLane = O;
+        if (e.m !== null) e.m.De = null;
+        setPassLane(E);
         return;
     }
-    if (!e.o?._) {
+    // The lane this pass is work of, if any: its seat (the node's, its
+    // creator's, or the one a lane read moved it into). A pass in a lane's
+    // seat that read none of the lane's world has left it: its result is the
+    // frame's (a derivation whose branch no longer reaches the guess). A
+    // guess is written, not derived — it never leaves this way.
+        let S = passLane;
+    // Listed before its staging, a pending pass included (the lane's own
+    // flight is the lane's); false: the pass left the lane (lanes.ts).
+        const c = !!e.m?.V;
+    if (S !== null) {
+        if (GlobalQueue.M(e, S, t, c)) setPassLane(S); else S = null;
+    }
+    if (!e.m?.V) {
         // 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 u = l ? unwrapOverride(e.o?.Fe) : i || e._e === NOT_PENDING ? e.ce : e._e;
-        let s = false;
+        // publishes to — the staged `_pendingValue` when staged; a lane node's
+        // lane value (a node entering the lane this pass has none yet — its
+        // committed value, `laneStage` having voided a frame staging).
+        const i = e.Ae !== NOT_PENDING ? e.Ae : e.u & CONFIG_OVERRIDE && e.m.Z !== NOT_PENDING ? e.m.Z : e.pe;
+        let o = false;
         try {
-            s = !t && r || !e.xe || !e.xe(u, N);
-        } catch (n) {
+            o = !n && u || !e.We || !e.We(i, I);
+        } 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
             // error boundaries contain it; otherwise it unwinds the scheduler
             // flush, bypassing every boundary and wedging the queue (#2837).
-            notifyStatus(e, STATUS_ERROR, n);
+            notifyStatus(e, STATUS_ERROR, t);
         }
         // Effects use `_equals: false` (no per-effect closure). The side effects that
         // the equals closure used to perform — flagging the effect dirty and enqueueing
         // 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 (t && s) {
-            e.Xe = !e.o?._;
+                if (n && o && 
+        // A stale reader of a lane (REACTIVE_SCREEN_READ) that computed what it
+        // last applied owes no run (lanes.ts).
+        !(e.R & REACTIVE_SCREEN_READ && !e.Fe && Object.is(e.Ze, I)) && 
+        // A re-staging pass owes no run: the commit replays the effect (#3802).
+        e.Ae === NOT_PENDING) {
+            e.Fe = !e.m?.V;
             // Reuse one bound runner per effect — runEffect no-ops on a stale
             // `_modified`, so re-enqueueing the same function is harmless.
-                        if (!n) {
-                e.T.enqueue(t, e.An ??= GlobalQueue.Cn.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 n = e.pn;
-                if (n !== activeTransition) {
-                    e.pn = activeTransition;
-                    if (n !== null && (n = currentTransition(n)) !== activeTransition && !n.Rn) {
-                        (n.Dn ??= []).push(e);
-                        if (activeTransition !== null) (activeTransition.Dn ??= []).push(e);
-                    }
-                }
-            }
+            // Lane work's run is the lane's (released at its reveal) — a first
+            // pass under a lane too: `effect()` skips the synchronous first run of
+            // a lane's node.
+                        if (!t || S !== null) globalQueue.enqueue(n, e.J ??= GlobalQueue.X.bind(null, e), S);
         }
-        if (e.o?._) ; else if (s) {
-            const u = l ? e.o?.Fe : undefined;
-            if (n && R === 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
-            // paying it per effect on the plain path is pure overhead.
-            // DIRECT_COMMIT effects (resolve/until) commit directly even under
-            // 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.
-            t && R === null && (activeTransition !== e.we || activeTransition === null || e.C & 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 && !t && currentOptimisticLane !== null) GlobalQueue.Me(e, N, currentOptimisticLane); else e.ce = N;
-                if (i) e._e = NOT_PENDING;
+        // Lanes. A written guess's own pass from the frame: its source
+        // recomputed it — the truth (A18: "the source is whatever recomputes the
+        // node"). It stages under the lane's parent whether or not it changed (a
+        // confirm is a landing too — the lane's end commits it) and notifies
+        // only a correction: an equal truth re-runs nothing (lanes.ts). (As the
+        // lane's own work the lane judged it — `laneStage`.)
+                if (!t && S === null && e.u & CONFIG_GUESS && GlobalQueue.Qe(e, I, c)) ; else if (c) ; else if (o) {
+            // L2: a first pass is born held — staged, committed with the
+            // transaction, its effect's first run the landing's (A29; `effect()`
+            // skips the synchronous first run on a staged value) — when the flush
+            // has joined a transaction and either the pass read a held node (it
+            // derives from that world — the join merged the node's transaction
+            // into the flush's), or — a verdict lane's mount, mainline — read a
+            // staging of this flush (the same world before the seam parks it; the
+            // mount is not shown ahead of it: #3851), or a pass created it (ruling
+            // A: a held pass's children are the transaction's). Any other mount
+            // that read a staging does not join by being new (2026-10-07): it
+            // publishes and re-derives if the flush parks. A node created outside any pass
+            // that read only the committed world (root setup, a mount, an effect
+            // callback) is nobody's frame and publishes directly, as does a first
+            // pass that runs before anything joins: the pass's input, not a verdict
+            // after it. An effect still carrying an uncommitted staged value
+            // re-stages: the commit applies the latest pass, not the born-held one.
+            if (S !== null) {
+                // Lane work: the lane's value — into the slot while the lane has not
+                // revealed (its reveal shows it), as its staging once it has (the
+                // next reveal promotes it; the screen keeps the revealed value). An
+                // effect's value slot is private: the run the lane holds is what
+                // shows it — unless the effect was born held, whose first run is the
+                // commit's (A29): it re-stages, as below.
+                if (n && e.Ae === NOT_PENDING) e.pe = I; else if (n || S.ve) e.Ae = I; else e.m.Z = I;
+            } else if (t ? !((flushTransaction !== null || passTx !== null) && (f || E && e.R & REACTIVE_STAGED_READ || (creatorPass(r)?.R ?? 0) & REACTIVE_JOINED)) : n && e.Ae === NOT_PENDING) {
+                // A first pass publishes directly. So does an effect: its value slot
+                // is private (only its own run reads it), and the staging round-trip
+                // (queuePendingNode + commitPendingNodes) paid per effect on the
+                // plain path is pure overhead.
+                // NOTE (stage-3, 2026-08-21): a quiet-world MEMO direct-commit was
+                // attempted here and REVERTED — memo staging is load-bearing beyond
+                // transitions: mid-batch pulls (read-triggered recomputes before
+                // sources commit) must see the fresh value while PLAIN reads stay
+                // committed until flush (#3009 purity). The pending round-trip is
+                // that separation; it cannot be skipped on any path a pull can reach.
+                e.pe = I;
             } else {
-                e._e = N;
-                if (R !== 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.
-                    // (A re-pass under a fresh boundary — the in-flush form — is
-                    // already the transaction's: restaged, not re-queued.)
-                    if (e.we !== R) {
-                        e.we = R;
-                        R.Gn.push(e);
-                    }
-                    if (t) R.In.add(e);
-                    // Under a boundary that has not revealed, a held first value is
-                    // something not ready under it (#3540): the boundary collects this
-                    // node as a source and shows its fallback; the source stays
-                    // collected while born held (CollectionQueue._checkSources) and
-                    // is released by the commit that initializes it. A boundary that
-                    // already shows content is not told — it holds like any reader.
-                                        if (underFreshLoadingBoundary(e)) e.T.notify(e, STATUS_PENDING, STATUS_PENDING, new NotReadyError(e));
+                e.Ae = I;
+                // Born held: in the transaction from birth, so a read of it this
+                // tick is a read of its world (the mount-during-a-hold case), not
+                // only after the seam parks it.
+                                if (t) {
+                    holdNode(e, flushTransaction ?? passTx);
+                    // Born into the future: no committed value until the landing
+                    // (`commitPendingNode` initializes it) — every reader of it
+                    // derives from the future (`read`), an untracked one throws
+                    // (A19 exc. 1).
+                                        e.G |= STATUS_UNINITIALIZED;
                 }
-                // 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 (_) e.ve = 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. 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.C & CONFIG_HAS_COMPANIONS && GlobalQueue.Ve !== null) GlobalQueue.Ve(e, N);
             }
             // insertSubs only walks _subs (no scheduling of its own), so a
             // subscriber-less node has nothing to notify.
-                        if (e.u !== null && (!l || i || e.o?.Fe !== 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.hn !== clock) GlobalQueue.ke(e, N);
-        } 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._e === NOT_PENDING) queuePendingNode(e);
-            e._e = N;
-            if (_) e.ve = true;
- // see the held branch above (#2990)
-            // 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.ke(e, N);
-        } else if (e.rn != I) {
-            for (let n = e.u; n !== null; n = n.Ae) {
-                insertIntoHeapHeight(n.ge, queueFor(n.ge));
+                        if (e.t !== null) {
+                insertSubs(e);
+                // Lane work re-staged: the lane's members re-derive as its work.
+                                if (S !== null) laneDirty(e, S);
             }
+        } else if (e.Le != a) {
+            for (let t = e.t; t !== null; t = t.l) insertIntoHeapHeight(t.o, dirtyQueue);
         }
         // Silent recovery: errored → unchanged value fires no notification, but
         // dependents still holding the propagated error consumed their dirty flag
         // 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 (!s && !e.o?._) {
-            if (o !== undefined) settleErroredDependents(e, o);
+                if (!o && !e.m?.V) {
+            if (s !== undefined) settleErroredDependents(e, s);
             // Self-registration (this node's own superseded flight) is the #3181
             // sweep's business below — retiring it here too would walk twice.
-                        if (a) for (const n of a) if (n !== e) settlePendingSource(e, n);
+                        if (l) for (const t of l) 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 (c && !(e.h & (STATUS_PENDING | STATUS_UNINITIALIZED))) {
-            settlePendingSource(e);
-            // The superseded flight will not enter its waiting transactions at
-            // landing. Recheck them now so an unchanged value cannot leave their
-            // writes parked after the last pending source has settled.
-                        wakeParked();
-        }
+                if (_ && !(e.G & (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 D = e.Nn;
-    if (t && (s && !(e.h & STATUS_PENDING) || (D === null ? e.Ie !== null : D.Ne !== 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
+    // A first pass that went pending where the born-held arm would have held
+    // its value (it read a held node, or a verdict lane's mount read a staging,
+    // #3851) is born into that transaction without holding it: the hold never
+    // waits for a first load (the direction rule), but the answer lands into it
+    // while it is live (A29, #3800).
+        if (t && S === null && (f || E && e.R & REACTIVE_STAGED_READ) && e.G & STATUS_PENDING) ext(e).Re = flushTransaction ?? passTx;
+    // Dependencies are the committed frame's until it is replaced (A30, #3410):
+    // 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 until the commit. A pass that
+    // published directly, or changed nothing, 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._e === NOT_PENDING && !(t && e.Xe)) {
-        if (n || i || t === EFFECT_TRACKED) trimStaleDeps(e); else if (e.Nn?.Ne ?? e.Ie) heldTrims.push(e);
-    }
-    currentOptimisticLane = O;
-    // A parked LANE frame is not a hold (#3662): its drain is the effect's own
-    // run, not a commit — the node is neither queued nor stamped for it, and
-    // the release below (for transaction zombies) leaves it parked.
-        const G = (e.C & CONFIG_LANE_FRAME) !== 0;
-    const h = e._e !== NOT_PENDING || !G && e.o !== null && (e.o._n !== null || e.o.fn !== null) || (e.h & (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.
-    
-    // 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. A LANE pass is the same case
-    // (#3662): it direct-commits ahead of its transaction, so its children are
-    // the frame's too. Left flagged for an OLDER frame's zombies, the stamped
-    // transaction's same-flush re-run below disposed the lane's freshly built
-    // children (an insert's inner effect, its run still queued in the lane)
-    // and held their replacements for a commit that never came.
-        let P = h && (!n || R !== null || (e.h & STATUS_PENDING) !== 0);
-    if (P && (!e.we || l)) queuePendingNode(e); else if (P && (activeTransition === null || i) && !(e.h & (STATUS_PENDING | STATUS_UNINITIALIZED))) {
-        P = false;
-        if (!G) disposeChildren(e, false, true);
+    // applied by, not the value slot (#3438): a pass that still owes a run
+    // (`_modified`) has not replaced what the last run published, so its tail
+    // waits for `runEffect` to trim once the run applies. A pass that changed
+    // nothing replaced nothing either (#3469): it cannot know at its tail
+    // whether the flush that ran it will park with its inputs held, so the
+    // trim waits on the flush's verdict (`heldTrim`: trimmed at the commit,
+    // kept at a park — one spurious recompute at most). A creation pass and a
+    // tracked effect trim now: their frames are replaceable like a direct
+    // commit, and a tracked effect's spurious run would be user-visible.
+        if (!e.m?.V && e.Ae === NOT_PENDING && !(n && e.Fe)) {
+        if (t || n === EFFECT_TRACKED) trimStaleDeps(e); else heldTrim(e);
     }
-    if (P) e.C |= CONFIG_HELD_CHILDREN; else e.C &= ~CONFIG_HELD_CHILDREN;
-    // (A born-held pass IS the transaction's staged view — nothing to refresh.)
-        if (e.we && t && activeTransition !== e.we && R === 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 n = e.pn;
-        runInTransition(e.we, () => recompute(e));
-        e.pn = n;
+    // A staged value, a parked frame (L2: the commit retires it), or status the
+    // commit sweep must settle (a pending or uninitialized pass), queues the
+    // node for this flush's commit. A first pass queues only when pending or
+    // born held: otherwise its value published directly. A queued pass's
+    // children are uncommitted (CONFIG_STAGED) until that commit.
+        if (e.Ae !== NOT_PENDING || e.m !== null && (e.m.Me !== null || e.m.Be !== null) || (e.G & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0 && (!t || (e.G & STATUS_PENDING) !== 0)) {
+        e.u |= CONFIG_STAGED;
+        // Lane work is the lane's to reveal (its seam), not this flush's commit.
+                if (S === null) queuePendingNode(e);
     }
+    setPassLane(E);
     // 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,
     // and a re-run only latches again if another nested commit changes a dep
     // beneath it — convergent unless deps genuinely keep changing.
-        if (T) {
+        if (N) {
         enqueueSub(e);
         schedule();
     }
@@ -708,38 +489,38 @@ 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.oe & (REACTIVE_RECOMPUTING_DEPS | REACTIVE_DISPOSED)) return;
-    if (e.oe & REACTIVE_CHECK) {
-        for (let n = e.Ie; n; n = n.Ne) {
-            const t = n.Oe;
-            const i = t.De || t;
-            if (i.he) {
-                updateIfNecessary(i);
+    if (e.R & (REACTIVE_RECOMPUTING_DEPS | REACTIVE_DISPOSED)) return;
+    if (e.R & REACTIVE_CHECK) {
+        for (let t = e._; t; t = t.p) {
+            const n = t.I;
+            if (n.re) {
+                updateIfNecessary(n);
             }
-            if (e.oe & REACTIVE_DIRTY) {
+            if (e.R & REACTIVE_DIRTY) {
                 break;
             }
         }
     }
-    if (e.oe & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.o?._ && e.be < clock && !e.o?.Ce) {
+    if (e.R & REACTIVE_DIRTY || e.m?.V && e.Ne < clock && !e.m?.De) {
         recompute(e);
     }
     // The guard above refused an already-disposed node; the recompute it just
     // ran may have disposed it (#3621) — carry the flag, or it comes back alive.
-    // The manual-write mask is state, not scheduling (#3612): it says the
-    // node's staging is a PROPOSAL, and only the commit (or a later-tick
-    // refresh, #3026) lifts it — a pull that recomputed nothing must not, or
-    // an isPending()/latest() probe decided whether a later write to a held
-    // node was a second proposal or the derivation's `prev`.
-        e.oe = e.oe & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT | REACTIVE_ZOMBIE | REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE);
+    // The manual-write mark is state, not scheduling (#3612, A34 rule B): it
+    // says the node's staging is a PROPOSAL, lifted by a pass that re-derives
+    // or by the commit — a pull that recomputed nothing must not. Nor may it
+    // erase the last pass's verdicts for the landing (a stale reader's
+    // REACTIVE_FRAME_READ — a verdict reader pulled by a sibling before the
+    // landing lost its re-derivation; the lane reads likewise).
+        e.R = e.R & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT | REACTIVE_ZOMBIE | REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE | REACTIVE_FRAME_READ | REACTIVE_STAGED_READ | REACTIVE_LANE_READ | REACTIVE_SCREEN_READ | REACTIVE_PROBE_UNANSWERED);
 }
 
-function computed(e, n) {
-    const t = n?.transparent ?? false;
+function computed(e, t) {
+    const n = t?.transparent ?? false;
     // `in` (not `!== undefined`): an explicit `loadingValue: undefined` on a
     // `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 = n !== null && typeof n === "object" && "loadingValue" in n;
+        const E = t !== null && typeof t === "object" && "loadingValue" in t;
     // 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
@@ -749,43 +530,40 @@ function computed(e, n) {
     // two in sync — the dist artifact test pins observe's key set to prod's
     // plus `_name`.
         const u = {
-        id: inheritId(n, t, context),
-        C: (t ? CONFIG_TRANSPARENT : 0) | (n?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || n?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (n?.sync ? CONFIG_SYNC : 0) | (n?.H ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        xe: n?.equals ?? isEqual,
-        qe: null,
-        T: context?.T ?? globalQueue,
-        Je: context?.Je ?? defaultContext,
-        En: 0,
-        he: e,
-        ce: i ? n.loadingValue : undefined,
-        rn: 0,
-        Pn: undefined,
-        Fn: null,
-        Ie: null,
-        Nn: null,
+        id: inheritId(t, n, context),
+        u: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.ie ? CONFIG_NO_SNAPSHOT : 0) | (t?.we ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        We: t?.equals ?? isEqual,
+        Pe: null,
+        U: context?.U ?? defaultContext,
         Ye: 0,
-        u: null,
-        mn: null,
+        re: e,
+        pe: E ? t.loadingValue : undefined,
+        Le: 0,
+        je: undefined,
+        Ke: null,
+        _: null,
+        S: null,
+        Ge: 0,
+        t: null,
+        qe: null,
         _parent: context,
-        un: null,
-        gn: null,
-        tn: null,
-        oe: n?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
+        me: null,
+        Je: null,
+        ge: null,
+        R: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
         // A loadingValue node is born committed: commit #0 is already in _value.
-        h: i ? 0 : STATUS_UNINITIALIZED,
-        be: clock,
-        _e: NOT_PENDING,
-        we: null,
-        vn: -1,
-        ve: i,
-        // Cold machinery (async/transition/optimistic/verdict slots) lives one
-        // hop away in the lazily-allocated extension — the core literal MUST
+        G: E ? 0 : STATUS_UNINITIALIZED,
+        Ne: clock,
+        Ae: NOT_PENDING,
+        ze: -1,
+        _e: E,
+        // Cold machinery (async 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
+        m: null
     };
-    if (n?.unobserved) ext(u).Hn = n.unobserved;
-    setupComputedNode(u, n);
+    if (t?.unobserved) ext(u).Xe = t.unobserved;
+    setupComputedNode(u, t);
     return u;
 }
 
@@ -793,269 +571,274 @@ function computed(e, n) {
  * computeds — `_x` access stays monomorphic). Installers write through
  * 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 ??= {
-        Fe: undefined,
-        Ln: undefined,
-        hn: 0,
-        bn: NOT_PENDING,
-        Vn: 0,
-        me: undefined,
-        Ze: undefined,
-        He: undefined,
-        kn: undefined,
-        t: 0,
-        Ce: null,
-        ye: null,
-        _: undefined,
-        Pe: undefined,
-        ue: undefined,
-        S: undefined,
-        Le: false,
-        i: null,
-        Hn: undefined,
-        sn: undefined,
-        fn: null,
-        _n: null,
-        Un: undefined
+    return e.m ??= {
+        De: null,
+        Te: null,
+        V: undefined,
+        Ie: undefined,
+        Se: undefined,
+        Xe: undefined,
+        xe: undefined,
+        Me: null,
+        Be: null,
+        ke: null,
+        Re: null,
+        be: false,
+        $e: NOT_PENDING,
+        et: -1,
+        Oe: 0,
+        Z: NOT_PENDING,
+        T: 0
     };
 }
 
+/** A tracked read of a held node (the reader derives from its transaction's
+ * world): the reading pass is marked as having read it (born-held decision
+ * in `recompute`), and the flush joins the node's transaction — unless the
+ * reader is a render effect. A render effect is the frame, not a derivation
+ * (rule 3): in that transaction's own flush, or born into it (uninitialized,
+ * A29), it reads the staged value and holds nothing of its own; otherwise it
+ * reads the committed value instead (`frameRead`). A node born into the
+ * future has no committed value: every reader joins it. A first pass is
+ * something not ready under a loading boundary that has not shown content:
+ * the boundary collects it and shows its fallback, and the pass is the
+ * boundary's, not the tick's (A29's boundary exemption, #3540). */ function joinPass(e, t) {
+    e.R |= REACTIVE_JOINED;
+    if (t.G & STATUS_UNINITIALIZED || e.i !== EFFECT_RENDER) joinPassTx(txOf(t), GlobalQueue.ce?.(e));
+}
+
+/** A15's stale reader (shared-hole and reveal corollaries): a render effect
+ * reading a node held by a transaction that is not the flush's. It is served
+ * the committed value — a pending one's too — publishes mainline, and is
+ * re-derived after that transaction's landing (`_reruns`,
+ * REACTIVE_FRAME_READ) so the frame catches up with it once it is the
+ * committed world. Not a frame born into that transaction (held and never
+ * committed — created by one of its held passes, A29): that one reads its
+ * transaction's values and keeps staging. Not of a flight whose inputs are
+ * already visible (CONFIG_INPUTS_PUBLISHED, #3305): its committed value
+ * would tear against them, so the reveal observes the flight instead. Once
+ * per pass.
+ *
+ * Lane work is a stale reader too (maintainer, 2026-10-01: a lane sees the
+ * screen plus its own guesses). A held write is held because showing it
+ * would tear against the rest of its frame; a lane revealing a derivation
+ * of it would show it anyway, beside inputs still committed elsewhere on
+ * the page. The guess is the one value the user opted into predicting. So
+ * a lane pass reading a transaction's held node — its parent's or any
+ * other's — derives from the committed value and is re-derived at that
+ * landing. The case read-through was built for — a corrected guess whose
+ * downstream async must refetch with the truth at once, while another of
+ * the parent's flights is still up — needs none of this: the correction
+ * dissolves the lane, and the refetching pass is the parent's own, reading
+ * the truth as a member (`joinPass`). */ function frameRead(e, t) {
+    // Frame readers: a render effect, a verdict reader (CONFIG_VERDICT — it
+    // reads the screen like one: `[isPending(x), x()]` never pairs the fresh
+    // value with pending, A10, because the reader never sees the fresh value),
+    // and lane work (a lane sees the screen plus its own guesses). Not a
+    // mount's memo (2026-10-02, considered and reverted): a memo is not a
+    // leaf — the transaction's own later passes read it — so a mainline mount's
+    // derivations carry the future (A29, born held); only its direct bindings
+    // read the screen. Lane work with no committed value yet reads a flight
+    // as a mount's memo does: it enters, and the boundary it mounts catches
+    // the pending (#3540).
+    const n = e.u & CONFIG_VERDICT;
+    if ((passLane === null || e.G & STATUS_UNINITIALIZED && t.G & STATUS_PENDING) && !n && (e.i !== EFFECT_RENDER || t.u & CONFIG_INPUTS_PUBLISHED)) return false;
+    const E = txOf(t);
+    // Lane work and verdict readers are never the transaction's pass, whichever
+    // flush runs it: a node T holds re-enters T when it re-runs (`recompute`'s
+    // head), and the pass may then read a guess and become the lane's.
+        if (E === flushTransaction && passLane === null && !n || e.G & STATUS_UNINITIALIZED && e.u & CONFIG_HELD && txOf(e) === E) return false;
+    staleReader(e, E);
+    return true;
+}
+
+/** The computed whose pass a creation under `owner` belongs to (a root's is
+ * its nearest computed ancestor's), or null outside every pass. */ function creatorPass(e) {
+    return e !== null && e.Et ? e.ut : e;
+}
+
+/** L2 — park the previous pass's frame for this node's commit: the children
+ * (already allocated — nothing new) and the `_disposal` list move to the
+ * extension, keep reacting from the heap, and die when the commit publishes
+ * the frame that replaces them (`commitPendingNode`) or when the owner does. */ function parkChildren(e) {
+    markDisposal(e);
+    const t = ext(e);
+    t.Be = e.Pe;
+    t.Me = e.ge;
+    e.Pe = null;
+    e.ge = null;
+    e.Ye = 0;
+}
+
 /**
  * Build an Effect node with all effect-specific fields baked into a single object literal,
  * 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, n, t, i, u) {
-    const l = u?.transparent ?? false;
+ */ function createEffectNode(e, t, n, E, u) {
+    const s = u?.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 r = {
-        id: inheritId(u, l, context),
-        C: (l ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (u?.yn ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        xe: false,
-        qe: null,
-        T: context?.T ?? globalQueue,
-        Je: context?.Je ?? defaultContext,
-        En: 0,
-        he: e,
-        ce: undefined,
-        rn: 0,
-        Pn: undefined,
-        Fn: null,
-        Ie: null,
-        Nn: null,
+        const i = {
+        id: inheritId(u, s, context),
+        u: (s ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (u?.we ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        We: false,
+        Pe: null,
+        U: context?.U ?? defaultContext,
         Ye: 0,
-        u: null,
-        mn: null,
+        re: e,
+        pe: undefined,
+        Le: 0,
+        je: undefined,
+        Ke: null,
+        _: null,
+        S: null,
+        Ge: 0,
+        t: null,
+        qe: null,
         _parent: context,
-        un: null,
-        gn: null,
-        tn: null,
-        oe: REACTIVE_LAZY,
-        h: STATUS_UNINITIALIZED,
-        be: clock,
-        _e: NOT_PENDING,
-        we: null,
-        vn: -1,
-        ve: false,
-        Xe: false,
-        xn: undefined,
-        Qn: n,
-        Mn: t,
-        wn: undefined,
-        je: i,
-        pn: null,
-        o: null
+        me: null,
+        Je: null,
+        ge: null,
+        R: REACTIVE_LAZY,
+        G: STATUS_UNINITIALIZED,
+        Ne: clock,
+        Ae: NOT_PENDING,
+        ze: -1,
+        _e: false,
+        Fe: false,
+        Ze: undefined,
+        st: t,
+        it: n,
+        lt: undefined,
+        i: E,
+        m: null
     };
     // Effects dispatch status through the SHARED notifier (statusNotifierOf,
     // keyed off _type) — storing it per node forced a full NodeExtension
     // 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(r).Hn = u.unobserved;
-    setupComputedNode(r, lazyOptions);
-    return r;
+        if (u?.unobserved) ext(i).Xe = u.unobserved;
+    setupComputedNode(i, lazyOptions);
+    return i;
 }
 
 /**
  * The shared status notifier for effect nodes, installed once by effect.ts
  * at module evaluation (`this`-dispatched — one function serves every
- * effect, so nodes never store it). Boundary computeds keep their own
- * per-node channel on `_x._notifyStatus`, which takes precedence.
+ * effect, so nodes never store it). CARVE 4: the boundaries' per-node
+ * channel (`_x._notifyStatus`) went with them; effects are the only
+ * display consumers.
  */ let effectStatusNotify = null;
 
 function setEffectStatusNotify(e) {
     effectStatusNotify = e;
 }
 
-/** Resolve a node's status notifier: an own `_x` channel (boundaries) wins;
- * effect nodes (`_type` — EFFECT_PURE is 0, and only effect literals carry
- * the field) fall back to the shared notifier. Presence doubles as the
- * "display consumer" membership test in the status walks, exactly as the
- * per-node field did when every effect carried one. */ function statusNotifierOf(e) {
-    const n = e.o?.S;
-    if (n !== undefined) return n;
-    return e.je ? effectStatusNotify ?? undefined : undefined;
+/** Resolve a node's status notifier: effect nodes (`_type` — EFFECT_PURE is
+ * 0, and only effect literals carry the field) get the shared notifier.
+ * Presence doubles as the "display consumer" membership test in the status
+ * walks, exactly as the per-node field did when every effect carried one. */ function statusNotifierOf(e) {
+    return e.i ? effectStatusNotify ?? undefined : undefined;
 }
 
 const lazyOptions = {
     lazy: true
 };
 
-function setupComputedNode(e, n) {
-    e.Fn = e;
-    const t = context?.Wn ? context.qn : context;
+function setupComputedNode(e, t) {
+    e.Ke = e;
+    const n = context?.Et ? context.ut : context;
     if (context) linkChild(context, e);
-    if (t) e.rn = t.rn + 1;
-    if (GlobalQueue.Zn !== null) GlobalQueue.Zn(e);
-    !n?.lazy && recompute(e, true);
-    if (snapshotCaptureActive && !n?.lazy) {
-        if (!(e.h & STATUS_PENDING) && !(e.C & CONFIG_NO_SNAPSHOT)) {
-            ext(e).sn = e.ce === undefined ? NO_SNAPSHOT : e.ce;
-            e.C |= CONFIG_HAS_SNAPSHOT;
+    if (n) e.Le = n.Le + 1;
+    GlobalQueue._t?.(e);
+    !t?.lazy && recompute(e, true);
+    if (snapshotCaptureActive && !t?.lazy) {
+        if (!(e.G & STATUS_PENDING) && !(e.u & CONFIG_NO_SNAPSHOT)) {
+            ext(e).xe = e.pe === undefined ? NO_SNAPSHOT : e.pe;
+            e.u |= CONFIG_HAS_SNAPSHOT;
             snapshotSources.add(e);
         }
     }
 }
 
-function signal(e, n, t = null) {
+function signal(e, t) {
     // 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 = {
-        xe: n?.equals ?? isEqual,
-        C: (n?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (n?.H ? CONFIG_NO_SNAPSHOT : 0),
-        ce: e,
-        u: null,
-        mn: null,
-        be: clock,
-        De: t,
-        Ue: t?.o?.i || null,
-        Yn: null,
-        _e: NOT_PENDING,
+    const n = {
+        We: t?.equals ?? isEqual,
+        u: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.ie ? CONFIG_NO_SNAPSHOT : 0),
+        pe: e,
+        t: null,
+        qe: null,
+        Ne: clock,
+        Ae: 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).
-        we: null,
-        vn: -1,
-        o: null
+        ze: -1,
+        m: null
     };
-    if (n?.unobserved) ext(i).Hn = n.unobserved;
-    if (t) linkFirewallChild(t, i);
-    if (snapshotCaptureActive && !(i.C & CONFIG_NO_SNAPSHOT) && !((t?.h ?? 0) & STATUS_PENDING)) {
-        ext(i).sn = e === undefined ? NO_SNAPSHOT : e;
-        i.C |= CONFIG_HAS_SNAPSHOT;
-        snapshotSources.add(i);
+    if (t?.unobserved) ext(n).Xe = t.unobserved;
+    if (snapshotCaptureActive && !(n.u & CONFIG_NO_SNAPSHOT)) {
+        ext(n).xe = e === undefined ? NO_SNAPSHOT : e;
+        n.u |= CONFIG_HAS_SNAPSHOT;
+        snapshotSources.add(n);
     }
-    return i;
-}
-
-// ---------------------------------------------------------------------------
-// SLOT SIGNALS (store leaves) — the create-floor diet. Store mounts
-// materialize one signal per touched leaf (~13 × rows on dbmon), so per-node
-// allocations are mount bytes: the generic path costs an options object, an
-// equals closure, an unobserved closure, a NodeExtension to hold it, and
-// three post-construction expandos (acc/px/pxv → hidden-class transitions).
-// slotSignal bakes everything into ONE literal: `_host`/`_key` backrefs
-// replace the closures (equals is a method call — `this` is the node; the
-// unobserved sweep dispatches CONFIG_SLOT_NODE to one shared hook), and the
-// store's wrap-cache fields are pre-shaped.
-/** The shared slot-node unobserved handler — a live binding read directly by
- * the sweep sites (no wrapper frame, no null check: a CONFIG_SLOT_NODE node
- * existing implies the store module loaded and registered the hook). */ let slotUnobservedHook;
-
-/** Install the shared slot-node unobserved handler (store module, once). */ function setSlotUnobserved(e) {
-    slotUnobservedHook = e;
+    return n;
 }
 
-/** 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, n) {
-    const t = n.Ue;
-    if (t !== null) t.Yn = n;
-    ext(e).i = n;
-    e.C |= CONFIG_FW_CHILDREN;
+function isEqual(e, t) {
+    return e === t;
 }
 
-/** 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 n = e;
-    const t = n.De;
-    if (!t) return;
-    const i = n.Yn;
-    const u = n.Ue;
-    if (i !== null) i.Ue = u; else if (t.o.i === n) t.o.i = u;
-    if (u !== null) u.Yn = i;
-    n.Yn = 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.
-        t.o.Un?.delete(n);
-}
-
-function slotSignal(e, n, t, i, u, l = null) {
-    // Prod and observe boilerplates — see computed(). The store relabels the
-    // observe slot (`store.<key>`) when the attribution engine is installed.
-    const r = {
-        xe: n,
-        C: CONFIG_OWNED_WRITE | CONFIG_SLOT_NODE,
-        ce: e,
-        u: null,
-        mn: null,
-        be: clock,
-        De: l,
-        Ue: l?.o?.i || null,
-        Yn: null,
-        _e: NOT_PENDING,
-        we: null,
-        vn: -1,
-        o: null,
-        // Slot backrefs: what the equals/unobserved closures used to capture.
-        Bn: t,
-        Kn: i,
-        // Store read-path caches, pre-shaped (were post-construction expandos).
+/** A store slot node (CONFIG_SLOT_NODE): the whole node in ONE literal — the
+ * target and key as back-refs in place of closures (`equals` is a method
+ * call, `this` the node; the unobserved sweep dispatches to one shared hook,
+ * graph.ts), the store's wrap cache (`px`/`pxv`: the proxy last served for
+ * this key and the raw it wrapped — one pointer compare replaces a WeakMap
+ * lookup per read) and the accessor verdict (`acc`) pre-shaped. No options
+ * object, no NodeExtension, no post-construction expandos. `ownedWrite` is
+ * baked in: the setter carries the owned-scope guard; node-level writes are
+ * the store's notification machinery. The observe literal adds the label
+ * slot (the store relabels it `store.<key>` when the engine is installed). */ function slotSignal(e, t, n, E, u) {
+    const s = {
+        We: t,
+        u: CONFIG_OWNED_WRITE | CONFIG_SLOT_NODE,
+        pe: e,
+        t: null,
+        qe: null,
+        Ne: clock,
+        Ae: NOT_PENDING,
+        ze: -1,
+        m: null,
+        ot: n,
+        rt: E,
         acc: u,
         px: undefined,
         pxv: undefined
     };
-    if (l) linkFirewallChild(l, r);
-    if (snapshotCaptureActive && !((l?.h ?? 0) & STATUS_PENDING)) {
-        ext(r).sn = e === undefined ? NO_SNAPSHOT : e;
-        r.C |= CONFIG_HAS_SNAPSHOT;
-        snapshotSources.add(r);
-    }
-    return r;
+    return s;
 }
 
-function optimisticSignal(e, n) {
-    const t = signal(e, n);
-    ext(t).Fe = NOT_PENDING;
-    t.C |= CONFIG_OPTIMISTIC;
-    return t;
-}
-
-function optimisticComputed(e, n) {
-    const t = computed(e, n);
-    ext(t).Fe = NOT_PENDING;
-    t.C |= CONFIG_OPTIMISTIC;
-    return t;
-}
+/**
+ * When set to a component name string, any reactive read that is not inside a nested tracking
+ * scope will log a dev-mode warning. Managed automatically by `untrack(fn, strictReadLabel)`.
+ */
+/** The verdict windows' read (verdict.ts), installed while a `latest` or
+ * `isPending` window is open and null otherwise: `read` dispatches to it
+ * then, and a program that never imports them never has one. */ let verdict = null;
 
-function isEqual(e, n) {
-    return e === n;
+function setVerdict(e) {
+    verdict = e;
 }
 
 /**
@@ -1079,15 +862,15 @@ function isEqual(e, n) {
  *   }
  * );
  * ```
- */ function untrack(e, n) {
-    if (GlobalQueue.jn === null && !tracking && true) return e();
-    const t = tracking;
+ */ function untrack(e, t) {
+    if (GlobalQueue.It === null && !tracking && true) return e();
+    const n = tracking;
     tracking = false;
     try {
-        if (GlobalQueue.jn !== null) return GlobalQueue.jn(e);
+        if (GlobalQueue.It) return GlobalQueue.It(e);
         return e();
     } finally {
-        tracking = t;
+        tracking = n;
     }
 }
 
@@ -1103,630 +886,327 @@ function isEqual(e, n) {
  * born-held tree would otherwise pull the mounting pass into the hold).
  */ let spectating = false;
 
-/**
- * Evaluates `fn` untracked, recording nothing on the current `context`: no
- * untracked-pending re-run link, no transaction entry. For bookkeeping reads
- * made on behalf of no node — see `spectating`.
- */ function spectate(e) {
-    const n = spectating;
-    spectating = true;
-    try {
-        return untrack(e);
-    } finally {
-        spectating = n;
-    }
-}
-
 /**
  * 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, n) {
-    if (e.oe & REACTIVE_LAZY) {
-        e.oe &= ~REACTIVE_LAZY;
+ * `refresh` additionally pulls the node fully up to date so its status flags
+ * reflect the current graph.
+ */ function prepareComputed(e, t) {
+    if (e.R & REACTIVE_LAZY) {
+        e.R &= ~REACTIVE_LAZY;
         recompute(e, true);
-    } else if (e.oe & REACTIVE_DISPOSED) {
+    } else if (e.R & 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
         // pay-for-use contract. Owner-lifecycle nodes are dead: recomputing would
         // re-run user code in a torn-down tree (and discard manual writes on
         // derived-writable signals), so reads return the last committed value.
-        if (e.C & CONFIG_AUTO_DISPOSE) {
-            const n = e._parent;
-            if (n !== null) {
+        if (e.u & CONFIG_AUTO_DISPOSE) {
+            const t = e._parent;
+            if (t !== null) {
                 // A dormant node was off the chain when its owner died, so the strip
                 // in disposeChildren missed it: freeze here instead (#3024).
-                if (n.oe & REACTIVE_DISPOSED) {
-                    e.C &= ~CONFIG_AUTO_DISPOSE;
+                if (t.R & REACTIVE_DISPOSED) {
+                    e.u &= ~CONFIG_AUTO_DISPOSE;
                     return;
                 }
-                // A zombie never left its chain: settleAutodispose releases without
-                // the !ZOMBIE check its siblings have, so this guard is load-bearing.
-                                if (!(e.oe & REACTIVE_ZOMBIE)) linkChild(n, e);
+                // A zombie never left its chain (the parked frame is drained whole,
+                // and its members skip the splice): relinking would put it on the
+                // live chain too.
+                                if (!(e.R & REACTIVE_ZOMBIE)) linkChild(t, e);
             }
             recompute(e, true);
         }
-    } else if (n) {
-        updateIfNecessary(e);
-    }
+    } else ;
 }
 
+// CARVE 3: until()'s authoritative-view wakeup (notifyAuthoritativeObservers /
+// installAuthoritativeRead), the stale-of-foreign clause (heldFromStale,
+// recordStaleReplay, ownsHold) and the transaction entry on a staged read
+// (enterStagedRead, stagedEntry / born held, underFreshLoadingBoundary) went
+// with the transactions.
 /**
- * Sentinel returned by readNodeFast when the plain-signal fast path does not
- * apply and the caller must fall back to the full read().
- */ const READ_SLOW = Symbol("read-slow");
-
-/**
- * read()'s plain-signal fast path as a standalone entry for hot callers
- * (store traps). Safe to substitute for read() only because the bail
- * conditions mirror read()'s prelude and fast-path guard exactly: the
- * latestRead and pendingCheck windows run side-effectful hooks before the
- * fast path, `_fn` nodes need prepareComputed, and firewall / override /
- * snapshot / transition / lane / dev-strictRead state all take the full
- * resolution. Anything slow returns READ_SLOW; the caller then calls read().
- */
-/**
- * Wake only authoritative-view readers (until() predicates) subscribed to `el`.
- * The A17-silent ack paths — an authoritative arrival equal to the active
- * override — use this so the predicate re-evaluates without re-firing
- * ordinary subscribers whose visible (override) value did not change.
- * Pay-for-use: reached through GlobalQueue._notifyAuthoritativeObservers,
- * installed at first until() call — apps that never use until() shake it.
- */ function notifyAuthoritativeObservers(e) {
-    for (let n = e.u; n !== null; n = n.Ae) {
-        const e = n.ge;
-        if (!(e.C & 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.oe & REACTIVE_RECOMPUTING_DEPS && n.Be === e.Ye && n !== e.Nn) e.oe |= REACTIVE_MISSED_WAKE;
-        enqueueSub(e);
-    }
-    schedule();
-}
-
-/** Installs the authoritative-reader wakeup hook. Idempotent; called by every
- * creator of a CONFIG_AUTHORITATIVE_READ computation — until() and refresh() —
- * 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.zn === null) GlobalQueue.zn = 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, n) {
-    const t = n.pn;
-    if (t == null || currentTransition(t) !== e) e.In.add(n);
-}
-
-/**
- * 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, n) {
-    const t = e.we;
-    if (t === null || ownsHold(t)) return false;
-    const i = currentTransition(t);
-    recordStaleReplay(i, n);
-    const u = i.le.get(e);
-    if (u) u.add(n); else if (e.h & STATUS_PENDING) runInTransition(i, () => n.T.notify(n, 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.
- *
- * A pass under a FRESH loading boundary takes this path inside a flush too
- * (#3540). Born held is right for a plain memo or effect: published, its
- * value would tear the frame. A boundary that has not revealed yet is the
- * exception by definition — its job is to catch what is not ready under it
- * rather than let it hold: the pass is staged into the transaction as
- * above, and the boundary is told (recompute's born-held arm notifies it
- * with a `NotReadyError` sourced at the node) so it shows its fallback now
- * and reveals the staged result at the commit.
- * Entering instead adopted the whole flush into the hold — a `Show` that
- * flipped mainline to mount a `Loading` over a held value waited for the
- * hold with it. A boundary that already shows content keeps the entering
- * path: it has content to keep, and holds like any reader. */ let stagedEntry = null;
-
-/** Is `el` routed to a loading boundary that still shows its fallback — the
- * nearest pending-collecting queue up its chain is uninitialized? (Measured
- * 2026-09-18: relocating the walk behind a `GlobalQueue` slot installed by
- * boundaries.ts saved ~8 B on the core floor and cost boundary-using apps
- * 50–70 B — the indirection's tokens outweigh the walk. Kept inline.) */ function underFreshLoadingBoundary(e) {
-    for (let n = e.T; n !== null; n = n._parent) if (n.te & STATUS_PENDING) return !n.q;
-    return false;
-}
-
-function enterStagedRead(e, n = e.we) {
-    if (!n || n === 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?.kn || context?.o?.kn) return;
-    // A bookkeeping read (`spectate`) is nobody's derivation: it compares or
-    // probes, and enters nothing — the boundary priming read of a born-held
-    // tree must not enter the creator's pass into the hold (#3540).
-        if (spectating) 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 t = context;
-    const i = activeTransition === null && !globalQueue.Jn;
-    // 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 (i && GlobalQueue.Xn) return;
-    if (t.oe & REACTIVE_RECOMPUTING_DEPS && !(t.C & CONFIG_OPTIMISTIC) && (stagedEntry === null || stagedEntry === n) && (i || !GlobalQueue.Xn && underFreshLoadingBoundary(t))) {
-        stagedEntry = n;
-        return;
-    }
-    globalQueue.initTransition(n);
-}
-
-/**
- * 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:
+ * Rule 1 (value selection): does this reader see a STAGED node's COMMITTED
+ * value? One implementation of the rule the fast paths (read's fast block)
+ * carry as their trivial ternary. 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`);
- * - HELD truth (#3164, CONFIG_HELD_TRUTH) read by a LANE pass: staged
- *   confirming truth — fold-staged onto an armed family, or entangle-stolen
- *   by an awaited until() — is masked from lane passes only, owning
- *   transaction or not. A lane applies its frame display-ahead at the park,
- *   so a lane pass served the truth would paint the confirmation beside the
- *   optimism it confirms (`saving=true` beside the saved row — the #3164
- *   tear); it keeps committed and is re-run by the reveal's post-revert
- *   wake. Every other deriving reader falls through to A29 below: the truth
- *   is a staged value like any other, and the pass that derives from it is
- *   held with it — including the retaining transaction's own passes, which
- *   a superseded override already hands the truth (#3568: masking them
- *   composed the landed `length` with rows still masked to committed).
- *   latest() and authoritative readers (until()'s predicate) tunnel
- *   through — 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, n, t, i) {
-    return !!(!n || currentOptimisticLane !== null && GlobalQueue.$n(e, t, n) || e._e === NOT_PENDING || n.C & CONFIG_CHILDREN_FORBIDDEN || stale && !i && heldFromStale(e, n) || e.C & CONFIG_HELD_TRUTH && currentOptimisticLane !== null && !latestReadActive && !(n.C & CONFIG_AUTHORITATIVE_READ));
+ *   never the graph — A32).
+ * False means the reader derives from the staged value.
+ */ function readerSeesCommitted(e, t) {
+    return !!(!t || e.Ae === NOT_PENDING || t.u & CONFIG_CHILDREN_FORBIDDEN);
 }
 
-/** 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;
+/** A28 — set when a node is staged (queuePendingNode) 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;
+/** A28 — a write becomes visible at flush. Outside a flush, a node holding a
+ * staged value was written since the last flush: staging commits at flush
+ * end, so nothing else leaves a node in this state. Inside a flush the rule
+ * does not apply (A28 (4): promoted within the round). The value an
+ * unflushed node serves is its committed value, or NOT_PENDING when nothing
+ * is unflushed. Exempt: promoted writes (A28 (4): a write issued inside a
+ * recompute is promoted at that recompute's end — boundary and loading
+ * machinery, signals declared for in-computation writes). */ function unflushedValue(e) {
+    if (globalQueue.ee || e.Ae === NOT_PENDING || e.u & CONFIG_PROMOTED) return NOT_PENDING;
+    // A held node (L2) carries a staged value between flushes too, but it was
+    // flushed — and parked. Not an unflushed write — unless rewritten since:
+    // then the flushed staging is what the world sees until the next flush.
+        if (e.u & CONFIG_HELD) return e.m.et === clock ? e.m.$e : NOT_PENDING;
+    return e.pe;
 }
 
-/** 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, n = e.ce) {
-    if (globalQueue.Jn || e._e === NOT_PENDING || e.C & CONFIG_PROMOTED || e.o?.kn) 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.we === null || e.C & CONFIG_ADOPTED_UNFLUSHED) return n;
-    return e.o === null ? NOT_PENDING : e.o.bn;
+/** A28: a held node rewritten outside a flush keeps the staging the last
+ * flush left (`_flushed`) until the flush that carries the rewrite — the
+ * stash is stamped with the clock, which that flush advances. */ function stashFlushed(e) {
+    const t = e.m;
+    if (t.et !== clock) {
+        t.$e = e.Ae;
+        t.et = clock;
+        unflushedStaged = true;
+    }
 }
 
-/** 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.Jn && e.o?.hn === clock && !e.o?.kn;
-}
-
-/** 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 n = e.o;
-    return n !== null && n.Fe !== undefined && n.Fe !== 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.oe |= REACTIVE_MISSED_WAKE;
+    e.R |= 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.bn = NOT_PENDING;
-        unflushedRewrites.length = 0;
-    }
-    if (promotedWrites.length !== 0) {
-        for (const e of promotedWrites) e.C &= ~CONFIG_PROMOTED;
+        if (promotedWrites.length !== 0) {
+        for (const e of promotedWrites) e.u &= ~CONFIG_PROMOTED;
         promotedWrites.length = 0;
     }
-    if (unflushedCompanions.length !== 0) {
-        for (const e of unflushedCompanions) GlobalQueue.Ve(e, e._e !== NOT_PENDING ? e._e : e.ce);
-        unflushedCompanions.length = 0;
-    }
 }
 
-function readNodeFast(e) {
-    if (latestReadActive || pendingCheckActive || e.he || e.De || e.o?.Fe !== undefined || e.o?.sn !== 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._e !== NOT_PENDING || false) return READ_SLOW;
-    let n = context;
-    if (n?.Wn) n = n.qn;
-    if (n && tracking) link(e, n);
-    // 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).
-    // 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 !n || e._e === NOT_PENDING || n.C & CONFIG_CHILDREN_FORBIDDEN || stale && heldFromStale(e, n) ? e.ce : (enterStagedRead(e), 
-    e._e);
+/** A tracked read's pull of a computed: bring it current when the flush has
+ * reached its height (or the reader is a fresh-pull waiter), and sit the
+ * reader above it. */ function pullComputed(e, t) {
+    if (e.Le >= dirtyQueue.He) {
+        markNode(t);
+        markHeap(dirtyQueue);
+        updateIfNecessary(e);
+    }
+    // Fresh-pull readers (awaitable refresh's waiter) recompute a dirty
+    // source inline even when the height gate defers to the flush: the
+    // waiter must park on the re-ask's window (or serve its sync answer),
+    // 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.u & CONFIG_FRESH_READ) updateIfNecessary(e);
+    const n = e.Le;
+    // parent check is shallow, might need to be recursive
+        if (n >= t.Le && e._parent !== t) t.Le = n + 1;
 }
 
 function read(e) {
-    // Handle latest() mode: read from _latestValueComputed
-    // 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.et(e);
-    let n = context;
-    if (n?.Wn) n = n.qn;
-    const t = e;
-    const i = e.De;
-    const u = 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.nt(e, n, u, i);
-    } else if (typeof t.he === "function") {
-        prepareComputed(e, false);
-    }
-    if (!t.he && u === e && e.o?.Fe === undefined && e.o?.sn === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && (!unflushedStaged || e._e === NOT_PENDING) && // A28, see readNodeFast
+    let t = context;
+    if (t?.Et) t = t.ut;
+    const n = e;
+    // CARVE 1: `owner` was `el._firewall || el` — a store leaf's status,
+    // height and error were read off its projection computed. (Typed loosely
+    // as the `||` expression was: a signal's `_statusFlags`/`_height` read as
+    // undefined and mask to 0 on every site below.)
+        const E = e;
+    if (typeof n.re === "function") prepareComputed(e);
+    // The verdict windows (`latest`, `isPending`; verdict.ts): one cold path,
+    // off this one, present only while a window is open.
+        if (verdict !== null) return verdict(e, t);
+    if (!n.re && e.m?.xe === undefined && !snapshotCaptureActive && (!unflushedStaged || e.Ae === NOT_PENDING) && // A28, see readNodeFast
+    !(e.u & CONFIG_OVERRIDE) && // lanes: the slow path's one arm
     true) {
-        if (n && tracking) link(e, n);
-        // Committed visibility for children-forbidden readers and for stale
-        // readers of a foreign transaction's staged write — see readNodeFast.
-                return !n || e._e === NOT_PENDING || n.C & CONFIG_CHILDREN_FORBIDDEN || stale && heldFromStale(e, n) ? e.ce : (enterStagedRead(e), 
-        e._e);
-    }
-    if (n && tracking) {
-        link(e, n, pendingCheckActive);
-        if (u.he) {
-            const t = queueFor(e);
-            if (u.rn >= t.ln) {
-                markNode(n);
-                markHeap(t);
-                updateIfNecessary(u);
-            }
-            // Fresh-pull readers (awaitable refresh's waiter) recompute a dirty
-            // source inline even when the height gate defers to the flush: the
-            // waiter must park on the re-ask's window (or serve its sync answer),
-            // 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 (n.C & CONFIG_FRESH_READ) updateIfNecessary(u);
-            const i = u.rn;
-            // parent check is shallow, might need to be recursive
-                        if (i >= n.rn && e._parent !== n) {
-                n.rn = i + 1;
+        if (t) {
+            if (tracking) link(e, t);
+            // L2: a pass that reads something already in the future joins it —
+            // the one mechanism behind "a write that reaches the future joins
+            // it". Tracked or not (`untrack` is about dependencies, not about
+            // which world a pass derives from — posture-store-parity S4/S5): a
+            // derivation of a held write published mainline would tear. Frame
+            // readers (children-forbidden, A32) see committed below and stay
+            // out; a render effect outside a parking flush sees committed and
+            // stays out too (rule 3, `frameRead`). The pass remembers it read the
+            // future (REACTIVE_JOINED): a first pass that did is born held (A29),
+            // wherever it was created. Lane work sees the screen (`frameRead`).
+                        if (e.u & CONFIG_HELD && !(t.u & CONFIG_CHILDREN_FORBIDDEN)) {
+                if (frameRead(t, e)) return e.pe;
+                joinPass(t, e);
             }
         }
+        // Committed visibility for untracked and children-forbidden readers.
+                if (!t || e.Ae === NOT_PENDING || t.u & CONFIG_CHILDREN_FORBIDDEN) return e.pe;
+        // (A plain signal is never uninitialized — the carve-out is `serve`'s.)
+                if (t.u & CONFIG_VERDICT && stagedScreen(t)) return e.pe;
+        stagedRead(t);
+        return e.Ae;
+    }
+    // Rule 3: this read serves the committed value to a render effect outside a
+    // parking flush (decided after the pull below — a pull can join).
+        let u = false;
+    if (t) {
+        if (tracking) {
+            link(e, t);
+            if (E.re) pullComputed(E, t);
+        }
+        // L2, as in the fast block above (tracked or not). A node born into the
+        // future (uninitialized) has no committed value: every reader derives
+        // from the future there, a render effect included (A29: a stale reader
+        // of it cannot fall back to the committed frame and enters instead).
+                if (e.u & CONFIG_HELD && !(e.u & CONFIG_OVERRIDE) && !(t.u & CONFIG_CHILDREN_FORBIDDEN)) {
+            if (E.G & STATUS_UNINITIALIZED || !frameRead(t, e)) joinPass(t, e); else u = true;
+        }
+    }
+    // Lanes: a lane's node (after the pull — the node is current). NOT_PENDING
+    // falls through: lane work's read of a pending member throws like any.
+        if (e.u & CONFIG_OVERRIDE) {
+        const n = GlobalQueue.Nt(t, e);
+        if (n !== NOT_PENDING) return n;
+    }
+    // A stale reader of a held flight (rule 3, A15's reveal corollary) is served
+    // the committed value — coherent with the frame, whose inputs are the
+    // committed ones too — and does not go pending on it. So is lane work
+    // reading a flight that is not the lane's own (the parent's, or
+    // mainline's): a lane breaks out of its parent's hold and waits only on
+    // what derives from the guess (A31: "under a lane, a pending node on no
+    // lane serves its committed value").
+    // A verdict reader likewise (CONFIG_VERDICT): a frame reader sees the
+    // screen, and for a flight the screen is the committed value — a render
+    // effect keeps its DOM by throwing, a memo has no DOM and is handed the
+    // value. `[isPending(x), x()]` reads `[true, stale]` in either order (A10)
+    // — unless the flight committed beneath inputs already on screen
+    // (`observeFlight`).
+        if (E.G & STATUS_PENDING && !u && !(e.u & CONFIG_OVERRIDE) && !(E.G & STATUS_UNINITIALIZED)) {
+        // A reader with no committed value yet sees the flight pending: a
+        // boundary a lane mounts shows its fallback (A29's boundary exemption).
+        if (passLane !== null && !(t?.G & STATUS_UNINITIALIZED)) u = true; else if (t !== null && t.u & CONFIG_VERDICT) u = GlobalQueue.ft(t, E);
     }
-    if (u.h & 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 (n && !(stale && !(u.h & STATUS_UNINITIALIZED) && !(u.C & CONFIG_INPUTS_PUBLISHED) && !(u.C & CONFIG_HAS_LANE && GlobalQueue.tt(u)) && heldFromStale(u, n))) {
-            // 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.it(u)) {
+    if (E.G & STATUS_PENDING && !u) {
+        // A reader landing on a pending node throws; an untracked read of an
+        // UNINITIALIZED node has no committed value to serve and throws too. A
+        // children-forbidden reader (createTrackedEffect / onSettled) sees the
+        // frame, not the graph (A32): the committed value, and the NotReady only
+        // where there is none (uninitialized).
+        if (t) {
+            if (!(t.u & CONFIG_CHILDREN_FORBIDDEN) || E.G & STATUS_UNINITIALIZED) {
                 // 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 !== n) link(e, n);
-                throw u.o?._;
+                if (!tracking && !spectating && e !== t) link(e, t);
+                throw E.m?.V;
             }
-        } else if (!n && u.h & STATUS_UNINITIALIZED && 
-        // An armed DERIVED override shields the uninitialized state from a
-        // read with no reader identity (#3648 follow-up, A18 (d)): a memo
-        // whose first landing rode its lane (asyncWrite's lane branch →
-        // `laneOverride`) has no `_value` — the flag stays set until the lane's
-        // commit promotes the override — yet the override IS the displayed
-        // value of a pending node (A18 (c), the screen keeps it until the
-        // commit), exactly as an initialized node re-deriving under its override
-        // displays it. "Uninitialized must suspend" (#3276, A19 exception 1) was
-        // written for a node with NOTHING to show; this node has the override.
-        // The arm fires in the body-end window: the source override superseded
-        // (A18 body-end, #3427), the memo re-deriving on the plain channel and
-        // held, its own slot still armed. Fall through to serve()'s override
-        // arm. Readers WITH identity are untouched: a tracked lane reader keeps
-        // the override (A17), an off-lane one suspends (#3651, `overrideRead`).
-        !(hasActiveOverride(e) && e.C & CONFIG_DERIVED_OVERRIDE)) {
-            throw u.o?._;
+        } else if (E.G & STATUS_UNINITIALIZED) {
+            throw E.m?.V;
         }
     }
-    // `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.he && u.h & STATUS_ERROR) {
+    // An errored derive throws for every late reader instead of silently
+    // serving node values (memo parity, #2897 ruling).
+        if (E.re && E.G & 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.be < clock) {
-            recompute(u);
+        if (tracking && E.Ne < clock) {
+            recompute(E);
             return read(e);
-        } else throw u.o?._;
+        } else throw E.m?.V;
     }
-    if (snapshotCaptureActive && n && n.C & CONFIG_IN_SNAPSHOT_SCOPE) {
-        const t = e.o?.sn;
-        if (t !== undefined) {
-            const i = t === NO_SNAPSHOT ? undefined : t;
-            const u = e._e !== NOT_PENDING ? e._e : e.ce;
-            if (u !== i) n.oe |= REACTIVE_SNAPSHOT_STALE;
-            return i;
+    if (snapshotCaptureActive && t && t.u & CONFIG_IN_SNAPSHOT_SCOPE) {
+        const n = e.m?.xe;
+        if (n !== undefined) {
+            const E = n === NO_SNAPSHOT ? undefined : n;
+            const u = e.Ae !== NOT_PENDING ? e.Ae : e.pe;
+            if (u !== E) t.R |= REACTIVE_SNAPSHOT_STALE;
+            return E;
         }
     }
-    const l = serve(e, n, u, e.ce);
-    if (!n && u === e && typeof t.he === "function" && e.C & CONFIG_AUTO_DISPOSE && !(u.h & 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)) {
+    if (u) return e.pe;
+    const s = serve(e, t);
+    if (!t && typeof n.re === "function" && e.u & CONFIG_AUTO_DISPOSE && !(E.G & STATUS_PENDING) && !e.t) {
         // 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).
+        // between.
         // 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 l;
+    return s;
 }
 
 /**
  * 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);
+ * `el`. Called by read()'s slow tail; the fast path (read's fast block) keeps
+ * its trivial ternary by design (perf, see the doc). Arms, in order:
+ * - a node born staged 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, n, t, 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
-        // tentative write would trivially satisfy the predicate. The bit is checked
-        // on the reading computation itself, so a shared computed the predicate
-        // pulls recomputes as ITSELF (context = the memo, no bit) under the normal
-        // view. Fall through to normal value selection (staged `_pendingValue` is
-        // 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.
-        // 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 (!(n && n.C & 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 (n && e.C & (CONFIG_HAS_LANE | CONFIG_OVERRIDE_SUPERSEDED)) return GlobalQueue.ut(e, n);
-            return unwrapOverride(e.o?.Fe);
-        }
-        e.C |= CONFIG_AUTHORITATIVE_OBSERVED;
-    }
-    // Entanglement gate: a reader recomputing under an optimistic lane that reads
-    // a pending mid-transition write sees the committed value. Projection-store
-    // manual writes use the firewall's manual-write flag to opt into this path.
-    // Async drivers are not under an optimistic lane and so bypass this, reading
-    // _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 && n !== null && GlobalQueue.lt(e, t, n)) {
-        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
-    // effects) see _pendingValue so that latest() and direct reads stay consistent.
-    // (The lane-context clause lives with the engine.) Children-forbidden readers
-    // (createTrackedEffect / onSettled callbacks) get committed visibility — see
-    // readNodeFast (#3006).
-    // 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) — a bookkeeping read
-    // (`spectate`) likewise: it derives nothing, so it cannot enter, and a
-    // held-only value is simply not ready to it.
-        const u = e._e !== NOT_PENDING && (e.h & STATUS_UNINITIALIZED) !== 0;
-    if (u && (!n || spectating)) throw new NotReadyError(null);
-    const l = n && unflushedStaged ? unflushedValue(e, i) : NOT_PENDING;
-    if (l !== NOT_PENDING) {
-        markLateLinker(n);
-        if (pendingCheckActive) GlobalQueue.rt(e, l);
-        return l;
+ * - readerSeesCommitted, else the staged value.
+ */ function serve(e, t) {
+    // A node born staged (recompute) has a staged value and no committed one:
+    // an untracked reader has nothing to serve and holds (A19 exception 1) — a
+    // bookkeeping read (`spectate`) likewise, and a children-forbidden reader
+    // (A32: the frame, which has nothing here).
+    if (e.Ae !== NOT_PENDING && e.G & STATUS_UNINITIALIZED && (!t || spectating || t.u & CONFIG_CHILDREN_FORBIDDEN)) throw new NotReadyError(null);
+    const n = t && unflushedStaged ? unflushedValue(e) : NOT_PENDING;
+    if (n !== NOT_PENDING) {
+        markLateLinker(t);
+        return n;
     }
-    const r = readerSeesCommitted(e, n, t, u) ? i : (enterStagedRead(e), e._e);
-    // 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.rt(e, r);
-    return r;
+    if (readerSeesCommitted(e, t)) return e.pe;
+    if (t.u & CONFIG_VERDICT && !(e.G & STATUS_UNINITIALIZED) && stagedScreen(t)) return e.pe;
+    stagedRead(t, e);
+    return e.Ae;
 }
 
-/** 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.Jn) return;
-    const n = ext(e);
-    if (n.bn === NOT_PENDING) {
-        n.bn = e._e;
-        unflushedRewrites.push(e);
-        unflushedStaged = true;
-    }
+/** A pass read a staging of this flush: it derives from what the flush may
+ * yet hold (REACTIVE_STAGED_READ — the seam decides). Lane work too (plan sec. 28, a
+ * lane sees the screen plus its own guesses): the staging is the screen if
+ * the frame commits — one pass, the common case — and a held write if it
+ * parks, which the seam repairs (`stagedReaders`): the pass re-derives on
+ * the committed world and its lane's runs wait that round, so the held
+ * write never shows through the lane. A verdict lane's work likewise: the
+ * lane holds verdicts, not the frame's other stagings (#3851) — except a
+ * verdict reader, which answered for itself (the lane seam, lanes.ts). Not
+ * a read of a node born staged: it has no committed value to re-derive on,
+ * and a re-run would read the same staging and re-queue every round. */ function stagedRead(e, t) {
+    e.R |= REACTIVE_STAGED_READ;
+    if (passLane !== null && !(t?.G & STATUS_UNINITIALIZED)) stagedReaders.push(e);
+}
+
+/** A10 for a staged node: a verdict reader (the pass entered a window) that
+ * also reads a frame's proposal plainly sees the screen — `[latest(q), q()]`
+ * is `[b, a]` — once the frame has a transaction, and re-derives when it
+ * lands: at this very seam if nothing holds it (the stale run is void,
+ * #3322 — one run, on the committed world), or with the hold. Before any
+ * transaction the answer is the seam's and the reader watches it
+ * (verdict.ts). A node born into the future has no screen: its staging is
+ * its only value (A29). */ function stagedScreen(e) {
+    if (flushTransaction === null) return false;
+    staleReader(e, flushTransaction);
+    return true;
 }
 
 /** 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.Jn || e.C & CONFIG_PROMOTED) return;
-    e.C |= CONFIG_PROMOTED;
+    if (globalQueue.ee || e.u & CONFIG_PROMOTED) return;
+    e.u |= CONFIG_PROMOTED;
     promotedWrites.push(e);
 }
 
@@ -1736,52 +1216,29 @@ function read(e) {
  * async landing (asyncWrite), and a value arriving from async during the pass
  * REVEALS — the creation-time arm skips pending computeds for the same
  * reason. Firewall leaves belong to a projection whose compute is the tree's
- * own work, captured (or deliberately not) at creation. */ function captureWriteSnapshot(e, n) {
-    if (e.C & CONFIG_NO_SNAPSHOT || e.he !== undefined || e.De || e.o?.sn !== undefined) return;
-    ext(e).sn = n === undefined ? NO_SNAPSHOT : n;
-    e.C |= CONFIG_HAS_SNAPSHOT;
+ * own work, captured (or deliberately not) at creation. */ function captureWriteSnapshot(e, t) {
+    if (e.u & CONFIG_NO_SNAPSHOT || e.re !== undefined || e.m?.xe !== undefined) return;
+    ext(e).xe = t === undefined ? NO_SNAPSHOT : t;
+    e.u |= CONFIG_HAS_SNAPSHOT;
     snapshotSources.add(e);
 }
 
-function setSignal(e, n) {
-    // 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).
-    // A held DERIVATION is not a proposal (A34 amendment, #3612): the user
-    // setters of derived nodes (setMemo, the derived store's setter) classify
-    // the write before it reaches here — see heldDerivation — and re-derive
-    // under the hold instead of masking; the join stands either way.
-    if (e.we && activeTransition !== e.we) {
-        if (globalQueue.Jn) globalQueue.initTransition(e.we); else {
-            batchJoins.push(e.we);
- // 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.C & CONFIG_OPTIMISTIC) {
-        if (!projectionWriteActive) return GlobalQueue.ot(e, n);
-        // An authoritative store landing on an override-covered node: the store
-        // twin of asyncWrite's override branch, decided by the engine (#3331).
-                const t = e.o?.Fe;
-        if (t !== undefined && t !== NOT_PENDING) return GlobalQueue.st(e, n);
-    }
-    const t = e._e === NOT_PENDING ? e.ce : e._e;
-    if (typeof n === "function") n = n(t);
+function setSignal(e, t) {
+    const n = e.Ae === NOT_PENDING ? e.pe : e.Ae;
+    if (typeof t === "function") t = t(n);
+    // Lanes: a write landing on a guess is its truth (A18 — an async guess's
+    // own landing), judged against the guess; one landing on a lane's
+    // derivation (its flight) is the lane's staging (lanes.ts).
+        if (e.u & CONFIG_OVERRIDE) return GlobalQueue.Tt(e, t);
+    // L2 (T4) / A34 (1): a write to a node whose staged state is held is a
+    // second proposal for the slot — the same value again or another — and
+    // the two cannot finish at different times: the writer's tick joins the
+    // hold, before the equality gate.
+        if (e.u & CONFIG_HELD) joinFuture(txOf(e));
     // Uninitialized check first: the first commit has no previous value, so the
     // user comparator must not run against `undefined` (matches recompute).
-        const i = !!(e.h & STATUS_UNINITIALIZED) || !e.xe || !e.xe(t, n);
-    if (!i) return n;
+        const E = !!(e.G & STATUS_UNINITIALIZED) || !e.We || !e.We(n, t);
+    if (!E) return t;
     // A write during hydration's snapshot capture to a source that has no
     // snapshot — created BEFORE capture began (module-level state: an identity
     // minted from onSettled in the pass, a preference read from storage) —
@@ -1791,94 +1248,58 @@ function setSignal(e, n) {
     // pass whose DOM writes are skipped, and a component rendered later in the
     // pass reads a value the server never had. Store leaves written here are
     // plain signals and qualify the same way.
-        if (snapshotCaptureActive) captureWriteSnapshot(e, t);
-    const u = e._e !== NOT_PENDING;
+        if (snapshotCaptureActive) captureWriteSnapshot(e, n);
+    const u = e.Ae !== NOT_PENDING;
     if (!u) 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.we !== null) stashHeldRewrite(e);
-    e._e = n;
+    // A28: a held node rewritten outside a flush keeps its flushed staging
+    // for every reader until the flush that carries the rewrite.
+     else if (e.u & CONFIG_HELD && !globalQueue.ee) stashFlushed(e);
+    e.Ae = 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).
-        if (e.C & CONFIG_HAS_COMPANIONS && GlobalQueue.Ve !== null) {
-        GlobalQueue.Ve(e, n);
-        // 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.Jn) 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.he !== undefined) e.be = clock;
+        if (e.re !== undefined) e.Ne = 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.vn === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return n;
+    // marked, heap entries flag-guarded, effects queued once).
+        if (u && e.ze === notifyEpoch) return t;
     insertSubs(e);
     schedule();
-    return n;
+    return t;
 }
 
 /**
- * Suppresses automatic recomputation of `el` until the scheduler drains. Used
- * when a manual write should win over dependency changes queued in the same
- * tick. The MANUAL_WRITE flag is cleared by the pending-node drain; projection
- * computeds don't commit values, but they still need the same end-of-tick
- * cleanup point.
- */ function suppressComputedRecompute(e) {
-    deleteFromHeap(e, queueFor(e));
-    if (!(e.oe & REACTIVE_MANUAL_WRITE) && e._e === NOT_PENDING) {
-        queuePendingNode(e);
+ * User-facing setter for the memo form of `createSignal(fn)`. A write applies
+ * first, then derivations re-run (A34 as amended 2026-10-01, rule B; core
+ * R31): the write stages like any other, and a source change — in this flush
+ * or a later one, under a hold or on mainline — re-derives with the staged
+ * write as `prev`. The write never refuses the re-run (the frame-scoped mask
+ * of #3733/#3740 and #2692's "write wins the tick" before it are gone; call
+ * order inside a flush was never observable) and on its own never causes one.
+ * REACTIVE_MANUAL_WRITE only marks the staging as a user proposal — the A34
+ * (1)/(3) discriminator — until a pass re-derives it or the commit lands it.
+ */ function setMemo(e, t) {
+    // A34 (3), #3612: is `el`'s staging a derivation another transaction holds
+    // — held, not a manual proposal, and the writer not that transaction
+    // (mainline, or a flush joined elsewhere)? A held pass result is nobody's
+    // proposal: a setter reaching it composes on the committed frame it was
+    // written against and becomes `prev` for the hold's re-derivation, instead
+    // of replacing it. A write made under the hold carries the mark and keeps
+    // (1)'s last-write-wins. Only the user setter asks; an async landing
+    // writing a held node is the transaction's own work.
+    const n = e.u & CONFIG_HELD && !(e.R & REACTIVE_MANUAL_WRITE) && txOf(e) !== flushTransaction;
+    // The writer read the committed frame; its updater composes on it.
+        if (n && typeof t === "function") t = t(e.pe);
+    const E = setSignal(e, t);
+    if (n) {
+        // The one write that re-runs: the staging it replaced was derived from
+        // inputs the writer never saw, so the hold re-derives over the write.
+        e.R = e.R & ~REACTIVE_CHECK | REACTIVE_DIRTY;
+        insertIntoHeap(e, dirtyQueue);
         schedule();
-    }
-    e.oe = e.oe & -4 | REACTIVE_MANUAL_WRITE;
-    e.ct = clock;
-}
-
-/** A34 amendment (#3612) — is `el`'s staging a DERIVATION another transaction
- * holds: stamped by a transaction that is not the writer's, and not a manual
- * proposal (the mask, on the node or — a store leaf — its firewall)? #2692's
- * "manual write wins" is a rule for one synchronous frame; across a hold the
- * held pass result is nobody's proposal, and a user setter reaching it
- * composes on the committed frame it was written against and becomes `prev`
- * for the transaction's re-derivation (rederiveHeld) instead of replacing it.
- * Writes made under the holding transaction masked the node and keep
- * A34(1)'s last-write-wins. Only the user setters ask; an async landing or a
- * companion writing a stamped node is the transaction's own work. */ function heldDerivation(e) {
-    return e.we !== null && activeTransition !== e.we && !((e.De || e).oe & REACTIVE_MANUAL_WRITE);
-}
-
-/** The held-derivation write's second half: the node re-derives under its
- * hold with the written staging as the pass's `prev`. Nothing is masked. The
- * write took the A34 join (setSignal), which scheduled the flush that drains
- * this; recompute re-enters the stamp. */ function rederiveHeld(e) {
-    e.oe |= REACTIVE_DIRTY;
- // over CHECK: the heap visit recomputes, not re-checks
-        enqueueSub(e);
-}
-
-/**
- * User-facing setter for the memo form of `createSignal(fn)`. Behaves like
- * `setSignal`, but also cancels any pending recompute of the memo so the
- * manual value wins over a value that would otherwise be produced by an
- * upstream change in the same tick. Across a hold the write is not a
- * proposal: a memo another transaction holds as a pass result composes on the
- * committed value and re-derives under the hold with the write as `prev`
- * (A34 amendment, #3612; heldDerivation).
- */ function setMemo(e, n) {
-    const t = heldDerivation(e);
-    if (t && typeof n === "function") n = n(e.ce);
-    const i = setSignal(e, n);
-    t ? rederiveHeld(e) : suppressComputedRecompute(e);
-    return i;
+    } else if (e.Ae !== NOT_PENDING) e.R |= REACTIVE_MANUAL_WRITE;
+    return E;
 }
 
 /**
@@ -1899,27 +1320,23 @@ function setSignal(e, n) {
  *   setTimeout(() => runWithOwner(owner, fn), ms);
  * }
  * ```
- */ function runWithOwner(e, n) {
-    const t = context;
-    const i = tracking;
+ */ function runWithOwner(e, t) {
+    const n = context;
+    const E = tracking;
     context = e;
     tracking = false;
     try {
-        return n();
+        return t();
     } finally {
-        context = t;
-        tracking = i;
+        context = n;
+        tracking = E;
     }
 }
 
-function staleValues(e, n = true) {
-    const t = stale;
-    stale = n;
+function staleValues(e, t = true) {
     try {
         return e();
-    } finally {
-        stale = t;
-    }
+    } finally {}
 }
 
 /**
@@ -1927,42 +1344,19 @@ function staleValues(e, n = true) {
  * it validates the target, marks through here, then builds the quiescence
  * promise on the resolve()/until() effect machinery). Flags the node's next
  * recompute as a quiet re-ask and schedules it; no-ops for non-derived or
- * disposed targets and for same-tick manual writes.
+ * disposed targets.
  */ function markRefresh(e) {
-    if (typeof e.he === "function" && !(e.oe & REACTIVE_DISPOSED)) {
-        if (e.oe & 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.ct === clock) return;
-            e.oe &= ~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
-            // mark here classified that refetch as a NEW question, which pends
-            // every leaf (3.1) — an action doing setStore + yield + refresh(store)
-            // lit up every sibling row, and affects() could not narrow it (a mark
-            // only turns pending on). Same-question motion stays silent (3.4);
-            // the written slot and any declared mark carry the pending instead.
-                }
-        // A refresh with no value-change dirt already queued is a re-ask of the
-        // same question: mark it so the recompute classifies any resulting
-        // pending window as quiet (not pending). If the node is already dirty
-        // from a real input change, the question changed — don't mark.
-        // 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.oe & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
-            e.oe |= REACTIVE_REASK;
-            armReaskClear();
-        }
-        e.oe = e.oe & ~REACTIVE_CHECK | REACTIVE_DIRTY;
-        insertIntoHeap(e, queueFor(e));
+    if (typeof e.re === "function" && !(e.R & REACTIVE_DISPOSED)) {
+        // A manual write never refuses the re-run (A34 rule B): a refresh in the
+        // write's own frame re-asks with the write as `prev`, like any source
+        // change (#3026 generalized).
+        // The re-ask of an answered question (A19 exc. 2): the next pass, going
+        // pending, classifies its flight quiet for the verdict. Not when an
+        // input already changed this tick — that pass asks a new question.
+        e.R = e.R & ~REACTIVE_CHECK | REACTIVE_DIRTY | (e.R & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP) ? 0 : REACTIVE_REASK);
+        insertIntoHeap(e, dirtyQueue);
         schedule();
     }
 }
 
-export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, effectStatusNotify, enterStagedRead, ext, hasActiveOverride, heldDerivation, installAuthoritativeRead, isEqual, latestReadActive, markLateLinker, markRefresh, markSnapshotScope, markUnflushedStaged, notifyAuthoritativeObservers, notifyOnLane, optimisticComputed, optimisticSignal, ownsHold, pendingCheckActive, prepareComputed, read, readNodeFast, readerSeesCommitted, recompute, recordStaleReplay, rederiveHeld, 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 };
+export { clearSnapshots, computed, context, createEffectNode, effectStatusNotify, ext, isEqual, markLateLinker, markRefresh, markSnapshotScope, markUnflushedStaged, notePromotedWrite, prepareComputed, pullComputed, read, readerSeesCommitted, recompute, releaseSnapshotScope, resyncUnflushedCompanions, runWithOwner, serve, setEffectStatusNotify, setMemo, setSignal, setSnapshotCapture, setVerdict, signal, slotSignal, snapshotCaptureActive, snapshotSources, spectating, stagedRead, stagedScreen, staleValues, stashFlushed, statusNotifierOf, tracking, unflushedStaged, unflushedValue, untrack, verdict };