conatus 0.1.0

package/dist/goal/negotiator-prompts.js

@@ -0,0 +1,65 @@
+import { z } from "zod";
+// ─── Prompts ───
+export function buildDecompositionPrompt(description, constraints, availableDataSources, workspaceContext) {
+    const constraintsSection = constraints.length > 0
+        ? `\nConstraints:\n${constraints.map((c) => `- ${c}`).join("\n")}`
+        : "";
+    const dataSourcesSection = availableDataSources && availableDataSources.length > 0
+        ? `DataSources (use exact dimension names for overlap; add 1-2 extra only if shell-measurable):
+${availableDataSources.map((ds) => `- "${ds.name}": ${ds.dimensions.join(", ")}`).join("\n")}
+
+`
+        : "";
+    const workspaceSection = workspaceContext
+        ? `\nWorkspace:\n${workspaceContext}\nDerive dimensions measurable from this codebase (e.g. "task_note_count" max:0 if TODOs exist).\n`
+        : "";
+    return `${dataSourcesSection}Decompose this goal into measurable dimensions.
+
+Goal: ${description}${constraintsSection}${workspaceSection}
+
+Each dimension needs: name (snake_case, prefer exact DataSource name), label, threshold_type ("min"|"max"|"range"|"present"|"match"), threshold_value (number/string/bool or null), observation_method_hint.
+
+Rules:
+- 5-7 dimensions max; prefer mechanically measurable (shell/grep/test runner)
+- "present" only for pure existence checks; use "min" (0.0-1.0) for quality/correctness/completeness
+- No generic dimensions (code_quality, readability) unless goal names them AND a concrete shell command exists
+
+Example:
+[
+  {"name":"test_coverage","label":"Test Coverage","threshold_type":"min","threshold_value":80,"observation_method_hint":"Run test suite, check coverage %"},
+  {"name":"license_file_exists","label":"License File","threshold_type":"present","threshold_value":true,"observation_method_hint":"Check for LICENSE file in root"}
+]`;
+}
+export function buildFeasibilityPrompt(dimension, description, baselineValue, thresholdValue, timeHorizonDays) {
+    return `Dimension: ${dimension}
+Goal: ${description}
+Baseline: ${baselineValue === null ? "unknown" : String(baselineValue)}
+Target: ${thresholdValue === null ? "unknown" : String(thresholdValue)}
+Horizon: ${timeHorizonDays} days
+
+{"assessment":"realistic"|"ambitious"|"infeasible","confidence":"high"|"medium"|"low","reasoning":"...","key_assumptions":[...],"main_risks":[...]}`;
+}
+export function buildResponsePrompt(description, responseType, feasibilityResults, counterProposal) {
+    const feasibilitySummary = feasibilityResults
+        .map((r) => `- ${r.dimension}: ${r.assessment} (${r.confidence})`)
+        .join("\n");
+    const instruction = responseType === "accept"
+        ? "Write an encouraging acceptance message."
+        : responseType === "counter_propose"
+            ? `Write a counter-proposal: suggest ${counterProposal?.realistic_target} as a safer target. Reason: ${counterProposal?.reasoning}.`
+            : "Flag this goal as ambitious. Note the risks and ask user to review.";
+    return `Goal: ${description}
+Feasibility:
+${feasibilitySummary}
+
+${instruction} Reply in 1-3 sentences, plain text.`;
+}
+// ─── Qualitative feasibility schema for LLM parsing ───
+export const QualitativeFeasibilitySchema = z.object({
+    assessment: z.enum(["realistic", "ambitious", "infeasible"]),
+    confidence: z.enum(["high", "medium", "low"]),
+    reasoning: z.string(),
+    key_assumptions: z.array(z.string()),
+    main_risks: z.array(z.string()),
+});
+//# sourceMappingURL=negotiator-prompts.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"negotiator-prompts.js","sourceRoot":"","sources":["../../src/goal/negotiator-prompts.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,kBAAkB;AAElB,MAAM,UAAU,wBAAwB,CACtC,WAAmB,EACnB,WAAqB,EACrB,oBAAoE,EACpE,gBAAyB;IAEzB,MAAM,kBAAkB,GACtB,WAAW,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,CAAC,mBAAmB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAClE,CAAC,CAAC,EAAE,CAAC;IAET,MAAM,kBAAkB,GACtB,oBAAoB,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC;QACrD,CAAC,CAAC;EACN,oBAAoB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;CAE3F;QACK,CAAC,CAAC,EAAE,CAAC;IAET,MAAM,gBAAgB,GAAG,gBAAgB;QACvC,CAAC,CAAC,iBAAiB,gBAAgB,oGAAoG;QACvI,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO,GAAG,kBAAkB;;QAEtB,WAAW,GAAG,kBAAkB,GAAG,gBAAgB;;;;;;;;;;;;;EAazD,CAAC;AACH,CAAC;AAED,MAAM,UAAU,sBAAsB,CACpC,SAAiB,EACjB,WAAmB,EACnB,aAA+C,EAC/C,cAAsE,EACtE,eAAuB;IAEvB,OAAO,cAAc,SAAS;QACxB,WAAW;YACP,aAAa,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;UAC5D,cAAc,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC;WAC3D,eAAe;;oJAE0H,CAAC;AACrJ,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,WAAmB,EACnB,YAAgE,EAChE,kBAAuC,EACvC,eAAiE;IAEjE,MAAM,kBAAkB,GAAG,kBAAkB;SAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,GAAG,CAAC;SACjE,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,WAAW,GACf,YAAY,KAAK,QAAQ;QACvB,CAAC,CAAC,0CAA0C;QAC5C,CAAC,CAAC,YAAY,KAAK,iBAAiB;YAClC,CAAC,CAAC,qCAAqC,eAAe,EAAE,gBAAgB,+BAA+B,eAAe,EAAE,SAAS,GAAG;YACpI,CAAC,CAAC,qEAAqE,CAAC;IAE9E,OAAO,SAAS,WAAW;;EAE3B,kBAAkB;;EAElB,WAAW,sCAAsC,CAAC;AACpD,CAAC;AAED,yDAAyD;AAEzD,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC,MAAM,CAAC;IACnD,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IAC5D,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC7C,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;IACrB,eAAe,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACpC,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CAChC,CAAC,CAAC"}

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

@@ -0,0 +1,59 @@
+/**
+ * negotiator-steps.ts — Shared pipeline steps for negotiate() and renegotiate().
+ *
+ * Extracted from goal-negotiator.ts to keep that file under 500 lines.
+ * These are pure/functional helpers; they do NOT save state.
+ */
+import type { ILLMClient } from "../llm/llm-client.js";
+import type { IPromptGateway } from "../prompt/gateway.js";
+import type { ObservationEngine } from "../observation/observation-engine.js";
+import type { Logger } from "../runtime/logger.js";
+import type { DimensionDecomposition, FeasibilityResult, NegotiationLog, NegotiationResponse } from "../types/negotiation.js";
+import type { Dimension } from "../types/goal.js";
+import type { CharacterConfig } from "../types/character.js";
+export declare const FEASIBILITY_RATIO_THRESHOLD_REALISTIC = 1.5;
+export declare const REALISTIC_TARGET_ACCELERATION_FACTOR = 1.3;
+export declare const DEFAULT_TIME_HORIZON_DAYS = 90;
+export declare function getFeasibilityThreshold(characterConfig: CharacterConfig): number;
+export declare function runDecompositionStep(goalDescription: string, constraints: string[], observationEngine: ObservationEngine, llmClient: ILLMClient, workspaceContext?: string, logger?: Logger, gateway?: IPromptGateway): Promise<{
+    dimensions: DimensionDecomposition[];
+    availableDataSources: ReturnType<ObservationEngine["getAvailableDimensionInfo"]>;
+}>;
+export declare function buildInitialBaseline(dimensions: DimensionDecomposition[]): Array<{
+    dimension: string;
+    value: number | string | boolean | null;
+    confidence: number;
+    method: string;
+}>;
+export declare function buildRenegotiationBaseline(dimensions: DimensionDecomposition[], existingDimensions: Dimension[]): Array<{
+    dimension: string;
+    value: number | string | boolean | null;
+    confidence: number;
+    method: string;
+}>;
+export declare function evaluateQualitatively(llmClient: ILLMClient, dimensionName: string, goalDescription: string, baselineValue: number | string | boolean | null, thresholdValue: number | string | boolean | (number | string)[] | null, timeHorizonDays: number, gateway?: IPromptGateway): Promise<FeasibilityResult>;
+export declare function runCapabilityCheckStep(llmClient: ILLMClient, goalDescription: string, dimensions: DimensionDecomposition[], adapterCapabilities: Array<{
+    adapterType: string;
+    capabilities: string[];
+}>, feasibilityResults: FeasibilityResult[], log: NegotiationLog, logger?: Logger, gateway?: IPromptGateway): Promise<void>;
+export declare function determineResponseType(feasibilityResults: FeasibilityResult[], baselineObservations: Array<{
+    dimension: string;
+    value: number | string | boolean | null;
+    confidence: number;
+    method: string;
+}>, timeHorizonDays: number): {
+    responseType: "accept" | "counter_propose" | "flag_as_ambitious";
+    counterProposal?: {
+        realistic_target: number;
+        reasoning: string;
+        alternatives: string[];
+    };
+    initialConfidence: "high" | "medium" | "low";
+};
+export declare function buildNegotiationResponse(llmClient: ILLMClient, goalDescription: string, responseType: "accept" | "counter_propose" | "flag_as_ambitious", feasibilityResults: FeasibilityResult[], counterProposal: {
+    realistic_target: number;
+    reasoning: string;
+    alternatives: string[];
+} | undefined, ethicsFlags: string[] | undefined, initialConfidence: "high" | "medium" | "low", gateway?: IPromptGateway): Promise<NegotiationResponse>;
+export declare function estimateChangeRate(dimension: Dimension): number | null;
+//# sourceMappingURL=negotiator-steps.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"negotiator-steps.d.ts","sourceRoot":"","sources":["../../src/goal/negotiator-steps.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AAC9E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAMnD,OAAO,KAAK,EACV,sBAAsB,EACtB,iBAAiB,EACjB,cAAc,EACd,mBAAmB,EACpB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAkB7D,eAAO,MAAM,qCAAqC,MAAM,CAAC;AACzD,eAAO,MAAM,oCAAoC,MAAM,CAAC;AACxD,eAAO,MAAM,yBAAyB,KAAK,CAAC;AAI5C,wBAAgB,uBAAuB,CAAC,eAAe,EAAE,eAAe,GAAG,MAAM,CAEhF;AAID,wBAAsB,oBAAoB,CACxC,eAAe,EAAE,MAAM,EACvB,WAAW,EAAE,MAAM,EAAE,EACrB,iBAAiB,EAAE,iBAAiB,EACpC,SAAS,EAAE,UAAU,EACrB,gBAAgB,CAAC,EAAE,MAAM,EACzB,MAAM,CAAC,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC;IAAE,UAAU,EAAE,sBAAsB,EAAE,CAAC;IAAC,oBAAoB,EAAE,UAAU,CAAC,iBAAiB,CAAC,2BAA2B,CAAC,CAAC,CAAA;CAAE,CAAC,CA4DrI;AAID,wBAAgB,oBAAoB,CAAC,UAAU,EAAE,sBAAsB,EAAE,GAAG,KAAK,CAAC;IAChF,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC,CAOD;AAID,wBAAgB,0BAA0B,CACxC,UAAU,EAAE,sBAAsB,EAAE,EACpC,kBAAkB,EAAE,SAAS,EAAE,GAC9B,KAAK,CAAC;IACP,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC,CAUD;AAID,wBAAsB,qBAAqB,CACzC,SAAS,EAAE,UAAU,EACrB,aAAa,EAAE,MAAM,EACrB,eAAe,EAAE,MAAM,EACvB,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,EACvB,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,iBAAiB,CAAC,CAqD5B;AAID,wBAAsB,sBAAsB,CAC1C,SAAS,EAAE,UAAU,EACrB,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,sBAAsB,EAAE,EACpC,mBAAmB,EAAE,KAAK,CAAC;IAAE,WAAW,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,EAC3E,kBAAkB,EAAE,iBAAiB,EAAE,EACvC,GAAG,EAAE,cAAc,EACnB,MAAM,CAAC,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,IAAI,CAAC,CA0Df;AAID,wBAAgB,qBAAqB,CACnC,kBAAkB,EAAE,iBAAiB,EAAE,EACvC,oBAAoB,EAAE,KAAK,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC,EACF,eAAe,EAAE,MAAM,GACtB;IACD,YAAY,EAAE,QAAQ,GAAG,iBAAiB,GAAG,mBAAmB,CAAC;IACjE,eAAe,CAAC,EAAE;QAChB,gBAAgB,EAAE,MAAM,CAAC;QACzB,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,MAAM,EAAE,CAAC;KACxB,CAAC;IACF,iBAAiB,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;CAC9C,CAkDA;AAID,wBAAsB,wBAAwB,CAC5C,SAAS,EAAE,UAAU,EACrB,eAAe,EAAE,MAAM,EACvB,YAAY,EAAE,QAAQ,GAAG,iBAAiB,GAAG,mBAAmB,EAChE,kBAAkB,EAAE,iBAAiB,EAAE,EACvC,eAAe,EAAE;IAAE,gBAAgB,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,EAAE,CAAA;CAAE,GAAG,SAAS,EACpG,WAAW,EAAE,MAAM,EAAE,GAAG,SAAS,EACjC,iBAAiB,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,EAC5C,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,mBAAmB,CAAC,CAoC9B;AAID,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,SAAS,GAAG,MAAM,GAAG,IAAI,CAkBtE"}

package/dist/goal/negotiator-steps.js

@@ -0,0 +1,269 @@
+/**
+ * negotiator-steps.ts — Shared pipeline steps for negotiate() and renegotiate().
+ *
+ * Extracted from goal-negotiator.ts to keep that file under 500 lines.
+ * These are pure/functional helpers; they do NOT save state.
+ */
+import { z } from "zod";
+import { DimensionDecompositionSchema, FeasibilityResultSchema, CapabilityCheckLogSchema, } from "../types/negotiation.js";
+import { buildDecompositionPrompt, buildFeasibilityPrompt, buildResponsePrompt, QualitativeFeasibilitySchema, } from "./negotiator-prompts.js";
+import { buildCapabilityCheckPrompt, CapabilityCheckResultSchema, } from "./goal-suggest.js";
+import { deduplicateDimensionKeys, findBestDimensionMatch, } from "./goal-validation.js";
+// ─── Constants ───
+export const FEASIBILITY_RATIO_THRESHOLD_REALISTIC = 1.5;
+export const REALISTIC_TARGET_ACCELERATION_FACTOR = 1.3;
+export const DEFAULT_TIME_HORIZON_DAYS = 90;
+// ─── getFeasibilityThreshold ───
+export function getFeasibilityThreshold(characterConfig) {
+    return 1.5 + characterConfig.caution_level * 0.5;
+}
+// ─── Step 2: Dimension Decomposition ───
+export async function runDecompositionStep(goalDescription, constraints, observationEngine, llmClient, workspaceContext, logger, gateway) {
+    const availableDataSources = observationEngine.getAvailableDimensionInfo();
+    const decompositionPrompt = buildDecompositionPrompt(goalDescription, constraints, availableDataSources, workspaceContext);
+    let dimensions;
+    if (gateway) {
+        dimensions = await gateway.execute({
+            purpose: "goal_decomposition",
+            responseSchema: z.array(DimensionDecompositionSchema),
+            additionalContext: {
+                prompt: decompositionPrompt,
+                goalDescription,
+                constraints: constraints.join(", "),
+                ...(workspaceContext ? { workspaceContext } : {}),
+            },
+        });
+    }
+    else {
+        const decompositionResponse = await llmClient.sendMessage([{ role: "user", content: decompositionPrompt }], { temperature: 0 });
+        dimensions = llmClient.parseJSON(decompositionResponse.content, z.array(DimensionDecompositionSchema));
+    }
+    // Post-process: map dimension names to DataSource dimensions when similar
+    if (availableDataSources.length > 0) {
+        const allDsNames = availableDataSources.flatMap((ds) => ds.dimensions);
+        for (const dim of dimensions) {
+            if (!allDsNames.includes(dim.name)) {
+                const match = findBestDimensionMatch(dim.name, allDsNames);
+                if (match) {
+                    dim.name = match;
+                }
+            }
+        }
+        // Warn if all dimensions were remapped to DataSource dimensions
+        const allRemapped = dimensions.length > 0 && dimensions.every((dim) => allDsNames.includes(dim.name));
+        if (allRemapped) {
+            logger?.warn("[GoalNegotiator] Warning: all dimensions were remapped to DataSource dimensions. " +
+                "Quality-specific dimensions may be missing. Consider adding dimensions that directly " +
+                "measure the goal's quality aspects.");
+        }
+    }
+    // Post-process: ensure all dimension keys are unique
+    deduplicateDimensionKeys(dimensions);
+    return { dimensions, availableDataSources };
+}
+// ─── Step 3: Baseline (new goal) ───
+export function buildInitialBaseline(dimensions) {
+    return dimensions.map((dim) => ({
+        dimension: dim.name,
+        value: null,
+        confidence: 0,
+        method: "initial_baseline",
+    }));
+}
+// ─── Step 3: Baseline (renegotiation) ───
+export function buildRenegotiationBaseline(dimensions, existingDimensions) {
+    return dimensions.map((dim) => {
+        const existingDim = existingDimensions.find((d) => d.name === dim.name);
+        return {
+            dimension: dim.name,
+            value: existingDim?.current_value ?? null,
+            confidence: existingDim?.confidence ?? 0,
+            method: "existing_observation",
+        };
+    });
+}
+// ─── Step 4: Qualitative Feasibility Evaluation ───
+export async function evaluateQualitatively(llmClient, dimensionName, goalDescription, baselineValue, thresholdValue, timeHorizonDays, gateway) {
+    const prompt = buildFeasibilityPrompt(dimensionName, goalDescription, baselineValue, thresholdValue, timeHorizonDays);
+    try {
+        let parsed;
+        if (gateway) {
+            parsed = await gateway.execute({
+                purpose: "negotiation_feasibility",
+                responseSchema: QualitativeFeasibilitySchema,
+                additionalContext: {
+                    prompt,
+                    dimensionName,
+                    goalDescription,
+                    baselineValue: String(baselineValue),
+                    thresholdValue: String(thresholdValue),
+                    timeHorizonDays: String(timeHorizonDays),
+                },
+            });
+        }
+        else {
+            const response = await llmClient.sendMessage([{ role: "user", content: prompt }], { temperature: 0 });
+            parsed = llmClient.parseJSON(response.content, QualitativeFeasibilitySchema);
+        }
+        return FeasibilityResultSchema.parse({
+            dimension: dimensionName,
+            path: "qualitative",
+            feasibility_ratio: null,
+            assessment: parsed.assessment,
+            confidence: parsed.confidence,
+            reasoning: parsed.reasoning,
+            key_assumptions: parsed.key_assumptions,
+            main_risks: parsed.main_risks,
+        });
+    }
+    catch {
+        return FeasibilityResultSchema.parse({
+            dimension: dimensionName,
+            path: "qualitative",
+            feasibility_ratio: null,
+            assessment: "ambitious",
+            confidence: "low",
+            reasoning: "Failed to parse feasibility assessment, defaulting to ambitious.",
+            key_assumptions: [],
+            main_risks: ["Unable to assess feasibility"],
+        });
+    }
+}
+// ─── Step 4b: Capability Check ───
+export async function runCapabilityCheckStep(llmClient, goalDescription, dimensions, adapterCapabilities, feasibilityResults, log, logger, gateway) {
+    try {
+        const capCheckPrompt = buildCapabilityCheckPrompt(goalDescription, dimensions, adapterCapabilities);
+        let capCheckResult;
+        if (gateway) {
+            capCheckResult = await gateway.execute({
+                purpose: "negotiation_capability",
+                responseSchema: CapabilityCheckResultSchema,
+                additionalContext: {
+                    prompt: capCheckPrompt,
+                    goalDescription,
+                    dimensions: dimensions.map((d) => d.name).join(", "),
+                    capabilities: adapterCapabilities.flatMap((ac) => ac.capabilities).join(", "),
+                },
+            });
+        }
+        else {
+            const capCheckResponse = await llmClient.sendMessage([{ role: "user", content: capCheckPrompt }], { temperature: 0 });
+            capCheckResult = llmClient.parseJSON(capCheckResponse.content, CapabilityCheckResultSchema);
+        }
+        const allCapabilities = adapterCapabilities.flatMap((ac) => ac.capabilities);
+        const infeasibleDimensions = [];
+        for (const gap of capCheckResult.gaps) {
+            if (!gap.acquirable) {
+                const existing = feasibilityResults.find((r) => r.dimension === gap.dimension);
+                if (existing) {
+                    existing.assessment = "infeasible";
+                    existing.reasoning = `Capability gap: ${gap.reason}`;
+                }
+                infeasibleDimensions.push(gap.dimension);
+            }
+        }
+        log.step4_capability_check = CapabilityCheckLogSchema.parse({
+            capabilities_available: allCapabilities,
+            gaps_detected: capCheckResult.gaps.map((g) => ({
+                dimension: g.dimension,
+                required_capability: g.required_capability,
+                acquirable: g.acquirable,
+            })),
+            infeasible_dimensions: infeasibleDimensions,
+        });
+    }
+    catch {
+        logger?.warn("[GoalNegotiator] Step 4b capability check failed, continuing without it");
+    }
+}
+// ─── Step 5: Determine Response Type ───
+export function determineResponseType(feasibilityResults, baselineObservations, timeHorizonDays) {
+    const hasInfeasible = feasibilityResults.some((r) => r.assessment === "infeasible");
+    const hasLowConfidence = feasibilityResults.some((r) => r.confidence === "low");
+    const allRealisticOrAmbitious = feasibilityResults.every((r) => r.assessment === "realistic" || r.assessment === "ambitious");
+    let initialConfidence;
+    if (hasLowConfidence) {
+        initialConfidence = "low";
+    }
+    else if (feasibilityResults.some((r) => r.confidence === "medium")) {
+        initialConfidence = "medium";
+    }
+    else {
+        initialConfidence = "high";
+    }
+    if (hasInfeasible) {
+        const infeasible = feasibilityResults.find((r) => r.assessment === "infeasible");
+        const baseline = baselineObservations.find((o) => o.dimension === infeasible.dimension);
+        const baselineValue = typeof baseline?.value === "number" ? baseline.value : 0;
+        let realisticTarget;
+        if (infeasible.feasibility_ratio !== null && infeasible.feasibility_ratio > 0) {
+            const gap = (timeHorizonDays * REALISTIC_TARGET_ACCELERATION_FACTOR) /
+                infeasible.feasibility_ratio;
+            realisticTarget = baselineValue + gap;
+        }
+        else {
+            realisticTarget = baselineValue;
+        }
+        return {
+            responseType: "counter_propose",
+            counterProposal: {
+                realistic_target: realisticTarget,
+                reasoning: infeasible.reasoning,
+                alternatives: infeasible.main_risks.length > 0
+                    ? [`Address risks: ${infeasible.main_risks.join(", ")}`]
+                    : ["Consider reducing scope or extending timeline"],
+            },
+            initialConfidence: "low",
+        };
+    }
+    if (hasLowConfidence && allRealisticOrAmbitious) {
+        return { responseType: "flag_as_ambitious", initialConfidence: "low" };
+    }
+    return { responseType: "accept", initialConfidence };
+}
+// ─── Step 5: Build Response ───
+export async function buildNegotiationResponse(llmClient, goalDescription, responseType, feasibilityResults, counterProposal, ethicsFlags, initialConfidence, gateway) {
+    const responsePrompt = buildResponsePrompt(goalDescription, responseType, feasibilityResults, counterProposal);
+    let messageContent;
+    if (gateway) {
+        const result = await gateway.execute({
+            purpose: "negotiation_response",
+            responseSchema: z.object({ message: z.string() }),
+            additionalContext: {
+                prompt: responsePrompt,
+                goalDescription,
+                responseType,
+            },
+        });
+        messageContent = result.message;
+    }
+    else {
+        const responseMessage = await llmClient.sendMessage([{ role: "user", content: responsePrompt }], { temperature: 0 });
+        messageContent = responseMessage.content.trim();
+    }
+    return {
+        type: responseType,
+        message: messageContent,
+        accepted: responseType === "accept" || responseType === "flag_as_ambitious",
+        initial_confidence: initialConfidence,
+        ...(counterProposal ? { counter_proposal: counterProposal } : {}),
+        ...(ethicsFlags ? { flags: ethicsFlags } : {}),
+    };
+}
+// ─── estimateChangeRate ───
+export function estimateChangeRate(dimension) {
+    const history = dimension.history;
+    if (history.length < 2)
+        return null;
+    const numericEntries = history.filter((h) => typeof h.value === "number");
+    if (numericEntries.length < 2)
+        return null;
+    const first = numericEntries[0];
+    const last = numericEntries[numericEntries.length - 1];
+    const timeDiffMs = new Date(last.timestamp).getTime() - new Date(first.timestamp).getTime();
+    const timeDiffDays = timeDiffMs / (1000 * 60 * 60 * 24);
+    if (timeDiffDays <= 0)
+        return null;
+    return Math.abs(last.value - first.value) / timeDiffDays;
+}
+//# sourceMappingURL=negotiator-steps.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"negotiator-steps.js","sourceRoot":"","sources":["../../src/goal/negotiator-steps.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAKxB,OAAO,EACL,4BAA4B,EAC5B,uBAAuB,EACvB,wBAAwB,GACzB,MAAM,yBAAyB,CAAC;AASjC,OAAO,EACL,wBAAwB,EACxB,sBAAsB,EACtB,mBAAmB,EACnB,4BAA4B,GAC7B,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,0BAA0B,EAC1B,2BAA2B,GAC5B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,wBAAwB,EACxB,sBAAsB,GACvB,MAAM,sBAAsB,CAAC;AAE9B,oBAAoB;AAEpB,MAAM,CAAC,MAAM,qCAAqC,GAAG,GAAG,CAAC;AACzD,MAAM,CAAC,MAAM,oCAAoC,GAAG,GAAG,CAAC;AACxD,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAE5C,kCAAkC;AAElC,MAAM,UAAU,uBAAuB,CAAC,eAAgC;IACtE,OAAO,GAAG,GAAG,eAAe,CAAC,aAAa,GAAG,GAAG,CAAC;AACnD,CAAC;AAED,0CAA0C;AAE1C,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,eAAuB,EACvB,WAAqB,EACrB,iBAAoC,EACpC,SAAqB,EACrB,gBAAyB,EACzB,MAAe,EACf,OAAwB;IAExB,MAAM,oBAAoB,GAAG,iBAAiB,CAAC,yBAAyB,EAAE,CAAC;IAC3E,MAAM,mBAAmB,GAAG,wBAAwB,CAClD,eAAe,EACf,WAAW,EACX,oBAAoB,EACpB,gBAAgB,CACjB,CAAC;IAEF,IAAI,UAAoC,CAAC;IACzC,IAAI,OAAO,EAAE,CAAC;QACZ,UAAU,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;YACjC,OAAO,EAAE,oBAAoB;YAC7B,cAAc,EAAE,CAAC,CAAC,KAAK,CAAC,4BAA4B,CAAC;YACrD,iBAAiB,EAAE;gBACjB,MAAM,EAAE,mBAAmB;gBAC3B,eAAe;gBACf,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;gBACnC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAClD;SACF,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,MAAM,qBAAqB,GAAG,MAAM,SAAS,CAAC,WAAW,CACvD,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,mBAAmB,EAAE,CAAC,EAChD,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;QACF,UAAU,GAAG,SAAS,CAAC,SAAS,CAC9B,qBAAqB,CAAC,OAAO,EAC7B,CAAC,CAAC,KAAK,CAAC,4BAA4B,CAAC,CACtC,CAAC;IACJ,CAAC;IAED,0EAA0E;IAC1E,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACvE,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,sBAAsB,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;gBAC3D,IAAI,KAAK,EAAE,CAAC;oBACV,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,MAAM,WAAW,GACf,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,EAAE,IAAI,CACV,mFAAmF;gBACjF,uFAAuF;gBACvF,qCAAqC,CACxC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,wBAAwB,CAAC,UAAU,CAAC,CAAC;IAErC,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC;AAC9C,CAAC;AAED,sCAAsC;AAEtC,MAAM,UAAU,oBAAoB,CAAC,UAAoC;IAMvE,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC9B,SAAS,EAAE,GAAG,CAAC,IAAI;QACnB,KAAK,EAAE,IAAI;QACX,UAAU,EAAE,CAAC;QACb,MAAM,EAAE,kBAAkB;KAC3B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,2CAA2C;AAE3C,MAAM,UAAU,0BAA0B,CACxC,UAAoC,EACpC,kBAA+B;IAO/B,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC5B,MAAM,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACxE,OAAO;YACL,SAAS,EAAE,GAAG,CAAC,IAAI;YACnB,KAAK,EAAE,WAAW,EAAE,aAAa,IAAI,IAAI;YACzC,UAAU,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC;YACxC,MAAM,EAAE,sBAAsB;SAC/B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,qDAAqD;AAErD,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,SAAqB,EACrB,aAAqB,EACrB,eAAuB,EACvB,aAA+C,EAC/C,cAAsE,EACtE,eAAuB,EACvB,OAAwB;IAExB,MAAM,MAAM,GAAG,sBAAsB,CACnC,aAAa,EACb,eAAe,EACf,aAAa,EACb,cAAc,EACd,eAAe,CAChB,CAAC;IAEF,IAAI,CAAC;QACH,IAAI,MAAsH,CAAC;QAC3H,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;gBAC7B,OAAO,EAAE,yBAAyB;gBAClC,cAAc,EAAE,4BAA4B;gBAC5C,iBAAiB,EAAE;oBACjB,MAAM;oBACN,aAAa;oBACb,eAAe;oBACf,aAAa,EAAE,MAAM,CAAC,aAAa,CAAC;oBACpC,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC;oBACtC,eAAe,EAAE,MAAM,CAAC,eAAe,CAAC;iBACzC;aACF,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;YACF,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,4BAA4B,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,uBAAuB,CAAC,KAAK,CAAC;YACnC,SAAS,EAAE,aAAa;YACxB,IAAI,EAAE,aAAa;YACnB,iBAAiB,EAAE,IAAI;YACvB,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,eAAe,EAAE,MAAM,CAAC,eAAe;YACvC,UAAU,EAAE,MAAM,CAAC,UAAU;SAC9B,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,uBAAuB,CAAC,KAAK,CAAC;YACnC,SAAS,EAAE,aAAa;YACxB,IAAI,EAAE,aAAa;YACnB,iBAAiB,EAAE,IAAI;YACvB,UAAU,EAAE,WAAW;YACvB,UAAU,EAAE,KAAK;YACjB,SAAS,EAAE,kEAAkE;YAC7E,eAAe,EAAE,EAAE;YACnB,UAAU,EAAE,CAAC,8BAA8B,CAAC;SAC7C,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,oCAAoC;AAEpC,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,SAAqB,EACrB,eAAuB,EACvB,UAAoC,EACpC,mBAA2E,EAC3E,kBAAuC,EACvC,GAAmB,EACnB,MAAe,EACf,OAAwB;IAExB,IAAI,CAAC;QACH,MAAM,cAAc,GAAG,0BAA0B,CAC/C,eAAe,EACf,UAAU,EACV,mBAAmB,CACpB,CAAC;QACF,IAAI,cAA2D,CAAC;QAChE,IAAI,OAAO,EAAE,CAAC;YACZ,cAAc,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;gBACrC,OAAO,EAAE,wBAAwB;gBACjC,cAAc,EAAE,2BAA2B;gBAC3C,iBAAiB,EAAE;oBACjB,MAAM,EAAE,cAAc;oBACtB,eAAe;oBACf,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBACpD,YAAY,EAAE,mBAAmB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;iBAC9E;aACF,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,gBAAgB,GAAG,MAAM,SAAS,CAAC,WAAW,CAClD,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAC3C,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;YACF,cAAc,GAAG,SAAS,CAAC,SAAS,CAClC,gBAAgB,CAAC,OAAO,EACxB,2BAA2B,CAC5B,CAAC;QACJ,CAAC;QAED,MAAM,eAAe,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC7E,MAAM,oBAAoB,GAAa,EAAE,CAAC;QAE1C,KAAK,MAAM,GAAG,IAAI,cAAc,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;gBACpB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC/E,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,UAAU,GAAG,YAAY,CAAC;oBACnC,QAAQ,CAAC,SAAS,GAAG,mBAAmB,GAAG,CAAC,MAAM,EAAE,CAAC;gBACvD,CAAC;gBACD,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,GAAG,CAAC,sBAAsB,GAAG,wBAAwB,CAAC,KAAK,CAAC;YAC1D,sBAAsB,EAAE,eAAe;YACvC,aAAa,EAAE,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC7C,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,mBAAmB,EAAE,CAAC,CAAC,mBAAmB;gBAC1C,UAAU,EAAE,CAAC,CAAC,UAAU;aACzB,CAAC,CAAC;YACH,qBAAqB,EAAE,oBAAoB;SAC5C,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,EAAE,IAAI,CACV,yEAAyE,CAC1E,CAAC;IACJ,CAAC;AACH,CAAC;AAED,0CAA0C;AAE1C,MAAM,UAAU,qBAAqB,CACnC,kBAAuC,EACvC,oBAKE,EACF,eAAuB;IAUvB,MAAM,aAAa,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,YAAY,CAAC,CAAC;IACpF,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC;IAChF,MAAM,uBAAuB,GAAG,kBAAkB,CAAC,KAAK,CACtD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,WAAW,IAAI,CAAC,CAAC,UAAU,KAAK,WAAW,CACpE,CAAC;IAEF,IAAI,iBAA4C,CAAC;IACjD,IAAI,gBAAgB,EAAE,CAAC;QACrB,iBAAiB,GAAG,KAAK,CAAC;IAC5B,CAAC;SAAM,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,QAAQ,CAAC,EAAE,CAAC;QACrE,iBAAiB,GAAG,QAAQ,CAAC;IAC/B,CAAC;SAAM,CAAC;QACN,iBAAiB,GAAG,MAAM,CAAC;IAC7B,CAAC;IAED,IAAI,aAAa,EAAE,CAAC;QAClB,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,YAAY,CAAE,CAAC;QAClF,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;QACxF,MAAM,aAAa,GAAG,OAAO,QAAQ,EAAE,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/E,IAAI,eAAuB,CAAC;QAC5B,IAAI,UAAU,CAAC,iBAAiB,KAAK,IAAI,IAAI,UAAU,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC9E,MAAM,GAAG,GACP,CAAC,eAAe,GAAG,oCAAoC,CAAC;gBACxD,UAAU,CAAC,iBAAiB,CAAC;YAC/B,eAAe,GAAG,aAAa,GAAG,GAAG,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,eAAe,GAAG,aAAa,CAAC;QAClC,CAAC;QAED,OAAO;YACL,YAAY,EAAE,iBAAiB;YAC/B,eAAe,EAAE;gBACf,gBAAgB,EAAE,eAAe;gBACjC,SAAS,EAAE,UAAU,CAAC,SAAS;gBAC/B,YAAY,EACV,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;oBAC9B,CAAC,CAAC,CAAC,kBAAkB,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxD,CAAC,CAAC,CAAC,+CAA+C,CAAC;aACxD;YACD,iBAAiB,EAAE,KAAK;SACzB,CAAC;IACJ,CAAC;IAED,IAAI,gBAAgB,IAAI,uBAAuB,EAAE,CAAC;QAChD,OAAO,EAAE,YAAY,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;IACzE,CAAC;IAED,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;AACvD,CAAC;AAED,iCAAiC;AAEjC,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,SAAqB,EACrB,eAAuB,EACvB,YAAgE,EAChE,kBAAuC,EACvC,eAAoG,EACpG,WAAiC,EACjC,iBAA4C,EAC5C,OAAwB;IAExB,MAAM,cAAc,GAAG,mBAAmB,CACxC,eAAe,EACf,YAAY,EACZ,kBAAkB,EAClB,eAAe,CAChB,CAAC;IAEF,IAAI,cAAsB,CAAC;IAC3B,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;YACnC,OAAO,EAAE,sBAAsB;YAC/B,cAAc,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,iBAAiB,EAAE;gBACjB,MAAM,EAAE,cAAc;gBACtB,eAAe;gBACf,YAAY;aACb;SACF,CAAC,CAAC;QACH,cAAc,GAAG,MAAM,CAAC,OAAO,CAAC;IAClC,CAAC;SAAM,CAAC;QACN,MAAM,eAAe,GAAG,MAAM,SAAS,CAAC,WAAW,CACjD,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAC3C,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;QACF,cAAc,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IAClD,CAAC;IAED,OAAO;QACL,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE,cAAc;QACvB,QAAQ,EAAE,YAAY,KAAK,QAAQ,IAAI,YAAY,KAAK,mBAAmB;QAC3E,kBAAkB,EAAE,iBAAiB;QACrC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC/C,CAAC;AACJ,CAAC;AAED,6BAA6B;AAE7B,MAAM,UAAU,kBAAkB,CAAC,SAAoB;IACrD,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IAClC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CACnC,CAAC,CAAC,EAAqC,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CACtE,CAAC;IACF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3C,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAE,CAAC;IACjC,MAAM,IAAI,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IAExD,MAAM,UAAU,GACd,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC3E,MAAM,YAAY,GAAG,UAAU,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACxD,IAAI,YAAY,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAEnC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC;AAC3D,CAAC"}

package/dist/goal/state-aggregator.d.ts

@@ -0,0 +1,89 @@
+import { StateManager } from "../state-manager.js";
+import { SatisficingJudge } from "../drive/satisficing-judge.js";
+import type { SatisficingAggregation } from "../types/goal.js";
+import type { StateAggregationRule } from "../types/goal-tree.js";
+/**
+ * AggregatedState captures the result of rolling up child states into a parent.
+ *
+ * aggregated_gap is in [0, 1] where 0 = fully met and 1 = fully unmet.
+ * aggregated_confidence is the conservative minimum across all children.
+ */
+export interface AggregatedState {
+    parent_id: string;
+    aggregated_gap: number;
+    aggregated_confidence: number;
+    child_gaps: Record<string, number>;
+    child_completions: Record<string, boolean>;
+    aggregation_method: SatisficingAggregation;
+    timestamp: string;
+}
+/**
+ * StateAggregator handles upward aggregation (children → parent) and
+ * downward propagation (parent → children) of goal state, plus cascade
+ * completion detection.
+ *
+ * Design ref: docs/design/goal-tree.md §5 (state aggregation) and §6 (state propagation).
+ */
+export declare class StateAggregator {
+    private readonly stateManager;
+    private readonly satisficingJudge;
+    /**
+     * In-memory registry of StateAggregationRules keyed by parent_id.
+     * Rules are injected via registerAggregationRule().
+     */
+    private readonly aggregationRules;
+    constructor(stateManager: StateManager, satisficingJudge: SatisficingJudge);
+    /**
+     * Register (or replace) a StateAggregationRule for a parent goal.
+     * The rule overrides the default "min" aggregation for that parent.
+     */
+    registerAggregationRule(rule: StateAggregationRule): void;
+    /**
+     * Aggregate the current states of all direct children of parentId into a
+     * single AggregatedState.
+     *
+     * Algorithm (goal-tree.md §5):
+     *   1. Load parent goal to get children_ids.
+     *   2. For each child, compute a normalized gap (average of per-dimension gaps).
+     *   3. Determine aggregation method from registered rule or default "min".
+     *   4. Aggregate child gaps with the chosen method.
+     *   5. Confidence = min(child confidences) — conservative.
+     *
+     * @throws if the parent goal cannot be found.
+     */
+    aggregateChildStates(parentId: string): Promise<AggregatedState>;
+    /**
+     * Propagate parent-level state changes down to all direct children.
+     *
+     * Two propagation types (goal-tree.md §5):
+     *   a. Constraint propagation: new parent constraints are appended to children
+     *      that don't already have them (idempotent).
+     *   b. Deadline propagation: if the parent deadline differs from the children's
+     *      proportional position, adjust each child's deadline proportionally.
+     *
+     * Note: this method reads the parent goal's CURRENT deadline; to propagate a
+     * deadline change the caller must first save the updated parent, then call
+     * propagateStateDown().
+     *
+     * @throws if the parent goal cannot be found.
+     */
+    propagateStateDown(parentId: string): Promise<void>;
+    /**
+     * Walk up the tree from goalId and return IDs of ancestors that have
+     * become eligible for completion because ALL of their children are either
+     * "completed" or cancelled (treated as pruned-and-done).
+     *
+     * The starting goalId is treated as if it were already completed — this
+     * allows callers to invoke checkCompletionCascade immediately after deciding
+     * to complete a goal, before the status has been persisted.
+     *
+     * This method does NOT mutate any goal status — the caller decides what to
+     * do with the returned list (e.g. mark them "completed").
+     *
+     * @param goalId Starting point (usually the goal that just completed).
+     * @returns Ordered array of newly-completable ancestor IDs (bottom-up order).
+     */
+    checkCompletionCascade(goalId: string): Promise<string[]>;
+    private resolveAggregationMethod;
+}
+//# sourceMappingURL=state-aggregator.d.ts.map

package/dist/goal/state-aggregator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-aggregator.d.ts","sourceRoot":"","sources":["../../src/goal/state-aggregator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,gBAAgB,EAAmB,MAAM,+BAA+B,CAAC;AAGlF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAElE;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC3C,kBAAkB,EAAE,sBAAsB,CAAC;IAC3C,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;GAMG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAmB;IAEpD;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CACrB;gBAEA,YAAY,EAAE,YAAY,EAAE,gBAAgB,EAAE,gBAAgB;IAK1E;;;OAGG;IACH,uBAAuB,CAAC,IAAI,EAAE,oBAAoB,GAAG,IAAI;IAMzD;;;;;;;;;;;;OAYG;IACG,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;IAqEtE;;;;;;;;;;;;;;OAcG;IACG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAgFzD;;;;;;;;;;;;;;OAcG;IACG,sBAAsB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IA4C/D,OAAO,CAAC,wBAAwB;CAIjC"}