@graphrefly/graphrefly 0.34.0 → 0.35.0

package/dist/{graph-BROUZPG9.d.ts → graph-Cv-8x0ZI.d.ts}

@@ -1,6 +1,7 @@
-import { A as Actor, o as GraphReFlyConfig, V as VersioningLevel, a as Node, b as Messages, K as NodeSink } from './node-8qx0kgYt.js';
-import { b as DescribeNodeOutput, D as DescribeDetail, a as DescribeField } from './meta-CtDjj7cU.js';
-import { StorageTier, StorageHandle } from './extra/storage-core.js';
+import { A as Actor, p as GraphReFlyConfig, V as VersioningLevel, a as Node, b as Messages, K as NodeSink } from './node-fSc-hCv8.js';
+import { b as DescribeNodeOutput, D as DescribeDetail, a as DescribeField } from './meta-CC6EPdpK.js';
+import { StorageHandle } from './extra/storage-core.js';
+import { SnapshotStorageTier } from './extra/storage-tiers.js';
 
 /**
  * Causal walkback over a {@link Graph.describe} snapshot (roadmap §9.2).
@@ -356,8 +357,8 @@ type GraphFactoryContext = {
 };
 type GraphNodeFactory = (name: string, context: GraphFactoryContext) => Node;
 /**
- * Checkpoint record shape passed to `StorageTier.save`. Written by
- * {@link Graph.attachStorage} per-tier according to each tier's
+ * Checkpoint record shape passed to `SnapshotStorageTier.save`. Written by
+ * {@link Graph.attachSnapshotStorage} per-tier according to each tier's
  * `compactEvery` cadence.
  *
  * `mode: "full"` → full snapshot. Baseline anchor emitted on the first save
@@ -372,6 +373,7 @@ type GraphNodeFactory = (name: string, context: GraphFactoryContext) => Node;
  * cross-version WAL replay).
  */
 type GraphCheckpointRecord = {
+    name: string;
     seq: number;
     timestamp_ns: number;
     format_version: number;
@@ -382,7 +384,7 @@ type GraphCheckpointRecord = {
     mode: "diff";
     diff: GraphWALDiff;
 });
-/** Options for {@link Graph.attachStorage}. */
+/** Options for {@link Graph.attachSnapshotStorage}. */
 type GraphAttachStorageOptions = {
     /**
      * Before the first save, attempt to restore from the first tier whose
@@ -392,7 +394,7 @@ type GraphAttachStorageOptions = {
     autoRestore?: boolean;
     /**
      * Limit the subscription surface (scoped observe). By default
-     * `attachStorage` observes every node in the graph tree; on large graphs
+     * `attachSnapshotStorage` observes every node in the graph tree; on large graphs
      * that's thousands of subscriptions just for tier-gating. Pass a path
      * list (or a single glob) to observe only those nodes.
      */
@@ -400,7 +402,7 @@ type GraphAttachStorageOptions = {
     /** Pre-save path-level filter — skip records triggered by paths that fail this predicate. */
     filter?: (name: string, described: DescribeNodeOutput) => boolean;
     /** Surfaced on tier save errors and autoRestore failures. */
-    onError?: (error: unknown, tier: StorageTier) => void;
+    onError?: (error: unknown, tier: SnapshotStorageTier<GraphCheckpointRecord>) => void;
 };
 /**
  * Event emitted by {@link Graph.topology} on every structural change to the
@@ -439,7 +441,7 @@ type GraphDiagramOptions = {
 /**
  * Snapshot format version (§3.8). Exported so the surface layer's
  * `saveSnapshot` writes the same `format_version` as
- * `Graph.attachStorage` — one source of truth prevents silent wire
+ * `Graph.attachSnapshotStorage` — one source of truth prevents silent wire
  * drift between auto-checkpoint and one-shot persistence paths.
  */
 declare const SNAPSHOT_VERSION = 1;
@@ -782,6 +784,14 @@ declare class Graph {
      * @param node - Node instance to own.
      * @param opts - `{ name?, annotation? }`.
      */
+    /**
+     * O(1) reverse lookup — returns the name the given Node was registered
+     * under via {@link Graph.add}, or `undefined` if it isn't registered here.
+     *
+     * Audit 2 (2026-04-24): replaces the orchestration's `findRegisteredNodePath`
+     * O(nodes²) describe-scan with direct `WeakMap<Node, string>` lookup.
+     */
+    nameOf(node: Node): string | undefined;
     add<T extends Node>(node: T, opts?: {
         name?: string;
         annotation?: string;
@@ -903,6 +913,8 @@ declare class Graph {
      * @returns The mounted `child`, for chaining.
      */
     mount<G extends Graph>(name: string, child: G): G;
+    mount(name: string): Graph;
+    mount(name: string, builder: (sub: Graph) => void): Graph;
     /**
      * Look up a node by qualified path (§3.5). Segments are separated by `::`.
      *
@@ -1206,7 +1218,7 @@ declare class Graph {
     toJSON(): GraphPersistSnapshot;
     /**
      * Unified persistence surface (§3.8). Cascades snapshot records through
-     * one or more {@link StorageTier}s, each with its own `debounceMs` /
+     * one or more {@link SnapshotStorageTier}s, each with its own `debounceMs` /
      * `compactEvery` cadence and independent diff baseline.
      *
      * Subscription gates on {@link messageTier} ≥ 3 (DATA/RESOLVED/terminal),
@@ -1220,7 +1232,7 @@ declare class Graph {
      * share a single snapshot computation per observe event; debounced tiers
      * compute their own snapshot when their timer fires.
      */
-    attachStorage(tiers: readonly StorageTier[], options?: GraphAttachStorageOptions): StorageHandle;
+    attachSnapshotStorage(tiers: readonly SnapshotStorageTier<GraphCheckpointRecord>[], options?: GraphAttachStorageOptions): StorageHandle;
     /**
      * Try tiers in order (hottest first); apply the first record that hits
      * via {@link Graph.restore}. Returns `true` if any tier produced a
@@ -1237,7 +1249,7 @@ declare class Graph {
      * the bad tier, some pre-existing). A subsequent successful tier's
      * `restore()` overwrites the overlapping slices.
      *
-     * Internal helper shared by {@link Graph.attachStorage}'s `autoRestore`
+     * Internal helper shared by {@link Graph.attachSnapshotStorage}'s `autoRestore`
      * option and the static {@link Graph.fromStorage} factory.
      */
     private _cascadeRestore;
@@ -1253,14 +1265,14 @@ declare class Graph {
      * @throws If no tier holds a restorable record matching `name` *and* no
      *   `factories` override is provided for dynamic nodes.
      */
-    static fromStorage(name: string, tiers: readonly StorageTier[], opts?: GraphOptions & {
+    static fromStorage(name: string, tiers: readonly SnapshotStorageTier<GraphCheckpointRecord>[], opts?: GraphOptions & {
         factories?: Record<string, GraphNodeFactory>;
         /**
          * Called when a tier throws during `load()` or when
          * {@link Graph.fromSnapshot} rejects a tier's record. The cascade
          * falls through to the next colder tier regardless.
          */
-        onError?: (err: unknown, tier: StorageTier) => void;
+        onError?: (err: unknown, tier: SnapshotStorageTier<GraphCheckpointRecord>) => void;
     }): Promise<Graph>;
     private _annotations;
     private readonly _traceRing;
@@ -1350,7 +1362,7 @@ type GraphDiffResult = {
  * slice for each added path so {@link replayWAL} can reconstruct nodes added
  * between full anchors (topology mutations inside a `compactEvery` window).
  *
- * `Graph.diff()` returns the audit shape (no payload); `attachStorage` writes
+ * `Graph.diff()` returns the audit shape (no payload); `attachSnapshotStorage` writes
  * this WAL shape. The two shapes stay structurally compatible — `GraphWALDiff`
  * is a superset.
  */
@@ -1445,4 +1457,4 @@ declare function reachable(described: GraphDescribeOutput, from: string, directi
 }): ReachableResult;
 declare function reachable(described: GraphDescribeOutput, from: string, direction: ReachableDirection, options?: ReachableOptions): string[];
 
-export { type ReachableOptions as A, type TraceEntry as B, type CausalChain as C, type DescribeFilter as D, type ExplainPathOptions as E, diffForWAL as F, Graph as G, explainPath as H, graphProfile as I, mermaidLiveUrl as J, reachable as K, type NodeProfile as N, type ObserveDetail as O, type ReachableDirection as R, SNAPSHOT_VERSION as S, type TopologyEvent as T, type GraphOptions as a, type GraphDescribeOptions as b, type GraphDescribeOutput as c, type GraphPersistSnapshot as d, type CausalStep as e, GRAPH_META_SEGMENT as f, type GraphActorOptions as g, type GraphAttachStorageOptions as h, type GraphCheckpointRecord as i, type GraphDiagramDirection as j, type GraphDiagramOptions as k, type GraphDiffChange as l, type GraphDiffResult as m, type GraphFactoryContext as n, type GraphNodeFactory as o, type GraphObserveAll as p, type GraphObserveOne as q, type GraphProfileOptions as r, type GraphProfileResult as s, type GraphVersionChange as t, type GraphWALDiff as u, type ObserveEvent as v, type ObserveOptions as w, type ObserveResult as x, type ObserveTheme as y, type ObserveThemeName as z };
+export { type ReachableOptions as A, type TraceEntry as B, type CausalChain as C, type DescribeFilter as D, type ExplainPathOptions as E, diffForWAL as F, Graph as G, explainPath as H, graphProfile as I, mermaidLiveUrl as J, reachable as K, type NodeProfile as N, type ObserveDetail as O, type ReachableDirection as R, SNAPSHOT_VERSION as S, type TopologyEvent as T, type GraphOptions as a, type GraphPersistSnapshot as b, type GraphDescribeOptions as c, type GraphDescribeOutput as d, type CausalStep as e, GRAPH_META_SEGMENT as f, type GraphActorOptions as g, type GraphAttachStorageOptions as h, type GraphCheckpointRecord as i, type GraphDiagramDirection as j, type GraphDiagramOptions as k, type GraphDiffChange as l, type GraphDiffResult as m, type GraphFactoryContext as n, type GraphNodeFactory as o, type GraphObserveAll as p, type GraphObserveOne as q, type GraphProfileOptions as r, type GraphProfileResult as s, type GraphVersionChange as t, type GraphWALDiff as u, type ObserveEvent as v, type ObserveOptions as w, type ObserveResult as x, type ObserveTheme as y, type ObserveThemeName as z };

package/dist/{graph-DaoydJ_u.d.cts → graph-kTltt95s.d.cts}

@@ -1,6 +1,7 @@
-import { A as Actor, o as GraphReFlyConfig, V as VersioningLevel, a as Node, b as Messages, K as NodeSink } from './node-8qx0kgYt.cjs';
-import { b as DescribeNodeOutput, D as DescribeDetail, a as DescribeField } from './meta-BdjSt8ky.cjs';
-import { StorageTier, StorageHandle } from './extra/storage-core.cjs';
+import { A as Actor, p as GraphReFlyConfig, V as VersioningLevel, a as Node, b as Messages, K as NodeSink } from './node-fSc-hCv8.cjs';
+import { b as DescribeNodeOutput, D as DescribeDetail, a as DescribeField } from './meta-BGO6C7K9.cjs';
+import { StorageHandle } from './extra/storage-core.cjs';
+import { SnapshotStorageTier } from './extra/storage-tiers.cjs';
 
 /**
  * Causal walkback over a {@link Graph.describe} snapshot (roadmap §9.2).
@@ -356,8 +357,8 @@ type GraphFactoryContext = {
 };
 type GraphNodeFactory = (name: string, context: GraphFactoryContext) => Node;
 /**
- * Checkpoint record shape passed to `StorageTier.save`. Written by
- * {@link Graph.attachStorage} per-tier according to each tier's
+ * Checkpoint record shape passed to `SnapshotStorageTier.save`. Written by
+ * {@link Graph.attachSnapshotStorage} per-tier according to each tier's
  * `compactEvery` cadence.
  *
  * `mode: "full"` → full snapshot. Baseline anchor emitted on the first save
@@ -372,6 +373,7 @@ type GraphNodeFactory = (name: string, context: GraphFactoryContext) => Node;
  * cross-version WAL replay).
  */
 type GraphCheckpointRecord = {
+    name: string;
     seq: number;
     timestamp_ns: number;
     format_version: number;
@@ -382,7 +384,7 @@ type GraphCheckpointRecord = {
     mode: "diff";
     diff: GraphWALDiff;
 });
-/** Options for {@link Graph.attachStorage}. */
+/** Options for {@link Graph.attachSnapshotStorage}. */
 type GraphAttachStorageOptions = {
     /**
      * Before the first save, attempt to restore from the first tier whose
@@ -392,7 +394,7 @@ type GraphAttachStorageOptions = {
     autoRestore?: boolean;
     /**
      * Limit the subscription surface (scoped observe). By default
-     * `attachStorage` observes every node in the graph tree; on large graphs
+     * `attachSnapshotStorage` observes every node in the graph tree; on large graphs
      * that's thousands of subscriptions just for tier-gating. Pass a path
      * list (or a single glob) to observe only those nodes.
      */
@@ -400,7 +402,7 @@ type GraphAttachStorageOptions = {
     /** Pre-save path-level filter — skip records triggered by paths that fail this predicate. */
     filter?: (name: string, described: DescribeNodeOutput) => boolean;
     /** Surfaced on tier save errors and autoRestore failures. */
-    onError?: (error: unknown, tier: StorageTier) => void;
+    onError?: (error: unknown, tier: SnapshotStorageTier<GraphCheckpointRecord>) => void;
 };
 /**
  * Event emitted by {@link Graph.topology} on every structural change to the
@@ -439,7 +441,7 @@ type GraphDiagramOptions = {
 /**
  * Snapshot format version (§3.8). Exported so the surface layer's
  * `saveSnapshot` writes the same `format_version` as
- * `Graph.attachStorage` — one source of truth prevents silent wire
+ * `Graph.attachSnapshotStorage` — one source of truth prevents silent wire
  * drift between auto-checkpoint and one-shot persistence paths.
  */
 declare const SNAPSHOT_VERSION = 1;
@@ -782,6 +784,14 @@ declare class Graph {
      * @param node - Node instance to own.
      * @param opts - `{ name?, annotation? }`.
      */
+    /**
+     * O(1) reverse lookup — returns the name the given Node was registered
+     * under via {@link Graph.add}, or `undefined` if it isn't registered here.
+     *
+     * Audit 2 (2026-04-24): replaces the orchestration's `findRegisteredNodePath`
+     * O(nodes²) describe-scan with direct `WeakMap<Node, string>` lookup.
+     */
+    nameOf(node: Node): string | undefined;
     add<T extends Node>(node: T, opts?: {
         name?: string;
         annotation?: string;
@@ -903,6 +913,8 @@ declare class Graph {
      * @returns The mounted `child`, for chaining.
      */
     mount<G extends Graph>(name: string, child: G): G;
+    mount(name: string): Graph;
+    mount(name: string, builder: (sub: Graph) => void): Graph;
     /**
      * Look up a node by qualified path (§3.5). Segments are separated by `::`.
      *
@@ -1206,7 +1218,7 @@ declare class Graph {
     toJSON(): GraphPersistSnapshot;
     /**
      * Unified persistence surface (§3.8). Cascades snapshot records through
-     * one or more {@link StorageTier}s, each with its own `debounceMs` /
+     * one or more {@link SnapshotStorageTier}s, each with its own `debounceMs` /
      * `compactEvery` cadence and independent diff baseline.
      *
      * Subscription gates on {@link messageTier} ≥ 3 (DATA/RESOLVED/terminal),
@@ -1220,7 +1232,7 @@ declare class Graph {
      * share a single snapshot computation per observe event; debounced tiers
      * compute their own snapshot when their timer fires.
      */
-    attachStorage(tiers: readonly StorageTier[], options?: GraphAttachStorageOptions): StorageHandle;
+    attachSnapshotStorage(tiers: readonly SnapshotStorageTier<GraphCheckpointRecord>[], options?: GraphAttachStorageOptions): StorageHandle;
     /**
      * Try tiers in order (hottest first); apply the first record that hits
      * via {@link Graph.restore}. Returns `true` if any tier produced a
@@ -1237,7 +1249,7 @@ declare class Graph {
      * the bad tier, some pre-existing). A subsequent successful tier's
      * `restore()` overwrites the overlapping slices.
      *
-     * Internal helper shared by {@link Graph.attachStorage}'s `autoRestore`
+     * Internal helper shared by {@link Graph.attachSnapshotStorage}'s `autoRestore`
      * option and the static {@link Graph.fromStorage} factory.
      */
     private _cascadeRestore;
@@ -1253,14 +1265,14 @@ declare class Graph {
      * @throws If no tier holds a restorable record matching `name` *and* no
      *   `factories` override is provided for dynamic nodes.
      */
-    static fromStorage(name: string, tiers: readonly StorageTier[], opts?: GraphOptions & {
+    static fromStorage(name: string, tiers: readonly SnapshotStorageTier<GraphCheckpointRecord>[], opts?: GraphOptions & {
         factories?: Record<string, GraphNodeFactory>;
         /**
          * Called when a tier throws during `load()` or when
          * {@link Graph.fromSnapshot} rejects a tier's record. The cascade
          * falls through to the next colder tier regardless.
          */
-        onError?: (err: unknown, tier: StorageTier) => void;
+        onError?: (err: unknown, tier: SnapshotStorageTier<GraphCheckpointRecord>) => void;
     }): Promise<Graph>;
     private _annotations;
     private readonly _traceRing;
@@ -1350,7 +1362,7 @@ type GraphDiffResult = {
  * slice for each added path so {@link replayWAL} can reconstruct nodes added
  * between full anchors (topology mutations inside a `compactEvery` window).
  *
- * `Graph.diff()` returns the audit shape (no payload); `attachStorage` writes
+ * `Graph.diff()` returns the audit shape (no payload); `attachSnapshotStorage` writes
  * this WAL shape. The two shapes stay structurally compatible — `GraphWALDiff`
  * is a superset.
  */
@@ -1445,4 +1457,4 @@ declare function reachable(described: GraphDescribeOutput, from: string, directi
 }): ReachableResult;
 declare function reachable(described: GraphDescribeOutput, from: string, direction: ReachableDirection, options?: ReachableOptions): string[];
 
-export { type ReachableOptions as A, type TraceEntry as B, type CausalChain as C, type DescribeFilter as D, type ExplainPathOptions as E, diffForWAL as F, Graph as G, explainPath as H, graphProfile as I, mermaidLiveUrl as J, reachable as K, type NodeProfile as N, type ObserveDetail as O, type ReachableDirection as R, SNAPSHOT_VERSION as S, type TopologyEvent as T, type GraphOptions as a, type GraphDescribeOptions as b, type GraphDescribeOutput as c, type GraphPersistSnapshot as d, type CausalStep as e, GRAPH_META_SEGMENT as f, type GraphActorOptions as g, type GraphAttachStorageOptions as h, type GraphCheckpointRecord as i, type GraphDiagramDirection as j, type GraphDiagramOptions as k, type GraphDiffChange as l, type GraphDiffResult as m, type GraphFactoryContext as n, type GraphNodeFactory as o, type GraphObserveAll as p, type GraphObserveOne as q, type GraphProfileOptions as r, type GraphProfileResult as s, type GraphVersionChange as t, type GraphWALDiff as u, type ObserveEvent as v, type ObserveOptions as w, type ObserveResult as x, type ObserveTheme as y, type ObserveThemeName as z };
+export { type ReachableOptions as A, type TraceEntry as B, type CausalChain as C, type DescribeFilter as D, type ExplainPathOptions as E, diffForWAL as F, Graph as G, explainPath as H, graphProfile as I, mermaidLiveUrl as J, reachable as K, type NodeProfile as N, type ObserveDetail as O, type ReachableDirection as R, SNAPSHOT_VERSION as S, type TopologyEvent as T, type GraphOptions as a, type GraphPersistSnapshot as b, type GraphDescribeOptions as c, type GraphDescribeOutput as d, type CausalStep as e, GRAPH_META_SEGMENT as f, type GraphActorOptions as g, type GraphAttachStorageOptions as h, type GraphCheckpointRecord as i, type GraphDiagramDirection as j, type GraphDiagramOptions as k, type GraphDiffChange as l, type GraphDiffResult as m, type GraphFactoryContext as n, type GraphNodeFactory as o, type GraphObserveAll as p, type GraphObserveOne as q, type GraphProfileOptions as r, type GraphProfileResult as s, type GraphVersionChange as t, type GraphWALDiff as u, type ObserveEvent as v, type ObserveOptions as w, type ObserveResult as x, type ObserveTheme as y, type ObserveThemeName as z };

package/dist/imperative-audit-ahAE65a9.d.cts

@@ -0,0 +1,28 @@
+/**
+ * Imperative-controller-with-audit helper layer (Audit 2 — locked 2026-04-24).
+ *
+ * Five Phase-4 primitives share the same shape: imperative mutation methods +
+ * closure state + reactive audit log + freeze-at-entry + rollback-on-throw.
+ * This module factors out the common machinery so each primitive becomes
+ * declarative wiring over typed audit records:
+ *  - `gate`, `pipeline.gate`            (Wave A.2 Unit 8)
+ *  - `JobQueueGraph`                    (Wave B.3 Unit 15)
+ *  - `CqrsGraph.dispatch`               (Wave C.2 Unit 20)
+ *  - `CqrsGraph.saga`                   (Wave C.3 Unit 22)
+ *  - `processManager` (Wave 7)          [out of scope this commit]
+ *
+ * @internal — exposed for primitive impls only; not re-exported through any
+ * patterns/<x>/index.ts barrel.
+ */
+
+/** Shared base shape for every audit record. Per-primitive types extend this. */
+interface BaseAuditRecord {
+    readonly t_ns: number;
+    readonly seq?: number;
+    readonly handlerVersion?: {
+        id: string;
+        version: string | number;
+    };
+}
+
+export type { BaseAuditRecord as B };

package/dist/imperative-audit-ahAE65a9.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Imperative-controller-with-audit helper layer (Audit 2 — locked 2026-04-24).
+ *
+ * Five Phase-4 primitives share the same shape: imperative mutation methods +
+ * closure state + reactive audit log + freeze-at-entry + rollback-on-throw.
+ * This module factors out the common machinery so each primitive becomes
+ * declarative wiring over typed audit records:
+ *  - `gate`, `pipeline.gate`            (Wave A.2 Unit 8)
+ *  - `JobQueueGraph`                    (Wave B.3 Unit 15)
+ *  - `CqrsGraph.dispatch`               (Wave C.2 Unit 20)
+ *  - `CqrsGraph.saga`                   (Wave C.3 Unit 22)
+ *  - `processManager` (Wave 7)          [out of scope this commit]
+ *
+ * @internal — exposed for primitive impls only; not re-exported through any
+ * patterns/<x>/index.ts barrel.
+ */
+
+/** Shared base shape for every audit record. Per-primitive types extend this. */
+interface BaseAuditRecord {
+    readonly t_ns: number;
+    readonly seq?: number;
+    readonly handlerVersion?: {
+        id: string;
+        version: string | number;
+    };
+}
+
+export type { BaseAuditRecord as B };

package/dist/{index-CI5fULSz.d.ts → index-8OxXae3g.d.ts}

@@ -1,4 +1,4 @@
-import { a as Node } from './node-8qx0kgYt.js';
+import { a as Node } from './node-fSc-hCv8.js';
 
 /**
  * A Nanostores-compatible atom.

package/dist/{index-CQ1gt4rn.d.cts → index-9xhIaM-w.d.cts}

@@ -1,4 +1,4 @@
-import { a as Node } from './node-8qx0kgYt.cjs';
+import { a as Node } from './node-fSc-hCv8.cjs';
 
 /** Solid accessor function — returns current value when called. */
 type Accessor<T> = () => T;

package/dist/{index-DhWrMTI6.d.cts → index-B3D_z0Z6.d.cts}

@@ -1,4 +1,4 @@
-import { a as Node } from './node-8qx0kgYt.cjs';
+import { a as Node } from './node-fSc-hCv8.cjs';
 
 /**
  * A Nanostores-compatible atom.

package/dist/{index-Ccv_61jG.d.cts → index-B3Dfl5sS.d.cts}

@@ -1,22 +1,11 @@
-import { a as Node } from './node-8qx0kgYt.cjs';
-import { G as Graph, a as GraphOptions } from './graph-DaoydJ_u.cjs';
-
-/**
- * Messaging patterns (roadmap §4.2).
- *
- * Pulsar-inspired messaging primitives modeled as graph factories:
- * - `topic()` for append-only topic streams with a retained window.
- * - `subscription()` for cursor-based consumers.
- * - `topicBridge()` for autonomous topic-to-topic relay.
- * - `messagingHub()` for a lazy topic registry.
- *
- * Job queue / job flow primitives live in `patterns/job-queue` — they are a
- * distinct domain that happens to share reactive-log / reactive-map
- * infrastructure with topics.
- */
+import { a as Node } from './node-fSc-hCv8.cjs';
+import { G as Graph, a as GraphOptions } from './graph-kTltt95s.cjs';
+import { R as ReactiveLogBundle } from './reactive-log-CgbNqksB.cjs';
+import { AppendLogStorageTier } from './extra/storage-tiers.cjs';
 
 type TopicOptions = {
     graph?: GraphOptions;
+    /** Bounded retention; default 1024 per cross-cutting policy (Audit 2/4). */
     retainedLimit?: number;
 };
 declare class TopicGraph<T> extends Graph {
@@ -42,14 +31,48 @@ declare class TopicGraph<T> extends Graph {
     readonly hasLatest: Node<boolean>;
     constructor(name: string, opts?: TopicOptions);
     publish(value: T): void;
+    /**
+     * Wire one or more append-log storage tiers (Audit 4). Each tier receives
+     * appended events per wave; rollback honors the wave-as-transaction model.
+     *
+     * Named `attachEventStorage` (not `attachStorage`) to avoid colliding with
+     * the inherited {@link Graph.attachSnapshotStorage} which takes the
+     * snapshot-based `StorageTier[]` shape.
+     *
+     * @returns Disposer.
+     */
+    attachEventStorage(tiers: readonly AppendLogStorageTier<T>[]): () => void;
     retained(): readonly T[];
+    /** Internal log bundle — used by TopicBridgeGraph for `attach`. */
+    get _logBundle(): ReactiveLogBundle<T>;
 }
 type SubscriptionOptions = {
     graph?: GraphOptions;
+    /**
+     * Starting cursor position.
+     * @deprecated Use `from` instead.
+     */
     cursor?: number;
+    /**
+     * Starting position for the subscription.
+     * - `"retained"` (default) — cursor starts at 0; consumer sees all retained history.
+     * - `"now"` — cursor starts at current topic length; consumer ignores history.
+     * - `number` — explicit cursor position.
+     */
+    from?: "now" | "retained" | number;
+    /**
+     * When this signal node emits DATA, the subscription auto-advances cursor
+     * to current `available.length`. Useful for "ack everything when X happens"
+     * patterns. The reactive edge `advanceOn → cursor` is visible in `explain()`.
+     */
+    advanceOn?: Node<unknown>;
+};
+/** Result of {@link SubscriptionGraph.pullAndAck}. */
+type PullAndAckResult<T> = {
+    items: readonly T[];
+    cursor: number;
 };
 declare class SubscriptionGraph<T> extends Graph {
-    readonly source: Node<readonly T[]>;
     readonly cursor: Node<number>;
     readonly available: Node<readonly T[]>;
     /**
@@ -61,24 +84,74 @@ declare class SubscriptionGraph<T> extends Graph {
      * still wires the data dependency across graph boundaries. D1(e).
      */
     readonly topic: TopicGraph<T>;
+    private _disposed;
     constructor(name: string, topicGraph: TopicGraph<T>, opts?: SubscriptionOptions);
     ack(count?: number): number;
-    pull(limit?: number, opts?: {
-        ack?: boolean;
-    }): readonly T[];
+    pull(limit?: number): readonly T[];
+    /**
+     * Atomic pull-and-acknowledge. Returns `{ items, cursor }` where `cursor`
+     * is the new cursor position after advancing. Under single-threaded JS the
+     * snapshot and advance are atomic; PY callers use a per-subscription Lock.
+     *
+     * Replaces `pull(limit, { ack: true })`.
+     */
+    pullAndAck(limit?: number): PullAndAckResult<T>;
+    /**
+     * Release internal subscriptions and mark the subscription torn-down.
+     * Subsequent `pull`, `pullAndAck`, `ack` return empty / current cursor.
+     * Emits COMPLETE on `cursor` so derived consumers (e.g. `available`) see
+     * the termination signal. Also drains `addDisposer` callbacks (including
+     * the `keepalive(advancePump)` subscription) so no keepalive leak occurs.
+     */
+    dispose(): void;
 }
 type TopicBridgeOptions<TIn, TOut> = {
     graph?: GraphOptions;
     cursor?: number;
     maxPerPump?: number;
+    /**
+     * Optional transform/filter applied to each item before republishing.
+     *
+     * **At-most-once with silent drop:** when `map` returns `undefined`, the
+     * input is consumed from the source cursor but NOT republished. Filtered
+     * items are not retained for retry. If you need filter-with-retry
+     * semantics, do the filtering in a downstream subscription on the bridged
+     * output rather than in the `map` function.
+     */
     map?: (value: TIn) => TOut | undefined;
 };
 declare class TopicBridgeGraph<TIn, TOut = TIn> extends Graph {
     private readonly _sourceSub;
-    private readonly _target;
     readonly bridgedCount: Node<number>;
+    /**
+     * Emits each mapped batch as DATA — gives downstream observers a reactive
+     * stream of bridged values. Also the link target for `target._log.attach`.
+     */
+    readonly output: Node<readonly TOut[]>;
     constructor(name: string, sourceTopic: TopicGraph<TIn>, targetTopic: TopicGraph<TOut>, opts?: TopicBridgeOptions<TIn, TOut>);
 }
+/**
+ * Private pure data structure managing a named set of {@link TopicGraph}
+ * instances. Extracted from {@link MessagingHubGraph} for separation of
+ * concerns (B.2 Unit 14 lock: D — split into TopicRegistry + facade).
+ *
+ * Reusable if other domain consumers (e.g. cqrs.eventLogs) want a shared
+ * topic registry later.
+ *
+ * @internal
+ */
+declare class TopicRegistry {
+    private readonly _map;
+    /** Reactive monotonic version counter. Advances on topic create/remove. */
+    readonly version: Node<number>;
+    constructor(versionNode: Node<number>);
+    get size(): number;
+    has(name: string): boolean;
+    get<T>(name: string): TopicGraph<T> | undefined;
+    set<T>(name: string, t: TopicGraph<T>): void;
+    delete(name: string): boolean;
+    keys(): IterableIterator<string>;
+}
 type MessagingHubOptions = {
     graph?: GraphOptions;
     /**
@@ -93,6 +166,9 @@ type MessagingHubOptions = {
  * instances with retention + cursor semantics. Topics are created on first
  * access; `removeTopic(name)` unmounts and tears down via {@link Graph.remove}.
  *
+ * Internally delegates to {@link TopicRegistry} for topic map management
+ * (B.2 Unit 14 lock: D facade split).
+ *
  * **Relationship to `pubsub()` in `src/extra/pubsub.ts`:** `pubsub` is a
  * lightweight last-value state hub (no retention, no cursors). `MessagingHubGraph`
  * is the full messaging hub — retained message logs, cursor-based subscriptions,
@@ -101,12 +177,11 @@ type MessagingHubOptions = {
  * @category patterns
  */
 declare class MessagingHubGraph extends Graph {
-    private readonly _topics;
-    private _version;
+    private readonly _registry;
+    /** Reactive monotonic version counter — advances on topic create/remove. */
+    readonly version: Node<number>;
     private readonly _defaultTopicOptions;
     constructor(name: string, opts?: MessagingHubOptions);
-    /** Monotonic counter advancing on topic create/remove. */
-    get version(): number;
     /** Number of topics currently in the hub. */
     get size(): number;
     /** Checks topic existence without creating. */
@@ -181,12 +256,18 @@ declare function messagingHub(name: string, opts?: MessagingHubOptions): Messagi
 declare function subscription<T>(name: string, topicGraph: TopicGraph<T>, opts?: SubscriptionOptions): SubscriptionGraph<T>;
 /**
  * Creates an autonomous cursor-based topic relay graph.
+ *
+ * When `opts.map` is provided, items where `map` returns `undefined` are
+ * consumed from the source cursor but NOT republished (at-most-once with
+ * silent drop). For filter-with-retry semantics, apply the filter in a
+ * downstream subscription on the bridge's `output` node instead.
  */
 declare function topicBridge<TIn, TOut = TIn>(name: string, sourceTopic: TopicGraph<TIn>, targetTopic: TopicGraph<TOut>, opts?: TopicBridgeOptions<TIn, TOut>): TopicBridgeGraph<TIn, TOut>;
 
 type index_MessagingHubGraph = MessagingHubGraph;
 declare const index_MessagingHubGraph: typeof MessagingHubGraph;
 type index_MessagingHubOptions = MessagingHubOptions;
+type index_PullAndAckResult<T> = PullAndAckResult<T>;
 type index_SubscriptionGraph<T> = SubscriptionGraph<T>;
 declare const index_SubscriptionGraph: typeof SubscriptionGraph;
 type index_SubscriptionOptions = SubscriptionOptions;
@@ -196,12 +277,14 @@ type index_TopicBridgeOptions<TIn, TOut> = TopicBridgeOptions<TIn, TOut>;
 type index_TopicGraph<T> = TopicGraph<T>;
 declare const index_TopicGraph: typeof TopicGraph;
 type index_TopicOptions = TopicOptions;
+type index_TopicRegistry = TopicRegistry;
+declare const index_TopicRegistry: typeof TopicRegistry;
 declare const index_messagingHub: typeof messagingHub;
 declare const index_subscription: typeof subscription;
 declare const index_topic: typeof topic;
 declare const index_topicBridge: typeof topicBridge;
 declare namespace index {
-  export { index_MessagingHubGraph as MessagingHubGraph, type index_MessagingHubOptions as MessagingHubOptions, index_SubscriptionGraph as SubscriptionGraph, type index_SubscriptionOptions as SubscriptionOptions, index_TopicBridgeGraph as TopicBridgeGraph, type index_TopicBridgeOptions as TopicBridgeOptions, index_TopicGraph as TopicGraph, type index_TopicOptions as TopicOptions, index_messagingHub as messagingHub, index_subscription as subscription, index_topic as topic, index_topicBridge as topicBridge };
+  export { index_MessagingHubGraph as MessagingHubGraph, type index_MessagingHubOptions as MessagingHubOptions, type index_PullAndAckResult as PullAndAckResult, index_SubscriptionGraph as SubscriptionGraph, type index_SubscriptionOptions as SubscriptionOptions, index_TopicBridgeGraph as TopicBridgeGraph, type index_TopicBridgeOptions as TopicBridgeOptions, index_TopicGraph as TopicGraph, type index_TopicOptions as TopicOptions, index_TopicRegistry as TopicRegistry, index_messagingHub as messagingHub, index_subscription as subscription, index_topic as topic, index_topicBridge as topicBridge };
 }
 
-export { MessagingHubGraph as M, SubscriptionGraph as S, TopicGraph as T, type MessagingHubOptions as a, type SubscriptionOptions as b, TopicBridgeGraph as c, type TopicBridgeOptions as d, type TopicOptions as e, topicBridge as f, index as i, messagingHub as m, subscription as s, topic as t };
+export { MessagingHubGraph as M, type PullAndAckResult as P, SubscriptionGraph as S, TopicGraph as T, type MessagingHubOptions as a, type SubscriptionOptions as b, TopicBridgeGraph as c, type TopicBridgeOptions as d, type TopicOptions as e, TopicRegistry as f, topicBridge as g, index as i, messagingHub as m, subscription as s, topic as t };

package/dist/{index-Dia4yc2y.d.ts → index-B4s70vYf.d.ts}

@@ -1,6 +1,6 @@
-import { o as GraphReFlyConfig } from './node-8qx0kgYt.js';
-import { d as GraphPersistSnapshot, i as GraphCheckpointRecord, G as Graph, C as CausalChain, e as CausalStep, D as DescribeFilter, E as ExplainPathOptions, f as GRAPH_META_SEGMENT, g as GraphActorOptions, h as GraphAttachStorageOptions, b as GraphDescribeOptions, c as GraphDescribeOutput, j as GraphDiagramDirection, k as GraphDiagramOptions, l as GraphDiffChange, m as GraphDiffResult, n as GraphFactoryContext, o as GraphNodeFactory, p as GraphObserveAll, q as GraphObserveOne, a as GraphOptions, r as GraphProfileOptions, s as GraphProfileResult, t as GraphVersionChange, u as GraphWALDiff, N as NodeProfile, O as ObserveDetail, v as ObserveEvent, w as ObserveOptions, x as ObserveResult, y as ObserveTheme, z as ObserveThemeName, R as ReachableDirection, A as ReachableOptions, S as SNAPSHOT_VERSION, T as TopologyEvent, B as TraceEntry, F as diffForWAL, H as explainPath, I as graphProfile, J as mermaidLiveUrl, K as reachable } from './graph-BROUZPG9.js';
-import { w as watchTopologyTree } from './topology-tree-CAFOG5S5.js';
+import { p as GraphReFlyConfig } from './node-fSc-hCv8.js';
+import { b as GraphPersistSnapshot, i as GraphCheckpointRecord, G as Graph, C as CausalChain, e as CausalStep, D as DescribeFilter, E as ExplainPathOptions, f as GRAPH_META_SEGMENT, g as GraphActorOptions, h as GraphAttachStorageOptions, c as GraphDescribeOptions, d as GraphDescribeOutput, j as GraphDiagramDirection, k as GraphDiagramOptions, l as GraphDiffChange, m as GraphDiffResult, n as GraphFactoryContext, o as GraphNodeFactory, p as GraphObserveAll, q as GraphObserveOne, a as GraphOptions, r as GraphProfileOptions, s as GraphProfileResult, t as GraphVersionChange, u as GraphWALDiff, N as NodeProfile, O as ObserveDetail, v as ObserveEvent, w as ObserveOptions, x as ObserveResult, y as ObserveTheme, z as ObserveThemeName, R as ReachableDirection, A as ReachableOptions, S as SNAPSHOT_VERSION, T as TopologyEvent, B as TraceEntry, F as diffForWAL, H as explainPath, I as graphProfile, J as mermaidLiveUrl, K as reachable } from './graph-Cv-8x0ZI.js';
+import { w as watchTopologyTree } from './topology-tree-CJsT24DP.js';
 
 /**
  * Approximate in-memory size estimation for arbitrary JS values.
@@ -243,7 +243,7 @@ declare function registerBuiltinCodecs(config: GraphReFlyConfig): void;
  * Reconstruct a snapshot from a WAL (sequence of {@link GraphCheckpointRecord}s).
  *
  * - Must start with a `"full"` record carrying a baseline snapshot — that's
- *   the anchor {@link Graph.attachStorage} always emits on the first flush
+ *   the anchor {@link Graph.attachSnapshotStorage} always emits on the first flush
  *   of any tier (and every `compactEvery`-th flush thereafter).
  * - Subsequent `"full"` entries (compaction points) **replace** the result
  *   wholesale.

package/dist/{index-Db21wuaD.d.ts → index-B5UR87KG.d.ts}

@@ -1,6 +1,6 @@
-import { b as Messages, A as Actor, C as COMPLETE, f as COMPLETE_MSG, g as COMPLETE_ONLY_BATCH, D as DATA, h as DEFAULT_ACTOR, i as DIRTY, j as DIRTY_MSG, k as DIRTY_ONLY_BATCH, l as DepRecord, E as ERROR, F as FnCtx, m as GlobalInspectorEvent, n as GlobalInspectorHook, o as GraphReFlyConfig, G as GuardAction, p as GuardDenied, q as GuardDeniedDetails, H as HashFn, I as INVALIDATE, r as INVALIDATE_MSG, s as INVALIDATE_ONLY_BATCH, M as Message, t as MessageContext, u as MessageTypeRegistration, v as MessageTypeRegistrationInput, a as Node, c as NodeActions, w as NodeCtx, e as NodeDescribeKind, x as NodeFn, d as NodeFnCleanup, y as NodeGuard, z as NodeImpl, B as NodeInspectorHook, J as NodeInspectorHookEvent, N as NodeOptions, K as NodeSink, L as NodeStatus, O as NodeTransportOptions, Q as NodeVersionInfo, R as OnMessageHandler, S as OnSubscribeHandler, T as PAUSE, U as PolicyAllow, W as PolicyDeny, P as PolicyRuleData, X as RESOLVED, Y as RESOLVED_MSG, Z as RESOLVED_ONLY_BATCH, _ as RESUME, $ as RigorRecorder, a0 as START, a1 as START_MSG, a2 as SubscribeContext, a3 as TEARDOWN, a4 as TEARDOWN_MSG, a5 as TEARDOWN_ONLY_BATCH, a6 as V0, a7 as V1, V as VersioningLevel, a8 as VersioningOptions, a9 as accessHintForGuard, aa as advanceVersion, ab as configure, ac as createVersioning, ad as defaultConfig, ae as defaultHash, af as isV1, ag as node, ah as normalizeActor, ai as policy, aj as policyFromRules, ak as registerBuiltins } from './node-8qx0kgYt.js';
-import { D as DescribeDetail, a as DescribeField, b as DescribeNodeOutput, r as resolveDescribeFields } from './meta-CtDjj7cU.js';
-import { A as AutoTrackOptions, D as DerivedFn, a as DynamicFn, E as EffectFn, P as PipeOperator, b as ProducerFn, T as TrackFn, c as autoTrackNode, d as derived, e as dynamicNode, f as effect, p as pipe, g as producer, s as state } from './sugar-CQkn_rxB.js';
+import { b as Messages, A as Actor, C as COMPLETE, g as COMPLETE_MSG, h as COMPLETE_ONLY_BATCH, D as DATA, i as DEFAULT_ACTOR, j as DIRTY, k as DIRTY_MSG, l as DIRTY_ONLY_BATCH, m as DepRecord, E as ERROR, F as FnCtx, n as GlobalInspectorEvent, o as GlobalInspectorHook, p as GraphReFlyConfig, G as GuardAction, q as GuardDenied, r as GuardDeniedDetails, H as HashFn, I as INVALIDATE, s as INVALIDATE_MSG, t as INVALIDATE_ONLY_BATCH, M as Message, u as MessageContext, v as MessageTypeRegistration, w as MessageTypeRegistrationInput, a as Node, c as NodeActions, x as NodeCtx, e as NodeDescribeKind, y as NodeFn, d as NodeFnCleanup, f as NodeGuard, z as NodeImpl, B as NodeInspectorHook, J as NodeInspectorHookEvent, N as NodeOptions, K as NodeSink, L as NodeStatus, O as NodeTransportOptions, Q as NodeVersionInfo, R as OnMessageHandler, S as OnSubscribeHandler, T as PAUSE, U as PolicyAllow, W as PolicyDeny, P as PolicyRuleData, X as RESOLVED, Y as RESOLVED_MSG, Z as RESOLVED_ONLY_BATCH, _ as RESUME, $ as RigorRecorder, a0 as START, a1 as START_MSG, a2 as SubscribeContext, a3 as TEARDOWN, a4 as TEARDOWN_MSG, a5 as TEARDOWN_ONLY_BATCH, a6 as V0, a7 as V1, V as VersioningLevel, a8 as VersioningOptions, a9 as accessHintForGuard, aa as advanceVersion, ab as configure, ac as createVersioning, ad as defaultConfig, ae as defaultHash, af as isV1, ag as node, ah as normalizeActor, ai as policy, aj as policyFromRules, ak as registerBuiltins } from './node-fSc-hCv8.js';
+import { D as DescribeDetail, a as DescribeField, b as DescribeNodeOutput, r as resolveDescribeFields } from './meta-CC6EPdpK.js';
+import { A as AutoTrackOptions, D as DerivedFn, a as DynamicFn, E as EffectFn, P as PipeOperator, b as ProducerFn, T as TrackFn, c as autoTrackNode, d as derived, e as dynamicNode, f as effect, p as pipe, g as producer, s as state } from './sugar-D13E2M_z.js';
 
 /**
  * Batch deferral for tier-3+ messages, plus per-node emit coalescing inside

package/dist/{index-DuvQAU02.d.ts → index-BBdwz2BW.d.ts}

@@ -1,5 +1,5 @@
-import { G as Graph } from './graph-BROUZPG9.js';
-import { M as MeasurementAdapter } from './reactive-layout-DBJ3Vz-m.js';
+import { G as Graph } from './graph-Cv-8x0ZI.js';
+import { M as MeasurementAdapter } from './reactive-layout-Btv0-efV.js';
 
 /**
  * Three-pane demo shell (roadmap §7.2).