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

package/dist/prod/core/async.js

@@ -1,4 +1,4 @@
-import { STATUS_ERROR, STATUS_PENDING, STATUS_NO_VALUE, STATUS_UNINITIALIZED, CONFIG_GUESS, REACTIVE_RECOMPUTING_DEPS, CONFIG_HELD, REACTIVE_STAGED_READ, CONFIG_STAGED, CONFIG_STAGED_ERROR, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, NewSet, REACTIVE_DIRTY, CONFIG_INPUTS_PUBLISHED, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_OVERRIDE } from "./constants.js";
+import { STATUS_ERROR, STATUS_PENDING, STATUS_NO_VALUE, STATUS_UNINITIALIZED, CONFIG_GUESS, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_ASYNC, REACTIVE_WINDOW, CONFIG_HELD, REACTIVE_STAGED_READ, CONFIG_STAGED, CONFIG_STAGED_ERROR, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, NewSet, REACTIVE_DIRTY, CONFIG_INPUTS_PUBLISHED, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_OVERRIDE } from "./constants.js";
 
 import { ext, statusNotifierOf, context, untrack, setSignal } from "./core.js";
 
@@ -10,30 +10,30 @@ import { enqueueSub } from "./heap.js";
 
 import { disposeChildren, cleanup } from "./owner.js";
 
-import { passLane, joinFuture, question, MAINLINE_QUESTION, globalQueue, schedule, clock, flush, freshHook, txOf, laneStageHook, queuePendingNode } from "./scheduler.js";
+import { guessing, passLane, joinFuture, txOf, holdWorkHook, question, MAINLINE_QUESTION, globalQueue, schedule, clock, flush, freshHook, laneStageHook, queuePendingNode } from "./scheduler.js";
 
 // The lazily-created Set is the ONE container for pending sources. Its
 // predecessor — a singular slot promoted to a Set on the second source —
 // created dual state whose migration invariant was easy to break: a third
 // overlapping source landed beside the Set and removePendingSource refused
 // to clear it, stranding the Set members' pending forever (#2893).
-function addPendingSource(e, n) {
-    if (e.T?.fe?.has(n)) return false;
-    (ext(e).fe ??= new NewSet).add(n);
+function addPendingSource(e, t) {
+    if (e.T?.se?.has(t)) return false;
+    (ext(e).se ??= new NewSet).add(t);
     return true;
 }
 
-function removePendingSource(e, n) {
-    const t = e.T?.fe;
-    if (!t?.delete(n)) return false;
-    if (!t.size) e.T.fe = undefined;
+function removePendingSource(e, t) {
+    const n = e.T?.se;
+    if (!n?.delete(t)) return false;
+    if (!n.size) e.T.se = undefined;
     return true;
 }
 
 function clearPendingSources(e) {
     // This set is node-owned and never shared; dropping the sole reference
     // releases the set and every entry without a redundant clear() walk.
-    if (e.T !== null) e.T.fe = undefined;
+    if (e.T !== null) e.T.se = undefined;
 }
 
 // A rejection-pending only resolves through the settle sweep over the
@@ -41,10 +41,10 @@ function clearPendingSources(e) {
 // edge: a dep that IS the source, or one whose own pending chain carries it
 // (pending sources propagate the origin node, so this covers any depth).
 // Also guards branch-local recovery: another dependency may still need the source.
-function retryReaches(e, n) {
-    for (let t = e.C; t; t = t.G) {
-        const e = t.S;
-        if (e === n || e.T?.fe?.has(n)) return true;
+function retryReaches(e, t) {
+    for (let n = e.C; n; n = n.G) {
+        const e = n.S;
+        if (e === t || e.T?.se?.has(t)) return true;
     }
     return false;
 }
@@ -55,33 +55,33 @@ function retryReaches(e, n) {
  * settlePendingSource walk runs off `_pendingSources` + `_blocked` alone —
  * with NO read-visible pending status and no downstream propagation. Commit
  * #0 keeps serving.
- */ function parkLoadingWindow(e, n) {
-    ext(e).se = true;
-    if (n.source) addPendingSource(e, n.source);
+ */ function parkLoadingWindow(e, t) {
+    ext(e).fe = true;
+    if (t.source) addPendingSource(e, t.source);
     // A settled error is the node's answer ("the error stays the answer until
     // this retry can actually run") — the park must not replace it: reads
     // throw `_error` while STATUS_ERROR is set, and overwriting it here leaks
     // a pending-class NotReadyError from a read-invisible park (#2989).
-        if (!(e.m & STATUS_ERROR)) setPendingError(e, n.source, n);
+        if (!(e.m & STATUS_ERROR)) setPendingError(e, t.source, t);
 }
 
-function setPendingError(e, n, t) {
-    if (!n) {
+function setPendingError(e, t, n) {
+    if (!t) {
         if (e.T !== null) e.T.U = null;
         return;
     }
-    if (t instanceof NotReadyError && t.source === n) {
-        ext(e).U = t;
+    if (n instanceof NotReadyError && n.source === t) {
+        ext(e).U = n;
         return;
     }
     const r = e.T?.U;
-    if (!(r instanceof NotReadyError) || r.source !== n) {
-        ext(e).U = new NotReadyError(n);
+    if (!(r instanceof NotReadyError) || r.source !== t) {
+        ext(e).U = new NotReadyError(t);
     }
 }
 
-function forEachDependent(e, n) {
-    for (let t = e.o; t !== null; t = t.t) n(t.u, t);
+function forEachDependent(e, t) {
+    for (let n = e.o; n !== null; n = n.t) t(n.u, n);
 }
 
 // Queue a node to re-run on the next flush (used both when a pending source
@@ -103,16 +103,16 @@ function releaseIfSettledUnobserved(e) {
 // the propagation completes, walk the same graph for stranded lazy nodes.
 // Collect-then-release so unobserved() never unlinks under the walk.
 function releaseSettledDependents(e) {
-    let n;
-    const t = new NewSet;
+    let t;
+    const n = new NewSet;
     const visit = e => {
-        if (t.has(e)) return;
-        t.add(e);
-        if (!e.o && e.l & CONFIG_AUTO_DISPOSE) (n ??= []).push(e);
+        if (n.has(e)) return;
+        n.add(e);
+        if (!e.o && e.l & CONFIG_AUTO_DISPOSE) (t ??= []).push(e);
         forEachDependent(e, visit);
     };
     forEachDependent(e, visit);
-    if (n) for (const e of n) releaseIfSettledUnobserved(e);
+    if (t) for (const e of t) releaseIfSettledUnobserved(e);
 }
 
 // Error-dimension twin of settlePendingSource's blocked re-enqueue (#2949):
@@ -137,7 +137,7 @@ function releaseSettledDependents(e) {
  * it through the ordinary error path (`commitPendingNode` → `notifyStatus`),
  * dependents included. Not for a lane pass, nor a node with no shown value
  * (born held — its error has no frame to wait behind): those publish now,
- * as before. Returns whether the error was staged. */ function stageError(e, n, t) {
+ * as before. Returns whether the error was staged. */ function stageError(e, t, n) {
     // Held, or — for a pass's own throw — derived from a staging of a flush
     // (REACTIVE_STAGED_READ is this pass's; a landing after the pass cannot
     // read it, the flush it read a staging of has committed or parked since).
@@ -146,13 +146,13 @@ function releaseSettledDependents(e) {
     // (#4109). A flush that parks nothing publishes it at its commit (S-38).
     // Not a projection's derive: its readers learn its error through the
     // family, which the commit's publish never reaches (#4189).
-    if (!(e.l & CONFIG_HELD || t && e.R & REACTIVE_STAGED_READ && globalQueue.q && !e.fam) || passLane) return false;
+    if (!(e.l & CONFIG_HELD || n && e.R & REACTIVE_STAGED_READ && globalQueue.Y && !e.fam) || passLane) return false;
     // The node answered (an error ends the wait — no longer pending, nor
     // blocked); a shown error stays its display until the commit.
         clearPendingSources(e);
-    if (e.T) e.T.se = false;
+    if (e.T) e.T.fe = false;
     if (!((e.m &= STATUS_ERROR | STATUS_UNINITIALIZED) & STATUS_ERROR)) setPendingError(e);
-    e.ie = n instanceof StatusError ? n : new StatusError(e, n);
+    e.ue = t instanceof StatusError ? t : new StatusError(e, t);
     e.l |= CONFIG_STAGED | CONFIG_STAGED_ERROR;
     // Readers parked on the flight re-run and derive from the staging; the
     // verdict readers the walk wakes need a flush (#4106).
@@ -161,84 +161,85 @@ function releaseSettledDependents(e) {
     return true;
 }
 
-function settleErroredDependents(e, n) {
-    let t = false;
+function settleErroredDependents(e, t) {
+    let n = false;
     const r = new NewSet;
     const visit = e => {
         if (r.has(e)) return;
         r.add(e);
-        if (e.T?.U === n) {
+        if (e.T?.U === t) {
             enqueueSub(e);
-            t = true;
+            n = true;
         }
         forEachDependent(e, visit);
     };
     forEachDependent(e, visit);
-    if (t) schedule();
+    if (n) schedule();
 }
 
 // Retire `source` from pending state along the dependent graph rooted at `el`.
 // By default, `el` is the source whose flight settled or was superseded.
 // With a distinct `source`, `el` is a recovered computation that dropped it:
 // the source may still be pending, so dependents with another path to it stay pending.
-function settlePendingSource(e, n = e) {
+function settlePendingSource(e, t = e) {
     // Landing and branch recovery already cleared el's own set. Superseded
     // re-parks can retain an abandoned self entry (source === el), which must
     // retire in the same walk as its propagated copies.
-    removePendingSource(e, n);
-    let t = false;
+    removePendingSource(e, t);
+    let n = false;
     let r;
     const o = new NewSet;
-    const settle = f => {
-        if (o.has(f) || 
+    const settle = s => {
+        if (o.has(s) || 
         // A conditional dropped this source, but another dependency can still
         // carry it. Only retire pending state inherited through the recovered
         // branch. Deliberately NOT marked visited on this early return: the
         // carrying dependency may itself be a later branch of this same walk
         // (two unchanged memos converging), and its visit must be free to
         // re-examine this node once that branch has retired the source.
-        n !== e && retryReaches(f, n) || !removePendingSource(f, n)) 
+        t !== e && retryReaches(s, t) || !removePendingSource(s, t)) 
         // A19: a verdict reader holds no pending of its own (it was re-derived
         // when the source went pending, `propagateStatus`), and a landing
         // equal to the committed value notifies nobody — the source settling
-        // is its verdict changing: it runs again.
-        return f.l & CONFIG_VERDICT && enqueueSub(f);
-        o.add(f);
-        f.Se = clock;
-        const s = f.T?.fe?.values().next().value;
+        // is its verdict changing: it runs again. (Verdict readers exist only
+        // with the verdict engine installed.)
+        return holdWorkHook && s.l & CONFIG_VERDICT && enqueueSub(s);
+        o.add(s);
+        s.ie = clock;
+        const f = s.T?.se?.values().next().value;
         // STATUS_ERROR + pending sources only coexist via an errored loading
         // window's park (notifyStatus(STATUS_ERROR) clears pending sources
         // otherwise): the settled error stays the answer through the settle —
         // nulling it here would have reads throw `null` until the re-enqueued
         // retry lands, or lose it entirely if that retry parks again (#2989).
-                const u = f.m & STATUS_ERROR;
-        if (s) {
-            if (!u) setPendingError(f, s);
+                const u = s.m & STATUS_ERROR;
+        if (f) {
+            if (!u) setPendingError(s, f);
         } else {
-            f.m &= ~STATUS_PENDING;
-            if (!u) setPendingError(f);
+            s.m &= ~STATUS_PENDING;
+            if (!u) setPendingError(s);
             // L2: a landing resumes the transaction waiting on it (maintainer: "it
             // resumes the sync frame") — a held reader's re-pass over the landed
             // value is that transaction's work, and the flush that carries it
             // parks into it.
-                        if (f.l & CONFIG_HELD) joinFuture(txOf(f));
-            if (f.T?.se) {
-                enqueueSub(f);
-                t = true;
+                        if (s.l & CONFIG_HELD) joinFuture(txOf(s));
+            if (s.T?.fe) {
+                enqueueSub(s);
+                n = true;
             }
-            if (f.T !== null) f.T.se = false;
+            if (s.T !== null) s.T.fe = false;
             // Fully settled with nobody watching: release candidate (#2934). Checked
             // again at release time — deferred so unobserved() can't unlink subs
             // lists this walk is still iterating.
-                        if (!f.o && f.l & CONFIG_AUTO_DISPOSE) (r ??= []).push(f);
+                        if (!s.o && s.l & CONFIG_AUTO_DISPOSE) (r ??= []).push(s);
         }
-        forEachDependent(f, settle);
+        forEachDependent(s, settle);
     };
     forEachDependent(e, settle);
     // Release before the flush schedule below: unobserved() pulls the node back
     // out of the heap, so the enqueueSub above never recomputes a released node.
         if (r) for (const e of r) releaseIfSettledUnobserved(e);
-    if (t) schedule();
+    if (n) schedule();
 }
 
 // Object-thenable detection (Promises/A+ shape).
@@ -247,10 +248,10 @@ function isThenable(e) {
 }
 
 /** Fire and clear a node's iterator-flight cancellation hook (#3122). */ function releaseFlightTeardown(e) {
-    const n = e.T?.ae;
-    if (n != null) {
-        e.T.ae = null;
-        n();
+    const t = e.T?.Se;
+    if (t != null) {
+        e.T.Se = null;
+        t();
     }
 }
 
@@ -263,17 +264,17 @@ function isThenable(e) {
  * before its first pull, so a source opened in an async generator's body
  * (`for await`) composes after the generator's close.
  */ function onSupersede(e) {
-    const n = context;
-    if (n === null || n.X === undefined || !(n.R & REACTIVE_RECOMPUTING_DEPS)) return;
-    const t = n.T === null;
-    const r = ext(n);
+    const t = context;
+    if (t === null || t.X === undefined || !(t.R & REACTIVE_RECOMPUTING_DEPS)) return;
+    const n = t.T === null;
+    const r = ext(t);
     // Allocating the extension mid-run turns `_x?._inFlight` from undefined into
     // null, which recompute would read as a flight this body registered itself.
     // Restore undefined here, so the fix costs nothing for code that never
     // calls onSupersede.
-        if (t) r.Ee = undefined;
-    const o = r.ae;
-    r.ae = o === null ? e : () => {
+        if (n) r.Ee = undefined;
+    const o = r.Se;
+    r.Se = o === null ? e : () => {
         try {
             o();
         } finally {
@@ -282,90 +283,98 @@ function isThenable(e) {
     };
 }
 
-function handleAsync(e, n, t, 
+function handleAsync(e, t, n, 
 // The flight rejected (after the node's status is set): a projection
 // tells its leaves' readers, who are not the node's dependents
 // (store/projection.ts). `pending`: a NotReady rejection — the node is
 // pending on another source, not errored.
 r) {
     let o = false;
-    let f = false;
-    if (typeof n === "object" && n !== null) {
+    let s = false;
+    if (typeof t === "object" && t !== null) {
         untrack(() => {
-            o = n[Symbol.asyncIterator];
-            f = !o && isThenable(n);
+            o = t[Symbol.asyncIterator];
+            s = !o && isThenable(t);
         });
     }
-    if (!f && !o) {
-        if (e.T !== null) e.T.Ee = null;
+    if (!s && !o) {
+        if (e.T !== null) {
+            e.T.Ee = null;
+            if (holdWorkHook) e.l &= ~CONFIG_ASYNC;
+        }
         // A sync landing is the first real answer for a loadingValue node.
                 e.ce = false;
-        return n;
+        return t;
     }
     // Flight replacement relies on recompute's supersede release for iterator
     // teardown (#3122): every handleAsync call — including the projection
     // self-registration — runs during a recompute of `el`, which has already
     // fired _flightTeardown. A future non-recompute registration path must
     // release it here before overwriting _inFlight.
-        ext(e).Ee = n;
+        ext(e).Ee = t;
+    // D-25 (verdict.ts `holdWork`): an async memo whose answering pass opened
+    // no verdict window of its own (`markVerdictReader` clears the bit).
+    // Kept by the verdict engine alone (`holdWorkHook`): a build without it
+    // folds the bit's upkeep away.
+        if (holdWorkHook && !(e.R & REACTIVE_WINDOW)) e.l |= CONFIG_ASYNC;
     // The question this flight answers (A18 provenance, lanes.ts): the action
     // whose slice asked it; mainline is always the current question.
-        e.T.Te = question || MAINLINE_QUESTION;
+        e.T.Ie = question || MAINLINE_QUESTION;
     // The run that asked this flight read every input without throwing: an
     // input still in flight was masked for it (an active override, A17), so
     // pending state those inputs propagated onto the node earlier does not
     // describe this answer. Drop it — the flight is the node's pending now.
     // The landing retires only the flight's own entry (landStatus, #3373), so
     // an entry that survived here would hold the node past its own answer.
-        e.T.fe = undefined;
-    let s;
+        e.T.se = undefined;
+    let f;
     const handleError = o => {
-        if (e.T?.Ee !== n) return;
+        if (e.T?.Ee !== t) return;
         // NotReadyError from rejected promises should be treated as pending, not error
-                let f = o instanceof NotReadyError;
-        if (f && e.ce) {
+                let s = o instanceof NotReadyError;
+        if (s && e.ce) {
             // Loading window: the flight died waiting on an unready source. Keep
             // serving commit #0 — same parking as recompute's catch for sync
             // dependency throws. The dead flight is released so the clock-gated
             // error-retry pull (updateIfNecessary) can also re-ask.
             if (e.T !== null) e.T.Ee = null;
             parkLoadingWindow(e, o);
-            e.Se = clock;
+            e.ie = clock;
             return;
         }
         // D-41: a held node's error is staged (`stageError`). A derived store's
         // readers learn its error through the family, not the derive's
         // dependents: it publishes now.
-                if (f || t || !stageError(e, o)) {
-            notifyStatus(e, f ? STATUS_PENDING : STATUS_ERROR, o);
+                if (s || n || !stageError(e, o)) {
+            notifyStatus(e, s ? STATUS_PENDING : STATUS_ERROR, o);
             // The error is this pass's answer, published now: it replaces the shown
             // frame as a value's commit would (`commitPendingNode`), so the frame
             // the pass parked goes instead of waiting for a later success. A no-op
             // when nothing is parked.
-                        if (!f) disposeChildren(e, false, true);
+                        if (!s) disposeChildren(e, false, true);
         }
         // A NotReady rejection is a landing into another pending source. The
         // rejected flight will never settle its self entry, so transfer ownership
         // after notifyStatus has propagated the replacement source.
-                if (f) settlePendingSource(e);
-        e.Se = clock;
+                if (s) settlePendingSource(e);
+        e.ie = clock;
         // A real error settles derivatively-pending dependents (notifyStatus
         // cleared their pending sources), so stranded lazy ones release here —
         // the error twin of settlePendingSource's release (#2934).
-                if (!f) releaseSettledDependents(e);
-        r?.(o, f);
+                if (!s) releaseSettledDependents(e);
+        r?.(o, s);
     };
     const asyncWrite = (r, o) => {
-        if (e.T?.Ee !== n) return;
+        if (e.T?.Ee !== t) return;
         // If the node was dirtied by a newer write (optimistic override or regular),
         // skip this stale async result — the upcoming flush will recompute the node
         // with the new value, creating a fresh Promise that supersedes this one.
                 if (e.R & REACTIVE_DIRTY) return;
-        const f = e.m & STATUS_UNINITIALIZED;
+        const s = e.m & STATUS_UNINITIALIZED;
         landStatus(e);
-        if (t) {
+        if (n) {
             try {
-                t(r);
+                n(r);
             } catch (e) {
                 handleError(e);
                 return;
@@ -376,10 +385,10 @@ r) {
             // a verdict reader of the next flight would suspend instead of being
             // served the screen; held, both at the derive's commit.
                         if (!(e.l & CONFIG_HELD)) {
-                e.T.Ie = undefined;
+                e.T.Te = null;
                 e.l &= ~CONFIG_INPUTS_PUBLISHED;
             }
-            if (f) landStatus(e, true);
+            if (s) landStatus(e, true);
         } else {
             // CARVE 2: the override-covered landing (hold + A18 supersession) and the
             // lane-routed landing (derived override, lane effect queue) went with
@@ -393,7 +402,7 @@ r) {
         // (`_pendingValue` set inside setSignal) is not — commitPendingNode closes
         // the window when the flush commits it, so no one-frame pulse can leak to
         // observers between the landing and its commit (#2990).
-                if (e.ie === NOT_PENDING) {
+                if (e.ue === NOT_PENDING) {
             e.ce = false;
             // The landing published: the dependency tail the flight's pass left
             // linked goes now (A30, #3410). A staged landing has not replaced the
@@ -429,9 +438,9 @@ r) {
     // write through asyncWrite, and close registration targets `owner` (el
     // itself) directly. Returns whether a sync answer landed (first yield or
     // empty completion) — meaningful only in the live posture.
-        const consumeIterator = (t, r) => {
-        const o = t[Symbol.asyncIterator]();
-        let f = false;
+        const consumeIterator = (n, r) => {
+        const o = n[Symbol.asyncIterator]();
+        let s = false;
         let u = false;
         let i = !r;
         const close = () => {
@@ -450,7 +459,7 @@ r) {
         // `onSupersede` teardown this run registered earlier, which then falls
         // back to the owner-cleanup channel. A returned `from()` is unaffected:
         // `close` calls its `return()`, which runs its own teardown.
-                ext(e).ae = close;
+                ext(e).Se = close;
         // Release check before each next pull: an unobserved lazy node must tear
         // down (its close above runs via disposal, closing the iterator) instead
         // of pumping the stream forever with zero subscribers (#2935).
@@ -465,7 +474,7 @@ r) {
             }
         };
         const iterate = () => {
-            let t, r, l = false, S = false, a = true;
+            let n, r, l = false, S = false, a = true;
             // Protocol tolerance, matching `for await`: `await` unwraps whatever
             // next() returns — a thenable OR a bare IteratorResult. Real producers
             // use the bare form as a promise-free fast path when a value is already
@@ -484,17 +493,17 @@ r) {
                 // silently dropped. (The deferred posture never has a caller, so
                 // initialRead starts false there and everything writes through.)
                 if (a && i) {
-                    t = r;
+                    n = r;
                     l = true;
                     if (r.done) u = true;
-                } else if (e.T?.Ee !== n) {
+                } else if (e.T?.Ee !== t) {
                     return;
                 } else if (!r.done) {
-                    f = true;
+                    s = true;
                     asyncWrite(r.value, iterateOrRelease);
                 } else {
                     u = true;
-                    if (f) {
+                    if (s) {
                         schedule();
                         flush();
                     } else {
@@ -503,13 +512,13 @@ r) {
                     }
                     settleAutodispose();
                 }
-            }, t => {
+            }, n => {
                 if (a && i) {
-                    r = t;
+                    r = n;
                     S = true;
-                } else if (e.T?.Ee === n) {
+                } else if (e.T?.Ee === t) {
                     u = true;
-                    handleError(t);
+                    handleError(n);
                     settleAutodispose();
                 }
             });
@@ -521,17 +530,17 @@ r) {
                 if (i) throw r;
                 return true;
             }
-            if (l && !t.done) {
-                s = t.value;
-                f = true;
+            if (l && !n.done) {
+                f = n.value;
+                s = true;
                 return iterate();
             }
-            return l && t.done;
+            return l && n.done;
         };
         const l = iterate();
         // Later iterate() calls run from asyncWrite, where rethrowing would be unhandled.
                 i = false;
-        return f || l;
+        return s || l;
     };
     // Landed-synchronously verdict for a LIVE iterator drain; null when no live
     // drain ran (plain promise flight, or a deferred flatten). Drives the
@@ -542,25 +551,25 @@ r) {
     // stream itself rather than settling on the iterable object. One level
     // only: A+ `then` already collapses nested thenables, so the resolved
     // value is never itself a thenable.
-        const flattenIfIterable = (e, n) => {
-        let t = false;
+        const flattenIfIterable = (e, t) => {
+        let n = false;
         if (typeof e === "object" && e !== null) {
             untrack(() => {
-                t = e[Symbol.asyncIterator];
+                n = e[Symbol.asyncIterator];
             });
         }
-        if (!t) return false;
-        s = undefined;
-        const r = consumeIterator(e, n);
-        if (!n) u = r;
+        if (!n) return false;
+        f = undefined;
+        const r = consumeIterator(e, t);
+        if (!t) u = r;
         return true;
     };
-    if (f) {
-        let t = false, r = false, o, f = true;
-        n.then(r => {
-            if (f) {
-                s = r;
-                t = true;
+    if (s) {
+        let n = false, r = false, o, s = true;
+        t.then(r => {
+            if (s) {
+                f = r;
+                n = true;
             } else {
                 // Flattening consumes the stream as the value: each yield lands
                 // through asyncWrite under this flight's identity; the first one
@@ -572,7 +581,7 @@ r) {
                 // compute catch above it: a protocol throw settles as this
                 // flight's error (#4112).
                 try {
-                    if (e.T?.Ee === n && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, e)) return;
+                    if (e.T?.Ee === t && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, e)) return;
                     asyncWrite(r);
                 } catch (e) {
                     handleError(e);
@@ -580,7 +589,7 @@ r) {
                 settleAutodispose();
             }
         }, e => {
-            if (f) {
+            if (s) {
                 o = e;
                 r = true;
             } else {
@@ -588,21 +597,21 @@ r) {
                 settleAutodispose();
             }
         });
-        f = false;
+        s = false;
         if (r) {
             // Settle through the same status path an async rejection uses, then
             // unwind the in-progress synchronous read so the errored node isn't
             // momentarily read as `undefined`.
             handleError(o);
             throw o;
-        } else if (!t) {
+        } else if (!n) {
             // Not landed: the shared tail below suspends, or — loading window —
             // serves commit #0 (first-flight work on a loadingValue node is
             // loading-class, invisible to boundaries; the flight itself is already
             // registered in _inFlight and lands through asyncWrite). A promise is
             // never an iterator, so nothing between here and there runs.
             u = false;
-        } else if (!flattenIfIterable(s)) {
+        } else if (!flattenIfIterable(f)) {
             // Synchronously-resolved promise: the first real answer landed.
             e.ce = false;
         }
@@ -610,7 +619,7 @@ r) {
         // are still inside the synchronous read): full initial-drain semantics
         // apply and the shared tail below settles the verdict.
         }
-    if (o) flattenIfIterable(n);
+    if (o) flattenIfIterable(t);
     if (u !== null) {
         if (!u) {
             // Loading window: serve commit #0 instead of suspending.
@@ -621,16 +630,16 @@ r) {
         // answer; async yields clear inside asyncWrite.
                 e.ce = false;
     }
-    return s;
+    return f;
 }
 
-function clearStatus(e, n = false) {
-    if (e.T?.fe) clearPendingSources(e);
-    if (e.T?.se) e.T.se = false;
-    e.m = n ? 0 : e.m & STATUS_UNINITIALIZED;
+function clearStatus(e, t = false) {
+    if (e.T?.se) clearPendingSources(e);
+    if (e.T?.fe) e.T.fe = false;
+    e.m = t ? 0 : e.m & STATUS_UNINITIALIZED;
     if (e.T?.U) setPendingError(e);
-    const t = statusNotifierOf(e);
-    if (t) t.call(e);
+    const n = statusNotifierOf(e);
+    if (n) n.call(e);
 }
 
 /**
@@ -657,45 +666,50 @@ function clearStatus(e, n = false) {
  * the first landing retires UNINITIALIZED. `_error` must move off self: a
  * reader thrown NotReady(self) would park on a retired entry. Companions
  * keep their verdict (pending before and after; the write re-syncs them).
- */ function landStatus(e, n = false) {
-    const t = e.T?.fe;
+ */ function landStatus(e, t = false) {
+    const n = e.T?.se;
     // (The full clear below drops the set whether or not self was retired first.)
-        if (t && (t.delete(e), t.size)) {
-        e.T.se = false;
-        if (n) e.m = STATUS_PENDING;
-        setPendingError(e, t.values().next().value);
-    } else clearStatus(e, n);
+        if (n && (n.delete(e), n.size)) {
+        e.T.fe = false;
+        if (t) e.m = STATUS_PENDING;
+        setPendingError(e, n.values().next().value);
+    } else clearStatus(e, t);
 }
 
-function notifyStatus(e, n, t) {
+function notifyStatus(e, t, n) {
     // Wrap regular errors to track source node
-    if (n === STATUS_ERROR && !(t instanceof StatusError) && !(t instanceof NotReadyError)) t = new StatusError(e, t);
-    const r = n === STATUS_PENDING && t instanceof NotReadyError ? t.source : undefined;
+    if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError)) n = new StatusError(e, n);
+    const r = t === STATUS_PENDING && n instanceof NotReadyError && n.source;
     // (CARVE 2: the lane assignment went with the engine.)
-        if (n === STATUS_PENDING && r) {
+        if (t === STATUS_PENDING && r) {
         // D-41: a re-ask of a shown error keeps it the display (`_shownError`).
-        if (e.m & STATUS_ERROR) e.T.Ie = e.T.U;
+        if (e.m & STATUS_ERROR) e.T.Te = e.T.U;
         addPendingSource(e, r);
         // A re-ask of an error that answered the first read: still no value.
                 e.m = STATUS_PENDING | (e.m & STATUS_NO_VALUE ? STATUS_UNINITIALIZED : e.m & STATUS_UNINITIALIZED);
         // Preserve the current source on this propagation so readers park on
         // the distinct pending source.
-                setPendingError(e, r, t);
+                setPendingError(e, r, n);
     } else {
         clearPendingSources(e);
         // An error answering a node with no value marks it so; a re-ask of it
         // (pending) is uninitialized again; a write (STATUS_NONE) gives it one.
-                e.m = n | (n === STATUS_ERROR ? e.m & (STATUS_UNINITIALIZED | STATUS_NO_VALUE) ? STATUS_NO_VALUE : 0 : n === STATUS_PENDING && e.m & STATUS_NO_VALUE ? STATUS_UNINITIALIZED : e.m & STATUS_UNINITIALIZED);
-        ext(e).U = t;
+                e.m = t | (t === STATUS_ERROR ? e.m & (STATUS_UNINITIALIZED | STATUS_NO_VALUE) ? STATUS_NO_VALUE : 0 : t === STATUS_PENDING && e.m & STATUS_NO_VALUE ? STATUS_UNINITIALIZED : e.m & STATUS_UNINITIALIZED);
+        ext(e).U = n;
     }
     // Lanes: a written guess is an optimistic boundary (A17 — "the optimistic
     // future value until we know otherwise"). Its own source in flight is its
     // status, not its readers': they read the guess. The flight is the parent
     // transition's to wait on — the frame it was asked in holds (A17: "a
     // transition whose optimistic node is still pending on its own fetch is
-    // not complete"), through the node itself (`blocked`).
-        if (n === STATUS_PENDING && e.l & CONFIG_GUESS) {
-        if (passLane === null) joinFuture(null);
+    // not complete"), through the node itself (`blocked`). An input changed
+    // from outside the guess's hold asks a new question: the frame that
+    // changed it is held with that hold (D-34, #4336) — it shows beside the
+    // guess's truth, which reveals at that hold's commit (F-1). A `refresh()`
+    // re-asks the same question: its frame is its own.
+    // (No guess written, no arm.)
+        if (guessing && t === STATUS_PENDING && e.l & CONFIG_GUESS) {
+        if (passLane === null) joinFuture(e.R & REACTIVE_REASK ? null : txOf(e)._parent);
         return;
     }
     const o = statusNotifierOf(e);
@@ -703,17 +717,17 @@ function notifyStatus(e, n, t) {
         o.call(e);
         return;
     }
-    propagateStatus(e, n, t);
+    propagateStatus(e, t, n);
 }
 
 /** The dependents' half of `notifyStatus`: `el`'s status reaches each
  * subscriber as a propagated mark (or a re-derive). On its own for a store
  * family's leaves, which are not the derive's dependents — the family
  * propagates the derive's status from each leaf to the leaf's readers
- * (store/projection.ts `wakeFamily`), exactly as a memo's would reach its. */ function propagateStatus(e, n, t) {
-    const r = n === STATUS_PENDING && t instanceof NotReadyError ? t.source : undefined;
-    forEachDependent(e, (o, f) => {
-        o.Se = clock;
+ * (store/projection.ts `wakeFamily`), exactly as a memo's would reach its. */ function propagateStatus(e, t, n) {
+    const r = t === STATUS_PENDING && n instanceof NotReadyError && n.source;
+    forEachDependent(e, (o, s) => {
+        o.ie = clock;
         // A pending mark on a kept-tail link re-derives the subscriber instead of
         // marking it (A30, #3494 review; fuzzer latest-1 #2141; #3519 review).
         // Past `_depsTail` lie the committed frame's deps, kept by A30 because
@@ -733,7 +747,13 @@ function notifyStatus(e, n, t) {
         // Inheriting the error would make a probe's reader errored. A boundary's
         // output (CONFIG_REDERIVE, boundaries.ts) the same: content or fallback
         // is its pass's call.
-                if (o.l & (CONFIG_REDERIVE | CONFIG_VERDICT) || n === STATUS_PENDING && f.de !== o.Ne) {
+        // Not one D-25 makes the hold's work (verdict.ts `holdWork`): an async
+        // memo with no verdict window of its own reads a verdict memo's value,
+        // and that source going pending changes none of its reads — re-derived,
+        // it is served the committed value it already derived from (A10) and
+        // asks that question again. It waits on the source like any derivation
+        // (F-9), and asks its next question once, at the landing (#4397).
+                if (o.l & CONFIG_REDERIVE || holdWorkHook && o.l & CONFIG_VERDICT && !(r && holdWorkHook(o, e)) || t === STATUS_PENDING && s.Ne !== o.de) {
             enqueueSub(o);
             schedule();
             return;
@@ -745,11 +765,11 @@ function notifyStatus(e, n, t) {
         // frame still passes through — its pass is the frame's (#3372, compiled
         // shape: the unmount it stages makes the observer a zombie whose say is
         // moot for this transaction, A15 #3463).
-                if (n === STATUS_PENDING && r && o.T?.fe?.has(r)) {
-            if (passLane === null && (o.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.q && !freshHook?.(o, r.Se === clock)) joinFuture(txOf(o));
+                if (t === STATUS_PENDING && r && o.T?.se?.has(r)) {
+            if (passLane === null && (o.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.Y && !freshHook?.(o, r.ie === clock)) joinFuture(txOf(o));
             return;
         }
-        if (n === STATUS_PENDING && r || n !== STATUS_PENDING && (o.T?.U !== t || o.T?.fe)) {
+        if (t === STATUS_PENDING && r || t !== STATUS_PENDING && (o.T?.U !== n || o.T?.se)) {
             // The marked subscriber is queued for the commit sweep so its status
             // bookkeeping (loading window, uninitialized clear) runs with the flush
             // — with the lane, when the pass propagating is the lane's work and
@@ -762,14 +782,14 @@ function notifyStatus(e, n, t) {
                 // transaction — the flight flows into a memo that transaction
                 // holds, so the write that started it is held with it. A render
                 // effect's membership is its pass's (`notify`), never sticky.
-                                if (n === STATUS_PENDING && (o.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !o.i) joinFuture(txOf(o));
+                                if (t === STATUS_PENDING && (o.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !o.i) joinFuture(txOf(o));
             }
-            notifyStatus(o, n, t);
+            notifyStatus(o, t, n);
             // A derived store's derive (store/projection.ts): marked, not re-run —
             // its leaves' readers are not its dependents, so the family walks them.
-                        o.fam?.st(n);
+                        o.fam?.st(t);
         }
     });
 }
 
-export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, onSupersede, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseIfSettledUnobserved, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource, stageError };
+export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, onSupersede, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseIfSettledUnobserved, releaseSettledDependents, removePendingSource, setPendingError, settleErroredDependents, settlePendingSource, stageError };