@nifrajs/coding-agent 3.2.0

package/dist/orchestration/catalog.js

@@ -0,0 +1,46 @@
+/**
+ * The StepCatalog: the local, closure-holding registry that resolves a plan node's `step` name to a
+ * runnable handler. A {@link RunPlan} is serializable and content-free precisely because it names
+ * steps by string; the executable behavior lives here, in-process, and never in the plan.
+ *
+ * A step declares a `version` and the `capabilities` it needs. The compiler uses both to fail closed:
+ * a node that pins a drifted version, or a step that needs a capability the host did not grant, is
+ * rejected before any node runs (ORC-05, ORC-07).
+ */
+/** Thrown on a catalog construction fault: a key collision across merged catalogs. */
+export class CatalogError extends Error {
+    reason;
+    constructor(reason) {
+        super(`step catalog: ${reason}`);
+        this.reason = reason;
+        this.name = "CatalogError";
+    }
+}
+/** The effective version of a step (defaults to 1). */
+export function stepVersion(step) {
+    return step.version ?? 1;
+}
+function fromMap(map) {
+    return {
+        get: (step) => map.get(step),
+        has: (step) => map.has(step),
+        keys: Object.freeze([...map.keys()].sort()),
+    };
+}
+/** Build a StepCatalog from a name -> handler map. */
+export function createStepCatalog(entries) {
+    return fromMap(new Map(Object.entries(entries)));
+}
+/** Merge catalogs into one. Throws {@link CatalogError} on any duplicate step key (collision). */
+export function mergeStepCatalogs(...catalogs) {
+    const map = new Map();
+    for (const catalog of catalogs) {
+        for (const key of catalog.keys) {
+            if (map.has(key))
+                throw new CatalogError(`duplicate step key '${key}'`);
+            map.set(key, catalog.get(key));
+        }
+    }
+    return fromMap(map);
+}
+//# sourceMappingURL=catalog.js.map

package/dist/orchestration/catalog.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"catalog.js","sourceRoot":"","sources":["../../src/orchestration/catalog.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAiDH,sFAAsF;AACtF,MAAM,OAAO,YAAa,SAAQ,KAAK;IAChB;IAArB,YAAqB,MAAc;QACjC,KAAK,CAAC,iBAAiB,MAAM,EAAE,CAAC,CAAA;QADb,WAAM,GAAN,MAAM,CAAQ;QAEjC,IAAI,CAAC,IAAI,GAAG,cAAc,CAAA;IAC5B,CAAC;CACF;AAED,uDAAuD;AACvD,MAAM,UAAU,WAAW,CAAC,IAAiB;IAC3C,OAAO,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;AAC1B,CAAC;AAUD,SAAS,OAAO,CAAC,GAAqC;IACpD,OAAO;QACL,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;QAC5B,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;QAC5B,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;KAC5C,CAAA;AACH,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,iBAAiB,CAAC,OAA8C;IAC9E,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AAClD,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,iBAAiB,CAAC,GAAG,QAAgC;IACnE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC1C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;YAC/B,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,IAAI,YAAY,CAAC,uBAAuB,GAAG,GAAG,CAAC,CAAA;YACvE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAgB,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAA;AACrB,CAAC"}

package/dist/orchestration/compile.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Compile a declarative {@link RunPlan} into the existing {@link WorkflowRunner} step tree. There is
+ * no second execution engine and no copied scheduler: the plan's top-level DAG is layered
+ * (deterministic, id tie-break) into the kernel's `sequence`/`parallel` primitives, and every node -
+ * leaf or structural - is lowered onto `task`/`verify`/`approve`/`checkpoint`/`handoff`/`retry`/
+ * `branch` steps or, for a `subagent` node, onto a {@link BoundedSubagentRunner}. Effect-key
+ * derivation and the artifact sink are wired into each leaf closure at compile time.
+ *
+ * All structural ceilings (node count, nesting depth, parallel breadth, pinned version, and the
+ * capability authority ceiling) are enforced here, before a single node runs.
+ */
+import type { ArtifactPort, ArtifactRef, NodeEffectKey, RunPlan } from "@nifrajs/agent-protocol";
+import type { WorkflowStep } from "../workflows.js";
+import { type StepCatalog } from "./catalog.js";
+/** Thrown when a plan cannot be lowered. `code` is a stable evidence code. */
+export declare class CompileError extends Error {
+    readonly code: string;
+    constructor(reason: string, code: string);
+}
+/** Host-owned ceilings. A plan can only tighten, never widen, these. */
+export interface OrchestrationLimits {
+    /** Total nodes in the whole tree. Default 256. */
+    readonly maxNodes?: number;
+    /** Maximum structural nesting depth. Default 8. */
+    readonly maxDepth?: number;
+    /** Host concurrency ceiling for any parallel layer or node. Default: the child count. */
+    readonly maxParallel?: number;
+    /** Bounded-subagent child ceiling. Default 4. */
+    readonly maxChildren?: number;
+    /** Capability authority ceiling. `undefined` grants all; otherwise a step's needs must be a subset. */
+    readonly allowedCapabilities?: readonly string[];
+}
+/** Stable digest of a plan's canonical form. Structural identity that node effect keys hang from. */
+export declare function digestRunPlan(plan: RunPlan): Promise<string>;
+/** Wiring the compiler injects into every node closure. */
+export interface CompileOptions {
+    readonly catalog: StepCatalog;
+    readonly planDigest: string;
+    readonly artifactPort: ArtifactPort;
+    readonly limits?: OrchestrationLimits;
+    /** Called once a node's content-free effect key is derived (idempotent steps only). */
+    onNodeEffect?(nodeId: string, key: NodeEffectKey): void;
+    /** Called for each artifact ref a node produces through its port. */
+    collectArtifact?(nodeId: string, ref: ArtifactRef): void;
+}
+/**
+ * Compile `source` (a RunPlan or its serialized form) into a single WorkflowStep. The input is
+ * always re-parsed through {@link parseRunPlan}, so a malformed or content-bearing plan fails closed.
+ */
+export declare function compileRunPlan(source: RunPlan | unknown, options: CompileOptions): WorkflowStep;
+/**
+ * Compile `source` into one {@link WorkflowStep} per top-level DAG layer, preserving the same
+ * ceilings and lowering as {@link compileRunPlan}. A driver can run the layers in order and hold at
+ * a layer boundary (a safe-pause point) without a second scheduler: each layer is still executed by
+ * the kernel {@link WorkflowRunner}, and the layer split is the very partition compileRunPlan folds
+ * into a single `sequence`.
+ */
+export declare function compileRunPlanLayers(source: RunPlan | unknown, options: CompileOptions): readonly WorkflowStep[];
+//# sourceMappingURL=compile.d.ts.map

package/dist/orchestration/compile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile.d.ts","sourceRoot":"","sources":["../../src/orchestration/compile.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAEV,YAAY,EACZ,WAAW,EACX,aAAa,EAEb,OAAO,EACR,MAAM,yBAAyB,CAAA;AAGhC,OAAO,KAAK,EAAmB,YAAY,EAAE,MAAM,iBAAiB,CAAA;AACpE,OAAO,EAAoB,KAAK,WAAW,EAAoC,MAAM,cAAc,CAAA;AAInG,8EAA8E;AAC9E,qBAAa,YAAa,SAAQ,KAAK;IAGnC,QAAQ,CAAC,IAAI,EAAE,MAAM;gBADrB,MAAM,EAAE,MAAM,EACL,IAAI,EAAE,MAAM;CAKxB;AAED,wEAAwE;AACxE,MAAM,WAAW,mBAAmB;IAClC,kDAAkD;IAClD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;IAC1B,yFAAyF;IACzF,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,uGAAuG;IACvG,QAAQ,CAAC,mBAAmB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CACjD;AAMD,qGAAqG;AACrG,wBAAgB,aAAa,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAE5D;AAED,2DAA2D;AAC3D,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAA;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAA;IACnC,QAAQ,CAAC,MAAM,CAAC,EAAE,mBAAmB,CAAA;IACrC,uFAAuF;IACvF,YAAY,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,GAAG,IAAI,CAAA;IACvD,qEAAqE;IACrE,eAAe,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,GAAG,IAAI,CAAA;CACzD;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,EAAE,OAAO,EAAE,cAAc,GAAG,YAAY,CAK/F;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,OAAO,GAAG,OAAO,EACzB,OAAO,EAAE,cAAc,GACtB,SAAS,YAAY,EAAE,CAUzB"}

package/dist/orchestration/compile.js

@@ -0,0 +1,268 @@
+/**
+ * Compile a declarative {@link RunPlan} into the existing {@link WorkflowRunner} step tree. There is
+ * no second execution engine and no copied scheduler: the plan's top-level DAG is layered
+ * (deterministic, id tie-break) into the kernel's `sequence`/`parallel` primitives, and every node -
+ * leaf or structural - is lowered onto `task`/`verify`/`approve`/`checkpoint`/`handoff`/`retry`/
+ * `branch` steps or, for a `subagent` node, onto a {@link BoundedSubagentRunner}. Effect-key
+ * derivation and the artifact sink are wired into each leaf closure at compile time.
+ *
+ * All structural ceilings (node count, nesting depth, parallel breadth, pinned version, and the
+ * capability authority ceiling) are enforced here, before a single node runs.
+ */
+import { parseRunPlan } from "@nifrajs/agent-protocol";
+import { BoundedSubagentRunner } from "../subagents.js";
+import { stepVersion } from "./catalog.js";
+import { deriveNodeEffectKey } from "./effect-key.js";
+import { canonicalJson, sha256HexOf } from "./hash.js";
+/** Thrown when a plan cannot be lowered. `code` is a stable evidence code. */
+export class CompileError extends Error {
+    code;
+    constructor(reason, code) {
+        super(`orchestration compile: ${reason}`);
+        this.code = code;
+        this.name = "CompileError";
+    }
+}
+const DEFAULT_MAX_NODES = 256;
+const DEFAULT_MAX_DEPTH = 8;
+const DEFAULT_MAX_CHILDREN = 4;
+/** Stable digest of a plan's canonical form. Structural identity that node effect keys hang from. */
+export function digestRunPlan(plan) {
+    return sha256HexOf(canonicalJson(plan));
+}
+/**
+ * Compile `source` (a RunPlan or its serialized form) into a single WorkflowStep. The input is
+ * always re-parsed through {@link parseRunPlan}, so a malformed or content-bearing plan fails closed.
+ */
+export function compileRunPlan(source, options) {
+    const layerSteps = compileRunPlanLayers(source, options);
+    return layerSteps.length === 1
+        ? layerSteps[0]
+        : { type: "sequence", steps: layerSteps };
+}
+/**
+ * Compile `source` into one {@link WorkflowStep} per top-level DAG layer, preserving the same
+ * ceilings and lowering as {@link compileRunPlan}. A driver can run the layers in order and hold at
+ * a layer boundary (a safe-pause point) without a second scheduler: each layer is still executed by
+ * the kernel {@link WorkflowRunner}, and the layer split is the very partition compileRunPlan folds
+ * into a single `sequence`.
+ */
+export function compileRunPlanLayers(source, options) {
+    const plan = parseRunPlan(source);
+    const limits = options.limits ?? {};
+    const total = plan.nodes.reduce((sum, node) => sum + countNodes(node), 0);
+    const maxNodes = limits.maxNodes ?? DEFAULT_MAX_NODES;
+    if (total > maxNodes)
+        throw new CompileError(`plan has ${total} nodes over the ${maxNodes} ceiling`, "E_MAX_NODES");
+    const layers = layerTopLevel(plan.nodes);
+    return layers.map((layer) => compileLayer(layer, options, 1));
+}
+/** Recursive node count over the whole tree. */
+function countNodes(node) {
+    switch (node.kind) {
+        case "sequence":
+        case "parallel":
+            return 1 + node.children.reduce((sum, child) => sum + countNodes(child), 0);
+        case "retry":
+            return 1 + countNodes(node.child);
+        case "branch":
+            return 1 + countNodes(node.then) + (node.otherwise ? countNodes(node.otherwise) : 0);
+        default:
+            return 1;
+    }
+}
+/**
+ * Kahn layering of the top-level DAG. Each layer is every node whose dependencies are already
+ * emitted, sorted by id for determinism. A layer with more than one node becomes a bounded parallel.
+ */
+function layerTopLevel(nodes) {
+    const byId = new Map(nodes.map((node) => [node.id, node]));
+    const remaining = new Set(nodes.map((node) => node.id));
+    const emitted = new Set();
+    const layers = [];
+    while (remaining.size > 0) {
+        const ready = [...remaining]
+            .filter((id) => (byId.get(id)?.dependsOn ?? []).every((dep) => emitted.has(dep)))
+            .sort();
+        if (ready.length === 0)
+            throw new CompileError("run plan has a dependency cycle", "E_CYCLE");
+        for (const id of ready) {
+            emitted.add(id);
+            remaining.delete(id);
+        }
+        layers.push(ready.map((id) => byId.get(id)));
+    }
+    return layers;
+}
+function compileLayer(layer, options, depth) {
+    if (layer.length === 1)
+        return compileNode(layer[0], options, depth);
+    const steps = layer.map((node) => compileNode(node, options, depth));
+    return { type: "parallel", steps, maxConcurrency: concurrency(steps.length, undefined, options) };
+}
+/** Effective concurrency: the lower of plan request, host ceiling, and child count. */
+function concurrency(breadth, requested, options) {
+    const host = options.limits?.maxParallel ?? breadth;
+    return Math.max(1, Math.min(breadth, requested ?? breadth, host));
+}
+function compileNode(node, options, depth) {
+    const maxDepth = options.limits?.maxDepth ?? DEFAULT_MAX_DEPTH;
+    if (depth > maxDepth)
+        throw new CompileError(`node '${node.id}' nests past the ${maxDepth} depth ceiling`, "E_MAX_DEPTH");
+    switch (node.kind) {
+        case "sequence":
+            return {
+                type: "sequence",
+                steps: node.children.map((c) => compileNode(c, options, depth + 1)),
+            };
+        case "parallel": {
+            const steps = node.children.map((c) => compileNode(c, options, depth + 1));
+            return {
+                type: "parallel",
+                steps,
+                maxConcurrency: concurrency(steps.length, node.maxConcurrency, options),
+            };
+        }
+        case "retry": {
+            const step = {
+                type: "retry",
+                step: compileNode(node.child, options, depth + 1),
+                attempts: node.attempts,
+                ...(node.backoffMs !== undefined ? { backoffMs: node.backoffMs } : {}),
+            };
+            return step;
+        }
+        case "branch": {
+            const predicate = resolveStep(node, options);
+            if (typeof predicate.when !== "function")
+                throw new CompileError(`branch node '${node.id}' step declares no predicate`, "E_MISSING_HANDLER");
+            return {
+                type: "branch",
+                id: node.id,
+                when: (wf) => Promise.resolve(predicate.when(makeContext(node, options, wf))),
+                // biome-ignore lint/suspicious/noThenProperty: the workflow branch step names its arms then/otherwise.
+                then: compileNode(node.then, options, depth + 1),
+                ...(node.otherwise !== undefined
+                    ? { otherwise: compileNode(node.otherwise, options, depth + 1) }
+                    : {}),
+            };
+        }
+        default:
+            return compileLeaf(node, options);
+    }
+}
+/** Resolve and validate the catalog step behind a leaf or branch node. */
+function resolveStep(node, options) {
+    const step = options.catalog.get(node.step);
+    if (step === undefined)
+        throw new CompileError(`node '${node.id}' references unknown step '${node.step}'`, "E_UNKNOWN_STEP");
+    if (step.kind !== node.kind)
+        throw new CompileError(`node '${node.id}' kind '${node.kind}' does not match catalog step kind '${step.kind}'`, "E_KIND_MISMATCH");
+    if ("stepVersion" in node &&
+        node.stepVersion !== undefined &&
+        stepVersion(step) !== node.stepVersion)
+        throw new CompileError(`node '${node.id}' pins step version ${node.stepVersion} but catalog has ${stepVersion(step)}`, "E_VERSION_DRIFT");
+    const allowed = options.limits?.allowedCapabilities;
+    if (allowed !== undefined) {
+        const granted = new Set(allowed);
+        const denied = (step.capabilities ?? []).find((cap) => !granted.has(cap));
+        if (denied !== undefined)
+            throw new CompileError(`node '${node.id}' needs ungranted capability '${denied}'`, "E_CAPABILITY");
+    }
+    return step;
+}
+function compileLeaf(node, options) {
+    const step = resolveStep(node, options);
+    const base = buildLeafStep(node, step, options);
+    const retry = "retry" in node ? node.retry : undefined;
+    if (retry === undefined)
+        return base;
+    return {
+        type: "retry",
+        step: base,
+        attempts: retry.attempts,
+        ...(retry.backoffMs !== undefined ? { backoffMs: retry.backoffMs } : {}),
+    };
+}
+function buildLeafStep(node, step, options) {
+    const id = node.id;
+    switch (node.kind) {
+        case "subagent": {
+            if (step.executor === undefined || typeof step.spec !== "function")
+                throw new CompileError(`subagent node '${id}' step declares no executor or spec`, "E_MISSING_HANDLER");
+            return { type: "task", id, run: (wf) => runSubagent(node, step, options, wf) };
+        }
+        case "verify":
+            return { type: "verify", id, run: (wf) => runLeaf(node, step, options, wf) };
+        case "approve":
+            return {
+                type: "approve",
+                id,
+                reason: "reason" in node && node.reason !== undefined ? node.reason : "",
+                run: (wf) => runLeaf(node, step, options, wf),
+            };
+        case "checkpoint":
+            return { type: "checkpoint", id, run: (wf) => runLeaf(node, step, options, wf) };
+        case "handoff":
+            return { type: "handoff", id, run: (wf) => runLeaf(node, step, options, wf) };
+        default:
+            return { type: "task", id, run: (wf) => runLeaf(node, step, options, wf) };
+    }
+}
+/** Build the step context, wiring the artifact collector and effect-key derivation. */
+function makeContext(node, options, wf) {
+    const artifact = {
+        put: async (payload, ctx) => {
+            const ref = await options.artifactPort.put(payload, ctx);
+            options.collectArtifact?.(node.id, ref);
+            return ref;
+        },
+    };
+    return {
+        nodeId: node.id,
+        planDigest: options.planDigest,
+        signal: wf.signal,
+        artifact,
+        values: wf.values,
+        set: (name, value) => wf.set(name, value),
+    };
+}
+async function deriveEffect(node, step, options, wf) {
+    if (step.selectEffect === undefined)
+        return;
+    const selector = step.selectEffect({
+        nodeId: node.id,
+        planDigest: options.planDigest,
+        values: wf.values,
+    });
+    const key = await deriveNodeEffectKey({
+        planDigest: options.planDigest,
+        nodeId: node.id,
+        selector,
+    });
+    options.onNodeEffect?.(node.id, key);
+}
+async function runLeaf(node, step, options, wf) {
+    if (typeof step.run !== "function")
+        throw new CompileError(`node '${node.id}' step declares no run body`, "E_MISSING_HANDLER");
+    const context = makeContext(node, options, wf);
+    await deriveEffect(node, step, options, wf);
+    return step.run(context);
+}
+async function runSubagent(node, step, options, wf) {
+    const context = makeContext(node, options, wf);
+    await deriveEffect(node, step, options, wf);
+    const runner = new BoundedSubagentRunner(step.executor, {
+        maxChildren: options.limits?.maxChildren ?? DEFAULT_MAX_CHILDREN,
+        signal: wf.signal,
+        ...(options.limits?.allowedCapabilities !== undefined
+            ? { allowedCapabilities: options.limits.allowedCapabilities }
+            : {}),
+    });
+    const spec = await step.spec(context);
+    const result = await runner.run(spec);
+    if (!result.ok)
+        throw new Error(result.error ?? `subagent '${node.id}' failed`);
+    return result.output;
+}
+//# sourceMappingURL=compile.js.map

package/dist/orchestration/compile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile.js","sourceRoot":"","sources":["../../src/orchestration/compile.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAUH,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAA;AACtD,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAA;AAEvD,OAAO,EAA2D,WAAW,EAAE,MAAM,cAAc,CAAA;AACnG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAA;AACrD,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAEtD,8EAA8E;AAC9E,MAAM,OAAO,YAAa,SAAQ,KAAK;IAG1B;IAFX,YACE,MAAc,EACL,IAAY;QAErB,KAAK,CAAC,0BAA0B,MAAM,EAAE,CAAC,CAAA;QAFhC,SAAI,GAAJ,IAAI,CAAQ;QAGrB,IAAI,CAAC,IAAI,GAAG,cAAc,CAAA;IAC5B,CAAC;CACF;AAgBD,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAC7B,MAAM,iBAAiB,GAAG,CAAC,CAAA;AAC3B,MAAM,oBAAoB,GAAG,CAAC,CAAA;AAE9B,qGAAqG;AACrG,MAAM,UAAU,aAAa,CAAC,IAAa;IACzC,OAAO,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAA;AACzC,CAAC;AAcD;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAyB,EAAE,OAAuB;IAC/E,MAAM,UAAU,GAAG,oBAAoB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IACxD,OAAO,UAAU,CAAC,MAAM,KAAK,CAAC;QAC5B,CAAC,CAAE,UAAU,CAAC,CAAC,CAAkB;QACjC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,CAAA;AAC7C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAyB,EACzB,OAAuB;IAEvB,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAA;IACjC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAA;IACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;IACzE,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,iBAAiB,CAAA;IACrD,IAAI,KAAK,GAAG,QAAQ;QAClB,MAAM,IAAI,YAAY,CAAC,YAAY,KAAK,mBAAmB,QAAQ,UAAU,EAAE,aAAa,CAAC,CAAA;IAE/F,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACxC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAA;AAC/D,CAAC;AAED,gDAAgD;AAChD,SAAS,UAAU,CAAC,IAAa;IAC/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU;YACb,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;QAC7E,KAAK,OAAO;YACV,OAAO,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACnC,KAAK,QAAQ;YACX,OAAO,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACtF;YACE,OAAO,CAAC,CAAA;IACZ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,KAAyB;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAU,CAAC,CAAC,CAAA;IACnE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,MAAM,GAAgB,EAAE,CAAA;IAC9B,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC;aACzB,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;aAChF,IAAI,EAAE,CAAA;QACT,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,EAAE,SAAS,CAAC,CAAA;QAC5F,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACf,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QACtB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAY,CAAC,CAAC,CAAA;IACzD,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,YAAY,CACnB,KAAyB,EACzB,OAAuB,EACvB,KAAa;IAEb,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,CAAY,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IAC/E,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;IACpE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,CAAA;AACnG,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAClB,OAAe,EACf,SAA6B,EAC7B,OAAuB;IAEvB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,IAAI,OAAO,CAAA;IACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,IAAI,OAAO,EAAE,IAAI,CAAC,CAAC,CAAA;AACnE,CAAC;AAED,SAAS,WAAW,CAAC,IAAa,EAAE,OAAuB,EAAE,KAAa;IACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,QAAQ,IAAI,iBAAiB,CAAA;IAC9D,IAAI,KAAK,GAAG,QAAQ;QAClB,MAAM,IAAI,YAAY,CACpB,SAAS,IAAI,CAAC,EAAE,oBAAoB,QAAQ,gBAAgB,EAC5D,aAAa,CACd,CAAA;IAEH,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;aACpE,CAAA;QACH,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA;YAC1E,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,KAAK;gBACL,cAAc,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,CAAC;aACxE,CAAA;QACH,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAiB;gBACzB,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC;gBACjD,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACvE,CAAA;YACD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;YAC5C,IAAI,OAAO,SAAS,CAAC,IAAI,KAAK,UAAU;gBACtC,MAAM,IAAI,YAAY,CACpB,gBAAgB,IAAI,CAAC,EAAE,8BAA8B,EACrD,mBAAmB,CACpB,CAAA;YACH,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,IAAK,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC9E,uGAAuG;gBACvG,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC;gBAChD,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS;oBAC9B,CAAC,CAAC,EAAE,SAAS,EAAE,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE;oBAChE,CAAC,CAAC,EAAE,CAAC;aACR,CAAA;QACH,CAAC;QACD;YACE,OAAO,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;IACrC,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,SAAS,WAAW,CAClB,IAAiD,EACjD,OAAuB;IAEvB,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC3C,IAAI,IAAI,KAAK,SAAS;QACpB,MAAM,IAAI,YAAY,CACpB,SAAS,IAAI,CAAC,EAAE,8BAA8B,IAAI,CAAC,IAAI,GAAG,EAC1D,gBAAgB,CACjB,CAAA;IACH,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;QACzB,MAAM,IAAI,YAAY,CACpB,SAAS,IAAI,CAAC,EAAE,WAAW,IAAI,CAAC,IAAI,uCAAuC,IAAI,CAAC,IAAI,GAAG,EACvF,iBAAiB,CAClB,CAAA;IACH,IACE,aAAa,IAAI,IAAI;QACrB,IAAI,CAAC,WAAW,KAAK,SAAS;QAC9B,WAAW,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,WAAW;QAEtC,MAAM,IAAI,YAAY,CACpB,SAAS,IAAI,CAAC,EAAE,uBAAuB,IAAI,CAAC,WAAW,oBAAoB,WAAW,CAAC,IAAI,CAAC,EAAE,EAC9F,iBAAiB,CAClB,CAAA;IACH,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,mBAAmB,CAAA;IACnD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;QAChC,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACzE,IAAI,MAAM,KAAK,SAAS;YACtB,MAAM,IAAI,YAAY,CACpB,SAAS,IAAI,CAAC,EAAE,iCAAiC,MAAM,GAAG,EAC1D,cAAc,CACf,CAAA;IACL,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,WAAW,CAClB,IAAwE,EACxE,OAAuB;IAEvB,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;IACvC,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IAC/C,MAAM,KAAK,GAAG,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAA;IACtD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACpC,OAAO;QACL,IAAI,EAAE,OAAO;QACb,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,GAAG,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzE,CAAA;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAa,EAAE,IAAiB,EAAE,OAAuB;IAC9E,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;IAClB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU;gBAChE,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAAE,qCAAqC,EACzD,mBAAmB,CACpB,CAAA;YACH,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,CAAA;QAChF,CAAC;QACD,KAAK,QAAQ;YACX,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,CAAA;QAC9E,KAAK,SAAS;YACZ,OAAO;gBACL,IAAI,EAAE,SAAS;gBACf,EAAE;gBACF,MAAM,EAAE,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;gBACxE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC;aAC9C,CAAA;QACH,KAAK,YAAY;YACf,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,CAAA;QAClF,KAAK,SAAS;YACZ,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,CAAA;QAC/E;YACE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,CAAA;IAC9E,CAAC;AACH,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAAC,IAAa,EAAE,OAAuB,EAAE,EAAmB;IAC9E,MAAM,QAAQ,GAAiB;QAC7B,GAAG,EAAE,KAAK,EAAE,OAAmB,EAAE,GAAoB,EAAwB,EAAE;YAC7E,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;YACxD,OAAO,CAAC,eAAe,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YACvC,OAAO,GAAG,CAAA;QACZ,CAAC;KACF,CAAA;IACD,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,EAAE;QACf,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,MAAM,EAAE,EAAE,CAAC,MAAM;QACjB,QAAQ;QACR,MAAM,EAAE,EAAE,CAAC,MAAM;QACjB,GAAG,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;KAC1C,CAAA;AACH,CAAC;AAED,KAAK,UAAU,YAAY,CACzB,IAAa,EACb,IAAiB,EACjB,OAAuB,EACvB,EAAmB;IAEnB,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;QAAE,OAAM;IAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACjC,MAAM,EAAE,IAAI,CAAC,EAAE;QACf,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,MAAM,EAAE,EAAE,CAAC,MAAM;KAClB,CAAC,CAAA;IACF,MAAM,GAAG,GAAG,MAAM,mBAAmB,CAAC;QACpC,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,MAAM,EAAE,IAAI,CAAC,EAAE;QACf,QAAQ;KACT,CAAC,CAAA;IACF,OAAO,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;AACtC,CAAC;AAED,KAAK,UAAU,OAAO,CACpB,IAAa,EACb,IAAiB,EACjB,OAAuB,EACvB,EAAmB;IAEnB,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,UAAU;QAChC,MAAM,IAAI,YAAY,CAAC,SAAS,IAAI,CAAC,EAAE,6BAA6B,EAAE,mBAAmB,CAAC,CAAA;IAC5F,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAA;IAC9C,MAAM,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAA;IAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;AAC1B,CAAC;AAED,KAAK,UAAU,WAAW,CACxB,IAAa,EACb,IAAiB,EACjB,OAAuB,EACvB,EAAmB;IAEnB,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAA;IAC9C,MAAM,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAA;IAC3C,MAAM,MAAM,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,QAAS,EAAE;QACvD,WAAW,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,IAAI,oBAAoB;QAChE,MAAM,EAAE,EAAE,CAAC,MAAM;QACjB,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,mBAAmB,KAAK,SAAS;YACnD,CAAC,CAAC,EAAE,mBAAmB,EAAE,OAAO,CAAC,MAAM,CAAC,mBAAmB,EAAE;YAC7D,CAAC,CAAC,EAAE,CAAC;KACR,CAAC,CAAA;IACF,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAK,CAAC,OAAO,CAAC,CAAA;IACtC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACrC,IAAI,CAAC,MAAM,CAAC,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,IAAI,aAAa,IAAI,CAAC,EAAE,UAAU,CAAC,CAAA;IAC/E,OAAO,MAAM,CAAC,MAAM,CAAA;AACtB,CAAC"}

package/dist/orchestration/dispatch.d.ts

@@ -0,0 +1,115 @@
+/**
+ * Evidence-only dispatch contracts for at-least-once run execution.
+ *
+ * These values deliberately contain no job payload, tenant state, credentials, retention policy,
+ * error message, or tool/model data. A durable operated adapter may implement the ports, but the
+ * public reference adapters are disposable and keep only identifiers, digests, counters, and
+ * lifecycle evidence. Delivery is at-least-once; callers make effects idempotent with the key
+ * derived below and prove completion before a recovered worker skips the effect.
+ */
+export declare const RUN_DISPATCH_VERSION: 1;
+export declare const DISPATCH_JOB_NAME = "nifra.agent.run-node";
+export declare const MAX_DISPATCH_STRING = 256;
+export declare const MAX_DISPATCH_ATTEMPTS = 16;
+export type DispatchBoundary = "before-effect" | "after-effect";
+export type DispatchState = "queued" | "leased" | "checkpointed" | "retrying" | "succeeded" | "failed" | "cancelled" | "dead-lettered";
+export type DispatchResultCode = "accepted" | "stale_lease" | "cancelled" | "terminal" | "invalid_checkpoint" | "idempotency_required";
+export interface InjectedClock {
+    readonly now: () => number;
+    readonly sleep?: (milliseconds: number) => Promise<void>;
+}
+export declare const systemClock: InjectedClock;
+/** A queued node identity. It is safe to persist and safe to show in evidence. */
+export interface RunDispatch {
+    readonly version: typeof RUN_DISPATCH_VERSION;
+    readonly dispatchId: string;
+    readonly runId: string;
+    readonly planDigest: string;
+    readonly nodeId: string;
+    readonly maxAttempts: number;
+    readonly notBefore: number;
+}
+/** A lease with a generation. A completion from any older generation is rejected. */
+export interface RunLease {
+    readonly version: typeof RUN_DISPATCH_VERSION;
+    readonly leaseId: string;
+    readonly dispatch: RunDispatch;
+    /** Logical attempt is stable across duplicate delivery while the same attempt is unresolved. */
+    readonly attempt: number;
+    readonly generation: number;
+    readonly leasedAt: number;
+    readonly leaseUntil: number;
+    readonly scheduleToken: string;
+    readonly idempotencyKey: string;
+}
+/** A safe boundary checkpoint. It never contains a result or effect payload. */
+export interface RunCheckpoint {
+    readonly version: typeof RUN_DISPATCH_VERSION;
+    readonly dispatchId: string;
+    readonly runId: string;
+    readonly nodeId: string;
+    readonly attempt: number;
+    readonly generation: number;
+    readonly boundary: DispatchBoundary;
+    readonly idempotencyKey: string;
+    readonly at: number;
+    readonly scheduleToken: string;
+}
+/** A terminal or transitional record suitable for a public evidence sink. */
+export interface RunDispatchEvidence {
+    readonly version: typeof RUN_DISPATCH_VERSION;
+    readonly dispatchId: string;
+    readonly runId: string;
+    readonly nodeId: string;
+    readonly state: DispatchState;
+    readonly attempt: number;
+    readonly generation: number;
+    readonly at: number;
+    readonly scheduleToken: string;
+    readonly idempotencyKey: string;
+    readonly code?: string;
+}
+export interface DispatchWriteResult {
+    readonly ok: boolean;
+    readonly code: DispatchResultCode;
+}
+export interface DispatchInspection {
+    readonly dispatch: RunDispatch;
+    readonly state: DispatchState;
+    readonly attempt: number;
+    readonly generation: number;
+    readonly checkpoint?: RunCheckpoint;
+    readonly evidence: readonly RunDispatchEvidence[];
+}
+export interface RunDispatchStore {
+    enqueue(dispatch: RunDispatch): void | Promise<void>;
+    lease(now: number, limit: number, leaseMs: number): RunLease[] | Promise<RunLease[]>;
+    checkpoint(lease: RunLease, checkpoint: RunCheckpoint): DispatchWriteResult | Promise<DispatchWriteResult>;
+    complete(lease: RunLease, evidence?: RunDispatchEvidence): DispatchWriteResult | Promise<DispatchWriteResult>;
+    retry(lease: RunLease, runAt: number, code: string): DispatchWriteResult | Promise<DispatchWriteResult>;
+    deadLetter(lease: RunLease, code: string): DispatchWriteResult | Promise<DispatchWriteResult>;
+    cancel(runId: string, code?: string): number | Promise<number>;
+    inspect(dispatchId: string): DispatchInspection | undefined | Promise<DispatchInspection | undefined>;
+}
+/**
+ * Optional operated-depth handoff. The context is intentionally opaque: the public package does not
+ * model tenants, rows, RLS policy text, retention periods, credentials, workers, or fleet topology.
+ * A private adapter supplies those controls and still implements the evidence-only store port above.
+ */
+export interface DurableDispatchAdapter<OpaqueContext = unknown> extends RunDispatchStore {
+    authorize(context: OpaqueContext, operation: "enqueue" | "lease" | "inspect" | "settle"): boolean | Promise<boolean>;
+    enforceDataLayerPolicy(context: OpaqueContext, operation: "read" | "write"): boolean | Promise<boolean>;
+    retainEvidence(context: OpaqueContext, evidence: RunDispatchEvidence): void | Promise<void>;
+    reconcile(context: OpaqueContext, dispatchId: string): void | Promise<void>;
+    workerHealth(context: OpaqueContext): "ready" | "draining" | "unavailable" | Promise<"ready" | "draining" | "unavailable">;
+}
+/** Parse a dispatch identity and reject content or undeclared fields. */
+export declare function parseRunDispatch(value: unknown): RunDispatch;
+export declare function parseRunLease(value: unknown): RunLease;
+export declare function parseRunCheckpoint(value: unknown): RunCheckpoint;
+export declare function parseRunDispatchEvidence(value: unknown): RunDispatchEvidence;
+/** Stable key for one logical node attempt. Duplicate delivery uses the same boundary number. */
+export declare function deriveRunIdempotencyKey(planDigest: string, runId: string, nodeId: string, logicalAttemptBoundary: number): Promise<string>;
+/** Create a parsed dispatch identity before handing it to any adapter. */
+export declare function createRunDispatch(input: Omit<RunDispatch, "version">): RunDispatch;
+//# sourceMappingURL=dispatch.d.ts.map

package/dist/orchestration/dispatch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dispatch.d.ts","sourceRoot":"","sources":["../../src/orchestration/dispatch.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,eAAO,MAAM,oBAAoB,EAAG,CAAU,CAAA;AAC9C,eAAO,MAAM,iBAAiB,yBAAyB,CAAA;AACvD,eAAO,MAAM,mBAAmB,MAAM,CAAA;AACtC,eAAO,MAAM,qBAAqB,KAAK,CAAA;AAEvC,MAAM,MAAM,gBAAgB,GAAG,eAAe,GAAG,cAAc,CAAA;AAC/D,MAAM,MAAM,aAAa,GACrB,QAAQ,GACR,QAAQ,GACR,cAAc,GACd,UAAU,GACV,WAAW,GACX,QAAQ,GACR,WAAW,GACX,eAAe,CAAA;AAEnB,MAAM,MAAM,kBAAkB,GAC1B,UAAU,GACV,aAAa,GACb,WAAW,GACX,UAAU,GACV,oBAAoB,GACpB,sBAAsB,CAAA;AAE1B,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,EAAE,MAAM,MAAM,CAAA;IAC1B,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;CACzD;AAED,eAAO,MAAM,WAAW,EAAE,aAAwD,CAAA;AAElF,kFAAkF;AAClF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,oBAAoB,CAAA;IAC7C,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;CAC3B;AAED,qFAAqF;AACrF,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,OAAO,EAAE,OAAO,oBAAoB,CAAA;IAC7C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAA;IAC9B,gGAAgG;IAChG,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAChC;AAED,gFAAgF;AAChF,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,OAAO,EAAE,OAAO,oBAAoB,CAAA;IAC7C,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAA;IACnC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;CAC/B;AAED,6EAA6E;AAC7E,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,OAAO,EAAE,OAAO,oBAAoB,CAAA;IAC7C,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAA;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAA;IACpB,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAA;CAClC;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAA;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,UAAU,CAAC,EAAE,aAAa,CAAA;IACnC,QAAQ,CAAC,QAAQ,EAAE,SAAS,mBAAmB,EAAE,CAAA;CAClD;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IACpD,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAA;IACpF,UAAU,CACR,KAAK,EAAE,QAAQ,EACf,UAAU,EAAE,aAAa,GACxB,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAA;IACrD,QAAQ,CACN,KAAK,EAAE,QAAQ,EACf,QAAQ,CAAC,EAAE,mBAAmB,GAC7B,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAA;IACrD,KAAK,CACH,KAAK,EAAE,QAAQ,EACf,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GACX,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAA;IACrD,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAA;IAC7F,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;IAC9D,OAAO,CACL,UAAU,EAAE,MAAM,GACjB,kBAAkB,GAAG,SAAS,GAAG,OAAO,CAAC,kBAAkB,GAAG,SAAS,CAAC,CAAA;CAC5E;AAED;;;;GAIG;AACH,MAAM,WAAW,sBAAsB,CAAC,aAAa,GAAG,OAAO,CAAE,SAAQ,gBAAgB;IACvF,SAAS,CACP,OAAO,EAAE,aAAa,EACtB,SAAS,EAAE,SAAS,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,GACpD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;IAC7B,sBAAsB,CACpB,OAAO,EAAE,aAAa,EACtB,SAAS,EAAE,MAAM,GAAG,OAAO,GAC1B,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;IAC7B,cAAc,CAAC,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,mBAAmB,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IAC3F,SAAS,CAAC,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IAC3E,YAAY,CACV,OAAO,EAAE,aAAa,GACrB,OAAO,GAAG,UAAU,GAAG,aAAa,GAAG,OAAO,CAAC,OAAO,GAAG,UAAU,GAAG,aAAa,CAAC,CAAA;CACxF;AAiFD,yEAAyE;AACzE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,WAAW,CAc5D;AAcD,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,QAAQ,CAkBtD;AAeD,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,aAAa,CAoBhE;AA2BD,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,OAAO,GAAG,mBAAmB,CAoB5E;AAED,iGAAiG;AACjG,wBAAgB,uBAAuB,CACrC,UAAU,EAAE,MAAM,EAClB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,sBAAsB,EAAE,MAAM,GAC7B,OAAO,CAAC,MAAM,CAAC,CAMjB;AAED,0EAA0E;AAC1E,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,GAAG,WAAW,CAElF"}