conatus 0.1.0

package/dist/goal/goal-tree-pruner.js

@@ -0,0 +1,93 @@
+// ─── Internal Helper ───
+export async function cancelGoalAndDescendants(goal, now, stateManager) {
+    // Recursively cancel all children first
+    for (const childId of goal.children_ids) {
+        const child = await stateManager.loadGoal(childId);
+        if (child) {
+            await cancelGoalAndDescendants(child, now, stateManager);
+        }
+    }
+    // Cancel this goal
+    const cancelled = {
+        ...goal,
+        status: "cancelled",
+        updated_at: now,
+    };
+    await stateManager.saveGoal(cancelled);
+}
+// ─── Pruning Functions ───
+/**
+ * Prunes a goal and all its descendants by setting status = "cancelled".
+ * Removes the goal from its parent's children_ids.
+ * Returns a PruneDecision.
+ */
+export async function pruneGoal(goalId, reason, deps) {
+    const goal = await deps.stateManager.loadGoal(goalId);
+    if (!goal) {
+        throw new Error(`GoalTreeManager.pruneGoal: goal "${goalId}" not found`);
+    }
+    const now = new Date().toISOString();
+    // Cancel the goal and all descendants
+    await cancelGoalAndDescendants(goal, now, deps.stateManager);
+    // Remove from parent's children_ids
+    if (goal.parent_id) {
+        const parent = await deps.stateManager.loadGoal(goal.parent_id);
+        if (parent) {
+            const updatedParent = {
+                ...parent,
+                children_ids: parent.children_ids.filter((id) => id !== goalId),
+                updated_at: now,
+            };
+            await deps.stateManager.saveGoal(updatedParent);
+        }
+    }
+    return {
+        goal_id: goalId,
+        reason,
+        replacement_id: null,
+    };
+}
+/**
+ * Prunes a subgoal with a free-form reason string for tracking.
+ * Records a PruneRecord in the history for the parent goal tree.
+ * The parentGoalId is the root goal whose history you want to track.
+ */
+export async function pruneSubgoal(subgoalId, reason, pruneHistory, deps, parentGoalId) {
+    const goal = await deps.stateManager.loadGoal(subgoalId);
+    if (!goal) {
+        throw new Error(`GoalTreeManager.pruneSubgoal: goal "${subgoalId}" not found`);
+    }
+    const now = new Date().toISOString();
+    // Cancel the goal and all descendants
+    await cancelGoalAndDescendants(goal, now, deps.stateManager);
+    // Remove from parent's children_ids
+    if (goal.parent_id) {
+        const parent = await deps.stateManager.loadGoal(goal.parent_id);
+        if (parent) {
+            const updatedParent = {
+                ...parent,
+                children_ids: parent.children_ids.filter((id) => id !== subgoalId),
+                updated_at: now,
+            };
+            await deps.stateManager.saveGoal(updatedParent);
+        }
+    }
+    // Record prune history keyed by parentGoalId or the goal's own parent_id
+    const trackingKey = parentGoalId ?? goal.parent_id ?? subgoalId;
+    const record = { subgoalId, reason, timestamp: now };
+    const existing = pruneHistory.get(trackingKey) ?? [];
+    pruneHistory.set(trackingKey, [...existing, record]);
+    return {
+        goal_id: subgoalId,
+        reason: "user_requested",
+        replacement_id: null,
+    };
+}
+/**
+ * Returns the prune history for a given goal tree root ID.
+ * Returns an empty array if no prunes have been recorded.
+ */
+export function getPruneHistory(goalId, pruneHistory) {
+    return pruneHistory.get(goalId) ?? [];
+}
+//# sourceMappingURL=goal-tree-pruner.js.map

package/dist/goal/goal-tree-pruner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-tree-pruner.js","sourceRoot":"","sources":["../../src/goal/goal-tree-pruner.ts"],"names":[],"mappings":"AAUA,0BAA0B;AAE1B,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,IAAU,EACV,GAAW,EACX,YAA0B;IAE1B,wCAAwC;IACxC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,wBAAwB,CAAC,KAAK,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,SAAS,GAAS;QACtB,GAAG,IAAI;QACP,MAAM,EAAE,WAAW;QACnB,UAAU,EAAE,GAAG;KAChB,CAAC;IACF,MAAM,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;AACzC,CAAC;AAED,4BAA4B;AAE5B;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,MAAc,EACd,MAAmB,EACnB,IAAwB;IAExB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,oCAAoC,MAAM,aAAa,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,sCAAsC;IACtC,MAAM,wBAAwB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAE7D,oCAAoC;IACpC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,aAAa,GAAS;gBAC1B,GAAG,MAAM;gBACT,YAAY,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC;gBAC/D,UAAU,EAAE,GAAG;aAChB,CAAC;YACF,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,MAAM;QACf,MAAM;QACN,cAAc,EAAE,IAAI;KACrB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,SAAiB,EACjB,MAAc,EACd,YAAwC,EACxC,IAAwB,EACxB,YAAqB;IAErB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACzD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,uCAAuC,SAAS,aAAa,CAAC,CAAC;IACjF,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,sCAAsC;IACtC,MAAM,wBAAwB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAE7D,oCAAoC;IACpC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,aAAa,GAAS;gBAC1B,GAAG,MAAM;gBACT,YAAY,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC;gBAClE,UAAU,EAAE,GAAG;aAChB,CAAC;YACF,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,MAAM,WAAW,GAAG,YAAY,IAAI,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;IAChE,MAAM,MAAM,GAAgB,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;IAClE,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACrD,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,GAAG,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;IAErD,OAAO;QACL,OAAO,EAAE,SAAS;QAClB,MAAM,EAAE,gBAAgB;QACxB,cAAc,EAAE,IAAI;KACrB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAc,EACd,YAAwC;IAExC,OAAO,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;AACxC,CAAC"}

package/dist/goal/goal-tree-quality.d.ts

@@ -0,0 +1,22 @@
+import type { ILLMClient } from "../llm/llm-client.js";
+import type { Logger } from "../runtime/logger.js";
+import type { ConcretenessScore, DecompositionQualityMetrics } from "../types/goal-tree.js";
+import type { IPromptGateway } from "../prompt/gateway.js";
+export interface GoalTreeQualityDeps {
+    llmClient: ILLMClient;
+    logger?: Logger;
+    promptGateway?: IPromptGateway;
+}
+/**
+ * Scores the concreteness of a goal description on four dimensions using an LLM.
+ * Score = weighted average of 4 boolean dimensions (each 0.25).
+ * Falls back to zero score on LLM/parse failures.
+ */
+export declare function scoreConcreteness(description: string, deps: GoalTreeQualityDeps): Promise<ConcretenessScore>;
+/**
+ * Evaluates the quality of a decomposition using an LLM.
+ * Measures coverage, overlap, actionability, and computes depthEfficiency.
+ * Logs a warning when quality is poor (coverage < 0.5 or overlap > 0.7).
+ */
+export declare function evaluateDecompositionQuality(parentDescription: string, subgoalDescriptions: string[], deps: GoalTreeQualityDeps): Promise<DecompositionQualityMetrics>;
+//# sourceMappingURL=goal-tree-quality.d.ts.map

package/dist/goal/goal-tree-quality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-tree-quality.d.ts","sourceRoot":"","sources":["../../src/goal/goal-tree-quality.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,KAAK,EAAE,iBAAiB,EAAE,2BAA2B,EAAE,MAAM,uBAAuB,CAAC;AAE5F,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AA0E3D,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,UAAU,CAAC;IACtB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,aAAa,CAAC,EAAE,cAAc,CAAC;CAChC;AAID;;;;GAIG;AACH,wBAAsB,iBAAiB,CACrC,WAAW,EAAE,MAAM,EACnB,IAAI,EAAE,mBAAmB,GACxB,OAAO,CAAC,iBAAiB,CAAC,CAwD5B;AAED;;;;GAIG;AACH,wBAAsB,4BAA4B,CAChD,iBAAiB,EAAE,MAAM,EACzB,mBAAmB,EAAE,MAAM,EAAE,EAC7B,IAAI,EAAE,mBAAmB,GACxB,OAAO,CAAC,2BAA2B,CAAC,CA6DtC"}

package/dist/goal/goal-tree-quality.js

@@ -0,0 +1,183 @@
+import { z } from "zod";
+import { ConcretenessScoreSchema, DecompositionQualityMetricsSchema } from "../types/goal-tree.js";
+// ─── LLM Response Schemas ───
+const ConcretenessLLMResponseSchema = z.object({
+    hasQuantitativeThreshold: z.boolean(),
+    hasObservableOutcome: z.boolean(),
+    hasTimebound: z.boolean(),
+    hasClearScope: z.boolean(),
+    reason: z.string(),
+});
+const QualityEvaluationResponseSchema = z.object({
+    coverage: z.number().min(0).max(1),
+    overlap: z.number().min(0).max(1),
+    actionability: z.number().min(0).max(1),
+    reasoning: z.string(),
+});
+// ─── Prompt Builders ───
+function buildConcretenessPrompt(description) {
+    return `Evaluate the concreteness of this goal description on four dimensions.
+
+Goal description: "${description}"
+
+Answer each question:
+1. hasQuantitativeThreshold: Does the goal specify quantitative/measurable success criteria or thresholds? (e.g., "achieve 80% coverage", "response time < 200ms")
+2. hasObservableOutcome: Does the goal describe an observable, verifiable outcome? (e.g., "a working API endpoint", "passing CI build")
+3. hasTimebound: Does the goal have a time constraint or deadline? (e.g., "by end of sprint", "within 2 weeks")
+4. hasClearScope: Does the goal have a clearly defined scope with no ambiguity about what is included or excluded?
+
+Output JSON:
+{
+  "hasQuantitativeThreshold": <true|false>,
+  "hasObservableOutcome": <true|false>,
+  "hasTimebound": <true|false>,
+  "hasClearScope": <true|false>,
+  "reason": "<brief explanation covering all four dimensions>"
+}
+
+Return ONLY the JSON object, no other text.`;
+}
+function buildQualityEvaluationPrompt(parentDescription, subgoalDescriptions) {
+    const subgoalList = subgoalDescriptions
+        .map((desc, i) => `  ${i + 1}. "${desc}"`)
+        .join("\n");
+    return `Evaluate the quality of this goal decomposition.
+
+Parent goal: "${parentDescription}"
+
+Subgoals:
+${subgoalList}
+
+Evaluate:
+1. coverage (0.0-1.0): How well do the subgoals collectively cover all aspects of the parent goal? 1.0 = complete coverage, 0.0 = no coverage.
+2. overlap (0.0-1.0): How much redundancy/overlap exists between subgoals? 0.0 = no overlap (ideal), 1.0 = all subgoals are identical.
+3. actionability (0.0-1.0): Average concreteness/actionability of the subgoals. 1.0 = all are immediately actionable, 0.0 = all are too abstract.
+
+Output JSON:
+{
+  "coverage": <number 0.0 to 1.0>,
+  "overlap": <number 0.0 to 1.0>,
+  "actionability": <number 0.0 to 1.0>,
+  "reasoning": "<brief explanation>"
+}
+
+Return ONLY the JSON object, no other text.`;
+}
+// ─── Quality Functions ───
+/**
+ * Scores the concreteness of a goal description on four dimensions using an LLM.
+ * Score = weighted average of 4 boolean dimensions (each 0.25).
+ * Falls back to zero score on LLM/parse failures.
+ */
+export async function scoreConcreteness(description, deps) {
+    if (!description || description.trim() === "") {
+        return ConcretenessScoreSchema.parse({
+            score: 0,
+            dimensions: {
+                hasQuantitativeThreshold: false,
+                hasObservableOutcome: false,
+                hasTimebound: false,
+                hasClearScope: false,
+            },
+            reason: "Empty description provided",
+        });
+    }
+    const prompt = buildConcretenessPrompt(description);
+    try {
+        let parsed;
+        if (deps.promptGateway) {
+            parsed = await deps.promptGateway.execute({
+                purpose: "goal_decomposition",
+                additionalContext: { concreteness_prompt: prompt },
+                responseSchema: ConcretenessLLMResponseSchema,
+                temperature: 0,
+            });
+        }
+        else {
+            const response = await deps.llmClient.sendMessage([{ role: "user", content: prompt }], { temperature: 0 });
+            parsed = deps.llmClient.parseJSON(response.content, ConcretenessLLMResponseSchema);
+        }
+        const dims = {
+            hasQuantitativeThreshold: parsed.hasQuantitativeThreshold,
+            hasObservableOutcome: parsed.hasObservableOutcome,
+            hasTimebound: parsed.hasTimebound,
+            hasClearScope: parsed.hasClearScope,
+        };
+        const trueCount = Object.values(dims).filter(Boolean).length;
+        const score = trueCount * 0.25;
+        return ConcretenessScoreSchema.parse({
+            score,
+            dimensions: dims,
+            reason: parsed.reason,
+        });
+    }
+    catch {
+        return ConcretenessScoreSchema.parse({
+            score: 0,
+            dimensions: {
+                hasQuantitativeThreshold: false,
+                hasObservableOutcome: false,
+                hasTimebound: false,
+                hasClearScope: false,
+            },
+            reason: "LLM evaluation failed, defaulting to zero score",
+        });
+    }
+}
+/**
+ * Evaluates the quality of a decomposition using an LLM.
+ * Measures coverage, overlap, actionability, and computes depthEfficiency.
+ * Logs a warning when quality is poor (coverage < 0.5 or overlap > 0.7).
+ */
+export async function evaluateDecompositionQuality(parentDescription, subgoalDescriptions, deps) {
+    if (subgoalDescriptions.length === 0) {
+        const metrics = DecompositionQualityMetricsSchema.parse({
+            coverage: 0,
+            overlap: 0,
+            actionability: 0,
+            depthEfficiency: 1,
+        });
+        deps.logger?.warn("GoalTreeManager.evaluateDecompositionQuality: no subgoals provided — coverage=0");
+        return metrics;
+    }
+    const prompt = buildQualityEvaluationPrompt(parentDescription, subgoalDescriptions);
+    let coverage = 0;
+    let overlap = 0;
+    let actionability = 0;
+    try {
+        let parsed;
+        if (deps.promptGateway) {
+            parsed = await deps.promptGateway.execute({
+                purpose: "goal_decomposition",
+                additionalContext: { quality_prompt: prompt },
+                responseSchema: QualityEvaluationResponseSchema,
+                temperature: 0,
+            });
+        }
+        else {
+            const response = await deps.llmClient.sendMessage([{ role: "user", content: prompt }], { temperature: 0 });
+            parsed = deps.llmClient.parseJSON(response.content, QualityEvaluationResponseSchema);
+        }
+        coverage = parsed.coverage;
+        overlap = parsed.overlap;
+        actionability = parsed.actionability;
+    }
+    catch {
+        // On failure return conservative metrics
+        coverage = 0;
+        overlap = 0;
+        actionability = 0;
+    }
+    const depthEfficiency = Math.max(0, Math.min(1, 1 - overlap * 0.5));
+    const metrics = DecompositionQualityMetricsSchema.parse({
+        coverage,
+        overlap,
+        actionability,
+        depthEfficiency,
+    });
+    if (coverage < 0.5 || overlap > 0.7) {
+        deps.logger?.warn(`GoalTreeManager.evaluateDecompositionQuality: poor quality detected — coverage=${coverage.toFixed(2)}, overlap=${overlap.toFixed(2)}`);
+    }
+    return metrics;
+}
+//# sourceMappingURL=goal-tree-quality.js.map

package/dist/goal/goal-tree-quality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-tree-quality.js","sourceRoot":"","sources":["../../src/goal/goal-tree-quality.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,OAAO,EAAE,uBAAuB,EAAE,iCAAiC,EAAE,MAAM,uBAAuB,CAAC;AAGnG,+BAA+B;AAE/B,MAAM,6BAA6B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,wBAAwB,EAAE,CAAC,CAAC,OAAO,EAAE;IACrC,oBAAoB,EAAE,CAAC,CAAC,OAAO,EAAE;IACjC,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE;IACzB,aAAa,EAAE,CAAC,CAAC,OAAO,EAAE;IAC1B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;CACnB,CAAC,CAAC;AAEH,MAAM,+BAA+B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/C,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;CACtB,CAAC,CAAC;AAEH,0BAA0B;AAE1B,SAAS,uBAAuB,CAAC,WAAmB;IAClD,OAAO;;qBAEY,WAAW;;;;;;;;;;;;;;;;;4CAiBY,CAAC;AAC7C,CAAC;AAED,SAAS,4BAA4B,CAAC,iBAAyB,EAAE,mBAA6B;IAC5F,MAAM,WAAW,GAAG,mBAAmB;SACpC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC;SACzC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,OAAO;;gBAEO,iBAAiB;;;EAG/B,WAAW;;;;;;;;;;;;;;;4CAe+B,CAAC;AAC7C,CAAC;AAUD,4BAA4B;AAE5B;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,WAAmB,EACnB,IAAyB;IAEzB,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,OAAO,uBAAuB,CAAC,KAAK,CAAC;YACnC,KAAK,EAAE,CAAC;YACR,UAAU,EAAE;gBACV,wBAAwB,EAAE,KAAK;gBAC/B,oBAAoB,EAAE,KAAK;gBAC3B,YAAY,EAAE,KAAK;gBACnB,aAAa,EAAE,KAAK;aACrB;YACD,MAAM,EAAE,4BAA4B;SACrC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,MAAM,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAC;IACpD,IAAI,CAAC;QACH,IAAI,MAAqD,CAAC;QAC1D,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC;gBACxC,OAAO,EAAE,oBAAoB;gBAC7B,iBAAiB,EAAE,EAAE,mBAAmB,EAAE,MAAM,EAAE;gBAClD,cAAc,EAAE,6BAA6B;gBAC7C,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;YACF,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,6BAA6B,CAAC,CAAC;QACrF,CAAC;QACD,MAAM,IAAI,GAAG;YACX,wBAAwB,EAAE,MAAM,CAAC,wBAAwB;YACzD,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;YACjD,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,aAAa,EAAE,MAAM,CAAC,aAAa;SACpC,CAAC;QACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QAC7D,MAAM,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC;QAC/B,OAAO,uBAAuB,CAAC,KAAK,CAAC;YACnC,KAAK;YACL,UAAU,EAAE,IAAI;YAChB,MAAM,EAAE,MAAM,CAAC,MAAM;SACtB,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,uBAAuB,CAAC,KAAK,CAAC;YACnC,KAAK,EAAE,CAAC;YACR,UAAU,EAAE;gBACV,wBAAwB,EAAE,KAAK;gBAC/B,oBAAoB,EAAE,KAAK;gBAC3B,YAAY,EAAE,KAAK;gBACnB,aAAa,EAAE,KAAK;aACrB;YACD,MAAM,EAAE,iDAAiD;SAC1D,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,iBAAyB,EACzB,mBAA6B,EAC7B,IAAyB;IAEzB,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,CAAC;YACtD,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,CAAC;SACnB,CAAC,CAAC;QACH,IAAI,CAAC,MAAM,EAAE,IAAI,CACf,iFAAiF,CAClF,CAAC;QACF,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,MAAM,GAAG,4BAA4B,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,CAAC;IACpF,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,IAAI,CAAC;QACH,IAAI,MAAuD,CAAC;QAC5D,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC;gBACxC,OAAO,EAAE,oBAAoB;gBAC7B,iBAAiB,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE;gBAC7C,cAAc,EAAE,+BAA+B;gBAC/C,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;YACF,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,+BAA+B,CAAC,CAAC;QACvF,CAAC;QACD,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC3B,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;QACzB,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC;IACvC,CAAC;IAAC,MAAM,CAAC;QACP,yCAAyC;QACzC,QAAQ,GAAG,CAAC,CAAC;QACb,OAAO,GAAG,CAAC,CAAC;QACZ,aAAa,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;IAEpE,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,CAAC;QACtD,QAAQ;QACR,OAAO;QACP,aAAa;QACb,eAAe;KAChB,CAAC,CAAC;IAEH,IAAI,QAAQ,GAAG,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,IAAI,CACf,kFAAkF,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACvI,CAAC;IACJ,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/goal/goal-validation.d.ts

@@ -0,0 +1,20 @@
+/**
+ * goal-validation.ts — Validation helpers and dimension transformation utilities
+ * used by GoalNegotiator and related modules.
+ */
+import type { Dimension } from "../types/goal.js";
+import type { DimensionDecomposition } from "../types/negotiation.js";
+export declare function decompositionToDimension(d: DimensionDecomposition): Dimension;
+export declare function buildThreshold(thresholdType: "min" | "max" | "range" | "present" | "match", thresholdValue: number | string | boolean | (number | string)[] | null): Dimension["threshold"];
+/**
+ * When the LLM returns multiple dimensions with the same `name` (key),
+ * append `_2`, `_3`, … suffixes to the duplicates so every key is unique.
+ * All dimensions are preserved — none are dropped.
+ */
+export declare function deduplicateDimensionKeys(dimensions: DimensionDecomposition[]): DimensionDecomposition[];
+/**
+ * Find the best matching DataSource dimension name for a given dimension name.
+ * Uses simple keyword overlap matching.
+ */
+export declare function findBestDimensionMatch(name: string, candidates: string[]): string | null;
+//# sourceMappingURL=goal-validation.d.ts.map

package/dist/goal/goal-validation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-validation.d.ts","sourceRoot":"","sources":["../../src/goal/goal-validation.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAItE,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,sBAAsB,GAAG,SAAS,CAsB7E;AAED,wBAAgB,cAAc,CAC5B,aAAa,EAAE,KAAK,GAAG,KAAK,GAAG,OAAO,GAAG,SAAS,GAAG,OAAO,EAC5D,cAAc,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GAAG,IAAI,GACrE,SAAS,CAAC,WAAW,CAAC,CAyBxB;AAID;;;;GAIG;AACH,wBAAgB,wBAAwB,CAAC,UAAU,EAAE,sBAAsB,EAAE,GAAG,sBAAsB,EAAE,CAYvG;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI,CAiBxF"}

package/dist/goal/goal-validation.js

@@ -0,0 +1,93 @@
+/**
+ * goal-validation.ts — Validation helpers and dimension transformation utilities
+ * used by GoalNegotiator and related modules.
+ */
+// ─── Helper: convert DimensionDecomposition to Dimension ───
+export function decompositionToDimension(d) {
+    const threshold = buildThreshold(d.threshold_type, d.threshold_value);
+    return {
+        name: d.name,
+        label: d.label,
+        current_value: null,
+        threshold,
+        confidence: 0,
+        observation_method: {
+            type: "llm_review",
+            source: d.observation_method_hint,
+            schedule: null,
+            endpoint: null,
+            confidence_tier: "self_report",
+        },
+        last_updated: null,
+        history: [],
+        weight: 1.0,
+        uncertainty_weight: null,
+        state_integrity: "ok",
+        dimension_mapping: null,
+    };
+}
+export function buildThreshold(thresholdType, thresholdValue) {
+    switch (thresholdType) {
+        case "min":
+            return { type: "min", value: typeof thresholdValue === "number" ? thresholdValue : 0 };
+        case "max":
+            return { type: "max", value: typeof thresholdValue === "number" ? thresholdValue : 100 };
+        case "range": {
+            if (Array.isArray(thresholdValue)) {
+                const low = typeof thresholdValue[0] === "number" ? thresholdValue[0] : 0;
+                const high = typeof thresholdValue[1] === "number" ? thresholdValue[1] : 100;
+                return { type: "range", low, high };
+            }
+            return { type: "range", low: 0, high: typeof thresholdValue === "number" ? thresholdValue : 100 };
+        }
+        case "present":
+            return { type: "present" };
+        case "match":
+            return {
+                type: "match",
+                value: thresholdValue !== null && !Array.isArray(thresholdValue)
+                    ? thresholdValue
+                    : "",
+            };
+    }
+}
+// ─── Helper: deduplicate dimension keys ───
+/**
+ * When the LLM returns multiple dimensions with the same `name` (key),
+ * append `_2`, `_3`, … suffixes to the duplicates so every key is unique.
+ * All dimensions are preserved — none are dropped.
+ */
+export function deduplicateDimensionKeys(dimensions) {
+    const seen = new Map(); // key → count so far
+    for (const dim of dimensions) {
+        const base = dim.name;
+        const count = seen.get(base) ?? 0;
+        seen.set(base, count + 1);
+        if (count > 0) {
+            // Second occurrence → `_2`, third → `_3`, etc.
+            dim.name = `${base}_${count + 1}`;
+        }
+    }
+    return dimensions;
+}
+/**
+ * Find the best matching DataSource dimension name for a given dimension name.
+ * Uses simple keyword overlap matching.
+ */
+export function findBestDimensionMatch(name, candidates) {
+    const nameTokens = name.toLowerCase().split(/[_\s-]+/);
+    let bestMatch = null;
+    let bestScore = 0;
+    for (const candidate of candidates) {
+        const candidateTokens = candidate.toLowerCase().split(/[_\s-]+/);
+        // Count overlapping tokens
+        const overlap = nameTokens.filter(t => candidateTokens.includes(t)).length;
+        const score = overlap / Math.max(nameTokens.length, candidateTokens.length);
+        if (score > bestScore && score >= 0.6) { // At least 60% token overlap
+            bestScore = score;
+            bestMatch = candidate;
+        }
+    }
+    return bestMatch;
+}
+//# sourceMappingURL=goal-validation.js.map

package/dist/goal/goal-validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-validation.js","sourceRoot":"","sources":["../../src/goal/goal-validation.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,8DAA8D;AAE9D,MAAM,UAAU,wBAAwB,CAAC,CAAyB;IAChE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC;IACtE,OAAO;QACL,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,aAAa,EAAE,IAAI;QACnB,SAAS;QACT,UAAU,EAAE,CAAC;QACb,kBAAkB,EAAE;YAClB,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,CAAC,CAAC,uBAAuB;YACjC,QAAQ,EAAE,IAAI;YACd,QAAQ,EAAE,IAAI;YACd,eAAe,EAAE,aAAa;SAC/B;QACD,YAAY,EAAE,IAAI;QAClB,OAAO,EAAE,EAAE;QACX,MAAM,EAAE,GAAG;QACX,kBAAkB,EAAE,IAAI;QACxB,eAAe,EAAE,IAAI;QACrB,iBAAiB,EAAE,IAAI;KACxB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,aAA4D,EAC5D,cAAsE;IAEtE,QAAQ,aAAa,EAAE,CAAC;QACtB,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACzF,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAC3F,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;gBAClC,MAAM,GAAG,GAAG,OAAO,cAAc,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1E,MAAM,IAAI,GAAG,OAAO,cAAc,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YACtC,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpG,CAAC;QACD,KAAK,SAAS;YACZ,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAC7B,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,KAAK,EACH,cAAc,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC;oBACvD,CAAC,CAAE,cAA4C;oBAC/C,CAAC,CAAC,EAAE;aACT,CAAC;IACN,CAAC;AACH,CAAC;AAED,6CAA6C;AAE7C;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CAAC,UAAoC;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,qBAAqB;IAC7D,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC1B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,+CAA+C;YAC/C,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACpC,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAY,EAAE,UAAoB;IACvE,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACvD,IAAI,SAAS,GAAkB,IAAI,CAAC;IACpC,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,eAAe,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACjE,2BAA2B;QAC3B,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3E,MAAM,KAAK,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;QAC5E,IAAI,KAAK,GAAG,SAAS,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC,CAAE,6BAA6B;YACrE,SAAS,GAAG,KAAK,CAAC;YAClB,SAAS,GAAG,SAAS,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/goal/negotiator-context.d.ts

@@ -0,0 +1,13 @@
+import type { EthicsVerdict } from "../types/ethics.js";
+import type { Logger } from "../runtime/logger.js";
+/**
+ * Gather lightweight workspace facts to ground LLM dimension decomposition.
+ * Runs grep/find commands with a 5s total timeout budget.
+ * Never throws — returns empty string on any failure.
+ */
+export declare function gatherNegotiationContext(goalDescription: string, cwd?: string, logger?: Logger): Promise<string>;
+export declare class EthicsRejectedError extends Error {
+    readonly verdict: EthicsVerdict;
+    constructor(verdict: EthicsVerdict);
+}
+//# sourceMappingURL=negotiator-context.d.ts.map

package/dist/goal/negotiator-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"negotiator-context.d.ts","sourceRoot":"","sources":["../../src/goal/negotiator-context.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAWnD;;;;GAIG;AACH,wBAAsB,wBAAwB,CAC5C,eAAe,EAAE,MAAM,EACvB,GAAG,CAAC,EAAE,MAAM,EACZ,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,MAAM,CAAC,CAqHjB;AAID,qBAAa,mBAAoB,SAAQ,KAAK;aAChB,OAAO,EAAE,aAAa;gBAAtB,OAAO,EAAE,aAAa;CAInD"}

package/dist/goal/negotiator-context.js

@@ -0,0 +1,119 @@
+import { execFile } from "node:child_process";
+import { promisify } from "node:util";
+const execFileAsync = promisify(execFile);
+// ─── Constants ───
+const TASK_NOTE_MARKER = "TO" + "DO";
+const ISSUE_MARKER = "FIX" + "ME";
+// ─── Workspace Context Scanner ───
+/**
+ * Gather lightweight workspace facts to ground LLM dimension decomposition.
+ * Runs grep/find commands with a 5s total timeout budget.
+ * Never throws — returns empty string on any failure.
+ */
+export async function gatherNegotiationContext(goalDescription, cwd, logger) {
+    const dir = cwd ?? process.cwd();
+    const parts = [];
+    try {
+        // Extract keywords from the goal description
+        const STOP_WORDS = new Set([
+            "a", "an", "the", "and", "or", "but", "to", "for", "in", "on", "at",
+            "of", "with", "is", "are", "be", "do", "will", "that", "this", "it",
+            "we", "you", "i", "as", "from", "by", "を", "に", "は", "が", "の",
+            "で", "と", "も", "する", "た", "て", "し", "へ", "な", "こと",
+        ]);
+        const keywords = goalDescription
+            .split(/[\s,./、。（）()「」\-]+/)
+            .map((w) => w.trim())
+            .filter((w) => w.length > 2 && !STOP_WORDS.has(w.toLowerCase()));
+        // Project structure: count TypeScript files
+        let tsFileCount = 0;
+        try {
+            const { stdout } = await execFileAsync("find", [dir + "/src", "-name", "*.ts"], { timeout: 3000 });
+            const tsFiles = stdout.trim().split("\n").filter(Boolean);
+            tsFileCount = tsFiles.length;
+            parts.push(`Project structure: ${tsFileCount} TypeScript files in src/`);
+            // Show up to 20 files for structure overview
+            const sample = tsFiles.slice(0, 20).map((f) => f.replace(dir + "/", ""));
+            if (sample.length > 0) {
+                parts.push(`Sample files:\n  ${sample.join("\n  ")}`);
+            }
+        }
+        catch {
+            // find may fail if src/ doesn't exist — ignore
+        }
+        // Keyword occurrence counts
+        const keywordResults = [];
+        const topKeywords = keywords.slice(0, 5);
+        for (const kw of topKeywords) {
+            try {
+                const { stdout } = await execFileAsync("grep", ["-rn", "--include=*.ts", "-c", kw, dir + "/src"], { timeout: 2000 });
+                // Each line is "file:count" — sum them up
+                const totalCount = stdout
+                    .trim()
+                    .split("\n")
+                    .filter(Boolean)
+                    .reduce((sum, line) => {
+                    const count = parseInt(line.split(":").pop() ?? "0", 10);
+                    return sum + (isNaN(count) ? 0 : count);
+                }, 0);
+                const fileCount = stdout
+                    .trim()
+                    .split("\n")
+                    .filter((l) => {
+                    const c = parseInt(l.split(":").pop() ?? "0", 10);
+                    return !isNaN(c) && c > 0;
+                }).length;
+                if (totalCount > 0) {
+                    keywordResults.push(`  - "${kw}": ${totalCount} occurrences across ${fileCount} files`);
+                }
+            }
+            catch {
+                // grep exit 1 = no matches, ignore
+            }
+        }
+        const descLower = goalDescription.toLowerCase();
+        if (descLower.includes("todo") || descLower.includes("fixme")) {
+            for (const marker of [TASK_NOTE_MARKER, ISSUE_MARKER]) {
+                if (!descLower.includes(marker.toLowerCase()))
+                    continue;
+                try {
+                    const { stdout: countOut } = await execFileAsync("grep", ["-rn", "--include=*.ts", marker, dir + "/src"], { timeout: 3000 });
+                    const lines = countOut.trim().split("\n").filter(Boolean);
+                    const fileSet = new Set(lines.map((l) => l.split(":")[0]));
+                    keywordResults.push(`  - "${marker}": ${lines.length} occurrences across ${fileSet.size} files`);
+                    // Sample matches (up to 5)
+                    const sample = lines.slice(0, 5).map((l) => {
+                        const rel = l.replace(dir + "/", "");
+                        return `  ${rel}`;
+                    });
+                    if (sample.length > 0) {
+                        parts.push(`Sample ${marker} matches:\n${sample.join("\n")}`);
+                    }
+                }
+                catch {
+                    // ignore
+                }
+            }
+        }
+        if (keywordResults.length > 0) {
+            parts.splice(1, 0, `Keywords found:\n${keywordResults.join("\n")}`);
+        }
+    }
+    catch (err) {
+        logger?.warn(`[gatherNegotiationContext] Unexpected error: ${err instanceof Error ? err.message : String(err)}`);
+        return "";
+    }
+    if (parts.length === 0)
+        return "";
+    return `=== Workspace Context ===\n${parts.join("\n")}`;
+}
+// ─── Error class ───
+export class EthicsRejectedError extends Error {
+    verdict;
+    constructor(verdict) {
+        super(`Goal rejected by ethics gate: ${verdict.reasoning}`);
+        this.verdict = verdict;
+        this.name = "EthicsRejectedError";
+    }
+}
+//# sourceMappingURL=negotiator-context.js.map

package/dist/goal/negotiator-context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"negotiator-context.js","sourceRoot":"","sources":["../../src/goal/negotiator-context.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAItC,MAAM,aAAa,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;AAE1C,oBAAoB;AAEpB,MAAM,gBAAgB,GAAG,IAAI,GAAG,IAAI,CAAC;AACrC,MAAM,YAAY,GAAG,KAAK,GAAG,IAAI,CAAC;AAElC,oCAAoC;AAEpC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,eAAuB,EACvB,GAAY,EACZ,MAAe;IAEf,MAAM,GAAG,GAAG,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC;IACjC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,CAAC;QACH,6CAA6C;QAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;YACzB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;YACnE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI;YACnE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;YAC7D,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;SACnD,CAAC,CAAC;QACH,MAAM,QAAQ,GAAG,eAAe;aAC7B,KAAK,CAAC,oBAAoB,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAEnE,4CAA4C;QAC5C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,CACpC,MAAM,EACN,CAAC,GAAG,GAAG,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,EAC/B,EAAE,OAAO,EAAE,IAAI,EAAE,CAClB,CAAC;YACF,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC1D,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC;YAC7B,KAAK,CAAC,IAAI,CACR,sBAAsB,WAAW,2BAA2B,CAC7D,CAAC;YAEF,6CAA6C;YAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACzE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,oBAAoB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,+CAA+C;QACjD,CAAC;QAED,4BAA4B;QAC5B,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,CAAC;gBACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,CACpC,MAAM,EACN,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,GAAG,MAAM,CAAC,EACjD,EAAE,OAAO,EAAE,IAAI,EAAE,CAClB,CAAC;gBACF,0CAA0C;gBAC1C,MAAM,UAAU,GAAG,MAAM;qBACtB,IAAI,EAAE;qBACN,KAAK,CAAC,IAAI,CAAC;qBACX,MAAM,CAAC,OAAO,CAAC;qBACf,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;oBACpB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;oBACzD,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC1C,CAAC,EAAE,CAAC,CAAC,CAAC;gBACR,MAAM,SAAS,GAAG,MAAM;qBACrB,IAAI,EAAE;qBACN,KAAK,CAAC,IAAI,CAAC;qBACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;oBACZ,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;oBAClD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC5B,CAAC,CAAC,CAAC,MAAM,CAAC;gBACZ,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;oBACnB,cAAc,CAAC,IAAI,CACjB,QAAQ,EAAE,MAAM,UAAU,uBAAuB,SAAS,QAAQ,CACnE,CAAC;gBACJ,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,mCAAmC;YACrC,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,eAAe,CAAC,WAAW,EAAE,CAAC;QAChD,IAAI,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9D,KAAK,MAAM,MAAM,IAAI,CAAC,gBAAgB,EAAE,YAAY,CAAU,EAAE,CAAC;gBAC/D,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;oBAAE,SAAS;gBACxD,IAAI,CAAC;oBACH,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,aAAa,CAC9C,MAAM,EACN,CAAC,KAAK,EAAE,gBAAgB,EAAE,MAAM,EAAE,GAAG,GAAG,MAAM,CAAC,EAC/C,EAAE,OAAO,EAAE,IAAI,EAAE,CAClB,CAAC;oBACF,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3D,cAAc,CAAC,IAAI,CACjB,QAAQ,MAAM,MAAM,KAAK,CAAC,MAAM,uBAAuB,OAAO,CAAC,IAAI,QAAQ,CAC5E,CAAC;oBAEF,2BAA2B;oBAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBACzC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,CAAC,CAAC;wBACrC,OAAO,KAAK,GAAG,EAAE,CAAC;oBACpB,CAAC,CAAC,CAAC;oBACH,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACtB,KAAK,CAAC,IAAI,CAAC,UAAU,MAAM,cAAc,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAChE,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,SAAS;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,EAAE,IAAI,CAAC,gDAAgD,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjH,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,OAAO,8BAA8B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,sBAAsB;AAEtB,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IAChB;IAA5B,YAA4B,OAAsB;QAChD,KAAK,CAAC,iCAAiC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QADlC,YAAO,GAAP,OAAO,CAAe;QAEhD,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;IACpC,CAAC;CACF"}

package/dist/goal/negotiator-prompts.d.ts

@@ -0,0 +1,31 @@
+import { z } from "zod";
+import type { FeasibilityResult } from "../types/negotiation.js";
+export declare function buildDecompositionPrompt(description: string, constraints: string[], availableDataSources?: Array<{
+    name: string;
+    dimensions: string[];
+}>, workspaceContext?: string): string;
+export declare function buildFeasibilityPrompt(dimension: string, description: string, baselineValue: number | string | boolean | null, thresholdValue: number | string | boolean | (number | string)[] | null, timeHorizonDays: number): string;
+export declare function buildResponsePrompt(description: string, responseType: "accept" | "counter_propose" | "flag_as_ambitious", feasibilityResults: FeasibilityResult[], counterProposal?: {
+    realistic_target: number;
+    reasoning: string;
+}): string;
+export declare const QualitativeFeasibilitySchema: z.ZodObject<{
+    assessment: z.ZodEnum<["realistic", "ambitious", "infeasible"]>;
+    confidence: z.ZodEnum<["high", "medium", "low"]>;
+    reasoning: z.ZodString;
+    key_assumptions: z.ZodArray<z.ZodString, "many">;
+    main_risks: z.ZodArray<z.ZodString, "many">;
+}, "strip", z.ZodTypeAny, {
+    confidence: "low" | "high" | "medium";
+    reasoning: string;
+    assessment: "realistic" | "ambitious" | "infeasible";
+    key_assumptions: string[];
+    main_risks: string[];
+}, {
+    confidence: "low" | "high" | "medium";
+    reasoning: string;
+    assessment: "realistic" | "ambitious" | "infeasible";
+    key_assumptions: string[];
+    main_risks: string[];
+}>;
+//# sourceMappingURL=negotiator-prompts.d.ts.map

package/dist/goal/negotiator-prompts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"negotiator-prompts.d.ts","sourceRoot":"","sources":["../../src/goal/negotiator-prompts.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAIjE,wBAAgB,wBAAwB,CACtC,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,EAAE,EACrB,oBAAoB,CAAC,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,EACpE,gBAAgB,CAAC,EAAE,MAAM,GACxB,MAAM,CAkCR;AAED,wBAAgB,sBAAsB,CACpC,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,aAAa,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,EAC/C,cAAc,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GAAG,IAAI,EACtE,eAAe,EAAE,MAAM,GACtB,MAAM,CAQR;AAED,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,QAAQ,GAAG,iBAAiB,GAAG,mBAAmB,EAChE,kBAAkB,EAAE,iBAAiB,EAAE,EACvC,eAAe,CAAC,EAAE;IAAE,gBAAgB,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,GAChE,MAAM,CAiBR;AAID,eAAO,MAAM,4BAA4B;;;;;;;;;;;;;;;;;;EAMvC,CAAC"}