solve-engine 1.0.0-beta.2 → 1.0.0-beta.4

package/dist/{chunk-J73SJHR3.cjs → chunk-2NPS5DQ3.cjs}

@@ -1,62 +1,63 @@
 'use strict';
 
 var chunkFEAIOR7N_cjs = require('./chunk-FEAIOR7N.cjs');
-var chunkXJCMXB2E_cjs = require('./chunk-XJCMXB2E.cjs');
-var chunkHTXVVJRA_cjs = require('./chunk-HTXVVJRA.cjs');
+var chunk2MV4HBKC_cjs = require('./chunk-2MV4HBKC.cjs');
+var chunk4CVLFLOB_cjs = require('./chunk-4CVLFLOB.cjs');
 var chunkOC6LTXYS_cjs = require('./chunk-OC6LTXYS.cjs');
-var chunkQNJ4ACRT_cjs = require('./chunk-QNJ4ACRT.cjs');
+var chunkNJTXJ5AG_cjs = require('./chunk-NJTXJ5AG.cjs');
+var chunkMBNQVDVC_cjs = require('./chunk-MBNQVDVC.cjs');
 var chunkM4N5GA5Z_cjs = require('./chunk-M4N5GA5Z.cjs');
 
 // src/symbolic/MultivariateFactor.ts
 function exactRoot(value, degree) {
-  const rootOf = degree === 2 ? chunkHTXVVJRA_cjs.exactIntegerSqrt : chunkHTXVVJRA_cjs.exactIntegerCbrt;
+  const rootOf = degree === 2 ? chunk4CVLFLOB_cjs.exactIntegerSqrt : chunk4CVLFLOB_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 = chunkHTXVVJRA_cjs.monomialFromKey(key);
+  const monomial = chunk4CVLFLOB_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 chunkHTXVVJRA_cjs.monomialToKey(root);
+  return chunk4CVLFLOB_cjs.monomialToKey(root);
 }
 function monomialMul(a, b) {
-  const product2 = chunkHTXVVJRA_cjs.monomialFromKey(a);
-  for (const [name, exponent] of chunkHTXVVJRA_cjs.monomialFromKey(b)) {
+  const product2 = chunk4CVLFLOB_cjs.monomialFromKey(a);
+  for (const [name, exponent] of chunk4CVLFLOB_cjs.monomialFromKey(b)) {
     product2.set(name, (product2.get(name) ?? 0) + exponent);
   }
-  return chunkHTXVVJRA_cjs.monomialToKey(product2);
+  return chunk4CVLFLOB_cjs.monomialToKey(product2);
 }
 function monomialDiv(a, b) {
-  const quotient = chunkHTXVVJRA_cjs.monomialFromKey(a);
-  for (const [name, exponent] of chunkHTXVVJRA_cjs.monomialFromKey(b)) {
+  const quotient = chunk4CVLFLOB_cjs.monomialFromKey(a);
+  for (const [name, exponent] of chunk4CVLFLOB_cjs.monomialFromKey(b)) {
     const remaining = (quotient.get(name) ?? 0) - exponent;
     if (remaining <= 0) quotient.delete(name);
     else quotient.set(name, remaining);
   }
-  return chunkHTXVVJRA_cjs.monomialToKey(quotient);
+  return chunk4CVLFLOB_cjs.monomialToKey(quotient);
 }
 function monomialGcd(a, b) {
-  const left = chunkHTXVVJRA_cjs.monomialFromKey(a);
+  const left = chunk4CVLFLOB_cjs.monomialFromKey(a);
   const shared = /* @__PURE__ */ new Map();
-  for (const [name, exponent] of chunkHTXVVJRA_cjs.monomialFromKey(b)) {
+  for (const [name, exponent] of chunk4CVLFLOB_cjs.monomialFromKey(b)) {
     const other = left.get(name);
     if (other !== void 0) shared.set(name, Math.min(other, exponent));
   }
-  return chunkHTXVVJRA_cjs.monomialToKey(shared);
+  return chunk4CVLFLOB_cjs.monomialToKey(shared);
 }
 function namesOf(keys) {
   const names = /* @__PURE__ */ new Set();
-  for (const key of keys) for (const name of chunkHTXVVJRA_cjs.monomialFromKey(key).keys()) names.add(name);
+  for (const key of keys) for (const name of chunk4CVLFLOB_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 chunkHTXVVJRA_cjs.fromPolynomial({ terms: map, vars: namesOf(terms.map((term) => term.key)) });
+  return chunk4CVLFLOB_cjs.fromPolynomial({ terms: map, vars: namesOf(terms.map((term) => term.key)) });
 }
 function product(factors) {
   let result = factors[0];
@@ -65,7 +66,7 @@ function product(factors) {
 }
 function orderedTerms(p) {
   const terms = [...p.terms].map(([key, coefficient]) => ({ key, coefficient }));
-  return terms.sort((a, b) => chunkHTXVVJRA_cjs.compareMonomials(a.key, b.key, p.vars));
+  return terms.sort((a, b) => chunk4CVLFLOB_cjs.compareMonomials(a.key, b.key, p.vars));
 }
 function factorMultivariate(p) {
   if (p.vars.length < 2) return null;
@@ -93,7 +94,7 @@ 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 ? chunkHTXVVJRA_cjs.rationalNeg(second.coefficient) : second.coefficient;
+  const magnitude = second.coefficient.n < 0n ? chunk4CVLFLOB_cjs.rationalNeg(second.coefficient) : second.coefficient;
   const firstRoot = exactRoot(first.coefficient, degree);
   const secondRoot = exactRoot(magnitude, degree);
   if (firstRoot === null || secondRoot === null) return null;
@@ -103,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: chunkHTXVVJRA_cjs.rationalNeg(term.coefficient) };
+  return { key: term.key, coefficient: chunk4CVLFLOB_cjs.rationalNeg(term.coefficient) };
 }
 function multiplyTerms(a, b) {
-  return { key: monomialMul(a.key, b.key), coefficient: chunkHTXVVJRA_cjs.rationalMul(a.coefficient, b.coefficient) };
+  return { key: monomialMul(a.key, b.key), coefficient: chunk4CVLFLOB_cjs.rationalMul(a.coefficient, b.coefficient) };
 }
 function squareOf(term) {
   return multiplyTerms(term, term);
@@ -118,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 = chunkHTXVVJRA_cjs.rationalMul(cross.coefficient, { n: 2n, d: 1n });
+  const twice = chunk4CVLFLOB_cjs.rationalMul(cross.coefficient, { n: 2n, d: 1n });
   const negative = middle.coefficient.n < 0n;
-  const magnitude = negative ? chunkHTXVVJRA_cjs.rationalNeg(middle.coefficient) : middle.coefficient;
-  if (!chunkHTXVVJRA_cjs.isRationalOne(chunkHTXVVJRA_cjs.rationalDiv(magnitude, twice))) return null;
+  const magnitude = negative ? chunk4CVLFLOB_cjs.rationalNeg(middle.coefficient) : middle.coefficient;
+  if (!chunk4CVLFLOB_cjs.isRationalOne(chunk4CVLFLOB_cjs.rationalDiv(magnitude, twice))) return null;
   const base = termsToNode([roots.a, negative ? negated(roots.b) : roots.b]);
-  return { kind: "pow", base, exponent: chunkHTXVVJRA_cjs.constNode(2) };
+  return { kind: "pow", base, exponent: chunk4CVLFLOB_cjs.constNode(2) };
 }
 function factorByGrouping(terms) {
   const pairings = [
@@ -148,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: chunkHTXVVJRA_cjs.rationalDiv(second.coefficient, first.coefficient) }
+    { key: monomialDiv(second.key, shared), coefficient: chunk4CVLFLOB_cjs.rationalDiv(second.coefficient, first.coefficient) }
   ];
   return cofactor[0].key === cofactor[1].key ? null : { common, cofactor };
 }
@@ -188,14 +189,14 @@ function divisors(value) {
   return found;
 }
 function evaluateAt(descending, x) {
-  let total = chunkHTXVVJRA_cjs.RATIONAL_ZERO;
-  for (const coeff of descending) total = chunkHTXVVJRA_cjs.rationalAdd(chunkHTXVVJRA_cjs.rationalMul(total, x), coeff);
+  let total = chunk4CVLFLOB_cjs.RATIONAL_ZERO;
+  for (const coeff of descending) total = chunk4CVLFLOB_cjs.rationalAdd(chunk4CVLFLOB_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(chunkHTXVVJRA_cjs.rationalAdd(descending[i], chunkHTXVVJRA_cjs.rationalMul(quotient[i - 1], root)));
+    quotient.push(chunk4CVLFLOB_cjs.rationalAdd(descending[i], chunk4CVLFLOB_cjs.rationalMul(quotient[i - 1], root)));
   }
   return quotient;
 }
@@ -232,25 +233,25 @@ function rationalRoots(descending) {
         const key = `${candidate.n}/${candidate.d}`;
         if (seen.has(key)) continue;
         seen.add(key);
-        if (chunkHTXVVJRA_cjs.isRationalZero(evaluateAt(descending, candidate))) roots.push(candidate);
+        if (chunk4CVLFLOB_cjs.isRationalZero(evaluateAt(descending, candidate))) roots.push(candidate);
       }
     }
   }
   return roots;
 }
 function linearFactorNode(variable, root) {
-  if (chunkHTXVVJRA_cjs.isRationalZero(root)) return chunkHTXVVJRA_cjs.varNode(variable);
-  return root.n > 0n ? { kind: "sub", left: chunkHTXVVJRA_cjs.varNode(variable), right: chunkHTXVVJRA_cjs.constNode(root) } : { kind: "add", left: chunkHTXVVJRA_cjs.varNode(variable), right: chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalNeg(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)) };
 }
 function coefficientsToNode(descending, variable) {
   const degree = descending.length - 1;
   const terms = /* @__PURE__ */ new Map();
   descending.forEach((coeff, index) => {
-    if (chunkHTXVVJRA_cjs.isRationalZero(coeff)) return;
+    if (chunk4CVLFLOB_cjs.isRationalZero(coeff)) return;
     const power2 = degree - index;
     terms.set(power2 === 0 ? "" : power2 === 1 ? variable : `${variable}^${power2}`, coeff);
   });
-  return chunkHTXVVJRA_cjs.fromPolynomial({ terms, vars: terms.size > 0 ? [variable] : [] });
+  return chunk4CVLFLOB_cjs.fromPolynomial({ terms, vars: terms.size > 0 ? [variable] : [] });
 }
 function factorUnivariate(descending, variable) {
   const factors = [];
@@ -259,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 && chunkHTXVVJRA_cjs.isRationalZero(evaluateAt(remaining, root))) {
+      while (remaining.length > 1 && chunk4CVLFLOB_cjs.isRationalZero(evaluateAt(remaining, root))) {
         remaining = divideByRoot(remaining, root);
         multiplicity++;
       }
@@ -270,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: chunkHTXVVJRA_cjs.RATIONAL_ONE, factors };
+    return { content: chunk4CVLFLOB_cjs.RATIONAL_ONE, factors };
   }
-  return { content: remaining.length === 1 ? remaining[0] : chunkHTXVVJRA_cjs.RATIONAL_ONE, factors };
+  return { content: remaining.length === 1 ? remaining[0] : chunk4CVLFLOB_cjs.RATIONAL_ONE, factors };
 }
 function factorizationToNode(factorization) {
   const pieces = [];
-  if (!chunkHTXVVJRA_cjs.isRationalOne(factorization.content)) pieces.push(chunkHTXVVJRA_cjs.constNode(factorization.content));
+  if (!chunk4CVLFLOB_cjs.isRationalOne(factorization.content)) pieces.push(chunk4CVLFLOB_cjs.constNode(factorization.content));
   for (const factor of factorization.factors) {
-    pieces.push(factor.power === 1 ? factor.base : chunkHTXVVJRA_cjs.powNode(factor.base, chunkHTXVVJRA_cjs.constNode({ n: BigInt(factor.power), d: 1n })));
+    pieces.push(factor.power === 1 ? factor.base : chunk4CVLFLOB_cjs.powNode(factor.base, chunk4CVLFLOB_cjs.constNode({ n: BigInt(factor.power), d: 1n })));
   }
-  if (pieces.length === 0) return chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.RATIONAL_ONE);
+  if (pieces.length === 0) return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_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;
@@ -292,7 +293,7 @@ function contentOf(p) {
     numeratorGcd = gcd(numeratorGcd, coeff.n);
     denominatorLcm = lcm(denominatorLcm, coeff.d);
   }
-  if (numeratorGcd === 0n) return chunkHTXVVJRA_cjs.RATIONAL_ONE;
+  if (numeratorGcd === 0n) return chunk4CVLFLOB_cjs.RATIONAL_ONE;
   return { n: numeratorGcd, d: denominatorLcm };
 }
 function extractCommonMonomial(p) {
@@ -338,48 +339,48 @@ function monomialNode(monomial) {
   let result = null;
   for (const name of names) {
     const exponent = monomial.get(name);
-    const factor = exponent === 1 ? chunkHTXVVJRA_cjs.varNode(name) : chunkHTXVVJRA_cjs.powNode(chunkHTXVVJRA_cjs.varNode(name), chunkHTXVVJRA_cjs.constNode({ n: BigInt(exponent), d: 1n }));
+    const factor = exponent === 1 ? chunk4CVLFLOB_cjs.varNode(name) : chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.varNode(name), chunk4CVLFLOB_cjs.constNode({ n: BigInt(exponent), d: 1n }));
     result = result === null ? factor : { kind: "mul", left: result, right: factor };
   }
   return result;
 }
 function factorSymbolic(node) {
-  const polynomial = chunkHTXVVJRA_cjs.toPolynomial(node);
+  const polynomial = chunk4CVLFLOB_cjs.toPolynomial(node);
   if (polynomial === null || polynomial.terms.size === 0) return node;
-  if (chunkHTXVVJRA_cjs.polyDegree(polynomial) > FACTOR_MAX_DEGREE) return node;
+  if (chunk4CVLFLOB_cjs.polyDegree(polynomial) > FACTOR_MAX_DEGREE) return node;
   if (polynomial.vars.length === 0) return node;
   const content = contentOf(polynomial);
-  const primitive = chunkHTXVVJRA_cjs.isRationalOne(content) ? polynomial : scaleTerms(polynomial, chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.RATIONAL_ONE, content));
+  const primitive = chunk4CVLFLOB_cjs.isRationalOne(content) ? polynomial : scaleTerms(polynomial, chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.RATIONAL_ONE, content));
   const { monomial, reduced } = extractCommonMonomial(primitive);
   const monomialFactor = monomialNode(monomial);
-  const variable = chunkHTXVVJRA_cjs.polyUnivariateVar(reduced);
+  const variable = chunk4CVLFLOB_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 = [...chunkHTXVVJRA_cjs.polyCoefficients(reduced, variable)].reverse();
+  const descending = [...chunk4CVLFLOB_cjs.polyCoefficients(reduced, variable)].reverse();
   const factorization = factorUnivariate(descending, variable);
-  const combinedContent = chunkHTXVVJRA_cjs.rationalMul(content, factorization.content);
-  const isUnchanged = factorization.factors.length <= 1 && (factorization.factors[0]?.power ?? 1) === 1 && monomialFactor === null && chunkHTXVVJRA_cjs.isRationalOne(combinedContent);
+  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);
   if (isUnchanged) return node;
   const pieces = [];
-  if (!chunkHTXVVJRA_cjs.isRationalOne(combinedContent)) pieces.push(chunkHTXVVJRA_cjs.constNode(combinedContent));
+  if (!chunk4CVLFLOB_cjs.isRationalOne(combinedContent)) pieces.push(chunk4CVLFLOB_cjs.constNode(combinedContent));
   if (monomialFactor !== null) pieces.push(monomialFactor);
-  pieces.push(factorizationToNode({ content: chunkHTXVVJRA_cjs.RATIONAL_ONE, factors: factorization.factors }));
+  pieces.push(factorizationToNode({ content: chunk4CVLFLOB_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, chunkHTXVVJRA_cjs.rationalMul(coeff, k));
+  for (const [key, coeff] of p.terms) terms.set(key, chunk4CVLFLOB_cjs.rationalMul(coeff, k));
   return { terms, vars: p.vars };
 }
 function assemble(content, monomialFactor, factored) {
   const pieces = [];
-  if (!chunkHTXVVJRA_cjs.isRationalOne(content)) pieces.push(chunkHTXVVJRA_cjs.constNode(content));
+  if (!chunk4CVLFLOB_cjs.isRationalOne(content)) pieces.push(chunk4CVLFLOB_cjs.constNode(content));
   if (monomialFactor !== null) pieces.push(monomialFactor);
   pieces.push(factored);
   let result = pieces[0];
@@ -387,11 +388,11 @@ function assemble(content, monomialFactor, factored) {
   return result;
 }
 function buildPieces(content, monomialFactor, reduced) {
-  if (monomialFactor === null && chunkHTXVVJRA_cjs.isRationalOne(content)) return null;
+  if (monomialFactor === null && chunk4CVLFLOB_cjs.isRationalOne(content)) return null;
   const pieces = [];
-  if (!chunkHTXVVJRA_cjs.isRationalOne(content)) pieces.push(chunkHTXVVJRA_cjs.constNode(content));
+  if (!chunk4CVLFLOB_cjs.isRationalOne(content)) pieces.push(chunk4CVLFLOB_cjs.constNode(content));
   if (monomialFactor !== null) pieces.push(monomialFactor);
-  pieces.push(chunkHTXVVJRA_cjs.fromPolynomial(reduced));
+  pieces.push(chunk4CVLFLOB_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;
@@ -402,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 = chunkHTXVVJRA_cjs.rationalNeg(chunkHTXVVJRA_cjs.rationalDiv(b, chunkHTXVVJRA_cjs.rationalMul(THREE, a)));
-  const p = chunkHTXVVJRA_cjs.rationalDiv(
-    chunkHTXVVJRA_cjs.rationalSub(chunkHTXVVJRA_cjs.rationalMul(THREE, chunkHTXVVJRA_cjs.rationalMul(a, c)), chunkHTXVVJRA_cjs.rationalMul(b, b)),
-    chunkHTXVVJRA_cjs.rationalMul(THREE, chunkHTXVVJRA_cjs.rationalMul(a, a))
+  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 twoBCubed = chunkHTXVVJRA_cjs.rationalMul(TWO, chunkHTXVVJRA_cjs.rationalMul(b, chunkHTXVVJRA_cjs.rationalMul(b, b)));
-  const nineABC = chunkHTXVVJRA_cjs.rationalMul({ n: 9n, d: 1n }, chunkHTXVVJRA_cjs.rationalMul(a, chunkHTXVVJRA_cjs.rationalMul(b, c)));
-  const twentySevenAAD = chunkHTXVVJRA_cjs.rationalMul({ n: 27n, d: 1n }, chunkHTXVVJRA_cjs.rationalMul(chunkHTXVVJRA_cjs.rationalMul(a, a), d));
-  const q = chunkHTXVVJRA_cjs.rationalDiv(
-    chunkHTXVVJRA_cjs.rationalAdd(chunkHTXVVJRA_cjs.rationalSub(twoBCubed, nineABC), twentySevenAAD),
-    chunkHTXVVJRA_cjs.rationalMul({ n: 27n, d: 1n }, chunkHTXVVJRA_cjs.rationalMul(a, chunkHTXVVJRA_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)))
   );
   return { p, q, shift };
 }
 function solveCubic(a, b, c, d) {
   const { p, q, shift } = depressCubic(a, b, c, d);
-  const discriminant = chunkHTXVVJRA_cjs.rationalNeg(
-    chunkHTXVVJRA_cjs.rationalAdd(
-      chunkHTXVVJRA_cjs.rationalMul(FOUR, chunkHTXVVJRA_cjs.rationalMul(p, chunkHTXVVJRA_cjs.rationalMul(p, p))),
-      chunkHTXVVJRA_cjs.rationalMul({ n: 27n, d: 1n }, chunkHTXVVJRA_cjs.rationalMul(q, q))
+  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))
     )
   );
-  if (chunkHTXVVJRA_cjs.rationalCompare(discriminant, chunkHTXVVJRA_cjs.RATIONAL_ZERO) > 0) {
+  if (chunk4CVLFLOB_cjs.rationalCompare(discriminant, chunk4CVLFLOB_cjs.RATIONAL_ZERO) > 0) {
     return { exact: [], approximate: trigonometricRoots(p, q, shift) };
   }
-  if (chunkHTXVVJRA_cjs.isRationalZero(discriminant)) return { exact: repeatedCubicRoots(p, q, shift), approximate: [] };
+  if (chunk4CVLFLOB_cjs.isRationalZero(discriminant)) return { exact: repeatedCubicRoots(p, q, shift), approximate: [] };
   return { exact: cardanoRoots(p, q, shift), approximate: [] };
 }
 function repeatedCubicRoots(p, q, shift) {
-  if (chunkHTXVVJRA_cjs.isRationalZero(p)) return [chunkHTXVVJRA_cjs.constNode(shift)];
-  const simple = chunkHTXVVJRA_cjs.rationalAdd(chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(THREE, q), p), shift);
-  const repeated = chunkHTXVVJRA_cjs.rationalAdd(chunkHTXVVJRA_cjs.rationalNeg(chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(THREE, q), chunkHTXVVJRA_cjs.rationalMul(TWO, p))), shift);
-  const ordered = [simple, repeated].sort(chunkHTXVVJRA_cjs.rationalCompare);
-  return ordered.map(chunkHTXVVJRA_cjs.constNode);
+  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);
 }
 function cardanoRoots(p, q, shift) {
-  const half = chunkHTXVVJRA_cjs.rationalNeg(chunkHTXVVJRA_cjs.rationalDiv(q, TWO));
-  const radicand = chunkHTXVVJRA_cjs.rationalAdd(
-    chunkHTXVVJRA_cjs.rationalMul(chunkHTXVVJRA_cjs.rationalDiv(q, TWO), chunkHTXVVJRA_cjs.rationalDiv(q, TWO)),
-    chunkHTXVVJRA_cjs.rationalMul(chunkHTXVVJRA_cjs.rationalDiv(p, THREE), chunkHTXVVJRA_cjs.rationalMul(chunkHTXVVJRA_cjs.rationalDiv(p, THREE), chunkHTXVVJRA_cjs.rationalDiv(p, THREE)))
+  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 inner = chunkHTXVVJRA_cjs.surdNode(radicand);
-  const u = { kind: "call", name: "cbrt", args: [{ kind: "add", left: chunkHTXVVJRA_cjs.constNode(half), right: inner }] };
-  const v = { kind: "call", name: "cbrt", args: [{ kind: "sub", left: chunkHTXVVJRA_cjs.constNode(half), right: inner }] };
+  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 sum = { kind: "add", left: u, right: v };
   const difference = { kind: "sub", left: u, right: v };
-  const real = { kind: "add", left: chunkHTXVVJRA_cjs.constNode(shift), right: { kind: "div", left: { kind: "neg", operand: sum }, right: chunkHTXVVJRA_cjs.constNode(TWO) } };
+  const real = { kind: "add", left: chunk4CVLFLOB_cjs.constNode(shift), right: { kind: "div", left: { kind: "neg", operand: sum }, right: chunk4CVLFLOB_cjs.constNode(TWO) } };
   const imaginary = {
     kind: "mul",
-    left: { kind: "div", left: { kind: "mul", left: difference, right: chunkHTXVVJRA_cjs.surdNode(THREE) }, right: chunkHTXVVJRA_cjs.constNode(TWO) },
-    right: chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.COMPLEX_I)
+    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)
   };
   return [
-    { kind: "add", left: chunkHTXVVJRA_cjs.constNode(shift), right: sum },
+    { kind: "add", left: chunk4CVLFLOB_cjs.constNode(shift), right: sum },
     { kind: "sub", left: real, right: imaginary },
     { kind: "add", left: real, right: imaginary }
   ];
 }
 function trigonometricRoots(p, q, shift) {
-  const pNumber = chunkHTXVVJRA_cjs.rationalToNumber(p);
-  const qNumber = chunkHTXVVJRA_cjs.rationalToNumber(q);
-  const shiftNumber = chunkHTXVVJRA_cjs.rationalToNumber(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 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);
 }
 function depressQuartic(b, c, d, e) {
-  const shift = chunkHTXVVJRA_cjs.rationalNeg(chunkHTXVVJRA_cjs.rationalDiv(b, FOUR));
-  const bb = chunkHTXVVJRA_cjs.rationalMul(b, b);
-  const p = chunkHTXVVJRA_cjs.rationalSub(c, chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(THREE, bb), { n: 8n, d: 1n }));
-  const q = chunkHTXVVJRA_cjs.rationalAdd(
-    chunkHTXVVJRA_cjs.rationalSub(d, chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(b, c), TWO)),
-    chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(bb, b), { n: 8n, d: 1n })
+  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 r = chunkHTXVVJRA_cjs.rationalSub(
-    chunkHTXVVJRA_cjs.rationalAdd(
-      chunkHTXVVJRA_cjs.rationalSub(e, chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(b, d), FOUR)),
-      chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(bb, c), { n: 16n, 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 })
     ),
-    chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalMul(THREE, chunkHTXVVJRA_cjs.rationalMul(bb, bb)), { n: 256n, d: 1n })
+    chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalMul(THREE, chunk4CVLFLOB_cjs.rationalMul(bb, bb)), { n: 256n, d: 1n })
   );
   return { p, q, r, shift };
 }
 function solveQuartic(a, b, c, d, e, solveQuadratic2) {
-  const monic = (value) => chunkHTXVVJRA_cjs.rationalDiv(value, a);
+  const monic = (value) => chunk4CVLFLOB_cjs.rationalDiv(value, a);
   const { p, q, r, shift } = depressQuartic(monic(b), monic(c), monic(d), monic(e));
-  const roots = chunkHTXVVJRA_cjs.isRationalZero(q) ? biquadraticRoots(p, r) : splitQuarticRoots(p, q, r, solveQuadratic2);
+  const roots = chunk4CVLFLOB_cjs.isRationalZero(q) ? biquadraticRoots(p, r) : splitQuarticRoots(p, q, r, solveQuadratic2);
   if (roots === null) return null;
-  const shifted = chunkHTXVVJRA_cjs.isRationalZero(shift) ? roots : roots.map((root) => ({ kind: "add", left: chunkHTXVVJRA_cjs.constNode(shift), right: root }));
+  const shifted = chunk4CVLFLOB_cjs.isRationalZero(shift) ? roots : roots.map((root) => ({ kind: "add", left: chunk4CVLFLOB_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 = chunkHTXVVJRA_cjs.symbolicKey(chunkHTXVVJRA_cjs.simplifySymbolic(root));
+    const key = chunk4CVLFLOB_cjs.symbolicKey(chunk4CVLFLOB_cjs.simplifySymbolic(root));
     if (seen.has(key)) continue;
     seen.add(key);
     unique.push(root);
@@ -506,53 +507,53 @@ function distinct(roots) {
   return unique;
 }
 function biquadraticRoots(p, r) {
-  const discriminant = chunkHTXVVJRA_cjs.rationalSub(chunkHTXVVJRA_cjs.rationalMul(p, p), chunkHTXVVJRA_cjs.rationalMul(FOUR, r));
-  if (chunkHTXVVJRA_cjs.rationalCompare(discriminant, chunkHTXVVJRA_cjs.RATIONAL_ZERO) < 0) return complexBiquadraticRoots(p, r);
-  const root = chunkHTXVVJRA_cjs.exactRationalSqrt(discriminant);
-  if (root !== null) return rationalSquareRoots(chunkHTXVVJRA_cjs.rationalNeg(p), root, chunkHTXVVJRA_cjs.isRationalZero(discriminant));
+  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));
   return nestedSquareRoots(p, r, discriminant);
 }
 function rationalSquareRoots(negatedP, root, repeated) {
-  const values = repeated ? [chunkHTXVVJRA_cjs.rationalDiv(negatedP, TWO)] : [chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalAdd(negatedP, root), TWO), chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalSub(negatedP, root), TWO)];
+  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 roots = [];
   for (const value of values) {
-    if (chunkHTXVVJRA_cjs.isRationalZero(value)) {
-      roots.push(chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.RATIONAL_ZERO));
+    if (chunk4CVLFLOB_cjs.isRationalZero(value)) {
+      roots.push(chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO));
       continue;
     }
-    const square = chunkHTXVVJRA_cjs.signedSurdNode(value);
+    const square = chunk4CVLFLOB_cjs.signedSurdNode(value);
     roots.push({ kind: "neg", operand: square }, square);
   }
   return roots;
 }
 function nestedSquareRoots(p, r, discriminant) {
-  const negatedP = chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalNeg(p));
-  const surd = chunkHTXVVJRA_cjs.surdNode(discriminant);
-  const negativeP = chunkHTXVVJRA_cjs.rationalCompare(p, chunkHTXVVJRA_cjs.RATIONAL_ZERO) <= 0;
+  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 solutions = [
-    { node: halved({ kind: "add", left: negatedP, right: surd }), positive: negativeP || chunkHTXVVJRA_cjs.rationalCompare(r, chunkHTXVVJRA_cjs.RATIONAL_ZERO) <= 0 },
-    { node: halved({ kind: "sub", left: negatedP, right: surd }), positive: negativeP && chunkHTXVVJRA_cjs.rationalCompare(r, chunkHTXVVJRA_cjs.RATIONAL_ZERO) >= 0 }
+    { 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 }
   ];
   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: chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.COMPLEX_I) };
+    const square = positive ? magnitude : { kind: "mul", left: magnitude, right: chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.COMPLEX_I) };
     roots.push({ kind: "neg", operand: square }, square);
   }
   return roots;
 }
 function halved(node) {
-  return { kind: "div", left: node, right: chunkHTXVVJRA_cjs.constNode(TWO) };
+  return { kind: "div", left: node, right: chunk4CVLFLOB_cjs.constNode(TWO) };
 }
 function complexBiquadraticRoots(p, r) {
-  const modulus = chunkHTXVVJRA_cjs.exactRationalSqrt(r);
+  const modulus = chunk4CVLFLOB_cjs.exactRationalSqrt(r);
   if (modulus === null) return null;
-  const realPart = chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalAdd(modulus, chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalNeg(p), TWO)), TWO);
-  const imaginaryPart = chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalSub(modulus, chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalNeg(p), TWO)), TWO);
-  if (chunkHTXVVJRA_cjs.rationalCompare(realPart, chunkHTXVVJRA_cjs.RATIONAL_ZERO) < 0 || chunkHTXVVJRA_cjs.rationalCompare(imaginaryPart, chunkHTXVVJRA_cjs.RATIONAL_ZERO) < 0) return null;
-  const re = chunkHTXVVJRA_cjs.surdNode(realPart);
-  const im = { kind: "mul", left: chunkHTXVVJRA_cjs.surdNode(imaginaryPart), right: chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.COMPLEX_I) };
+  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 first = { kind: "add", left: re, right: im };
   const second = { kind: "sub", left: re, right: im };
   return [
@@ -565,22 +566,22 @@ function complexBiquadraticRoots(p, r) {
 function splitQuarticRoots(p, q, r, solveQuadratic2) {
   const resolvent = [
     { n: 1n, d: 1n },
-    chunkHTXVVJRA_cjs.rationalMul(TWO, p),
-    chunkHTXVVJRA_cjs.rationalSub(chunkHTXVVJRA_cjs.rationalMul(p, p), chunkHTXVVJRA_cjs.rationalMul(FOUR, r)),
-    chunkHTXVVJRA_cjs.rationalNeg(chunkHTXVVJRA_cjs.rationalMul(q, q))
+    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))
   ];
   for (const z of rationalRoots(resolvent)) {
-    if (chunkHTXVVJRA_cjs.rationalCompare(z, chunkHTXVVJRA_cjs.RATIONAL_ZERO) <= 0) continue;
-    const alpha = chunkHTXVVJRA_cjs.exactRationalSqrt(z);
+    if (chunk4CVLFLOB_cjs.rationalCompare(z, chunk4CVLFLOB_cjs.RATIONAL_ZERO) <= 0) continue;
+    const alpha = chunk4CVLFLOB_cjs.exactRationalSqrt(z);
     if (alpha === null) continue;
-    const sum = chunkHTXVVJRA_cjs.rationalAdd(p, z);
-    const difference = chunkHTXVVJRA_cjs.rationalDiv(q, alpha);
-    const beta = chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalSub(sum, difference), TWO);
-    const gamma = chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalAdd(sum, difference), TWO);
+    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 one2 = { n: 1n, d: 1n };
     return [
       ...solveQuadratic2(one2, alpha, beta),
-      ...solveQuadratic2(one2, chunkHTXVVJRA_cjs.rationalNeg(alpha), gamma)
+      ...solveQuadratic2(one2, chunk4CVLFLOB_cjs.rationalNeg(alpha), gamma)
     ];
   }
   return null;
@@ -592,64 +593,64 @@ var NEWTON_MAX_ITERATIONS = 100;
 var NEWTON_TOLERANCE = 1e-12;
 var NUMERIC_SCAN_STEPS = 2e3;
 function evaluateRational(descending, x) {
-  let total = chunkHTXVVJRA_cjs.RATIONAL_ZERO;
-  for (const coeff of descending) total = chunkHTXVVJRA_cjs.rationalAdd(chunkHTXVVJRA_cjs.rationalMul(total, x), coeff);
+  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 + chunkHTXVVJRA_cjs.rationalToNumber(coeff);
+  for (const coeff of descending) total = total * x + chunk4CVLFLOB_cjs.rationalToNumber(coeff);
   return total;
 }
 function divideByRoot2(descending, root) {
   const quotient = [descending[0]];
   for (let i = 1; i < descending.length - 1; i++) {
-    quotient.push(chunkHTXVVJRA_cjs.rationalAdd(descending[i], chunkHTXVVJRA_cjs.rationalMul(quotient[i - 1], root)));
+    quotient.push(chunk4CVLFLOB_cjs.rationalAdd(descending[i], chunk4CVLFLOB_cjs.rationalMul(quotient[i - 1], root)));
   }
   return quotient;
 }
 function solveQuadratic(a, b, c) {
-  const discriminant = chunkHTXVVJRA_cjs.rationalSub(chunkHTXVVJRA_cjs.rationalMul(b, b), chunkHTXVVJRA_cjs.rationalMul(rational4(), chunkHTXVVJRA_cjs.rationalMul(a, c)));
-  const twoA = chunkHTXVVJRA_cjs.rationalMul(rational2(), a);
-  if (chunkHTXVVJRA_cjs.rationalCompare(discriminant, chunkHTXVVJRA_cjs.RATIONAL_ZERO) < 0) {
-    return complexQuadraticRoots(chunkHTXVVJRA_cjs.rationalNeg(b), discriminant, twoA);
-  }
-  if (chunkHTXVVJRA_cjs.isRationalZero(discriminant)) return [chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalNeg(b), twoA))];
-  const rootN = chunkHTXVVJRA_cjs.exactIntegerSqrt(discriminant.n);
-  const rootD = chunkHTXVVJRA_cjs.exactIntegerSqrt(discriminant.d);
+  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);
   if (rootN !== null && rootD !== null) {
     const root = { n: rootN, d: rootD };
-    const plus = chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalAdd(chunkHTXVVJRA_cjs.rationalNeg(b), root), twoA);
-    const minus = chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalSub(chunkHTXVVJRA_cjs.rationalNeg(b), root), twoA);
-    return chunkHTXVVJRA_cjs.rationalCompare(minus, plus) <= 0 ? [chunkHTXVVJRA_cjs.constNode(minus), chunkHTXVVJRA_cjs.constNode(plus)] : [chunkHTXVVJRA_cjs.constNode(plus), chunkHTXVVJRA_cjs.constNode(minus)];
-  }
-  const surd = chunkHTXVVJRA_cjs.surdNode(discriminant);
-  const ascending = chunkHTXVVJRA_cjs.rationalCompare(twoA, chunkHTXVVJRA_cjs.RATIONAL_ZERO) > 0;
-  const lower = { kind: "div", left: { kind: "sub", left: chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalNeg(b)), right: surd }, right: chunkHTXVVJRA_cjs.constNode(twoA) };
-  const upper = { kind: "div", left: { kind: "add", left: chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalNeg(b)), right: surd }, right: chunkHTXVVJRA_cjs.constNode(twoA) };
+    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) };
   return ascending ? [lower, upper] : [upper, lower];
 }
 function complexQuadraticRoots(negatedB, discriminant, twoA) {
-  const magnitude = chunkHTXVVJRA_cjs.rationalNeg(discriminant);
-  const rootN = chunkHTXVVJRA_cjs.exactIntegerSqrt(magnitude.n);
-  const rootD = chunkHTXVVJRA_cjs.exactIntegerSqrt(magnitude.d);
+  const magnitude = chunk4CVLFLOB_cjs.rationalNeg(discriminant);
+  const rootN = chunk4CVLFLOB_cjs.exactIntegerSqrt(magnitude.n);
+  const rootD = chunk4CVLFLOB_cjs.exactIntegerSqrt(magnitude.d);
   if (rootN !== null && rootD !== null) {
-    const imaginary2 = chunkHTXVVJRA_cjs.rationalDiv({ n: rootN, d: rootD }, twoA);
-    const real2 = chunkHTXVVJRA_cjs.rationalDiv(negatedB, twoA);
+    const imaginary2 = chunk4CVLFLOB_cjs.rationalDiv({ n: rootN, d: rootD }, twoA);
+    const real2 = chunk4CVLFLOB_cjs.rationalDiv(negatedB, twoA);
     return [
-      chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.complex(real2, chunkHTXVVJRA_cjs.rationalNeg(imaginary2))),
-      chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.complex(real2, imaginary2))
+      chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.complex(real2, chunk4CVLFLOB_cjs.rationalNeg(imaginary2))),
+      chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.complex(real2, imaginary2))
     ];
   }
-  const real = chunkHTXVVJRA_cjs.rationalDiv(negatedB, twoA);
-  const scaledRadicand = chunkHTXVVJRA_cjs.rationalDiv(magnitude, chunkHTXVVJRA_cjs.rationalMul(twoA, twoA));
-  const imaginary = { kind: "mul", left: chunkHTXVVJRA_cjs.surdNode(scaledRadicand), right: chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.COMPLEX_I) };
-  if (chunkHTXVVJRA_cjs.isRationalZero(real)) {
+  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)) {
     return [{ kind: "neg", operand: imaginary }, imaginary];
   }
   return [
-    { kind: "sub", left: chunkHTXVVJRA_cjs.constNode(real), right: imaginary },
-    { kind: "add", left: chunkHTXVVJRA_cjs.constNode(real), right: imaginary }
+    { kind: "sub", left: chunk4CVLFLOB_cjs.constNode(real), right: imaginary },
+    { kind: "add", left: chunk4CVLFLOB_cjs.constNode(real), right: imaginary }
   ];
 }
 function rational2() {
@@ -659,11 +660,11 @@ function rational4() {
   return { n: 4n, d: 1n };
 }
 function numericRoots(descending) {
-  const leading = chunkHTXVVJRA_cjs.rationalToNumber(descending[0]);
+  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(chunkHTXVVJRA_cjs.rationalToNumber(descending[i]) / leading);
+    const ratio = Math.abs(chunk4CVLFLOB_cjs.rationalToNumber(descending[i]) / leading);
     if (ratio > bound) bound = ratio;
   }
   bound += 1;
@@ -698,7 +699,7 @@ function bisect(descending, low, high) {
   return (left + right) / 2;
 }
 function solveForVariable(lhs, rhs, variable) {
-  const polynomial = chunkHTXVVJRA_cjs.toPolynomial({ kind: "sub", left: lhs, right: rhs });
+  const polynomial = chunk4CVLFLOB_cjs.toPolynomial({ kind: "sub", left: lhs, right: rhs });
   if (polynomial === null) {
     return {
       kind: "unsupported",
@@ -706,7 +707,7 @@ function solveForVariable(lhs, rhs, variable) {
     };
   }
   const others = polynomial.vars.filter((name) => name !== variable);
-  const degree = chunkHTXVVJRA_cjs.polyDegree(polynomial, variable);
+  const degree = chunk4CVLFLOB_cjs.polyDegree(polynomial, variable);
   if (others.length > 0) {
     if (degree !== 1) {
       return {
@@ -722,7 +723,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 = [...chunkHTXVVJRA_cjs.polyCoefficients(polynomial, variable)].reverse();
+  const descending = [...chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable)].reverse();
   return solveUnivariate(descending);
 }
 function solveLinearWithOtherUnknowns(polynomial, variable) {
@@ -747,8 +748,8 @@ function solveLinearWithOtherUnknowns(polynomial, variable) {
     }
     return [...names].sort();
   };
-  const coefficient = chunkHTXVVJRA_cjs.fromPolynomial({ terms: coefficientTerms, vars: namesOf2(coefficientTerms) });
-  const constant = chunkHTXVVJRA_cjs.fromPolynomial({ terms: constantTerms, vars: namesOf2(constantTerms) });
+  const coefficient = chunk4CVLFLOB_cjs.fromPolynomial({ terms: coefficientTerms, vars: namesOf2(coefficientTerms) });
+  const constant = chunk4CVLFLOB_cjs.fromPolynomial({ terms: constantTerms, vars: namesOf2(constantTerms) });
   return {
     kind: "roots",
     exact: [{ kind: "div", left: { kind: "neg", operand: constant }, right: coefficient }],
@@ -767,19 +768,19 @@ function closedFormRoots(descending) {
 function solveUnivariate(descending) {
   const exact = [];
   let remaining = [...descending];
-  let roots = [...rationalRoots(remaining)].sort(chunkHTXVVJRA_cjs.rationalCompare);
+  let roots = [...rationalRoots(remaining)].sort(chunk4CVLFLOB_cjs.rationalCompare);
   while (roots.length > 0 && remaining.length > 1) {
     for (const root of roots) {
-      while (remaining.length > 1 && chunkHTXVVJRA_cjs.isRationalZero(evaluateRational(remaining, root))) {
+      while (remaining.length > 1 && chunk4CVLFLOB_cjs.isRationalZero(evaluateRational(remaining, root))) {
         remaining = divideByRoot2(remaining, root);
       }
-      exact.push(chunkHTXVVJRA_cjs.constNode(root));
+      exact.push(chunk4CVLFLOB_cjs.constNode(root));
     }
-    roots = remaining.length > 1 ? [...rationalRoots(remaining)].sort(chunkHTXVVJRA_cjs.rationalCompare) : [];
+    roots = remaining.length > 1 ? [...rationalRoots(remaining)].sort(chunk4CVLFLOB_cjs.rationalCompare) : [];
   }
   const leftoverDegree = remaining.length - 1;
   if (leftoverDegree === 1) {
-    exact.push(chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalDiv(chunkHTXVVJRA_cjs.rationalNeg(remaining[1]), remaining[0])));
+    exact.push(chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalDiv(chunk4CVLFLOB_cjs.rationalNeg(remaining[1]), remaining[0])));
     return { kind: "roots", exact, approximate: [] };
   }
   if (leftoverDegree === 2) {
@@ -845,11 +846,11 @@ 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 chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalFromNumber(numeric));
+  return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalFromNumber(numeric));
 }
 function symbolicToValue(node) {
-  const simplified = chunkHTXVVJRA_cjs.simplifySymbolic(node);
-  if (simplified.kind === "const") return chunkOC6LTXYS_cjs.numberValue(chunkHTXVVJRA_cjs.rationalToNumber(simplified.value));
+  const simplified = chunk4CVLFLOB_cjs.simplifySymbolic(node);
+  if (simplified.kind === "const") return chunkOC6LTXYS_cjs.numberValue(chunk4CVLFLOB_cjs.rationalToNumber(simplified.value));
   return chunkOC6LTXYS_cjs.symbolicValue(simplified);
 }
 function unsupported(what) {
@@ -862,7 +863,7 @@ function symbolicPow(l, r) {
   const base = valueToSymbolic(l);
   const exponent = valueToSymbolic(r);
   if (base === null || exponent === null) return unsupported("^");
-  return symbolicToValue(chunkHTXVVJRA_cjs.powNode(base, exponent));
+  return symbolicToValue(chunk4CVLFLOB_cjs.powNode(base, exponent));
 }
 function symbolicNeg(v) {
   const operand = valueToSymbolic(v);
@@ -878,11 +879,11 @@ function symbolicBuiltin(index, args) {
     nodes.push(node);
   }
   if (index === POW_BUILTIN_INDEX && nodes.length === 2) {
-    return symbolicToValue(chunkHTXVVJRA_cjs.powNode(nodes[0], nodes[1]));
+    return symbolicToValue(chunk4CVLFLOB_cjs.powNode(nodes[0], nodes[1]));
   }
   const name = SYMBOLIC_BUILTIN_NAMES[index];
   if (name === void 0) return unsupported(`builtin ${index}`);
-  return symbolicToValue(chunkHTXVVJRA_cjs.callNode(name, nodes));
+  return symbolicToValue(chunk4CVLFLOB_cjs.callNode(name, nodes));
 }
 function rootToValue(root) {
   const value = symbolicToValue(root);
@@ -923,15 +924,15 @@ function unifyUom(l, r) {
     if (l.unit === r.unit) {
       return { lv: l.toNumber(), rv: r.toNumber(), unit: l.unit, sameMeasure: true };
     }
-    const lMeasure = chunkQNJ4ACRT_cjs.getMeasure(l.unit);
-    const rMeasure = chunkQNJ4ACRT_cjs.getMeasure(r.unit);
-    const isCurrency = chunkXJCMXB2E_cjs.sharedCurrencyExchange.isCurrency(l.unit) && chunkXJCMXB2E_cjs.sharedCurrencyExchange.isCurrency(r.unit);
+    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);
     if (lMeasure && lMeasure === rMeasure) {
-      const rvConverted = chunkQNJ4ACRT_cjs.convertUnit(r.toNumber(), r.unit, l.unit);
+      const rvConverted = chunkNJTXJ5AG_cjs.convertUnit(r.toNumber(), r.unit, l.unit);
       return { lv: l.toNumber(), rv: rvConverted, unit: l.unit, sameMeasure: true };
     }
     if (isCurrency) {
-      const rvConverted = chunkXJCMXB2E_cjs.sharedCurrencyExchange.convertSync(r.toNumber(), r.unit, l.unit);
+      const rvConverted = chunk2MV4HBKC_cjs.sharedCurrencyExchange.convertSync(r.toNumber(), r.unit, l.unit);
       if (rvConverted !== null) {
         return { lv: l.toNumber(), rv: rvConverted, unit: l.unit, sameMeasure: true };
       }
@@ -961,7 +962,7 @@ function binaryOp(l, r, op, bigOp, symbolicOp) {
       );
     }
     const node = { kind: symbolicOp, left, right };
-    return chunkOC6LTXYS_cjs.symbolicValue(chunkHTXVVJRA_cjs.simplifySymbolic(node));
+    return chunkOC6LTXYS_cjs.symbolicValue(chunk4CVLFLOB_cjs.simplifySymbolic(node));
   }
   if (l.type === 0 /* Number */ && r.type === 0 /* Number */) {
     return chunkOC6LTXYS_cjs.numberValue(op(l.value, r.value));
@@ -985,7 +986,7 @@ function binaryOp(l, r, op, bigOp, symbolicOp) {
   if (l.type === 7 /* Matrix */ && r.type === 7 /* Matrix */) {
     const lm = l.value;
     const rm = r.value;
-    if (!chunkHTXVVJRA_cjs.sameShape(lm, rm)) {
+    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}`);
     }
     const result = new Array(lm.data.length);
@@ -1060,34 +1061,34 @@ var sharedOpRegistry = new OpRegistry();
 var APART_MAX_DEGREE = 12;
 function multiply(a, b) {
   if (a.length === 0 || b.length === 0) return [];
-  const product2 = new Array(a.length + b.length - 1).fill(chunkHTXVVJRA_cjs.RATIONAL_ZERO);
+  const product2 = new Array(a.length + b.length - 1).fill(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
   a.forEach((left, i) => {
     b.forEach((right, j) => {
-      product2[i + j] = chunkHTXVVJRA_cjs.rationalAdd(product2[i + j], chunkHTXVVJRA_cjs.rationalMul(left, right));
+      product2[i + j] = chunk4CVLFLOB_cjs.rationalAdd(product2[i + j], chunk4CVLFLOB_cjs.rationalMul(left, right));
     });
   });
   return product2;
 }
 function power(base, exponent) {
-  let result = [chunkHTXVVJRA_cjs.RATIONAL_ONE];
+  let result = [chunk4CVLFLOB_cjs.RATIONAL_ONE];
   for (let i = 0; i < exponent; i++) result = multiply(result, base);
   return result;
 }
 function scale(coefficients, factor) {
-  return coefficients.map((coefficient) => chunkHTXVVJRA_cjs.rationalDiv(coefficient, factor));
+  return coefficients.map((coefficient) => chunk4CVLFLOB_cjs.rationalDiv(coefficient, factor));
 }
 function denominatorFactors(ascending, variable) {
   const factors = [];
   let lowest = 0;
-  while (lowest < ascending.length && chunkHTXVVJRA_cjs.isRationalZero(ascending[lowest])) lowest++;
-  if (lowest > 0) factors.push({ base: [chunkHTXVVJRA_cjs.RATIONAL_ZERO, chunkHTXVVJRA_cjs.RATIONAL_ONE], power: lowest });
+  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 });
   const remaining = ascending.slice(lowest);
   if (remaining.length > 1) {
     const factorization = factorUnivariate([...remaining].reverse(), variable);
     for (const factor of factorization.factors) {
-      const polynomial = chunkHTXVVJRA_cjs.toPolynomial(factor.base);
+      const polynomial = chunk4CVLFLOB_cjs.toPolynomial(factor.base);
       if (polynomial === null) return null;
-      factors.push({ base: [...chunkHTXVVJRA_cjs.polyCoefficients(polynomial, variable)], power: factor.power });
+      factors.push({ base: [...chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable)], power: factor.power });
     }
   }
   return factors.length > 0 ? factors : null;
@@ -1106,10 +1107,10 @@ function enumerateUnknowns(factors) {
 }
 function unknownColumn(unknown, factors, denominator) {
   const divisor = power(factors[unknown.factor].base, unknown.power);
-  const { quotient, remainder } = chunkHTXVVJRA_cjs.polynomialDivide(denominator, divisor);
-  if (!chunkHTXVVJRA_cjs.isZeroPolynomial(remainder)) return null;
-  const shift = new Array(unknown.degree).fill(chunkHTXVVJRA_cjs.RATIONAL_ZERO);
-  shift.push(chunkHTXVVJRA_cjs.RATIONAL_ONE);
+  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);
 }
 function solveLinearSystem(matrix, target) {
@@ -1117,7 +1118,7 @@ function solveLinearSystem(matrix, target) {
   for (let column = 0; column < size; column++) {
     let pivot = -1;
     for (let row = column; row < size; row++) {
-      if (!chunkHTXVVJRA_cjs.isRationalZero(matrix[row][column])) {
+      if (!chunk4CVLFLOB_cjs.isRationalZero(matrix[row][column])) {
         pivot = row;
         break;
       }
@@ -1126,21 +1127,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 || chunkHTXVVJRA_cjs.isRationalZero(matrix[row][column])) continue;
-      const factor = chunkHTXVVJRA_cjs.rationalDiv(matrix[row][column], matrix[column][column]);
+      if (row === column || chunk4CVLFLOB_cjs.isRationalZero(matrix[row][column])) continue;
+      const factor = chunk4CVLFLOB_cjs.rationalDiv(matrix[row][column], matrix[column][column]);
       for (let k = column; k < size; k++) {
-        matrix[row][k] = chunkHTXVVJRA_cjs.rationalSub(matrix[row][k], chunkHTXVVJRA_cjs.rationalMul(factor, matrix[column][k]));
+        matrix[row][k] = chunk4CVLFLOB_cjs.rationalSub(matrix[row][k], chunk4CVLFLOB_cjs.rationalMul(factor, matrix[column][k]));
       }
-      target[row] = chunkHTXVVJRA_cjs.rationalSub(target[row], chunkHTXVVJRA_cjs.rationalMul(factor, target[column]));
+      target[row] = chunk4CVLFLOB_cjs.rationalSub(target[row], chunk4CVLFLOB_cjs.rationalMul(factor, target[column]));
     }
   }
-  return target.map((value, index) => chunkHTXVVJRA_cjs.rationalDiv(value, matrix[index][index]));
+  return target.map((value, index) => chunk4CVLFLOB_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 = chunkHTXVVJRA_cjs.coefficientGcd(numerator, denominator);
-  const reducedNumerator = shared.length > 1 ? chunkHTXVVJRA_cjs.polynomialDivide(numerator, shared).quotient : [...numerator];
-  const reducedDenominator = shared.length > 1 ? chunkHTXVVJRA_cjs.polynomialDivide(denominator, shared).quotient : [...denominator];
+  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];
   if (reducedDenominator.length === 1) {
     return { polynomial: scale(reducedNumerator, reducedDenominator[0]), terms: [] };
   }
@@ -1148,8 +1149,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 } = chunkHTXVVJRA_cjs.polynomialDivide(scaledNumerator, monicDenominator);
-  if (chunkHTXVVJRA_cjs.isZeroPolynomial(remainder)) return { polynomial: quotient, terms: [] };
+  const { quotient, remainder } = chunk4CVLFLOB_cjs.polynomialDivide(scaledNumerator, monicDenominator);
+  if (chunk4CVLFLOB_cjs.isZeroPolynomial(remainder)) return { polynomial: quotient, terms: [] };
   const factors = denominatorFactors(monicDenominator, variable);
   if (factors === null) return null;
   const terms = solveForNumerators(factors, monicDenominator, remainder);
@@ -1167,10 +1168,10 @@ function solveForNumerators(factors, denominator, remainder) {
   }
   const matrix = [];
   for (let row = 0; row < size; row++) {
-    matrix.push(columns.map((column) => column[row] ?? chunkHTXVVJRA_cjs.RATIONAL_ZERO));
+    matrix.push(columns.map((column) => column[row] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO));
   }
   const target = [];
-  for (let row = 0; row < size; row++) target.push(remainder[row] ?? chunkHTXVVJRA_cjs.RATIONAL_ZERO);
+  for (let row = 0; row < size; row++) target.push(remainder[row] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO);
   const solution = solveLinearSystem(matrix, target);
   if (solution === null) return null;
   return groupSolution(unknowns, solution, factors);
@@ -1186,8 +1187,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 ?? chunkHTXVVJRA_cjs.RATIONAL_ZERO);
-    if (filled.every(chunkHTXVVJRA_cjs.isRationalZero)) continue;
+    const filled = [...coefficients].map((value) => value ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO);
+    if (filled.every(chunk4CVLFLOB_cjs.isRationalZero)) continue;
     terms.push({ numerator: filled, base: factors[factorIndex].base, power: termPower });
   }
   return terms;
@@ -1195,11 +1196,11 @@ function groupSolution(unknowns, solution, factors) {
 function coefficientsToNode2(coefficients, variable) {
   const terms = /* @__PURE__ */ new Map();
   coefficients.forEach((coefficient, exponent) => {
-    if (chunkHTXVVJRA_cjs.isRationalZero(coefficient)) return;
+    if (chunk4CVLFLOB_cjs.isRationalZero(coefficient)) return;
     terms.set(exponent === 0 ? "" : exponent === 1 ? variable : `${variable}^${exponent}`, coefficient);
   });
-  if (terms.size === 0) return chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.RATIONAL_ZERO);
-  return chunkHTXVVJRA_cjs.fromPolynomial({ terms, vars: coefficients.length > 1 ? [variable] : [] });
+  if (terms.size === 0) return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
+  return chunk4CVLFLOB_cjs.fromPolynomial({ terms, vars: coefficients.length > 1 ? [variable] : [] });
 }
 function apartSymbolic(node) {
   const parts = asRationalFunction(node);
@@ -1209,9 +1210,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 : chunkHTXVVJRA_cjs.powNode(base, chunkHTXVVJRA_cjs.constNode({ n: BigInt(term.power), d: 1n }));
+    const denominator = term.power === 1 ? base : chunk4CVLFLOB_cjs.powNode(base, chunk4CVLFLOB_cjs.constNode({ n: BigInt(term.power), d: 1n }));
     const negative = isNegativeNumerator(term.numerator);
-    const numerator = negative ? term.numerator.map((coefficient) => chunkHTXVVJRA_cjs.rationalNeg(coefficient)) : term.numerator;
+    const numerator = negative ? term.numerator.map((coefficient) => chunk4CVLFLOB_cjs.rationalNeg(coefficient)) : term.numerator;
     const piece = {
       kind: "div",
       left: coefficientsToNode2(numerator, parts.variable),
@@ -1220,22 +1221,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 : chunkHTXVVJRA_cjs.simplifySymbolic(result);
+  return result === null ? node : chunk4CVLFLOB_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 = chunkHTXVVJRA_cjs.toPolynomial(node.left);
-  const denominator = chunkHTXVVJRA_cjs.toPolynomial(node.right);
+  const numerator = chunk4CVLFLOB_cjs.toPolynomial(node.left);
+  const denominator = chunk4CVLFLOB_cjs.toPolynomial(node.right);
   if (numerator === null || denominator === null) return null;
-  const variable = chunkHTXVVJRA_cjs.polyUnivariateVar(denominator);
+  const variable = chunk4CVLFLOB_cjs.polyUnivariateVar(denominator);
   if (variable === null) return null;
   if (numerator.vars.some((name) => name !== variable)) return null;
   return {
-    numerator: chunkHTXVVJRA_cjs.polyCoefficients(numerator, variable),
-    denominator: chunkHTXVVJRA_cjs.polyCoefficients(denominator, variable),
+    numerator: chunk4CVLFLOB_cjs.polyCoefficients(numerator, variable),
+    denominator: chunk4CVLFLOB_cjs.polyCoefficients(denominator, variable),
     variable
   };
 }
@@ -1243,52 +1244,52 @@ function asRationalFunction(node) {
 // src/symbolic/Derivative.ts
 var DERIVATIVE_MAX_ORDER = 16;
 function zero() {
-  return chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.RATIONAL_ZERO);
+  return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
 }
 function one() {
-  return chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.RATIONAL_ONE);
+  return chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ONE);
 }
 function functionDerivative(name, argument) {
   switch (name) {
     case "sin":
-      return chunkHTXVVJRA_cjs.callNode("cos", [argument]);
+      return chunk4CVLFLOB_cjs.callNode("cos", [argument]);
     case "cos":
-      return { kind: "neg", operand: chunkHTXVVJRA_cjs.callNode("sin", [argument]) };
+      return { kind: "neg", operand: chunk4CVLFLOB_cjs.callNode("sin", [argument]) };
     case "tan":
-      return { kind: "div", left: one(), right: chunkHTXVVJRA_cjs.powNode(chunkHTXVVJRA_cjs.callNode("cos", [argument]), chunkHTXVVJRA_cjs.constNode(2)) };
+      return { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.callNode("cos", [argument]), chunk4CVLFLOB_cjs.constNode(2)) };
     case "exp":
-      return chunkHTXVVJRA_cjs.callNode("exp", [argument]);
+      return chunk4CVLFLOB_cjs.callNode("exp", [argument]);
     case "log":
       return { kind: "div", left: one(), right: argument };
     case "sqrt":
       return {
         kind: "div",
         left: one(),
-        right: { kind: "mul", left: chunkHTXVVJRA_cjs.constNode(2), right: chunkHTXVVJRA_cjs.callNode("sqrt", [argument]) }
+        right: { kind: "mul", left: chunk4CVLFLOB_cjs.constNode(2), right: chunk4CVLFLOB_cjs.callNode("sqrt", [argument]) }
       };
     case "asin":
-      return { kind: "div", left: one(), right: chunkHTXVVJRA_cjs.callNode("sqrt", [oneMinusSquare(argument)]) };
+      return { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.callNode("sqrt", [oneMinusSquare(argument)]) };
     case "acos":
-      return { kind: "neg", operand: { kind: "div", left: one(), right: chunkHTXVVJRA_cjs.callNode("sqrt", [oneMinusSquare(argument)]) } };
+      return { kind: "neg", operand: { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.callNode("sqrt", [oneMinusSquare(argument)]) } };
     case "atan":
       return { kind: "div", left: one(), right: onePlusSquare(argument) };
     case "sinh":
-      return chunkHTXVVJRA_cjs.callNode("cosh", [argument]);
+      return chunk4CVLFLOB_cjs.callNode("cosh", [argument]);
     case "cosh":
-      return chunkHTXVVJRA_cjs.callNode("sinh", [argument]);
+      return chunk4CVLFLOB_cjs.callNode("sinh", [argument]);
     case "tanh":
-      return { kind: "div", left: one(), right: chunkHTXVVJRA_cjs.powNode(chunkHTXVVJRA_cjs.callNode("cosh", [argument]), chunkHTXVVJRA_cjs.constNode(2)) };
+      return { kind: "div", left: one(), right: chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.callNode("cosh", [argument]), chunk4CVLFLOB_cjs.constNode(2)) };
     case "abs":
-      return chunkHTXVVJRA_cjs.callNode("sign", [argument]);
+      return chunk4CVLFLOB_cjs.callNode("sign", [argument]);
     default:
       return null;
   }
 }
 function oneMinusSquare(argument) {
-  return { kind: "sub", left: one(), right: chunkHTXVVJRA_cjs.powNode(argument, chunkHTXVVJRA_cjs.constNode(2)) };
+  return { kind: "sub", left: one(), right: chunk4CVLFLOB_cjs.powNode(argument, chunk4CVLFLOB_cjs.constNode(2)) };
 }
 function onePlusSquare(argument) {
-  return { kind: "add", left: one(), right: chunkHTXVVJRA_cjs.powNode(argument, chunkHTXVVJRA_cjs.constNode(2)) };
+  return { kind: "add", left: one(), right: chunk4CVLFLOB_cjs.powNode(argument, chunk4CVLFLOB_cjs.constNode(2)) };
 }
 function differentiate(node, variable, order = 1) {
   if (order < 0 || !Number.isInteger(order)) {
@@ -1301,8 +1302,8 @@ function differentiate(node, variable, order = 1) {
       { limit: DERIVATIVE_MAX_ORDER }
     );
   }
-  let result = chunkHTXVVJRA_cjs.simplifySymbolic(node);
-  for (let i = 0; i < order; i++) result = chunkHTXVVJRA_cjs.simplifySymbolic(derive(result, variable));
+  let result = chunk4CVLFLOB_cjs.simplifySymbolic(node);
+  for (let i = 0; i < order; i++) result = chunk4CVLFLOB_cjs.simplifySymbolic(derive(result, variable));
   return result;
 }
 function derive(node, variable) {
@@ -1332,7 +1333,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: chunkHTXVVJRA_cjs.powNode(node.right, chunkHTXVVJRA_cjs.constNode(2))
+        right: chunk4CVLFLOB_cjs.powNode(node.right, chunk4CVLFLOB_cjs.constNode(2))
       };
     case "pow":
       return derivePow(node, variable);
@@ -1346,79 +1347,79 @@ function derive(node, variable) {
 }
 function derivePow(node, variable) {
   if (node.exponent.kind === "const") {
-    const reduced = chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalSub(node.exponent.value, chunkHTXVVJRA_cjs.RATIONAL_ONE));
+    const reduced = chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalSub(node.exponent.value, chunk4CVLFLOB_cjs.RATIONAL_ONE));
     return {
       kind: "mul",
-      left: { kind: "mul", left: node.exponent, right: chunkHTXVVJRA_cjs.powNode(node.base, reduced) },
+      left: { kind: "mul", left: node.exponent, right: chunk4CVLFLOB_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: chunkHTXVVJRA_cjs.callNode("log", [node.base]) },
+      left: { kind: "mul", left: node, right: chunk4CVLFLOB_cjs.callNode("log", [node.base]) },
       right: derive(node.exponent, variable)
     };
   }
   return unevaluated(node, variable);
 }
 function unevaluated(node, variable) {
-  return chunkHTXVVJRA_cjs.callNode("der", [node, chunkHTXVVJRA_cjs.varNode(variable)]);
+  return chunk4CVLFLOB_cjs.callNode("der", [node, chunk4CVLFLOB_cjs.varNode(variable)]);
 }
 
 // src/symbolic/Integral.ts
 function asLinear(node, variable) {
-  const polynomial = chunkHTXVVJRA_cjs.toPolynomial(node);
+  const polynomial = chunk4CVLFLOB_cjs.toPolynomial(node);
   if (polynomial === null) return null;
   const others = polynomial.vars.filter((name) => name !== variable);
   if (others.length > 0) return null;
-  if (chunkHTXVVJRA_cjs.polyDegree(polynomial, variable) > 1) return null;
-  const ascending = chunkHTXVVJRA_cjs.polyCoefficients(polynomial, variable);
+  if (chunk4CVLFLOB_cjs.polyDegree(polynomial, variable) > 1) return null;
+  const ascending = chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable);
   const intercept = ascending[0] ?? { n: 0n, d: 1n };
   const slope = ascending[1] ?? { n: 0n, d: 1n };
-  return chunkHTXVVJRA_cjs.isRationalZero(slope) ? null : { slope, intercept };
+  return chunk4CVLFLOB_cjs.isRationalZero(slope) ? null : { slope, intercept };
 }
 function integratePolynomial(node, variable) {
-  const polynomial = chunkHTXVVJRA_cjs.toPolynomial(node);
+  const polynomial = chunk4CVLFLOB_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 = chunkHTXVVJRA_cjs.polyCoefficients(polynomial, variable);
-  let result = chunkHTXVVJRA_cjs.constNode(0);
+  const ascending = chunk4CVLFLOB_cjs.polyCoefficients(polynomial, variable);
+  let result = chunk4CVLFLOB_cjs.constNode(0);
   ascending.forEach((coeff, power2) => {
-    if (chunkHTXVVJRA_cjs.isRationalZero(coeff)) return;
+    if (chunk4CVLFLOB_cjs.isRationalZero(coeff)) return;
     const nextPower = power2 + 1;
-    const scaled = chunkHTXVVJRA_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
+    const scaled = chunk4CVLFLOB_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
     const term = {
       kind: "mul",
-      left: chunkHTXVVJRA_cjs.constNode(scaled),
-      right: nextPower === 1 ? chunkHTXVVJRA_cjs.varNode(variable) : chunkHTXVVJRA_cjs.powNode(chunkHTXVVJRA_cjs.varNode(variable), chunkHTXVVJRA_cjs.constNode(nextPower))
+      left: chunk4CVLFLOB_cjs.constNode(scaled),
+      right: nextPower === 1 ? chunk4CVLFLOB_cjs.varNode(variable) : chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.varNode(variable), chunk4CVLFLOB_cjs.constNode(nextPower))
     };
     result = { kind: "add", left: result, right: term };
   });
-  return { ok: true, value: chunkHTXVVJRA_cjs.simplifySymbolic(result) };
+  return { ok: true, value: chunk4CVLFLOB_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) => chunkHTXVVJRA_cjs.simplifySymbolic({ kind: "div", left: value, right: chunkHTXVVJRA_cjs.constNode(linear.slope) });
+  const divideBySlope = (value) => chunk4CVLFLOB_cjs.simplifySymbolic({ kind: "div", left: value, right: chunk4CVLFLOB_cjs.constNode(linear.slope) });
   switch (node.name) {
     case "exp":
-      return { ok: true, value: divideBySlope(chunkHTXVVJRA_cjs.callNode("exp", [inner])) };
+      return { ok: true, value: divideBySlope(chunk4CVLFLOB_cjs.callNode("exp", [inner])) };
     case "sin":
-      return { ok: true, value: divideBySlope({ kind: "neg", operand: chunkHTXVVJRA_cjs.callNode("cos", [inner]) }) };
+      return { ok: true, value: divideBySlope({ kind: "neg", operand: chunk4CVLFLOB_cjs.callNode("cos", [inner]) }) };
     case "cos":
-      return { ok: true, value: divideBySlope(chunkHTXVVJRA_cjs.callNode("sin", [inner])) };
+      return { ok: true, value: divideBySlope(chunk4CVLFLOB_cjs.callNode("sin", [inner])) };
     case "log":
       return {
         ok: true,
         value: divideBySlope({
           kind: "sub",
-          left: { kind: "mul", left: inner, right: chunkHTXVVJRA_cjs.callNode("log", [inner]) },
+          left: { kind: "mul", left: inner, right: chunk4CVLFLOB_cjs.callNode("log", [inner]) },
           right: inner
         })
       };
@@ -1433,18 +1434,18 @@ function integrateReciprocalForms(node, variable) {
   if (linear !== null) {
     return {
       ok: true,
-      value: chunkHTXVVJRA_cjs.simplifySymbolic({
+      value: chunk4CVLFLOB_cjs.simplifySymbolic({
         kind: "div",
-        left: chunkHTXVVJRA_cjs.callNode("log", [node.right]),
-        right: chunkHTXVVJRA_cjs.constNode(linear.slope)
+        left: chunk4CVLFLOB_cjs.callNode("log", [node.right]),
+        right: chunk4CVLFLOB_cjs.constNode(linear.slope)
       })
     };
   }
-  const denominator = chunkHTXVVJRA_cjs.toPolynomial(node.right);
+  const denominator = chunk4CVLFLOB_cjs.toPolynomial(node.right);
   if (denominator !== null && denominator.vars.length === 1 && denominator.vars[0] === variable) {
-    const ascending = chunkHTXVVJRA_cjs.polyCoefficients(denominator, variable);
-    const isOnePlusSquare = ascending.length === 3 && isRationalOneNode(ascending[0]) && chunkHTXVVJRA_cjs.isRationalZero(ascending[1]) && isRationalOneNode(ascending[2]);
-    if (isOnePlusSquare) return { ok: true, value: chunkHTXVVJRA_cjs.callNode("atan", [chunkHTXVVJRA_cjs.varNode(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)]) };
   }
   return null;
 }
@@ -1456,7 +1457,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) : chunkHTXVVJRA_cjs.constNode(0);
+  let result = decomposition.polynomial.length > 0 ? polynomialAntiderivative(decomposition.polynomial, variable) : chunk4CVLFLOB_cjs.constNode(0);
   for (const term of decomposition.terms) {
     const piece = integrateTerm(term, variable);
     if (piece === null) {
@@ -1467,72 +1468,72 @@ function integrateRationalFunction(node, variable) {
     }
     result = { kind: "add", left: result, right: piece };
   }
-  return { ok: true, value: chunkHTXVVJRA_cjs.simplifySymbolic(result) };
+  return { ok: true, value: chunk4CVLFLOB_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] ?? chunkHTXVVJRA_cjs.RATIONAL_ZERO;
+    const coefficient = term.numerator[0] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO;
     if (term.power === 1) {
-      return { kind: "mul", left: chunkHTXVVJRA_cjs.constNode(coefficient), right: chunkHTXVVJRA_cjs.callNode("log", [base]) };
+      return { kind: "mul", left: chunk4CVLFLOB_cjs.constNode(coefficient), right: chunk4CVLFLOB_cjs.callNode("log", [base]) };
     }
     const reduced = term.power - 1;
-    const scaled = chunkHTXVVJRA_cjs.rationalDiv(coefficient, { n: BigInt(-reduced), d: 1n });
+    const scaled = chunk4CVLFLOB_cjs.rationalDiv(coefficient, { n: BigInt(-reduced), d: 1n });
     return {
       kind: "div",
-      left: chunkHTXVVJRA_cjs.constNode(scaled),
-      right: chunkHTXVVJRA_cjs.powNode(base, chunkHTXVVJRA_cjs.constNode({ n: BigInt(reduced), d: 1n }))
+      left: chunk4CVLFLOB_cjs.constNode(scaled),
+      right: chunk4CVLFLOB_cjs.powNode(base, chunk4CVLFLOB_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] ?? chunkHTXVVJRA_cjs.RATIONAL_ZERO;
-  const linear = term.numerator[1] ?? chunkHTXVVJRA_cjs.RATIONAL_ZERO;
+  const constant = term.numerator[0] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO;
+  const linear = term.numerator[1] ?? chunk4CVLFLOB_cjs.RATIONAL_ZERO;
   const [q, p] = term.base;
   const half = { n: 1n, d: 2n };
-  const halfP = chunkHTXVVJRA_cjs.rationalMul(p, half);
+  const halfP = chunk4CVLFLOB_cjs.rationalMul(p, half);
   const logarithm = {
     kind: "mul",
-    left: chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.rationalMul(linear, half)),
-    right: chunkHTXVVJRA_cjs.callNode("log", [base])
+    left: chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.rationalMul(linear, half)),
+    right: chunk4CVLFLOB_cjs.callNode("log", [base])
   };
-  const leftover = chunkHTXVVJRA_cjs.rationalSub(constant, chunkHTXVVJRA_cjs.rationalMul(linear, halfP));
-  if (chunkHTXVVJRA_cjs.isRationalZero(leftover)) return logarithm;
-  const width = chunkHTXVVJRA_cjs.surdNode(chunkHTXVVJRA_cjs.rationalSub(q, chunkHTXVVJRA_cjs.rationalMul(halfP, halfP)));
+  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 shifted = {
     kind: "add",
-    left: chunkHTXVVJRA_cjs.varNode(variable),
-    right: chunkHTXVVJRA_cjs.constNode(halfP)
+    left: chunk4CVLFLOB_cjs.varNode(variable),
+    right: chunk4CVLFLOB_cjs.constNode(halfP)
   };
   const arctangent = {
     kind: "mul",
-    left: { kind: "div", left: chunkHTXVVJRA_cjs.constNode(leftover), right: width },
-    right: chunkHTXVVJRA_cjs.callNode("atan", [{ kind: "div", left: shifted, right: width }])
+    left: { kind: "div", left: chunk4CVLFLOB_cjs.constNode(leftover), right: width },
+    right: chunk4CVLFLOB_cjs.callNode("atan", [{ kind: "div", left: shifted, right: width }])
   };
-  return chunkHTXVVJRA_cjs.isRationalZero(linear) ? arctangent : { kind: "add", left: logarithm, right: arctangent };
+  return chunk4CVLFLOB_cjs.isRationalZero(linear) ? arctangent : { kind: "add", left: logarithm, right: arctangent };
 }
 function polynomialAntiderivative(ascending, variable) {
-  let result = chunkHTXVVJRA_cjs.constNode(0);
+  let result = chunk4CVLFLOB_cjs.constNode(0);
   ascending.forEach((coeff, exponent) => {
-    if (chunkHTXVVJRA_cjs.isRationalZero(coeff)) return;
+    if (chunk4CVLFLOB_cjs.isRationalZero(coeff)) return;
     const nextPower = exponent + 1;
-    const scaled = chunkHTXVVJRA_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
+    const scaled = chunk4CVLFLOB_cjs.rationalDiv(coeff, { n: BigInt(nextPower), d: 1n });
     const term = {
       kind: "mul",
-      left: chunkHTXVVJRA_cjs.constNode(scaled),
-      right: nextPower === 1 ? chunkHTXVVJRA_cjs.varNode(variable) : chunkHTXVVJRA_cjs.powNode(chunkHTXVVJRA_cjs.varNode(variable), chunkHTXVVJRA_cjs.constNode(nextPower))
+      left: chunk4CVLFLOB_cjs.constNode(scaled),
+      right: nextPower === 1 ? chunk4CVLFLOB_cjs.varNode(variable) : chunk4CVLFLOB_cjs.powNode(chunk4CVLFLOB_cjs.varNode(variable), chunk4CVLFLOB_cjs.constNode(nextPower))
     };
     result = { kind: "add", left: result, right: term };
   });
   return result;
 }
 function integrate(node, variable) {
-  const simplified = chunkHTXVVJRA_cjs.simplifySymbolic(node);
-  if (!chunkHTXVVJRA_cjs.freeVariables(simplified).has(variable)) {
-    return { ok: true, value: chunkHTXVVJRA_cjs.simplifySymbolic({ kind: "mul", left: simplified, right: chunkHTXVVJRA_cjs.varNode(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 polynomial = integratePolynomial(simplified, variable);
   if (polynomial !== null) return polynomial;
@@ -1549,13 +1550,13 @@ function integrate(node, variable) {
     if (!right.ok) return right;
     return {
       ok: true,
-      value: chunkHTXVVJRA_cjs.simplifySymbolic({ kind: simplified.kind, left: left.value, right: right.value })
+      value: chunk4CVLFLOB_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: chunkHTXVVJRA_cjs.simplifySymbolic({ kind: "mul", left: simplified.left, right: inner.value }) };
+    return { ok: true, value: chunk4CVLFLOB_cjs.simplifySymbolic({ kind: "mul", left: simplified.left, right: inner.value }) };
   }
   return {
     ok: false,
@@ -1573,13 +1574,13 @@ function taylorSeries(node, variable, point, degree) {
       { limit: TAYLOR_MAX_DEGREE }
     );
   }
-  const pointNode = chunkHTXVVJRA_cjs.constNode(point);
+  const pointNode = chunk4CVLFLOB_cjs.constNode(point);
   let factorial = 1n;
-  let result = chunkHTXVVJRA_cjs.constNode(chunkHTXVVJRA_cjs.RATIONAL_ZERO);
+  let result = chunk4CVLFLOB_cjs.constNode(chunk4CVLFLOB_cjs.RATIONAL_ZERO);
   for (let order = 0; order <= degree; order++) {
     if (order > 0) factorial *= BigInt(order);
     const derivative = differentiate(node, variable, order);
-    const atPoint = chunkHTXVVJRA_cjs.simplifySymbolic(chunkHTXVVJRA_cjs.substitute(derivative, variable, pointNode));
+    const atPoint = chunk4CVLFLOB_cjs.simplifySymbolic(chunk4CVLFLOB_cjs.substitute(derivative, variable, pointNode));
     if (atPoint.kind !== "const") {
       throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
         "SYMBOLIC_TAYLOR_INEXACT",
@@ -1587,13 +1588,13 @@ function taylorSeries(node, variable, point, degree) {
         { order }
       );
     }
-    const coefficient = chunkHTXVVJRA_cjs.rationalDiv(atPoint.value, { n: factorial, d: 1n });
-    if (chunkHTXVVJRA_cjs.isRationalZero(coefficient)) continue;
-    const shifted = chunkHTXVVJRA_cjs.isRationalZero(point) ? chunkHTXVVJRA_cjs.varNode(variable) : { kind: "sub", left: chunkHTXVVJRA_cjs.varNode(variable), right: pointNode };
-    const power2 = order === 0 ? chunkHTXVVJRA_cjs.constNode(1) : order === 1 ? shifted : chunkHTXVVJRA_cjs.powNode(shifted, chunkHTXVVJRA_cjs.constNode(order));
-    result = { kind: "add", left: result, right: { kind: "mul", left: chunkHTXVVJRA_cjs.constNode(coefficient), right: power2 } };
+    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 } };
   }
-  return chunkHTXVVJRA_cjs.simplifySymbolic(result);
+  return chunk4CVLFLOB_cjs.simplifySymbolic(result);
 }
 function jacobian(functions, variables) {
   return functions.map((fn) => variables.map((variable) => differentiate(fn, variable)));
@@ -1689,6 +1690,19 @@ function adjustForInflation(amount, fromYear, toYear) {
 }
 
 // src/vm/VMBuiltins.ts
+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()];
+    if (entry !== void 0 && entry[0] === ANGLE_KIND) return value.toNumber() * entry[1];
+  }
+  return value.toNumber();
+}
+function pluraliseUnit(unit, count) {
+  if (count === 1) return unit;
+  const plural = `${unit}s`;
+  return chunkMBNQVDVC_cjs.UNIT_TABLE[plural.toLowerCase()] === void 0 ? unit : plural;
+}
 var builtinFunctions = {
   // ── Populated below ──
   // sqrt: a negative argument has a complex answer now that there is a complex
@@ -1697,15 +1711,16 @@ var builtinFunctions = {
   0: (args) => {
     const value = args[0].toNumber();
     if (value >= 0) return chunkOC6LTXYS_cjs.numberValue(Math.sqrt(value));
-    return symbolicToValue(chunkHTXVVJRA_cjs.callNode("sqrt", [chunkHTXVVJRA_cjs.constNode(value)]));
+    return symbolicToValue(chunk4CVLFLOB_cjs.callNode("sqrt", [chunk4CVLFLOB_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 */ ? chunkHTXVVJRA_cjs.determinant(args[0].value) : chunkOC6LTXYS_cjs.numberValue(Math.abs(args[0].toNumber())),
-  2: (args) => chunkOC6LTXYS_cjs.numberValue(Math.sin(args[0].toNumber())),
-  3: (args) => chunkOC6LTXYS_cjs.numberValue(Math.cos(args[0].toNumber())),
-  4: (args) => chunkOC6LTXYS_cjs.numberValue(Math.tan(args[0].toNumber())),
+  1: (args) => args[0].type === 7 /* Matrix */ ? chunk4CVLFLOB_cjs.determinant(args[0].value) : chunkOC6LTXYS_cjs.numberValue(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())),
@@ -2019,11 +2034,13 @@ var builtinFunctions = {
     const { monthlyPayment } = amortizeLoan(principal, rate, years);
     return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(monthlyPayment, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(monthlyPayment);
   },
-  // taxAdd(amount, rate) -> amount * (1 + rate). Backs "tax on $X at R%" /
-  // "VAT on $X at R%". No default rate is baked in anywhere, the caller
-  // always supplies one explicitly, since tax rates vary by region and
-  // change over time; this package makes no assumption about which rate
-  // applies.
+  // taxAdd(amount, rate) -> amount * (1 + rate), the tax-inclusive total.
+  // Backs the taxAdd() function-call form, whose name promises exactly this.
+  // The "tax on $X at R%" PHRASE does NOT use it, see index 86.
+  //
+  // No default rate is baked in anywhere, the caller always supplies one
+  // explicitly, since tax rates vary by region and change over time; this
+  // package makes no assumption about which rate applies.
   58: (args) => {
     const amount = args[0].toNumber();
     const rate = args[1].toNumber();
@@ -2107,16 +2124,16 @@ 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 */ ? chunkHTXVVJRA_cjs.transpose(args[0].value) : args[0],
+  63: (args) => args[0].type === 7 /* Matrix */ ? chunk4CVLFLOB_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 */ ? chunkHTXVVJRA_cjs.determinant(args[0].value) : chunkOC6LTXYS_cjs.numberValue(args[0].toNumber()),
+  64: (args) => args[0].type === 7 /* Matrix */ ? chunk4CVLFLOB_cjs.determinant(args[0].value) : chunkOC6LTXYS_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 chunkHTXVVJRA_cjs.inverse(args[0].value);
+    if (args[0].type === 7 /* Matrix */) return chunk4CVLFLOB_cjs.inverse(args[0].value);
     return chunkOC6LTXYS_cjs.numberValue(1 / args[0].toNumber());
   },
   // dot(a, b), matrix product / scalar-broadcast, the SAME dispatch as
@@ -2130,7 +2147,7 @@ var builtinFunctions = {
       return chunkOC6LTXYS_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 chunkHTXVVJRA_cjs.matrixMultiply(toMatrix(a), toMatrix(b));
+    return chunk4CVLFLOB_cjs.matrixMultiply(toMatrix(a), toMatrix(b));
   },
   // ── Symbolic algebra (packages/symbolic/) ──
   // expand(expr), multiplying out every product and power. Reached only
@@ -2144,7 +2161,7 @@ var builtinFunctions = {
   67: (args) => {
     const [value] = args;
     if (value.type !== 9 /* Symbolic */) return value;
-    return symbolicToValue(chunkHTXVVJRA_cjs.expandSymbolic(value.value));
+    return symbolicToValue(chunk4CVLFLOB_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
@@ -2210,19 +2227,19 @@ var builtinFunctions = {
       functions.push(node);
     }
     const variables = /* @__PURE__ */ new Set();
-    for (const fn of functions) for (const name of chunkHTXVVJRA_cjs.freeVariables(fn)) variables.add(name);
+    for (const fn of functions) for (const name of chunk4CVLFLOB_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.");
     const rows = jacobian(functions, sorted);
     const rowMajor = [];
     for (const row of rows) {
-      for (const cell of row) rowMajor.push(chunkHTXVVJRA_cjs.symbolicToEntry(cell));
+      for (const cell of row) rowMajor.push(chunk4CVLFLOB_cjs.symbolicToEntry(cell));
     }
-    return chunkOC6LTXYS_cjs.matrixValue(rows.length, sorted.length, chunkHTXVVJRA_cjs.rowMajorToColumnMajor(rows.length, sorted.length, rowMajor));
+    return chunkOC6LTXYS_cjs.matrixValue(rows.length, sorted.length, chunk4CVLFLOB_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(chunkHTXVVJRA_cjs.complexNode(chunkHTXVVJRA_cjs.complex(chunkHTXVVJRA_cjs.RATIONAL_ZERO, chunkHTXVVJRA_cjs.rationalFromNumber(args[0].toNumber())))),
+  74: (args) => symbolicToValue(chunk4CVLFLOB_cjs.complexNode(chunk4CVLFLOB_cjs.complex(chunk4CVLFLOB_cjs.RATIONAL_ZERO, chunk4CVLFLOB_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]),
@@ -2232,19 +2249,219 @@ var builtinFunctions = {
   78: (args) => {
     const value = args[0];
     if (value.type !== 9 /* Symbolic */) return value;
-    return symbolicToValue(chunkHTXVVJRA_cjs.cancelSymbolic(value.value));
+    return symbolicToValue(chunk4CVLFLOB_cjs.cancelSymbolic(value.value));
   },
   // apart(expr), the partial-fraction decomposition of a rational function.
   79: (args) => {
     const value = args[0];
     if (value.type !== 9 /* Symbolic */) return value;
     return symbolicToValue(apartSymbolic(value.value));
+  },
+  // taxIn(amount, rate) -> amount - amount/(1 + rate), the tax already
+  // contained in a tax-INCLUSIVE total. Backs "tax in/of/from $X at R%".
+  // The complement of taxRemove (index 59): the two sum to the gross amount.
+  85: (args) => {
+    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`);
+    }
+    const tax = amount - amount / (1 + rate);
+    return args[0].type === 6 /* Uom */ ? chunkOC6LTXYS_cjs.uomValue(tax, args[0].unit) : chunkOC6LTXYS_cjs.numberValue(tax);
+  },
+  // taxOn(amount, rate) -> amount * rate, the tax itself.
+  //
+  // The "tax on $X at R%" phrase used to compile to taxAdd (index 58) and
+  // answer $345.00 for "tax on $300 at 15%". Soulver answers $45.00, and
+  // "the tax on $300" is the tax, not the bill. The total is "$300 + 15%",
+  // which reads as a relative increase (see PercentParselet.ts), or
+  // taxAdd(300, 0.15) for the function form.
+  86: (args) => {
+    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);
+  },
+  // ── 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),
+  // 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"),
+  // asTwoUnits(value, majorUnit, minorUnit) -> "12 min 30 s".
+  //
+  // "12.5 minutes in minutes and seconds" asks for one quantity split
+  // across two units, which every other conversion path cannot express:
+  // they each produce a single number in a single unit.
+  //
+  // The whole part goes to the major unit and the remainder to the minor,
+  // 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()];
+    if (majorEntry === void 0 || minorEntry === void 0) {
+      return chunkOC6LTXYS_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`);
+    }
+    if (minorEntry[1] >= majorEntry[1]) {
+      return chunkOC6LTXYS_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 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}`);
+  },
+  // makeRate(value, denominatorUnit) -> value per that unit.
+  //
+  // `3 hours / day` is a rate, `3 hours / 3 days` is a division. The
+  // difference is whether a number was written in the denominator, which
+  // is decided at parse time, so this only ever receives the rate case.
+  //
+  // Building the rate directly rather than dividing by an implied 1 is the
+  // whole point: a division makes same-measure units cancel, which turned
+  // `3 hours / day` into 0.125 when that shortcut was tried.
+  95: (args) => {
+    const source = args[0];
+    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 chunkOC6LTXYS_cjs.uomValue(source.toNumber(), `${numerator}/${denominator}`);
+  },
+  // atRate(quantity, rate) -> whichever of the two the question implies.
+  //
+  //   30 hours at $30/hour   $900      a duration at a price per duration
+  //   $500 at $20/hour       25 hours   money at a price per duration
+  //
+  // Both are written with the same word and mean opposite operations. Which
+  // one applies is decided by which half of the rate the left side matches:
+  // match the denominator and you are buying that many, match the numerator
+  // and you are asking how many it buys.
+  96: (args) => {
+    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"');
+    }
+    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()];
+    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);
+    }
+    if (leftUnit !== void 0 && leftUnit === numerator) {
+      const count = left.toNumber() / rate.toNumber();
+      return chunkOC6LTXYS_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 chunkOC6LTXYS_cjs.errorValue("INCOMPATIBLE_UNITS", `at: ${leftUnit} matches neither side of ${rate.unit}`);
+  },
+  // ── Investments (packages/finance/) ────────────────────────────────────
+  // compoundFutureValueEvery(principal, rate, years, periodsPerYear)
+  // FV = P(1 + r/n)^(n·y). Index 51 is the same formula with n fixed at 1;
+  // this one backs "compounding monthly"/"quarterly"/"daily"/"weekly".
+  // Kept separate rather than widening 51, because 51 is also the public
+  // compoundInterest(principal, rate, years) call and its arity is part of
+  // that contract.
+  80: (args) => {
+    const principal = args[0].toNumber();
+    const rate = args[1].toNumber();
+    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`);
+    }
+    if (1 + rate / perYear <= 0) {
+      return chunkOC6LTXYS_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);
+  },
+  // compoundInterestEarnedEvery(principal, rate, years, periodsPerYear)
+  // The interest-only portion of index 80, i.e. FV - P.
+  81: (args) => {
+    const principal = args[0].toNumber();
+    const rate = args[1].toNumber();
+    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`);
+    }
+    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);
+  },
+  // presentValue(futureValue, rate, years) -> FV / (1 + r)^y, what a sum
+  // promised in the future is worth today. The inverse of index 51.
+  82: (args) => {
+    const future = args[0].toNumber();
+    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`);
+    }
+    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);
+  },
+  // returnOnInvestment(invested, returned) -> (returned - invested) /
+  // invested, the gain as a multiple of what was put in. $500 in and $1,500
+  // out is 2x, not 3x: ROI conventionally measures the profit against the
+  // cost, so doubling your money is 1x return and tripling it is 2x. The
+  // money multiple (3x here) is a different figure; `$1,500 / $500` gives it.
+  83: (args) => {
+    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 chunkOC6LTXYS_cjs.numberValue((returned - invested) / invested);
+  },
+  // annualisedReturn(invested, returned, years) -> CAGR, the constant
+  // yearly rate that turns `invested` into `returned` over `years`:
+  // (returned/invested)^(1/years) - 1. Returned as a Percentage so it
+  // renders "13.99%" rather than 0.1399.
+  84: (args) => {
+    const invested = args[0].toNumber();
+    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");
+    }
+    if (years <= 0) {
+      return chunkOC6LTXYS_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 chunkOC6LTXYS_cjs.percentageValue(Math.pow(returned / invested, 1 / years) - 1);
   }
 };
 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(chunkHTXVVJRA_cjs.callNode(name, [node]));
+  return symbolicToValue(chunk4CVLFLOB_cjs.callNode(name, [node]));
 }
 function symbolicVariableName(value, verb) {
   if (value?.type !== 3 /* String */) {
@@ -2411,5 +2628,5 @@ exports.symbolicNeg = symbolicNeg;
 exports.symbolicPow = symbolicPow;
 exports.unifyUom = unifyUom;
 exports.unregisterAsConverter = unregisterAsConverter;
-//# sourceMappingURL=chunk-J73SJHR3.cjs.map
-//# sourceMappingURL=chunk-J73SJHR3.cjs.map
+//# sourceMappingURL=chunk-2NPS5DQ3.cjs.map
+//# sourceMappingURL=chunk-2NPS5DQ3.cjs.map