@solidjs/signals 2.0.0-beta.25 → 2.0.0-beta.27

package/dist/prod/core/core.js

@@ -1,6 +1,6 @@
-import { handleAsync, clearStatus, notifyStatus } from "./async.js";
+import { handleAsync, clearStatus, notifyStatus, settleErroredDependents } from "./async.js";
 
-import { EFFECT_TRACKED, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, STATUS_UNINITIALIZED, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, STATUS_PENDING, STATUS_ERROR, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, OVERRIDE_UNDEFINED, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, 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, NO_SNAPSHOT, STORE_SNAPSHOT_PROPS, EFFECT_USER } from "./constants.js";
+import { EFFECT_TRACKED, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, STATUS_PENDING, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, OVERRIDE_UNDEFINED, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, 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, NO_SNAPSHOT, STORE_SNAPSHOT_PROPS, EFFECT_USER } from "./constants.js";
 
 import { NotReadyError } from "./error.js";
 
@@ -14,9 +14,9 @@ import "./invariants.js";
 
 import { disposeChildren, markDisposal, inheritId } from "./owner.js";
 
-GlobalQueue.pe = recompute;
+GlobalQueue.Ce = recompute;
 
-GlobalQueue.Ce = disposeChildren;
+GlobalQueue.me = disposeChildren;
 
 let tracking = false;
 
@@ -48,8 +48,8 @@ let snapshotSources = null;
 
 function ownerInSnapshotScope(e) {
     while (e) {
-        if (e.Oe) return true;
-        e = e.Ge;
+        if (e.ge) return true;
+        e = e.ve;
     }
     return false;
 }
@@ -60,41 +60,41 @@ function setSnapshotCapture(e) {
 }
 
 function markSnapshotScope(e) {
-    e.Oe = true;
+    e.ge = true;
 }
 
 function releaseSnapshotScope(e) {
-    e.Oe = false;
+    e.ge = false;
     releaseSubtree(e);
     schedule();
 }
 
 function releaseSubtree(e) {
-    let t = e.me;
+    let t = e.ke;
     while (t) {
-        if (t.Oe) {
-            t = t.ve;
+        if (t.ge) {
+            t = t.Fe;
             continue;
         }
-        if (t.ke) {
+        if (t.ae) {
             const e = t;
             e.T &= ~CONFIG_IN_SNAPSHOT_SCOPE;
             if (e.se & REACTIVE_SNAPSHOT_STALE) {
                 e.se &= ~REACTIVE_SNAPSHOT_STALE;
                 e.se |= REACTIVE_DIRTY;
-                if (dirtyQueue.Fe > e.He) dirtyQueue.Fe = e.He;
+                if (dirtyQueue.He > e.Ve) dirtyQueue.He = e.Ve;
                 insertIntoHeap(e, dirtyQueue);
             }
         }
         releaseSubtree(t);
-        t = t.ve;
+        t = t.Fe;
     }
 }
 
 function clearSnapshots() {
     if (snapshotSources) {
         for (const e of snapshotSources) {
-            delete e.Ve;
+            delete e.xe;
             // 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.
@@ -106,37 +106,41 @@ function clearSnapshots() {
 }
 
 function recompute(e, t = false) {
-    const n = e.Ae;
+    const n = e.Pe;
     if (!t) {
-        if (e.Ue && (!n || activeTransition) && activeTransition !== e.Ue) globalQueue.initTransition(e.Ue);
+        if (e.Ie && (!n || activeTransition) && activeTransition !== e.Ie) globalQueue.initTransition(e.Ie);
         deleteFromHeap(e, queueFor(e));
         e.Te = null;
         // Tracked effects run after finalizePureQueue, so dispose immediately instead of deferring
-                if (e.Ue || n === EFFECT_TRACKED) disposeChildren(e); else if (e.me !== null || e.xe !== null) {
+                if (e.Ie || n === EFFECT_TRACKED) disposeChildren(e); else if (e.ke !== null || e.Le !== null) {
             markDisposal(e);
-            e.Le = e.xe;
-            e.ye = e.me;
-            e.xe = null;
-            e.me = null;
-            e.Qe = 0;
+            e.ye = e.Le;
+            e.Qe = e.ke;
+            e.Le = null;
+            e.ke = null;
+            e.qe = 0;
         } else ;
     }
     let i = !!(e.se & REACTIVE_OPTIMISTIC_DIRTY);
-    const u = e.Ee !== undefined && e.Ee !== NOT_PENDING;
+    const u = e.Ae !== undefined && e.Ae !== NOT_PENDING;
     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._ : undefined;
     // Re-ask classification lives in the verdict module; capture the flag before
     // the recompute wipes _flags below.
-        const o = (e.se & REACTIVE_REASK) !== 0;
-    const s = context;
+        const s = (e.se & REACTIVE_REASK) !== 0;
+    const a = context;
     context = e;
-    e.qe = null;
-    e.We++;
+    e.We = null;
+    e.Ye++;
     e.se = REACTIVE_RECOMPUTING_DEPS;
-    e.ce = clock;
-    let a = e.Ne === NOT_PENDING ? e.Pe : e.Ne;
-    let r = e.He;
-    let c = tracking;
-    let _ = currentOptimisticLane;
+    e.Se = clock;
+    let r = e.De === NOT_PENDING ? e.Ue : e.De;
+    let c = e.Ve;
+    let _ = tracking;
+    let f = 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
@@ -144,30 +148,30 @@ 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 f = latestReadActive;
+        const E = 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.Ye(e, true);
+        const t = GlobalQueue.Ze(e, true);
         if (t) currentOptimisticLane = t;
-    } else if (activeTransition && !t && activeTransition.Ze.length) {
+    } else if (activeTransition && !t && activeTransition.je.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.Ye(e, false);
+        const t = GlobalQueue.Ze(e, false);
         if (t) {
             i = true;
             currentOptimisticLane = t;
         }
     }
-    const E = n && n !== EFFECT_USER;
-    const N = stale;
-    if (E) stale = true;
+    const N = n && n !== EFFECT_USER;
+    const T = stale;
+    if (N) stale = true;
     try {
         if (!false && e.T & CONFIG_SYNC) {
-            a = e.ke(a);
+            r = e.ae(r);
             e.Te = null;
         } else {
             // Snapshot `_inFlight` so we can detect whether `_fn` self-registered an async
@@ -176,42 +180,42 @@ function recompute(e, t = false) {
             // clobber the fresh subscription, so we skip it and let the internally-registered
             // iteration drive updates.
             const t = e.Te;
-            const n = e.ke(a);
+            const n = e.ae(r);
             const i = typeof n === "object" && n !== null;
             const u = e.Te !== t;
-            a = u || !i ? n : handleAsync(e, n);
+            r = u || !i ? n : handleAsync(e, n);
             if (!u && !i) e.Te = null;
         }
         // On a status-free node clearStatus is a guaranteed no-op: every branch
         // in its body is gated on one of these fields, and with _statusFlags === 0
         // the flags write (create or not) stores the 0 already there.
-                if (e.S !== 0 || e.i !== undefined || e._ || e._e || e.Se || e.oe !== undefined || e.be !== undefined || e.ge !== undefined || e.u !== null) clearStatus(e, t);
+                if (e.S !== 0 || e.i !== undefined || e._ || e.Re || e.de || e.oe !== undefined || e.he !== undefined || e.pe !== undefined || e.u !== null) clearStatus(e, t);
         // _optimisticLane is only ever assigned by engine paths.
-                if (e.je) GlobalQueue.Me(e);
+                if (e.Me) GlobalQueue.Ke(e);
     } catch (t) {
         // Track pending async in the lane (not the lane's source — it creates the lane
         // but doesn't belong to it). Set lane BEFORE notifyStatus for downstream propagation.
-        if (t instanceof NotReadyError && currentOptimisticLane) GlobalQueue.Ke(e);
+        if (t instanceof NotReadyError && currentOptimisticLane) GlobalQueue.ze(e);
         let n = false;
         if (t instanceof NotReadyError) {
-            e.Se = true;
-            if (GlobalQueue.ze !== null) n = GlobalQueue.ze(e, o);
+            e.de = true;
+            if (GlobalQueue.$e !== null) n = GlobalQueue.$e(e, s);
         }
-        notifyStatus(e, t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, t, undefined, t instanceof NotReadyError ? e.je : undefined);
+        notifyStatus(e, t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, t, undefined, t instanceof NotReadyError ? e.Me : undefined);
         if (n) GlobalQueue.k(e);
     } finally {
-        tracking = c;
-        latestReadActive = f;
-        if (E) stale = N;
+        tracking = _;
+        latestReadActive = E;
+        if (N) stale = T;
         e.se = REACTIVE_NONE | (t ? e.se & REACTIVE_SNAPSHOT_STALE : 0);
-        context = s;
+        context = a;
     }
     if (!e._) {
         trimStaleDeps(e);
-        const o = u ? unwrapOverride(e.Ee) : e.Ne === NOT_PENDING ? e.Pe : e.Ne;
-        let s = false;
+        const s = u ? unwrapOverride(e.Ae) : e.De === NOT_PENDING ? e.Ue : e.De;
+        let a = false;
         try {
-            s = !n && l || !e.Re || !e.Re(o, a);
+            a = !n && l || !e.be || !e.be(s, r);
         } 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
@@ -224,70 +228,76 @@ 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 && s) {
-            e.$e = !e._;
+                if (n && a) {
+            e.Be = !e._;
             // 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.Be ??= GlobalQueue.Je.bind(null, e));
+                        if (!t) e.C.enqueue(n, e.Je ??= GlobalQueue.Xe.bind(null, e));
         }
-        if (e._) ; else if (s) {
-            const l = u ? e.Ee : undefined;
+        if (e._) ; else if (a) {
+            const l = u ? e.Ae : 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.Ue || activeTransition === null) || i) {
-                e.Pe = a;
+            n && (activeTransition !== e.Ie || activeTransition === null) || i) {
+                e.Ue = r;
                 // 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) {
-                    e.Ee = a === undefined ? OVERRIDE_UNDEFINED : a;
-                    e.Ne = NOT_PENDING;
+                    e.Ae = r === undefined ? OVERRIDE_UNDEFINED : r;
+                    e.De = NOT_PENDING;
                 }
             } else {
-                e.Ne = a;
+                e.De = r;
                 // 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.Ue) && GlobalQueue.Ie !== null) GlobalQueue.Ie(e, a);
+                                if ((activeTransition || e.Ie) && GlobalQueue._e !== null) GlobalQueue._e(e, r);
             }
             // insertSubs only walks _subs (no scheduling of its own), so a
             // subscriber-less node has nothing to notify.
-                        if (e.o !== null && (!u || i || e.Ee !== l)) insertSubs(e, i || u);
+                        if (e.o !== null && (!u || i || e.Ae !== 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.Ne === NOT_PENDING) queuePendingNode(e);
-            e.Ne = a;
-        } else if (e.He != r) {
+            if (e.De === NOT_PENDING) queuePendingNode(e);
+            e.De = r;
+        } else if (e.Ve != c) {
             for (let t = e.o; t !== null; t = t.ue) {
                 insertIntoHeapHeight(t.le, queueFor(t.le));
             }
         }
+        // Silent recovery: errored → unchanged value fires no notification, but
+        // dependents still holding the propagated error consumed their dirty flag
+        // in an errored run and may sit on stale commits (#2949). Changed-value
+        // recoveries ride insertSubs above; a comparator throw re-errored the node
+        // (el._error re-set), so this only runs on a genuinely clean recovery.
+                if (o !== undefined && !a && !e._) settleErroredDependents(e, o);
     }
-    currentOptimisticLane = _;
-    const T = e.Ne !== NOT_PENDING || e.ye !== null || e.Le !== null || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
+    currentOptimisticLane = f;
+    const d = e.De !== NOT_PENDING || e.Qe !== null || e.ye !== 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.
-        T && (!t || e.S & STATUS_PENDING) && (!e.Ue || u) && queuePendingNode(e);
-    e.Ue && n && activeTransition !== e.Ue && runInTransition(e.Ue, () => recompute(e));
+        d && (!t || e.S & STATUS_PENDING) && (!e.Ie || u) && queuePendingNode(e);
+    e.Ie && n && activeTransition !== e.Ie && runInTransition(e.Ie, () => recompute(e));
 }
 
 function updateIfNecessary(e) {
     if (e.se & REACTIVE_CHECK) {
-        for (let t = e.Xe; t; t = t.et) {
-            const n = t.tt;
-            const i = n.nt || n;
-            if (i.ke) {
+        for (let t = e.et; t; t = t.tt) {
+            const n = t.nt;
+            const i = n.it || n;
+            if (i.ae) {
                 updateIfNecessary(i);
             }
             if (e.se & REACTIVE_DIRTY) {
@@ -295,7 +305,7 @@ function updateIfNecessary(e) {
             }
         }
     }
-    if (e.se & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e._ && e.ce < clock && !e.Te) {
+    if (e.se & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e._ && e.Se < clock && !e.Te) {
         recompute(e);
     }
     e.se = e.se & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
@@ -306,36 +316,36 @@ function computed(e, t) {
     const i = {
         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?.V ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        Re: t?.equals != null ? t.equals : isEqual,
-        it: t?.unobserved,
-        xe: null,
+        be: t?.equals != null ? t.equals : isEqual,
+        ut: t?.unobserved,
+        Le: null,
         C: context?.C ?? globalQueue,
         we: context?.we ?? defaultContext,
-        Qe: 0,
-        ke: e,
-        Pe: undefined,
-        He: 0,
+        qe: 0,
+        ae: e,
+        Ue: undefined,
+        Ve: 0,
         u: null,
-        ut: undefined,
-        lt: null,
-        Xe: null,
-        qe: null,
-        We: 0,
-        o: null,
+        lt: undefined,
         ot: null,
-        Ge: context,
-        ve: null,
+        et: null,
+        We: null,
+        Ye: 0,
+        o: null,
         st: null,
-        me: null,
+        ve: context,
+        Fe: null,
+        rt: null,
+        ke: null,
         se: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
         S: STATUS_UNINITIALIZED,
-        ce: clock,
-        Ne: NOT_PENDING,
-        Le: null,
+        Se: clock,
+        De: NOT_PENDING,
         ye: null,
+        Qe: null,
         Te: null,
-        Ue: null,
-        _e: false
+        Ie: null,
+        Re: false
     };
     setupComputedNode(i, t);
     return i;
@@ -351,42 +361,42 @@ function computed(e, t) {
     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),
-        Re: false,
-        it: l?.unobserved,
-        xe: null,
+        be: false,
+        ut: l?.unobserved,
+        Le: null,
         C: context?.C ?? globalQueue,
         we: context?.we ?? defaultContext,
-        Qe: 0,
-        ke: e,
-        Pe: undefined,
-        He: 0,
+        qe: 0,
+        ae: e,
+        Ue: undefined,
+        Ve: 0,
         u: null,
-        ut: undefined,
-        lt: null,
-        Xe: null,
-        qe: null,
-        We: 0,
-        o: null,
+        lt: undefined,
         ot: null,
-        Ge: context,
-        ve: null,
+        et: null,
+        We: null,
+        Ye: 0,
+        o: null,
         st: null,
-        me: null,
+        ve: context,
+        Fe: null,
+        rt: null,
+        ke: null,
         se: REACTIVE_LAZY,
         S: STATUS_UNINITIALIZED,
-        ce: clock,
-        Ne: NOT_PENDING,
-        Le: null,
+        Se: clock,
+        De: NOT_PENDING,
         ye: null,
+        Qe: null,
         Te: null,
-        Ue: null,
-        _e: false,
-        $e: false,
-        rt: undefined,
-        ct: t,
-        _t: n,
-        ft: undefined,
-        Ae: i,
+        Ie: null,
+        Re: false,
+        Be: false,
+        ct: undefined,
+        _t: t,
+        ft: n,
+        Et: undefined,
+        Pe: i,
         i: u
     };
     setupComputedNode(s, lazyOptions);
@@ -398,24 +408,24 @@ const lazyOptions = {
 };
 
 function setupComputedNode(e, t) {
-    e.lt = e;
-    const n = context?.Et ? context.Nt : context;
+    e.ot = e;
+    const n = context?.Nt ? context.Tt : context;
     if (context) {
-        const t = context.me;
+        const t = context.ke;
         if (t === null) {
-            context.me = e;
+            context.ke = e;
         } else {
-            e.ve = t;
-            t.st = e;
-            context.me = e;
+            e.Fe = t;
+            t.rt = e;
+            context.ke = e;
         }
     }
-    if (n) e.He = n.He + 1;
-    if (GlobalQueue.Tt !== null) GlobalQueue.Tt(e);
+    if (n) e.Ve = n.Ve + 1;
+    if (GlobalQueue.dt !== null) GlobalQueue.dt(e);
     !t?.lazy && recompute(e, true);
     if (snapshotCaptureActive && !t?.lazy) {
         if (!(e.S & STATUS_PENDING) && !(e.T & CONFIG_NO_SNAPSHOT)) {
-            e.Ve = e.Pe === undefined ? NO_SNAPSHOT : e.Pe;
+            e.xe = e.Ue === undefined ? NO_SNAPSHOT : e.Ue;
             snapshotSources.add(e);
         }
     }
@@ -423,20 +433,20 @@ function setupComputedNode(e, t) {
 
 function signal(e, t, n = null) {
     const i = {
-        Re: t?.equals != null ? t.equals : isEqual,
+        be: t?.equals != null ? t.equals : isEqual,
         T: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.V ? CONFIG_NO_SNAPSHOT : 0),
-        it: t?.unobserved,
-        Pe: e,
+        ut: t?.unobserved,
+        Ue: e,
         o: null,
-        ot: null,
-        ce: clock,
-        nt: n,
+        st: null,
+        Se: clock,
+        it: n,
         fe: n?.u || null,
-        Ne: NOT_PENDING
+        De: NOT_PENDING
     };
     n && (n.u = i);
     if (snapshotCaptureActive && !(i.T & CONFIG_NO_SNAPSHOT) && !((n?.S ?? 0) & STATUS_PENDING)) {
-        i.Ve = e === undefined ? NO_SNAPSHOT : e;
+        i.xe = e === undefined ? NO_SNAPSHOT : e;
         snapshotSources.add(i);
     }
     return i;
@@ -444,13 +454,13 @@ function signal(e, t, n = null) {
 
 function optimisticSignal(e, t) {
     const n = signal(e, t);
-    n.Ee = NOT_PENDING;
+    n.Ae = NOT_PENDING;
     return n;
 }
 
 function optimisticComputed(e, t) {
     const n = computed(e, t);
-    n.Ee = NOT_PENDING;
+    n.Ae = NOT_PENDING;
     return n;
 }
 
@@ -520,11 +530,11 @@ function isEqual(e, t) {
  * 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.ke || e.nt || e.Ee !== undefined || e.Ve !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
+    if (latestReadActive || pendingCheckActive || e.ae || e.it || e.Ae !== undefined || e.xe !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
     let t = context;
-    if (t?.Et) t = t.Nt;
+    if (t?.Nt) t = t.Tt;
     if (t && tracking) link(e, t);
-    return !t || e.Ne === NOT_PENDING ? e.Pe : e.Ne;
+    return !t || e.De === NOT_PENDING ? e.Ue : e.De;
 }
 
 function read(e) {
@@ -532,46 +542,46 @@ 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.dt(e);
+    if (latestReadActive) return GlobalQueue.St(e);
     let t = context;
-    if (t?.Et) t = t.Nt;
+    if (t?.Nt) t = t.Tt;
     const n = e;
-    const i = e.nt;
+    const i = e.it;
     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.St(e, t, u, i);
-    } else if (typeof n.ke === "function") {
+        GlobalQueue.At(e, t, u, i);
+    } else if (typeof n.ae === "function") {
         prepareComputed(e, false);
     }
-    if (!n.ke && u === e && e.Ee === undefined && e.Ve === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
+    if (!n.ae && u === e && e.Ae === undefined && e.xe === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
         if (t && tracking) link(e, t);
-        return !t || e.Ne === NOT_PENDING ? e.Pe : e.Ne;
+        return !t || e.De === NOT_PENDING ? e.Ue : e.De;
     }
     if (t && tracking) {
         link(e, t, pendingCheckActive);
-        if (u.ke) {
+        if (u.ae) {
             const n = queueFor(e);
-            if (u.He >= n.Fe) {
+            if (u.Ve >= n.He) {
                 markNode(t);
                 markHeap(n);
                 updateIfNecessary(u);
             }
-            const i = u.He;
+            const i = u.Ve;
             // parent check is shallow, might need to be recursive
-                        if (i >= t.He && e.Ge !== t) {
-                t.He = i + 1;
+                        if (i >= t.Ve && e.ve !== t) {
+                t.Ve = i + 1;
             }
         }
     }
     if (u.S & STATUS_PENDING) {
-        if (t && !(stale && u.Ue && activeTransition !== u.Ue)) {
+        if (t && !(stale && u.Ie && activeTransition !== u.Ie)) {
             // 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.At(u)) {
+            if (currentOptimisticLane === null || GlobalQueue.Ct(u)) {
                 if (!tracking && e !== t) link(e, t);
                 throw u._;
             }
@@ -582,28 +592,32 @@ function read(e) {
             throw u._;
         }
     }
-    if (e.ke && e.S & STATUS_ERROR) {
+    // `owner` is the computed itself, or the firewall behind a store node —
+    // firewall-backed reads follow the same rules (memo parity, #2897 ruling):
+    // an errored derive throws for every late reader instead of silently
+    // serving node values (the seed, or last-good data after a failed refetch).
+        if (u.ae && 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
-        // - el._time < clock: only on a later cycle than the one the error was found
-        if (tracking && !pendingCheckActive && e.ce < clock) {
-            recompute(e);
+        // - owner._time < clock: only on a later cycle than the one the error was found
+        if (tracking && !pendingCheckActive && u.Se < clock) {
+            recompute(u);
             return read(e);
-        } else throw e._;
+        } else throw u._;
     }
     if (snapshotCaptureActive && t && t.T & CONFIG_IN_SNAPSHOT_SCOPE) {
-        const n = e.Ve;
+        const n = e.xe;
         if (n !== undefined) {
             const i = n === NO_SNAPSHOT ? undefined : n;
-            const u = e.Ne !== NOT_PENDING ? e.Ne : e.Pe;
+            const u = e.De !== NOT_PENDING ? e.De : e.Ue;
             if (u !== i) t.se |= REACTIVE_SNAPSHOT_STALE;
             return i;
         }
     }
-    if (e.Ee !== undefined && e.Ee !== NOT_PENDING) {
+    if (e.Ae !== undefined && e.Ae !== NOT_PENDING) {
         // A17: the override IS the value for every reader.
-        return unwrapOverride(e.Ee);
+        return unwrapOverride(e.Ae);
     }
     // Entanglement gate: a reader recomputing under an optimistic lane that reads
     // a pending mid-transition write sees the committed value. Projection-store
@@ -612,43 +626,43 @@ 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.Ct(e, u, t)) {
-        return e.Pe;
+        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.Ot(e, u, t)) {
+        return e.Ue;
     }
     // In optimistic lane context, return _value for optimistic/lane-assigned signals
     // and for regular signals in stale mode (render effects). Non-stale readers (user
     // effects) see _pendingValue so that latest() and direct reads stay consistent.
     // (The lane-context clause lives with the engine.)
-        const l = !t || currentOptimisticLane !== null && GlobalQueue.Ot(e, u, t) || e.Ne === NOT_PENDING || stale && e.Ue && activeTransition !== e.Ue ? e.Pe : e.Ne;
+        const l = !t || currentOptimisticLane !== null && GlobalQueue.Rt(e, u, t) || e.De === NOT_PENDING || stale && e.Ie && activeTransition !== e.Ie ? e.Ue : e.De;
     // Record that this isPending() probe observed the fresh pending value, so
     // the probe doesn't pair "pending" with the new value (#2831).
-        if (pendingCheckActive) GlobalQueue.Rt(e, l);
-    if (!t && u === e && typeof n.ke === "function" && e.T & CONFIG_AUTO_DISPOSE && !(u.S & STATUS_PENDING) && !e.o) {
+        if (pendingCheckActive) GlobalQueue.Pt(e, l);
+    if (!t && u === e && typeof n.ae === "function" && e.T & CONFIG_AUTO_DISPOSE && !(u.S & STATUS_PENDING) && !e.o) {
         unobserved(e);
     }
     return l;
 }
 
 function setSignal(e, t) {
-    if (e.Ue && activeTransition !== e.Ue) globalQueue.initTransition(e.Ue);
+    if (e.Ie && activeTransition !== e.Ie) globalQueue.initTransition(e.Ie);
     // The optimistic write path lives with the engine: only optimisticSignal /
     // optimisticComputed callers and optimistic store nodes carry an
     // _overrideValue slot, and every module that creates one installs the
     // engine first.
-        if (e.Ee !== undefined && !projectionWriteActive) return GlobalQueue.Pt(e, t);
-    const n = e.Ne === NOT_PENDING ? e.Pe : e.Ne;
+        if (e.Ae !== undefined && !projectionWriteActive) return GlobalQueue.ht(e, t);
+    const n = e.De === NOT_PENDING ? e.Ue : e.De;
     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.Re || !e.Re(n, t);
+        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.be || !e.be(n, t);
     if (!i) return t;
-    if (e.Ne === NOT_PENDING) queuePendingNode(e);
-    e.Ne = t;
+    if (e.De === NOT_PENDING) queuePendingNode(e);
+    e.De = t;
     // syncCompanions only pokes _pendingSignal/_latestValueComputed — with
     // neither companion present the call is a guaranteed no-op (companions are
     // only ever created, never removed, and creating one installs the hook).
-        (e.be !== undefined || e.ge !== undefined) && GlobalQueue.Ie !== null && GlobalQueue.Ie(e, t);
-    e.ce = clock;
+        (e.he !== undefined || e.pe !== undefined) && GlobalQueue._e !== null && GlobalQueue._e(e, t);
+    e.Se = clock;
     insertSubs(e);
     schedule();
     return t;
@@ -662,7 +676,7 @@ function setSignal(e, t) {
  * cleanup point.
  */ function suppressComputedRecompute(e) {
     deleteFromHeap(e, queueFor(e));
-    if (!(e.se & REACTIVE_MANUAL_WRITE) && e.Ne === NOT_PENDING) {
+    if (!(e.se & REACTIVE_MANUAL_WRITE) && e.De === NOT_PENDING) {
         queuePendingNode(e);
         schedule();
     }
@@ -745,7 +759,7 @@ function staleValues(e, t = true) {
     if (!t) {
         return;
     }
-    if (typeof t.ke === "function" && !(t.se & (REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE))) {
+    if (typeof t.ae === "function" && !(t.se & (REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE))) {
         // A refresh with no value-change dirt already queued is a re-ask of the
         // same question: mark it so the recompute classifies any resulting
         // pending window as quiet (not pending). If the node is already dirty