@honeybbq/teamspeak-client 0.2.1 → 0.2.3

package/dist/primitives-Bt-L4BZa.js

@@ -0,0 +1,1483 @@
+import { createECDH as e, createHash as t, createPrivateKey as n, createPublicKey as r, createSign as i, createVerify as a, generateKeyPairSync as o, randomBytes as s } from "node:crypto";
+//#region src/errors.ts
+var c = class extends Error {
+	constructor(e, t) {
+		super(e, t), this.name = "TeamspeakError";
+	}
+}, l = class extends c {
+	id;
+	serverMessage;
+	constructor(e, t) {
+		super(`TeamSpeak server error: ${t} (id=${e})`), this.name = "ServerError", this.id = e, this.serverMessage = t;
+	}
+}, u = class extends c {
+	command;
+	constructor(e) {
+		super(`command timeout: ${e}`), this.name = "CommandTimeoutError", this.command = e;
+	}
+}, d = class extends c {
+	constructor() {
+		super("already connecting or connected"), this.name = "AlreadyConnectedError";
+	}
+}, f = class extends c {
+	constructor() {
+		super("EAX tag mismatch"), this.name = "EAXTagMismatchError";
+	}
+}, p = class extends c {
+	constructor() {
+		super("fake signature mismatch"), this.name = "FakeSignatureMismatchError";
+	}
+}, m = class extends c {
+	constructor(e, t) {
+		super(e, t), this.name = "FileTransferError";
+	}
+}, h = class extends c {
+	constructor() {
+		super("timeout waiting for file transfer notification"), this.name = "FileTransferTimeoutError";
+	}
+}, g = class extends c {
+	constructor(e, t) {
+		super(e, t), this.name = "CryptoInitError";
+	}
+}, _ = class extends c {
+	constructor(e = "invalid identity format") {
+		super(e), this.name = "InvalidIdentityError";
+	}
+}, v = 32, y = 65, b = 4, x = class {
+	privateKey;
+	offset;
+	constructor(e, t) {
+		this.privateKey = e, this.offset = t;
+	}
+	publicKeyBase64() {
+		let e = r(this.privateKey).export({ format: "jwk" });
+		return e.x === void 0 || e.y === void 0 || typeof e.x != "string" || typeof e.y != "string" ? "" : te(ue(e.x, v), ue(e.y, v));
+	}
+	toString() {
+		let e = this.privateKey.export({ format: "jwk" });
+		if (!e.d) return `:${this.offset}`;
+		let t = ue(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)), de(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)), de(i.digest()) >= e) return;
+			this.offset++, this.offset % 10000n == 0n && await new Promise((e) => setImmediate(e));
+		}
+	}
+};
+function S(t) {
+	let r = t.lastIndexOf(":");
+	if (r < 0) throw new _();
+	let i = t.slice(0, r), a = t.slice(r + 1), o = Buffer.from(i, "base64"), s = BigInt(a);
+	if (o.length > v) throw new _("private key scalar too large");
+	let c = Buffer.alloc(v);
+	o.copy(c, v - o.length);
+	let l = e("prime256v1");
+	l.setPrivateKey(c);
+	let u = l.getPublicKey(null, "uncompressed"), d = Buffer.from(u.slice(1, 33)).toString("base64url"), f = Buffer.from(u.slice(33, 65)).toString("base64url");
+	return new x(n({
+		key: {
+			kty: "EC",
+			crv: "P-256",
+			d: c.toString("base64url"),
+			x: d,
+			y: f
+		},
+		format: "jwk"
+	}), s);
+}
+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)), de(n.digest()) >= e) return r;
+		r.offset++;
+	}
+}
+function w(e) {
+	let n = t("sha1").update(e).digest();
+	return Buffer.from(n).toString("base64");
+}
+function ee(e) {
+	return t("sha512").update(e).digest();
+}
+function te(e, t) {
+	let n = T(3, Buffer.from([7, 0])), r = T(2, ce(32)), i = T(2, ce(e)), a = T(2, ce(t));
+	return T(48, Buffer.concat([
+		n,
+		r,
+		i,
+		a
+	])).toString("base64");
+}
+function ne(e) {
+	let t = re(e);
+	return r({
+		key: {
+			kty: "EC",
+			crv: "P-256",
+			x: Buffer.from(t.slice(1, 33)).toString("base64url"),
+			y: Buffer.from(t.slice(33, 65)).toString("base64url")
+		},
+		format: "jwk"
+	});
+}
+function re(e) {
+	try {
+		return ie(e);
+	} catch {}
+	return ae(e);
+}
+function ie(e) {
+	let t = E(e, 48).value, n = 0, r = E(t, 3, n);
+	n += r.consumed;
+	let i = E(t, 2, n);
+	n += i.consumed;
+	let a = E(t, 2, n);
+	n += a.consumed;
+	let o = E(t, 2, n);
+	return oe(le(a.value, v), le(o.value, v));
+}
+function ae(e) {
+	let t = E(e, 48).value, n = 0, r = E(t, 2, n);
+	n += r.consumed;
+	let i = E(t, 2, n);
+	return oe(le(r.value, v), le(i.value, v));
+}
+function oe(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 T(e, t) {
+	let n = se(t.length);
+	return Buffer.concat([
+		Buffer.from([e]),
+		n,
+		t
+	]);
+}
+function se(e) {
+	return e < 128 ? Buffer.from([e]) : e < 256 ? Buffer.from([129, e]) : Buffer.from([
+		130,
+		e >> 8 & 255,
+		e & 255
+	]);
+}
+function ce(e) {
+	if (typeof e == "number") {
+		let t = [], n = e;
+		do
+			t.unshift(n & 255), n >>= 8;
+		while (n > 0);
+		return t[0] & 128 && t.unshift(0), Buffer.from(t);
+	}
+	let t = 0;
+	for (; t < e.length - 1 && e[t] === 0;) t++;
+	let n = e.slice(t);
+	return n[0] & 128 ? Buffer.concat([Buffer.from([0]), n]) : Buffer.from(n);
+}
+function E(e, t, n = 0) {
+	if (e[n] !== t) throw Error(`expected DER tag 0x${t.toString(16)}, got 0x${(e[n] ?? 0).toString(16)}`);
+	let r = n + 1, i, a = e[r++];
+	if (a < 128) i = a;
+	else if (a === 129) i = e[r++];
+	else if (a === 130) i = (e[r] << 8 | e[r + 1]) >>> 0, r += 2;
+	else throw Error("unsupported DER length encoding");
+	return {
+		value: e.slice(r, r + i),
+		consumed: r - n + i
+	};
+}
+function le(e, t) {
+	let n = 0;
+	for (; n < e.length - 1 && e[n] === 0;) n++;
+	let r = e.slice(n);
+	if (r.length > t) throw Error("integer too large");
+	if (r.length === t) return r;
+	let i = new Uint8Array(t);
+	return i.set(r, t - r.length), i;
+}
+function ue(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 de(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++;
+	else return t;
+	return t;
+}
+//#endregion
+//#region node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/utils.js
+function fe(e) {
+	return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in e && e.BYTES_PER_ELEMENT === 1;
+}
+function pe(e, t = "") {
+	if (typeof e != "number") {
+		let n = t && `"${t}" `;
+		throw TypeError(`${n}expected number, got ${typeof e}`);
+	}
+	if (!Number.isSafeInteger(e) || e < 0) {
+		let n = t && `"${t}" `;
+		throw RangeError(`${n}expected integer >= 0, got ${e}`);
+	}
+}
+function D(e, t, n = "") {
+	let r = fe(e), i = e?.length, a = t !== void 0;
+	if (!r || a && i !== t) {
+		let o = n && `"${n}" `, s = a ? ` of length ${t}` : "", c = r ? `length=${i}` : `type=${typeof e}`, l = o + "expected Uint8Array" + s + ", got " + c;
+		throw r ? RangeError(l) : TypeError(l);
+	}
+	return e;
+}
+function me(e, t = !0) {
+	if (e.destroyed) throw Error("Hash instance has been destroyed");
+	if (t && e.finished) throw Error("Hash#digest() has already been called");
+}
+function he(e, t) {
+	D(e, void 0, "digestInto() output");
+	let n = t.outputLen;
+	if (e.length < n) throw RangeError("\"digestInto() output\" expected to be of length >=" + n);
+}
+function ge(...e) {
+	for (let t = 0; t < e.length; t++) e[t].fill(0);
+}
+function _e(e) {
+	return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+var ve = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", ye = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function be(e) {
+	if (D(e), ve) return e.toHex();
+	let t = "";
+	for (let n = 0; n < e.length; n++) t += ye[e[n]];
+	return t;
+}
+var O = {
+	_0: 48,
+	_9: 57,
+	A: 65,
+	F: 70,
+	a: 97,
+	f: 102
+};
+function xe(e) {
+	if (e >= O._0 && e <= O._9) return e - O._0;
+	if (e >= O.A && e <= O.F) return e - (O.A - 10);
+	if (e >= O.a && e <= O.f) return e - (O.a - 10);
+}
+function Se(e) {
+	if (typeof e != "string") throw TypeError("hex string expected, got " + typeof e);
+	if (ve) try {
+		return Uint8Array.fromHex(e);
+	} catch (e) {
+		throw e instanceof SyntaxError ? RangeError(e.message) : e;
+	}
+	let t = e.length, n = t / 2;
+	if (t % 2) throw RangeError("hex string expected, got unpadded hex of length " + t);
+	let r = new Uint8Array(n);
+	for (let t = 0, i = 0; t < n; t++, i += 2) {
+		let n = xe(e.charCodeAt(i)), a = xe(e.charCodeAt(i + 1));
+		if (n === void 0 || a === void 0) {
+			let t = e[i] + e[i + 1];
+			throw RangeError("hex string expected, got non-hex character \"" + t + "\" at index " + i);
+		}
+		r[t] = n * 16 + a;
+	}
+	return r;
+}
+function Ce(...e) {
+	let t = 0;
+	for (let n = 0; n < e.length; n++) {
+		let r = e[n];
+		D(r), t += r.length;
+	}
+	let n = new Uint8Array(t);
+	for (let t = 0, r = 0; t < e.length; t++) {
+		let i = e[t];
+		n.set(i, r), r += i.length;
+	}
+	return n;
+}
+function we(e, t = {}) {
+	let n = (t, n) => e(n).update(t).digest(), r = e(void 0);
+	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 Te(e = 32) {
+	pe(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}`);
+	return t.getRandomValues(new Uint8Array(e));
+}
+var Ee = (e) => ({ oid: Uint8Array.from([
+	6,
+	9,
+	96,
+	134,
+	72,
+	1,
+	101,
+	3,
+	4,
+	2,
+	e
+]) }), De = class {
+	blockLen;
+	outputLen;
+	canXOF = !1;
+	padOffset;
+	isLE;
+	buffer;
+	view;
+	finished = !1;
+	length = 0;
+	pos = 0;
+	destroyed = !1;
+	constructor(e, t, n, r) {
+		this.blockLen = e, this.outputLen = t, this.padOffset = n, this.isLE = r, this.buffer = new Uint8Array(e), this.view = _e(this.buffer);
+	}
+	update(e) {
+		me(this), D(e);
+		let { view: t, buffer: n, blockLen: r } = this, i = e.length;
+		for (let a = 0; a < i;) {
+			let o = Math.min(r - this.pos, i - a);
+			if (o === r) {
+				let t = _e(e);
+				for (; r <= i - a; a += r) this.process(t, a);
+				continue;
+			}
+			n.set(e.subarray(a, a + o), this.pos), this.pos += o, a += o, this.pos === r && (this.process(t, 0), this.pos = 0);
+		}
+		return this.length += e.length, this.roundClean(), this;
+	}
+	digestInto(e) {
+		me(this), he(e, this), this.finished = !0;
+		let { buffer: t, view: n, blockLen: r, isLE: i } = this, { pos: a } = this;
+		t[a++] = 128, ge(this.buffer.subarray(a)), this.padOffset > r - a && (this.process(n, 0), a = 0);
+		for (let e = a; e < r; e++) t[e] = 0;
+		n.setBigUint64(r - 8, BigInt(this.length * 8), i), this.process(n, 0);
+		let o = _e(e), s = this.outputLen;
+		if (s % 4) throw Error("_sha2: outputLen must be aligned to 32bit");
+		let c = s / 4, l = this.get();
+		if (c > l.length) throw Error("_sha2: outputLen bigger than state");
+		for (let e = 0; e < c; e++) o.setUint32(4 * e, l[e], i);
+	}
+	digest() {
+		let { buffer: e, outputLen: t } = this;
+		this.digestInto(e);
+		let n = e.slice(0, t);
+		return this.destroy(), n;
+	}
+	_cloneInto(e) {
+		e ||= new this.constructor(), e.set(...this.get());
+		let { blockLen: t, buffer: n, length: r, finished: i, destroyed: a, pos: o } = this;
+		return e.destroyed = a, e.finished = i, e.length = r, e.pos = o, r % t && e.buffer.set(n), e;
+	}
+	clone() {
+		return this._cloneInto();
+	}
+}, k = /* @__PURE__ */ Uint32Array.from([
+	1779033703,
+	4089235720,
+	3144134277,
+	2227873595,
+	1013904242,
+	4271175723,
+	2773480762,
+	1595750129,
+	1359893119,
+	2917565137,
+	2600822924,
+	725511199,
+	528734635,
+	4215389547,
+	1541459225,
+	327033209
+]), Oe = /* @__PURE__ */ BigInt(2 ** 32 - 1), ke = /* @__PURE__ */ BigInt(32);
+function Ae(e, t = !1) {
+	return t ? {
+		h: Number(e & Oe),
+		l: Number(e >> ke & Oe)
+	} : {
+		h: Number(e >> ke & Oe) | 0,
+		l: Number(e & Oe) | 0
+	};
+}
+function je(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 } = Ae(e[a], t);
+		[r[a], i[a]] = [n, o];
+	}
+	return [r, i];
+}
+var Me = (e, t, n) => e >>> n, Ne = (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, Pe = (e, t, n) => e << 64 - n | t >>> n - 32, Fe = (e, t, n) => e >>> n - 32 | t << 64 - n;
+function M(e, t, n, r) {
+	let i = (t >>> 0) + (r >>> 0);
+	return {
+		h: e + n + (i / 2 ** 32 | 0) | 0,
+		l: i | 0
+	};
+}
+var Ie = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Le = (e, t, n, r) => t + n + r + (e / 2 ** 32 | 0) | 0, Re = (e, t, n, r) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (r >>> 0), ze = (e, t, n, r, i) => t + n + r + i + (e / 2 ** 32 | 0) | 0, Be = (e, t, n, r, i) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (r >>> 0) + (i >>> 0), Ve = (e, t, n, r, i, a) => t + n + r + i + a + (e / 2 ** 32 | 0) | 0, He = /* @__PURE__ */ je((/* @__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))), Ue = He[0], We = He[1], N = /* @__PURE__ */ new Uint32Array(80), P = /* @__PURE__ */ new Uint32Array(80), Ge = class extends De {
+	constructor(e) {
+		super(128, e, 16, !1);
+	}
+	get() {
+		let { Ah: e, Al: t, Bh: n, Bl: r, Ch: i, Cl: a, Dh: o, Dl: s, Eh: c, El: l, Fh: u, Fl: d, Gh: f, Gl: p, Hh: m, Hl: h } = this;
+		return [
+			e,
+			t,
+			n,
+			r,
+			i,
+			a,
+			o,
+			s,
+			c,
+			l,
+			u,
+			d,
+			f,
+			p,
+			m,
+			h
+		];
+	}
+	set(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h) {
+		this.Ah = e | 0, this.Al = t | 0, this.Bh = n | 0, this.Bl = r | 0, this.Ch = i | 0, this.Cl = a | 0, this.Dh = o | 0, this.Dl = s | 0, this.Eh = c | 0, this.El = l | 0, this.Fh = u | 0, this.Fl = d | 0, this.Gh = f | 0, this.Gl = p | 0, this.Hh = m | 0, this.Hl = h | 0;
+	}
+	process(e, t) {
+		for (let n = 0; n < 16; n++, t += 4) N[n] = e.getUint32(t), P[n] = e.getUint32(t += 4);
+		for (let e = 16; e < 80; e++) {
+			let t = N[e - 15] | 0, n = P[e - 15] | 0, r = A(t, n, 1) ^ A(t, n, 8) ^ Me(t, n, 7), i = j(t, n, 1) ^ j(t, n, 8) ^ Ne(t, n, 7), a = N[e - 2] | 0, o = P[e - 2] | 0, s = A(a, o, 19) ^ Pe(a, o, 61) ^ Me(a, o, 6), c = Re(i, j(a, o, 19) ^ Fe(a, o, 61) ^ Ne(a, o, 6), P[e - 7], P[e - 16]);
+			N[e] = ze(c, r, s, N[e - 7], N[e - 16]) | 0, P[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 = A(u, d, 14) ^ A(u, d, 18) ^ Pe(u, d, 41), v = j(u, d, 14) ^ j(u, d, 18) ^ Fe(u, d, 41), y = u & f ^ ~u & m, b = d & p ^ ~d & h, x = Be(_, v, b, We[e], P[e]), S = Ve(x, g, t, y, Ue[e], N[e]), C = x | 0, w = A(n, r, 28) ^ Pe(n, r, 34) ^ Pe(n, r, 39), ee = j(n, r, 28) ^ Fe(n, r, 34) ^ Fe(n, r, 39), te = n & i ^ n & o ^ i & o, ne = 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} = M(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 re = Ie(C, ee, ne);
+			n = Le(re, S, w, te), r = re | 0;
+		}
+		({h: n, l: r} = M(this.Ah | 0, this.Al | 0, n | 0, r | 0)), {h: i, l: a} = M(this.Bh | 0, this.Bl | 0, i | 0, a | 0), {h: o, l: s} = M(this.Ch | 0, this.Cl | 0, o | 0, s | 0), {h: c, l: l} = M(this.Dh | 0, this.Dl | 0, c | 0, l | 0), {h: u, l: d} = M(this.Eh | 0, this.El | 0, u | 0, d | 0), {h: f, l: p} = M(this.Fh | 0, this.Fl | 0, f | 0, p | 0), {h: m, l: h} = M(this.Gh | 0, this.Gl | 0, m | 0, h | 0), {h: g, l: _} = M(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() {
+		ge(N, P);
+	}
+	destroy() {
+		this.destroyed = !0, ge(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+	}
+}, Ke = class extends Ge {
+	Ah = k[0] | 0;
+	Al = k[1] | 0;
+	Bh = k[2] | 0;
+	Bl = k[3] | 0;
+	Ch = k[4] | 0;
+	Cl = k[5] | 0;
+	Dh = k[6] | 0;
+	Dl = k[7] | 0;
+	Eh = k[8] | 0;
+	El = k[9] | 0;
+	Fh = k[10] | 0;
+	Fl = k[11] | 0;
+	Gh = k[12] | 0;
+	Gl = k[13] | 0;
+	Hh = k[14] | 0;
+	Hl = k[15] | 0;
+	constructor() {
+		super(64);
+	}
+}, qe = /* @__PURE__ */ we(() => new Ke(), /* @__PURE__ */ Ee(3)), F = (e, t, n) => D(e, t, n), Je = pe, Ye = be, I = (...e) => Ce(...e), Xe = (e) => Se(e), Ze = fe, Qe = (e) => Te(e), $e = /* @__PURE__ */ BigInt(0), et = /* @__PURE__ */ BigInt(1);
+function tt(e, t = "") {
+	if (typeof e != "boolean") {
+		let n = t && `"${t}" `;
+		throw TypeError(n + "expected boolean, got type=" + typeof e);
+	}
+	return e;
+}
+function nt(e) {
+	if (typeof e == "bigint") {
+		if (!ut(e)) throw RangeError("positive bigint expected, got " + e);
+	} else Je(e);
+	return e;
+}
+function L(e, t = "") {
+	if (typeof e != "number") {
+		let n = t && `"${t}" `;
+		throw TypeError(n + "expected number, got type=" + typeof e);
+	}
+	if (!Number.isSafeInteger(e)) {
+		let n = t && `"${t}" `;
+		throw RangeError(n + "expected safe integer, got " + e);
+	}
+}
+function rt(e) {
+	if (typeof e != "string") throw TypeError("hex string expected, got " + typeof e);
+	return e === "" ? $e : BigInt("0x" + e);
+}
+function it(e) {
+	return rt(be(e));
+}
+function R(e) {
+	return rt(be(ct(D(e)).reverse()));
+}
+function at(e, t) {
+	if (pe(t), t === 0) throw RangeError("zero length");
+	e = nt(e);
+	let n = e.toString(16);
+	if (n.length > t * 2) throw RangeError("number too large");
+	return Se(n.padStart(t * 2, "0"));
+}
+function ot(e, t) {
+	return at(e, t).reverse();
+}
+function st(e, t) {
+	if (e = F(e), t = F(t), e.length !== t.length) return !1;
+	let n = 0;
+	for (let r = 0; r < e.length; r++) n |= e[r] ^ t[r];
+	return n === 0;
+}
+function ct(e) {
+	return Uint8Array.from(F(e));
+}
+function lt(e) {
+	if (typeof e != "string") throw TypeError("ascii string expected, got " + typeof e);
+	return Uint8Array.from(e, (t, n) => {
+		let r = t.charCodeAt(0);
+		if (t.length !== 1 || r > 127) throw RangeError(`string contains non-ASCII character "${e[n]}" with code ${r} at position ${n}`);
+		return r;
+	});
+}
+var ut = (e) => typeof e == "bigint" && $e <= e;
+function dt(e, t, n) {
+	return ut(e) && ut(t) && ut(n) && t <= e && e < n;
+}
+function ft(e, t, n, r) {
+	if (!dt(t, n, r)) throw RangeError("expected valid " + e + ": " + n + " <= n < " + r + ", got " + t);
+}
+function pt(e) {
+	if (e < $e) throw Error("expected non-negative bigint, got " + e);
+	let t;
+	for (t = 0; e > $e; e >>= et, t += 1);
+	return t;
+}
+var mt = (e) => (et << BigInt(e)) - et;
+function ht(e, t = {}, n = {}) {
+	if (Object.prototype.toString.call(e) !== "[object Object]") throw TypeError("expected valid options object");
+	function r(t, n, r) {
+		if (!r && n !== "function" && !Object.hasOwn(e, t)) throw TypeError(`param "${t}" is invalid: expected own property`);
+		let i = e[t];
+		if (r && i === void 0) return;
+		let a = typeof i;
+		if (a !== n || i === null) throw TypeError(`param "${t}" is invalid: expected ${n}, got ${a}`);
+	}
+	let i = (e, t) => Object.entries(e).forEach(([e, n]) => r(e, n, t));
+	i(t, !1), i(n, !0);
+}
+var gt = () => {
+	throw Error("not implemented");
+}, z = /* @__PURE__ */ BigInt(0), B = /* @__PURE__ */ BigInt(1), V = /* @__PURE__ */ BigInt(2), _t = /* @__PURE__ */ BigInt(3), vt = /* @__PURE__ */ BigInt(4), yt = /* @__PURE__ */ BigInt(5), bt = /* @__PURE__ */ BigInt(7), xt = /* @__PURE__ */ BigInt(8), St = /* @__PURE__ */ BigInt(9), Ct = /* @__PURE__ */ BigInt(16);
+function H(e, t) {
+	if (t <= z) throw Error("mod: expected positive modulus, got " + t);
+	let n = e % t;
+	return n >= z ? n : t + n;
+}
+function U(e, t, n) {
+	if (t < z) throw Error("pow2: expected non-negative exponent, got " + t);
+	let r = e;
+	for (; t-- > z;) r *= r, r %= n;
+	return r;
+}
+function wt(e, t) {
+	if (e === z) throw Error("invert: expected non-zero number");
+	if (t <= z) throw Error("invert: expected positive modulus, got " + t);
+	let n = H(e, t), r = t, i = z, a = B, o = B, s = z;
+	for (; n !== z;) {
+		let e = r / n, t = r - n * e, c = i - o * e, l = a - s * e;
+		r = n, n = t, i = o, a = s, o = c, s = l;
+	}
+	if (r !== B) throw Error("invert: does not exist");
+	return H(i, t);
+}
+function Tt(e, t, n) {
+	let r = e;
+	if (!r.eql(r.sqr(t), n)) throw Error("Cannot find square root");
+}
+function Et(e, t) {
+	let n = e, r = (n.ORDER + B) / vt, i = n.pow(t, r);
+	return Tt(n, i, t), i;
+}
+function Dt(e, t) {
+	let n = e, r = (n.ORDER - yt) / xt, i = n.mul(t, V), a = n.pow(i, r), o = n.mul(t, a), s = n.mul(n.mul(o, V), a), c = n.mul(o, n.sub(s, n.ONE));
+	return Tt(n, c, t), c;
+}
+function Ot(e) {
+	let t = zt(e), n = kt(e), r = n(t, t.neg(t.ONE)), i = n(t, r), a = n(t, t.neg(r)), o = (e + bt) / Ct;
+	return ((e, t) => {
+		let n = e, s = n.pow(t, o), c = n.mul(s, r), l = n.mul(s, i), u = n.mul(s, a), d = n.eql(n.sqr(c), t), f = n.eql(n.sqr(l), t);
+		s = n.cmov(s, c, d), c = n.cmov(u, l, f);
+		let p = n.eql(n.sqr(c), t), m = n.cmov(s, c, p);
+		return Tt(n, m, t), m;
+	});
+}
+function kt(e) {
+	if (e < _t) throw Error("sqrt is not defined for small field");
+	let t = e - B, n = 0;
+	for (; t % V === z;) t /= V, n++;
+	let r = V, i = zt(e);
+	for (; Ft(i, r) === 1;) if (r++ > 1e3) throw Error("Cannot find square root: probably non-prime P");
+	if (n === 1) return Et;
+	let a = i.pow(r, t), o = (t + B) / V;
+	return function(e, r) {
+		let i = e;
+		if (i.is0(r)) return r;
+		if (Ft(i, r) !== 1) throw Error("Cannot find square root");
+		let s = n, c = i.mul(i.ONE, a), l = i.pow(r, t), u = i.pow(r, o);
+		for (; !i.eql(l, i.ONE);) {
+			if (i.is0(l)) return i.ZERO;
+			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 = B << 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;
+	};
+}
+function At(e) {
+	return e % vt === _t ? Et : e % xt === yt ? Dt : e % Ct === St ? Ot(e) : kt(e);
+}
+var W = (e, t) => (H(e, t) & B) === B, jt = [
+	"create",
+	"isValid",
+	"is0",
+	"neg",
+	"inv",
+	"sqrt",
+	"sqr",
+	"eql",
+	"add",
+	"sub",
+	"mul",
+	"pow",
+	"div",
+	"addN",
+	"subN",
+	"mulN",
+	"sqrN"
+];
+function Mt(e) {
+	if (ht(e, jt.reduce((e, t) => (e[t] = "function", e), {
+		ORDER: "bigint",
+		BYTES: "number",
+		BITS: "number"
+	})), L(e.BYTES, "BYTES"), L(e.BITS, "BITS"), e.BYTES < 1 || e.BITS < 1) throw Error("invalid field: expected BYTES/BITS > 0");
+	if (e.ORDER <= B) throw Error("invalid field: expected ORDER > 1, got " + e.ORDER);
+	return e;
+}
+function Nt(e, t, n) {
+	let r = e;
+	if (n < z) throw Error("invalid exponent, negatives unsupported");
+	if (n === z) return r.ONE;
+	if (n === B) return t;
+	let i = r.ONE, a = t;
+	for (; n > z;) n & B && (i = r.mul(i, a)), a = r.sqr(a), n >>= B;
+	return i;
+}
+function Pt(e, t, n = !1) {
+	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 Ft(e, t) {
+	let n = e, r = (n.ORDER - B) / V, 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 It(e, t) {
+	if (t !== void 0 && Je(t), e <= z) 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 = pt(e);
+	if (t !== void 0 && t < n) throw Error(`invalid n length: expected bit length (${n}) >= n.length (${t})`);
+	let r = t === void 0 ? n : t;
+	return {
+		nBitLength: r,
+		nByteLength: Math.ceil(r / 8)
+	};
+}
+var Lt = /* @__PURE__ */ new WeakMap(), Rt = class {
+	ORDER;
+	BITS;
+	BYTES;
+	isLE;
+	ZERO = z;
+	ONE = B;
+	_lengths;
+	_mod;
+	constructor(e, t = {}) {
+		if (e <= B) 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,
+			enumerable: !0
+		}), typeof t.isLE == "boolean" && (this.isLE = t.isLE), t.allowedLengths && (this._lengths = Object.freeze(t.allowedLengths.slice())), typeof t.modFromBytes == "boolean" && (this._mod = t.modFromBytes));
+		let { nBitLength: r, nByteLength: i } = It(e, n);
+		if (i > 2048) throw Error("invalid field: expected ORDER of <= 2048 bytes");
+		this.ORDER = e, this.BITS = r, this.BYTES = i, Object.freeze(this);
+	}
+	create(e) {
+		return H(e, this.ORDER);
+	}
+	isValid(e) {
+		if (typeof e != "bigint") throw TypeError("invalid field element: expected bigint, got " + typeof e);
+		return z <= e && e < this.ORDER;
+	}
+	is0(e) {
+		return e === z;
+	}
+	isValidNot0(e) {
+		return !this.is0(e) && this.isValid(e);
+	}
+	isOdd(e) {
+		return (e & B) === B;
+	}
+	neg(e) {
+		return H(-e, this.ORDER);
+	}
+	eql(e, t) {
+		return e === t;
+	}
+	sqr(e) {
+		return H(e * e, this.ORDER);
+	}
+	add(e, t) {
+		return H(e + t, this.ORDER);
+	}
+	sub(e, t) {
+		return H(e - t, this.ORDER);
+	}
+	mul(e, t) {
+		return H(e * t, this.ORDER);
+	}
+	pow(e, t) {
+		return Nt(this, e, t);
+	}
+	div(e, t) {
+		return H(e * wt(t, this.ORDER), this.ORDER);
+	}
+	sqrN(e) {
+		return e * e;
+	}
+	addN(e, t) {
+		return e + t;
+	}
+	subN(e, t) {
+		return e - t;
+	}
+	mulN(e, t) {
+		return e * t;
+	}
+	inv(e) {
+		return wt(e, this.ORDER);
+	}
+	sqrt(e) {
+		let t = Lt.get(this);
+		return t || Lt.set(this, t = At(this.ORDER)), t(this, e);
+	}
+	toBytes(e) {
+		return this.isLE ? ot(e, this.BYTES) : at(e, this.BYTES);
+	}
+	fromBytes(e, t = !1) {
+		F(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);
+			let t = new Uint8Array(r);
+			t.set(e, i ? 0 : t.length - e.length), e = t;
+		}
+		if (e.length !== r) throw Error("Field.fromBytes: expected " + r + " bytes, got " + e.length);
+		let s = i ? R(e) : it(e);
+		if (o && (s = H(s, a)), !t && !this.isValid(s)) throw Error("invalid field element: outside of range 0..ORDER");
+		return s;
+	}
+	invertBatch(e) {
+		return Pt(this, e);
+	}
+	cmov(e, t, n) {
+		return tt(n, "condition"), n ? t : e;
+	}
+};
+Object.freeze(Rt.prototype);
+function zt(e, t = {}) {
+	return new Rt(e, t);
+}
+//#endregion
+//#region node_modules/.pnpm/@noble+curves@2.2.0/node_modules/@noble/curves/abstract/curve.js
+var Bt = /* @__PURE__ */ BigInt(0), Vt = /* @__PURE__ */ BigInt(1);
+function Ht(e, t) {
+	let n = t.negate();
+	return e ? n : t;
+}
+function Ut(e, t) {
+	let n = Pt(e.Fp, t.map((e) => e.Z));
+	return t.map((t, r) => e.fromAffine(t.toAffine(n[r])));
+}
+function Wt(e, t) {
+	if (!Number.isSafeInteger(e) || e <= 0 || e > t) throw Error("invalid window size, expected [1.." + t + "], got W=" + e);
+}
+function Gt(e, t) {
+	Wt(e, t);
+	let n = Math.ceil(t / e) + 1, r = 2 ** (e - 1), i = 2 ** e;
+	return {
+		windows: n,
+		windowSize: r,
+		mask: mt(e),
+		maxNumber: i,
+		shiftBy: BigInt(e)
+	};
+}
+function Kt(e, t, n) {
+	let { windowSize: r, mask: i, maxNumber: a, shiftBy: o } = n, s = Number(e & i), c = e >> o;
+	s > r && (s -= a, c += Vt);
+	let l = t * r, u = l + Math.abs(s) - 1, d = s === 0, f = s < 0, p = t % 2 != 0;
+	return {
+		nextN: c,
+		offset: u,
+		isZero: d,
+		isNeg: f,
+		isNegF: p,
+		offsetF: l
+	};
+}
+var qt = /* @__PURE__ */ new WeakMap(), Jt = /* @__PURE__ */ new WeakMap();
+function Yt(e) {
+	return Jt.get(e) || 1;
+}
+function Xt(e) {
+	if (e !== Bt) throw Error("invalid wNAF");
+}
+var Zt = class {
+	BASE;
+	ZERO;
+	Fn;
+	bits;
+	constructor(e, t) {
+		this.BASE = e.BASE, this.ZERO = e.ZERO, this.Fn = e.Fn, this.bits = t;
+	}
+	_unsafeLadder(e, t, n = this.ZERO) {
+		let r = e;
+		for (; t > Bt;) t & Vt && (n = n.add(r)), r = r.double(), t >>= Vt;
+		return n;
+	}
+	precomputeWindow(e, t) {
+		let { windows: n, windowSize: r } = Gt(t, this.bits), i = [], a = e, o = a;
+		for (let e = 0; e < n; e++) {
+			o = a, i.push(o);
+			for (let e = 1; e < r; e++) o = o.add(a), i.push(o);
+			a = o.double();
+		}
+		return i;
+	}
+	wNAF(e, t, n) {
+		if (!this.Fn.isValid(n)) throw Error("invalid scalar");
+		let r = this.ZERO, i = this.BASE, a = Gt(e, this.bits);
+		for (let e = 0; e < a.windows; e++) {
+			let { nextN: o, offset: s, isZero: c, isNeg: l, isNegF: u, offsetF: d } = Kt(n, e, a);
+			n = o, c ? i = i.add(Ht(u, t[d])) : r = r.add(Ht(l, t[s]));
+		}
+		return Xt(n), {
+			p: r,
+			f: i
+		};
+	}
+	wNAFUnsafe(e, t, n, r = this.ZERO) {
+		let i = Gt(e, this.bits);
+		for (let e = 0; e < i.windows && n !== Bt; e++) {
+			let { nextN: a, offset: o, isZero: s, isNeg: c } = Kt(n, e, i);
+			if (n = a, !s) {
+				let e = t[o];
+				r = r.add(c ? e.negate() : e);
+			}
+		}
+		return Xt(n), r;
+	}
+	getPrecomputes(e, t, n) {
+		let r = qt.get(t);
+		return r || (r = this.precomputeWindow(t, e), e !== 1 && (typeof n == "function" && (r = n(r)), qt.set(t, r))), r;
+	}
+	cached(e, t, n) {
+		let r = Yt(e);
+		return this.wNAF(r, this.getPrecomputes(r, e, n), t);
+	}
+	unsafe(e, t, n, r) {
+		let i = Yt(e);
+		return i === 1 ? this._unsafeLadder(e, t, r) : this.wNAFUnsafe(i, this.getPrecomputes(i, e, n), t, r);
+	}
+	createCache(e, t) {
+		Wt(t, this.bits), Jt.set(e, t), qt.delete(e);
+	}
+	hasCache(e) {
+		return Yt(e) !== 1;
+	}
+};
+function Qt(e, t, n) {
+	if (t) {
+		if (t.ORDER !== e) throw Error("Field.ORDER must match order: Fp == p, Fn == n");
+		return Mt(t), t;
+	} else return zt(e, { isLE: n });
+}
+function $t(e, t, n = {}, r) {
+	if (r === void 0 && (r = e === "edwards"), !t || typeof t != "object") throw Error(`expected valid ${e} CURVE object`);
+	for (let e of [
+		"p",
+		"n",
+		"h"
+	]) {
+		let n = t[e];
+		if (!(typeof n == "bigint" && n > Bt)) throw Error(`CURVE.${e} must be positive bigint`);
+	}
+	let i = Qt(t.p, n.Fp, r), a = Qt(t.n, n.Fn, r), o = [
+		"Gx",
+		"Gy",
+		"a",
+		e === "weierstrass" ? "b" : "d"
+	];
+	for (let e of o) if (!i.isValid(t[e])) throw Error(`CURVE.${e} must be valid field element of CURVE.Fp`);
+	return t = Object.freeze(Object.assign({}, t)), {
+		CURVE: t,
+		Fp: i,
+		Fn: a
+	};
+}
+function en(e, t) {
+	return function(n) {
+		let r = e(n);
+		return {
+			secretKey: r,
+			publicKey: t(r)
+		};
+	};
+}
+//#endregion
+//#region node_modules/.pnpm/@noble+curves@2.2.0/node_modules/@noble/curves/abstract/edwards.js
+var G = /* @__PURE__ */ BigInt(0), K = /* @__PURE__ */ BigInt(1), tn = /* @__PURE__ */ BigInt(2), nn = /* @__PURE__ */ BigInt(8);
+function rn(e, t, n, r) {
+	let i = e.sqr(n), a = e.sqr(r), o = e.add(e.mul(t.a, i), a), s = e.add(e.ONE, e.mul(t.d, e.mul(i, a)));
+	return e.eql(o, s);
+}
+function an(e, t = {}) {
+	let n = t, r = $t("edwards", e, n, n.FpFnLE), { Fp: i, Fn: a } = r, o = r.CURVE, { h: s } = o;
+	ht(n, {}, { uvRatio: "function" });
+	let c = tn << BigInt(a.BYTES * 8) - K, l = (e) => i.create(e), u = n.uvRatio === void 0 ? (e, t) => {
+		try {
+			return {
+				isValid: !0,
+				value: i.sqrt(i.div(e, t))
+			};
+		} catch {
+			return {
+				isValid: !1,
+				value: G
+			};
+		}
+	} : n.uvRatio;
+	if (!rn(i, o, o.Gx, o.Gy)) throw Error("bad curve params: generator point");
+	function d(e, t, n = !1) {
+		let r = n ? K : G;
+		return ft("coordinate " + e, t, r, c), t;
+	}
+	function f(e) {
+		if (!(e instanceof p)) throw Error("EdwardsPoint expected");
+	}
+	class p {
+		static BASE = new p(o.Gx, o.Gy, K, l(o.Gx * o.Gy));
+		static ZERO = new p(G, K, K, G);
+		static Fp = i;
+		static Fn = a;
+		X;
+		Y;
+		Z;
+		T;
+		constructor(e, t, n, r) {
+			this.X = d("x", e), this.Y = d("y", t), this.Z = d("z", n, !0), this.T = d("t", r), Object.freeze(this);
+		}
+		static CURVE() {
+			return o;
+		}
+		static fromAffine(e) {
+			if (e instanceof p) throw Error("extended point not allowed");
+			let { x: t, y: n } = e || {};
+			return d("x", t), d("y", n), new p(t, n, K, l(t * n));
+		}
+		static fromBytes(e, t = !1) {
+			let n = i.BYTES, { a: r, d: a } = o;
+			e = ct(F(e, n, "point")), tt(t, "zip215");
+			let s = ct(e), d = e[n - 1];
+			s[n - 1] = d & -129;
+			let f = R(s);
+			ft("point.y", f, G, t ? c : i.ORDER);
+			let m = l(f * f), h = l(m - K), g = l(a * m - r), { isValid: _, value: v } = u(h, g);
+			if (!_) throw Error("bad point: invalid y coordinate");
+			let y = (v & K) === K, b = (d & 128) != 0;
+			if (!t && v === G && b) throw Error("bad point: x=0 and x_0=1");
+			return b !== y && (v = l(-v)), p.fromAffine({
+				x: v,
+				y: f
+			});
+		}
+		static fromHex(e, t = !1) {
+			return p.fromBytes(Xe(e), t);
+		}
+		get x() {
+			return this.toAffine().x;
+		}
+		get y() {
+			return this.toAffine().y;
+		}
+		precompute(e = 8, t = !0) {
+			return m.createCache(this, e), t || this.multiply(tn), this;
+		}
+		assertValidity() {
+			let e = this, { a: t, d: n } = o;
+			if (e.is0()) throw Error("bad point: ZERO");
+			let { X: r, Y: i, Z: a, T: s } = e, c = l(r * r), u = l(i * i), d = l(a * a), f = l(d * d), p = l(c * t);
+			if (l(d * l(p + u)) !== l(f + l(n * l(c * u)))) throw Error("bad point: equation left != right (1)");
+			if (l(r * i) !== l(a * s)) throw Error("bad point: equation left != right (2)");
+		}
+		equals(e) {
+			f(e);
+			let { X: t, Y: n, Z: r } = this, { X: i, Y: a, Z: o } = e, s = l(t * o), c = l(i * r), u = l(n * o), d = l(a * r);
+			return s === c && u === d;
+		}
+		is0() {
+			return this.equals(p.ZERO);
+		}
+		negate() {
+			return new p(l(-this.X), this.Y, this.Z, l(-this.T));
+		}
+		double() {
+			let { a: e } = o, { X: t, Y: n, Z: r } = this, i = l(t * t), a = l(n * n), s = l(tn * l(r * r)), c = l(e * i), u = t + n, d = l(l(u * u) - i - a), f = c + a, m = f - s, h = c - a, g = l(d * m), _ = l(f * h), v = l(d * h), y = l(m * f);
+			return new p(g, _, y, v);
+		}
+		add(e) {
+			f(e);
+			let { a: t, d: n } = o, { X: r, Y: i, Z: a, T: s } = this, { X: c, Y: u, Z: d, T: m } = e, h = l(r * c), g = l(i * u), _ = l(s * n * m), v = l(a * d), y = l((r + i) * (c + u) - h - g), b = v - _, x = v + _, S = l(g - t * h), C = l(y * b), w = l(x * S), ee = l(y * S), te = l(b * x);
+			return new p(C, w, te, ee);
+		}
+		subtract(e) {
+			return f(e), this.add(e.negate());
+		}
+		multiply(e) {
+			if (!a.isValidNot0(e)) throw RangeError("invalid scalar: expected 1 <= sc < curve.n");
+			let { p: t, f: n } = m.cached(this, e, (e) => Ut(p, e));
+			return Ut(p, [t, n])[0];
+		}
+		multiplyUnsafe(e) {
+			if (!a.isValid(e)) throw RangeError("invalid scalar: expected 0 <= sc < curve.n");
+			return e === G ? p.ZERO : this.is0() || e === K ? this : m.unsafe(this, e, (e) => Ut(p, e));
+		}
+		isSmallOrder() {
+			return this.clearCofactor().is0();
+		}
+		isTorsionFree() {
+			return m.unsafe(this, o.n).is0();
+		}
+		toAffine(e) {
+			let t = this, n = e, { X: r, Y: a, Z: o } = t, s = t.is0();
+			n ??= s ? nn : i.inv(o);
+			let c = l(r * n), u = l(a * n), d = i.mul(o, n);
+			if (s) return {
+				x: G,
+				y: K
+			};
+			if (d !== K) throw Error("invZ was invalid");
+			return {
+				x: c,
+				y: u
+			};
+		}
+		clearCofactor() {
+			return s === K ? this : this.multiplyUnsafe(s);
+		}
+		toBytes() {
+			let { x: e, y: t } = this.toAffine(), n = i.toBytes(t);
+			return n[n.length - 1] |= e & K ? 128 : 0, n;
+		}
+		toHex() {
+			return Ye(this.toBytes());
+		}
+		toString() {
+			return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
+		}
+	}
+	let m = new Zt(p, a.BITS);
+	return a.BITS >= 8 && p.BASE.precompute(8), Object.freeze(p.prototype), Object.freeze(p), p;
+}
+var on = class {
+	static BASE;
+	static ZERO;
+	static Fp;
+	static Fn;
+	ep;
+	constructor(e) {
+		this.ep = e;
+	}
+	static fromBytes(e) {
+		gt();
+	}
+	static fromHex(e) {
+		gt();
+	}
+	get x() {
+		return this.toAffine().x;
+	}
+	get y() {
+		return this.toAffine().y;
+	}
+	clearCofactor() {
+		return this;
+	}
+	assertValidity() {
+		this.ep.assertValidity();
+	}
+	toAffine(e) {
+		return this.ep.toAffine(e);
+	}
+	toHex() {
+		return Ye(this.toBytes());
+	}
+	toString() {
+		return this.toHex();
+	}
+	isTorsionFree() {
+		return !0;
+	}
+	isSmallOrder() {
+		return !1;
+	}
+	add(e) {
+		return this.assertSame(e), this.init(this.ep.add(e.ep));
+	}
+	subtract(e) {
+		return this.assertSame(e), this.init(this.ep.subtract(e.ep));
+	}
+	multiply(e) {
+		return this.init(this.ep.multiply(e));
+	}
+	multiplyUnsafe(e) {
+		return this.init(this.ep.multiplyUnsafe(e));
+	}
+	double() {
+		return this.init(this.ep.double());
+	}
+	negate() {
+		return this.init(this.ep.negate());
+	}
+	precompute(e, t) {
+		return this.ep.precompute(e, t), this;
+	}
+};
+function sn(e, t, n = {}) {
+	if (typeof t != "function") throw Error("\"hash\" function param is required");
+	let r = t, i = n;
+	ht(i, {}, {
+		adjustScalarBytes: "function",
+		randomBytes: "function",
+		domain: "function",
+		prehash: "function",
+		zip215: "boolean",
+		mapToCurve: "function"
+	});
+	let { prehash: a } = i, { BASE: o, Fp: s, Fn: c } = e, l = r.outputLen, u = 2 * s.BYTES;
+	if (l !== void 0 && (L(l, "hash.outputLen"), l !== u)) throw Error(`hash.outputLen must be ${u}, got ${l}`);
+	let d = i.randomBytes === void 0 ? Qe : i.randomBytes, f = i.adjustScalarBytes === void 0 ? (e) => e : i.adjustScalarBytes, p = i.domain === void 0 ? (e, t, n) => {
+		if (tt(n, "phflag"), t.length || n) throw Error("Contexts/pre-hash are not supported");
+		return e;
+	} : i.domain;
+	function m(e) {
+		return c.create(R(e));
+	}
+	function h(e) {
+		let t = C.secretKey;
+		F(e, C.secretKey, "secretKey");
+		let n = F(r(e), 2 * t, "hashedSecretKey"), i = f(n.slice(0, t));
+		return {
+			head: i,
+			prefix: n.slice(t, 2 * t),
+			scalar: m(i)
+		};
+	}
+	function g(e) {
+		let { head: t, prefix: n, scalar: r } = h(e), i = o.multiply(r);
+		return {
+			head: t,
+			prefix: n,
+			scalar: r,
+			point: i,
+			pointBytes: i.toBytes()
+		};
+	}
+	function _(e) {
+		return g(e).pointBytes;
+	}
+	function v(e = Uint8Array.of(), ...t) {
+		let n = I(...t);
+		return m(r(p(n, F(e, void 0, "context"), !!a)));
+	}
+	function y(e, t, n = {}) {
+		e = F(e, void 0, "message"), a && (e = a(e));
+		let { prefix: r, scalar: i, pointBytes: s } = g(t), l = v(n.context, r, e), u = o.multiply(l).toBytes(), d = v(n.context, u, s, e), f = c.create(l + d * i);
+		if (!c.isValid(f)) throw Error("sign failed: invalid s");
+		return F(I(u, c.toBytes(f)), C.signature, "result");
+	}
+	let b = { zip215: i.zip215 };
+	function x(t, n, r, i = b) {
+		let { context: s } = i, c = i.zip215 === void 0 ? !!b.zip215 : i.zip215, l = C.signature;
+		t = F(t, l, "signature"), n = F(n, void 0, "message"), r = F(r, C.publicKey, "publicKey"), c !== void 0 && tt(c, "zip215"), a && (n = a(n));
+		let u = l / 2, d = t.subarray(0, u), f = R(t.subarray(u, l)), p, m, h;
+		try {
+			p = e.fromBytes(r, c), m = e.fromBytes(d, c), h = o.multiplyUnsafe(f);
+		} catch {
+			return !1;
+		}
+		if (!c && p.isSmallOrder()) return !1;
+		let g = v(s, d, r, n);
+		return m.add(p.multiplyUnsafe(g)).subtract(h).clearCofactor().is0();
+	}
+	let S = s.BYTES, C = {
+		secretKey: S,
+		publicKey: S,
+		signature: 2 * S,
+		seed: S
+	};
+	function w(e) {
+		return e = e === void 0 ? d(C.seed) : e, F(e, C.seed, "seed");
+	}
+	function ee(e) {
+		return Ze(e) && e.length === C.secretKey;
+	}
+	function te(t, n) {
+		try {
+			return !!e.fromBytes(t, n === void 0 ? b.zip215 : n);
+		} catch {
+			return !1;
+		}
+	}
+	let ne = {
+		getExtendedPublicKey: g,
+		randomSecretKey: w,
+		isValidSecretKey: ee,
+		isValidPublicKey: te,
+		toMontgomery(t) {
+			let { y: n } = e.fromBytes(t), r = C.publicKey, i = r === 32;
+			if (!i && r !== 57) throw Error("only defined for 25519 and 448");
+			let a = i ? s.div(K + n, K - n) : s.div(n - K, n + K);
+			return s.toBytes(a);
+		},
+		toMontgomerySecret(e) {
+			let t = C.secretKey;
+			F(e, t);
+			let n = r(e.subarray(0, t));
+			return f(n).subarray(0, t);
+		}
+	};
+	return Object.freeze(C), Object.freeze(ne), Object.freeze({
+		keygen: en(w, _),
+		getPublicKey: _,
+		sign: y,
+		verify: x,
+		utils: ne,
+		Point: e,
+		lengths: C
+	});
+}
+//#endregion
+//#region node_modules/.pnpm/@noble+curves@2.2.0/node_modules/@noble/curves/abstract/hash-to-curve.js
+function cn(e, t) {
+	if (L(e), L(t), t < 0 || t > 4) throw Error("invalid I2OSP length: " + t);
+	if (e < 0 || e > 2 ** (8 * t) - 1) throw Error("invalid I2OSP input: " + e);
+	let n = Array.from({ length: t }).fill(0);
+	for (let r = t - 1; r >= 0; r--) n[r] = e & 255, e >>>= 8;
+	return new Uint8Array(n);
+}
+function ln(e, t) {
+	let n = new Uint8Array(e.length);
+	for (let r = 0; r < e.length; r++) n[r] = e[r] ^ t[r];
+	return n;
+}
+function un(e) {
+	if (!Ze(e) && typeof e != "string") throw Error("DST must be Uint8Array or ascii string");
+	let t = typeof e == "string" ? lt(e) : e;
+	if (t.length === 0) throw Error("DST must be non-empty");
+	return t;
+}
+function dn(e, t, n, r) {
+	F(e), L(n), t = un(t), t.length > 255 && (t = r(I(lt("H2C-OVERSIZE-DST-"), t)));
+	let { outputLen: i, blockLen: a } = r, o = Math.ceil(n / i);
+	if (n > 65535 || o > 255) throw Error("expand_message_xmd: invalid lenInBytes");
+	let s = I(t, cn(t.length, 1)), c = new Uint8Array(a), l = cn(n, 2), u = Array(o), d = r(I(c, e, l, cn(0, 1), s));
+	u[0] = r(I(d, cn(1, 1), s));
+	for (let e = 1; e < o; e++) u[e] = r(I(ln(d, u[e - 1]), cn(e + 1, 1), s));
+	return I(...u).slice(0, n);
+}
+var fn = "HashToScalar-", pn = /* @__PURE__ */ BigInt(0), q = /* @__PURE__ */ BigInt(1), mn = /* @__PURE__ */ BigInt(2), hn = /* @__PURE__ */ BigInt(5), gn = /* @__PURE__ */ BigInt(8), J = /* @__PURE__ */ BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"), _n = {
+	p: J,
+	n: BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),
+	h: gn,
+	a: BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),
+	d: BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),
+	Gx: BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),
+	Gy: BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")
+};
+function vn(e) {
+	let t = BigInt(10), n = BigInt(20), r = BigInt(40), i = BigInt(80), a = J, o = e * e % a * e % a, s = U(U(o, mn, a) * o % a, q, a) * e % a, c = U(s, hn, a) * s % a, l = U(c, t, a) * c % a, u = U(l, n, a) * l % a, d = U(u, r, a) * u % a;
+	return {
+		pow_p_5_8: U(U(U(U(d, i, a) * d % a, i, a) * d % a, t, a) * c % a, mn, a) * e % a,
+		b2: o
+	};
+}
+function yn(e) {
+	return e[0] &= 248, e[31] &= 127, e[31] |= 64, e;
+}
+var bn = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
+function xn(e, t) {
+	let n = J, r = H(t * t * t, n), i = vn(e * H(r * r * t, n)).pow_p_5_8, a = H(e * r * i, n), o = H(t * a * a, n), s = a, c = H(a * bn, n), l = o === e, u = o === H(-e, n), d = o === H(-e * bn, n);
+	return l && (a = s), (u || d) && (a = c), W(a, n) && (a = H(-a, n)), {
+		isValid: l || u,
+		value: a
+	};
+}
+var Y = /* @__PURE__ */ an(_n, { uvRatio: xn }), X = Y.Fp, Sn = Y.Fn;
+function Cn(e) {
+	return sn(Y, qe, Object.assign({
+		adjustScalarBytes: yn,
+		zip215: !0
+	}, e));
+}
+var Z = /* @__PURE__ */ Cn({}), wn = bn, Tn = /* @__PURE__ */ BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"), En = /* @__PURE__ */ BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"), Dn = /* @__PURE__ */ BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"), On = /* @__PURE__ */ BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"), kn = (e) => xn(q, e), An = /* @__PURE__ */ BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), jn = (e) => X.create(R(e) & An);
+function Mn(e) {
+	let { d: t } = _n, n = J, r = (e) => X.create(e), i = r(wn * e * e), a = r((i + q) * Dn), o = BigInt(-1), s = r((o - t * i) * r(i + t)), { isValid: c, value: l } = xn(a, s), u = r(l * e);
+	W(u, n) || (u = r(-u)), c || (l = u), c || (o = i);
+	let d = r(o * (i - q) * On - s), f = l * l, p = r((l + l) * s), m = r(d * Tn), h = r(q - f), g = r(q + f);
+	return new Y(r(p * g), r(h * m), r(m * g), r(p * h));
+}
+var Q = class e extends on {
+	static BASE = /* @__PURE__ */ new e(Y.BASE);
+	static ZERO = /* @__PURE__ */ new e(Y.ZERO);
+	static Fp = X;
+	static Fn = Sn;
+	constructor(e) {
+		super(e);
+	}
+	static fromAffine(t) {
+		return new e(Y.fromAffine(t));
+	}
+	assertSame(t) {
+		if (!(t instanceof e)) throw Error("RistrettoPoint expected");
+	}
+	init(t) {
+		return new e(t);
+	}
+	static fromBytes(t) {
+		D(t, 32);
+		let { a: n, d: r } = _n, i = J, a = (e) => X.create(e), o = jn(t);
+		if (!st(X.toBytes(o), t) || W(o, i)) throw Error("invalid ristretto255 encoding 1");
+		let s = a(o * o), c = a(q + n * s), l = a(q - n * s), u = a(c * c), d = a(l * l), f = a(n * r * u - d), { isValid: p, value: m } = kn(a(f * d)), h = a(m * l), g = a(m * h * f), _ = a((o + o) * h);
+		W(_, i) && (_ = a(-_));
+		let v = a(c * g), y = a(_ * v);
+		if (!p || W(y, i) || v === pn) throw Error("invalid ristretto255 encoding 2");
+		return new e(new Y(_, v, q, y));
+	}
+	static fromHex(t) {
+		return e.fromBytes(Se(t));
+	}
+	toBytes() {
+		let { X: e, Y: t, Z: n, T: r } = this.ep, i = J, a = (e) => X.create(e), o = a(a(n + t) * a(n - t)), s = a(e * t), { value: c } = kn(a(o * a(s * s))), l = a(c * o), u = a(c * s), d = a(l * u * r), f;
+		if (W(r * d, i)) {
+			let n = a(t * wn), r = a(e * wn);
+			e = n, t = r, f = a(l * En);
+		} else f = u;
+		W(e * d, i) && (t = a(-t));
+		let p = a((n - t) * f);
+		return W(p, i) && (p = a(-p)), X.toBytes(p);
+	}
+	equals(e) {
+		this.assertSame(e);
+		let { X: t, Y: n } = this.ep, { X: r, Y: i } = e.ep, a = (e) => X.create(e), o = a(t * i) === a(n * r), s = a(n * i) === a(t * r);
+		return o || s;
+	}
+	is0() {
+		return this.equals(e.ZERO);
+	}
+};
+Object.freeze(Q.BASE), Object.freeze(Q.ZERO), Object.freeze(Q.prototype), Object.freeze(Q);
+var Nn = Object.freeze({
+	Point: Q,
+	hashToCurve(e, t) {
+		let n = dn(e, t?.DST === void 0 ? "ristretto255_XMD:SHA-512_R255MAP_RO_" : t.DST, 64, qe);
+		return Nn.deriveToCurve(n);
+	},
+	hashToScalar(e, t = { DST: fn }) {
+		let n = dn(e, t.DST, 64, qe);
+		return Sn.create(R(n));
+	},
+	deriveToCurve(e) {
+		D(e, 64);
+		let t = Mn(jn(e.subarray(0, 32))), n = Mn(jn(e.subarray(32, 64)));
+		return new Q(t.add(n));
+	}
+}), $ = 32, Pn = 248, Fn = 127, In = 64, Ln = 128, Rn = 127;
+function zn(e) {
+	e.length < $ || (e[0] = (e[0] ?? 0) & Pn, e[$ - 1] = (e[$ - 1] ?? 0) & Fn | In);
+}
+function Bn() {
+	let e = new Uint8Array(s($));
+	zn(e);
+	let t = Gn(e) % Z.Point.CURVE().n;
+	return [Z.Point.BASE.multiply(t).toBytes(), Uint8Array.from(e)];
+}
+function Vn(e, t) {
+	let n = i("SHA256");
+	return n.update(t), n.sign(e);
+}
+function Hn(e, t, n) {
+	try {
+		let r = a("SHA256");
+		return r.update(t), r.verify(e, Buffer.from(n));
+	} catch {
+		return !1;
+	}
+}
+function Un(e, n) {
+	if (e.length !== $ || n.length !== $) throw Error("invalid key length");
+	let r = Uint8Array.from(n);
+	r[$ - 1] = (r[$ - 1] ?? 0) & Rn;
+	let i = Gn(r), a = Wn(Z.Point.fromBytes(e).negate(), i).toBytes();
+	return a[$ - 1] = (a[$ - 1] ?? 0) ^ Ln, t("sha512").update(a).digest();
+}
+function Wn(e, t) {
+	let n = Z.Point.CURVE().n;
+	if (t < n) return t === 0n ? Z.Point.ZERO : e.multiply(t);
+	let r = t % n, i = t / n, a = r === 0n ? Z.Point.ZERO : e.multiply(r), o = e.multiply(n - 1n).add(e).multiply(i);
+	return a.add(o);
+}
+function Gn(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 _, Wn as a, m as b, Z as c, w as d, ee as f, u as g, d as h, Un as i, x as l, ne as m, zn as n, Vn as o, S as p, Bn as r, Hn as s, Gn as t, C as u, f as v, c as w, h as x, p as y };
+
+//# sourceMappingURL=primitives-Bt-L4BZa.js.map