@solana/web3.js 1.94.0 → 1.95.0

package/lib/index.iife.js

@@ -2842,9 +2842,9 @@ var solanaWeb3 = (function (exports) {
 	// This is OK: `abstract` directory does not use noble-hashes.
 	// User may opt-in into using different hashing library. This way, noble-hashes
 	// won't be included into their bundle.
-	const _0n$5 = BigInt(0);
-	const _1n$7 = BigInt(1);
-	const _2n$5 = BigInt(2);
+	const _0n$5 = /* @__PURE__ */ BigInt(0);
+	const _1n$7 = /* @__PURE__ */ BigInt(1);
+	const _2n$5 = /* @__PURE__ */ BigInt(2);
 	function isBytes(a) {
 	    return (a instanceof Uint8Array ||
 	        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));
@@ -3156,7 +3156,7 @@ var solanaWeb3 = (function (exports) {
 	// prettier-ignore
 	const _0n$4 = BigInt(0), _1n$6 = BigInt(1), _2n$4 = BigInt(2), _3n$1 = BigInt(3);
 	// prettier-ignore
-	const _4n = BigInt(4), _5n$1 = BigInt(5), _8n$1 = BigInt(8);
+	const _4n = BigInt(4), _5n$1 = BigInt(5), _8n$2 = BigInt(8);
 	// prettier-ignore
 	BigInt(9); BigInt(16);
 	// Calculates a modulo b
@@ -3302,8 +3302,8 @@ var solanaWeb3 = (function (exports) {
 	        };
 	    }
 	    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)
-	    if (P % _8n$1 === _5n$1) {
-	        const c1 = (P - _5n$1) / _8n$1;
+	    if (P % _8n$2 === _5n$1) {
+	        const c1 = (P - _5n$1) / _8n$2;
 	        return function sqrt5mod8(Fp, n) {
 	            const n2 = Fp.mul(n, _2n$4);
 	            const v = Fp.pow(n2, c1);
@@ -3456,12 +3456,6 @@ var solanaWeb3 = (function (exports) {
 	    });
 	    return Object.freeze(f);
 	}
-	function FpSqrtEven(Fp, elm) {
-	    if (!Fp.isOdd)
-	        throw new Error(`Field doesn't have isOdd`);
-	    const root = Fp.sqrt(elm);
-	    return Fp.isOdd(root) ? Fp.neg(root) : root;
-	}
 	/**
 	 * Returns total number of bytes consumed by the field element.
 	 * For example, 32 bytes for usual 256-bit weierstrass curve.
@@ -3669,7 +3663,7 @@ var solanaWeb3 = (function (exports) {
 	// Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²
 	// Be friendly to bad ECMAScript parsers by not using bigint literals
 	// prettier-ignore
-	const _0n$2 = BigInt(0), _1n$4 = BigInt(1), _2n$3 = BigInt(2), _8n = BigInt(8);
+	const _0n$2 = BigInt(0), _1n$4 = BigInt(1), _2n$3 = BigInt(2), _8n$1 = BigInt(8);
 	// verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:
 	const VERIFY_DEFAULT = { zip215: true };
 	function validateOpts$1(curve) {
@@ -3918,7 +3912,7 @@ var solanaWeb3 = (function (exports) {
 	            const { ex: x, ey: y, ez: z } = this;
 	            const is0 = this.is0();
 	            if (iz == null)
-	                iz = is0 ? _8n : Fp.inv(z); // 8 was chosen arbitrarily
+	                iz = is0 ? _8n$1 : Fp.inv(z); // 8 was chosen arbitrarily
 	            const ax = modP(x * iz);
 	            const ay = modP(y * iz);
 	            const zz = modP(z * iz);
@@ -4093,12 +4087,14 @@ var solanaWeb3 = (function (exports) {
 	 */
 	const ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');
 	// √(-1) aka √(a) aka 2^((p-1)/4)
-	const ED25519_SQRT_M1 = BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');
+	const ED25519_SQRT_M1 = /* @__PURE__ */ BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');
 	// prettier-ignore
-	BigInt(0); const _1n$3 = BigInt(1), _2n$2 = BigInt(2), _5n = BigInt(5);
+	BigInt(0); const _1n$3 = BigInt(1), _2n$2 = BigInt(2); BigInt(3);
 	// prettier-ignore
-	const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);
+	const _5n = BigInt(5), _8n = BigInt(8);
 	function ed25519_pow_2_252_3(x) {
+	    // prettier-ignore
+	    const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);
 	    const P = ED25519_P;
 	    const x2 = (x * x) % P;
 	    const b2 = (x2 * x) % P; // x^3, 11
@@ -4147,8 +4143,8 @@ var solanaWeb3 = (function (exports) {
 	        x = mod(-x, P);
 	    return { isValid: useRoot1 || useRoot2, value: x };
 	}
-	const Fp$1 = Field(ED25519_P, undefined, true);
-	const ed25519Defaults = {
+	const Fp$1 = /* @__PURE__ */ (() => Field(ED25519_P, undefined, true))();
+	const ed25519Defaults = /* @__PURE__ */ (() => ({
 	    // Param: a
 	    a: BigInt(-1), // Fp.create(-1) is proper; our way still works and is faster
 	    // d is equal to -121665/121666 over finite field.
@@ -4160,7 +4156,7 @@ var solanaWeb3 = (function (exports) {
 	    // 2n**252n + 27742317777372353535851937790883648493n;
 	    n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),
 	    // Cofactor
-	    h: BigInt(8),
+	    h: _8n,
 	    // Base point (x, y) aka generator point
 	    Gx: BigInt('15112221349535400772501151409588531511454012693041857206046113283949847762202'),
 	    Gy: BigInt('46316835694926478169428394003475163141307993866256225615783033603165251855960'),
@@ -4171,40 +4167,8 @@ var solanaWeb3 = (function (exports) {
 	    // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.
 	    // Constant-time, u/√v
 	    uvRatio,
-	};
-	const ed25519 = /* @__PURE__ */ twistedEdwards(ed25519Defaults);
-	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);
-	}
-	/* @__PURE__ */ twistedEdwards({
-	    ...ed25519Defaults,
-	    domain: ed25519_domain,
-	});
-	/* @__PURE__ */ twistedEdwards({
-	    ...ed25519Defaults,
-	    domain: ed25519_domain,
-	    prehash: sha512,
-	});
-	// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)
-	// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since
-	// SageMath returns different root first and everything falls apart
-	const ELL2_C1 = (Fp$1.ORDER + BigInt(3)) / BigInt(8); // 1. c1 = (q + 3) / 8       # Integer arithmetic
-	Fp$1.pow(_2n$2, ELL2_C1); // 2. c2 = 2^c1
-	Fp$1.sqrt(Fp$1.neg(Fp$1.ONE)); // 3. c3 = sqrt(-1)
-	(Fp$1.ORDER - BigInt(5)) / BigInt(8); // 4. c4 = (q - 5) / 8       # Integer arithmetic
-	BigInt(486662);
-	FpSqrtEven(Fp$1, Fp$1.neg(BigInt(486664))); // sgn0(c1) MUST equal 0
-	// √(ad - 1)
-	BigInt('25063068953384623474111414158702152701244531502492656460079210482610430750235');
-	// 1 / √(a-d)
-	BigInt('54469307008909316920995813868745141605393597292927456921205312896311721017578');
-	// 1-d²
-	BigInt('1159843021668779879193775521855586647937357759715417654439879720876111806838');
-	// (d-1)²
-	BigInt('40440834346308536858101042469323190826248399146238708352240133220865137265952');
-	BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff');
+	}))();
+	const ed25519 = /* @__PURE__ */ (() => twistedEdwards(ed25519Defaults))();
 
 	/**
 	 * A 64 byte secret key, the first 32 bytes of which is the
@@ -14776,6 +14740,12 @@ var solanaWeb3 = (function (exports) {
 	function isObject(x) {
 	    return typeof x === 'object' && x != null;
 	}
+	/**
+	 * Check if a value is a non-array object.
+	 */
+	function isNonArrayObject(x) {
+	    return isObject(x) && !Array.isArray(x);
+	}
 	/**
 	 * Return a value as a printable string.
 	 */
@@ -14840,20 +14810,9 @@ var solanaWeb3 = (function (exports) {
 	 */
 	function* run(value, struct, options = {}) {
 	    const { path = [], branch = [value], coerce = false, mask = false } = options;
-	    const ctx = { path, branch };
+	    const ctx = { path, branch, mask };
 	    if (coerce) {
 	        value = struct.coercer(value, ctx);
-	        if (mask &&
-	            struct.type !== 'type' &&
-	            isObject(struct.schema) &&
-	            isObject(value) &&
-	            !Array.isArray(value)) {
-	            for (const key in value) {
-	                if (struct.schema[key] === undefined) {
-	                    delete value[key];
-	                }
-	            }
-	        }
 	    }
 	    let status = 'valid';
 	    for (const failure of struct.validator(value, ctx)) {
@@ -14955,7 +14914,8 @@ var solanaWeb3 = (function (exports) {
 	    }
 	    /**
 	     * Mask a value, coercing and validating it, but returning only the subset of
-	     * properties defined by the struct's schema.
+	     * properties defined by the struct's schema. Masking applies recursively to
+	     * props of `object` structs only.
 	     */
 	    mask(value, message) {
 	        return mask(value, this, message);
@@ -14964,9 +14924,10 @@ var solanaWeb3 = (function (exports) {
 	     * Validate a value with the struct's validation logic, returning a tuple
 	     * representing the result.
 	     *
-	     * You may optionally pass `true` for the `withCoercion` argument to coerce
+	     * You may optionally pass `true` for the `coerce` argument to coerce
 	     * the value before attempting to validate it. If you do, the result will
-	     * contain the coerced result when successful.
+	     * contain the coerced result when successful. Also, `mask` will turn on
+	     * masking of the unknown `object` props recursively if passed.
 	     */
 	    validate(value, options = {}) {
 	        return validate$1(value, this, options);
@@ -15151,7 +15112,11 @@ var solanaWeb3 = (function (exports) {
 	            }
 	        },
 	        validator(value) {
-	            return (isObject(value) || `Expected an object, but received: ${print(value)}`);
+	            return (isNonArrayObject(value) ||
+	                `Expected an object, but received: ${print(value)}`);
+	        },
+	        coercer(value) {
+	            return isNonArrayObject(value) ? { ...value } : value;
 	        },
 	    });
 	}
@@ -15185,6 +15150,9 @@ var solanaWeb3 = (function (exports) {
 	            return (Array.isArray(value) ||
 	                `Expected an array, but received: ${print(value)}`);
 	        },
+	        coercer(value) {
+	            return Array.isArray(value) ? value.slice() : value;
+	        },
 	    });
 	}
 	/**
@@ -15206,10 +15174,11 @@ var solanaWeb3 = (function (exports) {
 	            }
 	        },
 	        validator(value) {
-	            return (isObject(value) || `Expected an object, but received: ${print(value)}`);
+	            return (isNonArrayObject(value) ||
+	                `Expected an object, but received: ${print(value)}`);
 	        },
 	        coercer(value) {
-	            return isObject(value) ? { ...value } : value;
+	            return isNonArrayObject(value) ? { ...value } : value;
 	        },
 	    });
 	}
@@ -15221,9 +15190,12 @@ var solanaWeb3 = (function (exports) {
 	    return new Struct({
 	        type: 'union',
 	        schema: null,
-	        coercer(value) {
+	        coercer(value, ctx) {
 	            for (const S of Structs) {
-	                const [error, coerced] = S.validate(value, { coerce: true });
+	                const [error, coerced] = S.validate(value, {
+	                    coerce: true,
+	                    mask: ctx.mask,
+	                });
 	                if (!error) {
 	                    return coerced;
 	                }
@@ -22332,6 +22304,81 @@ var solanaWeb3 = (function (exports) {
 	 */
 	const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);
 
+	// HMAC (RFC 2104)
+	class HMAC extends Hash {
+	    constructor(hash$1, _key) {
+	        super();
+	        this.finished = false;
+	        this.destroyed = false;
+	        hash(hash$1);
+	        const key = toBytes(_key);
+	        this.iHash = hash$1.create();
+	        if (typeof this.iHash.update !== 'function')
+	            throw new Error('Expected instance of class which extends utils.Hash');
+	        this.blockLen = this.iHash.blockLen;
+	        this.outputLen = this.iHash.outputLen;
+	        const blockLen = this.blockLen;
+	        const pad = new Uint8Array(blockLen);
+	        // blockLen can be bigger than outputLen
+	        pad.set(key.length > blockLen ? hash$1.create().update(key).digest() : key);
+	        for (let i = 0; i < pad.length; i++)
+	            pad[i] ^= 0x36;
+	        this.iHash.update(pad);
+	        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone
+	        this.oHash = hash$1.create();
+	        // Undo internal XOR && apply outer XOR
+	        for (let i = 0; i < pad.length; i++)
+	            pad[i] ^= 0x36 ^ 0x5c;
+	        this.oHash.update(pad);
+	        pad.fill(0);
+	    }
+	    update(buf) {
+	        exists(this);
+	        this.iHash.update(buf);
+	        return this;
+	    }
+	    digestInto(out) {
+	        exists(this);
+	        bytes(out, this.outputLen);
+	        this.finished = true;
+	        this.iHash.digestInto(out);
+	        this.oHash.update(out);
+	        this.oHash.digestInto(out);
+	        this.destroy();
+	    }
+	    digest() {
+	        const out = new Uint8Array(this.oHash.outputLen);
+	        this.digestInto(out);
+	        return out;
+	    }
+	    _cloneInto(to) {
+	        // Create new instance without calling constructor since key already in state and we don't know it.
+	        to || (to = Object.create(Object.getPrototypeOf(this), {}));
+	        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
+	        to = to;
+	        to.finished = finished;
+	        to.destroyed = destroyed;
+	        to.blockLen = blockLen;
+	        to.outputLen = outputLen;
+	        to.oHash = oHash._cloneInto(to.oHash);
+	        to.iHash = iHash._cloneInto(to.iHash);
+	        return to;
+	    }
+	    destroy() {
+	        this.destroyed = true;
+	        this.oHash.destroy();
+	        this.iHash.destroy();
+	    }
+	}
+	/**
+	 * HMAC: RFC2104 message authentication code.
+	 * @param hash - function that would be used e.g. sha256
+	 * @param key - message key
+	 * @param message - message data
+	 */
+	const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
+	hmac.create = (hash, key) => new HMAC(hash, key);
+
 	/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 	// Short Weierstrass curve. The formula is: y² = x³ + ax + b
 	function validatePointOpts(curve) {
@@ -23268,81 +23315,6 @@ var solanaWeb3 = (function (exports) {
 	    };
 	}
 
-	// HMAC (RFC 2104)
-	class HMAC extends Hash {
-	    constructor(hash$1, _key) {
-	        super();
-	        this.finished = false;
-	        this.destroyed = false;
-	        hash(hash$1);
-	        const key = toBytes(_key);
-	        this.iHash = hash$1.create();
-	        if (typeof this.iHash.update !== 'function')
-	            throw new Error('Expected instance of class which extends utils.Hash');
-	        this.blockLen = this.iHash.blockLen;
-	        this.outputLen = this.iHash.outputLen;
-	        const blockLen = this.blockLen;
-	        const pad = new Uint8Array(blockLen);
-	        // blockLen can be bigger than outputLen
-	        pad.set(key.length > blockLen ? hash$1.create().update(key).digest() : key);
-	        for (let i = 0; i < pad.length; i++)
-	            pad[i] ^= 0x36;
-	        this.iHash.update(pad);
-	        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone
-	        this.oHash = hash$1.create();
-	        // Undo internal XOR && apply outer XOR
-	        for (let i = 0; i < pad.length; i++)
-	            pad[i] ^= 0x36 ^ 0x5c;
-	        this.oHash.update(pad);
-	        pad.fill(0);
-	    }
-	    update(buf) {
-	        exists(this);
-	        this.iHash.update(buf);
-	        return this;
-	    }
-	    digestInto(out) {
-	        exists(this);
-	        bytes(out, this.outputLen);
-	        this.finished = true;
-	        this.iHash.digestInto(out);
-	        this.oHash.update(out);
-	        this.oHash.digestInto(out);
-	        this.destroy();
-	    }
-	    digest() {
-	        const out = new Uint8Array(this.oHash.outputLen);
-	        this.digestInto(out);
-	        return out;
-	    }
-	    _cloneInto(to) {
-	        // Create new instance without calling constructor since key already in state and we don't know it.
-	        to || (to = Object.create(Object.getPrototypeOf(this), {}));
-	        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
-	        to = to;
-	        to.finished = finished;
-	        to.destroyed = destroyed;
-	        to.blockLen = blockLen;
-	        to.outputLen = outputLen;
-	        to.oHash = oHash._cloneInto(to.oHash);
-	        to.iHash = iHash._cloneInto(to.iHash);
-	        return to;
-	    }
-	    destroy() {
-	        this.destroyed = true;
-	        this.oHash.destroy();
-	        this.iHash.destroy();
-	    }
-	}
-	/**
-	 * HMAC: RFC2104 message authentication code.
-	 * @param hash - function that would be used e.g. sha256
-	 * @param key - message key
-	 * @param message - message data
-	 */
-	const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
-	hmac.create = (hash, key) => new HMAC(hash, key);
-
 	/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 	// connects noble-curves to noble-hashes
 	function getHash(hash) {
@@ -24851,6 +24823,7 @@ var solanaWeb3 = (function (exports) {
 	  name: string(),
 	  website: optional(string()),
 	  details: optional(string()),
+	  iconUrl: optional(string()),
 	  keybaseUsername: optional(string())
 	});