kibi-cli 2.3.0 → 2.5.0

package/dist/operations/planning/compile-intent.d.ts

@@ -33,10 +33,18 @@ export type ProposalDecision = Readonly<{
     proposalId: string;
     decision: "accept" | "reject";
 }>;
+/**
+ * One witness from the staged what-if analysis. The engine's full evidence
+ * (sides, facts, scenario, comparison) is kept alongside these normalized
+ * fields so callers can act on more than requirement ids.
+ */
 export type ContradictionWitness = Readonly<{
     requirements: readonly string[];
     reason: string;
-}>;
+    status?: string;
+    /** property | predicate | rule | scenario_feasibility */
+    kind?: string;
+} & Record<string, unknown>>;
 export type TraceabilityProposal = Readonly<{
     proposalId: string;
     candidateId: string;
@@ -84,7 +92,14 @@ export type CompilePlanV1 = Readonly<{
     }[];
     contradictionAnalysis: {
         outcome: "no_conflict" | "conflict" | "unresolved";
+        /** Witnesses that decided the outcome: introduced ones, plus staged ones naming the target requirement. */
         witnesses: readonly ContradictionWitness[];
+        /** Staged witnesses the current KB does not have. */
+        introduced?: readonly ContradictionWitness[];
+        /** Current witnesses the plan resolves. */
+        removed?: readonly ContradictionWitness[];
+        /** Staged witnesses that already exist in the current KB. */
+        unchanged?: readonly ContradictionWitness[];
     };
     proposals: readonly TraceabilityProposal[];
     steps: readonly PlanStep[];
@@ -147,6 +162,24 @@ export type SourceWritePlan = Readonly<{
     afterHash: string | null;
     body?: string;
 }>;
+/** Rolled-back staging goal for a plan's steps (see what_if_analysis/2). */
+export declare function planWhatIfGoal(steps: readonly PlanStep[], now: Date): string;
+export type WhatIfAnalysis = Readonly<{
+    after: readonly ContradictionWitness[];
+    introduced: readonly ContradictionWitness[];
+    removed: readonly ContradictionWitness[];
+    unchanged: readonly ContradictionWitness[];
+}>;
+/**
+ * Parse checks:what_if_analysis_json/2 output. The binding is a quoted Prolog
+ * string, so the JSON may arrive encoded once more as a JSON string. A bare
+ * witness array (the what_if_contradiction_witnesses_json/2 shape) carries no
+ * current-KB baseline, so every witness in it is treated as introduced.
+ * Returns null when the output cannot be read.
+ */
+export declare function parseWhatIfAnalysis(raw: unknown): WhatIfAnalysis | null;
+/** Blocking: a proven contradiction or an infeasible success scenario. */
+export declare function isBlockingWitness(witness: ContradictionWitness): boolean;
 export declare function executeCompileIntent(args: CompileIntentArgs, context: OperationContext): Promise<{
     content: Array<{
         type: "text";

package/dist/operations/planning/compile-intent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compile-intent.d.ts","sourceRoot":"","sources":["../../../src/operations/planning/compile-intent.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,EACtB,KAAK,cAAc,EAEpB,MAAM,wBAAwB,CAAC;AAKhC,OAAO,KAAK,EACV,gBAAgB,EAEjB,MAAM,0CAA0C,CAAC;AAIlD,OAAO,KAAK,EAEV,2BAA2B,EAE5B,MAAM,8BAA8B,CAAC;AAGtC,eAAO,MAAM,oBAAoB,EAAG,sBAA+B,CAAC;AAGpE,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,eAAe,CAAC,EAAE,SAAS,2BAA2B,EAAE,CAAC;IACzD,cAAc,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;IAC1C,UAAU,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,iBAAiB,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACjD,CAAC,CAAC;AAGH,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC,CAAC;AAGH,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC;IAC/B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,iBAAiB,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,YAAY,CAAC;IAC1D,uBAAuB,CAAC,EAAE,UAAU,GAAG,UAAU,CAAC;CACnD,CAAC,CAAC;AAGH,MAAM,MAAM,gBAAgB,GAAG,QAAQ,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC;CAC/B,CAAC,CAAC;AAGH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC,CAAC;AAGH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,CAAC;CAC3C,CAAC,CAAC;AAGH,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;AAGzD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACtC,MAAM,CAGR;AAGD,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,OAAO,EAAE,OAAO,oBAAoB,CAAC;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,OAAO,GAAG,kBAAkB,GAAG,SAAS,CAAC;IACjD,QAAQ,EAAE;QACR,MAAM,EAAE,MAAM,CAAC;QACf,YAAY,EAAE,MAAM,CAAC;QACrB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;KACvD,CAAC;IACF,MAAM,EAAE;QACN,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;QAC1B,aAAa,EAAE,MAAM,CAAC;QACtB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,SAAS,EAAE;QACT,UAAU,EAAE,SAAS,iBAAiB,EAAE,CAAC;QACzC,SAAS,EAAE,OAAO,CAAC;KACpB,CAAC;IACF,YAAY,EAAE,SAAS;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAE,CAAC;QACrC,WAAW,EACP,iBAAiB,GACjB,WAAW,GACX,MAAM,GACN,aAAa,GACb,YAAY,CAAC;QACjB,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,cAAc,GAAG,YAAY,CAAC;QAChE,MAAM,EAAE,MAAM,GAAG,eAAe,CAAC;KAClC,EAAE,CAAC;IACJ,qBAAqB,EAAE;QACrB,OAAO,EAAE,aAAa,GAAG,UAAU,GAAG,YAAY,CAAC;QACnD,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;KAC5C,CAAC;IACF,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAC3C,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,YAAY,EAAE,SAAS,eAAe,EAAE,CAAC;IACzC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,gFAAgF;IAChF,iBAAiB,CAAC,EAAE,QAAQ,CAAC;QAC3B,MAAM,EAAE,SAAS;YACf,QAAQ,EAAE,MAAM,CAAC;YACjB,aAAa,EAAE,MAAM,CAAC;YACtB,UAAU,EAAE,MAAM,CAAC;YACnB,IAAI,EAAE,MAAM,CAAC;YACb,QAAQ,EAAE,OAAO,CAAC;YAClB,OAAO,EAAE,OAAO,CAAC;YACjB,OAAO,EAAE,OAAO,CAAC;YACjB,YAAY,CAAC,EAAE,OAAO,CAAC;YACvB,KAAK,CAAC,EAAE,MAAM,CAAC;SAChB,EAAE,CAAC;QACJ,cAAc,EAAE,QAAQ,CAAC;YACvB,YAAY,EAAE,OAAO,CAAC;YACtB,SAAS,EAAE,SAAS;gBAClB,QAAQ,EAAE,MAAM,CAAC;gBACjB,IAAI,EAAE,MAAM,CAAC;gBACb,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;YACJ,iBAAiB,EAAE,SAAS;gBAC1B,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;gBACnB,IAAI,EAAE,MAAM,CAAC;gBACb,QAAQ,EAAE,OAAO,CAAC;gBAClB,OAAO,EAAE,OAAO,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC;gBACjB,YAAY,CAAC,EAAE,OAAO,CAAC;gBACvB,KAAK,CAAC,EAAE,MAAM,CAAC;gBACf,SAAS,EAAE,SAAS;oBAClB,QAAQ,EAAE,MAAM,CAAC;oBACjB,IAAI,EAAE,MAAM,CAAC;oBACb,UAAU,EAAE,MAAM,CAAC;iBACpB,EAAE,CAAC;aACL,EAAE,CAAC;SACL,CAAC,GAAG,IAAI,CAAC;QACV,QAAQ,EAAE,QAAQ,CAAC;YACjB,QAAQ,EAAE,OAAO,CAAC;YAClB,UAAU,EAAE,MAAM,CAAC;YACnB,gBAAgB,EAAE,MAAM,CAAC;YACzB,aAAa,EAAE,SAAS;gBACtB,MAAM,EAAE,MAAM,CAAC;gBACf,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;SACL,CAAC,CAAC;KACJ,CAAC,CAAC;CACJ,CAAC,CAAC;AAEH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AA0eH,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC;IACT,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/C,iBAAiB,EAAE,aAAa,CAAC;CAClC,CAAC,CA4WD"}
+{"version":3,"file":"compile-intent.d.ts","sourceRoot":"","sources":["../../../src/operations/planning/compile-intent.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,EACtB,KAAK,cAAc,EAEpB,MAAM,wBAAwB,CAAC;AAKhC,OAAO,KAAK,EACV,gBAAgB,EAEjB,MAAM,0CAA0C,CAAC;AAOlD,OAAO,KAAK,EAEV,2BAA2B,EAE5B,MAAM,8BAA8B,CAAC;AAGtC,eAAO,MAAM,oBAAoB,EAAG,sBAA+B,CAAC;AAGpE,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,eAAe,CAAC,EAAE,SAAS,2BAA2B,EAAE,CAAC;IACzD,cAAc,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;IAC1C,UAAU,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,iBAAiB,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACjD,CAAC,CAAC;AAGH,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC,CAAC;AAGH,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC;IAC/B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,iBAAiB,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,YAAY,CAAC;IAC1D,uBAAuB,CAAC,EAAE,UAAU,GAAG,UAAU,CAAC;CACnD,CAAC,CAAC;AAGH,MAAM,MAAM,gBAAgB,GAAG,QAAQ,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC;CAC/B,CAAC,CAAC;AAGH;;;;GAIG;AACH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CACzC;IACE,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAC5B,CAAC;AAGF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,CAAC;CAC3C,CAAC,CAAC;AAGH,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;AAGzD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACtC,MAAM,CAGR;AAGD,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,OAAO,EAAE,OAAO,oBAAoB,CAAC;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,OAAO,GAAG,kBAAkB,GAAG,SAAS,CAAC;IACjD,QAAQ,EAAE;QACR,MAAM,EAAE,MAAM,CAAC;QACf,YAAY,EAAE,MAAM,CAAC;QACrB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;KACvD,CAAC;IACF,MAAM,EAAE;QACN,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;QAC1B,aAAa,EAAE,MAAM,CAAC;QACtB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,SAAS,EAAE;QACT,UAAU,EAAE,SAAS,iBAAiB,EAAE,CAAC;QACzC,SAAS,EAAE,OAAO,CAAC;KACpB,CAAC;IACF,YAAY,EAAE,SAAS;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAE,CAAC;QACrC,WAAW,EACP,iBAAiB,GACjB,WAAW,GACX,MAAM,GACN,aAAa,GACb,YAAY,CAAC;QACjB,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,cAAc,GAAG,YAAY,CAAC;QAChE,MAAM,EAAE,MAAM,GAAG,eAAe,CAAC;KAClC,EAAE,CAAC;IACJ,qBAAqB,EAAE;QACrB,OAAO,EAAE,aAAa,GAAG,UAAU,GAAG,YAAY,CAAC;QACnD,2GAA2G;QAC3G,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC3C,qDAAqD;QACrD,UAAU,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC7C,2CAA2C;QAC3C,OAAO,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC1C,6DAA6D;QAC7D,SAAS,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;KAC7C,CAAC;IACF,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAC3C,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,YAAY,EAAE,SAAS,eAAe,EAAE,CAAC;IACzC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,gFAAgF;IAChF,iBAAiB,CAAC,EAAE,QAAQ,CAAC;QAC3B,MAAM,EAAE,SAAS;YACf,QAAQ,EAAE,MAAM,CAAC;YACjB,aAAa,EAAE,MAAM,CAAC;YACtB,UAAU,EAAE,MAAM,CAAC;YACnB,IAAI,EAAE,MAAM,CAAC;YACb,QAAQ,EAAE,OAAO,CAAC;YAClB,OAAO,EAAE,OAAO,CAAC;YACjB,OAAO,EAAE,OAAO,CAAC;YACjB,YAAY,CAAC,EAAE,OAAO,CAAC;YACvB,KAAK,CAAC,EAAE,MAAM,CAAC;SAChB,EAAE,CAAC;QACJ,cAAc,EAAE,QAAQ,CAAC;YACvB,YAAY,EAAE,OAAO,CAAC;YACtB,SAAS,EAAE,SAAS;gBAClB,QAAQ,EAAE,MAAM,CAAC;gBACjB,IAAI,EAAE,MAAM,CAAC;gBACb,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;YACJ,iBAAiB,EAAE,SAAS;gBAC1B,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;gBACnB,IAAI,EAAE,MAAM,CAAC;gBACb,QAAQ,EAAE,OAAO,CAAC;gBAClB,OAAO,EAAE,OAAO,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC;gBACjB,YAAY,CAAC,EAAE,OAAO,CAAC;gBACvB,KAAK,CAAC,EAAE,MAAM,CAAC;gBACf,SAAS,EAAE,SAAS;oBAClB,QAAQ,EAAE,MAAM,CAAC;oBACjB,IAAI,EAAE,MAAM,CAAC;oBACb,UAAU,EAAE,MAAM,CAAC;iBACpB,EAAE,CAAC;aACL,EAAE,CAAC;SACL,CAAC,GAAG,IAAI,CAAC;QACV,QAAQ,EAAE,QAAQ,CAAC;YACjB,QAAQ,EAAE,OAAO,CAAC;YAClB,UAAU,EAAE,MAAM,CAAC;YACnB,gBAAgB,EAAE,MAAM,CAAC;YACzB,aAAa,EAAE,SAAS;gBACtB,MAAM,EAAE,MAAM,CAAC;gBACf,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;SACL,CAAC,CAAC;KACJ,CAAC,CAAC;CACJ,CAAC,CAAC;AAEH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AA0UH,4EAA4E;AAC5E,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,MAAM,CAqC5E;AAGD,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,KAAK,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACvC,UAAU,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAC5C,OAAO,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzC,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;CAC5C,CAAC,CAAC;AAqBH;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,OAAO,GAAG,cAAc,GAAG,IAAI,CAoBvE;AAGD,0EAA0E;AAC1E,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,oBAAoB,GAAG,OAAO,CAExE;AAqQD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC;IACT,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/C,iBAAiB,EAAE,aAAa,CAAC;CAClC,CAAC,CA8YD"}

package/dist/operations/planning/compile-intent.js

@@ -1,17 +1,18 @@
 import { createHash } from "node:crypto";
 import path from "node:path";
-import { dump as dumpYaml } from "js-yaml";
 import { executeIntentSearch, } from "../../intent-search.js";
 import { publicCapabilityStamp } from "../../plugins/compose-semantic-classifier.js";
-import { normalizeEntityId, parseTriples } from "../../prolog/codec.js";
+import { normalizeEntityId } from "../../prolog/codec.js";
 import { loadEntities } from "../../public/operations/discovery-entities.js";
 import { executeStatus } from "../../public/operations/discovery-executors.js";
-import { configuredSourceTarget } from "../mutation/source-authoring.js";
+import { buildWhatIfAnalysisGoal } from "../mutation/contradictions.js";
+import { canonicalSourcePath } from "../mutation/source-authoring.js";
+import { validateUpsertInput } from "../mutation/validation.js";
 import { analyzeSemanticAdvisorInputWithPlugins } from "../semantic-advisor/plugin-orchestration.js";
 import { canonicalize } from "../semantic-advisor/shared.js";
-// implements REQ-kibi-change-to-proof-plan-compiler
+// implements REQ-kibi-change-to-proof-plan-compiler-v2
 export const COMPILE_PLAN_VERSION = "kibi.compile-plan.v1";
-// implements REQ-kibi-change-to-proof-plan-compiler
+// implements REQ-kibi-change-to-proof-plan-compiler-v2
 export function compilePlanHash(plan) {
     const { planHash: _ignored, ...body } = plan;
     return hash(body);
@@ -103,15 +104,56 @@ function mergeSteps(steps) {
         ]);
         merged.set(key, { ...previous, ...step, properties, relationships });
     }
-    return [...merged.values()].sort((left, right) => {
-        const leftType = text(left.type) === "req" ? 1 : 0;
-        const rightType = text(right.type) === "req" ? 1 : 0;
-        return leftType - rightType || text(left.id).localeCompare(text(right.id));
-    });
+    // Steps apply in order and a relationship needs both endpoints, so order
+    // by what links to what: tests before the scenarios that are verified_by
+    // them, and the requirement (specified_by, requires_*) last.
+    const rank = (step) => ({ test: 1, scenario: 2, req: 3 })[text(step.type)] ?? 0;
+    return [...merged.values()].sort((left, right) => rank(left) - rank(right) || text(left.id).localeCompare(text(right.id)));
 }
 function isRecord(value) {
     return value !== null && typeof value === "object" && !Array.isArray(value);
 }
+// implements REQ-kibi-truthful-consistency
+// Each advisor suggestion carries an inventory in which only its own clause is
+// modeled, so merging suggestion steps left the requirement with whichever
+// inventory came last (or none). The compiled plan already knows every
+// proposition's final status: write that one inventory, and a logic_claims
+// manifest covering every assertive proposition, onto the requirement step.
+function withRequirementInventory(steps, requirementId, receipt, propositions) {
+    if (propositions.length === 0)
+        return [...steps];
+    const roles = new Map(receipt.propositions.map((proposition) => [
+        proposition.claim_key,
+        proposition.role,
+    ]));
+    const inventory = propositions.map((proposition) => ({
+        claim_key: proposition.claimKey,
+        claim_text: proposition.text,
+        role: roles.get(proposition.claimKey) ?? "descriptive",
+        status: proposition.status,
+        span: proposition.span,
+    }));
+    const logicClaims = propositions
+        .filter((proposition) => proposition.status !== "nonlogical")
+        .map((proposition) => proposition.claimKey);
+    return steps.map((step) => {
+        if (text(step.type) !== "req" || text(step.id) !== requirementId)
+            return step;
+        const properties = isRecord(step.properties) ? step.properties : {};
+        return {
+            ...step,
+            properties: {
+                ...properties,
+                logic_claims: logicClaims,
+                semantic_clauses: propositions.map((proposition) => proposition.text),
+                semantic_inventory_version: receipt.inventory_contract.version,
+                semantic_source_field: receipt.inventory_contract.source_field,
+                semantic_source_hash: receipt.inventory_contract.source_hash,
+                semantic_inventory: inventory,
+            },
+        };
+    });
+}
 function propositionStatus(proposition, suggestion) {
     if (proposition.role === "rationale" ||
         proposition.role === "example" ||
@@ -166,81 +208,213 @@ async function sourceHashes(context, locations) {
     }
     return hashes;
 }
-function sourceTarget(context, locations, existingSource) {
-    const explicit = locations?.[0]?.path?.trim();
-    if (explicit)
-        return explicit.replaceAll("\\", "/");
-    if (existingSource &&
-        !/^[A-Za-z][A-Za-z0-9+.-]*:\/\//.test(existingSource) &&
-        /\.(?:md|mdx|ya?ml)$/i.test(existingSource))
-        return existingSource.replaceAll("\\", "/");
-    return configuredSourceTarget(context.workspaceRoot, "req");
+/**
+ * A markdown source location may name the requirement's authored document.
+ * Any other location is changed-code evidence and is never a write target.
+ */
+function requirementDocumentPath(locations) {
+    const explicit = locations?.[0]?.path?.trim().replaceAll("\\", "/");
+    if (!explicit || !/\.(?:md|mdx)$/i.test(explicit))
+        return undefined;
+    // Kibi owns the .kb layout: entities there live at their canonical path.
+    if (explicit === ".kb" || explicit.startsWith(".kb/"))
+        return undefined;
+    return explicit;
 }
-async function sourceWritePlan(context, requirementId, title, intent, locations, existingSource, existingEntityExists) {
+// implements REQ-kibi-change-to-proof-plan-compiler-v2
+/**
+ * Name the authored document every entity step writes, as `kb_upsert` would
+ * choose it: the entity's existing authored document, else its canonical
+ * `.kb/<lane>/<ID>.md` (the requirement may name its own markdown document).
+ * `kb_apply_plan` renders each step's entity into its document and journals
+ * the bytes with the rest of the plan. Without documents a plan's entities
+ * lived only in the branch store and vanished on `kibi sync --rebuild` or a
+ * fresh clone.
+ *
+ * The plan stays deterministic: it names targets and the requirement's body,
+ * not bytes, because the document carries the origin the apply records.
+ * Symbol steps keep the manifest path through `kb_upsert`, which also
+ * refreshes their coordinates.
+ */
+async function withDocumentTargets(context, prolog, steps, requirement, now) {
     if (!context.fs)
-        return [];
-    if (existingEntityExists &&
-        (locations === undefined || locations.length === 0) &&
-        !existingSource.match(/\.(?:md|mdx|ya?ml|json)$/i)) {
-        return [];
-    }
-    const relative = sourceTarget(context, locations, existingSource);
-    if (!relative ||
-        path.isAbsolute(relative) ||
-        relative.split(/[\\/]/).includes("..")) {
-        return [];
+        return [...steps];
+    const targeted = [];
+    for (const step of steps) {
+        const type = text(step.type);
+        const id = text(step.id);
+        const properties = isRecord(step.properties) ? step.properties : {};
+        if (type === "symbol" || Object.keys(properties).length === 0) {
+            targeted.push(step);
+            continue;
+        }
+        const stepDocument = isRecord(step.document) ? step.document : {};
+        const document = type === "req" && id === requirement.id
+            ? {
+                body: requirement.body,
+                ...(requirement.path !== undefined
+                    ? { path: requirement.path }
+                    : {}),
+            }
+            : typeof stepDocument.body === "string"
+                ? { body: stepDocument.body.replace(/\n*$/, "\n") }
+                : {};
+        const input = {
+            type,
+            id,
+            properties,
+            relationships: (Array.isArray(step.relationships)
+                ? step.relationships.filter(isRecord)
+                : []),
+            document,
+        };
+        // An invalid entity or an unwritable document would fail the apply.
+        const { entity } = validateUpsertInput(input, now);
+        const [existing] = document.path === undefined
+            ? await loadEntities(prolog, { id, type })
+            : [];
+        targeted.push({
+            ...step,
+            document: {
+                ...document,
+                path: canonicalSourcePath(context, input, entity, existing),
+            },
+        });
     }
-    const absolute = path.resolve(context.workspaceRoot, relative);
-    const root = path.resolve(context.workspaceRoot);
-    if (absolute !== root && !absolute.startsWith(`${root}${path.sep}`))
-        return [];
-    const workspaceRelative = path.relative(root, absolute);
-    if (workspaceRelative === ".kb" ||
-        workspaceRelative.startsWith(`.kb${path.sep}`))
-        return [];
-    let before;
+    return targeted;
+}
+function generatedRequirementId(intent) {
+    return `REQ-${slug(intent)}-${shortHash(intent).toUpperCase()}`;
+}
+// implements REQ-kibi-truthful-consistency
+/** Rolled-back staging goal for a plan's steps (see what_if_analysis/2). */
+export function planWhatIfGoal(steps, now) {
+    return buildWhatIfAnalysisGoal(steps.map((step) => {
+        const relationships = (Array.isArray(step.relationships)
+            ? step.relationships.filter(isRecord)
+            : []).map((relationship) => ({
+            type: text(relationship.type),
+            from: text(relationship.from),
+            to: text(relationship.to),
+        }));
+        const properties = isRecord(step.properties) ? step.properties : {};
+        if (Object.keys(properties).length === 0) {
+            return {
+                entity: { id: text(step.id), type: text(step.type) },
+                relationships,
+                skipContradictionCheck: true,
+                relationshipsOnly: true,
+            };
+        }
+        const validated = validateUpsertInput({
+            type: text(step.type),
+            id: text(step.id),
+            properties,
+            relationships,
+        }, now);
+        return {
+            entity: validated.entity,
+            relationships: validated.relationships,
+            skipContradictionCheck: true,
+        };
+    }));
+}
+function whatIfWitness(witness) {
+    return {
+        ...witness,
+        requirements: Array.isArray(witness.requirements)
+            ? witness.requirements.map((id) => normalizeEntityId(String(id)))
+            : [],
+        reason: text(witness.reason),
+        status: text(witness.status) || "contradiction",
+        ...(typeof witness.kind === "string" ? { kind: witness.kind } : {}),
+    };
+}
+function whatIfWitnesses(value) {
+    return (Array.isArray(value) ? value.filter(isRecord) : []).map(whatIfWitness);
+}
+// implements REQ-kibi-truthful-consistency
+/**
+ * Parse checks:what_if_analysis_json/2 output. The binding is a quoted Prolog
+ * string, so the JSON may arrive encoded once more as a JSON string. A bare
+ * witness array (the what_if_contradiction_witnesses_json/2 shape) carries no
+ * current-KB baseline, so every witness in it is treated as introduced.
+ * Returns null when the output cannot be read.
+ */
+export function parseWhatIfAnalysis(raw) {
+    if (typeof raw !== "string")
+        return null;
+    let parsed;
     try {
-        before = await context.fs.readFile(absolute);
+        parsed = JSON.parse(raw);
+        if (typeof parsed === "string")
+            parsed = JSON.parse(parsed);
     }
     catch {
-        before = undefined;
+        return null;
     }
-    const frontmatter = `---\n${dumpYaml({ id: requirementId, title, type: "req", status: "open" }, { noRefs: true, lineWidth: -1 })}---\n`;
-    const body = `${frontmatter}${intent.trim()}\n`;
-    return [
-        {
-            path: relative,
-            mode: "write",
-            beforeHash: before === undefined
-                ? null
-                : createHash("sha256").update(before).digest("hex"),
-            afterHash: createHash("sha256").update(body).digest("hex"),
-            body,
-        },
-    ];
+    if (Array.isArray(parsed)) {
+        const after = whatIfWitnesses(parsed);
+        return { after, introduced: after, removed: [], unchanged: [] };
+    }
+    if (!isRecord(parsed))
+        return null;
+    return {
+        after: whatIfWitnesses(parsed.after),
+        introduced: whatIfWitnesses(parsed.introduced),
+        removed: whatIfWitnesses(parsed.removed),
+        unchanged: whatIfWitnesses(parsed.unchanged),
+    };
 }
-function generatedRequirementId(intent) {
-    return `REQ-${slug(intent)}-${shortHash(intent).toUpperCase()}`;
+// implements REQ-kibi-truthful-consistency
+/** Blocking: a proven contradiction or an infeasible success scenario. */
+export function isBlockingWitness(witness) {
+    return witness.status === "contradiction" || witness.status === "infeasible";
 }
-async function contradictionAnalysis(prolog, requirementId) {
-    const result = await prolog.query("findall([A,B,Reason], contradicting_reqs(A, B, Reason), Rows)");
+// implements REQ-kibi-truthful-consistency
+// Check the KB as it would be after this plan, not the KB as it is: stage every
+// planned step in a rolled-back transaction and compare its contradiction and
+// scenario-feasibility witnesses with the current KB's. Any witness the plan
+// introduces counts, whichever requirements it names; a staged witness that
+// already existed counts only when it names the target requirement. Rule
+// overlap the checker can neither prove nor exclude stays unresolved rather
+// than becoming consistency.
+async function contradictionAnalysis(prolog, requirementId, steps, now) {
+    const unavailable = {
+        outcome: "unresolved",
+        witnesses: [],
+        introduced: [],
+        removed: [],
+        unchanged: [],
+    };
+    let goal;
+    try {
+        goal = planWhatIfGoal(steps, now);
+    }
+    catch {
+        return unavailable;
+    }
+    const result = await prolog.query(goal);
     if (!result.success)
-        return { outcome: "unresolved", witnesses: [] };
-    const rows = parseTriples(result.bindings.Rows ?? "[]");
-    const witnesses = rows
-        .map(([left, right, reason]) => ({
-        left: normalizeEntityId(left),
-        right: normalizeEntityId(right),
-        reason,
-    }))
-        .filter(({ left, right }) => left === requirementId || right === requirementId)
-        .map(({ left, right, reason }) => ({
-        requirements: [left, right],
-        reason,
-    }));
+        return unavailable;
+    const analysis = parseWhatIfAnalysis(result.bindings.JsonString);
+    if (analysis === null)
+        return unavailable;
+    const witnesses = [
+        ...analysis.introduced,
+        ...analysis.unchanged.filter((witness) => witness.requirements.includes(requirementId)),
+    ];
+    const outcome = witnesses.some(isBlockingWitness)
+        ? "conflict"
+        : witnesses.length > 0
+            ? "unresolved"
+            : "no_conflict";
     return {
-        outcome: witnesses.length > 0 ? "conflict" : "no_conflict",
+        outcome,
         witnesses,
+        introduced: analysis.introduced,
+        removed: analysis.removed,
+        unchanged: analysis.unchanged,
     };
 }
 function proposalFor(requirementId, match) {
@@ -291,11 +465,16 @@ function applyAcceptedProposals(steps, proposals) {
 function draftId(prefix, title, index) {
     return `${prefix}-${slug(title)}-${shortHash(`${title}\0${index}`).toUpperCase()}`;
 }
-// implements REQ-kibi-change-to-proof-plan-compiler
+// implements REQ-kibi-change-to-proof-plan-compiler-v2
 function draftSteps(requirementId, scenarios, tests) {
     const diagnostics = [];
     const steps = [];
+    const testSteps = [];
     const scenarioIds = [];
+    // verified_by runs scenario -> test, and an upsert step may only carry
+    // relationships from its own entity, so each scenario step carries the
+    // links to its tests and the tests are written before it.
+    const scenarioTests = new Map();
     const linkedScenarioIds = new Set();
     const duplicateScenarioIds = new Set();
     const testIds = new Set();
@@ -306,15 +485,18 @@ function draftSteps(requirementId, scenarios, tests) {
             diagnostics.push(`unresolved duplicate scenario draft ID ${id}; scenario associations are ambiguous.`);
         }
         scenarioIds.push(id);
+        // The draft prose is document body, not an entity property: the entity
+        // schema has no `body`, so carrying it in properties made every staged
+        // what-if check and every apply of a plan with drafts fail validation.
         steps.push({
             type: "scenario",
             id,
             properties: {
                 title: scenario.title.trim(),
                 status: "draft",
-                body: scenario.body.trim(),
                 source: "mcp://kibi/compile-intent",
             },
+            document: { body: scenario.body.trim() },
             relationships: [],
         });
     });
@@ -354,26 +536,36 @@ function draftSteps(requirementId, scenarios, tests) {
                 diagnostics.push(`unresolved test draft ${id} references unknown scenario ID ${scenarioId}.`);
             }
         }
-        for (const scenarioId of validScenarioIds)
+        for (const scenarioId of validScenarioIds) {
             linkedScenarioIds.add(scenarioId);
-        steps.push({
+            scenarioTests.set(scenarioId, [
+                ...(scenarioTests.get(scenarioId) ?? []),
+                id,
+            ]);
+        }
+        testSteps.push({
             type: "test",
             id,
             properties: {
                 title: test.title.trim(),
                 status: "draft",
-                body: test.body.trim(),
                 source: "mcp://kibi/compile-intent",
                 verification_scope: test.verificationScope ?? "integration",
                 verification_perspective: test.verificationPerspective ?? "internal",
             },
-            relationships: validScenarioIds.map((scenarioId) => ({
-                type: "verified_by",
-                from: scenarioId,
-                to: id,
-            })),
+            document: { body: test.body.trim() },
+            relationships: [],
         });
     });
+    const scenarioSteps = steps.map((step) => ({
+        ...step,
+        relationships: (scenarioTests.get(text(step.id)) ?? []).map((to) => ({
+            type: "verified_by",
+            from: text(step.id),
+            to,
+        })),
+    }));
+    steps.splice(0, steps.length, ...testSteps, ...scenarioSteps);
     for (const scenarioId of scenarioIds) {
         if (!linkedScenarioIds.has(scenarioId)) {
             diagnostics.push(`unresolved scenario draft ${scenarioId} has no test draft; add a test with scenarioIds to establish executable coverage.`);
@@ -393,7 +585,7 @@ function draftSteps(requirementId, scenarios, tests) {
     }
     return { steps, diagnostics };
 }
-// implements REQ-kibi-change-to-proof-plan-compiler
+// implements REQ-kibi-change-to-proof-plan-compiler-v2
 export async function executeCompileIntent(args, context) {
     const intent = requiredIntent(args);
     const prolog = context.prolog;
@@ -471,9 +663,9 @@ export async function executeCompileIntent(args, context) {
         text(existingEntity.title) ||
         intent.split(/[.!?]/, 1)[0] ||
         intent;
-    const source = text(args.sourceLocations?.[0]?.path) ||
-        text(existingEntity.source) ||
-        "mcp://kibi/compile-intent";
+    const requirementDocument = requirementDocumentPath(args.sourceLocations);
+    const source = requirementDocument ??
+        (text(existingEntity.source) || "mcp://kibi/compile-intent");
     const orchestrated = await analyzeSemanticAdvisorInputWithPlugins({
         payload: {
             type: "req",
@@ -594,6 +786,7 @@ export async function executeCompileIntent(args, context) {
                 : []),
         ]),
     ]);
+    const stepsWithInventory = withRequirementInventory(steps, requirementId, advisor.receipt, propositions);
     const drafts = draftSteps(requirementId, args.scenarioDrafts ?? [], args.testDrafts ?? []);
     diagnostics.push(...drafts.diagnostics);
     const proposalDecisions = new Map((args.proposalDecisions ?? []).map((decision) => [
@@ -616,12 +809,19 @@ export async function executeCompileIntent(args, context) {
             },
         ];
     });
-    const stepsWithAcceptedProposals = applyAcceptedProposals([...steps, ...drafts.steps], proposals);
-    const contradictions = await contradictionAnalysis(prolog, requirementId);
+    // Merging folds the drafts' relationship-only requirement step (its
+    // specified_by links) into the requirement step, which an upsert needs:
+    // a step without properties fails entity validation.
+    const stepsWithAcceptedProposals = applyAcceptedProposals(mergeSteps([...stepsWithInventory, ...drafts.steps]), proposals);
+    const contradictions = await contradictionAnalysis(prolog, requirementId, stepsWithAcceptedProposals, context.clock());
     if (contradictions.outcome === "conflict")
-        diagnostics.push("Current requirement conflicts must be resolved with an explicit supersedes relationship before applying this plan.");
+        diagnostics.push(contradictions.witnesses.some((witness) => witness.kind === "scenario_feasibility")
+            ? "The plan leaves a success scenario infeasible or conflicts with a current requirement: set expects: rejection, correct the assumption, record an approved exception, or supersede the conflicting requirement before applying this plan."
+            : "Current requirement conflicts must be resolved with an explicit supersedes relationship before applying this plan.");
     if (contradictions.outcome === "unresolved")
-        diagnostics.push("Contradiction analysis could not run against the attached KB snapshot.");
+        diagnostics.push(contradictions.witnesses.length > 0
+            ? "Contradiction analysis is unresolved: the planned rules may overlap with current requirements and the checker can neither prove nor exclude a conflict."
+            : "Contradiction analysis could not run against the attached KB snapshot with this plan staged.");
     if (args.mode === "create" &&
         existing.length > 0 &&
         diagnostics.some((entry) => entry.includes("already exists with different content")))
@@ -631,15 +831,31 @@ export async function executeCompileIntent(args, context) {
         diagnostics.some((entry) => entry.includes("unresolved") ||
             entry.includes("not found") ||
             entry.includes("different content"));
-    const statusValue = contradictions.outcome === "conflict"
+    let statusValue = contradictions.outcome === "conflict"
         ? "blocked"
         : unresolved
             ? "needs_resolution"
             : "ready";
     const sourceHashMap = await sourceHashes(context, args.sourceLocations);
-    const sourceWrites = statusValue === "ready"
-        ? await sourceWritePlan(context, requirementId, title, intent, args.sourceLocations, source, existing.length > 0)
-        : [];
+    // Only a ready plan can be applied, so only a ready plan carries documents.
+    // A step whose entity or document cannot be rendered would fail the apply,
+    // so it makes the plan need resolution instead of reporting it ready.
+    let planSteps = stepsWithAcceptedProposals;
+    if (statusValue === "ready") {
+        try {
+            planSteps = await withDocumentTargets(context, prolog, stepsWithAcceptedProposals, {
+                id: requirementId,
+                body: `${intent.trim()}\n`,
+                ...(requirementDocument !== undefined
+                    ? { path: requirementDocument }
+                    : {}),
+            }, context.clock());
+        }
+        catch (error) {
+            statusValue = "needs_resolution";
+            diagnostics.push(`A plan step cannot be applied as written: ${error instanceof Error ? error.message : String(error)}`);
+        }
+    }
     const planBody = {
         version: COMPILE_PLAN_VERSION,
         status: statusValue,
@@ -657,8 +873,8 @@ export async function executeCompileIntent(args, context) {
         propositions,
         contradictionAnalysis: contradictions,
         proposals,
-        steps: stepsWithAcceptedProposals,
-        sourceWrites,
+        steps: planSteps,
+        sourceWrites: [],
         diagnostics,
     };
     // Shadow/provenance metadata is returned for observation but must not enter
@@ -672,7 +888,7 @@ export async function executeCompileIntent(args, context) {
         content: [
             {
                 type: "text",
-                text: `Compiled ${intent.length} characters into ${statusValue} plan ${plan.planHash.slice(0, 12)} with ${stepsWithAcceptedProposals.length} step(s).`,
+                text: `Compiled ${intent.length} characters into ${statusValue} plan ${plan.planHash.slice(0, 12)} with ${planSteps.length} step(s).`,
             },
         ],
         structuredContent: plan,