aura-code 0.3.0

package/dist/integrations/harnesses.js

@@ -0,0 +1,161 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getHarnessStatus = getHarnessStatus;
+exports.getHermesStatus = getHermesStatus;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const child_process_1 = require("child_process");
+const HERMES_HOME = process.env.HERMES_HOME ?? '/home/dusanmilosavljevic/.hermes';
+const HERMES_WORKSPACE = process.env.HERMES_WORKSPACE ?? '/home/dusanmilosavljevic/hermes-workspace';
+const harnesses = [
+    {
+        id: 'opencode',
+        name: 'OpenCode',
+        command: 'opencode',
+        role: 'External terminal coding agent for project-level coding tasks.',
+        notes: ['Use as an alternate coding backend.', 'Ruby should pass a project cwd and a bounded prompt.'],
+    },
+    {
+        id: 'openclaude',
+        name: 'OpenClaude',
+        command: 'openclaude',
+        role: 'Claude-style CLI harness for coding and conversational work.',
+        notes: ['Useful as a Claude-compatible fallback.', 'Keep secrets in env/config, not in prompts.'],
+    },
+    {
+        id: 'antigravity',
+        name: 'Antigravity CLI',
+        command: 'agy',
+        role: 'Agentic workspace harness with project boundaries, permissions and background workflows.',
+        notes: ['Best treated as a workspace runner.', 'Ruby can inspect availability first, then expose launch actions.'],
+    },
+    {
+        id: 'pi',
+        name: 'Pi CLI',
+        command: 'pi',
+        role: 'General AI CLI/client available on this machine.',
+        notes: ['Useful for conversational or lightweight delegated tasks.', 'Adapter should stay optional until command contract is confirmed.'],
+    },
+    {
+        id: 'ollama',
+        name: 'Ollama',
+        command: 'ollama',
+        role: 'Local model runtime for offline/local inference.',
+        notes: ['Provider already supports ollama/* models.', 'Status may be available even when daemon is stopped.'],
+    },
+];
+function getHarnessStatus() {
+    return harnesses.map((h) => {
+        const found = which(h.command);
+        if (!found)
+            return { ...h, status: 'missing', notes: [...h.notes, 'Command not found in PATH.'] };
+        const version = getVersion(h.command);
+        return {
+            ...h,
+            status: version ? 'available' : 'partial',
+            path: found,
+            version: version ?? 'installed, version unavailable',
+        };
+    });
+}
+function getHermesStatus() {
+    const homeExists = fs.existsSync(HERMES_HOME);
+    const workspaceExists = fs.existsSync(HERMES_WORKSPACE);
+    const scriptsDir = path.join(HERMES_HOME, 'scripts');
+    const skillsDir = path.join(HERMES_HOME, 'skills');
+    const scripts = listFiles(scriptsDir, ['.py', '.sh', '.js', '.ts']).slice(0, 24);
+    const skills = listSkillNames(skillsDir);
+    return {
+        home: HERMES_HOME,
+        workspace: HERMES_WORKSPACE,
+        homeExists,
+        workspaceExists,
+        scripts,
+        skills: skills.slice(0, 36),
+        skillCount: skills.length,
+        processStateExists: fs.existsSync(path.join(HERMES_HOME, 'processes.json')),
+        gatewayStateExists: fs.existsSync(path.join(HERMES_HOME, 'gateway_state.json')),
+    };
+}
+function which(command) {
+    try {
+        return (0, child_process_1.execFileSync)('which', [command], { encoding: 'utf8', timeout: 3000 }).trim() || undefined;
+    }
+    catch {
+        return undefined;
+    }
+}
+function getVersion(command) {
+    for (const args of [['--version'], ['version'], ['-v']]) {
+        try {
+            const out = (0, child_process_1.execFileSync)(command, args, { encoding: 'utf8', timeout: 5000, stdio: ['ignore', 'pipe', 'pipe'] });
+            const version = out.trim().split('\n')[0]?.trim();
+            if (version)
+                return version;
+        }
+        catch {
+            // Try the next conventional version flag.
+        }
+    }
+    return undefined;
+}
+function listFiles(dir, extensions) {
+    if (!fs.existsSync(dir))
+        return [];
+    try {
+        return fs.readdirSync(dir, { withFileTypes: true })
+            .filter((entry) => entry.isFile() && extensions.some((ext) => entry.name.endsWith(ext)))
+            .map((entry) => entry.name)
+            .sort();
+    }
+    catch {
+        return [];
+    }
+}
+function listSkillNames(dir) {
+    if (!fs.existsSync(dir))
+        return [];
+    try {
+        return fs.readdirSync(dir, { withFileTypes: true })
+            .filter((entry) => entry.isDirectory() && !entry.name.startsWith('.'))
+            .map((entry) => entry.name)
+            .sort();
+    }
+    catch {
+        return [];
+    }
+}
+//# sourceMappingURL=harnesses.js.map

package/dist/integrations/harnesses.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"harnesses.js","sourceRoot":"","sources":["../../src/integrations/harnesses.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoEA,4CAYC;AAED,0CAkBC;AApGD,uCAAyB;AACzB,2CAA6B;AAC7B,iDAA6C;AAyB7C,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,kCAAkC,CAAC;AAClF,MAAM,gBAAgB,GAAG,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,2CAA2C,CAAC;AAErG,MAAM,SAAS,GAAG;IAChB;QACE,EAAE,EAAE,UAAU;QACd,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE,UAAU;QACnB,IAAI,EAAE,gEAAgE;QACtE,KAAK,EAAE,CAAC,qCAAqC,EAAE,sDAAsD,CAAC;KACvG;IACD;QACE,EAAE,EAAE,YAAY;QAChB,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE,YAAY;QACrB,IAAI,EAAE,8DAA8D;QACpE,KAAK,EAAE,CAAC,yCAAyC,EAAE,6CAA6C,CAAC;KAClG;IACD;QACE,EAAE,EAAE,aAAa;QACjB,IAAI,EAAE,iBAAiB;QACvB,OAAO,EAAE,KAAK;QACd,IAAI,EAAE,0FAA0F;QAChG,KAAK,EAAE,CAAC,qCAAqC,EAAE,kEAAkE,CAAC;KACnH;IACD;QACE,EAAE,EAAE,IAAI;QACR,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,kDAAkD;QACxD,KAAK,EAAE,CAAC,2DAA2D,EAAE,mEAAmE,CAAC;KAC1I;IACD;QACE,EAAE,EAAE,QAAQ;QACZ,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,QAAQ;QACjB,IAAI,EAAE,kDAAkD;QACxD,KAAK,EAAE,CAAC,4CAA4C,EAAE,sDAAsD,CAAC;KAC9G;CACF,CAAC;AAEF,SAAgB,gBAAgB;IAC9B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,SAAkB,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,4BAA4B,CAAC,EAAE,CAAC;QAC3G,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACtC,OAAO;YACL,GAAG,CAAC;YACJ,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,WAAoB,CAAC,CAAC,CAAC,SAAkB;YAC3D,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,OAAO,IAAI,gCAAgC;SACrD,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAgB,eAAe;IAC7B,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,eAAe,GAAG,EAAE,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjF,MAAM,MAAM,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;IACzC,OAAO;QACL,IAAI,EAAE,WAAW;QACjB,SAAS,EAAE,gBAAgB;QAC3B,UAAU;QACV,eAAe;QACf,OAAO;QACP,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QAC3B,UAAU,EAAE,MAAM,CAAC,MAAM;QACzB,kBAAkB,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC;QAC3E,kBAAkB,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;KAChF,CAAC;AACJ,CAAC;AAED,SAAS,KAAK,CAAC,OAAe;IAC5B,IAAI,CAAC;QACH,OAAO,IAAA,4BAAY,EAAC,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,SAAS,CAAC;IACnG,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,OAAe;IACjC,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACxD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAA,4BAAY,EAAC,OAAO,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAChH,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,OAAO;gBAAE,OAAO,OAAO,CAAC;QAC9B,CAAC;QAAC,MAAM,CAAC;YACP,0CAA0C;QAC5C,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,SAAS,CAAC,GAAW,EAAE,UAAoB;IAClD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;aAChD,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;aACvF,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aAC1B,IAAI,EAAE,CAAC;IACZ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,GAAW;IACjC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;aAChD,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;aACrE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aAC1B,IAAI,EAAE,CAAC;IACZ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC"}

package/dist/orchestration/competence.d.ts

@@ -0,0 +1,53 @@
+import type { PlanStep } from './types.js';
+export type SpecialistRole = PlanStep['specialist'];
+/**
+ * Task domains used to score which specialist performs best.
+ * Maps loosely to PlanStep.specialist roles but allows finer routing.
+ */
+export type CompetenceDomain = 'research' | 'implementation' | 'review' | 'planning' | 'ruby_gems' | 'ruby_tests' | 'refactor';
+/** A single specialist's score in one domain, learned over time. */
+export interface CompetenceScore {
+    specialist: SpecialistRole;
+    domain: CompetenceDomain;
+    /** Performance estimate in [0, 1]. */
+    score: number;
+    /** Number of step outcomes that contributed to this score. */
+    sampleCount: number;
+    /** Unix timestamp (ms) of the last update. */
+    lastUpdated: number;
+}
+/** Per-project competence profile persisted on disk. */
+export interface ProjectCompetence {
+    projectRoot: string;
+    scores: CompetenceScore[];
+    version: 1;
+}
+/** Outcome signal fed back after a plan step finishes. */
+export interface StepOutcome {
+    specialist: SpecialistRole;
+    domain: CompetenceDomain;
+    /** Whether the step reached `done` (not `failed` or `skipped`). */
+    success: boolean;
+    /** Optional normalised quality in [0, 1] from reviewer or heuristics. */
+    quality?: number;
+}
+/** Maps each specialist role to its primary competence domain. */
+export declare const PRIMARY_DOMAIN: Record<SpecialistRole, CompetenceDomain>;
+/** Builds the initial competence matrix from role priors. */
+export declare function defaultCompetenceMatrix(): CompetenceScore[];
+/**
+ * Returns the best specialist for a domain using stored scores, falling back to
+ * priors when no project profile exists.
+ */
+export declare function recommendSpecialist(domain: CompetenceDomain, scores: CompetenceScore[]): SpecialistRole;
+/**
+ * Exponential moving average update for one (specialist, domain) pair.
+ * `alpha` controls learning rate (higher = more weight on latest outcome).
+ */
+export declare function applyOutcome(scores: CompetenceScore[], outcome: StepOutcome, alpha?: number): CompetenceScore[];
+export declare const competenceStore: {
+    filePath(projectRoot: string): string;
+    load(projectRoot: string): Promise<ProjectCompetence>;
+    save(profile: ProjectCompetence): Promise<void>;
+    recordOutcome(projectRoot: string, outcome: StepOutcome): Promise<ProjectCompetence>;
+};

package/dist/orchestration/competence.js

@@ -0,0 +1,181 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.competenceStore = exports.PRIMARY_DOMAIN = void 0;
+exports.defaultCompetenceMatrix = defaultCompetenceMatrix;
+exports.recommendSpecialist = recommendSpecialist;
+exports.applyOutcome = applyOutcome;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+// ─────────────────────────────────────────────────────────────────────────────
+// Defaults — prior beliefs before any project-specific learning
+// ─────────────────────────────────────────────────────────────────────────────
+const DEFAULT_PRIORS = {
+    researcher: { research: 0.9, implementation: 0.4, ruby_gems: 0.6, refactor: 0.5 },
+    coder: { implementation: 0.9, ruby_gems: 0.85, ruby_tests: 0.7, refactor: 0.8, research: 0.35 },
+    reviewer: { review: 0.95, implementation: 0.5, refactor: 0.6 },
+    planner: { planning: 0.95, research: 0.7, refactor: 0.55 },
+};
+/** Maps each specialist role to its primary competence domain. */
+exports.PRIMARY_DOMAIN = {
+    researcher: 'research',
+    coder: 'implementation',
+    reviewer: 'review',
+    planner: 'planning',
+};
+function key(specialist, domain) {
+    return `${specialist}:${domain}`;
+}
+function clamp01(n) {
+    return Math.max(0, Math.min(1, n));
+}
+/** Builds the initial competence matrix from role priors. */
+function defaultCompetenceMatrix() {
+    const scores = [];
+    const now = Date.now();
+    for (const specialist of Object.keys(DEFAULT_PRIORS)) {
+        for (const [domain, score] of Object.entries(DEFAULT_PRIORS[specialist])) {
+            scores.push({
+                specialist,
+                domain: domain,
+                score: score,
+                sampleCount: 0,
+                lastUpdated: now,
+            });
+        }
+    }
+    return scores;
+}
+/**
+ * Returns the best specialist for a domain using stored scores, falling back to
+ * priors when no project profile exists.
+ */
+function recommendSpecialist(domain, scores) {
+    const candidates = scores.filter(s => s.domain === domain);
+    if (candidates.length === 0) {
+        const fallback = Object.entries(exports.PRIMARY_DOMAIN)
+            .find(([, d]) => d === domain);
+        if (fallback)
+            return fallback[0];
+        return 'coder';
+    }
+    const best = candidates.reduce((a, b) => (a.score >= b.score ? a : b));
+    return best.specialist;
+}
+/**
+ * Exponential moving average update for one (specialist, domain) pair.
+ * `alpha` controls learning rate (higher = more weight on latest outcome).
+ */
+function applyOutcome(scores, outcome, alpha = 0.15) {
+    const signal = outcome.success
+        ? clamp01(outcome.quality ?? 1)
+        : clamp01((outcome.quality ?? 0) * 0.25);
+    const now = Date.now();
+    const k = key(outcome.specialist, outcome.domain);
+    const idx = scores.findIndex(s => key(s.specialist, s.domain) === k);
+    if (idx < 0) {
+        const prior = DEFAULT_PRIORS[outcome.specialist]?.[outcome.domain] ?? 0.5;
+        return [
+            ...scores,
+            {
+                specialist: outcome.specialist,
+                domain: outcome.domain,
+                score: clamp01((1 - alpha) * prior + alpha * signal),
+                sampleCount: 1,
+                lastUpdated: now,
+            },
+        ];
+    }
+    const cur = scores[idx];
+    const next = {
+        ...cur,
+        score: clamp01((1 - alpha) * cur.score + alpha * signal),
+        sampleCount: cur.sampleCount + 1,
+        lastUpdated: now,
+    };
+    return [...scores.slice(0, idx), next, ...scores.slice(idx + 1)];
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Persistence — {projectRoot}/.aura/competence.json
+// ─────────────────────────────────────────────────────────────────────────────
+exports.competenceStore = {
+    filePath(projectRoot) {
+        return path.join(projectRoot, '.aura', 'competence.json');
+    },
+    async load(projectRoot) {
+        const filePath = this.filePath(projectRoot);
+        if (!fs.existsSync(filePath)) {
+            return {
+                projectRoot,
+                scores: defaultCompetenceMatrix(),
+                version: 1,
+            };
+        }
+        const raw = await fs.promises.readFile(filePath, 'utf8');
+        try {
+            const parsed = JSON.parse(raw);
+            if (parsed?.version === 1 && Array.isArray(parsed.scores)) {
+                return parsed;
+            }
+        }
+        catch {
+            /* fall through */
+        }
+        return {
+            projectRoot,
+            scores: defaultCompetenceMatrix(),
+            version: 1,
+        };
+    },
+    async save(profile) {
+        const filePath = this.filePath(profile.projectRoot);
+        const dir = path.dirname(filePath);
+        if (!fs.existsSync(dir))
+            fs.mkdirSync(dir, { recursive: true });
+        const tmp = filePath + '.tmp';
+        await fs.promises.writeFile(tmp, JSON.stringify(profile, null, 2), 'utf8');
+        await fs.promises.rename(tmp, filePath);
+    },
+    async recordOutcome(projectRoot, outcome) {
+        const profile = await this.load(projectRoot);
+        const updated = {
+            ...profile,
+            scores: applyOutcome(profile.scores, outcome),
+        };
+        await this.save(updated);
+        return updated;
+    },
+};
+//# sourceMappingURL=competence.js.map

package/dist/orchestration/competence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"competence.js","sourceRoot":"","sources":["../../src/orchestration/competence.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgFA,0DAeC;AAMD,kDAaC;AAMD,oCAkCC;AA1JD,uCAAyB;AACzB,2CAA6B;AAmD7B,gFAAgF;AAChF,gEAAgE;AAChE,gFAAgF;AAEhF,MAAM,cAAc,GAAsE;IACxF,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;IACjF,KAAK,EAAE,EAAE,cAAc,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE;IAC/F,QAAQ,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;IAC9D,OAAO,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE;CAC3D,CAAC;AAEF,kEAAkE;AACrD,QAAA,cAAc,GAA6C;IACtE,UAAU,EAAE,UAAU;IACtB,KAAK,EAAE,gBAAgB;IACvB,QAAQ,EAAE,QAAQ;IAClB,OAAO,EAAE,UAAU;CACpB,CAAC;AAEF,SAAS,GAAG,CAAC,UAA0B,EAAE,MAAwB;IAC/D,OAAO,GAAG,UAAU,IAAI,MAAM,EAAE,CAAC;AACnC,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,6DAA6D;AAC7D,SAAgB,uBAAuB;IACrC,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,cAAc,CAAqB,EAAE,CAAC;QACzE,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;YACzE,MAAM,CAAC,IAAI,CAAC;gBACV,UAAU;gBACV,MAAM,EAAE,MAA0B;gBAClC,KAAK,EAAE,KAAM;gBACb,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,GAAG;aACjB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAgB,mBAAmB,CACjC,MAAwB,EACxB,MAAyB;IAEzB,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC3D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAI,MAAM,CAAC,OAAO,CAAC,sBAAc,CAA0C;aACtF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QACjC,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,OAAO,IAAI,CAAC,UAAU,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAC1B,MAAyB,EACzB,OAAoB,EACpB,KAAK,GAAG,IAAI;IAEZ,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO;QAC5B,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;QAC/B,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAErE,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;QAC1E,OAAO;YACL,GAAG,MAAM;YACT;gBACE,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;gBACpD,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,GAAG;aACjB;SACF,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,IAAI,GAAoB;QAC5B,GAAG,GAAG;QACN,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;QACxD,WAAW,EAAE,GAAG,CAAC,WAAW,GAAG,CAAC;QAChC,WAAW,EAAE,GAAG;KACjB,CAAC;IACF,OAAO,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,gFAAgF;AAChF,oDAAoD;AACpD,gFAAgF;AAEnE,QAAA,eAAe,GAAG;IAC7B,QAAQ,CAAC,WAAmB;QAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC;IAC5D,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,WAAmB;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,OAAO;gBACL,WAAW;gBACX,MAAM,EAAE,uBAAuB,EAAE;gBACjC,OAAO,EAAE,CAAC;aACX,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAsB,CAAC;YACpD,IAAI,MAAM,EAAE,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1D,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,kBAAkB;QACpB,CAAC;QACD,OAAO;YACL,WAAW;YACX,MAAM,EAAE,uBAAuB,EAAE;YACjC,OAAO,EAAE,CAAC;SACX,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,OAA0B;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,QAAQ,GAAG,MAAM,CAAC;QAC9B,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3E,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,WAAmB,EAAE,OAAoB;QAC3D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAsB;YACjC,GAAG,OAAO;YACV,MAAM,EAAE,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC;SAC9C,CAAC;QACF,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,OAAO,OAAO,CAAC;IACjB,CAAC;CACF,CAAC"}

package/dist/orchestration/executor.d.ts

@@ -0,0 +1,42 @@
+import type { LLMProvider } from '../providers/types.js';
+import type { ProjectContext } from '../agent/context.js';
+import type { ProjectPerception } from '../perception/types.js';
+import type { ExecutionPlan } from './types.js';
+import type { Display } from '../cli/display.js';
+/** Options passed to the plan executor. */
+export interface ExecutorOptions {
+    /** The plan to execute (mutated in place as steps progress). */
+    plan: ExecutionPlan;
+    /** Provider used by every specialist step. */
+    provider: LLMProvider;
+    /** Loaded project context passed to specialists. */
+    context: ProjectContext;
+    /** Display sink for progress events. */
+    display: Display;
+    /** Optional perception snapshot forwarded to each specialist. */
+    perception?: ProjectPerception;
+    /** Optional abort signal; sets plan status to `'aborted'` when fired. */
+    signal?: AbortSignal;
+    /** Maximum steps running concurrently. Defaults to 3. */
+    maxParallel?: number;
+}
+/**
+ * Runs all steps in `opts.plan` respecting their dependency graph.
+ *
+ * Steps whose `dependsOn` arrays are all resolved run immediately, up to
+ * `maxParallel` at once using `Promise.allSettled`.  When a step fails,
+ * every step that transitively depends on it is marked `'skipped'` so
+ * independent branches continue unaffected.  The final plan is persisted to
+ * disk and returned.
+ *
+ * Never throws — if every step fails, the plan is returned with
+ * status `'failed'`.
+ */
+export declare function executePlan(opts: ExecutorOptions): Promise<ExecutionPlan>;
+/**
+ * Asks the provider to write a coherent summary of all completed step results.
+ *
+ * Falls back to a plain concatenation of step results if the provider call
+ * fails or returns empty text.  Never throws.
+ */
+export declare function synthesise(plan: ExecutionPlan, provider: LLMProvider, context: ProjectContext): Promise<string>;

package/dist/orchestration/executor.js

@@ -0,0 +1,206 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.executePlan = executePlan;
+exports.synthesise = synthesise;
+const specialists_js_1 = require("./specialists.js");
+const plan_store_js_1 = require("./plan-store.js");
+const competence_js_1 = require("./competence.js");
+/**
+ * Runs all steps in `opts.plan` respecting their dependency graph.
+ *
+ * Steps whose `dependsOn` arrays are all resolved run immediately, up to
+ * `maxParallel` at once using `Promise.allSettled`.  When a step fails,
+ * every step that transitively depends on it is marked `'skipped'` so
+ * independent branches continue unaffected.  The final plan is persisted to
+ * disk and returned.
+ *
+ * Never throws — if every step fails, the plan is returned with
+ * status `'failed'`.
+ */
+async function executePlan(opts) {
+    const { plan, provider, context, display, perception, signal } = opts;
+    const maxParallel = opts.maxParallel ?? 3;
+    plan.status = 'running';
+    display.header(`Plan: ${plan.goal}`, `${plan.steps.length} step${plan.steps.length !== 1 ? 's' : ''}`);
+    display.showPlan(plan);
+    const memory = [];
+    while (true) {
+        if (signal?.aborted) {
+            plan.status = 'aborted';
+            plan.completed = Date.now();
+            await persist(plan);
+            return plan;
+        }
+        const ready = findReadySteps(plan.steps);
+        if (ready.length === 0) {
+            // Catch any waiting steps blocked by a failed/skipped dep that hasn't
+            // been propagated yet, then decide whether to stop.
+            propagateAllSkips(plan.steps);
+            if (plan.steps.every(s => isTerminal(s.status)))
+                break;
+            // Nothing runnable and plan is not fully terminal — shouldn't happen
+            // with a valid acyclic plan, but guard to avoid an infinite loop.
+            break;
+        }
+        const batch = ready.slice(0, maxParallel);
+        for (const step of batch) {
+            step.status = 'running';
+            display.stepStarted(step);
+        }
+        const settled = await Promise.allSettled(batch.map(step => (0, specialists_js_1.runSpecialist)({ provider, context, perception, step, memory: [...memory], display, signal })));
+        for (let i = 0; i < settled.length; i++) {
+            const step = batch[i];
+            const result = settled[i];
+            if (result.status === 'fulfilled' && result.value.success) {
+                step.status = 'done';
+                step.result = result.value.result;
+                step.tokensUsed = result.value.tokensUsed;
+                step.durationMs = result.value.durationMs;
+                const entry = {
+                    key: step.id,
+                    value: result.value.result,
+                    stepId: step.id,
+                    timestamp: Date.now(),
+                };
+                memory.push(entry);
+                try {
+                    await plan_store_js_1.planStore.saveMemory(context.root, entry);
+                }
+                catch { /* best-effort */ }
+                competence_js_1.competenceStore.recordOutcome(context.root, {
+                    specialist: step.specialist,
+                    domain: competence_js_1.PRIMARY_DOMAIN[step.specialist],
+                    success: true,
+                    quality: 1,
+                }).catch(() => { });
+                display.stepCompleted(step, step.result);
+            }
+            else {
+                const errMsg = result.status === 'rejected'
+                    ? String(result.reason)
+                    : result.value.result;
+                step.status = 'failed';
+                step.result = errMsg;
+                step.durationMs = result.status === 'fulfilled' ? result.value.durationMs : 0;
+                competence_js_1.competenceStore.recordOutcome(context.root, {
+                    specialist: step.specialist,
+                    domain: competence_js_1.PRIMARY_DOMAIN[step.specialist],
+                    success: false,
+                }).catch(() => { });
+                propagateSkips(plan.steps, step.id);
+            }
+        }
+        if (plan.steps.every(s => isTerminal(s.status)))
+            break;
+    }
+    // ── Finalise plan ────────────────────────────────────────────────────────────
+    plan.outcome = await synthesise(plan, provider, context);
+    plan.status = plan.steps.some(s => s.status === 'failed') ? 'failed' : 'done';
+    plan.completed = Date.now();
+    plan.totalTokens = plan.steps.reduce((n, s) => n + (s.tokensUsed ?? 0), 0);
+    const doneCount = plan.steps.filter(s => s.status === 'done').length;
+    display.summary(plan.outcome, plan.steps.length, doneCount);
+    await persist(plan);
+    return plan;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// synthesise
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Asks the provider to write a coherent summary of all completed step results.
+ *
+ * Falls back to a plain concatenation of step results if the provider call
+ * fails or returns empty text.  Never throws.
+ */
+async function synthesise(plan, provider, context) {
+    const done = plan.steps.filter(s => s.status === 'done' && s.result);
+    if (done.length === 0) {
+        return plan.steps.some(s => s.status === 'failed')
+            ? 'All steps failed — no changes were made.'
+            : 'No steps completed.';
+    }
+    const stepBlocks = done
+        .map((s, i) => `Step ${i + 1} [${s.specialist}] — ${s.task}\n${s.result}`)
+        .join('\n\n');
+    const system = `You are summarising the results of a multi-agent coding task ` +
+        `for project "${context.name}". ` +
+        `Be concise — 3 to 5 sentences. State what was accomplished and what changed.`;
+    const history = [{
+            role: 'user',
+            content: `Goal: ${plan.goal}\n\n` +
+                `Here are the results of each specialist step. ` +
+                `Synthesise them into a coherent summary of what was accomplished and what changed.\n\n` +
+                stepBlocks,
+        }];
+    try {
+        const response = await provider.complete(system, history, []);
+        const text = response.text.trim();
+        return text.length > 0 ? text : fallbackSynthesis(done);
+    }
+    catch {
+        return fallbackSynthesis(done);
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Internal helpers
+// ─────────────────────────────────────────────────────────────────────────────
+/** Returns steps that are `'waiting'` and have all dependencies in `'done'` state. */
+function findReadySteps(steps) {
+    const doneIds = new Set(steps.filter(s => s.status === 'done').map(s => s.id));
+    return steps.filter(s => s.status === 'waiting' && s.dependsOn.every(dep => doneIds.has(dep)));
+}
+/**
+ * Marks all `'waiting'` steps that directly depend on `failedId` as
+ * `'skipped'`, then recursively propagates through their dependents (BFS).
+ */
+function propagateSkips(steps, failedId) {
+    let frontier = [failedId];
+    while (frontier.length > 0) {
+        const next = [];
+        for (const id of frontier) {
+            for (const step of steps) {
+                if (step.status === 'waiting' && step.dependsOn.includes(id)) {
+                    step.status = 'skipped';
+                    next.push(step.id);
+                }
+            }
+        }
+        frontier = next;
+    }
+}
+/**
+ * Sweeps all steps and ensures any `'waiting'` step whose dependency set
+ * includes a failed or skipped step is itself marked `'skipped'`.
+ * Runs to fixpoint to handle multi-level chains.
+ */
+function propagateAllSkips(steps) {
+    const blocked = new Set(steps
+        .filter(s => s.status === 'failed' || s.status === 'skipped')
+        .map(s => s.id));
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const step of steps) {
+            if (step.status === 'waiting' && step.dependsOn.some(d => blocked.has(d))) {
+                step.status = 'skipped';
+                blocked.add(step.id);
+                changed = true;
+            }
+        }
+    }
+}
+function isTerminal(status) {
+    return status === 'done' || status === 'failed' || status === 'skipped';
+}
+function fallbackSynthesis(steps) {
+    return steps
+        .map(s => `[${s.specialist}] ${(s.result ?? '').slice(0, 300)}`)
+        .join('\n\n');
+}
+async function persist(plan) {
+    try {
+        await plan_store_js_1.planStore.save(plan);
+    }
+    catch { /* best-effort */ }
+}
+//# sourceMappingURL=executor.js.map