solve-engine 1.0.0-beta.7 → 1.0.0

package/dist/{chunk-BXKJLM5R.cjs → chunk-6WFMPTGB.cjs}

@@ -1,63 +1,63 @@
 'use strict';
 
 var chunkFEAIOR7N_cjs = require('./chunk-FEAIOR7N.cjs');
-var chunk2MV4HBKC_cjs = require('./chunk-2MV4HBKC.cjs');
-var chunk4CVLFLOB_cjs = require('./chunk-4CVLFLOB.cjs');
-var chunkOC6LTXYS_cjs = require('./chunk-OC6LTXYS.cjs');
-var chunkNJTXJ5AG_cjs = require('./chunk-NJTXJ5AG.cjs');
-var chunkMBNQVDVC_cjs = require('./chunk-MBNQVDVC.cjs');
-var chunkM4N5GA5Z_cjs = require('./chunk-M4N5GA5Z.cjs');
+var chunkA2N2GFCG_cjs = require('./chunk-A2N2GFCG.cjs');
+var chunkUM6BVY2S_cjs = require('./chunk-UM6BVY2S.cjs');
+var chunkJMXUNXQS_cjs = require('./chunk-JMXUNXQS.cjs');
+var chunkPFUESQTW_cjs = require('./chunk-PFUESQTW.cjs');
+var chunkAMOJYLG2_cjs = require('./chunk-AMOJYLG2.cjs');
+var chunk5KMIY374_cjs = require('./chunk-5KMIY374.cjs');
 
 // src/symbolic/MultivariateFactor.ts
 function exactRoot(value, degree) {
-  const rootOf = degree === 2 ? chunk4CVLFLOB_cjs.exactIntegerSqrt : chunk4CVLFLOB_cjs.exactIntegerCbrt;
+  const rootOf = degree === 2 ? chunkUM6BVY2S_cjs.exactIntegerSqrt : chunkUM6BVY2S_cjs.exactIntegerCbrt;
   const numerator = rootOf(value.n);
   const denominator = rootOf(value.d);
   return numerator === null || denominator === null ? null : { n: numerator, d: denominator };
 }
 function monomialRoot(key, degree) {
-  const monomial = chunk4CVLFLOB_cjs.monomialFromKey(key);
+  const monomial = chunkUM6BVY2S_cjs.monomialFromKey(key);
   const root = /* @__PURE__ */ new Map();
   for (const [name, exponent] of monomial) {
     if (exponent % degree !== 0) return null;
     root.set(name, exponent / degree);
   }
-  return chunk4CVLFLOB_cjs.monomialToKey(root);
+  return chunkUM6BVY2S_cjs.monomialToKey(root);
 }
 function monomialMul(a, b) {
-  const product2 = chunk4CVLFLOB_cjs.monomialFromKey(a);
-  for (const [name, exponent] of chunk4CVLFLOB_cjs.monomialFromKey(b)) {
+  const product2 = chunkUM6BVY2S_cjs.monomialFromKey(a);
+  for (const [name, exponent] of chunkUM6BVY2S_cjs.monomialFromKey(b)) {
     product2.set(name, (product2.get(name) ?? 0) + exponent);
   }
-  return chunk4CVLFLOB_cjs.monomialToKey(product2);
+  return chunkUM6BVY2S_cjs.monomialToKey(product2);
 }
 function monomialDiv(a, b) {
-  const quotient = chunk4CVLFLOB_cjs.monomialFromKey(a);
-  for (const [name, exponent] of chunk4CVLFLOB_cjs.monomialFromKey(b)) {
+  const quotient = chunkUM6BVY2S_cjs.monomialFromKey(a);
+  for (const [name, exponent] of chunkUM6BVY2S_cjs.monomialFromKey(b)) {
     const remaining = (quotient.get(name) ?? 0) - exponent;
     if (remaining <= 0) quotient.delete(name);
     else quotient.set(name, remaining);
   }
-  return chunk4CVLFLOB_cjs.monomialToKey(quotient);
+  return chunkUM6BVY2S_cjs.monomialToKey(quotient);
 }
 function monomialGcd(a, b) {
-  const left = chunk4CVLFLOB_cjs.monomialFromKey(a);
+  const left = chunkUM6BVY2S_cjs.monomialFromKey(a);
   const shared = /* @__PURE__ */ new Map();
-  for (const [name, exponent] of chunk4CVLFLOB_cjs.monomialFromKey(b)) {
+  for (const [name, exponent] of chunkUM6BVY2S_cjs.monomialFromKey(b)) {
     const other = left.get(name);
     if (other !== void 0) shared.set(name, Math.min(other, exponent));
   }
-  return chunk4CVLFLOB_cjs.monomialToKey(shared);
+  return chunkUM6BVY2S_cjs.monomialToKey(shared);
 }
 function namesOf(keys) {
   const names = /* @__PURE__ */ new Set();
-  for (const key of keys) for (const name of chunk4CVLFLOB_cjs.monomialFromKey(key).keys()) names.add(name);
+  for (const key of keys) for (const name of chunkUM6BVY2S_cjs.monomialFromKey(key).keys()) names.add(name);
   return [...names].sort();
 }
 function termsToNode(terms) {
   const map = /* @__PURE__ */ new Map();
   for (const term of terms) map.set(term.key, term.coefficient);
-  return chunk4CVLFLOB_cjs.fromPolynomial({ terms: map, vars: namesOf(terms.map((term) => term.key)) });
+  return chunkUM6BVY2S_cjs.fromPolynomial({ terms: map, vars: namesOf(terms.map((term) => term.key)) });
 }
 function product(factors) {
   let result = factors[0];
@@ -66,7 +66,7 @@ function product(factors) {
 }
 function orderedTerms(p) {
   const terms = [...p.terms].map(([key, coefficient]) => ({ key, coefficient }));
-  return terms.sort((a, b) => chunk4CVLFLOB_cjs.compareMonomials(a.key, b.key, p.vars));
+  return terms.sort((a, b) => chunkUM6BVY2S_cjs.compareMonomials(a.key, b.key, p.vars));
 }
 function factorMultivariate(p) {
   if (p.vars.length < 2) return null;
@@ -94,9 +94,9 @@ function factorBinomial(first, second) {
   return product([linear, termsToNode([squareOf(cubes.a), middle, squareOf(cubes.b)])]);
 }
 function asPowerPair(first, second, degree) {
-  const magnitude = second.coefficient.n < 0n ? chunk4CVLFLOB_cjs.rationalNeg(second.coefficient) : second.coefficient;
+  const magnitude2 = second.coefficient.n < 0n ? chunkUM6BVY2S_cjs.rationalNeg(second.coefficient) : second.coefficient;
   const firstRoot = exactRoot(first.coefficient, degree);
-  const secondRoot = exactRoot(magnitude, degree);
+  const secondRoot = exactRoot(magnitude2, degree);
   if (firstRoot === null || secondRoot === null) return null;
   const firstKey = monomialRoot(first.key, degree);
   const secondKey = monomialRoot(second.key, degree);
@@ -104,10 +104,10 @@ function asPowerPair(first, second, degree) {
   return { a: { key: firstKey, coefficient: firstRoot }, b: { key: secondKey, coefficient: secondRoot } };
 }
 function negated(term) {
-  return { key: term.key, coefficient: chunk4CVLFLOB_cjs.rationalNeg(term.coefficient) };
+  return { key: term.key, coefficient: chunkUM6BVY2S_cjs.rationalNeg(term.coefficient) };
 }
 function multiplyTerms(a, b) {
-  return { key: monomialMul(a.key, b.key), coefficient: chunk4CVLFLOB_cjs.rationalMul(a.coefficient, b.coefficient) };
+  return { key: monomialMul(a.key, b.key), coefficient: chunkUM6BVY2S_cjs.rationalMul(a.coefficient, b.coefficient) };
 }
 function squareOf(term) {
   return multiplyTerms(term, term);
@@ -119,12 +119,12 @@ function factorPerfectSquare(terms) {
   if (roots === null) return null;
   const cross = multiplyTerms(roots.a, roots.b);
   if (cross.key !== middle.key) return null;
-  const twice = chunk4CVLFLOB_cjs.rationalMul(cross.coefficient, { n: 2n, d: 1n });
+  const twice = chunkUM6BVY2S_cjs.rationalMul(cross.coefficient, { n: 2n, d: 1n });
   const negative = middle.coefficient.n < 0n;
-  const magnitude = negative ? chunk4CVLFLOB_cjs.rationalNeg(middle.coefficient) : middle.coefficient;
-  if (!chunk4CVLFLOB_cjs.isRationalOne(chunk4CVLFLOB_cjs.rationalDiv(magnitude, twice))) return null;
+  const magnitude2 = negative ? chunkUM6BVY2S_cjs.rationalNeg(middle.coefficient) : middle.coefficient;
+  if (!chunkUM6BVY2S_cjs.isRationalOne(chunkUM6BVY2S_cjs.rationalDiv(magnitude2, twice))) return null;
   const base = termsToNode([roots.a, negative ? negated(roots.b) : roots.b]);
-  return { kind: "pow", base, exponent: chunk4CVLFLOB_cjs.constNode(2) };
+  return { kind: "pow", base, exponent: chunkUM6BVY2S_cjs.constNode(2) };
 }
 function factorByGrouping(terms) {
   const pairings = [
@@ -149,7 +149,7 @@ function splitPair(first, second) {
   const common = { key: shared, coefficient: first.coefficient };
   const cofactor = [
     { key: monomialDiv(first.key, shared), coefficient: { n: 1n, d: 1n } },
-    { key: monomialDiv(second.key, shared), coefficient: chunk4CVLFLOB_cjs.rationalDiv(second.coefficient, first.coefficient) }
+    { key: monomialDiv(second.key, shared), coefficient: chunkUM6BVY2S_cjs.rationalDiv(second.coefficient, first.coefficient) }
   ];
   return cofactor[0].key === cofactor[1].key ? null : { common, cofactor };
 }
@@ -176,27 +176,27 @@ function lcm(a, b) {
   return a / gcd(a, b) * b;
 }
 function divisors(value) {
-  const magnitude = value < 0n ? -value : value;
-  if (magnitude === 0n) return null;
+  const magnitude2 = value < 0n ? -value : value;
+  if (magnitude2 === 0n) return null;
   const found = [];
-  for (let candidate = 1n; candidate * candidate <= magnitude; candidate++) {
-    if (magnitude % candidate !== 0n) continue;
+  for (let candidate = 1n; candidate * candidate <= magnitude2; candidate++) {
+    if (magnitude2 % candidate !== 0n) continue;
     found.push(candidate);
-    const paired = magnitude / candidate;
+    const paired = magnitude2 / candidate;
     if (paired !== candidate) found.push(paired);
     if (found.length > FACTOR_MAX_ROOT_CANDIDATES) return null;
   }
   return found;
 }
 function evaluateAt(descending, x) {
-  let total = chunk4CVLFLOB_cjs.RATIONAL_ZERO;
-  for (const coeff of descending) total = chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_cjs.rationalMul(total, x), coeff);
+  let total = chunkUM6BVY2S_cjs.RATIONAL_ZERO;
+  for (const coeff of descending) total = chunkUM6BVY2S_cjs.rationalAdd(chunkUM6BVY2S_cjs.rationalMul(total, x), coeff);
   return total;
 }
 function divideByRoot(descending, root) {
   const quotient = [descending[0]];
   for (let i = 1; i < descending.length - 1; i++) {
-    quotient.push(chunk4CVLFLOB_cjs.rationalAdd(descending[i], chunk4CVLFLOB_cjs.rationalMul(quotient[i - 1], root)));
+    quotient.push(chunkUM6BVY2S_cjs.rationalAdd(descending[i], chunkUM6BVY2S_cjs.rationalMul(quotient[i - 1], root)));
   }
   return quotient;
 }
@@ -211,14 +211,14 @@ function rationalRoots(descending) {
   const numeratorDivisors = divisors(trailing);
   const denominatorDivisors = divisors(leading);
   if (numeratorDivisors === null || denominatorDivisors === null) {
-    throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
+    throw chunk5KMIY374_cjs.ErrorFactory.execution(
       "SYMBOLIC_FACTOR_LIMIT_EXCEEDED",
       "This polynomial's coefficients have too many divisors to search for rational roots.",
       { limit: FACTOR_MAX_ROOT_CANDIDATES }
     );
   }
   if (numeratorDivisors.length * denominatorDivisors.length > FACTOR_MAX_ROOT_CANDIDATES) {
-    throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
+    throw chunk5KMIY374_cjs.ErrorFactory.execution(
       "SYMBOLIC_FACTOR_LIMIT_EXCEEDED",
       "This polynomial has too many candidate rational roots to test.",
       { limit: FACTOR_MAX_ROOT_CANDIDATES }
@@ -233,25 +233,25 @@ function rationalRoots(descending) {
         const key = `${candidate.n}/${candidate.d}`;
         if (seen.has(key)) continue;
         seen.add(key);
-        if (chunk4CVLFLOB_cjs.isRationalZero(evaluateAt(descending, candidate))) roots.push(candidate);
+        if (chunkUM6BVY2S_cjs.isRationalZero(evaluateAt(descending, candidate))) roots.push(candidate);
       }
     }
   }
   return roots;
 }
 function linearFactorNode(variable, root) {
-  if (chunk4CVLFLOB_cjs.isRationalZero(root)) return chunk4CVLFLOB_cjs.varNode(variable);
-  return root.n > 0n ? { kind: "sub", left: chunk4CVLFLOB_cjs.varNode(variable), right: chunk4CVLFLOB_cjs.constNode(root) } : { kind: "add", left: chunk4CVLFLOB_cjs.varNode(variable), right: chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalNeg(root)) };
+  if (chunkUM6BVY2S_cjs.isRationalZero(root)) return chunkUM6BVY2S_cjs.varNode(variable);
+  return root.n > 0n ? { kind: "sub", left: chunkUM6BVY2S_cjs.varNode(variable), right: chunkUM6BVY2S_cjs.constNode(root) } : { kind: "add", left: chunkUM6BVY2S_cjs.varNode(variable), right: chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalNeg(root)) };
 }
 function coefficientsToNode(descending, variable) {
   const degree = descending.length - 1;
   const terms = /* @__PURE__ */ new Map();
   descending.forEach((coeff, index) => {
-    if (chunk4CVLFLOB_cjs.isRationalZero(coeff)) return;
-    const power2 = degree - index;
-    terms.set(power2 === 0 ? "" : power2 === 1 ? variable : `${variable}^${power2}`, coeff);
+    if (chunkUM6BVY2S_cjs.isRationalZero(coeff)) return;
+    const power3 = degree - index;
+    terms.set(power3 === 0 ? "" : power3 === 1 ? variable : `${variable}^${power3}`, coeff);
   });
-  return chunk4CVLFLOB_cjs.fromPolynomial({ terms, vars: terms.size > 0 ? [variable] : [] });
+  return chunkUM6BVY2S_cjs.fromPolynomial({ terms, vars: terms.size > 0 ? [variable] : [] });
 }
 function factorUnivariate(descending, variable) {
   const factors = [];
@@ -260,7 +260,7 @@ function factorUnivariate(descending, variable) {
   while (roots.length > 0 && remaining.length > 2) {
     for (const root of roots) {
       let multiplicity = 0;
-      while (remaining.length > 1 && chunk4CVLFLOB_cjs.isRationalZero(evaluateAt(remaining, root))) {
+      while (remaining.length > 1 && chunkUM6BVY2S_cjs.isRationalZero(evaluateAt(remaining, root))) {
         remaining = divideByRoot(remaining, root);
         multiplicity++;
       }
@@ -271,17 +271,17 @@ function factorUnivariate(descending, variable) {
   const leftoverDegree = remaining.length - 1;
   if (leftoverDegree >= 1) {
     factors.push({ base: coefficientsToNode(remaining, variable), power: 1 });
-    return { content: chunk4CVLFLOB_cjs.RATIONAL_ONE, factors };
+    return { content: chunkUM6BVY2S_cjs.RATIONAL_ONE, factors };
   }
-  return { content: remaining.length === 1 ? remaining[0] : chunk4CVLFLOB_cjs.RATIONAL_ONE, factors };
+  return { content: remaining.length === 1 ? remaining[0] : chunkUM6BVY2S_cjs.RATIONAL_ONE, factors };
 }
 function factorizationToNode(factorization) {
   const pieces = [];
-  if (!chunk4CVLFLOB_cjs.isRationalOne(factorization.content)) pieces.push(chunk4CVLFLOB_cjs.constNode(factorization.content));
+  if (!chunkUM6BVY2S_cjs.isRationalOne(factorization.content)) pieces.push(chunkUM6BVY2S_cjs.constNode(factorization.content));
   for (const factor of factorization.factors) {
-    pieces.push(factor.power === 1 ? factor.base : chunk4CVLFLOB_cjs.powNode(factor.base, chunk4CVLFLOB_cjs.constNode({ n: BigInt(factor.power), d: 1n })));
+    pieces.push(factor.power === 1 ? factor.base : chunkUM6BVY2S_cjs.powNode(factor.base, chunkUM6BVY2S_cjs.constNode({ n: BigInt(factor.power), d: 1n })));
   }
-  if (pieces.length === 0) return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ONE);
+  if (pieces.length === 0) return chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.RATIONAL_ONE);
   let result = pieces[0];
   for (let i = 1; i < pieces.length; i++) result = { kind: "mul", left: result, right: pieces[i] };
   return result;
@@ -293,7 +293,7 @@ function contentOf(p) {
     numeratorGcd = gcd(numeratorGcd, coeff.n);
     denominatorLcm = lcm(denominatorLcm, coeff.d);
   }
-  if (numeratorGcd === 0n) return chunk4CVLFLOB_cjs.RATIONAL_ONE;
+  if (numeratorGcd === 0n) return chunkUM6BVY2S_cjs.RATIONAL_ONE;
   return { n: numeratorGcd, d: denominatorLcm };
 }
 function extractCommonMonomial(p) {
@@ -339,48 +339,48 @@ function monomialNode(monomial) {
   let result = null;
   for (const name of names) {
     const exponent = monomial.get(name);
-    const factor = exponent === 1 ? chunk4CVLFLOB_cjs.varNode(name) : chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.varNode(name), chunk4CVLFLOB_cjs.constNode({ n: BigInt(exponent), d: 1n }));
+    const factor = exponent === 1 ? chunkUM6BVY2S_cjs.varNode(name) : chunkUM6BVY2S_cjs.powNode(chunkUM6BVY2S_cjs.varNode(name), chunkUM6BVY2S_cjs.constNode({ n: BigInt(exponent), d: 1n }));
     result = result === null ? factor : { kind: "mul", left: result, right: factor };
   }
   return result;
 }
 function factorSymbolic(node) {
-  const polynomial = chunk4CVLFLOB_cjs.toPolynomial(node);
+  const polynomial = chunkUM6BVY2S_cjs.toPolynomial(node);
   if (polynomial === null || polynomial.terms.size === 0) return node;
-  if (chunk4CVLFLOB_cjs.polyDegree(polynomial) > FACTOR_MAX_DEGREE) return node;
+  if (chunkUM6BVY2S_cjs.polyDegree(polynomial) > FACTOR_MAX_DEGREE) return node;
   if (polynomial.vars.length === 0) return node;
   const content = contentOf(polynomial);
-  const primitive = chunk4CVLFLOB_cjs.isRationalOne(content) ? polynomial : scaleTerms(polynomial, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.RATIONAL_ONE, content));
+  const primitive = chunkUM6BVY2S_cjs.isRationalOne(content) ? polynomial : scaleTerms(polynomial, chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.RATIONAL_ONE, content));
   const { monomial, reduced } = extractCommonMonomial(primitive);
   const monomialFactor = monomialNode(monomial);
-  const variable = chunk4CVLFLOB_cjs.polyUnivariateVar(reduced);
+  const variable = chunkUM6BVY2S_cjs.polyUnivariateVar(reduced);
   if (variable === null) {
     const patterned = factorMultivariate(reduced);
     if (patterned !== null) return assemble(content, monomialFactor, patterned);
     const pieces2 = buildPieces(content, monomialFactor, reduced);
     return pieces2 ?? node;
   }
-  const descending = [...chunk4CVLFLOB_cjs.polyCoefficients(reduced, variable)].reverse();
+  const descending = [...chunkUM6BVY2S_cjs.polyCoefficients(reduced, variable)].reverse();
   const factorization = factorUnivariate(descending, variable);
-  const combinedContent = chunk4CVLFLOB_cjs.rationalMul(content, factorization.content);
-  const isUnchanged = factorization.factors.length <= 1 && (factorization.factors[0]?.power ?? 1) === 1 && monomialFactor === null && chunk4CVLFLOB_cjs.isRationalOne(combinedContent);
+  const combinedContent = chunkUM6BVY2S_cjs.rationalMul(content, factorization.content);
+  const isUnchanged = factorization.factors.length <= 1 && (factorization.factors[0]?.power ?? 1) === 1 && monomialFactor === null && chunkUM6BVY2S_cjs.isRationalOne(combinedContent);
   if (isUnchanged) return node;
   const pieces = [];
-  if (!chunk4CVLFLOB_cjs.isRationalOne(combinedContent)) pieces.push(chunk4CVLFLOB_cjs.constNode(combinedContent));
+  if (!chunkUM6BVY2S_cjs.isRationalOne(combinedContent)) pieces.push(chunkUM6BVY2S_cjs.constNode(combinedContent));
   if (monomialFactor !== null) pieces.push(monomialFactor);
-  pieces.push(factorizationToNode({ content: chunk4CVLFLOB_cjs.RATIONAL_ONE, factors: factorization.factors }));
+  pieces.push(factorizationToNode({ content: chunkUM6BVY2S_cjs.RATIONAL_ONE, factors: factorization.factors }));
   let result = pieces[0];
   for (let i = 1; i < pieces.length; i++) result = { kind: "mul", left: result, right: pieces[i] };
   return result;
 }
 function scaleTerms(p, k) {
   const terms = /* @__PURE__ */ new Map();
-  for (const [key, coeff] of p.terms) terms.set(key, chunk4CVLFLOB_cjs.rationalMul(coeff, k));
+  for (const [key, coeff] of p.terms) terms.set(key, chunkUM6BVY2S_cjs.rationalMul(coeff, k));
   return { terms, vars: p.vars };
 }
 function assemble(content, monomialFactor, factored) {
   const pieces = [];
-  if (!chunk4CVLFLOB_cjs.isRationalOne(content)) pieces.push(chunk4CVLFLOB_cjs.constNode(content));
+  if (!chunkUM6BVY2S_cjs.isRationalOne(content)) pieces.push(chunkUM6BVY2S_cjs.constNode(content));
   if (monomialFactor !== null) pieces.push(monomialFactor);
   pieces.push(factored);
   let result = pieces[0];
@@ -388,11 +388,11 @@ function assemble(content, monomialFactor, factored) {
   return result;
 }
 function buildPieces(content, monomialFactor, reduced) {
-  if (monomialFactor === null && chunk4CVLFLOB_cjs.isRationalOne(content)) return null;
+  if (monomialFactor === null && chunkUM6BVY2S_cjs.isRationalOne(content)) return null;
   const pieces = [];
-  if (!chunk4CVLFLOB_cjs.isRationalOne(content)) pieces.push(chunk4CVLFLOB_cjs.constNode(content));
+  if (!chunkUM6BVY2S_cjs.isRationalOne(content)) pieces.push(chunkUM6BVY2S_cjs.constNode(content));
   if (monomialFactor !== null) pieces.push(monomialFactor);
-  pieces.push(chunk4CVLFLOB_cjs.fromPolynomial(reduced));
+  pieces.push(chunkUM6BVY2S_cjs.fromPolynomial(reduced));
   let result = pieces[0];
   for (let i = 1; i < pieces.length; i++) result = { kind: "mul", left: result, right: pieces[i] };
   return result;
@@ -403,103 +403,103 @@ var TWO = { n: 2n, d: 1n };
 var THREE = { n: 3n, d: 1n };
 var FOUR = { n: 4n, d: 1n };
 function depressCubic(a, b, c, d) {
-  const shift = chunk4CVLFLOB_cjs.rationalNeg(chunk4CVLFLOB_cjs.rationalDiv(b, chunk4CVLFLOB_cjs.rationalMul(THREE, a)));
-  const p = chunk4CVLFLOB_cjs.rationalDiv(
-    chunk4CVLFLOB_cjs.rationalSub(chunk4CVLFLOB_cjs.rationalMul(THREE, chunk4CVLFLOB_cjs.rationalMul(a, c)), chunk4CVLFLOB_cjs.rationalMul(b, b)),
-    chunk4CVLFLOB_cjs.rationalMul(THREE, chunk4CVLFLOB_cjs.rationalMul(a, a))
+  const shift = chunkUM6BVY2S_cjs.rationalNeg(chunkUM6BVY2S_cjs.rationalDiv(b, chunkUM6BVY2S_cjs.rationalMul(THREE, a)));
+  const p = chunkUM6BVY2S_cjs.rationalDiv(
+    chunkUM6BVY2S_cjs.rationalSub(chunkUM6BVY2S_cjs.rationalMul(THREE, chunkUM6BVY2S_cjs.rationalMul(a, c)), chunkUM6BVY2S_cjs.rationalMul(b, b)),
+    chunkUM6BVY2S_cjs.rationalMul(THREE, chunkUM6BVY2S_cjs.rationalMul(a, a))
   );
-  const twoBCubed = chunk4CVLFLOB_cjs.rationalMul(TWO, chunk4CVLFLOB_cjs.rationalMul(b, chunk4CVLFLOB_cjs.rationalMul(b, b)));
-  const nineABC = chunk4CVLFLOB_cjs.rationalMul({ n: 9n, d: 1n }, chunk4CVLFLOB_cjs.rationalMul(a, chunk4CVLFLOB_cjs.rationalMul(b, c)));
-  const twentySevenAAD = chunk4CVLFLOB_cjs.rationalMul({ n: 27n, d: 1n }, chunk4CVLFLOB_cjs.rationalMul(chunk4CVLFLOB_cjs.rationalMul(a, a), d));
-  const q = chunk4CVLFLOB_cjs.rationalDiv(
-    chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_cjs.rationalSub(twoBCubed, nineABC), twentySevenAAD),
-    chunk4CVLFLOB_cjs.rationalMul({ n: 27n, d: 1n }, chunk4CVLFLOB_cjs.rationalMul(a, chunk4CVLFLOB_cjs.rationalMul(a, a)))
+  const twoBCubed = chunkUM6BVY2S_cjs.rationalMul(TWO, chunkUM6BVY2S_cjs.rationalMul(b, chunkUM6BVY2S_cjs.rationalMul(b, b)));
+  const nineABC = chunkUM6BVY2S_cjs.rationalMul({ n: 9n, d: 1n }, chunkUM6BVY2S_cjs.rationalMul(a, chunkUM6BVY2S_cjs.rationalMul(b, c)));
+  const twentySevenAAD = chunkUM6BVY2S_cjs.rationalMul({ n: 27n, d: 1n }, chunkUM6BVY2S_cjs.rationalMul(chunkUM6BVY2S_cjs.rationalMul(a, a), d));
+  const q = chunkUM6BVY2S_cjs.rationalDiv(
+    chunkUM6BVY2S_cjs.rationalAdd(chunkUM6BVY2S_cjs.rationalSub(twoBCubed, nineABC), twentySevenAAD),
+    chunkUM6BVY2S_cjs.rationalMul({ n: 27n, d: 1n }, chunkUM6BVY2S_cjs.rationalMul(a, chunkUM6BVY2S_cjs.rationalMul(a, a)))
   );
   return { p, q, shift };
 }
 function solveCubic(a, b, c, d) {
   const { p, q, shift } = depressCubic(a, b, c, d);
-  const discriminant = chunk4CVLFLOB_cjs.rationalNeg(
-    chunk4CVLFLOB_cjs.rationalAdd(
-      chunk4CVLFLOB_cjs.rationalMul(FOUR, chunk4CVLFLOB_cjs.rationalMul(p, chunk4CVLFLOB_cjs.rationalMul(p, p))),
-      chunk4CVLFLOB_cjs.rationalMul({ n: 27n, d: 1n }, chunk4CVLFLOB_cjs.rationalMul(q, q))
+  const discriminant = chunkUM6BVY2S_cjs.rationalNeg(
+    chunkUM6BVY2S_cjs.rationalAdd(
+      chunkUM6BVY2S_cjs.rationalMul(FOUR, chunkUM6BVY2S_cjs.rationalMul(p, chunkUM6BVY2S_cjs.rationalMul(p, p))),
+      chunkUM6BVY2S_cjs.rationalMul({ n: 27n, d: 1n }, chunkUM6BVY2S_cjs.rationalMul(q, q))
     )
   );
-  if (chunk4CVLFLOB_cjs.rationalCompare(discriminant, chunk4CVLFLOB_cjs.RATIONAL_ZERO) > 0) {
+  if (chunkUM6BVY2S_cjs.rationalCompare(discriminant, chunkUM6BVY2S_cjs.RATIONAL_ZERO) > 0) {
     return { exact: [], approximate: trigonometricRoots(p, q, shift) };
   }
-  if (chunk4CVLFLOB_cjs.isRationalZero(discriminant)) return { exact: repeatedCubicRoots(p, q, shift), approximate: [] };
+  if (chunkUM6BVY2S_cjs.isRationalZero(discriminant)) return { exact: repeatedCubicRoots(p, q, shift), approximate: [] };
   return { exact: cardanoRoots(p, q, shift), approximate: [] };
 }
 function repeatedCubicRoots(p, q, shift) {
-  if (chunk4CVLFLOB_cjs.isRationalZero(p)) return [chunk4CVLFLOB_cjs.constNode(shift)];
-  const simple = chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(THREE, q), p), shift);
-  const repeated = chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_cjs.rationalNeg(chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(THREE, q), chunk4CVLFLOB_cjs.rationalMul(TWO, p))), shift);
-  const ordered = [simple, repeated].sort(chunk4CVLFLOB_cjs.rationalCompare);
-  return ordered.map(chunk4CVLFLOB_cjs.constNode);
+  if (chunkUM6BVY2S_cjs.isRationalZero(p)) return [chunkUM6BVY2S_cjs.constNode(shift)];
+  const simple = chunkUM6BVY2S_cjs.rationalAdd(chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(THREE, q), p), shift);
+  const repeated = chunkUM6BVY2S_cjs.rationalAdd(chunkUM6BVY2S_cjs.rationalNeg(chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(THREE, q), chunkUM6BVY2S_cjs.rationalMul(TWO, p))), shift);
+  const ordered = [simple, repeated].sort(chunkUM6BVY2S_cjs.rationalCompare);
+  return ordered.map(chunkUM6BVY2S_cjs.constNode);
 }
 function cardanoRoots(p, q, shift) {
-  const half = chunk4CVLFLOB_cjs.rationalNeg(chunk4CVLFLOB_cjs.rationalDiv(q, TWO));
-  const radicand = chunk4CVLFLOB_cjs.rationalAdd(
-    chunk4CVLFLOB_cjs.rationalMul(chunk4CVLFLOB_cjs.rationalDiv(q, TWO), chunk4CVLFLOB_cjs.rationalDiv(q, TWO)),
-    chunk4CVLFLOB_cjs.rationalMul(chunk4CVLFLOB_cjs.rationalDiv(p, THREE), chunk4CVLFLOB_cjs.rationalMul(chunk4CVLFLOB_cjs.rationalDiv(p, THREE), chunk4CVLFLOB_cjs.rationalDiv(p, THREE)))
+  const half = chunkUM6BVY2S_cjs.rationalNeg(chunkUM6BVY2S_cjs.rationalDiv(q, TWO));
+  const radicand = chunkUM6BVY2S_cjs.rationalAdd(
+    chunkUM6BVY2S_cjs.rationalMul(chunkUM6BVY2S_cjs.rationalDiv(q, TWO), chunkUM6BVY2S_cjs.rationalDiv(q, TWO)),
+    chunkUM6BVY2S_cjs.rationalMul(chunkUM6BVY2S_cjs.rationalDiv(p, THREE), chunkUM6BVY2S_cjs.rationalMul(chunkUM6BVY2S_cjs.rationalDiv(p, THREE), chunkUM6BVY2S_cjs.rationalDiv(p, THREE)))
   );
-  const inner = chunk4CVLFLOB_cjs.surdNode(radicand);
-  const u = { kind: "call", name: "cbrt", args: [{ kind: "add", left: chunk4CVLFLOB_cjs.constNode(half), right: inner }] };
-  const v = { kind: "call", name: "cbrt", args: [{ kind: "sub", left: chunk4CVLFLOB_cjs.constNode(half), right: inner }] };
+  const inner = chunkUM6BVY2S_cjs.surdNode(radicand);
+  const u = { kind: "call", name: "cbrt", args: [{ kind: "add", left: chunkUM6BVY2S_cjs.constNode(half), right: inner }] };
+  const v = { kind: "call", name: "cbrt", args: [{ kind: "sub", left: chunkUM6BVY2S_cjs.constNode(half), right: inner }] };
   const sum = { kind: "add", left: u, right: v };
   const difference = { kind: "sub", left: u, right: v };
-  const real = { kind: "add", left: chunk4CVLFLOB_cjs.constNode(shift), right: { kind: "div", left: { kind: "neg", operand: sum }, right: chunk4CVLFLOB_cjs.constNode(TWO) } };
+  const real = { kind: "add", left: chunkUM6BVY2S_cjs.constNode(shift), right: { kind: "div", left: { kind: "neg", operand: sum }, right: chunkUM6BVY2S_cjs.constNode(TWO) } };
   const imaginary = {
     kind: "mul",
-    left: { kind: "div", left: { kind: "mul", left: difference, right: chunk4CVLFLOB_cjs.surdNode(THREE) }, right: chunk4CVLFLOB_cjs.constNode(TWO) },
-    right: chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.COMPLEX_I)
+    left: { kind: "div", left: { kind: "mul", left: difference, right: chunkUM6BVY2S_cjs.surdNode(THREE) }, right: chunkUM6BVY2S_cjs.constNode(TWO) },
+    right: chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.COMPLEX_I)
   };
   return [
-    { kind: "add", left: chunk4CVLFLOB_cjs.constNode(shift), right: sum },
+    { kind: "add", left: chunkUM6BVY2S_cjs.constNode(shift), right: sum },
     { kind: "sub", left: real, right: imaginary },
     { kind: "add", left: real, right: imaginary }
   ];
 }
 function trigonometricRoots(p, q, shift) {
-  const pNumber = chunk4CVLFLOB_cjs.rationalToNumber(p);
-  const qNumber = chunk4CVLFLOB_cjs.rationalToNumber(q);
-  const shiftNumber = chunk4CVLFLOB_cjs.rationalToNumber(shift);
-  const magnitude = 2 * Math.sqrt(-pNumber / 3);
+  const pNumber = chunkUM6BVY2S_cjs.rationalToNumber(p);
+  const qNumber = chunkUM6BVY2S_cjs.rationalToNumber(q);
+  const shiftNumber = chunkUM6BVY2S_cjs.rationalToNumber(shift);
+  const magnitude2 = 2 * Math.sqrt(-pNumber / 3);
   const ratio = 3 * qNumber / (2 * pNumber) * Math.sqrt(-3 / pNumber);
   const angle = Math.acos(Math.min(1, Math.max(-1, ratio))) / 3;
-  return [0, 1, 2].map((k) => magnitude * Math.cos(angle - 2 * Math.PI * k / 3) + shiftNumber).sort((left, right) => left - right);
+  return [0, 1, 2].map((k) => magnitude2 * Math.cos(angle - 2 * Math.PI * k / 3) + shiftNumber).sort((left, right) => left - right);
 }
 function depressQuartic(b, c, d, e) {
-  const shift = chunk4CVLFLOB_cjs.rationalNeg(chunk4CVLFLOB_cjs.rationalDiv(b, FOUR));
-  const bb = chunk4CVLFLOB_cjs.rationalMul(b, b);
-  const p = chunk4CVLFLOB_cjs.rationalSub(c, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(THREE, bb), { n: 8n, d: 1n }));
-  const q = chunk4CVLFLOB_cjs.rationalAdd(
-    chunk4CVLFLOB_cjs.rationalSub(d, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(b, c), TWO)),
-    chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(bb, b), { n: 8n, d: 1n })
+  const shift = chunkUM6BVY2S_cjs.rationalNeg(chunkUM6BVY2S_cjs.rationalDiv(b, FOUR));
+  const bb = chunkUM6BVY2S_cjs.rationalMul(b, b);
+  const p = chunkUM6BVY2S_cjs.rationalSub(c, chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(THREE, bb), { n: 8n, d: 1n }));
+  const q = chunkUM6BVY2S_cjs.rationalAdd(
+    chunkUM6BVY2S_cjs.rationalSub(d, chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(b, c), TWO)),
+    chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(bb, b), { n: 8n, d: 1n })
   );
-  const r = chunk4CVLFLOB_cjs.rationalSub(
-    chunk4CVLFLOB_cjs.rationalAdd(
-      chunk4CVLFLOB_cjs.rationalSub(e, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(b, d), FOUR)),
-      chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(bb, c), { n: 16n, d: 1n })
+  const r = chunkUM6BVY2S_cjs.rationalSub(
+    chunkUM6BVY2S_cjs.rationalAdd(
+      chunkUM6BVY2S_cjs.rationalSub(e, chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(b, d), FOUR)),
+      chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(bb, c), { n: 16n, d: 1n })
     ),
-    chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(THREE, chunk4CVLFLOB_cjs.rationalMul(bb, bb)), { n: 256n, d: 1n })
+    chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalMul(THREE, chunkUM6BVY2S_cjs.rationalMul(bb, bb)), { n: 256n, d: 1n })
   );
   return { p, q, r, shift };
 }
 function solveQuartic(a, b, c, d, e, solveQuadratic2) {
-  const monic = (value) => chunk4CVLFLOB_cjs.rationalDiv(value, a);
+  const monic = (value) => chunkUM6BVY2S_cjs.rationalDiv(value, a);
   const { p, q, r, shift } = depressQuartic(monic(b), monic(c), monic(d), monic(e));
-  const roots = chunk4CVLFLOB_cjs.isRationalZero(q) ? biquadraticRoots(p, r) : splitQuarticRoots(p, q, r, solveQuadratic2);
+  const roots = chunkUM6BVY2S_cjs.isRationalZero(q) ? biquadraticRoots(p, r) : splitQuarticRoots(p, q, r, solveQuadratic2);
   if (roots === null) return null;
-  const shifted = chunk4CVLFLOB_cjs.isRationalZero(shift) ? roots : roots.map((root) => ({ kind: "add", left: chunk4CVLFLOB_cjs.constNode(shift), right: root }));
+  const shifted = chunkUM6BVY2S_cjs.isRationalZero(shift) ? roots : roots.map((root) => ({ kind: "add", left: chunkUM6BVY2S_cjs.constNode(shift), right: root }));
   return { exact: distinct(shifted), approximate: [] };
 }
 function distinct(roots) {
   const seen = /* @__PURE__ */ new Set();
   const unique = [];
   for (const root of roots) {
-    const key = chunk4CVLFLOB_cjs.symbolicKey(chunk4CVLFLOB_cjs.simplifySymbolic(root));
+    const key = chunkUM6BVY2S_cjs.symbolicKey(chunkUM6BVY2S_cjs.simplifySymbolic(root));
     if (seen.has(key)) continue;
     seen.add(key);
     unique.push(root);
@@ -507,53 +507,51 @@ function distinct(roots) {
   return unique;
 }
 function biquadraticRoots(p, r) {
-  const discriminant = chunk4CVLFLOB_cjs.rationalSub(chunk4CVLFLOB_cjs.rationalMul(p, p), chunk4CVLFLOB_cjs.rationalMul(FOUR, r));
-  if (chunk4CVLFLOB_cjs.rationalCompare(discriminant, chunk4CVLFLOB_cjs.RATIONAL_ZERO) < 0) return complexBiquadraticRoots(p, r);
-  const root = chunk4CVLFLOB_cjs.exactRationalSqrt(discriminant);
-  if (root !== null) return rationalSquareRoots(chunk4CVLFLOB_cjs.rationalNeg(p), root, chunk4CVLFLOB_cjs.isRationalZero(discriminant));
+  const discriminant = chunkUM6BVY2S_cjs.rationalSub(chunkUM6BVY2S_cjs.rationalMul(p, p), chunkUM6BVY2S_cjs.rationalMul(FOUR, r));
+  if (chunkUM6BVY2S_cjs.rationalCompare(discriminant, chunkUM6BVY2S_cjs.RATIONAL_ZERO) < 0) return complexBiquadraticRoots(p, r);
+  const root = chunkUM6BVY2S_cjs.exactRationalSqrt(discriminant);
+  if (root !== null) return rationalSquareRoots(chunkUM6BVY2S_cjs.rationalNeg(p), root, chunkUM6BVY2S_cjs.isRationalZero(discriminant));
   return nestedSquareRoots(p, r, discriminant);
 }
 function rationalSquareRoots(negatedP, root, repeated) {
-  const values = repeated ? [chunk4CVLFLOB_cjs.rationalDiv(negatedP, TWO)] : [chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalAdd(negatedP, root), TWO), chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalSub(negatedP, root), TWO)];
+  const values = repeated ? [chunkUM6BVY2S_cjs.rationalDiv(negatedP, TWO)] : [chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalAdd(negatedP, root), TWO), chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalSub(negatedP, root), TWO)];
   const roots = [];
   for (const value of values) {
-    if (chunk4CVLFLOB_cjs.isRationalZero(value)) {
-      roots.push(chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO));
+    if (chunkUM6BVY2S_cjs.isRationalZero(value)) {
+      roots.push(chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.RATIONAL_ZERO));
       continue;
     }
-    const square = chunk4CVLFLOB_cjs.signedSurdNode(value);
+    const square = chunkUM6BVY2S_cjs.signedSurdNode(value);
     roots.push({ kind: "neg", operand: square }, square);
   }
   return roots;
 }
 function nestedSquareRoots(p, r, discriminant) {
-  const negatedP = chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalNeg(p));
-  const surd = chunk4CVLFLOB_cjs.surdNode(discriminant);
-  const negativeP = chunk4CVLFLOB_cjs.rationalCompare(p, chunk4CVLFLOB_cjs.RATIONAL_ZERO) <= 0;
+  const negatedP = chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalNeg(p));
+  const surd = chunkUM6BVY2S_cjs.surdNode(discriminant);
+  const negativeP = chunkUM6BVY2S_cjs.rationalCompare(p, chunkUM6BVY2S_cjs.RATIONAL_ZERO) <= 0;
   const solutions = [
-    { node: halved({ kind: "add", left: negatedP, right: surd }), positive: negativeP || chunk4CVLFLOB_cjs.rationalCompare(r, chunk4CVLFLOB_cjs.RATIONAL_ZERO) <= 0 },
-    { node: halved({ kind: "sub", left: negatedP, right: surd }), positive: negativeP && chunk4CVLFLOB_cjs.rationalCompare(r, chunk4CVLFLOB_cjs.RATIONAL_ZERO) >= 0 }
+    { node: halved({ kind: "add", left: negatedP, right: surd }), positive: negativeP || chunkUM6BVY2S_cjs.rationalCompare(r, chunkUM6BVY2S_cjs.RATIONAL_ZERO) <= 0 },
+    { node: halved({ kind: "sub", left: negatedP, right: surd }), positive: negativeP && chunkUM6BVY2S_cjs.rationalCompare(r, chunkUM6BVY2S_cjs.RATIONAL_ZERO) >= 0 }
   ];
   const roots = [];
   for (const { node, positive } of solutions) {
     const radicand = positive ? node : { kind: "neg", operand: node };
-    const magnitude = { kind: "call", name: "sqrt", args: [radicand] };
-    const square = positive ? magnitude : { kind: "mul", left: magnitude, right: chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.COMPLEX_I) };
+    const magnitude2 = { kind: "call", name: "sqrt", args: [radicand] };
+    const square = positive ? magnitude2 : { kind: "mul", left: magnitude2, right: chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.COMPLEX_I) };
     roots.push({ kind: "neg", operand: square }, square);
   }
   return roots;
 }
 function halved(node) {
-  return { kind: "div", left: node, right: chunk4CVLFLOB_cjs.constNode(TWO) };
+  return { kind: "div", left: node, right: chunkUM6BVY2S_cjs.constNode(TWO) };
 }
 function complexBiquadraticRoots(p, r) {
-  const modulus = chunk4CVLFLOB_cjs.exactRationalSqrt(r);
-  if (modulus === null) return null;
-  const realPart = chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalAdd(modulus, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalNeg(p), TWO)), TWO);
-  const imaginaryPart = chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalSub(modulus, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalNeg(p), TWO)), TWO);
-  if (chunk4CVLFLOB_cjs.rationalCompare(realPart, chunk4CVLFLOB_cjs.RATIONAL_ZERO) < 0 || chunk4CVLFLOB_cjs.rationalCompare(imaginaryPart, chunk4CVLFLOB_cjs.RATIONAL_ZERO) < 0) return null;
-  const re = chunk4CVLFLOB_cjs.surdNode(realPart);
-  const im = { kind: "mul", left: chunk4CVLFLOB_cjs.surdNode(imaginaryPart), right: chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.COMPLEX_I) };
+  const centre = chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalNeg(p), TWO);
+  const modulus = chunkUM6BVY2S_cjs.exactRationalSqrt(r);
+  const re = modulus === null ? nestedSurd(chunkUM6BVY2S_cjs.surdNode(r), centre) : chunkUM6BVY2S_cjs.surdNode(chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalAdd(modulus, centre), TWO));
+  const imaginaryMagnitude = modulus === null ? nestedSurd(chunkUM6BVY2S_cjs.surdNode(r), chunkUM6BVY2S_cjs.rationalNeg(centre)) : chunkUM6BVY2S_cjs.surdNode(chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalSub(modulus, centre), TWO));
+  const im = { kind: "mul", left: imaginaryMagnitude, right: chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.COMPLEX_I) };
   const first = { kind: "add", left: re, right: im };
   const second = { kind: "sub", left: re, right: im };
   return [
@@ -563,94 +561,262 @@ function complexBiquadraticRoots(p, r) {
     first
   ];
 }
+function nestedSurd(surd, offset) {
+  const shifted = offset.n >= 0n ? { kind: "add", left: surd, right: chunkUM6BVY2S_cjs.constNode(offset) } : { kind: "sub", left: surd, right: chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalNeg(offset)) };
+  return { kind: "call", name: "sqrt", args: [halved(shifted)] };
+}
 function splitQuarticRoots(p, q, r, solveQuadratic2) {
   const resolvent = [
     { n: 1n, d: 1n },
-    chunk4CVLFLOB_cjs.rationalMul(TWO, p),
-    chunk4CVLFLOB_cjs.rationalSub(chunk4CVLFLOB_cjs.rationalMul(p, p), chunk4CVLFLOB_cjs.rationalMul(FOUR, r)),
-    chunk4CVLFLOB_cjs.rationalNeg(chunk4CVLFLOB_cjs.rationalMul(q, q))
+    chunkUM6BVY2S_cjs.rationalMul(TWO, p),
+    chunkUM6BVY2S_cjs.rationalSub(chunkUM6BVY2S_cjs.rationalMul(p, p), chunkUM6BVY2S_cjs.rationalMul(FOUR, r)),
+    chunkUM6BVY2S_cjs.rationalNeg(chunkUM6BVY2S_cjs.rationalMul(q, q))
   ];
   for (const z of rationalRoots(resolvent)) {
-    if (chunk4CVLFLOB_cjs.rationalCompare(z, chunk4CVLFLOB_cjs.RATIONAL_ZERO) <= 0) continue;
-    const alpha = chunk4CVLFLOB_cjs.exactRationalSqrt(z);
+    if (chunkUM6BVY2S_cjs.rationalCompare(z, chunkUM6BVY2S_cjs.RATIONAL_ZERO) <= 0) continue;
+    const alpha = chunkUM6BVY2S_cjs.exactRationalSqrt(z);
     if (alpha === null) continue;
-    const sum = chunk4CVLFLOB_cjs.rationalAdd(p, z);
-    const difference = chunk4CVLFLOB_cjs.rationalDiv(q, alpha);
-    const beta = chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalSub(sum, difference), TWO);
-    const gamma = chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalAdd(sum, difference), TWO);
+    const sum = chunkUM6BVY2S_cjs.rationalAdd(p, z);
+    const difference = chunkUM6BVY2S_cjs.rationalDiv(q, alpha);
+    const beta = chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalSub(sum, difference), TWO);
+    const gamma = chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalAdd(sum, difference), TWO);
     const one2 = { n: 1n, d: 1n };
     return [
       ...solveQuadratic2(one2, alpha, beta),
-      ...solveQuadratic2(one2, chunk4CVLFLOB_cjs.rationalNeg(alpha), gamma)
+      ...solveQuadratic2(one2, chunkUM6BVY2S_cjs.rationalNeg(alpha), gamma)
     ];
   }
   return null;
 }
 
+// src/symbolic/NumericRoots.ts
+var DURAND_KERNER_MAX_ITERATIONS = 200;
+var DURAND_KERNER_TOLERANCE = 1e-14;
+var ROOT_RESIDUAL_TOLERANCE = 1e-10;
+var ROOT_SEPARATION_TOLERANCE = 1e-10;
+var AXIS_SNAP_TOLERANCE = 1e-9;
+var CONJUGATE_PAIR_TOLERANCE = 1e-8;
+var NEWTON_POLISH_STEPS = 4;
+function subtract(a, b) {
+  return { re: a.re - b.re, im: a.im - b.im };
+}
+function multiply(a, b) {
+  return { re: a.re * b.re - a.im * b.im, im: a.re * b.im + a.im * b.re };
+}
+function divide(a, b) {
+  if (Math.abs(b.re) >= Math.abs(b.im)) {
+    const ratio2 = b.im / b.re;
+    const denominator2 = b.re + b.im * ratio2;
+    return { re: (a.re + a.im * ratio2) / denominator2, im: (a.im - a.re * ratio2) / denominator2 };
+  }
+  const ratio = b.re / b.im;
+  const denominator = b.re * ratio + b.im;
+  return { re: (a.re * ratio + a.im) / denominator, im: (a.im * ratio - a.re) / denominator };
+}
+function magnitude(z) {
+  return Math.hypot(z.re, z.im);
+}
+function evaluateAt2(descending, z) {
+  let re = 0;
+  let im = 0;
+  for (const coefficient of descending) {
+    const nextRe = re * z.re - im * z.im + coefficient;
+    im = re * z.im + im * z.re;
+    re = nextRe;
+  }
+  return { re, im };
+}
+function evaluationScale(descending, z) {
+  const radius = magnitude(z);
+  let total = 0;
+  for (const coefficient of descending) total = total * radius + Math.abs(coefficient);
+  return total;
+}
+function differentiate(descending) {
+  const degree = descending.length - 1;
+  const derivative = [];
+  for (let i = 0; i < degree; i++) derivative.push(descending[i] * (degree - i));
+  return derivative;
+}
+function squareFreeDoubles(descending) {
+  const ascending = [...descending].reverse();
+  const squareFree = [...chunkUM6BVY2S_cjs.squareFreePart(ascending)].reverse();
+  const doubles = squareFree.map(chunkUM6BVY2S_cjs.rationalToNumber);
+  if (doubles.some((value) => !Number.isFinite(value))) return null;
+  return doubles;
+}
+function initialEstimates(monic) {
+  const degree = monic.length - 1;
+  let largest = 0;
+  for (let i = 1; i < monic.length; i++) largest = Math.max(largest, Math.abs(monic[i]));
+  const radius = 1 + largest;
+  const centre = -monic[1] / degree;
+  const estimates = [];
+  for (let k = 0; k < degree; k++) {
+    const angle = 2 * Math.PI * k / degree + Math.PI / (2 * degree);
+    estimates.push({ re: centre + radius * Math.cos(angle), im: radius * Math.sin(angle) });
+  }
+  return estimates;
+}
+function durandKerner(monic) {
+  const degree = monic.length - 1;
+  const estimates = initialEstimates(monic);
+  for (let iteration = 0; iteration < DURAND_KERNER_MAX_ITERATIONS; iteration++) {
+    let largestStep = 0;
+    let largestRoot = 1;
+    for (let i = 0; i < degree; i++) {
+      let denominator = { re: 1, im: 0 };
+      for (let j = 0; j < degree; j++) {
+        if (i !== j) denominator = multiply(denominator, subtract(estimates[i], estimates[j]));
+      }
+      if (denominator.re === 0 && denominator.im === 0) {
+        estimates[i] = { re: estimates[i].re + 1e-6 * (i + 1), im: estimates[i].im + 1e-6 };
+        continue;
+      }
+      const step = divide(evaluateAt2(monic, estimates[i]), denominator);
+      if (!Number.isFinite(step.re) || !Number.isFinite(step.im)) return null;
+      estimates[i] = subtract(estimates[i], step);
+      largestStep = Math.max(largestStep, magnitude(step));
+      largestRoot = Math.max(largestRoot, magnitude(estimates[i]));
+    }
+    if (largestStep <= DURAND_KERNER_TOLERANCE * largestRoot) return estimates;
+  }
+  return null;
+}
+function polish(monic, derivative, start) {
+  let candidate = start;
+  for (let step = 0; step < NEWTON_POLISH_STEPS; step++) {
+    const slope = evaluateAt2(derivative, candidate);
+    if (slope.re === 0 && slope.im === 0) break;
+    const next = subtract(candidate, divide(evaluateAt2(monic, candidate), slope));
+    if (!Number.isFinite(next.re) || !Number.isFinite(next.im)) break;
+    candidate = next;
+  }
+  return candidate;
+}
+function snapToAxes(monic, derivative, z) {
+  const scale2 = Math.max(1, magnitude(z));
+  if (z.im !== 0 && Math.abs(z.im) <= AXIS_SNAP_TOLERANCE * scale2) {
+    const candidate = polish(monic, derivative, { re: z.re, im: 0 });
+    if (isRootWithinTolerance(monic, candidate)) return { re: candidate.re, im: 0 };
+  }
+  if (z.re !== 0 && Math.abs(z.re) <= AXIS_SNAP_TOLERANCE * scale2) {
+    const candidate = polish(monic, derivative, { re: 0, im: z.im });
+    if (isRootWithinTolerance(monic, candidate)) return { re: 0, im: candidate.im };
+  }
+  return z;
+}
+function isRootWithinTolerance(monic, z) {
+  if (!Number.isFinite(z.re) || !Number.isFinite(z.im)) return false;
+  return magnitude(evaluateAt2(monic, z)) <= ROOT_RESIDUAL_TOLERANCE * evaluationScale(monic, z);
+}
+function pairConjugates(roots) {
+  const result = [...roots];
+  const paired = result.map((root) => root.im === 0);
+  for (let i = 0; i < result.length; i++) {
+    if (paired[i]) continue;
+    const wanted = { re: result[i].re, im: -result[i].im };
+    let partner = -1;
+    let closest = Number.POSITIVE_INFINITY;
+    for (let j = i + 1; j < result.length; j++) {
+      if (paired[j]) continue;
+      const distance = magnitude(subtract(result[j], wanted));
+      if (distance < closest) {
+        closest = distance;
+        partner = j;
+      }
+    }
+    if (partner === -1 || closest > CONJUGATE_PAIR_TOLERANCE * Math.max(1, magnitude(result[i]))) continue;
+    const re = (result[i].re + result[partner].re) / 2;
+    const im = (Math.abs(result[i].im) + Math.abs(result[partner].im)) / 2;
+    const sign = result[i].im < 0 ? -1 : 1;
+    result[i] = { re, im: sign * im };
+    result[partner] = { re, im: -sign * im };
+    paired[i] = true;
+    paired[partner] = true;
+  }
+  return result;
+}
+function allSeparated(roots) {
+  for (let i = 0; i < roots.length; i++) {
+    for (let j = i + 1; j < roots.length; j++) {
+      const scale2 = Math.max(1, magnitude(roots[i]), magnitude(roots[j]));
+      if (magnitude(subtract(roots[i], roots[j])) <= ROOT_SEPARATION_TOLERANCE * scale2) return false;
+    }
+  }
+  return true;
+}
+function approximateRoots(descending) {
+  const monic = squareFreeDoubles(descending);
+  if (monic === null) return null;
+  if (monic.length < 2) return [];
+  const converged = durandKerner(monic);
+  if (converged === null) return null;
+  const derivative = differentiate(monic);
+  const roots = pairConjugates(converged).map((root) => snapToAxes(monic, derivative, root));
+  for (const root of roots) {
+    if (!isRootWithinTolerance(monic, root)) return null;
+  }
+  if (!allSeparated(roots)) return null;
+  return [...roots].sort((a, b) => a.re - b.re || a.im - b.im);
+}
+
 // src/symbolic/Solve.ts
 var SOLVE_MAX_DEGREE = 8;
-var NEWTON_MAX_ITERATIONS = 100;
-var NEWTON_TOLERANCE = 1e-12;
-var NUMERIC_SCAN_STEPS = 2e3;
 function evaluateRational(descending, x) {
-  let total = chunk4CVLFLOB_cjs.RATIONAL_ZERO;
-  for (const coeff of descending) total = chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_cjs.rationalMul(total, x), coeff);
-  return total;
-}
-function evaluateNumeric(descending, x) {
-  let total = 0;
-  for (const coeff of descending) total = total * x + chunk4CVLFLOB_cjs.rationalToNumber(coeff);
+  let total = chunkUM6BVY2S_cjs.RATIONAL_ZERO;
+  for (const coeff of descending) total = chunkUM6BVY2S_cjs.rationalAdd(chunkUM6BVY2S_cjs.rationalMul(total, x), coeff);
   return total;
 }
 function divideByRoot2(descending, root) {
   const quotient = [descending[0]];
   for (let i = 1; i < descending.length - 1; i++) {
-    quotient.push(chunk4CVLFLOB_cjs.rationalAdd(descending[i], chunk4CVLFLOB_cjs.rationalMul(quotient[i - 1], root)));
+    quotient.push(chunkUM6BVY2S_cjs.rationalAdd(descending[i], chunkUM6BVY2S_cjs.rationalMul(quotient[i - 1], root)));
   }
   return quotient;
 }
 function solveQuadratic(a, b, c) {
-  const discriminant = chunk4CVLFLOB_cjs.rationalSub(chunk4CVLFLOB_cjs.rationalMul(b, b), chunk4CVLFLOB_cjs.rationalMul(rational4(), chunk4CVLFLOB_cjs.rationalMul(a, c)));
-  const twoA = chunk4CVLFLOB_cjs.rationalMul(rational2(), a);
-  if (chunk4CVLFLOB_cjs.rationalCompare(discriminant, chunk4CVLFLOB_cjs.RATIONAL_ZERO) < 0) {
-    return complexQuadraticRoots(chunk4CVLFLOB_cjs.rationalNeg(b), discriminant, twoA);
-  }
-  if (chunk4CVLFLOB_cjs.isRationalZero(discriminant)) return [chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalNeg(b), twoA))];
-  const rootN = chunk4CVLFLOB_cjs.exactIntegerSqrt(discriminant.n);
-  const rootD = chunk4CVLFLOB_cjs.exactIntegerSqrt(discriminant.d);
+  const discriminant = chunkUM6BVY2S_cjs.rationalSub(chunkUM6BVY2S_cjs.rationalMul(b, b), chunkUM6BVY2S_cjs.rationalMul(rational4(), chunkUM6BVY2S_cjs.rationalMul(a, c)));
+  const twoA = chunkUM6BVY2S_cjs.rationalMul(rational2(), a);
+  if (chunkUM6BVY2S_cjs.rationalCompare(discriminant, chunkUM6BVY2S_cjs.RATIONAL_ZERO) < 0) {
+    return complexQuadraticRoots(chunkUM6BVY2S_cjs.rationalNeg(b), discriminant, twoA);
+  }
+  if (chunkUM6BVY2S_cjs.isRationalZero(discriminant)) return [chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalNeg(b), twoA))];
+  const rootN = chunkUM6BVY2S_cjs.exactIntegerSqrt(discriminant.n);
+  const rootD = chunkUM6BVY2S_cjs.exactIntegerSqrt(discriminant.d);
   if (rootN !== null && rootD !== null) {
     const root = { n: rootN, d: rootD };
-    const plus = chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_cjs.rationalNeg(b), root), twoA);
-    const minus = chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalSub(chunk4CVLFLOB_cjs.rationalNeg(b), root), twoA);
-    return chunk4CVLFLOB_cjs.rationalCompare(minus, plus) <= 0 ? [chunk4CVLFLOB_cjs.constNode(minus), chunk4CVLFLOB_cjs.constNode(plus)] : [chunk4CVLFLOB_cjs.constNode(plus), chunk4CVLFLOB_cjs.constNode(minus)];
-  }
-  const surd = chunk4CVLFLOB_cjs.surdNode(discriminant);
-  const ascending = chunk4CVLFLOB_cjs.rationalCompare(twoA, chunk4CVLFLOB_cjs.RATIONAL_ZERO) > 0;
-  const lower = { kind: "div", left: { kind: "sub", left: chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalNeg(b)), right: surd }, right: chunk4CVLFLOB_cjs.constNode(twoA) };
-  const upper = { kind: "div", left: { kind: "add", left: chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalNeg(b)), right: surd }, right: chunk4CVLFLOB_cjs.constNode(twoA) };
+    const plus = chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalAdd(chunkUM6BVY2S_cjs.rationalNeg(b), root), twoA);
+    const minus = chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalSub(chunkUM6BVY2S_cjs.rationalNeg(b), root), twoA);
+    return chunkUM6BVY2S_cjs.rationalCompare(minus, plus) <= 0 ? [chunkUM6BVY2S_cjs.constNode(minus), chunkUM6BVY2S_cjs.constNode(plus)] : [chunkUM6BVY2S_cjs.constNode(plus), chunkUM6BVY2S_cjs.constNode(minus)];
+  }
+  const surd = chunkUM6BVY2S_cjs.surdNode(discriminant);
+  const ascending = chunkUM6BVY2S_cjs.rationalCompare(twoA, chunkUM6BVY2S_cjs.RATIONAL_ZERO) > 0;
+  const lower = { kind: "div", left: { kind: "sub", left: chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalNeg(b)), right: surd }, right: chunkUM6BVY2S_cjs.constNode(twoA) };
+  const upper = { kind: "div", left: { kind: "add", left: chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalNeg(b)), right: surd }, right: chunkUM6BVY2S_cjs.constNode(twoA) };
   return ascending ? [lower, upper] : [upper, lower];
 }
 function complexQuadraticRoots(negatedB, discriminant, twoA) {
-  const magnitude = chunk4CVLFLOB_cjs.rationalNeg(discriminant);
-  const rootN = chunk4CVLFLOB_cjs.exactIntegerSqrt(magnitude.n);
-  const rootD = chunk4CVLFLOB_cjs.exactIntegerSqrt(magnitude.d);
+  const magnitude2 = chunkUM6BVY2S_cjs.rationalNeg(discriminant);
+  const rootN = chunkUM6BVY2S_cjs.exactIntegerSqrt(magnitude2.n);
+  const rootD = chunkUM6BVY2S_cjs.exactIntegerSqrt(magnitude2.d);
   if (rootN !== null && rootD !== null) {
-    const imaginary2 = chunk4CVLFLOB_cjs.rationalDiv({ n: rootN, d: rootD }, twoA);
-    const real2 = chunk4CVLFLOB_cjs.rationalDiv(negatedB, twoA);
+    const imaginary2 = chunkUM6BVY2S_cjs.rationalDiv({ n: rootN, d: rootD }, twoA);
+    const real2 = chunkUM6BVY2S_cjs.rationalDiv(negatedB, twoA);
     return [
-      chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.complex(real2, chunk4CVLFLOB_cjs.rationalNeg(imaginary2))),
-      chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.complex(real2, imaginary2))
+      chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.complex(real2, chunkUM6BVY2S_cjs.rationalNeg(imaginary2))),
+      chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.complex(real2, imaginary2))
     ];
   }
-  const real = chunk4CVLFLOB_cjs.rationalDiv(negatedB, twoA);
-  const scaledRadicand = chunk4CVLFLOB_cjs.rationalDiv(magnitude, chunk4CVLFLOB_cjs.rationalMul(twoA, twoA));
-  const imaginary = { kind: "mul", left: chunk4CVLFLOB_cjs.surdNode(scaledRadicand), right: chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.COMPLEX_I) };
-  if (chunk4CVLFLOB_cjs.isRationalZero(real)) {
+  const real = chunkUM6BVY2S_cjs.rationalDiv(negatedB, twoA);
+  const scaledRadicand = chunkUM6BVY2S_cjs.rationalDiv(magnitude2, chunkUM6BVY2S_cjs.rationalMul(twoA, twoA));
+  const imaginary = { kind: "mul", left: chunkUM6BVY2S_cjs.surdNode(scaledRadicand), right: chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.COMPLEX_I) };
+  if (chunkUM6BVY2S_cjs.isRationalZero(real)) {
     return [{ kind: "neg", operand: imaginary }, imaginary];
   }
   return [
-    { kind: "sub", left: chunk4CVLFLOB_cjs.constNode(real), right: imaginary },
-    { kind: "add", left: chunk4CVLFLOB_cjs.constNode(real), right: imaginary }
+    { kind: "sub", left: chunkUM6BVY2S_cjs.constNode(real), right: imaginary },
+    { kind: "add", left: chunkUM6BVY2S_cjs.constNode(real), right: imaginary }
   ];
 }
 function rational2() {
@@ -659,47 +825,11 @@ function rational2() {
 function rational4() {
   return { n: 4n, d: 1n };
 }
-function numericRoots(descending) {
-  const leading = chunk4CVLFLOB_cjs.rationalToNumber(descending[0]);
-  if (leading === 0) return [];
-  let bound = 0;
-  for (let i = 1; i < descending.length; i++) {
-    const ratio = Math.abs(chunk4CVLFLOB_cjs.rationalToNumber(descending[i]) / leading);
-    if (ratio > bound) bound = ratio;
-  }
-  bound += 1;
-  const roots = [];
-  const step = 2 * bound / NUMERIC_SCAN_STEPS;
-  let previousX = -bound;
-  let previousY = evaluateNumeric(descending, previousX);
-  for (let i = 1; i <= NUMERIC_SCAN_STEPS; i++) {
-    const x = -bound + i * step;
-    const y = evaluateNumeric(descending, x);
-    if (previousY === 0) roots.push(previousX);
-    else if (previousY < 0 !== y < 0) roots.push(bisect(descending, previousX, x));
-    previousX = x;
-    previousY = y;
-  }
-  return roots;
-}
-function bisect(descending, low, high) {
-  let left = low;
-  let right = high;
-  let leftValue = evaluateNumeric(descending, left);
-  for (let i = 0; i < NEWTON_MAX_ITERATIONS && right - left > NEWTON_TOLERANCE; i++) {
-    const middle = (left + right) / 2;
-    const middleValue = evaluateNumeric(descending, middle);
-    if (leftValue < 0 === middleValue < 0) {
-      left = middle;
-      leftValue = middleValue;
-    } else {
-      right = middle;
-    }
-  }
-  return (left + right) / 2;
+function realApproximation(value) {
+  return { re: value, im: 0 };
 }
 function solveForVariable(lhs, rhs, variable) {
-  const polynomial = chunk4CVLFLOB_cjs.toPolynomial({ kind: "sub", left: lhs, right: rhs });
+  const polynomial = chunkUM6BVY2S_cjs.toPolynomial({ kind: "sub", left: lhs, right: rhs });
   if (polynomial === null) {
     return {
       kind: "unsupported",
@@ -707,7 +837,7 @@ function solveForVariable(lhs, rhs, variable) {
     };
   }
   const others = polynomial.vars.filter((name) => name !== variable);
-  const degree = chunk4CVLFLOB_cjs.polyDegree(polynomial, variable);
+  const degree = chunkUM6BVY2S_cjs.polyDegree(polynomial, variable);
   if (others.length > 0) {
     if (degree !== 1) {
       return {
@@ -723,7 +853,7 @@ function solveForVariable(lhs, rhs, variable) {
   if (degree > SOLVE_MAX_DEGREE) {
     return { kind: "unsupported", reason: `degree ${degree} is above the supported maximum of ${SOLVE_MAX_DEGREE}` };
   }
-  const descending = [...chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable)].reverse();
+  const descending = [...chunkUM6BVY2S_cjs.polyCoefficients(polynomial, variable)].reverse();
   return solveUnivariate(descending);
 }
 function solveLinearWithOtherUnknowns(polynomial, variable) {
@@ -748,8 +878,8 @@ function solveLinearWithOtherUnknowns(polynomial, variable) {
     }
     return [...names].sort();
   };
-  const coefficient = chunk4CVLFLOB_cjs.fromPolynomial({ terms: coefficientTerms, vars: namesOf2(coefficientTerms) });
-  const constant = chunk4CVLFLOB_cjs.fromPolynomial({ terms: constantTerms, vars: namesOf2(constantTerms) });
+  const coefficient = chunkUM6BVY2S_cjs.fromPolynomial({ terms: coefficientTerms, vars: namesOf2(coefficientTerms) });
+  const constant = chunkUM6BVY2S_cjs.fromPolynomial({ terms: constantTerms, vars: namesOf2(constantTerms) });
   return {
     kind: "roots",
     exact: [{ kind: "div", left: { kind: "neg", operand: constant }, right: coefficient }],
@@ -765,38 +895,76 @@ function closedFormRoots(descending) {
   }
   return null;
 }
-function solveUnivariate(descending) {
-  const exact = [];
+function extractRationalRoots(descending) {
+  const roots = [];
   let remaining = [...descending];
-  let roots = [...rationalRoots(remaining)].sort(chunk4CVLFLOB_cjs.rationalCompare);
-  while (roots.length > 0 && remaining.length > 1) {
-    for (const root of roots) {
-      while (remaining.length > 1 && chunk4CVLFLOB_cjs.isRationalZero(evaluateRational(remaining, root))) {
+  let powersOfX = 0;
+  while (remaining.length > 1 && chunkUM6BVY2S_cjs.isRationalZero(remaining[remaining.length - 1])) {
+    remaining = remaining.slice(0, -1);
+    powersOfX++;
+  }
+  if (powersOfX > 0) roots.push(chunkUM6BVY2S_cjs.RATIONAL_ZERO);
+  while (remaining.length > 1) {
+    const found = rationalRoots(remaining);
+    if (found.length === 0) break;
+    for (const root of found) {
+      let multiplicity = 0;
+      while (remaining.length > 1 && chunkUM6BVY2S_cjs.isRationalZero(evaluateRational(remaining, root))) {
         remaining = divideByRoot2(remaining, root);
+        multiplicity++;
       }
-      exact.push(chunk4CVLFLOB_cjs.constNode(root));
+      if (multiplicity > 0) roots.push(root);
     }
-    roots = remaining.length > 1 ? [...rationalRoots(remaining)].sort(chunk4CVLFLOB_cjs.rationalCompare) : [];
   }
+  return { roots: roots.sort(chunkUM6BVY2S_cjs.rationalCompare), remaining };
+}
+function solveUnivariate(descending) {
+  const { roots, remaining } = extractRationalRoots(descending);
+  const exact = roots.map(chunkUM6BVY2S_cjs.constNode);
+  const approximate = [];
   const leftoverDegree = remaining.length - 1;
+  const solvedDegree = descending.length - remaining.length;
+  if (leftoverDegree <= 0) return finish(exact, approximate, solvedDegree, 0, "");
   if (leftoverDegree === 1) {
-    exact.push(chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalNeg(remaining[1]), remaining[0])));
-    return { kind: "roots", exact, approximate: [] };
+    exact.push(chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalDiv(chunkUM6BVY2S_cjs.rationalNeg(remaining[1]), remaining[0])));
+    return finish(exact, approximate, solvedDegree + 1, 0, "");
   }
   if (leftoverDegree === 2) {
-    const quadratic = solveQuadratic(remaining[0], remaining[1], remaining[2]);
-    return { kind: "roots", exact: [...exact, ...quadratic], approximate: [] };
-  }
-  if (leftoverDegree <= 0) {
-    return exact.length > 0 ? { kind: "roots", exact, approximate: [] } : { kind: "no-real-solutions", reason: "there is no value that satisfies this equation" };
+    exact.push(...solveQuadratic(remaining[0], remaining[1], remaining[2]));
+    return finish(exact, approximate, solvedDegree + 2, 0, "");
   }
   const closedForm = closedFormRoots(remaining);
   if (closedForm !== null) {
-    return { kind: "roots", exact: [...exact, ...closedForm.exact], approximate: closedForm.approximate };
-  }
-  const approximate = numericRoots(remaining);
-  if (exact.length === 0 && approximate.length === 0) {
-    return { kind: "no-real-solutions", reason: "no real root was found within the polynomial's root bound" };
+    exact.push(...closedForm.exact);
+    approximate.push(...closedForm.approximate.map(realApproximation));
+    return finish(exact, approximate, solvedDegree + leftoverDegree, 0, "");
+  }
+  const numeric = approximateRoots(remaining);
+  if (numeric !== null) {
+    approximate.push(...numeric);
+    return finish(exact, approximate, solvedDegree + leftoverDegree, 0, "");
+  }
+  return finish(
+    exact,
+    approximate,
+    solvedDegree,
+    leftoverDegree,
+    `a degree-${leftoverDegree} factor of it has no exact solution here and the numerical method did not converge on that factor`
+  );
+}
+function finish(exact, approximate, solvedDegree, unsolvedDegree, reason) {
+  const found = exact.length + approximate.length;
+  const incoherent = solvedDegree >= 1 && (found < 1 || found > solvedDegree);
+  if (unsolvedDegree > 0 || incoherent) {
+    return {
+      kind: "incomplete",
+      exact,
+      approximate,
+      // A distinct root can stand for several equal ones, so the count found
+      // is a lower bound on what it covers. The degree left unsolved is not.
+      missing: incoherent ? Math.max(1, solvedDegree + unsolvedDegree - found) : unsolvedDegree,
+      reason: incoherent ? `${found} root${found === 1 ? "" : "s"} were produced for a degree-${solvedDegree + unsolvedDegree} equation, which does not add up` : reason
+    };
   }
   return { kind: "roots", exact, approximate };
 }
@@ -846,15 +1014,15 @@ function valueToSymbolic(v) {
   if (v.type === 13 /* Error */ || v.type === 12 /* Pending */) return null;
   const numeric = v.toNumber();
   if (!Number.isFinite(numeric)) return null;
-  return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalFromNumber(numeric));
+  return chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalFromNumber(numeric));
 }
 function symbolicToValue(node) {
-  const simplified = chunk4CVLFLOB_cjs.simplifySymbolic(node);
-  if (simplified.kind === "const") return chunkOC6LTXYS_cjs.numberValue(chunk4CVLFLOB_cjs.rationalToNumber(simplified.value));
-  return chunkOC6LTXYS_cjs.symbolicValue(simplified);
+  const simplified = chunkUM6BVY2S_cjs.simplifySymbolic(node);
+  if (simplified.kind === "const") return chunkJMXUNXQS_cjs.numberValue(chunkUM6BVY2S_cjs.rationalToNumber(simplified.value));
+  return chunkJMXUNXQS_cjs.symbolicValue(simplified);
 }
 function unsupported(what) {
-  return chunkOC6LTXYS_cjs.errorValue(
+  return chunkJMXUNXQS_cjs.errorValue(
     "SYMBOLIC_UNSUPPORTED_FUNCTION",
     `"${what}" cannot be applied to an expression that still contains an unknown.`
   );
@@ -863,7 +1031,7 @@ function symbolicPow(l, r) {
   const base = valueToSymbolic(l);
   const exponent = valueToSymbolic(r);
   if (base === null || exponent === null) return unsupported("^");
-  return symbolicToValue(chunk4CVLFLOB_cjs.powNode(base, exponent));
+  return symbolicToValue(chunkUM6BVY2S_cjs.powNode(base, exponent));
 }
 function symbolicNeg(v) {
   const operand = valueToSymbolic(v);
@@ -873,39 +1041,49 @@ function symbolicNeg(v) {
 function symbolicBuiltin(index, args) {
   const nodes = [];
   for (const arg of args) {
-    if (arg.type === 13 /* Error */) return arg;
+    const faulted = chunkJMXUNXQS_cjs.faultedOperand(arg);
+    if (faulted) return faulted;
     const node = valueToSymbolic(arg);
     if (node === null) return unsupported(SYMBOLIC_BUILTIN_NAMES[index] ?? `builtin ${index}`);
     nodes.push(node);
   }
   if (index === POW_BUILTIN_INDEX && nodes.length === 2) {
-    return symbolicToValue(chunk4CVLFLOB_cjs.powNode(nodes[0], nodes[1]));
+    return symbolicToValue(chunkUM6BVY2S_cjs.powNode(nodes[0], nodes[1]));
   }
   const name = SYMBOLIC_BUILTIN_NAMES[index];
   if (name === void 0) return unsupported(`builtin ${index}`);
-  return symbolicToValue(chunk4CVLFLOB_cjs.callNode(name, nodes));
+  return symbolicToValue(chunkUM6BVY2S_cjs.callNode(name, nodes));
 }
 function rootToValue(root) {
   const value = symbolicToValue(root);
-  if (value.type === 0 /* Number */ && !Number.isInteger(value.toNumber())) return chunkOC6LTXYS_cjs.symbolicValue(root);
+  if (value.type === 0 /* Number */ && !Number.isInteger(value.toNumber())) return chunkJMXUNXQS_cjs.symbolicValue(root);
   return value;
 }
+function approximateRootToValue(root) {
+  if (root.im === 0) return chunkJMXUNXQS_cjs.numberValue(root.re);
+  return chunkJMXUNXQS_cjs.symbolicValue(chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.complex(chunkUM6BVY2S_cjs.rationalFromNumber(root.re), chunkUM6BVY2S_cjs.rationalFromNumber(root.im))));
+}
 function solveOutcomeToValue(outcome) {
   switch (outcome.kind) {
     case "identity":
-      return chunkOC6LTXYS_cjs.stringValue("true for every value");
+      return chunkJMXUNXQS_cjs.stringValue("true for every value");
     case "contradiction":
-      return chunkOC6LTXYS_cjs.stringValue("no solution");
-    case "no-real-solutions":
-      return chunkOC6LTXYS_cjs.stringValue(`no real solutions (${outcome.reason})`);
+      return chunkJMXUNXQS_cjs.stringValue("no solution");
     case "unsupported":
-      return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_SOLVE_UNSUPPORTED", `Cannot solve this equation: ${outcome.reason}.`);
+      return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_SOLVE_UNSUPPORTED", `Cannot solve this equation: ${outcome.reason}.`);
+    case "incomplete": {
+      const found = outcome.exact.length + outcome.approximate.length;
+      return chunkJMXUNXQS_cjs.errorValue(
+        "SYMBOLIC_SOLVE_INCOMPLETE",
+        `Only ${found} of this equation's ${found + outcome.missing} roots could be found: ${outcome.reason}.`
+      );
+    }
     case "roots": {
       const values = outcome.exact.map(rootToValue);
-      for (const approximate of outcome.approximate) values.push(chunkOC6LTXYS_cjs.numberValue(approximate));
-      if (values.length === 0) return chunkOC6LTXYS_cjs.stringValue("no solution");
+      for (const approximate of outcome.approximate) values.push(approximateRootToValue(approximate));
+      if (values.length === 0) return chunkJMXUNXQS_cjs.stringValue("no solution");
       if (values.length === 1) return values[0];
-      return chunkOC6LTXYS_cjs.matrixValue(1, values.length, values.map((v) => v.type === 9 /* Symbolic */ ? v.value : v.toNumber()));
+      return chunkJMXUNXQS_cjs.matrixValue(1, values.length, values.map((v) => v.type === 9 /* Symbolic */ ? v.value : v.toNumber()));
     }
   }
 }
@@ -913,7 +1091,7 @@ function solveEquationValues(lhsValue, rhsValue, variable) {
   const lhs = valueToSymbolic(lhsValue);
   const rhs = valueToSymbolic(rhsValue);
   if (lhs === null || rhs === null) {
-    return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "An equation side has no exact value to solve with.");
+    return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "An equation side has no exact value to solve with.");
   }
   return solveOutcomeToValue(solveForVariable(lhs, rhs, variable));
 }
@@ -924,15 +1102,15 @@ function unifyUom(l, r) {
     if (l.unit === r.unit) {
       return { lv: l.toNumber(), rv: r.toNumber(), unit: l.unit, sameMeasure: true };
     }
-    const lMeasure = chunkNJTXJ5AG_cjs.getMeasure(l.unit);
-    const rMeasure = chunkNJTXJ5AG_cjs.getMeasure(r.unit);
-    const isCurrency = chunk2MV4HBKC_cjs.sharedCurrencyExchange.isCurrency(l.unit) && chunk2MV4HBKC_cjs.sharedCurrencyExchange.isCurrency(r.unit);
+    const lMeasure = chunkPFUESQTW_cjs.getMeasure(l.unit);
+    const rMeasure = chunkPFUESQTW_cjs.getMeasure(r.unit);
+    const isCurrency = chunkA2N2GFCG_cjs.sharedCurrencyExchange.isCurrency(l.unit) && chunkA2N2GFCG_cjs.sharedCurrencyExchange.isCurrency(r.unit);
     if (lMeasure && lMeasure === rMeasure) {
-      const rvConverted = chunkNJTXJ5AG_cjs.convertUnit(r.toNumber(), r.unit, l.unit);
+      const rvConverted = chunkPFUESQTW_cjs.convertUnit(r.toNumber(), r.unit, l.unit);
       return { lv: l.toNumber(), rv: rvConverted, unit: l.unit, sameMeasure: true };
     }
     if (isCurrency) {
-      const rvConverted = chunk2MV4HBKC_cjs.sharedCurrencyExchange.convertSync(r.toNumber(), r.unit, l.unit);
+      const rvConverted = chunkA2N2GFCG_cjs.sharedCurrencyExchange.convertSync(r.toNumber(), r.unit, l.unit);
       if (rvConverted !== null) {
         return { lv: l.toNumber(), rv: rvConverted, unit: l.unit, sameMeasure: true };
       }
@@ -947,6 +1125,65 @@ function unifyUom(l, r) {
   }
   return { lv: l.toNumber(), rv: r.toNumber(), unit: void 0, sameMeasure: true };
 }
+var UNIFIED_COMPARISON_TOLERANCE = 1e-12;
+function largestFiniteMagnitude(a, b, c) {
+  let scale2 = 0;
+  if (Number.isFinite(a) && Math.abs(a) > scale2) scale2 = Math.abs(a);
+  if (Number.isFinite(b) && Math.abs(b) > scale2) scale2 = Math.abs(b);
+  if (Number.isFinite(c) && Math.abs(c) > scale2) scale2 = Math.abs(c);
+  return scale2;
+}
+function compareUom(l, r) {
+  const { lv, rv, sameMeasure } = unifyUom(l, r);
+  if (!sameMeasure) return { lv, rv, equal: false, sameMeasure: false };
+  if (lv === rv) return { lv, rv, equal: true, sameMeasure: true };
+  if (!Number.isFinite(lv) || !Number.isFinite(rv)) return { lv, rv, equal: false, sameMeasure: true };
+  const scale2 = largestFiniteMagnitude(lv, rv, r.toNumber());
+  return { lv, rv, equal: Math.abs(lv - rv) <= scale2 * UNIFIED_COMPARISON_TOLERANCE, sameMeasure: true };
+}
+function incomparableUnitsError(l, r) {
+  const lUnit = l.type === 6 /* Uom */ ? l.unit : void 0;
+  const rUnit = r.type === 6 /* Uom */ ? r.unit : void 0;
+  return chunkJMXUNXQS_cjs.errorValue("INCOMPATIBLE_UNITS", `Cannot compare incompatible units: ${lUnit ?? "?"} and ${rUnit ?? "?"}`);
+}
+function toBigIntOperand(v) {
+  if (v.type === 2 /* BigInt */) return v.value;
+  const n = v.toNumber();
+  if (!Number.isInteger(n)) {
+    const shown = Number.isNaN(n) ? "NaN" : String(n);
+    throw chunk5KMIY374_cjs.ErrorFactory.execution(
+      "BIGINT_INEXACT_OPERAND",
+      `A whole-number (n) value can only be combined with another whole number, and ${shown} is not one`,
+      { operand: shown }
+    );
+  }
+  return BigInt(n);
+}
+function bigIntDivisionByZero() {
+  return chunk5KMIY374_cjs.ErrorFactory.execution(
+    "BIGINT_DIVISION_BY_ZERO",
+    "Division by zero: a whole-number (n) division is exact integer division, which has no answer at zero, unlike 1 / 0 which is Infinity"
+  );
+}
+function compareBigIntOperands(l, r) {
+  const lb = exactBigInt(l);
+  const rb = exactBigInt(r);
+  if (lb === null || rb === null) return null;
+  if (lb < rb) return -1;
+  if (lb > rb) return 1;
+  return 0;
+}
+function exactBigInt(v) {
+  if (v.type === 2 /* BigInt */) return v.value;
+  const n = v.toNumber();
+  return Number.isInteger(n) ? BigInt(n) : null;
+}
+function power(base, exponent) {
+  if (Number.isFinite(exponent)) return Math.pow(base, exponent);
+  if (base === 1) return 1;
+  if (base === -1 && !Number.isNaN(exponent)) return 1;
+  return Math.pow(base, exponent);
+}
 function binaryOp(l, r, op, bigOp, symbolicOp) {
   if (l.type === 13 /* Error */) return l;
   if (r.type === 13 /* Error */) return r;
@@ -956,59 +1193,55 @@ function binaryOp(l, r, op, bigOp, symbolicOp) {
     const left = valueToSymbolic(l);
     const right = valueToSymbolic(r);
     if (left === null || right === null) {
-      return chunkOC6LTXYS_cjs.errorValue(
+      return chunkJMXUNXQS_cjs.errorValue(
         "SYMBOLIC_NONFINITE_OPERAND",
         "A symbolic expression cannot combine with a value that has no exact number (NaN or infinity)."
       );
     }
     const node = { kind: symbolicOp, left, right };
-    return chunkOC6LTXYS_cjs.symbolicValue(chunk4CVLFLOB_cjs.simplifySymbolic(node));
+    return chunkJMXUNXQS_cjs.symbolicValue(chunkUM6BVY2S_cjs.simplifySymbolic(node));
   }
   if (l.type === 0 /* Number */ && r.type === 0 /* Number */) {
-    return chunkOC6LTXYS_cjs.numberValue(op(l.value, r.value));
+    return chunkJMXUNXQS_cjs.numberValue(op(l.value, r.value));
   }
   if (l.type === 2 /* BigInt */ || r.type === 2 /* BigInt */) {
-    const lb = l.type === 2 /* BigInt */ ? l.value : BigInt(l.toNumber());
-    const rb = r.type === 2 /* BigInt */ ? r.value : BigInt(r.toNumber());
-    if (bigOp) return chunkOC6LTXYS_cjs.bigIntValue(bigOp(lb, rb));
-    return chunkOC6LTXYS_cjs.bigIntValue(lb + rb);
+    const lb = toBigIntOperand(l);
+    const rb = toBigIntOperand(r);
+    if (bigOp) return chunkJMXUNXQS_cjs.bigIntValue(bigOp(lb, rb));
+    return chunkJMXUNXQS_cjs.bigIntValue(lb + rb);
   }
   if (l.type === 6 /* Uom */ || r.type === 6 /* Uom */) {
     const { lv, rv, unit, sameMeasure } = unifyUom(l, r);
-    if (isNaN(lv) || isNaN(rv)) return chunkOC6LTXYS_cjs.numberValue(0);
     if (!sameMeasure) {
       const lUnit = l.type === 6 /* Uom */ ? l.unit : void 0;
       const rUnit = r.type === 6 /* Uom */ ? r.unit : void 0;
-      return chunkOC6LTXYS_cjs.errorValue("INCOMPATIBLE_UNITS", `Cannot combine incompatible units: ${lUnit ?? "?"} and ${rUnit ?? "?"}`);
+      return chunkJMXUNXQS_cjs.errorValue("INCOMPATIBLE_UNITS", `Cannot combine incompatible units: ${lUnit ?? "?"} and ${rUnit ?? "?"}`);
     }
-    return chunkOC6LTXYS_cjs.uomValue(op(lv, rv), unit);
+    return chunkJMXUNXQS_cjs.uomValue(op(lv, rv), unit);
   }
   if (l.type === 7 /* Matrix */ && r.type === 7 /* Matrix */) {
     const lm = l.value;
     const rm = r.value;
-    if (!chunk4CVLFLOB_cjs.sameShape(lm, rm)) {
-      return chunkOC6LTXYS_cjs.errorValue("DIMENSION_MISMATCH", `Cannot combine matrices of different shapes: ${lm.rows}x${lm.cols} and ${rm.rows}x${rm.cols}`);
+    if (!chunkUM6BVY2S_cjs.sameShape(lm, rm)) {
+      return chunkJMXUNXQS_cjs.errorValue("DIMENSION_MISMATCH", `Cannot combine matrices of different shapes: ${lm.rows}x${lm.cols} and ${rm.rows}x${rm.cols}`);
     }
     const result = new Array(lm.data.length);
     for (let i = 0; i < lm.data.length; i++) result[i] = op(lm.data[i], rm.data[i]);
-    return chunkOC6LTXYS_cjs.matrixValue(lm.rows, lm.cols, result);
+    return chunkJMXUNXQS_cjs.matrixValue(lm.rows, lm.cols, result);
   }
   if (l.type === 7 /* Matrix */) {
     const lm = l.value;
     const scalar = r.toNumber();
     const result = lm.data.map((v) => op(v, scalar));
-    return chunkOC6LTXYS_cjs.matrixValue(lm.rows, lm.cols, result);
+    return chunkJMXUNXQS_cjs.matrixValue(lm.rows, lm.cols, result);
   }
   if (r.type === 7 /* Matrix */) {
     const rm = r.value;
     const scalar = l.toNumber();
     const result = rm.data.map((v) => op(scalar, v));
-    return chunkOC6LTXYS_cjs.matrixValue(rm.rows, rm.cols, result);
+    return chunkJMXUNXQS_cjs.matrixValue(rm.rows, rm.cols, result);
   }
-  const lNum = l.toNumber();
-  const rNum = r.toNumber();
-  if (isNaN(lNum) || isNaN(rNum)) return chunkOC6LTXYS_cjs.numberValue(0);
-  return chunkOC6LTXYS_cjs.numberValue(op(lNum, rNum));
+  return chunkJMXUNXQS_cjs.numberValue(op(l.toNumber(), r.toNumber()));
 }
 
 // src/vm/OpRegistry.ts
@@ -1047,7 +1280,7 @@ var OpRegistry = class {
    */
   allocateOpcode() {
     if (this.nextOpcode > MAX_OPCODE) {
-      throw chunkM4N5GA5Z_cjs.ErrorFactory.config(
+      throw chunk5KMIY374_cjs.ErrorFactory.config(
         "OPCODE_POOL_EXHAUSTED",
         `OpRegistry: dynamic opcode pool exhausted (max ${MAX_OPCODE - DYNAMIC_OPCODE_START} allocations).`
       );
@@ -1059,36 +1292,36 @@ var sharedOpRegistry = new OpRegistry();
 
 // src/symbolic/PartialFractions.ts
 var APART_MAX_DEGREE = 12;
-function multiply(a, b) {
+function multiply2(a, b) {
   if (a.length === 0 || b.length === 0) return [];
-  const product2 = new Array(a.length + b.length - 1).fill(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
+  const product2 = new Array(a.length + b.length - 1).fill(chunkUM6BVY2S_cjs.RATIONAL_ZERO);
   a.forEach((left, i) => {
     b.forEach((right, j) => {
-      product2[i + j] = chunk4CVLFLOB_cjs.rationalAdd(product2[i + j], chunk4CVLFLOB_cjs.rationalMul(left, right));
+      product2[i + j] = chunkUM6BVY2S_cjs.rationalAdd(product2[i + j], chunkUM6BVY2S_cjs.rationalMul(left, right));
     });
   });
   return product2;
 }
-function power(base, exponent) {
-  let result = [chunk4CVLFLOB_cjs.RATIONAL_ONE];
-  for (let i = 0; i < exponent; i++) result = multiply(result, base);
+function power2(base, exponent) {
+  let result = [chunkUM6BVY2S_cjs.RATIONAL_ONE];
+  for (let i = 0; i < exponent; i++) result = multiply2(result, base);
   return result;
 }
 function scale(coefficients, factor) {
-  return coefficients.map((coefficient) => chunk4CVLFLOB_cjs.rationalDiv(coefficient, factor));
+  return coefficients.map((coefficient) => chunkUM6BVY2S_cjs.rationalDiv(coefficient, factor));
 }
 function denominatorFactors(ascending, variable) {
   const factors = [];
   let lowest = 0;
-  while (lowest < ascending.length && chunk4CVLFLOB_cjs.isRationalZero(ascending[lowest])) lowest++;
-  if (lowest > 0) factors.push({ base: [chunk4CVLFLOB_cjs.RATIONAL_ZERO, chunk4CVLFLOB_cjs.RATIONAL_ONE], power: lowest });
+  while (lowest < ascending.length && chunkUM6BVY2S_cjs.isRationalZero(ascending[lowest])) lowest++;
+  if (lowest > 0) factors.push({ base: [chunkUM6BVY2S_cjs.RATIONAL_ZERO, chunkUM6BVY2S_cjs.RATIONAL_ONE], power: lowest });
   const remaining = ascending.slice(lowest);
   if (remaining.length > 1) {
     const factorization = factorUnivariate([...remaining].reverse(), variable);
     for (const factor of factorization.factors) {
-      const polynomial = chunk4CVLFLOB_cjs.toPolynomial(factor.base);
+      const polynomial = chunkUM6BVY2S_cjs.toPolynomial(factor.base);
       if (polynomial === null) return null;
-      factors.push({ base: [...chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable)], power: factor.power });
+      factors.push({ base: [...chunkUM6BVY2S_cjs.polyCoefficients(polynomial, variable)], power: factor.power });
     }
   }
   return factors.length > 0 ? factors : null;
@@ -1106,19 +1339,19 @@ function enumerateUnknowns(factors) {
   return unknowns;
 }
 function unknownColumn(unknown, factors, denominator) {
-  const divisor = power(factors[unknown.factor].base, unknown.power);
-  const { quotient, remainder } = chunk4CVLFLOB_cjs.polynomialDivide(denominator, divisor);
-  if (!chunk4CVLFLOB_cjs.isZeroPolynomial(remainder)) return null;
-  const shift = new Array(unknown.degree).fill(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
-  shift.push(chunk4CVLFLOB_cjs.RATIONAL_ONE);
-  return multiply(quotient, shift);
+  const divisor = power2(factors[unknown.factor].base, unknown.power);
+  const { quotient, remainder } = chunkUM6BVY2S_cjs.polynomialDivide(denominator, divisor);
+  if (!chunkUM6BVY2S_cjs.isZeroPolynomial(remainder)) return null;
+  const shift = new Array(unknown.degree).fill(chunkUM6BVY2S_cjs.RATIONAL_ZERO);
+  shift.push(chunkUM6BVY2S_cjs.RATIONAL_ONE);
+  return multiply2(quotient, shift);
 }
 function solveLinearSystem(matrix, target) {
   const size = target.length;
   for (let column = 0; column < size; column++) {
     let pivot = -1;
     for (let row = column; row < size; row++) {
-      if (!chunk4CVLFLOB_cjs.isRationalZero(matrix[row][column])) {
+      if (!chunkUM6BVY2S_cjs.isRationalZero(matrix[row][column])) {
         pivot = row;
         break;
       }
@@ -1127,21 +1360,21 @@ function solveLinearSystem(matrix, target) {
     [matrix[column], matrix[pivot]] = [matrix[pivot], matrix[column]];
     [target[column], target[pivot]] = [target[pivot], target[column]];
     for (let row = 0; row < size; row++) {
-      if (row === column || chunk4CVLFLOB_cjs.isRationalZero(matrix[row][column])) continue;
-      const factor = chunk4CVLFLOB_cjs.rationalDiv(matrix[row][column], matrix[column][column]);
+      if (row === column || chunkUM6BVY2S_cjs.isRationalZero(matrix[row][column])) continue;
+      const factor = chunkUM6BVY2S_cjs.rationalDiv(matrix[row][column], matrix[column][column]);
       for (let k = column; k < size; k++) {
-        matrix[row][k] = chunk4CVLFLOB_cjs.rationalSub(matrix[row][k], chunk4CVLFLOB_cjs.rationalMul(factor, matrix[column][k]));
+        matrix[row][k] = chunkUM6BVY2S_cjs.rationalSub(matrix[row][k], chunkUM6BVY2S_cjs.rationalMul(factor, matrix[column][k]));
       }
-      target[row] = chunk4CVLFLOB_cjs.rationalSub(target[row], chunk4CVLFLOB_cjs.rationalMul(factor, target[column]));
+      target[row] = chunkUM6BVY2S_cjs.rationalSub(target[row], chunkUM6BVY2S_cjs.rationalMul(factor, target[column]));
     }
   }
-  return target.map((value, index) => chunk4CVLFLOB_cjs.rationalDiv(value, matrix[index][index]));
+  return target.map((value, index) => chunkUM6BVY2S_cjs.rationalDiv(value, matrix[index][index]));
 }
 function partialFractions(numerator, denominator, variable) {
   if (denominator.length < 2 || denominator.length - 1 > APART_MAX_DEGREE) return null;
-  const shared = chunk4CVLFLOB_cjs.coefficientGcd(numerator, denominator);
-  const reducedNumerator = shared.length > 1 ? chunk4CVLFLOB_cjs.polynomialDivide(numerator, shared).quotient : [...numerator];
-  const reducedDenominator = shared.length > 1 ? chunk4CVLFLOB_cjs.polynomialDivide(denominator, shared).quotient : [...denominator];
+  const shared = chunkUM6BVY2S_cjs.coefficientGcd(numerator, denominator);
+  const reducedNumerator = shared.length > 1 ? chunkUM6BVY2S_cjs.polynomialDivide(numerator, shared).quotient : [...numerator];
+  const reducedDenominator = shared.length > 1 ? chunkUM6BVY2S_cjs.polynomialDivide(denominator, shared).quotient : [...denominator];
   if (reducedDenominator.length === 1) {
     return { polynomial: scale(reducedNumerator, reducedDenominator[0]), terms: [] };
   }
@@ -1149,8 +1382,8 @@ function partialFractions(numerator, denominator, variable) {
   const leading = reducedDenominator[reducedDenominator.length - 1];
   const monicDenominator = scale(reducedDenominator, leading);
   const scaledNumerator = scale(reducedNumerator, leading);
-  const { quotient, remainder } = chunk4CVLFLOB_cjs.polynomialDivide(scaledNumerator, monicDenominator);
-  if (chunk4CVLFLOB_cjs.isZeroPolynomial(remainder)) return { polynomial: quotient, terms: [] };
+  const { quotient, remainder } = chunkUM6BVY2S_cjs.polynomialDivide(scaledNumerator, monicDenominator);
+  if (chunkUM6BVY2S_cjs.isZeroPolynomial(remainder)) return { polynomial: quotient, terms: [] };
   const factors = denominatorFactors(monicDenominator, variable);
   if (factors === null) return null;
   const terms = solveForNumerators(factors, monicDenominator, remainder);
@@ -1168,10 +1401,10 @@ function solveForNumerators(factors, denominator, remainder) {
   }
   const matrix = [];
   for (let row = 0; row < size; row++) {
-    matrix.push(columns.map((column) => column[row] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO));
+    matrix.push(columns.map((column) => column[row] ?? chunkUM6BVY2S_cjs.RATIONAL_ZERO));
   }
   const target = [];
-  for (let row = 0; row < size; row++) target.push(remainder[row] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO);
+  for (let row = 0; row < size; row++) target.push(remainder[row] ?? chunkUM6BVY2S_cjs.RATIONAL_ZERO);
   const solution = solveLinearSystem(matrix, target);
   if (solution === null) return null;
   return groupSolution(unknowns, solution, factors);
@@ -1187,8 +1420,8 @@ function groupSolution(unknowns, solution, factors) {
   const terms = [];
   for (const [key, coefficients] of grouped) {
     const [factorIndex, termPower] = key.split(":").map(Number);
-    const filled = [...coefficients].map((value) => value ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO);
-    if (filled.every(chunk4CVLFLOB_cjs.isRationalZero)) continue;
+    const filled = [...coefficients].map((value) => value ?? chunkUM6BVY2S_cjs.RATIONAL_ZERO);
+    if (filled.every(chunkUM6BVY2S_cjs.isRationalZero)) continue;
     terms.push({ numerator: filled, base: factors[factorIndex].base, power: termPower });
   }
   return terms;
@@ -1196,11 +1429,11 @@ function groupSolution(unknowns, solution, factors) {
 function coefficientsToNode2(coefficients, variable) {
   const terms = /* @__PURE__ */ new Map();
   coefficients.forEach((coefficient, exponent) => {
-    if (chunk4CVLFLOB_cjs.isRationalZero(coefficient)) return;
+    if (chunkUM6BVY2S_cjs.isRationalZero(coefficient)) return;
     terms.set(exponent === 0 ? "" : exponent === 1 ? variable : `${variable}^${exponent}`, coefficient);
   });
-  if (terms.size === 0) return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
-  return chunk4CVLFLOB_cjs.fromPolynomial({ terms, vars: coefficients.length > 1 ? [variable] : [] });
+  if (terms.size === 0) return chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.RATIONAL_ZERO);
+  return chunkUM6BVY2S_cjs.fromPolynomial({ terms, vars: coefficients.length > 1 ? [variable] : [] });
 }
 function apartSymbolic(node) {
   const parts = asRationalFunction(node);
@@ -1210,9 +1443,9 @@ function apartSymbolic(node) {
   let result = decomposition.polynomial.length > 0 ? coefficientsToNode2(decomposition.polynomial, parts.variable) : null;
   for (const term of decomposition.terms) {
     const base = coefficientsToNode2(term.base, parts.variable);
-    const denominator = term.power === 1 ? base : chunk4CVLFLOB_cjs.powNode(base, chunk4CVLFLOB_cjs.constNode({ n: BigInt(term.power), d: 1n }));
+    const denominator = term.power === 1 ? base : chunkUM6BVY2S_cjs.powNode(base, chunkUM6BVY2S_cjs.constNode({ n: BigInt(term.power), d: 1n }));
     const negative = isNegativeNumerator(term.numerator);
-    const numerator = negative ? term.numerator.map((coefficient) => chunk4CVLFLOB_cjs.rationalNeg(coefficient)) : term.numerator;
+    const numerator = negative ? term.numerator.map((coefficient) => chunkUM6BVY2S_cjs.rationalNeg(coefficient)) : term.numerator;
     const piece = {
       kind: "div",
       left: coefficientsToNode2(numerator, parts.variable),
@@ -1221,22 +1454,22 @@ function apartSymbolic(node) {
     if (result === null) result = negative ? { kind: "neg", operand: piece } : piece;
     else result = { kind: negative ? "sub" : "add", left: result, right: piece };
   }
-  return result === null ? node : chunk4CVLFLOB_cjs.simplifySymbolic(result);
+  return result === null ? node : chunkUM6BVY2S_cjs.simplifySymbolic(result);
 }
 function isNegativeNumerator(coefficients) {
   return coefficients.some((coefficient) => coefficient.n < 0n) && coefficients.every((coefficient) => coefficient.n <= 0n);
 }
 function asRationalFunction(node) {
   if (node.kind !== "div") return null;
-  const numerator = chunk4CVLFLOB_cjs.toPolynomial(node.left);
-  const denominator = chunk4CVLFLOB_cjs.toPolynomial(node.right);
+  const numerator = chunkUM6BVY2S_cjs.toPolynomial(node.left);
+  const denominator = chunkUM6BVY2S_cjs.toPolynomial(node.right);
   if (numerator === null || denominator === null) return null;
-  const variable = chunk4CVLFLOB_cjs.polyUnivariateVar(denominator);
+  const variable = chunkUM6BVY2S_cjs.polyUnivariateVar(denominator);
   if (variable === null) return null;
   if (numerator.vars.some((name) => name !== variable)) return null;
   return {
-    numerator: chunk4CVLFLOB_cjs.polyCoefficients(numerator, variable),
-    denominator: chunk4CVLFLOB_cjs.polyCoefficients(denominator, variable),
+    numerator: chunkUM6BVY2S_cjs.polyCoefficients(numerator, variable),
+    denominator: chunkUM6BVY2S_cjs.polyCoefficients(denominator, variable),
     variable
   };
 }
@@ -1244,66 +1477,66 @@ function asRationalFunction(node) {
 // src/symbolic/Derivative.ts
 var DERIVATIVE_MAX_ORDER = 16;
 function zero() {
-  return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
+  return chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.RATIONAL_ZERO);
 }
 function one() {
-  return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ONE);
+  return chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.RATIONAL_ONE);
 }
 function functionDerivative(name, argument) {
   switch (name) {
     case "sin":
-      return chunk4CVLFLOB_cjs.callNode("cos", [argument]);
+      return chunkUM6BVY2S_cjs.callNode("cos", [argument]);
     case "cos":
-      return { kind: "neg", operand: chunk4CVLFLOB_cjs.callNode("sin", [argument]) };
+      return { kind: "neg", operand: chunkUM6BVY2S_cjs.callNode("sin", [argument]) };
     case "tan":
-      return { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.callNode("cos", [argument]), chunk4CVLFLOB_cjs.constNode(2)) };
+      return { kind: "div", left: one(), right: chunkUM6BVY2S_cjs.powNode(chunkUM6BVY2S_cjs.callNode("cos", [argument]), chunkUM6BVY2S_cjs.constNode(2)) };
     case "exp":
-      return chunk4CVLFLOB_cjs.callNode("exp", [argument]);
+      return chunkUM6BVY2S_cjs.callNode("exp", [argument]);
     case "log":
       return { kind: "div", left: one(), right: argument };
     case "sqrt":
       return {
         kind: "div",
         left: one(),
-        right: { kind: "mul", left: chunk4CVLFLOB_cjs.constNode(2), right: chunk4CVLFLOB_cjs.callNode("sqrt", [argument]) }
+        right: { kind: "mul", left: chunkUM6BVY2S_cjs.constNode(2), right: chunkUM6BVY2S_cjs.callNode("sqrt", [argument]) }
       };
     case "asin":
-      return { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.callNode("sqrt", [oneMinusSquare(argument)]) };
+      return { kind: "div", left: one(), right: chunkUM6BVY2S_cjs.callNode("sqrt", [oneMinusSquare(argument)]) };
     case "acos":
-      return { kind: "neg", operand: { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.callNode("sqrt", [oneMinusSquare(argument)]) } };
+      return { kind: "neg", operand: { kind: "div", left: one(), right: chunkUM6BVY2S_cjs.callNode("sqrt", [oneMinusSquare(argument)]) } };
     case "atan":
       return { kind: "div", left: one(), right: onePlusSquare(argument) };
     case "sinh":
-      return chunk4CVLFLOB_cjs.callNode("cosh", [argument]);
+      return chunkUM6BVY2S_cjs.callNode("cosh", [argument]);
     case "cosh":
-      return chunk4CVLFLOB_cjs.callNode("sinh", [argument]);
+      return chunkUM6BVY2S_cjs.callNode("sinh", [argument]);
     case "tanh":
-      return { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.callNode("cosh", [argument]), chunk4CVLFLOB_cjs.constNode(2)) };
+      return { kind: "div", left: one(), right: chunkUM6BVY2S_cjs.powNode(chunkUM6BVY2S_cjs.callNode("cosh", [argument]), chunkUM6BVY2S_cjs.constNode(2)) };
     case "abs":
-      return chunk4CVLFLOB_cjs.callNode("sign", [argument]);
+      return chunkUM6BVY2S_cjs.callNode("sign", [argument]);
     default:
       return null;
   }
 }
 function oneMinusSquare(argument) {
-  return { kind: "sub", left: one(), right: chunk4CVLFLOB_cjs.powNode(argument, chunk4CVLFLOB_cjs.constNode(2)) };
+  return { kind: "sub", left: one(), right: chunkUM6BVY2S_cjs.powNode(argument, chunkUM6BVY2S_cjs.constNode(2)) };
 }
 function onePlusSquare(argument) {
-  return { kind: "add", left: one(), right: chunk4CVLFLOB_cjs.powNode(argument, chunk4CVLFLOB_cjs.constNode(2)) };
+  return { kind: "add", left: one(), right: chunkUM6BVY2S_cjs.powNode(argument, chunkUM6BVY2S_cjs.constNode(2)) };
 }
-function differentiate(node, variable, order = 1) {
+function differentiate2(node, variable, order = 1) {
   if (order < 0 || !Number.isInteger(order)) {
-    throw chunkM4N5GA5Z_cjs.ErrorFactory.execution("SYMBOLIC_DERIVATIVE_ORDER_LIMIT", "A derivative order must be a whole number, at least zero.");
+    throw chunk5KMIY374_cjs.ErrorFactory.execution("SYMBOLIC_DERIVATIVE_ORDER_LIMIT", "A derivative order must be a whole number, at least zero.");
   }
   if (order > DERIVATIVE_MAX_ORDER) {
-    throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
+    throw chunk5KMIY374_cjs.ErrorFactory.execution(
       "SYMBOLIC_DERIVATIVE_ORDER_LIMIT",
       `A derivative order above ${DERIVATIVE_MAX_ORDER} is not supported.`,
       { limit: DERIVATIVE_MAX_ORDER }
     );
   }
-  let result = chunk4CVLFLOB_cjs.simplifySymbolic(node);
-  for (let i = 0; i < order; i++) result = chunk4CVLFLOB_cjs.simplifySymbolic(derive(result, variable));
+  let result = chunkUM6BVY2S_cjs.simplifySymbolic(node);
+  for (let i = 0; i < order; i++) result = chunkUM6BVY2S_cjs.simplifySymbolic(derive(result, variable));
   return result;
 }
 function derive(node, variable) {
@@ -1333,7 +1566,7 @@ function derive(node, variable) {
           left: { kind: "mul", left: derive(node.left, variable), right: node.right },
           right: { kind: "mul", left: node.left, right: derive(node.right, variable) }
         },
-        right: chunk4CVLFLOB_cjs.powNode(node.right, chunk4CVLFLOB_cjs.constNode(2))
+        right: chunkUM6BVY2S_cjs.powNode(node.right, chunkUM6BVY2S_cjs.constNode(2))
       };
     case "pow":
       return derivePow(node, variable);
@@ -1347,79 +1580,79 @@ function derive(node, variable) {
 }
 function derivePow(node, variable) {
   if (node.exponent.kind === "const") {
-    const reduced = chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalSub(node.exponent.value, chunk4CVLFLOB_cjs.RATIONAL_ONE));
+    const reduced = chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalSub(node.exponent.value, chunkUM6BVY2S_cjs.RATIONAL_ONE));
     return {
       kind: "mul",
-      left: { kind: "mul", left: node.exponent, right: chunk4CVLFLOB_cjs.powNode(node.base, reduced) },
+      left: { kind: "mul", left: node.exponent, right: chunkUM6BVY2S_cjs.powNode(node.base, reduced) },
       right: derive(node.base, variable)
     };
   }
   if (node.base.kind === "const" && node.base.value.n > 0n) {
     return {
       kind: "mul",
-      left: { kind: "mul", left: node, right: chunk4CVLFLOB_cjs.callNode("log", [node.base]) },
+      left: { kind: "mul", left: node, right: chunkUM6BVY2S_cjs.callNode("log", [node.base]) },
       right: derive(node.exponent, variable)
     };
   }
   return unevaluated(node, variable);
 }
 function unevaluated(node, variable) {
-  return chunk4CVLFLOB_cjs.callNode("der", [node, chunk4CVLFLOB_cjs.varNode(variable)]);
+  return chunkUM6BVY2S_cjs.callNode("der", [node, chunkUM6BVY2S_cjs.varNode(variable)]);
 }
 
 // src/symbolic/Integral.ts
 function asLinear(node, variable) {
-  const polynomial = chunk4CVLFLOB_cjs.toPolynomial(node);
+  const polynomial = chunkUM6BVY2S_cjs.toPolynomial(node);
   if (polynomial === null) return null;
   const others = polynomial.vars.filter((name) => name !== variable);
   if (others.length > 0) return null;
-  if (chunk4CVLFLOB_cjs.polyDegree(polynomial, variable) > 1) return null;
-  const ascending = chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable);
+  if (chunkUM6BVY2S_cjs.polyDegree(polynomial, variable) > 1) return null;
+  const ascending = chunkUM6BVY2S_cjs.polyCoefficients(polynomial, variable);
   const intercept = ascending[0] ?? { n: 0n, d: 1n };
   const slope = ascending[1] ?? { n: 0n, d: 1n };
-  return chunk4CVLFLOB_cjs.isRationalZero(slope) ? null : { slope, intercept };
+  return chunkUM6BVY2S_cjs.isRationalZero(slope) ? null : { slope, intercept };
 }
 function integratePolynomial(node, variable) {
-  const polynomial = chunk4CVLFLOB_cjs.toPolynomial(node);
+  const polynomial = chunkUM6BVY2S_cjs.toPolynomial(node);
   if (polynomial === null) return null;
   const others = polynomial.vars.filter((name) => name !== variable);
   if (others.length > 0) {
     return { ok: false, reason: `it involves more than one unknown (${others.join(", ")})` };
   }
-  const ascending = chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable);
-  let result = chunk4CVLFLOB_cjs.constNode(0);
-  ascending.forEach((coeff, power2) => {
-    if (chunk4CVLFLOB_cjs.isRationalZero(coeff)) return;
-    const nextPower = power2 + 1;
-    const scaled = chunk4CVLFLOB_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
+  const ascending = chunkUM6BVY2S_cjs.polyCoefficients(polynomial, variable);
+  let result = chunkUM6BVY2S_cjs.constNode(0);
+  ascending.forEach((coeff, power3) => {
+    if (chunkUM6BVY2S_cjs.isRationalZero(coeff)) return;
+    const nextPower = power3 + 1;
+    const scaled = chunkUM6BVY2S_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
     const term = {
       kind: "mul",
-      left: chunk4CVLFLOB_cjs.constNode(scaled),
-      right: nextPower === 1 ? chunk4CVLFLOB_cjs.varNode(variable) : chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.varNode(variable), chunk4CVLFLOB_cjs.constNode(nextPower))
+      left: chunkUM6BVY2S_cjs.constNode(scaled),
+      right: nextPower === 1 ? chunkUM6BVY2S_cjs.varNode(variable) : chunkUM6BVY2S_cjs.powNode(chunkUM6BVY2S_cjs.varNode(variable), chunkUM6BVY2S_cjs.constNode(nextPower))
     };
     result = { kind: "add", left: result, right: term };
   });
-  return { ok: true, value: chunk4CVLFLOB_cjs.simplifySymbolic(result) };
+  return { ok: true, value: chunkUM6BVY2S_cjs.simplifySymbolic(result) };
 }
 function integrateStandardForm(node, variable) {
   if (node.kind !== "call" || node.args.length !== 1) return null;
   const linear = asLinear(node.args[0], variable);
   if (linear === null) return null;
   const inner = node.args[0];
-  const divideBySlope = (value) => chunk4CVLFLOB_cjs.simplifySymbolic({ kind: "div", left: value, right: chunk4CVLFLOB_cjs.constNode(linear.slope) });
+  const divideBySlope = (value) => chunkUM6BVY2S_cjs.simplifySymbolic({ kind: "div", left: value, right: chunkUM6BVY2S_cjs.constNode(linear.slope) });
   switch (node.name) {
     case "exp":
-      return { ok: true, value: divideBySlope(chunk4CVLFLOB_cjs.callNode("exp", [inner])) };
+      return { ok: true, value: divideBySlope(chunkUM6BVY2S_cjs.callNode("exp", [inner])) };
     case "sin":
-      return { ok: true, value: divideBySlope({ kind: "neg", operand: chunk4CVLFLOB_cjs.callNode("cos", [inner]) }) };
+      return { ok: true, value: divideBySlope({ kind: "neg", operand: chunkUM6BVY2S_cjs.callNode("cos", [inner]) }) };
     case "cos":
-      return { ok: true, value: divideBySlope(chunk4CVLFLOB_cjs.callNode("sin", [inner])) };
+      return { ok: true, value: divideBySlope(chunkUM6BVY2S_cjs.callNode("sin", [inner])) };
     case "log":
       return {
         ok: true,
         value: divideBySlope({
           kind: "sub",
-          left: { kind: "mul", left: inner, right: chunk4CVLFLOB_cjs.callNode("log", [inner]) },
+          left: { kind: "mul", left: inner, right: chunkUM6BVY2S_cjs.callNode("log", [inner]) },
           right: inner
         })
       };
@@ -1434,18 +1667,18 @@ function integrateReciprocalForms(node, variable) {
   if (linear !== null) {
     return {
       ok: true,
-      value: chunk4CVLFLOB_cjs.simplifySymbolic({
+      value: chunkUM6BVY2S_cjs.simplifySymbolic({
         kind: "div",
-        left: chunk4CVLFLOB_cjs.callNode("log", [node.right]),
-        right: chunk4CVLFLOB_cjs.constNode(linear.slope)
+        left: chunkUM6BVY2S_cjs.callNode("log", [node.right]),
+        right: chunkUM6BVY2S_cjs.constNode(linear.slope)
       })
     };
   }
-  const denominator = chunk4CVLFLOB_cjs.toPolynomial(node.right);
+  const denominator = chunkUM6BVY2S_cjs.toPolynomial(node.right);
   if (denominator !== null && denominator.vars.length === 1 && denominator.vars[0] === variable) {
-    const ascending = chunk4CVLFLOB_cjs.polyCoefficients(denominator, variable);
-    const isOnePlusSquare = ascending.length === 3 && isRationalOneNode(ascending[0]) && chunk4CVLFLOB_cjs.isRationalZero(ascending[1]) && isRationalOneNode(ascending[2]);
-    if (isOnePlusSquare) return { ok: true, value: chunk4CVLFLOB_cjs.callNode("atan", [chunk4CVLFLOB_cjs.varNode(variable)]) };
+    const ascending = chunkUM6BVY2S_cjs.polyCoefficients(denominator, variable);
+    const isOnePlusSquare = ascending.length === 3 && isRationalOneNode(ascending[0]) && chunkUM6BVY2S_cjs.isRationalZero(ascending[1]) && isRationalOneNode(ascending[2]);
+    if (isOnePlusSquare) return { ok: true, value: chunkUM6BVY2S_cjs.callNode("atan", [chunkUM6BVY2S_cjs.varNode(variable)]) };
   }
   return null;
 }
@@ -1457,7 +1690,7 @@ function integrateRationalFunction(node, variable) {
   if (parts === null || parts.variable !== variable) return null;
   const decomposition = partialFractions(parts.numerator, parts.denominator, variable);
   if (decomposition === null) return null;
-  let result = decomposition.polynomial.length > 0 ? polynomialAntiderivative(decomposition.polynomial, variable) : chunk4CVLFLOB_cjs.constNode(0);
+  let result = decomposition.polynomial.length > 0 ? polynomialAntiderivative(decomposition.polynomial, variable) : chunkUM6BVY2S_cjs.constNode(0);
   for (const term of decomposition.terms) {
     const piece = integrateTerm(term, variable);
     if (piece === null) {
@@ -1468,72 +1701,72 @@ function integrateRationalFunction(node, variable) {
     }
     result = { kind: "add", left: result, right: piece };
   }
-  return { ok: true, value: chunk4CVLFLOB_cjs.simplifySymbolic(result) };
+  return { ok: true, value: chunkUM6BVY2S_cjs.simplifySymbolic(result) };
 }
 function integrateTerm(term, variable) {
   const baseDegree = term.base.length - 1;
   const base = coefficientsToNode2(term.base, variable);
   if (baseDegree === 1) {
-    const coefficient = term.numerator[0] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO;
+    const coefficient = term.numerator[0] ?? chunkUM6BVY2S_cjs.RATIONAL_ZERO;
     if (term.power === 1) {
-      return { kind: "mul", left: chunk4CVLFLOB_cjs.constNode(coefficient), right: chunk4CVLFLOB_cjs.callNode("log", [base]) };
+      return { kind: "mul", left: chunkUM6BVY2S_cjs.constNode(coefficient), right: chunkUM6BVY2S_cjs.callNode("log", [base]) };
     }
     const reduced = term.power - 1;
-    const scaled = chunk4CVLFLOB_cjs.rationalDiv(coefficient, { n: BigInt(-reduced), d: 1n });
+    const scaled = chunkUM6BVY2S_cjs.rationalDiv(coefficient, { n: BigInt(-reduced), d: 1n });
     return {
       kind: "div",
-      left: chunk4CVLFLOB_cjs.constNode(scaled),
-      right: chunk4CVLFLOB_cjs.powNode(base, chunk4CVLFLOB_cjs.constNode({ n: BigInt(reduced), d: 1n }))
+      left: chunkUM6BVY2S_cjs.constNode(scaled),
+      right: chunkUM6BVY2S_cjs.powNode(base, chunkUM6BVY2S_cjs.constNode({ n: BigInt(reduced), d: 1n }))
     };
   }
   if (baseDegree !== 2 || term.power !== 1) return null;
   return integrateQuadraticTerm(term, variable, base);
 }
 function integrateQuadraticTerm(term, variable, base) {
-  const constant = term.numerator[0] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO;
-  const linear = term.numerator[1] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO;
+  const constant = term.numerator[0] ?? chunkUM6BVY2S_cjs.RATIONAL_ZERO;
+  const linear = term.numerator[1] ?? chunkUM6BVY2S_cjs.RATIONAL_ZERO;
   const [q, p] = term.base;
   const half = { n: 1n, d: 2n };
-  const halfP = chunk4CVLFLOB_cjs.rationalMul(p, half);
+  const halfP = chunkUM6BVY2S_cjs.rationalMul(p, half);
   const logarithm = {
     kind: "mul",
-    left: chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalMul(linear, half)),
-    right: chunk4CVLFLOB_cjs.callNode("log", [base])
+    left: chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.rationalMul(linear, half)),
+    right: chunkUM6BVY2S_cjs.callNode("log", [base])
   };
-  const leftover = chunk4CVLFLOB_cjs.rationalSub(constant, chunk4CVLFLOB_cjs.rationalMul(linear, halfP));
-  if (chunk4CVLFLOB_cjs.isRationalZero(leftover)) return logarithm;
-  const width = chunk4CVLFLOB_cjs.surdNode(chunk4CVLFLOB_cjs.rationalSub(q, chunk4CVLFLOB_cjs.rationalMul(halfP, halfP)));
+  const leftover = chunkUM6BVY2S_cjs.rationalSub(constant, chunkUM6BVY2S_cjs.rationalMul(linear, halfP));
+  if (chunkUM6BVY2S_cjs.isRationalZero(leftover)) return logarithm;
+  const width = chunkUM6BVY2S_cjs.surdNode(chunkUM6BVY2S_cjs.rationalSub(q, chunkUM6BVY2S_cjs.rationalMul(halfP, halfP)));
   const shifted = {
     kind: "add",
-    left: chunk4CVLFLOB_cjs.varNode(variable),
-    right: chunk4CVLFLOB_cjs.constNode(halfP)
+    left: chunkUM6BVY2S_cjs.varNode(variable),
+    right: chunkUM6BVY2S_cjs.constNode(halfP)
   };
   const arctangent = {
     kind: "mul",
-    left: { kind: "div", left: chunk4CVLFLOB_cjs.constNode(leftover), right: width },
-    right: chunk4CVLFLOB_cjs.callNode("atan", [{ kind: "div", left: shifted, right: width }])
+    left: { kind: "div", left: chunkUM6BVY2S_cjs.constNode(leftover), right: width },
+    right: chunkUM6BVY2S_cjs.callNode("atan", [{ kind: "div", left: shifted, right: width }])
   };
-  return chunk4CVLFLOB_cjs.isRationalZero(linear) ? arctangent : { kind: "add", left: logarithm, right: arctangent };
+  return chunkUM6BVY2S_cjs.isRationalZero(linear) ? arctangent : { kind: "add", left: logarithm, right: arctangent };
 }
 function polynomialAntiderivative(ascending, variable) {
-  let result = chunk4CVLFLOB_cjs.constNode(0);
+  let result = chunkUM6BVY2S_cjs.constNode(0);
   ascending.forEach((coeff, exponent) => {
-    if (chunk4CVLFLOB_cjs.isRationalZero(coeff)) return;
+    if (chunkUM6BVY2S_cjs.isRationalZero(coeff)) return;
     const nextPower = exponent + 1;
-    const scaled = chunk4CVLFLOB_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
+    const scaled = chunkUM6BVY2S_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
     const term = {
       kind: "mul",
-      left: chunk4CVLFLOB_cjs.constNode(scaled),
-      right: nextPower === 1 ? chunk4CVLFLOB_cjs.varNode(variable) : chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.varNode(variable), chunk4CVLFLOB_cjs.constNode(nextPower))
+      left: chunkUM6BVY2S_cjs.constNode(scaled),
+      right: nextPower === 1 ? chunkUM6BVY2S_cjs.varNode(variable) : chunkUM6BVY2S_cjs.powNode(chunkUM6BVY2S_cjs.varNode(variable), chunkUM6BVY2S_cjs.constNode(nextPower))
     };
     result = { kind: "add", left: result, right: term };
   });
   return result;
 }
 function integrate(node, variable) {
-  const simplified = chunk4CVLFLOB_cjs.simplifySymbolic(node);
-  if (!chunk4CVLFLOB_cjs.freeVariables(simplified).has(variable)) {
-    return { ok: true, value: chunk4CVLFLOB_cjs.simplifySymbolic({ kind: "mul", left: simplified, right: chunk4CVLFLOB_cjs.varNode(variable) }) };
+  const simplified = chunkUM6BVY2S_cjs.simplifySymbolic(node);
+  if (!chunkUM6BVY2S_cjs.freeVariables(simplified).has(variable)) {
+    return { ok: true, value: chunkUM6BVY2S_cjs.simplifySymbolic({ kind: "mul", left: simplified, right: chunkUM6BVY2S_cjs.varNode(variable) }) };
   }
   const polynomial = integratePolynomial(simplified, variable);
   if (polynomial !== null) return polynomial;
@@ -1550,13 +1783,13 @@ function integrate(node, variable) {
     if (!right.ok) return right;
     return {
       ok: true,
-      value: chunk4CVLFLOB_cjs.simplifySymbolic({ kind: simplified.kind, left: left.value, right: right.value })
+      value: chunkUM6BVY2S_cjs.simplifySymbolic({ kind: simplified.kind, left: left.value, right: right.value })
     };
   }
   if (simplified.kind === "mul" && simplified.left.kind === "const") {
     const inner = integrate(simplified.right, variable);
     if (!inner.ok) return inner;
-    return { ok: true, value: chunk4CVLFLOB_cjs.simplifySymbolic({ kind: "mul", left: simplified.left, right: inner.value }) };
+    return { ok: true, value: chunkUM6BVY2S_cjs.simplifySymbolic({ kind: "mul", left: simplified.left, right: inner.value }) };
   }
   return {
     ok: false,
@@ -1568,36 +1801,36 @@ function integrate(node, variable) {
 var TAYLOR_MAX_DEGREE = 16;
 function taylorSeries(node, variable, point, degree) {
   if (degree < 0 || !Number.isInteger(degree) || degree > TAYLOR_MAX_DEGREE) {
-    throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
+    throw chunk5KMIY374_cjs.ErrorFactory.execution(
       "SYMBOLIC_TAYLOR_DEGREE_LIMIT",
       `A Taylor degree must be a whole number from 0 to ${TAYLOR_MAX_DEGREE}.`,
       { limit: TAYLOR_MAX_DEGREE }
     );
   }
-  const pointNode = chunk4CVLFLOB_cjs.constNode(point);
+  const pointNode = chunkUM6BVY2S_cjs.constNode(point);
   let factorial = 1n;
-  let result = chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
+  let result = chunkUM6BVY2S_cjs.constNode(chunkUM6BVY2S_cjs.RATIONAL_ZERO);
   for (let order = 0; order <= degree; order++) {
     if (order > 0) factorial *= BigInt(order);
-    const derivative = differentiate(node, variable, order);
-    const atPoint = chunk4CVLFLOB_cjs.simplifySymbolic(chunk4CVLFLOB_cjs.substitute(derivative, variable, pointNode));
+    const derivative = differentiate2(node, variable, order);
+    const atPoint = chunkUM6BVY2S_cjs.simplifySymbolic(chunkUM6BVY2S_cjs.substitute(derivative, variable, pointNode));
     if (atPoint.kind !== "const") {
-      throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
+      throw chunk5KMIY374_cjs.ErrorFactory.execution(
         "SYMBOLIC_TAYLOR_INEXACT",
         `The derivative of order ${order} does not reduce to an exact number at the expansion point, so this series cannot be computed exactly.`,
         { order }
       );
     }
-    const coefficient = chunk4CVLFLOB_cjs.rationalDiv(atPoint.value, { n: factorial, d: 1n });
-    if (chunk4CVLFLOB_cjs.isRationalZero(coefficient)) continue;
-    const shifted = chunk4CVLFLOB_cjs.isRationalZero(point) ? chunk4CVLFLOB_cjs.varNode(variable) : { kind: "sub", left: chunk4CVLFLOB_cjs.varNode(variable), right: pointNode };
-    const power2 = order === 0 ? chunk4CVLFLOB_cjs.constNode(1) : order === 1 ? shifted : chunk4CVLFLOB_cjs.powNode(shifted, chunk4CVLFLOB_cjs.constNode(order));
-    result = { kind: "add", left: result, right: { kind: "mul", left: chunk4CVLFLOB_cjs.constNode(coefficient), right: power2 } };
+    const coefficient = chunkUM6BVY2S_cjs.rationalDiv(atPoint.value, { n: factorial, d: 1n });
+    if (chunkUM6BVY2S_cjs.isRationalZero(coefficient)) continue;
+    const shifted = chunkUM6BVY2S_cjs.isRationalZero(point) ? chunkUM6BVY2S_cjs.varNode(variable) : { kind: "sub", left: chunkUM6BVY2S_cjs.varNode(variable), right: pointNode };
+    const power3 = order === 0 ? chunkUM6BVY2S_cjs.constNode(1) : order === 1 ? shifted : chunkUM6BVY2S_cjs.powNode(shifted, chunkUM6BVY2S_cjs.constNode(order));
+    result = { kind: "add", left: result, right: { kind: "mul", left: chunkUM6BVY2S_cjs.constNode(coefficient), right: power3 } };
   }
-  return chunk4CVLFLOB_cjs.simplifySymbolic(result);
+  return chunkUM6BVY2S_cjs.simplifySymbolic(result);
 }
 function jacobian(functions, variables) {
-  return functions.map((fn) => variables.map((variable) => differentiate(fn, variable)));
+  return functions.map((fn) => variables.map((variable) => differentiate2(fn, variable)));
 }
 
 // src/engine/EngineContext.ts
@@ -1701,7 +1934,7 @@ function adjustForInflation(amount, fromYear, toYear) {
 var ANGLE_KIND = 0;
 function angleInRadians(value) {
   if (value.type === 6 /* Uom */ && value.unit !== void 0) {
-    const entry = chunkMBNQVDVC_cjs.UNIT_TABLE[value.unit.toLowerCase()];
+    const entry = chunkAMOJYLG2_cjs.UNIT_TABLE[value.unit.toLowerCase()];
     if (entry !== void 0 && entry[0] === ANGLE_KIND) return value.toNumber() * entry[1];
   }
   return value.toNumber();
@@ -1709,7 +1942,56 @@ function angleInRadians(value) {
 function pluraliseUnit(unit, count) {
   if (count === 1) return unit;
   const plural = `${unit}s`;
-  return chunkMBNQVDVC_cjs.UNIT_TABLE[plural.toLowerCase()] === void 0 ? unit : plural;
+  return chunkAMOJYLG2_cjs.UNIT_TABLE[plural.toLowerCase()] === void 0 ? unit : plural;
+}
+function extremum(args, wantLargest) {
+  let best;
+  let hasNaN = false;
+  for (const a of args) {
+    if (Number.isNaN(a.toNumber())) {
+      hasNaN = true;
+      continue;
+    }
+    if (best === void 0) {
+      best = a;
+      continue;
+    }
+    const { lv, rv, sameMeasure } = unifyUom(best, a);
+    if (!sameMeasure) {
+      const bestUnit = best.type === 6 /* Uom */ ? best.unit : void 0;
+      const otherUnit = a.type === 6 /* Uom */ ? a.unit : void 0;
+      return chunkJMXUNXQS_cjs.errorValue(
+        "INCOMPATIBLE_UNITS",
+        `Cannot compare incompatible units: ${bestUnit ?? "?"} and ${otherUnit ?? "?"}`
+      );
+    }
+    if (wantLargest ? rv > lv : rv < lv) best = a;
+  }
+  if (hasNaN) return chunkJMXUNXQS_cjs.numberValue(NaN);
+  if (best === void 0) return chunkJMXUNXQS_cjs.numberValue(wantLargest ? -Infinity : Infinity);
+  return best.type === 6 /* Uom */ ? best : chunkJMXUNXQS_cjs.numberValue(best.toNumber());
+}
+function keepUnit(operand, magnitude2) {
+  if (operand.type === 6 /* Uom */ && operand.unit !== void 0) return chunkJMXUNXQS_cjs.uomValue(magnitude2, operand.unit);
+  return chunkJMXUNXQS_cjs.numberValue(magnitude2);
+}
+function nonFiniteEuclidOperand(a, b, name) {
+  if (Number.isFinite(a) && Number.isFinite(b)) return null;
+  const culprit = Number.isFinite(a) ? b : a;
+  return chunkJMXUNXQS_cjs.errorValue(
+    "INVALID_INTEGER_OPERAND",
+    `${name} needs two whole numbers, and ${Number.isNaN(culprit) ? "one of them has no value" : "one of them is infinite"}`
+  );
+}
+function euclidGcd(a, b) {
+  let x = a;
+  let y = b;
+  while (y !== 0) {
+    const t = y;
+    y = x % y;
+    x = t;
+  }
+  return x;
 }
 var builtinFunctions = {
   // ── Populated below ──
@@ -1718,76 +2000,73 @@ var builtinFunctions = {
   // first, so sqrt(-4) is 2i rather than an approximation.
   0: (args) => {
     const value = args[0].toNumber();
-    if (value >= 0) return chunkOC6LTXYS_cjs.numberValue(Math.sqrt(value));
-    return symbolicToValue(chunk4CVLFLOB_cjs.callNode("sqrt", [chunk4CVLFLOB_cjs.constNode(value)]));
+    if (value >= 0) return chunkJMXUNXQS_cjs.numberValue(Math.sqrt(value));
+    return symbolicToValue(chunkUM6BVY2S_cjs.callNode("sqrt", [chunkUM6BVY2S_cjs.constNode(value)]));
   },
   // abs(a): for a Matrix, "|a|" (Calca's determinant-pipe notation) is a
   // valid alias for det(a) (index 64), reusing the SAME implementation
   // not a separate one. Plain-number abs is unaffected.
-  1: (args) => args[0].type === 7 /* Matrix */ ? chunk4CVLFLOB_cjs.determinant(args[0].value) : chunkOC6LTXYS_cjs.numberValue(Math.abs(args[0].toNumber())),
+  1: (args) => args[0].type === 7 /* Matrix */ ? chunkUM6BVY2S_cjs.determinant(args[0].value) : keepUnit(args[0], Math.abs(args[0].toNumber())),
   // sin/cos/tan accept an angle with a unit; see angleInRadians().
-  2: (args) => chunkOC6LTXYS_cjs.numberValue(Math.sin(angleInRadians(args[0]))),
-  3: (args) => chunkOC6LTXYS_cjs.numberValue(Math.cos(angleInRadians(args[0]))),
-  4: (args) => chunkOC6LTXYS_cjs.numberValue(Math.tan(angleInRadians(args[0]))),
-  5: (args) => chunkOC6LTXYS_cjs.numberValue(Math.log(args[0].toNumber())),
-  6: (args) => chunkOC6LTXYS_cjs.numberValue(Math.ceil(args[0].toNumber())),
-  7: (args) => chunkOC6LTXYS_cjs.numberValue(Math.floor(args[0].toNumber())),
-  8: (args) => chunkOC6LTXYS_cjs.numberValue(Math.round(args[0].toNumber())),
-  // min/max: a plain loop replicating Math.min/Math.max's exact semantics
-  // (NaN poisons the result regardless of position; empty args -> ±Infinity)
-  // avoids the intermediate array .map()+spread allocates on every call.
-  9: (args) => {
-    let result = Infinity;
-    let hasNaN = false;
-    for (const a of args) {
-      const n = a.toNumber();
-      if (Number.isNaN(n)) hasNaN = true;
-      else if (n < result) result = n;
-    }
-    return chunkOC6LTXYS_cjs.numberValue(hasNaN ? NaN : result);
-  },
-  10: (args) => {
-    let result = -Infinity;
-    let hasNaN = false;
-    for (const a of args) {
-      const n = a.toNumber();
-      if (Number.isNaN(n)) hasNaN = true;
-      else if (n > result) result = n;
-    }
-    return chunkOC6LTXYS_cjs.numberValue(hasNaN ? NaN : result);
-  },
-  11: (args) => chunkOC6LTXYS_cjs.numberValue(Math.asin(args[0].toNumber())),
-  12: (args) => chunkOC6LTXYS_cjs.numberValue(Math.acos(args[0].toNumber())),
-  13: (args) => chunkOC6LTXYS_cjs.numberValue(Math.atan(args[0].toNumber())),
-  14: (args) => chunkOC6LTXYS_cjs.numberValue(Math.atan2(args[0].toNumber(), args[1].toNumber())),
-  15: (args) => chunkOC6LTXYS_cjs.numberValue(Math.sinh(args[0].toNumber())),
-  16: (args) => chunkOC6LTXYS_cjs.numberValue(Math.cosh(args[0].toNumber())),
-  17: (args) => chunkOC6LTXYS_cjs.numberValue(Math.tanh(args[0].toNumber())),
-  18: (args) => chunkOC6LTXYS_cjs.numberValue(Math.asinh(args[0].toNumber())),
-  19: (args) => chunkOC6LTXYS_cjs.numberValue(Math.acosh(args[0].toNumber())),
-  20: (args) => chunkOC6LTXYS_cjs.numberValue(Math.atanh(args[0].toNumber())),
-  21: (args) => chunkOC6LTXYS_cjs.numberValue(Math.cbrt(args[0].toNumber())),
-  22: (args) => chunkOC6LTXYS_cjs.numberValue(Math.clz32(args[0].toNumber())),
-  23: (args) => chunkOC6LTXYS_cjs.numberValue(Math.expm1(args[0].toNumber())),
-  24: (args) => chunkOC6LTXYS_cjs.numberValue(Math.exp(args[0].toNumber())),
-  25: (args) => chunkOC6LTXYS_cjs.numberValue(Math.fround(args[0].toNumber())),
+  2: (args) => chunkJMXUNXQS_cjs.numberValue(Math.sin(angleInRadians(args[0]))),
+  3: (args) => chunkJMXUNXQS_cjs.numberValue(Math.cos(angleInRadians(args[0]))),
+  4: (args) => chunkJMXUNXQS_cjs.numberValue(Math.tan(angleInRadians(args[0]))),
+  5: (args) => chunkJMXUNXQS_cjs.numberValue(Math.log(args[0].toNumber())),
+  // round/ceil/floor keep a unit for the same reason abs does; see keepUnit().
+  6: (args) => keepUnit(args[0], Math.ceil(args[0].toNumber())),
+  7: (args) => keepUnit(args[0], Math.floor(args[0].toNumber())),
+  8: (args) => keepUnit(args[0], Math.round(args[0].toNumber())),
+  // min/max: see extremum() for why the winner is carried around as a Value
+  // rather than as a running number.
+  9: (args) => extremum(args, false),
+  10: (args) => extremum(args, true),
+  11: (args) => chunkJMXUNXQS_cjs.numberValue(Math.asin(args[0].toNumber())),
+  12: (args) => chunkJMXUNXQS_cjs.numberValue(Math.acos(args[0].toNumber())),
+  13: (args) => chunkJMXUNXQS_cjs.numberValue(Math.atan(args[0].toNumber())),
+  14: (args) => chunkJMXUNXQS_cjs.numberValue(Math.atan2(args[0].toNumber(), args[1].toNumber())),
+  15: (args) => chunkJMXUNXQS_cjs.numberValue(Math.sinh(args[0].toNumber())),
+  16: (args) => chunkJMXUNXQS_cjs.numberValue(Math.cosh(args[0].toNumber())),
+  17: (args) => chunkJMXUNXQS_cjs.numberValue(Math.tanh(args[0].toNumber())),
+  18: (args) => chunkJMXUNXQS_cjs.numberValue(Math.asinh(args[0].toNumber())),
+  19: (args) => chunkJMXUNXQS_cjs.numberValue(Math.acosh(args[0].toNumber())),
+  20: (args) => chunkJMXUNXQS_cjs.numberValue(Math.atanh(args[0].toNumber())),
+  21: (args) => chunkJMXUNXQS_cjs.numberValue(Math.cbrt(args[0].toNumber())),
+  22: (args) => chunkJMXUNXQS_cjs.numberValue(Math.clz32(args[0].toNumber())),
+  23: (args) => chunkJMXUNXQS_cjs.numberValue(Math.expm1(args[0].toNumber())),
+  24: (args) => chunkJMXUNXQS_cjs.numberValue(Math.exp(args[0].toNumber())),
+  25: (args) => chunkJMXUNXQS_cjs.numberValue(Math.fround(args[0].toNumber())),
   // hypot: left as .map()+spread (unlike min/max above), Math.hypot uses
   // a numerically-stable scaling algorithm internally to avoid overflow
   // for very large/small inputs; a naive manual reimplementation risks
   // silently changing results at the extremes, so the tiny array
   // allocation here is the safer trade.
-  26: (args) => chunkOC6LTXYS_cjs.numberValue(Math.hypot(...args.map((a) => a.toNumber()))),
-  27: (args) => chunkOC6LTXYS_cjs.numberValue(Math.imul(args[0].toNumber(), args[1].toNumber())),
-  28: (args) => chunkOC6LTXYS_cjs.numberValue(Math.log10(args[0].toNumber())),
-  29: (args) => chunkOC6LTXYS_cjs.numberValue(Math.log1p(args[0].toNumber())),
-  30: (args) => chunkOC6LTXYS_cjs.numberValue(Math.log2(args[0].toNumber())),
-  31: (args) => chunkOC6LTXYS_cjs.numberValue(Math.pow(args[0].toNumber(), args[1].toNumber())),
-  32: () => chunkOC6LTXYS_cjs.numberValue(Math.random()),
+  26: (args) => chunkJMXUNXQS_cjs.numberValue(Math.hypot(...args.map((a) => a.toNumber()))),
+  27: (args) => chunkJMXUNXQS_cjs.numberValue(Math.imul(args[0].toNumber(), args[1].toNumber())),
+  28: (args) => chunkJMXUNXQS_cjs.numberValue(Math.log10(args[0].toNumber())),
+  29: (args) => chunkJMXUNXQS_cjs.numberValue(Math.log1p(args[0].toNumber())),
+  30: (args) => chunkJMXUNXQS_cjs.numberValue(Math.log2(args[0].toNumber())),
+  // pow(): the spelled-out form of `^`, so a Matrix base means the same
+  // repeated matrix multiplication `^` means. Without this branch
+  // `pow([1,2;3,4], 2)` was Math.pow of a value whose toNumber() is 0, and
+  // came back as the number 0. See vm/MatrixOps.ts's matrixPower().
+  31: (args) => {
+    if (args[0].type === 7 /* Matrix */) {
+      if (args[1].type !== 0 /* Number */) {
+        return chunkJMXUNXQS_cjs.errorValue("MATRIX_POWER_UNSUPPORTED", `pow: a matrix's exponent must be a whole number, as in "pow([1,2;3,4], 2)".`);
+      }
+      return chunkUM6BVY2S_cjs.matrixPower(args[0].value, args[1].value);
+    }
+    if (args[1].type === 7 /* Matrix */) {
+      return chunkJMXUNXQS_cjs.errorValue("MATRIX_POWER_UNSUPPORTED", `pow: a matrix may only be the base, as in "pow([1,2;3,4], 2)".`);
+    }
+    return chunkJMXUNXQS_cjs.numberValue(power(args[0].toNumber(), args[1].toNumber()));
+  },
+  32: () => chunkJMXUNXQS_cjs.numberValue(Math.random()),
   // takes no arguments, unlike its neighbours
-  33: (args) => chunkOC6LTXYS_cjs.numberValue(Math.sign(args[0].toNumber())),
-  34: (args) => chunkOC6LTXYS_cjs.numberValue(Math.trunc(args[0].toNumber())),
-  35: (args) => chunkOC6LTXYS_cjs.numberValue(args[0].toNumber() * Math.PI / 180),
-  36: (args) => chunkOC6LTXYS_cjs.numberValue(args[0].toNumber() * 180 / Math.PI),
+  33: (args) => chunkJMXUNXQS_cjs.numberValue(Math.sign(args[0].toNumber())),
+  34: (args) => chunkJMXUNXQS_cjs.numberValue(Math.trunc(args[0].toNumber())),
+  35: (args) => chunkJMXUNXQS_cjs.numberValue(args[0].toNumber() * Math.PI / 180),
+  36: (args) => chunkJMXUNXQS_cjs.numberValue(args[0].toNumber() * 180 / Math.PI),
   // 37: diceRoll(from, to), random integer in range [from, to] inclusive.
   // A reversed range (from > to) used to silently produce values outside
   // [to, from] via a negative-length Math.random() spread (e.g.
@@ -1797,84 +2076,112 @@ var builtinFunctions = {
     const from = args[0].toNumber();
     const to = args[1].toNumber();
     if (from > to) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `roll: invalid range, ${from} is greater than ${to}`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `roll: invalid range, ${from} is greater than ${to}`);
     }
-    return chunkOC6LTXYS_cjs.numberValue(Math.floor(Math.random() * (to - from + 1)) + from);
+    return chunkJMXUNXQS_cjs.numberValue(Math.floor(Math.random() * (to - from + 1)) + from);
   },
   // gcd(a, b), Euclidean algorithm. Negative inputs are treated by
   // magnitude (gcd is conventionally defined over non-negative integers).
   38: (args) => {
-    let a = Math.trunc(Math.abs(args[0].toNumber()));
-    let b = Math.trunc(Math.abs(args[1].toNumber()));
-    while (b !== 0) {
-      const t = b;
-      b = a % b;
-      a = t;
-    }
-    return chunkOC6LTXYS_cjs.numberValue(a);
+    const a = Math.trunc(Math.abs(args[0].toNumber()));
+    const b = Math.trunc(Math.abs(args[1].toNumber()));
+    const nonFinite = nonFiniteEuclidOperand(a, b, "gcd");
+    if (nonFinite) return nonFinite;
+    return chunkJMXUNXQS_cjs.numberValue(euclidGcd(a, b));
   },
   // lcm(a, b) = |a*b| / gcd(a, b), via the same Euclidean gcd inline
   // (a standalone gcd() call site, no shared helper needed for two uses).
   39: (args) => {
     const a = Math.trunc(Math.abs(args[0].toNumber()));
     const b = Math.trunc(Math.abs(args[1].toNumber()));
-    if (a === 0 || b === 0) return chunkOC6LTXYS_cjs.numberValue(0);
-    let x = a, y = b;
-    while (y !== 0) {
-      const t = y;
-      y = x % y;
-      x = t;
-    }
-    return chunkOC6LTXYS_cjs.numberValue(a / x * b);
+    const nonFinite = nonFiniteEuclidOperand(a, b, "lcm");
+    if (nonFinite) return nonFinite;
+    if (a === 0 || b === 0) return chunkJMXUNXQS_cjs.numberValue(0);
+    return chunkJMXUNXQS_cjs.numberValue(a / euclidGcd(a, b) * b);
   },
   // permutation(n, r) = n! / (n-r)!, computed as a running product
   // rather than two full factorials, so it stays exact for n well
   // beyond where n! itself would exceed Number.MAX_SAFE_INTEGER.
+  //
+  // The loop stops the moment the product stops being a representable
+  // double, which is both the answer `fact` (index 62) already gives for
+  // the same question and the thing that bounds the loop at all. `r` comes
+  // straight off the stack: `permutation(1000000000000, 1000000000000)`
+  // used to run a trillion iterations, of which the first ~170 computed
+  // something and the rest multiplied Infinity by a number, and it had not
+  // returned after thirty seconds. Every factor here is at least 1 and they
+  // descend from `n`, so a product that is still finite after 170 steps
+  // means the factors are small, which in turn means `r <= n` is small: the
+  // early exit bounds the trip count without a separate estimate, and
+  // without ever refusing a permutation that does have an answer.
   40: (args) => {
     const n = Math.trunc(args[0].toNumber());
     const r = Math.trunc(args[1].toNumber());
     if (n < 0 || r < 0 || r > n) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `permutation: invalid n=${n}, r=${r} (require 0 <= r <= n)`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `permutation: invalid n=${n}, r=${r} (require 0 <= r <= n)`);
     }
     let result = 1;
-    for (let i = 0; i < r; i++) result *= n - i;
-    return chunkOC6LTXYS_cjs.numberValue(result);
+    for (let i = 0; i < r; i++) {
+      result *= n - i;
+      if (!Number.isFinite(result)) {
+        return chunkJMXUNXQS_cjs.errorValue(
+          "PERMUTATION_OVERFLOW",
+          `permutation: P(${n}, ${r}) exceeds the maximum representable double (it passed it after ${i + 1} of ${r} factors)`
+        );
+      }
+    }
+    return chunkJMXUNXQS_cjs.numberValue(result);
   },
   // combination(n, r) = n! / (r! * (n-r)!), multiply-then-divide one
   // step at a time (standard technique) keeps every intermediate result
   // an integer, avoiding the overflow a naive factorial-ratio would hit.
+  //
+  // Same early exit, and needed for the same reason: `k = min(r, n-r)`
+  // halves the trip count and bounds nothing, so `combination(1e12, 5e11)`
+  // asked for five hundred billion iterations. The running value is C(n, i),
+  // which grows monotonically to the middle, so once it is past what a
+  // double can hold it never comes back, and the largest run this can now
+  // take is the thousand-odd steps C(n, k) needs to cross that line.
   41: (args) => {
     const n = Math.trunc(args[0].toNumber());
     const r = Math.trunc(args[1].toNumber());
     if (n < 0 || r < 0 || r > n) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `combination: invalid n=${n}, r=${r} (require 0 <= r <= n)`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `combination: invalid n=${n}, r=${r} (require 0 <= r <= n)`);
     }
     const k = Math.min(r, n - r);
     let result = 1;
-    for (let i = 0; i < k; i++) result = result * (n - i) / (i + 1);
-    return chunkOC6LTXYS_cjs.numberValue(Math.round(result));
+    for (let i = 0; i < k; i++) {
+      result = result * (n - i) / (i + 1);
+      if (!Number.isFinite(result)) {
+        return chunkJMXUNXQS_cjs.errorValue(
+          "COMBINATION_OVERFLOW",
+          `combination: C(${n}, ${r}) exceeds the maximum representable double (it passed it after ${i + 1} of ${k} steps)`
+        );
+      }
+    }
+    return chunkJMXUNXQS_cjs.numberValue(Math.round(result));
   },
   // average(...), arithmetic mean of any number of arguments. Backs the
   // MathPhrases package's "average of X, Y, Z" (packages/mathphrases/).
   42: (args) => {
-    if (args.length === 0) return chunkOC6LTXYS_cjs.numberValue(0);
+    if (args.length === 0) return chunkJMXUNXQS_cjs.numberValue(0);
     const sum = args.reduce((acc, a) => acc + a.toNumber(), 0);
-    return chunkOC6LTXYS_cjs.numberValue(sum / args.length);
+    return chunkJMXUNXQS_cjs.numberValue(sum / args.length);
   },
   // median(...), middle value; average of the two middle values for an
   // even argument count.
   43: (args) => {
-    if (args.length === 0) return chunkOC6LTXYS_cjs.numberValue(0);
+    if (args.length === 0) return chunkJMXUNXQS_cjs.numberValue(0);
     const sorted = args.map((a) => a.toNumber()).sort((a, b) => a - b);
     const mid = Math.floor(sorted.length / 2);
-    return chunkOC6LTXYS_cjs.numberValue(
+    return chunkJMXUNXQS_cjs.numberValue(
       sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid]
     );
   },
   // total(...), sum of any number of arguments.
-  44: (args) => chunkOC6LTXYS_cjs.numberValue(args.reduce((acc, a) => acc + a.toNumber(), 0)),
+  44: (args) => chunkJMXUNXQS_cjs.numberValue(args.reduce((acc, a) => acc + a.toNumber(), 0)),
   // count(...), number of arguments passed.
-  45: (args) => chunkOC6LTXYS_cjs.numberValue(args.length),
+  45: (args) => chunkJMXUNXQS_cjs.numberValue(args.length),
   // proportion(a, b, c) -> d such that a:b = c:d, i.e. d = c * (b/a)
   // "A is to B as C is to what". Unit-aware via unifyUom: "5 km is to
   // 500m as 5 cm is to what" unifies 5km/500m to a 10:1 ratio (500m ==
@@ -1885,10 +2192,10 @@ var builtinFunctions = {
     const [a, b, c] = args;
     const { lv: aNum, rv: bNum } = unifyUom(a, b);
     if (aNum === 0) {
-      return chunkOC6LTXYS_cjs.errorValue("PROPORTION_DIVIDE_BY_ZERO", `Cannot compute proportion: "${a.value}" is zero`);
+      return chunkJMXUNXQS_cjs.errorValue("PROPORTION_DIVIDE_BY_ZERO", `Cannot compute proportion: "${a.value}" is zero`);
     }
     const result = c.toNumber() * (bNum / aNum);
-    return c.type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(result, c.unit) : chunkOC6LTXYS_cjs.numberValue(result);
+    return c.type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(result, c.unit) : chunkJMXUNXQS_cjs.numberValue(result);
   },
   // clamp(value, lo, hi), restrict value to [lo, hi]. Backs
   // "clamp X between Y and Z" / "clamp X from Y to Z".
@@ -1897,9 +2204,9 @@ var builtinFunctions = {
     const lo = args[1].toNumber();
     const hi = args[2].toNumber();
     if (lo > hi) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `clamp: invalid range, ${lo} is greater than ${hi}`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `clamp: invalid range, ${lo} is greater than ${hi}`);
     }
-    return chunkOC6LTXYS_cjs.numberValue(Math.min(Math.max(value, lo), hi));
+    return chunkJMXUNXQS_cjs.numberValue(Math.min(Math.max(value, lo), hi));
   },
   // hex(n), Python/JS-style call-syntax hex formatting, e.g. hex(255) ->
   // "0xFF". Distinct from the Converters package's `255 as hex` (see
@@ -1909,16 +2216,16 @@ var builtinFunctions = {
   // function call that returns an ordinary String value, matching
   // Python's hex()/JS convention of a function returning display text,
   // not a numeric type.
-  48: (args) => chunkOC6LTXYS_cjs.hexValue(args[0].toNumber()),
+  48: (args) => chunkJMXUNXQS_cjs.hexValue(args[0].toNumber()),
   // bin(n). Same call-syntax shape as hex() above, e.g. bin(10) -> "0b1010".
-  49: (args) => chunkOC6LTXYS_cjs.hexValue(args[0].toNumber(), "bin"),
+  49: (args) => chunkJMXUNXQS_cjs.hexValue(args[0].toNumber(), "bin"),
   // int(x), coerce ANY value (Number, Percentage, Uom, String, Hex, ...)
   // to a plain integer Number, truncating any fractional part toward
   // zero (Math.trunc semantics: int(5.7) -> 5, int(-5.7) -> -5). Distinct
   // from the Converters package's `x as number` (TO_NUMBER opcode),
   // which only strips a unit/percentage wrapper and keeps any decimal
   // part (e.g. "5.7 as number" -> 5.7), int() additionally truncates.
-  50: (args) => chunkOC6LTXYS_cjs.numberValue(Math.trunc(args[0].toNumber())),
+  50: (args) => chunkJMXUNXQS_cjs.numberValue(Math.trunc(args[0].toNumber())),
   // ── Finance (packages/finance/) ──────────────────────────────────────
   // All finance builtins preserve the principal/amount argument's Uom
   // unit (e.g. a currency like "$") onto the result, matching
@@ -1939,10 +2246,10 @@ var builtinFunctions = {
     const rate = args[1].toNumber();
     const years = args[2].toNumber();
     if (1 + rate <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `compoundInterest: rate ${rate} makes (1 + rate) non-positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `compoundInterest: rate ${rate} makes (1 + rate) non-positive`);
     }
     const fv = principal * Math.pow(1 + rate, years);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(fv, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(fv);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(fv, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(fv);
   },
   // compoundInterestEarned(principal, rate, years) -> FV - principal, the
   // interest-only portion. Backs "interest on $P over Y years at R%" and
@@ -1952,10 +2259,10 @@ var builtinFunctions = {
     const rate = args[1].toNumber();
     const years = args[2].toNumber();
     if (1 + rate <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `interestEarned: rate ${rate} makes (1 + rate) non-positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `interestEarned: rate ${rate} makes (1 + rate) non-positive`);
     }
     const interest = principal * (Math.pow(1 + rate, years) - 1);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(interest, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(interest);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(interest, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(interest);
   },
   // compoundInterestRate(principal, futureValue, years) -> the rate (as a
   // decimal fraction) needed to grow principal to futureValue over years.
@@ -1967,12 +2274,12 @@ var builtinFunctions = {
     const futureValue = args[1].toNumber();
     const years = args[2].toNumber();
     if (principal <= 0 || futureValue <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `compoundInterestRate: principal and futureValue must both be positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `compoundInterestRate: principal and futureValue must both be positive`);
     }
     if (years <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `compoundInterestRate: years must be greater than 0`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `compoundInterestRate: years must be greater than 0`);
     }
-    return chunkOC6LTXYS_cjs.numberValue(Math.pow(futureValue / principal, 1 / years) - 1);
+    return chunkJMXUNXQS_cjs.numberValue(Math.pow(futureValue / principal, 1 / years) - 1);
   },
   // compoundInterestYears(principal, futureValue, rate) -> the number of
   // years needed to grow principal to futureValue at a fixed rate.
@@ -1982,12 +2289,12 @@ var builtinFunctions = {
     const futureValue = args[1].toNumber();
     const rate = args[2].toNumber();
     if (principal <= 0 || futureValue <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `compoundInterestYears: principal and futureValue must both be positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `compoundInterestYears: principal and futureValue must both be positive`);
     }
     if (1 + rate <= 0 || rate === 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `compoundInterestYears: rate ${rate} is not usable (must be > -1 and not 0)`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `compoundInterestYears: rate ${rate} is not usable (must be > -1 and not 0)`);
     }
-    return chunkOC6LTXYS_cjs.numberValue(Math.log(futureValue / principal) / Math.log(1 + rate));
+    return chunkJMXUNXQS_cjs.numberValue(Math.log(futureValue / principal) / Math.log(1 + rate));
   },
   // loanRepayment(principal, rate, years, periodsPerYear), standard
   // amortizing-loan repayment (mortgage formula), redistributed evenly
@@ -2005,13 +2312,13 @@ var builtinFunctions = {
     const rate = args[1].toNumber();
     const years = args[2].toNumber();
     const periodsPerYear = args[3].toNumber();
-    if (principal <= 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `loanRepayment: principal must be positive`);
-    if (years <= 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `loanRepayment: years must be positive`);
-    if (rate < 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `loanRepayment: rate must not be negative`);
-    if (periodsPerYear < 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `loanRepayment: periodsPerYear must not be negative`);
+    if (principal <= 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `loanRepayment: principal must be positive`);
+    if (years <= 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `loanRepayment: years must be positive`);
+    if (rate < 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `loanRepayment: rate must not be negative`);
+    if (periodsPerYear < 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `loanRepayment: periodsPerYear must not be negative`);
     const { totalRepayment } = amortizeLoan(principal, rate, years);
     const result = periodsPerYear === 0 ? totalRepayment : totalRepayment / (years * periodsPerYear);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(result, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(result);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(result, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(result);
   },
   // loanInterest(principal, rate, years, periodsPerYear), the interest
   // portion of index 55's repayment, same periodsPerYear convention.
@@ -2021,13 +2328,13 @@ var builtinFunctions = {
     const rate = args[1].toNumber();
     const years = args[2].toNumber();
     const periodsPerYear = args[3].toNumber();
-    if (principal <= 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `loanInterest: principal must be positive`);
-    if (years <= 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `loanInterest: years must be positive`);
-    if (rate < 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `loanInterest: rate must not be negative`);
-    if (periodsPerYear < 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `loanInterest: periodsPerYear must not be negative`);
+    if (principal <= 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `loanInterest: principal must be positive`);
+    if (years <= 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `loanInterest: years must be positive`);
+    if (rate < 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `loanInterest: rate must not be negative`);
+    if (periodsPerYear < 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `loanInterest: periodsPerYear must not be negative`);
     const { totalInterest } = amortizeLoan(principal, rate, years);
     const result = periodsPerYear === 0 ? totalInterest : totalInterest / (years * periodsPerYear);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(result, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(result);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(result, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(result);
   },
   // monthlyPayment(principal, rate, years), convenience 3-arg wrapper
   // around index 55's monthly case, for direct function-call use without
@@ -2036,11 +2343,11 @@ var builtinFunctions = {
     const principal = args[0].toNumber();
     const rate = args[1].toNumber();
     const years = args[2].toNumber();
-    if (principal <= 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `monthlyPayment: principal must be positive`);
-    if (years <= 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RANGE", `monthlyPayment: years must be positive`);
-    if (rate < 0) return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `monthlyPayment: rate must not be negative`);
+    if (principal <= 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `monthlyPayment: principal must be positive`);
+    if (years <= 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RANGE", `monthlyPayment: years must be positive`);
+    if (rate < 0) return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `monthlyPayment: rate must not be negative`);
     const { monthlyPayment } = amortizeLoan(principal, rate, years);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(monthlyPayment, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(monthlyPayment);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(monthlyPayment, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(monthlyPayment);
   },
   // taxAdd(amount, rate) -> amount * (1 + rate), the tax-inclusive total.
   // Backs the taxAdd() function-call form, whose name promises exactly this.
@@ -2053,7 +2360,7 @@ var builtinFunctions = {
     const amount = args[0].toNumber();
     const rate = args[1].toNumber();
     const result = amount * (1 + rate);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(result, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(result);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(result, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(result);
   },
   // taxRemove(amount, rate) -> amount / (1 + rate), extracts the
   // pre-tax amount from a tax-INCLUSIVE total. Backs "tax off $X at R%" /
@@ -2062,9 +2369,9 @@ var builtinFunctions = {
     const amount = args[0].toNumber();
     const rate = args[1].toNumber();
     if (1 + rate <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `taxRemove: rate ${rate} makes (1 + rate) non-positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `taxRemove: rate ${rate} makes (1 + rate) non-positive`);
     }
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(amount / (1 + rate), args[0].unit) : chunkOC6LTXYS_cjs.numberValue(amount / (1 + rate));
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(amount / (1 + rate), args[0].unit) : chunkJMXUNXQS_cjs.numberValue(amount / (1 + rate));
   },
   // inflationAdjust(amount, fromYear, toYear) -- CPI-based inflation
   // adjustment between two arbitrary years, using the bundled CPI-U
@@ -2084,13 +2391,13 @@ var builtinFunctions = {
     const toYear = args[2].toNumber();
     const ratio = inflationRatio(fromYear, toYear);
     if (ratio === void 0) {
-      return chunkOC6LTXYS_cjs.errorValue(
+      return chunkJMXUNXQS_cjs.errorValue(
         "INFLATION_YEAR_OUT_OF_RANGE",
         `inflationAdjust: fromYear ${fromYear} or toYear ${toYear} is outside the bundled CPI table's range (${CPI_MIN_YEAR}-${CPI_MAX_YEAR})`
       );
     }
     const result = amount * ratio;
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(result, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(result);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(result, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(result);
   },
   // root(n, x) -- the n-th root of x (Numi's `root n (x)` phrasing maps
   // to this same call-style form; see FunctionCallParselet's name map).
@@ -2101,7 +2408,7 @@ var builtinFunctions = {
   61: (args) => {
     const n = args[0].toNumber();
     const x = args[1].toNumber();
-    return chunkOC6LTXYS_cjs.numberValue(Math.pow(x, 1 / n));
+    return chunkJMXUNXQS_cjs.numberValue(power(x, 1 / n));
   },
   // fact(n) / factorial(n) -- integer factorial. Deliberately rejects
   // negative or non-integer input (factorial isn't defined for either
@@ -2112,14 +2419,14 @@ var builtinFunctions = {
   62: (args) => {
     const n = args[0].toNumber();
     if (!Number.isInteger(n) || n < 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_FACTORIAL_INPUT", `fact: ${n} is not a non-negative integer`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_FACTORIAL_INPUT", `fact: ${n} is not a non-negative integer`);
     }
     if (n > 170) {
-      return chunkOC6LTXYS_cjs.errorValue("FACTORIAL_OVERFLOW", `fact: ${n}! exceeds the maximum representable double (170! is the largest finite factorial)`);
+      return chunkJMXUNXQS_cjs.errorValue("FACTORIAL_OVERFLOW", `fact: ${n}! exceeds the maximum representable double (170! is the largest finite factorial)`);
     }
     let result = 1;
     for (let i = 2; i <= n; i++) result *= i;
-    return chunkOC6LTXYS_cjs.numberValue(result);
+    return chunkJMXUNXQS_cjs.numberValue(result);
   },
   // ── Matrix (packages/matrix/) ────────────────────────────────────────
   // transpose(a)/det(a)/inv(a)/dot(a,b), reachable both via ordinary
@@ -2132,17 +2439,17 @@ var builtinFunctions = {
   // own transpose (a 1x1 "matrix" transposed is itself), matches this
   // engine's existing convention of treating a scalar as a trivial 1x1
   // matrix (see Value.ts's toNumber()/isNaN() 1x1 special case).
-  63: (args) => args[0].type === 7 /* Matrix */ ? chunk4CVLFLOB_cjs.transpose(args[0].value) : args[0],
+  63: (args) => args[0].type === 7 /* Matrix */ ? chunkUM6BVY2S_cjs.transpose(args[0].value) : args[0],
   // det(a), determinant. A plain Number's "determinant" is itself (the
   // determinant of a 1x1 matrix [x] is x).
-  64: (args) => args[0].type === 7 /* Matrix */ ? chunk4CVLFLOB_cjs.determinant(args[0].value) : chunkOC6LTXYS_cjs.numberValue(args[0].toNumber()),
+  64: (args) => args[0].type === 7 /* Matrix */ ? chunkUM6BVY2S_cjs.determinant(args[0].value) : chunkJMXUNXQS_cjs.numberValue(args[0].toNumber()),
   // inv(a), matrix inverse for a Matrix; for a plain Number, `1/x`
   // (byte-identical to `Math.pow(x, -1)`, which is what `x^-1` computed
   // before this feature existed. See PrecedenceParser.ts's `^-1`
   // special-case doc comment for why this must stay exact).
   65: (args) => {
-    if (args[0].type === 7 /* Matrix */) return chunk4CVLFLOB_cjs.inverse(args[0].value);
-    return chunkOC6LTXYS_cjs.numberValue(1 / args[0].toNumber());
+    if (args[0].type === 7 /* Matrix */) return chunkUM6BVY2S_cjs.inverse(args[0].value);
+    return chunkJMXUNXQS_cjs.numberValue(1 / args[0].toNumber());
   },
   // dot(a, b), matrix product / scalar-broadcast, the SAME dispatch as
   // the `*` operator between two matrices (vm/VM.ts's MUL case). Plain
@@ -2152,10 +2459,10 @@ var builtinFunctions = {
   66: (args) => {
     const [a, b] = args;
     if (a.type === 0 /* Number */ && b.type === 0 /* Number */) {
-      return chunkOC6LTXYS_cjs.numberValue(a.toNumber() * b.toNumber());
+      return chunkJMXUNXQS_cjs.numberValue(a.toNumber() * b.toNumber());
     }
     const toMatrix = (v) => v.type === 7 /* Matrix */ ? v.value : { rows: 1, cols: 1, data: [v.toNumber()], hasSymbolic: false };
-    return chunk4CVLFLOB_cjs.matrixMultiply(toMatrix(a), toMatrix(b));
+    return chunkUM6BVY2S_cjs.matrixMultiply(toMatrix(a), toMatrix(b));
   },
   // ── Symbolic algebra (packages/symbolic/) ──
   // expand(expr), multiplying out every product and power. Reached only
@@ -2169,7 +2476,7 @@ var builtinFunctions = {
   67: (args) => {
     const [value] = args;
     if (value.type !== 9 /* Symbolic */) return value;
-    return symbolicToValue(chunk4CVLFLOB_cjs.expandSymbolic(value.value));
+    return symbolicToValue(chunkUM6BVY2S_cjs.expandSymbolic(value.value));
   },
   // factor(expr), writing a polynomial as a product of irreducible factors
   // over the RATIONALS. x^2-2 and x^2+1 come back unchanged, which is the
@@ -2186,7 +2493,7 @@ var builtinFunctions = {
   69: (args) => {
     const [lhsValue, rhsValue, variableValue] = args;
     if (variableValue?.type !== 3 /* String */) {
-      return chunkOC6LTXYS_cjs.errorValue("SOLVE_REQUIRES_VARIABLE_NAME", "solve's second argument must be the name of the unknown.");
+      return chunkJMXUNXQS_cjs.errorValue("SOLVE_REQUIRES_VARIABLE_NAME", "solve's second argument must be the name of the unknown.");
     }
     return solveEquationValues(lhsValue, rhsValue, variableValue.value);
   },
@@ -2197,8 +2504,8 @@ var builtinFunctions = {
     const variable = symbolicVariableName(variableValue, "der");
     if (typeof variable !== "string") return variable;
     const expression = valueToSymbolic(target);
-    if (expression === null) return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "der needs an expression with an exact value.");
-    return symbolicToValue(differentiate(expression, variable, orderValue?.toNumber() ?? 1));
+    if (expression === null) return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "der needs an expression with an exact value.");
+    return symbolicToValue(differentiate2(expression, variable, orderValue?.toNumber() ?? 1));
   },
   // integral(expr, variable), the indefinite integral without a constant of
   // integration. Reports what it cannot do rather than approximating; see
@@ -2208,9 +2515,9 @@ var builtinFunctions = {
     const variable = symbolicVariableName(variableValue, "integral");
     if (typeof variable !== "string") return variable;
     const expression = valueToSymbolic(target);
-    if (expression === null) return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "integral needs an expression with an exact value.");
+    if (expression === null) return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "integral needs an expression with an exact value.");
     const result = integrate(expression, variable);
-    if (!result.ok) return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_INTEGRAL_UNSUPPORTED", `Cannot integrate this: ${result.reason}.`);
+    if (!result.ok) return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_INTEGRAL_UNSUPPORTED", `Cannot integrate this: ${result.reason}.`);
     return symbolicToValue(result.value);
   },
   // taylor(expr, variable = point, degree).
@@ -2221,7 +2528,7 @@ var builtinFunctions = {
     const expression = valueToSymbolic(target);
     const point = valueToSymbolic(pointValue);
     if (expression === null || point === null || point.kind !== "const") {
-      return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "taylor needs an expression and an exact expansion point.");
+      return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "taylor needs an expression and an exact expansion point.");
     }
     return symbolicToValue(taylorSeries(expression, variable, point.value, degreeValue.toNumber()));
   },
@@ -2231,23 +2538,23 @@ var builtinFunctions = {
     const functions = [];
     for (const arg of args) {
       const node = valueToSymbolic(arg);
-      if (node === null) return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "jacobian needs expressions with exact values.");
+      if (node === null) return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", "jacobian needs expressions with exact values.");
       functions.push(node);
     }
     const variables = /* @__PURE__ */ new Set();
-    for (const fn of functions) for (const name of chunk4CVLFLOB_cjs.freeVariables(fn)) variables.add(name);
+    for (const fn of functions) for (const name of chunkUM6BVY2S_cjs.freeVariables(fn)) variables.add(name);
     const sorted = [...variables].sort();
-    if (sorted.length === 0) return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_JACOBIAN_NO_VARIABLES", "jacobian needs at least one unknown to differentiate against.");
+    if (sorted.length === 0) return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_JACOBIAN_NO_VARIABLES", "jacobian needs at least one unknown to differentiate against.");
     const rows = jacobian(functions, sorted);
     const rowMajor = [];
     for (const row of rows) {
-      for (const cell of row) rowMajor.push(chunk4CVLFLOB_cjs.symbolicToEntry(cell));
+      for (const cell of row) rowMajor.push(chunkUM6BVY2S_cjs.symbolicToEntry(cell));
     }
-    return chunkOC6LTXYS_cjs.matrixValue(rows.length, sorted.length, chunk4CVLFLOB_cjs.rowMajorToColumnMajor(rows.length, sorted.length, rowMajor));
+    return chunkJMXUNXQS_cjs.matrixValue(rows.length, sorted.length, chunkUM6BVY2S_cjs.rowMajorToColumnMajor(rows.length, sorted.length, rowMajor));
   },
   // An imaginary literal, 3i. The parselet pushes the numeric part and this
   // turns it into an exact imaginary value.
-  74: (args) => symbolicToValue(chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.complex(chunk4CVLFLOB_cjs.RATIONAL_ZERO, chunk4CVLFLOB_cjs.rationalFromNumber(args[0].toNumber())))),
+  74: (args) => symbolicToValue(chunkUM6BVY2S_cjs.complexNode(chunkUM6BVY2S_cjs.complex(chunkUM6BVY2S_cjs.RATIONAL_ZERO, chunkUM6BVY2S_cjs.rationalFromNumber(args[0].toNumber())))),
   // conj(z), re(z) and im(z). Each folds immediately for a literal and stays
   // symbolic for anything still carrying an unknown.
   75: (args) => applyComplexAccessor("conj", args[0]),
@@ -2257,7 +2564,7 @@ var builtinFunctions = {
   78: (args) => {
     const value = args[0];
     if (value.type !== 9 /* Symbolic */) return value;
-    return symbolicToValue(chunk4CVLFLOB_cjs.cancelSymbolic(value.value));
+    return symbolicToValue(chunkUM6BVY2S_cjs.cancelSymbolic(value.value));
   },
   // apart(expr), the partial-fraction decomposition of a rational function.
   79: (args) => {
@@ -2272,10 +2579,10 @@ var builtinFunctions = {
     const amount = args[0].toNumber();
     const rate = args[1].toNumber();
     if (1 + rate <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `taxIn: rate ${rate} makes (1 + rate) non-positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `taxIn: rate ${rate} makes (1 + rate) non-positive`);
     }
     const tax = amount - amount / (1 + rate);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(tax, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(tax);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(tax, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(tax);
   },
   // taxOn(amount, rate) -> amount * rate, the tax itself.
   //
@@ -2288,21 +2595,21 @@ var builtinFunctions = {
     const amount = args[0].toNumber();
     const rate = args[1].toNumber();
     const tax = amount * rate;
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(tax, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(tax);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(tax, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(tax);
   },
   // ── Degree-taking trig (sind/cosd/tand and the inverses) ──────────────
   // The "d" spellings take and return degrees rather than radians, which is
   // the convention every scientific calculator uses. sin(90 degrees) is the
   // other way to say the same thing; both exist because both get typed.
-  87: (args) => chunkOC6LTXYS_cjs.numberValue(Math.sin(args[0].toNumber() * Math.PI / 180)),
-  88: (args) => chunkOC6LTXYS_cjs.numberValue(Math.cos(args[0].toNumber() * Math.PI / 180)),
-  89: (args) => chunkOC6LTXYS_cjs.numberValue(Math.tan(args[0].toNumber() * Math.PI / 180)),
-  90: (args) => chunkOC6LTXYS_cjs.numberValue(Math.asin(args[0].toNumber()) * 180 / Math.PI),
-  91: (args) => chunkOC6LTXYS_cjs.numberValue(Math.acos(args[0].toNumber()) * 180 / Math.PI),
-  92: (args) => chunkOC6LTXYS_cjs.numberValue(Math.atan(args[0].toNumber()) * 180 / Math.PI),
+  87: (args) => chunkJMXUNXQS_cjs.numberValue(Math.sin(args[0].toNumber() * Math.PI / 180)),
+  88: (args) => chunkJMXUNXQS_cjs.numberValue(Math.cos(args[0].toNumber() * Math.PI / 180)),
+  89: (args) => chunkJMXUNXQS_cjs.numberValue(Math.tan(args[0].toNumber() * Math.PI / 180)),
+  90: (args) => chunkJMXUNXQS_cjs.numberValue(Math.asin(args[0].toNumber()) * 180 / Math.PI),
+  91: (args) => chunkJMXUNXQS_cjs.numberValue(Math.acos(args[0].toNumber()) * 180 / Math.PI),
+  92: (args) => chunkJMXUNXQS_cjs.numberValue(Math.atan(args[0].toNumber()) * 180 / Math.PI),
   // daysCount(n) -> n labelled as days. "days in Q3" is a count of days
   // and should say so; a bare 92 loses what was being counted.
-  93: (args) => chunkOC6LTXYS_cjs.uomValue(args[0].toNumber(), "days"),
+  93: (args) => chunkJMXUNXQS_cjs.uomValue(args[0].toNumber(), "days"),
   // asTwoUnits(value, majorUnit, minorUnit) -> "12 min 30 s".
   //
   // "12.5 minutes in minutes and seconds" asks for one quantity split
@@ -2313,25 +2620,28 @@ var builtinFunctions = {
   // so nothing is lost. A pair that is not ordered major-then-minor, or
   // that spans two different measures, reports rather than guessing.
   94: (args) => {
-    const major = args[1].value;
-    const minor = args[2].value;
-    const majorEntry = chunkMBNQVDVC_cjs.UNIT_TABLE[major.toLowerCase()];
-    const minorEntry = chunkMBNQVDVC_cjs.UNIT_TABLE[minor.toLowerCase()];
+    const major = typeof args[1]?.value === "string" ? args[1].value : void 0;
+    const minor = typeof args[2]?.value === "string" ? args[2].value : void 0;
+    if (major === void 0 || minor === void 0) {
+      return chunkJMXUNXQS_cjs.errorValue("UNKNOWN_UNIT", 'both units have to be named, as in "12.5 minutes in minutes and seconds"');
+    }
+    const majorEntry = chunkAMOJYLG2_cjs.UNIT_TABLE[major.toLowerCase()];
+    const minorEntry = chunkAMOJYLG2_cjs.UNIT_TABLE[minor.toLowerCase()];
     if (majorEntry === void 0 || minorEntry === void 0) {
-      return chunkOC6LTXYS_cjs.errorValue("UNKNOWN_UNIT", `${major} and ${minor}: one of these is not a unit`);
+      return chunkJMXUNXQS_cjs.errorValue("UNKNOWN_UNIT", `${major} and ${minor}: one of these is not a unit`);
     }
     if (majorEntry[0] !== minorEntry[0]) {
-      return chunkOC6LTXYS_cjs.errorValue("INCOMPATIBLE_UNITS", `${major} and ${minor} measure different things`);
+      return chunkJMXUNXQS_cjs.errorValue("INCOMPATIBLE_UNITS", `${major} and ${minor} measure different things`);
     }
     if (minorEntry[1] >= majorEntry[1]) {
-      return chunkOC6LTXYS_cjs.errorValue("INCOMPATIBLE_UNITS", `${major} and ${minor}: name the larger unit first`);
+      return chunkJMXUNXQS_cjs.errorValue("INCOMPATIBLE_UNITS", `${major} and ${minor}: name the larger unit first`);
     }
     const source = args[0];
-    const sourceEntry = source.type === 6 /* Uom */ && source.unit !== void 0 ? chunkMBNQVDVC_cjs.UNIT_TABLE[source.unit.toLowerCase()] : void 0;
+    const sourceEntry = source.type === 6 /* Uom */ && source.unit !== void 0 ? chunkAMOJYLG2_cjs.UNIT_TABLE[source.unit.toLowerCase()] : void 0;
     const inBase = source.toNumber() * (sourceEntry?.[1] ?? majorEntry[1]);
     const majorCount = Math.floor(inBase / majorEntry[1]);
     const minorCount = Math.round((inBase - majorCount * majorEntry[1]) / minorEntry[1] * 1e3) / 1e3;
-    return chunkOC6LTXYS_cjs.stringValue(`${majorCount} ${major} ${minorCount} ${minor}`);
+    return chunkJMXUNXQS_cjs.stringValue(`${majorCount} ${major} ${minorCount} ${minor}`);
   },
   // makeRate(value, denominatorUnit) -> value per that unit.
   //
@@ -2347,9 +2657,9 @@ var builtinFunctions = {
     const denominator = String(args[1].value);
     const numerator = source.type === 6 /* Uom */ && source.unit !== void 0 ? source.unit : "";
     if (numerator.includes("/")) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE_UNIT", `${numerator}/${denominator}: that is already a rate`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE_UNIT", `${numerator}/${denominator}: that is already a rate`);
     }
-    return chunkOC6LTXYS_cjs.uomValue(source.toNumber(), `${numerator}/${denominator}`);
+    return chunkJMXUNXQS_cjs.uomValue(source.toNumber(), `${numerator}/${denominator}`);
   },
   // atRate(quantity, rate) -> whichever of the two the question implies.
   //
@@ -2364,28 +2674,28 @@ var builtinFunctions = {
     const left = args[0];
     const rate = args[1];
     if (rate.type !== 6 /* Uom */ || rate.unit === void 0 || !rate.unit.includes("/")) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", 'at: the right-hand side has to be a rate, as in "$30/hour"');
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", 'at: the right-hand side has to be a rate, as in "$30/hour"');
     }
     const slash = rate.unit.indexOf("/");
     const numerator = rate.unit.slice(0, slash);
     const denominator = rate.unit.slice(slash + 1);
     const leftUnit = left.type === 6 /* Uom */ ? left.unit : void 0;
-    const denominatorEntry = chunkMBNQVDVC_cjs.UNIT_TABLE[denominator.toLowerCase()];
-    const leftEntry = leftUnit === void 0 ? void 0 : chunkMBNQVDVC_cjs.UNIT_TABLE[leftUnit.toLowerCase()];
+    const denominatorEntry = chunkAMOJYLG2_cjs.UNIT_TABLE[denominator.toLowerCase()];
+    const leftEntry = leftUnit === void 0 ? void 0 : chunkAMOJYLG2_cjs.UNIT_TABLE[leftUnit.toLowerCase()];
     if (leftEntry !== void 0 && denominatorEntry !== void 0 && leftEntry[0] === denominatorEntry[0]) {
       const inDenominator = left.toNumber() * leftEntry[1] / denominatorEntry[1];
       const total = inDenominator * rate.toNumber();
-      return numerator === "" ? chunkOC6LTXYS_cjs.numberValue(total) : chunkOC6LTXYS_cjs.uomValue(total, numerator);
+      return numerator === "" ? chunkJMXUNXQS_cjs.numberValue(total) : chunkJMXUNXQS_cjs.uomValue(total, numerator);
     }
     if (leftUnit !== void 0 && leftUnit === numerator) {
       const count = left.toNumber() / rate.toNumber();
-      return chunkOC6LTXYS_cjs.uomValue(count, pluraliseUnit(denominator, count));
+      return chunkJMXUNXQS_cjs.uomValue(count, pluraliseUnit(denominator, count));
     }
     if (leftUnit === void 0) {
       const total = left.toNumber() * rate.toNumber();
-      return numerator === "" ? chunkOC6LTXYS_cjs.numberValue(total) : chunkOC6LTXYS_cjs.uomValue(total, numerator);
+      return numerator === "" ? chunkJMXUNXQS_cjs.numberValue(total) : chunkJMXUNXQS_cjs.uomValue(total, numerator);
     }
-    return chunkOC6LTXYS_cjs.errorValue("INCOMPATIBLE_UNITS", `at: ${leftUnit} matches neither side of ${rate.unit}`);
+    return chunkJMXUNXQS_cjs.errorValue("INCOMPATIBLE_UNITS", `at: ${leftUnit} matches neither side of ${rate.unit}`);
   },
   // ── Investments (packages/finance/) ────────────────────────────────────
   // compoundFutureValueEvery(principal, rate, years, periodsPerYear)
@@ -2400,13 +2710,13 @@ var builtinFunctions = {
     const years = args[2].toNumber();
     const perYear = args[3].toNumber();
     if (perYear <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `compounding: ${perYear} periods per year is not a period`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `compounding: ${perYear} periods per year is not a period`);
     }
     if (1 + rate / perYear <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `compounding: rate ${rate} makes each period non-positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `compounding: rate ${rate} makes each period non-positive`);
     }
     const fv = principal * Math.pow(1 + rate / perYear, perYear * years);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(fv, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(fv);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(fv, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(fv);
   },
   // compoundInterestEarnedEvery(principal, rate, years, periodsPerYear)
   // The interest-only portion of index 80, i.e. FV - P.
@@ -2416,10 +2726,10 @@ var builtinFunctions = {
     const years = args[2].toNumber();
     const perYear = args[3].toNumber();
     if (perYear <= 0 || 1 + rate / perYear <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `compounding: rate ${rate} over ${perYear} periods per year is not usable`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `compounding: rate ${rate} over ${perYear} periods per year is not usable`);
     }
     const interest = principal * (Math.pow(1 + rate / perYear, perYear * years) - 1);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(interest, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(interest);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(interest, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(interest);
   },
   // presentValue(futureValue, rate, years) -> FV / (1 + r)^y, what a sum
   // promised in the future is worth today. The inverse of index 51.
@@ -2428,10 +2738,10 @@ var builtinFunctions = {
     const rate = args[1].toNumber();
     const years = args[2].toNumber();
     if (1 + rate <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", `presentValue: rate ${rate} makes (1 + rate) non-positive`);
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", `presentValue: rate ${rate} makes (1 + rate) non-positive`);
     }
     const pv = future / Math.pow(1 + rate, years);
-    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(pv, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(pv);
+    return args[0].type === 6 /* Uom */ ? chunkJMXUNXQS_cjs.uomValue(pv, args[0].unit) : chunkJMXUNXQS_cjs.numberValue(pv);
   },
   // returnOnInvestment(invested, returned) -> (returned - invested) /
   // invested, the gain as a multiple of what was put in. $500 in and $1,500
@@ -2442,9 +2752,9 @@ var builtinFunctions = {
     const invested = args[0].toNumber();
     const returned = args[1].toNumber();
     if (invested === 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", "roi: nothing was invested, so there is no return on it");
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", "roi: nothing was invested, so there is no return on it");
     }
-    return chunkOC6LTXYS_cjs.numberValue((returned - invested) / invested);
+    return chunkJMXUNXQS_cjs.numberValue((returned - invested) / invested);
   },
   // annualisedReturn(invested, returned, years) -> CAGR, the constant
   // yearly rate that turns `invested` into `returned` over `years`:
@@ -2455,25 +2765,45 @@ var builtinFunctions = {
     const returned = args[1].toNumber();
     const years = args[2].toNumber();
     if (invested <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", "annual return: the amount invested must be positive");
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", "annual return: the amount invested must be positive");
     }
     if (years <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", "annual return: the period must be longer than zero");
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", "annual return: the period must be longer than zero");
     }
     if (returned <= 0) {
-      return chunkOC6LTXYS_cjs.errorValue("INVALID_RATE", "annual return: nothing was returned, so there is no annual rate");
+      return chunkJMXUNXQS_cjs.errorValue("INVALID_RATE", "annual return: nothing was returned, so there is no annual rate");
     }
-    return chunkOC6LTXYS_cjs.percentageValue(Math.pow(returned / invested, 1 / years) - 1);
+    return chunkJMXUNXQS_cjs.percentageValue(Math.pow(returned / invested, 1 / years) - 1);
+  },
+  // roundToPlaces(value, places) -> value rounded to that many decimal
+  // places, backing `<value> to <n> dp` (converters/parselets/
+  // RoundingParselets.ts).
+  //
+  // It exists because the obvious bytecode for it, "multiply by 10^p, round,
+  // divide by 10^p", is only safe for values small enough that the multiply
+  // is exact. `1e21 to 2 dp` came back as 999999999999999900000: 1e21 has no
+  // fractional part to round at all, and the round trip through 1e23 was
+  // pure loss. Asking for fewer decimal places than a number has cannot
+  // change it, so a value that is already whole is returned untouched.
+  97: (args) => {
+    const source = args[0];
+    const value = source.toNumber();
+    const places = args[1].toNumber();
+    if (!Number.isFinite(value) || Number.isInteger(value)) return keepUnit(source, value);
+    const scale2 = Math.pow(10, places);
+    const scaled = value * scale2;
+    if (!Number.isFinite(scaled) || Math.abs(scaled) > Number.MAX_SAFE_INTEGER) return keepUnit(source, value);
+    return keepUnit(source, Math.round(scaled) / scale2);
   }
 };
 function applyComplexAccessor(name, value) {
   const node = valueToSymbolic(value);
-  if (node === null) return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", name + " needs a value with an exact number.");
-  return symbolicToValue(chunk4CVLFLOB_cjs.callNode(name, [node]));
+  if (node === null) return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_NONFINITE_OPERAND", name + " needs a value with an exact number.");
+  return symbolicToValue(chunkUM6BVY2S_cjs.callNode(name, [node]));
 }
 function symbolicVariableName(value, verb) {
   if (value?.type !== 3 /* String */) {
-    return chunkOC6LTXYS_cjs.errorValue("SYMBOLIC_REQUIRES_VARIABLE_NAME", `${verb} needs the name of an unknown.`);
+    return chunkJMXUNXQS_cjs.errorValue("SYMBOLIC_REQUIRES_VARIABLE_NAME", `${verb} needs the name of an unknown.`);
   }
   return value.value;
 }
@@ -2490,7 +2820,7 @@ var MAX_PLUGIN_FUNCTION_INDEX = 255;
 var nextPluginFunctionIndex = 0;
 function allocatePluginFunctionIndex() {
   if (nextPluginFunctionIndex > MAX_PLUGIN_FUNCTION_INDEX) {
-    throw chunkM4N5GA5Z_cjs.ErrorFactory.config(
+    throw chunk5KMIY374_cjs.ErrorFactory.config(
       "PLUGIN_FUNCTION_INDEX_POOL_EXHAUSTED",
       `allocatePluginFunctionIndex: pool exhausted (max ${MAX_PLUGIN_FUNCTION_INDEX + 1} allocations).`
     );
@@ -2621,12 +2951,17 @@ exports.SYMBOLIC_NATIVE_BUILTINS = SYMBOLIC_NATIVE_BUILTINS;
 exports.adjustForInflation = adjustForInflation;
 exports.allocatePluginFunctionIndex = allocatePluginFunctionIndex;
 exports.asConverterRegistry = asConverterRegistry;
+exports.bigIntDivisionByZero = bigIntDivisionByZero;
 exports.binaryOp = binaryOp;
 exports.builtinFunctions = builtinFunctions;
+exports.compareBigIntOperands = compareBigIntOperands;
+exports.compareUom = compareUom;
 exports.createEngineContext = createEngineContext;
 exports.defaultEngineContext = defaultEngineContext;
 exports.globalDagKey = globalDagKey;
+exports.incomparableUnitsError = incomparableUnitsError;
 exports.pluginFunctionRegistry = pluginFunctionRegistry;
+exports.power = power;
 exports.registerAsConverter = registerAsConverter;
 exports.sharedGlobalVariableStore = sharedGlobalVariableStore;
 exports.sharedOpRegistry = sharedOpRegistry;
@@ -2634,7 +2969,8 @@ exports.solveEquationValues = solveEquationValues;
 exports.symbolicBuiltin = symbolicBuiltin;
 exports.symbolicNeg = symbolicNeg;
 exports.symbolicPow = symbolicPow;
+exports.toBigIntOperand = toBigIntOperand;
 exports.unifyUom = unifyUom;
 exports.unregisterAsConverter = unregisterAsConverter;
-//# sourceMappingURL=chunk-BXKJLM5R.cjs.map
-//# sourceMappingURL=chunk-BXKJLM5R.cjs.map
+//# sourceMappingURL=chunk-6WFMPTGB.cjs.map
+//# sourceMappingURL=chunk-6WFMPTGB.cjs.map