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

package/dist/node.cjs

@@ -26,7 +26,16 @@
  */ class NotReadyError extends Error {
     source;
     constructor(e) {
+        // Control-flow throw: it happens on every read of a pending source, so in
+        // production skip V8's eager stack capture (proportional to stack depth —
+        // real cost under SSR) by zeroing the V8-specific stackTraceLimit around
+        // super(). Dev keeps the stack for debuggability; non-V8 engines (no
+        // stackTraceLimit) take the plain path.
+        const t = Error;
+        const n = t.stackTraceLimit;
+        if (n !== undefined) t.stackTraceLimit = 0;
         super();
+        if (n !== undefined) t.stackTraceLimit = n;
         this.source = e;
     }
 }
@@ -214,7 +223,7 @@ const activeLanes = new Set;
         l: [ [], [] ],
         S: null,
         T: activeTransition,
-        _: r
+        O: r
     };
     signalLanes.set(e, t);
     activeLanes.add(t);
@@ -224,8 +233,8 @@ const activeLanes = new Set;
     // parent-child is a property of the nodes, not of write order — otherwise
     // the owner's write merges the companion's subscribers into this lane and
     // their effects wait on its async instead of flushing immediately.
-        adoptCompanionLane(e.p, t);
-    adoptCompanionLane(e.O, t);
+        adoptCompanionLane(e._, t);
+    adoptCompanionLane(e.p, t);
     return t;
 }
 
@@ -236,7 +245,7 @@ function adoptCompanionLane(e, t) {
     const r = findLane(n);
     // Only the companion's own unmerged root is safely re-parentable: a root
     // that absorbed other lanes carries work that is not a child of this owner.
-        if (r !== t && r.o === e && !r._) r._ = t;
+        if (r !== t && r.o === e && !r.O) r.O = t;
 }
 
 /**
@@ -315,9 +324,9 @@ function resolveTransition(e) {
             if (i !== n && !hasActiveOverride(e)) {
                 // Parent-child lanes stay independent so isPending resolves without
                 // waiting for the parent's async. The child keeps ownership.
-                if (n._ && findLane(n._) === i) {
+                if (n.O && findLane(n.O) === i) {
                     e.i = t;
-                } else if (i._ && findLane(i._) === n) ; else mergeLanes(n, i);
+                } else if (i.O && findLane(i.O) === n) ; else mergeLanes(n, i);
             }
             return;
         }
@@ -330,15 +339,15 @@ const transitions = new Set;
 const dirtyQueue = {
     h: new Array(2e3).fill(undefined),
     N: false,
-    C: 0,
-    P: 0
+    P: 0,
+    C: 0
 };
 
 const zombieQueue = {
     h: new Array(2e3).fill(undefined),
     N: false,
-    C: 0,
-    P: 0
+    P: 0,
+    C: 0
 };
 
 let clock = 0;
@@ -367,22 +376,22 @@ function registerTransientStoreNode(e) {
 
 function canUseSimpleSyncFlush(e) {
     const t = e.D;
-    return transitions.size === 0 && activeLanes.size === 0 && e.m.length === 0 && t.G.length === 0 && t.L.length === 0 && t.U.size === 0 && transientStoreNodes.size === 0;
+    return transitions.size === 0 && activeLanes.size === 0 && e.m.length === 0 && t.v.length === 0 && t.L.length === 0 && t.V.size === 0 && transientStoreNodes.size === 0;
 }
 
 function sweepTransientStoreNodes() {
     if (transientStoreNodes.size === 0) return;
     for (const e of transientStoreNodes) {
-        if (e.k !== null) {
+        if (e.G !== null) {
             transientStoreNodes.delete(e);
             continue;
         }
-        if (e.V !== NOT_PENDING) continue;
+        if (e.U !== NOT_PENDING) continue;
         if (e.A !== undefined && e.A !== NOT_PENDING) continue;
         // A live affects() mark keeps the node addressable: sweeping it would
         // detach the refcount from the slot (a fresh probe would upsert a new,
         // unmarked node for the same property).
-                if (e.F) continue;
+                if (e.k) continue;
         transientStoreNodes.delete(e);
         e.W?.();
     }
@@ -411,19 +420,19 @@ function setProjectionWriteActive(e) {
  * land there directly — no per-field aliasing.
  */ function createBatch() {
     return {
-        M: clock,
+        F: clock,
         H: [],
-        j: new Map,
-        G: [],
+        M: new Map,
+        v: [],
         L: [],
-        U: new Set,
+        V: new Set,
         $: [],
-        K: {
-            Y: [ [], [] ],
+        j: {
+            K: [ [], [] ],
             m: []
         },
         I: false,
-        q: new Set
+        Y: new Set
     };
 }
 
@@ -431,12 +440,12 @@ function mergeTransitionState(e, t) {
     t.I = e;
     e.$.push(...t.$);
     for (const n of activeLanes) if (n.T === t) n.T = e;
-    if (t.G.length) {
+    if (t.v.length) {
         // Move (don't copy): the global queue's batch may still be the outgoing
         // transition, and the adoption pass in initTransition would re-push its
         // contents into the target — duplicating every entry.
-        e.G.push(...t.G);
-        t.G.length = 0;
+        e.v.push(...t.v);
+        t.v.length = 0;
     }
     if (t.L.length) {
         // Move (don't copy): the global queue's batch may still be the outgoing
@@ -445,13 +454,13 @@ function mergeTransitionState(e, t) {
         e.L.push(...t.L);
         t.L.length = 0;
     }
-    for (const n of t.U) e.U.add(n);
-    for (const [n, r] of t.j) {
-        let t = e.j.get(n);
-        if (!t) e.j.set(n, t = new Set);
+    for (const n of t.V) e.V.add(n);
+    for (const [n, r] of t.M) {
+        let t = e.M.get(n);
+        if (!t) e.M.set(n, t = new Set);
         for (const e of r) t.add(e);
     }
-    for (const n of t.q) e.q.add(n);
+    for (const n of t.Y) e.Y.add(n);
 }
 
 function schedule() {
@@ -461,7 +470,7 @@ function schedule() {
     }
     if (scheduled) return;
     scheduled = true;
-    if (!syncDepth && !globalQueue.B && !projectionWriteActive) queueMicrotask(flush);
+    if (!syncDepth && !globalQueue.q && !projectionWriteActive) queueMicrotask(flush);
 }
 
 /**
@@ -491,29 +500,29 @@ function notifyHalted() {
 }
 
 class Queue {
-    Z=null;
-    Y=[ [], [] ];
+    B=null;
+    K=[ [], [] ];
     m=[];
     created=clock;
     addChild(e) {
         this.m.push(e);
-        e.Z = this;
+        e.B = this;
     }
     removeChild(e) {
         const t = this.m.indexOf(e);
         if (t >= 0) {
             this.m.splice(t, 1);
-            e.Z = null;
+            e.B = null;
         }
     }
     notify(e, t, n, r) {
-        if (this.Z) return this.Z.notify(e, t, n, r);
+        if (this.B) return this.B.notify(e, t, n, r);
         return false;
     }
     run(e) {
-        if (this.Y[e - 1].length) {
-            const t = this.Y[e - 1];
-            this.Y[e - 1] = [];
+        if (this.K[e - 1].length) {
+            const t = this.K[e - 1];
+            this.K[e - 1] = [];
             runQueue$1(t, e);
         }
         for (let t = 0; t < this.m.length; t++) this.m[t].run?.(e);
@@ -525,21 +534,21 @@ class Queue {
                 const n = findLane(currentOptimisticLane);
                 n.l[e - 1].push(t);
             } else {
-                this.Y[e - 1].push(t);
+                this.K[e - 1].push(t);
             }
         }
         schedule();
     }
     stashQueues(e) {
-        e.Y[0].push(...this.Y[0]);
-        e.Y[1].push(...this.Y[1]);
-        this.Y = [ [], [] ];
+        e.K[0].push(...this.K[0]);
+        e.K[1].push(...this.K[1]);
+        this.K = [ [], [] ];
         for (let t = 0; t < this.m.length; t++) {
             let n = this.m[t];
             let r = e.m[t];
             if (!r) {
                 r = {
-                    Y: [ [], [] ],
+                    K: [ [], [] ],
                     m: []
                 };
                 e.m[t] = r;
@@ -548,8 +557,8 @@ class Queue {
         }
     }
     restoreQueues(e) {
-        this.Y[0].push(...e.Y[0]);
-        this.Y[1].push(...e.Y[1]);
+        this.K[0].push(...e.K[0]);
+        this.K[1].push(...e.K[1]);
         for (let t = 0; t < e.m.length; t++) {
             const n = e.m[t];
             let r = this.m[t];
@@ -559,45 +568,45 @@ class Queue {
 }
 
 class GlobalQueue extends Queue {
-    B=false;
+    q=false;
     // The current transaction-shaped batch: a plain ambient batch while no
     // transition is active, the active transition itself after initTransition.
     D=createBatch();
+    static Z;
     static X;
     static J;
-    static ee;
-    static te=null;
+    static ee=null;
     // Store-side hook: drops a keyless affects() mark's identity scope when the
     // carrier node's last registration releases (wired by store.ts, mirroring
     // _clearOptimisticStore).
-    static ne=null;
+    static te=null;
     // affects()-side hooks (wired by affects.ts, mirroring _update): the mark
     // engine — count/register/release — lives with the feature. Every call site
     // is gated by state only that module creates, so `!` invocations are safe
     // once the gate holds.
+    static ne=null;
     static re=null;
     static ie=null;
-    static oe=null;
     // External-source bridge (wired by enableExternalSource(); null while no
     // config is active — including after _resetExternalSourceConfig()).
+    static oe=null;
     static se=null;
-    static ue=null;
     // Verdict-layer hooks (wired by verdict.ts when isPending()/latest() are
     // imported; null in apps that never use them). Call sites either guard for
     // null or sit behind state only the verdict layer can create (`!` is safe
     // there: `_pendingSignal`/`_latestValueComputed` are only ever assigned by
     // verdict.ts, and `pendingCheckActive`/`latestReadActive` only flip inside
     // isPending()/latest()).
+    static ue=null;
     static le=null;
-    static ce=null;
     static ae=null;
+    static ce=null;
     static fe=null;
     static Ee=null;
-    static Se=null;
     static de=null;
+    static Se=null;
     static Te=null;
-    static _e=null;
-    static pe=null;
+    static Oe=null;
     // Optimistic-engine hooks (wired by core/optimistic.ts via
     // installOptimisticEngine(), called from verdict.ts / createOptimistic /
     // createOptimisticStore — every module that can create optimistic state).
@@ -605,29 +614,29 @@ class GlobalQueue extends Queue {
     // `_overrideValue` slot, a lane in `activeLanes`, an `_optimisticNodes`
     // entry, or a non-null `currentOptimisticLane`, so `!` invocations are safe
     // once the gate holds.
-    static Oe=null;
+    static _e=null;
+    static pe=null;
     static Re=null;
     static Ie=null;
     static Ae=null;
     static he=null;
     static Ne=null;
     static ye=null;
-    static Ce=null;
     static Pe=null;
+    static Ce=null;
     static ge=null;
     static be=null;
-    static De=null;
     flush() {
-        if (this.B) return;
-        this.B = true;
+        if (this.q) return;
+        this.q = true;
         try {
             if (false) ;
-            runHeap(dirtyQueue, GlobalQueue.X);
+            runHeap(dirtyQueue, GlobalQueue.Z);
             if (activeTransition) {
                 const e = transitionComplete(activeTransition);
                 if (!e) {
                     const e = activeTransition;
-                    runHeap(zombieQueue, GlobalQueue.X);
+                    runHeap(zombieQueue, GlobalQueue.Z);
                     // Detach: the stashed transition keeps its batch; ambient work that
                     // follows lands in a fresh one. If the batch is already a separate
                     // ambient one — action done() restored activeTransition without
@@ -637,15 +646,15 @@ class GlobalQueue extends Queue {
                                         if (this.D === e) currentBatch = this.D = createBatch();
                     // Run lane effects immediately (before stashing) - lanes with no pending async
                                         if (activeLanes.size) {
-                        GlobalQueue.he(EFFECT_RENDER);
-                        GlobalQueue.he(EFFECT_USER);
+                        GlobalQueue.Ae(EFFECT_RENDER);
+                        GlobalQueue.Ae(EFFECT_USER);
                     }
-                    this.stashQueues(e.K);
+                    this.stashQueues(e.j);
                     clock++;
                     // A kept ambient batch may hold pending nodes (#2916): stay
                     // scheduled so the outer drain loop commits them via the plain
                     // flush path instead of leaving them until the next natural flush.
-                                        scheduled = dirtyQueue.P >= dirtyQueue.C || this.D.H.length > 0;
+                                        scheduled = dirtyQueue.C >= dirtyQueue.P || this.D.H.length > 0;
                     reassignPendingTransition(e.H);
                     activeTransition = null;
                     finalizePureQueue(null, true);
@@ -654,7 +663,7 @@ class GlobalQueue extends Queue {
                 const t = activeTransition;
                 const n = this.D;
                 n !== t && n.H.push(...t.H);
-                this.restoreQueues(t.K);
+                this.restoreQueues(t.j);
                 transitions.delete(t);
                 activeTransition = null;
                 reassignPendingTransition(n.H);
@@ -665,52 +674,52 @@ class GlobalQueue extends Queue {
                     // there and must survive to the next flush.
                     const e = createBatch();
                     e.H = n.H;
-                    e.G = n.G;
+                    e.v = n.v;
                     e.L = n.L;
-                    e.U = n.U;
+                    e.V = n.V;
                     currentBatch = this.D = e;
                 }
             } else {
                 if (canUseSimpleSyncFlush(this)) {
                     commitPendingNodes();
-                    if (dirtyQueue.P >= dirtyQueue.C) {
-                        runHeap(dirtyQueue, GlobalQueue.X);
+                    if (dirtyQueue.C >= dirtyQueue.P) {
+                        runHeap(dirtyQueue, GlobalQueue.Z);
                         commitPendingNodes();
                     }
                 } else {
-                    if (transitions.size) runHeap(zombieQueue, GlobalQueue.X);
+                    if (transitions.size) runHeap(zombieQueue, GlobalQueue.Z);
                     finalizePureQueue();
                 }
             }
             clock++;
             // Check if finalization added items to the heap (from optimistic reversion)
-                        scheduled = dirtyQueue.P >= dirtyQueue.C;
+                        scheduled = dirtyQueue.C >= dirtyQueue.P;
             // Run lane effects first (for ready lanes), then regular effects
-                        activeLanes.size && GlobalQueue.he(EFFECT_RENDER);
+                        activeLanes.size && GlobalQueue.Ae(EFFECT_RENDER);
             this.run(EFFECT_RENDER);
-            activeLanes.size && GlobalQueue.he(EFFECT_USER);
+            activeLanes.size && GlobalQueue.Ae(EFFECT_USER);
             this.run(EFFECT_USER);
             if (false) ;
             if (false && !scheduled && !activeTransition && transitions.size === 0 && activeLanes.size === 0) ;
             if (false) ;
         } finally {
-            this.B = false;
+            this.q = false;
         }
     }
     notify(e, t, n, r) {
         // Only track async if the boundary is propagating STATUS_PENDING (not caught by boundary)
         if (t & STATUS_PENDING) {
             if (n & STATUS_PENDING) {
-                const t = r !== undefined ? r : e.me;
+                const t = r !== undefined ? r : e.De;
                 // A visibility-only mark notification (the affects() boundary
                 // channel) updates display state on its way up but must be invisible
                 // to completion accounting BY CONSTRUCTION: it never registers a
                 // reporter and never counts toward the loading-boundary diagnostic.
-                                if (t?.ve) return true;
+                                if (t?.we) return true;
                 if (activeTransition && t) {
                     const n = t.source;
-                    let r = activeTransition.j.get(n);
-                    if (!r) activeTransition.j.set(n, r = new Set);
+                    let r = activeTransition.M.get(n);
+                    if (!r) activeTransition.M.set(n, r = new Set);
                     const i = r.size;
                     r.add(e);
                     if (r.size !== i) schedule();
@@ -723,7 +732,7 @@ class GlobalQueue extends Queue {
     initTransition(e) {
         if (e) e = currentTransition(e);
         if (e && e === activeTransition) return;
-        if (!e && activeTransition && activeTransition.M === clock) return;
+        if (!e && activeTransition && activeTransition.F === clock) return;
         if (!activeTransition) {
             activeTransition = e ?? createBatch();
         } else if (e) {
@@ -733,7 +742,7 @@ class GlobalQueue extends Queue {
             activeTransition = e;
         }
         transitions.add(activeTransition);
-        activeTransition.M = clock;
+        activeTransition.F = clock;
         const t = this.D;
         if (t !== activeTransition) {
             // Adopt the ambient batch into the transaction, then make the
@@ -748,13 +757,13 @@ class GlobalQueue extends Queue {
                 n.T = activeTransition;
                 activeTransition.H.push(n);
             }
-            for (let e = 0; e < t.G.length; e++) {
-                const n = t.G[e];
+            for (let e = 0; e < t.v.length; e++) {
+                const n = t.v[e];
                 n.T = activeTransition;
-                activeTransition.G.push(n);
+                activeTransition.v.push(n);
             }
             if (t.L.length) activeTransition.L.push(...t.L);
-            for (const e of t.U) activeTransition.U.add(e);
+            for (const e of t.V) activeTransition.V.add(e);
             currentBatch = this.D = activeTransition;
         }
         for (const e of activeLanes) {
@@ -780,48 +789,48 @@ function insertSubs(e, t = false) {
     // Get source lane: prefer node's own lane over current context
     // This is important for isPending signals which need their own lane to flush immediately
     const n = e.i || currentOptimisticLane;
-    const r = e.we !== undefined;
+    const r = e.me !== undefined;
     const i = reaskArmed;
-    for (let o = e.k; o !== null; o = o.Ge) {
+    for (let o = e.G; o !== null; o = o.ve) {
         // A value-change notification is a new question for the subscriber: any
         // pending re-ask mark (refresh) it carried is superseded.
-        if (i) o.Ue.Le &= ~REACTIVE_REASK;
-        if (r && o.Ue.ke & CONFIG_IN_SNAPSHOT_SCOPE) {
-            o.Ue.Le |= REACTIVE_SNAPSHOT_STALE;
+        if (i) o.Ve.Le &= ~REACTIVE_REASK;
+        if (r && o.Ve.Ge & CONFIG_IN_SNAPSHOT_SCOPE) {
+            o.Ve.Le |= REACTIVE_SNAPSHOT_STALE;
             continue;
         }
         if (t && n) {
-            o.Ue.Le |= REACTIVE_OPTIMISTIC_DIRTY;
-            assignOrMergeLane(o.Ue, n);
+            o.Ve.Le |= REACTIVE_OPTIMISTIC_DIRTY;
+            assignOrMergeLane(o.Ve, n);
         } else if (t) {
-            o.Ue.Le |= REACTIVE_OPTIMISTIC_DIRTY;
+            o.Ve.Le |= REACTIVE_OPTIMISTIC_DIRTY;
             // No source lane means reversion - clear subscriber's lane so effects go to regular queue
-                        o.Ue.i = undefined;
+                        o.Ve.i = undefined;
         }
-        enqueueSub(o.Ue);
+        enqueueSub(o.Ve);
     }
 }
 
 function commitPendingNode(e) {
     const t = e;
-    if (!t.Ve) {
-        if (e.V !== NOT_PENDING) {
-            e.xe = e.V;
-            e.V = NOT_PENDING;
+    if (!t.Ue) {
+        if (e.U !== NOT_PENDING) {
+            e.ke = e.U;
+            e.U = NOT_PENDING;
         }
-        if (e.p || e.O) GlobalQueue.fe(e);
+        if (e._ || e.p) GlobalQueue.ce(e);
         return;
     }
-    if (e.V !== NOT_PENDING) {
-        e.xe = e.V;
-        e.V = NOT_PENDING;
+    if (e.U !== NOT_PENDING) {
+        e.ke = e.U;
+        e.U = NOT_PENDING;
         // Set _modified for effects, but not for tracked effects (they handle their own scheduling)
-                if (e.Qe && e.Qe !== EFFECT_TRACKED) e.Fe = true;
+                if (e.We && e.We !== EFFECT_TRACKED) e.Fe = true;
     }
     t.Le &= ~REACTIVE_MANUAL_WRITE;
-    if (!(t.We & STATUS_PENDING)) t.We &= ~STATUS_UNINITIALIZED;
-    if (t.Me !== null || t.He !== null) GlobalQueue.J(t, false, true);
-    if (e.p || e.O) GlobalQueue.fe(e);
+    if (!(t.xe & STATUS_PENDING)) t.xe &= ~STATUS_UNINITIALIZED;
+    if (t.Qe !== null || t.He !== null) GlobalQueue.X(t, false, true);
+    if (e._ || e.p) GlobalQueue.ce(e);
 }
 
 function commitPendingNodes() {
@@ -838,23 +847,23 @@ function finalizePureQueue(e = null, t = false) {
     const n = !t;
     if (n) commitPendingNodes();
     if (!t && globalQueue.m.length) checkBoundaryChildren(globalQueue);
-    const r = dirtyQueue.P >= dirtyQueue.C;
-    if (r) runHeap(dirtyQueue, GlobalQueue.X);
+    const r = dirtyQueue.C >= dirtyQueue.P;
+    if (r) runHeap(dirtyQueue, GlobalQueue.Z);
     if (n) {
         if (r) commitPendingNodes();
         // The settling batch: the completing transaction's, or the ambient one.
                 const t = e ?? globalQueue.D;
         // Optimistic reversion: a non-empty batch means _optimisticWrite ran,
         // which installed the engine's hooks.
-                if (t.G.length) GlobalQueue.Re(t.G);
+                if (t.v.length) GlobalQueue.pe(t.v);
         // Replay entanglement: subs recorded by the read-time gate get rescheduled
         // so they re-run with the now-committed values visible.
-                if (e && e.q.size) {
-            for (const t of e.q) {
+                if (e && e.Y.size) {
+            for (const t of e.Y) {
                 if (t.Le & REACTIVE_DISPOSED) continue;
                 enqueueSub(t);
             }
-            e.q.clear();
+            e.Y.clear();
         }
         // Declared motion ends with the transaction: settle (or plain flush end
         // for ambient marks) releases each registration's refcount. A non-empty
@@ -863,23 +872,23 @@ function finalizePureQueue(e = null, t = false) {
         // release is the display-state update point — re-run the boundary sweep
         // (the earlier sweep above ran while the marks were still live).
                 if (t.L.length) {
-            GlobalQueue.re(t.L);
+            GlobalQueue.ne(t.L);
             if (globalQueue.m.length) checkBoundaryChildren(globalQueue);
         }
         // A non-empty set means trackOptimisticStore ran, which installed the
         // hook; the hook iterates, clears, and schedules (keeping the loop out of
         // core lets esbuild shake it — rollup already folds the null guard). The
         // completing transition scopes the clear to its own layer keys (#2899).
-                if (t.U.size) GlobalQueue.te(t.U, e);
+                if (t.V.size) GlobalQueue.ee(t.V, e);
         sweepTransientStoreNodes();
         // Lanes only enter activeLanes through the engine's getOrCreateLane.
-                if (activeLanes.size) GlobalQueue.Ae(e);
+                if (activeLanes.size) GlobalQueue.Ie(e);
     }
 }
 
 function checkBoundaryChildren(e) {
     for (const t of e.m) {
-        t.je?.();
+        t.Me?.();
         checkBoundaryChildren(t);
     }
 }
@@ -930,7 +939,7 @@ function flush(e) {
             }
         }
     }
-    if (globalQueue.B) {
+    if (globalQueue.q) {
         return;
     }
     if (halted) return;
@@ -948,21 +957,21 @@ function runQueue$1(e, t) {
 function reporterBlocksSource(e, t) {
     if (e.Le & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED)) return false;
     if (e.$e?.has(t)) return true;
-    for (let n = e.Ke; n; n = n.Ye) {
-        let e = n.qe;
+    for (let n = e.je; n; n = n.Ke) {
+        let e = n.Ye;
         while (e) {
-            if (e === t || e.Be === t) return true;
+            if (e === t || e.qe === t) return true;
             e = e.t;
         }
     }
-    return !!(e.We & STATUS_PENDING && e.me instanceof NotReadyError && e.me.source === t);
+    return !!(e.xe & STATUS_PENDING && e.De instanceof NotReadyError && e.De.source === t);
 }
 
 function transitionComplete(e) {
     if (e.I) return true;
     if (e.$.length) return false;
     let t = true;
-    for (const [n, r] of e.j) {
+    for (const [n, r] of e.M) {
         let i = false;
         for (const e of r) {
             if (reporterBlocksSource(e, n)) {
@@ -971,7 +980,7 @@ function transitionComplete(e) {
             }
             r.delete(e);
         }
-        if (!i) e.j.delete(n); else if (n.We & STATUS_PENDING && n.me?.source === n) {
+        if (!i) e.M.delete(n); else if (n.xe & STATUS_PENDING && n.De?.source === n) {
             t = false;
             break;
         }
@@ -979,7 +988,7 @@ function transitionComplete(e) {
     // Override blockage lives with the engine. Absent hook = "no optimistic
     // blockage", which is exact: only _optimisticWrite (engine) pushes to
     // _optimisticNodes, so without the engine the loop was vacuous anyway.
-        if (t && e.G.length && GlobalQueue.Ie(e)) t = false;
+        if (t && e.v.length && GlobalQueue.Re(e)) t = false;
     t && (e.I = true);
     return t;
 }
@@ -1012,31 +1021,31 @@ function runInTransition(e, t) {
  * the heap and go directly to their effect queue; everything else is inserted
  * into its own (zombie-flag-routed) heap with the `_min` cursor pulled down.
  */ function enqueueSub(e) {
-    if (e.Qe === EFFECT_TRACKED) {
+    if (e.We === EFFECT_TRACKED) {
         const t = e;
         if (!t.Fe) {
             t.Fe = true;
-            t.Ze.enqueue(EFFECT_USER, t.Xe);
+            t.Be.enqueue(EFFECT_USER, t.Ze);
         }
         return;
     }
     const t = queueFor(e);
-    if (t.C > e.ze) t.C = e.ze;
+    if (t.P > e.Xe) t.P = e.Xe;
     insertIntoHeap(e, t);
 }
 
 function actualInsertIntoHeap(e, t) {
-    const n = (e.Z?.Je ? e.Z.et?.ze : e.Z?.ze) ?? -1;
-    if (n >= e.ze) e.ze = n + 1;
-    const r = e.ze;
+    const n = (e.B?.ze ? e.B.Je?.Xe : e.B?.Xe) ?? -1;
+    if (n >= e.Xe) e.Xe = n + 1;
+    const r = e.Xe;
     const i = t.h[r];
     if (i === undefined) t.h[r] = e; else {
-        const t = i.tt;
-        t.nt = e;
-        e.tt = t;
-        i.tt = e;
+        const t = i.et;
+        t.tt = e;
+        e.et = t;
+        i.et = e;
     }
-    if (r > t.P) t.P = r;
+    if (r > t.C) t.C = r;
 }
 
 function insertIntoHeap(e, t) {
@@ -1067,23 +1076,23 @@ function deleteFromHeap(e, t) {
     const n = e.Le;
     if (!(n & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
     e.Le = n & -25;
-    const r = e.ze;
-    if (e.tt === e) t.h[r] = undefined; else {
-        const n = e.nt;
+    const r = e.Xe;
+    if (e.et === e) t.h[r] = undefined; else {
+        const n = e.tt;
         const i = t.h[r];
         const o = n ?? i;
-        if (e === i) t.h[r] = n; else e.tt.nt = n;
-        o.tt = e.tt;
+        if (e === i) t.h[r] = n; else e.et.tt = n;
+        o.et = e.et;
     }
-    e.tt = e;
-    e.nt = undefined;
+    e.et = e;
+    e.tt = undefined;
 }
 
 function markHeap(e) {
     if (e.N) return;
     e.N = true;
-    for (let t = 0; t <= e.P; t++) {
-        for (let n = e.h[t]; n !== undefined; n = n.nt) {
+    for (let t = 0; t <= e.C; t++) {
+        for (let n = e.h[t]; n !== undefined; n = n.tt) {
             if (n.Le & REACTIVE_IN_HEAP) markNode(n);
         }
     }
@@ -1093,13 +1102,13 @@ function markNode(e, t = REACTIVE_DIRTY) {
     const n = e.Le;
     if ((n & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= t) return;
     e.Le = n & -4 | t;
-    for (let t = e.k; t !== null; t = t.Ge) {
-        markNode(t.Ue, REACTIVE_CHECK);
+    for (let t = e.G; t !== null; t = t.ve) {
+        markNode(t.Ve, REACTIVE_CHECK);
     }
-    if (e.rt !== null) {
-        for (let t = e.rt; t !== null; t = t.it) {
-            for (let e = t.k; e !== null; e = e.Ge) {
-                markNode(e.Ue, REACTIVE_CHECK);
+    if (e.nt !== null) {
+        for (let t = e.nt; t !== null; t = t.rt) {
+            for (let e = t.G; e !== null; e = e.ve) {
+                markNode(e.Ve, REACTIVE_CHECK);
             }
         }
     }
@@ -1107,33 +1116,33 @@ function markNode(e, t = REACTIVE_DIRTY) {
 
 function runHeap(e, t) {
     e.N = false;
-    for (e.C = 0; e.C <= e.P; e.C++) {
-        let n = e.h[e.C];
+    for (e.P = 0; e.P <= e.C; e.P++) {
+        let n = e.h[e.P];
         while (n !== undefined) {
             if (n.Le & REACTIVE_IN_HEAP) t(n); else adjustHeight(n, e);
-            n = e.h[e.C];
+            n = e.h[e.P];
         }
     }
-    e.P = 0;
+    e.C = 0;
 }
 
 function adjustHeight(e, t) {
     deleteFromHeap(e, t);
-    let n = e.ze;
-    for (let t = e.Ke; t; t = t.Ye) {
-        const e = t.qe;
-        const r = e.Be || e;
-        if (r.Ve && r.ze >= n) n = r.ze + 1;
-    }
-    if (e.ze !== n) {
-        e.ze = n;
-        for (let t = e.k; t !== null; t = t.Ge) {
+    let n = e.Xe;
+    for (let t = e.je; t; t = t.Ke) {
+        const e = t.Ye;
+        const r = e.qe || e;
+        if (r.Ue && r.Xe >= n) n = r.Xe + 1;
+    }
+    if (e.Xe !== n) {
+        e.Xe = n;
+        for (let t = e.G; t !== null; t = t.ve) {
             // Route each subscriber by its own zombie flag, mirroring the
             // post-recompute height-adjust path. Inserting into the running `heap`
             // unconditionally can park a zombie in `dirtyQueue` (or a live node in
             // `zombieQueue`), breaking the flag/queue invariant `deleteFromHeap`
             // relies on — the same corruption class as #2759.
-            insertIntoHeapHeight(t.Ue, queueFor(t.Ue));
+            insertIntoHeapHeight(t.Ve, queueFor(t.Ve));
         }
     }
 }
@@ -1142,7 +1151,7 @@ const PENDING_OWNER = {};
 
  // Dummy owner to trigger store's read() path
 function markDisposal(e) {
-    let t = e.ot;
+    let t = e.it;
     while (t) {
         const e = t.Le;
         t.Le = e | REACTIVE_ZOMBIE;
@@ -1156,17 +1165,17 @@ function markDisposal(e) {
             if (e & REACTIVE_IN_HEAP) insertIntoHeap(t, zombieQueue); else insertIntoHeapHeight(t, zombieQueue);
         }
         markDisposal(t);
-        t = t.st;
+        t = t.ot;
     }
 }
 
 function dispose(e) {
-    let t = e.Ke;
+    let t = e.je;
     while (t !== null) {
         t = unlinkSubs(t);
     }
-    e.Ke = null;
-    e.ut = null;
+    e.je = null;
+    e.st = null;
     disposeChildren(e, true);
 }
 
@@ -1181,54 +1190,54 @@ function disposeChildren(e, t = false, n) {
         // edge). Snap runs after the DISPOSED flag is set so the oracle reads
         // false, and notifies subscribers still watching the companion.
                 const t = e;
-        if (t.p || t.O) GlobalQueue.fe(t);
+        if (t._ || t.p) GlobalQueue.ce(t);
     }
-    if (t && e.Ve) e.lt = null;
-    let i = n ? e.Me : e.ot;
+    if (t && e.Ue) e.ut = null;
+    let i = n ? e.Qe : e.it;
     while (i) {
-        const e = i.st;
-        if (i.Ke) {
+        const e = i.ot;
+        if (i.je) {
             const e = i;
             deleteFromHeap(e, queueFor(e));
-            let t = e.Ke;
+            let t = e.je;
             do {
                 t = unlinkSubs(t);
             } while (t !== null);
-            e.Ke = null;
-            e.ut = null;
+            e.je = null;
+            e.st = null;
         }
         disposeChildren(i, true);
         i = e;
     }
     if (n) {
-        e.Me = null;
+        e.Qe = null;
     } else {
-        e.ot = null;
-        e.ct = 0;
+        e.it = null;
+        e.lt = 0;
     }
     // O(1) splice out of parent's chain on individual dispose. Skipped during
     // batch dispose (parent already disposed) and zombie disposal (node sits on
     // parent's _pendingFirstChild). We leave node._nextSibling intact so outer
     // walks that already advanced past us still reach later siblings.
-        if (t && !n && !(r & REACTIVE_ZOMBIE) && e.Z !== null && !(e.Z.Le & REACTIVE_DISPOSED)) {
-        const t = e.ft;
-        const n = e.st;
-        if (t !== null) t.st = n; else e.Z.ot = n;
-        if (n !== null) n.ft = t;
-        e.ft = null;
+        if (t && !n && !(r & REACTIVE_ZOMBIE) && e.B !== null && !(e.B.Le & REACTIVE_DISPOSED)) {
+        const t = e.ct;
+        const n = e.ot;
+        if (t !== null) t.ot = n; else e.B.it = n;
+        if (n !== null) n.ct = t;
+        e.ct = null;
     }
     runDisposal(e, n);
     // Final effect-returned cleanup fires at true disposal, after `_disposal`
     // to mirror rerun ordering (compute-phase teardown first, cleanup last).
-        if (t && e.Et) {
-        const t = e.Et;
-        e.Et = undefined;
+        if (t && e.ft) {
+        const t = e.ft;
+        e.ft = undefined;
         t();
     }
 }
 
 function runDisposal(e, t) {
-    let n = t ? e.He : e.St;
+    let n = t ? e.He : e.Et;
     if (!n) return;
     if (Array.isArray(n)) {
         for (let e = 0; e < n.length; e++) {
@@ -1238,13 +1247,13 @@ function runDisposal(e, t) {
     } else {
         n.call(n);
     }
-    t ? e.He = null : e.St = null;
+    t ? e.He = null : e.Et = null;
 }
 
 function childId(e, t) {
     let n = e;
-    while (n.ke & CONFIG_TRANSPARENT && n.Z) n = n.Z;
-    if (n.id != null) return formatId(n.id, t ? n.ct++ : n.ct);
+    while (n.Ge & CONFIG_TRANSPARENT && n.B) n = n.B;
+    if (n.id != null) return formatId(n.id, t ? n.lt++ : n.lt);
     throw new Error("");
 }
 
@@ -1325,7 +1334,7 @@ function formatId(e, t) {
  * checks. `cleanup()` is the unchecked primitive used by internals.
  */ function cleanup(e) {
     if (!context) return e;
-    if (!context.St) context.St = e; else if (Array.isArray(context.St)) context.St.push(e); else context.St = [ context.St, e ];
+    if (!context.Et) context.Et = e; else if (Array.isArray(context.Et)) context.Et.push(e); else context.Et = [ context.Et, e ];
     return e;
 }
 
@@ -1364,29 +1373,29 @@ function disposeRootSelf(e = true) {
     const n = e?.transparent ?? false;
     const r = {
         id: inheritId(e, n, t),
-        ke: n ? CONFIG_TRANSPARENT : 0,
-        Je: true,
-        et: t?.Je ? t.et : t,
+        Ge: n ? CONFIG_TRANSPARENT : 0,
+        ze: true,
+        Je: t?.ze ? t.Je : t,
+        it: null,
         ot: null,
-        st: null,
-        ft: null,
-        St: null,
-        Ze: t?.Ze ?? globalQueue,
+        ct: null,
+        Et: null,
+        Be: t?.Be ?? globalQueue,
         dt: t?.dt || defaultContext,
-        ct: 0,
+        lt: 0,
         He: null,
-        Me: null,
-        Z: t,
+        Qe: null,
+        B: t,
         dispose: disposeRootSelf
     };
     if (t) {
-        const e = t.ot;
+        const e = t.it;
         if (e === null) {
-            t.ot = r;
+            t.it = r;
         } else {
-            r.st = e;
-            e.ft = r;
-            t.ot = r;
+            r.ot = e;
+            e.ct = r;
+            t.it = r;
         }
     }
     return r;
@@ -1422,13 +1431,13 @@ function disposeRootSelf(e = true) {
 
 // https://github.com/stackblitz/alien-signals/blob/v2.0.3/src/system.ts#L100
 function unlinkSubs(e) {
-    const t = e.qe;
-    const n = e.Ye;
-    const r = e.Ge;
-    const i = e.Tt;
-    if (r !== null) r.Tt = i; else t._t = i;
-    if (i !== null) i.Ge = r; else {
-        t.k = r;
+    const t = e.Ye;
+    const n = e.Ke;
+    const r = e.ve;
+    const i = e.St;
+    if (r !== null) r.St = i; else t.Tt = i;
+    if (i !== null) i.ve = r; else {
+        t.G = r;
         if (r === null) {
             t.W?.();
             // No more subscribers; only tear down if CONFIG_AUTO_DISPOSE is set.
@@ -1438,31 +1447,31 @@ function unlinkSubs(e) {
             // this same last-one-out check when that observer releases (the
             // untracked-read dispose in core.ts guards on pending identically).
                         const e = t;
-            e.Ve && e.ke & CONFIG_AUTO_DISPOSE && !(e.Le & REACTIVE_ZOMBIE) && !(e.We & STATUS_PENDING) && unobserved(e);
+            e.Ue && e.Ge & CONFIG_AUTO_DISPOSE && !(e.Le & REACTIVE_ZOMBIE) && !(e.xe & STATUS_PENDING) && unobserved(e);
         }
     }
     return n;
 }
 
 function trimStaleDeps(e) {
-    const t = e.ut;
-    let n = t !== null ? t.Ye : e.Ke;
+    const t = e.st;
+    let n = t !== null ? t.Ke : e.je;
     if (n !== null) {
         do {
             n = unlinkSubs(n);
         } while (n !== null);
-        if (t !== null) t.Ye = null; else e.Ke = null;
+        if (t !== null) t.Ke = null; else e.je = null;
     }
 }
 
 function unobserved(e) {
     deleteFromHeap(e, queueFor(e));
-    let t = e.Ke;
+    let t = e.je;
     while (t !== null) {
         t = unlinkSubs(t);
     }
-    e.Ke = null;
-    e.ut = null;
+    e.je = null;
+    e.st = null;
     disposeChildren(e, true);
 }
 
@@ -1473,18 +1482,18 @@ function link(e, t, n = false) {
     // not relabel the value dependency as probe-only — the value read is what
     // real-error propagation and affects() coverage key off, regardless of
     // read order within the computation.
-    const r = t.ut;
-    if (r !== null && r.qe === e) {
+    const r = t.st;
+    if (r !== null && r.Ye === e) {
         r.Ot &&= n;
         return;
     }
     let i = null;
     const o = t.Le & REACTIVE_RECOMPUTING_DEPS;
     if (o) {
-        i = r !== null ? r.Ye : t.Ke;
-        if (i !== null && i.qe === e) {
-            i.Rt = t.It;
-            t.ut = i;
+        i = r !== null ? r.Ke : t.je;
+        if (i !== null && i.Ye === e) {
+            i._t = t.Rt;
+            t.st = i;
             // First touch of this pass: the previous pass's label is stale.
                         i.Ot = n;
             return;
@@ -1495,24 +1504,24 @@ function link(e, t, n = false) {
     // [deps.._depsTail] prefix — the O(1) equivalent of scanning the dep list
     // (the old alien-signals `isValidLink` walk, O(n²) when a computation
     // re-reads earlier deps non-consecutively, e.g. store leaf reads).
-        const s = e._t;
-    if (s !== null && s.Ue === t && (!o || s.Rt === t.It)) {
+        const s = e.Tt;
+    if (s !== null && s.Ve === t && (!o || s._t === t.Rt)) {
         // Gen-matched during a recompute = repeat touch this pass (AND); outside
         // a recompute there is no pass boundary, so the latest read labels it.
         if (o) s.Ot &&= n; else s.Ot = n;
         return;
     }
-    const u = t.ut = e._t = {
-        qe: e,
-        Ue: t,
-        Ye: i,
-        Tt: s,
-        Ge: null,
-        Rt: t.It,
+    const u = t.st = e.Tt = {
+        Ye: e,
+        Ve: t,
+        Ke: i,
+        St: s,
+        ve: null,
+        _t: t.Rt,
         Ot: n
     };
-    if (r !== null) r.Ye = u; else t.Ke = u;
-    if (s !== null) s.Ge = u; else e.k = u;
+    if (r !== null) r.Ke = u; else t.je = u;
+    if (s !== null) s.ve = u; else e.G = u;
 }
 
 // The lazily-created Set is the ONE container for pending sources. Its
@@ -1539,24 +1548,24 @@ function clearPendingSources(e) {
 
 function setPendingError(e, t, n) {
     if (!t) {
-        e.me = null;
+        e.De = null;
         return;
     }
     if (n instanceof NotReadyError && n.source === t) {
-        e.me = n;
+        e.De = n;
         return;
     }
-    const r = e.me;
+    const r = e.De;
     if (!(r instanceof NotReadyError) || r.source !== t) {
-        e.me = new NotReadyError(t);
+        e.De = new NotReadyError(t);
     }
 }
 
 function forEachDependent(e, t) {
-    for (let n = e.k; n !== null; n = n.Ge) t(n.Ue, n);
+    for (let n = e.G; n !== null; n = n.ve) t(n.Ve, n);
     // `?? null`: affects() marks route plain signals (no `_child` slot) through here.
-        for (let n = e.rt ?? null; n !== null; n = n.it) {
-        for (let e = n.k; e !== null; e = e.Ge) t(e.Ue, e);
+        for (let n = e.nt ?? null; n !== null; n = n.rt) {
+        for (let e = n.G; e !== null; e = e.ve) t(e.Ve, e);
     }
 }
 
@@ -1567,24 +1576,24 @@ function settlePendingSource(e) {
     let t = false;
     const n = new Set;
     // Companion updates no-op without the verdict layer (null hook).
-        const r = GlobalQueue.ce;
+        const r = GlobalQueue.le;
     const settle = i => {
         if (n.has(i) || !removePendingSource(i, e)) return;
         n.add(i);
-        i.M = clock;
+        i.F = clock;
         const o = i.$e?.values().next().value;
         if (o) {
             setPendingError(i, o);
             r !== null && r(i);
         } else {
-            i.We &= ~STATUS_PENDING;
+            i.xe &= ~STATUS_PENDING;
             setPendingError(i);
             r !== null && r(i);
-            if (i.At) {
+            if (i.It) {
                 enqueueSub(i);
                 t = true;
             }
-            i.At = false;
+            i.It = false;
         }
         forEachDependent(i, settle);
     };
@@ -1607,26 +1616,26 @@ function handleAsync(e, t, n) {
         });
     }
     if (!i && !r) {
-        e.lt = null;
+        e.ut = null;
         return t;
     }
-    e.lt = t;
+    e.ut = t;
     let o;
     const handleError = n => {
-        if (e.lt !== t) return;
+        if (e.ut !== t) return;
         globalQueue.initTransition(resolveTransition(e));
         // NotReadyError from rejected promises should be treated as pending, not error
                 notifyStatus(e, n instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n);
-        e.M = clock;
+        e.F = clock;
     };
     const asyncWrite = (r, i) => {
-        if (e.lt !== t) return;
+        if (e.ut !== 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.Le & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
         globalQueue.initTransition(resolveTransition(e));
-        const o = !!(e.We & STATUS_UNINITIALIZED);
+        const o = !!(e.xe & STATUS_UNINITIALIZED);
         trimStaleDeps(e);
         clearStatus(e);
         const s = resolveLane(e);
@@ -1644,8 +1653,8 @@ function handleAsync(e, t, n) {
             // (A17 — every reader sees the override); the revert reveals whatever
             // has committed by then, so corrections reveal atomically with their
             // transition rather than escaping it.
-            if (e.V === NOT_PENDING) queuePendingNode(e);
-            e.V = r;
+            if (e.U === NOT_PENDING) queuePendingNode(e);
+            e.U = r;
             // The hold is a companion-visible write like any other (A13/A19): the
             // clearStatus() above computed its verdict before the hold existed, so
             // isPending must re-derive (the value is not final until commit — V1)
@@ -1653,22 +1662,22 @@ function handleAsync(e, t, n) {
             // only notified when the hold is visible to them: under an active
             // override every reader sees the override (A17), so waking subs would
             // re-show an unchanged view — the revert is the notification point.
-                        GlobalQueue.le !== null && GlobalQueue.le(e, r);
+                        GlobalQueue.ue !== null && GlobalQueue.ue(e, r);
             if (!hasActiveOverride(e)) insertSubs(e);
-            e.M = clock;
+            e.F = clock;
         } else if (s) {
             // Route through lane's effect queue for independent flushing
-            const t = e.Qe;
-            const n = e.xe;
-            const i = e.ht;
+            const t = e.We;
+            const n = e.ke;
+            const i = e.At;
             try {
                 if (!t && o || !i || !i(r, n)) {
-                    e.xe = r;
-                    e.M = clock;
+                    e.ke = r;
+                    e.F = clock;
                     // The latest() shadow write gives latest() effects independent lanes; the
                     // _pendingSignal update is a no-op repeat of the clearStatus() call above
                     // (computePendingState doesn't read _value).
-                                        GlobalQueue.le !== null && GlobalQueue.le(e, r);
+                                        GlobalQueue.ue !== null && GlobalQueue.ue(e, r);
                     insertSubs(e, true);
                 }
             } catch (t) {
@@ -1698,7 +1707,7 @@ function handleAsync(e, t, n) {
     // fetch per suspended re-read). Settling is that observer's release, so
     // it runs the same last-one-out check the other release sites run.
         const settleAutodispose = () => {
-        if (e.ke & CONFIG_AUTO_DISPOSE && !e.k && !(e.We & STATUS_PENDING)) {
+        if (e.Ge & CONFIG_AUTO_DISPOSE && !e.G && !(e.xe & STATUS_PENDING)) {
             unobserved(e);
         }
     };
@@ -1747,13 +1756,13 @@ function handleAsync(e, t, n) {
             } catch {}
         });
         const iterate = () => {
-            let u, l, c = false, a = false, f = true;
+            let u, l, a = false, c = false, f = true;
             n.next().then(n => {
                 if (f) {
                     u = n;
-                    c = true;
+                    a = true;
                     if (n.done) i = true;
-                } else if (e.lt !== t) {
+                } else if (e.ut !== t) {
                     return;
                 } else if (!n.done) {
                     r = true;
@@ -1771,26 +1780,26 @@ function handleAsync(e, t, n) {
             }, n => {
                 if (f) {
                     l = n;
-                    a = true;
-                } else if (e.lt === t) {
+                    c = true;
+                } else if (e.ut === t) {
                     i = true;
                     handleError(n);
                 }
             });
             f = false;
-            if (a) {
+            if (c) {
                 // Match the promise branch, but only rethrow during the initial read.
                 i = true;
                 handleError(l);
                 if (s) throw l;
                 return true;
             }
-            if (c && !u.done) {
+            if (a && !u.done) {
                 o = u.value;
                 r = true;
                 return iterate();
             }
-            return c && u.done;
+            return a && u.done;
         };
         const u = iterate();
         // Later iterate() calls run from asyncWrite, where rethrowing would be unhandled.
@@ -1805,18 +1814,18 @@ function handleAsync(e, t, n) {
 
 function clearStatus(e, t = false) {
     if (e.$e) clearPendingSources(e);
-    if (e.At) e.At = false;
+    if (e.It) e.It = false;
     // The pending window is over; its quiet classification dies with it.
     // (Unconditional: _reask is baked into the node literals, so this is a
     // plain store to an existing slot — no shape change.)
-        e.Nt = false;
-    e.We = t ? 0 : e.We & STATUS_UNINITIALIZED;
-    if (e.me) setPendingError(e);
+        e.ht = false;
+    e.xe = t ? 0 : e.xe & STATUS_UNINITIALIZED;
+    if (e.De) setPendingError(e);
     // Update pending signal for isPending() reactivity (companions only exist
     // once the verdict layer created them, which installs the hooks).
-        if (e.p || e.O) GlobalQueue.ce(e);
-    if (e.rt && GlobalQueue.ae !== null) GlobalQueue.ae(e);
-    if (e.yt) e.yt();
+        if (e._ || e.p) GlobalQueue.le(e);
+    if (e.nt && GlobalQueue.ae !== null) GlobalQueue.ae(e);
+    if (e.Nt) e.Nt();
 }
 
 function notifyStatus(e, t, n, r, i) {
@@ -1829,37 +1838,37 @@ function notifyStatus(e, t, n, r, i) {
     if (!r) {
         if (t === STATUS_PENDING && o) {
             addPendingSource(e, o);
-            e.We = STATUS_PENDING | e.We & STATUS_UNINITIALIZED;
+            e.xe = STATUS_PENDING | e.xe & STATUS_UNINITIALIZED;
             // Preserve the current source on this propagation so render-effect notification
             // can register every distinct pending source with the transition.
                         setPendingError(e, o, n);
         } else {
             clearPendingSources(e);
-            e.We = t | (t !== STATUS_ERROR ? e.We & STATUS_UNINITIALIZED : 0);
-            e.me = n;
+            e.xe = t | (t !== STATUS_ERROR ? e.xe & STATUS_UNINITIALIZED : 0);
+            e.De = n;
         }
-        GlobalQueue.ce !== null && GlobalQueue.ce(e);
-        if (e.rt && GlobalQueue.ae !== null) GlobalQueue.ae(e);
+        GlobalQueue.le !== null && GlobalQueue.le(e);
+        if (e.nt && GlobalQueue.ae !== null) GlobalQueue.ae(e);
     }
     if (i && !r) {
         assignOrMergeLane(e, i);
     }
-    const c = r || l;
-    const a = r || u ? undefined : i;
-    if (e.yt) {
+    const a = r || l;
+    const c = r || u ? undefined : i;
+    if (e.Nt) {
         if (r && t === STATUS_PENDING) {
             return;
         }
-        if (c) {
-            e.yt(t, n);
+        if (a) {
+            e.Nt(t, n);
         } else {
-            e.yt();
+            e.Nt();
         }
         return;
     }
     forEachDependent(e, (e, r) => {
-        e.M = clock;
-        if (t === STATUS_PENDING && o && !e.$e?.has(o) || t !== STATUS_PENDING && (e.me !== n || e.$e)) {
+        e.F = clock;
+        if (t === STATUS_PENDING && o && !e.$e?.has(o) || t !== STATUS_PENDING && (e.De !== n || e.$e)) {
             // A pending-observer link is the subscription an `isPending` read created.
             // It exists so the observer re-runs when the source settles, but it must
             // not carry a real (non-NotReadyError) error — the synchronous `isPending`
@@ -1870,15 +1879,15 @@ function notifyStatus(e, t, n, r, i) {
                 schedule();
                 return;
             }
-            if (!c && !e.T) queuePendingNode(e);
-            notifyStatus(e, t, n, c, a);
+            if (!a && !e.T) queuePendingNode(e);
+            notifyStatus(e, t, n, a, c);
         }
     });
 }
 
-GlobalQueue.X = recompute;
+GlobalQueue.Z = recompute;
 
-GlobalQueue.J = disposeChildren;
+GlobalQueue.X = disposeChildren;
 
 let tracking = false;
 
@@ -1910,8 +1919,8 @@ let snapshotSources = null;
 
 function ownerInSnapshotScope(e) {
     while (e) {
-        if (e.Ct) return true;
-        e = e.Z;
+        if (e.yt) return true;
+        e = e.B;
     }
     return false;
 }
@@ -1922,42 +1931,45 @@ function setSnapshotCapture(e) {
 }
 
 function markSnapshotScope(e) {
-    e.Ct = true;
+    e.yt = true;
 }
 
 function releaseSnapshotScope(e) {
-    e.Ct = false;
+    e.yt = false;
     releaseSubtree(e);
     schedule();
 }
 
 function releaseSubtree(e) {
-    let t = e.ot;
+    let t = e.it;
     while (t) {
-        if (t.Ct) {
-            t = t.st;
+        if (t.yt) {
+            t = t.ot;
             continue;
         }
-        if (t.Ve) {
+        if (t.Ue) {
             const e = t;
-            e.ke &= ~CONFIG_IN_SNAPSHOT_SCOPE;
+            e.Ge &= ~CONFIG_IN_SNAPSHOT_SCOPE;
             if (e.Le & REACTIVE_SNAPSHOT_STALE) {
                 e.Le &= ~REACTIVE_SNAPSHOT_STALE;
                 e.Le |= REACTIVE_DIRTY;
-                if (dirtyQueue.C > e.ze) dirtyQueue.C = e.ze;
+                if (dirtyQueue.P > e.Xe) dirtyQueue.P = e.Xe;
                 insertIntoHeap(e, dirtyQueue);
             }
         }
         releaseSubtree(t);
-        t = t.st;
+        t = t.ot;
     }
 }
 
 function clearSnapshots() {
     if (snapshotSources) {
         for (const e of snapshotSources) {
-            delete e.we;
-            delete e[STORE_SNAPSHOT_PROPS];
+            delete e.me;
+            // 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.
+                        if (e[STORE_SNAPSHOT_PROPS] !== undefined) e[STORE_SNAPSHOT_PROPS] = undefined;
         }
         snapshotSources = null;
     }
@@ -1965,36 +1977,36 @@ function clearSnapshots() {
 }
 
 function recompute(e, t = false) {
-    const n = e.Qe;
+    const n = e.We;
     if (!t) {
         if (e.T && (!n || activeTransition) && activeTransition !== e.T) globalQueue.initTransition(e.T);
         deleteFromHeap(e, queueFor(e));
-        e.lt = null;
+        e.ut = null;
         // Tracked effects run after finalizePureQueue, so dispose immediately instead of deferring
-                if (e.T || n === EFFECT_TRACKED) disposeChildren(e); else if (e.ot !== null || e.St !== null) {
+                if (e.T || n === EFFECT_TRACKED) disposeChildren(e); else if (e.it !== null || e.Et !== null) {
             markDisposal(e);
-            e.He = e.St;
-            e.Me = e.ot;
-            e.St = null;
-            e.ot = null;
-            e.ct = 0;
+            e.He = e.Et;
+            e.Qe = e.it;
+            e.Et = null;
+            e.it = null;
+            e.lt = 0;
         } else ;
     }
     let r = !!(e.Le & REACTIVE_OPTIMISTIC_DIRTY);
     const i = e.A !== undefined && e.A !== NOT_PENDING;
-    const o = !!(e.We & STATUS_UNINITIALIZED);
+    const o = !!(e.xe & STATUS_UNINITIALIZED);
     // Re-ask classification lives in the verdict module; capture the flag before
     // the recompute wipes _flags below.
         const s = (e.Le & REACTIVE_REASK) !== 0;
     const u = context;
     context = e;
-    e.ut = null;
-    e.It++;
+    e.st = null;
+    e.Rt++;
     e.Le = REACTIVE_RECOMPUTING_DEPS;
-    e.M = clock;
-    let l = e.V === NOT_PENDING ? e.xe : e.V;
-    let c = e.ze;
-    let a = tracking;
+    e.F = clock;
+    let l = e.U === NOT_PENDING ? e.ke : e.U;
+    let a = e.Xe;
+    let c = tracking;
     let f = currentOptimisticLane;
     tracking = true;
     // A computed's fn establishes its OWN dependencies, so it must never run
@@ -2011,7 +2023,7 @@ function recompute(e, t = false) {
         if (r) {
         const t = GlobalQueue.Pe(e, true);
         if (t) currentOptimisticLane = t;
-    } else if (activeTransition && !t && activeTransition.G.length) {
+    } else if (activeTransition && !t && activeTransition.v.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.
@@ -2021,53 +2033,56 @@ function recompute(e, t = false) {
             currentOptimisticLane = t;
         }
     }
-    const S = n && n !== EFFECT_USER;
-    const d = stale;
-    if (S) stale = true;
+    const d = n && n !== EFFECT_USER;
+    const S = stale;
+    if (d) stale = true;
     try {
-        if (!false && e.ke & CONFIG_SYNC) {
-            l = e.Ve(l);
-            e.lt = null;
+        if (!false && e.Ge & CONFIG_SYNC) {
+            l = e.Ue(l);
+            e.ut = null;
         } 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.lt;
-            const n = e.Ve(l);
+            const t = e.ut;
+            const n = e.Ue(l);
             const r = typeof n === "object" && n !== null;
-            const i = e.lt !== t;
+            const i = e.ut !== t;
             l = i || !r ? n : handleAsync(e, n);
-            if (!i && !r) e.lt = null;
+            if (!i && !r) e.ut = null;
         }
-        clearStatus(e, t);
+        // 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.xe !== 0 || e.Nt !== undefined || e.De || e.ht || e.It || e.$e !== undefined || e._ !== undefined || e.p !== undefined || e.nt !== null) clearStatus(e, t);
         // _optimisticLane is only ever assigned by engine paths.
-                if (e.i) GlobalQueue.be(e);
+                if (e.i) GlobalQueue.ge(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.ge(e);
+        if (t instanceof NotReadyError && currentOptimisticLane) GlobalQueue.Ce(e);
         let n = false;
         if (t instanceof NotReadyError) {
-            e.At = true;
-            if (GlobalQueue.Te !== null) n = GlobalQueue.Te(e, s);
+            e.It = true;
+            if (GlobalQueue.Se !== null) n = GlobalQueue.Se(e, s);
         }
         notifyStatus(e, t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, t, undefined, t instanceof NotReadyError ? e.i : undefined);
-        if (n) GlobalQueue._e(e);
+        if (n) GlobalQueue.Te(e);
     } finally {
-        tracking = a;
+        tracking = c;
         latestReadActive = E;
-        if (S) stale = d;
+        if (d) stale = S;
         e.Le = REACTIVE_NONE | (t ? e.Le & REACTIVE_SNAPSHOT_STALE : 0);
         context = u;
     }
-    if (!e.me) {
+    if (!e.De) {
         trimStaleDeps(e);
-        const s = i ? unwrapOverride(e.A) : e.V === NOT_PENDING ? e.xe : e.V;
+        const s = i ? unwrapOverride(e.A) : e.U === NOT_PENDING ? e.ke : e.U;
         let u = false;
         try {
-            u = !n && o || !e.ht || !e.ht(s, l);
+            u = !n && o || !e.At || !e.At(s, l);
         } 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
@@ -2081,62 +2096,69 @@ function recompute(e, t = false) {
         // gate: the explicit recompute(node, true) inside effect() does not enqueue, so
         // effect() can call its runner synchronously for the first run.
                 if (n && u) {
-            e.Fe = !e.me;
+            e.Fe = !e.De;
             // Reuse one bound runner per effect — runEffect no-ops on a stale
             // `_modified`, so re-enqueueing the same function is harmless.
-                        if (!t) e.Ze.enqueue(n, e.Pt ??= GlobalQueue.ee.bind(null, e));
+                        if (!t) e.Be.enqueue(n, e.Pt ??= GlobalQueue.J.bind(null, e));
         }
-        if (e.me) ; else if (u) {
+        if (e.De) ; else if (u) {
             const o = i ? e.A : undefined;
-            if (t || n && activeTransition !== e.T || r) {
-                e.xe = l;
+            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.T || activeTransition === null) || r) {
+                e.ke = l;
                 // 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 (i && r) {
                     e.A = l === undefined ? OVERRIDE_UNDEFINED : l;
-                    e.V = NOT_PENDING;
+                    e.U = NOT_PENDING;
                 }
             } else {
-                e.V = l;
+                e.U = l;
                 // 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.T) && GlobalQueue.le !== null) GlobalQueue.le(e, l);
+                                if ((activeTransition || e.T) && GlobalQueue.ue !== null) GlobalQueue.ue(e, l);
             }
-            if (!i || r || e.A !== o) insertSubs(e, r || i);
+            // insertSubs only walks _subs (no scheduling of its own), so a
+            // subscriber-less node has nothing to notify.
+                        if (e.G !== null && (!i || r || e.A !== o)) insertSubs(e, r || i);
         } else if (i) {
             // 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.V === NOT_PENDING) queuePendingNode(e);
-            e.V = l;
-        } else if (e.ze != c) {
-            for (let t = e.k; t !== null; t = t.Ge) {
-                insertIntoHeapHeight(t.Ue, queueFor(t.Ue));
+            if (e.U === NOT_PENDING) queuePendingNode(e);
+            e.U = l;
+        } else if (e.Xe != a) {
+            for (let t = e.G; t !== null; t = t.ve) {
+                insertIntoHeapHeight(t.Ve, queueFor(t.Ve));
             }
         }
     }
     currentOptimisticLane = f;
-    const T = e.V !== NOT_PENDING || e.Me !== null || e.He !== null || (e.We & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
+    const T = e.U !== NOT_PENDING || e.Qe !== null || e.He !== null || (e.xe & (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.We & STATUS_PENDING) && (!e.T || i) && queuePendingNode(e);
+        T && (!t || e.xe & STATUS_PENDING) && (!e.T || i) && queuePendingNode(e);
     e.T && n && activeTransition !== e.T && runInTransition(e.T, () => recompute(e));
 }
 
 function updateIfNecessary(e) {
     if (e.Le & REACTIVE_CHECK) {
-        for (let t = e.Ke; t; t = t.Ye) {
-            const n = t.qe;
-            const r = n.Be || n;
-            if (r.Ve) {
+        for (let t = e.je; t; t = t.Ke) {
+            const n = t.Ye;
+            const r = n.qe || n;
+            if (r.Ue) {
                 updateIfNecessary(r);
             }
             if (e.Le & REACTIVE_DIRTY) {
@@ -2144,7 +2166,7 @@ function updateIfNecessary(e) {
             }
         }
     }
-    if (e.Le & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.me && e.M < clock && !e.lt) {
+    if (e.Le & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e.De && e.F < clock && !e.ut) {
         recompute(e);
     }
     e.Le = e.Le & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
@@ -2154,37 +2176,37 @@ function computed(e, t) {
     const n = t?.transparent ?? false;
     const r = {
         id: inheritId(t, n, context),
-        ke: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.gt ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        ht: t?.equals != null ? t.equals : isEqual,
+        Ge: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.Ct ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        At: t?.equals != null ? t.equals : isEqual,
         W: t?.unobserved,
-        St: null,
-        Ze: context?.Ze ?? globalQueue,
+        Et: null,
+        Be: context?.Be ?? globalQueue,
         dt: context?.dt ?? defaultContext,
-        ct: 0,
-        Ve: e,
-        xe: undefined,
-        ze: 0,
-        rt: null,
-        nt: undefined,
-        tt: null,
-        Ke: null,
-        ut: null,
-        It: 0,
-        k: null,
-        _t: null,
-        Z: context,
+        lt: 0,
+        Ue: e,
+        ke: undefined,
+        Xe: 0,
+        nt: null,
+        tt: undefined,
+        et: null,
+        je: null,
         st: null,
-        ft: null,
+        Rt: 0,
+        G: null,
+        Tt: null,
+        B: context,
         ot: null,
+        ct: null,
+        it: null,
         Le: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
-        We: STATUS_UNINITIALIZED,
-        M: clock,
-        V: NOT_PENDING,
+        xe: STATUS_UNINITIALIZED,
+        F: clock,
+        U: NOT_PENDING,
         He: null,
-        Me: null,
-        lt: null,
+        Qe: null,
+        ut: null,
         T: null,
-        Nt: false
+        ht: false
     };
     setupComputedNode(r, t);
     return r;
@@ -2199,44 +2221,44 @@ function computed(e, t) {
     const s = o?.transparent ?? false;
     const u = {
         id: inheritId(o, s, context),
-        ke: (s ? CONFIG_TRANSPARENT : 0) | (o?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (o?.sync ? CONFIG_SYNC : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        ht: false,
+        Ge: (s ? CONFIG_TRANSPARENT : 0) | (o?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (o?.sync ? CONFIG_SYNC : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        At: false,
         W: o?.unobserved,
-        St: null,
-        Ze: context?.Ze ?? globalQueue,
+        Et: null,
+        Be: context?.Be ?? globalQueue,
         dt: context?.dt ?? defaultContext,
-        ct: 0,
-        Ve: e,
-        xe: undefined,
-        ze: 0,
-        rt: null,
-        nt: undefined,
-        tt: null,
-        Ke: null,
-        ut: null,
-        It: 0,
-        k: null,
-        _t: null,
-        Z: context,
+        lt: 0,
+        Ue: e,
+        ke: undefined,
+        Xe: 0,
+        nt: null,
+        tt: undefined,
+        et: null,
+        je: null,
         st: null,
-        ft: null,
+        Rt: 0,
+        G: null,
+        Tt: null,
+        B: context,
         ot: null,
+        ct: null,
+        it: null,
         Le: REACTIVE_LAZY,
-        We: STATUS_UNINITIALIZED,
-        M: clock,
-        V: NOT_PENDING,
+        xe: STATUS_UNINITIALIZED,
+        F: clock,
+        U: NOT_PENDING,
         He: null,
-        Me: null,
-        lt: null,
+        Qe: null,
+        ut: null,
         T: null,
-        Nt: false,
+        ht: false,
         Fe: false,
-        bt: undefined,
-        Dt: t,
-        vt: n,
-        Et: undefined,
-        Qe: r,
-        yt: i
+        gt: undefined,
+        bt: t,
+        Dt: n,
+        ft: undefined,
+        We: r,
+        Nt: i
     };
     setupComputedNode(u, lazyOptions);
     return u;
@@ -2247,24 +2269,24 @@ const lazyOptions = {
 };
 
 function setupComputedNode(e, t) {
-    e.tt = e;
-    const n = context?.Je ? context.et : context;
+    e.et = e;
+    const n = context?.ze ? context.Je : context;
     if (context) {
-        const t = context.ot;
+        const t = context.it;
         if (t === null) {
-            context.ot = e;
+            context.it = e;
         } else {
-            e.st = t;
-            t.ft = e;
-            context.ot = e;
+            e.ot = t;
+            t.ct = e;
+            context.it = e;
         }
     }
-    if (n) e.ze = n.ze + 1;
-    if (GlobalQueue.se !== null) GlobalQueue.se(e);
+    if (n) e.Xe = n.Xe + 1;
+    if (GlobalQueue.oe !== null) GlobalQueue.oe(e);
     !t?.lazy && recompute(e, true);
     if (snapshotCaptureActive && !t?.lazy) {
-        if (!(e.We & STATUS_PENDING) && !(e.ke & CONFIG_NO_SNAPSHOT)) {
-            e.we = e.xe === undefined ? NO_SNAPSHOT : e.xe;
+        if (!(e.xe & STATUS_PENDING) && !(e.Ge & CONFIG_NO_SNAPSHOT)) {
+            e.me = e.ke === undefined ? NO_SNAPSHOT : e.ke;
             snapshotSources.add(e);
         }
     }
@@ -2272,20 +2294,20 @@ function setupComputedNode(e, t) {
 
 function signal(e, t, n = null) {
     const r = {
-        ht: t?.equals != null ? t.equals : isEqual,
-        ke: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.gt ? CONFIG_NO_SNAPSHOT : 0),
+        At: t?.equals != null ? t.equals : isEqual,
+        Ge: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.Ct ? CONFIG_NO_SNAPSHOT : 0),
         W: t?.unobserved,
-        xe: e,
-        k: null,
-        _t: null,
-        M: clock,
-        Be: n,
-        it: n?.rt || null,
-        V: NOT_PENDING
+        ke: e,
+        G: null,
+        Tt: null,
+        F: clock,
+        qe: n,
+        rt: n?.nt || null,
+        U: NOT_PENDING
     };
-    n && (n.rt = r);
-    if (snapshotCaptureActive && !(r.ke & CONFIG_NO_SNAPSHOT) && !((n?.We ?? 0) & STATUS_PENDING)) {
-        r.we = e === undefined ? NO_SNAPSHOT : e;
+    n && (n.nt = r);
+    if (snapshotCaptureActive && !(r.Ge & CONFIG_NO_SNAPSHOT) && !((n?.xe ?? 0) & STATUS_PENDING)) {
+        r.me = e === undefined ? NO_SNAPSHOT : e;
         snapshotSources.add(r);
     }
     return r;
@@ -2329,11 +2351,11 @@ function isEqual(e, t) {
  * );
  * ```
  */ function untrack(e, t) {
-    if (GlobalQueue.ue === null && !tracking && true) return e();
+    if (GlobalQueue.se === null && !tracking && true) return e();
     const n = tracking;
     tracking = false;
     try {
-        if (GlobalQueue.ue !== null) return GlobalQueue.ue(e);
+        if (GlobalQueue.se !== null) return GlobalQueue.se(e);
         return e();
     } finally {
         tracking = n;
@@ -2355,76 +2377,97 @@ function isEqual(e, t) {
     }
 }
 
+/**
+ * Sentinel returned by readNodeFast when the plain-signal fast path does not
+ * apply and the caller must fall back to the full read().
+ */ const READ_SLOW = Symbol("read-slow");
+
+/**
+ * read()'s plain-signal fast path as a standalone entry for hot callers
+ * (store traps). Safe to substitute for read() only because the bail
+ * conditions mirror read()'s prelude and fast-path guard exactly: the
+ * latestRead and pendingCheck windows run side-effectful hooks before the
+ * fast path, `_fn` nodes need prepareComputed, and firewall / override /
+ * snapshot / transition / lane / dev-strictRead state all take the full
+ * resolution. Anything slow returns READ_SLOW; the caller then calls read().
+ */ function readNodeFast(e) {
+    if (latestReadActive || pendingCheckActive || e.Ue || e.qe || e.A !== undefined || e.me !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
+    let t = context;
+    if (t?.ze) t = t.Je;
+    if (t && tracking) link(e, t);
+    return !t || e.U === NOT_PENDING ? e.ke : e.U;
+}
+
 function read(e) {
     // Handle latest() mode: read from _latestValueComputed
     // Checked before isPending so that isPending(() => latest(x)) checks
     // the _pendingSignal of _latestValueComputed (async in flight) rather
     // than the original node (which stays "pending" while held in a transition).
-    if (latestReadActive) return GlobalQueue.Ee(e);
+    if (latestReadActive) return GlobalQueue.fe(e);
     let t = context;
-    if (t?.Je) t = t.et;
+    if (t?.ze) t = t.Je;
     const n = e;
-    const r = e.Be;
+    const r = e.qe;
     const i = r || 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.Se(e, t, i, r);
-    } else if (typeof n.Ve === "function") {
+        GlobalQueue.Ee(e, t, i, r);
+    } else if (typeof n.Ue === "function") {
         prepareComputed(e, false);
     }
-    if (!n.Ve && i === e && e.A === undefined && e.we === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
+    if (!n.Ue && i === e && e.A === undefined && e.me === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
         if (t && tracking) link(e, t);
-        return !t || e.V === NOT_PENDING ? e.xe : e.V;
+        return !t || e.U === NOT_PENDING ? e.ke : e.U;
     }
     if (t && tracking) {
         link(e, t, pendingCheckActive);
-        if (i.Ve) {
+        if (i.Ue) {
             const n = queueFor(e);
-            if (i.ze >= n.C) {
+            if (i.Xe >= n.P) {
                 markNode(t);
                 markHeap(n);
                 updateIfNecessary(i);
             }
-            const r = i.ze;
+            const r = i.Xe;
             // parent check is shallow, might need to be recursive
-                        if (r >= t.ze && e.Z !== t) {
-                t.ze = r + 1;
+                        if (r >= t.Xe && e.B !== t) {
+                t.Xe = r + 1;
             }
         }
     }
-    if (i.We & STATUS_PENDING) {
+    if (i.xe & STATUS_PENDING) {
         if (t && !(stale && i.T && activeTransition !== i.T)) {
             // 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.ye(i)) {
+            if (currentOptimisticLane === null || GlobalQueue.Ne(i)) {
                 if (!tracking && e !== t) link(e, t);
-                throw i.me;
+                throw i.De;
             }
-        } else if (t && i !== e && i.We & STATUS_UNINITIALIZED) {
+        } else if (t && i !== e && i.xe & STATUS_UNINITIALIZED) {
             if (!tracking && e !== t) link(e, t);
-            throw i.me;
-        } else if (!t && i.We & STATUS_UNINITIALIZED) {
-            throw i.me;
+            throw i.De;
+        } else if (!t && i.xe & STATUS_UNINITIALIZED) {
+            throw i.De;
         }
     }
-    if (e.Ve && e.We & STATUS_ERROR) {
+    if (e.Ue && e.xe & 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.M < clock) {
+        if (tracking && !pendingCheckActive && e.F < clock) {
             recompute(e);
             return read(e);
-        } else throw e.me;
+        } else throw e.De;
     }
-    if (snapshotCaptureActive && t && t.ke & CONFIG_IN_SNAPSHOT_SCOPE) {
-        const n = e.we;
+    if (snapshotCaptureActive && t && t.Ge & CONFIG_IN_SNAPSHOT_SCOPE) {
+        const n = e.me;
         if (n !== undefined) {
             const r = n === NO_SNAPSHOT ? undefined : n;
-            const i = e.V !== NOT_PENDING ? e.V : e.xe;
+            const i = e.U !== NOT_PENDING ? e.U : e.ke;
             if (i !== r) t.Le |= REACTIVE_SNAPSHOT_STALE;
             return r;
         }
@@ -2440,18 +2483,18 @@ 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.Ne(e, i, t)) {
-        return e.xe;
+        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.he(e, i, t)) {
+        return e.ke;
     }
     // 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 o = !t || currentOptimisticLane !== null && GlobalQueue.Ce(e, i, t) || e.V === NOT_PENDING || stale && e.T && activeTransition !== e.T ? e.xe : e.V;
+        const o = !t || currentOptimisticLane !== null && GlobalQueue.ye(e, i, t) || e.U === NOT_PENDING || stale && e.T && activeTransition !== e.T ? e.ke : e.U;
     // 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.de(e, o);
-    if (!t && i === e && typeof n.Ve === "function" && e.ke & CONFIG_AUTO_DISPOSE && !(i.We & STATUS_PENDING) && !e.k) {
+    if (!t && i === e && typeof n.Ue === "function" && e.Ge & CONFIG_AUTO_DISPOSE && !(i.xe & STATUS_PENDING) && !e.G) {
         unobserved(e);
     }
     return o;
@@ -2463,17 +2506,20 @@ function setSignal(e, t) {
     // optimisticComputed callers and optimistic store nodes carry an
     // _overrideValue slot, and every module that creates one installs the
     // engine first.
-        if (e.A !== undefined && !projectionWriteActive) return GlobalQueue.Oe(e, t);
-    const n = e.V === NOT_PENDING ? e.xe : e.V;
+        if (e.A !== undefined && !projectionWriteActive) return GlobalQueue._e(e, t);
+    const n = e.U === NOT_PENDING ? e.ke : e.U;
     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 r = !!(e.We & STATUS_UNINITIALIZED) || !e.ht || !e.ht(n, t);
+        const r = !!(e.xe & STATUS_UNINITIALIZED) || !e.At || !e.At(n, t);
     if (!r) return t;
-    if (e.V === NOT_PENDING) queuePendingNode(e);
-    e.V = t;
-    GlobalQueue.le !== null && GlobalQueue.le(e, t);
-    e.M = clock;
+    if (e.U === NOT_PENDING) queuePendingNode(e);
+    e.U = 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._ !== undefined || e.p !== undefined) && GlobalQueue.ue !== null && GlobalQueue.ue(e, t);
+    e.F = clock;
     insertSubs(e);
     schedule();
     return t;
@@ -2487,7 +2533,7 @@ function setSignal(e, t) {
  * cleanup point.
  */ function suppressComputedRecompute(e) {
     deleteFromHeap(e, queueFor(e));
-    if (!(e.Le & REACTIVE_MANUAL_WRITE) && e.V === NOT_PENDING) {
+    if (!(e.Le & REACTIVE_MANUAL_WRITE) && e.U === NOT_PENDING) {
         queuePendingNode(e);
         schedule();
     }
@@ -2570,7 +2616,7 @@ function staleValues(e, t = true) {
     if (!t) {
         return;
     }
-    if (typeof t.Ve === "function" && !(t.Le & (REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE))) {
+    if (typeof t.Ue === "function" && !(t.Le & (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
@@ -2630,11 +2676,11 @@ function wireExternalSource(e) {
         equals: false,
         ownedWrite: true
     });
-    const n = externalSourceConfig.factory(e.Ve, () => {
+    const n = externalSourceConfig.factory(e.Ue, () => {
         setSignal(t, undefined);
     });
     cleanup(() => n.dispose());
-    e.Ve = e => {
+    e.Ue = e => {
         read(t);
         return n.track(e);
     };
@@ -2648,8 +2694,8 @@ function externalUntrack(e) {
 // removed on reset) so core's null checks stay equivalent to the old
 // `externalSourceConfig` truthiness checks.
 function syncExternalHooks() {
-    GlobalQueue.se = externalSourceConfig ? wireExternalSource : null;
-    GlobalQueue.ue = externalSourceConfig ? externalUntrack : null;
+    GlobalQueue.oe = externalSourceConfig ? wireExternalSource : null;
+    GlobalQueue.se = externalSourceConfig ? externalUntrack : null;
 }
 
 function enableExternalSource(e) {
@@ -2756,9 +2802,9 @@ function isUndefined(e) {
  */
 /** The optimistic half of setSignal, fired when `_overrideValue !== undefined`. */ function optimisticWrite(e, t) {
     const n = e.A !== NOT_PENDING;
-    const r = n ? unwrapOverride(e.A) : e.xe;
+    const r = n ? unwrapOverride(e.A) : e.ke;
     if (typeof t === "function") t = t(r);
-    const i = !!(e.We & STATUS_UNINITIALIZED) || !e.ht || !e.ht(r, t);
+    const i = !!(e.xe & STATUS_UNINITIALIZED) || !e.At || !e.At(r, t);
     if (!i) {
         // Same-value write with an active override still entangles the current
         // action's transition — the hold must outlast all overlapping actions.
@@ -2772,7 +2818,7 @@ function isUndefined(e) {
     // No revert target is stashed: while the override is active every reader
     // sees it (A17), so authoritative arrivals commit silently into _value and
     // reverting is just dropping the override — _value is already correct.
-     else globalQueue.D.G.push(e);
+     else globalQueue.D.v.push(e);
     // Stamp ownership on the node (post-merge, so entangled writers share the
     // joint root). resolveTransition prefers this over the lane's _transition,
     // which a shared subscriber can merge across transactions (#2912).
@@ -2783,8 +2829,10 @@ function isUndefined(e) {
     // brand, and erasing it makes the write invisible and routes follow-up
     // writes off the optimistic path into permanent commits (#2898).
         e.A = t === undefined ? OVERRIDE_UNDEFINED : t;
-    GlobalQueue.le !== null && GlobalQueue.le(e, t);
-    e.M = clock;
+    // syncCompanions only pokes _pendingSignal/_latestValueComputed — with
+    // neither companion present the call is a guaranteed no-op.
+        (e._ !== undefined || e.p !== undefined) && GlobalQueue.ue !== null && GlobalQueue.ue(e, t);
+    e.F = clock;
     insertSubs(e, true);
     schedule();
     return t;
@@ -2795,9 +2843,9 @@ function isUndefined(e) {
  * while one of its optimistic nodes holds an active override that is still
  * pending on real (non-affects-sentinel) async.
  */ function transitionBlocked(e) {
-    for (let t = 0; t < e.G.length; t++) {
-        const n = e.G[t];
-        if (hasActiveOverride(n) && "We" in n && n.We & STATUS_PENDING && n.me instanceof NotReadyError) {
+    for (let t = 0; t < e.v.length; t++) {
+        const n = e.v[t];
+        if (hasActiveOverride(n) && "xe" in n && n.xe & STATUS_PENDING && n.De instanceof NotReadyError) {
             return true;
         }
     }
@@ -2815,10 +2863,10 @@ function resolveOptimisticNodes(e) {
         // Revert is a pure drop: there is no revert target to commit —
         // override-covered authoritative values hold in _pendingValue and
         // elevate on their OWN transition's schedule (A18 as re-ruled 2026-07-07).
-                if (!(t.We & STATUS_PENDING)) t.We &= ~STATUS_UNINITIALIZED;
+                if (!(t.xe & STATUS_PENDING)) t.xe &= ~STATUS_UNINITIALIZED;
         const r = t.A;
         t.A = NOT_PENDING;
-        if (r !== NOT_PENDING && t.xe !== unwrapOverride(r)) insertSubs(t, true);
+        if (r !== NOT_PENDING && t.ke !== unwrapOverride(r)) insertSubs(t, true);
         t.T = null;
         t.R = null;
     }
@@ -2827,9 +2875,9 @@ function resolveOptimisticNodes(e) {
     // transition that produced them (A19 — pending is a property of the data).
         for (let n = 0; n < t; n++) {
         const t = e[n];
-        if (t.p || t.O) GlobalQueue.fe(t);
+        if (t._ || t.p) GlobalQueue.ce(t);
         const r = t.t;
-        if (r && (r.p === t || r.O === t)) GlobalQueue.fe(r);
+        if (r && (r._ === t || r.p === t)) GlobalQueue.ce(r);
     }
     e.splice(0, t);
 }
@@ -2882,10 +2930,10 @@ function cleanupCompletedLanes(e) {
  * that reads a pending mid-transition write sees the committed value; the sub
  * is recorded for replay at commit.
  */ function gatedRead(e, t, n) {
-    if (latestReadActive || e.V === NOT_PENDING || e.Ve || t !== e && !(t.Le & REACTIVE_MANUAL_WRITE)) {
+    if (latestReadActive || e.U === NOT_PENDING || e.Ue || t !== e && !(t.Le & REACTIVE_MANUAL_WRITE)) {
         return false;
     }
-    activeTransition.q.add(n);
+    activeTransition.Y.add(n);
     return true;
 }
 
@@ -2893,7 +2941,7 @@ function cleanupCompletedLanes(e) {
  * read()'s value selection under a lane: return the committed `_value` for
  * optimistic/lane-assigned signals, stale-mode reads, and pending owners.
  */ function laneReadsCommitted(e, t, n) {
-    return e.A !== undefined || !!e.i || t === e && stale && n.t !== e || !!(t.We & STATUS_PENDING);
+    return e.A !== undefined || !!e.i || t === e && stale && n.t !== e || !!(t.xe & STATUS_PENDING);
 }
 
 /**
@@ -2902,8 +2950,8 @@ function cleanupCompletedLanes(e) {
  * can run before its OPT-dirty child propagates).
  */ function recomputeLane(e, t) {
     if (t) return resolveLane(e) ?? null;
-    for (let t = e.Ke; t; t = t.Ye) {
-        const n = t.qe;
+    for (let t = e.je; t; t = t.Ke) {
+        const n = t.Ye;
         if (n.Le & REACTIVE_OPTIMISTIC_DIRTY) {
             const t = resolveLane(n);
             if (t) {
@@ -2921,7 +2969,7 @@ function cleanupCompletedLanes(e) {
     if (t.o !== e) {
         t.u.add(e);
         e.i = t;
-        GlobalQueue.ce !== null && GlobalQueue.ce(t.o);
+        GlobalQueue.le !== null && GlobalQueue.le(t.o);
     }
 }
 
@@ -2929,13 +2977,13 @@ function cleanupCompletedLanes(e) {
     const t = resolveLane(e);
     if (t) {
         t.u.delete(e);
-        GlobalQueue.ce !== null && GlobalQueue.ce(t.o);
+        GlobalQueue.le !== null && GlobalQueue.le(t.o);
     }
 }
 
 function trackOptimisticStore(e) {
     // After initTransition, globalQueue._batch IS activeTransition (same reference)
-    globalQueue.D.U.add(e);
+    globalQueue.D.V.add(e);
     schedule();
 }
 
@@ -2944,19 +2992,19 @@ function trackOptimisticStore(e) {
  * create optimistic state (verdict.ts at module top level, createOptimistic
  * and createOptimisticStore at first call) BEFORE any optimistic node exists.
  */ function installOptimisticEngine() {
-    if (GlobalQueue.Oe !== null) return;
-    GlobalQueue.Oe = optimisticWrite;
-    GlobalQueue.Re = resolveOptimisticNodes;
-    GlobalQueue.Ie = transitionBlocked;
-    GlobalQueue.Ae = cleanupCompletedLanes;
-    GlobalQueue.he = runLaneEffects;
-    GlobalQueue.Ne = gatedRead;
-    GlobalQueue.ye = laneSuspends;
-    GlobalQueue.Ce = laneReadsCommitted;
+    if (GlobalQueue._e !== null) return;
+    GlobalQueue._e = optimisticWrite;
+    GlobalQueue.pe = resolveOptimisticNodes;
+    GlobalQueue.Re = transitionBlocked;
+    GlobalQueue.Ie = cleanupCompletedLanes;
+    GlobalQueue.Ae = runLaneEffects;
+    GlobalQueue.he = gatedRead;
+    GlobalQueue.Ne = laneSuspends;
+    GlobalQueue.ye = laneReadsCommitted;
     GlobalQueue.Pe = recomputeLane;
-    GlobalQueue.ge = laneAsyncPending;
-    GlobalQueue.be = laneAsyncSettled;
-    GlobalQueue.De = trackOptimisticStore;
+    GlobalQueue.Ce = laneAsyncPending;
+    GlobalQueue.ge = laneAsyncSettled;
+    GlobalQueue.be = trackOptimisticStore;
 }
 
 /**
@@ -2975,21 +3023,21 @@ let pendingProbe = null;
  * Get or create the pending signal for a node (lazy).
  * Used by isPending() to track pending state reactively.
  */ function getPendingSignal(e) {
-    if (!e.p) {
+    if (!e._) {
         // Start false, write true if pending - ensures reversion returns to false
-        e.p = optimisticSignal(false, {
+        e._ = optimisticSignal(false, {
             ownedWrite: true
         });
-        e.p.t = e;
-        if (computePendingState(e)) setSignal(e.p, true);
+        e._.t = e;
+        if (computePendingState(e)) setSignal(e._, true);
     }
-    return e.p;
+    return e._;
 }
 
 function collectPendingSources(e) {
     if (!pendingProbe) return;
     pendingProbe.sources.add(e);
-    const t = e.Be || e;
+    const t = e.qe || e;
     if (t !== e) pendingProbe.sources.add(t);
 }
 
@@ -3013,26 +3061,26 @@ function collectPendingSources(e) {
  * (`_pendingObserver`) are skipped so an `isPending` wrapper memo never
  * inherits the coverage it reports on.
  */ function markWalk(e, t) {
-    if (e.F) return true;
+    if (e.k) return true;
     // A real error outranks an inherited mark (A16/A24c): an errored node
     // answers probes with its error, not a coverage verdict, and coverage does
     // not flow through it — matching the rails' behavior, where propagation
     // stopped at errored nodes. A DIRECT mark on an errored node still reads
     // pending (the count check above), also matching.
-        if (e.We & STATUS_ERROR) return false;
+        if (e.xe & STATUS_ERROR) return false;
     if (t.has(e)) return false;
     t.add(e);
-    const n = e.Be;
+    const n = e.qe;
     if (n && markWalk(n, t)) return true;
     // Mid-recompute (the clearStatus companion poke runs before
     // trimStaleDeps), only the validated prefix [_deps.._depsTail] is this
     // pass's dependency set — walking past it would read dropped deps and
     // latch a stale verdict on the companion.
         const r = e;
-    const i = r.Le & REACTIVE_RECOMPUTING_DEPS ? r.ut : undefined;
+    const i = r.Le & REACTIVE_RECOMPUTING_DEPS ? r.st : undefined;
     if (i !== null) {
-        for (let e = r.Ke ?? null; e !== null; e = e.Ye) {
-            if (!e.Ot && markWalk(e.qe, t)) return true;
+        for (let e = r.je ?? null; e !== null; e = e.Ke) {
+            if (!e.Ot && markWalk(e.Ye, t)) return true;
             if (e === i) break;
         }
     }
@@ -3045,14 +3093,14 @@ function collectPendingSources(e) {
 
 function quietPending(e) {
     if (e.$e) {
-        for (const t of e.$e) if (!t.Nt) return false;
+        for (const t of e.$e) if (!t.ht) return false;
         return true;
     }
-    return e.Nt;
+    return e.ht;
 }
 
 function newQuestionInFlight(e) {
-    return !!(e.We & STATUS_PENDING) && !(e.We & STATUS_UNINITIALIZED) && !quietPending(e);
+    return !!(e.xe & STATUS_PENDING) && !(e.xe & STATUS_UNINITIALIZED) && !quietPending(e);
 }
 
 function computePendingState(e) {
@@ -3062,37 +3110,37 @@ function computePendingState(e) {
     // reaches its owner (and a store leaf its firewall) through its own deps,
     // so the one walk covers direct marks, derivation, and companion chains.
         if (markCovered(e)) return true;
-    const n = e.Be;
+    const n = e.qe;
     if (e.t) {
         const t = e.t;
-        const n = t.Be || t;
+        const n = t.qe || t;
         return newQuestionInFlight(n);
     }
-    if (n && e.V !== NOT_PENDING && !hasActiveOverride(e)) {
-        return !!(n.Le & REACTIVE_MANUAL_WRITE) || !n.lt && !(n.We & STATUS_PENDING) || !!(n.We & STATUS_PENDING) && quietPending(n);
+    if (n && e.U !== NOT_PENDING && !hasActiveOverride(e)) {
+        return !!(n.Le & REACTIVE_MANUAL_WRITE) || !n.ut && !(n.xe & STATUS_PENDING) || !!(n.xe & STATUS_PENDING) && quietPending(n);
     }
-    if (e.V !== NOT_PENDING && !(t.We & STATUS_UNINITIALIZED)) {
-        if (hasActiveOverride(e)) return !e.ht || !e.ht(e.V, unwrapOverride(e.A));
+    if (e.U !== NOT_PENDING && !(t.xe & STATUS_UNINITIALIZED)) {
+        if (hasActiveOverride(e)) return !e.At || !e.At(e.U, unwrapOverride(e.A));
         return true;
     }
     return newQuestionInFlight(t);
 }
 
 function syncCompanions(e, t) {
-    if (e.p) updatePendingSignal(e);
-    if (e.O) setSignal(e.O, t);
+    if (e._) updatePendingSignal(e);
+    if (e.p) setSignal(e.p, t);
 }
 
 function updatePendingSignal(e) {
-    if (e.p) {
-        setSignal(e.p, computePendingState(e));
+    if (e._) {
+        setSignal(e._, computePendingState(e));
     }
-    if (e.O) updatePendingSignal(e.O);
+    if (e.p) updatePendingSignal(e.p);
 }
 
 function updateChildCompanions(e) {
-    for (let t = e.rt; t !== null; t = t.it) {
-        if (t.p || t.O) updatePendingSignal(t);
+    for (let t = e.nt; t !== null; t = t.rt) {
+        if (t._ || t.p) updatePendingSignal(t);
     }
 }
 
@@ -3110,9 +3158,9 @@ function updateChildCompanions(e) {
     const visit = e => {
         if (r.has(e)) return;
         r.add(e);
-        if (e.p || e.O) n(e);
-        for (let t = e.k; t !== null; t = t.Ge) visit(t.Ue);
-        for (let t = e.rt ?? null; t !== null; t = t.it) {
+        if (e._ || e.p) n(e);
+        for (let t = e.G; t !== null; t = t.ve) visit(t.Ve);
+        for (let t = e.nt ?? null; t !== null; t = t.rt) {
             visit(t);
         }
     };
@@ -3120,20 +3168,20 @@ function updateChildCompanions(e) {
 }
 
 function snapCompanionsToState(e) {
-    const t = e.p;
+    const t = e._;
     if (t && (t.A === undefined || t.A === NOT_PENDING)) {
         const n = computePendingState(e);
-        if (t.xe !== n || t.V !== NOT_PENDING) {
-            t.xe = n;
-            t.V = NOT_PENDING;
-            t.M = clock;
+        if (t.ke !== n || t.U !== NOT_PENDING) {
+            t.ke = n;
+            t.U = NOT_PENDING;
+            t.F = clock;
             insertSubs(t);
             schedule();
         }
     }
-    const n = e.O;
+    const n = e.p;
     if (n && !(n.Le & REACTIVE_DISPOSED)) {
-        if ((n.A === undefined || n.A === NOT_PENDING) && n.V === NOT_PENDING && !Object.is(n.xe, e.xe) && !(n.Le & (REACTIVE_DIRTY | REACTIVE_CHECK))) {
+        if ((n.A === undefined || n.A === NOT_PENDING) && n.U === NOT_PENDING && !Object.is(n.ke, e.ke) && !(n.Le & (REACTIVE_DIRTY | REACTIVE_CHECK))) {
             n.Le |= REACTIVE_DIRTY;
             insertIntoHeap(n, queueFor(n));
             insertSubs(n);
@@ -3144,7 +3192,7 @@ function snapCompanionsToState(e) {
 }
 
 function getLatestValueComputed(e) {
-    if (!e.O) {
+    if (!e.p) {
         const t = latestReadActive;
         setLatestReadActive(false);
         const n = pendingCheckActive;
@@ -3152,21 +3200,21 @@ function getLatestValueComputed(e) {
         const r = context;
         setContextInternal(null);
  // Detach from owner so it isn't disposed with effects
-                e.O = optimisticComputed(() => read(e));
-        e.O.t = e;
+                e.p = optimisticComputed(() => read(e));
+        e.p.t = e;
  // Parent-child lane relationship
                 setContextInternal(r);
         setPendingCheckActive(n);
         setLatestReadActive(t);
     }
-    return e.O;
+    return e.p;
 }
 
 /** The latest()-mode read path, installed as GlobalQueue._latestRead. */ function latestRead(e) {
     const t = getLatestValueComputed(e);
     const n = latestReadActive;
     setLatestReadActive(false);
-    const r = e.A !== undefined && e.A !== NOT_PENDING ? unwrapOverride(e.A) : e.xe;
+    const r = e.A !== undefined && e.A !== NOT_PENDING ? unwrapOverride(e.A) : e.ke;
     let i;
     try {
         // An untracked latest() read has no reading context, so read() never
@@ -3175,18 +3223,18 @@ function getLatestValueComputed(e) {
         // until the flush (#2922). Mirror the tracked-read pull here: mark the
         // queued staleness through the graph, then bring the shadow up to date.
         const e = queueFor(t);
-        if (t.ze >= e.C && !(t.Le & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE))) {
+        if (t.Xe >= e.P && !(t.Le & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE))) {
             markHeap(e);
             prepareComputed(t, true);
         }
         i = read(t);
     } catch (t) {
-        if (t instanceof NotReadyError && (!context || !(e.We & STATUS_UNINITIALIZED))) return r;
+        if (t instanceof NotReadyError && (!context || !(e.xe & STATUS_UNINITIALIZED))) return r;
         throw t;
     } finally {
         setLatestReadActive(n);
     }
-    if (t.We & STATUS_PENDING) return r;
+    if (t.xe & STATUS_PENDING) return r;
     if (stale && currentOptimisticLane && t.i) {
         const e = findLane(t.i);
         const n = findLane(currentOptimisticLane);
@@ -3198,18 +3246,18 @@ function getLatestValueComputed(e) {
     // speculative value in _pendingValue; a contextless read() only surfaces
     // _value. Overrides stay authoritative (A17), and stale readers keep the
     // other transition's committed view, matching read()'s own selection.
-        if (t.V !== NOT_PENDING && !hasActiveOverride(t) && !(stale && t.T && activeTransition !== t.T)) return t.V;
+        if (t.U !== NOT_PENDING && !hasActiveOverride(t) && !(stale && t.T && activeTransition !== t.T)) return t.U;
     return i;
 }
 
 /** The isPending()-probe read path, installed as GlobalQueue._pendingCheck. */ function pendingCheckRead(e, t, n, r) {
     setPendingCheckActive(false);
-    if (typeof e.Ve === "function") prepareComputed(e, true);
-    const i = n.We;
+    if (typeof e.Ue === "function") prepareComputed(e, true);
+    const i = n.xe;
     if (t && i & STATUS_PENDING && i & STATUS_UNINITIALIZED) {
         if (tracking && e !== t) link(e, t);
         setPendingCheckActive(true);
-        throw n.me;
+        throw n.De;
     }
     collectPendingSources(e);
     if (r) collectPendingSources(r);
@@ -3217,14 +3265,14 @@ function getLatestValueComputed(e) {
 }
 
 function recordFreshRead(e, t) {
-    if (pendingProbe !== null && e.V !== NOT_PENDING && t === e.V) pendingProbe.freshReads.add(e);
+    if (pendingProbe !== null && e.U !== NOT_PENDING && t === e.U) pendingProbe.freshReads.add(e);
 }
 
 function applyReask(e, t) {
-    const n = !!(e.We & STATUS_PENDING);
-    const r = t && !(n && !e.Nt);
-    const i = n && e.Nt !== r;
-    e.Nt = r;
+    const n = !!(e.xe & STATUS_PENDING);
+    const r = t && !(n && !e.ht);
+    const i = n && e.ht !== r;
+    e.ht = r;
     return i;
 }
 
@@ -3264,7 +3312,7 @@ function isPending(e) {
     } catch (e) {
         collectPending();
         if (e instanceof NotReadyError) {
-            const t = !!(e.source?.We & STATUS_UNINITIALIZED);
+            const t = !!(e.source?.xe & STATUS_UNINITIALIZED);
             if (r.found && !t) return true;
             if (context && t) throw e;
         }
@@ -3278,25 +3326,25 @@ function isPending(e) {
 // Hook installation (same late-binding pattern as GlobalQueue._update /
 // _propagateAffects): core call sites fire these behind the same guards the
 // direct calls used, so behavior is identical once this module loads.
-GlobalQueue.le = syncCompanions;
+GlobalQueue.ue = syncCompanions;
 
-GlobalQueue.ce = updatePendingSignal;
+GlobalQueue.le = updatePendingSignal;
 
 GlobalQueue.ae = updateChildCompanions;
 
-GlobalQueue.fe = snapCompanionsToState;
+GlobalQueue.ce = snapCompanionsToState;
 
-GlobalQueue.Ee = latestRead;
+GlobalQueue.fe = latestRead;
 
-GlobalQueue.Se = pendingCheckRead;
+GlobalQueue.Ee = pendingCheckRead;
 
 GlobalQueue.de = recordFreshRead;
 
-GlobalQueue.Te = applyReask;
+GlobalQueue.Se = applyReask;
 
-GlobalQueue._e = repollDownstreamVerdicts;
+GlobalQueue.Te = repollDownstreamVerdicts;
 
-GlobalQueue.pe = witnessAffects;
+GlobalQueue.Oe = witnessAffects;
 
 /**
  * Effects are the leaf nodes of our reactive graph. When their sources change, they are
@@ -3306,16 +3354,16 @@ GlobalQueue.pe = witnessAffects;
     const i = !!r?.user;
     const o = createEffectNode(e, t, n, i ? EFFECT_USER : EFFECT_RENDER, notifyEffectStatus, r);
     recompute(o, true);
-    !r?.defer && (o.Qe === EFFECT_USER || r?.schedule ? o.Ze.enqueue(o.Qe, runEffect.bind(null, o)) : runEffect(o));
+    !r?.defer && (o.We === EFFECT_USER || r?.schedule ? o.Be.enqueue(o.We, runEffect.bind(null, o)) : runEffect(o));
 }
 
 function notifyEffectStatus(e, t) {
     // Use passed values if provided, otherwise read from node
-    const n = e !== undefined ? e : this.We;
-    const r = t !== undefined ? t : this.me;
+    const n = e !== undefined ? e : this.xe;
+    const r = t !== undefined ? t : this.De;
     if (n & STATUS_ERROR) {
-        this.Ze.notify(this, STATUS_PENDING, 0);
-        if (this.Qe === EFFECT_USER) {
+        this.Be.notify(this, STATUS_PENDING, 0);
+        if (this.We === EFFECT_USER) {
             // The error handler is the error arm of the effect phase (#2840 ruling):
             // queue it like the effect function. It runs in the same imperative,
             // writable scope, throws escalate the same way, and a held transition
@@ -3325,18 +3373,18 @@ function notifyEffectStatus(e, t) {
             // phase takes the success arm instead. Blocked forwards (explicit
             // `status` arg without node-state writes) don't queue: the status
             // re-propagates unblocked at commit.
-            if (this.We & STATUS_ERROR) {
+            if (this.xe & STATUS_ERROR) {
                 this.Fe = true;
-                this.Ze.enqueue(this.Qe, this.Pt ??= runEffect.bind(null, this));
+                this.Be.enqueue(this.We, this.Pt ??= runEffect.bind(null, this));
             }
             return;
         }
-        if (!this.Ze.notify(this, STATUS_ERROR, STATUS_ERROR)) {
+        if (!this.Be.notify(this, STATUS_ERROR, STATUS_ERROR)) {
             haltReactivity(unwrapStatusError(r));
             throw r;
         }
-    } else if (this.Qe === EFFECT_RENDER) {
-        this.Ze.notify(this, STATUS_PENDING | STATUS_ERROR, n, r);
+    } else if (this.We === EFFECT_RENDER) {
+        this.Be.notify(this, STATUS_PENDING | STATUS_ERROR, n, r);
     }
 }
 
@@ -3352,46 +3400,46 @@ function runEffect(e) {
     // Render effects bypass: their errors route to boundaries synchronously in
     // notifyEffectStatus, and a runner queued by an earlier valueChanged in the
     // same flush must not be hijacked by a later-arriving error status.
-        if (e.We & STATUS_ERROR && e.Qe === EFFECT_USER) {
-        const t = unwrapStatusError(e.me);
-        e.bt = e.xe;
+        if (e.xe & STATUS_ERROR && e.We === EFFECT_USER) {
+        const t = unwrapStatusError(e.De);
+        e.gt = e.ke;
         e.Fe = false;
         try {
-            e.vt ? e.vt(t, () => {
-                const t = e.Et;
-                e.Et = undefined;
+            e.Dt ? e.Dt(t, () => {
+                const t = e.ft;
+                e.ft = undefined;
                 t?.();
             }) : console.error(t);
         } catch (t) {
-            if (!e.Ze.notify(e, STATUS_ERROR, STATUS_ERROR)) {
+            if (!e.Be.notify(e, STATUS_ERROR, STATUS_ERROR)) {
                 haltReactivity(t);
                 throw t;
             }
         }
         return;
     }
-    const t = e.Et;
-    e.Et = undefined;
+    const t = e.ft;
+    e.ft = undefined;
     try {
         t?.();
-        const n = e.Dt(e.xe, e.bt);
+        const n = e.bt(e.ke, e.gt);
         if (false && n !== undefined && typeof n !== "function") ;
         // The final cleanup is invoked by disposeChildren at true disposal.
-                e.Et = n;
+                e.ft = n;
     } catch (t) {
-        e.me = new StatusError(e, t);
-        e.We |= STATUS_ERROR;
-        if (!e.Ze.notify(e, STATUS_ERROR, STATUS_ERROR)) {
+        e.De = new StatusError(e, t);
+        e.xe |= STATUS_ERROR;
+        if (!e.Be.notify(e, STATUS_ERROR, STATUS_ERROR)) {
             haltReactivity(t);
             throw t;
         }
     } finally {
-        e.bt = e.xe;
+        e.gt = e.ke;
         e.Fe = false;
     }
 }
 
-GlobalQueue.ee = runEffect;
+GlobalQueue.J = runEffect;
 
 /**
  * Internal tracked effect - bypasses heap, goes directly to effect queue.
@@ -3406,32 +3454,32 @@ GlobalQueue.ee = runEffect;
         } finally {}
     };
     const n = computed(() => {
-        const t = n.Et;
-        n.Et = undefined;
+        const t = n.ft;
+        n.ft = undefined;
         t?.();
         const r = staleValues(e);
-        n.Et = r;
+        n.ft = r;
     }, {
         ...t,
         lazy: true
     });
-    n.Et = undefined;
-    n.ke = n.ke & ~CONFIG_AUTO_DISPOSE | CONFIG_CHILDREN_FORBIDDEN;
+    n.ft = undefined;
+    n.Ge = n.Ge & ~CONFIG_AUTO_DISPOSE | CONFIG_CHILDREN_FORBIDDEN;
     n.Fe = true;
-    n.Qe = EFFECT_TRACKED;
-    n.yt = (e, t) => {
-        const r = e !== undefined ? e : n.We;
+    n.We = EFFECT_TRACKED;
+    n.Nt = (e, t) => {
+        const r = e !== undefined ? e : n.xe;
         if (r & STATUS_ERROR) {
-            n.Ze.notify(n, STATUS_PENDING, 0);
-            const e = t !== undefined ? t : n.me;
-            if (!n.Ze.notify(n, STATUS_ERROR, STATUS_ERROR)) {
+            n.Be.notify(n, STATUS_PENDING, 0);
+            const e = t !== undefined ? t : n.De;
+            if (!n.Be.notify(n, STATUS_ERROR, STATUS_ERROR)) {
                 haltReactivity(unwrapStatusError(e));
                 throw e;
             }
         }
     };
-    n.Xe = run;
-    n.Ze.enqueue(EFFECT_USER, run);
+    n.Ze = run;
+    n.Be.enqueue(EFFECT_USER, run);
 }
 
 function restoreTransition(e, t) {
@@ -3612,7 +3660,7 @@ function accessor(e) {
 function createSignal(e, t) {
     if (typeof e === "function") {
         const n = computed(e, t);
-        n.ke &= ~CONFIG_AUTO_DISPOSE;
+        n.Ge &= ~CONFIG_AUTO_DISPOSE;
         return [ accessor(n), setMemo.bind(null, n) ];
     }
     const n = signal(e, t);
@@ -3824,9 +3872,9 @@ function createEffect(e, t, n) {
             // route through the inherited queue.
             const i = getOwner();
             const o = new MicrotaskQueue;
-            o.Z = i.Ze;
+            o.B = i.Be;
  // notify() forwards up the normal chain
-                        i.Ze = o;
+                        i.Be = o;
             // A user effect rather than a bare computed: computeds are pull-based and
             // are only re-enqueued when a pending source *resolves* — a rejection just
             // marks them errored, so nothing would re-run and the promise would never
@@ -3853,7 +3901,7 @@ function createOptimistic(e, t) {
     installOptimisticEngine();
     if (typeof e === "function") {
         const n = optimisticComputed(e, t);
-        n.ke &= ~CONFIG_AUTO_DISPOSE;
+        n.Ge &= ~CONFIG_AUTO_DISPOSE;
         return [ accessor(n), setSignal.bind(null, n) ];
     }
     const n = optimisticSignal(e, t);
@@ -3942,7 +3990,7 @@ function createOptimistic(e, t) {
  *   on owner disposal
  */ function onSettled(e) {
     const t = getOwner();
-    t && !(t.ke & CONFIG_CHILDREN_FORBIDDEN) ? createTrackedEffect(() => untrack(e), undefined) : globalQueue.enqueue(EFFECT_USER, () => {
+    t && !(t.Ge & CONFIG_CHILDREN_FORBIDDEN) ? createTrackedEffect(() => untrack(e), undefined) : globalQueue.enqueue(EFFECT_USER, () => {
         // Unowned, out-of-band fire (no owner, or a children-forbidden one this
         // one-shot must not bind to): a returned cleanup has no lifecycle to
         // attach to. Reject it in dev; in production the return is simply
@@ -4046,28 +4094,68 @@ function keyedMatch(e, t, n) {
 // and `in` dependencies should follow the new value's membership. Use
 // membership rather than length arithmetic so sparse arrays and named array
 // props behave like normal property reads.
+// Inline key iteration on purpose: these loops run per array target per
+// reconcile pass, and a shared helper means a closure + per-key call in
+// instruction counts. String-only records (the common case) iterate in
+// place; symbol-bearing records take the nodeKeys array path.
 function syncArrayNodeMembership(e, t) {
     let n = e[STORE_NODE];
     if (n) {
-        const e = nodeKeys(n);
-        for (let r = 0, i = e.length; r < i; r++) {
-            const i = e[r];
-            i in t || setSignal(n[i], undefined);
+        if (symbolKeyedRecords.has(n)) {
+            const e = nodeKeys(n);
+            for (let r = 0, i = e.length; r < i; r++) {
+                e[r] in t || setSignal(n[e[r]], undefined);
+            }
+        } else {
+            for (const e in n) {
+                e in t || setSignal(n[e], undefined);
+            }
         }
     }
     if (n = e[STORE_HAS]) {
-        const e = nodeKeys(n);
-        for (let r = 0, i = e.length; r < i; r++) {
-            const i = e[r];
-            setSignal(n[i], i in t);
+        if (symbolKeyedRecords.has(n)) {
+            const e = nodeKeys(n);
+            for (let r = 0, i = e.length; r < i; r++) {
+                setSignal(n[e[r]], e[r] in t);
+            }
+        } else {
+            for (const e in n) {
+                setSignal(n[e], e in t);
+            }
         }
     }
 }
 
+// Recurse into a matched wrappable child pair without manufacturing a proxy:
+// resolve the child's target through the lookup and dispatch directly. A
+// lookup miss means the child was never observed — no proxy, no nodes, no
+// subscribers anywhere below — so the parent's swap making `next`
+// authoritative IS the whole update; a later read wraps next's child on
+// demand. This turns the diff from O(previous graph) into O(observed graph)
+// and drops the wrap()/$PROXY/$TARGET round-trip per visited child.
+// Wrap-family stores (projections/optimistic) own child proxy creation and
+// keep the proxy-based recursion.
+function applyStateChild(e, t, n, r) {
+    if (n[STORE_WRAP] !== undefined) {
+        applyState(e, wrap(t, n), r);
+        return;
+    }
+    const i = t[$TARGET] ?? storeLookup.get(t);
+    if (i === undefined) return;
+    e = unwrap(e);
+    if (i[STORE_SHALLOW]) {
+        applyStateShallow(e, i);
+    } else if (i[STORE_OVERRIDE] || i[STORE_OPTIMISTIC_OVERRIDE]) {
+        applyStateSlow(e, i, r);
+    } else {
+        applyStateFast(e, i, r);
+    }
+}
+
 // Reconcile a single array slot: recurse into a wrappable pair, otherwise replace
 // the node's value outright (covers object→primitive and primitive→object).
 function applyArrayItem(e, t, n, r, i) {
-    if (isWrappable(e) && isWrappable(t)) {
+    if (isWrappable(e) && isWrappable(t) && !(rawValuesUsed && (isRawValue(t) || isRawValue(e)))) {
         const o = wrap(t, n);
         r && setSignal(r, o);
         applyState(e, o, i);
@@ -4087,18 +4175,51 @@ function applyArrayItem(e, t, n, r, i) {
  * `$TRACK` absence (an enumeration-tracked record already diffs every key).
  */ function applyDescendants(e, t, n, r, i, o, s) {
     const u = n[STORE_LOOKUP] || storeLookup;
-    const l = (o ? getKeys(e, o) : Object.keys(e)).concat(getStoreSymbols(e, o));
-    for (let c = 0, a = l.length; c < a; c++) {
-        const a = l[c];
-        if (r?.[a]) continue;
+    if (o) {
+        const n = getKeys(e, o).concat(getStoreSymbols(e, o));
+        for (let l = 0, a = n.length; l < a; l++) {
+            const a = n[l];
+            if (r?.[a]) continue;
  // main loop already diffed this slot
-                const f = unwrap(o ? getOverrideValue(e, o, a, s) : e[a]);
-        if (!isWrappable(f)) continue;
-        const E = (u.get(f) ?? storeLookup.get(f))?.[$TARGET];
-        if (!E?.[STORE_DESC]) continue;
-        const S = unwrap(t[a]);
-        if (f === S || !isWrappable(S) || Array.isArray(f) !== Array.isArray(S) || i(f) != null && i(f) !== i(S)) continue;
-        applyState(S, wrap(f, n), i);
+                        const c = unwrap(getOverrideValue(e, o, a, s));
+            if (!isWrappable(c)) continue;
+            descendInto(c, t[a], u, i);
+        }
+        return;
+    }
+    // No-override path (every applyStateFast call): iterate in place instead of
+    // building keys + symbols + concat arrays per object per pass. The cheap
+    // bails (noded key, primitive value) stay inline — only genuine descent
+    // candidates pay a call.
+        for (const n in e) {
+        if (r?.[n]) continue;
+ // main loop already diffed this slot
+                const o = unwrap(e[n]);
+        if (!isWrappable(o)) continue;
+        descendInto(o, t[n], u, i);
+    }
+    const l = Object.getOwnPropertySymbols(e);
+    for (let n = 0, o = l.length; n < o; n++) {
+        if (Object.prototype.propertyIsEnumerable.call(e, l[n])) {
+            if (r?.[l[n]]) continue;
+            const o = unwrap(e[l[n]]);
+            if (!isWrappable(o)) continue;
+            descendInto(o, t[l[n]], u, i);
+        }
+    }
+}
+
+function descendInto(e, t, n, r) {
+    const i = lookupTarget(e, n);
+    if (!i?.[STORE_DESC]) return;
+    const o = unwrap(t);
+    if (e === o || !isWrappable(o) || Array.isArray(e) !== Array.isArray(o) || r(e) != null && r(e) !== r(o)) return;
+    if (i[STORE_SHALLOW]) {
+        applyStateShallow(o, i);
+    } else if (i[STORE_OVERRIDE] || i[STORE_OPTIMISTIC_OVERRIDE]) {
+        applyStateSlow(o, i, r);
+    } else {
+        applyStateFast(o, i, r);
     }
 }
 
@@ -4113,36 +4234,134 @@ function applyState(e, t, n) {
     e = unwrap(e);
     const r = t?.[$TARGET];
     if (!r) return;
-    if (r[STORE_OVERRIDE] || r[STORE_OPTIMISTIC_OVERRIDE]) {
+    if (r[STORE_SHALLOW]) {
+        applyStateShallow(e, r);
+    } else if (r[STORE_OVERRIDE] || r[STORE_OPTIMISTIC_OVERRIDE]) {
         applyStateSlow(e, r, n);
     } else {
         applyStateFast(e, r, n);
     }
 }
 
+// Shallow boundary diff: the target's own keys are reactive, its values are
+// raw records replaced by reference — no recursion, no wrapping. Arrays merge
+// positionally (below a shallow boundary the VALUE is the identity; keyed
+// row identity belongs to the consumer, e.g. <For keyed>). Incoming
+// wrappables are sticky-marked raw so they present raw through every store.
+// One pass over a shallow target's node record: replace changed slots with
+// raw next values, null out slots absent from next. Returns whether anything
+// differed.
+function shallowDiffNodes(e, t, n, r) {
+    let i = false;
+    for (const o in e) {
+        if (r && o === "length") continue;
+        if (o in t) {
+            const r = t[o];
+            if (r !== n(o)) {
+                i = true;
+                setSignal(e[o], r);
+            }
+        } else {
+            i = true;
+            setSignal(e[o], undefined);
+        }
+    }
+    return i;
+}
+
+function applyStateShallow(e, t, n) {
+    const r = t[STORE_VALUE];
+    const i = t[STORE_OVERRIDE];
+    const o = t[STORE_OPTIMISTIC_OVERRIDE];
+    if (e === r && !i && !o) return;
+    // Setter-staged writes fold into the diff: previous values resolve through
+    // the override layers (so a replaced slot compares against what readers
+    // saw), and the regular override clears with the swap — reconcile makes
+    // `next` the authoritative base, same as the deep slow path.
+        const prevAt = e => {
+        const t = getOverrideValue(r, i, e, o);
+        return t === $DELETED ? undefined : t;
+    };
+    t[STORE_OVERRIDE] = undefined;
+    const s = t[STORE_LOOKUP];
+    s !== undefined ? s.set(e, t[$PROXY]) : storeLookup.set(e, t);
+    t[STORE_VALUE] = e;
+    markRawIngest(e);
+    const u = t[STORE_NODE];
+    const l = u && u[$TRACK];
+    let a = false;
+    if (Array.isArray(r)) {
+        const n = i?.length ?? o?.length ?? r.length;
+        if (u) {
+            a = shallowDiffNodes(u, e, prevAt, true);
+            if (u.length && n !== e.length) setSignal(u.length, e.length);
+        }
+        if (!a && (l || t[STORE_HAS])) {
+            // Slots without nodes still feed $TRACK enumerators / `in` probes.
+            if (n !== e.length) a = true; else {
+                for (let t = 0, n = e.length; t < n; t++) {
+                    if (prevAt(t) !== e[t]) {
+                        a = true;
+                        break;
+                    }
+                }
+            }
+        }
+    } else {
+        if (u) {
+            a = shallowDiffNodes(u, e, prevAt, false);
+        }
+        if (!a && (l || t[STORE_HAS])) a = true;
+    }
+    let c = t[STORE_HAS];
+    if (c) {
+        for (const t in c) {
+            setSignal(c[t], t in e);
+        }
+    }
+    a && notifySelf(t);
+}
+
 function applyStateFast(e, t, n) {
     const r = t[STORE_VALUE];
     if (e === r) return;
     const i = t[STORE_NODE];
     // swap
-        (t[STORE_LOOKUP] || storeLookup).set(e, t[$PROXY]);
+        {
+        const n = t[STORE_LOOKUP];
+        n !== undefined ? n.set(e, t[$PROXY]) : storeLookup.set(e, t);
+    }
     t[STORE_VALUE] = e;
     // merge
         if (Array.isArray(r)) {
         let o = false;
         const s = r.length;
         if (e.length && s && isWrappable(e[0]) && n(e[0]) != null) {
-            let u, l, c, a, f, E, S, d;
-            for (c = 0, a = Math.min(s, e.length); c < a && keyedMatch(E = r[c], e[c], n); c++) {
-                isWrappable(E) && isWrappable(e[c]) && applyState(e[c], wrap(E, t), n);
+            let u, l, a, c, f, E, d, S;
+            for (a = 0, c = Math.min(s, e.length); a < c && keyedMatch(E = r[a], e[a], n); a++) {
+                // keyedMatch established both sides wrappable unless they're the
+                // SAME reference — and an identical slot is a guaranteed no-op
+                // (the child's STORE_VALUE tracks the previous graph), so skip
+                // the recursion dispatch entirely. Raw-marked values are leaves:
+                // replace the slot node instead of recursing.
+                if (E !== e[a]) {
+                    if (rawValuesUsed && (isRawValue(E) || isRawValue(e[a]))) {
+                        i?.[a] && setSignal(i[a], wrapValue(e[a], t));
+                    } else applyStateChild(e[a], E, t, n);
+                }
             }
-            const T = new Array(e.length), _ = new Map;
-            for (a = s - 1, f = e.length - 1; a >= c && f >= c && keyedMatch(E = r[a], e[f], n); a--, 
+            // Every position key-matched at equal length (the steady-state shape
+            // of a polling tick): membership, length, and order are unchanged —
+            // nothing below could do observable work, so skip the staging
+            // allocations and membership sync outright.
+                        if (a === e.length && a === s) return;
+            const T = new Array(e.length), O = new Map;
+            for (c = s - 1, f = e.length - 1; c >= a && f >= a && keyedMatch(E = r[c], e[f], n); c--, 
             f--) {
                 T[f] = E;
             }
-            if (c > f || c > a) {
-                for (l = c; l <= f; l++) {
+            if (a > f || a > c) {
+                for (l = a; l <= f; l++) {
                     o = true;
                     i?.[l] && setSignal(i[l], wrapValue(e[l], t));
                 }
@@ -4155,34 +4374,36 @@ function applyStateFast(e, t, n) {
                 s !== e.length && i?.length && setSignal(i.length, e.length);
                 return;
             }
-            S = new Array(f + 1);
-            for (l = f; l >= c; l--) {
+            d = new Array(f + 1);
+            for (l = f; l >= a; l--) {
                 E = e[l];
-                d = itemKey(E, n);
-                u = _.get(d);
-                S[l] = u === undefined ? -1 : u;
-                _.set(d, l);
+                S = itemKey(E, n);
+                u = O.get(S);
+                d[l] = u === undefined ? -1 : u;
+                O.set(S, l);
             }
-            for (u = c; u <= a; u++) {
+            for (u = a; u <= c; u++) {
                 E = r[u];
-                d = itemKey(E, n);
-                l = _.get(d);
+                S = itemKey(E, n);
+                l = O.get(S);
                 if (l !== undefined && l !== -1) {
                     T[l] = E;
-                    l = S[l];
-                    _.set(d, l);
+                    l = d[l];
+                    O.set(S, l);
                 }
             }
-            for (l = c; l < e.length; l++) {
+            for (l = a; l < e.length; l++) {
                 if (l in T) {
                     applyArrayItem(e[l], T[l], t, i?.[l], n);
                 } else i?.[l] && setSignal(i[l], wrapValue(e[l], t));
             }
-            if (c < e.length) o = true;
+            if (a < e.length) o = true;
         } else if (e.length) {
             for (let s = 0, u = e.length; s < u; s++) {
                 const u = r[s];
-                if (isWrappable(u) && isWrappable(e[s])) applyState(e[s], wrap(u, t), n); else {
+                if (isWrappable(u) && isWrappable(e[s]) && !(rawValuesUsed && (isRawValue(u) || isRawValue(e[s])))) {
+                    if (u !== e[s]) applyStateChild(e[s], u, t, n);
+                } else {
                     if (u !== e[s]) o = true;
                     i?.[s] && setSignal(i[s], wrapValue(e[s], t));
                 }
@@ -4201,17 +4422,43 @@ function applyStateFast(e, t, n) {
     let s;
     if (o) {
         s = o[$TRACK];
-        const i = s ? getAllKeys(r, undefined, e) : nodeKeys(o);
-        for (let u = 0, l = i.length; u < l; u++) {
-            const l = i[u];
-            const c = o[l];
-            const a = unwrap(r[l]);
-            let f = unwrap(e[l]);
-            if (a === f) continue;
-            if (!a || !isWrappable(a) || !isWrappable(f) || Array.isArray(a) !== Array.isArray(f) || n(a) != null && n(a) !== n(f)) {
-                s && setSignal(s, void 0);
-                c && setSignal(c, isWrappable(f) ? wrap(f, t) : f);
-            } else applyState(f, wrap(a, t), n);
+        // The per-key body is duplicated across both loops on purpose: this is
+        // the hottest object-diff site and a shared helper costs a per-key call
+        // in instruction counts (CodSpeed regressed ~7% on deep-tree reconciles
+        // with the extracted form).
+                if (s || symbolKeyedRecords.has(o)) {
+            const i = s ? getAllKeys(r, undefined, e) : nodeKeys(o);
+            for (let u = 0, l = i.length; u < l; u++) {
+                const l = i[u];
+                const a = o[l];
+                const c = unwrap(r[l]);
+                const f = unwrap(e[l]);
+                if (c === f) continue;
+                if (!c || !isWrappable(c) || !isWrappable(f) || 
+                // Raw-marked values are leaves replaced by reference — a "wrappable
+                // pair" is only recursable when both sides are actual store children.
+                rawValuesUsed && (isRawValue(c) || isRawValue(f)) || Array.isArray(c) !== Array.isArray(f) || n(c) != null && n(c) !== n(f)) {
+                    s && setSignal(s, void 0);
+                    a && setSignal(a, isWrappable(f) ? wrap(f, t) : f);
+                } else applyStateChild(f, c, t, n);
+            }
+        } else {
+            // Untracked, string-only node records (the overwhelmingly common case)
+            // iterate in place — nodeKeys() allocated a fresh key array per object
+            // per pass, which dominates allocation on large-graph reconciles.
+            for (const i in o) {
+                const u = o[i];
+                const l = unwrap(r[i]);
+                const a = unwrap(e[i]);
+                if (l === a) continue;
+                if (!l || !isWrappable(l) || !isWrappable(a) || 
+                // Raw-marked values are leaves replaced by reference — a "wrappable
+                // pair" is only recursable when both sides are actual store children.
+                rawValuesUsed && (isRawValue(l) || isRawValue(a)) || Array.isArray(l) !== Array.isArray(a) || n(l) != null && n(l) !== n(a)) {
+                    s && setSignal(s, void 0);
+                    u && setSignal(u, isWrappable(a) ? wrap(a, t) : a);
+                } else applyStateChild(a, l, t, n);
+            }
         }
     }
     if (!s && t[STORE_DESC]) applyDescendants(r, e, t, o, n);
@@ -4231,7 +4478,10 @@ function applyStateSlow(e, t, n) {
     const o = t[STORE_OPTIMISTIC_OVERRIDE];
     let s = t[STORE_NODE];
     // swap
-        (t[STORE_LOOKUP] || storeLookup).set(e, t[$PROXY]);
+        {
+        const n = t[STORE_LOOKUP];
+        n !== undefined ? n.set(e, t[$PROXY]) : storeLookup.set(e, t);
+    }
     t[STORE_VALUE] = e;
     t[STORE_OVERRIDE] = undefined;
     // merge
@@ -4239,23 +4489,27 @@ function applyStateSlow(e, t, n) {
         let u = false;
         const l = getOverrideValue(r, i, "length", o);
         if (e.length && l && isWrappable(e[0]) && n(e[0]) != null) {
-            let c, a, f, E, S, d, T, _;
-            for (f = 0, E = Math.min(l, e.length); f < E && keyedMatch(d = getOverrideValue(r, i, f, o), e[f], n); f++) {
-                isWrappable(d) && isWrappable(e[f]) && applyState(e[f], wrap(d, t), n);
+            let a, c, f, E, d, S, T, O;
+            for (f = 0, E = Math.min(l, e.length); f < E && keyedMatch(S = getOverrideValue(r, i, f, o), e[f], n); f++) {
+                if (isWrappable(S) && isWrappable(e[f]) && S !== e[f]) {
+                    if (rawValuesUsed && (isRawValue(S) || isRawValue(e[f]))) {
+                        s?.[f] && setSignal(s[f], wrapValue(e[f], t));
+                    } else applyState(e[f], wrap(S, t), n);
+                }
             }
-            const p = new Array(e.length), O = new Map;
-            for (E = l - 1, S = e.length - 1; E >= f && S >= f && keyedMatch(d = getOverrideValue(r, i, E, o), e[S], n); E--, 
-            S--) {
-                p[S] = d;
+            const _ = new Array(e.length), p = new Map;
+            for (E = l - 1, d = e.length - 1; E >= f && d >= f && keyedMatch(S = getOverrideValue(r, i, E, o), e[d], n); E--, 
+            d--) {
+                _[d] = S;
             }
-            if (f > S || f > E) {
-                for (a = f; a <= S; a++) {
+            if (f > d || f > E) {
+                for (c = f; c <= d; c++) {
                     u = true;
-                    s?.[a] && setSignal(s[a], wrapValue(e[a], t));
+                    s?.[c] && setSignal(s[c], wrapValue(e[c], t));
                 }
-                for (;a < e.length; a++) {
+                for (;c < e.length; c++) {
                     u = true;
-                    applyArrayItem(e[a], p[a], t, s?.[a], n);
+                    applyArrayItem(e[c], _[c], t, s?.[c], n);
                 }
                 const r = e.length;
                 syncArrayNodeMembership(t, e);
@@ -4263,44 +4517,46 @@ function applyStateSlow(e, t, n) {
                 l !== r && s?.length && setSignal(s.length, r);
                 return;
             }
-            T = new Array(S + 1);
-            for (a = S; a >= f; a--) {
-                d = e[a];
-                _ = itemKey(d, n);
-                c = O.get(_);
-                T[a] = c === undefined ? -1 : c;
-                O.set(_, a);
+            T = new Array(d + 1);
+            for (c = d; c >= f; c--) {
+                S = e[c];
+                O = itemKey(S, n);
+                a = p.get(O);
+                T[c] = a === undefined ? -1 : a;
+                p.set(O, c);
             }
-            for (c = f; c <= E; c++) {
-                d = getOverrideValue(r, i, c, o);
-                _ = itemKey(d, n);
-                a = O.get(_);
-                if (a !== undefined && a !== -1) {
-                    p[a] = d;
-                    a = T[a];
-                    O.set(_, a);
+            for (a = f; a <= E; a++) {
+                S = getOverrideValue(r, i, a, o);
+                O = itemKey(S, n);
+                c = p.get(O);
+                if (c !== undefined && c !== -1) {
+                    _[c] = S;
+                    c = T[c];
+                    p.set(O, c);
                 }
             }
-            for (a = f; a < e.length; a++) {
-                if (a in p) {
-                    applyArrayItem(e[a], p[a], t, s?.[a], n);
-                } else s?.[a] && setSignal(s[a], wrapValue(e[a], t));
+            for (c = f; c < e.length; c++) {
+                if (c in _) {
+                    applyArrayItem(e[c], _[c], t, s?.[c], n);
+                } else s?.[c] && setSignal(s[c], wrapValue(e[c], t));
             }
             if (f < e.length) u = true;
         } else if (e.length) {
-            for (let l = 0, c = e.length; l < c; l++) {
-                const c = getOverrideValue(r, i, l, o);
-                if (isWrappable(c) && isWrappable(e[l])) applyState(e[l], wrap(c, t), n); else {
-                    if (c !== e[l]) u = true;
+            for (let l = 0, a = e.length; l < a; l++) {
+                const a = getOverrideValue(r, i, l, o);
+                if (isWrappable(a) && isWrappable(e[l]) && !(rawValuesUsed && (isRawValue(a) || isRawValue(e[l])))) {
+                    if (a !== e[l]) applyState(e[l], wrap(a, t), n);
+                } else {
+                    if (a !== e[l]) u = true;
                     s?.[l] && setSignal(s[l], wrapValue(e[l], t));
                 }
             }
         }
-        const c = e.length;
+        const a = e.length;
         syncArrayNodeMembership(t, e);
-        if (l !== c) {
+        if (l !== a) {
             u = true;
-            s?.length && setSignal(s.length, c);
+            s?.length && setSignal(s.length, a);
         }
         u && notifySelf(t);
         return;
@@ -4310,16 +4566,16 @@ function applyStateSlow(e, t, n) {
     if (s) {
         u = s[$TRACK];
         const l = u ? getAllKeys(r, i, e) : nodeKeys(s);
-        for (let c = 0, a = l.length; c < a; c++) {
-            const a = l[c];
-            const f = s[a];
-            const E = unwrap(getOverrideValue(r, i, a, o));
-            let S = unwrap(e[a]);
-            if (E === S) continue;
-            if (!E || !isWrappable(E) || !isWrappable(S) || Array.isArray(E) !== Array.isArray(S) || n(E) != null && n(E) !== n(S)) {
+        for (let a = 0, c = l.length; a < c; a++) {
+            const c = l[a];
+            const f = s[c];
+            const E = unwrap(getOverrideValue(r, i, c, o));
+            let d = unwrap(e[c]);
+            if (E === d) continue;
+            if (!E || !isWrappable(E) || !isWrappable(d) || rawValuesUsed && (isRawValue(E) || isRawValue(d)) || Array.isArray(E) !== Array.isArray(d) || n(E) != null && n(E) !== n(d)) {
                 u && setSignal(u, void 0);
-                f && setSignal(f, isWrappable(S) ? wrap(S, t) : S);
-            } else applyState(S, wrap(E, t), n);
+                f && setSignal(f, isWrappable(d) ? wrap(d, t) : d);
+            } else applyState(d, wrap(E, t), n);
         }
     }
     if (!u && t[STORE_DESC]) applyDescendants(r, e, t, s, n, i, o);
@@ -4333,17 +4589,27 @@ function applyStateSlow(e, t, n) {
     }
 }
 
+// No-key reconcile: every item reports "no key", which routes array diffs to
+// the positional branch and object descent to plain per-property merging.
+const NOKEY = () => null;
+
 /**
  * Returns a draft-mutating function that smart-merges `value` into a store,
- * preserving the identity of items whose `key` field matches between old and
- * new states. Useful when applying server payloads or full-replacement data
- * onto an existing store without losing fine-grained reactivity.
+ * preserving fine-grained reactivity: only changed leaves trigger updates.
+ *
+ * With a `key` (default `"id"`), array items whose key matches between old
+ * and new states keep their identity (updated in place, moves and removals
+ * update the corresponding signals) — the shape for keyed server payloads.
+ * Items without the key field fall back to positional matching.
  *
- * Items with the same key are updated in place (only changed properties
- * trigger updates). Items added or removed update the corresponding signals.
+ * With `key: null`, matching is purely positional: index N of the new array
+ * merges into index N of the old, and object properties merge recursively —
+ * the classic pattern for fixed-shape data that churns in place (dashboards,
+ * monitors), where no keyed diff pass is needed or wanted.
  *
  * @param value the next state to merge in
- * @param key property name (string) or extractor function for stable identity
+ * @param key property name (string) or extractor function for stable
+ * identity (default `"id"`); pass `null` for positional merging
  *
  * @example
  * ```ts
@@ -4351,12 +4617,19 @@ function applyStateSlow(e, t, n) {
  *
  * async function refresh() {
  *   const fresh = await api.getTodos();
- *   setTodos(reconcile(fresh, "id")); // diff-merge by `id`
+ *   setTodos(reconcile(fresh)); // diff-merge by `id`
  * }
+ *
+ * // fixed-shape polling data — positional merge
+ * setStats(reconcile(nextStats, null));
  * ```
- */ function reconcile(e, t) {
+ */ function reconcile(e, t = "id") {
     return n => {
         if (n == null) throw new Error("");
+        if (t === null) {
+            applyState(e, n, NOKEY);
+            return;
+        }
         const r = typeof t === "string" ? e => e[t] : t;
         const i = r(n);
         if (i !== undefined && r(e) !== i) throw new Error("");
@@ -4367,9 +4640,16 @@ function applyStateSlow(e, t, n) {
 function createProjectionInternal(e, t, n) {
     let r;
     const i = new WeakMap;
+    // A shallow projection's children are raw and never wrapped, so the
+    // wrapper only ever runs for the root — flagging unconditionally is safe.
+        const o = !!n?.shallow;
     const wrapper = e => {
         e[STORE_WRAP] = wrapProjection;
         e[STORE_LOOKUP] = i;
+        if (o) {
+            e[STORE_SHALLOW] = true;
+            markRawIngest(e[STORE_VALUE]);
+        }
         Object.defineProperty(e, STORE_FIREWALL, {
             get() {
                 return r;
@@ -4384,14 +4664,14 @@ function createProjectionInternal(e, t, n) {
         i.set(e, t);
         return t;
     };
-    const o = wrapProjection(t);
+    const s = wrapProjection(t);
     r = computed(() => {
         if (!r) r = getOwner();
-        runProjectionComputed(o, e, n?.key || "id");
+        runProjectionComputed(s, e, n?.key || "id");
     }, undefined);
-    r.ke &= ~CONFIG_AUTO_DISPOSE;
+    r.Ge &= ~CONFIG_AUTO_DISPOSE;
     return {
-        store: o,
+        store: s,
         node: r
     };
 }
@@ -4458,7 +4738,7 @@ function createProjectionInternal(e, t, n) {
     const o = getOwner();
     let s = false;
     let u;
-    const l = new Proxy(e, createWriteTraps(() => !s || o.lt === u, i));
+    const l = new Proxy(e, createWriteTraps(() => !s || o.ut === u, i));
     storeSetter(l, i => {
         u = t(i);
         s = true;
@@ -4539,19 +4819,45 @@ function createWriteTraps(e, t) {
 // the record witnesses it into the active isPending() probe.
 $AFFECTS = Symbol(0);
 
-const STORE_VALUE = "v", STORE_OVERRIDE = "o", STORE_OPTIMISTIC_OVERRIDE = "x", STORE_NODE = "n", STORE_HAS = "h", STORE_CUSTOM_PROTO = "c", STORE_WRAP = "w", STORE_LOOKUP = "l", STORE_FIREWALL = "f", STORE_OPTIMISTIC = "p", STORE_OPTIMISTIC_OWNERS = "t", STORE_PARENT = "u", STORE_DESC = "d";
+const STORE_VALUE = "v", STORE_OVERRIDE = "o", STORE_OPTIMISTIC_OVERRIDE = "x", STORE_NODE = "n", STORE_HAS = "h", STORE_CUSTOM_PROTO = "c", STORE_WRAP = "w", STORE_LOOKUP = "l", STORE_FIREWALL = "f", STORE_OPTIMISTIC = "p", STORE_OPTIMISTIC_OWNERS = "t", STORE_PARENT = "u", STORE_DESC = "d", STORE_SHALLOW = "s";
 
 const STORE_SELF_PENDING = Symbol(0);
 
+// Every StoreNode field is initialized up front, in one fixed order, so all
+// targets share a single hidden class. The traps and reconcile read these
+// fields on their hottest paths; fields added lazily in varying orders made
+// those loads megamorphic across a large store graph (dictionary-mode probes
+// on every trap hit). Assignments elsewhere must never `delete` a field —
+// write `undefined` instead, or the shape degrades again.
+function initStoreFields(e) {
+    e[STORE_OVERRIDE] = undefined;
+    e[STORE_OPTIMISTIC_OVERRIDE] = undefined;
+    e[STORE_OPTIMISTIC_OWNERS] = undefined;
+    e[STORE_NODE] = undefined;
+    e[STORE_HAS] = undefined;
+    e[STORE_CUSTOM_PROTO] = undefined;
+    e[STORE_WRAP] = undefined;
+    e[STORE_LOOKUP] = undefined;
+    e[STORE_FIREWALL] = undefined;
+    e[STORE_OPTIMISTIC] = undefined;
+    e[STORE_SNAPSHOT_PROPS] = undefined;
+    e[STORE_PARENT] = undefined;
+    e[STORE_DESC] = undefined;
+    e[STORE_SHALLOW] = undefined;
+    e[$PROXY] = null;
+}
+
 function createStoreProxy(e, t = storeTraps, n) {
     let r;
     if (Array.isArray(e)) {
         r = [];
-        r.v = e;
+        r[STORE_VALUE] = e;
+        initStoreFields(r);
     } else {
         r = {
-            v: e
+            [STORE_VALUE]: e
         };
+        initStoreFields(r);
         const t = e?.[$TARGET]?.[STORE_VALUE] ?? e;
         const n = Object.getPrototypeOf(t);
         if (n !== null && n !== Object.prototype) {
@@ -4562,24 +4868,99 @@ function createStoreProxy(e, t = storeTraps, n) {
     return r[$PROXY] = new Proxy(r, t);
 }
 
+// The global lookup maps raw value -> StoreNode TARGET (not proxy): reconcile
+// and the unwrap/snapshot walks resolve targets through it constantly, and a
+// target hit is a plain field read away from its proxy while a proxy hit
+// costs a trap to get back to the target. Per-family STORE_LOOKUP maps
+// (projections/optimistic) still map raw -> proxy — their wrap functions own
+// that contract — so mixed-lookup consumers resolve through lookupTarget().
 const storeLookup = new WeakMap;
 
 // Node records that hold at least one user (non-`$TRACK`) symbol-keyed node.
 // Lets reconcile enumerate symbols only for records that need it (#2851).
 const symbolKeyedRecords = new WeakSet;
 
+function lookupTarget(e, t) {
+    if (t !== undefined && t !== storeLookup) {
+        const n = t.get(e);
+        if (n !== undefined) return n[$TARGET];
+    }
+    return storeLookup.get(e);
+}
+
+// Values marked raw never acquire a proxy identity: wrap() serves them as-is
+// everywhere — deep stores hold them as leaf values replaced by reference.
+// Once raw, always raw (identity stays single, just unwrapped). Consulted
+// only on wrap-creation and ingest paths; reads never touch it.
+const rawValues = new WeakSet;
+
+/**
+ * Marks a value as raw: no store will ever wrap it — every store presents it
+ * as-is, tracked by reference at whatever slot holds it and updated by
+ * replacement. Useful for class instances and external objects (editors,
+ * scene graphs, Maps) and for record-shaped data updated wholesale. Sticky
+ * for the value's lifetime.
+ */
+// Flipped on the first mark and exported as a LIVE binding: reconcile
+// consults it on every recursable pair, and importing the boolean directly
+// lets those sites skip even the function call when no shallow store or raw
+// mark exists anywhere in the app.
+let rawValuesUsed = false;
+
+function isRawValue(e) {
+    return rawValuesUsed && rawValues.has(e);
+}
+
+function markRawOne(e) {
+    if (isWrappable(e)) {
+        rawValuesUsed = true;
+        rawValues.add(e);
+    }
+}
+
+function markRawIngest(e) {
+    if (Array.isArray(e)) {
+        for (let t = 0, n = e.length; t < n; t++) markRawOne(e[t]);
+    } else {
+        for (const t in e) markRawOne(e[t]);
+    }
+}
+
 function wrap(e, t) {
+    // Raw is raw in every family: the mark must preempt family wrapping too,
+    // or a shallow projection/optimistic store would proxy its raw records.
+    if (rawValuesUsed && rawValues.has(e)) return e;
     if (t?.[STORE_WRAP]) {
         const n = t[STORE_WRAP](e, t);
         const r = n[$TARGET];
         if (r && !r[STORE_PARENT] && r !== t) r[STORE_PARENT] = t;
         return n;
     }
-    let n = e[$PROXY] || storeLookup.get(e);
-    if (!n) {
-        storeLookup.set(e, n = createStoreProxy(e));
-        if (t) n[$TARGET][STORE_PARENT] = t;
+    const n = storeLookup.get(e);
+    if (n !== undefined) return n[$PROXY];
+    let r = e[$PROXY];
+    if (!r) {
+        r = createStoreProxy(e);
+        const n = r[$TARGET];
+        storeLookup.set(e, n);
+        if (t) n[STORE_PARENT] = t;
     }
+    return r;
+}
+
+// Shallow store root: the target itself is fully reactive (per-key nodes,
+// membership, $TRACK); its values are served raw. Seed values are marked at
+// creation; reconcile and the set trap mark on ingest.
+function wrapShallow(e) {
+    const t = storeLookup.get(e);
+    if (t !== undefined) {
+        if (t[STORE_SHALLOW]) return t[$PROXY];
+    }
+    const n = createStoreProxy(e);
+    const r = n[$TARGET];
+    r[STORE_SHALLOW] = true;
+    storeLookup.set(e, r);
+    markRawIngest(e);
     return n;
 }
 
@@ -4601,7 +4982,7 @@ function writeOnly(e) {
 }
 
 function unwrapStoreValue(e, t, n) {
-    const r = e?.[$TARGET] || n?.get(e)?.[$TARGET];
+    const r = e?.[$TARGET] || lookupTarget(e, n);
     if (!r) return e;
     const i = r[STORE_OVERRIDE];
     if (!i) return r[STORE_VALUE];
@@ -4665,7 +5046,7 @@ function ownEnumerableKeysPlain(e) {
  * The value a store leaf's backing signal currently shows to readers: active
  * override, else held pending value, else committed value.
  */ function visibleNodeValue(e) {
-    return e.A !== undefined && e.A !== NOT_PENDING ? unwrapOverride(e.A) : e.V !== NOT_PENDING ? e.V : e.xe;
+    return e.A !== undefined && e.A !== NOT_PENDING ? unwrapOverride(e.A) : e.U !== NOT_PENDING ? e.U : e.ke;
 }
 
 function hasOwnStoreProperty(e, t) {
@@ -4720,7 +5101,7 @@ function getNode(e, t, n, r, i = isEqual, o) {
     }
     if (o && n in o) {
         const e = o[n];
-        s.we = e === undefined ? NO_SNAPSHOT : e;
+        s.me = e === undefined ? NO_SNAPSHOT : e;
         snapshotSources?.add(s);
     }
     if (typeof n === "symbol" && n !== $TRACK && n !== $AFFECTS) symbolKeyedRecords.add(t);
@@ -4749,8 +5130,8 @@ function getNode(e, t, n, r, i = isEqual, o) {
  */ function inheritAffectsMarks(e, t, n) {
     // A live scope exists, so affects.ts already installed the mark engine.
     for (const [r, i] of affectsScopes) {
-        if (r.F && i.scope.has(t) && (i.key === undefined || i.key === n)) {
-            GlobalQueue.ie(e);
+        if (r.k && i.scope.has(t) && (i.key === undefined || i.key === n)) {
+            GlobalQueue.re(e);
             i.inherited.push(e);
         }
     }
@@ -4773,7 +5154,7 @@ const affectsScopes = new Map;
 // holds the root, and must still descend to pick up records added since.
 i) {
     if (!isWrappable(e)) return;
-    const o = e[$TARGET] || (r ?? storeLookup).get(e)?.[$TARGET];
+    const o = e[$TARGET] || lookupTarget(e, r);
     const s = o ? o[STORE_VALUE] : e;
     if (i.has(s)) return;
     i.add(s);
@@ -4800,9 +5181,9 @@ i) {
                 const l = o || r ? getStoreSymbols(s, u) : [];
         for (let e = 0, o = l.length; e < o; e++) {
             const o = l[e];
-            const c = getPropertyDescriptor(s, u, o);
-            if (!c || c.get) continue;
-            walkAffectsScope(c.value, t, n, r, i);
+            const a = getPropertyDescriptor(s, u, o);
+            if (!a || a.get) continue;
+            walkAffectsScope(a.value, t, n, r, i);
         }
     } else {
         const e = o || r ? getStoreKeys(s, u) : getKeys(s, u);
@@ -4838,11 +5219,11 @@ i) {
     // Callers guard on `pendingCheckActive`, which only flips inside
     // isPending() — the verdict layer is loaded and its hook installed.
     const n = e[STORE_NODE]?.[$AFFECTS];
-    if (n?.F) GlobalQueue.pe(n);
+    if (n?.k) GlobalQueue.Oe(n);
     if (affectsScopes.size) {
         const r = e[STORE_VALUE];
         for (const [e, i] of affectsScopes) {
-            if (e !== n && e.F && i.scope.has(r) && (i.key === undefined || i.key === t)) GlobalQueue.pe(e);
+            if (e !== n && e.k && i.scope.has(r) && (i.key === undefined || i.key === t)) GlobalQueue.Oe(e);
         }
     }
 }
@@ -4859,11 +5240,11 @@ i) {
  * @internal
  */ function getStoreAffectsNodes(e, t) {
     const n = getNodes(e, STORE_NODE);
-    GlobalQueue.ne ||= e => {
+    GlobalQueue.te ||= e => {
         const t = affectsScopes.get(e);
         if (!t) return;
         affectsScopes.delete(e);
-        for (let e = 0; e < t.inherited.length; e++) GlobalQueue.oe(t.inherited[e]);
+        for (let e = 0; e < t.inherited.length; e++) GlobalQueue.ie(t.inherited[e]);
     };
     if (t === undefined) {
         const t = getNode(e, n, $AFFECTS, undefined, false);
@@ -4990,7 +5371,7 @@ function prepareStoreWrite(e, t, n) {
     }
     const r = e[STORE_VALUE];
     const i = r[n];
-    if (snapshotCaptureActive && typeof n !== "symbol" && !((e[STORE_FIREWALL]?.We ?? 0) & STATUS_PENDING)) {
+    if (snapshotCaptureActive && typeof n !== "symbol" && !((e[STORE_FIREWALL]?.xe ?? 0) & STATUS_PENDING)) {
         if (!e[STORE_SNAPSHOT_PROPS]) {
             e[STORE_SNAPSHOT_PROPS] = Object.create(null);
             snapshotSources?.add(e);
@@ -5018,7 +5399,7 @@ function prepareStoreWrite(e, t, n) {
     // STORE_OPTIMISTIC is only set by createOptimisticStore, which installs the
     // optimistic engine before wrapping.
     if (e[STORE_OPTIMISTIC] && !projectionWriteActive) {
-        GlobalQueue.De(t);
+        GlobalQueue.be(t);
     }
 }
 
@@ -5055,24 +5436,24 @@ function notifyStoreProperty(e, t, n, r, i, o) {
         const n = upsertStoreNode(e, getNodes(e, STORE_HAS), t, o);
         setSignal(n, u);
     }
-    const c = getNodes(e, STORE_NODE);
+    const a = getNodes(e, STORE_NODE);
     if (n === "set") {
-        if (c[t]) {
-            setSignal(c[t], () => isWrappable(r) ? wrap(r, e) : r);
+        if (a[t]) {
+            setSignal(a[t], () => isWrappable(r) ? wrap(r, e) : r);
         } else if (!s) {
-            const n = upsertStoreNode(e, c, t, i, e[STORE_SNAPSHOT_PROPS]);
+            const n = upsertStoreNode(e, a, t, i, e[STORE_SNAPSHOT_PROPS]);
             setSignal(n, () => isWrappable(r) ? wrap(r, e) : r);
         }
     } else if (n === "invalidate") {
-        if (c[t]) {
-            setSignal(c[t], {});
-            delete c[t];
+        if (a[t]) {
+            setSignal(a[t], {});
+            delete a[t];
         }
     } else {
-        if (c[t]) {
-            setSignal(c[t], undefined);
+        if (a[t]) {
+            setSignal(a[t], undefined);
         } else if (!s) {
-            const n = upsertStoreNode(e, c, t, i, e[STORE_SNAPSHOT_PROPS]);
+            const n = upsertStoreNode(e, a, t, i, e[STORE_SNAPSHOT_PROPS]);
             setSignal(n, undefined);
         }
     }
@@ -5091,7 +5472,7 @@ let Writing = null;
  * itself (the derive function works its own draft while uninitialized).
  */ function throwIfUninitialized(e) {
     const t = e[STORE_FIREWALL];
-    if (t && t.We & STATUS_UNINITIALIZED) throw t.me ?? new NotReadyError(t);
+    if (t && t.xe & STATUS_UNINITIALIZED) throw t.De ?? new NotReadyError(t);
 }
 
 const storeTraps = {
@@ -5104,6 +5485,33 @@ const storeTraps = {
             trackSelf(e);
             return n;
         }
+        // Hot path: an existing node on a plain target — no firewall (so neither
+        // selfRead nor the uninitialized guard can apply), no override layers,
+        // no write scope, and a raw (non-proxy) source. This is the shape of
+        // every effect re-read of a settled store; it pays one node read and the
+        // wrap check, nothing else. Any exotic bit falls through to the full
+        // resolution below, and dev strictRead keeps its warning path.
+                if (e[STORE_FIREWALL] === undefined && e[STORE_OVERRIDE] === undefined && e[STORE_OPTIMISTIC_OVERRIDE] === undefined && !writeOverride && (Writing === null || !Writing.has(n))) {
+            const n = e[STORE_NODE];
+            const r = n && n[t];
+            if (r !== undefined && e[STORE_VALUE][$TARGET] === undefined) {
+                // readNodeFast is read()'s plain-signal fast path hoisted over the
+                // call; READ_SLOW means a global read window (latest/pending-check/
+                // transition/lane/snapshot capture) or a node layer is active, and
+                // only then does the full read() resolution have anything to do.
+                let t = readNodeFast(r);
+                if (t === READ_SLOW) t = read(r);
+                if (t === $DELETED) t = undefined;
+                // Every node-writing site wraps wrappables before setSignal (see the
+                // dev assertion below), so re-wrapping on read is redundant — except
+                // during snapshot capture, where read() can surface a raw captured
+                // value seeded from snapshot props.
+                                if (!snapshotCaptureActive) {
+                    return t;
+                }
+                return isWrappable(t) ? wrap(t, e) : t;
+            }
+        }
         const r = getObserver() === e[STORE_FIREWALL];
         const i = getNodes(e, STORE_NODE);
         const o = r ? undefined : i[t];
@@ -5113,33 +5521,38 @@ const storeTraps = {
         }
         const u = getOverlayLayer(e, t);
         const l = !!u;
-        const c = !!e[STORE_VALUE][$TARGET];
-        const a = u ?? e[STORE_VALUE];
+        const a = !!e[STORE_VALUE][$TARGET];
+        const c = u ?? e[STORE_VALUE];
         if (!o) {
-            const r = Object.getOwnPropertyDescriptor(a, t);
+            const r = Object.getOwnPropertyDescriptor(c, t);
             if (r && r.get) return r.get.call(n);
             if (!r && !l && e[STORE_CUSTOM_PROTO]) {
-                const e = unwrapStoreValue(a);
+                const e = unwrapStoreValue(c);
                 if (hasInheritedAccessor(e, t)) {
-                    return Reflect.get(a, t, n);
+                    return Reflect.get(c, t, n);
                 }
             }
         }
         if (writeOnly(n)) {
             if (isPrototypePollutionKey$1(t) && !hasOwnStoreProperty(e, t)) return undefined;
-            let n = o && (l || !c) ? visibleNodeValue(o) : a[t];
+            let n = o && (l || !a) ? visibleNodeValue(o) : c[t];
             n === $DELETED && (n = undefined);
             if (!isWrappable(n)) return n;
+            // Shallow boundary: records are replaced, never edited in place. Reads
+            // inside a setter serve the raw so read-then-replace, filter/pop and
+            // projection derives all work; in-place mutation of a raw is inert by
+            // construction — the same contract as a markRaw child in a deep store.
+                        if (e[STORE_SHALLOW]) return n;
             const r = wrap(n, e);
             Writing?.add(r);
             return r;
         }
-        let f = o ? l || !c ? read(i[t]) : (read(i[t]), a[t]) : a[t];
+        let f = o ? l || !a ? read(i[t]) : (read(i[t]), c[t]) : c[t];
         f === $DELETED && (f = undefined);
         if (!o) {
-            if (!l && typeof f === "function" && !Object.prototype.hasOwnProperty.call(a, t)) {
+            if (!l && typeof f === "function" && !Object.prototype.hasOwnProperty.call(c, t)) {
                 let t;
-                return !Array.isArray(e[STORE_VALUE]) && (t = Object.getPrototypeOf(e[STORE_VALUE])) && t !== Object.prototype ? f.bind(a) : f;
+                return !Array.isArray(e[STORE_VALUE]) && (t = Object.getPrototypeOf(e[STORE_VALUE])) && t !== Object.prototype ? f.bind(c) : f;
             } else if (getObserver() && !r) {
                 return read(getNode(e, i, t, isWrappable(f) ? wrap(f, e) : f, isEqual, e[STORE_SNAPSHOT_PROPS]));
             }
@@ -5177,37 +5590,38 @@ const storeTraps = {
                 const {base: i, overrideKey: o, state: s} = prepareStoreWrite(e, r, t);
                 const u = getOverlayLayer(e, t);
                 const l = u ? u[t] : i;
-                const c = u ? u[t] !== $DELETED : t in e[STORE_VALUE];
-                const a = unwrapStoreValue(n);
+                const a = u ? u[t] !== $DELETED : t in e[STORE_VALUE];
+                const c = unwrapStoreValue(n);
+                if (e[STORE_SHALLOW] && isWrappable(c)) rawValues.add(c);
                 // Symbol-keyed writes on arrays are metadata, not index writes — never run
                 // them through the numeric index/length machinery (`parseInt` on a symbol
                 // throws). #2769
                                 const f = typeof t === "string" ? Number(t) : -1;
                 const E = Array.isArray(s) && Number.isInteger(f) && f >= 0 && f < 4294967295 && String(f) === t;
-                const S = E ? f + 1 : 0;
-                const d = E && (getOverlayLayer(e, "length") ?? s).length;
-                const T = E && S > d ? S : undefined;
-                if (l === a && T === undefined) return true;
+                const d = E ? f + 1 : 0;
+                const S = E && (getOverlayLayer(e, "length") ?? s).length;
+                const T = E && d > S ? d : undefined;
+                if (l === c && T === undefined) return true;
                 armOptimisticStoreWrite(e, r);
-                if (a !== undefined && a === i && T === undefined) {
+                if (c !== undefined && c === i && T === undefined) {
                     delete e[o]?.[t];
                     if (o === STORE_OPTIMISTIC_OVERRIDE) delete e[STORE_OPTIMISTIC_OWNERS]?.[t];
                 } else {
                     const n = e[o] || (e[o] = Object.create(null));
-                    n[t] = a;
+                    n[t] = c;
                     stampOptimisticOwner(e, o, t);
                     if (T !== undefined) {
                         n.length = T;
                         stampOptimisticOwner(e, o, "length");
                     }
                 }
-                notifyStoreProperty(e, t, "set", a, l, c);
+                notifyStoreProperty(e, t, "set", c, l, a);
                 // Shrinking an array's length must remove the truncated indices, otherwise
                 // they leak through `has`, `ownKeys`, and (tracked) index reads from the
                 // underlying value. Mark each as deleted and notify so reactive reads update. #2768
-                                if (Array.isArray(s) && t === "length" && typeof a === "number" && typeof l === "number" && a < l) {
+                                if (Array.isArray(s) && t === "length" && typeof c === "number" && typeof l === "number" && c < l) {
                     const t = e[o] || (e[o] = Object.create(null));
-                    for (let n = a; n < l; n++) {
+                    for (let n = c; n < l; n++) {
                         if (t[n] === $DELETED) continue;
                         const r = n in t ? t[n] : s[n];
                         if (!(n in t) && !(n in s)) continue;
@@ -5222,7 +5636,7 @@ const storeTraps = {
                     if (t.length) {
                         setSignal(t.length, T);
                     } else if (!projectionWriteActive && !e[STORE_OPTIMISTIC]) {
-                        const n = upsertStoreNode(e, t, "length", d, e[STORE_SNAPSHOT_PROPS]);
+                        const n = upsertStoreNode(e, t, "length", S, e[STORE_SNAPSHOT_PROPS]);
                         setSignal(n, T);
                     }
                 }
@@ -5370,7 +5784,7 @@ function storeSetter(e, t) {
 }
 
 function createStore(e, t, n) {
-    const r = typeof e === "function", i = r ? createProjectionInternal(e, t, n).store : wrap(e);
+    const r = typeof e === "function", i = r ? createProjectionInternal(e, t, n).store : t?.shallow ? wrapShallow(e) : wrap(e);
     return [ i, r ? e => {
         // Mark the projection as manually written before notifying property nodes.
         suppressComputedRecompute(i[$REFRESH]);
@@ -5386,7 +5800,7 @@ function createStore(e, t, n) {
  * nothing is stored downstream and nothing can be stranded or stripped by
  * mid-window recomputes.
  */ function markAffects(e) {
-    e.F = (e.F || 0) + 1;
+    e.k = (e.k || 0) + 1;
     shiftAffectsMarks(1);
 }
 
@@ -5402,17 +5816,17 @@ function createStore(e, t, n) {
  * flush that would surface them, before effects run — verdict-only, netting
  * no visual change.
  */ function notifyMarkBoundaries(e) {
-    if (!e.k && !e.rt) return;
+    if (!e.G && !e.nt) return;
     const t = new NotReadyError(e);
-    t.ve = true;
+    t.we = true;
     const n = new Set;
     const visit = e => {
         if (n.has(e)) return;
         n.add(e);
         // Display consumers (render effects, boundary computeds) act on the
         // notification; descent stops there, exactly like the status rails.
-                if (e.yt) {
-            e.yt(STATUS_PENDING, t);
+                if (e.Nt) {
+            e.Nt(STATUS_PENDING, t);
             return;
         }
         forEachDependent(e, visit);
@@ -5433,7 +5847,7 @@ function createStore(e, t, n) {
     globalQueue.D.L.push(e);
     // Companions only exist once the verdict layer (isPending/latest) loaded;
     // without them there is no materialized verdict to poke.
-        GlobalQueue._e !== null && GlobalQueue._e(e);
+        GlobalQueue.Te !== null && GlobalQueue.Te(e);
     notifyMarkBoundaries(e);
     schedule();
 }
@@ -5445,10 +5859,10 @@ function createStore(e, t, n) {
  * setSignal would open a fresh override window that nothing settles).
  */ function releaseAffectsMark(e) {
     shiftAffectsMarks(-1);
-    e.F--;
-    if (!e.F) {
-        GlobalQueue._e !== null && GlobalQueue._e(e, true);
-        GlobalQueue.ne?.(e);
+    e.k--;
+    if (!e.k) {
+        GlobalQueue.Te !== null && GlobalQueue.Te(e, true);
+        GlobalQueue.te?.(e);
     }
 }
 
@@ -5465,11 +5879,11 @@ function createStore(e, t, n) {
 // Each call site is gated by state only this module creates (a non-empty
 // `_affectsNodes` batch, a live scope in the store's `affectsScopes`), so the
 // hooks are installed before the first time any of them can fire.
-GlobalQueue.re = releaseAffectsMarks;
+GlobalQueue.ne = releaseAffectsMarks;
 
-GlobalQueue.ie = markAffects;
+GlobalQueue.re = markAffects;
 
-GlobalQueue.oe = releaseAffectsMark;
+GlobalQueue.ie = releaseAffectsMark;
 
 function affects(e, t) {
     const n = e?.[$TARGET];
@@ -5490,8 +5904,10 @@ function createOptimisticStore(e, t, n) {
     // STORE_OPTIMISTIC take the engine's write path, so install it before any
     // node can be created.
     installOptimisticEngine();
-    GlobalQueue.te ||= clearOptimisticStores;
+    GlobalQueue.ee ||= clearOptimisticStores;
     const r = typeof e === "function";
+    // Plain form: the second slot carries options.
+        if (!r && n === undefined) n = t;
     const i = r ? t : e;
     const o = r ? e : undefined;
     // Create optimistic projection store
@@ -5555,30 +5971,32 @@ function clearOptimisticStores(e, t) {
             delete n[l];
             if (i) delete i[l];
             s = true;
-            const c = r?.[l];
-            if (c) {
+            const a = r?.[l];
+            if (a) {
                 // Clear lane association so effects go to regular queue
-                c.i = undefined;
+                a.i = undefined;
                 // Re-read from base — this key left the optimistic layer above, so the
                 // overlay resolves to STORE_OVERRIDE or STORE_VALUE.
                                 const t = getOverlayLayer(e, l);
                 const n = t ? t[l] : e[STORE_VALUE][l];
                 const r = n === $DELETED ? undefined : n;
                 const i = isWrappable(r) ? wrap(r, e) : r;
-                const o = visibleNodeValue(c);
-                c.A = NOT_PENDING;
-                c.R = null;
-                c.V = NOT_PENDING;
-                c.xe = i;
-                if (!c.ht || !c.ht(o, i)) {
-                    insertSubs(c, true);
+                const o = visibleNodeValue(a);
+                a.A = NOT_PENDING;
+                a.R = null;
+                a.U = NOT_PENDING;
+                a.ke = i;
+                if (!a.At || !a.At(o, i)) {
+                    insertSubs(a, true);
                     schedule();
                 }
             }
         }
         if (!u) {
-            delete e[STORE_OPTIMISTIC_OVERRIDE];
-            delete e[STORE_OPTIMISTIC_OWNERS];
+            // Assignment, not delete: StoreNode targets share one pre-initialized
+            // hidden class (see createStoreProxy) and a delete would demote it.
+            e[STORE_OPTIMISTIC_OVERRIDE] = undefined;
+            e[STORE_OPTIMISTIC_OWNERS] = undefined;
         }
         // Notify $TRACK
                 if (s && r?.[$TRACK]) {
@@ -5593,9 +6011,14 @@ function clearOptimisticStores(e, t) {
 function createOptimisticProjectionInternal(e, t, n) {
     let r;
     const i = new WeakMap;
+    const o = !!n?.shallow;
     const wrapper = e => {
         e[STORE_WRAP] = wrapProjection;
         e[STORE_LOOKUP] = i;
+        if (o) {
+            e[STORE_SHALLOW] = true;
+            markRawIngest(e[STORE_VALUE]);
+        }
         e[STORE_OPTIMISTIC] = true;
  // Mark as optimistic store
                 Object.defineProperty(e, STORE_FIREWALL, {
@@ -5612,7 +6035,7 @@ function createOptimisticProjectionInternal(e, t, n) {
         i.set(e, t);
         return t;
     };
-    const o = wrapProjection(t);
+    const s = wrapProjection(t);
     // If there's a projection function, create a computed to drive it
         if (e) {
         // All writes inside firewall recompute must go to STORE_OVERRIDE (base), not
@@ -5621,7 +6044,7 @@ function createOptimisticProjectionInternal(e, t, n) {
         // async yields because they fire outside any enclosing try/finally. It also
         // consumes stale optimistic overlays once fresh projected data lands.
         const clearProjectionOverride = () => {
-            const e = o[$TARGET];
+            const e = s[$TARGET];
             if (e?.[STORE_OPTIMISTIC_OVERRIDE]) clearOptimisticOverride(e);
         };
         const wrapCommit = e => {
@@ -5637,15 +6060,15 @@ function createOptimisticProjectionInternal(e, t, n) {
         r = computed(() => {
             setProjectionWriteActive(true);
             try {
-                runProjectionComputed(o, e, n?.key || "id", wrapCommit, clearProjectionOverride);
+                runProjectionComputed(s, e, n?.key || "id", wrapCommit, clearProjectionOverride);
             } finally {
                 setProjectionWriteActive(false);
             }
         }, undefined);
-        r.ke &= ~CONFIG_AUTO_DISPOSE;
+        r.Ge &= ~CONFIG_AUTO_DISPOSE;
     }
     return {
-        store: o,
+        store: s,
         node: r
     };
 }
@@ -5751,11 +6174,11 @@ function updatePath(e, t, n = 0) {
 });
 
 function snapshotImpl(e, t, n, r) {
-    let i, o, s, u, l, c;
+    let i, o, s, u, l, a;
     if (!isWrappable(e)) return e;
     if (n && n.has(e)) return n.get(e);
     if (!n) n = new Map;
-    if (i = e[$TARGET] || r?.get(e)?.[$TARGET]) {
+    if (i = e[$TARGET] || lookupTarget(e, r)) {
         if (t) {
             trackSelf(i, $TRACK);
             // A tracked walk reads THROUGH the record without touching the proxy
@@ -5763,6 +6186,18 @@ function snapshotImpl(e, t, n, r) {
                         if (pendingCheckActive) witnessAffectsMark(i);
         }
         s = mergedOverlay(i);
+        // A derived store's STORE_VALUE is the inner store's live proxy
+        // (store-in-store: createOptimisticStore/createProjection over a store).
+        // Without an overlay of its own, the fast path below would map to — and
+        // could return — that proxy verbatim. Recurse instead so the
+        // inner store's own target branch unwraps it (chains of any depth).
+        // With an overlay, a fresh `result` is always built, so the walk over the
+        // inner proxy already copies plain values.
+                if (!s && i[STORE_VALUE][$TARGET]) {
+            l = snapshotImpl(i[STORE_VALUE], t, n, r);
+            n.set(e, l);
+            return l;
+        }
         o = Array.isArray(i[STORE_VALUE]);
         n.set(e, s ? u = o ? [] : Object.create(Object.getPrototypeOf(i[STORE_VALUE])) : i[STORE_VALUE]);
         e = i[STORE_VALUE];
@@ -5773,26 +6208,26 @@ function snapshotImpl(e, t, n, r) {
     }
     if (o) {
         const o = s?.length ?? e.length;
-        for (let a = 0; a < o; a++) {
-            c = s && a in s ? s[a] : e[a];
-            if (c === $DELETED) continue;
-            if (t && isWrappable(c)) wrap(c, i);
-            if ((l = snapshotImpl(c, t, n, r)) !== c || u) {
+        for (let c = 0; c < o; c++) {
+            a = s && c in s ? s[c] : e[c];
+            if (a === $DELETED) continue;
+            if (t && isWrappable(a) && !(rawValuesUsed && isRawValue(a))) wrap(a, i);
+            if ((l = snapshotImpl(a, t, n, r)) !== a || u) {
                 if (!u) n.set(e, u = [ ...e ]);
-                u[a] = l;
+                u[c] = l;
             }
         }
         // Enumerate array symbols separately to avoid scanning indices twice.
         // Spread copies omit symbols, so assign them after the numeric walk.
-                const a = r ? getStoreSymbols(e, s) : [];
-        for (let o = 0, f = a.length; o < f; o++) {
-            const f = a[o];
+                const c = r ? getStoreSymbols(e, s) : [];
+        for (let o = 0, f = c.length; o < f; o++) {
+            const f = c[o];
             const E = getPropertyDescriptor(e, s, f);
             if (!E || E.get) continue;
-            c = s && f in s ? s[f] : e[f];
-            if (t && isWrappable(c)) wrap(c, i);
-            l = snapshotImpl(c, t, n, r);
-            if (l !== c || u) {
+            a = s && f in s ? s[f] : e[f];
+            if (t && isWrappable(a) && !(rawValuesUsed && isRawValue(a))) wrap(a, i);
+            l = snapshotImpl(a, t, n, r);
+            if (l !== a || u) {
                 if (!u) n.set(e, u = Object.assign([ ...e ], e));
                 u[f] = l;
             }
@@ -5807,31 +6242,31 @@ function snapshotImpl(e, t, n, r) {
         // A lookup means this object belongs to an immutable store backing tree,
         // even if that nested value has not needed its own proxy yet.
         const o = r ? getStoreKeys(e, undefined) : getKeys(e, undefined);
-        for (let s = 0, a = o.length; s < a; s++) {
-            const a = o[s];
-            const f = Object.getOwnPropertyDescriptor(e, a);
+        for (let s = 0, c = o.length; s < c; s++) {
+            const c = o[s];
+            const f = Object.getOwnPropertyDescriptor(e, c);
             if (f.get) continue;
-            c = f.value;
-            if (t && isWrappable(c)) wrap(c, i);
-            if ((l = snapshotImpl(c, t, n, r)) !== c || u) {
+            a = f.value;
+            if (t && isWrappable(a) && !(rawValuesUsed && isRawValue(a))) wrap(a, i);
+            if ((l = snapshotImpl(a, t, n, r)) !== a || u) {
                 if (!u) {
                     u = Object.create(Object.getPrototypeOf(e));
                     Object.assign(u, e);
                 }
-                u[a] = l;
+                u[c] = l;
             }
         }
     } else {
         // An override only exists on a store record, and the target branch above
         // always set `lookup` alongside it — so this branch is always store-keyed.
         const o = getStoreKeys(e, s);
-        for (let a = 0, f = o.length; a < f; a++) {
-            let f = o[a];
+        for (let c = 0, f = o.length; c < f; c++) {
+            let f = o[c];
             const E = getPropertyDescriptor(e, s, f);
             if (E.get) continue;
-            c = f in s ? s[f] : e[f];
-            if (t && isWrappable(c)) wrap(c, i);
-            if ((l = snapshotImpl(c, t, n, r)) !== e[f] || u) {
+            a = f in s ? s[f] : e[f];
+            if (t && isWrappable(a) && !(rawValuesUsed && isRawValue(a))) wrap(a, i);
+            if ((l = snapshotImpl(a, t, n, r)) !== e[f] || u) {
                 if (!u) {
                     u = Object.create(Object.getPrototypeOf(e));
                     Object.assign(u, e);
@@ -6055,23 +6490,23 @@ function mapArray(e, t, n) {
     const o = t;
     const s = {
         wt: createOwner(),
-        Gt: 0,
+        vt: 0,
         Lt: e,
-        Ut: [],
-        kt: o,
         Vt: [],
-        xt: [],
-        Qt: r,
+        Gt: o,
+        Ut: [],
+        kt: [],
+        Wt: r,
         Ft: r || n?.keyed === false ? [] : undefined,
-        Wt: i && n?.keyed !== false ? [] : undefined,
-        Mt: n?.keyed === false,
+        xt: i && n?.keyed !== false ? [] : undefined,
+        Qt: n?.keyed === false,
         Ht: n?.fallback
     };
     const u = computed(updateKeyedMap.bind(s));
     // Untracked reads inside the internal owner resolve via _parentComputed; routing
     // them through node lets store-proxy lookups see pending writes (not stale _value).
-        s.wt.et = u;
-    u.ke &= ~CONFIG_AUTO_DISPOSE;
+        s.wt.Je = u;
+    u.Ge &= ~CONFIG_AUTO_DISPOSE;
     return accessor(u);
 }
 
@@ -6096,45 +6531,45 @@ function updateKeyedMap() {
         let n, r, i, o, 
         // Mappers write freshly-created row/index signals into the STAGE
         // arrays (`rows`/`indexes`), never into `this._rows`/`this._indexes`.
-        s = this.Ft ? this.Mt ? () => {
+        s = this.Ft ? this.Qt ? () => {
             i[r] = signal(e[r], pureOptions);
-            return this.kt(accessor(i[r]), r);
+            return this.Gt(accessor(i[r]), r);
         } : () => {
             i[r] = signal(e[r], pureOptions);
             o && (o[r] = signal(r, pureOptions));
-            return this.kt(accessor(i[r]), o ? accessor(o[r]) : undefined);
-        } : this.Wt ? () => {
+            return this.Gt(accessor(i[r]), o ? accessor(o[r]) : undefined);
+        } : this.xt ? () => {
             const t = e[r];
             o[r] = signal(r, pureOptions);
-            return this.kt(t, accessor(o[r]));
+            return this.Gt(t, accessor(o[r]));
         } : () => {
             const t = e[r];
-            return this.kt(t);
+            return this.Gt(t);
         };
         // fast path for empty arrays
                 if (t === 0) {
-            if (this.Gt !== 0) {
+            if (this.vt !== 0) {
                 this.wt.dispose(false);
-                this.xt = [];
-                this.Ut = [];
+                this.kt = [];
                 this.Vt = [];
-                this.Gt = 0;
+                this.Ut = [];
+                this.vt = 0;
                 this.Ft && (this.Ft = []);
-                this.Wt && (this.Wt = []);
+                this.xt && (this.xt = []);
             }
-            if (this.Ht && !this.Vt[0]) {
+            if (this.Ht && !this.Ut[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.xt[0]?.dispose();
-                this.Vt[0] = runWithOwner(this.xt[0] = createOwner(), this.Ht);
+                this.kt[0]?.dispose();
+                this.Ut[0] = runWithOwner(this.kt[0] = createOwner(), this.Ht);
             }
         }
         // fast path for new create
-         else if (this.Gt === 0) {
+         else if (this.vt === 0) {
             const u = new Array(t);
             const l = new Array(t);
             i = this.Ft && new Array(t);
-            o = this.Wt && new Array(t);
+            o = this.xt && new Array(t);
             try {
                 for (r = 0; r < t; r++) u[r] = runWithOwner(l[r] = createOwner(), s);
             } catch (e) {
@@ -6142,58 +6577,67 @@ function updateKeyedMap() {
                 throw e;
             }
             // commit
-                        if (this.xt[0]) this.xt[0].dispose();
+                        if (this.kt[0]) this.kt[0].dispose();
  // previous fallback
-                        this.Vt = u;
-            this.xt = l;
+                        this.Ut = u;
+            this.kt = l;
             i && (this.Ft = i);
-            o && (this.Wt = o);
-            this.Ut = e.slice(0);
-            this.Gt = t;
+            o && (this.xt = o);
+            this.Vt = e.slice(0);
+            this.vt = t;
         } else {
-            let u, l, c, a, f, E, S, d, T, _ = new Array(t), p = new Array(t);
-            i = this.Ft ? new Array(t) : undefined;
-            o = this.Wt ? new Array(t) : undefined;
+            let u, l, a, c, f, E, d, S, T;
             // skip common prefix
-                        for (u = 0, l = Math.min(this.Gt, t); u < l && (this.Ut[u] === e[u] || this.Ft && compare(this.Qt, this.Ut[u], e[u])); u++) {
+                        for (u = 0, l = Math.min(this.vt, t); u < l && (this.Vt[u] === e[u] || this.Ft && compare(this.Wt, this.Vt[u], e[u])); u++) {
                 if (this.Ft) setSignal(this.Ft[u], e[u]);
             }
-            // common suffix
-                        for (l = this.Gt - 1, c = t - 1; l >= u && c >= u && (this.Ut[l] === e[c] || this.Ft && compare(this.Qt, this.Ut[l], e[c])); l--, 
-            c--) {
-                _[c] = this.Vt[l];
-                p[c] = this.xt[l];
-                i && (i[c] = this.Ft[l]);
-                o && (o[c] = this.Wt[l]);
+            // skip common suffix — counted only; retained entries land in one pass
+            // at commit instead of being staged and copied twice
+                        for (l = this.vt - 1, a = t - 1; l >= u && a >= u && (this.Vt[l] === e[a] || this.Ft && compare(this.Wt, this.Vt[l], e[a])); l--, 
+            a--) ;
+            // no structural change (every position matched in place at equal
+            // length — the common post-reconcile shape): keep the same mapped
+            // array identity so downstream consumers don't re-run at all
+                        if (u === t && this.vt === t) {
+                this.Vt = e.slice(0);
+                return;
             }
-            // 0) prepare a map of all indices in newItems, scanning backwards so we encounter them in natural order
+            const O = t - this.vt;
+            const _ = new Array(t);
+            const p = new Array(t);
+            i = this.Ft ? new Array(t) : undefined;
+            o = this.xt ? new Array(t) : undefined;
+            // 0) prepare a map of all indices in the changed window of newItems,
+            // scanning backwards so we encounter them in natural order
                         E = new Map;
-            S = new Array(c + 1);
-            for (r = c; r >= u; r--) {
-                a = e[r];
-                f = this.Qt ? this.Qt(a) : a;
+            d = new Array(a + 1);
+            for (r = a; r >= u; r--) {
+                c = e[r];
+                f = this.Wt ? this.Wt(c) : c;
                 n = E.get(f);
-                S[r] = n === undefined ? -1 : n;
+                d[r] = n === undefined ? -1 : n;
                 E.set(f, r);
             }
-            // 1) step through all old items and see if they can be found in the new set; if so, save them in a temp array and mark them moved; if not, queue them for disposal at commit
+            // 1) step through the old changed window and see if items can be found
+            // in the new set; if so, stage them at their new positions; if not,
+            // queue them for disposal at commit
                         for (n = u; n <= l; n++) {
-                a = this.Ut[n];
-                f = this.Qt ? this.Qt(a) : a;
+                c = this.Vt[n];
+                f = this.Wt ? this.Wt(c) : c;
                 r = E.get(f);
                 if (r !== undefined && r !== -1) {
-                    _[r] = this.Vt[n];
-                    p[r] = this.xt[n];
+                    _[r] = this.Ut[n];
+                    p[r] = this.kt[n];
                     i && (i[r] = this.Ft[n]);
-                    o && (o[r] = this.Wt[n]);
-                    r = S[r];
+                    o && (o[r] = this.xt[n]);
+                    r = d[r];
                     E.set(f, r);
-                } else (d ??= []).push(this.xt[n]);
+                } else (S ??= []).push(this.kt[n]);
             }
             // 2) create new rows into the temp arrays; an abort disposes only these
                         try {
-                for (r = u; r < t; r++) {
-                    if (r in _) continue;
+                for (r = u; r <= a; r++) {
+                    if (p[r] !== undefined) continue;
                     (T ??= []).push(p[r] = createOwner());
                     _[r] = runWithOwner(p[r], s);
                 }
@@ -6201,27 +6645,42 @@ function updateKeyedMap() {
                 if (T) for (n = 0; n < T.length; n++) T[n].dispose();
                 throw e;
             }
-            // 3) commit: land positions, then dispose exited rows
-                        for (r = u; r < t; r++) {
-                this.Vt[r] = _[r];
-                this.xt[r] = p[r];
+            // 3) commit: land the retained prefix and suffix plus the staged window
+            // into the fresh arrays, swap them in (new identity for downstream
+            // change propagation), then dispose exited rows
+                        for (n = 0; n < u; n++) {
+                _[n] = this.Ut[n];
+                p[n] = this.kt[n];
+                i && (i[n] = this.Ft[n]);
+                o && (o[n] = this.xt[n]);
+            }
+            for (r = u; r <= a; r++) {
+                if (i) setSignal(i[r], e[r]);
+                if (o) setSignal(o[r], r);
+            }
+            for (r = a + 1; r < t; r++) {
+                _[r] = this.Ut[r - O];
+                p[r] = this.kt[r - O];
                 if (i) {
-                    this.Ft[r] = i[r];
-                    setSignal(this.Ft[r], e[r]);
+                    i[r] = this.Ft[r - O];
+                    setSignal(i[r], e[r]);
                 }
                 if (o) {
-                    this.Wt[r] = o[r];
-                    setSignal(this.Wt[r], r);
+                    o[r] = this.xt[r - O];
+                    if (O !== 0) setSignal(o[r], r);
                 }
             }
-            if (d) for (n = 0; n < d.length; n++) d[n].dispose();
-            // 4) in case the new set is shorter than the old, set the length of the mapped array
-                        this.Vt = this.Vt.slice(0, this.Gt = t);
-            // 5) save a copy of the mapped items for the next update
-                        this.Ut = e.slice(0);
+            this.Ut = _;
+            this.kt = p;
+            i && (this.Ft = i);
+            o && (this.xt = o);
+            this.vt = t;
+            // save a copy of the mapped items for the next update
+                        this.Vt = e.slice(0);
+            if (S) for (n = 0; n < S.length; n++) S[n].dispose();
         }
     });
-    return this.Vt;
+    return this.Ut;
 }
 
 /**
@@ -6242,21 +6701,21 @@ function updateKeyedMap() {
     const r = t;
     const i = {
         wt: createOwner(),
-        Gt: 0,
-        jt: 0,
+        vt: 0,
+        Mt: 0,
         $t: e,
-        kt: r,
-        xt: [],
-        Vt: [],
-        Kt: n?.from,
+        Gt: r,
+        kt: [],
+        Ut: [],
+        jt: n?.from,
         Ht: n?.fallback
     };
     const o = computed(updateRepeat.bind(i));
     // Same as mapArray: untracked reads inside the internal owner resolve via
     // _parentComputed, so async reads in row callbacks register with the node
     // (pending tracking + post-settle retry) instead of vanishing.
-        i.wt.et = o;
-    o.ke &= ~CONFIG_AUTO_DISPOSE;
+        i.wt.Je = o;
+    o.Ge &= ~CONFIG_AUTO_DISPOSE;
     return accessor(o);
 }
 
@@ -6269,54 +6728,54 @@ function updateKeyedMap() {
 // disjoint-window/front-clear/end-clear/shift special cases.
 function updateRepeat() {
     const e = this.$t();
-    const t = this.Kt?.() || 0;
+    const t = this.jt?.() || 0;
     runWithOwner(this.wt, () => {
         if (e === 0) {
-            if (this.Gt !== 0) {
+            if (this.vt !== 0) {
                 this.wt.dispose(false);
-                this.xt = [];
-                this.Vt = [];
-                this.Gt = 0;
+                this.kt = [];
+                this.Ut = [];
+                this.vt = 0;
                 // Reset offset to match the cleared data (#2767, repro 2).
-                                this.jt = 0;
+                                this.Mt = 0;
             }
-            if (this.Ht && !this.Vt[0]) {
+            if (this.Ht && !this.Ut[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.xt[0]?.dispose();
-                this.Vt[0] = runWithOwner(this.xt[0] = createOwner(), this.Ht);
+                this.kt[0]?.dispose();
+                this.Ut[0] = runWithOwner(this.kt[0] = createOwner(), this.Ht);
             }
             return;
         }
         const n = t + e;
-        const r = this.jt + this.Gt;
+        const r = this.Mt + this.vt;
         // Retained overlap [keepStart, keepEnd) in global indexes; empty when the
         // windows are disjoint or when coming from empty/fallback.
-                const i = Math.max(t, this.jt);
+                const i = Math.max(t, this.Mt);
         const o = Math.min(n, r);
         const s = new Array(e);
         const u = new Array(e);
         for (let e = i; e < o; e++) {
-            u[e - t] = this.xt[e - this.jt];
-            s[e - t] = this.Vt[e - this.jt];
+            u[e - t] = this.kt[e - this.Mt];
+            s[e - t] = this.Ut[e - this.Mt];
         }
         try {
             for (let e = t; e < n; e++) {
                 if (e >= i && e < o) continue;
-                s[e - t] = runWithOwner(u[e - t] = createOwner(), () => this.kt(e));
+                s[e - t] = runWithOwner(u[e - t] = createOwner(), () => this.Gt(e));
             }
         } catch (e) {
             for (let e = t; e < n; e++) if ((e < i || e >= o) && u[e - t]) u[e - t].dispose();
             throw e;
         }
         // commit: dispose the previous fallback or the rows leaving the window
-                if (this.Gt === 0) this.xt[0]?.dispose(); else for (let e = this.jt; e < r; e++) if (e < t || e >= n) this.xt[e - this.jt].dispose();
-        this.Vt = s;
-        this.xt = u;
-        this.jt = t;
-        this.Gt = e;
+                if (this.vt === 0) this.kt[0]?.dispose(); else for (let e = this.Mt; e < r; e++) if (e < t || e >= n) this.kt[e - this.Mt].dispose();
+        this.Ut = s;
+        this.kt = u;
+        this.Mt = t;
+        this.vt = e;
     });
-    return this.Vt;
+    return this.Ut;
 }
 
 function compare(e, t, n) {
@@ -6327,23 +6786,23 @@ function boundaryComputed(e, t) {
     const n = computed(e, {
         lazy: true
     });
-    n.yt = (e, t) => {
+    n.Nt = (e, t) => {
         // Use passed values if provided, otherwise read from node
-        const r = e !== undefined ? e : n.We;
-        const i = t !== undefined ? t : n.me;
+        const r = e !== undefined ? e : n.xe;
+        const i = t !== undefined ? t : n.De;
         // Notify both status dimensions like a render effect does; the queue chain
         // consumes this boundary's own type and forwards the remainder upward until
         // a boundary that handles it is found.
-                n.We &= ~n.Yt;
-        const o = n.Ze.notify(n, STATUS_PENDING | STATUS_ERROR, r, i);
+                n.xe &= ~n.Kt;
+        const o = n.Be.notify(n, STATUS_PENDING | STATUS_ERROR, r, i);
         // The queue is the only propagation channel: a foreign status must not stay
         // reader-visible on the tree, or reads re-throw it across the boundary and
         // link unrelated ambient contexts (the #2809 nested-boundary loop). Deps are
         // untouched, so the tree still recomputes when the foreign source settles.
-                const s = r & ~n.Yt & (STATUS_PENDING | STATUS_ERROR);
+                const s = r & ~n.Kt & (STATUS_PENDING | STATUS_ERROR);
         if (s) {
-            n.We &= ~s;
-            if (n.me === i && !(n.We & (STATUS_PENDING | STATUS_ERROR))) n.me = undefined;
+            n.xe &= ~s;
+            if (n.De === i && !(n.xe & (STATUS_PENDING | STATUS_ERROR))) n.De = undefined;
         }
         // An ERROR the chain could not deliver to any boundary is uncaught. The
         // scrub above already removed it from reader-visible state, so without
@@ -6354,16 +6813,16 @@ function boundaryComputed(e, t) {
             throw i;
         }
     };
-    n.Yt = t;
-    n.ke &= ~CONFIG_AUTO_DISPOSE;
+    n.Kt = t;
+    n.Ge &= ~CONFIG_AUTO_DISPOSE;
     recompute(n, true);
     return n;
 }
 
 function createBoundChildren(e, t, n, r) {
-    const i = e.Ze;
-    i.addChild(e.Ze = n);
-    cleanup(() => i.removeChild(e.Ze));
+    const i = e.Be;
+    i.addChild(e.Be = n);
+    cleanup(() => i.removeChild(e.Be));
     return runWithOwner(e, () => {
         const e = computed(t);
         return boundaryComputed(() => flatten(read(e)), r);
@@ -6385,53 +6844,53 @@ function isRevealController(e) {
 }
 
 function isSlotReady(e) {
-    return isRevealController(e) ? e.qt() : e.Bt.size === 0 && !e.Zt;
+    return isRevealController(e) ? e.Yt() : e.qt.size === 0 && !e.Bt;
 }
 
 function isSlotMinimallyReady(e) {
-    return isRevealController(e) ? e.Xt() : isSlotReady(e);
+    return isRevealController(e) ? e.Zt() : isSlotReady(e);
 }
 
 function setSlotState(e, t, n, r) {
-    setSignal(e.zt, n);
-    setSignal(e.Jt, r);
+    setSignal(e.Xt, n);
+    setSignal(e.zt, r);
     if (isRevealController(e)) {
-        if (!n && e.en === t) e.en = undefined;
-        return e.tn(n, r);
+        if (!n && e.Jt === t) e.Jt = undefined;
+        return e.en(n, r);
     }
-    if (!n && e.nn === t && e.rn) e.nn = undefined;
+    if (!n && e.tn === t && e.nn) e.tn = undefined;
 }
 
 class RevealController {
+    rn;
     sn;
-    un;
-    ln=[];
-    en;
-    zt=signal(false, {
+    un=[];
+    Jt;
+    Xt=signal(false, {
         ownedWrite: true,
-        gt: true
+        Ct: true
     });
-    Jt=signal(false, {
+    zt=signal(false, {
         ownedWrite: true,
-        gt: true
+        Ct: true
     });
-    cn=true;
+    ln=true;
     an=true;
-    fn=false;
+    cn=false;
     constructor(e, t) {
-        this.sn = e;
-        this.un = t;
+        this.rn = e;
+        this.sn = t;
     }
-    En(e) {
-        for (let t = 0; t < this.ln.length; t++) {
-            const n = this.ln[t];
-            if ((isRevealController(n) ? n.en : n.nn) !== this) continue;
+    fn(e) {
+        for (let t = 0; t < this.un.length; t++) {
+            const n = this.un[t];
+            if ((isRevealController(n) ? n.Jt : n.tn) !== this) continue;
             if (e(n) === false) return false;
         }
         return true;
     }
-    qt() {
-        return this.En(isSlotReady);
+    Yt() {
+        return this.fn(isSlotReady);
     }
     /**
    * "Minimally ready" = this group has something visible to show under its own policy.
@@ -6439,13 +6898,13 @@ class RevealController {
    * - `together`: every direct slot is minimally ready.
    * - `sequential`: the first owned slot is minimally ready (frontier can advance).
    * - `natural`: any owned slot is minimally ready.
-   */    Xt() {
-        const e = untrack(this.sn);
-        if (e === "together") return this.En(isSlotMinimallyReady);
+   */    Zt() {
+        const e = untrack(this.rn);
+        if (e === "together") return this.fn(isSlotMinimallyReady);
         if (e === "natural") {
             let e = false;
             let t = false;
-            this.En(n => {
+            this.fn(n => {
                 e = true;
                 if (isSlotMinimallyReady(n)) {
                     t = true;
@@ -6456,45 +6915,45 @@ class RevealController {
         }
         // sequential: only the first owned slot matters.
                 let t = true;
-        this.En(e => {
+        this.fn(e => {
             t = isSlotMinimallyReady(e);
             return false;
         });
         return t;
     }
-    Sn(e) {
-        if (this.ln.includes(e)) return;
-        this.ln.push(e);
-        const t = untrack(this.sn);
-        setSignal(e.zt, true), setSignal(e.Jt, t === "sequential" ? !!untrack(this.un) : false);
-        untrack(() => this.tn());
+    En(e) {
+        if (this.un.includes(e)) return;
+        this.un.push(e);
+        const t = untrack(this.rn);
+        setSignal(e.Xt, true), setSignal(e.zt, t === "sequential" ? !!untrack(this.sn) : false);
+        untrack(() => this.en());
     }
     dn(e) {
-        const t = this.ln.indexOf(e);
-        if (t >= 0) this.ln.splice(t, 1);
-        untrack(() => this.tn());
-    }
-    tn(e, t) {
-        if (this.fn) return;
-        this.fn = true;
-        const n = this.cn;
+        const t = this.un.indexOf(e);
+        if (t >= 0) this.un.splice(t, 1);
+        untrack(() => this.en());
+    }
+    en(e, t) {
+        if (this.cn) return;
+        this.cn = true;
+        const n = this.ln;
         const r = this.an;
         try {
-            const n = e ?? read(this.zt), r = untrack(this.sn), i = r === "sequential" && !!untrack(this.un), o = t ?? i;
+            const n = e ?? read(this.Xt), r = untrack(this.rn), i = r === "sequential" && !!untrack(this.sn), o = t ?? i;
             if (n) {
                 // Held by an outer group. Propagate the hold (and whatever collapsed policy
                 // the outer asked for) down the whole subtree. Inner order is ignored while
                 // held; it resumes once the outer releases us.
-                this.En(e => setSlotState(e, this, true, o));
+                this.fn(e => setSlotState(e, this, true, o));
             } else if (r === "natural") {
                 // Each child reveals based on its own readiness. A nested controller slot
                 // is released to run its own order locally — we bypass setSlotState for it
                 // so the parent backpointer survives for upward readiness notifications.
-                this.En(e => {
+                this.fn(e => {
                     if (isRevealController(e)) {
-                        setSignal(e.Jt, false);
                         setSignal(e.zt, false);
-                        e.tn(false, false);
+                        setSignal(e.Xt, false);
+                        e.en(false, false);
                     } else {
                         setSlotState(e, this, !isSlotReady(e), false);
                     }
@@ -6505,11 +6964,11 @@ class RevealController {
                 // sequential's first slot being ready is minimally ready; natural having any
                 // ready child is minimally ready. This lets `together` guarantee a single
                 // cohesive reveal without waiting for every grandchild.
-                const e = this.En(isSlotMinimallyReady);
-                this.En(t => setSlotState(t, this, !e, false));
+                const e = this.fn(isSlotMinimallyReady);
+                this.fn(t => setSlotState(t, this, !e, false));
             } else {
                 let e = false;
-                this.En(t => {
+                this.fn(t => {
                     if (e) return setSlotState(t, this, true, i);
                     if (isSlotReady(t)) return setSlotState(t, this, false, false);
                     e = true;
@@ -6520,63 +6979,63 @@ class RevealController {
                     // advancing past this slot, and we bypass setSlotState so the parent
                     // backpointer survives for upward readiness notifications.
                                         if (isRevealController(t)) {
-                        setSignal(t.Jt, false);
                         setSignal(t.zt, false);
-                        t.tn(false, false);
+                        setSignal(t.Xt, false);
+                        t.en(false, false);
                     } else {
                         setSlotState(t, this, true, false);
                     }
                 });
             }
         } finally {
-            this.cn = this.qt();
-            this.an = this.Xt();
-            this.fn = false;
+            this.ln = this.Yt();
+            this.an = this.Zt();
+            this.cn = false;
         }
-        if (this.en && (n !== this.cn || r !== this.an)) this.en.tn();
+        if (this.Jt && (n !== this.ln || r !== this.an)) this.Jt.en();
     }
 }
 
 class CollectionQueue extends Queue {
+    Sn;
+    qt=new Set;
     Tn;
-    Bt=new Set;
-    _n;
-    Zt=true;
-    zt=signal(false, {
+    Bt=true;
+    Xt=signal(false, {
         ownedWrite: true,
-        gt: true
+        Ct: true
     });
-    me;
-    Jt=signal(false, {
+    De;
+    zt=signal(false, {
         ownedWrite: true,
-        gt: true
+        Ct: true
     });
-    nn;
-    rn=false;
-    pn;
-    On=ON_INIT;
+    tn;
+    nn=false;
+    On;
+    _n=ON_INIT;
     constructor(e) {
         super();
-        this.Tn = e;
+        this.Sn = e;
     }
     run(e) {
-        if (!e || read(this.zt) && (!_revealUsed || read(this.Jt))) return;
+        if (!e || read(this.Xt) && (!_revealUsed || read(this.zt))) return;
         return super.run(e);
     }
     notify(e, t, n, r) {
-        if (!(t & this.Tn)) return super.notify(e, t, n, r);
-        if (this.rn && this.pn) {
+        if (!(t & this.Sn)) return super.notify(e, t, n, r);
+        if (this.nn && this.On) {
             const e = untrack(() => {
                 try {
-                    return this.pn();
+                    return this.On();
                 } catch {
                     return ON_INIT;
                 }
             });
-            if (e !== this.On) {
-                this.On = e;
-                this.rn = false;
-                this.Bt.clear();
+            if (e !== this._n) {
+                this._n = e;
+                this.nn = false;
+                this.qt.clear();
             }
         }
         // Routing is dimension-independent: each boundary consumes only its own
@@ -6589,47 +7048,47 @@ class CollectionQueue extends Queue {
         // dimension, while a status already caught by an inner boundary arrives with
         // its dimension consumed from the mask and is correctly not re-routed
         // (the Loading > Errored > content composition escape, #2856).
-                if (this.Tn & STATUS_PENDING && this.rn) return super.notify(e, t, n, r);
-        if (n & this.Tn) {
-            this.Zt = true;
-            const t = r?.source || e.me?.source;
+                if (this.Sn & STATUS_PENDING && this.nn) return super.notify(e, t, n, r);
+        if (n & this.Sn) {
+            this.Bt = true;
+            const t = r?.source || e.De?.source;
             if (t) {
-                const e = this.Bt.size === 0;
-                this.Bt.add(t);
-                if (e) setSignal(this.zt, true);
-                if (this.Tn & STATUS_ERROR) {
-                    setSignal(this.me, unwrapStatusError(t.me));
+                const e = this.qt.size === 0;
+                this.qt.add(t);
+                if (e) setSignal(this.Xt, true);
+                if (this.Sn & STATUS_ERROR) {
+                    setSignal(this.De, unwrapStatusError(t.De));
                 }
             }
         }
-        t &= ~this.Tn;
+        t &= ~this.Sn;
         return t ? super.notify(e, t, n, r) : true;
     }
-    je() {
-        for (const e of this.Bt) {
+    Me() {
+        for (const e of this.qt) {
             // A source with a live affects() mark holds display state for the
             // mark's lifetime (the visual channel): the marked node carries no
             // status of its own, so the count is the liveness test. The release
             // sweep (finalizePureQueue after mark release) re-runs this check.
-            if (e.Le & REACTIVE_DISPOSED || !e.F && !(e.We & this.Tn) && !(this.Tn & STATUS_ERROR && e.We & STATUS_PENDING)) this.Bt.delete(e);
+            if (e.Le & REACTIVE_DISPOSED || !e.k && !(e.xe & this.Sn) && !(this.Sn & STATUS_ERROR && e.xe & STATUS_PENDING)) this.qt.delete(e);
         }
-        if (!this.Bt.size) {
-            if (this.Tn & STATUS_PENDING && this.Zt && !this.rn && this._n) {
-                this.Zt = !!(this._n.We & this.Tn);
+        if (!this.qt.size) {
+            if (this.Sn & STATUS_PENDING && this.Bt && !this.nn && this.Tn) {
+                this.Bt = !!(this.Tn.xe & this.Sn);
             } else {
-                this.Zt = false;
+                this.Bt = false;
             }
-            if (!this.Zt) {
-                setSignal(this.zt, false);
-                if (this.pn) {
+            if (!this.Bt) {
+                setSignal(this.Xt, false);
+                if (this.On) {
                     try {
-                        this.On = untrack(() => this.pn());
+                        this._n = untrack(() => this.On());
                     } catch {
                         /* value not yet committed — _prevOn stays stale, next notify will reset */}
                 }
             }
         }
-        if (_revealUsed) this.nn?.tn();
+        if (_revealUsed) this.tn?.en();
     }
 }
 
@@ -6637,12 +7096,12 @@ function createCollectionBoundary(e, t, n, r) {
     const i = createOwner();
     if (_revealUsed) setContext(RevealControllerContext, null, i);
     const o = new CollectionQueue(e);
-    if (e === STATUS_ERROR) o.me = signal(undefined, {
+    if (e === STATUS_ERROR) o.De = signal(undefined, {
         ownedWrite: true,
-        gt: true
+        Ct: true
     });
-    if (r) o.pn = r;
-    const s = o._n = createBoundChildren(i, t, o, e);
+    if (r) o.On = r;
+    const s = o.Tn = createBoundChildren(i, t, o, e);
     // Prime source tracking so reveal registration sees pending sources.
         untrack(() => {
         let t = false;
@@ -6651,23 +7110,23 @@ function createCollectionBoundary(e, t, n, r) {
         } catch (e) {
             if (e instanceof NotReadyError) t = true; else throw e;
         }
-        o.Zt = t || !!(s.We & e) || s.me instanceof NotReadyError;
+        o.Bt = t || !!(s.xe & e) || s.De instanceof NotReadyError;
     });
     const u = _revealUsed && e === STATUS_PENDING ? getContext(RevealControllerContext) : null;
     if (u) {
-        o.nn = u;
-        u.Sn(o);
+        o.tn = u;
+        u.En(o);
         cleanup(() => u.dn(o));
     }
     return accessor(computed(() => {
-        if (!read(o.zt)) {
+        if (!read(o.Xt)) {
             const e = read(s);
-            if (!untrack(() => read(o.zt))) return o.rn = true, e;
+            if (!untrack(() => read(o.Xt))) return o.nn = true, e;
         }
         // Collapsed reveal slots suppress their own output entirely; the
         // renderer treats the hole as empty, so the cast never leaks to users
         // outside a `createRevealOrder` scope.
-                if (_revealUsed && read(o.Jt)) return undefined;
+                if (_revealUsed && read(o.zt)) return undefined;
         return n(o);
     }, 
     // Boundary structure, not a user source: its value is fallback-or-content and
@@ -6675,7 +7134,7 @@ function createCollectionBoundary(e, t, n, r) {
     // by snapshot capture. The tree no longer carries foreign status flags, so
     // capture can't rely on PENDING to skip this node the way it used to.
     {
-        gt: true
+        Ct: true
     }));
 }
 
@@ -6728,8 +7187,8 @@ function createCollectionBoundary(e, t, n, r) {
  * }
  * ```
  */ function createErrorBoundary(e, t) {
-    return createCollectionBoundary(STATUS_ERROR, e, e => t(accessor(e.me), () => {
-        for (const t of e.Bt) recompute(t);
+    return createCollectionBoundary(STATUS_ERROR, e, e => t(accessor(e.De), () => {
+        for (const t of e.qt) recompute(t);
         schedule();
     }));
 }
@@ -6786,11 +7245,11 @@ function createCollectionBoundary(e, t, n, r) {
         computed(() => {
             i();
             o();
-            s.tn();
+            s.en();
         });
         if (r) {
-            s.en = r;
-            r.Sn(s);
+            s.Jt = r;
+            r.En(s);
             cleanup(() => r.dn(s));
         }
         return t;