@honeybbq/teamspeak-client 0.3.0 → 0.3.2

package/dist/{primitives-xIr6Tjk4.js → primitives-CdX74Rgu.js}

@@ -51,24 +51,24 @@ var c = class extends Error {
 	}
 	publicKeyBase64() {
 		let e = this.privateKey.export({ format: "jwk" });
-		return e.x === void 0 || e.y === void 0 || typeof e.x != "string" || typeof e.y != "string" ? "" : E(oe(e.x, v), oe(e.y, v));
+		return e.x === void 0 || e.y === void 0 || typeof e.x != "string" || typeof e.y != "string" ? "" : ee(ce(e.x, v), ce(e.y, v));
 	}
 	toString() {
 		let e = this.privateKey.export({ format: "jwk" });
 		if (!e.d) return `:${this.offset}`;
-		let t = oe(e.d, v);
+		let t = ce(e.d, v);
 		return `${Buffer.from(t).toString("base64")}:${this.offset}`;
 	}
 	securityLevel() {
 		let e = t("sha1");
-		return e.update(this.publicKeyBase64()), e.update(this.offset.toString(10)), se(e.digest());
+		return e.update(this.publicKeyBase64()), e.update(this.offset.toString(10)), le(e.digest());
 	}
 	async upgradeToLevel(e, n) {
 		let r = this.publicKeyBase64();
 		for (;;) {
 			if (n?.aborted) throw n.reason;
 			let i = t("sha1");
-			if (i.update(r), i.update(this.offset.toString(10)), se(i.digest()) >= e) return;
+			if (i.update(r), i.update(this.offset.toString(10)), le(i.digest()) >= e) return;
 			this.offset++, this.offset % 10000n == 0n && await new Promise((e) => setImmediate(e));
 		}
 	}
@@ -98,19 +98,23 @@ function C(e) {
 	let { privateKey: n } = o("ec", { namedCurve: "prime256v1" }), r = new x(n, 0n), i = r.publicKeyBase64();
 	for (;;) {
 		let n = t("sha1");
-		if (n.update(i), n.update(r.offset.toString(10)), se(n.digest()) >= e) return r;
+		if (n.update(i), n.update(r.offset.toString(10)), le(n.digest()) >= e) return r;
 		r.offset++;
 	}
 }
 function w(e) {
-	let n = t("sha1").update(e).digest();
-	return Buffer.from(n).toString("base64");
+	let t = Number.parseInt(e, 10);
+	return Number.isNaN(t) || t < 6 ? "sha1" : "sha256";
 }
-function T(e) {
+function T(e, n = "sha1") {
+	let r = t(n).update(e).digest();
+	return Buffer.from(r).toString("base64");
+}
+function E(e) {
 	return t("sha512").update(e).digest();
 }
-function E(e, t) {
-	let n = O(3, Buffer.from([7, 0])), r = O(2, ae(32)), i = O(2, ae(e)), a = O(2, ae(t));
+function ee(e, t) {
+	let n = O(3, Buffer.from([7, 0])), r = O(2, oe(32)), i = O(2, oe(e)), a = O(2, oe(t));
 	return O(48, Buffer.concat([
 		n,
 		r,
@@ -118,8 +122,8 @@ function E(e, t) {
 		a
 	])).toString("base64");
 }
-function ee(e) {
-	let t = D(e), n = {
+function D(e) {
+	let t = te(e), n = {
 		kty: "EC",
 		crv: "P-256",
 		x: Buffer.from(t.slice(1, 33)).toString("base64url"),
@@ -130,13 +134,13 @@ function ee(e) {
 		format: "jwk"
 	});
 }
-function D(e) {
+function te(e) {
 	try {
-		return te(e);
+		return ne(e);
 	} catch {}
-	return ne(e);
+	return re(e);
 }
-function te(e) {
+function ne(e) {
 	let t = k(e, 48).value, n = 0, r = k(t, 3, n);
 	n += r.consumed;
 	let i = k(t, 2, n);
@@ -144,35 +148,35 @@ function te(e) {
 	let a = k(t, 2, n);
 	n += a.consumed;
 	let o = k(t, 2, n);
-	return re(A(a.value, v), A(o.value, v));
+	return ie(se(a.value, v), se(o.value, v));
 }
-function ne(e) {
+function re(e) {
 	let t = k(e, 48).value, n = 0, r = k(t, 2, n);
 	n += r.consumed;
 	let i = k(t, 2, n);
-	return re(A(r.value, v), A(i.value, v));
+	return ie(se(r.value, v), se(i.value, v));
 }
-function re(e, t) {
+function ie(e, t) {
 	if (e.length > v || t.length > v) throw Error("invalid public key point encoding");
 	let n = new Uint8Array(y);
 	return n[0] = b, n.set(e, 33 - e.length), n.set(t, 65 - t.length), n;
 }
 function O(e, t) {
-	let n = ie(t.length);
+	let n = ae(t.length);
 	return Buffer.concat([
 		Buffer.from([e]),
 		n,
 		t
 	]);
 }
-function ie(e) {
+function ae(e) {
 	return e < 128 ? Buffer.from([e]) : e < 256 ? Buffer.from([129, e]) : Buffer.from([
 		130,
 		e >> 8 & 255,
 		e & 255
 	]);
 }
-function ae(e) {
+function oe(e) {
 	if (typeof e == "number") {
 		let t = [], n = e;
 		do
@@ -197,7 +201,7 @@ function k(e, t, n = 0) {
 		consumed: r - n + i
 	};
 }
-function A(e, t) {
+function se(e, t) {
 	let n = 0;
 	for (; n < e.length - 1 && e[n] === 0;) n++;
 	let r = e.slice(n);
@@ -206,13 +210,13 @@ function A(e, t) {
 	let i = new Uint8Array(t);
 	return i.set(r, t - r.length), i;
 }
-function oe(e, t) {
+function ce(e, t) {
 	let n = Buffer.from(e, "base64url");
 	if (n.length === t) return n;
 	let r = Buffer.alloc(t);
 	return n.copy(r, t - n.length), r;
 }
-function se(e) {
+function le(e) {
 	let t = 0;
 	for (let n of e) if (n === 0) t += 8;
 	else for (let e = 0; e < 8; e++) if (!(n & 1 << e)) t++;
@@ -221,31 +225,31 @@ function se(e) {
 }
 //#endregion
 //#region node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/_u64.js
-var ce = /* @__PURE__ */ BigInt(2 ** 32 - 1), le = /* @__PURE__ */ BigInt(32);
-function ue(e, t = !1) {
+var ue = /* @__PURE__ */ BigInt(2 ** 32 - 1), de = /* @__PURE__ */ BigInt(32);
+function fe(e, t = !1) {
 	return t ? {
-		h: Number(e & ce),
-		l: Number(e >> le & ce)
+		h: Number(e & ue),
+		l: Number(e >> de & ue)
 	} : {
-		h: Number(e >> le & ce) | 0,
-		l: Number(e & ce) | 0
+		h: Number(e >> de & ue) | 0,
+		l: Number(e & ue) | 0
 	};
 }
-function de(e, t = !1) {
+function pe(e, t = !1) {
 	let n = e.length, r = new Uint32Array(n), i = new Uint32Array(n);
 	for (let a = 0; a < n; a++) {
-		let { h: n, l: o } = ue(e[a], t);
+		let { h: n, l: o } = fe(e[a], t);
 		[r[a], i[a]] = [n, o];
 	}
 	return [r, i];
 }
-var fe = (e) => e / 2 ** 32 | 0, pe = (e) => e >>> 0;
-function me(e, t, n, r) {
-	let i = fe(n), a = pe(n);
+var me = (e) => e / 2 ** 32 | 0, he = (e) => e >>> 0;
+function ge(e, t, n, r) {
+	let i = me(n), a = he(n);
 	e.setUint32(t, r ? a : i, r), e.setUint32(t + 4, r ? i : a, r);
 }
-var he = (e, t, n) => e >>> n, ge = (e, t, n) => e << 32 - n | t >>> n, j = (e, t, n) => e >>> n | t << 32 - n, M = (e, t, n) => e << 32 - n | t >>> n, _e = (e, t, n) => e << 64 - n | t >>> n - 32, ve = (e, t, n) => e >>> n - 32 | t << 64 - n;
-function N(e, t, n, r) {
+var _e = (e, t, n) => e >>> n, ve = (e, t, n) => e << 32 - n | t >>> n, A = (e, t, n) => e >>> n | t << 32 - n, j = (e, t, n) => e << 32 - n | t >>> n, M = (e, t, n) => e << 64 - n | t >>> n - 32, N = (e, t, n) => e >>> n - 32 | t << 64 - n;
+function P(e, t, n, r) {
 	let i = (t >>> 0) + (r >>> 0);
 	return {
 		h: e + n + (i / 2 ** 32 | 0) | 0,
@@ -259,14 +263,14 @@ function Te(e) {
 	return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in e && e.BYTES_PER_ELEMENT === 1;
 }
 var Ee = (e) => e ? `"${e}" ` : "";
-function P(e, t = "") {
+function F(e, t = "") {
 	if (typeof e != "number") throw TypeError(Ee(t) + "expected number, got " + typeof e);
 	if (!Number.isSafeInteger(e) || e < 0) throw RangeError(Ee(t) + "expected integer >= 0, got " + e);
 	return e;
 }
-function F(e, t, n = "") {
+function I(e, t, n = "") {
 	if (Te(e) && (t === void 0 || e.length === t)) return e;
-	t !== void 0 && P(t, "length");
+	t !== void 0 && F(t, "length");
 	let r = Te(e), i = t === void 0 ? "" : ` of length ${t}`, a = r ? `length=${e.length}` : `type=${typeof e}`, o = Ee(n) + "expected Uint8Array" + i + ", got " + a;
 	throw r ? RangeError(o) : TypeError(o);
 }
@@ -283,7 +287,7 @@ function ke(e, t = !0) {
 	if (t && e.finished) throw Error("digest() was already called");
 }
 function Ae(e, t) {
-	F(e, void 0, "output");
+	I(e, void 0, "output");
 	let n = t.outputLen;
 	if (!(e.length >= n)) throw RangeError("\"output\" expected length >= " + n);
 }
@@ -295,7 +299,7 @@ function Me(e) {
 }
 var Ne = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Pe = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function Fe(e) {
-	if (F(e), Ne) return e.toHex();
+	if (I(e), Ne) return e.toHex();
 	let t = "";
 	for (let n = 0; n < e.length; n++) t += Pe[e[n]];
 	return t;
@@ -327,7 +331,7 @@ function Re(...e) {
 	let t = 0;
 	for (let n = 0; n < e.length; n++) {
 		let r = e[n];
-		F(r), t += r.length;
+		I(r), t += r.length;
 	}
 	let n = new Uint8Array(t);
 	for (let t = 0, r = 0; t < e.length; t++) {
@@ -346,7 +350,7 @@ function Be(e, t = {}) {
 	return n.outputLen = r.outputLen, n.blockLen = r.blockLen, n.canXOF = r.canXOF, n.create = (t) => e(t), Object.assign(n, t), Object.freeze(n);
 }
 function Ve(e = 32) {
-	P(e, "bytesLength");
+	F(e, "bytesLength");
 	let t = typeof globalThis == "object" ? globalThis.crypto : null;
 	if (typeof t?.getRandomValues != "function") throw Error("crypto.getRandomValues must be defined");
 	if (e > 65536) throw RangeError(`"bytesLength" expected <= 65536, got ${e}`);
@@ -380,7 +384,7 @@ var He = (e) => ({ oid: Uint8Array.from([
 		this.blockLen = e, this.outputLen = t, this.padOffset = n, this.isLE = r, this.buffer = new Uint8Array(e), this.view = Me(this.buffer);
 	}
 	update(e) {
-		ke(this), F(e);
+		ke(this), I(e);
 		let { view: t, buffer: n, blockLen: r } = this, i = e.length, a = !1;
 		for (let o = 0; o < i;) {
 			let s = Math.min(r - this.pos, i - o);
@@ -397,7 +401,7 @@ var He = (e) => ({ oid: Uint8Array.from([
 	digestInto(e) {
 		ke(this), Ae(e, this), this.finished = !0;
 		let { buffer: t, view: n, blockLen: r, isLE: i } = this, { pos: a } = this;
-		t[a++] = 128, t.fill(0, a), this.padOffset > r - a && (this.process(n, 0), t.fill(0)), me(n, r - 8, this.length * 8, i), this.process(n, 0), this.roundClean();
+		t[a++] = 128, t.fill(0, a), this.padOffset > r - a && (this.process(n, 0), t.fill(0)), ge(n, r - 8, this.length * 8, i), this.process(n, 0), this.roundClean();
 		let o = e === t ? n : Me(e), s = this.outputLen, c = s / 4, l = this.get();
 		if (s % 4 || c > l.length) throw Error("invalid outputLen");
 		for (let e = 0; e < c; e++) o.setUint32(4 * e, l[e], i);
@@ -432,7 +436,7 @@ var He = (e) => ({ oid: Uint8Array.from([
 	4215389547,
 	1541459225,
 	327033209
-]), Ge = /* @__PURE__ */ de((/* @__PURE__ */ "0x428a2f98d728ae22.0x7137449123ef65cd.0xb5c0fbcfec4d3b2f.0xe9b5dba58189dbbc.0x3956c25bf348b538.0x59f111f1b605d019.0x923f82a4af194f9b.0xab1c5ed5da6d8118.0xd807aa98a3030242.0x12835b0145706fbe.0x243185be4ee4b28c.0x550c7dc3d5ffb4e2.0x72be5d74f27b896f.0x80deb1fe3b1696b1.0x9bdc06a725c71235.0xc19bf174cf692694.0xe49b69c19ef14ad2.0xefbe4786384f25e3.0x0fc19dc68b8cd5b5.0x240ca1cc77ac9c65.0x2de92c6f592b0275.0x4a7484aa6ea6e483.0x5cb0a9dcbd41fbd4.0x76f988da831153b5.0x983e5152ee66dfab.0xa831c66d2db43210.0xb00327c898fb213f.0xbf597fc7beef0ee4.0xc6e00bf33da88fc2.0xd5a79147930aa725.0x06ca6351e003826f.0x142929670a0e6e70.0x27b70a8546d22ffc.0x2e1b21385c26c926.0x4d2c6dfc5ac42aed.0x53380d139d95b3df.0x650a73548baf63de.0x766a0abb3c77b2a8.0x81c2c92e47edaee6.0x92722c851482353b.0xa2bfe8a14cf10364.0xa81a664bbc423001.0xc24b8b70d0f89791.0xc76c51a30654be30.0xd192e819d6ef5218.0xd69906245565a910.0xf40e35855771202a.0x106aa07032bbd1b8.0x19a4c116b8d2d0c8.0x1e376c085141ab53.0x2748774cdf8eeb99.0x34b0bcb5e19b48a8.0x391c0cb3c5c95a63.0x4ed8aa4ae3418acb.0x5b9cca4f7763e373.0x682e6ff3d6b2b8a3.0x748f82ee5defb2fc.0x78a5636f43172f60.0x84c87814a1f0ab72.0x8cc702081a6439ec.0x90befffa23631e28.0xa4506cebde82bde9.0xbef9a3f7b2c67915.0xc67178f2e372532b.0xca273eceea26619c.0xd186b8c721c0c207.0xeada7dd6cde0eb1e.0xf57d4f7fee6ed178.0x06f067aa72176fba.0x0a637dc5a2c898a6.0x113f9804bef90dae.0x1b710b35131c471b.0x28db77f523047d84.0x32caab7b40c72493.0x3c9ebe0a15c9bebc.0x431d67c49c100d4c.0x4cc5d4becb3e42b6.0x597f299cfc657e2a.0x5fcb6fab3ad6faec.0x6c44198c4a475817".split(".")).map((e) => BigInt(e))), Ke = Ge[0], qe = Ge[1], I = /* @__PURE__ */ new Uint32Array(80), L = /* @__PURE__ */ new Uint32Array(80), Je = class extends Ue {
+]), Ge = /* @__PURE__ */ pe((/* @__PURE__ */ "0x428a2f98d728ae22.0x7137449123ef65cd.0xb5c0fbcfec4d3b2f.0xe9b5dba58189dbbc.0x3956c25bf348b538.0x59f111f1b605d019.0x923f82a4af194f9b.0xab1c5ed5da6d8118.0xd807aa98a3030242.0x12835b0145706fbe.0x243185be4ee4b28c.0x550c7dc3d5ffb4e2.0x72be5d74f27b896f.0x80deb1fe3b1696b1.0x9bdc06a725c71235.0xc19bf174cf692694.0xe49b69c19ef14ad2.0xefbe4786384f25e3.0x0fc19dc68b8cd5b5.0x240ca1cc77ac9c65.0x2de92c6f592b0275.0x4a7484aa6ea6e483.0x5cb0a9dcbd41fbd4.0x76f988da831153b5.0x983e5152ee66dfab.0xa831c66d2db43210.0xb00327c898fb213f.0xbf597fc7beef0ee4.0xc6e00bf33da88fc2.0xd5a79147930aa725.0x06ca6351e003826f.0x142929670a0e6e70.0x27b70a8546d22ffc.0x2e1b21385c26c926.0x4d2c6dfc5ac42aed.0x53380d139d95b3df.0x650a73548baf63de.0x766a0abb3c77b2a8.0x81c2c92e47edaee6.0x92722c851482353b.0xa2bfe8a14cf10364.0xa81a664bbc423001.0xc24b8b70d0f89791.0xc76c51a30654be30.0xd192e819d6ef5218.0xd69906245565a910.0xf40e35855771202a.0x106aa07032bbd1b8.0x19a4c116b8d2d0c8.0x1e376c085141ab53.0x2748774cdf8eeb99.0x34b0bcb5e19b48a8.0x391c0cb3c5c95a63.0x4ed8aa4ae3418acb.0x5b9cca4f7763e373.0x682e6ff3d6b2b8a3.0x748f82ee5defb2fc.0x78a5636f43172f60.0x84c87814a1f0ab72.0x8cc702081a6439ec.0x90befffa23631e28.0xa4506cebde82bde9.0xbef9a3f7b2c67915.0xc67178f2e372532b.0xca273eceea26619c.0xd186b8c721c0c207.0xeada7dd6cde0eb1e.0xf57d4f7fee6ed178.0x06f067aa72176fba.0x0a637dc5a2c898a6.0x113f9804bef90dae.0x1b710b35131c471b.0x28db77f523047d84.0x32caab7b40c72493.0x3c9ebe0a15c9bebc.0x431d67c49c100d4c.0x4cc5d4becb3e42b6.0x597f299cfc657e2a.0x5fcb6fab3ad6faec.0x6c44198c4a475817".split(".")).map((e) => BigInt(e))), Ke = Ge[0], qe = Ge[1], L = /* @__PURE__ */ new Uint32Array(80), R = /* @__PURE__ */ new Uint32Array(80), Je = class extends Ue {
 	Ah = 0;
 	Al = 0;
 	Bh = 0;
@@ -480,22 +484,22 @@ var He = (e) => ({ oid: Uint8Array.from([
 		return (e ||= new this.constructor()).set(...this.get()), this._cloneIntoMeta(e);
 	}
 	process(e, t) {
-		for (let n = 0; n < 16; n++, t += 4) I[n] = e.getUint32(t), L[n] = e.getUint32(t += 4);
+		for (let n = 0; n < 16; n++, t += 4) L[n] = e.getUint32(t), R[n] = e.getUint32(t += 4);
 		for (let e = 16; e < 80; e++) {
-			let t = I[e - 15] | 0, n = L[e - 15] | 0, r = j(t, n, 1) ^ j(t, n, 8) ^ he(t, n, 7), i = M(t, n, 1) ^ M(t, n, 8) ^ ge(t, n, 7), a = I[e - 2] | 0, o = L[e - 2] | 0, s = j(a, o, 19) ^ _e(a, o, 61) ^ he(a, o, 6), c = xe(i, M(a, o, 19) ^ ve(a, o, 61) ^ ge(a, o, 6), L[e - 7], L[e - 16]), l = Se(c, r, s, I[e - 7], I[e - 16]);
-			I[e] = l | 0, L[e] = c | 0;
+			let t = L[e - 15] | 0, n = R[e - 15] | 0, r = A(t, n, 1) ^ A(t, n, 8) ^ _e(t, n, 7), i = j(t, n, 1) ^ j(t, n, 8) ^ ve(t, n, 7), a = L[e - 2] | 0, o = R[e - 2] | 0, s = A(a, o, 19) ^ M(a, o, 61) ^ _e(a, o, 6), c = xe(i, j(a, o, 19) ^ N(a, o, 61) ^ ve(a, o, 6), R[e - 7], R[e - 16]), l = Se(c, r, s, L[e - 7], L[e - 16]);
+			L[e] = l | 0, R[e] = c | 0;
 		}
 		let { Ah: n, Al: r, Bh: i, Bl: a, Ch: o, Cl: s, Dh: c, Dl: l, Eh: u, El: d, Fh: f, Fl: p, Gh: m, Gl: h, Hh: g, Hl: _ } = this;
 		for (let e = 0; e < 80; e++) {
-			let t = j(u, d, 14) ^ j(u, d, 18) ^ _e(u, d, 41), v = M(u, d, 14) ^ M(u, d, 18) ^ ve(u, d, 41), y = u & f ^ ~u & m, b = d & p ^ ~d & h, x = Ce(_, v, b, qe[e], L[e]), S = we(x, g, t, y, Ke[e], I[e]), C = x | 0, w = j(n, r, 28) ^ _e(n, r, 34) ^ _e(n, r, 39), T = M(n, r, 28) ^ ve(n, r, 34) ^ ve(n, r, 39), E = n & i ^ n & o ^ i & o, ee = r & a ^ r & s ^ a & s;
-			g = m | 0, _ = h | 0, m = f | 0, h = p | 0, f = u | 0, p = d | 0, {h: u, l: d} = N(c | 0, l | 0, S | 0, C | 0), c = o | 0, l = s | 0, o = i | 0, s = a | 0, i = n | 0, a = r | 0;
+			let t = A(u, d, 14) ^ A(u, d, 18) ^ M(u, d, 41), v = j(u, d, 14) ^ j(u, d, 18) ^ N(u, d, 41), y = u & f ^ ~u & m, b = d & p ^ ~d & h, x = Ce(_, v, b, qe[e], R[e]), S = we(x, g, t, y, Ke[e], L[e]), C = x | 0, w = A(n, r, 28) ^ M(n, r, 34) ^ M(n, r, 39), T = j(n, r, 28) ^ N(n, r, 34) ^ N(n, r, 39), E = n & i ^ n & o ^ i & o, ee = r & a ^ r & s ^ a & s;
+			g = m | 0, _ = h | 0, m = f | 0, h = p | 0, f = u | 0, p = d | 0, {h: u, l: d} = P(c | 0, l | 0, S | 0, C | 0), c = o | 0, l = s | 0, o = i | 0, s = a | 0, i = n | 0, a = r | 0;
 			let D = ye(C, T, ee);
 			n = be(D, S, w, E), r = D | 0;
 		}
-		({h: n, l: r} = N(this.Ah | 0, this.Al | 0, n | 0, r | 0)), {h: i, l: a} = N(this.Bh | 0, this.Bl | 0, i | 0, a | 0), {h: o, l: s} = N(this.Ch | 0, this.Cl | 0, o | 0, s | 0), {h: c, l: l} = N(this.Dh | 0, this.Dl | 0, c | 0, l | 0), {h: u, l: d} = N(this.Eh | 0, this.El | 0, u | 0, d | 0), {h: f, l: p} = N(this.Fh | 0, this.Fl | 0, f | 0, p | 0), {h: m, l: h} = N(this.Gh | 0, this.Gl | 0, m | 0, h | 0), {h: g, l: _} = N(this.Hh | 0, this.Hl | 0, g | 0, _ | 0), this.set(n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _);
+		({h: n, l: r} = P(this.Ah | 0, this.Al | 0, n | 0, r | 0)), {h: i, l: a} = P(this.Bh | 0, this.Bl | 0, i | 0, a | 0), {h: o, l: s} = P(this.Ch | 0, this.Cl | 0, o | 0, s | 0), {h: c, l: l} = P(this.Dh | 0, this.Dl | 0, c | 0, l | 0), {h: u, l: d} = P(this.Eh | 0, this.El | 0, u | 0, d | 0), {h: f, l: p} = P(this.Fh | 0, this.Fl | 0, f | 0, p | 0), {h: m, l: h} = P(this.Gh | 0, this.Gl | 0, m | 0, h | 0), {h: g, l: _} = P(this.Hh | 0, this.Hl | 0, g | 0, _ | 0), this.set(n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _);
 	}
 	roundClean() {
-		je(I, L);
+		je(L, R);
 	}
 	destroy() {
 		this.destroyed = !0, je(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
@@ -512,27 +516,27 @@ function Ze(e, t, n = () => {}) {
 	for (let r = 0; r < e.length; r++) n(e[r], `${t}[${r}]`);
 	return e;
 }
-var R = (e, t, n) => F(e, t, n), Qe = P;
-function z(e, t = "object") {
+var z = (e, t, n) => I(e, t, n), Qe = F;
+function B(e, t = "object") {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw TypeError(t === "object" ? "expected valid options object" : `"${t}" expected object, got type=${typeof e}`);
 	return e;
 }
-function B(e, t) {
+function V(e, t) {
 	if (typeof e != "function") throw TypeError(`"${t}" is invalid: expected function, got ${typeof e}`);
 	return e;
 }
-var $e = Fe, et = (...e) => Re(...e), tt = (e) => Le(e), nt = Te, rt = (e) => Ve(e), it = /* @__PURE__ */ BigInt(0), at = /* @__PURE__ */ BigInt(1), ot = (e) => e ? `"${e}" ` : "";
-function V(e, t = "") {
-	if (typeof e != "boolean") throw TypeError(ot(t) + "expected boolean, got type=" + typeof e);
+var $e = Fe, et = (...e) => Re(...e), tt = (e) => Le(e), nt = Te, rt = (e) => Ve(e), H = /* @__PURE__ */ BigInt(0), it = /* @__PURE__ */ BigInt(1), at = (e) => e ? `"${e}" ` : "";
+function U(e, t = "") {
+	if (typeof e != "boolean") throw TypeError(at(t) + "expected boolean, got type=" + typeof e);
 	return e;
 }
-function st(e) {
+function ot(e) {
 	if (typeof e == "bigint") {
-		if (!U(e)) throw RangeError("positive bigint expected, got " + e);
+		if (!W(e)) throw RangeError("positive bigint expected, got " + e);
 	} else Qe(e);
 	return e;
 }
-function H(e, t = "") {
+function st(e, t = "") {
 	if (typeof e != "number") {
 		let n = t && `"${t}" `;
 		throw TypeError(n + "expected number, got type=" + typeof e);
@@ -544,17 +548,17 @@ function H(e, t = "") {
 }
 function ct(e) {
 	if (typeof e != "string") throw TypeError("hex string expected, got " + typeof e);
-	return e === "" ? it : BigInt("0x" + e);
+	return e === "" ? H : BigInt("0x" + e);
 }
 function lt(e) {
 	return ct(Fe(e));
 }
 function ut(e) {
-	return ct(Fe(pt(F(e)).reverse()));
+	return ct(Fe(pt(I(e)).reverse()));
 }
 function dt(e, t) {
-	if (P(t), t === 0) throw Error("zero output length is invalid");
-	e = st(e);
+	if (F(t), t === 0) throw Error("zero output length is invalid");
+	e = ot(e);
 	let n = t * 2, r = e.toString(16);
 	if (r.length > n) throw RangeError("number is too large");
 	return Le(r.padStart(n, "0"));
@@ -563,24 +567,24 @@ function ft(e, t) {
 	return dt(e, t).reverse();
 }
 function pt(e) {
-	return Uint8Array.from(R(e));
+	return Uint8Array.from(z(e));
 }
-function U(e) {
-	return typeof e == "bigint" && it <= e;
+function W(e) {
+	return typeof e == "bigint" && H <= e;
 }
 function mt(e, t, n) {
-	return U(e) && U(t) && U(n) && t <= e && e < n;
+	return W(e) && W(t) && W(n) && t <= e && e < n;
 }
 function ht(e, t, n, r) {
 	if (!mt(t, n, r)) throw RangeError("expected valid " + e + ": " + n + " <= n < " + r + ", got " + t);
 }
 function gt(e) {
-	if (e < it) throw Error("expected non-negative bigint, got " + e);
-	return e === it ? 0 : e.toString(2).length;
+	if (e < H) throw Error("expected non-negative bigint, got " + e);
+	return e === H ? 0 : e.toString(2).length;
 }
-var _t = (e) => (H(e, "n"), (at << BigInt(e)) - at);
-function W(e, t = {}, n = {}, r = "object") {
-	z(e, r), z(t, "fields"), z(n, "optFields");
+var _t = (e) => (st(e, "n"), (it << BigInt(e)) - it);
+function G(e, t = {}, n = {}, r = "object") {
+	B(e, r), B(t, "fields"), B(n, "optFields");
 	function i(t, n, i) {
 		let a = r === "object" ? `param "${String(t)}"` : `"${r}.${String(t)}"`, o = e[t];
 		if (!Object.hasOwn(e, t) && (i ? o !== void 0 : n !== "function")) throw TypeError(`${a} is invalid: expected own property`);
@@ -593,28 +597,28 @@ function W(e, t = {}, n = {}, r = "object") {
 }
 //#endregion
 //#region node_modules/.pnpm/@noble+curves@2.4.0/node_modules/@noble/curves/abstract/modular.js
-var G = /* @__PURE__ */ BigInt(0), K = /* @__PURE__ */ BigInt(1), q = /* @__PURE__ */ BigInt(2), vt = /* @__PURE__ */ BigInt(3), yt = /* @__PURE__ */ BigInt(4), bt = /* @__PURE__ */ BigInt(5), xt = /* @__PURE__ */ BigInt(7), St = /* @__PURE__ */ BigInt(8), Ct = /* @__PURE__ */ BigInt(9), wt = /* @__PURE__ */ BigInt(15), Tt = /* @__PURE__ */ BigInt(16), Et = /* @__PURE__ */ BigInt("0x10000000000000000");
-function J(e, t) {
-	if (t <= G) throw Error("mod: expected positive modulus, got " + t);
+var K = /* @__PURE__ */ BigInt(0), q = /* @__PURE__ */ BigInt(1), J = /* @__PURE__ */ BigInt(2), vt = /* @__PURE__ */ BigInt(3), yt = /* @__PURE__ */ BigInt(4), bt = /* @__PURE__ */ BigInt(5), xt = /* @__PURE__ */ BigInt(7), St = /* @__PURE__ */ BigInt(8), Ct = /* @__PURE__ */ BigInt(9), wt = /* @__PURE__ */ BigInt(15), Tt = /* @__PURE__ */ BigInt(16), Et = /* @__PURE__ */ BigInt("0x10000000000000000");
+function Y(e, t) {
+	if (t <= K) throw Error("mod: expected positive modulus, got " + t);
 	let n = e % t;
-	return n >= G ? n : t + n;
+	return n >= K ? n : t + n;
 }
 function Dt(e, t, n) {
-	if (n <= K) throw Error("pow: expected modulus > 1, got " + n);
+	if (n <= q) throw Error("pow: expected modulus > 1, got " + n);
 	if (typeof t != "bigint") throw TypeError("invalid exponent: expected bigint, got " + typeof t);
-	if (t < G) throw Error("invalid exponent, negatives unsupported");
-	if (t === G) return K;
-	if (t === K) return e;
+	if (t < K) throw Error("invalid exponent, negatives unsupported");
+	if (t === K) return q;
+	if (t === q) return e;
 	let r = e % n;
-	if (r < G && (r += n), t < Et) {
-		let e = K;
-		for (; t > G;) t & K && (e = e * r % n), r = r * r % n, t >>= K;
+	if (r < K && (r += n), t < Et) {
+		let e = q;
+		for (; t > K;) t & q && (e = e * r % n), r = r * r % n, t >>= q;
 		return e;
 	}
 	let i = [];
-	for (; t > G;) i.push(Number(t & wt)), t >>= yt;
+	for (; t > K;) i.push(Number(t & wt)), t >>= yt;
 	let a = Array(16);
-	a[0] = K, a[1] = r;
+	a[0] = q, a[1] = r;
 	for (let e = 2; e < 16; e++) a[e] = a[e - 1] * r % n;
 	let o = a[i[i.length - 1]];
 	for (let e = i.length - 2; e >= 0; e--) {
@@ -624,37 +628,37 @@ function Dt(e, t, n) {
 	}
 	return o;
 }
-function Y(e, t, n) {
-	if (n <= K) throw Error("pow2: expected modulus > 1, got " + n);
-	if (t < G) throw Error("pow2: expected non-negative exponent, got " + t);
+function X(e, t, n) {
+	if (n <= q) throw Error("pow2: expected modulus > 1, got " + n);
+	if (t < K) throw Error("pow2: expected non-negative exponent, got " + t);
 	let r = e;
-	for (; t-- > G;) r *= r, r %= n;
+	for (; t-- > K;) r *= r, r %= n;
 	return r;
 }
 function Ot(e, t) {
-	if (e === G) throw Error("invert: expected non-zero number");
-	if (t <= K) throw Error("invert: expected modulus > 1, got " + t);
-	let n = J(e, t), r = t, i = G, a = K;
-	for (; n !== G;) {
+	if (e === K) throw Error("invert: expected non-zero number");
+	if (t <= q) throw Error("invert: expected modulus > 1, got " + t);
+	let n = Y(e, t), r = t, i = K, a = q;
+	for (; n !== K;) {
 		let e = r / n, t = r - n * e, o = i - a * e;
 		r = n, n = t, i = a, a = o;
 	}
-	if (r !== K) throw Error("invert: does not exist");
-	return J(i, t);
+	if (r !== q) throw Error("invert: does not exist");
+	return Y(i, t);
 }
 function kt(e, t, n) {
 	let r = e;
 	if (!r.eql(r.sqr(t), n)) throw Error("Cannot find square root");
 }
 function At(e, t) {
-	if ((e & K) === G) throw Error(t + ": expected odd modulus, got " + e);
+	if ((e & q) === K) throw Error(t + ": expected odd modulus, got " + e);
 }
 function jt(e, t) {
-	let n = e, r = (n.ORDER + K) / yt, i = n.pow(t, r);
+	let n = e, r = (n.ORDER + q) / yt, i = n.pow(t, r);
 	return kt(n, i, t), i;
 }
 function Mt(e, t) {
-	let n = e, r = (n.ORDER - bt) / St, i = n.mul(t, q), a = n.pow(i, r), o = n.mul(t, a), s = n.mul(n.mul(o, q), a), c = n.mul(o, n.sub(s, n.ONE));
+	let n = e, r = (n.ORDER - bt) / St, i = n.mul(t, J), a = n.pow(i, r), o = n.mul(t, a), s = n.mul(n.mul(o, J), a), c = n.mul(o, n.sub(s, n.ONE));
 	return kt(n, c, t), c;
 }
 function Nt(e) {
@@ -669,12 +673,12 @@ function Nt(e) {
 function Pt(e) {
 	if (e < vt) throw Error("sqrt is not defined for small field");
 	At(e, "tonelliShanks");
-	let t = e - K, n = 0;
-	for (; t % q === G;) t /= q, n++;
-	let r = q, i = Ut(e);
+	let t = e - q, n = 0;
+	for (; t % J === K;) t /= J, n++;
+	let r = J, i = Ut(e);
 	for (; zt(i, r) === 1;) if (r++ > 1e3) throw Error("Cannot find square root: probably non-prime P");
 	if (n === 1) return jt;
-	let a = i.pow(r, t), o = (t + K) / q;
+	let a = i.pow(r, t), o = (t + q) / J;
 	return function(e, r) {
 		let i = e;
 		if (i.is0(r)) return r;
@@ -684,7 +688,7 @@ function Pt(e) {
 			if (i.is0(l)) throw Error("Cannot find square root: probably non-prime P");
 			let e = 1, t = i.sqr(l);
 			for (; !i.eql(t, i.ONE);) if (e++, t = i.sqr(t), e === s) throw Error("Cannot find square root");
-			let n = K << BigInt(s - e - 1), r = i.pow(c, n);
+			let n = q << BigInt(s - e - 1), r = i.pow(c, n);
 			s = e, c = i.sqr(r), l = i.mul(l, c), u = i.mul(u, r);
 		}
 		return u;
@@ -693,7 +697,7 @@ function Pt(e) {
 function Ft(e) {
 	return At(e, "Fp.sqrt"), e % yt === vt ? jt : e % St === bt ? Mt : e % Tt === Ct ? Nt(e) : Pt(e);
 }
-var It = (e, t) => (J(e, t) & K) === K, Lt = [
+var It = (e, t) => (Y(e, t) & q) === q, Lt = [
 	"create",
 	"isValid",
 	"is0",
@@ -712,29 +716,29 @@ var It = (e, t) => (J(e, t) & K) === K, Lt = [
 	"mulN",
 	"sqrN"
 ];
-function X(e) {
-	if (z(e, "field"), typeof e.ORDER != "bigint") throw TypeError("param \"ORDER\" is invalid: expected bigint, got " + typeof e.ORDER);
-	H(e.BYTES, "BYTES"), H(e.BITS, "BITS");
-	for (let t of Lt) B(e[t], "field." + t);
+function Z(e) {
+	if (B(e, "field"), typeof e.ORDER != "bigint") throw TypeError("param \"ORDER\" is invalid: expected bigint, got " + typeof e.ORDER);
+	st(e.BYTES, "BYTES"), st(e.BITS, "BITS");
+	for (let t of Lt) V(e[t], "field." + t);
 	if (e.BYTES < 1 || e.BITS < 1) throw Error("invalid field: expected BYTES/BITS > 0");
-	if (e.ORDER <= K) throw Error("invalid field: expected ORDER > 1, got " + e.ORDER);
+	if (e.ORDER <= q) throw Error("invalid field: expected ORDER > 1, got " + e.ORDER);
 	return e;
 }
 function Rt(e, t, n = !1) {
-	X(e), Ze(t, "nums"), V(n, "passZero");
+	Z(e), Ze(t, "nums"), U(n, "passZero");
 	let r = e, i = Array(t.length).fill(n ? r.ZERO : void 0), a = t.reduce((e, t, n) => r.is0(t) ? e : (i[n] = e, r.mul(e, t)), r.ONE), o = r.inv(a);
 	return t.reduceRight((e, t, n) => r.is0(t) ? e : (i[n] = r.mul(e, i[n]), r.mul(e, t)), o), i;
 }
 function zt(e, t) {
-	X(e);
+	Z(e);
 	let n = e;
 	At(n.ORDER, "FpLegendre");
-	let r = (n.ORDER - K) / q, i = n.pow(t, r), a = n.eql(i, n.ONE), o = n.eql(i, n.ZERO), s = n.eql(i, n.neg(n.ONE));
+	let r = (n.ORDER - q) / J, i = n.pow(t, r), a = n.eql(i, n.ONE), o = n.eql(i, n.ZERO), s = n.eql(i, n.neg(n.ONE));
 	if (!a && !o && !s) throw Error("invalid Legendre symbol result");
 	return a ? 1 : o ? 0 : -1;
 }
 function Bt(e, t) {
-	if (t !== void 0 && Qe(t), e <= G) throw Error("invalid n length: expected positive n, got " + e);
+	if (t !== void 0 && Qe(t), e <= K) throw Error("invalid n length: expected positive n, got " + e);
 	if (t !== void 0 && t < 1) throw Error("invalid n length: expected positive bit length, got " + t);
 	let n = gt(e);
 	if (t !== void 0 && t < n) throw Error(`invalid n length: expected nBitLength (${t}) >= bitLen(n) (${n})`);
@@ -749,12 +753,12 @@ var Vt = /* @__PURE__ */ new WeakMap(), Ht = class {
 	BITS;
 	BYTES;
 	isLE;
-	ZERO = G;
-	ONE = K;
+	ZERO = K;
+	ONE = q;
 	_lengths;
 	_mod;
 	constructor(e, t = {}) {
-		if (e <= K) throw Error("invalid field: expected ORDER > 1, got " + e);
+		if (e <= q) throw Error("invalid field: expected ORDER > 1, got " + e);
 		let n;
 		this.isLE = !1, typeof t == "object" && t && (typeof t.BITS == "number" && (n = t.BITS), typeof t.sqrt == "function" && Object.defineProperty(this, "sqrt", {
 			value: t.sqrt,
@@ -765,44 +769,44 @@ var Vt = /* @__PURE__ */ new WeakMap(), Ht = class {
 		this.ORDER = e, this.BITS = r, this.BYTES = i, Object.freeze(this);
 	}
 	create(e) {
-		return J(e, this.ORDER);
+		return Y(e, this.ORDER);
 	}
 	isValid(e) {
 		if (typeof e != "bigint") throw TypeError("invalid field element: expected bigint, got " + typeof e);
-		return G <= e && e < this.ORDER;
+		return K <= e && e < this.ORDER;
 	}
 	is0(e) {
-		return e === G;
+		return e === K;
 	}
 	isValidNot0(e) {
 		return !this.is0(e) && this.isValid(e);
 	}
 	isOdd(e) {
-		return (e & K) === K;
+		return (e & q) === q;
 	}
 	neg(e) {
-		return J(-e, this.ORDER);
+		return Y(-e, this.ORDER);
 	}
 	eql(e, t) {
 		return e === t;
 	}
 	sqr(e) {
-		return J(e * e, this.ORDER);
+		return Y(e * e, this.ORDER);
 	}
 	add(e, t) {
-		return J(e + t, this.ORDER);
+		return Y(e + t, this.ORDER);
 	}
 	sub(e, t) {
-		return J(e - t, this.ORDER);
+		return Y(e - t, this.ORDER);
 	}
 	mul(e, t) {
-		return J(e * t, this.ORDER);
+		return Y(e * t, this.ORDER);
 	}
 	pow(e, t) {
 		return Dt(e, t, this.ORDER);
 	}
 	div(e, t) {
-		return J(e * Ot(t, this.ORDER), this.ORDER);
+		return Y(e * Ot(t, this.ORDER), this.ORDER);
 	}
 	sqrN(e) {
 		return e * e;
@@ -827,7 +831,7 @@ var Vt = /* @__PURE__ */ new WeakMap(), Ht = class {
 		return this.isLE ? ft(e, this.BYTES) : dt(e, this.BYTES);
 	}
 	fromBytes(e, t = !1) {
-		R(e);
+		z(e);
 		let { _lengths: n, BYTES: r, isLE: i, ORDER: a, _mod: o } = this;
 		if (n) {
 			if (e.length < 1 || !n.includes(e.length) || e.length > r) throw Error("Field.fromBytes: expected " + n + " bytes, got " + e.length);
@@ -836,14 +840,14 @@ var Vt = /* @__PURE__ */ new WeakMap(), Ht = class {
 		}
 		if (e.length !== r) throw Error("Field.fromBytes: expected " + r + " bytes, got " + e.length);
 		let s = i ? ut(e) : lt(e);
-		if (o && (s = J(s, a)), !t && !this.isValid(s)) throw Error("invalid field element: outside of range 0..ORDER");
+		if (o && (s = Y(s, a)), !t && !this.isValid(s)) throw Error("invalid field element: outside of range 0..ORDER");
 		return s;
 	}
 	invertBatch(e) {
 		return Rt(this, e, !0);
 	}
 	cmov(e, t, n) {
-		return V(n, "condition"), n ? t : e;
+		return U(n, "condition"), n ? t : e;
 	}
 };
 function Ut(e, t = {}) {
@@ -851,11 +855,11 @@ function Ut(e, t = {}) {
 }
 //#endregion
 //#region node_modules/.pnpm/@noble+curves@2.4.0/node_modules/@noble/curves/abstract/curve.js
-var Wt = /* @__PURE__ */ BigInt(0), Z = /* @__PURE__ */ BigInt(1), Gt = /* @__PURE__ */ BigInt(4), Kt = 16, qt = 128, Jt = 5, Yt = 2 ** 31;
+var Wt = /* @__PURE__ */ BigInt(0), Q = /* @__PURE__ */ BigInt(1), Gt = /* @__PURE__ */ BigInt(4), Kt = 16, qt = 128, Jt = 5, Yt = 2 ** 31;
 function Xt(e) {
 	let t = e;
 	if (typeof t != "function") throw TypeError("\"Point\" expected constructor, got type=" + typeof e);
-	B(t.fromAffine, "Point.fromAffine"), B(t.fromBytes, "Point.fromBytes"), B(t.fromHex, "Point.fromHex"), z(t.BASE, "Point.BASE"), z(t.ZERO, "Point.ZERO"), X(t.Fp), X(t.Fn);
+	V(t.fromAffine, "Point.fromAffine"), V(t.fromBytes, "Point.fromBytes"), V(t.fromHex, "Point.fromHex"), B(t.BASE, "Point.BASE"), B(t.ZERO, "Point.ZERO"), Z(t.Fp), Z(t.Fn);
 }
 function Zt(e, t) {
 	Xt(e), tn(t, e);
@@ -871,7 +875,7 @@ function $t(e, t) {
 }
 function en(e, t) {
 	if (e !== void 0) {
-		B(e, "randomBytes");
+		V(e, "randomBytes");
 		try {
 			let n = e(t);
 			if (!nt(n) || n.length !== t) return;
@@ -889,7 +893,7 @@ function tn(e, t) {
 function nn(e, t, n) {
 	if (!Array.isArray(e)) throw Error("array of scalars expected");
 	e.forEach((e, r) => {
-		if (!(n === void 0 ? t.isValid(e) : U(e) && e < n)) throw Error("invalid scalar at index " + r);
+		if (!(n === void 0 ? t.isValid(e) : W(e) && e < n)) throw Error("invalid scalar at index " + r);
 	});
 }
 var rn = /* @__PURE__ */ new WeakMap();
@@ -905,7 +909,7 @@ function sn(e, t) {
 	let n = 2 ** t, r = n / 2, i = BigInt(n - 1), a = [];
 	for (; e > Wt;) {
 		let t = 0;
-		e & Z && (t = Number(e & i), t >= r && (t -= n), e -= BigInt(t)), a.push(t), e >>= Z;
+		e & Q && (t = Number(e & i), t >= r && (t -= n), e -= BigInt(t)), a.push(t), e >>= Q;
 	}
 	return a;
 }
@@ -913,7 +917,7 @@ function cn(e, t, n) {
 	let r = 2 ** t, i = r / 2, a = BigInt(r - 1), o = BigInt(t), s = [];
 	for (let t = 0; t < n; t++) {
 		let t = Number(e & a);
-		e >>= o, t > i && (t -= r, e += Z), s.push(t);
+		e >>= o, t > i && (t -= r, e += Q), s.push(t);
 	}
 	if (e !== Wt) throw Error("invalid wnaf");
 	return s;
@@ -983,7 +987,7 @@ var un = class {
 		if (!(e instanceof this.Point)) throw TypeError("\"point\" expected Point instance, got type=" + typeof e);
 	}
 	validateMulInput(e, t) {
-		if (this.assertPoint(e), !mt(t, Z, this.Point.Fn.ORDER)) throw Error("invalid scalar");
+		if (this.assertPoint(e), !mt(t, Q, this.Point.Fn.ORDER)) throw Error("invalid scalar");
 	}
 	runCT(e, t, n, r) {
 		let i = an(e);
@@ -1017,13 +1021,13 @@ var un = class {
 		};
 	}
 	shouldBlind(e, t) {
-		return this.randomBytes === void 0 ? !1 : t === Z || e === this.BASE && (this.baseCanBeBlinded === void 0 && (this.baseCanBeBlinded = this.mulUnsafe(this.BASE, this.Point.Fn.ORDER).is0()), this.baseCanBeBlinded);
+		return this.randomBytes === void 0 ? !1 : t === Q || e === this.BASE && (this.baseCanBeBlinded === void 0 && (this.baseCanBeBlinded = this.mulUnsafe(this.BASE, this.Point.Fn.ORDER).is0()), this.baseCanBeBlinded);
 	}
 	mulSecret(e, t, n, r) {
 		return this.shouldBlind(e, n) ? this.mulCTBlinded(e, t, r) : this.mulCT(e, t, r);
 	}
 	mulUnsafe(e, t, n) {
-		if (this.assertPoint(e), !U(t)) throw Error("invalid scalar");
+		if (this.assertPoint(e), !W(t)) throw Error("invalid scalar");
 		let r = an(e);
 		if (r === 1 || t >= this.Point.Fn.ORDER) return dn(this.Point, [e], [t], !0);
 		let i = this.getWnafPrecomputes(r, e, this.bits, n);
@@ -1037,28 +1041,28 @@ var un = class {
 	}
 };
 function dn(e, t, n, r = !1) {
-	if (Xt(e), tn(t, e), V(r, "allowOversized"), nn(n, e.Fn, r ? e.Fn.ORDER ** Gt : void 0), t.length !== n.length) throw Error("arrays of points and scalars must have equal length");
+	if (Xt(e), tn(t, e), U(r, "allowOversized"), nn(n, e.Fn, r ? e.Fn.ORDER ** Gt : void 0), t.length !== n.length) throw Error("arrays of points and scalars must have equal length");
 	let i = t.map((e) => on(e, 4)), a = n.map((e) => sn(e, 4));
 	return ln(e.ZERO, i, a);
 }
 function fn(e, t, n) {
 	if (t) {
 		if (t.ORDER !== e) throw Error("Field.ORDER must match order: Fp == p, Fn == n");
-		return X(t), t;
+		return Z(t), t;
 	}
 	return Ut(e, { isLE: n });
 }
 function pn(e, t, n = {}, r) {
 	if (e !== "weierstrass" && e !== "edwards") throw Error("expected curve type \"weierstrass\" or \"edwards\"");
 	if (r === void 0 && (r = e === "edwards"), !t || typeof t != "object") throw Error(`expected valid ${e} CURVE object`);
-	W(n);
+	G(n);
 	for (let e of [
 		"p",
 		"n",
 		"h"
 	]) {
 		let n = t[e];
-		if (!(U(n) && n !== Wt)) throw Error(`CURVE.${e} must be positive bigint`);
+		if (!(W(n) && n !== Wt)) throw Error(`CURVE.${e} must be positive bigint`);
 	}
 	let i = fn(t.p, n.Fp, r), a = fn(t.n, n.Fn, r), o = [
 		"Gx",
@@ -1090,11 +1094,11 @@ function bn(e, t, n, r) {
 	return e.eql(o, s);
 }
 function xn(e, t = {}) {
-	W(t, {}, {}, "extraOpts");
+	G(t, {}, {}, "extraOpts");
 	let n = t, r = pn("edwards", e, n, n.FpFnLE), { Fp: i, Fn: a } = r, o = r.CURVE, { h: s } = o;
 	if (zt(i, o.a) !== 1) throw Error("edwards: CURVE.a must be a square in Fp for complete addition formulas");
 	if (zt(i, o.d) !== -1) throw Error("edwards: CURVE.d must be a non-square in Fp for complete addition formulas");
-	W(n, {}, {
+	G(n, {}, {
 		uvRatio: "function",
 		randomBytes: "function"
 	});
@@ -1147,7 +1151,7 @@ function xn(e, t = {}) {
 		}
 		static fromBytes(e, t = !1) {
 			let n = i.BYTES, { a: r, d: a } = o;
-			e = pt(R(e, n, "point")), V(t, "zip215");
+			e = pt(z(e, n, "point")), U(t, "zip215");
 			let s = pt(e), c = e[n - 1];
 			s[n - 1] = c & -129;
 			let f = ut(s);
@@ -1255,7 +1259,7 @@ function xn(e, t = {}) {
 function Sn(e, t, n = {}) {
 	if (Xt(e), typeof t != "function") throw Error("\"hash\" function param is required");
 	let r = t, i = n;
-	W(i, {}, {
+	G(i, {}, {
 		adjustScalarBytes: "function",
 		randomBytes: "function",
 		domain: "function",
@@ -1266,9 +1270,9 @@ function Sn(e, t, n = {}) {
 		toMontgomerySecret: "function"
 	});
 	let { prehash: a } = i, { BASE: o, Fp: s, Fn: c } = e, l = r.outputLen, u = 2 * s.BYTES;
-	if (l !== void 0 && (H(l, "hash.outputLen"), l !== u)) throw Error(`hash.outputLen must be ${u}, got ${l}`);
+	if (l !== void 0 && (st(l, "hash.outputLen"), l !== u)) throw Error(`hash.outputLen must be ${u}, got ${l}`);
 	let d = i.randomBytes === void 0 ? rt : i.randomBytes, f = i.toMontgomery, p = i.toMontgomerySecret, m = i.adjustScalarBytes === void 0 ? (e) => e : i.adjustScalarBytes, h = i.domain === void 0 ? (e, t, n) => {
-		if (V(n, "phflag"), t.length || n) throw Error("Contexts/pre-hash are not supported");
+		if (U(n, "phflag"), t.length || n) throw Error("Contexts/pre-hash are not supported");
 		return e;
 	} : i.domain;
 	function g(e) {
@@ -1276,8 +1280,8 @@ function Sn(e, t, n = {}) {
 	}
 	function _(e) {
 		let t = T.secretKey;
-		R(e, T.secretKey, "secretKey");
-		let n = R(r(e), 2 * t, "hashedSecretKey"), i = m(n.slice(0, t));
+		z(e, T.secretKey, "secretKey");
+		let n = z(r(e), 2 * t, "hashedSecretKey"), i = m(n.slice(0, t));
 		return {
 			head: i,
 			prefix: n.slice(t, 2 * t),
@@ -1299,19 +1303,19 @@ function Sn(e, t, n = {}) {
 	}
 	function b(e = Uint8Array.of(), ...t) {
 		let n = et(...t);
-		return g(r(h(n, R(e, void 0, "context"), !!a)));
+		return g(r(h(n, z(e, void 0, "context"), !!a)));
 	}
 	function x(e, t, n = {}) {
-		W(n, {}, {}, "options"), e = pt(R(e, void 0, "message")), a && (e = a(e));
+		G(n, {}, {}, "options"), e = pt(z(e, void 0, "message")), a && (e = a(e));
 		let { prefix: r, scalar: i, pointBytes: s } = v(t), l = b(n.context, r, e), u = o.multiply(l).toBytes(), d = b(n.context, u, s, e), f = c.create(l + d * i);
 		if (!c.isValid(f)) throw Error("sign failed: invalid s");
-		return R(et(u, c.toBytes(f)), T.signature, "result");
+		return z(et(u, c.toBytes(f)), T.signature, "result");
 	}
 	let S = { zip215: i.zip215 };
 	function C(t, n, r, i = S) {
-		W(i);
+		G(i);
 		let { context: s } = i, c = i.zip215 === void 0 ? !!S.zip215 : i.zip215, l = T.signature;
-		t = R(t, l, "signature"), n = R(n, void 0, "message"), r = R(r, T.publicKey, "publicKey"), c !== void 0 && V(c, "zip215"), a && (n = a(n));
+		t = z(t, l, "signature"), n = z(n, void 0, "message"), r = z(r, T.publicKey, "publicKey"), c !== void 0 && U(c, "zip215"), a && (n = a(n));
 		let u = l / 2, d = t.subarray(0, u), f = ut(t.subarray(u, l)), p, m, h;
 		try {
 			p = e.fromBytes(r, c), m = e.fromBytes(d, c), h = o.multiplyUnsafe(f);
@@ -1329,7 +1333,7 @@ function Sn(e, t, n = {}) {
 		seed: w
 	};
 	function E(e) {
-		return e = e === void 0 ? d(T.seed) : e, R(e, T.seed, "seed");
+		return e = e === void 0 ? d(T.seed) : e, z(e, T.seed, "seed");
 	}
 	function ee(e) {
 		return nt(e) && e.length === T.secretKey;
@@ -1377,9 +1381,9 @@ var Cn = /* @__PURE__ */ BigInt(1), wn = /* @__PURE__ */ BigInt(2), Tn = /* @__P
 	Gy: BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")
 };
 function kn(e) {
-	let t = BigInt(10), n = BigInt(20), r = BigInt(40), i = BigInt(80), a = Dn, o = e * e % a * e % a, s = Y(Y(o, wn, a) * o % a, Cn, a) * e % a, c = Y(s, Tn, a) * s % a, l = Y(c, t, a) * c % a, u = Y(l, n, a) * l % a, d = Y(u, r, a) * u % a;
+	let t = BigInt(10), n = BigInt(20), r = BigInt(40), i = BigInt(80), a = Dn, o = e * e % a * e % a, s = X(X(o, wn, a) * o % a, Cn, a) * e % a, c = X(s, Tn, a) * s % a, l = X(c, t, a) * c % a, u = X(l, n, a) * l % a, d = X(u, r, a) * u % a;
 	return {
-		pow_p_5_8: Y(Y(Y(Y(d, i, a) * d % a, i, a) * d % a, t, a) * c % a, wn, a) * e % a,
+		pow_p_5_8: X(X(X(X(d, i, a) * d % a, i, a) * d % a, t, a) * c % a, wn, a) * e % a,
 		b2: o
 	};
 }
@@ -1388,8 +1392,8 @@ function An(e) {
 }
 var jn = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
 function Mn(e, t) {
-	let n = Dn, r = J(t * t * t, n), i = kn(e * J(r * r * t, n)).pow_p_5_8, a = J(e * r * i, n), o = J(t * a * a, n), s = a, c = J(a * jn, n), l = o === e, u = o === J(-e, n), d = o === J(-e * jn, n);
-	return l && (a = s), (u || d) && (a = c), It(a, n) && (a = J(-a, n)), {
+	let n = Dn, r = Y(t * t * t, n), i = kn(e * Y(r * r * t, n)).pow_p_5_8, a = Y(e * r * i, n), o = Y(t * a * a, n), s = a, c = Y(a * jn, n), l = o === e, u = o === Y(-e, n), d = o === Y(-e * jn, n);
+	return l && (a = s), (u || d) && (a = c), It(a, n) && (a = Y(-a, n)), {
 		isValid: l || u,
 		value: a
 	};
@@ -1401,7 +1405,7 @@ function Fn(e) {
 }
 function In(e) {
 	let t = Nn.Fp.BYTES;
-	return F(e, t), An(Xe(e.subarray(0, t))).subarray(0, t);
+	return I(e, t), An(Xe(e.subarray(0, t))).subarray(0, t);
 }
 function Ln(e) {
 	return Sn(Nn, Xe, Object.assign({
@@ -1411,21 +1415,21 @@ function Ln(e) {
 		zip215: !0
 	}, e));
 }
-var Q = /* @__PURE__ */ Ln({}), $ = 32, Rn = 248, zn = 127, Bn = 64, Vn = 128, Hn = 127;
-function Un(e) {
-	e.length < $ || (e[0] = (e[0] ?? 0) & Rn, e[31] = (e[31] ?? 0) & zn | Bn);
+var $ = /* @__PURE__ */ Ln({}), Rn = 32, zn = 248, Bn = 127, Vn = 64, Hn = 128, Un = 127;
+function Wn(e) {
+	e.length < Rn || (e[0] = (e[0] ?? 0) & zn, e[31] = (e[31] ?? 0) & Bn | Vn);
 }
-function Wn() {
-	let e = new Uint8Array(s($));
-	Un(e);
-	let t = Yn(e) % Q.Point.CURVE().n;
-	return [Q.Point.BASE.multiply(t).toBytes(), Uint8Array.from(e)];
+function Gn() {
+	let e = new Uint8Array(s(Rn));
+	Wn(e);
+	let t = Xn(e) % $.Point.CURVE().n;
+	return [$.Point.BASE.multiply(t).toBytes(), Uint8Array.from(e)];
 }
-function Gn(e, t) {
+function Kn(e, t) {
 	let n = i("SHA256");
 	return n.update(t), n.sign(e);
 }
-function Kn(e, t, n) {
+function qn(e, t, n) {
 	try {
 		let r = a("SHA256");
 		return r.update(t), r.verify(e, Buffer.from(n));
@@ -1433,25 +1437,25 @@ function Kn(e, t, n) {
 		return !1;
 	}
 }
-function qn(e, n) {
-	if (e.length !== $ || n.length !== $) throw Error("invalid key length");
+function Jn(e, n) {
+	if (e.length !== Rn || n.length !== Rn) throw Error("invalid key length");
 	let r = Uint8Array.from(n);
-	r[31] = (r[31] ?? 0) & Hn;
-	let i = Yn(r), a = Jn(Q.Point.fromBytes(e).negate(), i).toBytes();
-	return a[31] = (a[31] ?? 0) ^ Vn, t("sha512").update(a).digest();
-}
-function Jn(e, t) {
-	let n = Q.Point.CURVE().n;
-	if (t < n) return t === 0n ? Q.Point.ZERO : e.multiply(t);
-	let r = t % n, i = t / n, a = r === 0n ? Q.Point.ZERO : e.multiply(r), o = e.multiply(n - 1n).add(e).multiply(i);
+	r[31] = (r[31] ?? 0) & Un;
+	let i = Xn(r), a = Yn($.Point.fromBytes(e).negate(), i).toBytes();
+	return a[31] = (a[31] ?? 0) ^ Hn, t("sha512").update(a).digest();
+}
+function Yn(e, t) {
+	let n = $.Point.CURVE().n;
+	if (t < n) return t === 0n ? $.Point.ZERO : e.multiply(t);
+	let r = t % n, i = t / n, a = r === 0n ? $.Point.ZERO : e.multiply(r), o = e.multiply(n - 1n).add(e).multiply(i);
 	return a.add(o);
 }
-function Yn(e) {
+function Xn(e) {
 	let t = 0n;
 	for (let n = e.length - 1; n >= 0; n--) t = t << 8n | BigInt(e[n]);
 	return t;
 }
 //#endregion
-export { l as C, _ as S, g as _, Jn as a, m as b, Q as c, w as d, T as f, u as g, d as h, qn as i, x as l, ee as m, Un as n, Gn as o, S as p, Wn as r, Kn as s, Yn as t, C as u, f as v, c as w, h as x, p as y };
+export { _ as C, h as S, c as T, u as _, Yn as a, p as b, $ as c, T as d, E as f, d as g, w as h, Jn as i, x as l, D as m, Wn as n, Kn as o, S as p, Gn as r, qn as s, Xn as t, C as u, g as v, l as w, m as x, f as y };
 
-//# sourceMappingURL=primitives-xIr6Tjk4.js.map
+//# sourceMappingURL=primitives-CdX74Rgu.js.map