@solidjs/signals 2.0.0-rc.17 → 2.0.0-rc.19

package/dist/observe/core/owner.js

@@ -8,7 +8,7 @@ import { unobserved, clearDeps } from "./graph.js";
 
 import { deleteFromHeap } from "./heap.js";
 
-import { globalQueue, schedule, dirtyQueue } from "./scheduler.js";
+import { globalQueue, pendingNodes, schedule, dirtyQueue } from "./scheduler.js";
 
 // L2 (step 2): the parked frame. A pass parks the previous frame's children
 // and `_disposal` list on `_x._pendingFirstChild` / `_x._pendingDisposal`
@@ -69,21 +69,22 @@ function disposeChildren(e, n = false, r) {
     // cleanups never run and it stays subscribed, rerunning in a torn-down
     // tree (#3561). Death only (`self`): a re-pass leaves the frame reacting
     // until the commit.
-        if (n && !r && e.T !== null && (e.T.Nt !== null || e.T.ft !== null)) disposeChildren(e, false, true);
+        if (n && !r && e.T !== null && (e.T.ft !== null || e.T.Nt !== null)) disposeChildren(e, false, true);
     if (n) {
         e.R = t | REACTIVE_DISPOSED;
         if (e._parent === null && e.Pt) unregisterRoot(e);
     }
     if (n && e.X) {
-        if (e.T !== null) e.T.Se = null;
+        if (e.T !== null) e.T.Ee = null;
         // A death that can unblock the future (L2, `futureBlocked`): a held
         // flight's — a transaction's or a lane's (its `_x._transaction`) — or a
         // stale reader's (REACTIVE_FRAME_READ — a frame that derived from one).
+        // An idle pending queue would also pin it until an unrelated flush.
         // Nothing else re-examines a dead node, so make sure a seam comes.
-                if (e.m & STATUS_PENDING && e.T?.Je != null || t & REACTIVE_FRAME_READ) schedule();
+                if (e.m & STATUS_PENDING && e.T?.Je != null || t & REACTIVE_FRAME_READ || pendingNodes.length) schedule();
     }
-    let l = r ? e.T.Nt : e.ze;
-    if (r) e.T.Nt = null; else e.ze = null;
+    let l = r ? e.T.ft : e.ze;
+    if (r) e.T.ft = null; else e.ze = null;
     while (l) {
         const e = l;
         // Owner teardown is death regardless of the child's own lifecycle
@@ -107,7 +108,7 @@ function disposeChildren(e, n = false, r) {
         // on the fresh head and survives. Pointing each drained child's prev at
         // itself routes its later splice onto the detached chain, never the head,
         // and keeps the dev owner-chain-head invariant honest for those children.
-                l.Ct = l;
+                l.dt = l;
         disposeChildren(l, true);
         // Read after, not before: a sibling this disposal made dormant spliced
         // itself out of the detached chain, and a cleanup may then have linked
@@ -122,11 +123,11 @@ function disposeChildren(e, n = false, r) {
     // node._nextSibling intact so outer walks that already advanced past us
     // still reach later siblings.
         if (n && !r && !(t & REACTIVE_ZOMBIE) && e._parent !== null && !(e._parent.R & REACTIVE_DISPOSED)) {
-        const n = e.Ct;
+        const n = e.dt;
         const r = e.Xe;
         if (n !== null) n.Xe = r; else e._parent.ze = r;
-        if (r !== null) r.Ct = n;
-        e.Ct = null;
+        if (r !== null) r.dt = n;
+        e.dt = null;
     }
     runDisposal(e, r);
     // Final effect-returned cleanup fires at true disposal, after `_disposal`
@@ -140,9 +141,9 @@ function disposeChildren(e, n = false, r) {
 
 function linkChild(e, n) {
     const r = e.ze;
-    n.Ct = null;
+    n.dt = null;
     n.Xe = r;
-    if (r !== null) r.Ct = n;
+    if (r !== null) r.dt = n;
     e.ze = n;
 }
 
@@ -153,9 +154,9 @@ function runDisposal(e, n) {
     // walk ran every entry a second time. Detached, the re-entrant drain finds
     // nothing. The same shape latched a throwing cleanup: the list survived the
     // throw and every later drain re-ran and re-threw it.
-    const r = n ? e.T.ft : e.rt;
+    const r = n ? e.T.Nt : e.rt;
     if (!r) return;
-    if (n) e.T.ft = null; else e.rt = null;
+    if (n) e.T.Nt = null; else e.rt = null;
     if (Array.isArray(r)) {
         // Unwind order (#3572, restores 1.x #1562): later registrations run
         // before earlier ones. Children have already been disposed by the caller,
@@ -308,10 +309,10 @@ function disposeRootSelf(e = true) {
         // was 12 KB and most of disposal's time (2026-10-17).
         R: REACTIVE_NONE,
         Pt: true,
-        Ht: n?.Pt ? n.Ht : n,
+        ht: n?.Pt ? n.ht : n,
         ze: null,
         Xe: null,
-        Ct: null,
+        dt: null,
         rt: null,
         A: n?.A || defaultContext,
         ct: 0,

package/dist/observe/core/scheduler.js

@@ -130,7 +130,7 @@ function setExternalHooks(e, o) {
 
 /** A transaction (listed here) or a lane (lanes.ts lists its own). */ function newTransaction(e, o = null) {
     const n = {
-        je: [],
+        Ye: [],
         un: [ [], [] ],
         En: [],
         eo: null,
@@ -232,7 +232,7 @@ function resolveTx(e) {
     e.eo = o;
     o.tt += e.tt;
     o.nt ||= e.nt;
-    append(o.je, e.je);
+    append(o.Ye, e.Ye);
     append(o.un[0], e.un[0]);
     append(o.un[1], e.un[1]);
     append(o.En, e.En);
@@ -262,7 +262,7 @@ function resolveTx(e) {
     judge ??= e;
     // An action still running in it holds it open (action.ts). Its lanes
     // (lanes.ts): a lane under `t` blocks it while blocked itself.
-        const n = e.tt !== 0 || blockedBy(e.je, e) || !!lanesBlockedHook?.(e);
+        const n = e.tt !== 0 || blockedBy(e.Ye, e) || !!lanesBlockedHook?.(e);
     judge = o;
     return n;
 }
@@ -273,8 +273,8 @@ let judge = null;
  * frame reader observes (`blockedBy`'s predicate, collected; the readers
  * themselves are not sources). */ function blockersOf(e) {
     const o = [];
-    for (let n = 0; n < e.je.length; n++) {
-        const t = e.je[n];
+    for (let n = 0; n < e.Ye.length; n++) {
+        const t = e.Ye[n];
         if (!t.i && t.m & STATUS_PENDING && !(t.R & REACTIVE_DISPOSED) && (t.T.Je === null || txOf(t) === e) && blockedBy([ t ], e)) o.push(t);
     }
     return o;
@@ -285,13 +285,13 @@ let judge = null;
  * not (lanes.ts, the body-end corollary). A pending reader counts only if
  * one of the sources it waits on is `t`'s (a render effect marked pending
  * by a lane flight, never re-run, is the lane's wait, not the frame's). */ function ownFlights(e) {
-    return blockedBy(e.je, e, true);
+    return blockedBy(e.Ye, e, true);
 }
 
 /** A source the pending node waits on that is `t`'s (held by it, or by no
  * one) — not another transaction's or lane's work. Itself, when it is the
  * source. */ function ownSource(e, o) {
-    const n = e.T?.fe;
+    const n = e.T?.se;
     if (n === undefined) return true;
     for (const e of n) {
         const n = e.T?.Je;
@@ -323,7 +323,7 @@ function blockedBy(e, o, n = false) {
             // lane-membership ruling, 2026-10-05). An output that never committed
             // shows nothing — a mount the frame has not revealed — and holds
             // nothing.
-                        if ((n.i === EFFECT_RENDER && n.m & STATUS_PENDING || n.R & REACTIVE_FRAME_READ || n.l & CONFIG_REDERIVE && n.m === STATUS_PENDING) && (e.Te === n.Ne || n.T?.F != null) && !(n.R & REACTIVE_DISPOSED) && onScreen(n, judge ?? o)) return true;
+                        if ((n.i === EFFECT_RENDER && n.m & STATUS_PENDING || n.R & REACTIVE_FRAME_READ || n.l & CONFIG_REDERIVE && n.m === STATUS_PENDING) && (e.Ie === n.Ne || n.T?.F != null) && !(n.R & REACTIVE_DISPOSED) && onScreen(n, judge ?? o)) return true;
         }
     }
     return false;
@@ -385,7 +385,7 @@ function deferZombie(e) {
     const n = ext(e);
     if (n.Je === o) return;
     n.Je = o;
-    o.je.push(e);
+    o.Ye.push(e);
 }
 
 /** Hold the (uncommitted) frame under a held pass: every computed in the
@@ -427,7 +427,7 @@ function deferZombie(e) {
 const dirtyQueue = {
     gt: new Array(2e3).fill(undefined),
     p: false,
-    st: 0,
+    lt: 0,
     jt: 0
 };
 
@@ -509,12 +509,14 @@ function schedule() {
  * hook machinery (pay-for-use).
  */ const ROOT_ERROR_HOOK = Symbol.for("solid-js/root-error-hook");
 
+const HALTED = "[REACTIVITY_HALTED]";
+
 function haltReactivity(e) {
     if (halted) return;
     halted = true;
     // A cleanup error collected before the halt is dropped (owner.ts).
         rethrowCleanupError(true);
-    let o = "[REACTIVITY_HALTED]";
+    let o = HALTED;
     // Surface the cause here too: callers rethrow it, but a creation-time throw
     // unwinds through ancestor recomputes that convert it to status instead of
     // surfacing it (#2884), so the rethrow alone cannot guarantee visibility.
@@ -542,7 +544,7 @@ function haltReactivity(e) {
 function notifyHalted() {
     if (haltNotified) return;
     haltNotified = true;
-    console.error("[REACTIVITY_HALTED]");
+    console.error(HALTED);
 }
 
 /** @internal Test/dev-reload hook. Revives scheduling after a halt. */ function resetErrorHalt() {
@@ -573,7 +575,7 @@ class GlobalQueue {
             clock++;
             // A write the commit sweep staged with no subscriber to dirty is work
             // too — the next round commits it.
-                        scheduled = dirtyQueue.jt >= dirtyQueue.st || pendingNodes.length !== 0;
+                        scheduled = dirtyQueue.jt >= dirtyQueue.lt || pendingNodes.length !== 0;
             this.run(EFFECT_RENDER);
             this.run(EFFECT_USER);
             if (true && holding) {
@@ -627,18 +629,18 @@ class GlobalQueue {
                     // stale stamp was the bridge that entangled unrelated updates
                     // with a never-resolving flight). Its observers are held and
                     // wait on its flight (`blocked`).
-                    if (e.ue === NOT_PENDING && e.m & STATUS_UNINITIALIZED && e.i !== EFFECT_RENDER) continue;
+                    if (e.ie === NOT_PENDING && e.m & STATUS_UNINITIALIZED && e.i !== EFFECT_RENDER) continue;
                     // A34 (2): a tick whose writes net to the committed value made no
                     // proposal (`setShow(false); setShow(true)` on a committed true) —
                     // not staged, not held, pends nothing; a later write to it is
                     // plain mainline. (A node already held stays held when written
                     // back: A34 (1).)
-                                        if (e.ue !== NOT_PENDING && !(e.m & (STATUS_PENDING | STATUS_UNINITIALIZED)) && e.T?.Nt == null && e.T?.ft == null && 
+                                        if (e.ie !== NOT_PENDING && !(e.m & (STATUS_PENDING | STATUS_UNINITIALIZED)) && e.T?.ft == null && e.T?.Nt == null && 
                     // The comparator last: a pass that created children (an object
                     // owning a fresh async memo, #4111) must not have it read them.
                     // A NotReady read there is a change (`isSame`).
-                    isSame(e, e.Ie, e.ue)) {
-                        e.ue = NOT_PENDING;
+                    isSame(e, e.le, e.ie)) {
+                        e.ie = NOT_PENDING;
                         e.l &= ~CONFIG_STAGED;
                         continue;
                     }
@@ -692,11 +694,12 @@ class GlobalQueue {
         // This flush's own runs, the lanes' reveals, and the landings' held runs
         // are collected apart and ordered below.
                 const n = this.un;
-        const t = this.un = [ [], [] ];
+        const t = [ [], [] ];
         // The passes that read this frame's stagings as the screen read held
         // writes if it parked: the lane seam re-derives them on the committed
         // world (a lane's runs wait this round).
                 if (laneSeamsHook) {
+            this.un = t;
             laneSeamsHook(o !== null ? stagedReaders : null);
             if (stagedReaders.length) stagedReaders.length = 0;
         }
@@ -819,37 +822,40 @@ class GlobalQueue {
  * or without the held read) owes nothing. A run this transaction stashed
  * for it is void (#3322: an effect has one value slot, and the stale pass
  * overwrote the value that run was for) — the re-derivation's run replaces
- * it. */ function reruns(e) {
-    for (let o = 0; o < e.En.length; o++) {
-        const n = e.En[o];
+ * it. Truthy when an effect re-derives (`land`). */ function reruns(e) {
+    let o;
+    for (let n = 0; n < e.En.length; n++) {
+        const t = e.En[n];
         // An errored reader's display is its error (D-39): the landing gives it
         // nothing to re-derive, and a re-run would be a read that retries the
         // errored source (#3945).
-                if (n.R & REACTIVE_DISPOSED || n.m & STATUS_ERROR) continue;
-        if (n.R & REACTIVE_FRAME_READ || n.l & CONFIG_VERDICT) {
-            n.R &= ~REACTIVE_FRAME_READ;
-            n.Qe = false;
+                if (t.R & REACTIVE_DISPOSED || t.m & STATUS_ERROR) continue;
+        if (t.R & REACTIVE_FRAME_READ || t.l & CONFIG_VERDICT) {
+            o ||= t.i;
+            t.R &= ~REACTIVE_FRAME_READ;
+            t.Qe = false;
             // Its frame is replaced by the re-derivation: a run one of its
             // children queued this flush (re-run by the same landing) is for the
             // frame being replaced — void too (#3404).
-                        for (let e = n.ze; e !== null; e = e.Xe) if (e.i) e.Qe = false;
-            enqueueSub(n);
+                        for (let e = t.ze; e !== null; e = e.Xe) if (e.i) e.Qe = false;
+            enqueueSub(t);
         }
     }
     e.En.length = 0;
+    return o;
 }
 
 /** The landing: the held frame becomes the frame. */ function land(e) {
     // Attribution hook: judged complete — its held writes commit next
     // (`_nodes` still lists them).
     if (attrHooks !== null) attrHooks.transitionSettled(e);
-    reruns(e);
-    if (e.I !== null) releaseMarksHook(e.I);
+    const o = reruns(e);
+    if (releaseMarksHook && e.I !== null) releaseMarksHook(e.I);
     // Old children die in the commits (cleanups first), then the stashed
     // effects run ahead of this flush's own. A node a lane took over since
     // (a guess written over the staged truth) is the lane's to land.
-        for (let o = 0; o < e.je.length; o++) {
-        const n = e.je[o];
+        for (let o = 0; o < e.Ye.length; o++) {
+        const n = e.Ye[o];
         if (n.T.Je === null || txOf(n) !== e) continue;
         n.T.Je = null;
         commitPendingNode(n);
@@ -858,7 +864,15 @@ class GlobalQueue {
     // `u`, which has left `transactions`: the write is this landing's, and
     // the next flush must not park in it (#4089).
         if (flushTransaction === e) flushTransaction = null;
-    releaseQueues(e);
+    // An effect re-derives next round (`reruns`): the held runs wait for it
+    // (D-9, the A15 reveal corollary, #4071). Its re-derivation can discover a
+    // flight — a stale reader whose mainline pass stopped reading it, now
+    // reading the landed world — and a landing that showed its runs first
+    // would reveal the held write beside a frame that can only show its old
+    // value. Queued last in this effect phase, the release hands them to the
+    // next round's own runs, ahead of the re-derivation's: they show with it,
+    // or park with it in the hold its pending opens. The commits stand.
+        if (o) globalQueue.un[1].push(() => releaseQueues(e)); else releaseQueues(e);
 }
 
 /** The held runs join this flush's effect phase after its own runs (the
@@ -914,7 +928,7 @@ function insertSubs(e) {
     // masked read of the always-present _config instead of missing-property
     // lookups in the hottest notify loop.
         const o = e.l;
-    const n = (o & CONFIG_HAS_SNAPSHOT) !== 0 && e.T?.lt !== undefined;
+    const n = (o & CONFIG_HAS_SNAPSHOT) !== 0 && e.T?.st !== undefined;
     // Observe-tier fan-out: this walk visits every subscriber edge anyway, so
     // the graph-size count is one local increment here and no field anywhere.
         let t = 0;
@@ -929,7 +943,7 @@ function insertSubs(e) {
         // pass either re-reads them fresh or trims them), and neither does the
         // tail link: it is the read IN FLIGHT — read() links before it pulls, so
         // this very commit is what that read returns.
-                if (e.R & REACTIVE_RECOMPUTING_DEPS && o.Te === e.Ne && o !== e._) e.R |= REACTIVE_MISSED_WAKE;
+                if (e.R & REACTIVE_RECOMPUTING_DEPS && o.Ie === e.Ne && o !== e._) e.R |= REACTIVE_MISSED_WAKE;
         if (n && e.l & CONFIG_IN_SNAPSHOT_SCOPE) {
             e.R |= REACTIVE_SNAPSHOT_STALE;
             continue;
@@ -966,32 +980,32 @@ function commitPendingNode(e) {
     // commits a value.
         if (!o.X) {
         e.l &= -385;
-        if (e.ue !== NOT_PENDING) {
-            e.Ie = e.ue;
-            e.ue = NOT_PENDING;
+        if (e.ie !== NOT_PENDING) {
+            e.le = e.ie;
+            e.ie = NOT_PENDING;
         }
         return;
     }
     // Computeds only from here (`_statusFlags` is not a signal field). A
     // commit beneath a flight publishes its inputs (A15 reveal corollary,
     // #3305): a reveal of it must observe, not show the pre-flight value.
-        const n = e.ue === NOT_PENDING && (o.m & STATUS_PENDING) !== 0;
+        const n = e.ie === NOT_PENDING && (o.m & STATUS_PENDING) !== 0;
     const t = e.l & CONFIG_STAGED_ERROR;
     // An answer commits: the error it replaces leaves the display (D-41).
-        if (!n && o.T) o.T.de = undefined;
+        if (!n && o.T) o.T.Te = undefined;
     e.l = n ? e.l & -1048833 | CONFIG_INPUTS_PUBLISHED : e.l & -3147137;
     // D-41: the staged answer is an error — published now, when a value would
     // show, through the ordinary error path (`stageError`). Its readers first
     // see it in the cycle after this seam: a tracked re-read there is not a
     // retry (`read`), or a boundary re-derived by it would retry it forever.
         if (t) {
-        const n = e.ue;
-        e.ue = NOT_PENDING;
-        e.ie = clock + 1;
+        const n = e.ie;
+        e.ie = NOT_PENDING;
+        e.ae = clock + 1;
         notifyStatus(o, STATUS_ERROR, n);
-    } else if (e.ue !== NOT_PENDING) {
-        e.Ie = e.ue;
-        e.ue = NOT_PENDING;
+    } else if (e.ie !== NOT_PENDING) {
+        e.le = e.ie;
+        e.ie = NOT_PENDING;
         // A node born staged (recompute) initializes at this commit.
                 o.m &= ~STATUS_UNINITIALIZED;
         // A quiet re-ask's classification survives its landing and dies with
@@ -1021,7 +1035,7 @@ function commitPendingNode(e) {
     if (!(o.m & STATUS_PENDING)) o.m &= ~STATUS_UNINITIALIZED;
     // L2: the children this commit publishes are the frame's now — the frame
     // they replace, parked by the pass (`recompute`), goes.
-        if (!n && o.T != null && (o.T.Nt !== null || o.T.ft !== null)) GlobalQueue.et(o, false, true);
+        if (!n && o.T != null && (o.T.ft !== null || o.T.Nt !== null)) GlobalQueue.et(o, false, true);
 }
 
 function commitPendingNodes() {
@@ -1085,4 +1099,4 @@ function runQueue(e, o) {
     for (let n = 0; n < e.length; n++) e[n](o);
 }
 
-export { GlobalQueue, MAINLINE_QUESTION, ROOT_ERROR_HOOK, actionDepth, applyGuessesHook, blocked, blockersOf, boundarySeamHook, bumpNotifyEpoch, catchHook, clock, commitPendingNode, deferZombie, dirtyQueue, endLanesHook, enforceLoadingBoundary, enterAction, exitAction, externalUntrackHook, flush, flushTransaction, freshHook, globalQueue, haltReactivity, haltReactivityAt, heldRunHook, heldTrim, heldUnder, hiddenHook, holdNode, insertSubs, installBoundaryHooks, installLaneHooks, installMarkHooks, installStoreHooks, installVerdictHooks, joinFuture, joinPassTx, laneCorrectionsHook, laneDirty, laneOutcomeHook, laneReadHook, laneSeamsHook, laneStageHook, laneWriteHook, lanesBlockedHook, list, liveTx, merge, newTransaction, nextQuestion, notifyEpoch, observeFlightHook, ownFlights, passLane, passTx, question, queuePendingNode, releaseAmbientMarksHook, releaseMarksHook, releaseQueues, reruns, resetErrorHalt, resolveTx, sameLane, schedule, setExternalHooks, setPassLane, setQuestion, stagedReaders, staleReader, storeCommitHook, storeParkHook, txOf, unhold, wireExternalSourceHook };
+export { GlobalQueue, MAINLINE_QUESTION, ROOT_ERROR_HOOK, actionDepth, applyGuessesHook, blocked, blockersOf, boundarySeamHook, bumpNotifyEpoch, catchHook, clock, commitPendingNode, deferZombie, dirtyQueue, endLanesHook, enforceLoadingBoundary, enterAction, exitAction, externalUntrackHook, flush, flushTransaction, freshHook, globalQueue, haltReactivity, haltReactivityAt, heldRunHook, heldTrim, heldUnder, hiddenHook, holdNode, insertSubs, installBoundaryHooks, installLaneHooks, installMarkHooks, installStoreHooks, installVerdictHooks, joinFuture, joinPassTx, laneCorrectionsHook, laneDirty, laneOutcomeHook, laneReadHook, laneSeamsHook, laneStageHook, laneWriteHook, lanesBlockedHook, list, liveTx, merge, newTransaction, nextQuestion, notifyEpoch, observeFlightHook, ownFlights, passLane, passTx, pendingNodes, question, queuePendingNode, releaseAmbientMarksHook, releaseMarksHook, releaseQueues, reruns, resetErrorHalt, resolveTx, sameLane, schedule, setExternalHooks, setPassLane, setQuestion, stagedReaders, staleReader, storeCommitHook, storeParkHook, txOf, unhold, wireExternalSourceHook };

package/dist/observe/core/truth.js

@@ -12,9 +12,9 @@ import { enqueueSub } from "./heap.js";
  * staging a shown lane holds for its next reveal, else its slot; the
  * committed value while it has none (its first lane pass in flight). */
 function laneValueOf(r) {
-    if (!(r.l & CONFIG_GUESS) && r.ue !== NOT_PENDING) return r.ue;
+    if (!(r.l & CONFIG_GUESS) && r.ie !== NOT_PENDING) return r.ie;
     const t = r.T.V;
-    return t !== NOT_PENDING ? t : r.Ie;
+    return t !== NOT_PENDING ? t : r.le;
 }
 
 /** Truth readers (`until`, `refresh`; CONFIG_AUTHORITATIVE) — pay-for-use:
@@ -25,19 +25,19 @@ function laneValueOf(r) {
  * value. */ function truthRead(r) {
     if (truth(r)) return laneValueOf(r);
     if (!(r.l & CONFIG_GUESS)) throw new NotReadyError(null);
-    return r.ue !== NOT_PENDING ? r.ue : r.Ie;
+    return r.ie !== NOT_PENDING ? r.ie : r.le;
 }
 
 /** A guess confirmed: its lane's truth readers re-read — of the lane's
  * derivations too, which may be the truth now (#3943). */ function truthConfirmed(r) {
-    for (let t = 0; t < r.je.length; t++) for (let e = r.je[t].o; e !== null; e = e.t) if (e.u.l & CONFIG_AUTHORITATIVE) enqueueSub(e.u);
+    for (let t = 0; t < r.Ye.length; t++) for (let e = r.Ye[t].o; e !== null; e = e.t) if (e.u.l & CONFIG_AUTHORITATIVE) enqueueSub(e.u);
 }
 
 /** A lane node's value is the truth when every guess beneath it is
  * confirmed — its source staged a value equal to the guess — and nothing
  * beneath it is held in the parent: same inputs, same value. */ function truth(r) {
-    if (r.l & CONFIG_GUESS) return r.ue !== NOT_PENDING && r.Ye && r.Ye(r.T.V, r.ue);
-    if (r.ue !== NOT_PENDING) return;
+    if (r.l & CONFIG_GUESS) return r.ie !== NOT_PENDING && r.je && r.je(r.T.V, r.ie);
+    if (r.ie !== NOT_PENDING) return;
     if (r.l & CONFIG_OVERRIDE) for (let t = r.C; t; t = t.G) if (!truth(t.S)) return;
     return 1;
 }

package/dist/observe/core/verdict.js

@@ -139,8 +139,8 @@ let probeFound = false;
  * when every flight it waits on is. */ function quietPending(e) {
     const t = e.T;
     if (t === null) return false;
-    if (t.fe !== undefined) {
-        for (const e of t.fe) if (!e.T?.ut) return false;
+    if (t.se !== undefined) {
+        for (const e of t.se) if (!e.T?.ut) return false;
         return true;
     }
     return t.ut;
@@ -159,7 +159,7 @@ let probeFound = false;
  * flight — a staging equal to what is displayed changes nothing when it
  * lands: final now (maintainer, 2026-10-02). */ function heldNotFinal(e) {
     if ((e.m & STATUS_PENDING) !== 0 && !quietPending(e)) return true;
-    return e.ue !== NOT_PENDING && !latestActive && !e.T.ut && !(e.m & STATUS_UNINITIALIZED) && (!!e.T.de || !e.Ye || !e.Ye(e.Ie, e.ue));
+    return e.ie !== NOT_PENDING && !latestActive && !e.T.ut && !(e.m & STATUS_UNINITIALIZED) && (!!e.T.Te || !e.je || !e.je(e.le, e.ie));
 }
 
 /** `isPending`'s answer for an unheld node whose flight is up (cause ii). */ function pendingVerdict(e, t) {
@@ -177,7 +177,7 @@ let probeFound = false;
  * a router's link claim probing inside the computation that creates the
  * anchor). A throw still reaches the pass through `untrack`. */ function markVerdictReader(e) {
     let t = context;
-    if (t?.Pt) t = t.Ht;
+    if (t?.Pt) t = t.ht;
     if (t !== null && tracking) {
         t.l |= CONFIG_VERDICT;
         t.R |= REACTIVE_PROBED;
@@ -261,8 +261,8 @@ let probeFound = false;
 }
 
 /** The staging, or the staged error thrown (D-41). */ function staged(e) {
-    if (e.l & CONFIG_STAGED_ERROR) throw e.ue;
-    return e.ue;
+    if (e.l & CONFIG_STAGED_ERROR) throw e.ie;
+    return e.ie;
 }
 
 /** `latest()` of a held node: the flushed staging — the proposal — and, for
@@ -322,7 +322,7 @@ let probeFound = false;
         if (i) verdictRead(t, r._parent ?? r);
         const u = (n.m & STATUS_PENDING) !== 0 && !quietPending(n);
         if (e.l & CONFIG_GUESS) {
-            if (probing && (u || e.ue !== NOT_PENDING && (!e.Ye || !e.Ye(e.T.V, e.ue)))) probeFound = true;
+            if (probing && (u || e.ie !== NOT_PENDING && (!e.je || !e.je(e.T.V, e.ie)))) probeFound = true;
             // A lane a correction folded under (D-34): `latest()` shows the hold's
             // world whole — the truth beneath each guess, else what it covered.
                         if (latestActive && r.folded) return r.folded(null, e);
@@ -342,28 +342,28 @@ let probeFound = false;
             // `isPending` is answered below either way.
                         if (i && !probing && t.i === EFFECT_RENDER && passLane === null && r.it !== null && r.it.ln && flushTransaction !== r) {
                 staleReader(t, r.it);
-                return e.Ie;
+                return e.le;
             }
             if (i) verdictRead(t, r);
             if (probing && heldNotFinal(n)) probeFound = true;
-            if (latestActive && e.ue !== NOT_PENDING) {
+            if (latestActive && e.ie !== NOT_PENDING) {
                 // An action body reading another transaction's proposal derives
                 // from it: the two settle as one (A15; posture C, 2026-09-15). An
                 // untracked read elsewhere has no transaction to entangle.
                 if (!i && flushTransaction !== null && !globalQueue.q) joinFuture(txOf(e));
                 return heldLatest(e, i ? t : null);
             }
-            return e.Ie;
+            return e.le;
         }
         // Born into the future: its staging is its only value. It has no
         // committed value, so no verdict: `isPending` reads it as its read does —
         // the owner joins the hold (held with it, or caught by a boundary that
         // has not shown content) and answers for the commit, where it is final.
-                if (e.ue !== NOT_PENDING && !(n.m & STATUS_PENDING)) {
+                if (e.ie !== NOT_PENDING && !(n.m & STATUS_PENDING)) {
             if (probing && r) joinPass(t, e);
             return staged(e);
         }
-    } else if (e.ue !== NOT_PENDING) {
+    } else if (e.ie !== NOT_PENDING) {
         if (n.m & STATUS_PENDING && !u) pendingVerdict(i ? t : null, n); else if (i && globalQueue.q) provisionalVerdict(t, !latestActive && !u);
         // Outside a flush, the staging is an unflushed write (A28): the probe
         // answers for the flushed world, and watches the seam of the flush that
@@ -378,12 +378,12 @@ let probeFound = false;
             if (globalQueue.q) return staged(e);
             if (t !== null) markLateLinker(t);
         }
-        return e.Ie;
+        return e.le;
     }
     if (n.m & STATUS_PENDING) {
         if (!u) {
             pendingVerdict(i ? t : null, n);
-            return e.Ie;
+            return e.le;
         }
         // As `read()`: an untracked read of a pending node still re-runs its
         // reader when the node settles (a projection's pull reads its firewall
@@ -392,7 +392,7 @@ let probeFound = false;
         throw n.T?.F;
     }
     if (n.X !== undefined && n.m & STATUS_ERROR) throw n.T.F;
-    return e.Ie;
+    return e.le;
 }
 
 // Installed at module evaluation — present exactly when something imports

package/dist/observe/deferred.js

@@ -123,7 +123,7 @@ GlobalQueue.er = e => lagging.size !== 0 ? lagOf(e, new Set) : undefined;
      * does not replace (D-40) — restaged as the committed value, the hold's
      * readers would re-derive against the old input. */    const serve = e => {
         const r = handleAsync(t, e);
-        return t.l & CONFIG_HELD && t.ue !== NOT_PENDING ? t.ue : r;
+        return t.l & CONFIG_HELD && t.ie !== NOT_PENDING ? t.ie : r;
     };
     const end = () => t.R & REACTIVE_DISPOSED && land(o);
     return accessor(computed(r => {
@@ -135,49 +135,51 @@ GlobalQueue.er = e => lagging.size !== 0 ? lagOf(e, new Set) : undefined;
         // Sticky, and read before this wrapper ever opens the window itself.
                 const n = l ||= !(t.m & STATUS_UNINITIALIZED) && !t.ce;
         if (n) t.ce = true, t.l |= CONFIG_LAGS;
-        let c;
         try {
-            c = e(r);
+            const t = e(r);
+            if (n && typeof t === "object" && t !== null) {
+                if (isThenable(t)) {
+                    ask(t);
+                    const done = () => land(t, true);
+                    t.then(done, done);
+                    return serve(t);
+                }
+                const e = t[Symbol.asyncIterator];
+                if (e) {
+                    // A stream's flight ends at its first yield (or its end).
+                    const r = e.call(t);
+                    let o = true;
+                    const done = () => land(n, true);
+                    const n = {
+                        // Registered ahead of the engine's own reaction to the same
+                        // promise, as for a plain flight: verdict and value in one flush.
+                        next: e => {
+                            const t = r.next(e);
+                            if (o) {
+                                o = false;
+                                if (isThenable(t)) t.then(done, done); else done();
+                            }
+                            return t;
+                        },
+                        return: e => r.return?.(e) ?? Promise.resolve({
+                            done: true,
+                            value: e
+                        })
+                    };
+                    ask(n);
+                    return serve({
+                        [Symbol.asyncIterator]: () => n
+                    });
+                }
+            }
+            land(o);
+            return t;
         } catch (e) {
             // The wrapping form: an unready source parks the node in the window,
             // and the wait is its flight until the source's settle re-runs it.
-            if (n && e instanceof NotReadyError) ask(e);
+            if (n && e instanceof NotReadyError) ask(e); else land(o);
             throw e;
         }
-        if (n && typeof c === "object" && c !== null) {
-            if (isThenable(c)) {
-                ask(c);
-                const done = () => land(c, true);
-                c.then(done, done);
-                return serve(c);
-            }
-            const e = c[Symbol.asyncIterator];
-            if (e) {
-                // A stream's flight ends at its first yield (or its end).
-                const r = e.call(c);
-                let t = true;
-                const done = () => land(o, true);
-                const o = {
-                    // Registered ahead of the engine's own reaction to the same
-                    // promise, as for a plain flight: verdict and value in one flush.
-                    next: e => {
-                        const o = r.next(e);
-                        if (t) t = false, o.then(done, done);
-                        return o;
-                    },
-                    return: e => r.return?.(e) ?? Promise.resolve({
-                        done: true,
-                        value: e
-                    })
-                };
-                ask(o);
-                return serve({
-                    [Symbol.asyncIterator]: () => o
-                });
-            }
-        }
-        land(o);
-        return c;
     }, r));
 }