@sentio/sdk 2.57.12-rc.j → 2.57.13-rc.1

package/lib/chunk-UIBPOKNT.js

@@ -1,945 +0,0 @@
-import { createRequire as createRequireSdkShim } from 'module'; const require = createRequireSdkShim(import.meta.url);
-import {
-  Field,
-  HashMD,
-  aInRange,
-  abool,
-  bytesToHex2 as bytesToHex,
-  bytesToNumberLE,
-  concatBytes,
-  ensureBytes,
-  init_curve,
-  init_md,
-  init_modular,
-  init_u64,
-  init_utils,
-  init_utils2,
-  isNegativeLE,
-  memoized,
-  mod,
-  numberToBytesLE,
-  pippenger,
-  pow2,
-  randomBytes,
-  u64_default,
-  validateBasic,
-  validateObject,
-  wNAF,
-  wrapConstructor
-} from "./chunk-2F2KNF4Z.js";
-import {
-  __commonJS,
-  __esm,
-  __name,
-  __toESM
-} from "./chunk-R7PMHHKJ.js";
-
-// ../../node_modules/.pnpm/@noble+hashes@1.5.0/node_modules/@noble/hashes/esm/sha512.js
-var SHA512_Kh, SHA512_Kl, SHA512_W_H, SHA512_W_L, SHA512, sha512;
-var init_sha512 = __esm({
-  "../../node_modules/.pnpm/@noble+hashes@1.5.0/node_modules/@noble/hashes/esm/sha512.js"() {
-    "use strict";
-    init_md();
-    init_u64();
-    init_utils();
-    [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64_default.split([
-      "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"
-    ].map((n) => BigInt(n))))();
-    SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);
-    SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);
-    SHA512 = class extends HashMD {
-      static {
-        __name(this, "SHA512");
-      }
-      constructor() {
-        super(128, 64, 16, false);
-        this.Ah = 1779033703 | 0;
-        this.Al = 4089235720 | 0;
-        this.Bh = 3144134277 | 0;
-        this.Bl = 2227873595 | 0;
-        this.Ch = 1013904242 | 0;
-        this.Cl = 4271175723 | 0;
-        this.Dh = 2773480762 | 0;
-        this.Dl = 1595750129 | 0;
-        this.Eh = 1359893119 | 0;
-        this.El = 2917565137 | 0;
-        this.Fh = 2600822924 | 0;
-        this.Fl = 725511199 | 0;
-        this.Gh = 528734635 | 0;
-        this.Gl = 4215389547 | 0;
-        this.Hh = 1541459225 | 0;
-        this.Hl = 327033209 | 0;
-      }
-      // prettier-ignore
-      get() {
-        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;
-        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];
-      }
-      // prettier-ignore
-      set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {
-        this.Ah = Ah | 0;
-        this.Al = Al | 0;
-        this.Bh = Bh | 0;
-        this.Bl = Bl | 0;
-        this.Ch = Ch | 0;
-        this.Cl = Cl | 0;
-        this.Dh = Dh | 0;
-        this.Dl = Dl | 0;
-        this.Eh = Eh | 0;
-        this.El = El | 0;
-        this.Fh = Fh | 0;
-        this.Fl = Fl | 0;
-        this.Gh = Gh | 0;
-        this.Gl = Gl | 0;
-        this.Hh = Hh | 0;
-        this.Hl = Hl | 0;
-      }
-      process(view, offset) {
-        for (let i = 0; i < 16; i++, offset += 4) {
-          SHA512_W_H[i] = view.getUint32(offset);
-          SHA512_W_L[i] = view.getUint32(offset += 4);
-        }
-        for (let i = 16; i < 80; i++) {
-          const W15h = SHA512_W_H[i - 15] | 0;
-          const W15l = SHA512_W_L[i - 15] | 0;
-          const s0h = u64_default.rotrSH(W15h, W15l, 1) ^ u64_default.rotrSH(W15h, W15l, 8) ^ u64_default.shrSH(W15h, W15l, 7);
-          const s0l = u64_default.rotrSL(W15h, W15l, 1) ^ u64_default.rotrSL(W15h, W15l, 8) ^ u64_default.shrSL(W15h, W15l, 7);
-          const W2h = SHA512_W_H[i - 2] | 0;
-          const W2l = SHA512_W_L[i - 2] | 0;
-          const s1h = u64_default.rotrSH(W2h, W2l, 19) ^ u64_default.rotrBH(W2h, W2l, 61) ^ u64_default.shrSH(W2h, W2l, 6);
-          const s1l = u64_default.rotrSL(W2h, W2l, 19) ^ u64_default.rotrBL(W2h, W2l, 61) ^ u64_default.shrSL(W2h, W2l, 6);
-          const SUMl = u64_default.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
-          const SUMh = u64_default.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);
-          SHA512_W_H[i] = SUMh | 0;
-          SHA512_W_L[i] = SUMl | 0;
-        }
-        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;
-        for (let i = 0; i < 80; i++) {
-          const sigma1h = u64_default.rotrSH(Eh, El, 14) ^ u64_default.rotrSH(Eh, El, 18) ^ u64_default.rotrBH(Eh, El, 41);
-          const sigma1l = u64_default.rotrSL(Eh, El, 14) ^ u64_default.rotrSL(Eh, El, 18) ^ u64_default.rotrBL(Eh, El, 41);
-          const CHIh = Eh & Fh ^ ~Eh & Gh;
-          const CHIl = El & Fl ^ ~El & Gl;
-          const T1ll = u64_default.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
-          const T1h = u64_default.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);
-          const T1l = T1ll | 0;
-          const sigma0h = u64_default.rotrSH(Ah, Al, 28) ^ u64_default.rotrBH(Ah, Al, 34) ^ u64_default.rotrBH(Ah, Al, 39);
-          const sigma0l = u64_default.rotrSL(Ah, Al, 28) ^ u64_default.rotrBL(Ah, Al, 34) ^ u64_default.rotrBL(Ah, Al, 39);
-          const MAJh = Ah & Bh ^ Ah & Ch ^ Bh & Ch;
-          const MAJl = Al & Bl ^ Al & Cl ^ Bl & Cl;
-          Hh = Gh | 0;
-          Hl = Gl | 0;
-          Gh = Fh | 0;
-          Gl = Fl | 0;
-          Fh = Eh | 0;
-          Fl = El | 0;
-          ({ h: Eh, l: El } = u64_default.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
-          Dh = Ch | 0;
-          Dl = Cl | 0;
-          Ch = Bh | 0;
-          Cl = Bl | 0;
-          Bh = Ah | 0;
-          Bl = Al | 0;
-          const All = u64_default.add3L(T1l, sigma0l, MAJl);
-          Ah = u64_default.add3H(All, T1h, sigma0h, MAJh);
-          Al = All | 0;
-        }
-        ({ h: Ah, l: Al } = u64_default.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
-        ({ h: Bh, l: Bl } = u64_default.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
-        ({ h: Ch, l: Cl } = u64_default.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
-        ({ h: Dh, l: Dl } = u64_default.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
-        ({ h: Eh, l: El } = u64_default.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
-        ({ h: Fh, l: Fl } = u64_default.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
-        ({ h: Gh, l: Gl } = u64_default.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
-        ({ h: Hh, l: Hl } = u64_default.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
-        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);
-      }
-      roundClean() {
-        SHA512_W_H.fill(0);
-        SHA512_W_L.fill(0);
-      }
-      destroy() {
-        this.buffer.fill(0);
-        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-      }
-    };
-    sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());
-  }
-});
-
-// ../../node_modules/.pnpm/@noble+curves@1.6.0/node_modules/@noble/curves/esm/abstract/edwards.js
-function validateOpts(curve) {
-  const opts = validateBasic(curve);
-  validateObject(curve, {
-    hash: "function",
-    a: "bigint",
-    d: "bigint",
-    randomBytes: "function"
-  }, {
-    adjustScalarBytes: "function",
-    domain: "function",
-    uvRatio: "function",
-    mapToCurve: "function"
-  });
-  return Object.freeze({ ...opts });
-}
-function twistedEdwards(curveDef) {
-  const CURVE = validateOpts(curveDef);
-  const { Fp: Fp2, n: CURVE_ORDER, prehash, hash: cHash, randomBytes: randomBytes2, nByteLength, h: cofactor } = CURVE;
-  const MASK = _2n << BigInt(nByteLength * 8) - _1n;
-  const modP = Fp2.create;
-  const Fn = Field(CURVE.n, CURVE.nBitLength);
-  const uvRatio2 = CURVE.uvRatio || ((u, v) => {
-    try {
-      return { isValid: true, value: Fp2.sqrt(u * Fp2.inv(v)) };
-    } catch (e) {
-      return { isValid: false, value: _0n };
-    }
-  });
-  const adjustScalarBytes2 = CURVE.adjustScalarBytes || ((bytes) => bytes);
-  const domain = CURVE.domain || ((data, ctx, phflag) => {
-    abool("phflag", phflag);
-    if (ctx.length || phflag)
-      throw new Error("Contexts/pre-hash are not supported");
-    return data;
-  });
-  function aCoordinate(title, n) {
-    aInRange("coordinate " + title, n, _0n, MASK);
-  }
-  __name(aCoordinate, "aCoordinate");
-  function assertPoint(other) {
-    if (!(other instanceof Point))
-      throw new Error("ExtendedPoint expected");
-  }
-  __name(assertPoint, "assertPoint");
-  const toAffineMemo = memoized((p, iz) => {
-    const { ex: x, ey: y, ez: z } = p;
-    const is0 = p.is0();
-    if (iz == null)
-      iz = is0 ? _8n : Fp2.inv(z);
-    const ax = modP(x * iz);
-    const ay = modP(y * iz);
-    const zz = modP(z * iz);
-    if (is0)
-      return { x: _0n, y: _1n };
-    if (zz !== _1n)
-      throw new Error("invZ was invalid");
-    return { x: ax, y: ay };
-  });
-  const assertValidMemo = memoized((p) => {
-    const { a, d } = CURVE;
-    if (p.is0())
-      throw new Error("bad point: ZERO");
-    const { ex: X, ey: Y, ez: Z, et: T } = p;
-    const X2 = modP(X * X);
-    const Y2 = modP(Y * Y);
-    const Z2 = modP(Z * Z);
-    const Z4 = modP(Z2 * Z2);
-    const aX2 = modP(X2 * a);
-    const left = modP(Z2 * modP(aX2 + Y2));
-    const right = modP(Z4 + modP(d * modP(X2 * Y2)));
-    if (left !== right)
-      throw new Error("bad point: equation left != right (1)");
-    const XY = modP(X * Y);
-    const ZT = modP(Z * T);
-    if (XY !== ZT)
-      throw new Error("bad point: equation left != right (2)");
-    return true;
-  });
-  class Point {
-    static {
-      __name(this, "Point");
-    }
-    constructor(ex, ey, ez, et) {
-      this.ex = ex;
-      this.ey = ey;
-      this.ez = ez;
-      this.et = et;
-      aCoordinate("x", ex);
-      aCoordinate("y", ey);
-      aCoordinate("z", ez);
-      aCoordinate("t", et);
-      Object.freeze(this);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    static fromAffine(p) {
-      if (p instanceof Point)
-        throw new Error("extended point not allowed");
-      const { x, y } = p || {};
-      aCoordinate("x", x);
-      aCoordinate("y", y);
-      return new Point(x, y, _1n, modP(x * y));
-    }
-    static normalizeZ(points) {
-      const toInv = Fp2.invertBatch(points.map((p) => p.ez));
-      return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);
-    }
-    // Multiscalar Multiplication
-    static msm(points, scalars) {
-      return pippenger(Point, Fn, points, scalars);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(windowSize) {
-      wnaf.setWindowSize(this, windowSize);
-    }
-    // Not required for fromHex(), which always creates valid points.
-    // Could be useful for fromAffine().
-    assertValidity() {
-      assertValidMemo(this);
-    }
-    // Compare one point to another.
-    equals(other) {
-      assertPoint(other);
-      const { ex: X1, ey: Y1, ez: Z1 } = this;
-      const { ex: X2, ey: Y2, ez: Z2 } = other;
-      const X1Z2 = modP(X1 * Z2);
-      const X2Z1 = modP(X2 * Z1);
-      const Y1Z2 = modP(Y1 * Z2);
-      const Y2Z1 = modP(Y2 * Z1);
-      return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;
-    }
-    is0() {
-      return this.equals(Point.ZERO);
-    }
-    negate() {
-      return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));
-    }
-    // Fast algo for doubling Extended Point.
-    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
-    // Cost: 4M + 4S + 1*a + 6add + 1*2.
-    double() {
-      const { a } = CURVE;
-      const { ex: X1, ey: Y1, ez: Z1 } = this;
-      const A = modP(X1 * X1);
-      const B = modP(Y1 * Y1);
-      const C = modP(_2n * modP(Z1 * Z1));
-      const D = modP(a * A);
-      const x1y1 = X1 + Y1;
-      const E = modP(modP(x1y1 * x1y1) - A - B);
-      const G2 = D + B;
-      const F = G2 - C;
-      const H = D - B;
-      const X3 = modP(E * F);
-      const Y3 = modP(G2 * H);
-      const T3 = modP(E * H);
-      const Z3 = modP(F * G2);
-      return new Point(X3, Y3, Z3, T3);
-    }
-    // Fast algo for adding 2 Extended Points.
-    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd
-    // Cost: 9M + 1*a + 1*d + 7add.
-    add(other) {
-      assertPoint(other);
-      const { a, d } = CURVE;
-      const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;
-      const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;
-      if (a === BigInt(-1)) {
-        const A2 = modP((Y1 - X1) * (Y2 + X2));
-        const B2 = modP((Y1 + X1) * (Y2 - X2));
-        const F2 = modP(B2 - A2);
-        if (F2 === _0n)
-          return this.double();
-        const C2 = modP(Z1 * _2n * T2);
-        const D2 = modP(T1 * _2n * Z2);
-        const E2 = D2 + C2;
-        const G3 = B2 + A2;
-        const H2 = D2 - C2;
-        const X32 = modP(E2 * F2);
-        const Y32 = modP(G3 * H2);
-        const T32 = modP(E2 * H2);
-        const Z32 = modP(F2 * G3);
-        return new Point(X32, Y32, Z32, T32);
-      }
-      const A = modP(X1 * X2);
-      const B = modP(Y1 * Y2);
-      const C = modP(T1 * d * T2);
-      const D = modP(Z1 * Z2);
-      const E = modP((X1 + Y1) * (X2 + Y2) - A - B);
-      const F = D - C;
-      const G2 = D + C;
-      const H = modP(B - a * A);
-      const X3 = modP(E * F);
-      const Y3 = modP(G2 * H);
-      const T3 = modP(E * H);
-      const Z3 = modP(F * G2);
-      return new Point(X3, Y3, Z3, T3);
-    }
-    subtract(other) {
-      return this.add(other.negate());
-    }
-    wNAF(n) {
-      return wnaf.wNAFCached(this, n, Point.normalizeZ);
-    }
-    // Constant-time multiplication.
-    multiply(scalar) {
-      const n = scalar;
-      aInRange("scalar", n, _1n, CURVE_ORDER);
-      const { p, f } = this.wNAF(n);
-      return Point.normalizeZ([p, f])[0];
-    }
-    // Non-constant-time multiplication. Uses double-and-add algorithm.
-    // It's faster, but should only be used when you don't care about
-    // an exposed private key e.g. sig verification.
-    // Does NOT allow scalars higher than CURVE.n.
-    multiplyUnsafe(scalar) {
-      const n = scalar;
-      aInRange("scalar", n, _0n, CURVE_ORDER);
-      if (n === _0n)
-        return I;
-      if (this.equals(I) || n === _1n)
-        return this;
-      if (this.equals(G))
-        return this.wNAF(n).p;
-      return wnaf.unsafeLadder(this, n);
-    }
-    // Checks if point is of small order.
-    // If you add something to small order point, you will have "dirty"
-    // point with torsion component.
-    // Multiplies point by cofactor and checks if the result is 0.
-    isSmallOrder() {
-      return this.multiplyUnsafe(cofactor).is0();
-    }
-    // Multiplies point by curve order and checks if the result is 0.
-    // Returns `false` is the point is dirty.
-    isTorsionFree() {
-      return wnaf.unsafeLadder(this, CURVE_ORDER).is0();
-    }
-    // Converts Extended point to default (x, y) coordinates.
-    // Can accept precomputed Z^-1 - for example, from invertBatch.
-    toAffine(iz) {
-      return toAffineMemo(this, iz);
-    }
-    clearCofactor() {
-      const { h: cofactor2 } = CURVE;
-      if (cofactor2 === _1n)
-        return this;
-      return this.multiplyUnsafe(cofactor2);
-    }
-    // Converts hash string or Uint8Array to Point.
-    // Uses algo from RFC8032 5.1.3.
-    static fromHex(hex, zip215 = false) {
-      const { d, a } = CURVE;
-      const len = Fp2.BYTES;
-      hex = ensureBytes("pointHex", hex, len);
-      abool("zip215", zip215);
-      const normed = hex.slice();
-      const lastByte = hex[len - 1];
-      normed[len - 1] = lastByte & ~128;
-      const y = bytesToNumberLE(normed);
-      const max = zip215 ? MASK : Fp2.ORDER;
-      aInRange("pointHex.y", y, _0n, max);
-      const y2 = modP(y * y);
-      const u = modP(y2 - _1n);
-      const v = modP(d * y2 - a);
-      let { isValid, value: x } = uvRatio2(u, v);
-      if (!isValid)
-        throw new Error("Point.fromHex: invalid y coordinate");
-      const isXOdd = (x & _1n) === _1n;
-      const isLastByteOdd = (lastByte & 128) !== 0;
-      if (!zip215 && x === _0n && isLastByteOdd)
-        throw new Error("Point.fromHex: x=0 and x_0=1");
-      if (isLastByteOdd !== isXOdd)
-        x = modP(-x);
-      return Point.fromAffine({ x, y });
-    }
-    static fromPrivateKey(privKey) {
-      return getExtendedPublicKey(privKey).point;
-    }
-    toRawBytes() {
-      const { x, y } = this.toAffine();
-      const bytes = numberToBytesLE(y, Fp2.BYTES);
-      bytes[bytes.length - 1] |= x & _1n ? 128 : 0;
-      return bytes;
-    }
-    toHex() {
-      return bytesToHex(this.toRawBytes());
-    }
-  }
-  Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));
-  Point.ZERO = new Point(_0n, _1n, _1n, _0n);
-  const { BASE: G, ZERO: I } = Point;
-  const wnaf = wNAF(Point, nByteLength * 8);
-  function modN(a) {
-    return mod(a, CURVE_ORDER);
-  }
-  __name(modN, "modN");
-  function modN_LE(hash) {
-    return modN(bytesToNumberLE(hash));
-  }
-  __name(modN_LE, "modN_LE");
-  function getExtendedPublicKey(key) {
-    const len = nByteLength;
-    key = ensureBytes("private key", key, len);
-    const hashed = ensureBytes("hashed private key", cHash(key), 2 * len);
-    const head = adjustScalarBytes2(hashed.slice(0, len));
-    const prefix = hashed.slice(len, 2 * len);
-    const scalar = modN_LE(head);
-    const point = G.multiply(scalar);
-    const pointBytes = point.toRawBytes();
-    return { head, prefix, scalar, point, pointBytes };
-  }
-  __name(getExtendedPublicKey, "getExtendedPublicKey");
-  function getPublicKey(privKey) {
-    return getExtendedPublicKey(privKey).pointBytes;
-  }
-  __name(getPublicKey, "getPublicKey");
-  function hashDomainToScalar(context = new Uint8Array(), ...msgs) {
-    const msg = concatBytes(...msgs);
-    return modN_LE(cHash(domain(msg, ensureBytes("context", context), !!prehash)));
-  }
-  __name(hashDomainToScalar, "hashDomainToScalar");
-  function sign(msg, privKey, options = {}) {
-    msg = ensureBytes("message", msg);
-    if (prehash)
-      msg = prehash(msg);
-    const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);
-    const r = hashDomainToScalar(options.context, prefix, msg);
-    const R = G.multiply(r).toRawBytes();
-    const k = hashDomainToScalar(options.context, R, pointBytes, msg);
-    const s = modN(r + k * scalar);
-    aInRange("signature.s", s, _0n, CURVE_ORDER);
-    const res = concatBytes(R, numberToBytesLE(s, Fp2.BYTES));
-    return ensureBytes("result", res, nByteLength * 2);
-  }
-  __name(sign, "sign");
-  const verifyOpts = VERIFY_DEFAULT;
-  function verify(sig, msg, publicKey, options = verifyOpts) {
-    const { context, zip215 } = options;
-    const len = Fp2.BYTES;
-    sig = ensureBytes("signature", sig, 2 * len);
-    msg = ensureBytes("message", msg);
-    if (zip215 !== void 0)
-      abool("zip215", zip215);
-    if (prehash)
-      msg = prehash(msg);
-    const s = bytesToNumberLE(sig.slice(len, 2 * len));
-    let A, R, SB;
-    try {
-      A = Point.fromHex(publicKey, zip215);
-      R = Point.fromHex(sig.slice(0, len), zip215);
-      SB = G.multiplyUnsafe(s);
-    } catch (error) {
-      return false;
-    }
-    if (!zip215 && A.isSmallOrder())
-      return false;
-    const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);
-    const RkA = R.add(A.multiplyUnsafe(k));
-    return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);
-  }
-  __name(verify, "verify");
-  G._setWindowSize(8);
-  const utils = {
-    getExtendedPublicKey,
-    // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.
-    randomPrivateKey: /* @__PURE__ */ __name(() => randomBytes2(Fp2.BYTES), "randomPrivateKey"),
-    /**
-     * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT
-     * values. This slows down first getPublicKey() by milliseconds (see Speed section),
-     * but allows to speed-up subsequent getPublicKey() calls up to 20x.
-     * @param windowSize 2, 4, 8, 16
-     */
-    precompute(windowSize = 8, point = Point.BASE) {
-      point._setWindowSize(windowSize);
-      point.multiply(BigInt(3));
-      return point;
-    }
-  };
-  return {
-    CURVE,
-    getPublicKey,
-    sign,
-    verify,
-    ExtendedPoint: Point,
-    utils
-  };
-}
-var _0n, _1n, _2n, _8n, VERIFY_DEFAULT;
-var init_edwards = __esm({
-  "../../node_modules/.pnpm/@noble+curves@1.6.0/node_modules/@noble/curves/esm/abstract/edwards.js"() {
-    "use strict";
-    init_curve();
-    init_modular();
-    init_utils2();
-    init_utils2();
-    _0n = BigInt(0);
-    _1n = BigInt(1);
-    _2n = BigInt(2);
-    _8n = BigInt(8);
-    VERIFY_DEFAULT = { zip215: true };
-    __name(validateOpts, "validateOpts");
-    __name(twistedEdwards, "twistedEdwards");
-  }
-});
-
-// ../../node_modules/.pnpm/@noble+curves@1.6.0/node_modules/@noble/curves/esm/ed25519.js
-function ed25519_pow_2_252_3(x) {
-  const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);
-  const P = ED25519_P;
-  const x2 = x * x % P;
-  const b2 = x2 * x % P;
-  const b4 = pow2(b2, _2n2, P) * b2 % P;
-  const b5 = pow2(b4, _1n2, P) * x % P;
-  const b10 = pow2(b5, _5n, P) * b5 % P;
-  const b20 = pow2(b10, _10n, P) * b10 % P;
-  const b40 = pow2(b20, _20n, P) * b20 % P;
-  const b80 = pow2(b40, _40n, P) * b40 % P;
-  const b160 = pow2(b80, _80n, P) * b80 % P;
-  const b240 = pow2(b160, _80n, P) * b80 % P;
-  const b250 = pow2(b240, _10n, P) * b10 % P;
-  const pow_p_5_8 = pow2(b250, _2n2, P) * x % P;
-  return { pow_p_5_8, b2 };
-}
-function adjustScalarBytes(bytes) {
-  bytes[0] &= 248;
-  bytes[31] &= 127;
-  bytes[31] |= 64;
-  return bytes;
-}
-function uvRatio(u, v) {
-  const P = ED25519_P;
-  const v3 = mod(v * v * v, P);
-  const v7 = mod(v3 * v3 * v, P);
-  const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;
-  let x = mod(u * v3 * pow, P);
-  const vx2 = mod(v * x * x, P);
-  const root1 = x;
-  const root2 = mod(x * ED25519_SQRT_M1, P);
-  const useRoot1 = vx2 === u;
-  const useRoot2 = vx2 === mod(-u, P);
-  const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P);
-  if (useRoot1)
-    x = root1;
-  if (useRoot2 || noRoot)
-    x = root2;
-  if (isNegativeLE(x, P))
-    x = mod(-x, P);
-  return { isValid: useRoot1 || useRoot2, value: x };
-}
-var ED25519_P, ED25519_SQRT_M1, _0n2, _1n2, _2n2, _3n, _5n, _8n2, Fp, ed25519Defaults, ed25519;
-var init_ed25519 = __esm({
-  "../../node_modules/.pnpm/@noble+curves@1.6.0/node_modules/@noble/curves/esm/ed25519.js"() {
-    "use strict";
-    init_sha512();
-    init_utils();
-    init_edwards();
-    init_modular();
-    ED25519_P = BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949");
-    ED25519_SQRT_M1 = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
-    _0n2 = BigInt(0);
-    _1n2 = BigInt(1);
-    _2n2 = BigInt(2);
-    _3n = BigInt(3);
-    _5n = BigInt(5);
-    _8n2 = BigInt(8);
-    __name(ed25519_pow_2_252_3, "ed25519_pow_2_252_3");
-    __name(adjustScalarBytes, "adjustScalarBytes");
-    __name(uvRatio, "uvRatio");
-    Fp = /* @__PURE__ */ (() => Field(ED25519_P, void 0, true))();
-    ed25519Defaults = /* @__PURE__ */ (() => ({
-      // Param: a
-      a: BigInt(-1),
-      // Fp.create(-1) is proper; our way still works and is faster
-      // d is equal to -121665/121666 over finite field.
-      // Negative number is P - number, and division is invert(number, P)
-      d: BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),
-      // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n
-      Fp,
-      // Subgroup order: how many points curve has
-      // 2n**252n + 27742317777372353535851937790883648493n;
-      n: BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),
-      // Cofactor
-      h: _8n2,
-      // Base point (x, y) aka generator point
-      Gx: BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),
-      Gy: BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),
-      hash: sha512,
-      randomBytes,
-      adjustScalarBytes,
-      // dom2
-      // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.
-      // Constant-time, u/√v
-      uvRatio
-    }))();
-    ed25519 = /* @__PURE__ */ (() => twistedEdwards(ed25519Defaults))();
-  }
-});
-
-// ../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.js
-var require_eventemitter3 = __commonJS({
-  "../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.js"(exports, module) {
-    "use strict";
-    var has = Object.prototype.hasOwnProperty;
-    var prefix = "~";
-    function Events() {
-    }
-    __name(Events, "Events");
-    if (Object.create) {
-      Events.prototype = /* @__PURE__ */ Object.create(null);
-      if (!new Events().__proto__) prefix = false;
-    }
-    function EE(fn, context, once) {
-      this.fn = fn;
-      this.context = context;
-      this.once = once || false;
-    }
-    __name(EE, "EE");
-    function addListener(emitter, event, fn, context, once) {
-      if (typeof fn !== "function") {
-        throw new TypeError("The listener must be a function");
-      }
-      var listener = new EE(fn, context || emitter, once), evt = prefix ? prefix + event : event;
-      if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;
-      else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);
-      else emitter._events[evt] = [emitter._events[evt], listener];
-      return emitter;
-    }
-    __name(addListener, "addListener");
-    function clearEvent(emitter, evt) {
-      if (--emitter._eventsCount === 0) emitter._events = new Events();
-      else delete emitter._events[evt];
-    }
-    __name(clearEvent, "clearEvent");
-    function EventEmitter2() {
-      this._events = new Events();
-      this._eventsCount = 0;
-    }
-    __name(EventEmitter2, "EventEmitter");
-    EventEmitter2.prototype.eventNames = /* @__PURE__ */ __name(function eventNames() {
-      var names = [], events, name;
-      if (this._eventsCount === 0) return names;
-      for (name in events = this._events) {
-        if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);
-      }
-      if (Object.getOwnPropertySymbols) {
-        return names.concat(Object.getOwnPropertySymbols(events));
-      }
-      return names;
-    }, "eventNames");
-    EventEmitter2.prototype.listeners = /* @__PURE__ */ __name(function listeners(event) {
-      var evt = prefix ? prefix + event : event, handlers = this._events[evt];
-      if (!handlers) return [];
-      if (handlers.fn) return [handlers.fn];
-      for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {
-        ee[i] = handlers[i].fn;
-      }
-      return ee;
-    }, "listeners");
-    EventEmitter2.prototype.listenerCount = /* @__PURE__ */ __name(function listenerCount(event) {
-      var evt = prefix ? prefix + event : event, listeners = this._events[evt];
-      if (!listeners) return 0;
-      if (listeners.fn) return 1;
-      return listeners.length;
-    }, "listenerCount");
-    EventEmitter2.prototype.emit = /* @__PURE__ */ __name(function emit(event, a1, a2, a3, a4, a5) {
-      var evt = prefix ? prefix + event : event;
-      if (!this._events[evt]) return false;
-      var listeners = this._events[evt], len = arguments.length, args, i;
-      if (listeners.fn) {
-        if (listeners.once) this.removeListener(event, listeners.fn, void 0, true);
-        switch (len) {
-          case 1:
-            return listeners.fn.call(listeners.context), true;
-          case 2:
-            return listeners.fn.call(listeners.context, a1), true;
-          case 3:
-            return listeners.fn.call(listeners.context, a1, a2), true;
-          case 4:
-            return listeners.fn.call(listeners.context, a1, a2, a3), true;
-          case 5:
-            return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;
-          case 6:
-            return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;
-        }
-        for (i = 1, args = new Array(len - 1); i < len; i++) {
-          args[i - 1] = arguments[i];
-        }
-        listeners.fn.apply(listeners.context, args);
-      } else {
-        var length = listeners.length, j;
-        for (i = 0; i < length; i++) {
-          if (listeners[i].once) this.removeListener(event, listeners[i].fn, void 0, true);
-          switch (len) {
-            case 1:
-              listeners[i].fn.call(listeners[i].context);
-              break;
-            case 2:
-              listeners[i].fn.call(listeners[i].context, a1);
-              break;
-            case 3:
-              listeners[i].fn.call(listeners[i].context, a1, a2);
-              break;
-            case 4:
-              listeners[i].fn.call(listeners[i].context, a1, a2, a3);
-              break;
-            default:
-              if (!args) for (j = 1, args = new Array(len - 1); j < len; j++) {
-                args[j - 1] = arguments[j];
-              }
-              listeners[i].fn.apply(listeners[i].context, args);
-          }
-        }
-      }
-      return true;
-    }, "emit");
-    EventEmitter2.prototype.on = /* @__PURE__ */ __name(function on(event, fn, context) {
-      return addListener(this, event, fn, context, false);
-    }, "on");
-    EventEmitter2.prototype.once = /* @__PURE__ */ __name(function once(event, fn, context) {
-      return addListener(this, event, fn, context, true);
-    }, "once");
-    EventEmitter2.prototype.removeListener = /* @__PURE__ */ __name(function removeListener(event, fn, context, once) {
-      var evt = prefix ? prefix + event : event;
-      if (!this._events[evt]) return this;
-      if (!fn) {
-        clearEvent(this, evt);
-        return this;
-      }
-      var listeners = this._events[evt];
-      if (listeners.fn) {
-        if (listeners.fn === fn && (!once || listeners.once) && (!context || listeners.context === context)) {
-          clearEvent(this, evt);
-        }
-      } else {
-        for (var i = 0, events = [], length = listeners.length; i < length; i++) {
-          if (listeners[i].fn !== fn || once && !listeners[i].once || context && listeners[i].context !== context) {
-            events.push(listeners[i]);
-          }
-        }
-        if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;
-        else clearEvent(this, evt);
-      }
-      return this;
-    }, "removeListener");
-    EventEmitter2.prototype.removeAllListeners = /* @__PURE__ */ __name(function removeAllListeners(event) {
-      var evt;
-      if (event) {
-        evt = prefix ? prefix + event : event;
-        if (this._events[evt]) clearEvent(this, evt);
-      } else {
-        this._events = new Events();
-        this._eventsCount = 0;
-      }
-      return this;
-    }, "removeAllListeners");
-    EventEmitter2.prototype.off = EventEmitter2.prototype.removeListener;
-    EventEmitter2.prototype.addListener = EventEmitter2.prototype.on;
-    EventEmitter2.prefixed = prefix;
-    EventEmitter2.EventEmitter = EventEmitter2;
-    if ("undefined" !== typeof module) {
-      module.exports = EventEmitter2;
-    }
-  }
-});
-
-// ../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.mjs
-var import_index, eventemitter3_default;
-var init_eventemitter3 = __esm({
-  "../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.mjs"() {
-    "use strict";
-    import_index = __toESM(require_eventemitter3(), 1);
-    eventemitter3_default = import_index.default;
-  }
-});
-
-export {
-  sha512,
-  init_sha512,
-  ed25519,
-  init_ed25519,
-  import_index,
-  eventemitter3_default,
-  init_eventemitter3
-};
-/*! Bundled license information:
-
-@noble/curves/esm/abstract/edwards.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/ed25519.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-*/
-//# sourceMappingURL=chunk-UIBPOKNT.js.map