@graphrefly/graphrefly 0.8.0 → 0.10.0

package/dist/index.js

@@ -145,14 +145,6 @@ import {
 import {
   core_exports
 } from "./chunk-E7OH6ZAZ.js";
-import {
-  JsonCodec,
-  createDagCborCodec,
-  createDagCborZstdCodec,
-  graph_exports,
-  negotiateCodec,
-  replayWAL
-} from "./chunk-A2AJJOSJ.js";
 import {
   cached,
   createWatermarkController,
@@ -189,6 +181,14 @@ import {
 import {
   ResettableTimer
 } from "./chunk-WZ2Z2CRV.js";
+import {
+  JsonCodec,
+  createDagCborCodec,
+  createDagCborZstdCodec,
+  graph_exports,
+  negotiateCodec,
+  replayWAL
+} from "./chunk-A2AJJOSJ.js";
 import {
   analyzeAndMeasure,
   computeLineBreaks,
@@ -1045,10 +1045,12 @@ __export(patterns_exports, {
   ai: () => ai_exports,
   cqrs: () => cqrs_exports,
   demoShell: () => demo_shell_exports,
+  graphspec: () => graphspec_exports,
   layout: () => reactive_layout_exports,
   memory: () => memory_exports,
   messaging: () => messaging_exports,
-  orchestration: () => orchestration_exports
+  orchestration: () => orchestration_exports,
+  reduction: () => reduction_exports
 });
 
 // src/patterns/ai.ts
@@ -3023,6 +3025,1123 @@ function demoShell(opts) {
   };
 }
 
+// src/patterns/graphspec.ts
+var graphspec_exports = {};
+__export(graphspec_exports, {
+  compileSpec: () => compileSpec,
+  decompileGraph: () => decompileGraph,
+  llmCompose: () => llmCompose,
+  llmRefine: () => llmRefine,
+  specDiff: () => specDiff,
+  validateSpec: () => validateSpec
+});
+
+// src/patterns/reduction.ts
+var reduction_exports = {};
+__export(reduction_exports, {
+  budgetGate: () => budgetGate,
+  feedback: () => feedback,
+  funnel: () => funnel,
+  scorer: () => scorer,
+  stratify: () => stratify
+});
+function baseMeta(kind, meta) {
+  return {
+    reduction: true,
+    reduction_type: kind,
+    ...meta ?? {}
+  };
+}
+function stratify(name, source, rules, opts) {
+  const g = new Graph(name, opts);
+  g.add("source", source);
+  const rulesNode = state(rules, {
+    meta: baseMeta("stratify_rules")
+  });
+  g.add("rules", rulesNode);
+  for (const rule of rules) {
+    _addBranch(g, source, rulesNode, rule);
+  }
+  return g;
+}
+function _addBranch(graph, source, rulesNode, rule) {
+  const branchName = `branch/${rule.name}`;
+  let pendingDirty = false;
+  const filterNode = node([source, rulesNode], () => void 0, {
+    describeKind: "operator",
+    meta: baseMeta("stratify_branch", { branch: rule.name }),
+    onMessage(msg, depIndex, actions) {
+      if (depIndex !== 0) return false;
+      const t = msg[0];
+      if (t === DATA) {
+        const value = msg[1];
+        const currentRules = rulesNode.get();
+        const currentRule = currentRules.find((r) => r.name === rule.name);
+        if (currentRule && currentRule.classify(value)) {
+          pendingDirty = false;
+          actions.emit(value);
+        } else {
+          if (pendingDirty) {
+            pendingDirty = false;
+            actions.down([[DIRTY], [RESOLVED]]);
+          }
+        }
+        return true;
+      }
+      if (t === DIRTY) {
+        pendingDirty = true;
+        return true;
+      }
+      if (t === RESOLVED) {
+        if (pendingDirty) {
+          pendingDirty = false;
+          actions.down([[DIRTY], [RESOLVED]]);
+        } else {
+          actions.down([[RESOLVED]]);
+        }
+        return true;
+      }
+      if (t === COMPLETE || t === ERROR) {
+        pendingDirty = false;
+        actions.down([msg]);
+        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) {
+  if (sources.length === 0) throw new RangeError("funnel requires at least one source");
+  if (stages.length === 0) throw new RangeError("funnel requires at least one stage");
+  const g = new Graph(name, opts);
+  const merged = sources.length === 1 ? sources[0] : merge(...sources);
+  g.add("merged", merged);
+  let prevOutputPath = "merged";
+  for (let i = 0; i < stages.length; i++) {
+    const stage = stages[i];
+    const sub = new Graph(stage.name);
+    stage.build(sub);
+    try {
+      sub.resolve("input");
+    } catch {
+      throw new Error(`funnel stage "${stage.name}" must define an "input" node`);
+    }
+    try {
+      sub.resolve("output");
+    } catch {
+      throw new Error(`funnel stage "${stage.name}" must define an "output" node`);
+    }
+    g.mount(stage.name, sub);
+    const prevNode = g.resolve(prevOutputPath);
+    const stageInputPath = `${stage.name}::input`;
+    const stageInput = g.resolve(stageInputPath);
+    prevNode.subscribe((msgs) => {
+      for (const msg of msgs) {
+        const t = msg[0];
+        if (t === DATA) {
+          stageInput.down([[DATA, msg[1]]]);
+        } else if (t === DIRTY) {
+          stageInput.down([[DIRTY]]);
+        } else if (t === RESOLVED) {
+          stageInput.down([[RESOLVED]]);
+        } else if (t === COMPLETE || t === ERROR) {
+          stageInput.down([msg]);
+        }
+      }
+    });
+    prevOutputPath = `${stage.name}::output`;
+  }
+  return g;
+}
+function feedback(graph, condition, reentry, opts) {
+  const maxIter = opts?.maxIterations ?? 10;
+  const counterName = `__feedback_${condition}`;
+  const counter = state(0, {
+    meta: baseMeta("feedback_counter", {
+      maxIterations: maxIter,
+      feedbackFrom: condition,
+      feedbackTo: reentry
+    })
+  });
+  graph.add(counterName, counter);
+  const condNode = graph.resolve(condition);
+  const reentryNode = graph.resolve(reentry);
+  let tornDown = false;
+  let unsubCounter = null;
+  const safeUnsub = () => {
+    if (tornDown) return;
+    tornDown = true;
+    unsub();
+    unsubCounter?.();
+  };
+  const unsub = condNode.subscribe((msgs) => {
+    for (const msg of msgs) {
+      if (msg[0] === DATA) {
+        const currentCount = counter.get();
+        if (currentCount >= maxIter) continue;
+        const condValue = msg[1];
+        if (condValue == null) continue;
+        counter.down([[DATA, currentCount + 1]]);
+        reentryNode.down([[DATA, condValue]]);
+      } else if (msg[0] === COMPLETE || msg[0] === ERROR) {
+        const terminal = msg[0] === ERROR && msg.length > 1 ? [ERROR, msg[1]] : [msg[0]];
+        counter.down([terminal]);
+        safeUnsub();
+      }
+    }
+  });
+  unsubCounter = counter.subscribe((msgs) => {
+    for (const msg of msgs) {
+      if (msg[0] === COMPLETE || msg[0] === ERROR) {
+        safeUnsub();
+        return;
+      }
+    }
+  });
+  return graph;
+}
+function budgetGate(source, constraints, opts) {
+  if (constraints.length === 0) throw new RangeError("budgetGate requires at least one constraint");
+  const constraintNodes = constraints.map((c) => c.node);
+  const allDeps = [source, ...constraintNodes];
+  let buffer2 = [];
+  let paused = false;
+  let pendingResolved = false;
+  const lockId = /* @__PURE__ */ Symbol("budget-gate");
+  function checkBudget() {
+    return constraints.every((c) => c.check(c.node.get()));
+  }
+  function flushBuffer(actions) {
+    while (buffer2.length > 0 && checkBudget()) {
+      const item = buffer2.shift();
+      actions.emit(item);
+    }
+    if (buffer2.length === 0 && pendingResolved) {
+      pendingResolved = false;
+      actions.down([[RESOLVED]]);
+    }
+  }
+  return node(allDeps, () => void 0, {
+    ...opts,
+    describeKind: "operator",
+    meta: baseMeta("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 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]]);
+          }
+        } 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");
+  if (sources.length !== weights.length) {
+    throw new RangeError("scorer requires the same number of sources and weights");
+  }
+  const allDeps = [...sources, ...weights];
+  const n = sources.length;
+  const scoreFns = opts?.scoreFns;
+  return derived(
+    allDeps,
+    (vals) => {
+      const signals = vals.slice(0, n);
+      const weightValues = vals.slice(n);
+      const breakdown = [];
+      let totalScore = 0;
+      for (let i = 0; i < n; i++) {
+        const sig = signals[i] ?? 0;
+        const wt = weightValues[i] ?? 0;
+        const rawScore = scoreFns?.[i] ? scoreFns[i](sig) : sig;
+        const weighted = rawScore * wt;
+        breakdown.push(weighted);
+        totalScore += weighted;
+      }
+      return {
+        value: signals,
+        score: totalScore,
+        breakdown
+      };
+    },
+    {
+      ...opts,
+      describeKind: "derived",
+      meta: baseMeta("scorer", opts?.meta)
+    }
+  );
+}
+
+// src/patterns/graphspec.ts
+var VALID_NODE_TYPES2 = /* @__PURE__ */ new Set([
+  "state",
+  "producer",
+  "derived",
+  "effect",
+  "operator",
+  "template"
+]);
+var INNER_NODE_TYPES = /* @__PURE__ */ new Set(["state", "producer", "derived", "effect", "operator"]);
+function validateSpec(spec) {
+  const errors = [];
+  if (spec == null || typeof spec !== "object") {
+    return { valid: false, errors: ["GraphSpec must be a non-null object"] };
+  }
+  const s = spec;
+  if (typeof s.name !== "string" || s.name.length === 0) {
+    errors.push("Missing or empty 'name' field");
+  }
+  if (s.nodes == null || typeof s.nodes !== "object" || Array.isArray(s.nodes)) {
+    errors.push("Missing or invalid 'nodes' field (must be an object)");
+    return { valid: false, errors };
+  }
+  const nodeNames = new Set(Object.keys(s.nodes));
+  const nodeTypes = /* @__PURE__ */ new Map();
+  const templateDefs = /* @__PURE__ */ new Map();
+  if (s.templates != null && typeof s.templates === "object" && !Array.isArray(s.templates)) {
+    for (const [tName, tRaw] of Object.entries(s.templates)) {
+      if (tRaw != null && typeof tRaw === "object") {
+        const t = tRaw;
+        templateDefs.set(tName, {
+          params: Array.isArray(t.params) ? t.params : []
+        });
+      }
+    }
+  }
+  if (s.templates != null) {
+    if (typeof s.templates !== "object" || Array.isArray(s.templates)) {
+      errors.push("'templates' must be an object");
+    } else {
+      for (const [tName, tRaw] of Object.entries(s.templates)) {
+        if (tRaw == null || typeof tRaw !== "object") {
+          errors.push(`Template "${tName}": must be an object`);
+          continue;
+        }
+        const t = tRaw;
+        if (!Array.isArray(t.params)) {
+          errors.push(`Template "${tName}": missing 'params' array`);
+        }
+        if (t.nodes == null || typeof t.nodes !== "object" || Array.isArray(t.nodes)) {
+          errors.push(`Template "${tName}": missing or invalid 'nodes' object`);
+        } else {
+          const paramSet = new Set(Array.isArray(t.params) ? t.params : []);
+          const innerNames = new Set(Object.keys(t.nodes));
+          for (const [nName, nRaw] of Object.entries(t.nodes)) {
+            if (nRaw == null || typeof nRaw !== "object") {
+              errors.push(`Template "${tName}" node "${nName}": must be an object`);
+              continue;
+            }
+            const n = nRaw;
+            if (typeof n.type !== "string" || !INNER_NODE_TYPES.has(n.type)) {
+              errors.push(`Template "${tName}" node "${nName}": invalid type`);
+            }
+            if (Array.isArray(n.deps)) {
+              for (const dep of n.deps) {
+                if (!innerNames.has(dep) && !paramSet.has(dep)) {
+                  errors.push(
+                    `Template "${tName}" node "${nName}": dep "${dep}" is not an inner node or param`
+                  );
+                }
+              }
+            }
+          }
+          if (typeof t.output !== "string") {
+            errors.push(`Template "${tName}": missing 'output' string`);
+          } else if (!t.nodes[t.output]) {
+            errors.push(`Template "${tName}": output "${t.output}" is not a declared node`);
+          }
+        }
+      }
+    }
+  }
+  for (const [name, raw] of Object.entries(s.nodes)) {
+    if (raw == null || typeof raw !== "object") {
+      errors.push(`Node "${name}": must be an object`);
+      continue;
+    }
+    const n = raw;
+    if (typeof n.type !== "string" || !VALID_NODE_TYPES2.has(n.type)) {
+      errors.push(
+        `Node "${name}": invalid type "${String(n.type)}" (expected: ${[...VALID_NODE_TYPES2].join(", ")})`
+      );
+      continue;
+    }
+    nodeTypes.set(name, n.type);
+    if (n.type === "template") {
+      if (typeof n.template !== "string" || !templateDefs.has(n.template)) {
+        errors.push(`Node "${name}": template "${String(n.template)}" not found in templates`);
+      } else {
+        if (n.bind == null || typeof n.bind !== "object" || Array.isArray(n.bind)) {
+          errors.push(`Node "${name}": template ref requires 'bind' object`);
+        } else {
+          const tmpl = templateDefs.get(n.template);
+          const bind = n.bind;
+          for (const param of tmpl.params) {
+            if (!(param in bind)) {
+              errors.push(
+                `Node "${name}": template param "${param}" is not bound (template "${n.template}")`
+              );
+            }
+          }
+          for (const [, target] of Object.entries(bind)) {
+            if (typeof target === "string" && !nodeNames.has(target)) {
+              errors.push(
+                `Node "${name}": bind target "${target}" does not reference an existing node`
+              );
+            }
+          }
+        }
+      }
+    } else {
+      if (Array.isArray(n.deps)) {
+        for (const dep of n.deps) {
+          if (dep === name) {
+            errors.push(`Node "${name}": self-referencing dep`);
+          } else if (!nodeNames.has(dep)) {
+            errors.push(`Node "${name}": dep "${dep}" does not reference an existing node`);
+          }
+        }
+      }
+      if ((n.type === "derived" || n.type === "effect" || n.type === "operator") && !Array.isArray(n.deps)) {
+        errors.push(`Node "${name}": ${n.type} node should have a 'deps' array`);
+      }
+    }
+  }
+  if (s.feedback != null) {
+    if (!Array.isArray(s.feedback)) {
+      errors.push("'feedback' must be an array");
+    } else {
+      for (let i = 0; i < s.feedback.length; i++) {
+        const edge = s.feedback[i];
+        if (edge == null || typeof edge !== "object") {
+          errors.push(`Feedback [${i}]: must be an object`);
+          continue;
+        }
+        const e = edge;
+        if (typeof e.from !== "string" || !nodeNames.has(e.from)) {
+          errors.push(
+            `Feedback [${i}]: 'from' "${String(e.from)}" does not reference an existing node`
+          );
+        }
+        if (typeof e.from === "string" && e.from === e.to) {
+          errors.push(`Feedback [${i}]: 'from' and 'to' must be different nodes`);
+        }
+        if (typeof e.to !== "string" || !nodeNames.has(e.to)) {
+          errors.push(
+            `Feedback [${i}]: 'to' "${String(e.to)}" does not reference an existing node`
+          );
+        } else if (typeof e.to === "string" && nodeTypes.get(e.to) !== "state") {
+          errors.push(
+            `Feedback [${i}]: 'to' node "${e.to}" must be a state node (got "${nodeTypes.get(e.to) ?? "unknown"}")`
+          );
+        }
+      }
+    }
+  }
+  return { valid: errors.length === 0, errors };
+}
+function compileSpec(spec, opts) {
+  const validation = validateSpec(spec);
+  if (!validation.valid) {
+    throw new Error(`compileSpec: invalid GraphSpec:
+${validation.errors.join("\n")}`);
+  }
+  const catalog = opts?.catalog ?? {};
+  const g = new Graph(spec.name);
+  const templates = spec.templates ?? {};
+  const created = /* @__PURE__ */ new Map();
+  const deferred = [];
+  for (const [name, raw] of Object.entries(spec.nodes)) {
+    if (raw.type === "template") continue;
+    const n = raw;
+    if (n.type === "state") {
+      const nd = state(n.initial, {
+        name,
+        meta: n.meta ? { ...n.meta } : void 0
+      });
+      g.add(name, nd);
+      created.set(name, nd);
+    } else if (n.type === "producer") {
+      const sourceFactory = n.source ? catalog.sources?.[n.source] : void 0;
+      const fnFactory = n.fn ? catalog.fns?.[n.fn] : void 0;
+      if (sourceFactory) {
+        const nd = sourceFactory(n.config ?? {});
+        g.add(name, nd);
+        created.set(name, nd);
+      } else if (fnFactory) {
+        const nd = fnFactory([], n.config ?? {});
+        g.add(name, nd);
+        created.set(name, nd);
+      } else {
+        const nd = producer(() => {
+        }, {
+          name,
+          meta: { ...n.meta, _specFn: n.fn, _specSource: n.source }
+        });
+        g.add(name, nd);
+        created.set(name, nd);
+      }
+    } else {
+      deferred.push([name, n]);
+    }
+  }
+  let progressed = true;
+  const pending = new Map(deferred);
+  while (pending.size > 0 && progressed) {
+    progressed = false;
+    for (const [name, n] of [...pending.entries()]) {
+      const deps = n.deps ?? [];
+      if (!deps.every((dep) => created.has(dep))) continue;
+      const resolvedDeps = deps.map((dep) => created.get(dep));
+      const fnFactory = n.fn ? catalog.fns?.[n.fn] : void 0;
+      let nd;
+      if (fnFactory) {
+        nd = fnFactory(resolvedDeps, n.config ?? {});
+      } else if (n.type === "effect") {
+        nd = effect(resolvedDeps, () => {
+        });
+      } else {
+        nd = derived(resolvedDeps, (vals) => vals[0]);
+      }
+      g.add(name, nd);
+      created.set(name, nd);
+      pending.delete(name);
+      progressed = true;
+    }
+  }
+  if (pending.size > 0) {
+    const unresolved = [...pending.keys()].sort().join(", ");
+    throw new Error(`compileSpec: unresolvable deps for nodes: ${unresolved}`);
+  }
+  for (const [name, raw] of Object.entries(spec.nodes)) {
+    if (raw.type !== "template") continue;
+    const ref = raw;
+    const tmpl = templates[ref.template];
+    const sub = new Graph(name);
+    const subCreated = /* @__PURE__ */ new Map();
+    const subDeferred = [];
+    for (const [nName, nSpec] of Object.entries(tmpl.nodes)) {
+      const resolvedDeps = (nSpec.deps ?? []).map((dep) => {
+        if (dep.startsWith("$") && ref.bind[dep]) {
+          return ref.bind[dep];
+        }
+        return dep;
+      });
+      const specWithResolvedDeps = { ...nSpec, deps: resolvedDeps };
+      if (nSpec.type === "state") {
+        const nd = state(nSpec.initial, {
+          name: nName,
+          meta: nSpec.meta ? { ...nSpec.meta } : void 0
+        });
+        sub.add(nName, nd);
+        subCreated.set(nName, nd);
+      } else if (nSpec.type === "producer") {
+        const sourceFactory = nSpec.source ? catalog.sources?.[nSpec.source] : void 0;
+        const fnFactory = nSpec.fn ? catalog.fns?.[nSpec.fn] : void 0;
+        if (sourceFactory) {
+          const nd = sourceFactory(nSpec.config ?? {});
+          sub.add(nName, nd);
+          subCreated.set(nName, nd);
+        } else if (fnFactory) {
+          const nd = fnFactory([], nSpec.config ?? {});
+          sub.add(nName, nd);
+          subCreated.set(nName, nd);
+        } else {
+          const nd = producer(() => {
+          }, {
+            name: nName,
+            meta: { ...nSpec.meta, _specFn: nSpec.fn, _specSource: nSpec.source }
+          });
+          sub.add(nName, nd);
+          subCreated.set(nName, nd);
+        }
+      } else {
+        subDeferred.push([nName, specWithResolvedDeps]);
+      }
+    }
+    let subProgressed = true;
+    const subPending = new Map(subDeferred);
+    while (subPending.size > 0 && subProgressed) {
+      subProgressed = false;
+      for (const [nName, nSpec] of [...subPending.entries()]) {
+        const deps = nSpec.deps ?? [];
+        const allReady = deps.every((dep) => subCreated.has(dep) || created.has(dep));
+        if (!allReady) continue;
+        const resolvedDeps = deps.map((dep) => subCreated.get(dep) ?? created.get(dep));
+        const fnFactory = nSpec.fn ? catalog.fns?.[nSpec.fn] : void 0;
+        let nd;
+        if (fnFactory) {
+          nd = fnFactory(resolvedDeps, nSpec.config ?? {});
+        } else if (nSpec.type === "effect") {
+          nd = effect(resolvedDeps, () => {
+          });
+        } else {
+          nd = derived(resolvedDeps, (vals) => vals[0]);
+        }
+        sub.add(nName, nd);
+        subCreated.set(nName, nd);
+        subPending.delete(nName);
+        subProgressed = true;
+      }
+    }
+    if (subPending.size > 0) {
+      const unresolved = [...subPending.keys()].sort().join(", ");
+      throw new Error(
+        `compileSpec: template "${ref.template}" has unresolvable deps: ${unresolved}`
+      );
+    }
+    g.mount(name, sub);
+    const outputPath = `${name}::${tmpl.output}`;
+    created.set(name, g.resolve(outputPath));
+    try {
+      const outputNode = g.resolve(outputPath);
+      outputNode.meta._templateName?.down([[DATA, ref.template]]);
+      outputNode.meta._templateBind?.down([[DATA, ref.bind]]);
+    } 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
+    });
+  }
+  return g;
+}
+var INTERNAL_META_KEYS = /* @__PURE__ */ new Set([
+  "reduction",
+  "reduction_type",
+  "_specFn",
+  "_specSource",
+  "_templateName",
+  "_templateBind",
+  "feedbackFrom",
+  "feedbackTo"
+]);
+function decompileGraph(graph) {
+  const desc = graph.describe({ detail: "standard" });
+  const nodes = {};
+  const feedbackEdges = [];
+  const metaSegment = `::${GRAPH_META_SEGMENT}::`;
+  const feedbackCounterPattern = /^__feedback_(.+)$/;
+  const feedbackConditions = /* @__PURE__ */ new Set();
+  for (const path of Object.keys(desc.nodes)) {
+    if (path.includes(metaSegment)) continue;
+    const match = feedbackCounterPattern.exec(path);
+    if (match) {
+      feedbackConditions.add(match[1]);
+      const meta = desc.nodes[path]?.meta;
+      if (meta?.feedbackFrom && meta?.feedbackTo) {
+        feedbackEdges.push({
+          from: meta.feedbackFrom,
+          to: meta.feedbackTo,
+          ...meta.maxIterations ? { maxIterations: meta.maxIterations } : {}
+        });
+      }
+    }
+  }
+  for (const [path, nodeDesc] of Object.entries(desc.nodes)) {
+    if (path.includes(metaSegment)) continue;
+    if (feedbackCounterPattern.test(path)) continue;
+    if (path.includes("::")) continue;
+    const specNode = {
+      type: nodeDesc.type
+    };
+    if (nodeDesc.deps.length > 0) {
+      specNode.deps = nodeDesc.deps.filter((d) => !d.includes("::"));
+    }
+    if (nodeDesc.type === "state" && nodeDesc.value !== void 0) {
+      specNode.initial = nodeDesc.value;
+    }
+    if (nodeDesc.meta && Object.keys(nodeDesc.meta).length > 0) {
+      const meta = {};
+      for (const [k, v] of Object.entries(nodeDesc.meta)) {
+        if (!INTERNAL_META_KEYS.has(k)) meta[k] = v;
+      }
+      if (Object.keys(meta).length > 0) {
+        specNode.meta = meta;
+      }
+    }
+    nodes[path] = specNode;
+  }
+  const templates = {};
+  const templateRefs = {};
+  const metaDetectedSubgraphs = /* @__PURE__ */ new Set();
+  for (const subName of desc.subgraphs) {
+    const prefix = `${subName}::`;
+    for (const [path, nodeDesc] of Object.entries(desc.nodes)) {
+      if (!path.startsWith(prefix)) continue;
+      if (path.includes(metaSegment)) continue;
+      const meta = nodeDesc.meta;
+      if (meta?._templateName && meta?._templateBind) {
+        const templateName = meta._templateName;
+        const bind = meta._templateBind;
+        if (!templates[templateName]) {
+          const tmplNodes = {};
+          const tmplInnerNames = /* @__PURE__ */ new Set();
+          const tmplPrefix = `${subName}::`;
+          for (const [p, nd] of Object.entries(desc.nodes)) {
+            if (!p.startsWith(tmplPrefix) || p.includes(metaSegment)) continue;
+            const localName = p.slice(tmplPrefix.length);
+            if (localName.includes("::")) continue;
+            tmplInnerNames.add(localName);
+            tmplNodes[localName] = {
+              type: nd.type,
+              ...nd.deps.length > 0 ? {
+                deps: nd.deps.map(
+                  (d) => d.startsWith(tmplPrefix) ? d.slice(tmplPrefix.length) : d
+                )
+              } : {}
+            };
+          }
+          const tmplParams = [];
+          const tmplParamMap = /* @__PURE__ */ new Map();
+          for (const n of Object.values(tmplNodes)) {
+            for (const dep of n.deps ?? []) {
+              if (!tmplInnerNames.has(dep) && !tmplParamMap.has(dep)) {
+                const param = `$${dep}`;
+                tmplParams.push(param);
+                tmplParamMap.set(dep, param);
+              }
+            }
+          }
+          for (const n of Object.values(tmplNodes)) {
+            if (n.deps) n.deps = n.deps.map((d) => tmplParamMap.get(d) ?? d);
+          }
+          const depended = /* @__PURE__ */ new Set();
+          for (const n of Object.values(tmplNodes)) {
+            for (const dep of n.deps ?? []) {
+              if (tmplInnerNames.has(dep)) depended.add(dep);
+            }
+          }
+          const outputCandidates = [...tmplInnerNames].filter((n) => !depended.has(n));
+          const tmplOutput = outputCandidates[0] ?? [...tmplInnerNames].pop();
+          templates[templateName] = { params: tmplParams, nodes: tmplNodes, output: tmplOutput };
+        }
+        delete nodes[subName];
+        templateRefs[subName] = { type: "template", template: templateName, bind };
+        metaDetectedSubgraphs.add(subName);
+        break;
+      }
+    }
+  }
+  const structureMap = /* @__PURE__ */ new Map();
+  for (const subName of desc.subgraphs) {
+    if (metaDetectedSubgraphs.has(subName)) continue;
+    const subNodes = {};
+    const prefix = `${subName}::`;
+    for (const [path, nodeDesc] of Object.entries(desc.nodes)) {
+      if (path.includes(metaSegment)) continue;
+      if (!path.startsWith(prefix)) continue;
+      const localName = path.slice(prefix.length);
+      if (localName.includes("::")) continue;
+      subNodes[localName] = {
+        type: nodeDesc.type,
+        ...nodeDesc.deps.length > 0 ? {
+          deps: nodeDesc.deps.map((d) => d.startsWith(prefix) ? d.slice(prefix.length) : d)
+        } : {}
+      };
+    }
+    const fingerprint = JSON.stringify(
+      Object.fromEntries(
+        Object.entries(subNodes).sort(([a], [b]) => a.localeCompare(b)).map(([k, v]) => [k, { type: v.type, deps: v.deps ?? [] }])
+      )
+    );
+    if (!structureMap.has(fingerprint)) {
+      structureMap.set(fingerprint, []);
+    }
+    structureMap.get(fingerprint).push({ name: subName, nodes: subNodes });
+  }
+  for (const [, group] of structureMap) {
+    if (group.length < 2) continue;
+    const templateName = `${group[0].name}_template`;
+    const refNodes = group[0].nodes;
+    const innerNames = new Set(Object.keys(refNodes));
+    const params = [];
+    const baseParamMap = /* @__PURE__ */ new Map();
+    for (const n of Object.values(refNodes)) {
+      for (const dep of n.deps ?? []) {
+        if (!innerNames.has(dep) && !baseParamMap.has(dep)) {
+          const param = `$${dep}`;
+          params.push(param);
+          baseParamMap.set(dep, param);
+        }
+      }
+    }
+    const depended = /* @__PURE__ */ new Set();
+    for (const n of Object.values(refNodes)) {
+      for (const dep of n.deps ?? []) {
+        if (innerNames.has(dep)) depended.add(dep);
+      }
+    }
+    const outputCandidates = [...innerNames].filter((n) => !depended.has(n));
+    const output = outputCandidates[0] ?? [...innerNames].pop();
+    const tmplNodes = {};
+    for (const [nName, nSpec] of Object.entries(refNodes)) {
+      tmplNodes[nName] = {
+        ...nSpec,
+        deps: nSpec.deps?.map((d) => baseParamMap.get(d) ?? d)
+      };
+    }
+    templates[templateName] = { params, nodes: tmplNodes, output };
+    for (const member of group) {
+      delete nodes[member.name];
+      const memberBind = {};
+      const memberInnerNames = new Set(Object.keys(member.nodes));
+      for (const n of Object.values(member.nodes)) {
+        for (const dep of n.deps ?? []) {
+          if (!memberInnerNames.has(dep)) {
+            const param = baseParamMap.get(dep) ?? `$${dep}`;
+            memberBind[param] = dep;
+          }
+        }
+      }
+      templateRefs[member.name] = {
+        type: "template",
+        template: templateName,
+        bind: memberBind
+      };
+    }
+  }
+  const allNodes = {
+    ...nodes,
+    ...templateRefs
+  };
+  const result = { name: desc.name, nodes: allNodes };
+  if (Object.keys(templates).length > 0) result.templates = templates;
+  if (feedbackEdges.length > 0) result.feedback = feedbackEdges;
+  return result;
+}
+function specDiff(specA, specB) {
+  const entries = [];
+  if (specA.name !== specB.name) {
+    entries.push({
+      type: "changed",
+      path: "name",
+      detail: `"${specA.name}" \u2192 "${specB.name}"`
+    });
+  }
+  const nodesA = new Set(Object.keys(specA.nodes));
+  const nodesB = new Set(Object.keys(specB.nodes));
+  for (const name of nodesB) {
+    if (!nodesA.has(name)) {
+      const n = specB.nodes[name];
+      entries.push({
+        type: "added",
+        path: `nodes.${name}`,
+        detail: `type: ${n.type}`
+      });
+    }
+  }
+  for (const name of nodesA) {
+    if (!nodesB.has(name)) {
+      entries.push({ type: "removed", path: `nodes.${name}` });
+    }
+  }
+  for (const name of nodesA) {
+    if (!nodesB.has(name)) continue;
+    const a = specA.nodes[name];
+    const b = specB.nodes[name];
+    if (JSON.stringify(a) !== JSON.stringify(b)) {
+      const details = [];
+      if (a.type !== b.type) details.push(`type: ${a.type} \u2192 ${b.type}`);
+      if (JSON.stringify(a.deps) !== JSON.stringify(b.deps)) {
+        details.push("deps changed");
+      }
+      if (a.fn !== b.fn) {
+        details.push(`fn: ${a.fn} \u2192 ${b.fn}`);
+      }
+      if (JSON.stringify(a.config) !== JSON.stringify(b.config)) {
+        details.push("config changed");
+      }
+      entries.push({
+        type: "changed",
+        path: `nodes.${name}`,
+        detail: details.join("; ") || "modified"
+      });
+    }
+  }
+  const tmplA = specA.templates ?? {};
+  const tmplB = specB.templates ?? {};
+  const tmplNamesA = new Set(Object.keys(tmplA));
+  const tmplNamesB = new Set(Object.keys(tmplB));
+  for (const name of tmplNamesB) {
+    if (!tmplNamesA.has(name)) {
+      entries.push({ type: "added", path: `templates.${name}` });
+    }
+  }
+  for (const name of tmplNamesA) {
+    if (!tmplNamesB.has(name)) {
+      entries.push({ type: "removed", path: `templates.${name}` });
+    }
+  }
+  for (const name of tmplNamesA) {
+    if (!tmplNamesB.has(name)) continue;
+    if (JSON.stringify(tmplA[name]) !== JSON.stringify(tmplB[name])) {
+      entries.push({
+        type: "changed",
+        path: `templates.${name}`,
+        detail: "template definition changed"
+      });
+    }
+  }
+  const fbA = specA.feedback ?? [];
+  const fbB = specB.feedback ?? [];
+  const fbKeyA = new Set(fbA.map((e) => `${e.from}->${e.to}`));
+  const fbKeyB = new Set(fbB.map((e) => `${e.from}->${e.to}`));
+  for (const fb of fbB) {
+    const key = `${fb.from}->${fb.to}`;
+    if (!fbKeyA.has(key)) {
+      entries.push({
+        type: "added",
+        path: `feedback.${key}`,
+        detail: `maxIterations: ${fb.maxIterations ?? 10}`
+      });
+    }
+  }
+  for (const fb of fbA) {
+    const key = `${fb.from}->${fb.to}`;
+    if (!fbKeyB.has(key)) {
+      entries.push({ type: "removed", path: `feedback.${key}` });
+    }
+  }
+  for (const fb of fbA) {
+    const key = `${fb.from}->${fb.to}`;
+    const counterpart = fbB.find((b) => b.from === fb.from && b.to === fb.to);
+    if (counterpart && JSON.stringify(fb) !== JSON.stringify(counterpart)) {
+      entries.push({
+        type: "changed",
+        path: `feedback.${key}`,
+        detail: `maxIterations: ${fb.maxIterations ?? 10} \u2192 ${counterpart.maxIterations ?? 10}`
+      });
+    }
+  }
+  const added = entries.filter((e) => e.type === "added").length;
+  const removed = entries.filter((e) => e.type === "removed").length;
+  const changed = entries.filter((e) => e.type === "changed").length;
+  const parts = [];
+  if (added) parts.push(`${added} added`);
+  if (removed) parts.push(`${removed} removed`);
+  if (changed) parts.push(`${changed} changed`);
+  const summary = parts.length > 0 ? parts.join(", ") : "no changes";
+  return { entries, summary };
+}
+var LLM_COMPOSE_SYSTEM_PROMPT = `You are a graph architect for GraphReFly, a reactive graph protocol.
+
+Given a natural-language description, produce a JSON GraphSpec with this structure:
+
+{
+  "name": "<graph_name>",
+  "nodes": {
+    "<node_name>": {
+      "type": "state" | "derived" | "producer" | "effect" | "operator",
+      "deps": ["<dep_node_name>", ...],
+      "fn": "<catalog_function_name>",
+      "source": "<catalog_source_name>",
+      "config": { ... },
+      "initial": <value>,
+      "meta": { "description": "<purpose>" }
+    },
+    "<template_instance>": {
+      "type": "template",
+      "template": "<template_name>",
+      "bind": { "$param": "node_name" }
+    }
+  },
+  "templates": {
+    "<template_name>": {
+      "params": ["$param1", "$param2"],
+      "nodes": { ... },
+      "output": "<output_node>"
+    }
+  },
+  "feedback": [
+    { "from": "<condition_node>", "to": "<state_node>", "maxIterations": 10 }
+  ]
+}
+
+Rules:
+- "state" nodes hold user/LLM-writable values (knobs). Use "initial" for default values.
+- "derived" nodes compute from deps using a named "fn".
+- "effect" nodes produce side effects from deps.
+- "producer" nodes generate values from a named "source".
+- Use "templates" when the same subgraph pattern repeats (e.g., per-source resilience).
+- Use "feedback" for bounded cycles where a derived value writes back to a state node.
+- meta.description is required for every node.
+- Return ONLY valid JSON, no markdown fences or commentary.`;
+function stripFences2(text) {
+  const match = text.match(/^```(?:json)?\s*([\s\S]*?)\s*```[\s\S]*$/);
+  return match ? match[1] : text;
+}
+async function llmCompose(problem, adapter, opts) {
+  let systemPrompt = LLM_COMPOSE_SYSTEM_PROMPT;
+  if (opts?.catalogDescription) {
+    systemPrompt += `
+
+Available catalog:
+${opts.catalogDescription}`;
+  }
+  if (opts?.systemPromptExtra) {
+    systemPrompt += `
+
+${opts.systemPromptExtra}`;
+  }
+  const messages = [
+    { role: "system", content: systemPrompt },
+    { role: "user", content: problem }
+  ];
+  const rawResult = adapter.invoke(messages, {
+    model: opts?.model,
+    temperature: opts?.temperature ?? 0,
+    maxTokens: opts?.maxTokens
+  });
+  const response = await rawResult;
+  let content = response.content.trim();
+  if (content.startsWith("```")) {
+    content = stripFences2(content);
+  }
+  let parsed;
+  try {
+    parsed = JSON.parse(content);
+  } catch {
+    throw new Error(`llmCompose: LLM response is not valid JSON: ${content.slice(0, 200)}`);
+  }
+  const validation = validateSpec(parsed);
+  if (!validation.valid) {
+    throw new Error(`llmCompose: invalid GraphSpec:
+${validation.errors.join("\n")}`);
+  }
+  return parsed;
+}
+async function llmRefine(currentSpec, feedback2, adapter, opts) {
+  let systemPrompt = LLM_COMPOSE_SYSTEM_PROMPT;
+  if (opts?.catalogDescription) {
+    systemPrompt += `
+
+Available catalog:
+${opts.catalogDescription}`;
+  }
+  if (opts?.systemPromptExtra) {
+    systemPrompt += `
+
+${opts.systemPromptExtra}`;
+  }
+  const messages = [
+    { role: "system", content: systemPrompt },
+    {
+      role: "user",
+      content: `Current GraphSpec:
+${JSON.stringify(currentSpec, null, 2)}
+
+Modification request: ${feedback2}
+
+Return the complete modified GraphSpec as JSON.`
+    }
+  ];
+  const rawResult = adapter.invoke(messages, {
+    model: opts?.model,
+    temperature: opts?.temperature ?? 0,
+    maxTokens: opts?.maxTokens
+  });
+  const response = await rawResult;
+  let content = response.content.trim();
+  if (content.startsWith("```")) {
+    content = stripFences2(content);
+  }
+  let parsed;
+  try {
+    parsed = JSON.parse(content);
+  } catch {
+    throw new Error(`llmRefine: LLM response is not valid JSON: ${content.slice(0, 200)}`);
+  }
+  const validation = validateSpec(parsed);
+  if (!validation.valid) {
+    throw new Error(`llmRefine: invalid GraphSpec:
+${validation.errors.join("\n")}`);
+  }
+  return parsed;
+}
+
 // src/patterns/messaging.ts
 var messaging_exports = {};
 __export(messaging_exports, {
@@ -3471,7 +4590,7 @@ function registerStep(graph, name, step, depPaths) {
     graph.connect(path, name);
   }
 }
-function baseMeta(kind, meta) {
+function baseMeta2(kind, meta) {
   return {
     orchestration: true,
     orchestration_type: kind,
@@ -3509,7 +4628,7 @@ function task(graph, name, run, opts) {
       ...nodeOpts,
       name,
       describeKind: "derived",
-      meta: baseMeta("task", opts?.meta)
+      meta: baseMeta2("task", opts?.meta)
     }
   );
   registerStep(
@@ -3532,7 +4651,7 @@ function branch(graph, name, source, predicate, opts) {
       ...opts,
       name,
       describeKind: "derived",
-      meta: baseMeta("branch", opts?.meta)
+      meta: baseMeta2("branch", opts?.meta)
     }
   );
   registerStep(graph, name, step, src.path ? [src.path] : []);
@@ -3555,7 +4674,7 @@ function gate2(graph, name, source, control, opts) {
       ...opts,
       name,
       describeKind: "operator",
-      meta: baseMeta("gate", opts?.meta)
+      meta: baseMeta2("gate", opts?.meta)
     }
   );
   registerStep(
@@ -3583,7 +4702,7 @@ function approval(graph, name, source, approver, opts) {
       ...opts,
       name,
       describeKind: "operator",
-      meta: baseMeta("approval", opts?.meta)
+      meta: baseMeta2("approval", opts?.meta)
     }
   );
   registerStep(
@@ -3602,7 +4721,7 @@ function forEach2(graph, name, source, run, opts) {
     name,
     describeKind: "effect",
     completeWhenDepsComplete: false,
-    meta: baseMeta("forEach", opts?.meta),
+    meta: baseMeta2("forEach", opts?.meta),
     onMessage(msg, depIndex, actions) {
       if (terminated) return true;
       if (depIndex !== 0) {
@@ -3637,7 +4756,7 @@ function join(graph, name, deps, opts) {
       ...opts,
       name,
       describeKind: "derived",
-      meta: baseMeta("join", opts?.meta)
+      meta: baseMeta2("join", opts?.meta)
     }
   );
   registerStep(
@@ -3668,7 +4787,7 @@ function loop(graph, name, source, iterate, opts) {
       ...opts,
       name,
       describeKind: "derived",
-      meta: baseMeta("loop", opts?.meta)
+      meta: baseMeta2("loop", opts?.meta)
     }
   );
   registerStep(
@@ -3693,7 +4812,7 @@ function sensor(graph, name, initial, opts) {
     name,
     initial,
     describeKind: "producer",
-    meta: baseMeta("sensor", opts?.meta)
+    meta: baseMeta2("sensor", opts?.meta)
   });
   registerStep(graph, name, source, []);
   return {
@@ -3731,7 +4850,7 @@ function wait(graph, name, source, ms, opts) {
       initial: src.node.get(),
       describeKind: "operator",
       completeWhenDepsComplete: false,
-      meta: baseMeta("wait", opts?.meta),
+      meta: baseMeta2("wait", opts?.meta),
       onMessage(msg, depIndex, actions) {
         if (terminated) return true;
         if (depIndex !== 0) {
@@ -3781,7 +4900,7 @@ function onFailure(graph, name, source, recover, opts) {
     name,
     describeKind: "operator",
     completeWhenDepsComplete: false,
-    meta: baseMeta("onFailure", opts?.meta),
+    meta: baseMeta2("onFailure", opts?.meta),
     onMessage(msg, _depIndex, actions) {
       if (terminated) return true;
       if (msg[0] === ERROR) {
@@ -3920,6 +5039,7 @@ export {
   gate,
   globToRegExp,
   graph_exports as graph,
+  graphspec_exports as graphspec,
   interval,
   isBatching,
   isKnownMessageType,
@@ -3977,6 +5097,7 @@ export {
   reactiveLog,
   reactiveMap,
   reduce,
+  reduction_exports as reduction,
   repeat,
   replay,
   replayWAL,