@solidjs/signals 2.0.0-rc.2 → 2.0.0-rc.4

package/dist/prod/store/next/target.js

@@ -7,14 +7,23 @@ const ownedRaw = new WeakSet;
 
 /** raw → target. The only raw-keyed lookup; boundary mechanism (O8). */ const storeNextLookup = new WeakMap;
 
-function devAssertNeverUserMutation(o) {
+function devAssertNeverUserMutation(e) {
     return;
 }
 
 let optHooks = null;
 
-function setOptHooks(o) {
-    optHooks = o;
+function setOptHooks(e) {
+    optHooks = e;
 }
 
-export { devAssertNeverUserMutation, optHooks, ownedRaw, setOptHooks, storeNextLookup };
+/** Sticky descendants flag walk (§6d): reconcile's keyed pruning descends
+ * only where subscriptions exist at/below. Nodes AND patches count. */ function markDescendants(e) {
+    let t = e;
+    while (t && !t.d) {
+        t.d = true;
+        t = t.u;
+    }
+}
+
+export { devAssertNeverUserMutation, markDescendants, optHooks, ownedRaw, setOptHooks, storeNextLookup };

package/dist/prod/store/store.js

@@ -139,7 +139,7 @@ function ownEnumerableKeys(e) {
     // A live scope exists, so affects.ts already installed the mark engine.
     for (const [r, s] of affectsScopes) {
         if (r.o?.t && s.scope.has(t) && (s.key === undefined || s.key === o)) {
-            GlobalQueue.h(e);
+            GlobalQueue.M(e);
             s.inherited.push(e);
         }
     }
@@ -252,7 +252,7 @@ s) {
     // Callers guard on `pendingCheckActive`, which only flips inside
     // isPending() — the verdict layer is loaded and its hook installed.
     const o = e[STORE_NODE]?.[$AFFECTS];
-    if (o?.o?.t) GlobalQueue.Bt(o);
+    if (o?.o?.t) GlobalQueue.wt(o);
     if (affectsScopes.size) {
         // Chained backings (§7b): a wrapper's STORE_VALUE can be another store's
         // proxy — marks cover by identity of the BASE raw, so resolve the chain
@@ -263,7 +263,7 @@ s) {
                 let t = r;
                 for (;;) {
                     if (s.scope.has(t)) {
-                        GlobalQueue.Bt(e);
+                        GlobalQueue.wt(e);
                         break;
                     }
                     const o = t?.[$TARGET];
@@ -288,11 +288,11 @@ s) {
  *
  * @internal
  */ function getStoreAffectsNodes(e, t) {
-    GlobalQueue.G ||= e => {
+    GlobalQueue.p ||= e => {
         const t = affectsScopes.get(e);
         if (!t) return;
         affectsScopes.delete(e);
-        for (let e = 0; e < t.inherited.length; e++) GlobalQueue.j(t.inherited[e]);
+        for (let e = 0; e < t.inherited.length; e++) GlobalQueue.N(t.inherited[e]);
     };
     if (t === undefined) {
         const t = nextAffectsNodeResolver(e, $AFFECTS);

package/dist/types/core/core.d.ts

@@ -38,7 +38,21 @@ export declare function ext(el: {
  * mode (recompute is called explicitly by `effect()`), so we hardcode the lazy bits and skip
  * the auto-dispose CONFIG bit (effect() previously cleared it post-construction).
  */
-export declare function createEffectNode<T>(fn: (prev?: T) => T, effectFn: (val: T, prev: T | undefined) => void | (() => void), errorFn: ((err: unknown, cleanup: () => void) => void | (() => void)) | undefined, type: number, notifyStatus: ((status?: number, error?: any) => void) | undefined, options: NodeOptions<T> | undefined): any;
+export declare function createEffectNode<T>(fn: (prev?: T) => T, effectFn: (val: T, prev: T | undefined) => void | (() => void), errorFn: ((err: unknown, cleanup: () => void) => void | (() => void)) | undefined, type: number, options: NodeOptions<T> | undefined): any;
+/**
+ * The shared status notifier for effect nodes, installed once by effect.ts
+ * at module evaluation (`this`-dispatched — one function serves every
+ * effect, so nodes never store it). Boundary computeds keep their own
+ * per-node channel on `_x._notifyStatus`, which takes precedence.
+ */
+export declare let effectStatusNotify: ((this: any, status?: number, error?: any) => void) | null;
+export declare function setEffectStatusNotify(fn: NonNullable<typeof effectStatusNotify>): void;
+/** Resolve a node's status notifier: an own `_x` channel (boundaries) wins;
+ * effect nodes (`_type` — EFFECT_PURE is 0, and only effect literals carry
+ * the field) fall back to the shared notifier. Presence doubles as the
+ * "display consumer" membership test in the status walks, exactly as the
+ * per-node field did when every effect carried one. */
+export declare function statusNotifierOf(el: any): ((this: any, status?: number, error?: any) => void) | undefined;
 export declare function signal<T>(v: T, options?: NodeOptions<T>): Signal<T>;
 export declare function signal<T>(v: T, options?: NodeOptions<T>, firewall?: Computed<any>): FirewallSignal<T>;
 export declare function optimisticSignal<T>(v: T, options?: NodeOptions<T>): Signal<T>;

package/dist/types/core/dev.d.ts

@@ -33,6 +33,14 @@ export interface DiagnosticCapture {
 export interface Diagnostics {
     subscribe(listener: DiagnosticListener): () => void;
     capture(): DiagnosticCapture;
+    /**
+     * Registers a console footer printed after the first console report of
+     * each diagnostic code — a discovery pointer to deeper guidance (e.g.
+     * solid-js registers its shipped repair skill). Returning undefined for
+     * an event suppresses the footer. Passing undefined unregisters and
+     * resets the once-per-code memory.
+     */
+    setConsoleFooter(footer: ((event: DiagnosticEvent) => string | undefined) | undefined): void;
 }
 export interface Dev {
     hooks: DevHooks;

package/dist/types/core/graph.d.ts

@@ -3,4 +3,26 @@ export declare function unlinkSubs(link: Link): Link | null;
 export declare function trimStaleDeps(el: Computed<any>): void;
 export declare function clearDeps(el: Computed<unknown>): void;
 export declare function unobserved(el: Computed<unknown>): void;
+/**
+ * Deferred dormancy for never-observed auto-dispose computeds (#3078).
+ *
+ * An untracked top-level read of a subscriber-less observation-lifecycle memo
+ * used to call unobserved() inline at the end of read(). That kept the leak
+ * closed (the compute links the memo into its deps' sub lists — without a
+ * teardown point a never-observed memo is retained by its sources forever;
+ * upstream alien-signals has exactly this retention), but it made reads
+ * destructive: each read disposed the node, the next read revived it with a
+ * full recompute in whatever ambient transition/lane context happened to be
+ * current, so consecutive reads could return different answers with no write
+ * in between.
+ *
+ * Instead, reads queue the node here and the scheduler sweeps at the top of
+ * the next flush (before runHeap, so a same-tick dirtying is reclaimed
+ * instead of recomputed). Reads become idempotent within a tick (the node
+ * stays alive and serves its cache, uniform with observed memos) while
+ * reclamation still happens within one microtask — the enqueue site arms
+ * schedule(), so a flush is guaranteed even when no other work is queued.
+ */
+export declare const dormantNodes: Set<Computed<unknown>>;
+export declare function sweepDormant(): void;
 export declare function link(dep: Signal<any> | Computed<any>, sub: Computed<any>, pendingObserver?: boolean): void;

package/dist/types/core/invariants.d.ts

@@ -2,7 +2,7 @@ import type { OptimisticLane } from "./lanes.js";
 import type { Computed, Signal } from "./types.js";
 /**
  * Test-mode invariant checks for the async/transition/lane machinery.
- * Catalog and rationale: packages/solid-signals/INTERNALS-ASYNC-STATE.md.
+ * Catalog and rationale: packages/signals/INTERNALS-ASYNC-STATE.md.
  *
  * These are implementation self-consistency checks, not semantic rules: a
  * violation means the reactive system contradicted itself.

package/dist/types/core/scheduler.d.ts

@@ -103,6 +103,10 @@ export declare class GlobalQueue extends Queue {
     static _transitionBlocked: ((transition: Transition) => boolean) | null;
     static _cleanupLanes: ((completingTransition: Transition | null) => void) | null;
     static _runLaneEffects: ((type: number) => void) | null;
+    /** Patch-channel optimistic drain (next/patch.ts): optimistic emissions
+     * apply at lane-effect timing — visible in flight, unlike the regular
+     * effect queues an action stashes. Injected; null when unused. */
+    static _drainPatchOptimistic: (() => void) | null;
     static _gatedRead: ((el: Signal<any>, owner: OptimisticNode, c: Computed<any>) => boolean) | null;
     static _laneSuspends: ((owner: OptimisticNode) => boolean) | null;
     static _laneReadsCommitted: ((el: OptimisticNode, owner: OptimisticNode, c: Computed<any>) => boolean) | null;
@@ -126,6 +130,14 @@ export declare function armReaskClear(): void;
 export declare function insertSubs(node: Signal<any> | Computed<any>, optimistic?: boolean): void;
 export declare let storeCommitHook: (() => void) | null;
 export declare function setStoreCommitHook(fn: () => void): void;
+/** Patch-channel release hook (next/patch.ts): transition-stamped patch
+ * emissions are released when THEIR batch commits. Transitions never
+ * abort: failed actions still commit (only optimistic overrides revert),
+ * and merged-away transitions hand their stash to the survivor
+ * (mergeTransitionState) — every stash drains exactly once. Injected like
+ * storeCommitHook to stay tree-shakeable. */
+export declare let patchCommitHook: ((batch: Transition) => void) | null;
+export declare function setPatchCommitHook(fn: (batch: Transition) => void): void;
 export declare function finalizePureQueue(completingTransition?: Transition | null, incomplete?: boolean): void;
 /**
  * Count of live `affects()` registrations across the system (including

package/dist/types/store/index.d.ts

@@ -4,6 +4,8 @@ export { isWrappable, $TRACK, $PROXY, $TARGET } from "./store.js";
 import type { NoFn, ProjectionOptions, Store, StoreOptions, StoreSetter } from "./store.js";
 import type { Refreshable } from "../core/index.js";
 export { createProjectionNext as createProjection } from "./next/projection.js";
+export { registerPatch, registerRowOps, registerSlotPatchNext as registerSlotPatch, patchableRaw } from "./next/patch.js";
+export { storeIsShallow, storeHasFamily, storeHasOptimisticFamily } from "./next/store.js";
 export { createOptimisticStoreNext as createOptimisticStore } from "./next/optimistic.js";
 /** Public createStore: plain form `(init, options?)` and derived writable
  * form `(fn, seed, options?)`. */

package/dist/types/store/next/patch-hooks.d.ts

@@ -0,0 +1,41 @@
+import type { StoreNextTarget } from "./target.js";
+import type { RowOps } from "./patch.js";
+/**
+ * Patch-channel emission seams (pay-for-use). The store/reconcile/optimistic
+ * write paths emit through these installed hook objects instead of importing
+ * `patch.js` statically, so the channel tree-shakes out of apps that never
+ * register a patch consumer.
+ *
+ * TWO TIERS, armed at registration (patch.js installs them; it is retained
+ * only through its registration exports, which only compiled patch-mode
+ * output — via the web runtime's driver module — imports):
+ * - VALUE hooks (`patchHooks`): record patches. Armed by `registerPatch` —
+ *   present in any bundle with one eligible template under patch mode.
+ * - ROW hooks (`rowHooks`): list structure (row ops, slot ticks, the
+ *   identity/keyed diff builders in reconcile.js they drag in). Armed by
+ *   `registerRowOps`/`registerSlotPatchNext` — the LIST driver's
+ *   registrations, so value-only bundles never retain the row machinery.
+ *
+ * Soundness: every emission site is guarded by the matching `pc` channel
+ * (`pc.p` for value, `pc.ro`/`pc.sp` for rows), and a target can only
+ * acquire that channel through the corresponding registration — so each
+ * hook object is installed by the time any guard passes. Type-only imports
+ * from `patch.js` are erased.
+ */
+export interface PatchValueHooks {
+    emitPatch(t: StoreNextTarget, next: any, prev: any): void;
+    emitPatchLocal(t: StoreNextTarget, next: any, prev: any): void;
+    emitPatchOptimistic(t: StoreNextTarget, next: any, prev: any): void;
+    hasPatches(): boolean;
+    demoteToEffects(t: StoreNextTarget): void;
+}
+export interface PatchRowHooks {
+    emitRowOps(t: StoreNextTarget, next: any[], ops: RowOps): void;
+    emitSlotPatch(t: StoreNextTarget, index: number, next: any, prev: any): void;
+    emitSetterRowOps(t: StoreNextTarget, prevRows: any[], nextRows: any[]): void;
+    emitRowOpsOptimistic(t: StoreNextTarget, next: any[] | null, ops: RowOps | null): void;
+}
+export declare let patchHooks: PatchValueHooks | null;
+export declare let rowHooks: PatchRowHooks | null;
+export declare function installPatchHooks(hooks: PatchValueHooks): void;
+export declare function installRowHooks(hooks: PatchRowHooks): void;

package/dist/types/store/next/patch.d.ts

@@ -0,0 +1,91 @@
+import type { Owner } from "../../core/types.js";
+import { type StoreNextTarget } from "./target.js";
+export type PatchFn = (next: any, prev: any, force?: boolean) => void;
+interface PatchEntry {
+    fn: PatchFn;
+    owner: Owner | null;
+}
+/**
+ * Emit a record's visibility transition. Callers gate on `hasPatches()` and
+ * `t.d` cheaply; this function re-checks and walks ancestors (§4b).
+ */
+export declare function emitPatch(t: StoreNextTarget, next: any, prev: any): void;
+/** Emission for sites that already stand at the record with both sides in
+ * hand and have already handled ancestors (the adoption walk descends —
+ * parents were visited first), so no bubbling walk. */
+export declare function emitPatchLocal(t: StoreNextTarget, next: any, prev: any): void;
+export declare function emitPatchOptimistic(t: StoreNextTarget, next: any, prev: any): void;
+/** Row-ops emission at OPTIMISTIC (lane) timing: user drafts on an
+ * optimistic family must show structure IN FLIGHT — bypassing the
+ * transition stash exactly like emitPatchOptimistic. Two forms:
+ * - `ops` given (write site): `nextRows` is the draft's intended visible
+ *   list, ops the identity diff against the pre-write optimistic view.
+ * - `ops === null` (revert site): RESYNC — the consumer rebuilds retention
+ *   by row identity against the live post-revert view, resolved from the
+ *   target at drain time (overrides are gone by then, so `pb ?? v` IS the
+ *   committed truth). */
+export declare function emitRowOpsOptimistic(t: StoreNextTarget, nextRows: any[] | null, ops: RowOps | null): void;
+/** Test-only accounting probe: the live registration count must return to
+ * baseline across register/unbind/demote cycles. @internal */
+export declare function patchCountForTests(): number;
+export declare function hasPatches(): boolean;
+export declare function registerPatch(record: any, fn: PatchFn): () => void;
+/** Dual-driver bind probe (compiler runtime contract): when `record` is a
+ * patchable store record, returns its CURRENT raw backing (the driver's
+ * initial force-apply reads it directly — no proxy traffic, no tracking);
+ * returns undefined otherwise (driver falls back to the effect path).
+ * Not patchable: non-records, non-proxies, accessor-bearing records
+ * (patches read raw — getters need tracked evaluation), broken chains. */
+export declare function patchableRaw(record: any): Record<PropertyKey, any> | undefined;
+/** Accessor demotion (design §5): a record that acquires an accessor after
+ * registration stops being patchable — reads must go through tracked
+ * evaluation. Clears patches and repairs the global count; callers re-drive
+ * the pulled bodies (demoteToEffects). */
+export declare function demotePatches(t: StoreNextTarget): PatchEntry[] | null;
+/** The demotion re-drive (re-audit blocker 3): each pulled body becomes the
+ * SAME dual-driver effect fallback the web runtime would have chosen had the
+ * record carried the accessor at bind — a tracked compute pass (next === prev
+ * short-circuits every compare into a pure read THROUGH THE PROXY, so getter
+ * dependencies track) plus an untracked force-apply at effect timing.
+ *
+ * Creation is DEFERRED to the effect phase: the trap that discovers the
+ * accessor runs mid-draft, and an effect's initial pass must not read
+ * through the proxy inside the write window. The record's own transition
+ * for that draft is covered by the new effect's initial force-apply.
+ *
+ * Known edge (documented): a demoted LIST-ROW body re-drives under its
+ * registering owner (the list owner), so per-row severing on removal is
+ * lost for demoted rows — the effect lives until the LIST disposes. Rows
+ * only demote when user code defines an accessor on a row record at
+ * runtime. */
+export declare function demoteToEffects(t: StoreNextTarget): void;
+/** Structural ops for one keyed-array transition. `prefix` rows key-matched
+ * in place; for each later index i (absolute), `sources[i - prefix]` is the
+ * OLD index its row retained from, or -1 for a new row. `removed` holds the
+ * dropped old row values (unbind/teardown handles). Aligned value ticks emit
+ * NOTHING — ops exist only when structure changed. */
+export interface RowOps {
+    prefix: number;
+    sources: number[];
+    removed: any[];
+}
+/** `ops === null` is the RESYNC form (optimistic revert): the consumer
+ * rebuilds retention by row identity against `next` (the live view). */
+export type RowOpsFn = (next: any[], ops: RowOps | null) => void;
+/** Register a structural-ops consumer on a keyed store array (the list
+ * container's channel — what `For` consumes through the seam). */
+export declare function registerRowOps(array: any, fn: RowOpsFn): () => void;
+/** Slot patches (shallow arrays) ride the same apply queue: the walk emits
+ * per aligned value-replaced slot; application happens at effect phase under
+ * the registration owner's lifetime. */
+export declare function emitSlotPatch(t: StoreNextTarget, index: number, next: any, prev: any): void;
+/** Slot patch for shallow arrays: the reconcile walk emits (index, next,
+ * prev) for KEY-ALIGNED value-replaced slots (structure rides row ops), and
+ * the emission queues through the patch apply queue — effect-phase timing,
+ * transition stamping, disposed-owner drop — like every other channel. */
+export declare function registerSlotPatchNext(arr: any, fn: (index: number, next: any, prev: any) => void): () => void;
+/** Row-ops ride the SAME apply queue/timing as record patches: transition-
+ * stamped, applied at effect phase, in emission order (structure before the
+ * new rows' own patches can exist; retained rows' value patches commute). */
+export declare function emitRowOps(t: StoreNextTarget, next: any[], ops: RowOps): void;
+export {};

package/dist/types/store/next/reconcile.d.ts

@@ -1,3 +1,17 @@
+import type { RowOps } from "./patch.js";
+import { type StoreNextTarget } from "./target.js";
 type KeyFn = (item: any) => any;
 export declare function reconcileNextState(value: any, state: any, key: string | KeyFn | null | undefined, replace?: boolean): void;
+/** Key equality for EVERY key comparison in this module (re-audit 2, P1-5):
+ * SameValueZero, matching the Map-based matchers (buildRowOps, the adoption
+ * window) — NaN keys are equal to themselves, so aligned NaN rows stay
+ * aligned in the prefix walk instead of forever misaligning. Adoption and
+ * row ops MUST agree on key equality or retained DOM rows go stale. */
+export declare function sameKey(a: any, b: any): boolean;
+export declare function emitSetterRowOps(t: StoreNextTarget, prevRows: any[], nextRows: any[]): void;
+/** Identity-keyed structural diff, returned rather than emitted: shared by
+ * the setter channel (regular queue) and the OPTIMISTIC write channel (lane
+ * queue) — same retention semantics, different dispatch timing. Returns
+ * null when the lists are identity-aligned (no structure changed). */
+export declare function buildIdentityRowOps(prevRows: any[], nextRows: any[]): RowOps | null;
 export {};

package/dist/types/store/next/store.d.ts

@@ -1,5 +1,7 @@
 import type { Signal } from "../../core/types.js";
-import { type StoreNextFamily, type StoreNextTarget } from "./target.js";
+import { type StoreNextFamily, type StoreNextTarget, type PatchChannel } from "./target.js";
+/** Lazily allocate the patch-channel extension (one literal shape). */
+export declare function pcOf(t: StoreNextTarget): PatchChannel;
 export declare function wrapNext<T extends Record<PropertyKey, any>>(value: T, parent?: StoreNextTarget | null, parentKey?: PropertyKey | null, fam?: StoreNextFamily | null): T;
 /** Unwrap our own proxies to their current backing; leave everything else. */
 export declare function unwrapValue(v: any): any;
@@ -9,6 +11,10 @@ export declare function getKeySetNode(target: StoreNextTarget): Signal<number>;
 /** Deep-witness bump: any value/shape change on a record with a live deep()
  * subscriber notifies it. One null check when unused. */
 export declare function bumpDeep(t: StoreNextTarget): void;
+/** Scanned plainness for patch admission (patchableRaw): runs the one-time
+ * accessor scan if it hasn't happened yet — the sticky `a` flag alone is not
+ * trustworthy before a scan (it starts false and is discovered lazily). */
+export declare function targetIsPlain(target: StoreNextTarget): boolean;
 /** Downgrade a prototype-overlay pending backing to the clone path: builds
  * the real container (committed + overlay writes − deletes) that fold will
  * SWAP in as the committed backing, exactly as if the draft had started on
@@ -63,8 +69,30 @@ export type SetStoreNextFunction<T> = (fn: (draft: T) => T | void) => void;
  * projection recomputes legitimately write from inside their computed. */
 export declare function storeSetterNext<T>(proxy: T, fn: (draft: T) => T | void, guard?: boolean): void;
 export declare function createStoreNext<T extends Record<PropertyKey, any>>(init: T, shallow?: boolean): [T, SetStoreNextFunction<T>];
+/** True when `proxy` is a SHALLOW store (children served verbatim, slots
+ * replaced by reference — #2932). The list driver uses this to choose the
+ * slot-patch channel (collected row bodies) over per-record registration. */
+export declare function storeIsShallow(proxy: any): boolean;
+/** True when `proxy` belongs to a projection/optimistic FAMILY. The list
+ * driver must DECLINE family arrays (external audit finding): family
+ * structural changes never emit row/slot ops (the setter channel is
+ * fam-gated; optimistic writes ride node overrides), and the proxy identity
+ * is stable so the each-watch cannot catch the change either — an engaged
+ * list would freeze on optimistic/projection structural updates. Record-
+ * level family patches are unaffected (they have their own emission). */
+export declare function storeHasFamily(proxy: any): boolean;
+/** True when `proxy` belongs to an OPTIMISTIC family specifically. The list
+ * driver declines these (audit finding, narrowed): optimistic user writes
+ * ride node-level overrides — they never enter the reconcile walk, so no
+ * row/slot ops are emitted and an engaged list would freeze on optimistic
+ * structural changes. PROJECTION (non-optimistic) families are drivable:
+ * their recomputes go through the reconcile walk, whose emissions are
+ * transition-stamped in the apply queue like any other (equivalence-matrix
+ * gated). Re-admitting optimistic families requires a lane-timed structural
+ * emission mirroring emitPatchOptimistic, plus revert resync. */
+export declare function storeHasOptimisticFamily(proxy: any): boolean;
 /** Tracking deep snapshot (`deep()` for next targets): subscribes to the
- * key-set and every property node at every reachable level, then returns the
+ * key-set and deep-witness node at every reachable level, then returns the
  * plain view. Shared references and cycles handled via the visited set. */
 export declare function deepNext<T>(value: T): T;
 /**

package/dist/types/store/next/target.d.ts

@@ -12,7 +12,7 @@
  * entry per read-through object; zero layer slots; nodes, has-nodes, and the
  * key-set node are lazy, materialized only by subscription.
  */
-import type { Computed, Signal } from "../../core/types.js";
+import type { Computed, Owner, Signal } from "../../core/types.js";
 /** Projection family (§7b): children wrap into the family's own map (writes
  * land in the projection, never the source family), and every node created
  * under the family carries the projection computed as its firewall. */
@@ -32,6 +32,40 @@ export interface StoreNextFamily {
     node: Computed<any> | null;
     shallow?: boolean;
 }
+/** Write-side patch-channel state (stage 2), grouped off the target's named
+ * fields — see the shape rule on `StoreNextTarget.pc`. One literal shape,
+ * allocated by `pcOf` on first use. */
+export interface PatchChannel {
+    /** Slot-patch hooks for shallow arrays — the reconcile walk emits
+     * (i, next, prev) for key-aligned value-replaced slots through the patch
+     * apply queue (records are raw, no per-record targets exist).
+     * MULTI-CONSUMER (external audit): one array can drive several lists. */
+    sp: {
+        fn: (index: number, next: any, prev: any) => void;
+        owner: Owner | null;
+    }[] | null;
+    /** Patch-channel consumers (next/patch.ts): per-record compiled patch
+     * entries, multi-consumer. null when unpatched (the common case). */
+    p: object[] | null;
+    /** Same-batch coalescing stamp (re-audit 2/3): the container array this
+     * channel last pushed a non-forced SELF entry into, plus that entry. A
+     * later same-batch emission UPDATES the queued entry's `next` in place
+     * (latest state wins — adoption REPLACES the captured object, so dropping
+     * the later emission would apply stale state) while `prev` stays the
+     * batch's earliest. The drain clears both stamps so a quiet record
+     * retains nothing from its last batch. */
+    qa: unknown;
+    qe: unknown;
+    /** Row-ops consumers (next/patch.ts, PR-B): structural list ops —
+     * (nextRows, { prefix, sources, removed }) at apply timing. */
+    ro: object[] | null;
+    /** Keys written through the traps since the last fold commit. Bounds the
+     * setter notify/hold-check to O(written) instead of O(subscribed nodes) —
+     * a record with thousands of per-key subscriptions (selection maps) would
+     * otherwise pay a full node scan on every write. null = no trap writes
+     * this batch (bulk paths fall back to the full scan). */
+    wk: Set<PropertyKey> | null;
+}
 export interface StoreNextTarget {
     /** Committed backing: source object (shared) or owned clone. */
     v: Record<PropertyKey, any>;
@@ -47,6 +81,15 @@ export interface StoreNextTarget {
     h: Record<PropertyKey, Signal<boolean>> | null;
     /** Lazy key-set node: membership/iteration/$TRACK subscriptions (§6). */
     k: Signal<number> | null;
+    /** Patch-channel extension (lazily allocated on first use): groups the
+     * write-side stage-2 fields so they never widen the TARGET's own named
+     * field count. LOAD-BEARING SHAPE RULE: array proxy targets carry their
+     * fields as named properties on a real array, and V8 normalizes an array
+     * to dictionary properties as the named count grows (empirically at
+     * counts ≡ 0 mod 3 from 18 up on V8 13.x) — every trap field read then
+     * becomes a hash lookup (~15% uibench, tree suites worst). New
+     * patch-channel state MUST go inside this object, not on the target. */
+    pc: PatchChannel | null;
     /** Lazy deep-witness node: `deep()` subscribes ONE node per record instead
      * of one per path; write paths bump it only when it exists. Separate from
      * `k` so $TRACK/mapArray never rerun on leaf value changes (R9). */
@@ -79,17 +122,21 @@ export interface StoreNextTarget {
     /** Keys deleted in the overlay window (a prototype overlay cannot shadow
      * a delete); null when none. */
     del: Set<PropertyKey> | null;
-    /** Keys written through the traps since the last fold commit. Bounds the
-     * setter notify/hold-check to O(written) instead of O(subscribed nodes) —
-     * a record with thousands of per-key subscriptions (selection maps) would
-     * otherwise pay a full node scan on every write. null = no trap writes
-     * this batch (bulk paths fall back to the full scan); WK_ALL sentinel =
-     * bound unusable this batch (array length write implies index deletes). */
-    wk: Set<PropertyKey> | null;
     /** Projection family, null for plain stores (§7b). */
     fam: StoreNextFamily | null;
     /** Shallow store root (values served raw). */
     s: boolean;
+    /** Held committed view (#3074/#3075): the pre-hold committed backing,
+     * served to committed-visibility readers while `ht` is live. Adoption is
+     * eager by contract, but a projection recompute deriving from uncommitted
+     * inputs (a transition-held source, or a latest()-pull ahead of the flush)
+     * swaps the backing SPECULATIVELY — the old view must stay servable until
+     * the hold resolves. */
+    hv: Record<PropertyKey, any> | null;
+    /** The holder for `hv`: a live transition (cleared lazily when it is done)
+     * or the PLAIN_HOLD sentinel (a latest()-pull staging — cleared by the
+     * fold commit). null = no hold. */
+    ht: any;
 }
 /**
  * Ownership (first cut, decision 2026-08-16d): one WeakSet of store-owned
@@ -115,3 +162,6 @@ export interface OptStoreHooks {
 }
 export declare let optHooks: OptStoreHooks | null;
 export declare function setOptHooks(h: OptStoreHooks): void;
+/** Sticky descendants flag walk (§6d): reconcile's keyed pruning descends
+ * only where subscriptions exist at/below. Nodes AND patches count. */
+export declare function markDescendants(target: StoreNextTarget): void;

package/dist/types-cjs/core/core.d.cts

@@ -38,7 +38,21 @@ export declare function ext(el: {
  * mode (recompute is called explicitly by `effect()`), so we hardcode the lazy bits and skip
  * the auto-dispose CONFIG bit (effect() previously cleared it post-construction).
  */
-export declare function createEffectNode<T>(fn: (prev?: T) => T, effectFn: (val: T, prev: T | undefined) => void | (() => void), errorFn: ((err: unknown, cleanup: () => void) => void | (() => void)) | undefined, type: number, notifyStatus: ((status?: number, error?: any) => void) | undefined, options: NodeOptions<T> | undefined): any;
+export declare function createEffectNode<T>(fn: (prev?: T) => T, effectFn: (val: T, prev: T | undefined) => void | (() => void), errorFn: ((err: unknown, cleanup: () => void) => void | (() => void)) | undefined, type: number, options: NodeOptions<T> | undefined): any;
+/**
+ * The shared status notifier for effect nodes, installed once by effect.ts
+ * at module evaluation (`this`-dispatched — one function serves every
+ * effect, so nodes never store it). Boundary computeds keep their own
+ * per-node channel on `_x._notifyStatus`, which takes precedence.
+ */
+export declare let effectStatusNotify: ((this: any, status?: number, error?: any) => void) | null;
+export declare function setEffectStatusNotify(fn: NonNullable<typeof effectStatusNotify>): void;
+/** Resolve a node's status notifier: an own `_x` channel (boundaries) wins;
+ * effect nodes (`_type` — EFFECT_PURE is 0, and only effect literals carry
+ * the field) fall back to the shared notifier. Presence doubles as the
+ * "display consumer" membership test in the status walks, exactly as the
+ * per-node field did when every effect carried one. */
+export declare function statusNotifierOf(el: any): ((this: any, status?: number, error?: any) => void) | undefined;
 export declare function signal<T>(v: T, options?: NodeOptions<T>): Signal<T>;
 export declare function signal<T>(v: T, options?: NodeOptions<T>, firewall?: Computed<any>): FirewallSignal<T>;
 export declare function optimisticSignal<T>(v: T, options?: NodeOptions<T>): Signal<T>;

package/dist/types-cjs/core/dev.d.cts

@@ -33,6 +33,14 @@ export interface DiagnosticCapture {
 export interface Diagnostics {
     subscribe(listener: DiagnosticListener): () => void;
     capture(): DiagnosticCapture;
+    /**
+     * Registers a console footer printed after the first console report of
+     * each diagnostic code — a discovery pointer to deeper guidance (e.g.
+     * solid-js registers its shipped repair skill). Returning undefined for
+     * an event suppresses the footer. Passing undefined unregisters and
+     * resets the once-per-code memory.
+     */
+    setConsoleFooter(footer: ((event: DiagnosticEvent) => string | undefined) | undefined): void;
 }
 export interface Dev {
     hooks: DevHooks;

package/dist/types-cjs/core/graph.d.cts

@@ -3,4 +3,26 @@ export declare function unlinkSubs(link: Link): Link | null;
 export declare function trimStaleDeps(el: Computed<any>): void;
 export declare function clearDeps(el: Computed<unknown>): void;
 export declare function unobserved(el: Computed<unknown>): void;
+/**
+ * Deferred dormancy for never-observed auto-dispose computeds (#3078).
+ *
+ * An untracked top-level read of a subscriber-less observation-lifecycle memo
+ * used to call unobserved() inline at the end of read(). That kept the leak
+ * closed (the compute links the memo into its deps' sub lists — without a
+ * teardown point a never-observed memo is retained by its sources forever;
+ * upstream alien-signals has exactly this retention), but it made reads
+ * destructive: each read disposed the node, the next read revived it with a
+ * full recompute in whatever ambient transition/lane context happened to be
+ * current, so consecutive reads could return different answers with no write
+ * in between.
+ *
+ * Instead, reads queue the node here and the scheduler sweeps at the top of
+ * the next flush (before runHeap, so a same-tick dirtying is reclaimed
+ * instead of recomputed). Reads become idempotent within a tick (the node
+ * stays alive and serves its cache, uniform with observed memos) while
+ * reclamation still happens within one microtask — the enqueue site arms
+ * schedule(), so a flush is guaranteed even when no other work is queued.
+ */
+export declare const dormantNodes: Set<Computed<unknown>>;
+export declare function sweepDormant(): void;
 export declare function link(dep: Signal<any> | Computed<any>, sub: Computed<any>, pendingObserver?: boolean): void;

package/dist/types-cjs/core/invariants.d.cts

@@ -2,7 +2,7 @@ import type { OptimisticLane } from "./lanes.cjs";
 import type { Computed, Signal } from "./types.cjs";
 /**
  * Test-mode invariant checks for the async/transition/lane machinery.
- * Catalog and rationale: packages/solid-signals/INTERNALS-ASYNC-STATE.md.
+ * Catalog and rationale: packages/signals/INTERNALS-ASYNC-STATE.md.
  *
  * These are implementation self-consistency checks, not semantic rules: a
  * violation means the reactive system contradicted itself.

package/dist/types-cjs/core/scheduler.d.cts

@@ -103,6 +103,10 @@ export declare class GlobalQueue extends Queue {
     static _transitionBlocked: ((transition: Transition) => boolean) | null;
     static _cleanupLanes: ((completingTransition: Transition | null) => void) | null;
     static _runLaneEffects: ((type: number) => void) | null;
+    /** Patch-channel optimistic drain (next/patch.ts): optimistic emissions
+     * apply at lane-effect timing — visible in flight, unlike the regular
+     * effect queues an action stashes. Injected; null when unused. */
+    static _drainPatchOptimistic: (() => void) | null;
     static _gatedRead: ((el: Signal<any>, owner: OptimisticNode, c: Computed<any>) => boolean) | null;
     static _laneSuspends: ((owner: OptimisticNode) => boolean) | null;
     static _laneReadsCommitted: ((el: OptimisticNode, owner: OptimisticNode, c: Computed<any>) => boolean) | null;
@@ -126,6 +130,14 @@ export declare function armReaskClear(): void;
 export declare function insertSubs(node: Signal<any> | Computed<any>, optimistic?: boolean): void;
 export declare let storeCommitHook: (() => void) | null;
 export declare function setStoreCommitHook(fn: () => void): void;
+/** Patch-channel release hook (next/patch.ts): transition-stamped patch
+ * emissions are released when THEIR batch commits. Transitions never
+ * abort: failed actions still commit (only optimistic overrides revert),
+ * and merged-away transitions hand their stash to the survivor
+ * (mergeTransitionState) — every stash drains exactly once. Injected like
+ * storeCommitHook to stay tree-shakeable. */
+export declare let patchCommitHook: ((batch: Transition) => void) | null;
+export declare function setPatchCommitHook(fn: (batch: Transition) => void): void;
 export declare function finalizePureQueue(completingTransition?: Transition | null, incomplete?: boolean): void;
 /**
  * Count of live `affects()` registrations across the system (including

package/dist/types-cjs/store/index.d.cts

@@ -4,6 +4,8 @@ export { isWrappable, $TRACK, $PROXY, $TARGET } from "./store.cjs";
 import type { NoFn, ProjectionOptions, Store, StoreOptions, StoreSetter } from "./store.cjs";
 import type { Refreshable } from "../core/index.cjs";
 export { createProjectionNext as createProjection } from "./next/projection.cjs";
+export { registerPatch, registerRowOps, registerSlotPatchNext as registerSlotPatch, patchableRaw } from "./next/patch.cjs";
+export { storeIsShallow, storeHasFamily, storeHasOptimisticFamily } from "./next/store.cjs";
 export { createOptimisticStoreNext as createOptimisticStore } from "./next/optimistic.cjs";
 /** Public createStore: plain form `(init, options?)` and derived writable
  * form `(fn, seed, options?)`. */