@ozdao/prometheus-framework 0.2.129 → 0.2.132

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

@@ -1,164 +0,0 @@
-import { __exports as d } from "../../../../_virtual/index2.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

@@ -1 +0,0 @@
-"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

@@ -1,19 +0,0 @@
-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

@@ -1 +0,0 @@
-"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

@@ -1,88 +0,0 @@
-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

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

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

@@ -1,221 +0,0 @@
-import { bitMask as _, numberToBytesLE as m, numberToBytesBE as L, bytesToNumberLE as x, bytesToNumberBE as y, validateObject as M } from "./utils.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const f = BigInt(0), u = BigInt(1), w = BigInt(2), $ = BigInt(3), b = BigInt(4), N = BigInt(5), I = BigInt(8);
-BigInt(9);
-BigInt(16);
-function d(t, o) {
-  const r = t % o;
-  return r >= f ? r : o + r;
-}
-function C(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 Y(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 = d(t, o), n = o, l = f, c = u;
-  for (; r !== f; ) {
-    const i = n / r, e = n % r, s = l - c * i;
-    n = r, r = e, l = c, c = s;
-  }
-  if (n !== u)
-    throw new Error("invert: does not exist");
-  return d(l, o);
-}
-function Z(t) {
-  const o = (t - u) / w;
-  let r, n, l;
-  for (r = t - u, n = 0; r % w === f; r /= w, n++)
-    ;
-  for (l = w; l < t && C(l, o, t) !== t - u; l++)
-    ;
-  if (n === 1) {
-    const g = (t + u) / b;
-    return function(e, s) {
-      const h = e.pow(s, g);
-      if (!e.eql(e.sqr(h), s))
-        throw new Error("Cannot find square root");
-      return h;
-    };
-  }
-  const c = (r + u) / w;
-  return function(i, e) {
-    if (i.pow(e, o) === i.neg(i.ONE))
-      throw new Error("Cannot find square root");
-    let s = n, h = i.pow(i.mul(i.ONE, l), r), B = i.pow(e, c), a = i.pow(e, r);
-    for (; !i.eql(a, i.ONE); ) {
-      if (i.eql(a, i.ZERO))
-        return i.ZERO;
-      let q = 1;
-      for (let E = i.sqr(a); q < s && !i.eql(E, i.ONE); q++)
-        E = i.sqr(E);
-      const v = i.pow(h, u << BigInt(s - q - 1));
-      h = i.sqr(v), B = i.mul(B, v), a = i.mul(a, h), s = q;
-    }
-    return B;
-  };
-}
-function j(t) {
-  if (t % b === $) {
-    const o = (t + u) / b;
-    return function(n, l) {
-      const c = n.pow(l, o);
-      if (!n.eql(n.sqr(c), l))
-        throw new Error("Cannot find square root");
-      return c;
-    };
-  }
-  if (t % I === N) {
-    const o = (t - N) / I;
-    return function(n, l) {
-      const c = n.mul(l, w), g = n.pow(c, o), i = n.mul(l, g), e = n.mul(n.mul(i, w), g), s = n.mul(i, n.sub(e, n.ONE));
-      if (!n.eql(n.sqr(s), l))
-        throw new Error("Cannot find square root");
-      return s;
-    };
-  }
-  return Z(t);
-}
-const A = [
-  "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 = A.reduce((n, l) => (n[l] = "function", n), o);
-  return M(t, r);
-}
-function z(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, l = o;
-  for (; r > f; )
-    r & u && (n = t.mul(n, l)), l = t.sqr(l), r >>= u;
-  return n;
-}
-function H(t, o) {
-  const r = new Array(o.length), n = o.reduce((c, g, i) => t.is0(g) ? c : (r[i] = c, t.mul(c, g)), t.ONE), l = t.inv(n);
-  return o.reduceRight((c, g, i) => t.is0(g) ? c : (r[i] = t.mul(c, r[i]), t.mul(c, g)), l), r;
-}
-function K(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 Field ORDER > 0, got ${t}`);
-  const { nBitLength: l, nByteLength: c } = K(t, o);
-  if (c > 2048)
-    throw new Error("Field lengths over 2048 bytes are not supported");
-  const g = j(t), i = Object.freeze({
-    ORDER: t,
-    BITS: l,
-    BYTES: c,
-    MASK: _(l),
-    ZERO: f,
-    ONE: u,
-    create: (e) => d(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) => d(-e, t),
-    eql: (e, s) => e === s,
-    sqr: (e) => d(e * e, t),
-    add: (e, s) => d(e + s, t),
-    sub: (e, s) => d(e - s, t),
-    mul: (e, s) => d(e * s, t),
-    pow: (e, s) => z(i, e, s),
-    div: (e, s) => d(e * S(s, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (e) => e * e,
-    addN: (e, s) => e + s,
-    subN: (e, s) => e - s,
-    mulN: (e, s) => e * s,
-    inv: (e) => S(e, t),
-    sqrt: n.sqrt || ((e) => g(i, e)),
-    invertBatch: (e) => H(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, s, h) => h ? s : e,
-    toBytes: (e) => r ? m(e, c) : L(e, c),
-    fromBytes: (e) => {
-      if (e.length !== c)
-        throw new Error(`Fp.fromBytes: expected ${c}, got ${e.length}`);
-      return r ? x(e) : y(e);
-    }
-  });
-  return Object.freeze(i);
-}
-function T(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const o = t.toString(2).length;
-  return Math.ceil(o / 8);
-}
-function Q(t) {
-  const o = T(t);
-  return o + Math.ceil(o / 2);
-}
-function G(t, o, r = !1) {
-  const n = t.length, l = T(o), c = Q(o);
-  if (n < 16 || n < c || n > 1024)
-    throw new Error(`expected ${c}-1024 bytes of input, got ${n}`);
-  const g = r ? y(t) : x(t), i = d(g, o - u) + u;
-  return r ? m(i, l) : L(i, l);
-}
-export {
-  O as Field,
-  H as FpInvertBatch,
-  z as FpPow,
-  j as FpSqrt,
-  T as getFieldBytesLength,
-  Q as getMinHashLength,
-  S as invert,
-  G as mapHashToField,
-  d as mod,
-  K as nLength,
-  C as pow,
-  Y as pow2,
-  Z as tonelliShanks,
-  k as validateField
-};

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

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),d=BigInt(1),U=BigInt(2);function l(t){return t instanceof Uint8Array||t!=null&&typeof t=="object"&&t.constructor.name==="Uint8Array"}const $=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function w(t){if(!l(t))throw new Error("Uint8Array expected");let e="";for(let i=0;i<t.length;i++)e+=$[t[i]];return e}function T(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}`)}const c={_0:48,_9:57,_A:65,_F:70,_a:97,_f:102};function h(t){if(t>=c._0&&t<=c._9)return t-c._0;if(t>=c._A&&t<=c._F)return t-(c._A-10);if(t>=c._a&&t<=c._f)return t-(c._a-10)}function b(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);const e=t.length,i=e/2;if(e%2)throw new Error("padded hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(i);for(let r=0,o=0;r<i;r++,o+=2){const a=h(t.charCodeAt(o)),s=h(t.charCodeAt(o+1));if(a===void 0||s===void 0){const u=t[o]+t[o+1];throw new Error('hex string expected, got non-hex character "'+u+'" at index '+o)}n[r]=a*16+s}return n}function S(t){return m(w(t))}function I(t){if(!l(t))throw new Error("Uint8Array expected");return m(w(Uint8Array.from(t).reverse()))}function A(t,e){return b(t.toString(16).padStart(e*2,"0"))}function v(t,e){return A(t,e).reverse()}function N(t){return b(T(t))}function H(t,e,i){let n;if(typeof e=="string")try{n=b(e)}catch(o){throw new Error(`${t} must be valid hex string, got "${e}". Cause: ${o}`)}else if(l(e))n=Uint8Array.from(e);else throw new Error(`${t} must be hex string or Uint8Array`);const r=n.length;if(typeof i=="number"&&r!==i)throw new Error(`${t} expected ${i} bytes, got ${r}`);return n}function x(...t){let e=0;for(let r=0;r<t.length;r++){const o=t[r];if(!l(o))throw new Error("Uint8Array expected");e+=o.length}let i=new Uint8Array(e),n=0;for(let r=0;r<t.length;r++){const o=t[r];i.set(o,n),n+=o.length}return i}function O(t,e){if(t.length!==e.length)return!1;let i=0;for(let n=0;n<t.length;n++)i|=t[n]^e[n];return i===0}function k(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function F(t){let e;for(e=0;t>E;t>>=d,e+=1);return e}function j(t,e){return t>>BigInt(e)&d}const V=(t,e,i)=>t|(i?d:E)<<BigInt(e),C=t=>(U<<BigInt(t-1))-d,p=t=>new Uint8Array(t),B=t=>Uint8Array.from(t);function M(t,e,i){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 i!="function")throw new Error("hmacFn must be a function");let n=p(t),r=p(t),o=0;const a=()=>{n.fill(1),r.fill(0),o=0},s=(...f)=>i(r,n,...f),u=(f=p())=>{r=s(B([0]),f),n=s(),f.length!==0&&(r=s(B([1]),f),n=s())},_=()=>{if(o++>=1e3)throw new Error("drbg: tried 1000 values");let f=0;const y=[];for(;f<e;){n=s();const g=n.slice();y.push(g),f+=n.length}return x(...y)};return(f,y)=>{a(),u(f);let g;for(;!(g=y(_()));)u();return a(),g}}const D={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"||l(t),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 G(t,e,i={}){const n=(r,o,a)=>{const s=D[o];if(typeof s!="function")throw new Error(`Invalid validator "${o}", expected function`);const u=t[r];if(!(a&&u===void 0)&&!s(u,t))throw new Error(`Invalid param ${String(r)}=${u} (${typeof u}), expected ${o}`)};for(const[r,o]of Object.entries(e))n(r,o,!1);for(const[r,o]of Object.entries(i))n(r,o,!0);return t}exports.bitGet=j;exports.bitLen=F;exports.bitMask=C;exports.bitSet=V;exports.bytesToHex=w;exports.bytesToNumberBE=S;exports.bytesToNumberLE=I;exports.concatBytes=x;exports.createHmacDrbg=M;exports.ensureBytes=H;exports.equalBytes=O;exports.hexToBytes=b;exports.hexToNumber=m;exports.isBytes=l;exports.numberToBytesBE=A;exports.numberToBytesLE=v;exports.numberToHexUnpadded=T;exports.numberToVarBytesBE=N;exports.utf8ToBytes=k;exports.validateObject=G;