@ozdao/prometheus-framework 0.2.128 → 0.2.130

package/dist/node_modules/@noble/curves/esm/abstract/weierstrass.js

@@ -1,581 +0,0 @@
-import { mod as lt, getMinHashLength as ht, mapHashToField as mt, invert as pt } from "./modular.js";
-import * as yt from "./utils.js";
-import { bytesToNumberBE as _, bitMask as wt, concatBytes as rt, validateObject as ft, ensureBytes as Y, hexToBytes as at, createHmacDrbg as Et, isBytes as tt, bytesToHex as nt, numberToBytesBE as ct } from "./utils.js";
-import { wNAF as gt, validateBasic as dt } from "./curve.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function bt(B) {
-  const n = dt(B);
-  ft(n, {
-    a: "field",
-    b: "field"
-  }, {
-    allowedPrivateKeyLengths: "array",
-    wrapPrivateKey: "boolean",
-    isTorsionFree: "function",
-    clearCofactor: "function",
-    allowInfinityPoint: "boolean",
-    fromBytes: "function",
-    toBytes: "function"
-  });
-  const { endo: t, Fp: v, a: A } = n;
-  if (t) {
-    if (!v.eql(A, v.ZERO))
-      throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");
-    if (typeof t != "object" || typeof t.beta != "bigint" || typeof t.splitScalar != "function")
-      throw new Error("Expected endomorphism with beta: bigint and splitScalar: function");
-  }
-  return Object.freeze({ ...n });
-}
-const { bytesToNumberBE: Bt, hexToBytes: vt } = yt, k = {
-  // asn.1 DER encoding utils
-  Err: class extends Error {
-    constructor(n = "") {
-      super(n);
-    }
-  },
-  _parseInt(B) {
-    const { Err: n } = k;
-    if (B.length < 2 || B[0] !== 2)
-      throw new n("Invalid signature integer tag");
-    const t = B[1], v = B.subarray(2, t + 2);
-    if (!t || v.length !== t)
-      throw new n("Invalid signature integer: wrong length");
-    if (v[0] & 128)
-      throw new n("Invalid signature integer: negative");
-    if (v[0] === 0 && !(v[1] & 128))
-      throw new n("Invalid signature integer: unnecessary leading zero");
-    return { d: Bt(v), l: B.subarray(t + 2) };
-  },
-  toSig(B) {
-    const { Err: n } = k, t = typeof B == "string" ? vt(B) : B;
-    if (!tt(t))
-      throw new Error("ui8a expected");
-    let v = t.length;
-    if (v < 2 || t[0] != 48)
-      throw new n("Invalid signature tag");
-    if (t[1] !== v - 2)
-      throw new n("Invalid signature: incorrect length");
-    const { d: A, l: O } = k._parseInt(t.subarray(2)), { d: C, l: S } = k._parseInt(O);
-    if (S.length)
-      throw new n("Invalid signature: left bytes after parsing");
-    return { r: A, s: C };
-  },
-  hexFromSig(B) {
-    const n = (x) => Number.parseInt(x[0], 16) & 8 ? "00" + x : x, t = (x) => {
-      const F = x.toString(16);
-      return F.length & 1 ? `0${F}` : F;
-    }, v = n(t(B.s)), A = n(t(B.r)), O = v.length / 2, C = A.length / 2, S = t(O), H = t(C);
-    return `30${t(C + O + 4)}02${H}${A}02${S}${v}`;
-  }
-}, L = BigInt(0), z = BigInt(1);
-BigInt(2);
-const ut = BigInt(3);
-BigInt(4);
-function xt(B) {
-  const n = bt(B), { Fp: t } = n, v = n.toBytes || ((m, r, i) => {
-    const s = r.toAffine();
-    return rt(Uint8Array.from([4]), t.toBytes(s.x), t.toBytes(s.y));
-  }), A = n.fromBytes || ((m) => {
-    const r = m.subarray(1), i = t.fromBytes(r.subarray(0, t.BYTES)), s = t.fromBytes(r.subarray(t.BYTES, 2 * t.BYTES));
-    return { x: i, y: s };
-  });
-  function O(m) {
-    const { a: r, b: i } = n, s = t.sqr(m), u = t.mul(s, m);
-    return t.add(t.add(u, t.mul(m, r)), i);
-  }
-  if (!t.eql(t.sqr(n.Gy), O(n.Gx)))
-    throw new Error("bad generator point: equation left != right");
-  function C(m) {
-    return typeof m == "bigint" && L < m && m < n.n;
-  }
-  function S(m) {
-    if (!C(m))
-      throw new Error("Expected valid bigint: 0 < bigint < curve.n");
-  }
-  function H(m) {
-    const { allowedPrivateKeyLengths: r, nByteLength: i, wrapPrivateKey: s, n: u } = n;
-    if (r && typeof m != "bigint") {
-      if (tt(m) && (m = nt(m)), typeof m != "string" || !r.includes(m.length))
-        throw new Error("Invalid key");
-      m = m.padStart(i * 2, "0");
-    }
-    let f;
-    try {
-      f = typeof m == "bigint" ? m : _(Y("private key", m, i));
-    } catch {
-      throw new Error(`private key must be ${i} bytes, hex or bigint, not ${typeof m}`);
-    }
-    return s && (f = lt(f, u)), S(f), f;
-  }
-  const x = /* @__PURE__ */ new Map();
-  function F(m) {
-    if (!(m instanceof p))
-      throw new Error("ProjectivePoint expected");
-  }
-  class p {
-    constructor(r, i, s) {
-      if (this.px = r, this.py = i, this.pz = s, r == null || !t.isValid(r))
-        throw new Error("x required");
-      if (i == null || !t.isValid(i))
-        throw new Error("y required");
-      if (s == null || !t.isValid(s))
-        throw new Error("z required");
-    }
-    // Does not validate if the point is on-curve.
-    // Use fromHex instead, or call assertValidity() later.
-    static fromAffine(r) {
-      const { x: i, y: s } = r || {};
-      if (!r || !t.isValid(i) || !t.isValid(s))
-        throw new Error("invalid affine point");
-      if (r instanceof p)
-        throw new Error("projective point not allowed");
-      const u = (f) => t.eql(f, t.ZERO);
-      return u(i) && u(s) ? p.ZERO : new p(i, s, t.ONE);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    /**
-     * Takes a bunch of Projective Points but executes only one
-     * inversion on all of them. Inversion is very slow operation,
-     * so this improves performance massively.
-     * Optimization: converts a list of projective points to a list of identical points with Z=1.
-     */
-    static normalizeZ(r) {
-      const i = t.invertBatch(r.map((s) => s.pz));
-      return r.map((s, u) => s.toAffine(i[u])).map(p.fromAffine);
-    }
-    /**
-     * Converts hash string or Uint8Array to Point.
-     * @param hex short/long ECDSA hex
-     */
-    static fromHex(r) {
-      const i = p.fromAffine(A(Y("pointHex", r)));
-      return i.assertValidity(), i;
-    }
-    // Multiplies generator point by privateKey.
-    static fromPrivateKey(r) {
-      return p.BASE.multiply(H(r));
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(r) {
-      this._WINDOW_SIZE = r, x.delete(this);
-    }
-    // A point on curve is valid if it conforms to equation.
-    assertValidity() {
-      if (this.is0()) {
-        if (n.allowInfinityPoint && !t.is0(this.py))
-          return;
-        throw new Error("bad point: ZERO");
-      }
-      const { x: r, y: i } = this.toAffine();
-      if (!t.isValid(r) || !t.isValid(i))
-        throw new Error("bad point: x or y not FE");
-      const s = t.sqr(i), u = O(r);
-      if (!t.eql(s, u))
-        throw new Error("bad point: equation left != right");
-      if (!this.isTorsionFree())
-        throw new Error("bad point: not in prime-order subgroup");
-    }
-    hasEvenY() {
-      const { y: r } = this.toAffine();
-      if (t.isOdd)
-        return !t.isOdd(r);
-      throw new Error("Field doesn't support isOdd");
-    }
-    /**
-     * Compare one point to another.
-     */
-    equals(r) {
-      F(r);
-      const { px: i, py: s, pz: u } = this, { px: f, py: E, pz: h } = r, a = t.eql(t.mul(i, h), t.mul(f, u)), c = t.eql(t.mul(s, h), t.mul(E, u));
-      return a && c;
-    }
-    /**
-     * Flips point to one corresponding to (x, -y) in Affine coordinates.
-     */
-    negate() {
-      return new p(this.px, t.neg(this.py), this.pz);
-    }
-    // Renes-Costello-Batina exception-free doubling formula.
-    // There is 30% faster Jacobian formula, but it is not complete.
-    // https://eprint.iacr.org/2015/1060, algorithm 3
-    // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
-    double() {
-      const { a: r, b: i } = n, s = t.mul(i, ut), { px: u, py: f, pz: E } = this;
-      let h = t.ZERO, a = t.ZERO, c = t.ZERO, d = t.mul(u, u), q = t.mul(f, f), b = t.mul(E, E), y = t.mul(u, f);
-      return y = t.add(y, y), c = t.mul(u, E), c = t.add(c, c), h = t.mul(r, c), a = t.mul(s, b), a = t.add(h, a), h = t.sub(q, a), a = t.add(q, a), a = t.mul(h, a), h = t.mul(y, h), c = t.mul(s, c), b = t.mul(r, b), y = t.sub(d, b), y = t.mul(r, y), y = t.add(y, c), c = t.add(d, d), d = t.add(c, d), d = t.add(d, b), d = t.mul(d, y), a = t.add(a, d), b = t.mul(f, E), b = t.add(b, b), d = t.mul(b, y), h = t.sub(h, d), c = t.mul(b, q), c = t.add(c, c), c = t.add(c, c), new p(h, a, c);
-    }
-    // Renes-Costello-Batina exception-free addition formula.
-    // There is 30% faster Jacobian formula, but it is not complete.
-    // https://eprint.iacr.org/2015/1060, algorithm 1
-    // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
-    add(r) {
-      F(r);
-      const { px: i, py: s, pz: u } = this, { px: f, py: E, pz: h } = r;
-      let a = t.ZERO, c = t.ZERO, d = t.ZERO;
-      const q = n.a, b = t.mul(n.b, ut);
-      let y = t.mul(i, f), T = t.mul(s, E), Z = t.mul(u, h), U = t.add(i, s), e = t.add(f, E);
-      U = t.mul(U, e), e = t.add(y, T), U = t.sub(U, e), e = t.add(i, u);
-      let o = t.add(f, h);
-      return e = t.mul(e, o), o = t.add(y, Z), e = t.sub(e, o), o = t.add(s, u), a = t.add(E, h), o = t.mul(o, a), a = t.add(T, Z), o = t.sub(o, a), d = t.mul(q, e), a = t.mul(b, Z), d = t.add(a, d), a = t.sub(T, d), d = t.add(T, d), c = t.mul(a, d), T = t.add(y, y), T = t.add(T, y), Z = t.mul(q, Z), e = t.mul(b, e), T = t.add(T, Z), Z = t.sub(y, Z), Z = t.mul(q, Z), e = t.add(e, Z), y = t.mul(T, e), c = t.add(c, y), y = t.mul(o, e), a = t.mul(U, a), a = t.sub(a, y), y = t.mul(U, T), d = t.mul(o, d), d = t.add(d, y), new p(a, c, d);
-    }
-    subtract(r) {
-      return this.add(r.negate());
-    }
-    is0() {
-      return this.equals(p.ZERO);
-    }
-    wNAF(r) {
-      return P.wNAFCached(this, x, r, (i) => {
-        const s = t.invertBatch(i.map((u) => u.pz));
-        return i.map((u, f) => u.toAffine(s[f])).map(p.fromAffine);
-      });
-    }
-    /**
-     * 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, which works over *public* keys.
-     */
-    multiplyUnsafe(r) {
-      const i = p.ZERO;
-      if (r === L)
-        return i;
-      if (S(r), r === z)
-        return this;
-      const { endo: s } = n;
-      if (!s)
-        return P.unsafeLadder(this, r);
-      let { k1neg: u, k1: f, k2neg: E, k2: h } = s.splitScalar(r), a = i, c = i, d = this;
-      for (; f > L || h > L; )
-        f & z && (a = a.add(d)), h & z && (c = c.add(d)), d = d.double(), f >>= z, h >>= z;
-      return u && (a = a.negate()), E && (c = c.negate()), c = new p(t.mul(c.px, s.beta), c.py, c.pz), a.add(c);
-    }
-    /**
-     * Constant time multiplication.
-     * Uses wNAF method. Windowed method may be 10% faster,
-     * but takes 2x longer to generate and consumes 2x memory.
-     * Uses precomputes when available.
-     * Uses endomorphism for Koblitz curves.
-     * @param scalar by which the point would be multiplied
-     * @returns New point
-     */
-    multiply(r) {
-      S(r);
-      let i = r, s, u;
-      const { endo: f } = n;
-      if (f) {
-        const { k1neg: E, k1: h, k2neg: a, k2: c } = f.splitScalar(i);
-        let { p: d, f: q } = this.wNAF(h), { p: b, f: y } = this.wNAF(c);
-        d = P.constTimeNegate(E, d), b = P.constTimeNegate(a, b), b = new p(t.mul(b.px, f.beta), b.py, b.pz), s = d.add(b), u = q.add(y);
-      } else {
-        const { p: E, f: h } = this.wNAF(i);
-        s = E, u = h;
-      }
-      return p.normalizeZ([s, u])[0];
-    }
-    /**
-     * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
-     * Not using Strauss-Shamir trick: precomputation tables are faster.
-     * The trick could be useful if both P and Q are not G (not in our case).
-     * @returns non-zero affine point
-     */
-    multiplyAndAddUnsafe(r, i, s) {
-      const u = p.BASE, f = (h, a) => a === L || a === z || !h.equals(u) ? h.multiplyUnsafe(a) : h.multiply(a), E = f(this, i).add(f(r, s));
-      return E.is0() ? void 0 : E;
-    }
-    // Converts Projective point to affine (x, y) coordinates.
-    // Can accept precomputed Z^-1 - for example, from invertBatch.
-    // (x, y, z) ∋ (x=x/z, y=y/z)
-    toAffine(r) {
-      const { px: i, py: s, pz: u } = this, f = this.is0();
-      r == null && (r = f ? t.ONE : t.inv(u));
-      const E = t.mul(i, r), h = t.mul(s, r), a = t.mul(u, r);
-      if (f)
-        return { x: t.ZERO, y: t.ZERO };
-      if (!t.eql(a, t.ONE))
-        throw new Error("invZ was invalid");
-      return { x: E, y: h };
-    }
-    isTorsionFree() {
-      const { h: r, isTorsionFree: i } = n;
-      if (r === z)
-        return !0;
-      if (i)
-        return i(p, this);
-      throw new Error("isTorsionFree() has not been declared for the elliptic curve");
-    }
-    clearCofactor() {
-      const { h: r, clearCofactor: i } = n;
-      return r === z ? this : i ? i(p, this) : this.multiplyUnsafe(n.h);
-    }
-    toRawBytes(r = !0) {
-      return this.assertValidity(), v(p, this, r);
-    }
-    toHex(r = !0) {
-      return nt(this.toRawBytes(r));
-    }
-  }
-  p.BASE = new p(n.Gx, n.Gy, t.ONE), p.ZERO = new p(t.ZERO, t.ONE, t.ZERO);
-  const W = n.nBitLength, P = gt(p, n.endo ? Math.ceil(W / 2) : W);
-  return {
-    CURVE: n,
-    ProjectivePoint: p,
-    normPrivateKeyToScalar: H,
-    weierstrassEquation: O,
-    isWithinCurveOrder: C
-  };
-}
-function St(B) {
-  const n = dt(B);
-  return ft(n, {
-    hash: "hash",
-    hmac: "function",
-    randomBytes: "function"
-  }, {
-    bits2int: "function",
-    bits2int_modN: "function",
-    lowS: "boolean"
-  }), Object.freeze({ lowS: !0, ...n });
-}
-function Zt(B) {
-  const n = St(B), { Fp: t, n: v } = n, A = t.BYTES + 1, O = 2 * t.BYTES + 1;
-  function C(e) {
-    return L < e && e < t.ORDER;
-  }
-  function S(e) {
-    return lt(e, v);
-  }
-  function H(e) {
-    return pt(e, v);
-  }
-  const { ProjectivePoint: x, normPrivateKeyToScalar: F, weierstrassEquation: p, isWithinCurveOrder: W } = xt({
-    ...n,
-    toBytes(e, o, l) {
-      const g = o.toAffine(), w = t.toBytes(g.x), R = rt;
-      return l ? R(Uint8Array.from([o.hasEvenY() ? 2 : 3]), w) : R(Uint8Array.from([4]), w, t.toBytes(g.y));
-    },
-    fromBytes(e) {
-      const o = e.length, l = e[0], g = e.subarray(1);
-      if (o === A && (l === 2 || l === 3)) {
-        const w = _(g);
-        if (!C(w))
-          throw new Error("Point is not on curve");
-        const R = p(w);
-        let I = t.sqrt(R);
-        const N = (I & z) === z;
-        return (l & 1) === 1 !== N && (I = t.neg(I)), { x: w, y: I };
-      } else if (o === O && l === 4) {
-        const w = t.fromBytes(g.subarray(0, t.BYTES)), R = t.fromBytes(g.subarray(t.BYTES, 2 * t.BYTES));
-        return { x: w, y: R };
-      } else
-        throw new Error(`Point of length ${o} was invalid. Expected ${A} compressed bytes or ${O} uncompressed bytes`);
-    }
-  }), P = (e) => nt(ct(e, n.nByteLength));
-  function m(e) {
-    const o = v >> z;
-    return e > o;
-  }
-  function r(e) {
-    return m(e) ? S(-e) : e;
-  }
-  const i = (e, o, l) => _(e.slice(o, l));
-  class s {
-    constructor(o, l, g) {
-      this.r = o, this.s = l, this.recovery = g, this.assertValidity();
-    }
-    // pair (bytes of r, bytes of s)
-    static fromCompact(o) {
-      const l = n.nByteLength;
-      return o = Y("compactSignature", o, l * 2), new s(i(o, 0, l), i(o, l, 2 * l));
-    }
-    // DER encoded ECDSA signature
-    // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-    static fromDER(o) {
-      const { r: l, s: g } = k.toSig(Y("DER", o));
-      return new s(l, g);
-    }
-    assertValidity() {
-      if (!W(this.r))
-        throw new Error("r must be 0 < r < CURVE.n");
-      if (!W(this.s))
-        throw new Error("s must be 0 < s < CURVE.n");
-    }
-    addRecoveryBit(o) {
-      return new s(this.r, this.s, o);
-    }
-    recoverPublicKey(o) {
-      const { r: l, s: g, recovery: w } = this, R = c(Y("msgHash", o));
-      if (w == null || ![0, 1, 2, 3].includes(w))
-        throw new Error("recovery id invalid");
-      const I = w === 2 || w === 3 ? l + n.n : l;
-      if (I >= t.ORDER)
-        throw new Error("recovery id 2 or 3 invalid");
-      const N = w & 1 ? "03" : "02", D = x.fromHex(N + P(I)), K = H(I), X = S(-R * K), J = S(g * K), $ = x.BASE.multiplyAndAddUnsafe(D, X, J);
-      if (!$)
-        throw new Error("point at infinify");
-      return $.assertValidity(), $;
-    }
-    // Signatures should be low-s, to prevent malleability.
-    hasHighS() {
-      return m(this.s);
-    }
-    normalizeS() {
-      return this.hasHighS() ? new s(this.r, S(-this.s), this.recovery) : this;
-    }
-    // DER-encoded
-    toDERRawBytes() {
-      return at(this.toDERHex());
-    }
-    toDERHex() {
-      return k.hexFromSig({ r: this.r, s: this.s });
-    }
-    // padded bytes of r, then padded bytes of s
-    toCompactRawBytes() {
-      return at(this.toCompactHex());
-    }
-    toCompactHex() {
-      return P(this.r) + P(this.s);
-    }
-  }
-  const u = {
-    isValidPrivateKey(e) {
-      try {
-        return F(e), !0;
-      } catch {
-        return !1;
-      }
-    },
-    normPrivateKeyToScalar: F,
-    /**
-     * Produces cryptographically secure private key from random of size
-     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
-     */
-    randomPrivateKey: () => {
-      const e = ht(n.n);
-      return mt(n.randomBytes(e), n.n);
-    },
-    /**
-     * Creates precompute table for an arbitrary EC point. Makes point "cached".
-     * Allows to massively speed-up `point.multiply(scalar)`.
-     * @returns cached point
-     * @example
-     * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
-     * fast.multiply(privKey); // much faster ECDH now
-     */
-    precompute(e = 8, o = x.BASE) {
-      return o._setWindowSize(e), o.multiply(BigInt(3)), o;
-    }
-  };
-  function f(e, o = !0) {
-    return x.fromPrivateKey(e).toRawBytes(o);
-  }
-  function E(e) {
-    const o = tt(e), l = typeof e == "string", g = (o || l) && e.length;
-    return o ? g === A || g === O : l ? g === 2 * A || g === 2 * O : e instanceof x;
-  }
-  function h(e, o, l = !0) {
-    if (E(e))
-      throw new Error("first arg must be private key");
-    if (!E(o))
-      throw new Error("second arg must be public key");
-    return x.fromHex(o).multiply(F(e)).toRawBytes(l);
-  }
-  const a = n.bits2int || function(e) {
-    const o = _(e), l = e.length * 8 - n.nBitLength;
-    return l > 0 ? o >> BigInt(l) : o;
-  }, c = n.bits2int_modN || function(e) {
-    return S(a(e));
-  }, d = wt(n.nBitLength);
-  function q(e) {
-    if (typeof e != "bigint")
-      throw new Error("bigint expected");
-    if (!(L <= e && e < d))
-      throw new Error(`bigint expected < 2^${n.nBitLength}`);
-    return ct(e, n.nByteLength);
-  }
-  function b(e, o, l = y) {
-    if (["recovered", "canonical"].some((j) => j in l))
-      throw new Error("sign() legacy options not supported");
-    const { hash: g, randomBytes: w } = n;
-    let { lowS: R, prehash: I, extraEntropy: N } = l;
-    R == null && (R = !0), e = Y("msgHash", e), I && (e = Y("prehashed msgHash", g(e)));
-    const D = c(e), K = F(o), X = [q(K), q(D)];
-    if (N != null) {
-      const j = N === !0 ? w(t.BYTES) : N;
-      X.push(Y("extraEntropy", j));
-    }
-    const J = rt(...X), $ = D;
-    function et(j) {
-      const G = a(j);
-      if (!W(G))
-        return;
-      const ot = H(G), M = x.BASE.multiply(G).toAffine(), V = S(M.x);
-      if (V === L)
-        return;
-      const Q = S(ot * S($ + V * K));
-      if (Q === L)
-        return;
-      let st = (M.x === V ? 0 : 2) | Number(M.y & z), it = Q;
-      return R && m(Q) && (it = r(Q), st ^= 1), new s(V, it, st);
-    }
-    return { seed: J, k2sig: et };
-  }
-  const y = { lowS: n.lowS, prehash: !1 }, T = { lowS: n.lowS, prehash: !1 };
-  function Z(e, o, l = y) {
-    const { seed: g, k2sig: w } = b(e, o, l), R = n;
-    return Et(R.hash.outputLen, R.nByteLength, R.hmac)(g, w);
-  }
-  x.BASE._setWindowSize(8);
-  function U(e, o, l, g = T) {
-    var M;
-    const w = e;
-    if (o = Y("msgHash", o), l = Y("publicKey", l), "strict" in g)
-      throw new Error("options.strict was renamed to lowS");
-    const { lowS: R, prehash: I } = g;
-    let N, D;
-    try {
-      if (typeof w == "string" || tt(w))
-        try {
-          N = s.fromDER(w);
-        } catch (V) {
-          if (!(V instanceof k.Err))
-            throw V;
-          N = s.fromCompact(w);
-        }
-      else if (typeof w == "object" && typeof w.r == "bigint" && typeof w.s == "bigint") {
-        const { r: V, s: Q } = w;
-        N = new s(V, Q);
-      } else
-        throw new Error("PARSE");
-      D = x.fromHex(l);
-    } catch (V) {
-      if (V.message === "PARSE")
-        throw new Error("signature must be Signature instance, Uint8Array or hex string");
-      return !1;
-    }
-    if (R && N.hasHighS())
-      return !1;
-    I && (o = n.hash(o));
-    const { r: K, s: X } = N, J = c(o), $ = H(X), et = S(J * $), j = S(K * $), G = (M = x.BASE.multiplyAndAddUnsafe(D, et, j)) == null ? void 0 : M.toAffine();
-    return G ? S(G.x) === K : !1;
-  }
-  return {
-    CURVE: n,
-    getPublicKey: f,
-    getSharedSecret: h,
-    sign: Z,
-    verify: U,
-    ProjectivePoint: x,
-    Signature: s,
-    utils: u
-  };
-}
-export {
-  k as DER,
-  Zt as weierstrass,
-  xt as weierstrassPoints
-};

package/dist/node_modules/@noble/curves/esm/secp256k1.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const C=require("../../hashes/esm/sha256.cjs"),n=require("./abstract/modular.cjs"),F=require("./_shortw_utils.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const k=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),x=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),G=BigInt(1),w=BigInt(2),h=(t,f)=>(t+f/w)/f;function M(t){const f=k,e=BigInt(3),r=BigInt(6),B=BigInt(11),a=BigInt(22),s=BigInt(23),i=BigInt(44),d=BigInt(88),o=t*t*t%f,c=o*o*t%f,g=n.pow2(c,e,f)*c%f,b=n.pow2(g,e,f)*c%f,l=n.pow2(b,w,f)*o%f,I=n.pow2(l,B,f)*l%f,p=n.pow2(I,a,f)*I%f,_=n.pow2(p,i,f)*p%f,P=n.pow2(_,d,f)*_%f,S=n.pow2(P,i,f)*p%f,v=n.pow2(S,e,f)*c%f,E=n.pow2(v,s,f)*I%f,j=n.pow2(E,r,f)*o%f,q=n.pow2(j,w,f);if(!u.eql(u.sqr(q),t))throw new Error("Cannot find square root");return q}const u=n.Field(k,void 0,void 0,{sqrt:M}),m=F.createCurve({a:BigInt(0),b:BigInt(7),Fp:u,n:x,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const f=x,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-G*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),B=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),a=e,s=BigInt("0x100000000000000000000000000000000"),i=h(a*t,f),d=h(-r*t,f);let o=n.mod(t-i*e-d*B,f),c=n.mod(-i*r-d*a,f);const g=o>s,b=c>s;if(g&&(o=f-o),b&&(c=f-c),o>s||c>s)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:g,k1:o,k2neg:b,k2:c}}}},C.sha256);BigInt(0);m.ProjectivePoint;exports.secp256k1=m;

package/dist/node_modules/@noble/curves/esm/secp256k1.js

@@ -1,50 +0,0 @@
-import { sha256 as F } from "../../hashes/esm/sha256.js";
-import { Field as G, mod as w, pow2 as t } from "./abstract/modular.js";
-import { createCurve as N } from "./_shortw_utils.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const q = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), h = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), j = BigInt(1), _ = BigInt(2), k = (n, f) => (n + f / _) / f;
-function M(n) {
-  const f = q, e = BigInt(3), r = BigInt(6), I = BigInt(11), a = BigInt(22), s = BigInt(23), i = BigInt(44), g = BigInt(88), o = n * n * n % f, c = o * o * n % f, d = t(c, e, f) * c % f, B = t(d, e, f) * c % f, m = t(B, _, f) * o % f, b = t(m, I, f) * m % f, p = t(b, a, f) * b % f, x = t(p, i, f) * p % f, P = t(x, g, f) * x % f, v = t(P, i, f) * p % f, E = t(v, e, f) * c % f, S = t(E, s, f) * b % f, C = t(S, r, f) * o % f, u = t(C, _, f);
-  if (!l.eql(l.sqr(u), n))
-    throw new Error("Cannot find square root");
-  return u;
-}
-const l = G(q, void 0, void 0, { sqrt: M }), O = N({
-  a: BigInt(0),
-  // equation params: a, b
-  b: BigInt(7),
-  // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975
-  Fp: l,
-  // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n
-  n: h,
-  // Curve order, total count of valid points in the field
-  // Base point (x, y) aka generator point
-  Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
-  Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
-  h: BigInt(1),
-  // Cofactor
-  lowS: !0,
-  // Allow only low-S signatures by default in sign() and verify()
-  /**
-   * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.
-   * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.
-   * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.
-   * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066
-   */
-  endo: {
-    beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-    splitScalar: (n) => {
-      const f = h, e = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -j * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), I = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), a = e, s = BigInt("0x100000000000000000000000000000000"), i = k(a * n, f), g = k(-r * n, f);
-      let o = w(n - i * e - g * I, f), c = w(-i * r - g * a, f);
-      const d = o > s, B = c > s;
-      if (d && (o = f - o), B && (c = f - c), o > s || c > s)
-        throw new Error("splitScalar: Endomorphism failed, k=" + n);
-      return { k1neg: d, k1: o, k2neg: B, k2: c };
-    }
-  }
-}, F);
-BigInt(0);
-O.ProjectivePoint;
-export {
-  O as secp256k1
-};

package/dist/node_modules/@noble/hashes/esm/_assert.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});function o(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`Wrong positive integer: ${e}`)}function i(e){if(typeof e!="boolean")throw new Error(`Expected boolean, not ${e}`)}function c(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function r(e,...t){if(!c(e))throw new Error("Expected Uint8Array");if(t.length>0&&!t.includes(e.length))throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`)}function u(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");o(e.outputLen),o(e.blockLen)}function s(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function f(e,t){r(e);const n=t.outputLen;if(e.length<n)throw new Error(`digestInto() expects output buffer of length at least ${n}`)}const l={number:o,bool:i,bytes:r,hash:u,exists:s,output:f};exports.bool=i;exports.bytes=r;exports.default=l;exports.exists=s;exports.hash=u;exports.number=o;exports.output=f;

package/dist/node_modules/@noble/hashes/esm/_assert.js

@@ -1,44 +0,0 @@
-function r(t) {
-  if (!Number.isSafeInteger(t) || t < 0)
-    throw new Error(`Wrong positive integer: ${t}`);
-}
-function i(t) {
-  if (typeof t != "boolean")
-    throw new Error(`Expected boolean, not ${t}`);
-}
-function f(t) {
-  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
-}
-function o(t, ...e) {
-  if (!f(t))
-    throw new Error("Expected Uint8Array");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error(`Expected Uint8Array of length ${e}, not of length=${t.length}`);
-}
-function u(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  r(t.outputLen), r(t.blockLen);
-}
-function s(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function c(t, e) {
-  o(t);
-  const n = e.outputLen;
-  if (t.length < n)
-    throw new Error(`digestInto() expects output buffer of length at least ${n}`);
-}
-const a = { number: r, bool: i, bytes: o, hash: u, exists: s, output: c };
-export {
-  i as bool,
-  o as bytes,
-  a as default,
-  s as exists,
-  u as hash,
-  r as number,
-  c as output
-};

package/dist/node_modules/@noble/hashes/esm/_sha2.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./_assert.cjs"),c=require("./utils.cjs");function b(u,t,n,e){if(typeof u.setBigUint64=="function")return u.setBigUint64(t,n,e);const i=BigInt(32),o=BigInt(4294967295),s=Number(n>>i&o),r=Number(n&o),f=e?4:0,l=e?0:4;u.setUint32(t+f,s,e),u.setUint32(t+l,r,e)}class d extends c.Hash{constructor(t,n,e,i){super(),this.blockLen=t,this.outputLen=n,this.padOffset=e,this.isLE=i,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=c.createView(this.buffer)}update(t){p.exists(this);const{view:n,buffer:e,blockLen:i}=this;t=c.toBytes(t);const o=t.length;for(let s=0;s<o;){const r=Math.min(i-this.pos,o-s);if(r===i){const f=c.createView(t);for(;i<=o-s;s+=i)this.process(f,s);continue}e.set(t.subarray(s,s+r),this.pos),this.pos+=r,s+=r,this.pos===i&&(this.process(n,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){p.exists(this),p.output(t,this),this.finished=!0;const{buffer:n,view:e,blockLen:i,isLE:o}=this;let{pos:s}=this;n[s++]=128,this.buffer.subarray(s).fill(0),this.padOffset>i-s&&(this.process(e,0),s=0);for(let h=s;h<i;h++)n[h]=0;b(e,i-8,BigInt(this.length*8),o),this.process(e,0);const r=c.createView(t),f=this.outputLen;if(f%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=f/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<l;h++)r.setUint32(4*h,g[h],o)}digest(){const{buffer:t,outputLen:n}=this;this.digestInto(t);const e=t.slice(0,n);return this.destroy(),e}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:n,buffer:e,length:i,finished:o,destroyed:s,pos:r}=this;return t.length=i,t.pos=r,t.finished=o,t.destroyed=s,i%n&&t.buffer.set(e),t}}exports.SHA2=d;