@ozdao/prometheus-framework 0.1.66 → 0.1.68

package/dist/node_modules/@ethereumjs/rlp/dist/index.js

@@ -0,0 +1,164 @@
+import { __exports as d } from "../../../../_virtual/index.js";
+Object.defineProperty(d, "__esModule", { value: !0 });
+var A = d.RLP = d.utils = d.decode = d.encode = void 0;
+function y(e) {
+  if (Array.isArray(e)) {
+    const t = [];
+    let n = 0;
+    for (let o = 0; o < e.length; o++) {
+      const i = y(e[o]);
+      t.push(i), n += i.length;
+    }
+    return h(x(n, 192), ...t);
+  }
+  const r = p(e);
+  return r.length === 1 && r[0] < 128 ? r : h(x(r.length, 128), r);
+}
+d.encode = y;
+function l(e, r, t) {
+  if (t > e.length)
+    throw new Error("invalid RLP (safeSlice): end slice of Uint8Array out-of-bounds");
+  return e.slice(r, t);
+}
+function w(e) {
+  if (e[0] === 0)
+    throw new Error("invalid RLP: extra zeros");
+  return L(b(e));
+}
+function x(e, r) {
+  if (e < 56)
+    return Uint8Array.from([e + r]);
+  const t = g(e), n = t.length / 2, o = g(r + 55 + n);
+  return Uint8Array.from(c(o + t));
+}
+function m(e, r = !1) {
+  if (typeof e > "u" || e === null || e.length === 0)
+    return Uint8Array.from([]);
+  const t = p(e), n = u(t);
+  if (r)
+    return n;
+  if (n.remainder.length !== 0)
+    throw new Error("invalid RLP: remainder must be zero");
+  return n.data;
+}
+d.decode = m;
+function u(e) {
+  let r, t, n, o, i;
+  const s = [], f = e[0];
+  if (f <= 127)
+    return {
+      data: e.slice(0, 1),
+      remainder: e.slice(1)
+    };
+  if (f <= 183) {
+    if (r = f - 127, f === 128 ? n = Uint8Array.from([]) : n = l(e, 1, r), r === 2 && n[0] < 128)
+      throw new Error("invalid RLP encoding: invalid prefix, single byte < 0x80 are not prefixed");
+    return {
+      data: n,
+      remainder: e.slice(r)
+    };
+  } else if (f <= 191) {
+    if (t = f - 182, e.length - 1 < t)
+      throw new Error("invalid RLP: not enough bytes for string length");
+    if (r = w(l(e, 1, t)), r <= 55)
+      throw new Error("invalid RLP: expected string length to be greater than 55");
+    return n = l(e, t, r + t), {
+      data: n,
+      remainder: e.slice(r + t)
+    };
+  } else if (f <= 247) {
+    for (r = f - 191, o = l(e, 1, r); o.length; )
+      i = u(o), s.push(i.data), o = i.remainder;
+    return {
+      data: s,
+      remainder: e.slice(r)
+    };
+  } else {
+    if (t = f - 246, r = w(l(e, 1, t)), r < 56)
+      throw new Error("invalid RLP: encoded list too short");
+    const a = t + r;
+    if (a > e.length)
+      throw new Error("invalid RLP: total length is larger than the data");
+    for (o = l(e, t, a); o.length; )
+      i = u(o), s.push(i.data), o = i.remainder;
+    return {
+      data: s,
+      remainder: e.slice(a)
+    };
+  }
+}
+const B = Array.from({ length: 256 }, (e, r) => r.toString(16).padStart(2, "0"));
+function b(e) {
+  let r = "";
+  for (let t = 0; t < e.length; t++)
+    r += B[e[t]];
+  return r;
+}
+function L(e) {
+  const r = Number.parseInt(e, 16);
+  if (Number.isNaN(r))
+    throw new Error("Invalid byte sequence");
+  return r;
+}
+function c(e) {
+  if (typeof e != "string")
+    throw new TypeError("hexToBytes: expected string, got " + typeof e);
+  if (e.length % 2)
+    throw new Error("hexToBytes: received invalid unpadded hex");
+  const r = new Uint8Array(e.length / 2);
+  for (let t = 0; t < r.length; t++) {
+    const n = t * 2;
+    r[t] = L(e.slice(n, n + 2));
+  }
+  return r;
+}
+function h(...e) {
+  if (e.length === 1)
+    return e[0];
+  const r = e.reduce((n, o) => n + o.length, 0), t = new Uint8Array(r);
+  for (let n = 0, o = 0; n < e.length; n++) {
+    const i = e[n];
+    t.set(i, o), o += i.length;
+  }
+  return t;
+}
+function E(e) {
+  return new TextEncoder().encode(e);
+}
+function g(e) {
+  if (e < 0)
+    throw new Error("Invalid integer as argument, must be unsigned!");
+  const r = e.toString(16);
+  return r.length % 2 ? `0${r}` : r;
+}
+function R(e) {
+  return e.length % 2 ? `0${e}` : e;
+}
+function P(e) {
+  return e.length >= 2 && e[0] === "0" && e[1] === "x";
+}
+function U(e) {
+  return typeof e != "string" ? e : P(e) ? e.slice(2) : e;
+}
+function p(e) {
+  if (e instanceof Uint8Array)
+    return e;
+  if (typeof e == "string")
+    return P(e) ? c(R(U(e))) : E(e);
+  if (typeof e == "number" || typeof e == "bigint")
+    return e ? c(g(e)) : Uint8Array.from([]);
+  if (e == null)
+    return Uint8Array.from([]);
+  throw new Error("toBytes: received unsupported type " + typeof e);
+}
+d.utils = {
+  bytesToHex: b,
+  concatBytes: h,
+  hexToBytes: c,
+  utf8ToBytes: E
+};
+A = d.RLP = { encode: y, decode: m };
+export {
+  A as RLP,
+  d as default
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../../hashes/esm/hmac.cjs"),c=require("../../hashes/esm/utils.cjs"),o=require("./abstract/weierstrass.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function s(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,c.concatBytes(...t)),randomBytes:c.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...s(n)});return Object.freeze({...t(r),create:t})}exports.createCurve=u;exports.getHash=s;

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

@@ -0,0 +1,19 @@
+import { hmac as c } from "../../hashes/esm/hmac.js";
+import { concatBytes as m, randomBytes as n } from "../../hashes/esm/utils.js";
+import { weierstrass as a } from "./abstract/weierstrass.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function f(r) {
+  return {
+    hash: r,
+    hmac: (t, ...e) => c(r, t, m(...e)),
+    randomBytes: n
+  };
+}
+function p(r, t) {
+  const e = (o) => a({ ...r, ...f(o) });
+  return Object.freeze({ ...e(t), create: e });
+}
+export {
+  p as createCurve,
+  f as getHash
+};

package/dist/node_modules/@noble/curves/esm/abstract/curve.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./modular.cjs"),m=require("./utils.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const O=BigInt(0),u=BigInt(1);function A(o,p){const w=(t,e)=>{const n=e.negate();return t?n:e},g=t=>{const e=Math.ceil(p/t)+1,n=2**(t-1);return{windows:e,windowSize:n}};return{constTimeNegate:w,unsafeLadder(t,e){let n=o.ZERO,a=t;for(;e>O;)e&u&&(n=n.add(a)),a=a.double(),e>>=u;return n},precomputeWindow(t,e){const{windows:n,windowSize:a}=g(e),s=[];let i=t,d=i;for(let c=0;c<n;c++){d=i,s.push(d);for(let l=1;l<a;l++)d=d.add(i),s.push(d);i=d.double()}return s},wNAF(t,e,n){const{windows:a,windowSize:s}=g(t);let i=o.ZERO,d=o.BASE;const c=BigInt(2**t-1),l=2**t,B=BigInt(t);for(let f=0;f<a;f++){const h=f*s;let r=Number(n&c);n>>=B,r>s&&(r-=l,n+=u);const N=h,S=h+Math.abs(r)-1,F=f%2!==0,I=r<0;r===0?d=d.add(w(F,e[N])):i=i.add(w(I,e[S]))}return{p:i,f:d}},wNAFCached(t,e,n,a){const s=t._WINDOW_SIZE||1;let i=e.get(t);return i||(i=this.precomputeWindow(t,s),s!==1&&e.set(t,a(i))),this.wNAF(s,i,n)}}}function y(o){return b.validateField(o.Fp),m.validateObject(o,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...b.nLength(o.n,o.nBitLength),...o,p:o.Fp.ORDER})}exports.validateBasic=y;exports.wNAF=A;

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

@@ -0,0 +1,88 @@
+import { validateField as F, nLength as S } from "./modular.js";
+import { validateObject as O } from "./utils.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const A = BigInt(0), g = BigInt(1);
+function z(i, u) {
+  const l = (t, n) => {
+    const e = n.negate();
+    return t ? e : n;
+  }, h = (t) => {
+    const n = Math.ceil(u / t) + 1, e = 2 ** (t - 1);
+    return { windows: n, windowSize: e };
+  };
+  return {
+    constTimeNegate: l,
+    // non-const time multiplication ladder
+    unsafeLadder(t, n) {
+      let e = i.ZERO, f = t;
+      for (; n > A; )
+        n & g && (e = e.add(f)), f = f.double(), n >>= g;
+      return e;
+    },
+    /**
+     * Creates a wNAF precomputation window. Used for caching.
+     * Default window size is set by `utils.precompute()` and is equal to 8.
+     * Number of precomputed points depends on the curve size:
+     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
+     * - 𝑊 is the window size
+     * - 𝑛 is the bitlength of the curve order.
+     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
+     * @returns precomputed point tables flattened to a single array
+     */
+    precomputeWindow(t, n) {
+      const { windows: e, windowSize: f } = h(n), s = [];
+      let o = t, d = o;
+      for (let w = 0; w < e; w++) {
+        d = o, s.push(d);
+        for (let a = 1; a < f; a++)
+          d = d.add(o), s.push(d);
+        o = d.double();
+      }
+      return s;
+    },
+    /**
+     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
+     * @param W window size
+     * @param precomputes precomputed tables
+     * @param n scalar (we don't check here, but should be less than curve order)
+     * @returns real and fake (for const-time) points
+     */
+    wNAF(t, n, e) {
+      const { windows: f, windowSize: s } = h(t);
+      let o = i.ZERO, d = i.BASE;
+      const w = BigInt(2 ** t - 1), a = 2 ** t, b = BigInt(t);
+      for (let c = 0; c < f; c++) {
+        const p = c * s;
+        let r = Number(e & w);
+        e >>= b, r > s && (r -= a, e += g);
+        const B = p, m = p + Math.abs(r) - 1, I = c % 2 !== 0, N = r < 0;
+        r === 0 ? d = d.add(l(I, n[B])) : o = o.add(l(N, n[m]));
+      }
+      return { p: o, f: d };
+    },
+    wNAFCached(t, n, e, f) {
+      const s = t._WINDOW_SIZE || 1;
+      let o = n.get(t);
+      return o || (o = this.precomputeWindow(t, s), s !== 1 && n.set(t, f(o))), this.wNAF(s, o, e);
+    }
+  };
+}
+function R(i) {
+  return F(i.Fp), O(i, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...S(i.n, i.nBitLength),
+    ...i,
+    p: i.Fp.ORDER
+  });
+}
+export {
+  R as validateBasic,
+  z as wNAF
+};

package/dist/node_modules/@noble/curves/esm/abstract/modular.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./utils.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const f=BigInt(0),u=BigInt(1),h=BigInt(2),M=BigInt(3),b=BigInt(4),y=BigInt(5),m=BigInt(8);BigInt(9);BigInt(16);function a(t,o){const r=t%o;return r>=f?r:o+r}function T(t,o,r){if(r<=f||o<f)throw new Error("Expected power/modulo > 0");if(r===u)return f;let n=u;for(;o>f;)o&u&&(n=n*t%r),t=t*t%r,o>>=u;return n}function C(t,o,r){let n=t;for(;o-- >f;)n*=n,n%=r;return n}function N(t,o){if(t===f||o<=f)throw new Error(`invert: expected positive integers, got n=${t} mod=${o}`);let r=a(t,o),n=o,s=f,c=u;for(;r!==f;){const i=n/r,e=n%r,l=s-c*i;n=r,r=e,s=c,c=l}if(n!==u)throw new Error("invert: does not exist");return a(s,o)}function L(t){const o=(t-u)/h;let r,n,s;for(r=t-u,n=0;r%h===f;r/=h,n++);for(s=h;s<t&&T(s,o,t)!==t-u;s++);if(n===1){const d=(t+u)/b;return function(e,l){const w=e.pow(l,d);if(!e.eql(e.sqr(w),l))throw new Error("Cannot find square root");return w}}const c=(r+u)/h;return function(i,e){if(i.pow(e,o)===i.neg(i.ONE))throw new Error("Cannot find square root");let l=n,w=i.pow(i.mul(i.ONE,s),r),v=i.pow(e,c),q=i.pow(e,r);for(;!i.eql(q,i.ONE);){if(i.eql(q,i.ZERO))return i.ZERO;let B=1;for(let E=i.sqr(q);B<l&&!i.eql(E,i.ONE);B++)E=i.sqr(E);const I=i.pow(w,u<<BigInt(l-B-1));w=i.sqr(I),v=i.mul(v,I),q=i.mul(q,w),l=B}return v}}function x(t){if(t%b===M){const o=(t+u)/b;return function(n,s){const c=n.pow(s,o);if(!n.eql(n.sqr(c),s))throw new Error("Cannot find square root");return c}}if(t%m===y){const o=(t-y)/m;return function(n,s){const c=n.mul(s,h),d=n.pow(c,o),i=n.mul(s,d),e=n.mul(n.mul(i,h),d),l=n.mul(i,n.sub(e,n.ONE));if(!n.eql(n.sqr(l),s))throw new Error("Cannot find square root");return l}}return L(t)}const j=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const o={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},r=j.reduce((n,s)=>(n[s]="function",n),o);return g.validateObject(t,r)}function _(t,o,r){if(r<f)throw new Error("Expected power > 0");if(r===f)return t.ONE;if(r===u)return o;let n=t.ONE,s=o;for(;r>f;)r&u&&(n=t.mul(n,s)),s=t.sqr(s),r>>=u;return n}function $(t,o){const r=new Array(o.length),n=o.reduce((c,d,i)=>t.is0(d)?c:(r[i]=c,t.mul(c,d)),t.ONE),s=t.inv(n);return o.reduceRight((c,d,i)=>t.is0(d)?c:(r[i]=t.mul(c,r[i]),t.mul(c,d)),s),r}function S(t,o){const r=o!==void 0?o:t.toString(2).length,n=Math.ceil(r/8);return{nBitLength:r,nByteLength:n}}function O(t,o,r=!1,n={}){if(t<=f)throw new Error(`Expected Fp ORDER > 0, got ${t}`);const{nBitLength:s,nByteLength:c}=S(t,o);if(c>2048)throw new Error("Field lengths over 2048 bytes are not supported");const d=x(t),i=Object.freeze({ORDER:t,BITS:s,BYTES:c,MASK:g.bitMask(s),ZERO:f,ONE:u,create:e=>a(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error(`Invalid field element: expected bigint, got ${typeof e}`);return f<=e&&e<t},is0:e=>e===f,isOdd:e=>(e&u)===u,neg:e=>a(-e,t),eql:(e,l)=>e===l,sqr:e=>a(e*e,t),add:(e,l)=>a(e+l,t),sub:(e,l)=>a(e-l,t),mul:(e,l)=>a(e*l,t),pow:(e,l)=>_(i,e,l),div:(e,l)=>a(e*N(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>N(e,t),sqrt:n.sqrt||(e=>d(i,e)),invertBatch:e=>$(i,e),cmov:(e,l,w)=>w?l:e,toBytes:e=>r?g.numberToBytesLE(e,c):g.numberToBytesBE(e,c),fromBytes:e=>{if(e.length!==c)throw new Error(`Fp.fromBytes: expected ${c}, got ${e.length}`);return r?g.bytesToNumberLE(e):g.bytesToNumberBE(e)}});return Object.freeze(i)}function Z(t,o,r=!1){t=g.ensureBytes("privateHash",t);const n=t.length,s=S(o).nByteLength+8;if(s<24||n<s||n>1024)throw new Error(`hashToPrivateScalar: expected ${s}-1024 bytes of input, got ${n}`);const c=r?g.bytesToNumberLE(t):g.bytesToNumberBE(t);return a(c,o-u)+u}exports.Field=O;exports.FpInvertBatch=$;exports.FpPow=_;exports.FpSqrt=x;exports.hashToPrivateScalar=Z;exports.invert=N;exports.mod=a;exports.nLength=S;exports.pow=T;exports.pow2=C;exports.tonelliShanks=L;exports.validateField=k;

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

@@ -0,0 +1,210 @@
+import { bitMask as L, numberToBytesLE as T, numberToBytesBE as _, bytesToNumberLE as y, bytesToNumberBE as m, ensureBytes as $, validateObject as C } from "./utils.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const f = BigInt(0), u = BigInt(1), a = BigInt(2), M = BigInt(3), E = BigInt(4), b = BigInt(5), I = BigInt(8);
+BigInt(9);
+BigInt(16);
+function g(t, o) {
+  const r = t % o;
+  return r >= f ? r : o + r;
+}
+function Z(t, o, r) {
+  if (r <= f || o < f)
+    throw new Error("Expected power/modulo > 0");
+  if (r === u)
+    return f;
+  let n = u;
+  for (; o > f; )
+    o & u && (n = n * t % r), t = t * t % r, o >>= u;
+  return n;
+}
+function Q(t, o, r) {
+  let n = t;
+  for (; o-- > f; )
+    n *= n, n %= r;
+  return n;
+}
+function S(t, o) {
+  if (t === f || o <= f)
+    throw new Error(`invert: expected positive integers, got n=${t} mod=${o}`);
+  let r = g(t, o), n = o, s = f, c = u;
+  for (; r !== f; ) {
+    const i = n / r, e = n % r, l = s - c * i;
+    n = r, r = e, s = c, c = l;
+  }
+  if (n !== u)
+    throw new Error("invert: does not exist");
+  return g(s, o);
+}
+function j(t) {
+  const o = (t - u) / a;
+  let r, n, s;
+  for (r = t - u, n = 0; r % a === f; r /= a, n++)
+    ;
+  for (s = a; s < t && Z(s, o, t) !== t - u; s++)
+    ;
+  if (n === 1) {
+    const d = (t + u) / E;
+    return function(e, l) {
+      const w = e.pow(l, d);
+      if (!e.eql(e.sqr(w), l))
+        throw new Error("Cannot find square root");
+      return w;
+    };
+  }
+  const c = (r + u) / a;
+  return function(i, e) {
+    if (i.pow(e, o) === i.neg(i.ONE))
+      throw new Error("Cannot find square root");
+    let l = n, w = i.pow(i.mul(i.ONE, s), r), B = i.pow(e, c), h = i.pow(e, r);
+    for (; !i.eql(h, i.ONE); ) {
+      if (i.eql(h, i.ZERO))
+        return i.ZERO;
+      let q = 1;
+      for (let v = i.sqr(h); q < l && !i.eql(v, i.ONE); q++)
+        v = i.sqr(v);
+      const N = i.pow(w, u << BigInt(l - q - 1));
+      w = i.sqr(N), B = i.mul(B, N), h = i.mul(h, w), l = q;
+    }
+    return B;
+  };
+}
+function k(t) {
+  if (t % E === M) {
+    const o = (t + u) / E;
+    return function(n, s) {
+      const c = n.pow(s, o);
+      if (!n.eql(n.sqr(c), s))
+        throw new Error("Cannot find square root");
+      return c;
+    };
+  }
+  if (t % I === b) {
+    const o = (t - b) / I;
+    return function(n, s) {
+      const c = n.mul(s, a), d = n.pow(c, o), i = n.mul(s, d), e = n.mul(n.mul(i, a), d), l = n.mul(i, n.sub(e, n.ONE));
+      if (!n.eql(n.sqr(l), s))
+        throw new Error("Cannot find square root");
+      return l;
+    };
+  }
+  return j(t);
+}
+const A = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function V(t) {
+  const o = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, r = A.reduce((n, s) => (n[s] = "function", n), o);
+  return C(t, r);
+}
+function O(t, o, r) {
+  if (r < f)
+    throw new Error("Expected power > 0");
+  if (r === f)
+    return t.ONE;
+  if (r === u)
+    return o;
+  let n = t.ONE, s = o;
+  for (; r > f; )
+    r & u && (n = t.mul(n, s)), s = t.sqr(s), r >>= u;
+  return n;
+}
+function z(t, o) {
+  const r = new Array(o.length), n = o.reduce((c, d, i) => t.is0(d) ? c : (r[i] = c, t.mul(c, d)), t.ONE), s = t.inv(n);
+  return o.reduceRight((c, d, i) => t.is0(d) ? c : (r[i] = t.mul(c, r[i]), t.mul(c, d)), s), r;
+}
+function x(t, o) {
+  const r = o !== void 0 ? o : t.toString(2).length, n = Math.ceil(r / 8);
+  return { nBitLength: r, nByteLength: n };
+}
+function Y(t, o, r = !1, n = {}) {
+  if (t <= f)
+    throw new Error(`Expected Fp ORDER > 0, got ${t}`);
+  const { nBitLength: s, nByteLength: c } = x(t, o);
+  if (c > 2048)
+    throw new Error("Field lengths over 2048 bytes are not supported");
+  const d = k(t), i = Object.freeze({
+    ORDER: t,
+    BITS: s,
+    BYTES: c,
+    MASK: L(s),
+    ZERO: f,
+    ONE: u,
+    create: (e) => g(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error(`Invalid field element: expected bigint, got ${typeof e}`);
+      return f <= e && e < t;
+    },
+    is0: (e) => e === f,
+    isOdd: (e) => (e & u) === u,
+    neg: (e) => g(-e, t),
+    eql: (e, l) => e === l,
+    sqr: (e) => g(e * e, t),
+    add: (e, l) => g(e + l, t),
+    sub: (e, l) => g(e - l, t),
+    mul: (e, l) => g(e * l, t),
+    pow: (e, l) => O(i, e, l),
+    div: (e, l) => g(e * S(l, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, l) => e + l,
+    subN: (e, l) => e - l,
+    mulN: (e, l) => e * l,
+    inv: (e) => S(e, t),
+    sqrt: n.sqrt || ((e) => d(i, e)),
+    invertBatch: (e) => z(i, e),
+    // TODO: do we really need constant cmov?
+    // We don't have const-time bigints anyway, so probably will be not very useful
+    cmov: (e, l, w) => w ? l : e,
+    toBytes: (e) => r ? T(e, c) : _(e, c),
+    fromBytes: (e) => {
+      if (e.length !== c)
+        throw new Error(`Fp.fromBytes: expected ${c}, got ${e.length}`);
+      return r ? y(e) : m(e);
+    }
+  });
+  return Object.freeze(i);
+}
+function H(t, o, r = !1) {
+  t = $("privateHash", t);
+  const n = t.length, s = x(o).nByteLength + 8;
+  if (s < 24 || n < s || n > 1024)
+    throw new Error(`hashToPrivateScalar: expected ${s}-1024 bytes of input, got ${n}`);
+  const c = r ? y(t) : m(t);
+  return g(c, o - u) + u;
+}
+export {
+  Y as Field,
+  z as FpInvertBatch,
+  O as FpPow,
+  k as FpSqrt,
+  H as hashToPrivateScalar,
+  S as invert,
+  g as mod,
+  x as nLength,
+  Z as pow,
+  Q as pow2,
+  j as tonelliShanks,
+  V as validateField
+};

package/dist/node_modules/@noble/curves/esm/abstract/utils.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const m=BigInt(0),y=BigInt(1),U=BigInt(2),g=e=>e instanceof Uint8Array,A=Array.from({length:256},(e,t)=>t.toString(16).padStart(2,"0"));function w(e){if(!g(e))throw new Error("Uint8Array expected");let t="";for(let r=0;r<e.length;r++)t+=A[e[r]];return t}function B(e){const t=e.toString(16);return t.length&1?`0${t}`:t}function h(e){if(typeof e!="string")throw new Error("hex string expected, got "+typeof e);return BigInt(e===""?"0":`0x${e}`)}function b(e){if(typeof e!="string")throw new Error("hex string expected, got "+typeof e);const t=e.length;if(t%2)throw new Error("padded hex string expected, got unpadded hex of length "+t);const r=new Uint8Array(t/2);for(let n=0;n<r.length;n++){const o=n*2,i=e.slice(o,o+2),s=Number.parseInt(i,16);if(Number.isNaN(s)||s<0)throw new Error("Invalid byte sequence");r[n]=s}return r}function $(e){return h(w(e))}function v(e){if(!g(e))throw new Error("Uint8Array expected");return h(w(Uint8Array.from(e).reverse()))}function E(e,t){return b(e.toString(16).padStart(t*2,"0"))}function I(e,t){return E(e,t).reverse()}function N(e){return b(B(e))}function S(e,t,r){let n;if(typeof t=="string")try{n=b(t)}catch(i){throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${i}`)}else if(g(t))n=Uint8Array.from(t);else throw new Error(`${e} must be hex string or Uint8Array`);const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(`${e} expected ${r} bytes, got ${o}`);return n}function T(...e){const t=new Uint8Array(e.reduce((n,o)=>n+o.length,0));let r=0;return e.forEach(n=>{if(!g(n))throw new Error("Uint8Array expected");t.set(n,r),r+=n.length}),t}function H(e,t){if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(e[r]!==t[r])return!1;return!0}function k(e){if(typeof e!="string")throw new Error(`utf8ToBytes expected string, got ${typeof e}`);return new Uint8Array(new TextEncoder().encode(e))}function O(e){let t;for(t=0;e>m;e>>=y,t+=1);return t}function j(e,t){return e>>BigInt(t)&y}const V=(e,t,r)=>e|(r?y:m)<<BigInt(t),F=e=>(U<<BigInt(e-1))-y,d=e=>new Uint8Array(e),p=e=>Uint8Array.from(e);function M(e,t,r){if(typeof e!="number"||e<2)throw new Error("hashLen must be a number");if(typeof t!="number"||t<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=d(e),o=d(e),i=0;const s=()=>{n.fill(1),o.fill(0),i=0},f=(...u)=>r(o,n,...u),c=(u=d())=>{o=f(p([0]),u),n=f(),u.length!==0&&(o=f(p([1]),u),n=f())},x=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let u=0;const a=[];for(;u<t;){n=f();const l=n.slice();a.push(l),u+=n.length}return T(...a)};return(u,a)=>{s(),c(u);let l;for(;!(l=a(x()));)c();return s(),l}}const _={bigint:e=>typeof e=="bigint",function:e=>typeof e=="function",boolean:e=>typeof e=="boolean",string:e=>typeof e=="string",isSafeInteger:e=>Number.isSafeInteger(e),array:e=>Array.isArray(e),field:(e,t)=>t.Fp.isValid(e),hash:e=>typeof e=="function"&&Number.isSafeInteger(e.outputLen)};function q(e,t,r={}){const n=(o,i,s)=>{const f=_[i];if(typeof f!="function")throw new Error(`Invalid validator "${i}", expected function`);const c=e[o];if(!(s&&c===void 0)&&!f(c,e))throw new Error(`Invalid param ${String(o)}=${c} (${typeof c}), expected ${i}`)};for(const[o,i]of Object.entries(t))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return e}exports.bitGet=j;exports.bitLen=O;exports.bitMask=F;exports.bitSet=V;exports.bytesToHex=w;exports.bytesToNumberBE=$;exports.bytesToNumberLE=v;exports.concatBytes=T;exports.createHmacDrbg=M;exports.ensureBytes=S;exports.equalBytes=H;exports.hexToBytes=b;exports.hexToNumber=h;exports.numberToBytesBE=E;exports.numberToBytesLE=I;exports.numberToHexUnpadded=B;exports.numberToVarBytesBE=N;exports.utf8ToBytes=k;exports.validateObject=q;

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

@@ -0,0 +1,178 @@
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const h = BigInt(0), g = BigInt(1), B = BigInt(2), y = (t) => t instanceof Uint8Array, x = Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function b(t) {
+  if (!y(t))
+    throw new Error("Uint8Array expected");
+  let e = "";
+  for (let r = 0; r < t.length; r++)
+    e += x[t[r]];
+  return e;
+}
+function A(t) {
+  const e = t.toString(16);
+  return e.length & 1 ? `0${e}` : e;
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return BigInt(t === "" ? "0" : `0x${t}`);
+}
+function d(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  const e = t.length;
+  if (e % 2)
+    throw new Error("padded hex string expected, got unpadded hex of length " + e);
+  const r = new Uint8Array(e / 2);
+  for (let n = 0; n < r.length; n++) {
+    const o = n * 2, i = t.slice(o, o + 2), u = Number.parseInt(i, 16);
+    if (Number.isNaN(u) || u < 0)
+      throw new Error("Invalid byte sequence");
+    r[n] = u;
+  }
+  return r;
+}
+function T(t) {
+  return m(b(t));
+}
+function N(t) {
+  if (!y(t))
+    throw new Error("Uint8Array expected");
+  return m(b(Uint8Array.from(t).reverse()));
+}
+function U(t, e) {
+  return d(t.toString(16).padStart(e * 2, "0"));
+}
+function S(t, e) {
+  return U(t, e).reverse();
+}
+function k(t) {
+  return d(A(t));
+}
+function F(t, e, r) {
+  let n;
+  if (typeof e == "string")
+    try {
+      n = d(e);
+    } catch (i) {
+      throw new Error(`${t} must be valid hex string, got "${e}". Cause: ${i}`);
+    }
+  else if (y(e))
+    n = Uint8Array.from(e);
+  else
+    throw new Error(`${t} must be hex string or Uint8Array`);
+  const o = n.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(`${t} expected ${r} bytes, got ${o}`);
+  return n;
+}
+function $(...t) {
+  const e = new Uint8Array(t.reduce((n, o) => n + o.length, 0));
+  let r = 0;
+  return t.forEach((n) => {
+    if (!y(n))
+      throw new Error("Uint8Array expected");
+    e.set(n, r), r += n.length;
+  }), e;
+}
+function H(t, e) {
+  if (t.length !== e.length)
+    return !1;
+  for (let r = 0; r < t.length; r++)
+    if (t[r] !== e[r])
+      return !1;
+  return !0;
+}
+function O(t) {
+  if (typeof t != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function V(t) {
+  let e;
+  for (e = 0; t > h; t >>= g, e += 1)
+    ;
+  return e;
+}
+function _(t, e) {
+  return t >> BigInt(e) & g;
+}
+const j = (t, e, r) => t | (r ? g : h) << BigInt(e), q = (t) => (B << BigInt(t - 1)) - g, w = (t) => new Uint8Array(t), p = (t) => Uint8Array.from(t);
+function C(t, e, r) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof e != "number" || e < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof r != "function")
+    throw new Error("hmacFn must be a function");
+  let n = w(t), o = w(t), i = 0;
+  const u = () => {
+    n.fill(1), o.fill(0), i = 0;
+  }, s = (...f) => r(o, n, ...f), c = (f = w()) => {
+    o = s(p([0]), f), n = s(), f.length !== 0 && (o = s(p([1]), f), n = s());
+  }, E = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let f = 0;
+    const a = [];
+    for (; f < e; ) {
+      n = s();
+      const l = n.slice();
+      a.push(l), f += n.length;
+    }
+    return $(...a);
+  };
+  return (f, a) => {
+    u(), c(f);
+    let l;
+    for (; !(l = a(E())); )
+      c();
+    return u(), l;
+  };
+}
+const I = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, e) => e.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function D(t, e, r = {}) {
+  const n = (o, i, u) => {
+    const s = I[i];
+    if (typeof s != "function")
+      throw new Error(`Invalid validator "${i}", expected function`);
+    const c = t[o];
+    if (!(u && c === void 0) && !s(c, t))
+      throw new Error(`Invalid param ${String(o)}=${c} (${typeof c}), expected ${i}`);
+  };
+  for (const [o, i] of Object.entries(e))
+    n(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    n(o, i, !0);
+  return t;
+}
+export {
+  _ as bitGet,
+  V as bitLen,
+  q as bitMask,
+  j as bitSet,
+  b as bytesToHex,
+  T as bytesToNumberBE,
+  N as bytesToNumberLE,
+  $ as concatBytes,
+  C as createHmacDrbg,
+  F as ensureBytes,
+  H as equalBytes,
+  d as hexToBytes,
+  m as hexToNumber,
+  U as numberToBytesBE,
+  S as numberToBytesLE,
+  A as numberToHexUnpadded,
+  k as numberToVarBytesBE,
+  O as utf8ToBytes,
+  D as validateObject
+};