@solana/web3.js 1.78.1 → 1.78.2

package/lib/index.iife.js

@@ -5528,7 +5528,11 @@ var solanaWeb3 = (function (exports) {
 
   	  var Buffer;
   	  try {
-  	    Buffer = require$$0$1.Buffer;
+  	    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {
+  	      Buffer = window.Buffer;
+  	    } else {
+  	      Buffer = require$$0$1.Buffer;
+  	    }
   	  } catch (e) {
   	  }
 
@@ -5569,23 +5573,19 @@ var solanaWeb3 = (function (exports) {
   	    var start = 0;
   	    if (number[0] === '-') {
   	      start++;
-  	    }
-
-  	    if (base === 16) {
-  	      this._parseHex(number, start);
-  	    } else {
-  	      this._parseBase(number, base, start);
-  	    }
-
-  	    if (number[0] === '-') {
   	      this.negative = 1;
   	    }
 
-  	    this._strip();
-
-  	    if (endian !== 'le') return;
-
-  	    this._initArray(this.toArray(), base, endian);
+  	    if (start < number.length) {
+  	      if (base === 16) {
+  	        this._parseHex(number, start, endian);
+  	      } else {
+  	        this._parseBase(number, base, start);
+  	        if (endian === 'le') {
+  	          this._initArray(this.toArray(), base, endian);
+  	        }
+  	      }
+  	    }
   	  };
 
   	  BN.prototype._initNumber = function _initNumber (number, base, endian) {
@@ -5594,7 +5594,7 @@ var solanaWeb3 = (function (exports) {
   	      number = -number;
   	    }
   	    if (number < 0x4000000) {
-  	      this.words = [ number & 0x3ffffff ];
+  	      this.words = [number & 0x3ffffff];
   	      this.length = 1;
   	    } else if (number < 0x10000000000000) {
   	      this.words = [
@@ -5622,7 +5622,7 @@ var solanaWeb3 = (function (exports) {
   	    // Perhaps a Uint8Array
   	    assert(typeof number.length === 'number');
   	    if (number.length <= 0) {
-  	      this.words = [ 0 ];
+  	      this.words = [0];
   	      this.length = 1;
   	      return this;
   	    }
@@ -5661,39 +5661,31 @@ var solanaWeb3 = (function (exports) {
   	    return this._strip();
   	  };
 
-  	  function parseHex (str, start, end) {
-  	    var r = 0;
-  	    var len = Math.min(str.length, end);
-  	    var z = 0;
-  	    for (var i = start; i < len; i++) {
-  	      var c = str.charCodeAt(i) - 48;
-
-  	      r <<= 4;
-
-  	      var b;
-
-  	      // 'a' - 'f'
-  	      if (c >= 49 && c <= 54) {
-  	        b = c - 49 + 0xa;
-
-  	      // 'A' - 'F'
-  	      } else if (c >= 17 && c <= 22) {
-  	        b = c - 17 + 0xa;
-
-  	      // '0' - '9'
-  	      } else {
-  	        b = c;
-  	      }
-
-  	      r |= b;
-  	      z |= b;
+  	  function parseHex4Bits (string, index) {
+  	    var c = string.charCodeAt(index);
+  	    // '0' - '9'
+  	    if (c >= 48 && c <= 57) {
+  	      return c - 48;
+  	    // 'A' - 'F'
+  	    } else if (c >= 65 && c <= 70) {
+  	      return c - 55;
+  	    // 'a' - 'f'
+  	    } else if (c >= 97 && c <= 102) {
+  	      return c - 87;
+  	    } else {
+  	      assert(false, 'Invalid character in ' + string);
   	    }
+  	  }
 
-  	    assert(!(z & 0xf0), 'Invalid character in ' + str);
+  	  function parseHexByte (string, lowerBound, index) {
+  	    var r = parseHex4Bits(string, index);
+  	    if (index - 1 >= lowerBound) {
+  	      r |= parseHex4Bits(string, index - 1) << 4;
+  	    }
   	    return r;
   	  }
 
-  	  BN.prototype._parseHex = function _parseHex (number, start) {
+  	  BN.prototype._parseHex = function _parseHex (number, start, endian) {
   	    // Create possibly bigger array to ensure that it fits the number
   	    this.length = Math.ceil((number.length - start) / 6);
   	    this.words = new Array(this.length);
@@ -5701,25 +5693,38 @@ var solanaWeb3 = (function (exports) {
   	      this.words[i] = 0;
   	    }
 
-  	    var j, w;
-  	    // Scan 24-bit chunks and add them to the number
+  	    // 24-bits chunks
   	    var off = 0;
-  	    for (i = number.length - 6, j = 0; i >= start; i -= 6) {
-  	      w = parseHex(number, i, i + 6);
-  	      this.words[j] |= (w << off) & 0x3ffffff;
-  	      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb
-  	      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
-  	      off += 24;
-  	      if (off >= 26) {
-  	        off -= 26;
-  	        j++;
+  	    var j = 0;
+
+  	    var w;
+  	    if (endian === 'be') {
+  	      for (i = number.length - 1; i >= start; i -= 2) {
+  	        w = parseHexByte(number, start, i) << off;
+  	        this.words[j] |= w & 0x3ffffff;
+  	        if (off >= 18) {
+  	          off -= 18;
+  	          j += 1;
+  	          this.words[j] |= w >>> 26;
+  	        } else {
+  	          off += 8;
+  	        }
+  	      }
+  	    } else {
+  	      var parseLength = number.length - start;
+  	      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {
+  	        w = parseHexByte(number, start, i) << off;
+  	        this.words[j] |= w & 0x3ffffff;
+  	        if (off >= 18) {
+  	          off -= 18;
+  	          j += 1;
+  	          this.words[j] |= w >>> 26;
+  	        } else {
+  	          off += 8;
+  	        }
   	      }
   	    }
-  	    if (i + 6 !== start) {
-  	      w = parseHex(number, start, i + 6);
-  	      this.words[j] |= (w << off) & 0x3ffffff;
-  	      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
-  	    }
+
   	    this._strip();
   	  };
 
@@ -5752,7 +5757,7 @@ var solanaWeb3 = (function (exports) {
 
   	  BN.prototype._parseBase = function _parseBase (number, base, start) {
   	    // Initialize as zero
-  	    this.words = [ 0 ];
+  	    this.words = [0];
   	    this.length = 1;
 
   	    // Find length of limb in base
@@ -5793,6 +5798,8 @@ var solanaWeb3 = (function (exports) {
   	        this._iaddn(word);
   	      }
   	    }
+
+  	    this._strip();
   	  };
 
   	  BN.prototype.copy = function copy (dest) {
@@ -5805,11 +5812,15 @@ var solanaWeb3 = (function (exports) {
   	    dest.red = this.red;
   	  };
 
+  	  function move (dest, src) {
+  	    dest.words = src.words;
+  	    dest.length = src.length;
+  	    dest.negative = src.negative;
+  	    dest.red = src.red;
+  	  }
+
   	  BN.prototype._move = function _move (dest) {
-  	    dest.words = this.words;
-  	    dest.length = this.length;
-  	    dest.negative = this.negative;
-  	    dest.red = this.red;
+  	    move(dest, this);
   	  };
 
   	  BN.prototype.clone = function clone () {
@@ -5841,9 +5852,21 @@ var solanaWeb3 = (function (exports) {
   	    return this;
   	  };
 
-  	  BN.prototype.inspect = function inspect () {
+  	  // Check Symbol.for because not everywhere where Symbol defined
+  	  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility
+  	  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {
+  	    try {
+  	      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;
+  	    } catch (e) {
+  	      BN.prototype.inspect = inspect;
+  	    }
+  	  } else {
+  	    BN.prototype.inspect = inspect;
+  	  }
+
+  	  function inspect () {
   	    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';
-  	  };
+  	  }
 
   	  /*
 
@@ -5935,16 +5958,16 @@ var solanaWeb3 = (function (exports) {
   	        var w = this.words[i];
   	        var word = (((w << off) | carry) & 0xffffff).toString(16);
   	        carry = (w >>> (24 - off)) & 0xffffff;
-  	        if (carry !== 0 || i !== this.length - 1) {
-  	          out = zeros[6 - word.length] + word + out;
-  	        } else {
-  	          out = word + out;
-  	        }
   	        off += 2;
   	        if (off >= 26) {
   	          off -= 26;
   	          i--;
   	        }
+  	        if (carry !== 0 || i !== this.length - 1) {
+  	          out = zeros[6 - word.length] + word + out;
+  	        } else {
+  	          out = word + out;
+  	        }
   	      }
   	      if (carry !== 0) {
   	        out = carry.toString(16) + out;
@@ -6018,51 +6041,97 @@ var solanaWeb3 = (function (exports) {
   	    return this.toArrayLike(Array, endian, length);
   	  };
 
+  	  var allocate = function allocate (ArrayType, size) {
+  	    if (ArrayType.allocUnsafe) {
+  	      return ArrayType.allocUnsafe(size);
+  	    }
+  	    return new ArrayType(size);
+  	  };
+
   	  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {
+  	    this._strip();
+
   	    var byteLength = this.byteLength();
   	    var reqLength = length || Math.max(1, byteLength);
   	    assert(byteLength <= reqLength, 'byte array longer than desired length');
   	    assert(reqLength > 0, 'Requested array length <= 0');
 
-  	    this._strip();
-  	    var littleEndian = endian === 'le';
   	    var res = allocate(ArrayType, reqLength);
+  	    var postfix = endian === 'le' ? 'LE' : 'BE';
+  	    this['_toArrayLike' + postfix](res, byteLength);
+  	    return res;
+  	  };
+
+  	  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {
+  	    var position = 0;
+  	    var carry = 0;
+
+  	    for (var i = 0, shift = 0; i < this.length; i++) {
+  	      var word = (this.words[i] << shift) | carry;
+
+  	      res[position++] = word & 0xff;
+  	      if (position < res.length) {
+  	        res[position++] = (word >> 8) & 0xff;
+  	      }
+  	      if (position < res.length) {
+  	        res[position++] = (word >> 16) & 0xff;
+  	      }
 
-  	    var b, i;
-  	    var q = this.clone();
-  	    if (!littleEndian) {
-  	      // Assume big-endian
-  	      for (i = 0; i < reqLength - byteLength; i++) {
-  	        res[i] = 0;
+  	      if (shift === 6) {
+  	        if (position < res.length) {
+  	          res[position++] = (word >> 24) & 0xff;
+  	        }
+  	        carry = 0;
+  	        shift = 0;
+  	      } else {
+  	        carry = word >>> 24;
+  	        shift += 2;
   	      }
+  	    }
 
-  	      for (i = 0; !q.isZero(); i++) {
-  	        b = q.andln(0xff);
-  	        q.iushrn(8);
+  	    if (position < res.length) {
+  	      res[position++] = carry;
 
-  	        res[reqLength - i - 1] = b;
+  	      while (position < res.length) {
+  	        res[position++] = 0;
   	      }
-  	    } else {
-  	      for (i = 0; !q.isZero(); i++) {
-  	        b = q.andln(0xff);
-  	        q.iushrn(8);
+  	    }
+  	  };
 
-  	        res[i] = b;
+  	  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {
+  	    var position = res.length - 1;
+  	    var carry = 0;
+
+  	    for (var i = 0, shift = 0; i < this.length; i++) {
+  	      var word = (this.words[i] << shift) | carry;
+
+  	      res[position--] = word & 0xff;
+  	      if (position >= 0) {
+  	        res[position--] = (word >> 8) & 0xff;
+  	      }
+  	      if (position >= 0) {
+  	        res[position--] = (word >> 16) & 0xff;
   	      }
 
-  	      for (; i < reqLength; i++) {
-  	        res[i] = 0;
+  	      if (shift === 6) {
+  	        if (position >= 0) {
+  	          res[position--] = (word >> 24) & 0xff;
+  	        }
+  	        carry = 0;
+  	        shift = 0;
+  	      } else {
+  	        carry = word >>> 24;
+  	        shift += 2;
   	      }
   	    }
 
-  	    return res;
-  	  };
+  	    if (position >= 0) {
+  	      res[position--] = carry;
 
-  	  var allocate = function allocate (ArrayType, size) {
-  	    if (ArrayType.allocUnsafe) {
-  	      return ArrayType.allocUnsafe(size);
+  	      while (position >= 0) {
+  	        res[position--] = 0;
+  	      }
   	    }
-  	    return new ArrayType(size);
   	  };
 
   	  if (Math.clz32) {
@@ -6135,7 +6204,7 @@ var solanaWeb3 = (function (exports) {
   	      var off = (bit / 26) | 0;
   	      var wbit = bit % 26;
 
-  	      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;
+  	      w[bit] = (num.words[off] >>> wbit) & 0x01;
   	    }
 
   	    return w;
@@ -7157,8 +7226,10 @@ var solanaWeb3 = (function (exports) {
   	  }
 
   	  function jumboMulTo (self, num, out) {
-  	    var fftm = new FFTM();
-  	    return fftm.mulp(self, num, out);
+  	    // Temporary disable, see https://github.com/indutny/bn.js/issues/211
+  	    // var fftm = new FFTM();
+  	    // return fftm.mulp(self, num, out);
+  	    return bigMulTo(self, num, out);
   	  }
 
   	  BN.prototype.mulTo = function mulTo (num, out) {
@@ -7177,202 +7248,6 @@ var solanaWeb3 = (function (exports) {
   	    return res;
   	  };
 
-  	  // Cooley-Tukey algorithm for FFT
-  	  // slightly revisited to rely on looping instead of recursion
-
-  	  function FFTM (x, y) {
-  	    this.x = x;
-  	    this.y = y;
-  	  }
-
-  	  FFTM.prototype.makeRBT = function makeRBT (N) {
-  	    var t = new Array(N);
-  	    var l = BN.prototype._countBits(N) - 1;
-  	    for (var i = 0; i < N; i++) {
-  	      t[i] = this.revBin(i, l, N);
-  	    }
-
-  	    return t;
-  	  };
-
-  	  // Returns binary-reversed representation of `x`
-  	  FFTM.prototype.revBin = function revBin (x, l, N) {
-  	    if (x === 0 || x === N - 1) return x;
-
-  	    var rb = 0;
-  	    for (var i = 0; i < l; i++) {
-  	      rb |= (x & 1) << (l - i - 1);
-  	      x >>= 1;
-  	    }
-
-  	    return rb;
-  	  };
-
-  	  // Performs "tweedling" phase, therefore 'emulating'
-  	  // behaviour of the recursive algorithm
-  	  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {
-  	    for (var i = 0; i < N; i++) {
-  	      rtws[i] = rws[rbt[i]];
-  	      itws[i] = iws[rbt[i]];
-  	    }
-  	  };
-
-  	  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {
-  	    this.permute(rbt, rws, iws, rtws, itws, N);
-
-  	    for (var s = 1; s < N; s <<= 1) {
-  	      var l = s << 1;
-
-  	      var rtwdf = Math.cos(2 * Math.PI / l);
-  	      var itwdf = Math.sin(2 * Math.PI / l);
-
-  	      for (var p = 0; p < N; p += l) {
-  	        var rtwdf_ = rtwdf;
-  	        var itwdf_ = itwdf;
-
-  	        for (var j = 0; j < s; j++) {
-  	          var re = rtws[p + j];
-  	          var ie = itws[p + j];
-
-  	          var ro = rtws[p + j + s];
-  	          var io = itws[p + j + s];
-
-  	          var rx = rtwdf_ * ro - itwdf_ * io;
-
-  	          io = rtwdf_ * io + itwdf_ * ro;
-  	          ro = rx;
-
-  	          rtws[p + j] = re + ro;
-  	          itws[p + j] = ie + io;
-
-  	          rtws[p + j + s] = re - ro;
-  	          itws[p + j + s] = ie - io;
-
-  	          /* jshint maxdepth : false */
-  	          if (j !== l) {
-  	            rx = rtwdf * rtwdf_ - itwdf * itwdf_;
-
-  	            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;
-  	            rtwdf_ = rx;
-  	          }
-  	        }
-  	      }
-  	    }
-  	  };
-
-  	  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {
-  	    var N = Math.max(m, n) | 1;
-  	    var odd = N & 1;
-  	    var i = 0;
-  	    for (N = N / 2 | 0; N; N = N >>> 1) {
-  	      i++;
-  	    }
-
-  	    return 1 << i + 1 + odd;
-  	  };
-
-  	  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {
-  	    if (N <= 1) return;
-
-  	    for (var i = 0; i < N / 2; i++) {
-  	      var t = rws[i];
-
-  	      rws[i] = rws[N - i - 1];
-  	      rws[N - i - 1] = t;
-
-  	      t = iws[i];
-
-  	      iws[i] = -iws[N - i - 1];
-  	      iws[N - i - 1] = -t;
-  	    }
-  	  };
-
-  	  FFTM.prototype.normalize13b = function normalize13b (ws, N) {
-  	    var carry = 0;
-  	    for (var i = 0; i < N / 2; i++) {
-  	      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +
-  	        Math.round(ws[2 * i] / N) +
-  	        carry;
-
-  	      ws[i] = w & 0x3ffffff;
-
-  	      if (w < 0x4000000) {
-  	        carry = 0;
-  	      } else {
-  	        carry = w / 0x4000000 | 0;
-  	      }
-  	    }
-
-  	    return ws;
-  	  };
-
-  	  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {
-  	    var carry = 0;
-  	    for (var i = 0; i < len; i++) {
-  	      carry = carry + (ws[i] | 0);
-
-  	      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;
-  	      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;
-  	    }
-
-  	    // Pad with zeroes
-  	    for (i = 2 * len; i < N; ++i) {
-  	      rws[i] = 0;
-  	    }
-
-  	    assert(carry === 0);
-  	    assert((carry & ~0x1fff) === 0);
-  	  };
-
-  	  FFTM.prototype.stub = function stub (N) {
-  	    var ph = new Array(N);
-  	    for (var i = 0; i < N; i++) {
-  	      ph[i] = 0;
-  	    }
-
-  	    return ph;
-  	  };
-
-  	  FFTM.prototype.mulp = function mulp (x, y, out) {
-  	    var N = 2 * this.guessLen13b(x.length, y.length);
-
-  	    var rbt = this.makeRBT(N);
-
-  	    var _ = this.stub(N);
-
-  	    var rws = new Array(N);
-  	    var rwst = new Array(N);
-  	    var iwst = new Array(N);
-
-  	    var nrws = new Array(N);
-  	    var nrwst = new Array(N);
-  	    var niwst = new Array(N);
-
-  	    var rmws = out.words;
-  	    rmws.length = N;
-
-  	    this.convert13b(x.words, x.length, rws, N);
-  	    this.convert13b(y.words, y.length, nrws, N);
-
-  	    this.transform(rws, _, rwst, iwst, N, rbt);
-  	    this.transform(nrws, _, nrwst, niwst, N, rbt);
-
-  	    for (var i = 0; i < N; i++) {
-  	      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];
-  	      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];
-  	      rwst[i] = rx;
-  	    }
-
-  	    this.conjugate(rwst, iwst, N);
-  	    this.transform(rwst, iwst, rmws, _, N, rbt);
-  	    this.conjugate(rmws, _, N);
-  	    this.normalize13b(rmws, N);
-
-  	    out.negative = x.negative ^ y.negative;
-  	    out.length = x.length + y.length;
-  	    return out._strip();
-  	  };
-
   	  // Multiply `this` by `num`
   	  BN.prototype.mul = function mul (num) {
   	    var out = new BN(null);
@@ -7636,7 +7511,7 @@ var solanaWeb3 = (function (exports) {
 
   	    // Possible sign change
   	    if (this.negative !== 0) {
-  	      if (this.length === 1 && (this.words[0] | 0) < num) {
+  	      if (this.length === 1 && (this.words[0] | 0) <= num) {
   	        this.words[0] = num - (this.words[0] | 0);
   	        this.negative = 0;
   	        return this;
@@ -7953,7 +7828,7 @@ var solanaWeb3 = (function (exports) {
   	    var cmp = mod.cmp(half);
 
   	    // Round down
-  	    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;
+  	    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;
 
   	    // Round up
   	    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);
@@ -8489,7 +8364,13 @@ var solanaWeb3 = (function (exports) {
   	    } else if (cmp > 0) {
   	      r.isub(this.p);
   	    } else {
-  	      r._strip();
+  	      if (r.strip !== undefined) {
+  	        // r is a BN v4 instance
+  	        r.strip();
+  	      } else {
+  	        // r is a BN v5 instance
+  	        r._strip();
+  	      }
   	    }
 
   	    return r;
@@ -8663,7 +8544,7 @@ var solanaWeb3 = (function (exports) {
   	  Red.prototype.imod = function imod (a) {
   	    if (this.prime) return this.prime.ireduce(a)._forceRed(this);
 
-  	    a.umod(this.m)._forceRed(this)._move(a);
+  	    move(a, a.umod(this.m)._forceRed(this));
   	    return a;
   	  };
 
@@ -23884,7 +23765,7 @@ var solanaWeb3 = (function (exports) {
                 accounts = config === null || config === void 0 ? void 0 : (_config$lockedWritabl = config.lockedWritableAccounts) === null || _config$lockedWritabl === void 0 ? void 0 : _config$lockedWritabl.map(function (key) {
                   return key.toBase58();
                 });
-                args = this._buildArgs(accounts !== null && accounts !== void 0 && accounts.length ? [accounts] : []);
+                args = accounts !== null && accounts !== void 0 && accounts.length ? [accounts] : [];
                 _context56.next = 4;
                 return this._rpcRequest('getRecentPrioritizationFees', args);
               case 4: