@ankhorage/flow 0.0.0-stage → 0.4.1

package/CHANGELOG.md

@@ -0,0 +1,33 @@
+# @ankhorage/flow
+
+## 0.4.1
+
+### Patch Changes
+
+- 8e96c13: Load the optional MCP SDK only when MCP discovery or approved execution opens a provider connection.
+
+## 0.4.0
+
+### Minor Changes
+
+- f7431ac: Add a provider-neutral Flow security port with scoped authorization, full-identity approval gates,
+  host-persisted atomic claim and consumption, audit events, rate limits, SSRF-safe targets, and
+  server-only secret resolution. Remote MCP execution now requires this explicit security boundary
+  and a host-owned transport that controls every resolved peer connection.
+
+## 0.3.0
+
+### Minor Changes
+
+- 9bd21b1: Add an optional, fail-closed MCP tool discovery entrypoint with explicit provider and tool scopes.
+
+## 0.2.0
+
+### Minor Changes
+
+- 24a9d4d: Bootstrap the standalone Flow package with public provider subpaths and packed-consumer validation.
+- 1ba3dca: Add deterministic headless graph compilation, safe built-in operations, and single-process execution.
+
+### Patch Changes
+
+- 5b3e567: Declare the published workflow contracts dependency used by Flow's public consumer boundary.

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Ankhorage
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,3 +1,18 @@
-# Temporary Holding Version
+<!-- markdownlint-disable MD013 MD033 -->
+<!-- This file is generated by Paradox. Do not edit manually. -->
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+# @ankhorage/flow
+
+![license: MIT](././paradox/badges/license.svg) ![npm: v0.4.1](././paradox/badges/npm.svg) ![runtime: bun](././paradox/badges/runtime.svg) ![typescript: strict](././paradox/badges/typescript.svg) ![eslint: checked](././paradox/badges/eslint.svg) ![prettier: checked](././paradox/badges/prettier.svg) ![build: checked](././paradox/badges/build.svg) ![tests: configured](././paradox/badges/tests.svg) ![paradox: canonical](././paradox/badges/docs.svg)
+
+Standalone workflow engine foundation for Ankhorage.
+
+## Generated documentation
+
+- [Interactive documentation app](././paradox/index.html)
+- [Public API reference](././paradox/exports.md)
+- [Component registry](././paradox/components.md)
+- [Architecture overview](././paradox/diagrams/architecture-overview.mmd)
+- [Module relationships](././paradox/diagrams/module-relationships.mmd)
+- [Export graph](././paradox/diagrams/export-graph.mmd)
+- [compileFlowGraph sequence](././paradox/diagrams/sequences/compile-flow-graph.mmd)

package/dist/ai.d.ts

@@ -0,0 +1,7 @@
+/***
+ * Reserved public subpath for future AI-provider adapters.
+ *
+ * This bootstrap intentionally provides no AI execution, configuration, or dependencies.
+ */
+export {};
+//# sourceMappingURL=ai.d.ts.map

package/dist/ai.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ai.d.ts","sourceRoot":"","sources":["../src/ai.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,CAAC"}

package/dist/ai.js

@@ -0,0 +1,7 @@
+/***
+ * Reserved public subpath for future AI-provider adapters.
+ *
+ * This bootstrap intentionally provides no AI execution, configuration, or dependencies.
+ */
+export {};
+//# sourceMappingURL=ai.js.map

package/dist/ai.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ai.js","sourceRoot":"","sources":["../src/ai.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,CAAC","sourcesContent":["/***\n * Reserved public subpath for future AI-provider adapters.\n *\n * This bootstrap intentionally provides no AI execution, configuration, or dependencies.\n */\nexport {};\n"]}

package/dist/features/execution/application/executeFlowAsync.d.ts

@@ -0,0 +1,4 @@
+import type { FlowClock, FlowCompiledGraph, FlowExecutionResult, FlowNodeRegistry, FlowRunRequest } from '../../../types/execution.js';
+/*** Execute a compiled graph in deterministic order within one process. */
+export declare const executeFlowAsync: (graph: FlowCompiledGraph, registry: FlowNodeRegistry, request: FlowRunRequest, clock?: FlowClock) => Promise<FlowExecutionResult>;
+//# sourceMappingURL=executeFlowAsync.d.ts.map

package/dist/features/execution/application/executeFlowAsync.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"executeFlowAsync.d.ts","sourceRoot":"","sources":["../../../../src/features/execution/application/executeFlowAsync.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EACV,SAAS,EACT,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EAChB,cAAc,EACf,MAAM,6BAA6B,CAAC;AAIrC,2EAA2E;AAC3E,eAAO,MAAM,gBAAgB,GAC3B,OAAO,iBAAiB,EACxB,UAAU,gBAAgB,EAC1B,SAAS,cAAc,EACvB,QAAO,SAAqC,KAC3C,OAAO,CAAC,mBAAmB,CAiB7B,CAAC"}

package/dist/features/execution/application/executeFlowAsync.js

@@ -0,0 +1,211 @@
+import { assertFlowGraphSchemasSupported } from '../domain/assertFlowGraphSchemasSupported.js';
+import { validateFlowDataSchema } from '../domain/validateFlowDataSchema.js';
+/*** Execute a compiled graph in deterministic order within one process. */
+export const executeFlowAsync = async (graph, registry, request, clock = { now: () => new Date() }) => {
+    const trigger = graph.definition.triggers.find(({ id }) => id === request.triggerId);
+    if (trigger?.kind !== 'manual')
+        throw new Error('FLOW_TRIGGER_NOT_MANUAL');
+    assertFlowGraphSchemasSupported(graph.definition.nodes, request.schemaRegistry);
+    const startedAt = clock.now().toISOString();
+    const state = await executeNodesAsync(graph, registry, request, clock);
+    return {
+        run: createRun(graph, request, state.steps, startedAt, clock.now().toISOString(), state.status ?? 'succeeded', state.error),
+    };
+};
+/*** Iterate compiled nodes in deterministic order until completion or cancellation. */
+const executeNodesAsync = async (graph, registry, request, clock) => {
+    const state = {
+        activatedNodeIds: new Set(graph.topologicalNodeIds.filter((nodeId) => !graph.definition.edges.some((edge) => edge.target.nodeId === nodeId))),
+        inputs: {},
+        steps: [],
+    };
+    for (const nodeId of graph.topologicalNodeIds) {
+        if (request.signal?.aborted)
+            return { ...state, status: 'cancelled' };
+        const node = graph.definition.nodes.find((candidate) => candidate.id === nodeId);
+        if (!node)
+            throw new Error(`FLOW_GRAPH_UNKNOWN_NODE:${nodeId}`);
+        const result = await executeAvailableNodeAsync(node, state, registry, request, clock);
+        if (!result)
+            continue;
+        state.steps.push(result.step);
+        if (result.step.status === 'cancelled')
+            return { ...state, status: 'cancelled' };
+        propagateOutput(graph.edgesBySourceNodeId[node.id] ?? [], result.output, result.step.status === 'failed' ? 'failure' : 'success', state);
+    }
+    const failedStep = state.steps.find((step) => step.status === 'failed');
+    return { ...state, status: failedStep ? 'failed' : 'succeeded', error: failedStep?.error };
+};
+/*** Execute one node only when all of its required inputs were propagated. */
+const executeAvailableNodeAsync = async (node, state, registry, request, clock) => {
+    if (!state.activatedNodeIds.has(node.id))
+        return undefined;
+    const input = state.inputs[node.id] ?? request.input ?? {};
+    if (!hasRequiredInput(node, input))
+        return undefined;
+    return executeNodeAsync(node, input, registry, request.signal, clock, request.schemaRegistry);
+};
+/*** Determine whether every required input port has a propagated value. */
+const hasRequiredInput = (node, input) => node.ports
+    .filter((port) => port.direction === 'input' && port.required)
+    .every((port) => input[port.id] !== undefined);
+/*** Execute one node and convert failures to redaction-safe contract errors. */
+const executeNodeAsync = async (node, input, registry, signal, clock, schemas) => {
+    const startedAt = clock.now().toISOString();
+    try {
+        assertPortSchemas(node, input, 'input', schemas);
+        const operationId = `${node.capability.providerId}:${node.capability.capabilityId}`;
+        const operation = Object.entries(registry).find(([id]) => id === operationId)?.[1];
+        if (!operation)
+            throw new Error(`FLOW_OPERATION_UNREGISTERED:${operationId}`);
+        const output = (await operation.executeAsync({
+            config: node.config,
+            input,
+            node,
+            signal: signal ?? new AbortController().signal,
+        })).output ?? {};
+        if (signal?.aborted)
+            return { output: {}, step: createCancelledStep(node, input, startedAt, clock) };
+        assertOutputPorts(node, output);
+        assertPortSchemas(node, output, 'output', schemas);
+        return { output, step: createSucceededStep(node, input, output, startedAt, clock) };
+    }
+    catch (reason) {
+        const error = asFlowError(reason);
+        return {
+            output: {},
+            step: {
+                id: `${node.id}:1`,
+                nodeId: node.id,
+                status: 'failed',
+                attempt: 1,
+                startedAt,
+                completedAt: clock.now().toISOString(),
+                input,
+                error,
+            },
+        };
+    }
+};
+/*** Create an immutable successful step snapshot. */
+const createSucceededStep = (node, input, output, startedAt, clock) => ({
+    id: `${node.id}:1`,
+    nodeId: node.id,
+    status: 'succeeded',
+    attempt: 1,
+    startedAt,
+    completedAt: clock.now().toISOString(),
+    input,
+    output,
+});
+/*** Create a terminal snapshot when cancellation occurs during asynchronous node execution. */
+const createCancelledStep = (node, input, startedAt, clock) => ({
+    id: `${node.id}:1`,
+    nodeId: node.id,
+    status: 'cancelled',
+    attempt: 1,
+    startedAt,
+    completedAt: clock.now().toISOString(),
+    input,
+});
+/*** Reject operation outputs that do not correspond to declared output ports. */
+const assertOutputPorts = (node, output) => {
+    const outputIds = new Set(node.ports.filter((port) => port.direction === 'output').map(({ id }) => id));
+    if (Object.keys(output).some((portId) => !outputIds.has(portId)))
+        throw new Error(`FLOW_OUTPUT_UNDECLARED_PORT:${node.id}`);
+    const missingRequired = node.ports.some((port) => port.direction === 'output' && port.required && output[port.id] === undefined);
+    if (missingRequired)
+        throw new Error(`FLOW_OUTPUT_REQUIRED_PORT_MISSING:${node.id}`);
+};
+/*** Validate inline port values against their declared portable schemas. */
+const assertPortSchemas = (node, values, direction, schemas) => {
+    for (const port of node.ports.filter((candidate) => candidate.direction === direction)) {
+        const value = values[port.id];
+        const schema = port.data?.schema ?? (port.data?.schemaRef ? { ref: port.data.schemaRef } : undefined);
+        if (value?.kind === 'inline' && schema && !validateFlowDataSchema(value.value, schema, schemas))
+            throw new Error(`FLOW_PORT_SCHEMA_MISMATCH:${node.id}:${port.id}`);
+    }
+};
+/*** Propagate outputs only over edges whose declared condition matches the output value. */
+const propagateOutput = (edges, output, outcome, state) => {
+    for (const edge of edges) {
+        const value = output[edge.source.portId];
+        if (!matchesEdge(edge, value, outcome))
+            continue;
+        state.activatedNodeIds.add(edge.target.nodeId);
+        if (value)
+            state.inputs[edge.target.nodeId] = {
+                ...state.inputs[edge.target.nodeId],
+                [edge.target.portId]: value,
+            };
+    }
+};
+/*** Evaluate an edge condition without executing arbitrary expressions. */
+const matchesEdge = (edge, value, outcome) => {
+    const condition = edge.condition ?? { kind: 'always' };
+    if (condition.kind === 'always')
+        return outcome === 'success';
+    if (condition.kind === 'outcome')
+        return condition.outcome === outcome;
+    if (value?.kind !== 'inline')
+        return false;
+    const selected = resolvePointer(value.value, condition.path);
+    return selected !== undefined && structurallyEqual(selected, condition.equals);
+};
+/*** Resolve an RFC 6901 pointer against serializable inline data. */
+const resolvePointer = (value, pointer) => {
+    if (pointer === '')
+        return value;
+    if (!pointer.startsWith('/'))
+        return undefined;
+    return pointer
+        .slice(1)
+        .split('/')
+        .reduce((current, segment) => {
+        if (current === undefined || current === null || typeof current !== 'object')
+            return undefined;
+        const key = segment.replaceAll('~1', '/').replaceAll('~0', '~');
+        if (isDataArray(current))
+            return current.find((_item, index) => index === Number(key));
+        return isDataRecord(current)
+            ? Object.entries(current).find(([candidateKey]) => candidateKey === key)?.[1]
+            : undefined;
+    }, value);
+};
+/*** Compare JSON-compatible values with object-key-order independence. */
+const structurallyEqual = (left, right) => JSON.stringify(normalizeValue(left)) === JSON.stringify(normalizeValue(right));
+/*** Canonicalize object member ordering for structural equality. */
+const normalizeValue = (value) => {
+    if (Array.isArray(value))
+        return value.map(normalizeValue);
+    if (value !== null && typeof value === 'object')
+        return Object.fromEntries(Object.entries(value)
+            .sort(([left], [right]) => left.localeCompare(right))
+            .map(([key, item]) => [key, normalizeValue(item)]));
+    return value;
+};
+/*** Narrow a serializable non-array object to an indexable data record. */
+const isDataRecord = (value) => !Array.isArray(value);
+/*** Narrow a serializable array without losing its element type. */
+const isDataArray = (value) => Array.isArray(value);
+/*** Translate host failures to structured contract errors without exposing arbitrary objects. */
+const asFlowError = (reason) => ({
+    code: reason instanceof Error && /^FLOW_[A-Z0-9_]+(?::|$)/.test(reason.message)
+        ? (reason.message.split(':')[0] ?? 'FLOW_OPERATION_FAILED')
+        : 'FLOW_OPERATION_FAILED',
+    message: 'The operation failed.',
+    retryable: false,
+});
+/*** Build the immutable run result emitted by the single-process executor. */
+const createRun = (graph, request, steps, startedAt, completedAt, status, error) => ({
+    id: request.runId,
+    flow: { id: graph.definition.id, version: graph.definition.version },
+    status,
+    trigger: { triggerId: request.triggerId, kind: 'manual' },
+    createdAt: startedAt,
+    startedAt,
+    completedAt,
+    steps,
+    error,
+});
+//# sourceMappingURL=executeFlowAsync.js.map

package/dist/features/execution/application/executeFlowAsync.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"executeFlowAsync.js","sourceRoot":"","sources":["../../../../src/features/execution/application/executeFlowAsync.ts"],"names":[],"mappings":"AAkBA,OAAO,EAAE,+BAA+B,EAAE,MAAM,8CAA8C,CAAC;AAC/F,OAAO,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAE7E,2EAA2E;AAC3E,MAAM,CAAC,MAAM,gBAAgB,GAAG,KAAK,EACnC,KAAwB,EACxB,QAA0B,EAC1B,OAAuB,EACvB,QAAmB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,EAAE,EACd,EAAE;IAChC,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,OAAO,CAAC,SAAS,CAAC,CAAC;IACrF,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC3E,+BAA+B,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IAChF,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IAC5C,MAAM,KAAK,GAAG,MAAM,iBAAiB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IACvE,OAAO;QACL,GAAG,EAAE,SAAS,CACZ,KAAK,EACL,OAAO,EACP,KAAK,CAAC,KAAK,EACX,SAAS,EACT,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,EACzB,KAAK,CAAC,MAAM,IAAI,WAAW,EAC3B,KAAK,CAAC,KAAK,CACZ;KACF,CAAC;AACJ,CAAC,CAAC;AAEF,uFAAuF;AACvF,MAAM,iBAAiB,GAAG,KAAK,EAC7B,KAAwB,EACxB,QAA0B,EAC1B,OAAuB,EACvB,KAAgB,EACS,EAAE;IAC3B,MAAM,KAAK,GAAmB;QAC5B,gBAAgB,EAAE,IAAI,GAAG,CACvB,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAC7B,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,CAClF,CACF;QACD,MAAM,EAAE,EAAE;QACV,KAAK,EAAE,EAAE;KACV,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAC9C,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;YAAE,OAAO,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;QACtE,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QACjF,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,MAAM,EAAE,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,MAAM,yBAAyB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACtF,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;QACjF,eAAe,CACb,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EACxC,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,EACvD,KAAK,CACN,CAAC;IACJ,CAAC;IACD,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IACxE,OAAO,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AAC7F,CAAC,CAAC;AAUF,8EAA8E;AAC9E,MAAM,yBAAyB,GAAG,KAAK,EACrC,IAAc,EACd,KAAqB,EACrB,QAA0B,EAC1B,OAAuB,EACvB,KAAgB,EAIhB,EAAE;IACF,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAC3D,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACrD,OAAO,gBAAgB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;AAChG,CAAC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,gBAAgB,GAAG,CACvB,IAAc,EACd,KAAgD,EACvC,EAAE,CACX,IAAI,CAAC,KAAK;KACP,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC;KAC7D,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC;AAEnD,gFAAgF;AAChF,MAAM,gBAAgB,GAAG,KAAK,EAC5B,IAAc,EACd,KAAgD,EAChD,QAA0B,EAC1B,MAA+B,EAC/B,KAAgB,EAChB,OAAyC,EAIxC,EAAE;IACH,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IAC5C,IAAI,CAAC;QACH,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC;QACpF,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnF,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,WAAW,EAAE,CAAC,CAAC;QAC9E,MAAM,MAAM,GACV,CACE,MAAM,SAAS,CAAC,YAAY,CAAC;YAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK;YACL,IAAI;YACJ,MAAM,EAAE,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC,MAAM;SAC/C,CAAC,CACH,CAAC,MAAM,IAAI,EAAE,CAAC;QACjB,IAAI,MAAM,EAAE,OAAO;YACjB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;QAClF,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChC,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACnD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACtF,CAAC;IAAC,OAAO,MAAM,EAAE,CAAC;QAChB,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,OAAO;YACL,MAAM,EAAE,EAAE;YACV,IAAI,EAAE;gBACJ,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI;gBAClB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,MAAM,EAAE,QAAQ;gBAChB,OAAO,EAAE,CAAC;gBACV,SAAS;gBACT,WAAW,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;gBACtC,KAAK;gBACL,KAAK;aACN;SACF,CAAC;IACJ,CAAC;AACH,CAAC,CAAC;AAEF,qDAAqD;AACrD,MAAM,mBAAmB,GAAG,CAC1B,IAAc,EACd,KAAgD,EAChD,MAAiD,EACjD,SAAiB,EACjB,KAAgB,EACE,EAAE,CAAC,CAAC;IACtB,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI;IAClB,MAAM,EAAE,IAAI,CAAC,EAAE;IACf,MAAM,EAAE,WAAW;IACnB,OAAO,EAAE,CAAC;IACV,SAAS;IACT,WAAW,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;IACtC,KAAK;IACL,MAAM;CACP,CAAC,CAAC;AAEH,+FAA+F;AAC/F,MAAM,mBAAmB,GAAG,CAC1B,IAAc,EACd,KAAgD,EAChD,SAAiB,EACjB,KAAgB,EACE,EAAE,CAAC,CAAC;IACtB,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI;IAClB,MAAM,EAAE,IAAI,CAAC,EAAE;IACf,MAAM,EAAE,WAAW;IACnB,OAAO,EAAE,CAAC;IACV,SAAS;IACT,WAAW,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;IACtC,KAAK;CACN,CAAC,CAAC;AAEH,iFAAiF;AACjF,MAAM,iBAAiB,GAAG,CACxB,IAAc,EACd,MAAiD,EAC3C,EAAE;IACR,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAC7E,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9D,MAAM,IAAI,KAAK,CAAC,+BAA+B,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CACrC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS,CACxF,CAAC;IACF,IAAI,eAAe;QAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;AACvF,CAAC,CAAC;AAEF,4EAA4E;AAC5E,MAAM,iBAAiB,GAAG,CACxB,IAAc,EACd,MAAiD,EACjD,SAA6B,EAC7B,OAAyC,EACnC,EAAE;IACR,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,KAAK,SAAS,CAAC,EAAE,CAAC;QACvF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,MAAM,GACV,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACzF,IAAI,KAAK,EAAE,IAAI,KAAK,QAAQ,IAAI,MAAM,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC;YAC7F,MAAM,IAAI,KAAK,CAAC,6BAA6B,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IACvE,CAAC;AACH,CAAC,CAAC;AAEF,4FAA4F;AAC5F,MAAM,eAAe,GAAG,CACtB,KAA0B,EAC1B,MAAiD,EACjD,OAA8B,EAC9B,KAAqB,EACf,EAAE;IACR,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC;YAAE,SAAS;QACjD,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,KAAK;YACP,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG;gBACjC,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBACnC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK;aAC5B,CAAC;IACN,CAAC;AACH,CAAC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,WAAW,GAAG,CAClB,IAAc,EACd,KAA8B,EAC9B,OAA8B,EACrB,EAAE;IACX,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,QAAiB,EAAE,CAAC;IAChE,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,KAAK,SAAS,CAAC;IAC9D,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,OAAO,KAAK,OAAO,CAAC;IACvE,IAAI,KAAK,EAAE,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC3C,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,QAAQ,KAAK,SAAS,IAAI,iBAAiB,CAAC,QAAQ,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;AACjF,CAAC,CAAC;AAEF,qEAAqE;AACrE,MAAM,cAAc,GAAG,CACrB,KAAwB,EACxB,OAAe,EACgB,EAAE;IACjC,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IACjC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/C,OAAO,OAAO;SACX,KAAK,CAAC,CAAC,CAAC;SACR,KAAK,CAAC,GAAG,CAAC;SACV,MAAM,CAAgC,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE;QAC1D,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ;YAC1E,OAAO,SAAS,CAAC;QACnB,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAChE,IAAI,WAAW,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACvF,OAAO,YAAY,CAAC,OAAO,CAAC;YAC1B,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,YAAY,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7E,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC,EAAE,KAAK,CAAC,CAAC;AACd,CAAC,CAAC;AAEF,0EAA0E;AAC1E,MAAM,iBAAiB,GAAG,CAAC,IAAuB,EAAE,KAAwB,EAAW,EAAE,CACvF,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;AAEjF,oEAAoE;AACpE,MAAM,cAAc,GAAG,CAAC,KAAwB,EAAqB,EAAE;IACrE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAC3D,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAC7C,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;aAClB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACpD,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CACrD,CAAC;IACJ,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,YAAY,GAAG,CAAC,KAAa,EAAwD,EAAE,CAC3F,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAExB,oEAAoE;AACpE,MAAM,WAAW,GAAG,CAAC,KAAa,EAAyC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAEnG,iGAAiG;AACjG,MAAM,WAAW,GAAG,CAAC,MAAe,EAAa,EAAE,CAAC,CAAC;IACnD,IAAI,EACF,MAAM,YAAY,KAAK,IAAI,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;QACvE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,uBAAuB,CAAC;QAC3D,CAAC,CAAC,uBAAuB;IAC7B,OAAO,EAAE,uBAAuB;IAChC,SAAS,EAAE,KAAK;CACjB,CAAC,CAAC;AAEH,8EAA8E;AAC9E,MAAM,SAAS,GAAG,CAChB,KAAwB,EACxB,OAAuB,EACvB,KAAkC,EAClC,SAAiB,EACjB,WAAmB,EACnB,MAAiC,EACjC,KAAiB,EACA,EAAE,CAAC,CAAC;IACrB,EAAE,EAAE,OAAO,CAAC,KAAK;IACjB,IAAI,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,EAAE;IACpE,MAAM;IACN,OAAO,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE;IACzD,SAAS,EAAE,SAAS;IACpB,SAAS;IACT,WAAW;IACX,KAAK;IACL,KAAK;CACN,CAAC,CAAC","sourcesContent":["import type { DataContractValue } from '@ankhorage/contracts/data';\nimport type {\n  FlowDataRef,\n  FlowEdge,\n  FlowError,\n  FlowNode,\n  FlowPortId,\n  FlowRunSnapshot,\n  FlowStepSnapshot,\n} from '@ankhorage/contracts/flow';\n\nimport type {\n  FlowClock,\n  FlowCompiledGraph,\n  FlowExecutionResult,\n  FlowNodeRegistry,\n  FlowRunRequest,\n} from '../../../types/execution.js';\nimport { assertFlowGraphSchemasSupported } from '../domain/assertFlowGraphSchemasSupported.js';\nimport { validateFlowDataSchema } from '../domain/validateFlowDataSchema.js';\n\n/*** Execute a compiled graph in deterministic order within one process. */\nexport const executeFlowAsync = async (\n  graph: FlowCompiledGraph,\n  registry: FlowNodeRegistry,\n  request: FlowRunRequest,\n  clock: FlowClock = { now: () => new Date() },\n): Promise<FlowExecutionResult> => {\n  const trigger = graph.definition.triggers.find(({ id }) => id === request.triggerId);\n  if (trigger?.kind !== 'manual') throw new Error('FLOW_TRIGGER_NOT_MANUAL');\n  assertFlowGraphSchemasSupported(graph.definition.nodes, request.schemaRegistry);\n  const startedAt = clock.now().toISOString();\n  const state = await executeNodesAsync(graph, registry, request, clock);\n  return {\n    run: createRun(\n      graph,\n      request,\n      state.steps,\n      startedAt,\n      clock.now().toISOString(),\n      state.status ?? 'succeeded',\n      state.error,\n    ),\n  };\n};\n\n/*** Iterate compiled nodes in deterministic order until completion or cancellation. */\nconst executeNodesAsync = async (\n  graph: FlowCompiledGraph,\n  registry: FlowNodeRegistry,\n  request: FlowRunRequest,\n  clock: FlowClock,\n): Promise<ExecutionState> => {\n  const state: ExecutionState = {\n    activatedNodeIds: new Set(\n      graph.topologicalNodeIds.filter(\n        (nodeId) => !graph.definition.edges.some((edge) => edge.target.nodeId === nodeId),\n      ),\n    ),\n    inputs: {},\n    steps: [],\n  };\n  for (const nodeId of graph.topologicalNodeIds) {\n    if (request.signal?.aborted) return { ...state, status: 'cancelled' };\n    const node = graph.definition.nodes.find((candidate) => candidate.id === nodeId);\n    if (!node) throw new Error(`FLOW_GRAPH_UNKNOWN_NODE:${nodeId}`);\n    const result = await executeAvailableNodeAsync(node, state, registry, request, clock);\n    if (!result) continue;\n    state.steps.push(result.step);\n    if (result.step.status === 'cancelled') return { ...state, status: 'cancelled' };\n    propagateOutput(\n      graph.edgesBySourceNodeId[node.id] ?? [],\n      result.output,\n      result.step.status === 'failed' ? 'failure' : 'success',\n      state,\n    );\n  }\n  const failedStep = state.steps.find((step) => step.status === 'failed');\n  return { ...state, status: failedStep ? 'failed' : 'succeeded', error: failedStep?.error };\n};\n\ninterface ExecutionState {\n  readonly activatedNodeIds: Set<string>;\n  readonly error?: FlowError;\n  readonly inputs: Record<string, Record<FlowPortId, FlowDataRef>>;\n  readonly status?: FlowRunSnapshot['status'];\n  readonly steps: FlowStepSnapshot[];\n}\n\n/*** Execute one node only when all of its required inputs were propagated. */\nconst executeAvailableNodeAsync = async (\n  node: FlowNode,\n  state: ExecutionState,\n  registry: FlowNodeRegistry,\n  request: FlowRunRequest,\n  clock: FlowClock,\n): Promise<\n  | { readonly output: Readonly<Record<FlowPortId, FlowDataRef>>; readonly step: FlowStepSnapshot }\n  | undefined\n> => {\n  if (!state.activatedNodeIds.has(node.id)) return undefined;\n  const input = state.inputs[node.id] ?? request.input ?? {};\n  if (!hasRequiredInput(node, input)) return undefined;\n  return executeNodeAsync(node, input, registry, request.signal, clock, request.schemaRegistry);\n};\n\n/*** Determine whether every required input port has a propagated value. */\nconst hasRequiredInput = (\n  node: FlowNode,\n  input: Readonly<Record<FlowPortId, FlowDataRef>>,\n): boolean =>\n  node.ports\n    .filter((port) => port.direction === 'input' && port.required)\n    .every((port) => input[port.id] !== undefined);\n\n/*** Execute one node and convert failures to redaction-safe contract errors. */\nconst executeNodeAsync = async (\n  node: FlowNode,\n  input: Readonly<Record<FlowPortId, FlowDataRef>>,\n  registry: FlowNodeRegistry,\n  signal: AbortSignal | undefined,\n  clock: FlowClock,\n  schemas: FlowRunRequest['schemaRegistry'],\n): Promise<{\n  readonly output: Readonly<Record<FlowPortId, FlowDataRef>>;\n  readonly step: FlowStepSnapshot;\n}> => {\n  const startedAt = clock.now().toISOString();\n  try {\n    assertPortSchemas(node, input, 'input', schemas);\n    const operationId = `${node.capability.providerId}:${node.capability.capabilityId}`;\n    const operation = Object.entries(registry).find(([id]) => id === operationId)?.[1];\n    if (!operation) throw new Error(`FLOW_OPERATION_UNREGISTERED:${operationId}`);\n    const output =\n      (\n        await operation.executeAsync({\n          config: node.config,\n          input,\n          node,\n          signal: signal ?? new AbortController().signal,\n        })\n      ).output ?? {};\n    if (signal?.aborted)\n      return { output: {}, step: createCancelledStep(node, input, startedAt, clock) };\n    assertOutputPorts(node, output);\n    assertPortSchemas(node, output, 'output', schemas);\n    return { output, step: createSucceededStep(node, input, output, startedAt, clock) };\n  } catch (reason) {\n    const error = asFlowError(reason);\n    return {\n      output: {},\n      step: {\n        id: `${node.id}:1`,\n        nodeId: node.id,\n        status: 'failed',\n        attempt: 1,\n        startedAt,\n        completedAt: clock.now().toISOString(),\n        input,\n        error,\n      },\n    };\n  }\n};\n\n/*** Create an immutable successful step snapshot. */\nconst createSucceededStep = (\n  node: FlowNode,\n  input: Readonly<Record<FlowPortId, FlowDataRef>>,\n  output: Readonly<Record<FlowPortId, FlowDataRef>>,\n  startedAt: string,\n  clock: FlowClock,\n): FlowStepSnapshot => ({\n  id: `${node.id}:1`,\n  nodeId: node.id,\n  status: 'succeeded',\n  attempt: 1,\n  startedAt,\n  completedAt: clock.now().toISOString(),\n  input,\n  output,\n});\n\n/*** Create a terminal snapshot when cancellation occurs during asynchronous node execution. */\nconst createCancelledStep = (\n  node: FlowNode,\n  input: Readonly<Record<FlowPortId, FlowDataRef>>,\n  startedAt: string,\n  clock: FlowClock,\n): FlowStepSnapshot => ({\n  id: `${node.id}:1`,\n  nodeId: node.id,\n  status: 'cancelled',\n  attempt: 1,\n  startedAt,\n  completedAt: clock.now().toISOString(),\n  input,\n});\n\n/*** Reject operation outputs that do not correspond to declared output ports. */\nconst assertOutputPorts = (\n  node: FlowNode,\n  output: Readonly<Record<FlowPortId, FlowDataRef>>,\n): void => {\n  const outputIds = new Set(\n    node.ports.filter((port) => port.direction === 'output').map(({ id }) => id),\n  );\n  if (Object.keys(output).some((portId) => !outputIds.has(portId)))\n    throw new Error(`FLOW_OUTPUT_UNDECLARED_PORT:${node.id}`);\n  const missingRequired = node.ports.some(\n    (port) => port.direction === 'output' && port.required && output[port.id] === undefined,\n  );\n  if (missingRequired) throw new Error(`FLOW_OUTPUT_REQUIRED_PORT_MISSING:${node.id}`);\n};\n\n/*** Validate inline port values against their declared portable schemas. */\nconst assertPortSchemas = (\n  node: FlowNode,\n  values: Readonly<Record<FlowPortId, FlowDataRef>>,\n  direction: 'input' | 'output',\n  schemas: FlowRunRequest['schemaRegistry'],\n): void => {\n  for (const port of node.ports.filter((candidate) => candidate.direction === direction)) {\n    const value = values[port.id];\n    const schema =\n      port.data?.schema ?? (port.data?.schemaRef ? { ref: port.data.schemaRef } : undefined);\n    if (value?.kind === 'inline' && schema && !validateFlowDataSchema(value.value, schema, schemas))\n      throw new Error(`FLOW_PORT_SCHEMA_MISMATCH:${node.id}:${port.id}`);\n  }\n};\n\n/*** Propagate outputs only over edges whose declared condition matches the output value. */\nconst propagateOutput = (\n  edges: readonly FlowEdge[],\n  output: Readonly<Record<FlowPortId, FlowDataRef>>,\n  outcome: 'failure' | 'success',\n  state: ExecutionState,\n): void => {\n  for (const edge of edges) {\n    const value = output[edge.source.portId];\n    if (!matchesEdge(edge, value, outcome)) continue;\n    state.activatedNodeIds.add(edge.target.nodeId);\n    if (value)\n      state.inputs[edge.target.nodeId] = {\n        ...state.inputs[edge.target.nodeId],\n        [edge.target.portId]: value,\n      };\n  }\n};\n\n/*** Evaluate an edge condition without executing arbitrary expressions. */\nconst matchesEdge = (\n  edge: FlowEdge,\n  value: FlowDataRef | undefined,\n  outcome: 'failure' | 'success',\n): boolean => {\n  const condition = edge.condition ?? { kind: 'always' as const };\n  if (condition.kind === 'always') return outcome === 'success';\n  if (condition.kind === 'outcome') return condition.outcome === outcome;\n  if (value?.kind !== 'inline') return false;\n  const selected = resolvePointer(value.value, condition.path);\n  return selected !== undefined && structurallyEqual(selected, condition.equals);\n};\n\n/*** Resolve an RFC 6901 pointer against serializable inline data. */\nconst resolvePointer = (\n  value: DataContractValue,\n  pointer: string,\n): DataContractValue | undefined => {\n  if (pointer === '') return value;\n  if (!pointer.startsWith('/')) return undefined;\n  return pointer\n    .slice(1)\n    .split('/')\n    .reduce<DataContractValue | undefined>((current, segment) => {\n      if (current === undefined || current === null || typeof current !== 'object')\n        return undefined;\n      const key = segment.replaceAll('~1', '/').replaceAll('~0', '~');\n      if (isDataArray(current)) return current.find((_item, index) => index === Number(key));\n      return isDataRecord(current)\n        ? Object.entries(current).find(([candidateKey]) => candidateKey === key)?.[1]\n        : undefined;\n    }, value);\n};\n\n/*** Compare JSON-compatible values with object-key-order independence. */\nconst structurallyEqual = (left: DataContractValue, right: DataContractValue): boolean =>\n  JSON.stringify(normalizeValue(left)) === JSON.stringify(normalizeValue(right));\n\n/*** Canonicalize object member ordering for structural equality. */\nconst normalizeValue = (value: DataContractValue): DataContractValue => {\n  if (Array.isArray(value)) return value.map(normalizeValue);\n  if (value !== null && typeof value === 'object')\n    return Object.fromEntries(\n      Object.entries(value)\n        .sort(([left], [right]) => left.localeCompare(right))\n        .map(([key, item]) => [key, normalizeValue(item)]),\n    );\n  return value;\n};\n\n/*** Narrow a serializable non-array object to an indexable data record. */\nconst isDataRecord = (value: object): value is Readonly<Record<string, DataContractValue>> =>\n  !Array.isArray(value);\n\n/*** Narrow a serializable array without losing its element type. */\nconst isDataArray = (value: object): value is readonly DataContractValue[] => Array.isArray(value);\n\n/*** Translate host failures to structured contract errors without exposing arbitrary objects. */\nconst asFlowError = (reason: unknown): FlowError => ({\n  code:\n    reason instanceof Error && /^FLOW_[A-Z0-9_]+(?::|$)/.test(reason.message)\n      ? (reason.message.split(':')[0] ?? 'FLOW_OPERATION_FAILED')\n      : 'FLOW_OPERATION_FAILED',\n  message: 'The operation failed.',\n  retryable: false,\n});\n\n/*** Build the immutable run result emitted by the single-process executor. */\nconst createRun = (\n  graph: FlowCompiledGraph,\n  request: FlowRunRequest,\n  steps: readonly FlowStepSnapshot[],\n  startedAt: string,\n  completedAt: string,\n  status: FlowRunSnapshot['status'],\n  error?: FlowError,\n): FlowRunSnapshot => ({\n  id: request.runId,\n  flow: { id: graph.definition.id, version: graph.definition.version },\n  status,\n  trigger: { triggerId: request.triggerId, kind: 'manual' },\n  createdAt: startedAt,\n  startedAt,\n  completedAt,\n  steps,\n  error,\n});\n"]}

package/dist/features/execution/domain/assertFlowGraphSchemasSupported.d.ts

@@ -0,0 +1,5 @@
+import type { DataSchemaRegistry } from '@ankhorage/contracts/data';
+import type { FlowNode } from '@ankhorage/contracts/flow';
+/*** Validate every declared graph port schema before any operation can perform a side effect. */
+export declare const assertFlowGraphSchemasSupported: (nodes: readonly FlowNode[], schemas: DataSchemaRegistry | undefined) => void;
+//# sourceMappingURL=assertFlowGraphSchemasSupported.d.ts.map

package/dist/features/execution/domain/assertFlowGraphSchemasSupported.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertFlowGraphSchemasSupported.d.ts","sourceRoot":"","sources":["../../../../src/features/execution/domain/assertFlowGraphSchemasSupported.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAI1D,iGAAiG;AACjG,eAAO,MAAM,+BAA+B,GAC1C,OAAO,SAAS,QAAQ,EAAE,EAC1B,SAAS,kBAAkB,GAAG,SAAS,KACtC,IAOF,CAAC"}

package/dist/features/execution/domain/assertFlowGraphSchemasSupported.js

@@ -0,0 +1,11 @@
+import { assertFlowDataSchemaSupported } from './validateFlowDataSchema.js';
+/*** Validate every declared graph port schema before any operation can perform a side effect. */
+export const assertFlowGraphSchemasSupported = (nodes, schemas) => {
+    for (const node of nodes)
+        for (const port of node.ports) {
+            const schema = port.data?.schema ?? (port.data?.schemaRef ? { ref: port.data.schemaRef } : undefined);
+            if (schema)
+                assertFlowDataSchemaSupported(schema, schemas);
+        }
+};
+//# sourceMappingURL=assertFlowGraphSchemasSupported.js.map

package/dist/features/execution/domain/assertFlowGraphSchemasSupported.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertFlowGraphSchemasSupported.js","sourceRoot":"","sources":["../../../../src/features/execution/domain/assertFlowGraphSchemasSupported.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,6BAA6B,EAAE,MAAM,6BAA6B,CAAC;AAE5E,iGAAiG;AACjG,MAAM,CAAC,MAAM,+BAA+B,GAAG,CAC7C,KAA0B,EAC1B,OAAuC,EACjC,EAAE;IACR,KAAK,MAAM,IAAI,IAAI,KAAK;QACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,MAAM,GACV,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACzF,IAAI,MAAM;gBAAE,6BAA6B,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC7D,CAAC;AACL,CAAC,CAAC","sourcesContent":["import type { DataSchemaRegistry } from '@ankhorage/contracts/data';\nimport type { FlowNode } from '@ankhorage/contracts/flow';\n\nimport { assertFlowDataSchemaSupported } from './validateFlowDataSchema.js';\n\n/*** Validate every declared graph port schema before any operation can perform a side effect. */\nexport const assertFlowGraphSchemasSupported = (\n  nodes: readonly FlowNode[],\n  schemas: DataSchemaRegistry | undefined,\n): void => {\n  for (const node of nodes)\n    for (const port of node.ports) {\n      const schema =\n        port.data?.schema ?? (port.data?.schemaRef ? { ref: port.data.schemaRef } : undefined);\n      if (schema) assertFlowDataSchemaSupported(schema, schemas);\n    }\n};\n"]}

package/dist/features/execution/domain/compileFlowGraph.d.ts

@@ -0,0 +1,5 @@
+import type { FlowDefinition } from '@ankhorage/contracts/flow';
+import type { FlowCompiledGraph, FlowNodeRegistry } from '../../../types/execution.js';
+/*** Compile a valid acyclic graph into deterministic execution order. */
+export declare const compileFlowGraph: (definition: FlowDefinition, registry: FlowNodeRegistry) => FlowCompiledGraph;
+//# sourceMappingURL=compileFlowGraph.d.ts.map

package/dist/features/execution/domain/compileFlowGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compileFlowGraph.d.ts","sourceRoot":"","sources":["../../../../src/features/execution/domain/compileFlowGraph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAsB,MAAM,2BAA2B,CAAC;AAEpF,OAAO,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAEvF,yEAAyE;AACzE,eAAO,MAAM,gBAAgB,GAC3B,YAAY,cAAc,EAC1B,UAAU,gBAAgB,KACzB,iBAYF,CAAC"}

package/dist/features/execution/domain/compileFlowGraph.js

@@ -0,0 +1,76 @@
+/*** Compile a valid acyclic graph into deterministic execution order. */
+export const compileFlowGraph = (definition, registry) => {
+    const nodesById = indexNodes(definition.nodes);
+    const edgesBySourceNodeId = indexEdges(definition.edges, nodesById);
+    for (const node of definition.nodes)
+        assertNodeIsExecutable(node, registry);
+    return {
+        definition,
+        edgesBySourceNodeId,
+        topologicalNodeIds: orderNodes(definition.nodes.map(({ id }) => id), definition.edges),
+    };
+};
+/*** Index nodes while rejecting duplicate graph identifiers. */
+const indexNodes = (nodes) => {
+    const entries = nodes.map((node) => [node.id, node]);
+    if (new Set(entries.map(([id]) => id)).size !== entries.length)
+        throw new Error('FLOW_GRAPH_DUPLICATE_NODE_ID');
+    return Object.fromEntries(entries);
+};
+/*** Validate and group graph edges by their producing node. */
+const indexEdges = (edges, nodesById) => {
+    if (new Set(edges.map(({ id }) => id)).size !== edges.length)
+        throw new Error('FLOW_GRAPH_DUPLICATE_EDGE_ID');
+    for (const edge of edges) {
+        const source = nodesById[edge.source.nodeId];
+        const target = nodesById[edge.target.nodeId];
+        if (!source || !target)
+            throw new Error(`FLOW_GRAPH_UNKNOWN_EDGE_NODE:${edge.id}`);
+        assertPort(source, edge.source.portId, 'output', edge.id);
+        assertPort(target, edge.target.portId, 'input', edge.id);
+    }
+    return edges.reduce((grouped, edge) => ({
+        ...grouped,
+        [edge.source.nodeId]: [...(grouped[edge.source.nodeId] ?? []), edge],
+    }), {});
+};
+/*** Ensure a graph port exists exactly once with the expected direction. */
+const assertPort = (node, portId, direction, edgeId) => {
+    if (node.ports.filter((port) => port.id === portId && port.direction === direction).length !== 1)
+        throw new Error(`FLOW_GRAPH_INVALID_EDGE_PORT:${edgeId}`);
+};
+/*** Reject unknown operations and code capabilities before execution can begin. */
+const assertNodeIsExecutable = (node, registry) => {
+    const { capabilityId, providerId } = node.capability;
+    const operationId = `${providerId}:${capabilityId}`;
+    if (capabilityId === 'code')
+        throw new Error('FLOW_CODE_EXECUTION_DISABLED');
+    if (!Object.hasOwn(registry, operationId))
+        throw new Error(`FLOW_OPERATION_UNREGISTERED:${operationId}`);
+    if (new Set(node.ports.map(({ direction, id }) => `${direction}:${id}`)).size !== node.ports.length)
+        throw new Error(`FLOW_GRAPH_DUPLICATE_PORT_ID:${node.id}`);
+};
+/*** Produce stable topological order and reject cycles without an explicit bounded-loop contract. */
+const orderNodes = (nodeIds, edges) => {
+    const incomingCounts = new Map(nodeIds.map((nodeId) => [nodeId, 0]));
+    for (const edge of edges)
+        incomingCounts.set(edge.target.nodeId, (incomingCounts.get(edge.target.nodeId) ?? 0) + 1);
+    const pending = nodeIds.filter((nodeId) => incomingCounts.get(nodeId) === 0);
+    const ordered = [];
+    while (pending.length > 0) {
+        const nodeId = pending.shift();
+        if (!nodeId)
+            continue;
+        ordered.push(nodeId);
+        for (const edge of edges.filter((candidate) => candidate.source.nodeId === nodeId)) {
+            const nextCount = (incomingCounts.get(edge.target.nodeId) ?? 0) - 1;
+            incomingCounts.set(edge.target.nodeId, nextCount);
+            if (nextCount === 0)
+                pending.push(edge.target.nodeId);
+        }
+    }
+    if (ordered.length !== nodeIds.length)
+        throw new Error('FLOW_GRAPH_CYCLE');
+    return ordered;
+};
+//# sourceMappingURL=compileFlowGraph.js.map

package/dist/features/execution/domain/compileFlowGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compileFlowGraph.js","sourceRoot":"","sources":["../../../../src/features/execution/domain/compileFlowGraph.ts"],"names":[],"mappings":"AAIA,yEAAyE;AACzE,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,UAA0B,EAC1B,QAA0B,EACP,EAAE;IACrB,MAAM,SAAS,GAAG,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,mBAAmB,GAAG,UAAU,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACpE,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK;QAAE,sBAAsB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC5E,OAAO;QACL,UAAU;QACV,mBAAmB;QACnB,kBAAkB,EAAE,UAAU,CAC5B,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EACpC,UAAU,CAAC,KAAK,CACjB;KACF,CAAC;AACJ,CAAC,CAAC;AAEF,gEAAgE;AAChE,MAAM,UAAU,GAAG,CAAC,KAA0B,EAAsC,EAAE;IACpF,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAU,CAAC,CAAC;IAC9D,IAAI,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,MAAM;QAC5D,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,+DAA+D;AAC/D,MAAM,UAAU,GAAG,CACjB,KAA0B,EAC1B,SAA6C,EACE,EAAE;IACjD,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM;QAC1D,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACnF,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1D,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAClB,GAAG,OAAO;QACV,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC;KACrE,CAAC,EACF,EAAE,CACH,CAAC;AACJ,CAAC,CAAC;AAEF,4EAA4E;AAC5E,MAAM,UAAU,GAAG,CACjB,IAAc,EACd,MAAc,EACd,SAA6B,EAC7B,MAAc,EACR,EAAE;IACR,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,MAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC;QAC9F,MAAM,IAAI,KAAK,CAAC,gCAAgC,MAAM,EAAE,CAAC,CAAC;AAC9D,CAAC,CAAC;AAEF,mFAAmF;AACnF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,QAA0B,EAAQ,EAAE;IAClF,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;IACrD,MAAM,WAAW,GAAG,GAAG,UAAU,IAAI,YAAY,EAAE,CAAC;IACpD,IAAI,YAAY,KAAK,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAC7E,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,+BAA+B,WAAW,EAAE,CAAC,CAAC;IAChE,IACE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,SAAS,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM;QAE/F,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF,qGAAqG;AACrG,MAAM,UAAU,GAAG,CAAC,OAA0B,EAAE,KAA0B,EAAqB,EAAE;IAC/F,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,KAAK,MAAM,IAAI,IAAI,KAAK;QACtB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5F,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7E,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;YACnF,MAAM,SAAS,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YAClD,IAAI,SAAS,KAAK,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAC3E,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC","sourcesContent":["import type { FlowDefinition, FlowEdge, FlowNode } from '@ankhorage/contracts/flow';\n\nimport type { FlowCompiledGraph, FlowNodeRegistry } from '../../../types/execution.js';\n\n/*** Compile a valid acyclic graph into deterministic execution order. */\nexport const compileFlowGraph = (\n  definition: FlowDefinition,\n  registry: FlowNodeRegistry,\n): FlowCompiledGraph => {\n  const nodesById = indexNodes(definition.nodes);\n  const edgesBySourceNodeId = indexEdges(definition.edges, nodesById);\n  for (const node of definition.nodes) assertNodeIsExecutable(node, registry);\n  return {\n    definition,\n    edgesBySourceNodeId,\n    topologicalNodeIds: orderNodes(\n      definition.nodes.map(({ id }) => id),\n      definition.edges,\n    ),\n  };\n};\n\n/*** Index nodes while rejecting duplicate graph identifiers. */\nconst indexNodes = (nodes: readonly FlowNode[]): Readonly<Record<string, FlowNode>> => {\n  const entries = nodes.map((node) => [node.id, node] as const);\n  if (new Set(entries.map(([id]) => id)).size !== entries.length)\n    throw new Error('FLOW_GRAPH_DUPLICATE_NODE_ID');\n  return Object.fromEntries(entries);\n};\n\n/*** Validate and group graph edges by their producing node. */\nconst indexEdges = (\n  edges: readonly FlowEdge[],\n  nodesById: Readonly<Record<string, FlowNode>>,\n): Readonly<Record<string, readonly FlowEdge[]>> => {\n  if (new Set(edges.map(({ id }) => id)).size !== edges.length)\n    throw new Error('FLOW_GRAPH_DUPLICATE_EDGE_ID');\n  for (const edge of edges) {\n    const source = nodesById[edge.source.nodeId];\n    const target = nodesById[edge.target.nodeId];\n    if (!source || !target) throw new Error(`FLOW_GRAPH_UNKNOWN_EDGE_NODE:${edge.id}`);\n    assertPort(source, edge.source.portId, 'output', edge.id);\n    assertPort(target, edge.target.portId, 'input', edge.id);\n  }\n  return edges.reduce<Readonly<Record<string, readonly FlowEdge[]>>>(\n    (grouped, edge) => ({\n      ...grouped,\n      [edge.source.nodeId]: [...(grouped[edge.source.nodeId] ?? []), edge],\n    }),\n    {},\n  );\n};\n\n/*** Ensure a graph port exists exactly once with the expected direction. */\nconst assertPort = (\n  node: FlowNode,\n  portId: string,\n  direction: 'input' | 'output',\n  edgeId: string,\n): void => {\n  if (node.ports.filter((port) => port.id === portId && port.direction === direction).length !== 1)\n    throw new Error(`FLOW_GRAPH_INVALID_EDGE_PORT:${edgeId}`);\n};\n\n/*** Reject unknown operations and code capabilities before execution can begin. */\nconst assertNodeIsExecutable = (node: FlowNode, registry: FlowNodeRegistry): void => {\n  const { capabilityId, providerId } = node.capability;\n  const operationId = `${providerId}:${capabilityId}`;\n  if (capabilityId === 'code') throw new Error('FLOW_CODE_EXECUTION_DISABLED');\n  if (!Object.hasOwn(registry, operationId))\n    throw new Error(`FLOW_OPERATION_UNREGISTERED:${operationId}`);\n  if (\n    new Set(node.ports.map(({ direction, id }) => `${direction}:${id}`)).size !== node.ports.length\n  )\n    throw new Error(`FLOW_GRAPH_DUPLICATE_PORT_ID:${node.id}`);\n};\n\n/*** Produce stable topological order and reject cycles without an explicit bounded-loop contract. */\nconst orderNodes = (nodeIds: readonly string[], edges: readonly FlowEdge[]): readonly string[] => {\n  const incomingCounts = new Map(nodeIds.map((nodeId) => [nodeId, 0]));\n  for (const edge of edges)\n    incomingCounts.set(edge.target.nodeId, (incomingCounts.get(edge.target.nodeId) ?? 0) + 1);\n  const pending = nodeIds.filter((nodeId) => incomingCounts.get(nodeId) === 0);\n  const ordered: string[] = [];\n  while (pending.length > 0) {\n    const nodeId = pending.shift();\n    if (!nodeId) continue;\n    ordered.push(nodeId);\n    for (const edge of edges.filter((candidate) => candidate.source.nodeId === nodeId)) {\n      const nextCount = (incomingCounts.get(edge.target.nodeId) ?? 0) - 1;\n      incomingCounts.set(edge.target.nodeId, nextCount);\n      if (nextCount === 0) pending.push(edge.target.nodeId);\n    }\n  }\n  if (ordered.length !== nodeIds.length) throw new Error('FLOW_GRAPH_CYCLE');\n  return ordered;\n};\n"]}

package/dist/features/execution/domain/createDefaultNodeRegistry.d.ts

@@ -0,0 +1,4 @@
+import type { FlowNodeRegistry } from '../../../types/execution.js';
+/*** Create the built-in operations that have no provider or host dependency. */
+export declare const createDefaultNodeRegistry: () => FlowNodeRegistry;
+//# sourceMappingURL=createDefaultNodeRegistry.d.ts.map

package/dist/features/execution/domain/createDefaultNodeRegistry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"createDefaultNodeRegistry.d.ts","sourceRoot":"","sources":["../../../../src/features/execution/domain/createDefaultNodeRegistry.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAqB,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAEvF,gFAAgF;AAChF,eAAO,MAAM,yBAAyB,QAAO,gBAI3C,CAAC"}

package/dist/features/execution/domain/createDefaultNodeRegistry.js

@@ -0,0 +1,15 @@
+/*** Create the built-in operations that have no provider or host dependency. */
+export const createDefaultNodeRegistry = () => ({
+    'flow:condition': { executeAsync: () => Promise.resolve({}) },
+    'flow:noop': { executeAsync: () => Promise.resolve({}) },
+    'flow:transform': { executeAsync: transformAsync },
+});
+/*** Copy configured inline or artifact values to matching output ports without evaluating code. */
+const transformAsync = ({ config, node }) => {
+    const outputIds = new Set(node.ports.filter((port) => port.direction === 'output').map(({ id }) => id));
+    const output = Object.fromEntries(Object.entries(config ?? {}).filter((entry) => outputIds.has(entry[0]) && isDataRef(entry[1])));
+    return Promise.resolve({ output });
+};
+/*** Narrow a configuration value to data that may safely leave a node. */
+const isDataRef = (value) => value.kind !== 'secret';
+//# sourceMappingURL=createDefaultNodeRegistry.js.map

package/dist/features/execution/domain/createDefaultNodeRegistry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"createDefaultNodeRegistry.js","sourceRoot":"","sources":["../../../../src/features/execution/domain/createDefaultNodeRegistry.ts"],"names":[],"mappings":"AAIA,gFAAgF;AAChF,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAqB,EAAE,CAAC,CAAC;IAChE,gBAAgB,EAAE,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;IAC7D,WAAW,EAAE,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;IACxD,gBAAgB,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE;CACnD,CAAC,CAAC;AAEH,mGAAmG;AACnG,MAAM,cAAc,GAAsC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE;IAC7E,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAC7E,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAC/B,MAAM,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CACjC,CAAC,KAAK,EAAkC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAC1F,CACF,CAAC;IACF,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,0EAA0E;AAC1E,MAAM,SAAS,GAAG,CAAC,KAA0B,EAAwB,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC","sourcesContent":["import type { FlowDataRef, FlowNodeConfigValue } from '@ankhorage/contracts/flow';\n\nimport type { FlowNodeOperation, FlowNodeRegistry } from '../../../types/execution.js';\n\n/*** Create the built-in operations that have no provider or host dependency. */\nexport const createDefaultNodeRegistry = (): FlowNodeRegistry => ({\n  'flow:condition': { executeAsync: () => Promise.resolve({}) },\n  'flow:noop': { executeAsync: () => Promise.resolve({}) },\n  'flow:transform': { executeAsync: transformAsync },\n});\n\n/*** Copy configured inline or artifact values to matching output ports without evaluating code. */\nconst transformAsync: FlowNodeOperation['executeAsync'] = ({ config, node }) => {\n  const outputIds = new Set(\n    node.ports.filter((port) => port.direction === 'output').map(({ id }) => id),\n  );\n  const output = Object.fromEntries(\n    Object.entries(config ?? {}).filter(\n      (entry): entry is [string, FlowDataRef] => outputIds.has(entry[0]) && isDataRef(entry[1]),\n    ),\n  );\n  return Promise.resolve({ output });\n};\n\n/*** Narrow a configuration value to data that may safely leave a node. */\nconst isDataRef = (value: FlowNodeConfigValue): value is FlowDataRef => value.kind !== 'secret';\n"]}

package/dist/features/execution/domain/validateFlowDataSchema.d.ts

@@ -0,0 +1,6 @@
+import type { DataContractValue, DataSchema, DataSchemaRegistry } from '@ankhorage/contracts/data';
+/*** Validate serializable data against the supported portable schema vocabulary. */
+export declare const validateFlowDataSchema: (value: DataContractValue, schema: DataSchema, schemas: DataSchemaRegistry | undefined) => boolean;
+/*** Reject unsupported, unresolved, cyclic, or excessively nested portable schemas before use. */
+export declare const assertFlowDataSchemaSupported: (schema: DataSchema, schemas: DataSchemaRegistry | undefined) => void;
+//# sourceMappingURL=validateFlowDataSchema.d.ts.map

package/dist/features/execution/domain/validateFlowDataSchema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validateFlowDataSchema.d.ts","sourceRoot":"","sources":["../../../../src/features/execution/domain/validateFlowDataSchema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAInG,oFAAoF;AACpF,eAAO,MAAM,sBAAsB,GACjC,OAAO,iBAAiB,EACxB,QAAQ,UAAU,EAClB,SAAS,kBAAkB,GAAG,SAAS,KACtC,OAGF,CAAC;AAEF,kGAAkG;AAClG,eAAO,MAAM,6BAA6B,GACxC,QAAQ,UAAU,EAClB,SAAS,kBAAkB,GAAG,SAAS,KACtC,IAAsE,CAAC"}