@solana/web3.js 1.89.1 → 1.90.1

package/lib/index.iife.js

@@ -2381,11 +2381,11 @@ var solanaWeb3 = (function (exports) {
 		} 
 	} (buffer));
 
-	function number$1(n) {
+	function number$2(n) {
 	    if (!Number.isSafeInteger(n) || n < 0)
 	        throw new Error(`Wrong positive integer: ${n}`);
 	}
-	function bytes(b, ...lengths) {
+	function bytes$1(b, ...lengths) {
 	    if (!(b instanceof Uint8Array))
 	        throw new Error('Expected Uint8Array');
 	    if (lengths.length > 0 && !lengths.includes(b.length))
@@ -2394,17 +2394,17 @@ var solanaWeb3 = (function (exports) {
 	function hash(hash) {
 	    if (typeof hash !== 'function' || typeof hash.create !== 'function')
 	        throw new Error('Hash should be wrapped by utils.wrapConstructor');
-	    number$1(hash.outputLen);
-	    number$1(hash.blockLen);
+	    number$2(hash.outputLen);
+	    number$2(hash.blockLen);
 	}
-	function exists(instance, checkFinished = true) {
+	function exists$1(instance, checkFinished = true) {
 	    if (instance.destroyed)
 	        throw new Error('Hash instance has been destroyed');
 	    if (checkFinished && instance.finished)
 	        throw new Error('Hash#digest() has already been called');
 	}
-	function output(out, instance) {
-	    bytes(out);
+	function output$1(out, instance) {
+	    bytes$1(out);
 	    const min = instance.outputLen;
 	    if (out.length < min) {
 	        throw new Error(`digestInto() expects output buffer of length at least ${min}`);
@@ -2421,20 +2421,19 @@ var solanaWeb3 = (function (exports) {
 	// Makes the utils un-importable in browsers without a bundler.
 	// Once node.js 18 is deprecated, we can just drop the import.
 	const u8a$1 = (a) => a instanceof Uint8Array;
-	const u32$1 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
 	// Cast array to view
-	const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
+	const createView$1 = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
 	// The rotate right (circular right shift) operation for uint32
-	const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);
+	const rotr$1 = (word, shift) => (word << (32 - shift)) | (word >>> shift);
 	// big-endian hardware is rare. Just in case someone still decides to run hashes:
 	// early-throw an error because we don't support BE yet.
-	const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;
-	if (!isLE)
+	const isLE$1 = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;
+	if (!isLE$1)
 	    throw new Error('Non little-endian hardware is not supported');
 	/**
 	 * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
 	 */
-	function utf8ToBytes$1(str) {
+	function utf8ToBytes$2(str) {
 	    if (typeof str !== 'string')
 	        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
 	    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
@@ -2444,9 +2443,9 @@ var solanaWeb3 = (function (exports) {
 	 * Warning: when Uint8Array is passed, it would NOT get copied.
 	 * Keep in mind for future mutable operations.
 	 */
-	function toBytes(data) {
+	function toBytes$1(data) {
 	    if (typeof data === 'string')
-	        data = utf8ToBytes$1(data);
+	        data = utf8ToBytes$2(data);
 	    if (!u8a$1(data))
 	        throw new Error(`expected Uint8Array, got ${typeof data}`);
 	    return data;
@@ -2466,14 +2465,14 @@ var solanaWeb3 = (function (exports) {
 	    return r;
 	}
 	// For runtime check if class implements interface
-	class Hash {
+	let Hash$1 = class Hash {
 	    // Safe version that clones internal state
 	    clone() {
 	        return this._cloneInto();
 	    }
-	}
-	function wrapConstructor(hashCons) {
-	    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
+	};
+	function wrapConstructor$1(hashCons) {
+	    const hashC = (msg) => hashCons().update(toBytes$1(msg)).digest();
 	    const tmp = hashCons();
 	    hashC.outputLen = tmp.outputLen;
 	    hashC.blockLen = tmp.blockLen;
@@ -2491,7 +2490,7 @@ var solanaWeb3 = (function (exports) {
 	}
 
 	// Polyfill for Safari 14
-	function setBigUint64(view, byteOffset, value, isLE) {
+	function setBigUint64$1(view, byteOffset, value, isLE) {
 	    if (typeof view.setBigUint64 === 'function')
 	        return view.setBigUint64(byteOffset, value, isLE);
 	    const _32n = BigInt(32);
@@ -2504,7 +2503,7 @@ var solanaWeb3 = (function (exports) {
 	    view.setUint32(byteOffset + l, wl, isLE);
 	}
 	// Base SHA2 class (RFC 6234)
-	class SHA2 extends Hash {
+	let SHA2$1 = class SHA2 extends Hash$1 {
 	    constructor(blockLen, outputLen, padOffset, isLE) {
 	        super();
 	        this.blockLen = blockLen;
@@ -2516,18 +2515,18 @@ var solanaWeb3 = (function (exports) {
 	        this.pos = 0;
 	        this.destroyed = false;
 	        this.buffer = new Uint8Array(blockLen);
-	        this.view = createView(this.buffer);
+	        this.view = createView$1(this.buffer);
 	    }
 	    update(data) {
-	        exists(this);
+	        exists$1(this);
 	        const { view, buffer, blockLen } = this;
-	        data = toBytes(data);
+	        data = toBytes$1(data);
 	        const len = data.length;
 	        for (let pos = 0; pos < len;) {
 	            const take = Math.min(blockLen - this.pos, len - pos);
 	            // Fast path: we have at least one block in input, cast it to view and process
 	            if (take === blockLen) {
-	                const dataView = createView(data);
+	                const dataView = createView$1(data);
 	                for (; blockLen <= len - pos; pos += blockLen)
 	                    this.process(dataView, pos);
 	                continue;
@@ -2545,8 +2544,8 @@ var solanaWeb3 = (function (exports) {
 	        return this;
 	    }
 	    digestInto(out) {
-	        exists(this);
-	        output(out, this);
+	        exists$1(this);
+	        output$1(out, this);
 	        this.finished = true;
 	        // Padding
 	        // We can avoid allocation of buffer for padding completely if it
@@ -2567,9 +2566,9 @@ var solanaWeb3 = (function (exports) {
 	        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that
 	        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.
 	        // So we just write lowest 64 bits of that value.
-	        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
+	        setBigUint64$1(view, blockLen - 8, BigInt(this.length * 8), isLE);
 	        this.process(view, 0);
-	        const oview = createView(out);
+	        const oview = createView$1(out);
 	        const len = this.outputLen;
 	        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT
 	        if (len % 4)
@@ -2600,26 +2599,26 @@ var solanaWeb3 = (function (exports) {
 	            to.buffer.set(buffer);
 	        return to;
 	    }
-	}
+	};
 
-	const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-	const _32n = /* @__PURE__ */ BigInt(32);
+	const U32_MASK64$1 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+	const _32n$1 = /* @__PURE__ */ BigInt(32);
 	// We are not using BigUint64Array, because they are extremely slow as per 2022
-	function fromBig(n, le = false) {
+	function fromBig$1(n, le = false) {
 	    if (le)
-	        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
-	    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
+	        return { h: Number(n & U32_MASK64$1), l: Number((n >> _32n$1) & U32_MASK64$1) };
+	    return { h: Number((n >> _32n$1) & U32_MASK64$1) | 0, l: Number(n & U32_MASK64$1) | 0 };
 	}
-	function split(lst, le = false) {
+	function split$1(lst, le = false) {
 	    let Ah = new Uint32Array(lst.length);
 	    let Al = new Uint32Array(lst.length);
 	    for (let i = 0; i < lst.length; i++) {
-	        const { h, l } = fromBig(lst[i], le);
+	        const { h, l } = fromBig$1(lst[i], le);
 	        [Ah[i], Al[i]] = [h, l];
 	    }
 	    return [Ah, Al];
 	}
-	const toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);
+	const toBig = (h, l) => (BigInt(h >>> 0) << _32n$1) | BigInt(l >>> 0);
 	// for Shift in [0, 32)
 	const shrSH = (h, _l, s) => h >>> s;
 	const shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);
@@ -2633,11 +2632,11 @@ var solanaWeb3 = (function (exports) {
 	const rotr32H = (_h, l) => l;
 	const rotr32L = (h, _l) => h;
 	// Left rotate for Shift in [1, 32)
-	const rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));
-	const rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));
+	const rotlSH$1 = (h, l, s) => (h << s) | (l >>> (32 - s));
+	const rotlSL$1 = (h, l, s) => (l << s) | (h >>> (32 - s));
 	// Left rotate for Shift in (32, 64), NOTE: 32 is special case.
-	const rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
-	const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
+	const rotlBH$1 = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
+	const rotlBL$1 = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
 	// JS uses 32-bit signed integers for bitwise operations which means we cannot
 	// simple take carry out of low bit sum by shift, we need to use division.
 	function add(Ah, Al, Bh, Bl) {
@@ -2653,11 +2652,11 @@ var solanaWeb3 = (function (exports) {
 	const add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;
 	// prettier-ignore
 	const u64$1 = {
-	    fromBig, split, toBig,
+	    fromBig: fromBig$1, split: split$1, toBig,
 	    shrSH, shrSL,
 	    rotrSH, rotrSL, rotrBH, rotrBL,
 	    rotr32H, rotr32L,
-	    rotlSH, rotlSL, rotlBH, rotlBL,
+	    rotlSH: rotlSH$1, rotlSL: rotlSL$1, rotlBH: rotlBH$1, rotlBL: rotlBL$1,
 	    add, add3L, add3H, add4L, add4H, add5H, add5L,
 	};
 	var u64$2 = u64$1;
@@ -2689,7 +2688,7 @@ var solanaWeb3 = (function (exports) {
 	// Temporary buffer, not used to store anything between runs
 	const SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);
 	const SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);
-	class SHA512 extends SHA2 {
+	class SHA512 extends SHA2$1 {
 	    constructor() {
 	        super(128, 64, 16, false);
 	        // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.
@@ -2816,7 +2815,7 @@ var solanaWeb3 = (function (exports) {
 	        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
 	    }
 	}
-	const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());
+	const sha512 = /* @__PURE__ */ wrapConstructor$1(() => new SHA512());
 
 	/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 	// 100 lines of code in the file are duplicated from noble-hashes (utils).
@@ -2948,7 +2947,7 @@ var solanaWeb3 = (function (exports) {
 	/**
 	 * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
 	 */
-	function utf8ToBytes(str) {
+	function utf8ToBytes$1(str) {
 	    if (typeof str !== 'string')
 	        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
 	    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
@@ -3103,7 +3102,7 @@ var solanaWeb3 = (function (exports) {
 		numberToBytesLE: numberToBytesLE,
 		numberToHexUnpadded: numberToHexUnpadded,
 		numberToVarBytesBE: numberToVarBytesBE,
-		utf8ToBytes: utf8ToBytes,
+		utf8ToBytes: utf8ToBytes$1,
 		validateObject: validateObject
 	});
 
@@ -4132,7 +4131,7 @@ var solanaWeb3 = (function (exports) {
 	function ed25519_domain(data, ctx, phflag) {
 	    if (ctx.length > 255)
 	        throw new Error('Context is too big');
-	    return concatBytes$1(utf8ToBytes$1('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);
+	    return concatBytes$1(utf8ToBytes$2('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);
 	}
 	/* @__PURE__ */ twistedEdwards({
 	    ...ed25519Defaults,
@@ -7772,16 +7771,216 @@ var solanaWeb3 = (function (exports) {
 
 	var bs58$1 = /*@__PURE__*/getDefaultExportFromCjs(bs58);
 
+	function number$1(n) {
+	    if (!Number.isSafeInteger(n) || n < 0)
+	        throw new Error(`Wrong positive integer: ${n}`);
+	}
+	// copied from utils
+	function isBytes$1(a) {
+	    return (a instanceof Uint8Array ||
+	        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));
+	}
+	function bytes(b, ...lengths) {
+	    if (!isBytes$1(b))
+	        throw new Error('Expected Uint8Array');
+	    if (lengths.length > 0 && !lengths.includes(b.length))
+	        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);
+	}
+	function exists(instance, checkFinished = true) {
+	    if (instance.destroyed)
+	        throw new Error('Hash instance has been destroyed');
+	    if (checkFinished && instance.finished)
+	        throw new Error('Hash#digest() has already been called');
+	}
+	function output(out, instance) {
+	    bytes(out);
+	    const min = instance.outputLen;
+	    if (out.length < min) {
+	        throw new Error(`digestInto() expects output buffer of length at least ${min}`);
+	    }
+	}
+
+	/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+	// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.
+	// node.js versions earlier than v19 don't declare it in global scope.
+	// For node.js, package.json#exports field mapping rewrites import
+	// from `crypto` to `cryptoNode`, which imports native module.
+	// Makes the utils un-importable in browsers without a bundler.
+	// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.
+	const u32$1 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
+	function isBytes(a) {
+	    return (a instanceof Uint8Array ||
+	        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));
+	}
+	// Cast array to view
+	const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
+	// The rotate right (circular right shift) operation for uint32
+	const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);
+	// big-endian hardware is rare. Just in case someone still decides to run hashes:
+	// early-throw an error because we don't support BE yet.
+	// Other libraries would silently corrupt the data instead of throwing an error,
+	// when they don't support it.
+	const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;
+	if (!isLE)
+	    throw new Error('Non little-endian hardware is not supported');
+	/**
+	 * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
+	 */
+	function utf8ToBytes(str) {
+	    if (typeof str !== 'string')
+	        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
+	    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
+	}
+	/**
+	 * Normalizes (non-hex) string or Uint8Array to Uint8Array.
+	 * Warning: when Uint8Array is passed, it would NOT get copied.
+	 * Keep in mind for future mutable operations.
+	 */
+	function toBytes(data) {
+	    if (typeof data === 'string')
+	        data = utf8ToBytes(data);
+	    if (!isBytes(data))
+	        throw new Error(`expected Uint8Array, got ${typeof data}`);
+	    return data;
+	}
+	// For runtime check if class implements interface
+	class Hash {
+	    // Safe version that clones internal state
+	    clone() {
+	        return this._cloneInto();
+	    }
+	}
+	function wrapConstructor(hashCons) {
+	    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
+	    const tmp = hashCons();
+	    hashC.outputLen = tmp.outputLen;
+	    hashC.blockLen = tmp.blockLen;
+	    hashC.create = () => hashCons();
+	    return hashC;
+	}
+
+	// Polyfill for Safari 14
+	function setBigUint64(view, byteOffset, value, isLE) {
+	    if (typeof view.setBigUint64 === 'function')
+	        return view.setBigUint64(byteOffset, value, isLE);
+	    const _32n = BigInt(32);
+	    const _u32_max = BigInt(0xffffffff);
+	    const wh = Number((value >> _32n) & _u32_max);
+	    const wl = Number(value & _u32_max);
+	    const h = isLE ? 4 : 0;
+	    const l = isLE ? 0 : 4;
+	    view.setUint32(byteOffset + h, wh, isLE);
+	    view.setUint32(byteOffset + l, wl, isLE);
+	}
+	// Base SHA2 class (RFC 6234)
+	class SHA2 extends Hash {
+	    constructor(blockLen, outputLen, padOffset, isLE) {
+	        super();
+	        this.blockLen = blockLen;
+	        this.outputLen = outputLen;
+	        this.padOffset = padOffset;
+	        this.isLE = isLE;
+	        this.finished = false;
+	        this.length = 0;
+	        this.pos = 0;
+	        this.destroyed = false;
+	        this.buffer = new Uint8Array(blockLen);
+	        this.view = createView(this.buffer);
+	    }
+	    update(data) {
+	        exists(this);
+	        const { view, buffer, blockLen } = this;
+	        data = toBytes(data);
+	        const len = data.length;
+	        for (let pos = 0; pos < len;) {
+	            const take = Math.min(blockLen - this.pos, len - pos);
+	            // Fast path: we have at least one block in input, cast it to view and process
+	            if (take === blockLen) {
+	                const dataView = createView(data);
+	                for (; blockLen <= len - pos; pos += blockLen)
+	                    this.process(dataView, pos);
+	                continue;
+	            }
+	            buffer.set(data.subarray(pos, pos + take), this.pos);
+	            this.pos += take;
+	            pos += take;
+	            if (this.pos === blockLen) {
+	                this.process(view, 0);
+	                this.pos = 0;
+	            }
+	        }
+	        this.length += data.length;
+	        this.roundClean();
+	        return this;
+	    }
+	    digestInto(out) {
+	        exists(this);
+	        output(out, this);
+	        this.finished = true;
+	        // Padding
+	        // We can avoid allocation of buffer for padding completely if it
+	        // was previously not allocated here. But it won't change performance.
+	        const { buffer, view, blockLen, isLE } = this;
+	        let { pos } = this;
+	        // append the bit '1' to the message
+	        buffer[pos++] = 0b10000000;
+	        this.buffer.subarray(pos).fill(0);
+	        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again
+	        if (this.padOffset > blockLen - pos) {
+	            this.process(view, 0);
+	            pos = 0;
+	        }
+	        // Pad until full block byte with zeros
+	        for (let i = pos; i < blockLen; i++)
+	            buffer[i] = 0;
+	        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that
+	        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.
+	        // So we just write lowest 64 bits of that value.
+	        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
+	        this.process(view, 0);
+	        const oview = createView(out);
+	        const len = this.outputLen;
+	        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT
+	        if (len % 4)
+	            throw new Error('_sha2: outputLen should be aligned to 32bit');
+	        const outLen = len / 4;
+	        const state = this.get();
+	        if (outLen > state.length)
+	            throw new Error('_sha2: outputLen bigger than state');
+	        for (let i = 0; i < outLen; i++)
+	            oview.setUint32(4 * i, state[i], isLE);
+	    }
+	    digest() {
+	        const { buffer, outputLen } = this;
+	        this.digestInto(buffer);
+	        const res = buffer.slice(0, outputLen);
+	        this.destroy();
+	        return res;
+	    }
+	    _cloneInto(to) {
+	        to || (to = new this.constructor());
+	        to.set(...this.get());
+	        const { blockLen, buffer, length, finished, destroyed, pos } = this;
+	        to.length = length;
+	        to.pos = pos;
+	        to.finished = finished;
+	        to.destroyed = destroyed;
+	        if (length % blockLen)
+	            to.buffer.set(buffer);
+	        return to;
+	    }
+	}
+
 	// SHA2-256 need to try 2^128 hashes to execute birthday attack.
 	// BTC network is doing 2^67 hashes/sec as per early 2023.
 	// Choice: a ? b : c
-	const Chi = (a, b, c) => (a & b) ^ (~a & c);
+	const Chi$1 = (a, b, c) => (a & b) ^ (~a & c);
 	// Majority function, true if any two inpust is true
-	const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);
+	const Maj$1 = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);
 	// Round constants:
 	// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)
 	// prettier-ignore
-	const SHA256_K = /* @__PURE__ */ new Uint32Array([
+	const SHA256_K$1 = /* @__PURE__ */ new Uint32Array([
 	    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
 	    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
 	    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
@@ -7793,25 +7992,25 @@ var solanaWeb3 = (function (exports) {
 	]);
 	// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):
 	// prettier-ignore
-	const IV = /* @__PURE__ */ new Uint32Array([
+	const IV$1 = /* @__PURE__ */ new Uint32Array([
 	    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
 	]);
 	// Temporary buffer, not used to store anything between runs
 	// Named this way because it matches specification.
-	const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
-	class SHA256 extends SHA2 {
+	const SHA256_W$1 = /* @__PURE__ */ new Uint32Array(64);
+	let SHA256$1 = class SHA256 extends SHA2 {
 	    constructor() {
 	        super(64, 32, 8, false);
 	        // We cannot use array here since array allows indexing by variable
 	        // which means optimizer/compiler cannot use registers.
-	        this.A = IV[0] | 0;
-	        this.B = IV[1] | 0;
-	        this.C = IV[2] | 0;
-	        this.D = IV[3] | 0;
-	        this.E = IV[4] | 0;
-	        this.F = IV[5] | 0;
-	        this.G = IV[6] | 0;
-	        this.H = IV[7] | 0;
+	        this.A = IV$1[0] | 0;
+	        this.B = IV$1[1] | 0;
+	        this.C = IV$1[2] | 0;
+	        this.D = IV$1[3] | 0;
+	        this.E = IV$1[4] | 0;
+	        this.F = IV$1[5] | 0;
+	        this.G = IV$1[6] | 0;
+	        this.H = IV$1[7] | 0;
 	    }
 	    get() {
 	        const { A, B, C, D, E, F, G, H } = this;
@@ -7831,21 +8030,21 @@ var solanaWeb3 = (function (exports) {
 	    process(view, offset) {
 	        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array
 	        for (let i = 0; i < 16; i++, offset += 4)
-	            SHA256_W[i] = view.getUint32(offset, false);
+	            SHA256_W$1[i] = view.getUint32(offset, false);
 	        for (let i = 16; i < 64; i++) {
-	            const W15 = SHA256_W[i - 15];
-	            const W2 = SHA256_W[i - 2];
+	            const W15 = SHA256_W$1[i - 15];
+	            const W2 = SHA256_W$1[i - 2];
 	            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);
 	            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);
-	            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;
+	            SHA256_W$1[i] = (s1 + SHA256_W$1[i - 7] + s0 + SHA256_W$1[i - 16]) | 0;
 	        }
 	        // Compression function main loop, 64 rounds
 	        let { A, B, C, D, E, F, G, H } = this;
 	        for (let i = 0; i < 64; i++) {
 	            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
-	            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
+	            const T1 = (H + sigma1 + Chi$1(E, F, G) + SHA256_K$1[i] + SHA256_W$1[i]) | 0;
 	            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);
-	            const T2 = (sigma0 + Maj(A, B, C)) | 0;
+	            const T2 = (sigma0 + Maj$1(A, B, C)) | 0;
 	            H = G;
 	            G = F;
 	            F = E;
@@ -7867,18 +8066,18 @@ var solanaWeb3 = (function (exports) {
 	        this.set(A, B, C, D, E, F, G, H);
 	    }
 	    roundClean() {
-	        SHA256_W.fill(0);
+	        SHA256_W$1.fill(0);
 	    }
 	    destroy() {
 	        this.set(0, 0, 0, 0, 0, 0, 0, 0);
 	        this.buffer.fill(0);
 	    }
-	}
+	};
 	/**
 	 * SHA2-256 hash function
 	 * @param message - data that would be hashed
 	 */
-	const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());
+	const sha256$1 = /* @__PURE__ */ wrapConstructor(() => new SHA256$1());
 
 	var lib = {};
 
@@ -9127,7 +9326,7 @@ var solanaWeb3 = (function (exports) {
 	  /* eslint-disable require-await */
 	  static async createWithSeed(fromPublicKey, seed, programId) {
 	    const buffer$1 = buffer.Buffer.concat([fromPublicKey.toBuffer(), buffer.Buffer.from(seed), programId.toBuffer()]);
-	    const publicKeyBytes = sha256(buffer$1);
+	    const publicKeyBytes = sha256$1(buffer$1);
 	    return new PublicKey(publicKeyBytes);
 	  }
 
@@ -9144,7 +9343,7 @@ var solanaWeb3 = (function (exports) {
 	      buffer$1 = buffer.Buffer.concat([buffer$1, toBuffer(seed)]);
 	    });
 	    buffer$1 = buffer.Buffer.concat([buffer$1, programId.toBuffer(), buffer.Buffer.from('ProgramDerivedAddress')]);
-	    const publicKeyBytes = sha256(buffer$1);
+	    const publicKeyBytes = sha256$1(buffer$1);
 	    if (isOnCurve(publicKeyBytes)) {
 	      throw new Error(`Invalid seeds, address must fall off the curve`);
 	    }
@@ -14460,10 +14659,15 @@ var solanaWeb3 = (function (exports) {
 	}
 	Loader.chunkSize = CHUNK_SIZE;
 
+	/**
+	 * @deprecated Deprecated since Solana v1.17.20.
+	 */
 	const BPF_LOADER_PROGRAM_ID = new PublicKey('BPFLoader2111111111111111111111111111111111');
 
 	/**
 	 * Factory class for transactions to interact with a program loader
+	 *
+	 * @deprecated Deprecated since Solana v1.17.20.
 	 */
 	class BpfLoader {
 	  /**
@@ -22912,6 +23116,30 @@ var solanaWeb3 = (function (exports) {
 	}
 	Ed25519Program.programId = new PublicKey('Ed25519SigVerify111111111111111111111111111');
 
+	const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+	const _32n = /* @__PURE__ */ BigInt(32);
+	// We are not using BigUint64Array, because they are extremely slow as per 2022
+	function fromBig(n, le = false) {
+	    if (le)
+	        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
+	    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
+	}
+	function split(lst, le = false) {
+	    let Ah = new Uint32Array(lst.length);
+	    let Al = new Uint32Array(lst.length);
+	    for (let i = 0; i < lst.length; i++) {
+	        const { h, l } = fromBig(lst[i], le);
+	        [Ah[i], Al[i]] = [h, l];
+	    }
+	    return [Ah, Al];
+	}
+	// Left rotate for Shift in [1, 32)
+	const rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));
+	const rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));
+	// Left rotate for Shift in (32, 64), NOTE: 32 is special case.
+	const rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
+	const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
+
 	// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.
 	// It's called a sponge function.
 	// Various per round constants calculations
@@ -23103,6 +23331,114 @@ var solanaWeb3 = (function (exports) {
 	 */
 	const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);
 
+	// SHA2-256 need to try 2^128 hashes to execute birthday attack.
+	// BTC network is doing 2^67 hashes/sec as per early 2023.
+	// Choice: a ? b : c
+	const Chi = (a, b, c) => (a & b) ^ (~a & c);
+	// Majority function, true if any two inpust is true
+	const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);
+	// Round constants:
+	// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)
+	// prettier-ignore
+	const SHA256_K = /* @__PURE__ */ new Uint32Array([
+	    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+	    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+	    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+	    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+	    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+	    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+	    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+	    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
+	]);
+	// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):
+	// prettier-ignore
+	const IV = /* @__PURE__ */ new Uint32Array([
+	    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
+	]);
+	// Temporary buffer, not used to store anything between runs
+	// Named this way because it matches specification.
+	const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
+	class SHA256 extends SHA2$1 {
+	    constructor() {
+	        super(64, 32, 8, false);
+	        // We cannot use array here since array allows indexing by variable
+	        // which means optimizer/compiler cannot use registers.
+	        this.A = IV[0] | 0;
+	        this.B = IV[1] | 0;
+	        this.C = IV[2] | 0;
+	        this.D = IV[3] | 0;
+	        this.E = IV[4] | 0;
+	        this.F = IV[5] | 0;
+	        this.G = IV[6] | 0;
+	        this.H = IV[7] | 0;
+	    }
+	    get() {
+	        const { A, B, C, D, E, F, G, H } = this;
+	        return [A, B, C, D, E, F, G, H];
+	    }
+	    // prettier-ignore
+	    set(A, B, C, D, E, F, G, H) {
+	        this.A = A | 0;
+	        this.B = B | 0;
+	        this.C = C | 0;
+	        this.D = D | 0;
+	        this.E = E | 0;
+	        this.F = F | 0;
+	        this.G = G | 0;
+	        this.H = H | 0;
+	    }
+	    process(view, offset) {
+	        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array
+	        for (let i = 0; i < 16; i++, offset += 4)
+	            SHA256_W[i] = view.getUint32(offset, false);
+	        for (let i = 16; i < 64; i++) {
+	            const W15 = SHA256_W[i - 15];
+	            const W2 = SHA256_W[i - 2];
+	            const s0 = rotr$1(W15, 7) ^ rotr$1(W15, 18) ^ (W15 >>> 3);
+	            const s1 = rotr$1(W2, 17) ^ rotr$1(W2, 19) ^ (W2 >>> 10);
+	            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;
+	        }
+	        // Compression function main loop, 64 rounds
+	        let { A, B, C, D, E, F, G, H } = this;
+	        for (let i = 0; i < 64; i++) {
+	            const sigma1 = rotr$1(E, 6) ^ rotr$1(E, 11) ^ rotr$1(E, 25);
+	            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
+	            const sigma0 = rotr$1(A, 2) ^ rotr$1(A, 13) ^ rotr$1(A, 22);
+	            const T2 = (sigma0 + Maj(A, B, C)) | 0;
+	            H = G;
+	            G = F;
+	            F = E;
+	            E = (D + T1) | 0;
+	            D = C;
+	            C = B;
+	            B = A;
+	            A = (T1 + T2) | 0;
+	        }
+	        // Add the compressed chunk to the current hash value
+	        A = (A + this.A) | 0;
+	        B = (B + this.B) | 0;
+	        C = (C + this.C) | 0;
+	        D = (D + this.D) | 0;
+	        E = (E + this.E) | 0;
+	        F = (F + this.F) | 0;
+	        G = (G + this.G) | 0;
+	        H = (H + this.H) | 0;
+	        this.set(A, B, C, D, E, F, G, H);
+	    }
+	    roundClean() {
+	        SHA256_W.fill(0);
+	    }
+	    destroy() {
+	        this.set(0, 0, 0, 0, 0, 0, 0, 0);
+	        this.buffer.fill(0);
+	    }
+	}
+	/**
+	 * SHA2-256 hash function
+	 * @param message - data that would be hashed
+	 */
+	const sha256 = /* @__PURE__ */ wrapConstructor$1(() => new SHA256());
+
 	/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 	// Short Weierstrass curve. The formula is: y² = x³ + ax + b
 	function validatePointOpts(curve) {
@@ -24034,13 +24370,13 @@ var solanaWeb3 = (function (exports) {
 	}
 
 	// HMAC (RFC 2104)
-	class HMAC extends Hash {
+	class HMAC extends Hash$1 {
 	    constructor(hash$1, _key) {
 	        super();
 	        this.finished = false;
 	        this.destroyed = false;
 	        hash(hash$1);
-	        const key = toBytes(_key);
+	        const key = toBytes$1(_key);
 	        this.iHash = hash$1.create();
 	        if (typeof this.iHash.update !== 'function')
 	            throw new Error('Expected instance of class which extends utils.Hash');
@@ -24062,13 +24398,13 @@ var solanaWeb3 = (function (exports) {
 	        pad.fill(0);
 	    }
 	    update(buf) {
-	        exists(this);
+	        exists$1(this);
 	        this.iHash.update(buf);
 	        return this;
 	    }
 	    digestInto(out) {
-	        exists(this);
-	        bytes(out, this.outputLen);
+	        exists$1(this);
+	        bytes$1(out, this.outputLen);
 	        this.finished = true;
 	        this.iHash.digestInto(out);
 	        this.oHash.update(out);
@@ -24966,12 +25302,14 @@ var solanaWeb3 = (function (exports) {
 	  /**
 	   * Generate a Transaction that splits Stake tokens into another stake account
 	   */
-	  static split(params) {
+	  static split(params,
+	  // Compute the cost of allocating the new stake account in lamports
+	  rentExemptReserve) {
 	    const transaction = new Transaction();
 	    transaction.add(SystemProgram.createAccount({
 	      fromPubkey: params.authorizedPubkey,
 	      newAccountPubkey: params.splitStakePubkey,
-	      lamports: 0,
+	      lamports: rentExemptReserve,
 	      space: this.space,
 	      programId: this.programId
 	    }));
@@ -24982,7 +25320,9 @@ var solanaWeb3 = (function (exports) {
 	   * Generate a Transaction that splits Stake tokens into another account
 	   * derived from a base public key and seed
 	   */
-	  static splitWithSeed(params) {
+	  static splitWithSeed(params,
+	  // If this stake account is new, compute the cost of allocating it in lamports
+	  rentExemptReserve) {
 	    const {
 	      stakePubkey,
 	      authorizedPubkey,
@@ -24999,6 +25339,13 @@ var solanaWeb3 = (function (exports) {
 	      space: this.space,
 	      programId: this.programId
 	    }));
+	    if (rentExemptReserve && rentExemptReserve > 0) {
+	      transaction.add(SystemProgram.transfer({
+	        fromPubkey: params.authorizedPubkey,
+	        toPubkey: splitStakePubkey,
+	        lamports: rentExemptReserve
+	      }));
+	    }
 	    return transaction.add(this.splitInstruction({
 	      stakePubkey,
 	      authorizedPubkey,
@@ -25129,8 +25476,8 @@ var solanaWeb3 = (function (exports) {
 	 * Max space of a Stake account
 	 *
 	 * This is generated from the solana-stake-program StakeState struct as
-	 * `StakeState::size_of()`:
-	 * https://docs.rs/solana-stake-program/latest/solana_stake_program/stake_state/enum.StakeState.html
+	 * `StakeStateV2::size_of()`:
+	 * https://docs.rs/solana-stake-program/latest/solana_stake_program/stake_state/enum.StakeStateV2.html
 	 */
 	StakeProgram.space = 200;