pulseed 0.0.1 → 0.1.0

package/dist/goal/negotiator-steps.js

@@ -0,0 +1,271 @@
+/**
+ * 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 { sanitizeThresholdTypes, sanitizeThresholdValues } from "./refiner-prompts.js";
+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, model_tier: 'main' });
+        const sanitized = sanitizeThresholdValues(sanitizeThresholdTypes(decompositionResponse.content));
+        dimensions = llmClient.parseJSON(sanitized, 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, model_tier: 'main' });
+            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, model_tier: 'main' });
+            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, model_tier: 'main' });
+        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,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AACvF,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,UAAU,EAAE,MAAM,EAAE,CACvC,CAAC;QACF,MAAM,SAAS,GAAG,uBAAuB,CAAC,sBAAsB,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC;QACjG,UAAU,GAAG,SAAS,CAAC,SAAS,CAC9B,SAAS,EACT,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,UAAU,EAAE,MAAM,EAAE,CACvC,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,UAAU,EAAE,MAAM,EAAE,CACvC,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,UAAU,EAAE,MAAM,EAAE,CACvC,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/refiner-prompts.d.ts

@@ -0,0 +1,26 @@
+import type { Goal } from "../types/goal.js";
+/**
+ * Sanitizes LLM-returned threshold_type strings to valid enum values.
+ * Handles the union of all known non-standard values from both
+ * GoalRefiner (leaf test) and GoalTreeManager (subgoal decomposition).
+ *
+ * Uses regex replacement so it works on raw JSON strings before parsing.
+ */
+export declare function sanitizeThresholdTypes(raw: string): string;
+/**
+ * Sanitizes LLM-returned threshold_value when threshold_type is "present".
+ * When the LLM returns an object (e.g. `{"type":"present"}`) as the value for
+ * a present threshold, replace it with null so downstream Zod schemas accept it.
+ *
+ * Operates on the raw JSON string before parsing to avoid any type-safety issues
+ * with the un-parsed LLM output.
+ */
+export declare function sanitizeThresholdValues(raw: string): string;
+/**
+ * Builds the leaf test prompt for the GoalRefiner.
+ *
+ * The returned prompt asks an LLM to evaluate whether the given goal is
+ * directly measurable and, when it is, to specify concrete dimensions.
+ */
+export declare function buildLeafTestPrompt(goal: Goal, availableDataSources: string[]): string;
+//# sourceMappingURL=refiner-prompts.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"refiner-prompts.d.ts","sourceRoot":"","sources":["../../src/goal/refiner-prompts.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAe7C;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAS1D;AAED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAY3D;AAqBD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,IAAI,EACV,oBAAoB,EAAE,MAAM,EAAE,GAC7B,MAAM,CAkDR"}

package/dist/goal/refiner-prompts.js

@@ -0,0 +1,119 @@
+// ─── Threshold type sanitizer ───
+const THRESHOLD_TYPE_MAP = {
+    exact: "match",
+    scale: "min",
+    qualitative: "min",
+    boolean: "present",
+    percentage: "min",
+    count: "min",
+};
+const VALID_THRESHOLD_TYPES = new Set(["min", "max", "range", "present", "match"]);
+/**
+ * Sanitizes LLM-returned threshold_type strings to valid enum values.
+ * Handles the union of all known non-standard values from both
+ * GoalRefiner (leaf test) and GoalTreeManager (subgoal decomposition).
+ *
+ * Uses regex replacement so it works on raw JSON strings before parsing.
+ */
+export function sanitizeThresholdTypes(raw) {
+    return raw.replace(/"threshold_type"\s*:\s*"([^"]+)"/g, (_match, val) => {
+        if (VALID_THRESHOLD_TYPES.has(val))
+            return `"threshold_type": "${val}"`;
+        const mapped = THRESHOLD_TYPE_MAP[val] ?? "min";
+        return `"threshold_type": "${mapped}"`;
+    });
+}
+/**
+ * Sanitizes LLM-returned threshold_value when threshold_type is "present".
+ * When the LLM returns an object (e.g. `{"type":"present"}`) as the value for
+ * a present threshold, replace it with null so downstream Zod schemas accept it.
+ *
+ * Operates on the raw JSON string before parsing to avoid any type-safety issues
+ * with the un-parsed LLM output.
+ */
+export function sanitizeThresholdValues(raw) {
+    // Find any "threshold_value": <object> that immediately follows a "present" threshold_type.
+    // Strategy: parse and re-serialize only the threshold_value fields for present dimensions.
+    // We use a two-pass approach on the raw string to avoid fragile regex on nested JSON.
+    try {
+        const parsed = JSON.parse(raw);
+        const sanitized = sanitizePresentThresholdValues(parsed);
+        return JSON.stringify(sanitized);
+    }
+    catch {
+        // If JSON parsing fails, return as-is and let downstream parsers handle it.
+        return raw;
+    }
+}
+function sanitizePresentThresholdValues(value) {
+    if (Array.isArray(value)) {
+        return value.map(sanitizePresentThresholdValues);
+    }
+    if (value !== null && typeof value === "object") {
+        const record = value;
+        const result = {};
+        for (const [k, v] of Object.entries(record)) {
+            result[k] = sanitizePresentThresholdValues(v);
+        }
+        // If this object has threshold_type === "present" and threshold_value is an object, null it out.
+        if (result["threshold_type"] === "present" && typeof result["threshold_value"] === "object" && result["threshold_value"] !== null) {
+            result["threshold_value"] = null;
+        }
+        return result;
+    }
+    return value;
+}
+/**
+ * Builds the leaf test prompt for the GoalRefiner.
+ *
+ * The returned prompt asks an LLM to evaluate whether the given goal is
+ * directly measurable and, when it is, to specify concrete dimensions.
+ */
+export function buildLeafTestPrompt(goal, availableDataSources) {
+    const constraintsSection = goal.constraints.length > 0
+        ? `Constraints: ${goal.constraints.join(", ")}`
+        : "Constraints: none";
+    const dataSourcesSection = availableDataSources.length > 0
+        ? availableDataSources.join(", ")
+        : "shell, file_existence";
+    return `You are evaluating whether a goal is directly measurable.
+
+Goal: "${goal.description}"
+${constraintsSection}
+Available data sources: ${dataSourcesSection}
+Depth: ${goal.decomposition_depth}
+
+A goal is measurable when you can specify ALL of these for EACH aspect:
+1. data_source — where to observe (shell command, file check, API, etc.)
+2. observation_command — exact command or check to run
+3. threshold_type — min/max/range/present/match
+4. threshold_value — concrete target value
+
+Return JSON:
+{
+  "is_measurable": true/false,
+  "dimensions": [
+    {
+      "name": "snake_case_name",
+      "label": "Human Label",
+      "threshold_type": "min",
+      "threshold_value": 80,
+      "data_source": "shell",
+      "observation_command": "npm test -- --coverage | grep Statements"
+    },
+    {
+      "name": "config_file",
+      "label": "Config File Present",
+      "threshold_type": "present",
+      "threshold_value": null,
+      "data_source": "file_existence",
+      "observation_command": "test -f config.json"
+    }
+  ],
+  "reason": "Brief explanation"
+}
+
+When is_measurable is false, set "dimensions" to null.
+For "present" threshold_type, always set "threshold_value" to null.`;
+}
+//# sourceMappingURL=refiner-prompts.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"refiner-prompts.js","sourceRoot":"","sources":["../../src/goal/refiner-prompts.ts"],"names":[],"mappings":"AAEA,mCAAmC;AAEnC,MAAM,kBAAkB,GAA2B;IACjD,KAAK,EAAE,OAAO;IACd,KAAK,EAAE,KAAK;IACZ,WAAW,EAAE,KAAK;IAClB,OAAO,EAAE,SAAS;IAClB,UAAU,EAAE,KAAK;IACjB,KAAK,EAAE,KAAK;CACb,CAAC;AAEF,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;AAEnF;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAW;IAChD,OAAO,GAAG,CAAC,OAAO,CAChB,mCAAmC,EACnC,CAAC,MAAc,EAAE,GAAW,EAAE,EAAE;QAC9B,IAAI,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,sBAAsB,GAAG,GAAG,CAAC;QACxE,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;QAChD,OAAO,sBAAsB,MAAM,GAAG,CAAC;IACzC,CAAC,CACF,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CAAC,GAAW;IACjD,4FAA4F;IAC5F,2FAA2F;IAC3F,sFAAsF;IACtF,IAAI,CAAC;QACH,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,8BAA8B,CAAC,MAAM,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAAC,MAAM,CAAC;QACP,4EAA4E;QAC5E,OAAO,GAAG,CAAC;IACb,CAAC;AACH,CAAC;AAED,SAAS,8BAA8B,CAAC,KAAc;IACpD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,KAAgC,CAAC;QAChD,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,iGAAiG;QACjG,IAAI,MAAM,CAAC,gBAAgB,CAAC,KAAK,SAAS,IAAI,OAAO,MAAM,CAAC,iBAAiB,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC,KAAK,IAAI,EAAE,CAAC;YAClI,MAAM,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAU,EACV,oBAA8B;IAE9B,MAAM,kBAAkB,GACtB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;QACzB,CAAC,CAAC,gBAAgB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAC/C,CAAC,CAAC,mBAAmB,CAAC;IAE1B,MAAM,kBAAkB,GACtB,oBAAoB,CAAC,MAAM,GAAG,CAAC;QAC7B,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC;QACjC,CAAC,CAAC,uBAAuB,CAAC;IAE9B,OAAO;;SAEA,IAAI,CAAC,WAAW;EACvB,kBAAkB;0BACM,kBAAkB;SACnC,IAAI,CAAC,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;oEAiCmC,CAAC;AACrE,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;IAgHtE;;;;;;;;;;;;;;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"}