@graphrefly/graphrefly 0.20.0 → 0.22.0

package/dist/index.js

@@ -1,20 +1,19 @@
 import {
   CircuitOpenError,
-  DictCheckpointAdapter,
-  FileCheckpointAdapter,
-  MemoryCheckpointAdapter,
   NS_PER_MS,
   NS_PER_SEC,
-  SqliteCheckpointAdapter,
+  NativeIndexBackend,
+  NativeListBackend,
+  NativeMapBackend,
+  NativePubSubBackend,
+  RateLimiterOverflowError,
   TimeoutError,
   audit,
   buffer,
   bufferCount,
   bufferTime,
-  cache,
   cascadingCache,
   catchError,
-  checkpointNodeValue,
   checkpointToRedis,
   checkpointToS3,
   circuitBreaker,
@@ -24,19 +23,24 @@ import {
   concatMap,
   constant,
   createTransport,
+  csvRows,
   debounce,
   debounceTime,
   decorrelatedJitter,
   delay,
   deserializeError,
+  dictStorage,
   distill,
   distinctUntilChanged,
   elementAt,
   exhaustMap,
   exponential,
+  externalBundle,
+  externalProducer,
   extra_exports,
   fallback,
   fibonacci,
+  fileStorage,
   filter,
   find,
   first,
@@ -46,6 +50,8 @@ import {
   fromDrizzle,
   fromGitHook,
   fromHTTP,
+  fromHTTPPoll,
+  fromHTTPStream,
   fromIDBRequest,
   fromIDBTransaction,
   fromKafka,
@@ -59,19 +65,25 @@ import {
   fromPulsar,
   fromRabbitMQ,
   fromRedisStream,
+  fromSSE,
   fromSqlite,
+  fromSqliteCursor,
   fromStatsD,
   fromSyslog,
   fromWebSocket,
+  fromWebSocketReconnect,
   fromWebhook,
+  indexedDbStorage,
   interval,
   last,
   linear,
   lru,
   map,
+  memoryStorage,
   merge,
   mergeMap,
   nameToSignal,
+  ndjsonRows,
   pairwise,
   parsePrometheusText,
   parseStatsD,
@@ -83,20 +95,19 @@ import {
   reactiveIndex,
   reactiveList,
   reactiveMap,
+  reactiveSink,
   reduce,
   repeat,
   rescue,
   resolveBackoffPreset,
-  restoreGraphCheckpoint,
-  restoreGraphCheckpointIndexedDb,
   retry,
+  retrySource,
   sample,
-  saveGraphCheckpoint,
-  saveGraphCheckpointIndexedDb,
   scan,
   serializeError,
   signalToName,
   skip,
+  sqliteStorage,
   switchMap,
   take,
   takeUntil,
@@ -104,11 +115,11 @@ import {
   tap,
   throttle,
   throttleTime,
-  tieredStorage,
   timeout,
   toCSV,
   toClickHouse,
   toFile,
+  toHTTP,
   toKafka,
   toLoki,
   toMongo,
@@ -116,14 +127,15 @@ import {
   toPostgres,
   toPulsar,
   toRabbitMQ,
+  toReadableStream,
   toRedisStream,
   toS3,
   toSSE,
+  toSSEBytes,
   toSqlite,
   toTempo,
   toWebSocket,
   tokenBucket,
-  tokenTracker,
   valve,
   verifiable,
   window,
@@ -136,27 +148,22 @@ import {
   workerBridge,
   workerSelf,
   zip
-} from "./chunk-BJAOEU4D.js";
+} from "./chunk-BLD3IFYF.js";
 import {
   cqrs_exports,
   domainMeta,
   nestjs_exports,
-  trackingKey
-} from "./chunk-5PSVTDNZ.js";
+  trackingKey,
+  tryIncrementBounded
+} from "./chunk-MQBQOFDS.js";
 import {
-  DEFAULT_DOWN,
-  bridge,
   core_exports
-} from "./chunk-PGEU5MEH.js";
+} from "./chunk-RHI3GHZW.js";
 import {
-  JsonCodec,
-  createDagCborCodec,
-  createDagCborZstdCodec,
-  graph_exports,
-  negotiateCodec,
-  replayWAL
-} from "./chunk-R2LPZIY2.js";
+  graph_exports
+} from "./chunk-44HD4BTA.js";
 import {
+  NativeLogBackend,
   cached,
   createWatermarkController,
   empty,
@@ -174,7 +181,6 @@ import {
   fromTimer,
   globToRegExp,
   keepalive,
-  logSlice,
   matchesAnyPattern,
   matchesCron,
   never,
@@ -188,72 +194,89 @@ import {
   throwError,
   toArray,
   toObservable
-} from "./chunk-OOA2UTXF.js";
-import {
-  ResettableTimer
-} from "./chunk-WZ2Z2CRV.js";
+} from "./chunk-IR3KMOLX.js";
 import {
   analyzeAndMeasure,
   computeLineBreaks,
   reactive_layout_exports
-} from "./chunk-IAPLC4NR.js";
+} from "./chunk-EQUZ5NLD.js";
 import {
   GRAPH_META_SEGMENT,
   Graph,
+  OVERHEAD,
+  SIZEOF_SYMBOL,
+  diffForWAL,
   graphProfile,
   reachable,
   sizeof
-} from "./chunk-3N2Y6PCR.js";
+} from "./chunk-NXC35KC5.js";
 import {
   describeNode,
   resolveDescribeFields
-} from "./chunk-2L5J6RPM.js";
+} from "./chunk-TH6COGOP.js";
+import {
+  ResettableTimer
+} from "./chunk-7TAQJHQV.js";
 import {
-  CLEANUP_RESULT,
   COMPLETE,
+  COMPLETE_MSG,
+  COMPLETE_ONLY_BATCH,
   DATA,
   DEFAULT_ACTOR,
   DIRTY,
-  DynamicNodeImpl,
+  DIRTY_MSG,
+  DIRTY_ONLY_BATCH,
+  ENVELOPE_VERSION,
   ERROR,
+  GraphReFlyConfig,
   GuardDenied,
   INVALIDATE,
+  INVALIDATE_MSG,
+  INVALIDATE_ONLY_BATCH,
+  JsonCodec,
+  NodeImpl,
   PAUSE,
   RESOLVED,
+  RESOLVED_MSG,
+  RESOLVED_ONLY_BATCH,
   RESUME,
   START,
+  START_MSG,
   TEARDOWN,
+  TEARDOWN_MSG,
+  TEARDOWN_ONLY_BATCH,
   __export,
   accessHintForGuard,
   advanceVersion,
+  autoTrackNode,
   batch,
-  cleanupResult,
+  configure,
+  createDagCborCodec,
+  createDagCborZstdCodec,
   createVersioning,
+  decodeEnvelope,
+  defaultConfig,
   defaultHash,
   derived,
   downWithBatch,
   dynamicNode,
   effect,
+  encodeEnvelope,
   isBatching,
-  isKnownMessageType,
-  isLocalOnly,
-  isPhase2Message,
-  isTerminalMessage,
   isV1,
-  knownMessageTypes,
-  messageTier,
   monotonicNs,
   node,
   normalizeActor,
-  partitionForBatch,
   pipe,
   policy,
   policyFromRules,
   producer,
-  propagatesToMeta,
+  registerBuiltinCodecs,
+  registerBuiltins,
+  replayWAL,
   state,
   wallClockNs
-} from "./chunk-XYL3GLB3.js";
+} from "./chunk-QA3RP5NH.js";
 
 // src/compat/index.ts
 var compat_exports = {};
@@ -285,7 +308,7 @@ function atom(initialOrRead, writeOrOptions, options) {
   return createPrimitiveAtom(initialOrRead, writeOrOptions);
 }
 function pull(n) {
-  let val = n.get();
+  let val = n.cache;
   let err;
   const unsub = n.subscribe((msgs) => {
     for (const [t, v] of msgs) {
@@ -305,15 +328,19 @@ function createPrimitiveAtom(initial, options) {
   });
   return {
     get: () => {
-      if (n.status === "disconnected") {
+      if (n.status === "sentinel") {
         return pull(n);
       }
-      return n.get();
+      return n.cache;
     },
-    set: (value) => n.down([[DATA, value]]),
+    // Use `n.emit` (not raw `n.down`) so writes go through the framed
+    // emit pipeline: bundle() auto-prefixes DIRTY (diamond-safe wave
+    // coordination) and the equals check folds same-value writes to
+    // RESOLVED (no spurious subscriber fires).
+    set: (value) => n.emit(value),
     update: (fn) => {
-      const current = n.status === "disconnected" ? pull(n) : n.get();
-      n.down([[DATA, fn(current)]]);
+      const current = n.status === "sentinel" ? pull(n) : n.cache;
+      n.emit(fn(current));
     },
     subscribe: (cb) => {
       let initial2 = true;
@@ -334,13 +361,13 @@ function createPrimitiveAtom(initial, options) {
   };
 }
 function createDerivedAtom(read, write, options) {
-  const n = dynamicNode(
-    (get) => read((a) => {
+  const n = autoTrackNode(
+    (track) => read((a) => {
       const dn = a._node;
-      if (dn.status === "disconnected") {
+      if (dn.status === "sentinel") {
         pull(dn);
       }
-      return get(dn);
+      return track(dn);
     }),
     {
       ...options,
@@ -350,10 +377,10 @@ function createDerivedAtom(read, write, options) {
   );
   const result = {
     get: () => {
-      if (n.status === "disconnected") {
+      if (n.status === "sentinel") {
         return pull(n);
       }
-      return n.get();
+      return n.cache;
     },
     subscribe: (cb) => {
       let initial = true;
@@ -378,7 +405,7 @@ function createDerivedAtom(read, write, options) {
     const writable = result;
     writable.set = (value) => write(getFn, setFn, value);
     writable.update = (fn) => {
-      const current = n.status === "disconnected" ? pull(n) : n.get();
+      const current = n.status === "sentinel" ? pull(n) : n.cache;
       return write(getFn, setFn, fn(current));
     };
     return writable;
@@ -451,7 +478,7 @@ function createStore(node2, extra = {}) {
   return store;
 }
 function pull2(n) {
-  let val = n.get();
+  let val = n.cache;
   let err;
   const unsub = n.subscribe((msgs) => {
     for (const [t, v] of msgs) {
@@ -464,10 +491,10 @@ function pull2(n) {
   return val;
 }
 function getVal(n) {
-  if (n.status === "disconnected") {
+  if (n.status === "sentinel") {
     return pull2(n);
   }
-  return n.get();
+  return n.cache;
 }
 function atom2(initial) {
   const n = state(initial, {
@@ -475,19 +502,26 @@ function atom2(initial) {
     resetOnTeardown: true
   });
   return createStore(n, {
-    set: (value) => n.down([[DATA, value]])
+    // `n.emit` routes through the framed pipeline: `bundle()` auto-
+    // prefixes `[DIRTY]` (diamond-safe wave coordination) and the
+    // node's `equals` (default `Object.is`) folds same-value writes
+    // into `RESOLVED`. Matches nanostores' documented Object.is
+    // dedup semantics without any custom check.
+    set: (value) => n.emit(value)
   });
 }
 function computed(stores, fn) {
   const storeArray = Array.isArray(stores) ? stores : [stores];
+  const depNodes = storeArray.map((s) => s._node);
   const n = dynamicNode(
-    (get) => {
+    depNodes,
+    (track) => {
       const vals = storeArray.map((s) => {
         const node2 = s._node;
-        if (node2.status === "disconnected") {
+        if (node2.status === "sentinel") {
           pull2(node2);
         }
-        return get(node2);
+        return track(node2);
       });
       return fn(...vals);
     },
@@ -506,10 +540,14 @@ function map2(initial) {
     equals: () => false
   });
   return createStore(n, {
-    set: (value) => n.down([[DATA, value]]),
+    // `map`'s state node is configured with `equals: () => false`
+    // above, so every `emit` produces DATA (even for same-key same-
+    // value sets). The `emit` path is still required for diamond
+    // coordination (`[DIRTY]` auto-prefix via `bundle()`).
+    set: (value) => n.emit(value),
     setKey: (key, value) => {
       const current = getVal(n);
-      n.down([[DATA, { ...current, [key]: value }]]);
+      n.emit({ ...current, [key]: value });
     }
   });
 }
@@ -570,8 +608,8 @@ function useSubscribe(node2) {
         unsub();
       };
     },
-    () => node2.get(),
-    () => node2.get()
+    () => node2.cache,
+    () => node2.cache
     // Server snapshot
   );
 }
@@ -591,12 +629,12 @@ function useSubscribeRecord(keysNode, factory) {
   const store = useMemo(() => {
     const computeSnap = () => {
       const snap = {};
-      const keys = keysNode.get() ?? [];
+      const keys = keysNode.cache ?? [];
       for (const key of keys) {
         const nodes = factoryRef.current(key);
         const values = {};
         for (const field of Object.keys(nodes)) {
-          values[field] = nodes[field].get();
+          values[field] = nodes[field].cache;
         }
         snap[key] = values;
       }
@@ -627,10 +665,10 @@ function useSubscribeRecord(keysNode, factory) {
           if (!disposed) onStoreChange();
         };
         const keysUnsub = keysNode.subscribe((msgs) => {
-          const hasSettled = msgs.some((m) => messageTier(m[0]) >= 3);
-          if (!disposed && hasSettled) sync(keysNode.get() ?? []);
+          const hasSettled = msgs.some((m) => m[0] === DATA || m[0] === RESOLVED);
+          if (!disposed && hasSettled) sync(keysNode.cache ?? []);
         });
-        sync(keysNode.get() ?? []);
+        sync(keysNode.cache ?? []);
         return () => {
           disposed = true;
           keysUnsub();
@@ -650,7 +688,7 @@ __export(signals_exports, {
 });
 var trackingStack = [];
 function pull3(n) {
-  let val = n.get();
+  let val = n.cache;
   const unsub = n.subscribe((msgs) => {
     for (const [t, v] of msgs) {
       if (t === DATA) val = v;
@@ -674,15 +712,15 @@ var SignalState = class {
   get() {
     const tracker = trackingStack[trackingStack.length - 1];
     if (tracker) {
-      if (this._node.status === "disconnected") {
+      if (this._node.status === "sentinel") {
         pull3(this._node);
       }
       return tracker(this._node);
     }
-    if (this._node.status === "disconnected") {
+    if (this._node.status === "sentinel") {
       return pull3(this._node);
     }
-    return this._node.get();
+    return this._node.cache;
   }
   set(value) {
     if (this._equals(this.get(), value)) return;
@@ -695,9 +733,9 @@ var SignalComputed = class {
   /** @internal */
   _node;
   constructor(computation, opts) {
-    this._node = dynamicNode(
-      (get) => {
-        trackingStack.push(get);
+    this._node = autoTrackNode(
+      (track) => {
+        trackingStack.push(track);
         try {
           return computation();
         } finally {
@@ -715,15 +753,15 @@ var SignalComputed = class {
   get() {
     const tracker = trackingStack[trackingStack.length - 1];
     if (tracker) {
-      if (this._node.status === "disconnected") {
+      if (this._node.status === "sentinel") {
         pull3(this._node);
       }
       return tracker(this._node);
     }
-    if (this._node.status === "disconnected") {
+    if (this._node.status === "sentinel") {
       return pull3(this._node);
     }
-    return this._node.get();
+    return this._node.cache;
   }
 };
 var Signal = {
@@ -767,9 +805,9 @@ __export(solid_exports, {
 });
 import { createSignal, getOwner, onCleanup } from "solid-js";
 function useSubscribe2(node2) {
-  const [value, setValue] = createSignal(node2.get(), { equals: false });
+  const [value, setValue] = createSignal(node2.cache, { equals: false });
   const unsub = node2.subscribe(() => {
-    setValue(() => node2.get());
+    setValue(() => node2.cache);
   });
   if (getOwner()) {
     onCleanup(() => unsub());
@@ -796,11 +834,11 @@ function useSubscribeRecord2(keysNode, factory) {
   };
   const buildSnapshot = () => {
     const snap = {};
-    for (const key of keysNode.get() ?? []) {
+    for (const key of keysNode.cache ?? []) {
       const nodes = factory(key);
       const values = {};
       for (const field of Object.keys(nodes)) {
-        values[field] = nodes[field].get();
+        values[field] = nodes[field].cache;
       }
       snap[key] = values;
     }
@@ -820,11 +858,11 @@ function useSubscribeRecord2(keysNode, factory) {
     setValue(() => buildSnapshot());
   };
   const keysUnsub = keysNode.subscribe((msgs) => {
-    if (msgs.some((m) => messageTier(m[0]) >= 3)) {
-      sync(keysNode.get() ?? []);
+    if (msgs.some((m) => m[0] === DATA || m[0] === RESOLVED)) {
+      sync(keysNode.cache ?? []);
     }
   });
-  sync(keysNode.get() ?? []);
+  sync(keysNode.cache ?? []);
   if (getOwner()) {
     onCleanup(() => {
       keysUnsub();
@@ -849,9 +887,9 @@ function useSubscribe3(node2) {
   return {
     subscribe(run) {
       const unsub = node2.subscribe(() => {
-        run(node2.get());
+        run(node2.cache);
       });
-      run(node2.get());
+      run(node2.cache);
       return unsub;
     }
   };
@@ -860,16 +898,16 @@ function useStore3(node2) {
   return {
     subscribe(run) {
       const unsub = node2.subscribe(() => {
-        run(node2.get());
+        run(node2.cache);
       });
-      run(node2.get());
+      run(node2.cache);
       return unsub;
     },
     set(value) {
       node2.down([[DIRTY], [DATA, value]]);
     },
     update(updater) {
-      const next = updater(node2.get());
+      const next = updater(node2.cache);
       node2.down([[DIRTY], [DATA, next]]);
     }
   };
@@ -884,11 +922,11 @@ function useSubscribeRecord3(keysNode, factory) {
       };
       const buildSnapshot = () => {
         const snap = {};
-        for (const key of keysNode.get() ?? []) {
+        for (const key of keysNode.cache ?? []) {
           const nodes = factory(key);
           const values = {};
           for (const field of Object.keys(nodes)) {
-            values[field] = nodes[field].get();
+            values[field] = nodes[field].cache;
           }
           snap[key] = values;
         }
@@ -908,11 +946,11 @@ function useSubscribeRecord3(keysNode, factory) {
         run(buildSnapshot());
       };
       const keysUnsub = keysNode.subscribe((msgs) => {
-        if (msgs.some((m) => messageTier(m[0]) >= 3)) {
-          sync(keysNode.get() ?? []);
+        if (msgs.some((m) => m[0] === DATA || m[0] === RESOLVED)) {
+          sync(keysNode.cache ?? []);
         }
       });
-      sync(keysNode.get() ?? []);
+      sync(keysNode.cache ?? []);
       return () => {
         keysUnsub();
         cleanupEntries();
@@ -938,9 +976,9 @@ import {
   watch
 } from "vue";
 function useSubscribe4(node2) {
-  const ref = shallowRef(node2.get());
+  const ref = shallowRef(node2.cache);
   const unsub = node2.subscribe(() => {
-    ref.value = node2.get();
+    ref.value = node2.cache;
   });
   if (getCurrentScope()) {
     onScopeDispose(() => unsub());
@@ -952,9 +990,9 @@ function useSubscribe4(node2) {
   return readonly(ref);
 }
 function useStore4(node2) {
-  const inner = shallowRef(node2.get());
+  const inner = shallowRef(node2.cache);
   const unsub = node2.subscribe(() => {
-    inner.value = node2.get();
+    inner.value = node2.cache;
   });
   if (getCurrentScope()) {
     onScopeDispose(() => unsub());
@@ -1000,9 +1038,9 @@ function useSubscribeRecord4(keys, factory) {
       const subs = [];
       for (const field of fields) {
         const node2 = nodes[field];
-        values[field] = node2.get();
+        values[field] = node2.cache;
         const unsub = node2.subscribe(() => {
-          values[field] = node2.get();
+          values[field] = node2.cache;
           scheduleBatch();
         });
         subs.push(unsub);
@@ -1041,16 +1079,20 @@ var zustand_exports = {};
 __export(zustand_exports, {
   create: () => create
 });
+var alwaysDiffer = () => false;
 function create(initializer) {
   const g = new Graph("zustand");
-  const s = state(void 0, { name: "state" });
+  const s = state(void 0, {
+    name: "state",
+    equals: alwaysDiffer
+  });
   g.add("state", s);
-  const getState = () => s.get();
+  const getState = () => s.cache;
   const setState = (partial, replace) => {
     const prev = getState();
     const next = typeof partial === "function" ? partial(prev) : partial;
     const nextState = replace ? next : { ...prev, ...next };
-    s.down([[DATA, nextState]]);
+    s.emit(nextState);
   };
   const api = {
     getState,
@@ -1075,7 +1117,7 @@ function create(initializer) {
     destroy: g.destroy.bind(g)
   };
   const initialValue = initializer(setState, getState, api);
-  s.down([[DATA, initialValue]]);
+  s.emit(initialValue);
   return Object.assign(g, api);
 }
 
@@ -1105,6 +1147,7 @@ __export(ai_exports, {
   agentLoop: () => agentLoop,
   agentMemory: () => agentMemory,
   chatStream: () => chatStream,
+  contentGate: () => contentGate,
   costMeterExtractor: () => costMeterExtractor,
   fromLLM: () => fromLLM,
   gatedStream: () => gatedStream,
@@ -1115,6 +1158,7 @@ __export(ai_exports, {
   llmConsolidator: () => llmConsolidator,
   llmExtractor: () => llmExtractor,
   promptNode: () => promptNode,
+  redactor: () => redactor,
   streamExtractor: () => streamExtractor,
   streamingPromptNode: () => streamingPromptNode,
   suggestStrategy: () => suggestStrategy,
@@ -1149,10 +1193,10 @@ function copyMap(m) {
   return new Map(m);
 }
 function readMap(node2) {
-  return node2.get() ?? /* @__PURE__ */ new Map();
+  return node2.cache ?? /* @__PURE__ */ new Map();
 }
 function readArray(node2) {
-  return node2.get() ?? [];
+  return node2.cache ?? [];
 }
 function cosineSimilarity(a, b) {
   const n = Math.max(a.length, b.length);
@@ -1282,8 +1326,6 @@ function collection(name, opts = {}) {
   graph.add("items", items);
   graph.add("ranked", ranked);
   graph.add("size", size);
-  graph.connect("items", "ranked");
-  graph.connect("items", "size");
   function effective(entry, now) {
     const ageSeconds = (now - entry.lastAccessNs) / 1e9;
     return decay(entry.baseScore, ageSeconds, decayRate, minScore);
@@ -1441,7 +1483,6 @@ function knowledgeGraph(name) {
   graph.add("entities", entities);
   graph.add("edges", edges);
   graph.add("adjacency", adjacency);
-  graph.connect("edges", "adjacency");
   function commitEntities(next) {
     entities.down([[DATA, next]]);
   }
@@ -1505,11 +1546,13 @@ var messaging_exports = {};
 __export(messaging_exports, {
   JobFlowGraph: () => JobFlowGraph,
   JobQueueGraph: () => JobQueueGraph,
+  MessagingHubGraph: () => MessagingHubGraph,
   SubscriptionGraph: () => SubscriptionGraph,
   TopicBridgeGraph: () => TopicBridgeGraph,
   TopicGraph: () => TopicGraph,
   jobFlow: () => jobFlow,
   jobQueue: () => jobQueue,
+  messagingHub: () => messagingHub,
   subscription: () => subscription,
   topic: () => topic,
   topicBridge: () => topicBridge
@@ -1527,7 +1570,24 @@ function messagingMeta(kind, extra) {
 var TopicGraph = class extends Graph {
   _log;
   events;
+  /**
+   * Most recently published value, or `null` when the topic has no entries
+   * yet. Spec §5.12 reserves `undefined` as the protocol-internal "never
+   * sent DATA" sentinel — `null` is the idiomatic "empty / no value" signal
+   * for domain nodes. F7.
+   *
+   * **Caveat when `T` itself includes `null`** (e.g., `topic<number | null>`):
+   * `latest === null` is ambiguous — it could mean "no publish yet" OR "a
+   * `null` value was published". Use {@link hasLatest} to disambiguate, or
+   * observe {@link events} directly and track length yourself.
+   */
   latest;
+  /**
+   * Reactive `true` once the topic has at least one published entry.
+   * Disambiguates "`null` never published" from "`null` was published" when
+   * `T` includes `null`.
+   */
+  hasLatest;
   constructor(name, opts = {}) {
     super(name, opts.graph);
     this._log = reactiveLog([], { name: "events", maxSize: opts.retainedLimit });
@@ -1537,40 +1597,62 @@ var TopicGraph = class extends Graph {
       [this.events],
       ([snapshot]) => {
         const entries = snapshot;
-        return entries.length === 0 ? void 0 : entries[entries.length - 1];
+        return entries.length === 0 ? null : entries[entries.length - 1];
       },
       {
         name: "latest",
         describeKind: "derived",
-        meta: messagingMeta("topic_latest"),
-        initial: void 0
+        meta: messagingMeta("topic_latest")
       }
     );
     this.add("latest", this.latest);
-    this.connect("events", "latest");
     this.addDisposer(keepalive(this.latest));
+    this.hasLatest = derived(
+      [this.events],
+      ([snapshot]) => snapshot.length > 0,
+      {
+        name: "hasLatest",
+        describeKind: "derived",
+        meta: messagingMeta("topic_has_latest")
+      }
+    );
+    this.add("hasLatest", this.hasLatest);
+    this.addDisposer(keepalive(this.hasLatest));
+    this.addDisposer(() => {
+      this.events.down([[COMPLETE]]);
+    });
+    this.addDisposer(() => this._log.disposeAllViews());
   }
   publish(value) {
     this._log.append(value);
   }
   retained() {
-    return this.events.get();
+    return this.events.cache;
   }
 };
 var SubscriptionGraph = class extends Graph {
   source;
   cursor;
   available;
+  /**
+   * Reference to the upstream topic graph. Intentionally NOT mounted
+   * under this subscription: a subscription is a VIEW over an
+   * externally-owned topic. Double-mounting (e.g. hub-owned topic +
+   * sub-mount here) would make either-side teardown leave the other
+   * holding a dead reference. Node-level `derived([topicEvents], …)`
+   * still wires the data dependency across graph boundaries. D1(e).
+   */
+  topic;
   constructor(name, topicGraph, opts = {}) {
     super(name, opts.graph);
     const initialCursor = requireNonNegativeInt(opts.cursor ?? 0, "subscription cursor");
-    this.mount("topic", topicGraph);
+    this.topic = topicGraph;
     const topicEvents = topicGraph.events;
     this.source = derived([topicEvents], ([snapshot]) => snapshot, {
       name: "source",
       describeKind: "derived",
       meta: messagingMeta("subscription_source"),
-      initial: topicEvents.get()
+      initial: topicEvents.cache
     });
     this.add("source", this.source);
     this.cursor = state(initialCursor, {
@@ -1594,23 +1676,20 @@ var SubscriptionGraph = class extends Graph {
       }
     );
     this.add("available", this.available);
-    this.connect("topic::events", "source");
-    this.connect("source", "available");
-    this.connect("cursor", "available");
     this.addDisposer(keepalive(this.source));
     this.addDisposer(keepalive(this.available));
   }
   ack(count) {
-    const available = this.available.get();
+    const available = this.available.cache;
     const requested = count === void 0 ? available.length : requireNonNegativeInt(count, "subscription ack count");
     const step = Math.min(requested, available.length);
-    if (step <= 0) return this.cursor.get();
-    const next = this.cursor.get() + step;
-    this.cursor.down([[DATA, next]]);
+    if (step <= 0) return this.cursor.cache;
+    const next = this.cursor.cache + step;
+    this.cursor.emit(next);
     return next;
   }
   pull(limit, opts = {}) {
-    const available = this.available.get();
+    const available = this.available.cache;
     const max = limit === void 0 ? available.length : requireNonNegativeInt(limit, "subscription pull limit");
     const out = available.slice(0, max);
     if (opts.ack && out.length > 0) this.ack(out.length);
@@ -1639,7 +1718,6 @@ var JobQueueGraph = class extends Graph {
       initial: 0
     });
     this.add("depth", this.depth);
-    this.connect("pending", "depth");
     this.addDisposer(keepalive(this.depth));
   }
   enqueue(payload, opts = {}) {
@@ -1663,7 +1741,7 @@ var JobQueueGraph = class extends Graph {
     if (max === 0) return [];
     const out = [];
     while (out.length < max) {
-      const ids = this.pending.get();
+      const ids = this.pending.cache;
       if (ids.length === 0) break;
       const id = this._pending.pop(0);
       const job = this._jobs.get(id);
@@ -1732,7 +1810,6 @@ var JobFlowGraph = class extends Graph {
       }
     );
     this.add("completedCount", this.completedCount);
-    this.connect("completed", "completedCount");
     this.addDisposer(keepalive(this.completedCount));
     const maxPerPump = Math.max(
       1,
@@ -1772,7 +1849,6 @@ var JobFlowGraph = class extends Graph {
         }
       );
       this.add(`pump_${stage}`, pump);
-      this.connect(`${stage}::pending`, `pump_${stage}`);
       this.addDisposer(keepalive(pump));
     }
   }
@@ -1788,7 +1864,7 @@ var JobFlowGraph = class extends Graph {
     return this.queue(this._stageNames[0]).enqueue(payload, opts);
   }
   retainedCompleted() {
-    return this.completed.get();
+    return this.completed.cache;
   }
 };
 var TopicBridgeGraph = class extends Graph {
@@ -1826,7 +1902,7 @@ var TopicBridgeGraph = class extends Graph {
           bridged += 1;
         }
         if (bridged > 0) {
-          const current = this.bridgedCount.get();
+          const current = this.bridgedCount.cache;
           this.bridgedCount.down([[DATA, current + bridged]]);
         }
       },
@@ -1837,13 +1913,112 @@ var TopicBridgeGraph = class extends Graph {
       }
     );
     this.add("pump", pump);
-    this.connect("subscription::available", "pump");
     this.addDisposer(keepalive(pump));
   }
 };
+var MessagingHubGraph = class extends Graph {
+  _topics = /* @__PURE__ */ new Map();
+  _version = 0;
+  _defaultTopicOptions;
+  constructor(name, opts = {}) {
+    super(name, opts.graph);
+    this._defaultTopicOptions = { ...opts.defaultTopicOptions ?? {} };
+  }
+  /** Monotonic counter advancing on topic create/remove. */
+  get version() {
+    return this._version;
+  }
+  /** Number of topics currently in the hub. */
+  get size() {
+    return this._topics.size;
+  }
+  /** Checks topic existence without creating. */
+  has(name) {
+    return this._topics.has(name);
+  }
+  /** Iterator over topic names. */
+  topicNames() {
+    return this._topics.keys();
+  }
+  /**
+   * Returns the {@link TopicGraph} for `name`, creating lazily on first call.
+   * Subsequent calls with the same name return the same instance (options on
+   * repeat calls are ignored — the topic is already configured).
+   */
+  topic(name, opts) {
+    let t = this._topics.get(name);
+    if (t === void 0) {
+      const effective = { ...this._defaultTopicOptions, ...opts ?? {} };
+      t = new TopicGraph(name, effective);
+      this._topics.set(name, t);
+      this.mount(name, t);
+      this._version += 1;
+    }
+    return t;
+  }
+  /**
+   * Publishes a value to the topic, lazily creating it on first publish.
+   *
+   * **Late-subscriber caveat:** the topic is created lazily, so subscribers
+   * that attach AFTER a publish only see the retained window (governed by
+   * `retainedLimit` on `TopicOptions` / `defaultTopicOptions`). If
+   * `retainedLimit === 0` is set explicitly, early publishes are
+   * effectively dropped — prefer an unset `retainedLimit` (unbounded
+   * retention) or subscribe before publishing when late-subscribers matter.
+   */
+  publish(name, value) {
+    this.topic(name).publish(value);
+  }
+  /**
+   * Bulk publish — issues all publishes inside one outer batch. New topics
+   * are created on demand. No-op if `entries` yields nothing.
+   *
+   * **Iterable consumption (F6):** `entries` is consumed once (single-pass)
+   * INSIDE the batch frame. If the iterator throws mid-way, the batch is
+   * discarded and NO publishes are visible to subscribers (all-or-nothing).
+   * Pass an array or `Set` for multi-shot callers.
+   */
+  publishMany(entries) {
+    batch(() => {
+      for (const [name, value] of entries) {
+        this.topic(name).publish(value);
+      }
+    });
+  }
+  /**
+   * Creates a {@link SubscriptionGraph} over a named topic. The topic is
+   * lazily created if missing. Subscription lifecycle is owned by the caller —
+   * the hub does NOT mount the subscription.
+   *
+   * @param subName - Local name for the subscription graph.
+   * @param topicName - Hub topic to subscribe to.
+   * @param opts - `SubscriptionOptions` (initial cursor, etc.).
+   */
+  subscribe(subName, topicName, opts) {
+    const t = this.topic(topicName);
+    return new SubscriptionGraph(subName, t, opts);
+  }
+  /**
+   * Unmounts and tears down the topic's graph. Returns `true` if the topic
+   * existed. Subscribers receive `TEARDOWN` via {@link Graph.remove}.
+   */
+  removeTopic(name) {
+    if (!this._topics.has(name)) return false;
+    try {
+      this.remove(name);
+    } finally {
+      this._topics.delete(name);
+      this._version += 1;
+    }
+    return true;
+  }
+};
 function topic(name, opts) {
   return new TopicGraph(name, opts);
 }
+function messagingHub(name, opts) {
+  return new MessagingHubGraph(name, opts);
+}
 function subscription(name, topicGraph, opts) {
   return new SubscriptionGraph(name, topicGraph, opts);
 }
@@ -1900,9 +2075,7 @@ function findRegisteredNodePath(graph, target) {
 }
 function registerStep(graph, name, step, depPaths) {
   graph.add(name, step);
-  for (const path of depPaths) {
-    graph.connect(path, name);
-  }
+  void depPaths;
 }
 function baseMeta(kind, meta) {
   return domainMeta("orchestration", kind, meta);
@@ -1931,9 +2104,16 @@ function task(graph, name, run, opts) {
   const depRefs = opts?.deps ?? [];
   const deps = depRefs.map((dep) => resolveDep(graph, dep));
   const { deps: _deps, ...nodeOpts } = opts ?? {};
+  const wrapped = (batchData, actions, ctx) => {
+    const data = batchData.map(
+      (batch2, i) => batch2 != null && batch2.length > 0 ? batch2.at(-1) : ctx.prevData[i]
+    );
+    actions.emit(run(data, ctx));
+    return void 0;
+  };
   const step = node(
     deps.map((d) => d.node),
-    run,
+    wrapped,
     {
       ...nodeOpts,
       name,
@@ -1951,7 +2131,7 @@ function task(graph, name, run, opts) {
 }
 function branch(graph, name, source, predicate, opts) {
   const src = resolveDep(graph, source);
-  const step = node(
+  const step = derived(
     [src.node],
     ([value]) => ({
       branch: predicate(value) ? "then" : "else",
@@ -1960,7 +2140,6 @@ function branch(graph, name, source, predicate, opts) {
     {
       ...opts,
       name,
-      describeKind: "derived",
       meta: baseMeta("branch", opts?.meta)
     }
   );
@@ -1972,18 +2151,28 @@ function valve2(graph, name, source, control, opts) {
   const ctrl = resolveDep(graph, control);
   const step = node(
     [src.node, ctrl.node],
-    (_deps, actions) => {
-      const opened = ctrl.node.get();
-      if (!opened) {
+    (batchData, actions, ctx) => {
+      const batch0 = batchData[0];
+      const batch1 = batchData[1];
+      const ctrlVal = batch1 != null && batch1.length > 0 ? batch1.at(-1) : ctx.prevData[1];
+      if (batch0 == null || batch0.length === 0) {
+        if (batch1 != null && batch1.length > 0 && ctrlVal && ctx.prevData[0] !== void 0) {
+          actions.emit(ctx.prevData[0]);
+        } else {
+          actions.down([[RESOLVED]]);
+        }
+        return;
+      }
+      if (!ctrlVal) {
         actions.down([[RESOLVED]]);
-        return void 0;
+        return;
       }
-      return src.node.get();
+      for (const v of batch0) actions.emit(v);
     },
     {
       ...opts,
       name,
-      describeKind: "operator",
+      describeKind: "derived",
       meta: baseMeta("valve", opts?.meta)
     }
   );
@@ -2001,17 +2190,28 @@ function approval(graph, name, source, approver, opts) {
   const isApproved = opts?.isApproved ?? ((value) => Boolean(value));
   const step = node(
     [src.node, ctrl.node],
-    (_deps, actions) => {
-      if (!isApproved(ctrl.node.get())) {
+    (batchData, actions, ctx) => {
+      const batch0 = batchData[0];
+      const batch1 = batchData[1];
+      const ctrlVal = batch1 != null && batch1.length > 0 ? batch1.at(-1) : ctx.prevData[1];
+      if (ctrlVal === void 0 || !isApproved(ctrlVal)) {
         actions.down([[RESOLVED]]);
-        return void 0;
+        return;
       }
-      return src.node.get();
+      if (batch0 == null || batch0.length === 0) {
+        if (batch1 != null && batch1.length > 0 && ctx.prevData[0] !== void 0) {
+          actions.emit(ctx.prevData[0]);
+        } else {
+          actions.down([[RESOLVED]]);
+        }
+        return;
+      }
+      for (const v of batch0) actions.emit(v);
     },
     {
       ...opts,
       name,
-      describeKind: "operator",
+      describeKind: "derived",
       meta: baseMeta("approval", opts?.meta)
     }
   );
@@ -2032,12 +2232,17 @@ function gate(graph, name, source, opts) {
   const src = resolveDep(graph, source);
   const pendingNode = state([], { name: "pending", equals: () => false });
   const isOpenNode = state(startOpen, { name: "isOpen" });
-  const countNode = node([pendingNode], ([arr]) => arr.length, {
-    name: "count",
-    describeKind: "derived"
+  const countNode = derived([pendingNode], ([arr]) => arr.length, {
+    name: "count"
   });
   let queue = [];
   let torn = false;
+  let latestIsOpen = startOpen;
+  const isOpenUnsub = isOpenNode.subscribe((msgs) => {
+    for (const m of msgs) {
+      if (m[0] === DATA) latestIsOpen = m[1];
+    }
+  });
   function syncPending() {
     pendingNode.down([[DATA, [...queue]]]);
   }
@@ -2054,38 +2259,37 @@ function gate(graph, name, source, opts) {
   function guardTorn(method) {
     if (torn) throw new Error(`gate: ${method}() called after gate was torn down`);
   }
-  const output = node([src.node], () => void 0, {
-    name,
-    describeKind: "operator",
-    meta: baseMeta("gate", opts?.meta),
-    onMessage(msg, _depIndex, actions) {
-      if (msg[0] === DATA) {
-        if (isOpenNode.get()) {
-          actions.emit(msg[1]);
-        } else {
-          enqueue(msg[1]);
-          actions.down([[RESOLVED]]);
-        }
-        return true;
-      }
-      if (msg[0] === TEARDOWN) {
+  const output = node(
+    [src.node],
+    (batchData, actions, ctx) => {
+      const terminal = ctx.terminalDeps[0];
+      if (terminal !== void 0) {
         torn = true;
         queue = [];
         syncPending();
-        actions.down([msg]);
-        return true;
+        actions.down(terminal === true ? [[COMPLETE]] : [[ERROR, terminal]]);
+        return;
       }
-      if (msg[0] === COMPLETE || msg[0] === ERROR) {
-        torn = true;
-        queue = [];
-        syncPending();
-        actions.down([msg]);
-        return true;
+      const batch0 = batchData[0];
+      if (batch0 == null || batch0.length === 0) {
+        actions.down([[RESOLVED]]);
+        return;
       }
-      actions.down([msg]);
-      return true;
+      for (const v of batch0) {
+        if (latestIsOpen) {
+          actions.emit(v);
+        } else {
+          enqueue(v);
+          actions.down([[RESOLVED]]);
+        }
+      }
+    },
+    {
+      name,
+      describeKind: "derived",
+      meta: baseMeta("gate", opts?.meta)
     }
-  });
+  );
   const controller = {
     node: output,
     pending: pendingNode,
@@ -2114,12 +2318,14 @@ function gate(graph, name, source, opts) {
     },
     open() {
       guardTorn("open");
-      isOpenNode.down([[DATA, true]]);
-      const items = dequeue(queue.length);
-      for (const item of items) {
-        if (torn) break;
-        output.down([[DATA, item]]);
-      }
+      batch(() => {
+        isOpenNode.down([[DATA, true]]);
+        const items = dequeue(queue.length);
+        for (const item of items) {
+          if (torn) break;
+          output.down([[DATA, item]]);
+        }
+      });
     },
     close() {
       guardTorn("close");
@@ -2127,58 +2333,65 @@ function gate(graph, name, source, opts) {
     }
   };
   graph.addDisposer(countNode.subscribe(() => void 0));
+  graph.addDisposer(isOpenUnsub);
   registerStep(graph, name, output, src.path ? [src.path] : []);
   const internal = new Graph(`${name}_state`);
   internal.add("pending", pendingNode);
   internal.add("isOpen", isOpenNode);
   internal.add("count", countNode);
-  internal.connect("pending", "count");
   graph.mount(`${name}_state`, internal);
   return controller;
 }
 function forEach2(graph, name, source, run, opts) {
   const src = resolveDep(graph, source);
   let terminated = false;
-  const step = node([src.node], () => void 0, {
-    ...opts,
-    name,
-    describeKind: "effect",
-    completeWhenDepsComplete: false,
-    meta: baseMeta("forEach", opts?.meta),
-    onMessage(msg, depIndex, actions) {
-      if (terminated) return true;
-      if (depIndex !== 0) {
-        actions.down([msg]);
-        if (msg[0] === COMPLETE || msg[0] === ERROR) terminated = true;
-        return true;
+  const step = node(
+    [src.node],
+    (batchData, actions, ctx) => {
+      if (terminated) {
+        actions.down([[RESOLVED]]);
+        return;
+      }
+      const terminal = ctx.terminalDeps[0];
+      if (terminal !== void 0) {
+        terminated = true;
+        actions.down(terminal === true ? [[COMPLETE]] : [[ERROR, terminal]]);
+        return;
       }
-      if (msg[0] === DATA) {
+      const batch0 = batchData[0];
+      if (batch0 == null || batch0.length === 0) {
+        actions.down([[RESOLVED]]);
+        return;
+      }
+      for (const v of batch0) {
         try {
-          run(msg[1], actions);
-          actions.down([msg]);
+          run(v, actions);
         } catch (err) {
           terminated = true;
           actions.down([[ERROR, err]]);
+          return;
         }
-        return true;
       }
-      actions.down([msg]);
-      if (msg[0] === COMPLETE || msg[0] === ERROR) terminated = true;
-      return true;
+    },
+    {
+      ...opts,
+      name,
+      describeKind: "effect",
+      completeWhenDepsComplete: false,
+      meta: baseMeta("forEach", opts?.meta)
     }
-  });
+  );
   registerStep(graph, name, step, src.path ? [src.path] : []);
   return step;
 }
 function join(graph, name, deps, opts) {
   const resolved = deps.map((dep) => resolveDep(graph, dep));
-  const step = node(
+  const step = derived(
     resolved.map((d) => d.node),
     (values) => values,
     {
       ...opts,
       name,
-      describeKind: "derived",
       meta: baseMeta("join", opts?.meta)
     }
   );
@@ -2197,14 +2410,16 @@ function loop(graph, name, source, iterate, opts) {
   const staticIterations = typeof iterRef === "number" ? iterRef : void 0;
   const step = node(
     iterDep ? [src.node, iterDep.node] : [src.node],
-    (_deps, actions) => {
-      let current = src.node.get();
-      const rawCount = staticIterations ?? iterDep?.node.get() ?? 1;
+    (depValues, actions, ctx) => {
+      const batch0 = depValues[0];
+      let current = batch0 != null && batch0.length > 0 ? batch0.at(-1) : ctx.prevData[0];
+      const batch1 = iterDep ? depValues[1] : void 0;
+      const rawCount = staticIterations ?? (iterDep ? batch1 != null && batch1.length > 0 ? batch1.at(-1) : ctx.prevData[1] : 1);
       const count = coerceLoopIterations(rawCount);
       for (let i = 0; i < count; i += 1) {
         current = iterate(current, i, actions);
       }
-      return current;
+      actions.emit(current);
     },
     {
       ...opts,
@@ -2260,7 +2475,7 @@ function wait(graph, name, source, ms, opts) {
     for (const id of timers) clearTimeout(id);
     timers.clear();
   }
-  const srcVal = src.node.get();
+  const srcVal = src.node.cache;
   const initialOpt = srcVal !== void 0 ? { initial: srcVal } : {};
   const step = node(
     [],
@@ -2305,46 +2520,50 @@ function wait(graph, name, source, ms, opts) {
       ...opts,
       name,
       ...initialOpt,
-      describeKind: "operator",
+      describeKind: "derived",
       completeWhenDepsComplete: false,
       meta: baseMeta("wait", opts?.meta)
     }
   );
   graph.add(name, step);
-  if (src.path) {
-    try {
-      graph.connect(src.path, name);
-    } catch (e) {
-      if (!(e instanceof Error && /dep|edge|connect/i.test(e.message))) throw e;
-    }
-  }
   return step;
 }
 function onFailure(graph, name, source, recover, opts) {
   const src = resolveDep(graph, source);
   let terminated = false;
-  const step = node([src.node], () => void 0, {
-    ...opts,
-    name,
-    describeKind: "operator",
-    completeWhenDepsComplete: false,
-    meta: baseMeta("onFailure", opts?.meta),
-    onMessage(msg, _depIndex, actions) {
-      if (terminated) return true;
-      if (msg[0] === ERROR) {
-        try {
-          actions.emit(recover(msg[1], actions));
-        } catch (err) {
-          terminated = true;
-          actions.down([[ERROR, err]]);
+  const step = node(
+    [],
+    (_data, actions) => {
+      const unsub = src.node.subscribe((msgs) => {
+        for (const msg of msgs) {
+          if (terminated) return;
+          if (msg[0] === ERROR) {
+            try {
+              actions.emit(recover(msg[1], actions));
+            } catch (err) {
+              terminated = true;
+              actions.down([[ERROR, err]]);
+            }
+          } else {
+            actions.down([msg]);
+            if (msg[0] === COMPLETE) terminated = true;
+          }
         }
-        return true;
-      }
-      actions.down([msg]);
-      if (msg[0] === COMPLETE) terminated = true;
-      return true;
+      });
+      return () => unsub();
+    },
+    {
+      ...opts,
+      name,
+      describeKind: "derived",
+      completeWhenDepsComplete: false,
+      // onFailure handles errors via manual subscription (recover callback).
+      // Disable auto-propagation so dep-channel ERROR doesn't terminate this
+      // node before the recover callback has a chance to emit a replacement value.
+      errorWhenDepsError: false,
+      meta: baseMeta("onFailure", opts?.meta)
     }
-  });
+  );
   registerStep(graph, name, step, src.path ? [src.path] : []);
   return step;
 }
@@ -2357,7 +2576,7 @@ function isPromiseLike(x) {
   return x != null && typeof x.then === "function";
 }
 function isNodeLike(x) {
-  return typeof x === "object" && x !== null && "subscribe" in x && typeof x.subscribe === "function" && "get" in x && typeof x.get === "function";
+  return typeof x === "object" && x !== null && "subscribe" in x && typeof x.subscribe === "function" && "cache" in x;
 }
 function isAsyncIterableLike(x) {
   return x != null && typeof x === "object" && Symbol.asyncIterator in x && typeof x[Symbol.asyncIterator] === "function";
@@ -2365,7 +2584,7 @@ function isAsyncIterableLike(x) {
 var DEFAULT_TIMEOUT_MS = 3e4;
 function firstDataFromNode(resolved, opts) {
   if (resolved.status === "settled") {
-    const immediate = resolved.get();
+    const immediate = resolved.cache;
     if (immediate !== void 0) {
       return Promise.resolve(immediate);
     }
@@ -2505,43 +2724,94 @@ function streamExtractor(streamTopic, extractFn, opts) {
     {
       name: opts?.name ?? "extractor",
       describeKind: "derived",
-      initial: null
+      initial: null,
+      meta: aiMeta("stream_extractor"),
+      ...opts?.equals ? { equals: opts.equals } : {}
     }
   );
 }
+var keywordFlagsEqual = (a, b) => {
+  if (a === b) return true;
+  if (a == null || b == null) return a === b;
+  if (a.length !== b.length) return false;
+  for (let i = 0; i < a.length; i++) {
+    const x = a[i];
+    const y = b[i];
+    if (x.label !== y.label || x.pattern !== y.pattern || x.match !== y.match || x.position !== y.position) {
+      return false;
+    }
+  }
+  return true;
+};
 function keywordFlagExtractor(streamTopic, opts) {
+  const maxPatternLength = opts.maxPatternLength ?? 128;
   return derived(
     [streamTopic.latest],
-    ([chunk]) => {
+    ([chunk], ctx) => {
       if (chunk == null) return [];
       const accumulated = chunk.accumulated;
-      const flags = [];
+      if (!("flags" in ctx.store)) {
+        ctx.store.flags = [];
+        ctx.store.scannedTo = 0;
+      }
+      const flags = ctx.store.flags;
+      const scannedTo = ctx.store.scannedTo;
+      const startOffset = Math.max(0, scannedTo - maxPatternLength);
+      const region = accumulated.slice(startOffset);
+      let added = false;
       for (const { pattern, label } of opts.patterns) {
         const re = new RegExp(pattern.source, `${pattern.flags.replace("g", "")}g`);
-        for (const m of accumulated.matchAll(re)) {
-          flags.push({ label, pattern, match: m[0], position: m.index });
+        for (const m of region.matchAll(re)) {
+          const pos = startOffset + m.index;
+          if (pos + m[0].length <= scannedTo) continue;
+          flags.push({ label, pattern, match: m[0], position: pos });
+          added = true;
         }
       }
-      return flags;
+      ctx.store.scannedTo = accumulated.length;
+      return added ? [...flags] : flags.slice();
     },
     {
       name: opts.name ?? "keyword-flag-extractor",
       describeKind: "derived",
-      initial: []
+      initial: [],
+      meta: aiMeta("keyword_flag_extractor"),
+      equals: keywordFlagsEqual
     }
   );
 }
+var toolCallsEqual = (a, b) => {
+  if (a === b) return true;
+  if (a == null || b == null) return a === b;
+  if (a.length !== b.length) return false;
+  for (let i = 0; i < a.length; i++) {
+    const x = a[i];
+    const y = b[i];
+    if (x.startIndex !== y.startIndex || x.name !== y.name || x.raw !== y.raw) {
+      return false;
+    }
+  }
+  return true;
+};
 function toolCallExtractor(streamTopic, opts) {
   return derived(
     [streamTopic.latest],
-    ([chunk]) => {
+    ([chunk], ctx) => {
       if (chunk == null) return [];
       const accumulated = chunk.accumulated;
-      const calls = [];
-      let i = 0;
+      if (!("calls" in ctx.store)) {
+        ctx.store.calls = [];
+        ctx.store.scanFrom = 0;
+      }
+      const calls = ctx.store.calls;
+      let i = ctx.store.scanFrom;
+      let added = false;
       while (i < accumulated.length) {
         const start = accumulated.indexOf("{", i);
-        if (start === -1) break;
+        if (start === -1) {
+          ctx.store.scanFrom = accumulated.length;
+          break;
+        }
         let depth = 0;
         let end = -1;
         let inString = false;
@@ -2565,7 +2835,10 @@ function toolCallExtractor(streamTopic, opts) {
             }
           }
         }
-        if (end === -1) break;
+        if (end === -1) {
+          ctx.store.scanFrom = start;
+          break;
+        }
         const raw = accumulated.slice(start, end + 1);
         try {
           const parsed = JSON.parse(raw);
@@ -2576,20 +2849,28 @@ function toolCallExtractor(streamTopic, opts) {
               raw,
               startIndex: start
             });
+            added = true;
           }
         } catch {
         }
         i = end + 1;
+        ctx.store.scanFrom = i;
       }
-      return calls;
+      return added ? [...calls] : calls.slice();
     },
     {
       name: opts?.name ?? "tool-call-extractor",
       describeKind: "derived",
-      initial: []
+      initial: [],
+      meta: aiMeta("tool_call_extractor"),
+      equals: toolCallsEqual
     }
   );
 }
+var costMeterEqual = (a, b) => {
+  if (a === b) return true;
+  return a.chunkCount === b.chunkCount && a.charCount === b.charCount && a.estimatedTokens === b.estimatedTokens;
+};
 function costMeterExtractor(streamTopic, opts) {
   const charsPerToken = opts?.charsPerToken ?? 4;
   return derived(
@@ -2607,8 +2888,57 @@ function costMeterExtractor(streamTopic, opts) {
     {
       name: opts?.name ?? "cost-meter",
       describeKind: "derived",
-      initial: { chunkCount: 0, charCount: 0, estimatedTokens: 0 }
+      initial: { chunkCount: 0, charCount: 0, estimatedTokens: 0 },
+      meta: aiMeta("cost_meter_extractor"),
+      equals: costMeterEqual
+    }
+  );
+}
+function redactor(streamTopic, patterns, replaceFn, opts) {
+  const replace = replaceFn ?? (() => "[REDACTED]");
+  function sanitize(text) {
+    let result = text;
+    for (const pat of patterns) {
+      const global = pat.global ? pat : new RegExp(pat.source, `${pat.flags}g`);
+      result = result.replace(global, (m) => replace(m, pat));
     }
+    return result;
+  }
+  return derived(
+    [streamTopic.latest],
+    ([chunk]) => {
+      if (chunk == null) {
+        return { source: "", token: "", accumulated: "", index: -1 };
+      }
+      const c = chunk;
+      const sanitizedAccumulated = sanitize(c.accumulated);
+      const sanitizedToken = sanitize(c.token);
+      return {
+        source: c.source,
+        token: sanitizedToken,
+        accumulated: sanitizedAccumulated,
+        index: c.index
+      };
+    },
+    { name: opts?.name ?? "redactor" }
+  );
+}
+function contentGate(streamTopic, classifier, threshold, opts) {
+  const hardThreshold = threshold * (opts?.hardMultiplier ?? 1.5);
+  const isNodeClassifier = typeof classifier !== "function";
+  const deps = [streamTopic.latest];
+  if (isNodeClassifier) deps.push(classifier);
+  return derived(
+    deps,
+    (values) => {
+      const chunk = values[0];
+      if (chunk == null) return "allow";
+      const score = isNodeClassifier ? values[1] ?? 0 : classifier(chunk.accumulated);
+      if (score >= hardThreshold) return "block";
+      if (score >= threshold) return "review";
+      return "allow";
+    },
+    { name: opts?.name ?? "content-gate", initial: "allow" }
   );
 }
 function gatedStream(graph, name, adapter, deps, prompt, opts) {
@@ -2712,7 +3042,7 @@ function promptNode(adapter, deps, prompt, opts) {
   const format = opts?.format ?? "text";
   const retries = opts?.retries ?? 0;
   const useCache = opts?.cache ?? false;
-  const cache2 = useCache ? /* @__PURE__ */ new Map() : null;
+  const cache = useCache ? /* @__PURE__ */ new Map() : null;
   const messagesNode = derived(
     deps,
     (values) => {
@@ -2735,8 +3065,8 @@ function promptNode(adapter, deps, prompt, opts) {
       return state(null);
     }
     const cacheKey = useCache ? JSON.stringify(msgs.map((m) => [m.role, m.content])) : "";
-    if (cache2?.has(cacheKey)) {
-      return state(cache2.get(cacheKey));
+    if (cache?.has(cacheKey)) {
+      return state(cache.get(cacheKey));
     }
     async function attempt(remaining) {
       try {
@@ -2749,8 +3079,8 @@ function promptNode(adapter, deps, prompt, opts) {
           });
           if (input && typeof input.then === "function") {
             input.then(resolve, reject);
-          } else if (input && typeof input.get === "function") {
-            resolve(input.get());
+          } else if (input && typeof input.subscribe === "function") {
+            resolve(input.cache);
           } else {
             resolve(input);
           }
@@ -2762,7 +3092,7 @@ function promptNode(adapter, deps, prompt, opts) {
         } else {
           parsed = content;
         }
-        cache2?.set(cacheKey, parsed);
+        cache?.set(cacheKey, parsed);
         return parsed;
       } catch (err) {
         if (remaining > 0) return attempt(remaining - 1);
@@ -2790,17 +3120,15 @@ var ChatStreamGraph = class extends Graph {
       [this.messages],
       ([snapshot]) => {
         const entries = snapshot;
-        return entries.length === 0 ? void 0 : entries[entries.length - 1];
+        return entries.length === 0 ? null : entries[entries.length - 1];
       },
       {
         name: "latest",
         describeKind: "derived",
-        meta: aiMeta("chat_latest"),
-        initial: void 0
+        meta: aiMeta("chat_latest")
       }
     );
     this.add("latest", this.latest);
-    this.connect("messages", "latest");
     this.addDisposer(keepalive(this.latest));
     this.messageCount = derived(
       [this.messages],
@@ -2813,7 +3141,6 @@ var ChatStreamGraph = class extends Graph {
       }
     );
     this.add("messageCount", this.messageCount);
-    this.connect("messages", "messageCount");
     this.addDisposer(keepalive(this.messageCount));
   }
   append(role, content, extra) {
@@ -2826,7 +3153,7 @@ var ChatStreamGraph = class extends Graph {
     this._log.clear();
   }
   allMessages() {
-    return this.messages.get();
+    return this.messages.cache;
   }
 };
 function chatStream(name, opts) {
@@ -2854,31 +3181,30 @@ var ToolRegistryGraph = class extends Graph {
       }
     );
     this.add("schemas", this.schemas);
-    this.connect("definitions", "schemas");
     this.addDisposer(keepalive(this.schemas));
   }
   register(tool) {
-    const current = this.definitions.get();
+    const current = this.definitions.cache;
     const next = new Map(current);
     next.set(tool.name, tool);
     this.definitions.down([[DATA, next]]);
   }
   unregister(name) {
-    const current = this.definitions.get();
+    const current = this.definitions.cache;
     if (!current.has(name)) return;
     const next = new Map(current);
     next.delete(name);
     this.definitions.down([[DATA, next]]);
   }
   async execute(name, args) {
-    const defs = this.definitions.get();
+    const defs = this.definitions.cache;
     const tool = defs.get(name);
     if (!tool) throw new Error(`toolRegistry: unknown tool "${name}"`);
     const raw = tool.handler(args);
     return resolveToolHandlerResult(raw);
   }
   getDefinition(name) {
-    return this.definitions.get().get(name);
+    return this.definitions.cache?.get(name);
   }
 };
 function toolRegistry(name, opts) {
@@ -2913,7 +3239,7 @@ function llmExtractor(systemPrompt, opts) {
         })
       }
     ];
-    return producer((_deps, actions) => {
+    return producer((actions) => {
       let active = true;
       const result = opts.adapter.invoke(messages, {
         model: opts.model,
@@ -2963,7 +3289,7 @@ function llmConsolidator(systemPrompt, opts) {
       { role: "system", content: systemPrompt },
       { role: "user", content: JSON.stringify({ memories: entriesArray }) }
     ];
-    return producer((_deps, actions) => {
+    return producer((actions) => {
       let active = true;
       const result = opts.adapter.invoke(messages, {
         model: opts.model,
@@ -3078,8 +3404,6 @@ function agentMemory(name, source, opts) {
   graph.add("store", distillBundle.store.entries);
   graph.add("compact", distillBundle.compact);
   graph.add("size", distillBundle.size);
-  graph.connect("store", "compact");
-  graph.connect("store", "size");
   let vectors = null;
   if (opts.vectorDimensions && opts.vectorDimensions > 0 && opts.embedFn) {
     vectors = vectorIndex({ dimension: opts.vectorDimensions });
@@ -3102,7 +3426,7 @@ function agentMemory(name, source, opts) {
     const permanentKeys = /* @__PURE__ */ new Set();
     const tierOf = (key) => {
       if (permanentKeys.has(key)) return "permanent";
-      const storeMap = extractStoreMap(distillBundle.store.entries.get());
+      const storeMap = extractStoreMap(distillBundle.store.entries.cache);
       if (storeMap.has(key)) return "active";
       return "archived";
     };
@@ -3161,10 +3485,10 @@ function agentMemory(name, source, opts) {
     });
     keepaliveSubs.push(tierClassifier.subscribe(() => void 0));
     let archiveHandle = null;
-    if (tiersOpts.archiveAdapter) {
-      archiveHandle = graph.autoCheckpoint(
-        tiersOpts.archiveAdapter,
-        tiersOpts.archiveCheckpointOptions
+    if (tiersOpts.archiveTier) {
+      archiveHandle = graph.attachStorage(
+        [tiersOpts.archiveTier],
+        tiersOpts.archiveStorageOptions ?? {}
       );
     }
     memoryTiersBundle = {
@@ -3210,12 +3534,14 @@ function agentMemory(name, source, opts) {
     const budget = opts.budget ?? 2e3;
     const costFn = opts.cost;
     const scoreFn = opts.score;
-    const queryInput = state(null, {
-      name: "retrievalQuery",
-      describeKind: "state"
-    });
-    graph.add("retrievalQuery", queryInput);
     const contextNode = opts.context ? fromAny(opts.context) : state(null);
+    const retrievalOutput = state([], {
+      name: "retrieval",
+      describeKind: "state",
+      meta: aiMeta("retrieval_pipeline")
+    });
+    graph.add("retrieval", retrievalOutput);
+    retrievalNode = retrievalOutput;
     const traceState = state(null, {
       name: "retrievalTrace",
       describeKind: "state",
@@ -3223,97 +3549,81 @@ function agentMemory(name, source, opts) {
     });
     graph.add("retrievalTrace", traceState);
     retrievalTraceNode = traceState;
-    const storeNode = distillBundle.store.entries;
-    let lastTrace = null;
-    const retrievalDerived = derived(
-      [queryInput, storeNode, contextNode],
-      ([query, snapshot, ctx]) => {
-        if (!query) return [];
-        const q = query;
-        const storeMap = extractStoreMap(snapshot);
-        const candidateMap = /* @__PURE__ */ new Map();
-        let vectorCandidates = [];
-        if (vectors && q.vector) {
-          vectorCandidates = vectors.search(q.vector, topK);
-          for (const vc of vectorCandidates) {
-            const mem = storeMap.get(vc.id);
-            if (mem) {
-              candidateMap.set(vc.id, { value: mem, sources: /* @__PURE__ */ new Set(["vector"]) });
-            }
+    retrieveFn = (query) => {
+      const storeMap = extractStoreMap(distillBundle.store.entries.cache);
+      const ctx = contextNode.cache;
+      const candidateMap = /* @__PURE__ */ new Map();
+      let vectorCandidates = [];
+      if (vectors && query.vector) {
+        vectorCandidates = vectors.search(query.vector, topK);
+        for (const vc of vectorCandidates) {
+          const mem = storeMap.get(vc.id);
+          if (mem) {
+            candidateMap.set(vc.id, { value: mem, sources: /* @__PURE__ */ new Set(["vector"]) });
           }
         }
-        const graphExpanded = [];
-        if (kg) {
-          const seedIds = [...q.entityIds ?? [], ...[...candidateMap.keys()]];
-          const visited = /* @__PURE__ */ new Set();
-          let frontier = seedIds;
-          for (let depth = 0; depth < graphDepth; depth++) {
-            const nextFrontier = [];
-            for (const id of frontier) {
-              if (visited.has(id)) continue;
-              visited.add(id);
-              const related = kg.related(id);
-              for (const edge of related) {
-                const targetId = edge.to;
-                if (!visited.has(targetId)) {
-                  nextFrontier.push(targetId);
-                  const mem = storeMap.get(targetId);
-                  if (mem) {
-                    const existing = candidateMap.get(targetId);
-                    if (existing) {
-                      existing.sources.add("graph");
-                    } else {
-                      candidateMap.set(targetId, { value: mem, sources: /* @__PURE__ */ new Set(["graph"]) });
-                    }
-                    graphExpanded.push(targetId);
+      }
+      const graphExpanded = [];
+      if (kg) {
+        const seedIds = [...query.entityIds ?? [], ...[...candidateMap.keys()]];
+        const visited = /* @__PURE__ */ new Set();
+        let frontier = seedIds;
+        for (let depth = 0; depth < graphDepth; depth++) {
+          const nextFrontier = [];
+          for (const id of frontier) {
+            if (visited.has(id)) continue;
+            visited.add(id);
+            const related = kg.related(id);
+            for (const edge of related) {
+              const targetId = edge.to;
+              if (!visited.has(targetId)) {
+                nextFrontier.push(targetId);
+                const mem = storeMap.get(targetId);
+                if (mem) {
+                  const existing = candidateMap.get(targetId);
+                  if (existing) {
+                    existing.sources.add("graph");
+                  } else {
+                    candidateMap.set(targetId, { value: mem, sources: /* @__PURE__ */ new Set(["graph"]) });
                   }
+                  graphExpanded.push(targetId);
                 }
               }
             }
-            frontier = nextFrontier;
-          }
-        }
-        for (const [key, mem] of storeMap) {
-          if (!candidateMap.has(key)) {
-            candidateMap.set(key, { value: mem, sources: /* @__PURE__ */ new Set(["store"]) });
           }
+          frontier = nextFrontier;
         }
-        const ranked = [];
-        for (const [key, { value, sources }] of candidateMap) {
-          const score = scoreFn(value, ctx);
-          ranked.push({ key, value, score, sources: [...sources] });
-        }
-        ranked.sort((a, b) => b.score - a.score);
-        const packed = [];
-        let usedBudget = 0;
-        for (const entry of ranked) {
-          const c = costFn(entry.value);
-          if (usedBudget + c > budget && packed.length > 0) break;
-          packed.push(entry);
-          usedBudget += c;
+      }
+      for (const [key, mem] of storeMap) {
+        if (!candidateMap.has(key)) {
+          candidateMap.set(key, { value: mem, sources: /* @__PURE__ */ new Set(["store"]) });
         }
-        lastTrace = { vectorCandidates, graphExpanded, ranked, packed };
-        return packed;
-      },
-      {
-        name: "retrieval",
-        describeKind: "derived",
-        meta: aiMeta("retrieval_pipeline"),
-        initial: []
       }
-    );
-    graph.add("retrieval", retrievalDerived);
-    graph.connect("retrievalQuery", "retrieval");
-    graph.connect("store", "retrieval");
-    keepaliveSubs.push(retrievalDerived.subscribe(() => void 0));
-    retrievalNode = retrievalDerived;
-    retrieveFn = (query) => {
-      queryInput.down([[DATA, query]]);
-      const result = retrievalDerived.get();
-      if (lastTrace) {
-        traceState.down([[DATA, lastTrace]]);
+      const ranked = [];
+      for (const [key, { value, sources }] of candidateMap) {
+        const score = scoreFn(value, ctx);
+        ranked.push({ key, value, score, sources: [...sources] });
       }
-      return result;
+      ranked.sort((a, b) => b.score - a.score);
+      const packed = [];
+      let usedBudget = 0;
+      for (const entry of ranked) {
+        const c = costFn(entry.value);
+        if (usedBudget + c > budget && packed.length > 0) break;
+        packed.push(entry);
+        usedBudget += c;
+      }
+      const trace = {
+        vectorCandidates,
+        graphExpanded,
+        ranked,
+        packed
+      };
+      batch(() => {
+        retrievalOutput.down([[DATA, packed]]);
+        traceState.down([[DATA, trace]]);
+      });
+      return packed;
     };
   }
   graph.addDisposer(() => {
@@ -3417,7 +3727,7 @@ var AgentLoopGraph = class extends Graph {
           this._statusState.down([[DATA, "thinking"]]);
         });
         const msgs = this.chat.allMessages();
-        const toolSchemas = this.tools.schemas.get() ?? [];
+        const toolSchemas = this.tools.schemas.cache ?? [];
         const response = await this._invokeLLM(msgs, toolSchemas, signal);
         if (signal.aborted) throw new Error("agentLoop: aborted");
         this.lastResponse.down([[DATA, response]]);
@@ -3452,7 +3762,7 @@ var AgentLoopGraph = class extends Graph {
       this._statusState.down([[DATA, "done"]]);
       this._running = false;
       this._abortController = null;
-      return this.lastResponse.get();
+      return this.lastResponse.cache;
     } catch (err) {
       this._statusState.down([[DATA, "error"]]);
       this._running = false;
@@ -3948,7 +4258,7 @@ function demoShell(opts) {
     ([ref, _tick]) => {
       const demo = ref;
       if (!demo) return "";
-      return demo.toMermaid();
+      return demo.describe({ format: "mermaid" });
     },
     { name: "graph/mermaid" }
   );
@@ -4004,7 +4314,6 @@ function demoShell(opts) {
       cb(line);
     });
     g.add("highlight/apply-code-scroll", applyCodeScroll);
-    g.connect("highlight/code-scroll", "highlight/apply-code-scroll");
   }
   if (onHighlight?.visual) {
     const cb = onHighlight.visual;
@@ -4012,7 +4321,6 @@ function demoShell(opts) {
       cb(selector);
     });
     g.add("highlight/apply-visual", applyVisual);
-    g.connect("highlight/visual", "highlight/apply-visual");
   }
   if (onHighlight?.graph) {
     const cb = onHighlight.graph;
@@ -4020,7 +4328,6 @@ function demoShell(opts) {
       cb(nodeId);
     });
     g.add("highlight/apply-graph", applyGraph);
-    g.connect("highlight/graph", "highlight/apply-graph");
   }
   const inspectSelected = state(null, {
     name: "inspect/selected-node"
@@ -4036,7 +4343,7 @@ function demoShell(opts) {
       try {
         const nd = demo.resolve(p);
         const nodeDesc = describeNode(nd, standardFields);
-        return { path: p, ...nodeDesc, value: nd.get() };
+        return { path: p, ...nodeDesc, value: nd.cache };
       } catch {
         return null;
       }
@@ -4060,7 +4367,7 @@ function demoShell(opts) {
     [metaDebug, demoGraphTick],
     ([debug, _tick]) => {
       if (!debug) return "";
-      return g.toMermaid();
+      return g.describe({ format: "mermaid" });
     },
     { name: "meta/shell-mermaid" }
   );
@@ -4126,35 +4433,7 @@ function demoShell(opts) {
     g.add("layout/graph-labels", graphLabels);
     g.add("layout/code-lines", codeLines);
     g.add("layout/side-width-hint", sideWidthHint);
-    g.connect("graph/describe", "layout/graph-labels");
-    g.connect("layout/code-text", "layout/code-lines");
-    g.connect("pane/side-width", "layout/code-lines");
-    g.connect("layout/graph-labels", "layout/side-width-hint");
-  }
-  g.connect("pane/main-ratio", "pane/main-width");
-  g.connect("viewport/width", "pane/main-width");
-  g.connect("pane/fullscreen", "pane/main-width");
-  g.connect("pane/main-width", "pane/side-width");
-  g.connect("viewport/width", "pane/side-width");
-  g.connect("pane/fullscreen", "pane/side-width");
-  g.connect("pane/side-split", "pane/graph-height-ratio");
-  g.connect("pane/fullscreen", "pane/graph-height-ratio");
-  g.connect("pane/graph-height-ratio", "pane/code-height-ratio");
-  g.connect("pane/fullscreen", "pane/code-height-ratio");
-  g.connect("demo/graph-ref", "graph/mermaid");
-  g.connect("demo/graph-tick", "graph/mermaid");
-  g.connect("demo/graph-ref", "graph/describe");
-  g.connect("demo/graph-tick", "graph/describe");
-  g.connect("hover/target", "highlight/code-scroll");
-  g.connect("hover/target", "highlight/visual");
-  g.connect("hover/target", "highlight/graph");
-  g.connect("inspect/selected-node", "inspect/node-detail");
-  g.connect("demo/graph-ref", "inspect/node-detail");
-  g.connect("demo/graph-tick", "inspect/node-detail");
-  g.connect("demo/graph-ref", "inspect/trace-log");
-  g.connect("demo/graph-tick", "inspect/trace-log");
-  g.connect("meta/debug", "meta/shell-mermaid");
-  g.connect("demo/graph-tick", "meta/shell-mermaid");
+  }
   let tickCounter = 0;
   return {
     graph: g,
@@ -4239,14 +4518,14 @@ function _addBranch(graph, source, rulesNode, rule) {
   let sourcePhase2 = false;
   let sourceValue = _noValue;
   let pendingDirty = false;
+  let latestRules = rulesNode.cache ?? [];
   function resolve(actions) {
     if (sourcePhase2) {
       sourcePhase2 = false;
       const value = sourceValue;
       sourceValue = _noValue;
       if (value !== _noValue) {
-        const currentRules = rulesNode.get();
-        const currentRule = currentRules.find((r) => r.name === rule.name);
+        const currentRule = latestRules.find((r) => r.name === rule.name);
         let matches = false;
         try {
           matches = currentRule?.classify(value) ?? false;
@@ -4272,55 +4551,75 @@ function _addBranch(graph, source, rulesNode, rule) {
       }
     }
   }
-  const filterNode = node([source, rulesNode], () => void 0, {
-    describeKind: "operator",
-    meta: baseMeta2("stratify_branch", { branch: rule.name }),
-    onMessage(msg, depIndex, actions) {
-      const t = msg[0];
-      if (t === DIRTY) {
-        if (depIndex === 0) {
-          sourceDirty = true;
-          pendingDirty = true;
-        } else {
-          rulesDirty = true;
+  const filterNode = node(
+    [],
+    (_data, filterActions) => {
+      const srcUnsub = source.subscribe((msgs) => {
+        for (const msg of msgs) {
+          _handleStratifyMessage(msg, 0, filterActions);
         }
-        return true;
-      }
-      if (t === DATA || t === RESOLVED) {
-        if (depIndex === 0) {
-          sourceDirty = false;
-          sourcePhase2 = true;
-          sourceValue = t === DATA ? msg[1] : _noValue;
-        } else {
-          rulesDirty = false;
+      });
+      const rulesUnsub = rulesNode.subscribe((msgs) => {
+        for (const msg of msgs) {
+          _handleStratifyMessage(msg, 1, filterActions);
         }
-        if (sourceDirty || rulesDirty) return true;
-        resolve(actions);
-        return true;
+      });
+      return () => {
+        srcUnsub();
+        rulesUnsub();
+      };
+    },
+    {
+      describeKind: "derived",
+      meta: baseMeta2("stratify_branch", { branch: rule.name }),
+      completeWhenDepsComplete: false
+    }
+  );
+  function _handleStratifyMessage(msg, depIndex, actions) {
+    const t = msg[0];
+    if (t === DIRTY) {
+      if (depIndex === 0) {
+        sourceDirty = true;
+        pendingDirty = true;
+      } else {
+        rulesDirty = true;
       }
-      if (t === COMPLETE || t === ERROR || t === TEARDOWN) {
+      return true;
+    }
+    if (t === DATA || t === RESOLVED) {
+      if (depIndex === 0) {
         sourceDirty = false;
-        rulesDirty = false;
-        sourcePhase2 = false;
-        sourceValue = _noValue;
-        pendingDirty = false;
-        if (depIndex === 0) {
-          actions.down([msg]);
+        sourcePhase2 = true;
+        sourceValue = t === DATA ? msg[1] : _noValue;
+      } else {
+        if (t === DATA) {
+          latestRules = msg[1];
         }
-        return true;
+        rulesDirty = false;
       }
-      if (depIndex === 1) return true;
-      return false;
-    },
-    completeWhenDepsComplete: false
-  });
+      if (sourceDirty || rulesDirty) return true;
+      resolve(actions);
+      return true;
+    }
+    if (t === COMPLETE || t === ERROR || t === TEARDOWN) {
+      sourceDirty = false;
+      rulesDirty = false;
+      sourcePhase2 = false;
+      sourceValue = _noValue;
+      pendingDirty = false;
+      if (depIndex === 0) {
+        actions.down([msg]);
+      }
+      return true;
+    }
+    if (depIndex === 1) return true;
+    return false;
+  }
   graph.add(branchName, filterNode);
-  graph.connect("source", branchName);
   if (rule.ops) {
     const transformed = rule.ops(filterNode);
     const transformedName = `branch/${rule.name}/out`;
     graph.add(transformedName, transformed);
-    graph.connect(branchName, transformedName);
   }
 }
 function funnel(name, sources, stages, opts) {
@@ -4349,12 +4648,14 @@ function funnel(name, sources, stages, opts) {
     const stageInputPath = `${stage.name}::input`;
     const stageInput = g.resolve(stageInputPath);
     const bridgeName = `__bridge_${prevOutputPath}\u2192${stage.name}_input`;
-    const br = bridge(prevNode, stageInput, {
-      name: bridgeName,
-      down: DEFAULT_DOWN.filter((t) => t !== TEARDOWN)
-    });
+    const br = effect(
+      [prevNode],
+      ([data]) => {
+        stageInput.down([[DATA, data]]);
+      },
+      { name: bridgeName }
+    );
     g.add(bridgeName, br);
-    g.connect(prevOutputPath, bridgeName);
     g.addDisposer(keepalive(br));
     prevOutputPath = `${stage.name}::output`;
   }
@@ -4374,39 +4675,41 @@ function feedback(graph, condition, reentry, opts) {
   const condNode = graph.resolve(condition);
   const reentryNode = graph.resolve(reentry);
   const feedbackEffectName = `__feedback_effect_${condition}`;
-  const feedbackEffect = node([condNode], void 0, {
-    name: feedbackEffectName,
-    describeKind: "effect",
-    meta: {
-      ...baseMeta2("feedback_effect", {
-        feedbackFrom: condition,
-        feedbackTo: reentry
-      }),
-      _internal: true
+  const feedbackEffect = node(
+    [],
+    (_data, _feedbackActions) => {
+      const unsub = condNode.subscribe((msgs) => {
+        for (const msg of msgs) {
+          const t = msg[0];
+          if (t === DATA) {
+            const condValue = msg[1];
+            if (condValue == null) return;
+            batch(() => {
+              if (tryIncrementBounded(counter, maxIter)) {
+                reentryNode.down([[DATA, condValue]]);
+              }
+            });
+          } else if (t === COMPLETE || t === ERROR) {
+            const terminal = t === ERROR && msg.length > 1 ? [ERROR, msg[1]] : [t];
+            counter.down([terminal]);
+          }
+        }
+      });
+      return () => unsub();
     },
-    onMessage(msg, _depIndex, _actions) {
-      const t = msg[0];
-      if (t === DATA) {
-        const currentCount = counter.get();
-        if (currentCount >= maxIter) return true;
-        const condValue = msg[1];
-        if (condValue == null) return true;
-        batch(() => {
-          counter.down([[DATA, currentCount + 1]]);
-          reentryNode.down([[DATA, condValue]]);
-        });
-        return true;
-      }
-      if (t === COMPLETE || t === ERROR) {
-        const terminal = t === ERROR && msg.length > 1 ? [ERROR, msg[1]] : [t];
-        counter.down([terminal]);
-        return true;
+    {
+      name: feedbackEffectName,
+      describeKind: "effect",
+      meta: {
+        ...baseMeta2("feedback_effect", {
+          feedbackFrom: condition,
+          feedbackTo: reentry
+        }),
+        _internal: true
       }
-      return false;
     }
-  });
+  );
   graph.add(feedbackEffectName, feedbackEffect);
-  graph.connect(condition, feedbackEffectName);
   graph.addDisposer(keepalive(feedbackEffect));
   return graph;
 }
@@ -4418,8 +4721,9 @@ function budgetGate(source, constraints, opts) {
   let paused = false;
   let pendingResolved = false;
   const lockId = /* @__PURE__ */ Symbol("budget-gate");
+  const latestValues = new Array(constraints.length);
   function checkBudget() {
-    return constraints.every((c) => c.check(c.node.get()));
+    return constraints.every((c, i) => c.check(latestValues[i]));
   }
   function flushBuffer(actions) {
     while (buffer2.length > 0 && checkBudget()) {
@@ -4432,78 +4736,103 @@ function budgetGate(source, constraints, opts) {
       actions.down([[RESOLVED]]);
     }
   }
-  return node(allDeps, () => void 0, {
-    ...opts,
-    describeKind: "operator",
-    meta: baseMeta2("budget_gate", opts?.meta),
-    onMessage(msg, depIndex, actions) {
-      const t = msg[0];
-      if (depIndex === 0) {
-        if (t === DATA) {
-          if (checkBudget() && buffer2.length === 0) {
-            actions.emit(msg[1]);
-          } else {
-            buffer2.push(msg[1]);
-            if (!paused) {
-              paused = true;
-              actions.up([[PAUSE, lockId]]);
+  return node(
+    [],
+    (_data, gateActions) => {
+      for (let i = 0; i < constraints.length; i++) {
+        latestValues[i] = constraints[i].node.cache;
+      }
+      const unsubs = [];
+      for (let depIdx = 0; depIdx < allDeps.length; depIdx++) {
+        const dep = allDeps[depIdx];
+        unsubs.push(
+          dep.subscribe((msgs) => {
+            for (const msg of msgs) {
+              _handleBudgetMessage(msg, depIdx, gateActions);
             }
-          }
-          return true;
-        }
-        if (t === DIRTY) {
-          actions.down([[DIRTY]]);
-          return true;
-        }
-        if (t === RESOLVED) {
-          if (buffer2.length === 0) {
-            actions.down([[RESOLVED]]);
-          } else {
-            pendingResolved = true;
-          }
-          return true;
-        }
-        if (t === COMPLETE || t === ERROR) {
-          for (const item of buffer2) {
-            actions.emit(item);
-          }
-          buffer2 = [];
-          pendingResolved = false;
-          if (paused) {
-            paused = false;
-            actions.up([[RESUME, lockId]]);
-          }
-          actions.down([msg]);
-          return true;
-        }
-        return false;
+          })
+        );
       }
-      if (t === DATA || t === RESOLVED) {
-        if (checkBudget() && buffer2.length > 0) {
-          flushBuffer(actions);
-          if (buffer2.length === 0 && paused) {
-            paused = false;
-            actions.up([[RESUME, lockId]]);
+      return () => {
+        for (const u of unsubs) u();
+      };
+    },
+    {
+      ...opts,
+      describeKind: "derived",
+      meta: baseMeta2("budget_gate", opts?.meta)
+    }
+  );
+  function _handleBudgetMessage(msg, depIndex, actions) {
+    const t = msg[0];
+    if (depIndex === 0) {
+      if (t === DATA) {
+        if (checkBudget() && buffer2.length === 0) {
+          actions.emit(msg[1]);
+        } else {
+          buffer2.push(msg[1]);
+          if (!paused) {
+            paused = true;
+            actions.up([[PAUSE, lockId]]);
           }
-        } else if (!checkBudget() && !paused && buffer2.length > 0) {
-          paused = true;
-          actions.up([[PAUSE, lockId]]);
         }
         return true;
       }
       if (t === DIRTY) {
+        actions.down([[DIRTY]]);
         return true;
       }
-      if (t === ERROR) {
-        actions.down([msg]);
+      if (t === RESOLVED) {
+        if (buffer2.length === 0) {
+          actions.down([[RESOLVED]]);
+        } else {
+          pendingResolved = true;
+        }
         return true;
       }
-      if (t === COMPLETE) {
+      if (t === COMPLETE || t === ERROR) {
+        for (const item of buffer2) {
+          actions.emit(item);
+        }
+        buffer2 = [];
+        pendingResolved = false;
+        if (paused) {
+          paused = false;
+          actions.up([[RESUME, lockId]]);
+        }
+        actions.down([msg]);
         return true;
       }
       return false;
     }
-  });
+    if (t === DATA) {
+      latestValues[depIndex - 1] = msg[1];
+    }
+    if (t === DATA || t === RESOLVED) {
+      if (checkBudget() && buffer2.length > 0) {
+        flushBuffer(actions);
+        if (buffer2.length === 0 && paused) {
+          paused = false;
+          actions.up([[RESUME, lockId]]);
+        }
+      } else if (!checkBudget() && !paused && buffer2.length > 0) {
+        paused = true;
+        actions.up([[PAUSE, lockId]]);
+      }
+      return true;
+    }
+    if (t === DIRTY) {
+      return true;
+    }
+    if (t === ERROR) {
+      actions.down([msg]);
+      return true;
+    }
+    if (t === COMPLETE) {
+      return true;
+    }
+    return false;
+  }
 }
 function scorer(sources, weights, opts) {
   if (sources.length === 0) throw new RangeError("scorer requires at least one source");
@@ -4535,7 +4864,11 @@ function scorer(sources, weights, opts) {
       };
     },
     {
-      ...opts,
+      ...opts ? {
+        equals: opts.equals,
+        resubscribable: opts.resubscribable,
+        resetOnTeardown: opts.resetOnTeardown
+      } : {},
       describeKind: "derived",
       meta: baseMeta2("scorer", opts?.meta)
     }
@@ -4623,12 +4956,6 @@ function observabilityGraph(name, opts) {
     }
   );
   g.add("correlate", correlateNode);
-  for (const b of branches) {
-    try {
-      g.connect(`stratify::branch/${b.name}`, "correlate");
-    } catch {
-    }
-  }
   const sloCheckFn = opts.sloCheck ?? (() => ({ pass: true }));
   const sloValue = derived([correlateNode], (vals) => vals[0], {
     meta: baseMeta3("observability", { stage: "slo_value" })
@@ -4638,8 +4965,6 @@ function observabilityGraph(name, opts) {
   });
   g.add("slo_value", sloValue);
   g.add("slo_verified", sloVerified);
-  g.connect("correlate", "slo_value");
-  g.connect("slo_value", "slo_verified");
   const weightValues = opts.weights ?? branches.map(() => 1);
   const signalNodes = branchNodes.map(
     (bn) => derived([bn], (vals) => vals[0] != null ? 1 : 0)
@@ -4665,8 +4990,6 @@ function observabilityGraph(name, opts) {
     }
   );
   g.add("output", output);
-  g.connect("alerts", "output");
-  g.connect("slo_verified", "output");
   const fbReentry = state(null, {
     meta: baseMeta3("observability", { stage: "feedback_reentry" })
   });
@@ -4683,7 +5006,6 @@ function observabilityGraph(name, opts) {
     }
   );
   g.add("feedback_condition", fbCondition);
-  g.connect("slo_verified", "feedback_condition");
   feedback(g, "feedback_condition", "feedback_reentry", {
     maxIterations: opts.maxFeedbackIterations ?? 5
   });
@@ -4705,7 +5027,6 @@ function issueTrackerGraph(name, opts) {
     meta: baseMeta3("issue_tracker", { stage: "extract" })
   });
   g.add("extract", extractNode);
-  g.connect("source", "extract");
   const verifyFn = opts.verify ?? (() => ({ valid: true }));
   const verifyNode = derived(
     [extractNode],
@@ -4718,7 +5039,6 @@ function issueTrackerGraph(name, opts) {
     }
   );
   g.add("verify", verifyNode);
-  g.connect("extract", "verify");
   const knownPatterns = state([], {
     meta: baseMeta3("issue_tracker", { stage: "known_patterns" })
   });
@@ -4734,8 +5054,6 @@ function issueTrackerGraph(name, opts) {
     { meta: baseMeta3("issue_tracker", { stage: "regression" }) }
   );
   g.add("regression", regressionNode);
-  g.connect("extract", "regression");
-  g.connect("known_patterns", "regression");
   const severitySignal = derived([extractNode], (vals) => {
     const issue = vals[0];
     return issue?.severity ?? 0;
@@ -4762,9 +5080,6 @@ function issueTrackerGraph(name, opts) {
     { meta: baseMeta3("issue_tracker", { stage: "output" }) }
   );
   g.add("output", output);
-  g.connect("verify", "output");
-  g.connect("regression", "output");
-  g.connect("priority", "output");
   const fbReentry = state(null, {
     meta: baseMeta3("issue_tracker", { stage: "feedback_reentry" })
   });
@@ -4784,7 +5099,6 @@ function issueTrackerGraph(name, opts) {
     }
   );
   g.add("feedback_condition", fbCondition);
-  g.connect("verify", "feedback_condition");
   feedback(g, "feedback_condition", "feedback_reentry", {
     maxIterations: opts.maxFeedbackIterations ?? 3
   });
@@ -4803,7 +5117,6 @@ function contentModerationGraph(name, opts) {
     meta: baseMeta3("content_moderation", { stage: "classify" })
   });
   g.add("classify", classifyNode);
-  g.connect("source", "classify");
   const strat = stratify("stratify", classifyNode, [
     { name: "safe", classify: (v) => v.label === "safe" },
     { name: "review", classify: (v) => v.label === "review" },
@@ -4831,7 +5144,6 @@ function contentModerationGraph(name, opts) {
   g.add("__review_accumulator", reviewAccumulator);
   g.addDisposer(keepalive(reviewAccumulator));
   try {
-    g.connect("stratify::branch/review", "__review_accumulator");
   } catch {
   }
   const policy2 = state(
@@ -4872,8 +5184,6 @@ function contentModerationGraph(name, opts) {
     { meta: baseMeta3("content_moderation", { stage: "output" }) }
   );
   g.add("output", output);
-  g.connect("classify", "output");
-  g.connect("priority", "output");
   const fbCondition = derived(
     [reviewLog.entries, policy2],
     (vals) => {
@@ -4910,7 +5220,6 @@ function dataQualityGraph(name, opts) {
     { meta: baseMeta3("data_quality", { stage: "validate" }) }
   );
   g.add("validate", validateNode);
-  g.connect("source", "validate");
   const detectAnomalyFn = opts.detectAnomaly ?? ((record) => ({
     anomaly: false,
     score: 0,
@@ -4922,7 +5231,6 @@ function dataQualityGraph(name, opts) {
     { meta: baseMeta3("data_quality", { stage: "anomaly" }) }
   );
   g.add("anomaly", anomalyNode);
-  g.connect("source", "anomaly");
   const baseline = state(null, {
     meta: baseMeta3("data_quality", {
       stage: "baseline",
@@ -4939,7 +5247,6 @@ function dataQualityGraph(name, opts) {
     }
   });
   g.add("__baseline_updater", baselineUpdater);
-  g.connect("validate", "__baseline_updater");
   keepalive(baselineUpdater);
   const detectDriftFn = opts.detectDrift ?? (() => ({ drift: false }));
   const driftNode = derived(
@@ -4948,8 +5255,6 @@ function dataQualityGraph(name, opts) {
     { meta: baseMeta3("data_quality", { stage: "drift" }) }
   );
   g.add("drift", driftNode);
-  g.connect("source", "drift");
-  g.connect("baseline", "drift");
   const suggestFn = opts.suggest ?? (() => null);
   const remediateNode = derived(
     [validateNode, anomalyNode],
@@ -4960,8 +5265,6 @@ function dataQualityGraph(name, opts) {
     { meta: baseMeta3("data_quality", { stage: "remediate" }) }
   );
   g.add("remediate", remediateNode);
-  g.connect("validate", "remediate");
-  g.connect("anomaly", "remediate");
   const output = derived(
     [validateNode, anomalyNode, driftNode, remediateNode],
     (vals) => ({
@@ -4973,10 +5276,6 @@ function dataQualityGraph(name, opts) {
     { meta: baseMeta3("data_quality", { stage: "output" }) }
   );
   g.add("output", output);
-  g.connect("validate", "output");
-  g.connect("anomaly", "output");
-  g.connect("drift", "output");
-  g.connect("remediate", "output");
   const validationRules = state([], {
     meta: baseMeta3("data_quality", { stage: "validation_rules" })
   });
@@ -4993,7 +5292,6 @@ function dataQualityGraph(name, opts) {
     }
   );
   g.add("feedback_condition", fbCondition);
-  g.connect("anomaly", "feedback_condition");
   feedback(g, "feedback_condition", "validation_rules", {
     maxIterations: opts.maxFeedbackIterations ?? 3
   });
@@ -5519,20 +5817,6 @@ ${catalogValidation.errors.join("\n")}`
     } catch {
     }
   }
-  for (const [name, raw] of Object.entries(spec.nodes)) {
-    if (raw.type === "template") continue;
-    const n = raw;
-    for (const dep of n.deps ?? []) {
-      try {
-        g.connect(dep, name);
-      } catch (err) {
-        const msg = err instanceof Error ? err.message : "";
-        if (!msg.includes("constructor deps") && !msg.includes("already")) {
-          throw err;
-        }
-      }
-    }
-  }
   for (const fb of spec.feedback ?? []) {
     feedback(g, fb.from, fb.to, {
       maxIterations: fb.maxIterations
@@ -6030,12 +6314,17 @@ __export(harness_exports, {
   DEFAULT_SEVERITY_WEIGHTS: () => DEFAULT_SEVERITY_WEIGHTS,
   HarnessGraph: () => HarnessGraph,
   QUEUE_NAMES: () => QUEUE_NAMES,
+  affectedTaskFilter: () => affectedTaskFilter,
+  beforeAfterCompare: () => beforeAfterCompare,
+  codeChangeBridge: () => codeChangeBridge,
   createIntakeBridge: () => createIntakeBridge,
   defaultErrorClassifier: () => defaultErrorClassifier,
   evalIntakeBridge: () => evalIntakeBridge,
+  evalSource: () => evalSource,
   harnessLoop: () => harnessLoop,
   harnessProfile: () => harnessProfile,
   harnessTrace: () => harnessTrace,
+  notifyEffect: () => notifyEffect,
   priorityScore: () => priorityScore,
   strategyKey: () => strategyKey,
   strategyModel: () => strategyModel
@@ -6055,10 +6344,10 @@ function createIntakeBridge(source, intakeTopic, parser, opts) {
     { name: opts?.name ?? "intake-bridge" }
   );
 }
-function evalIntakeBridge(evalSource, intakeTopic, opts) {
+function evalIntakeBridge(evalSource2, intakeTopic, opts) {
   const defaultSeverity = opts?.defaultSeverity ?? "medium";
   return effect(
-    [evalSource],
+    [evalSource2],
     ([results]) => {
       if (results == null) return;
       const runs = Array.isArray(results) ? results : [results];
@@ -6095,6 +6384,110 @@ function evalIntakeBridge(evalSource, intakeTopic, opts) {
     { name: opts?.name ?? "eval-intake-bridge" }
   );
 }
+function evalSource(trigger2, runner) {
+  return switchMap(trigger2, () => fromAny(runner()));
+}
+function beforeAfterCompare(before, after) {
+  return derived(
+    [before, after],
+    ([b, a]) => {
+      const bRes = b;
+      const aRes = a;
+      const beforeMap = new Map(bRes.tasks.map((t) => [t.task_id, t]));
+      const afterMap = new Map(aRes.tasks.map((t) => [t.task_id, t]));
+      const allIds = /* @__PURE__ */ new Set([...beforeMap.keys(), ...afterMap.keys()]);
+      const taskDeltas = [];
+      const newFailures = [];
+      const resolved = [];
+      for (const id of allIds) {
+        const bt = beforeMap.get(id);
+        const at = afterMap.get(id);
+        const beforeValid = bt?.valid ?? false;
+        const afterValid = at?.valid ?? false;
+        const beforeScore = bt?.judge_scores ? bt.judge_scores.filter((s) => s.pass).length : void 0;
+        const afterScore = at?.judge_scores ? at.judge_scores.filter((s) => s.pass).length : void 0;
+        const scoreDiff = beforeScore !== void 0 && afterScore !== void 0 ? afterScore - beforeScore : void 0;
+        taskDeltas.push({ taskId: id, before: beforeValid, after: afterValid, scoreDiff });
+        if (beforeValid && !afterValid) newFailures.push(id);
+        if (!beforeValid && afterValid) resolved.push(id);
+      }
+      return {
+        newFailures,
+        resolved,
+        taskDeltas,
+        overallImproved: resolved.length > newFailures.length
+      };
+    },
+    { name: "eval-delta" }
+  );
+}
+function affectedTaskFilter(issues, fullTaskSet) {
+  const taskSetNode = fullTaskSet == null ? null : Array.isArray(fullTaskSet) ? state(fullTaskSet) : fullTaskSet;
+  const deps = [issues];
+  if (taskSetNode) deps.push(taskSetNode);
+  return derived(
+    deps,
+    (values) => {
+      const items = values[0];
+      const all = taskSetNode ? new Set(values[1]) : null;
+      const affected = /* @__PURE__ */ new Set();
+      for (const item of items) {
+        for (const id of item.affectsEvalTasks ?? []) {
+          if (all == null || all.has(id)) affected.add(id);
+        }
+      }
+      return [...affected].sort();
+    },
+    { name: "affected-task-filter" }
+  );
+}
+function codeChangeBridge(source, intakeTopic, parser, opts) {
+  const defaultSeverity = opts?.defaultSeverity ?? "high";
+  function defaultParser(change) {
+    const items = [];
+    for (const err of change.lintErrors ?? []) {
+      items.push({
+        source: "code-change",
+        summary: `Lint: ${err.rule} in ${err.file}:${err.line}`,
+        evidence: err.message,
+        affectsAreas: [err.file],
+        severity: defaultSeverity
+      });
+    }
+    for (const fail of change.testFailures ?? []) {
+      items.push({
+        source: "test",
+        summary: `Test failure: ${fail.testId}`,
+        evidence: fail.message,
+        affectsAreas: [fail.file],
+        affectsEvalTasks: [fail.testId],
+        severity: defaultSeverity
+      });
+    }
+    return items;
+  }
+  const resolve = parser ?? defaultParser;
+  return effect(
+    [source],
+    ([change]) => {
+      if (change == null) return;
+      for (const item of resolve(change)) {
+        intakeTopic.publish(item);
+      }
+    },
+    { name: opts?.name ?? "code-change-bridge" }
+  );
+}
+function notifyEffect(topic2, transport, opts) {
+  return effect(
+    [topic2.latest],
+    ([item]) => {
+      if (item == null) return;
+      void transport(item);
+    },
+    { name: opts?.name ?? "notify-effect" }
+  );
+}
 
 // src/patterns/harness/types.ts
 var QUEUE_NAMES = [
@@ -6314,6 +6707,7 @@ function harnessLoop(name, opts) {
   }
   const routerInput = withLatestFrom(triageNode, triageInput);
   const router = effect([routerInput], ([pair]) => {
+    if (pair == null) return;
     const [classification, triagePair] = pair;
     if (!classification || !classification.route) return;
     const intakeItem = triagePair?.[0];
@@ -6359,32 +6753,43 @@ function harnessLoop(name, opts) {
       retries: 1
     }
   );
+  const executeContextNode = withLatestFrom(
+    executeNode,
+    executeInput
+  );
   const verifyResults = new TopicGraph("verify-results", { retainedLimit });
   const verifyNode = promptNode(
     adapter,
-    [executeNode, executeInput],
-    opts.verifyPrompt ?? ((execution, item) => DEFAULT_VERIFY_PROMPT.replace("{{execution}}", JSON.stringify(execution)).replace(
-      "{{item}}",
-      JSON.stringify(item)
-    )),
+    [executeContextNode],
+    opts.verifyPrompt ?? ((ctxPair) => {
+      const [execution, item] = ctxPair;
+      return DEFAULT_VERIFY_PROMPT.replace("{{execution}}", JSON.stringify(execution)).replace(
+        "{{item}}",
+        JSON.stringify(item)
+      );
+    }),
     {
       name: "verify",
       format: "json",
       retries: 1
     }
   );
-  const verifyWithExec = withLatestFrom(verifyNode, executeNode);
   const verifyContext = withLatestFrom(
-    verifyWithExec,
-    executeInput
+    verifyNode,
+    executeContextNode
   );
   const maxReingestions = opts.maxReingestions ?? 1;
   const maxTotalRetries = Math.min(opts.maxTotalRetries ?? maxRetries * 10, 100);
   const maxTotalReingestions = Math.min(opts.maxTotalReingestions ?? maxReingestions * 10, 100);
   const totalRetries = state(0);
   const totalReingestions = state(0);
-  const fastRetry = effect([verifyContext], ([ctx]) => {
-    const [[vo, execRaw], item] = ctx;
+  const fastRetry = node([verifyContext], (batchData, _actions) => {
+    const batch2 = batchData[0];
+    if (batch2 == null || batch2.length === 0) return;
+    const ctxVal = batch2[batch2.length - 1];
+    if (ctxVal == null) return;
+    const [vo, execCtx] = ctxVal;
+    const [execRaw, item] = execCtx ?? [null, null];
     if (!vo || !item) return;
     const exec = {
       item,
@@ -6409,8 +6814,7 @@ function harnessLoop(name, opts) {
       detail: vr.findings.join("; ")
     });
     const itemRetries = item._retries ?? 0;
-    if (errClass === "self-correctable" && itemRetries < maxRetries && (totalRetries.get() ?? 0) < maxTotalRetries) {
-      totalRetries.down([[DIRTY], [DATA, (totalRetries.get() ?? 0) + 1]]);
+    if (errClass === "self-correctable" && itemRetries < maxRetries && tryIncrementBounded(totalRetries, maxTotalRetries)) {
       const key = trackingKey(item);
       const retryItem = {
         ...item,
@@ -6424,8 +6828,7 @@ function harnessLoop(name, opts) {
       verifyResults.publish(vr);
       const key = trackingKey(item);
       const itemReingestions = item._reingestions ?? 0;
-      if (itemReingestions < maxReingestions && (totalReingestions.get() ?? 0) < maxTotalReingestions) {
-        totalReingestions.down([[DIRTY], [DATA, (totalReingestions.get() ?? 0) + 1]]);
+      if (itemReingestions < maxReingestions && tryIncrementBounded(totalReingestions, maxTotalReingestions)) {
         intake.publish({
           source: "eval",
           summary: `Verification failed for: ${key}`,
@@ -6478,9 +6881,9 @@ function harnessProfile(harness, opts) {
   return {
     ...base,
     queueDepths,
-    strategyEntries: harness.strategy.node.get()?.size ?? 0,
-    totalRetries: harness.totalRetries.get() ?? 0,
-    totalReingestions: harness.totalReingestions.get() ?? 0
+    strategyEntries: harness.strategy.node.cache?.size ?? 0,
+    totalRetries: harness.totalRetries.cache ?? 0,
+    totalReingestions: harness.totalReingestions.cache ?? 0
   };
 }
 
@@ -6587,56 +6990,69 @@ function truncate(s, max) {
 // src/index.ts
 var version = "0.0.0";
 export {
-  CLEANUP_RESULT,
   COMPLETE,
+  COMPLETE_MSG,
+  COMPLETE_ONLY_BATCH,
   CircuitOpenError,
   DATA,
   DEFAULT_ACTOR,
-  DEFAULT_DOWN,
   DIRTY,
-  DictCheckpointAdapter,
-  DynamicNodeImpl,
+  DIRTY_MSG,
+  DIRTY_ONLY_BATCH,
+  ENVELOPE_VERSION,
   ERROR,
-  FileCheckpointAdapter,
   GRAPH_META_SEGMENT,
   Graph,
+  GraphReFlyConfig,
   GuardDenied,
   INVALIDATE,
+  INVALIDATE_MSG,
+  INVALIDATE_ONLY_BATCH,
   JsonCodec,
-  MemoryCheckpointAdapter,
   NS_PER_MS,
   NS_PER_SEC,
+  NativeIndexBackend,
+  NativeListBackend,
+  NativeLogBackend,
+  NativeMapBackend,
+  NativePubSubBackend,
+  NodeImpl,
   PAUSE,
   RESOLVED,
+  RESOLVED_MSG,
+  RESOLVED_ONLY_BATCH,
   RESUME,
+  RateLimiterOverflowError,
   ResettableTimer,
+  OVERHEAD as SIZEOF_OVERHEAD,
+  SIZEOF_SYMBOL,
   START,
-  SqliteCheckpointAdapter,
+  START_MSG,
   TEARDOWN,
+  TEARDOWN_MSG,
+  TEARDOWN_ONLY_BATCH,
   TimeoutError,
   accessHintForGuard,
   advanceVersion,
   ai_exports as ai,
   audit,
+  autoTrackNode,
   batch,
-  bridge,
   buffer,
   bufferCount,
   bufferTime,
-  cache,
   cached,
   cascadingCache,
   catchError,
-  checkpointNodeValue,
   checkpointToRedis,
   checkpointToS3,
   circuitBreaker,
-  cleanupResult,
   combine,
   combineLatest,
   compat_exports as compat,
   concat,
   concatMap,
+  configure,
   constant,
   core_exports as core,
   cqrs_exports as cqrs,
@@ -6645,14 +7061,19 @@ export {
   createTransport,
   createVersioning,
   createWatermarkController,
+  csvRows,
   debounce,
   debounceTime,
+  decodeEnvelope,
   decorrelatedJitter,
+  defaultConfig,
   defaultHash,
   delay,
   demo_shell_exports as demoShell,
   derived,
   deserializeError,
+  dictStorage,
+  diffForWAL,
   distill,
   distinctUntilChanged,
   domain_templates_exports as domainTemplates,
@@ -6661,12 +7082,16 @@ export {
   effect,
   elementAt,
   empty,
+  encodeEnvelope,
   escapeRegexChar,
   exhaustMap,
   exponential,
+  externalBundle,
+  externalProducer,
   extra_exports as extra,
   fallback,
   fibonacci,
+  fileStorage,
   filter,
   find,
   first,
@@ -6684,6 +7109,8 @@ export {
   fromFSWatch,
   fromGitHook,
   fromHTTP,
+  fromHTTPPoll,
+  fromHTTPStream,
   fromIDBRequest,
   fromIDBTransaction,
   fromIter,
@@ -6699,44 +7126,42 @@ export {
   fromPulsar,
   fromRabbitMQ,
   fromRedisStream,
+  fromSSE,
   fromSqlite,
+  fromSqliteCursor,
   fromStatsD,
   fromSyslog,
   fromTimer,
   fromWebSocket,
+  fromWebSocketReconnect,
   fromWebhook,
   globToRegExp,
   graph_exports as graph,
   graphProfile,
   graphspec_exports as graphspec,
   harness_exports as harness,
+  indexedDbStorage,
   interval,
   isBatching,
-  isKnownMessageType,
-  isLocalOnly,
-  isPhase2Message,
-  isTerminalMessage,
   isV1,
   jotai_exports as jotai,
   keepalive,
-  knownMessageTypes,
   last,
   reactive_layout_exports as layout,
   linear,
-  logSlice,
   lru,
   map,
   matchesAnyPattern,
   matchesCron,
   memory_exports as memory,
+  memoryStorage,
   merge,
   mergeMap,
-  messageTier,
   messaging_exports as messaging,
   monotonicNs,
   nameToSignal,
   nanostores_exports as nanostores,
-  negotiateCodec,
+  ndjsonRows,
   nestjs_exports as nestjs,
   never,
   node,
@@ -6748,14 +7173,12 @@ export {
   parsePrometheusText,
   parseStatsD,
   parseSyslog,
-  partitionForBatch,
   patterns_exports as patterns,
   pausable,
   pipe,
   policy,
   policyFromRules,
   producer,
-  propagatesToMeta,
   pubsub,
   race,
   rateLimiter,
@@ -6766,20 +7189,20 @@ export {
   reactiveList,
   reactiveLog,
   reactiveMap,
+  reactiveSink,
   reduce,
   reduction_exports as reduction,
+  registerBuiltinCodecs,
+  registerBuiltins,
   repeat,
   replay,
   replayWAL,
   rescue,
   resolveBackoffPreset,
   resolveDescribeFields,
-  restoreGraphCheckpoint,
-  restoreGraphCheckpointIndexedDb,
   retry,
+  retrySource,
   sample,
-  saveGraphCheckpoint,
-  saveGraphCheckpointIndexedDb,
   scan,
   serializeError,
   share,
@@ -6789,6 +7212,7 @@ export {
   sizeof,
   skip,
   solid_exports as solid,
+  sqliteStorage,
   state,
   svelte_exports as svelte,
   switchMap,
@@ -6799,12 +7223,12 @@ export {
   throttle,
   throttleTime,
   throwError,
-  tieredStorage,
   timeout,
   toArray,
   toCSV,
   toClickHouse,
   toFile,
+  toHTTP,
   toKafka,
   toLoki,
   toMongo,
@@ -6813,14 +7237,15 @@ export {
   toPostgres,
   toPulsar,
   toRabbitMQ,
+  toReadableStream,
   toRedisStream,
   toS3,
   toSSE,
+  toSSEBytes,
   toSqlite,
   toTempo,
   toWebSocket,
   tokenBucket,
-  tokenTracker,
   valve,
   verifiable,
   version,