@cavelang/solver 0.35.0 → 0.36.0

package/dist/src/explain.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"explain.d.ts","sourceRoot":"","sources":["../../src/explain.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAkB,MAAM,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAEtG,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,EAEV,WAAW,EAGX,KAAK,EAKL,KAAK,EAEN,MAAM,YAAY,CAAA;AAEnB,eAAO,MAAM,MAAM,EAAG,2BAAoC,CAAA;AAI1D,MAAM,MAAM,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,IAAI,EAAE,GAAG;IAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAA;CAAE,CAAA;AAEpH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,eAAe,EAAE,MAAM,GAAG,IAAI,CAAA;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IACtC,QAAQ,CAAC,UAAU,CAAC,EAAE,YAAY,GAAG,QAAQ,CAAA;IAC7C,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAA;CACpC,CAAA;AAED,MAAM,MAAM,KAAK,GAAG;IAClB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAA;IACrB,QAAQ,CAAC,aAAa,CAAC,EAAE,IAAI,CAAA;IAC7B,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAA;IAC1C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAA;CAC7C,CAAA;AAED,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;CAC/B,CAAA;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,wEAAwE;IACxE,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,KAAK,EAAE,CAAA;CACnC,CAAA;AAED,MAAM,MAAM,GAAG,GAAG;IAChB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAA;IAC3C,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAA;CAClC,CAAA;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAA;IAClC,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAA;IAC1C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAA;CAC7C,CAAA;AAED,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG;IACtC,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG;IACjC,QAAQ,CAAC,UAAU,EAAE,WAAW,GAAG,UAAU,GAAG,eAAe,CAAA;CAChE,CAAA;AAED,MAAM,MAAM,oBAAoB,GAAG,OAAO,GAAG;IAC3C,QAAQ,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,GAAG,eAAe,CAAA;IAC9D,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAA;CACnD,CAAA;AAED,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG;IACtC,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,SAAS,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS,CAAA;IACvD,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;IACrB,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAA;CACvB,CAAA;AAED,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;CAC3B,CAAA;AAED,KAAK,QAAQ,GAAG;IACd,QAAQ,CAAC,WAAW,EAAE,SAAS,eAAe,EAAE,CAAA;IAChD,QAAQ,CAAC,eAAe,EAAE,SAAS,UAAU,EAAE,CAAA;IAC/C,QAAQ,CAAC,eAAe,EAAE,SAAS,oBAAoB,EAAE,CAAA;CAC1D,CAAA;AAED,MAAM,MAAM,OAAO,GACf,CAAC;IAAE,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAA;CAAE,GAAG,QAAQ,CAAC,GAC7C,CAAC;IACD,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAA;IAC1B,QAAQ,CAAC,UAAU,EAAE,SAAS,eAAe,EAAE,CAAA;IAC/C,QAAQ,CAAC,gBAAgB,EAAE,IAAI,CAAA;CAChC,GAAG,QAAQ,CAAC,GACX;IACA,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;IAC9B,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,cAAc,EAAE,CAAA;IACzC,4EAA4E;IAC5E,QAAQ,CAAC,WAAW,EAAE,KAAK,CAAA;IAC3B,QAAQ,CAAC,mBAAmB,EAAE,IAAI,CAAA;CACnC,GACC;IAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;CAAE,CAAA;AAElE,MAAM,MAAM,MAAM,GAAG;IACnB,QAAQ,CAAC,MAAM,EAAE,OAAO,MAAM,CAAA;IAC9B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAA;IACjB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;CAC1B,CAAA;AA6LD,kFAAkF;AAClF,eAAO,MAAM,MAAM,GAAI,OAAO,KAAK,EAAE,QAAQ,MAAM,EAAE,QAAQ,MAAM,EAAE,UAAS,OAAY,KAAG,MAmB5F,CAAA;AAoBD,mEAAmE;AACnE,eAAO,MAAM,MAAM,GAAI,OAAO,MAAM,KAAG,MA2CtC,CAAA"}
+{"version":3,"file":"explain.d.ts","sourceRoot":"","sources":["../../src/explain.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAkB,MAAM,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAEtG,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,EAEV,WAAW,EAGX,KAAK,EAKL,KAAK,EAEN,MAAM,YAAY,CAAA;AAEnB,eAAO,MAAM,MAAM,EAAG,2BAAoC,CAAA;AAI1D,MAAM,MAAM,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,IAAI,EAAE,GAAG;IAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAA;CAAE,CAAA;AAEpH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,eAAe,EAAE,MAAM,GAAG,IAAI,CAAA;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IACtC,QAAQ,CAAC,UAAU,CAAC,EAAE,YAAY,GAAG,QAAQ,CAAA;IAC7C,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAA;CACpC,CAAA;AAED,MAAM,MAAM,KAAK,GAAG;IAClB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAA;IACrB,QAAQ,CAAC,aAAa,CAAC,EAAE,IAAI,CAAA;IAC7B,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAA;IAC1C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAA;CAC7C,CAAA;AAED,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;CAC/B,CAAA;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,wEAAwE;IACxE,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,KAAK,EAAE,CAAA;CACnC,CAAA;AAED,MAAM,MAAM,GAAG,GAAG;IAChB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAA;IAC3C,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAA;CAClC,CAAA;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAA;IAClC,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAA;IAC1C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAA;CAC7C,CAAA;AAED,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG;IACtC,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG;IACjC,QAAQ,CAAC,UAAU,EAAE,WAAW,GAAG,UAAU,GAAG,eAAe,CAAA;IAC/D,mFAAmF;IACnF,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAA;CACnC,CAAA;AAED,MAAM,MAAM,oBAAoB,GAAG,OAAO,GAAG;IAC3C,QAAQ,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,GAAG,eAAe,CAAA;IAC9D,mFAAmF;IACnF,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAA;IAClC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAA;CACnD,CAAA;AAED,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG;IACtC,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,SAAS,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS,CAAA;IACvD,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;IACrB,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAA;CACvB,CAAA;AAED,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;CAC3B,CAAA;AAED,KAAK,QAAQ,GAAG;IACd,QAAQ,CAAC,WAAW,EAAE,SAAS,eAAe,EAAE,CAAA;IAChD,QAAQ,CAAC,eAAe,EAAE,SAAS,UAAU,EAAE,CAAA;IAC/C,QAAQ,CAAC,eAAe,EAAE,SAAS,oBAAoB,EAAE,CAAA;CAC1D,CAAA;AAED,MAAM,MAAM,OAAO,GACf,CAAC;IAAE,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAA;CAAE,GAAG,QAAQ,CAAC,GAC7C,CAAC;IACD,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAA;IAC1B,QAAQ,CAAC,UAAU,EAAE,SAAS,eAAe,EAAE,CAAA;IAC/C,QAAQ,CAAC,gBAAgB,EAAE,IAAI,CAAA;CAChC,GAAG,QAAQ,CAAC,GACX;IACA,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;IAC9B,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,cAAc,EAAE,CAAA;IACzC,4EAA4E;IAC5E,QAAQ,CAAC,WAAW,EAAE,KAAK,CAAA;IAC3B,QAAQ,CAAC,mBAAmB,EAAE,IAAI,CAAA;CACnC,GACC;IAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;CAAE,CAAA;AAElE,MAAM,MAAM,MAAM,GAAG;IACnB,QAAQ,CAAC,MAAM,EAAE,OAAO,MAAM,CAAA;IAC9B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAA;IACjB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;CAC1B,CAAA;AAuXD,kFAAkF;AAClF,eAAO,MAAM,MAAM,GAAI,OAAO,KAAK,EAAE,QAAQ,MAAM,EAAE,QAAQ,MAAM,EAAE,UAAS,OAAY,KAAG,MA+B5F,CAAA;AA4CD,mEAAmE;AACnE,eAAO,MAAM,MAAM,GAAI,OAAO,MAAM,KAAG,MAsDtC,CAAA"}

package/dist/src/explain.js

@@ -1,14 +1,30 @@
-import * as Canonical from "./canonical.js";
+import { ExplanationBudget } from "./explanation-budget.js";
+import { expressionKey } from "./expression-key.js";
+import { constantSign } from "./constant-sign.js";
+import { captureResult } from "./result.js";
+import { balancedReduce } from "./balanced-reduce.js";
+import { sum } from "./fraction-sum.js";
+import { product } from "./fraction-product.js";
+import { gcd } from "./integer-gcd.js";
+import { clone } from "./clone.js";
+import { stringifyInput, validateContext } from "./context.js";
+import { mergeLimits } from "./validate.js";
+import { digestOwned } from "./canonical-owned.js";
 import * as Exact from "./exact.js";
 export const schema = 'cave.solver/explanation@1';
 const compareText = (left, right) => left < right ? -1 : left > right ? 1 : 0;
 const normalize = (numerator, denominator) => {
     if (denominator === 0n)
         throw new TypeError('cannot explain division by zero');
-    const exact = Exact.rational({ numerator: String(numerator), denominator: String(denominator) });
-    return { kind: 'number', numerator: BigInt(exact.numerator), denominator: BigInt(exact.denominator) };
+    if (denominator < 0n) {
+        numerator = -numerator;
+        denominator = -denominator;
+    }
+    const divisor = gcd(numerator, denominator);
+    return { kind: 'number', numerator: numerator / divisor, denominator: denominator / divisor };
 };
-const number = (value) => {
+const number = (value, budget) => {
+    budget.input(value);
     const exact = Exact.rational(value);
     return { kind: 'number', numerator: BigInt(exact.numerator), denominator: BigInt(exact.denominator) };
 };
@@ -22,15 +38,59 @@ const bool = (value) => {
         throw new TypeError(`expected a Boolean explanation value, received ${value.kind}`);
     return value.value;
 };
-const add = (left, right) => normalize(left.numerator * right.denominator + right.numerator * left.denominator, left.denominator * right.denominator);
-const multiply = (left, right) => normalize(left.numerator * right.numerator, left.denominator * right.denominator);
-const compare = (left, right) => {
-    const difference = left.numerator * right.denominator - right.numerator * left.denominator;
-    return difference < 0n ? -1 : difference > 0n ? 1 : 0;
+const add = (left, right, budget) => {
+    if (left.numerator === 0n)
+        return right;
+    if (right.numerator === 0n)
+        return left;
+    if (left.denominator === right.denominator) {
+        budget.check(budget.sum(left.numerator, right.numerator), budget.bits(left.denominator));
+    }
+    else {
+        budget.check(Math.max(budget.product(left.numerator, right.denominator), budget.product(right.numerator, left.denominator)) + 1, budget.product(left.denominator, right.denominator));
+    }
+    // Adding an integer preserves gcd(numerator, denominator) = 1.
+    if (left.denominator === 1n)
+        return { kind: 'number',
+            numerator: left.numerator * right.denominator + right.numerator, denominator: right.denominator };
+    if (right.denominator === 1n)
+        return { kind: 'number',
+            numerator: left.numerator + right.numerator * left.denominator, denominator: left.denominator };
+    return normalize(...sum(left.numerator, left.denominator, right.numerator, right.denominator));
+};
+const multiply = (left, right, budget) => {
+    budget.check(budget.product(left.numerator, right.numerator), budget.product(left.denominator, right.denominator));
+    // Evaluation values are reduced with positive denominators. Squaring preserves
+    // coprimality; otherwise cross-cancellation leaves a reduced product directly.
+    const [numerator, denominator] = left.numerator === right.numerator && left.denominator === right.denominator
+        ? [left.numerator * right.numerator, left.denominator * right.denominator]
+        : product(left.numerator, left.denominator, right.numerator, right.denominator);
+    return { kind: 'number', numerator, denominator };
+};
+const negate = (value) => ({ kind: 'number', numerator: -value.numerator, denominator: value.denominator });
+const compare = (left, right, budget) => {
+    // Evaluation values are normalized, so both denominators are positive.
+    if (left.denominator === right.denominator || left.numerator === 0n || right.numerator === 0n ||
+        (left.numerator < 0n) !== (right.numerator < 0n)) {
+        return left.numerator < right.numerator ? -1 : left.numerator > right.numerator ? 1 : 0;
+    }
+    if (left.numerator === right.numerator) {
+        return (left.denominator < right.denominator) === (left.numerator > 0n) ? 1 : -1;
+    }
+    if ((left.numerator < right.numerator) ===
+        (left.numerator > 0n ? left.denominator > right.denominator : left.denominator < right.denominator)) {
+        return left.numerator < right.numerator ? -1 : 1;
+    }
+    budget.check(budget.product(left.numerator, right.denominator), budget.product(right.numerator, left.denominator));
+    const a = left.numerator * right.denominator;
+    const b = right.numerator * left.denominator;
+    return a < b ? -1 : a > b ? 1 : 0;
 };
 const equal = (left, right) => {
-    if (left.kind === 'number' && right.kind === 'number')
-        return compare(left, right) === 0;
+    if (left.kind === 'number' && right.kind === 'number') {
+        // Every evaluated number is reduced with a positive denominator.
+        return left.numerator === right.numerator && left.denominator === right.denominator;
+    }
     if (left.kind !== right.kind)
         return false;
     if (left.kind === 'bool' && right.kind === 'bool')
@@ -39,57 +99,163 @@ const equal = (left, right) => {
         return left.domain === right.domain && left.value === right.value;
     return false;
 };
-const assigned = (value) => {
+const assigned = (value, budget) => {
     switch (value.sort) {
-        case 'bool': return { kind: 'bool', value: value.value };
-        case 'int': return number({ numerator: value.value, denominator: '1' });
-        case 'real': return number({ numerator: value.numerator, denominator: value.denominator });
-        case 'enum': return { kind: 'enum', domain: value.domain, value: value.value };
+        case 'bool':
+            if (typeof value.value !== 'boolean')
+                throw new TypeError('boolean assignment value must be a boolean');
+            return { kind: 'bool', value: value.value };
+        case 'int': return number({ numerator: value.value, denominator: '1' }, budget);
+        case 'real': return number({ numerator: value.numerator, denominator: value.denominator }, budget);
+        case 'enum':
+            if (typeof value.domain !== 'string' || typeof value.value !== 'string')
+                throw new TypeError('enum assignment domain and value must be strings');
+            return { kind: 'enum', domain: value.domain, value: value.value };
     }
 };
-const evaluate = (expression, assignment) => {
-    const run = (value) => evaluate(value, assignment);
+/** A captured assignment has one validation result for the whole report. */
+const evaluateAssignment = (id, context) => {
+    const cached = context.assigned.get(id);
+    if (cached !== undefined) {
+        if ('error' in cached)
+            throw cached.error;
+        return cached.value;
+    }
+    try {
+        const value = context.assignment[id];
+        if (value === undefined)
+            throw new TypeError(`assignment omits ${JSON.stringify(id)}`);
+        const evaluated = assigned(value, context.budget);
+        const variable = context.variables.get(id);
+        const kind = variable.sort === 'int' || variable.sort === 'real' ? 'number' : variable.sort;
+        if (evaluated.kind !== kind)
+            throw new TypeError('assignment kind must match the declared variable');
+        if (variable.sort === 'int' && evaluated.kind === 'number' && evaluated.denominator !== 1n) {
+            throw new TypeError('integer variable assignment must be integral');
+        }
+        if (evaluated.kind === 'number' && (variable.sort === 'int' || variable.sort === 'real')) {
+            const min = variable.min === undefined ? undefined : variable.sort === 'int'
+                ? number({ numerator: variable.min, denominator: '1' }, context.budget) : number(variable.min, context.budget);
+            const max = variable.max === undefined ? undefined : variable.sort === 'int'
+                ? number({ numerator: variable.max, denominator: '1' }, context.budget) : number(variable.max, context.budget);
+            if ((min !== undefined && compare(evaluated, min, context.budget) < 0) || (max !== undefined && compare(evaluated, max, context.budget) > 0)) {
+                throw new TypeError('numeric assignment must lie within the declared bounds');
+            }
+        }
+        if (variable.sort === 'enum' && (evaluated.kind !== 'enum' || evaluated.domain !== variable.domain || !context.enumDomains.get(variable.domain).has(evaluated.value))) {
+            throw new TypeError('enum assignment must belong to the declared domain');
+        }
+        context.assigned.set(id, { value: evaluated });
+        return evaluated;
+    }
+    catch (error) {
+        context.assigned.set(id, { error });
+        throw error;
+    }
+};
+function* evaluateNode(expression, context) {
+    const signOf = (value) => constantSign(value, context.signs, literal => {
+        if (literal.kind !== 'literal' || (literal.sort !== 'int' && literal.sort !== 'real'))
+            throw new TypeError('expected a numeric literal');
+        const input = literal.sort === 'int' ? { numerator: literal.value, denominator: '1' } : literal.value;
+        context.budget.input(input);
+        return Exact.rational(input);
+    });
+    if (expression.kind === 'eq' || expression.kind === 'neq' || expression.kind === 'lt' ||
+        expression.kind === 'lte' || expression.kind === 'gt' || expression.kind === 'gte') {
+        const zero = (value) => value.kind === 'literal' &&
+            (value.sort === 'int' || value.sort === 'real') && signOf(value) === 0;
+        // A proof reads only captured constants. Unknown signs (including undefined
+        // arithmetic or any variable) retain ordinary assignment/error evaluation.
+        const sign = zero(expression.right) ? signOf(expression.left)
+            : zero(expression.left) ? signOf(expression.right) : undefined;
+        if (sign !== undefined) {
+            const order = zero(expression.right) ? sign : -sign;
+            return { kind: 'bool', value: expression.kind === 'eq' ? order === 0
+                    : expression.kind === 'neq' ? order !== 0 : expression.kind === 'lt' ? order < 0
+                        : expression.kind === 'lte' ? order <= 0 : expression.kind === 'gt' ? order > 0 : order >= 0 };
+        }
+    }
     switch (expression.kind) {
         case 'literal':
             switch (expression.sort) {
                 case 'bool': return { kind: 'bool', value: expression.value };
-                case 'int': return number({ numerator: String(Exact.integer(expression.value)), denominator: '1' });
-                case 'real': return number(expression.value);
+                case 'int': return number({ numerator: expression.value, denominator: '1' }, context.budget);
+                case 'real': return number(expression.value, context.budget);
                 case 'enum': return { kind: 'enum', domain: expression.domain, value: expression.value };
             }
-        case 'variable': {
-            const value = assignment[expression.id];
-            if (value === undefined)
-                throw new TypeError(`assignment omits ${JSON.stringify(expression.id)}`);
-            return assigned(value);
+        case 'variable': return evaluateAssignment(expression.id, context);
+        case 'not': return { kind: 'bool', value: !bool((yield expression.value)) };
+        case 'and':
+            for (const value of expression.operands)
+                if (!bool(yield value))
+                    return { kind: 'bool', value: false };
+            return { kind: 'bool', value: true };
+        case 'or':
+            for (const value of expression.operands)
+                if (bool(yield value))
+                    return { kind: 'bool', value: true };
+            return { kind: 'bool', value: false };
+        case 'implies': return { kind: 'bool', value: !bool((yield expression.left)) || bool((yield expression.right)) };
+        case 'eq': return { kind: 'bool', value: equal((yield expression.left), (yield expression.right)) };
+        case 'neq': return { kind: 'bool', value: !equal((yield expression.left), (yield expression.right)) };
+        case 'lt': return { kind: 'bool', value: compare(numeric((yield expression.left)), numeric((yield expression.right)), context.budget) < 0 };
+        case 'lte': return { kind: 'bool', value: compare(numeric((yield expression.left)), numeric((yield expression.right)), context.budget) <= 0 };
+        case 'gt': return { kind: 'bool', value: compare(numeric((yield expression.left)), numeric((yield expression.right)), context.budget) > 0 };
+        case 'gte': return { kind: 'bool', value: compare(numeric((yield expression.left)), numeric((yield expression.right)), context.budget) >= 0 };
+        case 'add':
+        case 'multiply': {
+            const values = [];
+            for (const value of expression.operands)
+                values.push(yield value);
+            const numbers = values.map(numeric);
+            // Evaluate and type-check every operand before applying the zero identity:
+            // zero must not hide undefined arithmetic in another operand.
+            if (expression.kind === 'multiply' && numbers.some(value => value.numerator === 0n)) {
+                return normalize(0n, 1n);
+            }
+            return balancedReduce(numbers, (left, right) => expression.kind === 'add'
+                ? add(left, right, context.budget) : multiply(left, right, context.budget));
         }
-        case 'not': return { kind: 'bool', value: !bool(run(expression.value)) };
-        case 'and': return { kind: 'bool', value: expression.operands.every(value => bool(run(value))) };
-        case 'or': return { kind: 'bool', value: expression.operands.some(value => bool(run(value))) };
-        case 'implies': return { kind: 'bool', value: !bool(run(expression.left)) || bool(run(expression.right)) };
-        case 'eq': return { kind: 'bool', value: equal(run(expression.left), run(expression.right)) };
-        case 'neq': return { kind: 'bool', value: !equal(run(expression.left), run(expression.right)) };
-        case 'lt': return { kind: 'bool', value: compare(numeric(run(expression.left)), numeric(run(expression.right))) < 0 };
-        case 'lte': return { kind: 'bool', value: compare(numeric(run(expression.left)), numeric(run(expression.right))) <= 0 };
-        case 'gt': return { kind: 'bool', value: compare(numeric(run(expression.left)), numeric(run(expression.right))) > 0 };
-        case 'gte': return { kind: 'bool', value: compare(numeric(run(expression.left)), numeric(run(expression.right))) >= 0 };
-        case 'add': return expression.operands.map(run).map(numeric).reduce(add);
-        case 'multiply': return expression.operands.map(run).map(numeric).reduce(multiply);
         case 'subtract': {
-            const left = numeric(run(expression.left));
-            const right = numeric(run(expression.right));
-            return add(left, normalize(-right.numerator, right.denominator));
+            const left = numeric((yield expression.left));
+            const right = numeric((yield expression.right));
+            return add(left, negate(right), context.budget);
         }
         case 'divide': {
-            const left = numeric(run(expression.left));
-            const right = numeric(run(expression.right));
-            return normalize(left.numerator * right.denominator, left.denominator * right.numerator);
+            const left = numeric((yield expression.left));
+            const right = numeric((yield expression.right));
+            if (right.numerator === 0n)
+                throw new TypeError('cannot explain division by zero');
+            context.budget.check(context.budget.product(left.numerator, right.denominator), context.budget.product(left.denominator, right.numerator));
+            // Cross-cancellation preserves reduction; only denominator sign can change.
+            const [numerator, denominator] = product(left.numerator, left.denominator, right.denominator, right.numerator);
+            return denominator < 0n
+                ? { kind: 'number', numerator: -numerator, denominator: -denominator }
+                : { kind: 'number', numerator, denominator };
         }
         case 'negate': {
-            const value = numeric(run(expression.value));
-            return normalize(-value.numerator, value.denominator);
+            const value = numeric((yield expression.value));
+            return negate(value);
+        }
+        case 'if': return bool((yield expression.condition)) ? (yield expression.then) : (yield expression.else);
+    }
+}
+const evaluate = (expression, context) => {
+    const stack = [evaluateNode(expression, context)];
+    let step = stack[0].next();
+    while (true) {
+        if (step.done) {
+            stack.pop();
+            if (stack.length === 0)
+                return step.value;
+            step = stack[stack.length - 1].next(step.value);
+        }
+        else {
+            const child = evaluateNode(step.value, context);
+            stack.push(child);
+            step = child.next();
         }
-        case 'if': return bool(run(expression.condition)) ? run(expression.then) : run(expression.else);
     }
 };
 const sorted = (values) => [...new Set(values ?? [])].sort();
@@ -100,26 +266,45 @@ const element = (value) => ({
     evidenceRowIds: sorted(value.evidenceRowIds),
     scenarioInputIds: sorted(value.scenarioInputIds)
 });
-const constraint = (value, assignment) => {
-    let evaluation = 'indeterminate';
+const evaluation = (expression, context) => {
+    const repeated = context.expressionResults.get(expression);
+    if (repeated !== undefined)
+        return repeated;
+    const key = expressionKey(expression, context.expressionStrings);
+    const cached = context.evaluations.get(key);
+    if (cached !== undefined) {
+        context.expressionResults.set(expression, cached);
+        return cached;
+    }
+    let result;
     try {
-        evaluation = bool(evaluate(value.expression, assignment)) ? 'satisfied' : 'violated';
+        result = { value: bool(evaluate(expression, context)) };
+    }
+    catch (error) {
+        // Local arithmetic/assignment failure does not reclassify the backend result.
+        result = { evaluationReason: error instanceof Error ? error.message : 'constraint evaluation failed' };
     }
-    catch { /* Keep the solver result usable when a backend uses totalized arithmetic. */ }
-    return { ...element(value), evaluation };
+    context.evaluations.set(key, result);
+    context.expressionResults.set(expression, result);
+    return result;
+};
+const constraint = (value, context) => {
+    const result = evaluation(value.expression, context);
+    return {
+        ...element(value),
+        evaluation: result.value === undefined ? 'indeterminate' : result.value ? 'satisfied' : 'violated',
+        ...(result.evaluationReason === undefined ? {} : { evaluationReason: result.evaluationReason })
+    };
+};
+const softConstraint = (value, context) => {
+    const result = evaluation(value.expression, context);
+    return {
+        ...element(value),
+        evaluation: result.value === undefined ? 'indeterminate' : result.value ? 'accepted' : 'violated',
+        ...(result.evaluationReason === undefined ? {} : { evaluationReason: result.evaluationReason }),
+        weight: Exact.rational(value.weight)
+    };
 };
-const softConstraint = (value, assignment) => ({
-    ...element(value),
-    evaluation: (() => {
-        try {
-            return bool(evaluate(value.expression, assignment)) ? 'accepted' : 'violated';
-        }
-        catch {
-            return 'indeterminate';
-        }
-    })(),
-    weight: Exact.rational(value.weight)
-});
 const assignments = (model, assignment) => {
     const variables = new Map(model.variables.map(variable => [variable.id, variable]));
     return Object.entries(assignment)
@@ -129,11 +314,19 @@ const assignments = (model, assignment) => {
         return { ...element(variable ?? { id }), declared: variable !== undefined, value };
     });
 };
-const feasible = (model, assignment) => ({
-    assignments: assignments(model, assignment),
-    hardConstraints: model.constraints.map(value => constraint(value, assignment)),
-    softConstraints: (model.softConstraints ?? []).map(value => softConstraint(value, assignment))
-});
+const feasible = (model, assignment, limits) => {
+    // The report owns a captured assignment; normalized values live only for this report.
+    const context = {
+        assignment, budget: new ExplanationBudget(limits.maxExplanationBits, limits.maxExplanationWork), assigned: new Map(), signs: new WeakMap(), expressionResults: new WeakMap(), evaluations: new Map(), expressionStrings: new Map(),
+        variables: new Map(model.variables.map(variable => [variable.id, variable])),
+        enumDomains: new Map((model.enums ?? []).map(domain => [domain.id, new Set(domain.values)]))
+    };
+    return {
+        assignments: assignments(model, assignment),
+        hardConstraints: model.constraints.map(value => constraint(value, context)),
+        softConstraints: (model.softConstraints ?? []).map(value => softConstraint(value, context))
+    };
+};
 const objective = (declaration, result) => ({
     ...element(declaration ?? { id: result.objectiveId }),
     declared: declaration !== undefined,
@@ -141,14 +334,14 @@ const objective = (declaration, result) => ({
     value: result.value,
     ...(result.bound === undefined ? {} : { bound: result.bound })
 });
-const outcome = (model, result) => {
+const outcome = (model, result, limits) => {
     switch (result.status) {
-        case 'satisfied': return { status: result.status, ...feasible(model, result.assignment) };
+        case 'satisfied': return { status: result.status, ...feasible(model, result.assignment, limits) };
         case 'optimal': {
             const declarations = new Map((model.objectives ?? []).map(value => [value.id, value]));
             return {
                 status: result.status,
-                ...feasible(model, result.assignment),
+                ...feasible(model, result.assignment, limits),
                 objectives: result.objectives.map(value => objective(declarations.get(value.objectiveId), value)),
                 optimalityProved: result.optimalityProved
             };
@@ -172,10 +365,22 @@ const outcome = (model, result) => {
 };
 /** Build stable JSON data without mutating the model, scenario, or CAVE store. */
 export const report = (model, result, limits, context = {}) => {
-    const modelDigest = Canonical.digest(model);
+    limits = mergeLimits(limits);
+    model = clone(model);
+    result = captureResult(result);
+    validateContext(context);
+    context = clone({
+        modelDigest: context.modelDigest,
+        scenario: context.scenario,
+        snapshot: context.snapshot,
+        inputs: context.inputs,
+    });
+    validateContext(context);
+    const modelDigest = digestOwned(model, limits);
     if (context.modelDigest !== undefined && context.modelDigest !== modelDigest) {
         throw new TypeError(`scenario model digest ${context.modelDigest} does not match ${modelDigest}`);
     }
+    // All referenced data is owned by the captures above or constructed in this call.
     return {
         schema,
         run: {
@@ -188,67 +393,101 @@ export const report = (model, result, limits, context = {}) => {
             ...(context.snapshot === undefined ? {} : { snapshot: context.snapshot }),
             inputs: [...(context.inputs ?? [])].sort((left, right) => compareText(left.id, right.id))
         },
-        outcome: outcome(model, result)
+        outcome: outcome(model, result, limits)
     };
 };
+const sourceLocation = (declaration) => {
+    if (declaration.line !== undefined) {
+        return `${inlineText(declaration.uri)}:${declaration.line}${declaration.column === undefined ? '' : `:${declaration.column}`}`;
+    }
+    return `${inlineText(declaration.uri)}${declaration.column === undefined ? '' : ` (column ${declaration.column})`}`;
+};
 const evidence = (value) => {
     const parts = [
-        value.declaration === undefined ? undefined : `${value.declaration.uri}${value.declaration.line === undefined ? '' : `:${value.declaration.line}${value.declaration.column === undefined ? '' : `:${value.declaration.column}`}`}`,
-        value.evidenceRowIds.length === 0 ? undefined : `rows ${value.evidenceRowIds.join(', ')}`,
-        value.scenarioInputIds.length === 0 ? undefined : `inputs ${value.scenarioInputIds.join(', ')}`
+        value.declaration === undefined ? undefined : sourceLocation(value.declaration),
+        value.evidenceRowIds.length === 0 ? undefined : `rows ${value.evidenceRowIds.map(inlineText).join(', ')}`,
+        value.scenarioInputIds.length === 0 ? undefined : `inputs ${value.scenarioInputIds.map(inlineText).join(', ')}`
     ].filter((part) => part !== undefined);
     return parts.length === 0 ? '' : ` — ${parts.join('; ')}`;
 };
 const valueText = (value) => {
+    const invalid = '(invalid backend value)';
+    if (value === null || typeof value !== 'object' || Array.isArray(value))
+        return invalid;
     switch (value.sort) {
-        case 'bool': return String(value.value);
-        case 'int': return value.value;
-        case 'real': return `${value.numerator}/${value.denominator}`;
-        case 'enum': return value.value;
+        case 'bool': return typeof value.value === 'boolean' ? String(value.value) : invalid;
+        case 'int': return typeof value.value === 'string' ? inlineText(value.value) : invalid;
+        case 'real': return typeof value.numerator === 'string' && typeof value.denominator === 'string'
+            ? inlineText(`${value.numerator}/${value.denominator}`) : invalid;
+        case 'enum': return typeof value.domain === 'string' && typeof value.value === 'string' ? inlineText(value.value) : invalid;
+        default: return invalid;
     }
 };
+const jsonControlEscapes = new Map([...Array.from({ length: 33 }, (_, index) => index + 0x7f), 0x2028, 0x2029]
+    .map(code => [String.fromCharCode(code), `\\u${code.toString(16).padStart(4, '0')}`]));
+const escapeJsonControls = (text) => text.replace(/[\u007f-\u009f\u2028\u2029]/g, character => jsonControlEscapes.get(character));
+const quotedText = (message) => escapeJsonControls(JSON.stringify(message));
+const inlineText = (message) => /[\u0000-\u001f\u007f-\u009f\u2028\u2029]/.test(message) ? quotedText(message) : message;
 /** Render the same report as concise, deterministic plain text. */
 export const render = (value) => {
     const lines = [
         `Solver result: ${value.outcome.status}`,
-        `Model: ${value.run.modelDigest}`,
-        `Backend: ${value.run.backend.name} ${value.run.backend.version}`,
+        `Model: ${inlineText(value.run.modelDigest)}`,
+        `Backend: ${inlineText(value.run.backend.name)} ${inlineText(value.run.backend.version)}`,
         `Elapsed: ${value.run.elapsedMs} ms`
     ];
     if (value.run.snapshot !== undefined) {
-        lines.push(`Snapshot: transaction ${value.run.snapshot.transactionTime ?? 'empty'}${value.run.snapshot.validTime === undefined ? '' : `, valid ${value.run.snapshot.validTime}`}`);
+        const snapshot = value.run.snapshot;
+        const policies = [];
+        if (snapshot.aliases !== undefined)
+            policies.push(`aliases ${snapshot.aliases}`);
+        if (snapshot.resolution !== undefined)
+            policies.push(`resolution ${snapshot.resolution}`);
+        if (snapshot.minimumConfidence !== undefined)
+            policies.push(`minimum confidence ${snapshot.minimumConfidence}`);
+        lines.push(`Snapshot: transaction ${inlineText(snapshot.transactionTime ?? 'empty')}${snapshot.validTime === undefined ? '' : `, valid ${inlineText(snapshot.validTime)}`}${policies.length === 0 ? '' : `; ${policies.join('; ')}`}`);
     }
     if (value.run.scenario !== undefined)
-        lines.push(`Scenario: ${value.run.scenario.id} (${value.run.scenario.inputDigest})`);
+        lines.push(`Scenario: ${inlineText(value.run.scenario.id)} (input ${inlineText(value.run.scenario.inputDigest)}; overlay ${inlineText(value.run.scenario.overlayDigest)})`);
     for (const input of value.run.inputs) {
-        lines.push(`Input ${input.id}: ${JSON.stringify(input.value)}${input.query === undefined ? '' : ` via ${input.query}`}`);
+        const values = [];
+        if (input.value !== undefined)
+            values.push(escapeJsonControls(stringifyInput(input.value)));
+        if (input.authoredValue !== undefined)
+            values.push(`authored ${escapeJsonControls(stringifyInput(input.authoredValue))}`);
+        const sources = [];
+        if (input.evidenceRowIds.length > 0)
+            sources.push(`rows ${sorted(input.evidenceRowIds).map(inlineText).join(', ')}`);
+        if (input.scenarioClaimIds.length > 0)
+            sources.push(`scenario claims ${sorted(input.scenarioClaimIds).map(inlineText).join(', ')}`);
+        lines.push(`Input ${inlineText(input.id)}: ${values.length === 0 ? '(no value)' : values.join('; ')}${input.query === undefined ? '' : ` via ${inlineText(input.query)}`}${sources.length === 0 ? '' : ` — ${sources.join('; ')}`}`);
     }
     switch (value.outcome.status) {
         case 'satisfied':
         case 'optimal':
             for (const assignment of value.outcome.assignments) {
-                lines.push(`Assignment ${assignment.id} = ${valueText(assignment.value)}${assignment.declared ? '' : ' (undeclared backend ID)'}${evidence(assignment)}`);
+                lines.push(`Assignment ${inlineText(assignment.id)} = ${valueText(assignment.value)}${assignment.declared ? '' : ' (undeclared backend ID)'}${evidence(assignment)}`);
             }
             for (const constraint of value.outcome.hardConstraints) {
-                lines.push(`Hard constraint ${constraint.id}: ${constraint.evaluation}${evidence(constraint)}`);
+                lines.push(`Hard constraint ${inlineText(constraint.id)}: ${constraint.evaluation}${constraint.evaluationReason === undefined ? '' : ` (${quotedText(constraint.evaluationReason)})`}${evidence(constraint)}`);
             }
             for (const constraint of value.outcome.softConstraints) {
-                lines.push(`Soft constraint ${constraint.id}: ${constraint.evaluation}, weight ${constraint.weight.numerator}/${constraint.weight.denominator}${evidence(constraint)}`);
+                lines.push(`Soft constraint ${inlineText(constraint.id)}: ${constraint.evaluation}${constraint.evaluationReason === undefined ? '' : ` (${quotedText(constraint.evaluationReason)})`}, weight ${constraint.weight.numerator}/${constraint.weight.denominator}${evidence(constraint)}`);
             }
             if (value.outcome.status === 'optimal') {
                 for (const objective of value.outcome.objectives) {
-                    lines.push(`Objective ${objective.id} (${objective.direction}) = ${valueText(objective.value)}${objective.declared ? '' : ' (undeclared backend ID)'}${evidence(objective)}`);
+                    lines.push(`Objective ${inlineText(objective.id)} (${objective.direction}) = ${valueText(objective.value)}${objective.declared ? '' : ' (undeclared backend ID)'}${evidence(objective)}`);
                 }
             }
             break;
         case 'unsatisfied':
             lines.push('Infeasibility proved. Unsatisfiable cores are not necessarily minimal.');
             for (const constraint of value.outcome.core ?? []) {
-                lines.push(`Core constraint ${constraint.id}${constraint.declared ? '' : ' (undeclared backend ID)'}${evidence(constraint)}`);
+                lines.push(`Core constraint ${inlineText(constraint.id)}${constraint.declared ? '' : ' (undeclared backend ID)'}${evidence(constraint)}`);
             }
             break;
         case 'unknown':
-            lines.push(`Unknown: ${value.outcome.reason.kind} — ${value.outcome.reason.message}`);
+            lines.push(`Unknown: ${value.outcome.reason.kind} — ${inlineText(value.outcome.reason.message)}`);
             break;
     }
     return `${lines.join('\n')}\n`;