intentdna 1.0.0

package/dist/compiler/workflow.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Intent DNA -- Workflow Compiler
+ *
+ * Compiles a WorkflowDef into an executable WorkflowPlan.
+ * Performs topological sort, parallel group detection, transition compilation,
+ * retry config resolution, cycle detection, and optional Mermaid diagram generation.
+ */
+import type { WorkflowDef, WorkflowPlan } from "../schema/types.js";
+export interface CompileWorkflowOptions {
+    /** Generate Mermaid diagram (default: false) */
+    mermaid?: boolean;
+}
+export interface CompileWorkflowError {
+    path: string;
+    message: string;
+}
+export interface CompileWorkflowResult {
+    ok: boolean;
+    plan?: WorkflowPlan;
+    errors: CompileWorkflowError[];
+}
+/**
+ * Compile a WorkflowDef into an executable WorkflowPlan.
+ *
+ * Performs:
+ * - Topological sort of steps based on depends_on
+ * - Parallel group detection
+ * - Dependency graph construction
+ * - Transition compilation
+ * - Retry config resolution
+ * - Cycle detection
+ * - Optional Mermaid diagram generation
+ *
+ * Returns a result object with either a plan or errors.
+ */
+export declare function compileWorkflow(workflow: WorkflowDef, options?: CompileWorkflowOptions): CompileWorkflowResult;
+//# sourceMappingURL=workflow.d.ts.map

package/dist/compiler/workflow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow.d.ts","sourceRoot":"","sources":["../../src/compiler/workflow.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACV,WAAW,EAEX,YAAY,EAMb,MAAM,oBAAoB,CAAC;AAI5B,MAAM,WAAW,sBAAsB;IACrC,gDAAgD;IAChD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,OAAO,CAAC;IACZ,IAAI,CAAC,EAAE,YAAY,CAAC;IACpB,MAAM,EAAE,oBAAoB,EAAE,CAAC;CAChC;AA0PD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,WAAW,EACrB,OAAO,CAAC,EAAE,sBAAsB,GAC/B,qBAAqB,CA0DvB"}

package/dist/compiler/workflow.js

@@ -0,0 +1,274 @@
+/**
+ * Intent DNA -- Workflow Compiler
+ *
+ * Compiles a WorkflowDef into an executable WorkflowPlan.
+ * Performs topological sort, parallel group detection, transition compilation,
+ * retry config resolution, cycle detection, and optional Mermaid diagram generation.
+ */
+// ── Internal helpers ─────────────────────────────────────────
+/**
+ * If no step in the workflow has depends_on, inject implicit sequential
+ * dependencies based on array order (step[i] depends_on step[i-1]).
+ * Returns a new array of steps with injected deps (never mutates input).
+ */
+function inferImplicitDeps(steps) {
+    const anyExplicit = steps.some((s) => s.depends_on !== undefined && s.depends_on.length > 0);
+    if (anyExplicit) {
+        return steps;
+    }
+    return steps.map((s, i) => {
+        if (i === 0)
+            return s;
+        return { ...s, depends_on: [steps[i - 1].id] };
+    });
+}
+/**
+ * Build forward + reverse adjacency lists from step dependencies.
+ */
+function buildDependencyGraph(steps) {
+    const dependencies = {};
+    const dependents = {};
+    for (const step of steps) {
+        dependencies[step.id] = step.depends_on ? [...step.depends_on] : [];
+        if (!dependents[step.id]) {
+            dependents[step.id] = [];
+        }
+    }
+    // Build reverse map
+    for (const step of steps) {
+        if (step.depends_on) {
+            for (const dep of step.depends_on) {
+                if (!dependents[dep]) {
+                    dependents[dep] = [];
+                }
+                dependents[dep].push(step.id);
+            }
+        }
+    }
+    return { dependencies, dependents };
+}
+/**
+ * Kahn's algorithm for topological sort with parallel group detection.
+ *
+ * Returns sorted steps and parallel groups, or null if a cycle is detected.
+ * When a cycle is detected, returns the ids of steps involved in the cycle.
+ */
+function topologicalSort(steps, graph) {
+    const stepMap = new Map();
+    for (const s of steps) {
+        stepMap.set(s.id, s);
+    }
+    // Compute in-degrees
+    const inDegree = new Map();
+    for (const s of steps) {
+        inDegree.set(s.id, (graph.dependencies[s.id] ?? []).length);
+    }
+    // Seed queue with in-degree 0
+    let queue = [];
+    for (const s of steps) {
+        if (inDegree.get(s.id) === 0) {
+            queue.push(s.id);
+        }
+    }
+    const sorted = [];
+    const groups = [];
+    let groupIndex = 0;
+    while (queue.length > 0) {
+        // All items in current queue form one parallel group
+        groups.push({
+            group_index: groupIndex,
+            step_ids: [...queue],
+        });
+        groupIndex++;
+        const nextQueue = [];
+        for (const id of queue) {
+            sorted.push(stepMap.get(id));
+            for (const dependent of graph.dependents[id] ?? []) {
+                const newDeg = (inDegree.get(dependent) ?? 1) - 1;
+                inDegree.set(dependent, newDeg);
+                if (newDeg === 0) {
+                    nextQueue.push(dependent);
+                }
+            }
+        }
+        queue = nextQueue;
+    }
+    if (sorted.length < steps.length) {
+        // Cycle detected -- find which step ids are in the cycle
+        const sortedSet = new Set(sorted.map((s) => s.id));
+        const cycleIds = steps.filter((s) => !sortedSet.has(s.id)).map((s) => s.id);
+        return { sorted: [], groups: [], cycleIds };
+    }
+    return { sorted, groups, cycleIds: null };
+}
+/**
+ * Compile transition rules: generate default sequential transitions
+ * and preserve explicit transitions.
+ */
+function compileTransitions(workflow, groups) {
+    const defaults = [];
+    // Generate default transitions between adjacent groups
+    for (let i = 0; i < groups.length - 1; i++) {
+        const fromGroup = groups[i];
+        const toGroup = groups[i + 1];
+        for (const fromId of fromGroup.step_ids) {
+            for (const toId of toGroup.step_ids) {
+                defaults.push({ from: fromId, to: toId, condition: "always" });
+            }
+        }
+    }
+    // Preserve explicit transitions
+    const explicit = (workflow.transitions ?? []).map((t) => ({
+        from: t.from,
+        to: t.to,
+        condition: t.condition,
+    }));
+    return { defaults, explicit };
+}
+/**
+ * Merge retry_policy and max_rounds into a unified WorkflowRetryConfig.
+ */
+function resolveRetryConfig(workflow) {
+    const { retry_policy, max_rounds } = workflow;
+    if (retry_policy) {
+        return {
+            max_retries: retry_policy.max_retries,
+            retry_from: retry_policy.retry_from ?? null,
+            backoff: retry_policy.backoff ?? "none",
+        };
+    }
+    if (max_rounds !== undefined && max_rounds > 1) {
+        return {
+            max_retries: max_rounds - 1,
+            retry_from: null,
+            backoff: "none",
+        };
+    }
+    return {
+        max_retries: 0,
+        retry_from: null,
+        backoff: "none",
+    };
+}
+/**
+ * Normalize run_if: undefined and "always" become null; everything else preserved.
+ */
+function resolveRunIf(runIf) {
+    if (runIf === undefined || runIf === "always") {
+        return null;
+    }
+    return runIf;
+}
+/**
+ * Map WorkflowStepDef to compiled WorkflowStep.
+ */
+function toWorkflowStep(def) {
+    return {
+        id: def.id,
+        role: def.role,
+        description: def.description ?? def.id,
+        optional: def.optional ?? false,
+        run_if: resolveRunIf(def.run_if),
+        depends_on: def.depends_on ? [...def.depends_on] : [],
+        prompt: def.prompt ?? null,
+        completion: def.completion && def.completion.length > 0 ? [...def.completion] : null,
+    };
+}
+/**
+ * Generate a Mermaid flowchart diagram from a WorkflowPlan.
+ */
+function generateMermaid(plan) {
+    const lines = ["graph TD"];
+    // Generate node definitions
+    for (const step of plan.steps) {
+        let label = `${step.id} (${step.role})`;
+        if (step.run_if) {
+            label += `\\nrun_if: ${step.run_if}`;
+        }
+        // Escape double quotes in label
+        const safeLabel = label.replace(/"/g, "&quot;");
+        lines.push(`    ${step.id}["${safeLabel}"]`);
+    }
+    lines.push("");
+    // Generate dependency edges
+    const depEdgeSet = new Set();
+    for (const step of plan.steps) {
+        for (const dep of step.depends_on) {
+            const key = `${dep} --> ${step.id}`;
+            if (!depEdgeSet.has(key)) {
+                depEdgeSet.add(key);
+                lines.push(`    ${key}`);
+            }
+        }
+    }
+    // Generate explicit transition edges (with labels)
+    for (const t of plan.transitions) {
+        const edge = `    ${t.from} -->|${t.condition}| ${t.to}`;
+        lines.push(edge);
+    }
+    return lines.join("\n");
+}
+// ── Public API ───────────────────────────────────────────────
+/**
+ * Compile a WorkflowDef into an executable WorkflowPlan.
+ *
+ * Performs:
+ * - Topological sort of steps based on depends_on
+ * - Parallel group detection
+ * - Dependency graph construction
+ * - Transition compilation
+ * - Retry config resolution
+ * - Cycle detection
+ * - Optional Mermaid diagram generation
+ *
+ * Returns a result object with either a plan or errors.
+ */
+export function compileWorkflow(workflow, options) {
+    const errors = [];
+    // 1. Validate steps exist
+    if (!workflow.steps || workflow.steps.length === 0) {
+        errors.push({
+            path: "workflow.steps",
+            message: "Workflow must have at least one step",
+        });
+        return { ok: false, errors };
+    }
+    // 2. Infer implicit deps if no step has depends_on
+    const resolvedSteps = inferImplicitDeps(workflow.steps);
+    // 3. Build dependency graph
+    const graph = buildDependencyGraph(resolvedSteps);
+    // 4. Topological sort + cycle detection
+    const { sorted, groups, cycleIds } = topologicalSort(resolvedSteps, graph);
+    if (cycleIds) {
+        errors.push({
+            path: "workflow.steps",
+            message: `Cycle detected involving steps: ${cycleIds.join(", ")}`,
+        });
+        return { ok: false, errors };
+    }
+    // 5. Compile transitions
+    const { defaults, explicit } = compileTransitions(workflow, groups);
+    // 6. Resolve retry config
+    const retry = resolveRetryConfig(workflow);
+    // 7. Build WorkflowStep[] from sorted steps
+    const compiledSteps = sorted.map(toWorkflowStep);
+    // 8. Construct the plan
+    const plan = {
+        name: workflow.name,
+        description: workflow.description ?? "",
+        steps: compiledSteps,
+        parallel_groups: groups,
+        dependency_graph: graph,
+        transitions: explicit,
+        default_transitions: defaults,
+        retry,
+        compiled_at: new Date().toISOString(),
+        source_workflow: workflow.name,
+    };
+    // 9. Optional Mermaid diagram
+    if (options?.mermaid) {
+        plan.mermaid = generateMermaid(plan);
+    }
+    return { ok: true, plan, errors: [] };
+}
+//# sourceMappingURL=workflow.js.map

package/dist/compiler/workflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow.js","sourceRoot":"","sources":["../../src/compiler/workflow.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AA+BH,gEAAgE;AAEhE;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,KAAwB;IACjD,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAC7D,CAAC;IACF,IAAI,WAAW,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACtB,OAAO,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,KAAwB;IACpD,MAAM,YAAY,GAA6B,EAAE,CAAC;IAClD,MAAM,UAAU,GAA6B,EAAE,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAClC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrB,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;gBACvB,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,SAAS,eAAe,CACtB,KAAwB,EACxB,KAAsB;IAMtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,qBAAqB;IACrB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC9D,CAAC;IAED,8BAA8B;IAC9B,IAAI,KAAK,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,qDAAqD;QACrD,MAAM,CAAC,IAAI,CAAC;YACV,WAAW,EAAE,UAAU;YACvB,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;SACrB,CAAC,CAAC;QACH,UAAU,EAAE,CAAC;QAEb,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;YAE9B,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjB,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,GAAG,SAAS,CAAC;IACpB,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,yDAAyD;QACzD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5E,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CACzB,QAAqB,EACrB,MAAuB;IAEvB,MAAM,QAAQ,GAAqB,EAAE,CAAC;IAEtC,uDAAuD;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;YACxC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACpC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,MAAM,QAAQ,GAAqB,CAAC,QAAQ,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1E,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,SAAS,EAAE,CAAC,CAAC,SAAS;KACvB,CAAC,CAAC,CAAC;IAEJ,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAAqB;IAC/C,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,QAAQ,CAAC;IAE9C,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO;YACL,WAAW,EAAE,YAAY,CAAC,WAAW;YACrC,UAAU,EAAE,YAAY,CAAC,UAAU,IAAI,IAAI;YAC3C,OAAO,EAAE,YAAY,CAAC,OAAO,IAAI,MAAM;SACxC,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QAC/C,OAAO;YACL,WAAW,EAAE,UAAU,GAAG,CAAC;YAC3B,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,MAAM;SAChB,CAAC;IACJ,CAAC;IAED,OAAO;QACL,WAAW,EAAE,CAAC;QACd,UAAU,EAAE,IAAI;QAChB,OAAO,EAAE,MAAM;KAChB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAyB;IAC7C,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,GAAoB;IAC1C,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,WAAW,EAAE,GAAG,CAAC,WAAW,IAAI,GAAG,CAAC,EAAE;QACtC,QAAQ,EAAE,GAAG,CAAC,QAAQ,IAAI,KAAK;QAC/B,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;QAChC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;QACrD,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,IAAI;QAC1B,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;KACrF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,IAAkB;IACzC,MAAM,KAAK,GAAa,CAAC,UAAU,CAAC,CAAC;IAErC,4BAA4B;IAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,GAAG,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,KAAK,IAAI,cAAc,IAAI,CAAC,MAAM,EAAE,CAAC;QACvC,CAAC;QACD,gCAAgC;QAChC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,4BAA4B;IAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,GAAG,GAAG,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,gEAAgE;AAEhE;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAqB,EACrB,OAAgC;IAEhC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,0BAA0B;IAC1B,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,gBAAgB;YACtB,OAAO,EAAE,sCAAsC;SAChD,CAAC,CAAC;QACH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC/B,CAAC;IAED,mDAAmD;IACnD,MAAM,aAAa,GAAG,iBAAiB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAExD,4BAA4B;IAC5B,MAAM,KAAK,GAAG,oBAAoB,CAAC,aAAa,CAAC,CAAC;IAElD,wCAAwC;IACxC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,eAAe,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IAE3E,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,gBAAgB;YACtB,OAAO,EAAE,mCAAmC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAClE,CAAC,CAAC;QACH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC/B,CAAC;IAED,yBAAyB;IACzB,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAEpE,0BAA0B;IAC1B,MAAM,KAAK,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAE3C,4CAA4C;IAC5C,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAEjD,wBAAwB;IACxB,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,WAAW,EAAE,QAAQ,CAAC,WAAW,IAAI,EAAE;QACvC,KAAK,EAAE,aAAa;QACpB,eAAe,EAAE,MAAM;QACvB,gBAAgB,EAAE,KAAK;QACvB,WAAW,EAAE,QAAQ;QACrB,mBAAmB,EAAE,QAAQ;QAC7B,KAAK;QACL,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACrC,eAAe,EAAE,QAAQ,CAAC,IAAI;KAC/B,CAAC;IAEF,8BAA8B;IAC9B,IAAI,OAAO,EAAE,OAAO,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AACxC,CAAC"}

package/dist/evolution/collector.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Intent DNA — Outcome Collector
+ *
+ * Records execution outcomes from agent actions.
+ * Each outcome captures what happened, which constraints were active,
+ * and per-constraint feedback.
+ */
+import type { ExecutionOutcome, ConstraintFeedback, OutcomeMetrics } from "./types.js";
+import type { EvolutionStore } from "./store.js";
+export interface RecordOutcomeInput {
+    dna_id: string;
+    context?: string;
+    action: string;
+    active_genes: string[];
+    constraints_applied: string[];
+    success: boolean;
+    constraint_feedback: ConstraintFeedback[];
+    metrics?: OutcomeMetrics;
+}
+/**
+ * Outcome Collector: records agent execution results for later marker generation.
+ */
+export declare class OutcomeCollector {
+    private store;
+    constructor(store: EvolutionStore);
+    /**
+     * Record a new execution outcome.
+     * Returns the generated outcome ID.
+     */
+    record(input: RecordOutcomeInput): Promise<string>;
+    /**
+     * Get all outcomes for a DNA, optionally filtered by context.
+     */
+    getOutcomes(dnaId: string, context?: string): Promise<ExecutionOutcome[]>;
+    /**
+     * Get summary statistics for a DNA's outcomes.
+     */
+    getSummary(dnaId: string): Promise<OutcomeSummary>;
+}
+export interface OutcomeSummary {
+    total_outcomes: number;
+    success_count: number;
+    failure_count: number;
+    gene_feedback: Record<string, {
+        helped: number;
+        hindered: number;
+        neutral: number;
+    }>;
+    oldest: string | null;
+    newest: string | null;
+}
+//# sourceMappingURL=collector.d.ts.map

package/dist/evolution/collector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collector.d.ts","sourceRoot":"","sources":["../../src/evolution/collector.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACvF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEjD,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,mBAAmB,EAAE,kBAAkB,EAAE,CAAC;IAC1C,OAAO,CAAC,EAAE,cAAc,CAAC;CAC1B;AAED;;GAEG;AACH,qBAAa,gBAAgB;IACf,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;OAGG;IACG,MAAM,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC;IAoBxD;;OAEG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAQ/E;;OAEG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC;CAuBzD;AAED,MAAM,WAAW,cAAc;IAC7B,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACrF,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CACvB"}

package/dist/evolution/collector.js

@@ -0,0 +1,72 @@
+/**
+ * Intent DNA — Outcome Collector
+ *
+ * Records execution outcomes from agent actions.
+ * Each outcome captures what happened, which constraints were active,
+ * and per-constraint feedback.
+ */
+import { randomBytes } from "node:crypto";
+/**
+ * Outcome Collector: records agent execution results for later marker generation.
+ */
+export class OutcomeCollector {
+    store;
+    constructor(store) {
+        this.store = store;
+    }
+    /**
+     * Record a new execution outcome.
+     * Returns the generated outcome ID.
+     */
+    async record(input) {
+        const id = `outcome_${Date.now()}_${randomBytes(4).toString("hex")}`;
+        const outcome = {
+            id,
+            timestamp: new Date().toISOString(),
+            dna_id: input.dna_id,
+            context: input.context,
+            action: input.action,
+            active_genes: input.active_genes,
+            constraints_applied: input.constraints_applied,
+            success: input.success,
+            constraint_feedback: input.constraint_feedback,
+            metrics: input.metrics,
+        };
+        await this.store.saveOutcome(outcome);
+        return id;
+    }
+    /**
+     * Get all outcomes for a DNA, optionally filtered by context.
+     */
+    async getOutcomes(dnaId, context) {
+        const outcomes = await this.store.listOutcomes(dnaId);
+        if (context) {
+            return outcomes.filter(o => o.context === context);
+        }
+        return outcomes;
+    }
+    /**
+     * Get summary statistics for a DNA's outcomes.
+     */
+    async getSummary(dnaId) {
+        const outcomes = await this.store.listOutcomes(dnaId);
+        const geneStats = {};
+        for (const outcome of outcomes) {
+            for (const fb of outcome.constraint_feedback) {
+                if (!geneStats[fb.gene]) {
+                    geneStats[fb.gene] = { helped: 0, hindered: 0, neutral: 0 };
+                }
+                geneStats[fb.gene][fb.effect]++;
+            }
+        }
+        return {
+            total_outcomes: outcomes.length,
+            success_count: outcomes.filter(o => o.success).length,
+            failure_count: outcomes.filter(o => !o.success).length,
+            gene_feedback: geneStats,
+            oldest: outcomes.length > 0 ? outcomes[outcomes.length - 1].timestamp : null,
+            newest: outcomes.length > 0 ? outcomes[0].timestamp : null,
+        };
+    }
+}
+//# sourceMappingURL=collector.js.map

package/dist/evolution/collector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collector.js","sourceRoot":"","sources":["../../src/evolution/collector.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAe1C;;GAEG;AACH,MAAM,OAAO,gBAAgB;IACP;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;OAGG;IACH,KAAK,CAAC,MAAM,CAAC,KAAyB;QACpC,MAAM,EAAE,GAAG,WAAW,IAAI,CAAC,GAAG,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAErE,MAAM,OAAO,GAAqB;YAChC,EAAE;YACF,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;YAC9C,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;YAC9C,OAAO,EAAE,KAAK,CAAC,OAAO;SACvB,CAAC;QAEF,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACtC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,KAAa,EAAE,OAAgB;QAC/C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACtD,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,KAAa;QAC5B,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAEtD,MAAM,SAAS,GAA0E,EAAE,CAAC;QAE5F,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,mBAAmB,EAAE,CAAC;gBAC7C,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxB,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;gBAC9D,CAAC;gBACD,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO;YACL,cAAc,EAAE,QAAQ,CAAC,MAAM;YAC/B,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM;YACrD,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM;YACtD,aAAa,EAAE,SAAS;YACxB,MAAM,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI;YAC5E,MAAM,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI;SAC3D,CAAC;IACJ,CAAC;CACF"}

package/dist/evolution/fitness.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Intent DNA — Fitness Calculator
+ *
+ * Adapted from Mycelium's fitness formula for epigenetic markers.
+ * Determines how strongly a marker should influence gene expression
+ * based on outcome history.
+ *
+ * Score = success_impact * 0.4 + consistency * 0.3 + recency * 0.3
+ */
+import type { ExecutionOutcome } from "./types.js";
+import type { EpigeneticMarker } from "../schema/types.js";
+/**
+ * Compute fitness score for a gene based on recent outcomes.
+ * Returns 0-1 normalized score.
+ *
+ * Components:
+ *   success_impact (0.4) — how often outcomes were successful when gene was active
+ *   consistency    (0.3) — how consistent the feedback was (helped vs hindered)
+ *   recency        (0.3) — how recent the outcomes are
+ */
+export declare function computeGeneFitness(geneName: string, outcomes: ExecutionOutcome[]): number;
+/**
+ * Determine the recommended modulation direction for a gene.
+ * Returns amplify factor > 1 if gene consistently helps,
+ * suppress factor < 1 if gene consistently hinders.
+ */
+export declare function computeModulationFactor(geneName: string, outcomes: ExecutionOutcome[]): number;
+/**
+ * Compute the effective strength of a marker considering decay over time.
+ * Returns 0-1 where 0 means fully decayed.
+ */
+export declare function computeMarkerStrength(marker: EpigeneticMarker): number;
+//# sourceMappingURL=fitness.d.ts.map

package/dist/evolution/fitness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fitness.d.ts","sourceRoot":"","sources":["../../src/evolution/fitness.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAsB,MAAM,YAAY,CAAC;AACvE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAE3D;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,gBAAgB,EAAE,GAC3B,MAAM,CAiCR;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,gBAAgB,EAAE,GAC3B,MAAM,CA8BR;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,gBAAgB,GAAG,MAAM,CAQtE"}

package/dist/evolution/fitness.js

@@ -0,0 +1,96 @@
+/**
+ * Intent DNA — Fitness Calculator
+ *
+ * Adapted from Mycelium's fitness formula for epigenetic markers.
+ * Determines how strongly a marker should influence gene expression
+ * based on outcome history.
+ *
+ * Score = success_impact * 0.4 + consistency * 0.3 + recency * 0.3
+ */
+/**
+ * Compute fitness score for a gene based on recent outcomes.
+ * Returns 0-1 normalized score.
+ *
+ * Components:
+ *   success_impact (0.4) — how often outcomes were successful when gene was active
+ *   consistency    (0.3) — how consistent the feedback was (helped vs hindered)
+ *   recency        (0.3) — how recent the outcomes are
+ */
+export function computeGeneFitness(geneName, outcomes) {
+    // Filter outcomes where this gene was active
+    const relevant = outcomes.filter(o => o.active_genes.includes(geneName));
+    if (relevant.length === 0)
+        return 0;
+    // Success impact: ratio of successful outcomes
+    const successCount = relevant.filter(o => o.success).length;
+    const successImpact = successCount / relevant.length;
+    // Consistency: how consistently the gene helped
+    let helpedCount = 0;
+    let hinderedCount = 0;
+    for (const outcome of relevant) {
+        for (const fb of outcome.constraint_feedback) {
+            if (fb.gene === geneName) {
+                if (fb.effect === "helped")
+                    helpedCount++;
+                if (fb.effect === "hindered")
+                    hinderedCount++;
+            }
+        }
+    }
+    const totalFeedback = helpedCount + hinderedCount;
+    const consistency = totalFeedback > 0
+        ? Math.abs(helpedCount - hinderedCount) / totalFeedback
+        : 0.5; // neutral if no feedback
+    // Recency: decay over 30 days from most recent outcome
+    const now = Date.now();
+    const mostRecent = relevant.reduce((latest, o) => Math.max(latest, new Date(o.timestamp).getTime()), 0);
+    const daysSince = (now - mostRecent) / (1000 * 60 * 60 * 24);
+    const recency = Math.max(0, 1 - daysSince / 30);
+    return successImpact * 0.4 + consistency * 0.3 + recency * 0.3;
+}
+/**
+ * Determine the recommended modulation direction for a gene.
+ * Returns amplify factor > 1 if gene consistently helps,
+ * suppress factor < 1 if gene consistently hinders.
+ */
+export function computeModulationFactor(geneName, outcomes) {
+    const relevant = outcomes.filter(o => o.active_genes.includes(geneName));
+    if (relevant.length === 0)
+        return 1.0;
+    let helpScore = 0;
+    let hinderScore = 0;
+    for (const outcome of relevant) {
+        for (const fb of outcome.constraint_feedback) {
+            if (fb.gene !== geneName)
+                continue;
+            // Weight by outcome success/failure
+            const weight = outcome.success ? 1.0 : 0.7;
+            if (fb.effect === "helped") {
+                helpScore += weight;
+            }
+            else if (fb.effect === "hindered") {
+                hinderScore += weight;
+            }
+        }
+    }
+    const total = helpScore + hinderScore;
+    if (total === 0)
+        return 1.0;
+    // Net direction: positive = amplify, negative = suppress
+    const netRatio = (helpScore - hinderScore) / total;
+    // Map to factor: -1 → 0.5 (suppress), 0 → 1.0 (neutral), +1 → 1.5 (amplify)
+    return 1.0 + netRatio * 0.5;
+}
+/**
+ * Compute the effective strength of a marker considering decay over time.
+ * Returns 0-1 where 0 means fully decayed.
+ */
+export function computeMarkerStrength(marker) {
+    const now = Date.now();
+    const markerAge = marker.timestamp
+        ? (now - new Date(marker.timestamp).getTime()) / (1000 * 60 * 60 * 24)
+        : 0;
+    // Decay per 30-day period
+    return Math.pow(marker.decay, markerAge / 30);
+}
+//# sourceMappingURL=fitness.js.map

package/dist/evolution/fitness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fitness.js","sourceRoot":"","sources":["../../src/evolution/fitness.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,QAAgB,EAChB,QAA4B;IAE5B,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEpC,+CAA+C;IAC/C,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAC5D,MAAM,aAAa,GAAG,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;IAErD,gDAAgD;IAChD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,mBAAmB,EAAE,CAAC;YAC7C,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACzB,IAAI,EAAE,CAAC,MAAM,KAAK,QAAQ;oBAAE,WAAW,EAAE,CAAC;gBAC1C,IAAI,EAAE,CAAC,MAAM,KAAK,UAAU;oBAAE,aAAa,EAAE,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,aAAa,GAAG,WAAW,GAAG,aAAa,CAAC;IAClD,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC;QACnC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,aAAa,CAAC,GAAG,aAAa;QACvD,CAAC,CAAC,GAAG,CAAC,CAAC,yBAAyB;IAElC,uDAAuD;IACvD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAC/C,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,EAAE,CAAC,CAAC;IAEhD,OAAO,aAAa,GAAG,GAAG,GAAG,WAAW,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,CAAC;AACjE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,QAAgB,EAChB,QAA4B;IAE5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAEtC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,mBAAmB,EAAE,CAAC;YAC7C,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAEnC,oCAAoC;YACpC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAE3C,IAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAC3B,SAAS,IAAI,MAAM,CAAC;YACtB,CAAC;iBAAM,IAAI,EAAE,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBACpC,WAAW,IAAI,MAAM,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,SAAS,GAAG,WAAW,CAAC;IACtC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAE5B,yDAAyD;IACzD,MAAM,QAAQ,GAAG,CAAC,SAAS,GAAG,WAAW,CAAC,GAAG,KAAK,CAAC;IAEnD,4EAA4E;IAC5E,OAAO,GAAG,GAAG,QAAQ,GAAG,GAAG,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAwB;IAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS;QAChC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACtE,CAAC,CAAC,CAAC,CAAC;IAEN,0BAA0B;IAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,EAAE,CAAC,CAAC;AAChD,CAAC"}

package/dist/evolution/index.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Intent DNA — Evolution Engine
+ *
+ * Orchestrates the epigenetic learning loop:
+ *   1. Record outcome (via collector)
+ *   2. Generate/update markers (via marker-gen)
+ *   3. Store markers (via store)
+ *   4. Compilation pipeline reads markers on next run
+ */
+import type { EpigeneticMarker } from "../schema/types.js";
+import type { EvolutionConfig } from "./types.js";
+import { EvolutionStore } from "./store.js";
+import { OutcomeCollector, type RecordOutcomeInput, type OutcomeSummary } from "./collector.js";
+import { type MarkerChange } from "./marker-gen.js";
+export { EvolutionStore } from "./store.js";
+export { OutcomeCollector } from "./collector.js";
+export { generateMarkers, describeMarkerChanges } from "./marker-gen.js";
+export { computeGeneFitness, computeModulationFactor, computeMarkerStrength } from "./fitness.js";
+export type { ExecutionOutcome, ConstraintFeedback, OutcomeMetrics, EvolutionConfig, MarkerFitness } from "./types.js";
+export type { RecordOutcomeInput, OutcomeSummary } from "./collector.js";
+export type { MarkerChange } from "./marker-gen.js";
+/**
+ * The Evolution Engine: ties together collection, marker generation, and storage.
+ */
+export declare class EvolutionEngine {
+    readonly store: EvolutionStore;
+    readonly collector: OutcomeCollector;
+    private config;
+    constructor(config?: Partial<EvolutionConfig>);
+    /**
+     * Record an execution outcome.
+     */
+    recordOutcome(input: RecordOutcomeInput): Promise<string>;
+    /**
+     * Evolve: generate/update epigenetic markers based on accumulated outcomes.
+     * Returns the new marker set.
+     */
+    evolve(dnaId: string): Promise<EpigeneticMarker[]>;
+    /**
+     * Preview what markers would be generated without persisting.
+     */
+    preview(dnaId: string): Promise<MarkerChange[]>;
+    /**
+     * Load stored markers for use in compilation.
+     * This is the integration point with the compiler pipeline.
+     */
+    loadMarkers(dnaId: string): Promise<EpigeneticMarker[]>;
+    /**
+     * Get outcome summary for a DNA.
+     */
+    summary(dnaId: string): Promise<OutcomeSummary>;
+}
+//# sourceMappingURL=index.d.ts.map

package/dist/evolution/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/evolution/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,KAAK,EAAoB,eAAe,EAAsC,MAAM,YAAY,CAAC;AAExG,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,KAAK,kBAAkB,EAAE,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChG,OAAO,EAA0C,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE5F,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACzE,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AAClG,YAAY,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,cAAc,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACvH,YAAY,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACzE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD;;GAEG;AACH,qBAAa,eAAe;IAC1B,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,gBAAgB,CAAC;IACrC,OAAO,CAAC,MAAM,CAAkB;gBAEpB,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC;IAM7C;;OAEG;IACG,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC;IAI/D;;;OAGG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAQxD;;OAEG;IACG,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAMrD;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAI7D;;OAEG;IACG,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC;CAGtD"}