pi-harness-runtime 0.5.0 → 0.6.3-beta.13

package/packages/task-compiler/dist/index.js

@@ -0,0 +1,20 @@
+/**
+ * Task Compiler
+ *
+ * Compiles requirements into executable, dependency-aware task graphs.
+ *
+ * @example
+ * import { compileTasks } from "@pi-harness/task-compiler";
+ *
+ * const graph = await compileTasks({
+ *   requirement: compiledRequirement,
+ *   project: projectProfile,
+ *   jobId: "job-001",
+ * });
+ */
+// ─── SDK Version ───────────────────────────────────────────────────────
+export { SDK_VERSION } from "./types.js";
+// ─── Main API ─────────────────────────────────────────────────────────
+export { compileTasks } from "./compiler.js";
+export { TaskCompilerError, TaskCompilerErrorCode } from "./types.js";
+//# sourceMappingURL=index.js.map

package/packages/task-compiler/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,0EAA0E;AAE1E,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC,yEAAyE;AAEzE,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAgB7C,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC"}

package/packages/task-compiler/dist/types.d.ts

@@ -0,0 +1,138 @@
+/**
+ * Task Compiler - Type Definitions
+ *
+ * Core types for task decomposition, DAG construction, and verification.
+ */
+export declare const SDK_VERSION: "1.0.0";
+export type TaskType = "analysis" | "design" | "implementation" | "test" | "e2e_test" | "review" | "repair" | "documentation";
+export type ComplexityEstimate = 1 | 2 | 3 | 5 | 8;
+export interface TaskOutput {
+    kind: "file" | "test_result" | "report" | "schema" | "diff" | "verification";
+    path?: string;
+    description: string;
+    required: boolean;
+}
+export interface CompiledTask {
+    id: string;
+    jobId: string;
+    title: string;
+    objective: string;
+    type: TaskType;
+    dependencies: string[];
+    filesInScope: string[];
+    filesExclude?: string[];
+    expectedOutputs: TaskOutput[];
+    acceptanceCriteria: string[];
+    requiredCapabilities: string[];
+    permittedCommands: string[];
+    prohibitedCommands: string[];
+    preferredProvider?: string;
+    estimatedComplexity: ComplexityEstimate;
+    fileOwnership: FileOwnership;
+    priority?: number;
+}
+export type FileOwnershipMode = "exclusive" | "shared_read";
+export interface FileOwnership {
+    taskId: string;
+    include: string[];
+    exclude: string[];
+    mode: FileOwnershipMode;
+}
+export interface TaskGraph {
+    jobId: string;
+    tasks: CompiledTask[];
+    roots: string[];
+    terminalTasks: string[];
+    topologicalOrder: string[];
+}
+export declare const STANDARD_FLOW: TaskType[];
+export declare const PROVIDER_HINTS: Partial<Record<TaskType, string[]>>;
+export declare const PROHIBITED_BY_DEFAULT: string[];
+export interface CompiledRequirement {
+    id: string;
+    title: string;
+    problemStatement: string;
+    goals: Array<{
+        id: string;
+        description: string;
+    }>;
+    constraints: Array<{
+        id: string;
+        description: string;
+        blocking: boolean;
+    }>;
+    nonGoals?: string[];
+    acceptanceCriteria: Array<{
+        id: string;
+        outcome: string[];
+    }>;
+    riskTags: Array<{
+        risk: string;
+        affectedId: string;
+    }>;
+}
+export interface ProjectProfile {
+    projectPath: string;
+    projectName?: string;
+    frameworks?: Array<{
+        name: string;
+        confidence: number;
+    }>;
+    testCapabilities?: Array<{
+        runner: string;
+        supported: boolean;
+    }>;
+    commands?: Record<string, string>;
+    rules?: Array<{
+        id: string;
+        section: string;
+        permittedCommands?: string[];
+        prohibitedCommands?: string[];
+    }>;
+}
+export interface TaskCompileInput {
+    requirement: CompiledRequirement;
+    project: ProjectProfile;
+    dependencies?: DependencyInfo[];
+    jobId: string;
+    clock?: () => Date;
+    insertE2E?: boolean;
+    maxComplexity?: ComplexityEstimate;
+}
+export interface DependencyInfo {
+    requirementId: string;
+    dependsOn: string[];
+    files: string[];
+}
+export interface TaskCandidate {
+    id: string;
+    title: string;
+    objective: string;
+    type: TaskType;
+    roughDependencies: string[];
+    criteria: string[];
+    estimatedComplexity: ComplexityEstimate;
+    priority?: number;
+}
+export interface TaskCompilerConfig {
+    insertE2E: boolean;
+    maxComplexity: ComplexityEstimate;
+    extraProhibitedCommands: string[];
+    clock: () => Date;
+}
+export declare const DEFAULT_TASK_COMPILER_CONFIG: TaskCompilerConfig;
+export declare enum TaskCompilerErrorCode {
+    CYCLIC_DEPENDENCY = "CYCLIC_DEPENDENCY",
+    EMPTY_OBJECTIVE = "EMPTY_OBJECTIVE",
+    NO_VERIFICATION = "NO_VERIFICATION",
+    FILE_OVERLAP_CONFLICT = "FILE_OVERLAP_CONFLICT",
+    UNSATISFIED_CRITERION = "UNSATISFIED_CRITERION",
+    MISSING_CAPABILITY = "MISSING_CAPILITY",
+    DESTRUCTIVE_COMMAND_APPROVAL = "DESTRUCTIVE_COMMAND_APPROVAL"
+}
+export declare class TaskCompilerError extends Error {
+    readonly code: TaskCompilerErrorCode;
+    readonly details?: Record<string, unknown>;
+    constructor(code: TaskCompilerErrorCode, message: string, details?: Record<string, unknown>);
+}
+//# sourceMappingURL=types.d.ts.map

package/packages/task-compiler/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,eAAO,MAAM,WAAW,EAAG,OAAgB,CAAC;AAI5C,MAAM,MAAM,QAAQ,GACjB,UAAU,GACV,QAAQ,GACR,gBAAgB,GAChB,MAAM,GACN,UAAU,GACV,QAAQ,GACR,QAAQ,GACR,eAAe,CAAC;AAEnB,MAAM,MAAM,kBAAkB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAInD,MAAM,WAAW,UAAU;IAC1B,IAAI,EAAE,MAAM,GAAG,aAAa,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,cAAc,CAAC;IAC7E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;CAClB;AAID,MAAM,WAAW,YAAY;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,QAAQ,CAAC;IACf,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,UAAU,EAAE,CAAC;IAC9B,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAC/B,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,mBAAmB,EAAE,kBAAkB,CAAC;IACxC,aAAa,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAID,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG,aAAa,CAAC;AAE5D,MAAM,WAAW,aAAa;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,iBAAiB,CAAC;CACxB;AAID,MAAM,WAAW,SAAS;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC3B;AAID,eAAO,MAAM,aAAa,EAAE,QAAQ,EASnC,CAAC;AAIF,eAAO,MAAM,cAAc,EAAE,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAS9D,CAAC;AAIF,eAAO,MAAM,qBAAqB,EAAE,MAAM,EAgBzC,CAAC;AAMF,MAAM,WAAW,mBAAmB;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,gBAAgB,EAAE,MAAM,CAAC;IACzB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAClD,WAAW,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,OAAO,CAAA;KAAE,CAAC,CAAC;IAC3E,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,kBAAkB,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IAC7D,QAAQ,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtD;AAED,MAAM,WAAW,cAAc;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACzD,gBAAgB,CAAC,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAA;KAAE,CAAC,CAAC;IACjE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,KAAK,CAAC,EAAE,KAAK,CAAC;QACb,EAAE,EAAE,MAAM,CAAC;QACX,OAAO,EAAE,MAAM,CAAC;QAChB,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;QAC7B,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;KAC9B,CAAC,CAAC;CACH;AAID,MAAM,WAAW,gBAAgB;IAChC,WAAW,EAAE,mBAAmB,CAAC;IACjC,OAAO,EAAE,cAAc,CAAC;IACxB,YAAY,CAAC,EAAE,cAAc,EAAE,CAAC;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,IAAI,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,aAAa,CAAC,EAAE,kBAAkB,CAAC;CACnC;AAED,MAAM,WAAW,cAAc;IAC9B,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,EAAE,MAAM,EAAE,CAAC;CAChB;AAID,MAAM,WAAW,aAAa;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,QAAQ,CAAC;IACf,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,mBAAmB,EAAE,kBAAkB,CAAC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAID,MAAM,WAAW,kBAAkB;IAClC,SAAS,EAAE,OAAO,CAAC;IACnB,aAAa,EAAE,kBAAkB,CAAC;IAClC,uBAAuB,EAAE,MAAM,EAAE,CAAC;IAClC,KAAK,EAAE,MAAM,IAAI,CAAC;CAClB;AAED,eAAO,MAAM,4BAA4B,EAAE,kBAK1C,CAAC;AAIF,oBAAY,qBAAqB;IAChC,iBAAiB,sBAAsB;IACvC,eAAe,oBAAoB;IACnC,eAAe,oBAAoB;IACnC,qBAAqB,0BAA0B;IAC/C,qBAAqB,0BAA0B;IAC/C,kBAAkB,qBAAqB;IACvC,4BAA4B,iCAAiC;CAC7D;AAED,qBAAa,iBAAkB,SAAQ,KAAK;IAC3C,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAC;IACrC,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBAG1C,IAAI,EAAE,qBAAqB,EAC3B,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAOlC"}

package/packages/task-compiler/dist/types.js

@@ -0,0 +1,75 @@
+/**
+ * Task Compiler - Type Definitions
+ *
+ * Core types for task decomposition, DAG construction, and verification.
+ */
+// ─── SDK Version ───────────────────────────────────────────────────────
+export const SDK_VERSION = "1.0.0";
+// ─── Standard Engineering Flow ────────────────────────────────────────
+export const STANDARD_FLOW = [
+    "analysis",
+    "design",
+    "implementation",
+    "test",
+    "e2e_test",
+    "review",
+    "repair",
+    "documentation",
+];
+// ─── Provider Hints ───────────────────────────────────────────────────
+export const PROVIDER_HINTS = {
+    analysis: ["codex", "gpt", "glm"],
+    design: ["codex", "gpt", "glm"],
+    implementation: ["minimax", "claude", "glm"],
+    test: ["minimax", "claude"],
+    e2e_test: ["playwright"],
+    review: ["claude", "glm"],
+    repair: ["glm", "claude"],
+    documentation: ["codex", "gpt"],
+};
+// ─── Default Command Policy ─────────────────────────────────────────────
+export const PROHIBITED_BY_DEFAULT = [
+    "git commit",
+    "git push",
+    "bench build",
+    "bench migrate",
+    "bench install-app",
+    "bench restart",
+    "npm run build",
+    "yarn build",
+    "pnpm build",
+    "python manage.py migrate",
+    "docker compose up",
+    "docker compose down",
+    "rm -rf",
+    "DROP DATABASE",
+    "TRUNCATE",
+];
+export const DEFAULT_TASK_COMPILER_CONFIG = {
+    insertE2E: true,
+    maxComplexity: 5,
+    extraProhibitedCommands: [],
+    clock: () => new Date(),
+};
+// ─── Compiler Errors ─────────────────────────────────────────────────────
+export var TaskCompilerErrorCode;
+(function (TaskCompilerErrorCode) {
+    TaskCompilerErrorCode["CYCLIC_DEPENDENCY"] = "CYCLIC_DEPENDENCY";
+    TaskCompilerErrorCode["EMPTY_OBJECTIVE"] = "EMPTY_OBJECTIVE";
+    TaskCompilerErrorCode["NO_VERIFICATION"] = "NO_VERIFICATION";
+    TaskCompilerErrorCode["FILE_OVERLAP_CONFLICT"] = "FILE_OVERLAP_CONFLICT";
+    TaskCompilerErrorCode["UNSATISFIED_CRITERION"] = "UNSATISFIED_CRITERION";
+    TaskCompilerErrorCode["MISSING_CAPABILITY"] = "MISSING_CAPILITY";
+    TaskCompilerErrorCode["DESTRUCTIVE_COMMAND_APPROVAL"] = "DESTRUCTIVE_COMMAND_APPROVAL";
+})(TaskCompilerErrorCode || (TaskCompilerErrorCode = {}));
+export class TaskCompilerError extends Error {
+    code;
+    details;
+    constructor(code, message, details) {
+        super(message);
+        this.name = "TaskCompilerError";
+        this.code = code;
+        this.details = details;
+    }
+}
+//# sourceMappingURL=types.js.map

package/packages/task-compiler/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,0EAA0E;AAE1E,MAAM,CAAC,MAAM,WAAW,GAAG,OAAgB,CAAC;AAoE5C,yEAAyE;AAEzE,MAAM,CAAC,MAAM,aAAa,GAAe;IACxC,UAAU;IACV,QAAQ;IACR,gBAAgB;IAChB,MAAM;IACN,UAAU;IACV,QAAQ;IACR,QAAQ;IACR,eAAe;CACf,CAAC;AAEF,yEAAyE;AAEzE,MAAM,CAAC,MAAM,cAAc,GAAwC;IAClE,QAAQ,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC;IACjC,MAAM,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC;IAC/B,cAAc,EAAE,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC;IAC5C,IAAI,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC;IAC3B,QAAQ,EAAE,CAAC,YAAY,CAAC;IACxB,MAAM,EAAE,CAAC,QAAQ,EAAE,KAAK,CAAC;IACzB,MAAM,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,aAAa,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC;CAC/B,CAAC;AAEF,2EAA2E;AAE3E,MAAM,CAAC,MAAM,qBAAqB,GAAa;IAC9C,YAAY;IACZ,UAAU;IACV,aAAa;IACb,eAAe;IACf,mBAAmB;IACnB,eAAe;IACf,eAAe;IACf,YAAY;IACZ,YAAY;IACZ,0BAA0B;IAC1B,mBAAmB;IACnB,qBAAqB;IACrB,QAAQ;IACR,eAAe;IACf,UAAU;CACV,CAAC;AAuEF,MAAM,CAAC,MAAM,4BAA4B,GAAuB;IAC/D,SAAS,EAAE,IAAI;IACf,aAAa,EAAE,CAAC;IAChB,uBAAuB,EAAE,EAAE;IAC3B,KAAK,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE;CACvB,CAAC;AAEF,4EAA4E;AAE5E,MAAM,CAAN,IAAY,qBAQX;AARD,WAAY,qBAAqB;IAChC,gEAAuC,CAAA;IACvC,4DAAmC,CAAA;IACnC,4DAAmC,CAAA;IACnC,wEAA+C,CAAA;IAC/C,wEAA+C,CAAA;IAC/C,gEAAuC,CAAA;IACvC,sFAA6D,CAAA;AAC9D,CAAC,EARW,qBAAqB,KAArB,qBAAqB,QAQhC;AAED,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAClC,IAAI,CAAwB;IAC5B,OAAO,CAA2B;IAE3C,YACC,IAA2B,EAC3B,OAAe,EACf,OAAiC;QAEjC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACxB,CAAC;CACD"}

package/packages/task-compiler/dist/validate.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Task Compiler - Validation
+ *
+ * Validates the task graph: cycle detection, file overlap, verification, etc.
+ */
+import type { TaskGraph } from "./types.js";
+/**
+ * Assert the graph has no cycles.
+ * Uses Kahn's algorithm to verify all tasks are reachable in topological order.
+ */
+export declare function assertNoCycles(graph: TaskGraph): void;
+/**
+ * Assert no exclusive file overlap between parallel tasks.
+ * Two exclusive tasks cannot modify the same files unless one depends on the other.
+ */
+export declare function assertNoExclusiveFileOverlap(graph: TaskGraph): void;
+/**
+ * Assert every task has at least one required verification output.
+ */
+export declare function assertEveryTaskHasVerification(graph: TaskGraph): void;
+/**
+ * Assert no task has an empty objective.
+ */
+export declare function assertNoEmptyObjectives(graph: TaskGraph): void;
+/**
+ * Assert every acceptance criterion is assigned to at least one task.
+ */
+export declare function assertEveryCriterionAssigned(graph: TaskGraph, criterionIds: string[]): void;
+//# sourceMappingURL=validate.d.ts.map

package/packages/task-compiler/dist/validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../src/validate.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAG5C;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAyCrD;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CA6CnE;AAED;;GAEG;AACH,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAerE;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAc9D;AAED;;GAEG;AACH,wBAAgB,4BAA4B,CAC3C,KAAK,EAAE,SAAS,EAChB,YAAY,EAAE,MAAM,EAAE,GACpB,IAAI,CAeN"}

package/packages/task-compiler/dist/validate.js

@@ -0,0 +1,168 @@
+/**
+ * Task Compiler - Validation
+ *
+ * Validates the task graph: cycle detection, file overlap, verification, etc.
+ */
+import { TaskCompilerError, TaskCompilerErrorCode } from "./types.js";
+/**
+ * Assert the graph has no cycles.
+ * Uses Kahn's algorithm to verify all tasks are reachable in topological order.
+ */
+export function assertNoCycles(graph) {
+    // Compute in-degrees: how many dependencies each task has
+    const inDegree = new Map();
+    for (const task of graph.tasks) {
+        inDegree.set(task.id, task.dependencies.length);
+    }
+    // Kahn's algorithm
+    const queue = [];
+    for (const [id, degree] of inDegree.entries()) {
+        if (degree === 0)
+            queue.push(id);
+    }
+    const visited = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        if (!id)
+            break;
+        visited.push(id);
+        // Reduce in-degree of tasks that depend on `id`
+        for (const task of graph.tasks) {
+            if (task.dependencies.includes(id)) {
+                const newDegree = (inDegree.get(task.id) ?? 1) - 1;
+                inDegree.set(task.id, newDegree);
+                if (newDegree === 0) {
+                    queue.push(task.id);
+                }
+            }
+        }
+    }
+    if (visited.length !== graph.tasks.length) {
+        const unvisited = graph.tasks
+            .filter((t) => !visited.includes(t.id))
+            .map((t) => t.id);
+        throw new TaskCompilerError(TaskCompilerErrorCode.CYCLIC_DEPENDENCY, `Cyclic dependency detected. Tasks in cycle: ${unvisited.join(", ")}`, { cyclicTasks: unvisited });
+    }
+}
+/**
+ * Assert no exclusive file overlap between parallel tasks.
+ * Two exclusive tasks cannot modify the same files unless one depends on the other.
+ */
+export function assertNoExclusiveFileOverlap(graph) {
+    const exclusiveTasks = graph.tasks.filter((t) => t.fileOwnership.mode === "exclusive");
+    const overlaps = [];
+    for (let i = 0; i < exclusiveTasks.length; i++) {
+        for (let j = i + 1; j < exclusiveTasks.length; j++) {
+            const a = exclusiveTasks[i];
+            const b = exclusiveTasks[j];
+            // Sequential: skip if one depends on the other
+            if (a.dependencies.includes(b.id) || b.dependencies.includes(a.id)) {
+                continue;
+            }
+            // Both wait for same parent: not truly parallel
+            const aRoots = getAllDependencies(a.id, graph);
+            const bRoots = getAllDependencies(b.id, graph);
+            if (Array.from(aRoots).some((d) => bRoots.has(d))) {
+                continue;
+            }
+            const conflictFiles = findFileOverlap(a.fileOwnership, b.fileOwnership);
+            if (conflictFiles.length > 0) {
+                overlaps.push({
+                    taskA: a.id,
+                    taskB: b.id,
+                    files: conflictFiles,
+                });
+            }
+        }
+    }
+    if (overlaps.length > 0) {
+        const details = overlaps.map((o) => `${o.taskA} ↔ ${o.taskB}: ${o.files.join(", ")}`);
+        throw new TaskCompilerError(TaskCompilerErrorCode.FILE_OVERLAP_CONFLICT, `Exclusive file overlap detected between parallel tasks: ${details.join("; ")}`, { overlaps });
+    }
+}
+/**
+ * Assert every task has at least one required verification output.
+ */
+export function assertEveryTaskHasVerification(graph) {
+    const missing = [];
+    for (const task of graph.tasks) {
+        const requiredOutputs = task.expectedOutputs.filter((o) => o.required);
+        if (requiredOutputs.length === 0) {
+            missing.push(task.id);
+        }
+    }
+    if (missing.length > 0) {
+        throw new TaskCompilerError(TaskCompilerErrorCode.NO_VERIFICATION, `Tasks without required verification outputs: ${missing.join(", ")}`, { taskIds: missing });
+    }
+}
+/**
+ * Assert no task has an empty objective.
+ */
+export function assertNoEmptyObjectives(graph) {
+    const empty = [];
+    for (const task of graph.tasks) {
+        if (!task.objective.trim()) {
+            empty.push(task.id);
+        }
+    }
+    if (empty.length > 0) {
+        throw new TaskCompilerError(TaskCompilerErrorCode.EMPTY_OBJECTIVE, `Tasks with empty objectives: ${empty.join(", ")}`, { taskIds: empty });
+    }
+}
+/**
+ * Assert every acceptance criterion is assigned to at least one task.
+ */
+export function assertEveryCriterionAssigned(graph, criterionIds) {
+    const assigned = new Set();
+    for (const task of graph.tasks) {
+        for (const cid of task.acceptanceCriteria) {
+            assigned.add(cid);
+        }
+    }
+    const unassigned = criterionIds.filter((c) => !assigned.has(c));
+    if (unassigned.length > 0) {
+        throw new TaskCompilerError(TaskCompilerErrorCode.UNSATISFIED_CRITERION, `Acceptance criteria not assigned to any task: ${unassigned.join(", ")}`, { unassignedCriteria: unassigned });
+    }
+}
+// ─── File overlap detection ──────────────────────────────────────────
+function findFileOverlap(a, b) {
+    const conflicts = [];
+    for (const patternA of a.include) {
+        for (const patternB of b.include) {
+            if (patternA === patternB) {
+                conflicts.push(patternA);
+            }
+            else if (patternSubsumes(patternA, patternB)) {
+                conflicts.push(patternB);
+            }
+            else if (patternSubsumes(patternB, patternA)) {
+                conflicts.push(patternA);
+            }
+        }
+    }
+    return [...new Set(conflicts)];
+}
+function patternSubsumes(parent, child) {
+    const p = parent.replace(/\/\*\*$/, "");
+    return child.startsWith(`${p}/`) || child.startsWith(p);
+}
+// ─── Dependency helpers ────────────────────────────────────────────────
+function getAllDependencies(taskId, graph) {
+    const taskMap = new Map(graph.tasks.map((t) => [t.id, t]));
+    const visited = new Set();
+    function walk(id) {
+        if (visited.has(id))
+            return;
+        const task = taskMap.get(id);
+        if (task) {
+            visited.add(id);
+            for (const dep of task.dependencies) {
+                walk(dep);
+            }
+        }
+    }
+    walk(taskId);
+    visited.delete(taskId);
+    return visited;
+}
+//# sourceMappingURL=validate.js.map

package/packages/task-compiler/dist/validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.js","sourceRoot":"","sources":["../src/validate.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAEtE;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAgB;IAC9C,0DAA0D;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC;IAED,mBAAmB;IACnB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,EAAE;YAAE,MAAM;QACf,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEjB,gDAAgD;QAChD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBACjC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK;aAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnB,MAAM,IAAI,iBAAiB,CAC1B,qBAAqB,CAAC,iBAAiB,EACvC,+CAA+C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EACrE,EAAE,WAAW,EAAE,SAAS,EAAE,CAC1B,CAAC;IACH,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAAC,KAAgB;IAC5D,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,KAAK,WAAW,CAC3C,CAAC;IAEF,MAAM,QAAQ,GAA6D,EAAE,CAAC;IAE9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAE5B,+CAA+C;YAC/C,IAAI,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpE,SAAS;YACV,CAAC;YAED,gDAAgD;YAChD,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC/C,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC/C,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,SAAS;YACV,CAAC;YAED,MAAM,aAAa,GAAG,eAAe,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC;YACxE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,QAAQ,CAAC,IAAI,CAAC;oBACb,KAAK,EAAE,CAAC,CAAC,EAAE;oBACX,KAAK,EAAE,CAAC,CAAC,EAAE;oBACX,KAAK,EAAE,aAAa;iBACpB,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;IACF,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAC3B,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACvD,CAAC;QACF,MAAM,IAAI,iBAAiB,CAC1B,qBAAqB,CAAC,qBAAqB,EAC3C,2DAA2D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAC/E,EAAE,QAAQ,EAAE,CACZ,CAAC;IACH,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,8BAA8B,CAAC,KAAgB;IAC9D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACvE,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;IACF,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,iBAAiB,CAC1B,qBAAqB,CAAC,eAAe,EACrC,gDAAgD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EACpE,EAAE,OAAO,EAAE,OAAO,EAAE,CACpB,CAAC;IACH,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAgB;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,iBAAiB,CAC1B,qBAAqB,CAAC,eAAe,EACrC,gCAAgC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAClD,EAAE,OAAO,EAAE,KAAK,EAAE,CAClB,CAAC;IACH,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,4BAA4B,CAC3C,KAAgB,EAChB,YAAsB;IAEtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC3C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;IACF,CAAC;IACD,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,iBAAiB,CAC1B,qBAAqB,CAAC,qBAAqB,EAC3C,iDAAiD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EACxE,EAAE,kBAAkB,EAAE,UAAU,EAAE,CAClC,CAAC;IACH,CAAC;AACF,CAAC;AAED,wEAAwE;AAExE,SAAS,eAAe,CACvB,CAAqC,EACrC,CAAqC;IAErC,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAClC,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBAC3B,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1B,CAAC;iBAAM,IAAI,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAChD,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1B,CAAC;iBAAM,IAAI,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAChD,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,eAAe,CAAC,MAAc,EAAE,KAAa;IACrD,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,0EAA0E;AAE1E,SAAS,kBAAkB,CAAC,MAAc,EAAE,KAAgB;IAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,SAAS,IAAI,CAAC,EAAU;QACvB,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,IAAI,EAAE,CAAC;YACV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACrC,IAAI,CAAC,GAAG,CAAC,CAAC;YACX,CAAC;QACF,CAAC;IACF,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,CAAC;IACb,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACvB,OAAO,OAAO,CAAC;AAChB,CAAC"}

package/packages/task-compiler/dist/verification.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Task Compiler - Verification Assignment
+ *
+ * Assigns TaskOutput (expectedOutputs) to each compiled task
+ * so completion can be measured objectively.
+ */
+import type { CompiledRequirement, CompiledTask } from "./types.js";
+/**
+ * Assign verification outputs to each task based on its type
+ * and the requirement's acceptance criteria.
+ */
+export declare function assignVerification(tasks: CompiledTask[], requirement: CompiledRequirement): CompiledTask[];
+//# sourceMappingURL=verification.d.ts.map

package/packages/task-compiler/dist/verification.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verification.d.ts","sourceRoot":"","sources":["../src/verification.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,YAAY,EAAc,MAAM,YAAY,CAAC;AAEhF;;;GAGG;AACH,wBAAgB,kBAAkB,CACjC,KAAK,EAAE,YAAY,EAAE,EACrB,WAAW,EAAE,mBAAmB,GAC9B,YAAY,EAAE,CAKhB"}