@xchainjs/xchain-thorchain-amm 3.0.35 → 3.0.37

package/README.md

@@ -105,13 +105,13 @@ You can find examples using the THORChain AMM package in the [thorchain-amm](htt
 
 More information about how to use the Thorchain AMM package can be found on [documentation](https://xchainjs.gitbook.io/xchainjs/protocols/thorchain/xchain-thorchain-amm)
 
-### Setting Headers for Nine Realms endpoints
+### Setting Headers for public endpoints
 
-If you plan on using the publically accessible endpoints provided by Nine Realms(listed below), ensure that you add a valid 'x-client-id' to all requests
+If you plan on using the publicly accessible endpoints listed below, ensure that you add a valid 'x-client-id' to all requests
 
-- https://midgard.ninerealms.com
-- https://haskoin.ninerealms.com (BTC/BCH/LTC)
-- https://thornode.ninerealms.com
+- https://gateway.liquify.com/chain/thorchain_midgard
+- https://api.haskoin.com (BTC/BCH/LTC)
+- https://gateway.liquify.com/chain/thorchain_api
 
 Example
 

package/lib/index.esm.js

@@ -53,7 +53,7 @@ typeof SuppressedError === "function" ? SuppressedError : function (error, suppr
 };
 
 /*
- *      bignumber.js v10.0.1
+ *      bignumber.js v11.0.0
  *      A JavaScript library for arbitrary-precision arithmetic.
  *      https://github.com/MikeMcl/bignumber.js
  *      Copyright (c) 2026 Michael Mclaughlin <M8ch88l@gmail.com>
@@ -126,7 +126,10 @@ var
  * Create and return a BigNumber constructor.
  */
 function clone(configObject) {
-  var div, convertBase, parseUnusualNumeric,
+  var div, convertBase, parseValidString, parseBaseString,
+    basePrefix = /^(-?)0([xbo])(?=[^.])/i,
+    isInfinityOrNaN = /^-?(Infinity|NaN)$/,
+    whitespaceOrPlus = /^\s*\+(?!-)|^\s+|\s+$/g,
     P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },
     ONE = new BigNumber(1),
 
@@ -177,6 +180,9 @@ function clone(configObject) {
     // Whether to use cryptographically-secure random number generation, if available.
     CRYPTO = false,                          // true or false
 
+    // Whether to throw or to return NaN on an invalid BigNumber string value.
+    STRICT = true,                           // true or false
+
     // The modulo mode used when calculating the modulus: a mod n.
     // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
     // The remainder (r) is calculated as: r = a - n * q.
@@ -228,11 +234,11 @@ function clone(configObject) {
    * The BigNumber constructor and exported function.
    * Create and return a new instance of a BigNumber object.
    *
-   * v {number|string|BigNumber} A numeric value.
+   * v {BigNumber|string|number|bigint} A numeric value.
    * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.
    */
   function BigNumber(v, b) {
-    var alphabet, c, caseChanged, e, i, len, str, t,
+    var e, i, str, t,
       x = this;
 
     // Enable constructor call without `new`.
@@ -283,141 +289,80 @@ function clone(configObject) {
           return;
         }
 
-        str = String(v);
-      } else {
-        if (t == 'string') { 
-          str = v;
-          if (!isNumeric.test(str)) {
-            return parseUnusualNumeric(x, str);
-          }
-        } else if (t == 'bigint') {
-          str = String(v);
-        } else {
-          throw Error
-            (bignumberError + 'Invalid argument: ' + v);
-        }
-       
-        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
-      } 
-
-      // Decimal point?
-      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
-
-      // Exponential form?
-      if ((i = str.search(/e/i)) > 0) {
-
-        // Determine exponent.
-        if (e < 0) e = i;
-        e += +str.slice(i + 1);
-        str = str.substring(0, i);
-      } else if (e < 0) {
-
-        // Integer.
-        e = str.length;
+        return parseValidString(x, String(v));
       }
 
-    // Base specified.
-    } else {  
-
-      // '[BigNumber Error] String expected: {v}'
-      if (t != 'string') {
-        throw Error
-          (bignumberError + 'String expected: ' + v);
+      if (t == 'bigint') {
+        x.s = v < 0 ? (v = -v, -1) : 1;
+        return parseValidString(x, String(v));
       }
 
-      // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
-      intCheck(b, 2, ALPHABET.length, 'Base');  
-        
-      str = v;
-      x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
-      alphabet = ALPHABET.slice(0, b);
-      e = i = 0;
-
-      // Check that str is a valid base b number.
-      // Don't use RegExp, so alphabet can contain special characters.
-      for (len = str.length; i < len; i++) {
-        if (alphabet.indexOf(c = str.charAt(i)) < 0) {
-          if (c == '.') {
-
-            // If '.' is not the first character and it has not be found before.
-            if (i > e) {
-              e = len;
-              continue;
-            }
-          } else if (!caseChanged) {
-
-            // Allow e.g. hexadecimal 'FF' as well as 'ff'.
-            if (str == str.toUpperCase() && (str = str.toLowerCase()) ||
-                str == str.toLowerCase() && (str = str.toUpperCase())) {
-              caseChanged = true;
-              i = -1;
-              e = 0;
-              continue;
-            }
-          }
-
-          return parseUnusualNumeric(x, v, b);
+      if (t == 'string') { 
+        str = v;
+      } else {
+        if (STRICT) {
+          throw Error
+            (bignumberError + 'BigNumber, string, number, or BigInt expected: ' + v);
         }
-      }  
-
-      str = convertBase(str, b, 10, x.s);
-
-      // Decimal point?
-      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
-      else e = str.length;
-    }
-
-    // Determine leading zeros.
-    for (i = 0; str.charCodeAt(i) === 48; i++);
-
-    // Determine trailing zeros.
-    for (len = str.length; str.charCodeAt(--len) === 48;);
+        str = String(v);
+      }
 
-    if (str = str.slice(i, ++len)) {
-      len -= i;
-      e = e - i - 1;
+      if (isNumeric.test(str)) {
+        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
+        return parseValidString(x, str);
+      }
 
-      // Overflow?
-      if (e > MAX_EXP) {
+      // Strip whitespace and leading +.
+      str = str.replace(whitespaceOrPlus, '');
 
-        // Infinity.
+      // No exception on ±Infinity or NaN.
+      if (isInfinityOrNaN.test(str)) {
+        x.s = isNaN(str) ? null : str < 0 ? -1 : 1;
         x.c = x.e = null;
+        return;
+      }
 
-      // Underflow?
-      } else if (e < MIN_EXP) {
+      // Check for base prefix such as 0x for hexadecimal.
+      str = str.replace(basePrefix, function (m, p1, p2) {
+        b = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;
+        return p1;
+      });
 
-        // Zero.
-        x.c = [x.e = 0];
-      } else {
-        x.e = e;
-        x.c = [];
+      if (b) {
+        return parseBaseString(x, str, b, v);
+      }  
 
-        // Transform base
+      // Strip underscores.
+      str = str.replace(/(\d)_(?=\d)/g, '$1');
 
-        // e is the base 10 exponent.
-        // i is where to slice str to get the first element of the coefficient array.
-        i = (e + 1) % LOG_BASE;
-        if (e < 0) i += LOG_BASE;  // i < 1
+      if (isNumeric.test(str)) {
+        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
+        return parseValidString(x, str);
+      }
 
-        if (i < len) {
-          if (i) x.c.push(+str.slice(0, i));
+      // '[BigNumber Error] Not a number: {v}'
+      if (STRICT) {
+        throw Error
+          (bignumberError + 'Not a number: ' + v);
+      }
 
-          for (len -= LOG_BASE; i < len;) {
-            x.c.push(+str.slice(i, i += LOG_BASE));
-          }
+      // NaN.
+      x.s = x.c = x.e = null;
 
-          i = LOG_BASE - (str = str.slice(i)).length;
-        } else {
-          i -= len;
+    // Base specified.
+    } else {  
+      if (t != 'string') {
+        if (STRICT) {
+          throw Error
+            (bignumberError + 'String expected: ' + v);
         }
-
-        for (; i--; str += '0');
-        x.c.push(+str);
+        v = String(v);    
       }
-    } else {
 
-      // Zero.
-      x.c = [x.e = 0];
+      // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
+      intCheck(b, 2, ALPHABET.length, 'Base');  
+        
+      parseBaseString(x, v.replace(whitespaceOrPlus, ''), b, v);
     }
   }
 
@@ -450,6 +395,7 @@ function clone(configObject) {
    *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]
    *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]
    *   CRYPTO           {boolean}          true or false
+   *   STRICT           {boolean}          true or false
    *   MODULO_MODE      {number}           0 to 9
    *   POW_PRECISION       {number}           0 to MAX
    *   ALPHABET         {string}           A string of unique characters which does not contain
@@ -558,6 +504,18 @@ function clone(configObject) {
           }
         }
 
+        // STRICT {boolean} true or false.
+        // '[BigNumber Error] STRICT not true or false: {v}'
+        if (obj.hasOwnProperty(p = 'STRICT')) {
+          v = obj[p];
+          if (v === !!v) {
+            STRICT = v;
+          } else {
+            throw Error
+             (bignumberError + p + ' not true or false: ' + v);
+          }
+        }
+
         // MODULO_MODE {number} Integer, 0 to 9 inclusive.
         // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'
         if (obj.hasOwnProperty(p = 'MODULO_MODE')) {
@@ -612,6 +570,7 @@ function clone(configObject) {
       EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],
       RANGE: [MIN_EXP, MAX_EXP],
       CRYPTO: CRYPTO,
+      STRICT: STRICT,
       MODULO_MODE: MODULO_MODE,
       POW_PRECISION: POW_PRECISION,
       FORMAT: FORMAT,
@@ -636,7 +595,7 @@ function clone(configObject) {
     if ({}.toString.call(c) != '[object Array]') {
     
       // ±Infinity and NaN
-      return c === null && e === null && (s === null || s === 1 || s === -1)
+      return c === null && e === null && (s === null || s === 1 || s === -1);
     }  
      
     // Check sign and check that exponent is an integer within the allowed range.
@@ -850,6 +809,160 @@ function clone(configObject) {
   // PRIVATE FUNCTIONS
 
 
+  /*
+   * Parse a known-valid decimal string str into BigNumber x.
+   * str must already have its sign removed.
+   */
+  parseValidString = function (x, str) {
+    var e, i, len;
+
+    // Decimal point?
+    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
+
+    // Exponential form?
+    if ((i = str.search(/e/i)) > 0) {
+
+      // Determine exponent.
+      if (e < 0) e = i;
+      e += +str.slice(i + 1);
+      str = str.substring(0, i);
+    } else if (e < 0) {
+
+      // Integer.
+      e = str.length;
+    }
+
+    // Determine leading zeros.
+    for (i = 0; str.charCodeAt(i) === 48; i++);
+
+    // Determine trailing zeros.
+    for (len = str.length; str.charCodeAt(--len) === 48;);
+
+    if (str = str.slice(i, ++len)) {
+      len -= i;
+      e = e - i - 1;
+
+      // Overflow?
+      if (e > MAX_EXP) {
+
+        // Infinity.
+        x.c = x.e = null;
+
+      // Underflow?
+      } else if (e < MIN_EXP) {
+
+        // Zero.
+        x.c = [x.e = 0];
+      } else {
+        x.e = e;
+        x.c = [];
+
+        // Transform base
+
+        // e is the base 10 exponent.
+        // i is where to slice str to get the first element of the coefficient array.
+        i = (e + 1) % LOG_BASE;
+        if (e < 0) i += LOG_BASE;  // i < 1
+
+        if (i < len) {
+          if (i) x.c.push(+str.slice(0, i));
+
+          for (len -= LOG_BASE; i < len;) {
+            x.c.push(+str.slice(i, i += LOG_BASE));
+          }
+
+          i = LOG_BASE - (str = str.slice(i)).length;
+        } else {
+          i -= len;
+        }
+
+        for (; i--; str += '0');
+        x.c.push(+str);
+      }
+    } else {
+
+      // Zero.
+      x.c = [x.e = 0];
+    }
+  };
+
+
+  /*
+   * Parse a non-decimal base string str into BigNumber x.
+   * str must have whitespace/plus stripped and base prefix removed.
+   * b is the base, v is the original input for error messages.
+   *
+   * Handles sign extraction, underscore stripping, leading/trailing dot normalisation,
+   * case flipping, character validation, then converts to base 10 via convertBase
+   * and delegates to parseValidString.
+   */
+  parseBaseString = function (x, str, b, v) {
+    var c, len,
+      alphabet = ALPHABET.slice(0, b),
+      i = 0,
+      clean = '',
+      hasDot = false,
+      prevIsNumeral = false,
+      caseChanged = false;
+
+    x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
+
+    // Check that str is a valid base b number.
+    // Underscores as separators are only valid between two numerals.
+    for (len = str.length; i < len; i++) {
+      c = str.charAt(i);
+
+      if (alphabet.indexOf(c) >= 0) {
+        clean += c;
+        prevIsNumeral = true;
+        continue;
+      }
+
+      if (c == '_') {
+        if (prevIsNumeral && i + 1 < len) {
+          prevIsNumeral = false;
+          continue;
+        }
+      } else if (c == '.') {
+        if (i == 0 || !hasDot && prevIsNumeral) {
+          // Don't add trailing or lone dot.
+          if (i + 1 == len) break;
+          if (i == 0) clean = '0';
+          clean += c;
+          hasDot = true;
+          prevIsNumeral = false;
+          continue;
+        }
+      } else if (!caseChanged) {
+
+        // Allow e.g. hexadecimal 'FF' as well as 'ff'.
+        if (str == str.toUpperCase() && alphabet == alphabet.toLowerCase() &&
+           (str = str.toLowerCase()) ||
+            str == str.toLowerCase() && alphabet == alphabet.toUpperCase() &&
+           (str = str.toUpperCase())) {
+          i = -1;
+          clean = '';
+          caseChanged = true;
+          hasDot = prevIsNumeral = false;
+          continue;
+        }
+      }
+
+      // '[BigNumber Error] Not a base {b} number: {v}'
+      if (STRICT) {
+        throw Error
+          (bignumberError + 'Not a base ' + b + ' number: ' + v);
+      }
+
+      // NaN.
+      x.s = x.c = x.e = null;
+      return;
+    }
+
+    parseValidString(x, convertBase(clean, b, 10, x.s));
+  };
+
+
   // Called by BigNumber and BigNumber.prototype.toString.
   convertBase = (function () {
     var decimal = '0123456789';
@@ -1385,46 +1498,7 @@ function clone(configObject) {
   }
 
 
-  // Handle values that fail the validity test in BigNumber.
-  parseUnusualNumeric = (function () {
-    var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i,
-      dotAfter = /^([^.]+)\.$/,
-      dotBefore = /^\.([^.]+)$/,
-      isInfinityOrNaN = /^-?(Infinity|NaN)$/,
-      whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-
-    return function (x, str, b) {
-      var base,
-        s = str.replace(whitespaceOrPlus, '');
-
-      // No exception on ±Infinity or NaN.
-      if (isInfinityOrNaN.test(s)) {
-        x.s = isNaN(s) ? null : s < 0 ? -1 : 1;
-        x.c = x.e = null;
-        return;
-      }
 
-      // basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i
-      s = s.replace(basePrefix, function (m, p1, p2) {
-        base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;
-        return !b || b == base ? p1 : m;
-      });
-       
-      if (b) {
-        base = b;
-        
-        // E.g. '1.' to '1', '.1' to '0.1'
-        s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');
-      }
-      
-      if (str != s) return new BigNumber(s, base);
-      
-      // '[BigNumber Error] Not a number: {n}'
-      // '[BigNumber Error] Not a base {b} number: {n}'
-      throw Error
-        (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);
-    }
-  })();
 
 
   /*
@@ -2645,12 +2719,12 @@ function clone(configObject) {
 
   /*
    * Return an array of two BigNumbers representing the value of this BigNumber as a simple
-   * fraction with an integer numerator and an integer denominator.
-   * The denominator will be a positive non-zero value less than or equal to the specified
-   * maximum denominator. If a maximum denominator is not specified, the denominator will be
-   * the lowest value necessary to represent the number exactly.
+   * fraction with an integer numerator and an integer denominator. The denominator will be
+   * a positive value less than or equal to the specified maximum denominator. If a maximum
+   * denominator is not specified, the denominator will be the lowest value necessary to
+   * represent the number exactly.
    *
-   * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.
+   * [md] {number|string|BigNumber} Integer > 0, or Infinity. The maximum denominator.
    *
    * '[BigNumber Error] Argument {not an integer|out of range} : {md}'
    */
@@ -2670,7 +2744,9 @@ function clone(configObject) {
       }
     }
 
-    if (!xc) return new BigNumber(x);
+    if (!xc) {
+      return [new BigNumber(x.s || 0), new BigNumber(0)];
+    }  
 
     d = new BigNumber(ONE);
     n1 = d0 = new BigNumber(ONE);

package/lib/index.js

@@ -55,7 +55,7 @@ typeof SuppressedError === "function" ? SuppressedError : function (error, suppr
 };
 
 /*
- *      bignumber.js v10.0.1
+ *      bignumber.js v11.0.0
  *      A JavaScript library for arbitrary-precision arithmetic.
  *      https://github.com/MikeMcl/bignumber.js
  *      Copyright (c) 2026 Michael Mclaughlin <M8ch88l@gmail.com>
@@ -128,7 +128,10 @@ var
  * Create and return a BigNumber constructor.
  */
 function clone(configObject) {
-  var div, convertBase, parseUnusualNumeric,
+  var div, convertBase, parseValidString, parseBaseString,
+    basePrefix = /^(-?)0([xbo])(?=[^.])/i,
+    isInfinityOrNaN = /^-?(Infinity|NaN)$/,
+    whitespaceOrPlus = /^\s*\+(?!-)|^\s+|\s+$/g,
     P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },
     ONE = new BigNumber(1),
 
@@ -179,6 +182,9 @@ function clone(configObject) {
     // Whether to use cryptographically-secure random number generation, if available.
     CRYPTO = false,                          // true or false
 
+    // Whether to throw or to return NaN on an invalid BigNumber string value.
+    STRICT = true,                           // true or false
+
     // The modulo mode used when calculating the modulus: a mod n.
     // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
     // The remainder (r) is calculated as: r = a - n * q.
@@ -230,11 +236,11 @@ function clone(configObject) {
    * The BigNumber constructor and exported function.
    * Create and return a new instance of a BigNumber object.
    *
-   * v {number|string|BigNumber} A numeric value.
+   * v {BigNumber|string|number|bigint} A numeric value.
    * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.
    */
   function BigNumber(v, b) {
-    var alphabet, c, caseChanged, e, i, len, str, t,
+    var e, i, str, t,
       x = this;
 
     // Enable constructor call without `new`.
@@ -285,141 +291,80 @@ function clone(configObject) {
           return;
         }
 
-        str = String(v);
-      } else {
-        if (t == 'string') { 
-          str = v;
-          if (!isNumeric.test(str)) {
-            return parseUnusualNumeric(x, str);
-          }
-        } else if (t == 'bigint') {
-          str = String(v);
-        } else {
-          throw Error
-            (bignumberError + 'Invalid argument: ' + v);
-        }
-       
-        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
-      } 
-
-      // Decimal point?
-      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
-
-      // Exponential form?
-      if ((i = str.search(/e/i)) > 0) {
-
-        // Determine exponent.
-        if (e < 0) e = i;
-        e += +str.slice(i + 1);
-        str = str.substring(0, i);
-      } else if (e < 0) {
-
-        // Integer.
-        e = str.length;
+        return parseValidString(x, String(v));
       }
 
-    // Base specified.
-    } else {  
-
-      // '[BigNumber Error] String expected: {v}'
-      if (t != 'string') {
-        throw Error
-          (bignumberError + 'String expected: ' + v);
+      if (t == 'bigint') {
+        x.s = v < 0 ? (v = -v, -1) : 1;
+        return parseValidString(x, String(v));
       }
 
-      // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
-      intCheck(b, 2, ALPHABET.length, 'Base');  
-        
-      str = v;
-      x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
-      alphabet = ALPHABET.slice(0, b);
-      e = i = 0;
-
-      // Check that str is a valid base b number.
-      // Don't use RegExp, so alphabet can contain special characters.
-      for (len = str.length; i < len; i++) {
-        if (alphabet.indexOf(c = str.charAt(i)) < 0) {
-          if (c == '.') {
-
-            // If '.' is not the first character and it has not be found before.
-            if (i > e) {
-              e = len;
-              continue;
-            }
-          } else if (!caseChanged) {
-
-            // Allow e.g. hexadecimal 'FF' as well as 'ff'.
-            if (str == str.toUpperCase() && (str = str.toLowerCase()) ||
-                str == str.toLowerCase() && (str = str.toUpperCase())) {
-              caseChanged = true;
-              i = -1;
-              e = 0;
-              continue;
-            }
-          }
-
-          return parseUnusualNumeric(x, v, b);
+      if (t == 'string') { 
+        str = v;
+      } else {
+        if (STRICT) {
+          throw Error
+            (bignumberError + 'BigNumber, string, number, or BigInt expected: ' + v);
         }
-      }  
-
-      str = convertBase(str, b, 10, x.s);
-
-      // Decimal point?
-      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
-      else e = str.length;
-    }
-
-    // Determine leading zeros.
-    for (i = 0; str.charCodeAt(i) === 48; i++);
-
-    // Determine trailing zeros.
-    for (len = str.length; str.charCodeAt(--len) === 48;);
+        str = String(v);
+      }
 
-    if (str = str.slice(i, ++len)) {
-      len -= i;
-      e = e - i - 1;
+      if (isNumeric.test(str)) {
+        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
+        return parseValidString(x, str);
+      }
 
-      // Overflow?
-      if (e > MAX_EXP) {
+      // Strip whitespace and leading +.
+      str = str.replace(whitespaceOrPlus, '');
 
-        // Infinity.
+      // No exception on ±Infinity or NaN.
+      if (isInfinityOrNaN.test(str)) {
+        x.s = isNaN(str) ? null : str < 0 ? -1 : 1;
         x.c = x.e = null;
+        return;
+      }
 
-      // Underflow?
-      } else if (e < MIN_EXP) {
+      // Check for base prefix such as 0x for hexadecimal.
+      str = str.replace(basePrefix, function (m, p1, p2) {
+        b = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;
+        return p1;
+      });
 
-        // Zero.
-        x.c = [x.e = 0];
-      } else {
-        x.e = e;
-        x.c = [];
+      if (b) {
+        return parseBaseString(x, str, b, v);
+      }  
 
-        // Transform base
+      // Strip underscores.
+      str = str.replace(/(\d)_(?=\d)/g, '$1');
 
-        // e is the base 10 exponent.
-        // i is where to slice str to get the first element of the coefficient array.
-        i = (e + 1) % LOG_BASE;
-        if (e < 0) i += LOG_BASE;  // i < 1
+      if (isNumeric.test(str)) {
+        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
+        return parseValidString(x, str);
+      }
 
-        if (i < len) {
-          if (i) x.c.push(+str.slice(0, i));
+      // '[BigNumber Error] Not a number: {v}'
+      if (STRICT) {
+        throw Error
+          (bignumberError + 'Not a number: ' + v);
+      }
 
-          for (len -= LOG_BASE; i < len;) {
-            x.c.push(+str.slice(i, i += LOG_BASE));
-          }
+      // NaN.
+      x.s = x.c = x.e = null;
 
-          i = LOG_BASE - (str = str.slice(i)).length;
-        } else {
-          i -= len;
+    // Base specified.
+    } else {  
+      if (t != 'string') {
+        if (STRICT) {
+          throw Error
+            (bignumberError + 'String expected: ' + v);
         }
-
-        for (; i--; str += '0');
-        x.c.push(+str);
+        v = String(v);    
       }
-    } else {
 
-      // Zero.
-      x.c = [x.e = 0];
+      // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
+      intCheck(b, 2, ALPHABET.length, 'Base');  
+        
+      parseBaseString(x, v.replace(whitespaceOrPlus, ''), b, v);
     }
   }
 
@@ -452,6 +397,7 @@ function clone(configObject) {
    *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]
    *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]
    *   CRYPTO           {boolean}          true or false
+   *   STRICT           {boolean}          true or false
    *   MODULO_MODE      {number}           0 to 9
    *   POW_PRECISION       {number}           0 to MAX
    *   ALPHABET         {string}           A string of unique characters which does not contain
@@ -560,6 +506,18 @@ function clone(configObject) {
           }
         }
 
+        // STRICT {boolean} true or false.
+        // '[BigNumber Error] STRICT not true or false: {v}'
+        if (obj.hasOwnProperty(p = 'STRICT')) {
+          v = obj[p];
+          if (v === !!v) {
+            STRICT = v;
+          } else {
+            throw Error
+             (bignumberError + p + ' not true or false: ' + v);
+          }
+        }
+
         // MODULO_MODE {number} Integer, 0 to 9 inclusive.
         // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'
         if (obj.hasOwnProperty(p = 'MODULO_MODE')) {
@@ -614,6 +572,7 @@ function clone(configObject) {
       EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],
       RANGE: [MIN_EXP, MAX_EXP],
       CRYPTO: CRYPTO,
+      STRICT: STRICT,
       MODULO_MODE: MODULO_MODE,
       POW_PRECISION: POW_PRECISION,
       FORMAT: FORMAT,
@@ -638,7 +597,7 @@ function clone(configObject) {
     if ({}.toString.call(c) != '[object Array]') {
     
       // ±Infinity and NaN
-      return c === null && e === null && (s === null || s === 1 || s === -1)
+      return c === null && e === null && (s === null || s === 1 || s === -1);
     }  
      
     // Check sign and check that exponent is an integer within the allowed range.
@@ -852,6 +811,160 @@ function clone(configObject) {
   // PRIVATE FUNCTIONS
 
 
+  /*
+   * Parse a known-valid decimal string str into BigNumber x.
+   * str must already have its sign removed.
+   */
+  parseValidString = function (x, str) {
+    var e, i, len;
+
+    // Decimal point?
+    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
+
+    // Exponential form?
+    if ((i = str.search(/e/i)) > 0) {
+
+      // Determine exponent.
+      if (e < 0) e = i;
+      e += +str.slice(i + 1);
+      str = str.substring(0, i);
+    } else if (e < 0) {
+
+      // Integer.
+      e = str.length;
+    }
+
+    // Determine leading zeros.
+    for (i = 0; str.charCodeAt(i) === 48; i++);
+
+    // Determine trailing zeros.
+    for (len = str.length; str.charCodeAt(--len) === 48;);
+
+    if (str = str.slice(i, ++len)) {
+      len -= i;
+      e = e - i - 1;
+
+      // Overflow?
+      if (e > MAX_EXP) {
+
+        // Infinity.
+        x.c = x.e = null;
+
+      // Underflow?
+      } else if (e < MIN_EXP) {
+
+        // Zero.
+        x.c = [x.e = 0];
+      } else {
+        x.e = e;
+        x.c = [];
+
+        // Transform base
+
+        // e is the base 10 exponent.
+        // i is where to slice str to get the first element of the coefficient array.
+        i = (e + 1) % LOG_BASE;
+        if (e < 0) i += LOG_BASE;  // i < 1
+
+        if (i < len) {
+          if (i) x.c.push(+str.slice(0, i));
+
+          for (len -= LOG_BASE; i < len;) {
+            x.c.push(+str.slice(i, i += LOG_BASE));
+          }
+
+          i = LOG_BASE - (str = str.slice(i)).length;
+        } else {
+          i -= len;
+        }
+
+        for (; i--; str += '0');
+        x.c.push(+str);
+      }
+    } else {
+
+      // Zero.
+      x.c = [x.e = 0];
+    }
+  };
+
+
+  /*
+   * Parse a non-decimal base string str into BigNumber x.
+   * str must have whitespace/plus stripped and base prefix removed.
+   * b is the base, v is the original input for error messages.
+   *
+   * Handles sign extraction, underscore stripping, leading/trailing dot normalisation,
+   * case flipping, character validation, then converts to base 10 via convertBase
+   * and delegates to parseValidString.
+   */
+  parseBaseString = function (x, str, b, v) {
+    var c, len,
+      alphabet = ALPHABET.slice(0, b),
+      i = 0,
+      clean = '',
+      hasDot = false,
+      prevIsNumeral = false,
+      caseChanged = false;
+
+    x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
+
+    // Check that str is a valid base b number.
+    // Underscores as separators are only valid between two numerals.
+    for (len = str.length; i < len; i++) {
+      c = str.charAt(i);
+
+      if (alphabet.indexOf(c) >= 0) {
+        clean += c;
+        prevIsNumeral = true;
+        continue;
+      }
+
+      if (c == '_') {
+        if (prevIsNumeral && i + 1 < len) {
+          prevIsNumeral = false;
+          continue;
+        }
+      } else if (c == '.') {
+        if (i == 0 || !hasDot && prevIsNumeral) {
+          // Don't add trailing or lone dot.
+          if (i + 1 == len) break;
+          if (i == 0) clean = '0';
+          clean += c;
+          hasDot = true;
+          prevIsNumeral = false;
+          continue;
+        }
+      } else if (!caseChanged) {
+
+        // Allow e.g. hexadecimal 'FF' as well as 'ff'.
+        if (str == str.toUpperCase() && alphabet == alphabet.toLowerCase() &&
+           (str = str.toLowerCase()) ||
+            str == str.toLowerCase() && alphabet == alphabet.toUpperCase() &&
+           (str = str.toUpperCase())) {
+          i = -1;
+          clean = '';
+          caseChanged = true;
+          hasDot = prevIsNumeral = false;
+          continue;
+        }
+      }
+
+      // '[BigNumber Error] Not a base {b} number: {v}'
+      if (STRICT) {
+        throw Error
+          (bignumberError + 'Not a base ' + b + ' number: ' + v);
+      }
+
+      // NaN.
+      x.s = x.c = x.e = null;
+      return;
+    }
+
+    parseValidString(x, convertBase(clean, b, 10, x.s));
+  };
+
+
   // Called by BigNumber and BigNumber.prototype.toString.
   convertBase = (function () {
     var decimal = '0123456789';
@@ -1387,46 +1500,7 @@ function clone(configObject) {
   }
 
 
-  // Handle values that fail the validity test in BigNumber.
-  parseUnusualNumeric = (function () {
-    var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i,
-      dotAfter = /^([^.]+)\.$/,
-      dotBefore = /^\.([^.]+)$/,
-      isInfinityOrNaN = /^-?(Infinity|NaN)$/,
-      whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-
-    return function (x, str, b) {
-      var base,
-        s = str.replace(whitespaceOrPlus, '');
-
-      // No exception on ±Infinity or NaN.
-      if (isInfinityOrNaN.test(s)) {
-        x.s = isNaN(s) ? null : s < 0 ? -1 : 1;
-        x.c = x.e = null;
-        return;
-      }
 
-      // basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i
-      s = s.replace(basePrefix, function (m, p1, p2) {
-        base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;
-        return !b || b == base ? p1 : m;
-      });
-       
-      if (b) {
-        base = b;
-        
-        // E.g. '1.' to '1', '.1' to '0.1'
-        s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');
-      }
-      
-      if (str != s) return new BigNumber(s, base);
-      
-      // '[BigNumber Error] Not a number: {n}'
-      // '[BigNumber Error] Not a base {b} number: {n}'
-      throw Error
-        (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);
-    }
-  })();
 
 
   /*
@@ -2647,12 +2721,12 @@ function clone(configObject) {
 
   /*
    * Return an array of two BigNumbers representing the value of this BigNumber as a simple
-   * fraction with an integer numerator and an integer denominator.
-   * The denominator will be a positive non-zero value less than or equal to the specified
-   * maximum denominator. If a maximum denominator is not specified, the denominator will be
-   * the lowest value necessary to represent the number exactly.
+   * fraction with an integer numerator and an integer denominator. The denominator will be
+   * a positive value less than or equal to the specified maximum denominator. If a maximum
+   * denominator is not specified, the denominator will be the lowest value necessary to
+   * represent the number exactly.
    *
-   * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.
+   * [md] {number|string|BigNumber} Integer > 0, or Infinity. The maximum denominator.
    *
    * '[BigNumber Error] Argument {not an integer|out of range} : {md}'
    */
@@ -2672,7 +2746,9 @@ function clone(configObject) {
       }
     }
 
-    if (!xc) return new BigNumber(x);
+    if (!xc) {
+      return [new BigNumber(x.s || 0), new BigNumber(0)];
+    }  
 
     d = new BigNumber(ONE);
     n1 = d0 = new BigNumber(ONE);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@xchainjs/xchain-thorchain-amm",
-  "version": "3.0.35",
+  "version": "3.0.37",
   "description": "module that exposes estimating & swappping cryptocurrency assets on thorchain",
   "keywords": [
     "THORChain",
@@ -36,31 +36,31 @@
     "url": "https://github.com/xchainjs/xchainjs-lib/issues"
   },
   "dependencies": {
-    "@xchainjs/xchain-avax": "2.0.15",
-    "@xchainjs/xchain-base": "1.0.15",
-    "@xchainjs/xchain-bitcoin": "2.2.2",
-    "@xchainjs/xchain-bitcoincash": "2.2.3",
-    "@xchainjs/xchain-bsc": "2.0.16",
-    "@xchainjs/xchain-client": "2.0.11",
-    "@xchainjs/xchain-cosmos": "3.0.11",
-    "@xchainjs/xchain-doge": "2.2.2",
-    "@xchainjs/xchain-ethereum": "2.0.16",
-    "@xchainjs/xchain-evm": "2.0.15",
-    "@xchainjs/xchain-litecoin": "2.2.2",
-    "@xchainjs/xchain-ripple": "1.0.13",
-    "@xchainjs/xchain-solana": "1.1.3",
-    "@xchainjs/xchain-sui": "0.1.0",
-    "@xchainjs/xchain-thorchain": "3.0.15",
-    "@xchainjs/xchain-thorchain-query": "3.0.2",
-    "@xchainjs/xchain-tron": "3.0.4",
-    "@xchainjs/xchain-util": "2.0.6",
-    "@xchainjs/xchain-wallet": "2.0.25",
-    "@xchainjs/xchain-zcash": "1.3.3",
+    "@xchainjs/xchain-avax": "2.0.17",
+    "@xchainjs/xchain-base": "1.0.17",
+    "@xchainjs/xchain-bitcoin": "2.2.4",
+    "@xchainjs/xchain-bitcoincash": "2.2.5",
+    "@xchainjs/xchain-bsc": "2.0.18",
+    "@xchainjs/xchain-client": "2.0.13",
+    "@xchainjs/xchain-cosmos": "3.0.13",
+    "@xchainjs/xchain-doge": "2.2.4",
+    "@xchainjs/xchain-ethereum": "2.0.18",
+    "@xchainjs/xchain-evm": "2.0.17",
+    "@xchainjs/xchain-litecoin": "2.3.1",
+    "@xchainjs/xchain-ripple": "1.0.15",
+    "@xchainjs/xchain-solana": "1.1.5",
+    "@xchainjs/xchain-sui": "0.1.2",
+    "@xchainjs/xchain-thorchain": "3.0.17",
+    "@xchainjs/xchain-thorchain-query": "3.0.4",
+    "@xchainjs/xchain-tron": "3.0.6",
+    "@xchainjs/xchain-util": "2.0.7",
+    "@xchainjs/xchain-wallet": "2.0.27",
+    "@xchainjs/xchain-zcash": "1.3.5",
     "ethers": "^6.14.3"
   },
   "devDependencies": {
     "@ledgerhq/hw-transport-node-hid": "^6.28.6",
-    "axios": "1.13.5",
+    "axios": "1.15.2",
     "axios-mock-adapter": "^2.1.0"
   },
   "publishConfig": {