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

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

@@ -1,5 +1,5 @@
-import { STORE_SNAPSHOT_PROPS, type Computed, type Refreshable, type Signal } from "../core/index.js";
-import { type Transition } from "../core/scheduler.js";
+import { type Signal } from "../core/index.js";
+import type { Refreshable } from "../core/index.js";
 /** A read-only view of a store's value as seen by consumers. Mutate it via the paired `StoreSetter`. */
 export type Store<T> = Readonly<T>;
 /**
@@ -58,21 +58,14 @@ type DataNodes = Record<PropertyKey, DataNode>;
  * @internal
  */
 export declare const $TRACK: unique symbol, $TARGET: unique symbol, $PROXY: unique symbol, $DELETED: unique symbol, $AFFECTS: unique symbol;
-export declare 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";
+export declare const STORE_VALUE = "v", STORE_NODE = "n", STORE_HAS = "h", STORE_PARENT = "u", STORE_DESC = "d", STORE_SHALLOW = "s";
+/** Structural view of a store target as shared machinery sees it (the real
+ * shape is `StoreNextTarget` in ./next/target.ts). */
 export type StoreNode = {
     [$PROXY]: any;
     [STORE_VALUE]: Record<PropertyKey, any>;
-    [STORE_OVERRIDE]?: Record<PropertyKey, any>;
-    [STORE_OPTIMISTIC_OVERRIDE]?: Record<PropertyKey, any>;
-    [STORE_OPTIMISTIC_OWNERS]?: Record<PropertyKey, Transition | null>;
     [STORE_NODE]?: DataNodes;
     [STORE_HAS]?: DataNodes;
-    [STORE_CUSTOM_PROTO]?: boolean;
-    [STORE_WRAP]?: (value: any, target?: StoreNode) => any;
-    [STORE_LOOKUP]?: WeakMap<any, any>;
-    [STORE_FIREWALL]?: Computed<any>;
-    [STORE_OPTIMISTIC]?: boolean;
-    [STORE_SNAPSHOT_PROPS]?: Record<PropertyKey, any>;
     [STORE_PARENT]?: StoreNode;
     [STORE_SHALLOW]?: boolean;
     [STORE_DESC]?: boolean;
@@ -82,10 +75,6 @@ export declare namespace SolidStore {
     }
 }
 export type NotWrappable = string | number | bigint | symbol | boolean | Function | null | undefined | SolidStore.Unwrappable[keyof SolidStore.Unwrappable];
-export declare function createStoreProxy<T extends object>(value: T, traps?: ProxyHandler<StoreNode>, extend?: (target: StoreNode) => void): any;
-export declare const storeLookup: WeakMap<WeakKey, any>;
-export declare const symbolKeyedRecords: WeakSet<object>;
-export declare function lookupTarget(value: any, lookup?: WeakMap<any, any>): StoreNode | undefined;
 /**
  * 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
@@ -96,25 +85,33 @@ export declare function lookupTarget(value: any, lookup?: WeakMap<any, any>): St
 export declare let rawValuesUsed: boolean;
 export declare function isRawValue(value: any): boolean;
 export declare function markRaw<T>(value: T): T;
+export declare function markRawOne(v: any): void;
 export declare function markRawIngest(container: any): void;
-export declare function wrap<T extends Record<PropertyKey, any>>(value: T, target?: StoreNode): T;
-export declare function wrapShallow<T extends Record<PropertyKey, any>>(value: T): T;
 export declare function isWrappable<T>(obj: T | NotWrappable): obj is T;
 export declare function setWriteOverride(value: boolean): void;
+export declare function getWriteOverride(): boolean;
 export declare function ownEnumerableKeys(o: object): (string | symbol)[];
 /**
- * Single chokepoint for the store's layered value resolution: returns the
- * override layer (optimistic first, then regular) that shadows `property`, or
- * `undefined` when the base `STORE_VALUE` is authoritative. Every trap must
- * resolve through this — hand-inlining the layer order is how the optimistic
- * layer gets missed (#2850).
+ * Scope inheritance for late-created nodes: every live mark whose identity
+ * scope contains the owning record's raw — and, for keyed marks, whose key
+ * is this property — gets counted on the new node. Inherited marks live
+ * exactly as long as the scope's carrier — the release hook below drops
+ * them with the entry.
  */
-export declare function getOverlayLayer(target: StoreNode, property: PropertyKey): Record<PropertyKey, any> | undefined;
-/**
- * The value a store leaf's backing signal currently shows to readers: active
- * override, else held pending value, else committed value.
- */
-export declare function visibleNodeValue(node: DataNode): any;
+export declare function inheritAffectsMarks(node: DataNode, raw: object, property: PropertyKey): void;
+/** Next-store node factory for affects carriers/slots: injected by the
+ * rewrite module (next targets alias the legacy field names, so everything
+ * here EXCEPT node creation works on them structurally). */
+export declare let nextAffectsNodeResolver: ((target: any, key: PropertyKey) => DataNode) | null;
+export declare function setNextAffectsNodeResolver(fn: (target: any, key: PropertyKey) => DataNode): void;
+/** Next-store optimistic view for the declaration walk (optimistic rows
+ * pushed before the declaration are in motion too — legacy reads its write
+ * overlays; next composes armed-node overrides). */
+export declare let nextOptimisticViewResolver: ((target: any, raw: any) => any) | null;
+export declare function setNextOptimisticViewResolver(fn: (target: any, raw: any) => any): void;
+/** @internal birth inheritance for nodes created inside a live mark window —
+ * exported for the rewrite's node factories. */
+export declare function affectsScopesLive(): boolean;
 /**
  * Witness live mark coverage of a record into the active isPending() probe.
  * Tracked reads don't need this — they go through real signal nodes, which
@@ -138,76 +135,4 @@ export declare function witnessAffectsMark(target: StoreNode, property?: Propert
  * @internal
  */
 export declare function getStoreAffectsNodes(target: StoreNode, key?: PropertyKey): DataNode[];
-export declare function trackSelf(target: StoreNode, symbol?: symbol): void;
-export declare function notifySelf(target: StoreNode): void;
-/**
- * The write overlay a walk must read through: optimistic writes shadow
- * regular pending writes, the same resolution order as every proxy trap and
- * `reconcile` (#2850). Merging allocates only in the rare both-present case
- * (a derived optimistic store with an in-flight projection commit).
- */
-export declare function mergedOverlay(target: StoreNode): Record<PropertyKey, any> | undefined;
-export declare function getKeys(source: Record<PropertyKey, any>, override: Record<PropertyKey, any> | undefined, enumerable?: boolean): PropertyKey[];
-export declare function getStoreKeys(source: Record<PropertyKey, any>, override: Record<PropertyKey, any> | undefined): PropertyKey[];
-export declare function getStoreSymbols(source: Record<PropertyKey, any>, override: Record<PropertyKey, any> | undefined): symbol[];
-export declare function getPropertyDescriptor(source: Record<PropertyKey, any>, override: Record<PropertyKey, any> | undefined, property: PropertyKey): PropertyDescriptor | undefined;
-export declare const storeTraps: ProxyHandler<StoreNode>;
-export declare function storeSetter<T extends object>(store: Store<T>, fn: (draft: T) => T | void): void;
-/**
- * Creates a deeply-reactive store backed by a Proxy. Reads track each property
- * accessed; only the parts that change trigger updates.
- *
- * Store properties hold **plain values**, not accessors. The proxy already
- * tracks reads per-property — wrapping a value in `() => state.foo` produces
- * a getter that *won't* track when called, which looks like a reactivity bug
- * but is just a category error. If you have a signal-shaped piece of state,
- * make it a property of the store (`{ foo: 1 }`) rather than nesting an
- * accessor inside (`{ foo: () => signal() }`).
- *
- * The setter takes a **draft-mutating** function — mutate the draft in place
- * (canonical). The callback may also return a new value: arrays are replaced
- * by index (length adjusted), objects are shallow-diffed at the top level
- * (keys present in the returned value are written, missing keys deleted). Use
- * the return form for shapes where mutation is awkward — most commonly
- * removing items via `filter`. The setter does **not** do keyed reconciliation;
- * for that, use the derived/projection form (or `createProjection`).
- *
- * - Plain form: `createStore(initialValue)` — wraps a value in a reactive
- *   proxy.
- * - Derived form: `createStore(fn, seed, options?)` — a *projection store*
- *   whose contents are computed by `fn(draft)`. `fn` may be sync, async, or
- *   an `AsyncIterable`; the projection's result reconciles against the
- *   existing store by `options.key` (default `"id"`) for stable identity.
- *
- * @example
- * ```ts
- * const [state, setState] = createStore({
- *   user: { name: "Ada", age: 36 },
- *   todos: [] as { id: string; text: string; done: boolean }[]
- * });
- *
- * // Canonical: mutate the draft in place.
- * setState(s => { s.user.age = 37; });
- * setState(s => { s.todos.push({ id: "1", text: "x", done: false }); });
- *
- * // Return form: reach for it when mutation is awkward.
- * setState(s => s.todos.filter(t => !t.done));               // remove items
- * setState(s => ({ ...s, user: { name: "Grace", age: 85 } })); // shallow replace
- * ```
- *
- * @example
- * ```ts
- * // Derived store — auto-fetches & reconciles by `id`.
- * const [users] = createStore(
- *   async () => fetch("/users").then(r => r.json()),
- *   [] as User[]
- * );
- * ```
- *
- * @returns `[store: Store<T>, setStore: StoreSetter<T>]`
- */
-export declare function createStore<T extends object = {}>(store: NoFn<T> | Store<NoFn<T>>, options?: StoreOptions & {
-    shallow?: boolean;
-}): StoreReturn<T>;
-export declare function createStore<T extends object = {}>(fn: (store: T) => void | T | Promise<void | T> | AsyncIterable<void | T>, store: Partial<T> | Store<NoFn<T>>, options?: ProjectionOptions): ProjectionStoreReturn<T>;
 export {};

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

@@ -1,43 +1,3 @@
-/**
- * Returns a plain (non-proxy, non-reactive) deep copy of a store value.
- * Reading via `snapshot` does **not** subscribe to changes — use this when you
- * need to hand a stable plain object to non-reactive code (logging,
- * serialization, structured-clone, network payloads, etc.).
- *
- * Returns the original object identity for any sub-tree that wasn't modified
- * relative to the proxy's underlying source.
- *
- * @example
- * ```ts
- * const [state] = createStore({ user: { name: "Ada" }, todos: [] });
- *
- * console.log(JSON.stringify(snapshot(state))); // safe, non-reactive copy
- * ```
- */
-export declare function snapshot<T>(item: T): T;
-export declare function snapshot<T>(item: T, map?: Map<unknown, unknown>, lookup?: WeakMap<any, any>): T;
-/**
- * Returns a plain (non-proxy) deep copy **and** subscribes the current
- * tracking scope to every nested change in the source store. Any write
- * anywhere in the subtree invalidates the consumer.
- *
- * Use this when you need plain data inside a reactive scope and want to
- * react to deep mutations (e.g. passing a snapshot to `reconcile()` or to a
- * memo that should rerun on any nested change). For most read paths, prefer
- * direct property access — Solid stores already track per-property reads
- * with no `deep()` wrapper needed.
- *
- * @example
- * ```ts
- * const [state] = createStore({ a: { b: { c: 1 } } });
- *
- * createEffect(
- *   () => deep(state),                  // reruns on any nested change
- *   plain => sendToWorker(plain)        // worker gets a non-proxy copy
- * );
- * ```
- */
-export declare function deep<T extends object>(store: T): T;
 type DistributeOverride<T, F> = T extends undefined ? F : T;
 type Override<T, U> = T extends any ? U extends any ? {
     [K in keyof T]: K extends keyof U ? DistributeOverride<U[K], T[K]> : T[K];

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

@@ -0,0 +1,52 @@
+import type { Computed, Signal } from "./types.cjs";
+/**
+ * Dev-only observability hook points for the reactive core.
+ *
+ * Core's obligation is to call these with true facts at the moments they
+ * happen; ALL attribution semantics (stamps, cause chains, timings, warnings)
+ * live in the engine that installs them (attribution.ts — same pattern as the
+ * GlobalQueue._* feature slots). `attrHooks` is null unless an engine is
+ * installed, so the disabled cost is one null check per site, and prod builds
+ * fold every site out behind __DEV__.
+ *
+ * IMPORTANT for implementers of call sites: a hook call must never sit inside
+ * a `try` block — rollup's tryCatchDeoptimization retains functions referenced
+ * inside `try` even behind a folded __DEV__ guard, which re-couples the dev
+ * engine into prod bundles (#2883 harness). Set a local flag inside the try
+ * and call the hook after the catch.
+ */
+export interface AttributionHooks {
+    /**
+     * A recompute is starting; `el._deps` still holds the previous run's links.
+     * Always paired with `recomputeEnd` (recompute has no early returns).
+     */
+    recomputeStart(el: Computed<any>, create: boolean): void;
+    /**
+     * The recompute finished. `changed` = committed a changed value (false for
+     * errored runs); `optimistic` = ran under an optimistic lane / lane-dirty
+     * posture; `transition` = a transition was active or owns this node;
+     * `held` = the value went to `_pendingValue` (a transition hold) rather
+     * than committing directly — its reveal happens later on the transition's
+     * own schedule.
+     */
+    recomputeEnd(el: Computed<any>, create: boolean, changed: boolean, optimistic: boolean, transition: boolean, held: boolean): void;
+    /** A non-effect computed committed a changed value during a re-run. */
+    derivedChanged(el: Computed<any>): void;
+    /** A signal write committed (value passed the equality gate). */
+    write(el: Signal<any> | Computed<any>, prev: unknown, value: unknown): void;
+    /** refresh() invalidated this node (self-invalidation, no dep changed). */
+    refreshed(el: Computed<any>): void;
+    /** An async landing is about to apply its value (before any branch). */
+    asyncStart(el: Computed<any>): void;
+    /**
+     * The async landing finished. `direct` = the landing applies the value
+     * itself (lane/override paths); false = it went through setSignal, whose
+     * own `write` hook already saw any committed change. Fired whether or not
+     * the landing committed — call sites cannot carry that fact out of their
+     * try blocks (see the try rule above), so the engine derives committed-ness
+     * from the node's state against its asyncStart snapshot.
+     */
+    asyncEnd(el: Computed<any>, prev: unknown, value: unknown, direct: boolean): void;
+}
+export declare let attrHooks: AttributionHooks | null;
+export declare function setAttributionHooks(hooks: AttributionHooks | null): void;

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

@@ -0,0 +1,186 @@
+import type { Computed } from "./types.cjs";
+/**
+ * Dev-mode "why did this run" attribution.
+ *
+ * The runtime already knows the full dependency set of every scope; this
+ * module surfaces it. Every value commit stamps its node with a ChangeRecord
+ * (a write, an async landing, a refresh() invalidation, or a derived change
+ * whose `causes` chain back to root writes). When a computation re-executes,
+ * the deps whose stamp is newer than the node's last run are its causes, so
+ * each re-run can be explained as a chain down to the originating write:
+ *
+ *   [why-run] effect "docTitle" ran (run 4)
+ *     ← memo "userLabel" changed (#6)
+ *       ← signal "notifications" write (#5) 2 → 3
+ *
+ * This module is the attribution ENGINE: all semantics live here, and it is
+ * decoupled from the core. `enable()` installs it into the core's narrow
+ * dev-only hook points (attribution-hooks.ts); core's only obligation is to
+ * call those hooks with true facts. Disabled cost is one null check per hook
+ * site; prod builds fold the sites out entirely. The same hook surface is the
+ * intended substrate for external consumers (devtools) — one mechanism, two
+ * front-ends.
+ */
+export type ChangeKind = "write" | "derived" | "async" | "refresh";
+export interface ChangeRecord {
+    /** Global monotonic change sequence — orders causes across the app. */
+    seq: number;
+    kind: ChangeKind;
+    name: string;
+    /** Short previews of the value transition (writes only). */
+    prev?: string;
+    value?: string;
+    /** First user frames of the triggering write's stack (opt-in). */
+    stack?: string[];
+    /** For derived changes: the upstream changes that produced this one. */
+    causes?: ChangeRecord[];
+}
+export interface RerunEvent {
+    /** Global monotonic run sequence. */
+    run: number;
+    /** How many times this node has re-run since attribution was enabled. */
+    nodeRuns: number;
+    nodeKind: "effect" | "memo";
+    nodeName: string;
+    node: Computed<any>;
+    /**
+     * The deps that changed since this node's previous run. Empty means the
+     * re-run was not triggered by a tracked value change (creation-adjacent
+     * pull, error retry, or a cause this prototype does not stamp yet).
+     */
+    causes: ChangeRecord[];
+    /** Dependency count after this run. */
+    depCount: number;
+    /** Names of deps this run subscribed to that the previous run did not. */
+    depsAdded: string[];
+    /** Names of deps the previous run had that this run dropped. */
+    depsRemoved: string[];
+    /** Wall time of this run excluding nested recomputes (ms). */
+    selfMs: number;
+    /** Wall time of this run including nested recomputes (ms). */
+    totalMs: number;
+    /**
+     * Whether the run committed a changed value. A PLAIN memo run with
+     * `changed: false` was pure waste — the equality cutoff stopped it from
+     * notifying anyone; an effect run with `changed: false` computed without
+     * firing its effect phase. Summed as `wastedMs` in costs() (plain,
+     * non-held runs only — see `phase`).
+     */
+    changed: boolean;
+    /**
+     * Which posture this run executed under. "optimistic" = under an
+     * optimistic lane (overlay recompute); "transition" = a transition was
+     * active or owns the node (the run may be replayed/settled later);
+     * "plain" = an ordinary committed run. Overlay runs are real work (they
+     * count toward time budgets) but are never blamed as waste, and costs()
+     * reports their time separately as `overlayMs`.
+     */
+    phase: "plain" | "transition" | "optimistic";
+    /**
+     * The changed value was held in `_pendingValue` (a transition hold) rather
+     * than committed directly; its reveal happens on the transition's own
+     * schedule. Held runs are excluded from waste accounting.
+     */
+    held: boolean;
+}
+export interface AttributionOptions {
+    /** Pretty-print each re-run to the console (default true). */
+    log?: boolean;
+    /** Capture the user stack frame of each write — slow (default false). */
+    stacks?: boolean;
+    /** Ring-buffer size for `history()` (default 200). */
+    historyLimit?: number;
+    /**
+     * Hot-scope warning: emit a diagnostic when one scope re-runs `count`
+     * times within `windowMs` (default 120 runs / 1000ms — deliberately above
+     * animation-frame cadence, so a legitimate rAF-driven scope at 60/s does
+     * not cry wolf). `false` disables.
+     */
+    hotRuns?: {
+        count: number;
+        windowMs: number;
+    } | false;
+    /**
+     * Wide-scope warning: emit a diagnostic when a scope's dependency count
+     * reaches this (default 30) — the coarse-read / helper-leak signature.
+     * Re-warns only if the count then grows by another 50%. `false` disables.
+     */
+    wideDeps?: number | false;
+    /**
+     * Time-budget warning: emit a diagnostic when one scope's summed self-time
+     * inside `windowMs` exceeds `budgetMs` (default 8ms / 1000ms — half a frame
+     * spent in one scope). Unlike `hotRuns` this catches the few-but-expensive
+     * scope that run counts miss. `false` disables.
+     */
+    hotTime?: {
+        budgetMs: number;
+        windowMs: number;
+    } | false;
+    /**
+     * Unstable-output warning: emit a diagnostic when a memo commits a
+     * referentially-new but shallowly-equivalent plain object/array on this
+     * many consecutive runs (default 4). Such a memo's equality gate never
+     * closes — every subscriber re-runs on every upstream change — which makes
+     * it a fan-out amplifier that is otherwise only findable by profiling.
+     * `false` disables.
+     */
+    unstableMemos?: number | false;
+    /**
+     * Written-fan-out warning: emit a diagnostic when a committed root
+     * invalidation (write, refresh, async landing) reaches a node with at
+     * least this many subscribers (default 250). Complements the always-on
+     * HUGE_FAN_OUT graph-size warning, specced against it deliberately:
+     * HUGE_FAN_OUT fires at LINK time from GRAPH_SIZE_WARN_AT (2000) up —
+     * static structure so large it warns even if never written — while this
+     * fires at WRITE time from a much lower bar, because fan-out only costs
+     * anything when the node actually changes. Once per node, re-warning only
+     * on 2x subscriber growth, so the two never spam the same node. `false`
+     * disables.
+     */
+    wideWrites?: number | false;
+}
+export interface ScopeCost {
+    name: string;
+    kind: "effect" | "memo";
+    runs: number;
+    selfMs: number;
+    /**
+     * Self-time of PLAIN, non-held runs that produced an unchanged value —
+     * the recoverable number. Overlay runs (optimistic/transition) are never
+     * counted here: an optimistic recompute landing back on the committed
+     * value is the mechanism working, not waste.
+     */
+    wastedMs: number;
+    /** Self-time spent in optimistic/transition (overlay) runs. */
+    overlayMs: number;
+}
+export interface WriteCost {
+    /** Root cause name (a signal write, async landing, or refresh target). */
+    name: string;
+    /** Number of downstream re-runs this root triggered. */
+    runs: number;
+    /** Summed self-time of every downstream re-run it caused. */
+    downstreamMs: number;
+}
+export declare function formatRerun(event: RerunEvent): string;
+export interface Attribution {
+    enable(opts?: AttributionOptions): void;
+    disable(): void;
+    subscribe(listener: (event: RerunEvent) => void): () => void;
+    history(): readonly RerunEvent[];
+    /** Re-run history for one node — pass a memo/effect accessor or raw node. */
+    why(target: unknown): RerunEvent[];
+    /** Current dependency names of one scope — the devtools subscription view. */
+    subscriptions(target: unknown): string[];
+    /**
+     * Aggregated cost tables since enable(): `scopes` ranked by self-time
+     * (with `wastedMs` = time spent on unchanged-value runs), `writes` ranked
+     * by total downstream re-run time each root write caused.
+     */
+    costs(): {
+        scopes: ScopeCost[];
+        writes: WriteCost[];
+    };
+    format: typeof formatRerun;
+}
+export declare const attribution: Attribution;

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

@@ -18,6 +18,15 @@ export declare const REACTIVE_MANUAL_WRITE: number;
  * pending window does not read as pending (question-scoped pending model).
  */
 export declare const REACTIVE_REASK: number;
+/**
+ * A dependency write landed while this subscriber was mid-recompute — a
+ * nested pull committed beneath one of its reads (#3037). The heap refuses
+ * RECOMPUTING nodes, so recompute's tail consumes this latch and reschedules:
+ * values the pass read before the nested commit are stale. Only set for
+ * links validated this pass (gen-current): a write to an untouched link is
+ * either re-read later in the pass (fresh) or trimmed with it (not a dep).
+ */
+export declare const REACTIVE_MISSED_WAKE: number;
 export declare const CONFIG_OWNED_WRITE: number;
 export declare const CONFIG_NO_SNAPSHOT: number;
 export declare const CONFIG_TRANSPARENT: number;
@@ -25,6 +34,23 @@ export declare const CONFIG_IN_SNAPSHOT_SCOPE: number;
 export declare const CONFIG_CHILDREN_FORBIDDEN: number;
 export declare const CONFIG_AUTO_DISPOSE: number;
 export declare const CONFIG_SYNC: number;
+export declare const CONFIG_OPTIMISTIC: number;
+export declare const CONFIG_HAS_COMPANIONS: number;
+export declare const CONFIG_HAS_SNAPSHOT: number;
+export declare const CONFIG_HAS_LANE: number;
+/** Set on a FIREWALL computed when any of its child signals creates an
+ * isPending()/latest() companion. Gates the post-recompute child-companion
+ * walk (#3038): a store computed's `_child` chain holds one node per
+ * materialized leaf, so walking it unconditionally makes every update cost
+ * O(all leaves ever read). Sticky — set at companion creation, never
+ * cleared; sync-only apps never set it and never pay the walk. */
+export declare const CONFIG_CHILD_COMPANIONS: number;
+/** Set on a computed when its first firewall child signal is installed
+ * (projection machinery). Gates markNode's firewall-children walk with one
+ * masked read of the always-present _config — the walk's old `_child` read
+ * moved into the cold extension (§12), and an unconditional `_x` deref per
+ * marked node measurably taxed the propagation hot path (diamond -22%). */
+export declare const CONFIG_FW_CHILDREN: number;
 export declare const STATUS_NONE = 0;
 export declare const STATUS_PENDING: number;
 export declare const STATUS_ERROR: number;

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

@@ -1,6 +1,6 @@
 import { type Refreshable } from "./constants.cjs";
 import { type OptimisticLane } from "./lanes.cjs";
-import type { Computed, FirewallSignal, NodeOptions, Owner, Signal } from "./types.cjs";
+import type { Computed, FirewallSignal, NodeExtension, NodeOptions, Owner, Signal } from "./types.cjs";
 export declare const PRIMITIVE_IN_FORBIDDEN_SCOPE_MESSAGE = "[PRIMITIVE_IN_FORBIDDEN_SCOPE] Cannot create reactive primitives inside createTrackedEffect or owner-backed onSettled";
 export declare const REACTIVE_WRITE_IN_OWNED_SCOPE_SIGNAL_MESSAGE: string;
 export declare const REACTIVE_WRITE_IN_OWNED_SCOPE_REFRESH_MESSAGE: string;
@@ -25,6 +25,13 @@ export declare function clearSnapshots(): void;
 export declare function recompute(el: Computed<any>, create?: boolean): void;
 export declare function computed<T>(fn: (prev?: T) => T | PromiseLike<T> | AsyncIterable<T>): Computed<T>;
 export declare function computed<T>(fn: (prev: T) => T | PromiseLike<T> | AsyncIterable<T>, options?: NodeOptions<T>): Computed<T>;
+/** Lazily allocate a node's cold extension (ONE shape for signals and
+ * computeds — `_x` access stays monomorphic). Installers write through
+ * this; hot paths read `el._x?._field` gated by the _config presence bits.
+ * Never call ext() just to store a field's default. */
+export declare function ext(el: {
+    _x: NodeExtension | null;
+}): NodeExtension;
 /**
  * Build an Effect node with all effect-specific fields baked into a single object literal,
  * so V8 sees the full hidden class shape at construction time. Effects always run in lazy
@@ -88,6 +95,14 @@ export declare const READ_SLOW: unique symbol;
  */
 export declare function readNodeFast<T>(el: Signal<T>): T | typeof READ_SLOW;
 export declare function read<T>(el: Signal<T> | Computed<T>): T;
+/**
+ * Store-rewrite setter guard: the rewrite parks writes in a pending backing
+ * (no setSignal at write time), so the owned-scope write protection must
+ * fire at the setter entry instead. Mirrors setSignal's guard condition
+ * minus the node-specific exemptions (ownedWrite/firewall), which don't
+ * apply to plain store setters.
+ */
+export declare function devGuardStoreSetterWrite(): void;
 export declare function setSignal<T>(el: Signal<T> | Computed<T>, v: T | ((prev: T) => T)): T;
 /**
  * Suppresses automatic recomputation of `el` until the scheduler drains. Used

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

@@ -1,4 +1,5 @@
-import type { Computed, Owner, Signal } from "./types.cjs";
+import { type Attribution } from "./attribution.cjs";
+import type { Computed, Link, Owner, Signal } from "./types.cjs";
 export interface DevHooks {
     onOwner?: (owner: Owner) => void;
     onGraph?: (value: any, owner: Owner | null) => void;
@@ -6,8 +7,12 @@ export interface DevHooks {
     onStoreNodeUpdate?: (state: any, property: PropertyKey, value: any, prev: any) => void;
 }
 export type DiagnosticSeverity = "warn" | "error";
-export type DiagnosticCode = "STRICT_READ_UNTRACKED" | "PENDING_ASYNC_UNTRACKED_READ" | "PENDING_ASYNC_FORBIDDEN_SCOPE" | "REACTIVE_WRITE_IN_OWNED_SCOPE" | "ACTION_CALLED_IN_OWNED_SCOPE" | "RUN_WITH_DISPOSED_OWNER" | "NO_OWNER_CLEANUP" | "CLEANUP_IN_FORBIDDEN_SCOPE" | "SETTLED_CLEANUP_UNOWNED" | "PRIMITIVE_IN_FORBIDDEN_SCOPE" | "NO_OWNER_EFFECT" | "NO_OWNER_BOUNDARY" | "ASYNC_OUTSIDE_LOADING_BOUNDARY" | "INVALID_REFRESH_TARGET" | "INVALID_AFFECTS_TARGET" | "MISSING_EFFECT_FN" | "SYNC_NODE_RECEIVED_ASYNC" | "REACTIVITY_HALTED" | "INVARIANT_VIOLATION";
-export type DiagnosticKind = "strict-read" | "async" | "write" | "lifecycle" | "owner" | "error";
+export type DiagnosticCode = "STRICT_READ_UNTRACKED" | "PENDING_ASYNC_UNTRACKED_READ" | "PENDING_ASYNC_FORBIDDEN_SCOPE" | "REACTIVE_WRITE_IN_OWNED_SCOPE" | "ACTION_CALLED_IN_OWNED_SCOPE" | "RUN_WITH_DISPOSED_OWNER" | "NO_OWNER_CLEANUP" | "CLEANUP_IN_FORBIDDEN_SCOPE" | "SETTLED_CLEANUP_UNOWNED" | "FLUSH_IN_EFFECT_CALLBACK" | "PRIMITIVE_IN_FORBIDDEN_SCOPE" | "NO_OWNER_EFFECT" | "NO_OWNER_BOUNDARY" | "ASYNC_OUTSIDE_LOADING_BOUNDARY" | "INVALID_REFRESH_TARGET" | "INVALID_AFFECTS_TARGET" | "MISSING_EFFECT_FN" | "SYNC_NODE_RECEIVED_ASYNC" | "REACTIVITY_HALTED" | "INVARIANT_VIOLATION" | "HUGE_FAN_OUT" | "HUGE_FAN_IN" | "HOT_SCOPE_RERUNS" | "HOT_SCOPE_TIME" | "WIDE_SCOPE_DEPS" | "UNSTABLE_MEMO_OUTPUT" | "WIDE_WRITE";
+export type DiagnosticKind = "strict-read" | "async" | "write" | "lifecycle" | "owner" | "error" | "perf" | "graph";
+/** First warning when a node's live edge count reaches this size. */
+export declare const GRAPH_SIZE_WARN_AT = 2000;
+/** Repeat the warning at this interval after the first. */
+export declare const GRAPH_SIZE_WARN_EVERY = 500;
 export interface DiagnosticEvent {
     sequence: number;
     code: DiagnosticCode;
@@ -32,6 +37,8 @@ export interface Diagnostics {
 export interface Dev {
     hooks: DevHooks;
     diagnostics: Diagnostics;
+    /** "Why did this run" re-run attribution — see attribution.ts. */
+    attribution: Attribution;
     getChildren: typeof getChildren;
     getSignals: typeof getSignals;
     getParent: typeof getParent;
@@ -62,3 +69,13 @@ export declare function getSignals(owner: Owner): any[];
 export declare function getParent(owner: Owner): Owner | null;
 export declare function getSources(computation: Computed<any>): (Signal<any> | Computed<any>)[];
 export declare function getObservers(node: Signal<any> | Computed<any>): Computed<any>[];
+/**
+ * DEV-only: bump live edge counts after a new graph link and warn when a
+ * node grows an unusually large fan-out (many subscribers on one source) or
+ * fan-in (many sources on one computation). Repeat-reads that `link()`
+ * dedupes never reach here. Always-on in dev — unlike the opt-in attribution
+ * engine, a graph-size pathology should surface without asking.
+ */
+export declare function noteGraphLink(dep: Signal<any> | Computed<any>, sub: Computed<any>): void;
+/** DEV-only: drop live edge counts when a link is removed. */
+export declare function unnoteGraphLink(link: Link): void;

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

@@ -1,5 +1,6 @@
 import type { Computed, Link, Signal } from "./types.cjs";
 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;
 export declare function link(dep: Signal<any> | Computed<any>, sub: Computed<any>, pendingObserver?: boolean): void;

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

@@ -31,26 +31,14 @@ export declare function mergeLanes(lane1: OptimisticLane, lane2: OptimisticLane)
 /**
  * Resolve a node's lane: follow union-find chain, verify active, clear if stale.
  */
-export declare function resolveLane(el: {
-    _optimisticLane?: OptimisticLane;
-}): OptimisticLane | undefined;
-export declare function resolveTransition(el: {
-    _optimisticLane?: OptimisticLane;
-    _transition?: Transition | null;
-    _overrideValue?: any;
-    _overrideOwner?: Transition | null;
-}): Transition | null | undefined;
+export declare function resolveLane(el: Signal<any> | Computed<any>): OptimisticLane | undefined;
+export declare function resolveTransition(el: Signal<any> | Computed<any>): Transition | null | undefined;
 /**
  * Check if a node has an active optimistic override.
  */
-export declare function hasActiveOverride(el: {
-    _overrideValue?: any;
-}): boolean;
+export declare function hasActiveOverride(el: Signal<any> | Computed<any>): boolean;
 /**
  * Assign or merge a lane onto a node. At convergence points (node already has
  * a different active lane), merge unless the node has an active override.
  */
-export declare function assignOrMergeLane(el: {
-    _optimisticLane?: OptimisticLane;
-    _overrideValue?: any;
-}, sourceLane: OptimisticLane): void;
+export declare function assignOrMergeLane(el: Signal<any> | Computed<any>, sourceLane: OptimisticLane): void;