@bian-womp/spark-graph 0.2.34 → 0.2.35

package/lib/cjs/src/runtime/GraphRuntime.d.ts

@@ -31,6 +31,7 @@ export declare class GraphRuntime {
     private static buildEdgeConverters;
     private scheduleInputsChanged;
     private allInboundHaveValue;
+    private getEffectiveInputs;
     private invalidateDownstream;
     private propagate;
     private static computeResolvedHandleMap;

package/lib/cjs/src/runtime/GraphRuntime.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GraphRuntime.d.ts","sourceRoot":"","sources":["../../../../src/runtime/GraphRuntime.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,YAAY,EACZ,iBAAiB,EACjB,YAAY,EACZ,YAAY,EACZ,eAAe,EACf,eAAe,EAIhB,MAAM,2BAA2B,CAAC;AACnC,OAAO,KAAK,EAIV,gBAAgB,EACjB,MAAM,eAAe,CAAC;AAQvB,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAE/C,MAAM,MAAM,oBAAoB,CAAC,CAAC,SAAS,gBAAgB,IAAI,CAC7D,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,KAClB,IAAI,CAAC;AAUV,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,YAAY,GAAG,OAAO,GAAG,OAAO,CAAC;AAE1E,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,YAAY,CAAC;IACpB,UAAU,EAAE,iBAAiB,CAAC;IAC9B,KAAK,EAAE,YAAY,CAAC;IACpB,KAAK,EAAE,YAAY,CAAC;CACrB;AA+BD,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,KAAK,CAAqB;IAElC,OAAO,CAAC,QAAQ,CAAC,CAAW;IAE5B,OAAO,CAAC,cAAc,CAAsC;IAC5D,OAAO,CAAC,SAAS,CAGb;IACJ,OAAO,CAAC,WAAW,CAA+B;IAElD,OAAO,CAAC,oBAAoB,CAA6B;IACzD,OAAO,CAAC,MAAM,CAAS;IAIvB,OAAO,CAAC,iBAAiB,CAGrB;IAGJ,OAAO,CAAC,WAAW;IAanB,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,eAAe,EACpB,QAAQ,EAAE,QAAQ,EAClB,IAAI,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,GAC/C,YAAY;IA4Ff,EAAE,CAAC,CAAC,SAAS,gBAAgB,EAC3B,KAAK,EAAE,CAAC,EACR,OAAO,EAAE,oBAAoB,CAAC,CAAC,CAAC,GAC/B,MAAM,IAAI;IAOb,OAAO,CAAC,IAAI;IAQZ,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAI9D,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IA4BhE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAKlD,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAuFlC,OAAO,CAAC,qBAAqB;IAwJ7B,OAAO,CAAC,mBAAmB;IAW3B,OAAO,CAAC,oBAAoB;IAQ5B,OAAO,CAAC,SAAS;IA0JjB,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAuDvC,OAAO,CAAC,MAAM,CAAC,UAAU;IAgDzB,OAAO,CAAC,iBAAiB;IASzB,iBAAiB,CACf,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,eAAe,EACxB,QAAQ,EAAE,QAAQ,GACjB,IAAI;IAsDP,MAAM,CAAC,UAAU,UAAQ,GAAG,IAAI;IAiChC,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAgCrD,OAAO,IAAI,IAAI;IAef,UAAU,IAAI,MAAM,EAAE;IAKtB,WAAW,CAAC,MAAM,EAAE,MAAM,GACtB;QACE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAChC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjC,KAAK,EAAE,OAAO,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjC,KAAK,CAAC,EAAE,gBAAgB,CAAC;KAC1B,GACD,SAAS;IAYb,cAAc,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAIzC,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IASlD,WAAW,IAAI,eAAe;IAuCxB,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAkB/B,KAAK,IAAI,IAAI;IAIb,MAAM,IAAI,IAAI;IAId,6BAA6B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAInD,8BAA8B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAKpD,OAAO,CACL,OAAO,EAAE;QACP,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QACjD,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;KACnD,EACD,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAA;KAAE,GAC1B,IAAI;IAsEP,MAAM,CAAC,GAAG,EAAE,eAAe,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAqRtD,OAAO,CAAC,wBAAwB;YAWlB,uBAAuB;CA0DtC"}
+{"version":3,"file":"GraphRuntime.d.ts","sourceRoot":"","sources":["../../../../src/runtime/GraphRuntime.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,YAAY,EACZ,iBAAiB,EACjB,YAAY,EACZ,YAAY,EACZ,eAAe,EACf,eAAe,EAIhB,MAAM,2BAA2B,CAAC;AACnC,OAAO,KAAK,EAIV,gBAAgB,EACjB,MAAM,eAAe,CAAC;AAQvB,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAE/C,MAAM,MAAM,oBAAoB,CAAC,CAAC,SAAS,gBAAgB,IAAI,CAC7D,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,KAClB,IAAI,CAAC;AAUV,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,YAAY,GAAG,OAAO,GAAG,OAAO,CAAC;AAE1E,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,YAAY,CAAC;IACpB,UAAU,EAAE,iBAAiB,CAAC;IAC9B,KAAK,EAAE,YAAY,CAAC;IACpB,KAAK,EAAE,YAAY,CAAC;CACrB;AA+BD,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,KAAK,CAAqB;IAElC,OAAO,CAAC,QAAQ,CAAC,CAAW;IAE5B,OAAO,CAAC,cAAc,CAAsC;IAC5D,OAAO,CAAC,SAAS,CAGb;IACJ,OAAO,CAAC,WAAW,CAA+B;IAElD,OAAO,CAAC,oBAAoB,CAA6B;IACzD,OAAO,CAAC,MAAM,CAAS;IAIvB,OAAO,CAAC,iBAAiB,CAGrB;IAGJ,OAAO,CAAC,WAAW;IAanB,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,eAAe,EACpB,QAAQ,EAAE,QAAQ,EAClB,IAAI,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,GAC/C,YAAY;IA6Df,EAAE,CAAC,CAAC,SAAS,gBAAgB,EAC3B,KAAK,EAAE,CAAC,EACR,OAAO,EAAE,oBAAoB,CAAC,CAAC,CAAC,GAC/B,MAAM,IAAI;IAOb,OAAO,CAAC,IAAI;IAQZ,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAI9D,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IA4BhE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAKlD,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAuFlC,OAAO,CAAC,qBAAqB;IA2J7B,OAAO,CAAC,mBAAmB;IAe3B,OAAO,CAAC,kBAAkB;IA0D1B,OAAO,CAAC,oBAAoB;IAQ5B,OAAO,CAAC,SAAS;IA0JjB,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAuDvC,OAAO,CAAC,MAAM,CAAC,UAAU;IAgDzB,OAAO,CAAC,iBAAiB;IASzB,iBAAiB,CACf,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,eAAe,EACxB,QAAQ,EAAE,QAAQ,GACjB,IAAI;IAsDP,MAAM,CAAC,UAAU,UAAQ,GAAG,IAAI;IAkChC,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAiCrD,OAAO,IAAI,IAAI;IAef,UAAU,IAAI,MAAM,EAAE;IAKtB,WAAW,CAAC,MAAM,EAAE,MAAM,GACtB;QACE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAChC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjC,KAAK,EAAE,OAAO,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjC,KAAK,CAAC,EAAE,gBAAgB,CAAC;KAC1B,GACD,SAAS;IAYb,cAAc,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAIzC,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IASlD,WAAW,IAAI,eAAe;IAuCxB,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAkB/B,KAAK,IAAI,IAAI;IAIb,MAAM,IAAI,IAAI;IAId,6BAA6B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAInD,8BAA8B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAKpD,OAAO,CACL,OAAO,EAAE;QACP,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QACjD,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;KACnD,EACD,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAA;KAAE,GAC1B,IAAI;IAsEP,MAAM,CAAC,GAAG,EAAE,eAAe,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAoOtD,OAAO,CAAC,wBAAwB;YAWlB,uBAAuB;CAoCtC"}

package/lib/esm/index.js

@@ -483,41 +483,12 @@ class GraphRuntime {
                     queued: 0,
                     progress: 0,
                 },
+                initialInputs: n.initialInputs ?? {},
             };
             gr.nodes.set(n.nodeId, rn);
         }
         // Instantiate edges
         gr.edges = GraphRuntime.buildEdges(def, registry, gr.resolvedByNode);
-        // After nodes and edges exist, seed registry-, dynamic- and graph-level defaults
-        for (const n of def.nodes) {
-            const node = gr.nodes.get(n.nodeId);
-            const desc = registry.nodes.get(n.typeId);
-            if (!node || !desc)
-                continue;
-            // Resolve registry-level defaults and dynamic (resolved) defaults
-            const regDefaults = desc.inputDefaults ?? {};
-            const dynDefaults = gr.resolvedByNode.get(n.nodeId)?.inputDefaults ?? {};
-            const graphDefaults = n.initialInputs ?? {};
-            // Apply precedence: graph-level overrides dynamic, which overrides registry-level
-            const merged = {
-                ...regDefaults,
-                ...dynDefaults,
-                ...graphDefaults,
-            };
-            for (const [handle, value] of Object.entries(merged)) {
-                // Only seed if input has no inbound wiring
-                const hasInbound = gr.edges.some((e) => e.target.nodeId === n.nodeId && e.target.handle === handle);
-                if (hasInbound)
-                    continue;
-                if (value === undefined)
-                    continue;
-                // Clone to avoid accidental shared references
-                node.inputs[handle] =
-                    typeof structuredClone === "function"
-                        ? structuredClone(value)
-                        : JSON.parse(JSON.stringify(value));
-            }
-        }
         // Schedule async recompute only for nodes that indicated Promise-based resolveHandles
         for (const nodeId of initial.pending)
             gr.scheduleRecomputeHandles(nodeId);
@@ -641,6 +612,8 @@ class GraphRuntime {
             return;
         const now = Date.now();
         const policy = node.policy ?? {};
+        // Compute effective inputs (real inputs + defaults) for this execution
+        const effectiveInputs = this.getEffectiveInputs(nodeId);
         if (policy.debounceMs &&
             node.lastScheduledAt &&
             now - node.lastScheduledAt < policy.debounceMs) {
@@ -648,7 +621,7 @@ class GraphRuntime {
             node.queue.splice(0, node.queue.length);
             node.runSeq += 1;
             const rid = `${nodeId}:${node.runSeq}:${now}`;
-            node.queue.push({ runId: rid, inputs: { ...node.inputs } });
+            node.queue.push({ runId: rid, inputs: effectiveInputs });
             return;
         }
         node.lastScheduledAt = now;
@@ -754,7 +727,7 @@ class GraphRuntime {
             return;
         if (mode === "queue") {
             const maxQ = policy.maxQueue ?? 8;
-            node.queue.push({ runId: rid, inputs: { ...node.inputs } });
+            node.queue.push({ runId: rid, inputs: effectiveInputs });
             if (node.queue.length > maxQ)
                 node.queue.shift();
             const processNext = () => {
@@ -773,7 +746,7 @@ class GraphRuntime {
             return;
         }
         // switch or merge
-        startRun(rid, { ...node.inputs });
+        startRun(rid, effectiveInputs);
     }
     // Returns true if all inbound handles for the node currently have a value
     allInboundHaveValue(nodeId) {
@@ -789,6 +762,62 @@ class GraphRuntime {
         }
         return true;
     }
+    // Computes effective inputs for a node by merging real inputs with defaults
+    // Defaults are applied only for unbound handles that have no explicit value
+    // This method does NOT mutate node.inputs - defaults remain virtual
+    // Dynamic handles (from resolveHandles) do NOT get defaults applied - they are metadata-only
+    getEffectiveInputs(nodeId) {
+        const node = this.nodes.get(nodeId);
+        if (!node)
+            return {};
+        const registry = this.registry;
+        if (!registry)
+            return {};
+        const desc = registry.nodes.get(node.typeId);
+        if (!desc)
+            return {};
+        const resolved = this.resolvedByNode.get(nodeId);
+        const regDefaults = desc.inputDefaults ?? {};
+        const dynDefaults = resolved?.inputDefaults ?? {};
+        const graphDefaults = node.initialInputs ?? {};
+        // Identify which handles are dynamically resolved (not in registry statics)
+        // Dynamic handles are metadata-only and should not receive defaults in execution
+        const staticHandles = new Set(Object.keys(desc.inputs ?? {}));
+        const dynamicHandles = new Set(Object.keys(resolved?.inputs ?? {}).filter((h) => !staticHandles.has(h)));
+        // Precedence: graph > dynamic > registry
+        const mergedDefaults = {
+            ...regDefaults,
+            ...dynDefaults,
+            ...graphDefaults,
+        };
+        // Start with real inputs only (no defaults)
+        const effective = { ...node.inputs };
+        // Build set of inbound handles (wired inputs)
+        const inbound = new Set(this.edges
+            .filter((e) => e.target.nodeId === nodeId)
+            .map((e) => e.target.handle));
+        // Apply defaults only for:
+        // 1. Unbound handles that have no explicit value
+        // 2. Static handles (not dynamically resolved)
+        // This prevents dynamic handles (like geo:*) from getting defaults in execution
+        // Dynamic handles are metadata-only for UI display, not execution values
+        for (const [handle, defaultValue] of Object.entries(mergedDefaults)) {
+            if (defaultValue === undefined)
+                continue;
+            if (inbound.has(handle))
+                continue; // Don't override wired inputs
+            if (effective[handle] !== undefined)
+                continue; // Already has value
+            if (dynamicHandles.has(handle))
+                continue; // Skip defaults for dynamic handles
+            // Clone to avoid shared references
+            effective[handle] =
+                typeof structuredClone === "function"
+                    ? structuredClone(defaultValue)
+                    : JSON.parse(JSON.stringify(defaultValue));
+        }
+        return effective;
+    }
     invalidateDownstream(nodeId) {
         // Notifies dependents; for now we propagate current outputs
         for (const e of this.edges.filter((e) => e.source.nodeId === nodeId)) {
@@ -1090,12 +1119,13 @@ class GraphRuntime {
         // call onActivated for nodes that implement it
         for (const node of this.nodes.values()) {
             const ctrl = new AbortController();
+            const effectiveInputs = this.getEffectiveInputs(node.nodeId);
             const ctx = {
                 state: node.state,
                 setState: (next) => Object.assign(node.state, next),
                 emit: (handle, value) => this.propagate(node.nodeId, handle, value),
                 invalidateDownstream: () => this.invalidateDownstream(node.nodeId),
-                getInput: (handle) => node.inputs[handle],
+                getInput: (handle) => effectiveInputs[handle],
                 environment: this.environment,
                 runId: `${node.nodeId}:activation`,
                 abortSignal: ctrl.signal,
@@ -1123,12 +1153,13 @@ class GraphRuntime {
         if (!node)
             return;
         const ctrl = new AbortController();
+        const effectiveInputs = this.getEffectiveInputs(nodeId);
         const ctx = {
             state: node.state,
             setState: (next) => Object.assign(node.state, next),
             emit: (handle, value) => this.propagate(nodeId, handle, value),
             invalidateDownstream: () => this.invalidateDownstream(nodeId),
-            getInput: (handle) => node.inputs[handle],
+            getInput: (handle) => effectiveInputs[handle],
             environment: this.environment,
             runId: `${nodeId}:external`,
             abortSignal: ctrl.signal,
@@ -1385,16 +1416,18 @@ class GraphRuntime {
                         queued: 0,
                         progress: 0,
                     },
+                    initialInputs: n.initialInputs ?? {},
                 };
                 this.nodes.set(n.nodeId, rn);
                 // Activate new node
                 const ctrl = new AbortController();
+                const effectiveInputs = this.getEffectiveInputs(rn.nodeId);
                 const ctx = {
                     state: rn.state,
                     setState: (next) => Object.assign(rn.state, next),
                     emit: (handle, value) => this.propagate(rn.nodeId, handle, value),
                     invalidateDownstream: () => this.invalidateDownstream(rn.nodeId),
-                    getInput: (handle) => rn.inputs[handle],
+                    getInput: (handle) => effectiveInputs[handle],
                     environment: this.environment,
                     runId: `${rn.nodeId}:activation`,
                     abortSignal: ctrl.signal,
@@ -1407,8 +1440,9 @@ class GraphRuntime {
                 rn.runtime.onActivated?.(ctx);
             }
             else {
-                // update params/policy
+                // update params/policy and initialInputs
                 existing.params = n.params;
+                existing.initialInputs = n.initialInputs ?? {};
                 if (!existing.stats) {
                     existing.stats = {
                         runs: 0,
@@ -1462,32 +1496,7 @@ class GraphRuntime {
                     }
                 }
             }
-            // If input lost inbound, try to re-seed from defaults
             if (changed) {
-                const defNode = def.nodes.find((n) => n.nodeId === nodeId);
-                if (defNode) {
-                    const desc = registry.nodes.get(defNode.typeId);
-                    if (desc) {
-                        const regDefaults = desc.inputDefaults ?? {};
-                        const dynDefaults = this.resolvedByNode.get(defNode.nodeId)?.inputDefaults ?? {};
-                        const graphDefaults = defNode.initialInputs ?? {};
-                        const merged = {
-                            ...regDefaults,
-                            ...dynDefaults,
-                            ...graphDefaults,
-                        };
-                        for (const h of Array.from(prevSet)) {
-                            if (!currSet.has(h) && node.inputs[h] === undefined) {
-                                const v = merged[h];
-                                if (v !== undefined)
-                                    node.inputs[h] =
-                                        typeof structuredClone === "function"
-                                            ? structuredClone(v)
-                                            : JSON.parse(JSON.stringify(v));
-                            }
-                        }
-                    }
-                }
                 // Clear buckets for handles that lost inbound
                 const bucketsForNode = this.arrayInputBuckets.get(nodeId);
                 if (bucketsForNode) {
@@ -1545,34 +1554,6 @@ class GraphRuntime {
                 }
             }
         }
-        // Seed defaults for nodes (new or existing) where inputs are still undefined and not inbound
-        for (const n of def.nodes) {
-            const node = this.nodes.get(n.nodeId);
-            const desc = registry.nodes.get(n.typeId);
-            if (!node || !desc)
-                continue;
-            const regDefaults = desc.inputDefaults ?? {};
-            const dynDefaults = this.resolvedByNode.get(n.nodeId)?.inputDefaults ?? {};
-            const graphDefaults = n.initialInputs ?? {};
-            const merged = {
-                ...regDefaults,
-                ...dynDefaults,
-                ...graphDefaults,
-            };
-            const inboundSet = nextInbound.get(n.nodeId) ?? new Set();
-            for (const [handle, value] of Object.entries(merged)) {
-                if (value === undefined)
-                    continue;
-                if (inboundSet.has(handle))
-                    continue;
-                if (node.inputs[handle] !== undefined)
-                    continue;
-                node.inputs[handle] =
-                    typeof structuredClone === "function"
-                        ? structuredClone(value)
-                        : JSON.parse(JSON.stringify(value));
-            }
-        }
         // Prune array bucket contributions for edges that no longer exist
         const validPerTarget = new Map();
         for (const ed of this.edges) {
@@ -1651,30 +1632,6 @@ class GraphRuntime {
             return;
         this.resolvedByNode.set(nodeId, next);
         this.updateNodeHandles(nodeId, next, registry);
-        // Seed defaults for newly introduced inputs that are not inbound
-        const inbound = this.edges
-            .filter((e) => e.target.nodeId === nodeId)
-            .map((e) => e.target.handle);
-        for (const [handle, value] of Object.entries(inputDefaults)) {
-            if (value === undefined)
-                continue;
-            if (inbound.includes(handle))
-                continue;
-            if (node.inputs[handle] === undefined) {
-                node.inputs[handle] =
-                    typeof structuredClone === "function"
-                        ? structuredClone(value)
-                        : JSON.parse(JSON.stringify(value));
-                // Emit input value event for seeded defaults
-                this.emit("value", {
-                    nodeId,
-                    handle,
-                    value: node.inputs[handle],
-                    io: "input",
-                    runtimeTypeId: getTypedOutputTypeId(node.inputs[handle]),
-                });
-            }
-        }
         // Notify graph updated for UI parity
         this.emit("invalidate", { reason: "graph-updated" });
     }