@solidjs/signals 2.0.0-rc.3 → 2.0.0-rc.5

package/dist/prod/core/core.js

@@ -1,22 +1,22 @@
-import { handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settleErroredDependents } from "./async.js";
+import { releaseFlightTeardown, handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settleErroredDependents, settlePendingSource } from "./async.js";
 
-import { EFFECT_TRACKED, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_OPTIMISTIC, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, CONFIG_HAS_LANE, STATUS_PENDING, REACTIVE_MISSED_WAKE, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, OVERRIDE_UNDEFINED, CONFIG_HAS_COMPANIONS, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, defaultContext, CONFIG_IN_SNAPSHOT_SCOPE, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, $REFRESH, REACTIVE_MANUAL_WRITE, CONFIG_FW_CHILDREN, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, STORE_SNAPSHOT_PROPS, EFFECT_USER } from "./constants.js";
+import { EFFECT_TRACKED, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_OPTIMISTIC, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, STATUS_PENDING, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, CONFIG_HAS_LANE, REACTIVE_MISSED_WAKE, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, CONFIG_DIRECT_COMMIT, OVERRIDE_UNDEFINED, CONFIG_AUTHORITATIVE_OBSERVED, CONFIG_HAS_COMPANIONS, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, CONFIG_FRESH_READ, CONFIG_AUTHORITATIVE_READ, CONFIG_HELD_TRUTH, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, defaultContext, CONFIG_IN_SNAPSHOT_SCOPE, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, CONFIG_FW_CHILDREN, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, REACTIVE_MANUAL_WRITE, STORE_SNAPSHOT_PROPS, EFFECT_USER } from "./constants.js";
 
 import { NotReadyError } from "./error.js";
 
-import { trimStaleDeps, link, unobserved } from "./graph.js";
+import { trimStaleDeps, link, dormantNodes } from "./graph.js";
 
 import { deleteFromHeap, queueFor, insertIntoHeapHeight, enqueueSub, markNode, markHeap, insertIntoHeap } from "./heap.js";
 
-import { GlobalQueue, activeTransition, globalQueue, clock, insertSubs, queuePendingNode, runInTransition, schedule, notifyEpoch, dirtyQueue, bumpNotifyEpoch, projectionWriteActive, reaskArmed, armReaskClear } from "./scheduler.js";
+import { GlobalQueue, bumpNotifyEpoch, activeTransition, globalQueue, clock, insertSubs, queuePendingNode, runInTransition, schedule, notifyEpoch, dirtyQueue, projectionWriteActive, reaskArmed, armReaskClear } from "./scheduler.js";
 
 import "./invariants.js";
 
 import { disposeChildren, markDisposal, inheritId } from "./owner.js";
 
-GlobalQueue.Ce = recompute;
+GlobalQueue.Fe = recompute;
 
-GlobalQueue.Fe = disposeChildren;
+GlobalQueue.He = disposeChildren;
 
 let tracking = false;
 
@@ -48,8 +48,8 @@ let snapshotSources = null;
 
 function ownerInSnapshotScope(e) {
     while (e) {
-        if (e.He) return true;
-        e = e.ve;
+        if (e.Ve) return true;
+        e = e.ke;
     }
     return false;
 }
@@ -60,41 +60,41 @@ function setSnapshotCapture(e) {
 }
 
 function markSnapshotScope(e) {
-    e.He = true;
+    e.Ve = true;
 }
 
 function releaseSnapshotScope(e) {
-    e.He = false;
+    e.Ve = false;
     releaseSubtree(e);
     schedule();
 }
 
 function releaseSubtree(e) {
-    let t = e.ke;
+    let t = e.xe;
     while (t) {
-        if (t.He) {
-            t = t.Ve;
+        if (t.Ve) {
+            t = t.Le;
             continue;
         }
-        if (t.Se) {
+        if (t.oe) {
             const e = t;
             e.T &= ~CONFIG_IN_SNAPSHOT_SCOPE;
             if (e.ie & REACTIVE_SNAPSHOT_STALE) {
                 e.ie &= ~REACTIVE_SNAPSHOT_STALE;
                 e.ie |= REACTIVE_DIRTY;
-                if (dirtyQueue.xe > e.Le) dirtyQueue.xe = e.Le;
+                if (dirtyQueue.Qe > e.Me) dirtyQueue.Qe = e.Me;
                 insertIntoHeap(e, dirtyQueue);
             }
         }
         releaseSubtree(t);
-        t = t.Ve;
+        t = t.Le;
     }
 }
 
 function clearSnapshots() {
     if (snapshotSources) {
         for (const e of snapshotSources) {
-            delete e.o?.Qe;
+            delete e.o?.We;
             // StoreNode targets share one pre-initialized hidden class (see
             // createStoreProxy) — assign undefined instead of deleting, and only
             // when present so signal-node sources don't grow the field.
@@ -108,48 +108,63 @@ function clearSnapshots() {
 function recompute(e, t = false) {
     // §12d: any recompute can clean a marked subscriber — invalidate skips.
     bumpNotifyEpoch();
-    const n = e.Re;
+    const n = e.he;
     if (!t) {
-        if (e._e && (!n || activeTransition) && activeTransition !== e._e) globalQueue.initTransition(e._e);
+        if (e.Ae && (!n || activeTransition) && activeTransition !== e.Ae) globalQueue.initTransition(e.Ae);
         deleteFromHeap(e, queueFor(e));
-        if (e.o !== null) e.o.Ee = null;
+        if (e.o !== null) {
+            e.o.Ie = 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.
+                        releaseFlightTeardown(e);
+        }
         // Tracked effects run after finalizePureQueue, so dispose immediately instead of deferring
-                if (e._e || n === EFFECT_TRACKED) disposeChildren(e); else if (e.ke !== null || e.he !== null) {
+                if (e.Ae || n === EFFECT_TRACKED) disposeChildren(e); else if (e.xe !== null || e.pe !== null) {
             markDisposal(e);
             const t = ext(e);
-            t.We = e.he;
-            t.qe = e.ke;
-            e.he = null;
-            e.ke = null;
-            e.Me = 0;
+            t.qe = e.pe;
+            t.Ye = e.xe;
+            e.pe = null;
+            e.xe = null;
+            e.Ze = 0;
         } else ;
     }
     let i = !!(e.ie & REACTIVE_OPTIMISTIC_DIRTY);
-    const u = (e.T & CONFIG_OPTIMISTIC) !== 0 && e.o?.De !== NOT_PENDING && e.o?.De !== undefined;
+    const u = (e.T & CONFIG_OPTIMISTIC) !== 0 && e.o?.Oe !== NOT_PENDING && e.o?.Oe !== undefined;
     const l = !!(e.S & STATUS_UNINITIALIZED);
     // Outgoing error, captured before the compute clears status: if this run
     // recovers to an unchanged value, dependents still holding this object must
     // be swept (settleErroredDependents, #2949).
         const o = e.S & STATUS_ERROR ? e.o?._ : undefined;
+    // Pending SOURCE-hood, captured before the compute clears status: a node
+    // whose own flight parked dependents self-registers in _pendingSources
+    // (notifyStatus, isSource). If this recompute supersedes that flight and
+    // settles synchronously, those dependents settle HERE — asyncWrite's
+    // settlePendingSource walk never runs for a landing that was preempted
+    // (#3181).
+        const s = (e.S & STATUS_PENDING) !== 0 && e.o?.le?.has(e) === true;
     // Re-ask classification lives in the verdict module; capture the flag before
     // the recompute wipes _flags below.
-        const s = (e.ie & REACTIVE_REASK) !== 0;
+        const a = (e.ie & 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 a = e.Ie;
-    const r = context;
+        const r = e.Ne;
+    const c = context;
     context = e;
-    e.Ye = null;
-    e.Ze++;
+    e.je = null;
+    e.Ke++;
     e.ie = REACTIVE_RECOMPUTING_DEPS;
     e.Te = clock;
-    let c = e.Pe === NOT_PENDING ? e.be : e.Pe;
-    let _ = e.Le;
-    let f = false;
+    let _ = e.Pe === NOT_PENDING ? e.be : e.Pe;
+    let f = e.Me;
+    let I = false;
     let E = tracking;
-    let I = currentOptimisticLane;
+    let N = currentOptimisticLane;
     tracking = true;
     // A computed's fn establishes its OWN dependencies, so it must never run
     // inside a latest() read window: read() short-circuits through the
@@ -157,54 +172,54 @@ function recompute(e, t = false) {
     // computed) inside latest(fn) came out permanently dependency-less (#2926).
     // latestRead() already suspends the flag for its pull-recomputes; this
     // covers creation-time computes and flushes that run inside the window.
-        const N = latestReadActive;
+        const T = latestReadActive;
     latestReadActive = false;
     // Lane posture lives with the engine: OPTIMISTIC_DIRTY is only ever set by
     // engine-driven paths, and _optimisticNodes is only pushed by
     // _optimisticWrite, so the hook is installed whenever either gate holds.
         if (i) {
-        const t = GlobalQueue.je(e, true);
+        const t = GlobalQueue.Be(e, true);
         if (t) currentOptimisticLane = t;
         // `false` = wake-only lane demotion: recompute plain so a mid-tick
         // latest()/isPending() pull stages instead of direct-committing (#3009).
         // The predicate lives with the engine (recomputeLane).
          else if (t === false) i = false;
-    } else if (activeTransition && !t && activeTransition.Ke.length) {
+    } else if (activeTransition && !t && activeTransition.ze.length) {
         // Lane adoption: parent-deeper-than-owned-child can run before its OPT-dirty
         // child propagates. Walk deps once and inherit the OPT lane so this node
         // recomputes under the right posture and propagates correctly.
-        const t = GlobalQueue.je(e, false);
+        const t = GlobalQueue.Be(e, false);
         if (t) {
             i = true;
             currentOptimisticLane = t;
         }
     }
-    const T = n && n !== EFFECT_USER;
+    const S = n && n !== EFFECT_USER;
     const d = stale;
-    if (T) stale = true;
+    if (S) stale = true;
     try {
         if (!false && e.T & CONFIG_SYNC) {
-            c = e.Se(c);
-            if (e.o !== null) e.o.Ee = null;
-            e.Ie = false;
+            _ = e.oe(_);
+            if (e.o !== null) e.o.Ie = null;
+            e.Ne = false;
         } else {
             // Snapshot `_inFlight` so we can detect whether `_fn` self-registered an async
             // subscription (e.g. `createProjection` calls `handleAsync` from inside its body
             // with a setter callback). In that case, the outer `handleAsync` call below would
             // clobber the fresh subscription, so we skip it and let the internally-registered
             // iteration drive updates.
-            const t = e.o?.Ee;
-            const n = e.Se(c);
+            const t = e.o?.Ie;
+            const n = e.oe(_);
             const i = typeof n === "object" && n !== null;
-            const u = e.o?.Ee !== t;
-            c = u || !i ? n : handleAsync(e, n);
+            const u = e.o?.Ie !== t;
+            _ = u || !i ? n : handleAsync(e, n);
             if (!u && !i) {
-                if (e.o !== null) e.o.Ee = null;
+                if (e.o !== null) e.o.Ie = 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.Ie = false;
+                                e.Ne = false;
             }
         }
         // On a status-free node clearStatus is a guaranteed no-op: every field
@@ -214,10 +229,10 @@ function recompute(e, t = false) {
                 if (e.S !== 0 || e.o !== null) clearStatus(e, t);
         // _optimisticLane is only ever assigned by engine paths (CONFIG_HAS_LANE
         // is their sticky presence mark).
-                if (e.T & CONFIG_HAS_LANE && e.o?.Be) GlobalQueue.ze(e);
+                if (e.T & CONFIG_HAS_LANE && e.o?.Je) GlobalQueue.Xe(e);
     } catch (t) {
         const n = t instanceof NotReadyError;
-        if (n && e.Ie) {
+        if (n && e.Ne) {
             // 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
@@ -232,31 +247,31 @@ function recompute(e, t = false) {
             if (n && currentOptimisticLane) GlobalQueue.$e(e);
             let i = false;
             if (n) {
-                ext(e).ue = true;
-                if (GlobalQueue.Je !== null) i = GlobalQueue.Je(e, s);
+                ext(e).fe = true;
+                if (GlobalQueue.et !== null) i = GlobalQueue.et(e, a);
             }
-            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.o?.Be : undefined);
-            if (i) GlobalQueue.p(e);
+            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.o?.Je : undefined);
+            if (i) GlobalQueue.k(e);
         }
     } finally {
         tracking = E;
-        latestReadActive = N;
-        if (T) stale = d;
+        latestReadActive = T;
+        if (S) stale = d;
         // 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.
-                f = (e.ie & REACTIVE_MISSED_WAKE) !== 0;
+                I = (e.ie & REACTIVE_MISSED_WAKE) !== 0;
         e.ie = REACTIVE_NONE | (t ? e.ie & REACTIVE_SNAPSHOT_STALE : 0);
-        context = r;
+        context = c;
     }
     if (!e.o?._) {
         trimStaleDeps(e);
-        const s = u ? unwrapOverride(e.o?.De) : e.Pe === NOT_PENDING ? e.be : e.Pe;
-        let r = false;
+        const a = u ? unwrapOverride(e.o?.Oe) : e.Pe === NOT_PENDING ? e.be : e.Pe;
+        let c = false;
         try {
-            r = !n && l || !e.Ue || !e.Ue(s, c);
+            c = !n && l || !e.ge || !e.ge(a, _);
         } 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
@@ -269,55 +284,65 @@ function recompute(e, t = false) {
         // its runner — happen here instead. `!create` matches the previous `initialized`
         // gate: the explicit recompute(node, true) inside effect() does not enqueue, so
         // effect() can call its runner synchronously for the first run.
-                if (n && r) {
-            e.Xe = !e.o?._;
+                if (n && c) {
+            e.tt = !e.o?._;
             // Reuse one bound runner per effect — runEffect no-ops on a stale
             // `_modified`, so re-enqueueing the same function is harmless.
-                        if (!t) e.C.enqueue(n, e.et ??= GlobalQueue.tt.bind(null, e));
+                        if (!t) e.C.enqueue(n, e.nt ??= GlobalQueue.it.bind(null, e));
         }
-        if (e.o?._) ; else if (r) {
-            const l = u ? e.o?.De : undefined;
+        if (e.o?._) ; else if (c) {
+            const l = u ? e.o?.Oe : undefined;
             if (t || 
             // 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.
-            n && (activeTransition !== e._e || activeTransition === null) || i) {
-                e.be = c;
+            // 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.
+            n && (activeTransition !== e.Ae || activeTransition === null || e.T & CONFIG_DIRECT_COMMIT) || i) {
+                e.be = _;
                 // Lane-propagated correction: upstream data is fresh, correct the
                 // override unconditionally. The direct _value commit is the lane's
                 // own reveal schedule; drop any superseded older hold so its queued
                 // commit can't clobber the fresh value.
                                 if (u && i) {
-                    ext(e).De = c === undefined ? OVERRIDE_UNDEFINED : c;
+                    ext(e).Oe = _ === undefined ? OVERRIDE_UNDEFINED : _;
                     e.Pe = NOT_PENDING;
                 }
             } else {
-                e.Pe = c;
+                e.Pe = _;
                 // 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 (a) e.Ie = true;
+                                if (r) e.Ne = true;
                 // Transition-held sync recompute is a write path like setSignal/asyncWrite,
                 // so sync derivations of held sources stay visible to isPending()/latest()
                 // (#2831). Both companion writes are transition-scoped (optimistic) and
                 // auto-revert/re-derive at commit. Skipped for plain flushes where the
                 // pending value commits before effects run.
-                                if ((activeTransition || e._e) && GlobalQueue.Oe !== null) GlobalQueue.Oe(e, c);
+                                if ((activeTransition || e.Ae) && GlobalQueue.Re !== null) GlobalQueue.Re(e, _);
             }
             // insertSubs only walks _subs (no scheduling of its own), so a
             // subscriber-less node has nothing to notify.
-                        if (e.u !== null && (!u || i || e.o?.De !== l)) insertSubs(e, i || u);
+                        if (e.u !== null && (!u || i || e.o?.Oe !== l)) insertSubs(e, i || u);
         } else if (u) {
             // 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.Pe === NOT_PENDING) queuePendingNode(e);
-            e.Pe = c;
-            if (a) e.Ie = true;
+            e.Pe = _;
+            if (r) e.Ne = true;
  // see the held branch above (#2990)
-                } else if (e.Le != _) {
-            for (let t = e.u; t !== null; t = t.fe) {
-                insertIntoHeapHeight(t.ae, queueFor(t.ae));
+            // A authoritative-view reader (until()) observed this node past its
+            // override — and "authoritative arrival equal to the override" is
+            // exactly the acknowledgment it waits for. Wake those readers only;
+            // A17 silence holds for every ordinary subscriber. (Hook installed by
+            // until(), the only setter of the gating bit.)
+                        if (e.T & CONFIG_AUTHORITATIVE_OBSERVED) GlobalQueue.Ue(e);
+        } else if (e.Me != f) {
+            for (let t = e.u; t !== null; t = t.ae) {
+                insertIntoHeapHeight(t.ce, queueFor(t.ce));
             }
         }
         // Silent recovery: errored → unchanged value fires no notification, but
@@ -325,23 +350,34 @@ function recompute(e, t = false) {
         // in an errored run and may sit on stale commits (#2949). Changed-value
         // recoveries ride insertSubs above; a comparator throw re-errored the node
         // (el._x?._error re-set), so this only runs on a genuinely clean recovery.
-                if (o !== undefined && !r && !e.o?._) settleErroredDependents(e, o);
+                if (o !== undefined && !c && !e.o?._) settleErroredDependents(e, o);
+        // Pending twin of the sweep above (#3181): a flight superseded by this
+        // synchronous settle leaves every registered dependent still flagged
+        // STATUS_PENDING with a pending source that will never land — asyncWrite
+        // owns the walk only for flights that actually land. An unchanged value
+        // is the dangerous shape (a projection reconciling in place: a memo over
+        // it re-throws its cached NotReadyError forever, and every reader that
+        // suspended through that memo re-parks on the dead source), but the walk
+        // runs on the changed shape too, exactly as the landing path does —
+        // insertSubs notifies value SUBSCRIBERS, not pending REGISTRANTS, and
+        // the two sets only partially overlap.
+                if (s && !(e.S & STATUS_PENDING)) settlePendingSource(e);
     }
-    currentOptimisticLane = I;
-    const S = e.Pe !== NOT_PENDING || e.o !== null && (e.o.qe !== null || e.o.We !== null) || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
+    currentOptimisticLane = N;
+    const A = e.Pe !== NOT_PENDING || e.o !== null && (e.o.Ye !== null || e.o.qe !== null) || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
     // Override-covered holds (hasOverride) always queue: their commit belongs
     // to their own transition's schedule (A18 re-rule) and is unobservable
     // under the override (A17). Revert no longer commits anything, so an
     // unqueued covered hold would leak (INV-7) once the revert clears
     // _transition.
-        S && (!t || e.S & STATUS_PENDING) && (!e._e || u) && queuePendingNode(e);
-    e._e && n && activeTransition !== e._e && runInTransition(e._e, () => recompute(e));
+        A && (!t || e.S & STATUS_PENDING) && (!e.Ae || u) && queuePendingNode(e);
+    e.Ae && n && activeTransition !== e.Ae && runInTransition(e.Ae, () => recompute(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 (f) {
+        if (I) {
         enqueueSub(e);
         schedule();
     }
@@ -352,12 +388,14 @@ function updateIfNecessary(e) {
     // (_depsTail/_depGen) is live, and a nested recompute would corrupt it.
     // A mid-pass mark stays latched for recompute's own tail to reschedule
     // (#3037); readers meanwhile serve the values the pass has so far.
-    if (e.ie & REACTIVE_RECOMPUTING_DEPS) return;
+    // Never recompute a DISPOSED node either: recompute rewrites _flags and
+    // would resurrect it (#2983) — readers serve its last value.
+    if (e.ie & (REACTIVE_RECOMPUTING_DEPS | REACTIVE_DISPOSED)) return;
     if (e.ie & REACTIVE_CHECK) {
-        for (let t = e.nt; t; t = t.it) {
-            const n = t.ut;
-            const i = n.lt || n;
-            if (i.Se) {
+        for (let t = e.ut; t; t = t.lt) {
+            const n = t.ot;
+            const i = n.st || n;
+            if (i.oe) {
                 updateIfNecessary(i);
             }
             if (e.ie & REACTIVE_DIRTY) {
@@ -365,7 +403,7 @@ function updateIfNecessary(e) {
             }
         }
     }
-    if (e.ie & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.o?._ && e.Te < clock && !e.o?.Ee) {
+    if (e.ie & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.o?._ && e.Te < clock && !e.o?.Ie) {
         recompute(e);
     }
     e.ie = e.ie & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
@@ -380,40 +418,40 @@ function computed(e, t) {
     const u = {
         id: inheritId(t, n, context),
         T: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.H ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        Ue: t?.equals != null ? t.equals : isEqual,
-        he: null,
+        ge: t?.equals ?? isEqual,
+        pe: null,
         C: context?.C ?? globalQueue,
         we: context?.we ?? defaultContext,
-        Me: 0,
-        Se: e,
-        be: i ? t.loadingValue : undefined,
-        Le: 0,
-        ot: undefined,
-        st: null,
-        nt: null,
-        Ye: null,
         Ze: 0,
-        u: null,
-        rt: null,
-        ve: context,
-        Ve: null,
+        oe: e,
+        be: i ? t.loadingValue : undefined,
+        Me: 0,
+        rt: undefined,
         ct: null,
-        ke: null,
+        ut: null,
+        je: null,
+        Ke: 0,
+        u: null,
+        _t: null,
+        ke: context,
+        Le: null,
+        ft: null,
+        xe: null,
         ie: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
         // A loadingValue node is born committed: commit #0 is already in _value.
         S: i ? 0 : STATUS_UNINITIALIZED,
         Te: clock,
         Pe: NOT_PENDING,
-        _e: null,
-        _t: -1,
-        Ie: i,
+        Ae: null,
+        It: -1,
+        Ne: i,
         // Cold machinery (async/transition/optimistic/verdict slots) lives one
         // hop away in the lazily-allocated extension — the core literal MUST
         // stay under V8's in-object boundary (§12: past ~39 fields every
         // allocation spills to a backing store and creation cost ~4x's).
         o: null
     };
-    if (t?.unobserved) ext(u).ft = t.unobserved;
+    if (t?.unobserved) ext(u).Et = t.unobserved;
     setupComputedNode(u, t);
     return u;
 }
@@ -423,25 +461,26 @@ function computed(e, t) {
  * this; hot paths read `el._x?._field` gated by the _config presence bits.
  * Never call ext() just to store a field's default. */ function ext(e) {
     return e.o ??= {
-        De: undefined,
-        Et: undefined,
-        Be: undefined,
-        Ge: undefined,
-        ge: undefined,
-        It: undefined,
+        Oe: undefined,
+        Nt: undefined,
+        Je: undefined,
+        ye: undefined,
+        Ce: undefined,
+        Tt: undefined,
         t: 0,
+        Ie: null,
         Ee: null,
         _: undefined,
-        ue: undefined,
+        fe: undefined,
         le: undefined,
-        A: undefined,
-        pe: false,
-        l: null,
-        ft: undefined,
-        Qe: undefined,
-        We: null,
+        h: undefined,
+        Ge: false,
+        i: null,
+        Et: undefined,
+        We: undefined,
         qe: null,
-        Nt: undefined
+        Ye: null,
+        St: undefined
     };
 }
 
@@ -450,50 +489,74 @@ function computed(e, t) {
  * so V8 sees the full hidden class shape at construction time. Effects always run in lazy
  * mode (recompute is called explicitly by `effect()`), so we hardcode the lazy bits and skip
  * the auto-dispose CONFIG bit (effect() previously cleared it post-construction).
- */ function createEffectNode(e, t, n, i, u, l) {
-    const o = l?.transparent ?? false;
-    const s = {
-        id: inheritId(l, o, context),
-        T: (o ? CONFIG_TRANSPARENT : 0) | (l?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (l?.sync ? CONFIG_SYNC : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        Ue: false,
-        he: null,
+ */ function createEffectNode(e, t, n, i, u) {
+    const l = u?.transparent ?? false;
+    const o = {
+        id: inheritId(u, l, context),
+        T: (l ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (u?.dt ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        ge: false,
+        pe: null,
         C: context?.C ?? globalQueue,
         we: context?.we ?? defaultContext,
-        Me: 0,
-        Se: e,
-        be: undefined,
-        Le: 0,
-        ot: undefined,
-        st: null,
-        nt: null,
-        Ye: null,
         Ze: 0,
-        u: null,
-        rt: null,
-        ve: context,
-        Ve: null,
+        oe: e,
+        be: undefined,
+        Me: 0,
+        rt: undefined,
         ct: null,
-        ke: null,
+        ut: null,
+        je: null,
+        Ke: 0,
+        u: null,
+        _t: null,
+        ke: context,
+        Le: null,
+        ft: null,
+        xe: null,
         ie: REACTIVE_LAZY,
         S: STATUS_UNINITIALIZED,
         Te: clock,
         Pe: NOT_PENDING,
-        _e: null,
-        _t: -1,
-        Ie: false,
-        Xe: false,
-        Tt: undefined,
-        dt: t,
-        St: n,
+        Ae: null,
+        It: -1,
+        Ne: false,
+        tt: false,
         At: undefined,
-        Re: i,
+        Ot: t,
+        Ct: n,
+        Rt: undefined,
+        he: i,
         o: null
     };
-    // Boundary effects carry a status channel; most effects never touch _x.
-        if (u !== undefined) ext(s).A = u;
-    if (l?.unobserved) ext(s).ft = l.unobserved;
-    setupComputedNode(s, lazyOptions);
-    return s;
+    // 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(o).Et = u.unobserved;
+    setupComputedNode(o, lazyOptions);
+    return o;
+}
+
+/**
+ * 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.
+ */ 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 t = e.o?.h;
+    if (t !== undefined) return t;
+    return e.he ? effectStatusNotify ?? undefined : undefined;
 }
 
 const lazyOptions = {
@@ -501,24 +564,24 @@ const lazyOptions = {
 };
 
 function setupComputedNode(e, t) {
-    e.st = e;
-    const n = context?.Ct ? context.Ot : context;
+    e.ct = e;
+    const n = context?.Gt ? context.Dt : context;
     if (context) {
-        const t = context.ke;
+        const t = context.xe;
         if (t === null) {
-            context.ke = e;
+            context.xe = e;
         } else {
-            e.Ve = t;
-            t.ct = e;
-            context.ke = e;
+            e.Le = t;
+            t.ft = e;
+            context.xe = e;
         }
     }
-    if (n) e.Le = n.Le + 1;
-    if (GlobalQueue.Rt !== null) GlobalQueue.Rt(e);
+    if (n) e.Me = n.Me + 1;
+    if (GlobalQueue.Pt !== null) GlobalQueue.Pt(e);
     !t?.lazy && recompute(e, true);
     if (snapshotCaptureActive && !t?.lazy) {
         if (!(e.S & STATUS_PENDING) && !(e.T & CONFIG_NO_SNAPSHOT)) {
-            ext(e).Qe = e.be === undefined ? NO_SNAPSHOT : e.be;
+            ext(e).We = e.be === undefined ? NO_SNAPSHOT : e.be;
             e.T |= CONFIG_HAS_SNAPSHOT;
             snapshotSources.add(e);
         }
@@ -527,31 +590,31 @@ function setupComputedNode(e, t) {
 
 function signal(e, t, n = null) {
     const i = {
-        Ue: t?.equals != null ? t.equals : isEqual,
+        ge: t?.equals ?? isEqual,
         T: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.H ? CONFIG_NO_SNAPSHOT : 0),
         be: e,
         u: null,
-        rt: null,
+        _t: null,
         Te: clock,
-        lt: n,
-        ce: n?.o?.l || null,
+        st: n,
+        Se: n?.o?.i || null,
         Pe: 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).
-        _e: null,
-        _t: -1,
+        Ae: null,
+        It: -1,
         o: null
     };
-    if (t?.unobserved) ext(i).ft = t.unobserved;
+    if (t?.unobserved) ext(i).Et = t.unobserved;
     if (n) {
-        ext(n).l = i;
+        ext(n).i = i;
         n.T |= CONFIG_FW_CHILDREN;
     }
     if (snapshotCaptureActive && !(i.T & CONFIG_NO_SNAPSHOT) && !((n?.S ?? 0) & STATUS_PENDING)) {
-        ext(i).Qe = e === undefined ? NO_SNAPSHOT : e;
+        ext(i).We = e === undefined ? NO_SNAPSHOT : e;
         i.T |= CONFIG_HAS_SNAPSHOT;
         snapshotSources.add(i);
     }
@@ -560,14 +623,14 @@ function signal(e, t, n = null) {
 
 function optimisticSignal(e, t) {
     const n = signal(e, t);
-    ext(n).De = NOT_PENDING;
+    ext(n).Oe = NOT_PENDING;
     n.T |= CONFIG_OPTIMISTIC;
     return n;
 }
 
 function optimisticComputed(e, t) {
     const n = computed(e, t);
-    ext(n).De = NOT_PENDING;
+    ext(n).Oe = NOT_PENDING;
     n.T |= CONFIG_OPTIMISTIC;
     return n;
 }
@@ -598,11 +661,11 @@ function isEqual(e, t) {
  * );
  * ```
  */ function untrack(e, t) {
-    if (GlobalQueue.Gt === null && !tracking && true) return e();
+    if (GlobalQueue.ht === null && !tracking && true) return e();
     const n = tracking;
     tracking = false;
     try {
-        if (GlobalQueue.Gt !== null) return GlobalQueue.Gt(e);
+        if (GlobalQueue.ht !== null) return GlobalQueue.ht(e);
         return e();
     } finally {
         tracking = n;
@@ -643,10 +706,38 @@ function isEqual(e, t) {
  * 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().
- */ function readNodeFast(e) {
-    if (latestReadActive || pendingCheckActive || e.Se || e.lt || e.o?.De !== undefined || e.o?.Qe !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
+ */
+/**
+ * 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 t = e.u; t !== null; t = t.ae) {
+        const e = t.ce;
+        if (!(e.T & CONFIG_AUTHORITATIVE_READ)) continue;
+        // Missed-wake latch (#3037), same contract as insertSubs: the reader may
+        // itself have pulled this recompute (updateIfNecessary from its own
+        // read), and the heap refuses RECOMPUTING nodes — latch so recompute's
+        // tail reschedules it with the staged value visible.
+                if (e.ie & REACTIVE_RECOMPUTING_DEPS && t.Ft === e.Ke && t !== e.je) e.ie |= REACTIVE_MISSED_WAKE;
+        enqueueSub(e);
+    }
+    schedule();
+}
+
+/** Installs the until() machinery hook. Idempotent; called by until() before
+ * any authoritative-view read happens (same late-binding contract as the
+ * optimistic engine). */ function installAuthoritativeRead() {
+    if (GlobalQueue.Ue === null) GlobalQueue.Ue = notifyAuthoritativeObservers;
+}
+
+function readNodeFast(e) {
+    if (latestReadActive || pendingCheckActive || e.oe || e.st || e.o?.Oe !== undefined || e.o?.We !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
     let t = context;
-    if (t?.Ct) t = t.Ot;
+    if (t?.Gt) t = t.Dt;
     if (t && tracking) link(e, t);
     // Children-forbidden readers (createTrackedEffect / onSettled callbacks) get
     // committed visibility: like the effect half of createEffect and event
@@ -660,47 +751,54 @@ function read(e) {
     // Checked before isPending so that isPending(() => latest(x)) checks
     // the _pendingSignal of _latestValueComputed (async in flight) rather
     // than the original node (which stays "pending" while held in a transition).
-    if (latestReadActive) return GlobalQueue.Pt(e);
+    if (latestReadActive) return GlobalQueue.gt(e);
     let t = context;
-    if (t?.Ct) t = t.Ot;
+    if (t?.Gt) t = t.Dt;
     const n = e;
-    const i = e.lt;
+    const i = e.st;
     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.Dt(e, t, u, i);
-    } else if (typeof n.Se === "function") {
+        GlobalQueue.Ht(e, t, u, i);
+    } else if (typeof n.oe === "function") {
         prepareComputed(e, false);
     }
-    if (!n.Se && u === e && e.o?.De === undefined && e.o?.Qe === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
+    if (!n.oe && u === e && e.o?.Oe === undefined && e.o?.We === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
         if (t && tracking) link(e, t);
         // Committed visibility for children-forbidden readers — see readNodeFast.
                 return !t || e.Pe === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Pe;
     }
     if (t && tracking) {
         link(e, t, pendingCheckActive);
-        if (u.Se) {
+        if (u.oe) {
             const n = queueFor(e);
-            if (u.Le >= n.xe) {
+            if (u.Me >= n.Qe) {
                 markNode(t);
                 markHeap(n);
                 updateIfNecessary(u);
             }
-            const i = u.Le;
+            // 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.T & CONFIG_FRESH_READ) updateIfNecessary(u);
+            const i = u.Me;
             // parent check is shallow, might need to be recursive
-                        if (i >= t.Le && e.ve !== t) {
-                t.Le = i + 1;
+                        if (i >= t.Me && e.ke !== t) {
+                t.Me = i + 1;
             }
         }
     }
     if (u.S & STATUS_PENDING) {
-        if (t && !(stale && u._e && activeTransition !== u._e)) {
+        if (t && !(stale && u.Ae && activeTransition !== u.Ae)) {
             // 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.
-            if (currentOptimisticLane === null || GlobalQueue.ht(u)) {
+            if (currentOptimisticLane === null || GlobalQueue.Vt(u)) {
                 if (!tracking && e !== t) link(e, t);
                 throw u.o?._;
             }
@@ -725,7 +823,7 @@ function read(e) {
     // 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.Se && u.S & STATUS_ERROR) {
+        if (u.oe && u.S & STATUS_ERROR) {
         // Only a genuine reactive re-read may retry an errored async source:
         // - tracking: owned/tracked scope only (never events / `untrack` / effect side-effect phase)
         // - !pendingCheckActive: an `isPending` probe observes the error, never refetches
@@ -736,7 +834,7 @@ function read(e) {
         } else throw u.o?._;
     }
     if (snapshotCaptureActive && t && t.T & CONFIG_IN_SNAPSHOT_SCOPE) {
-        const n = e.o?.Qe;
+        const n = e.o?.We;
         if (n !== undefined) {
             const i = n === NO_SNAPSHOT ? undefined : n;
             const u = e.Pe !== NOT_PENDING ? e.Pe : e.be;
@@ -744,9 +842,19 @@ function read(e) {
             return i;
         }
     }
-    if (e.o?.De !== undefined && e.o?.De !== NOT_PENDING) {
-        // A17: the override IS the value for every reader.
-        return unwrapOverride(e.o?.De);
+    if (e.o?.Oe !== undefined && e.o?.Oe !== NOT_PENDING) {
+        // 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.
+        if (!(t && t.T & CONFIG_AUTHORITATIVE_READ)) return unwrapOverride(e.o?.Oe);
+        e.T |= 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
@@ -755,7 +863,7 @@ function read(e) {
     // _pendingValue for correct fetching. The sub is recorded for replay at commit
     // so it re-runs with the new committed view. (Gate details live with the
     // engine — a non-null lane implies it is installed.)
-        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.Ft(e, u, t)) {
+        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.vt(e, u, t)) {
         return e.be;
     }
     // In optimistic lane context, return _value for optimistic/lane-assigned signals
@@ -764,29 +872,45 @@ function read(e) {
     // (The lane-context clause lives with the engine.) Children-forbidden readers
     // (createTrackedEffect / onSettled callbacks) get committed visibility — see
     // readNodeFast (#3006).
-        const l = !t || currentOptimisticLane !== null && GlobalQueue.gt(e, u, t) || e.Pe === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && e._e && activeTransition !== e._e ? e.be : e.Pe;
+        const l = !t || currentOptimisticLane !== null && GlobalQueue.bt(e, u, t) || e.Pe === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && e.Ae && activeTransition !== e.Ae || 
+    // A17 for HELD truth (#3164, see CONFIG_HELD_TRUTH): staged confirming
+    // truth — fold-staged onto an armed family, or entangle-stolen by an
+    // awaited until() — is masked from ordinary readers until its
+    // transaction's reveal; the retaining transaction's own speculative
+    // recomputes included (partial override coverage would otherwise
+    // compose override + staged truth into a state no timeline contains).
+    // Authoritative readers (until()'s predicate) and latest() see the
+    // staged truth — the tunnel that keeps the hold deadlock-free.
+    e.T & CONFIG_HELD_TRUTH && !latestReadActive && !(t.T & CONFIG_AUTHORITATIVE_READ) ? e.be : e.Pe;
     // 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.Ht(e, l);
-    if (!t && u === e && typeof n.Se === "function" && e.T & CONFIG_AUTO_DISPOSE && !(u.S & STATUS_PENDING) && !e.u) {
-        unobserved(e);
+        if (pendingCheckActive) GlobalQueue.kt(e, l);
+    if (!t && u === e && typeof n.oe === "function" && e.T & CONFIG_AUTO_DISPOSE && !(u.S & STATUS_PENDING) && !e.u) {
+        // Deferred, not inline (#3078): an inline unobserved() here made untracked
+        // reads destructive — dispose on this read, full revival recompute on the
+        // next — so consecutive reads could answer differently with no write in
+        // between (the revival samples the ambient transition/lane context).
+        // The sweep at flush finalization re-validates and reclaims; schedule()
+        // guarantees that flush happens even if nothing else is queued.
+        dormantNodes.add(e);
+        schedule();
     }
     return l;
 }
 
 function setSignal(e, t) {
-    if (e._e && activeTransition !== e._e) globalQueue.initTransition(e._e);
+    if (e.Ae && activeTransition !== e.Ae) globalQueue.initTransition(e.Ae);
     // The optimistic write path lives with the engine: only optimisticSignal /
     // optimisticComputed callers and optimistic store nodes carry an
     // _overrideValue slot (flagged by CONFIG_OPTIMISTIC — a masked read of the
     // always-present config instead of a missing-property probe), and every
     // module that installs one installs the engine first.
-        if (e.T & CONFIG_OPTIMISTIC && !projectionWriteActive) return GlobalQueue.vt(e, t);
+        if (e.T & CONFIG_OPTIMISTIC && !projectionWriteActive) return GlobalQueue.xt(e, t);
     const n = e.Pe === NOT_PENDING ? e.be : e.Pe;
     if (typeof t === "function") t = t(n);
     // Uninitialized check first: the first commit has no previous value, so the
     // user comparator must not run against `undefined` (matches recompute).
-        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.Ue || !e.Ue(n, t);
+        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.ge || !e.ge(n, t);
     if (!i) return t;
     const u = e.Pe !== NOT_PENDING;
     if (!u) queuePendingNode(e);
@@ -796,16 +920,16 @@ function setSignal(e, t) {
     // only ever created, never removed, and creating one installs the hook and
     // sets CONFIG_HAS_COMPANIONS — one masked read replaces two optional-field
     // probes on every write).
-        e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.Oe !== null && GlobalQueue.Oe(e, t);
+        e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.Re !== null && GlobalQueue.Re(e, t);
     // _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.Se !== undefined) e.Te = clock;
+        if (e.oe !== undefined) e.Te = 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._t === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return t;
+        if (u && e.It === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return t;
     insertSubs(e);
     schedule();
     return t;
@@ -824,7 +948,7 @@ function setSignal(e, t) {
         schedule();
     }
     e.ie = e.ie & -4 | REACTIVE_MANUAL_WRITE;
-    e.kt = clock;
+    e.Ut = clock;
 }
 
 /**
@@ -880,39 +1004,22 @@ function staleValues(e, t = true) {
 }
 
 /**
- * Invalidates one reactive source, forcing it to re-execute even if its inputs
- * haven't changed.
- *
- * Pass either a Solid-created accessor or a projected store created from
- * `createStore(fn, ...)` / `createProjection(...)`. `refresh()` is a
- * write-like invalidation operation: it does not read the target's value, and
- * refreshing a plain signal accessor is a no-op.
- *
- * Use it to invalidate cached async values (e.g. force a re-fetch) without
- * tearing the consumer down.
- *
- * @example
- * ```ts
- * const user = createMemo(async () => fetch(`/users/${id()}`).then(r => r.json()));
- *
- * // Re-fetch on demand
- * <button onClick={() => refresh(user)}>Reload</button>
- * ```
- */ function refresh(e) {
-    const t = e?.[$REFRESH];
-    if (!t) {
-        return;
-    }
-    if (typeof t.Se === "function" && !(t.ie & REACTIVE_DISPOSED)) {
-        if (t.ie & REACTIVE_MANUAL_WRITE) {
+ * Core marking half of `refresh()` (the public wrapper lives in signals.ts —
+ * 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.
+ */ function markRefresh(e) {
+    if (typeof e.oe === "function" && !(e.ie & REACTIVE_DISPOSED)) {
+        if (e.ie & 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 (t.kt === clock) return;
-            t.ie &= ~REACTIVE_MANUAL_WRITE;
+            if (e.Ut === clock) return;
+            e.ie &= ~REACTIVE_MANUAL_WRITE;
             // No REASK below: the batch carries a manual value change, so the
             // recompute is not a quiet re-ask of an unchanged question.
                 }
@@ -923,14 +1030,14 @@ function staleValues(e, t = true) {
         // REACTIVE_IN_HEAP counts as dirt: insertSubs schedules subscribers by
         // heap insertion alone (no DIRTY/CHECK flag), so a same-batch value
         // change followed by refresh() must not be laundered into a quiet re-ask.
-         else if (!(t.ie & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
-            t.ie |= REACTIVE_REASK;
+         else if (!(e.ie & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
+            e.ie |= REACTIVE_REASK;
             armReaskClear();
         }
-        t.ie = t.ie & ~REACTIVE_CHECK | REACTIVE_DIRTY;
-        insertIntoHeap(t, queueFor(t));
+        e.ie = e.ie & ~REACTIVE_CHECK | REACTIVE_DIRTY;
+        insertIntoHeap(e, queueFor(e));
         schedule();
     }
 }
 
-export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, ext, isEqual, latestReadActive, markSnapshotScope, optimisticComputed, optimisticSignal, pendingCheckActive, prepareComputed, read, readNodeFast, recompute, refresh, releaseSnapshotScope, runWithOwner, setContextInternal, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSnapshotCapture, signal, snapshotCaptureActive, snapshotSources, stale, staleValues, suppressComputedRecompute, tracking, untrack };
+export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, effectStatusNotify, ext, installAuthoritativeRead, isEqual, latestReadActive, markRefresh, markSnapshotScope, notifyAuthoritativeObservers, optimisticComputed, optimisticSignal, pendingCheckActive, prepareComputed, read, readNodeFast, recompute, releaseSnapshotScope, runWithOwner, setContextInternal, setEffectStatusNotify, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSnapshotCapture, signal, snapshotCaptureActive, snapshotSources, stale, staleValues, statusNotifierOf, suppressComputedRecompute, tracking, untrack };