@zelari/core 1.26.0 → 1.27.1

package/dist/index.d.ts

@@ -12,4 +12,5 @@ export * from './council/index.js';
 export * from './skills/index.js';
 export * from './memory/types.js';
 export * from './state/index.js';
+export * from './kraken/index.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,cAAc,mBAAmB,CAAC;AAGlC,cAAc,kBAAkB,CAAC;AAGjC,cAAc,oBAAoB,CAAC;AAGnC,cAAc,oBAAoB,CAAC;AAGnC,cAAc,mBAAmB,CAAC;AAGlC,cAAc,mBAAmB,CAAC;AAGlC,cAAc,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,cAAc,mBAAmB,CAAC;AAGlC,cAAc,kBAAkB,CAAC;AAGjC,cAAc,oBAAoB,CAAC;AAGnC,cAAc,oBAAoB,CAAC;AAGnC,cAAc,mBAAmB,CAAC;AAGlC,cAAc,mBAAmB,CAAC;AAGlC,cAAc,kBAAkB,CAAC;AAGjC,cAAc,mBAAmB,CAAC"}

package/dist/index.js

@@ -19,4 +19,6 @@ export * from './skills/index.js';
 export * from './memory/types.js';
 // Durable state contract (file-backed store lives in the CLI)
 export * from './state/index.js';
+// Kraken graph engine (pure DAG primitives; orchestration lives in the CLI)
+export * from './kraken/index.js';
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,qCAAqC;AACrC,cAAc,mBAAmB,CAAC;AAElC,eAAe;AACf,cAAc,kBAAkB,CAAC;AAEjC,aAAa;AACb,cAAc,oBAAoB,CAAC;AAEnC,sCAAsC;AACtC,cAAc,oBAAoB,CAAC;AAEnC,oBAAoB;AACpB,cAAc,mBAAmB,CAAC;AAElC,4DAA4D;AAC5D,cAAc,mBAAmB,CAAC;AAElC,8DAA8D;AAC9D,cAAc,kBAAkB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,qCAAqC;AACrC,cAAc,mBAAmB,CAAC;AAElC,eAAe;AACf,cAAc,kBAAkB,CAAC;AAEjC,aAAa;AACb,cAAc,oBAAoB,CAAC;AAEnC,sCAAsC;AACtC,cAAc,oBAAoB,CAAC;AAEnC,oBAAoB;AACpB,cAAc,mBAAmB,CAAC;AAElC,4DAA4D;AAC5D,cAAc,mBAAmB,CAAC;AAElC,8DAA8D;AAC9D,cAAc,kBAAkB,CAAC;AAEjC,4EAA4E;AAC5E,cAAc,mBAAmB,CAAC"}

package/dist/kraken/conflict.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Kraken graph engine — scope-overlap detection & parallelism policy (pure).
+ *
+ * Decides whether two graph nodes may run concurrently. Read-only kinds
+ * (explore/verify) are always parallel-safe; writers (general/fix) may run in
+ * parallel only when their path scopes are provably disjoint. Conservative by
+ * design: any ambiguity resolves to "not parallel". No CLI dependencies.
+ *
+ * @since v0.10.x — Kraken graph engine (F1)
+ */
+import type { TaskNode } from './graph.js';
+/** Normalize a path/glob for comparison: forward slashes, no `./` or trailing `/`. */
+export declare function normalizeScopePath(p: string): string;
+/**
+ * Decide whether two scope paths could match a common file (i.e. their allowed
+ * sets are NOT provably disjoint). Comparison is segment-wise so that
+ * `src/auth` and `src/authz` do NOT overlap, while `src/auth` and
+ * `src/auth/jwt.ts` DO (ancestor/descendant). A `**` segment overlaps anything
+ * at or below its position.
+ *
+ * Conservative: returns true (overlap) on any ambiguity.
+ */
+export declare function pathsOverlap(a: string, b: string): boolean;
+/**
+ * True when two scope allowlists are provably disjoint (no pair overlaps).
+ * Empty/absent scopes are treated as "whole tree" → NOT disjoint.
+ */
+export declare function disjointScopeSets(scopeA: string[] | undefined, scopeB: string[] | undefined): boolean;
+/**
+ * May two nodes execute concurrently?
+ *  - read-only kinds (explore/verify) are always parallel-safe;
+ *  - a `merge` node is never parallel (it must serialize on its branch);
+ *  - two writers (general/fix) run in parallel only if both declare scopes and
+ *    those scopes are provably disjoint;
+ *  - any missing scope on a writer → conservative "not parallel".
+ */
+export declare function canRunParallel(a: TaskNode, b: TaskNode): boolean;
+/**
+ * From a set of candidate nodes, pick the largest prefix (in input order) that
+ * can ALL run concurrently with each other. Used by the executor to form a
+ * parallel wave. The first node is always included.
+ */
+export declare function selectParallelWave(candidates: TaskNode[]): TaskNode[];
+//# sourceMappingURL=conflict.d.ts.map

package/dist/kraken/conflict.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.d.ts","sourceRoot":"","sources":["../../src/kraken/conflict.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAgB,MAAM,YAAY,CAAC;AAQzD,sFAAsF;AACtF,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAWpD;AA+CD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAkB1D;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,EAC5B,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,GAC3B,OAAO,CAST;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,OAAO,CAWhE;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAMrE"}

package/dist/kraken/conflict.js

@@ -0,0 +1,158 @@
+/**
+ * Kraken graph engine — scope-overlap detection & parallelism policy (pure).
+ *
+ * Decides whether two graph nodes may run concurrently. Read-only kinds
+ * (explore/verify) are always parallel-safe; writers (general/fix) may run in
+ * parallel only when their path scopes are provably disjoint. Conservative by
+ * design: any ambiguity resolves to "not parallel". No CLI dependencies.
+ *
+ * @since v0.10.x — Kraken graph engine (F1)
+ */
+/** Kinds that never mutate the workspace (read-only / read+bash). */
+const READ_ONLY_KINDS = ['explore', 'verify'];
+/** Kinds that mutate the workspace and therefore need disjoint scopes. */
+const WRITER_KINDS = ['general', 'fix'];
+/** Normalize a path/glob for comparison: forward slashes, no `./` or trailing `/`. */
+export function normalizeScopePath(p) {
+    let s = p.trim().replace(/\\/g, '/');
+    // Strip a leading `./`.
+    if (s.startsWith('./'))
+        s = s.slice(2);
+    // Collapse duplicate slashes.
+    s = s.replace(/\/{2,}/g, '/');
+    // Strip trailing slash (but keep a bare `/` as-is → becomes '').
+    if (s.length > 1 && s.endsWith('/'))
+        s = s.slice(0, -1);
+    // A lone `.` means "the current dir / whole tree" → normalize to root.
+    if (s === '.')
+        s = '';
+    return s;
+}
+/** Split a normalized path into segments (drops empty segments). */
+function segments(p) {
+    return normalizeScopePath(p)
+        .split('/')
+        .filter((s) => s.length > 0);
+}
+/** Does a segment contain a glob wildcard? */
+function isGlobSegment(seg) {
+    return seg.includes('*') || seg.includes('?') || seg.includes('[');
+}
+/** Escape regex-special chars in a literal string. */
+function escapeRegex(s) {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+}
+/**
+ * Match a single path segment against another, honoring glob wildcards.
+ * `*` matches any run within the segment, `?` matches one char, `[...]` is a
+ * char class. If both segments are globs we conservatively assume they CAN
+ * match the same name (→ potential overlap).
+ */
+function segmentMatches(a, b) {
+    if (a === b)
+        return true;
+    if (a === '**' || b === '**')
+        return true;
+    const aGlob = isGlobSegment(a);
+    const bGlob = isGlobSegment(b);
+    if (aGlob && bGlob)
+        return true; // ambiguous → assume overlap (conservative)
+    if (aGlob)
+        return globSegmentToRegex(a).test(b);
+    if (bGlob)
+        return globSegmentToRegex(b).test(a);
+    return false; // two distinct literals
+}
+/** Compile a single glob segment to an anchored RegExp (`*`→`.*`, `?`→`.`). */
+function globSegmentToRegex(seg) {
+    let re = '';
+    for (const ch of seg) {
+        if (ch === '*')
+            re += '.*';
+        else if (ch === '?')
+            re += '.';
+        else
+            re += escapeRegex(ch);
+    }
+    return new RegExp(`^${re}$`);
+}
+/**
+ * Decide whether two scope paths could match a common file (i.e. their allowed
+ * sets are NOT provably disjoint). Comparison is segment-wise so that
+ * `src/auth` and `src/authz` do NOT overlap, while `src/auth` and
+ * `src/auth/jwt.ts` DO (ancestor/descendant). A `**` segment overlaps anything
+ * at or below its position.
+ *
+ * Conservative: returns true (overlap) on any ambiguity.
+ */
+export function pathsOverlap(a, b) {
+    const segA = segments(a);
+    const segB = segments(b);
+    // Two empty/root scopes both mean "the whole tree" → overlap.
+    if (segA.length === 0 && segB.length === 0)
+        return true;
+    const len = Math.min(segA.length, segB.length);
+    for (let i = 0; i < len; i++) {
+        const sa = segA[i];
+        const sb = segB[i];
+        if (sa === '**' || sb === '**')
+            return true; // globstar swallows the rest
+        if (!segmentMatches(sa, sb))
+            return false; // diverged → disjoint
+    }
+    // All compared segments matched. If one path is an ancestor of the other
+    // (or they are equal), their sets overlap.
+    return true;
+}
+/**
+ * True when two scope allowlists are provably disjoint (no pair overlaps).
+ * Empty/absent scopes are treated as "whole tree" → NOT disjoint.
+ */
+export function disjointScopeSets(scopeA, scopeB) {
+    if (!scopeA || scopeA.length === 0)
+        return false;
+    if (!scopeB || scopeB.length === 0)
+        return false;
+    for (const a of scopeA) {
+        for (const b of scopeB) {
+            if (pathsOverlap(a, b))
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * May two nodes execute concurrently?
+ *  - read-only kinds (explore/verify) are always parallel-safe;
+ *  - a `merge` node is never parallel (it must serialize on its branch);
+ *  - two writers (general/fix) run in parallel only if both declare scopes and
+ *    those scopes are provably disjoint;
+ *  - any missing scope on a writer → conservative "not parallel".
+ */
+export function canRunParallel(a, b) {
+    if (a.kind === 'merge' || b.kind === 'merge')
+        return false;
+    if (READ_ONLY_KINDS.includes(a.kind) || READ_ONLY_KINDS.includes(b.kind)) {
+        return true;
+    }
+    // Both are writers (general/fix): require provably disjoint scopes.
+    if (WRITER_KINDS.includes(a.kind) && WRITER_KINDS.includes(b.kind)) {
+        return disjointScopeSets(a.scope, b.scope);
+    }
+    // Unknown kind combination → conservative.
+    return false;
+}
+/**
+ * From a set of candidate nodes, pick the largest prefix (in input order) that
+ * can ALL run concurrently with each other. Used by the executor to form a
+ * parallel wave. The first node is always included.
+ */
+export function selectParallelWave(candidates) {
+    const wave = [];
+    for (const node of candidates) {
+        if (wave.every((w) => canRunParallel(w, node)))
+            wave.push(node);
+    }
+    return wave;
+}
+//# sourceMappingURL=conflict.js.map

package/dist/kraken/conflict.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.js","sourceRoot":"","sources":["../../src/kraken/conflict.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,qEAAqE;AACrE,MAAM,eAAe,GAA4B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;AAEvE,0EAA0E;AAC1E,MAAM,YAAY,GAA4B,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AAEjE,sFAAsF;AACtF,MAAM,UAAU,kBAAkB,CAAC,CAAS;IAC1C,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrC,wBAAwB;IACxB,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvC,8BAA8B;IAC9B,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAC9B,iEAAiE;IACjE,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,uEAAuE;IACvE,IAAI,CAAC,KAAK,GAAG;QAAE,CAAC,GAAG,EAAE,CAAC;IACtB,OAAO,CAAC,CAAC;AACX,CAAC;AAED,oEAAoE;AACpE,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,kBAAkB,CAAC,CAAC,CAAC;SACzB,KAAK,CAAC,GAAG,CAAC;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,8CAA8C;AAC9C,SAAS,aAAa,CAAC,GAAW;IAChC,OAAO,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AACrE,CAAC;AAED,sDAAsD;AACtD,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,KAAK,IAAI,KAAK;QAAE,OAAO,IAAI,CAAC,CAAC,4CAA4C;IAC7E,IAAI,KAAK;QAAE,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,KAAK;QAAE,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,OAAO,KAAK,CAAC,CAAC,wBAAwB;AACxC,CAAC;AAED,+EAA+E;AAC/E,SAAS,kBAAkB,CAAC,GAAW;IACrC,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,EAAE,KAAK,GAAG;YAAE,EAAE,IAAI,IAAI,CAAC;aACtB,IAAI,EAAE,KAAK,GAAG;YAAE,EAAE,IAAI,GAAG,CAAC;;YAC1B,EAAE,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,IAAI,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEzB,8DAA8D;IAC9D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAExD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,CAAC,6BAA6B;QAC1E,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,sBAAsB;IACnE,CAAC;IAED,yEAAyE;IACzE,2CAA2C;IAC3C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAA4B,EAC5B,MAA4B;IAE5B,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACjD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,CAAW,EAAE,CAAW;IACrD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3D,IAAI,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACzE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oEAAoE;IACpE,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACnE,OAAO,iBAAiB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC;IACD,2CAA2C;IAC3C,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAsB;IACvD,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/kraken/graph.d.ts

@@ -0,0 +1,92 @@
+/**
+ * Kraken graph engine — pure DAG model & validation (no CLI dependencies).
+ *
+ * This module is intentionally dependency-free so it lives in @zelari/core
+ * and is unit-testable without the CLI. Orchestration (LLM planner, executor,
+ * worktree/world-model wiring) lives in the CLI (`src/cli/kraken/`) and imports
+ * these primitives. See `.zelari/docs/kraken-graph-engine-plan.md` (CORREZIONE-1).
+ *
+ * @since v0.10.x — Kraken graph engine (F1)
+ */
+/** What a graph node does. Mirrors taskTool kinds plus graph-only kinds. */
+export type TaskNodeKind = 'explore' | 'general' | 'verify' | 'fix' | 'merge';
+/** Lifecycle state of a node within an executing graph. */
+export type TaskNodeStatus = 'pending' | 'running' | 'done' | 'error' | 'skipped';
+/** States that mean "this node will not run (again)". */
+export declare const TERMINAL_STATUSES: readonly TaskNodeStatus[];
+/** A single unit of work in a Kraken task graph. */
+export interface TaskNode {
+    /** Unique id within the graph (e.g. `e1`, `g2`, `fix-g1-1`). */
+    id: string;
+    kind: TaskNodeKind;
+    /** Short human label (for radio / status UI). */
+    label: string;
+    /** Full self-contained prompt handed to the sub-agent. */
+    prompt: string;
+    /** Optional path/glob allowlist (contract). Required for parallel general/fix. */
+    scope?: string[];
+    /** Optional acceptance checklist (contract). */
+    acceptance?: string[];
+    /** Ids of predecessor nodes that must be `done` before this one may start. */
+    deps: string[];
+    status: TaskNodeStatus;
+    /** How many times this node has been retried after a failure. */
+    retryCount: number;
+    /** Max retries before a fix-node is spawned (or permanent failure). */
+    maxRetries: number;
+    /** Final sub-agent conclusion (set when `done`). */
+    result?: string;
+    /** Last error message (set when `error`). */
+    error?: string;
+}
+/** A directed acyclic graph of task nodes, keyed by node id. */
+export interface TaskGraph {
+    id: string;
+    nodes: Map<string, TaskNode>;
+}
+/** Result of {@link validateGraph}. */
+export type GraphValidation = {
+    ok: true;
+} | {
+    ok: false;
+    errors: string[];
+};
+export interface ValidateGraphOptions {
+    /** Anti-explosion bound on node count. Default 24 (ZELARI_KRAKEN_MAX_NODES). */
+    maxNodes?: number;
+}
+/** Default anti-explosion bound for graph size. */
+export declare const DEFAULT_MAX_NODES = 24;
+/** Build a graph from a flat list of nodes (indexing by id). */
+export declare function createGraph(id: string, nodes: TaskNode[]): TaskGraph;
+/**
+ * Validate structural integrity of a graph:
+ *  - node ids are unique and non-empty
+ *  - every dep references an existing node
+ *  - no dependency cycles (the graph is a DAG)
+ *  - node count within `maxNodes`
+ *
+ * Pure and side-effect free. Returns all detected errors (not just the first).
+ */
+export declare function validateGraph(graph: TaskGraph, opts?: ValidateGraphOptions): GraphValidation;
+/**
+ * Nodes that may start now: status `pending` with every dep already `done`.
+ * (Deps in `error`/`skipped` do NOT satisfy readiness — the executor decides
+ * whether to skip downstream nodes.)
+ */
+export declare function getReadyNodes(graph: TaskGraph): TaskNode[];
+/**
+ * Group node ids into topological levels (Kahn's algorithm). Level 0 has no
+ * deps; level N depends only on levels < N. Useful for ASCII rendering and
+ * coarse scheduling. Nodes in a cycle are omitted (validateGraph rejects them).
+ */
+export declare function topoLevels(graph: TaskGraph): string[][];
+/** True when no node is `pending` or `running` (execution has settled). */
+export declare function isSettled(graph: TaskGraph): boolean;
+/** True when every node finished successfully (`done` or `skipped`). */
+export declare function isConverged(graph: TaskGraph): boolean;
+/** Ids of nodes in a terminal failure state. */
+export declare function failedNodeIds(graph: TaskGraph): string[];
+/** Count nodes by status (for status UI: "graph 3/8 · 2↑"). */
+export declare function countByStatus(graph: TaskGraph): Record<TaskNodeStatus, number>;
+//# sourceMappingURL=graph.d.ts.map

package/dist/kraken/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/kraken/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,4EAA4E;AAC5E,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,KAAK,GAAG,OAAO,CAAC;AAE9E,2DAA2D;AAC3D,MAAM,MAAM,cAAc,GACtB,SAAS,GACT,SAAS,GACT,MAAM,GACN,OAAO,GACP,SAAS,CAAC;AAEd,yDAAyD;AACzD,eAAO,MAAM,iBAAiB,EAAE,SAAS,cAAc,EAItD,CAAC;AAEF,oDAAoD;AACpD,MAAM,WAAW,QAAQ;IACvB,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,YAAY,CAAC;IACnB,iDAAiD;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,0DAA0D;IAC1D,MAAM,EAAE,MAAM,CAAC;IACf,kFAAkF;IAClF,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,gDAAgD;IAChD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,8EAA8E;IAC9E,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,MAAM,EAAE,cAAc,CAAC;IACvB,iEAAiE;IACjE,UAAU,EAAE,MAAM,CAAC;IACnB,uEAAuE;IACvE,UAAU,EAAE,MAAM,CAAC;IACnB,oDAAoD;IACpD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,gEAAgE;AAChE,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B;AAED,uCAAuC;AACvC,MAAM,MAAM,eAAe,GACvB;IAAE,EAAE,EAAE,IAAI,CAAA;CAAE,GACZ;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAEpC,MAAM,WAAW,oBAAoB;IACnC,gFAAgF;IAChF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,mDAAmD;AACnD,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAEpC,gEAAgE;AAChE,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,SAAS,CAIpE;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,EAChB,IAAI,GAAE,oBAAyB,GAC9B,eAAe,CAoCjB;AAoDD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,QAAQ,EAAE,CAQ1D;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,EAAE,EAAE,CAgCvD;AAED,2EAA2E;AAC3E,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAKnD;AAED,wEAAwE;AACxE,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAMrD;AAED,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,EAAE,CAMxD;AAED,+DAA+D;AAC/D,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAU9E"}

package/dist/kraken/graph.js

@@ -0,0 +1,212 @@
+/**
+ * Kraken graph engine — pure DAG model & validation (no CLI dependencies).
+ *
+ * This module is intentionally dependency-free so it lives in @zelari/core
+ * and is unit-testable without the CLI. Orchestration (LLM planner, executor,
+ * worktree/world-model wiring) lives in the CLI (`src/cli/kraken/`) and imports
+ * these primitives. See `.zelari/docs/kraken-graph-engine-plan.md` (CORREZIONE-1).
+ *
+ * @since v0.10.x — Kraken graph engine (F1)
+ */
+/** States that mean "this node will not run (again)". */
+export const TERMINAL_STATUSES = [
+    'done',
+    'error',
+    'skipped',
+];
+/** Default anti-explosion bound for graph size. */
+export const DEFAULT_MAX_NODES = 24;
+/** Build a graph from a flat list of nodes (indexing by id). */
+export function createGraph(id, nodes) {
+    const map = new Map();
+    for (const n of nodes)
+        map.set(n.id, n);
+    return { id, nodes: map };
+}
+/**
+ * Validate structural integrity of a graph:
+ *  - node ids are unique and non-empty
+ *  - every dep references an existing node
+ *  - no dependency cycles (the graph is a DAG)
+ *  - node count within `maxNodes`
+ *
+ * Pure and side-effect free. Returns all detected errors (not just the first).
+ */
+export function validateGraph(graph, opts = {}) {
+    const maxNodes = opts.maxNodes ?? DEFAULT_MAX_NODES;
+    const errors = [];
+    const nodes = graph.nodes;
+    if (nodes.size === 0) {
+        errors.push('graph is empty (no nodes)');
+    }
+    if (nodes.size > maxNodes) {
+        errors.push(`graph has ${nodes.size} nodes, exceeding maxNodes=${maxNodes}`);
+    }
+    for (const [id, node] of nodes) {
+        if (!id || id.trim() === '') {
+            errors.push('node with empty id');
+            continue;
+        }
+        if (node.id !== id) {
+            errors.push(`node keyed "${id}" has mismatching node.id "${node.id}"`);
+        }
+        for (const dep of node.deps) {
+            if (!nodes.has(dep)) {
+                errors.push(`node "${id}" depends on unknown node "${dep}"`);
+            }
+            if (dep === id) {
+                errors.push(`node "${id}" depends on itself`);
+            }
+        }
+    }
+    const cycle = findCycle(nodes);
+    if (cycle) {
+        errors.push(`dependency cycle detected: ${cycle.join(' -> ')}`);
+    }
+    return errors.length === 0 ? { ok: true } : { ok: false, errors };
+}
+/**
+ * Detect a dependency cycle via iterative DFS with white/gray/black coloring.
+ * Returns one cycle as an id path (e.g. ['a','b','a']) or null if acyclic.
+ */
+function findCycle(nodes) {
+    const WHITE = 0;
+    const GRAY = 1;
+    const BLACK = 2;
+    const color = new Map();
+    for (const id of nodes.keys())
+        color.set(id, WHITE);
+    for (const start of nodes.keys()) {
+        if (color.get(start) !== WHITE)
+            continue;
+        // Stack of [nodeId, nextDepIndex]; path tracks the current DFS chain.
+        const stack = [[start, 0]];
+        const path = [];
+        color.set(start, GRAY);
+        path.push(start);
+        while (stack.length > 0) {
+            const top = stack[stack.length - 1];
+            const [id, idx] = top;
+            const node = nodes.get(id);
+            const deps = node ? node.deps : [];
+            if (idx < deps.length) {
+                top[1] = idx + 1;
+                const dep = deps[idx];
+                if (!nodes.has(dep))
+                    continue; // unknown dep — reported by validateGraph
+                const c = color.get(dep);
+                if (c === GRAY) {
+                    // Back edge → cycle. Slice the path from the first occurrence of dep.
+                    const at = path.indexOf(dep);
+                    return [...path.slice(at), dep];
+                }
+                if (c === WHITE) {
+                    color.set(dep, GRAY);
+                    path.push(dep);
+                    stack.push([dep, 0]);
+                }
+            }
+            else {
+                color.set(id, BLACK);
+                path.pop();
+                stack.pop();
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Nodes that may start now: status `pending` with every dep already `done`.
+ * (Deps in `error`/`skipped` do NOT satisfy readiness — the executor decides
+ * whether to skip downstream nodes.)
+ */
+export function getReadyNodes(graph) {
+    const ready = [];
+    for (const node of graph.nodes.values()) {
+        if (node.status !== 'pending')
+            continue;
+        const depsReady = node.deps.every((d) => graph.nodes.get(d)?.status === 'done');
+        if (depsReady)
+            ready.push(node);
+    }
+    return ready;
+}
+/**
+ * Group node ids into topological levels (Kahn's algorithm). Level 0 has no
+ * deps; level N depends only on levels < N. Useful for ASCII rendering and
+ * coarse scheduling. Nodes in a cycle are omitted (validateGraph rejects them).
+ */
+export function topoLevels(graph) {
+    const nodes = graph.nodes;
+    const indegree = new Map();
+    const dependents = new Map();
+    for (const [id, node] of nodes) {
+        indegree.set(id, node.deps.filter((d) => nodes.has(d)).length);
+        for (const dep of node.deps) {
+            if (!nodes.has(dep))
+                continue;
+            const arr = dependents.get(dep) ?? [];
+            arr.push(id);
+            dependents.set(dep, arr);
+        }
+    }
+    const levels = [];
+    let frontier = [...nodes.keys()].filter((id) => (indegree.get(id) ?? 0) === 0);
+    const visited = new Set();
+    while (frontier.length > 0) {
+        levels.push([...frontier].sort());
+        const next = [];
+        for (const id of frontier) {
+            visited.add(id);
+            for (const child of dependents.get(id) ?? []) {
+                const d = (indegree.get(child) ?? 0) - 1;
+                indegree.set(child, d);
+                if (d === 0)
+                    next.push(child);
+            }
+        }
+        frontier = next;
+    }
+    return levels;
+}
+/** True when no node is `pending` or `running` (execution has settled). */
+export function isSettled(graph) {
+    for (const node of graph.nodes.values()) {
+        if (node.status === 'pending' || node.status === 'running')
+            return false;
+    }
+    return true;
+}
+/** True when every node finished successfully (`done` or `skipped`). */
+export function isConverged(graph) {
+    if (graph.nodes.size === 0)
+        return false;
+    for (const node of graph.nodes.values()) {
+        if (node.status !== 'done' && node.status !== 'skipped')
+            return false;
+    }
+    return true;
+}
+/** Ids of nodes in a terminal failure state. */
+export function failedNodeIds(graph) {
+    const out = [];
+    for (const node of graph.nodes.values()) {
+        if (node.status === 'error')
+            out.push(node.id);
+    }
+    return out;
+}
+/** Count nodes by status (for status UI: "graph 3/8 · 2↑"). */
+export function countByStatus(graph) {
+    const counts = {
+        pending: 0,
+        running: 0,
+        done: 0,
+        error: 0,
+        skipped: 0,
+    };
+    for (const node of graph.nodes.values())
+        counts[node.status] += 1;
+    return counts;
+}
+//# sourceMappingURL=graph.js.map

package/dist/kraken/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/kraken/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAaH,yDAAyD;AACzD,MAAM,CAAC,MAAM,iBAAiB,GAA8B;IAC1D,MAAM;IACN,OAAO;IACP,SAAS;CACV,CAAC;AA4CF,mDAAmD;AACnD,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAEpC,gEAAgE;AAChE,MAAM,UAAU,WAAW,CAAC,EAAU,EAAE,KAAiB;IACvD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACxC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAgB,EAChB,OAA6B,EAAE;IAE/B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACpD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAE1B,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,GAAG,QAAQ,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,aAAa,KAAK,CAAC,IAAI,8BAA8B,QAAQ,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE,8BAA8B,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACzE,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,8BAA8B,GAAG,GAAG,CAAC,CAAC;YAC/D,CAAC;YACD,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,CAAC,IAAI,CAAC,8BAA8B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AACpE,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAA4B;IAC7C,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAEpD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK;YAAE,SAAS;QACzC,sEAAsE;QACtE,MAAM,KAAK,GAA4B,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAEnC,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBACtB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;gBACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS,CAAC,0CAA0C;gBACzE,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACzB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;oBACf,sEAAsE;oBACtE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;oBAC7B,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;gBAClC,CAAC;gBACD,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;oBAChB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACrB,IAAI,CAAC,GAAG,EAAE,CAAC;gBACX,KAAK,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC5C,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;QAChF,IAAI,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,KAAgB;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC9B,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACtC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAClC,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,SAAS,CAAC,KAAgB;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IAC3E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,WAAW,CAAC,KAAgB;IAC1C,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,KAAK,OAAO;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC5C,MAAM,MAAM,GAAmC;QAC7C,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;QACV,IAAI,EAAE,CAAC;QACP,KAAK,EAAE,CAAC;QACR,OAAO,EAAE,CAAC;KACX,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClE,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/kraken/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Kraken graph engine — public surface (pure DAG primitives).
+ *
+ * Orchestration (planner/executor/worktree/world-model wiring) lives in the
+ * CLI and is NOT exported here. See `.zelari/docs/kraken-graph-engine-plan.md`.
+ */
+export * from './graph.js';
+export * from './conflict.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/kraken/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC"}

package/dist/kraken/index.js

@@ -0,0 +1,9 @@
+/**
+ * Kraken graph engine — public surface (pure DAG primitives).
+ *
+ * Orchestration (planner/executor/worktree/world-model wiring) lives in the
+ * CLI and is NOT exported here. See `.zelari/docs/kraken-graph-engine-plan.md`.
+ */
+export * from './graph.js';
+export * from './conflict.js';
+//# sourceMappingURL=index.js.map

package/dist/kraken/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/kraken/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@zelari/core",
-  "version": "1.26.0",
+  "version": "1.27.1",
   "description": "Zelari Code core library — provider-neutral agent loop (AgentHarness), multi-agent council orchestration, and built-in skills. Used by the zelari-code CLI; consumable by other agent frontends.",
   "author": "Anathema Studio <https://anathema-studio.com/>",
   "license": "MIT",