fix: prevent duplicate node execution + clean node naming

- tick_execution: mark nodes as enqueued (null sentinel in node_outputs) after
  inserting job, preventing re-enqueue on subsequent ticks. Root cause of 16x
  email sends: each inline node completion triggered tick which re-enqueued
  all not-yet-completed nodes.
- Node naming: use {type}{N} pattern (string1, string2, send-email1) instead
  of random suffixes or _copy_ chains. Shared nextNodeName() utility used by
  drag-drop, duplicate, paste, and sidebar add.
- Graph name: sync flowName into graph object on save/execute so exported JSON
  has the correct name instead of empty string.
- Export/Import: download/upload buttons in toolbar for JSON graph debugging.

Author: pyramation

packages/fbp-graph-editor/src/components/GraphCanvas.tsx

@@ -1,5 +1,5 @@
 import React, { useRef, useCallback, useEffect, useState } from 'react';
-import { useGraph, useSelection, useNavigation, useScopedGraph, Point } from '../context/GraphContext';
+import { useGraph, useSelection, useNavigation, useScopedGraph, Point, nextNodeName } from '../context/GraphContext';
 import { GraphNode } from './GraphNode';
 import { GraphEdge, TempEdge } from './GraphEdge';
 import { screenToCanvas, clamp } from '../utils/geometry';
@@ -300,8 +300,9 @@ export function GraphCanvas() {
           : 'prop';
         dispatch({ type: 'ADD_BOUNDARY_NODE', boundaryType, position });
       } else {
+        const existingNames = scopedNodesRef.current.map(n => n.name);
         const newNode = {
-          name: `${definitionName.split('/').pop()}_${Date.now().toString(36)}`,
+          name: nextNodeName(definitionName, existingNames),
           type: definitionName,
           meta: position
         };

packages/fbp-graph-editor/src/context/GraphContext.tsx

@@ -16,6 +16,25 @@ import {
 } from '../utils/graphTransform';
 import { BOUNDARY_NODE_KINDS, isBoundaryNodeKind } from '../types';
 
+/**
+ * Generate the next node name for a given type using {shortType}{N} pattern.
+ * e.g. "const/string" → "string1", "string2", etc.
+ * Scans existing names to find the highest N and increments.
+ */
+export function nextNodeName(nodeType: string, existingNames: string[]): string {
+  const base = nodeType.includes('/') ? nodeType.split('/').pop()! : nodeType;
+  const pattern = new RegExp(`^${base.replace(/[.*+?^${}()|[\]\\]/g, '\\$&')}(\\d+)$`);
+  let max = 0;
+  for (const name of existingNames) {
+    const m = pattern.exec(name);
+    if (m) {
+      const n = parseInt(m[1], 10);
+      if (n > max) max = n;
+    }
+  }
+  return `${base}${max + 1}`;
+}
+
 // Built-in definitions for boundary node kinds
 // These ensure graphInput/graphOutput/graphProp nodes render their ports
 const BOUNDARY_NODE_DEFINITIONS: NodeDefinition[] = [
@@ -428,9 +447,11 @@ function graphReducer(state: GraphEditorState, action: GraphAction): GraphEditor
       const scopedNodes = getNodesAtScope(state.graph, state.cwd);
       const scopedEdges = getEdgesAtScope(state.graph, state.cwd);
       const selectedNodes = scopedNodes.filter(n => state.selection.nodeIds.has(n.name));
+      const allNames = scopedNodes.map(n => n.name);
       const nameMap = new Map<string, string>();
       const duplicatedNodes = selectedNodes.map(n => {
-        const newName = `${n.name}_copy_${Date.now().toString(36)}`;
+        const newName = nextNodeName(n.type, allNames);
+        allNames.push(newName);
         nameMap.set(n.name, newName);
         return {
           ...n,
@@ -474,9 +495,12 @@ function graphReducer(state: GraphEditorState, action: GraphAction): GraphEditor
     case 'PASTE_SELECTION': {
       if (state.clipboard.nodes.length === 0) return state;
 
+      const scopedNodesPaste = getNodesAtScope(state.graph, state.cwd);
+      const allNamesPaste = scopedNodesPaste.map(n => n.name);
       const nameMap = new Map<string, string>();
       const pastedNodes = state.clipboard.nodes.map(n => {
-        const newName = `${n.name}_copy_${Date.now().toString(36)}`;
+        const newName = nextNodeName(n.type, allNamesPaste);
+        allNamesPaste.push(newName);
         nameMap.set(n.name, newName);
         return {
           ...n,

packages/fbp-graph-editor/src/context/index.ts

@@ -3,6 +3,7 @@ export {
   useGraph,
   useSelection,
   useNavigation,
+  nextNodeName,
   type GraphEditorState,
   type ViewState,
   type SelectionState,

pgpm/constructive-compute/deploy/schemas/constructive_compute_private/procedures/platform_tick_execution/procedure.sql

@@ -179,6 +179,13 @@ BEGIN
     )
     VALUES
       (v_exec.database_id, (('fbp:eval:' || v_graph.context) || ':') || v_node_type, (json_build_object('execution_id', v_exec.id, 'node_name', v_node_name, 'node_type', v_node_type, 'inputs', v_inputs, 'props', v_node->'props'))::json);
+    -- Mark node as enqueued (null sentinel) so subsequent ticks don't re-enqueue it.
+    -- complete_node will overwrite with the real output UUID when the job finishes.
+    UPDATE "constructive_compute_private".platform_function_graph_executions SET
+    node_outputs = node_outputs || jsonb_build_object(v_node_name, null)
+    WHERE
+      id = platform_tick_execution.execution_id
+    RETURNING * INTO v_exec;
     v_jobs_enqueued := v_jobs_enqueued + 1;
   END LOOP;
   UPDATE "constructive_compute_private".platform_function_graph_executions SET

pgpm/constructive-compute/sql/constructive-compute--0.0.1.sql

@@ -390,6 +390,13 @@ BEGIN
     )
     VALUES
       (v_exec.database_id, v_node_type, (json_build_object('execution_id', v_exec.id, 'node_name', v_node_name, 'node_type', v_node_type, 'inputs', v_inputs, 'props', v_node->'props'))::json);
+    -- Mark node as enqueued (null sentinel) so subsequent ticks don't re-enqueue it.
+    -- complete_node will overwrite with the real output UUID when the job finishes.
+    UPDATE "constructive_compute_private".platform_function_graph_executions SET
+    node_outputs = node_outputs || jsonb_build_object(v_node_name, null)
+    WHERE
+      id = platform_tick_execution.execution_id
+    RETURNING * INTO v_exec;
     v_jobs_enqueued := v_jobs_enqueued + 1;
   END LOOP;
   UPDATE "constructive_compute_private".platform_function_graph_executions SET

www/src/components/FlowsPanel.tsx

@@ -1,5 +1,5 @@
 import { useState, useCallback, useRef, useMemo, useEffect } from 'react';
-import { GraphEditor, NodeIcon } from '@fbp/graph-editor';
+import { GraphEditor, NodeIcon, nextNodeName } from '@fbp/graph-editor';
 import { evaluate } from '@fbp/evaluator';
 import {
   mathDefinitions,
@@ -96,10 +96,11 @@ function platformFnToDefinition(fn: FunctionNode): NodeDefinition {
   };
 }
 
-function functionToNode(fn: FunctionNode, position: { x: number; y: number }): Node {
+function functionToNode(fn: FunctionNode, position: { x: number; y: number }, existingNames: string[]): Node {
+  const nodeType = fn.taskIdentifier || fn.name || '';
   return {
-    name: `${fn.name}_${Date.now()}`,
-    type: fn.taskIdentifier || fn.name || '',
+    name: nextNodeName(nodeType, existingNames),
+    type: nodeType,
     meta: position,
     props: [
       { name: 'secretsCount', type: 'number', value: ((fn.requiredSecrets ?? []) as FunctionRequirement[]).length || 0 },
@@ -109,9 +110,9 @@ function functionToNode(fn: FunctionNode, position: { x: number; y: number }): N
   };
 }
 
-function definitionToNode(def: NodeDefinition, position: { x: number; y: number }): Node {
+function definitionToNode(def: NodeDefinition, position: { x: number; y: number }, existingNames: string[]): Node {
   return {
-    name: `${def.name.split('/').pop()}_${Date.now().toString(36)}`,
+    name: nextNodeName(def.name, existingNames),
     type: def.name,
     meta: position,
   };
@@ -742,7 +743,7 @@ export function FlowsPanel() {
   }, [implDefinitions]);
 
   const handleExecute = useCallback(async () => {
-    const graph = graphRef.current;
+    const graph = { ...graphRef.current, name: flowName.trim() || 'untitled' };
     if (!graph.nodes.length) return;
 
     setIsExecuting(true);
@@ -819,11 +820,11 @@ export function FlowsPanel() {
       setExecutionState({ executionId: '', status: 'failed', nodeStates: {}, error: msg });
       setIsExecuting(false);
     }
-  }, []);
+  }, [flowName]);
 
   const handleSave = useCallback(async () => {
     const name = flowName.trim() || `Flow ${stores.length + 1}`;
-    const graph = graphRef.current;
+    const graph = { ...graphRef.current, name };
     setIsSaving(true);
     setSaveStatus(null);
 
@@ -884,20 +885,25 @@ export function FlowsPanel() {
 
   const handleAddNode = useCallback((def: NodeDefinition, fn?: FunctionNode) => {
     const position = { x: 300 + Math.random() * 200, y: 100 + Math.random() * 200 };
-    if (fn) {
-      const node = functionToNode(fn, position);
-      setCurrentGraph(prev => ({ ...prev, nodes: [...prev.nodes, node] }));
-    } else {
-      const node = definitionToNode(def, position);
-      setCurrentGraph(prev => ({ ...prev, nodes: [...prev.nodes, node] }));
-    }
+    setCurrentGraph(prev => {
+      const existingNames = prev.nodes.map(n => n.name);
+      const node = fn
+        ? functionToNode(fn, position, existingNames)
+        : definitionToNode(def, position, existingNames);
+      return { ...prev, nodes: [...prev.nodes, node] };
+    });
   }, []);
 
   const handleLoadAll = useCallback(() => {
-    const newNodes = functions.map((fn, i) =>
-      functionToNode(fn, { x: 300, y: 50 + i * 200 })
-    );
-    setCurrentGraph(prev => ({ ...prev, nodes: [...prev.nodes, ...newNodes] }));
+    setCurrentGraph(prev => {
+      const existingNames = prev.nodes.map(n => n.name);
+      const newNodes = functions.map((fn, i) => {
+        const node = functionToNode(fn, { x: 300, y: 50 + i * 200 }, existingNames);
+        existingNames.push(node.name);
+        return node;
+      });
+      return { ...prev, nodes: [...prev.nodes, ...newNodes] };
+    });
   }, [functions]);
 
   const handleDragStart = useCallback((e: React.DragEvent, def: NodeDefinition) => {