@ozdao/prometheus-framework 0.2.31 → 0.2.32

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

@@ -1,133 +1,154 @@
 /*! 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))
+const m = BigInt(0), d = BigInt(1), _ = BigInt(2);
+function a(t) {
+  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
+}
+const x = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function E(t) {
+  if (!a(t))
     throw new Error("Uint8Array expected");
-  let e = "";
-  for (let r = 0; r < t.length; r++)
-    e += x[t[r]];
-  return e;
+  let n = "";
+  for (let i = 0; i < t.length; i++)
+    n += x[t[i]];
+  return n;
 }
-function A(t) {
-  const e = t.toString(16);
-  return e.length & 1 ? `0${e}` : e;
+function U(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? `0${n}` : n;
 }
-function m(t) {
+function A(t) {
   if (typeof t != "string")
     throw new Error("hex string expected, got " + typeof t);
   return BigInt(t === "" ? "0" : `0x${t}`);
 }
-function d(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 p(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;
+  const n = t.length, i = n / 2;
+  if (n % 2)
+    throw new Error("padded hex string expected, got unpadded hex of length " + n);
+  const e = new Uint8Array(i);
+  for (let r = 0, o = 0; r < i; r++, o += 2) {
+    const l = h(t.charCodeAt(o)), f = h(t.charCodeAt(o + 1));
+    if (l === void 0 || f === void 0) {
+      const s = t[o] + t[o + 1];
+      throw new Error('hex string expected, got non-hex character "' + s + '" at index ' + o);
+    }
+    e[r] = l * 16 + f;
   }
-  return r;
+  return e;
 }
-function T(t) {
-  return m(b(t));
+function v(t) {
+  return A(E(t));
 }
 function N(t) {
-  if (!y(t))
+  if (!a(t))
     throw new Error("Uint8Array expected");
-  return m(b(Uint8Array.from(t).reverse()));
+  return A(E(Uint8Array.from(t).reverse()));
 }
-function U(t, e) {
-  return d(t.toString(16).padStart(e * 2, "0"));
+function $(t, n) {
+  return p(t.toString(16).padStart(n * 2, "0"));
 }
-function S(t, e) {
-  return U(t, e).reverse();
+function F(t, n) {
+  return $(t, n).reverse();
 }
 function k(t) {
-  return d(A(t));
+  return p(U(t));
 }
-function F(t, e, r) {
-  let n;
-  if (typeof e == "string")
+function O(t, n, i) {
+  let e;
+  if (typeof n == "string")
     try {
-      n = d(e);
-    } catch (i) {
-      throw new Error(`${t} must be valid hex string, got "${e}". Cause: ${i}`);
+      e = p(n);
+    } catch (o) {
+      throw new Error(`${t} must be valid hex string, got "${n}". Cause: ${o}`);
     }
-  else if (y(e))
-    n = Uint8Array.from(e);
+  else if (a(n))
+    e = Uint8Array.from(n);
   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;
+  const r = e.length;
+  if (typeof i == "number" && r !== i)
+    throw new Error(`${t} expected ${i} bytes, got ${r}`);
+  return e;
 }
-function $(...t) {
-  const e = new Uint8Array(t.reduce((n, o) => n + o.length, 0));
-  let r = 0;
-  return t.forEach((n) => {
-    if (!y(n))
+function T(...t) {
+  let n = 0;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    if (!a(o))
       throw new Error("Uint8Array expected");
-    e.set(n, r), r += n.length;
-  }), e;
+    n += o.length;
+  }
+  let i = new Uint8Array(n), e = 0;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    i.set(o, e), e += o.length;
+  }
+  return i;
 }
-function H(t, e) {
-  if (t.length !== e.length)
+function C(t, n) {
+  if (t.length !== n.length)
     return !1;
-  for (let r = 0; r < t.length; r++)
-    if (t[r] !== e[r])
-      return !1;
-  return !0;
+  let i = 0;
+  for (let e = 0; e < t.length; e++)
+    i |= t[e] ^ n[e];
+  return i === 0;
 }
-function O(t) {
+function H(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)
+  let n;
+  for (n = 0; t > m; t >>= d, n += 1)
     ;
-  return e;
+  return n;
 }
-function _(t, e) {
-  return t >> BigInt(e) & g;
+function j(t, n) {
+  return t >> BigInt(n) & d;
 }
-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) {
+const D = (t, n, i) => t | (i ? d : m) << BigInt(n), G = (t) => (_ << BigInt(t - 1)) - d, w = (t) => new Uint8Array(t), b = (t) => Uint8Array.from(t);
+function M(t, n, i) {
   if (typeof t != "number" || t < 2)
     throw new Error("hashLen must be a number");
-  if (typeof e != "number" || e < 2)
+  if (typeof n != "number" || n < 2)
     throw new Error("qByteLen must be a number");
-  if (typeof r != "function")
+  if (typeof i != "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)
+  let e = w(t), r = w(t), o = 0;
+  const l = () => {
+    e.fill(1), r.fill(0), o = 0;
+  }, f = (...u) => i(r, e, ...u), s = (u = w()) => {
+    r = f(b([0]), u), e = f(), u.length !== 0 && (r = f(b([1]), u), e = f());
+  }, B = () => {
+    if (o++ >= 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;
+    let u = 0;
+    const g = [];
+    for (; u < n; ) {
+      e = f();
+      const y = e.slice();
+      g.push(y), u += e.length;
     }
-    return $(...a);
+    return T(...g);
   };
-  return (f, a) => {
-    u(), c(f);
-    let l;
-    for (; !(l = a(E())); )
-      c();
-    return u(), l;
+  return (u, g) => {
+    l(), s(u);
+    let y;
+    for (; !(y = g(B())); )
+      s();
+    return l(), y;
   };
 }
 const I = {
@@ -135,44 +156,46 @@ const I = {
   function: (t) => typeof t == "function",
   boolean: (t) => typeof t == "boolean",
   string: (t) => typeof t == "string",
+  stringOrUint8Array: (t) => typeof t == "string" || a(t),
   isSafeInteger: (t) => Number.isSafeInteger(t),
   array: (t) => Array.isArray(t),
-  field: (t, e) => e.Fp.isValid(t),
+  field: (t, n) => n.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}`);
+function q(t, n, i = {}) {
+  const e = (r, o, l) => {
+    const f = I[o];
+    if (typeof f != "function")
+      throw new Error(`Invalid validator "${o}", expected function`);
+    const s = t[r];
+    if (!(l && s === void 0) && !f(s, t))
+      throw new Error(`Invalid param ${String(r)}=${s} (${typeof s}), expected ${o}`);
   };
-  for (const [o, i] of Object.entries(e))
-    n(o, i, !1);
-  for (const [o, i] of Object.entries(r))
-    n(o, i, !0);
+  for (const [r, o] of Object.entries(n))
+    e(r, o, !1);
+  for (const [r, o] of Object.entries(i))
+    e(r, o, !0);
   return t;
 }
 export {
-  _ as bitGet,
+  j as bitGet,
   V as bitLen,
-  q as bitMask,
-  j as bitSet,
-  b as bytesToHex,
-  T as bytesToNumberBE,
+  G as bitMask,
+  D as bitSet,
+  E as bytesToHex,
+  v 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,
+  T as concatBytes,
+  M as createHmacDrbg,
+  O as ensureBytes,
+  C as equalBytes,
+  p as hexToBytes,
+  A as hexToNumber,
+  a as isBytes,
+  $ as numberToBytesBE,
+  F as numberToBytesLE,
+  U as numberToHexUnpadded,
   k as numberToVarBytesBE,
-  O as utf8ToBytes,
-  D as validateObject
+  H as utf8ToBytes,
+  q as validateObject
 };

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

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const _=require("./modular.cjs"),m=require("./utils.cjs"),et=require("./curve.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(v){const n=et.validateBasic(v);m.validateObject(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:x,a:O}=n;if(t){if(!x.eql(O,x.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:ct,hexToBytes:ut}=m,$={Err:class extends Error{constructor(n=""){super(n)}},_parseInt(v){const{Err:n}=$;if(v.length<2||v[0]!==2)throw new n("Invalid signature integer tag");const t=v[1],x=v.subarray(2,t+2);if(!t||x.length!==t)throw new n("Invalid signature integer: wrong length");if(x[0]&128)throw new n("Invalid signature integer: negative");if(x[0]===0&&!(x[1]&128))throw new n("Invalid signature integer: unnecessary leading zero");return{d:ct(x),l:v.subarray(t+2)}},toSig(v){const{Err:n}=$,t=typeof v=="string"?ut(v):v;if(!(t instanceof Uint8Array))throw new Error("ui8a expected");let x=t.length;if(x<2||t[0]!=48)throw new n("Invalid signature tag");if(t[1]!==x-2)throw new n("Invalid signature: incorrect length");const{d:O,l:T}=$._parseInt(t.subarray(2)),{d:F,l:R}=$._parseInt(T);if(R.length)throw new n("Invalid signature: left bytes after parsing");return{r:O,s:F}},hexFromSig(v){const n=S=>Number.parseInt(S[0],16)&8?"00"+S:S,t=S=>{const V=S.toString(16);return V.length&1?`0${V}`:V},x=n(t(v.s)),O=n(t(v.r)),T=x.length/2,F=O.length/2,R=t(T),C=t(F);return`30${t(F+T+4)}02${C}${O}02${R}${x}`}},P=BigInt(0),U=BigInt(1);BigInt(2);const ot=BigInt(3);BigInt(4);function it(v){const n=at(v),{Fp:t}=n,x=n.toBytes||((y,r,i)=>{const o=r.toAffine();return m.concatBytes(Uint8Array.from([4]),t.toBytes(o.x),t.toBytes(o.y))}),O=n.fromBytes||(y=>{const r=y.subarray(1),i=t.fromBytes(r.subarray(0,t.BYTES)),o=t.fromBytes(r.subarray(t.BYTES,2*t.BYTES));return{x:i,y:o}});function T(y){const{a:r,b:i}=n,o=t.sqr(y),u=t.mul(o,y);return t.add(t.add(u,t.mul(y,r)),i)}if(!t.eql(t.sqr(n.Gy),T(n.Gx)))throw new Error("bad generator point: equation left != right");function F(y){return typeof y=="bigint"&&P<y&&y<n.n}function R(y){if(!F(y))throw new Error("Expected valid bigint: 0 < bigint < curve.n")}function C(y){const{allowedPrivateKeyLengths:r,nByteLength:i,wrapPrivateKey:o,n:u}=n;if(r&&typeof y!="bigint"){if(y instanceof Uint8Array&&(y=m.bytesToHex(y)),typeof y!="string"||!r.includes(y.length))throw new Error("Invalid key");y=y.padStart(i*2,"0")}let f;try{f=typeof y=="bigint"?y:m.bytesToNumberBE(m.ensureBytes("private key",y,i))}catch{throw new Error(`private key must be ${i} bytes, hex or bigint, not ${typeof y}`)}return o&&(f=_.mod(f,u)),R(f),f}const S=new Map;function V(y){if(!(y instanceof w))throw new Error("ProjectivePoint expected")}class w{constructor(r,i,o){if(this.px=r,this.py=i,this.pz=o,r==null||!t.isValid(r))throw new Error("x required");if(i==null||!t.isValid(i))throw new Error("y required");if(o==null||!t.isValid(o))throw new Error("z required")}static fromAffine(r){const{x:i,y:o}=r||{};if(!r||!t.isValid(i)||!t.isValid(o))throw new Error("invalid affine point");if(r instanceof w)throw new Error("projective point not allowed");const u=f=>t.eql(f,t.ZERO);return u(i)&&u(o)?w.ZERO:new w(i,o,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(r){const i=t.invertBatch(r.map(o=>o.pz));return r.map((o,u)=>o.toAffine(i[u])).map(w.fromAffine)}static fromHex(r){const i=w.fromAffine(O(m.ensureBytes("pointHex",r)));return i.assertValidity(),i}static fromPrivateKey(r){return w.BASE.multiply(C(r))}_setWindowSize(r){this._WINDOW_SIZE=r,S.delete(this)}assertValidity(){if(this.is0()){if(n.allowInfinityPoint)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 o=t.sqr(i),u=T(r);if(!t.eql(o,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")}equals(r){V(r);const{px:i,py:o,pz:u}=this,{px:f,py:g,pz:h}=r,a=t.eql(t.mul(i,h),t.mul(f,u)),c=t.eql(t.mul(o,h),t.mul(g,u));return a&&c}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:r,b:i}=n,o=t.mul(i,ot),{px:u,py:f,pz:g}=this;let h=t.ZERO,a=t.ZERO,c=t.ZERO,d=t.mul(u,u),z=t.mul(f,f),B=t.mul(g,g),p=t.mul(u,f);return p=t.add(p,p),c=t.mul(u,g),c=t.add(c,c),h=t.mul(r,c),a=t.mul(o,B),a=t.add(h,a),h=t.sub(z,a),a=t.add(z,a),a=t.mul(h,a),h=t.mul(p,h),c=t.mul(o,c),B=t.mul(r,B),p=t.sub(d,B),p=t.mul(r,p),p=t.add(p,c),c=t.add(d,d),d=t.add(c,d),d=t.add(d,B),d=t.mul(d,p),a=t.add(a,d),B=t.mul(f,g),B=t.add(B,B),d=t.mul(B,p),h=t.sub(h,d),c=t.mul(B,z),c=t.add(c,c),c=t.add(c,c),new w(h,a,c)}add(r){V(r);const{px:i,py:o,pz:u}=this,{px:f,py:g,pz:h}=r;let a=t.ZERO,c=t.ZERO,d=t.ZERO;const z=n.a,B=t.mul(n.b,ot);let p=t.mul(i,f),N=t.mul(o,g),Z=t.mul(u,h),H=t.add(i,o),e=t.add(f,g);H=t.mul(H,e),e=t.add(p,N),H=t.sub(H,e),e=t.add(i,u);let s=t.add(f,h);return e=t.mul(e,s),s=t.add(p,Z),e=t.sub(e,s),s=t.add(o,u),a=t.add(g,h),s=t.mul(s,a),a=t.add(N,Z),s=t.sub(s,a),d=t.mul(z,e),a=t.mul(B,Z),d=t.add(a,d),a=t.sub(N,d),d=t.add(N,d),c=t.mul(a,d),N=t.add(p,p),N=t.add(N,p),Z=t.mul(z,Z),e=t.mul(B,e),N=t.add(N,Z),Z=t.sub(p,Z),Z=t.mul(z,Z),e=t.add(e,Z),p=t.mul(N,e),c=t.add(c,p),p=t.mul(s,e),a=t.mul(H,a),a=t.sub(a,p),p=t.mul(H,N),d=t.mul(s,d),d=t.add(d,p),new w(a,c,d)}subtract(r){return this.add(r.negate())}is0(){return this.equals(w.ZERO)}wNAF(r){return L.wNAFCached(this,S,r,i=>{const o=t.invertBatch(i.map(u=>u.pz));return i.map((u,f)=>u.toAffine(o[f])).map(w.fromAffine)})}multiplyUnsafe(r){const i=w.ZERO;if(r===P)return i;if(R(r),r===U)return this;const{endo:o}=n;if(!o)return L.unsafeLadder(this,r);let{k1neg:u,k1:f,k2neg:g,k2:h}=o.splitScalar(r),a=i,c=i,d=this;for(;f>P||h>P;)f&U&&(a=a.add(d)),h&U&&(c=c.add(d)),d=d.double(),f>>=U,h>>=U;return u&&(a=a.negate()),g&&(c=c.negate()),c=new w(t.mul(c.px,o.beta),c.py,c.pz),a.add(c)}multiply(r){R(r);let i=r,o,u;const{endo:f}=n;if(f){const{k1neg:g,k1:h,k2neg:a,k2:c}=f.splitScalar(i);let{p:d,f:z}=this.wNAF(h),{p:B,f:p}=this.wNAF(c);d=L.constTimeNegate(g,d),B=L.constTimeNegate(a,B),B=new w(t.mul(B.px,f.beta),B.py,B.pz),o=d.add(B),u=z.add(p)}else{const{p:g,f:h}=this.wNAF(i);o=g,u=h}return w.normalizeZ([o,u])[0]}multiplyAndAddUnsafe(r,i,o){const u=w.BASE,f=(h,a)=>a===P||a===U||!h.equals(u)?h.multiplyUnsafe(a):h.multiply(a),g=f(this,i).add(f(r,o));return g.is0()?void 0:g}toAffine(r){const{px:i,py:o,pz:u}=this,f=this.is0();r==null&&(r=f?t.ONE:t.inv(u));const g=t.mul(i,r),h=t.mul(o,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:g,y:h}}isTorsionFree(){const{h:r,isTorsionFree:i}=n;if(r===U)return!0;if(i)return i(w,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:r,clearCofactor:i}=n;return r===U?this:i?i(w,this):this.multiplyUnsafe(n.h)}toRawBytes(r=!0){return this.assertValidity(),x(w,this,r)}toHex(r=!0){return m.bytesToHex(this.toRawBytes(r))}}w.BASE=new w(n.Gx,n.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO);const W=n.nBitLength,L=et.wNAF(w,n.endo?Math.ceil(W/2):W);return{CURVE:n,ProjectivePoint:w,normPrivateKeyToScalar:C,weierstrassEquation:T,isWithinCurveOrder:F}}function lt(v){const n=et.validateBasic(v);return m.validateObject(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function ft(v){const n=lt(v),{Fp:t,n:x}=n,O=t.BYTES+1,T=2*t.BYTES+1;function F(e){return P<e&&e<t.ORDER}function R(e){return _.mod(e,x)}function C(e){return _.invert(e,x)}const{ProjectivePoint:S,normPrivateKeyToScalar:V,weierstrassEquation:w,isWithinCurveOrder:W}=it({...n,toBytes(e,s,l){const b=s.toAffine(),E=t.toBytes(b.x),A=m.concatBytes;return l?A(Uint8Array.from([s.hasEvenY()?2:3]),E):A(Uint8Array.from([4]),E,t.toBytes(b.y))},fromBytes(e){const s=e.length,l=e[0],b=e.subarray(1);if(s===O&&(l===2||l===3)){const E=m.bytesToNumberBE(b);if(!F(E))throw new Error("Point is not on curve");const A=w(E);let I=t.sqrt(A);const q=(I&U)===U;return(l&1)===1!==q&&(I=t.neg(I)),{x:E,y:I}}else if(s===T&&l===4){const E=t.fromBytes(b.subarray(0,t.BYTES)),A=t.fromBytes(b.subarray(t.BYTES,2*t.BYTES));return{x:E,y:A}}else throw new Error(`Point of length ${s} was invalid. Expected ${O} compressed bytes or ${T} uncompressed bytes`)}}),L=e=>m.bytesToHex(m.numberToBytesBE(e,n.nByteLength));function y(e){const s=x>>U;return e>s}function r(e){return y(e)?R(-e):e}const i=(e,s,l)=>m.bytesToNumberBE(e.slice(s,l));class o{constructor(s,l,b){this.r=s,this.s=l,this.recovery=b,this.assertValidity()}static fromCompact(s){const l=n.nByteLength;return s=m.ensureBytes("compactSignature",s,l*2),new o(i(s,0,l),i(s,l,2*l))}static fromDER(s){const{r:l,s:b}=$.toSig(m.ensureBytes("DER",s));return new o(l,b)}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(s){return new o(this.r,this.s,s)}recoverPublicKey(s){const{r:l,s:b,recovery:E}=this,A=c(m.ensureBytes("msgHash",s));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const I=E===2||E===3?l+n.n:l;if(I>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const q=E&1?"03":"02",D=S.fromHex(q+L(I)),j=C(I),X=R(-A*j),J=R(b*j),K=S.BASE.multiplyAndAddUnsafe(D,X,J);if(!K)throw new Error("point at infinify");return K.assertValidity(),K}hasHighS(){return y(this.s)}normalizeS(){return this.hasHighS()?new o(this.r,R(-this.s),this.recovery):this}toDERRawBytes(){return m.hexToBytes(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return m.hexToBytes(this.toCompactHex())}toCompactHex(){return L(this.r)+L(this.s)}}const u={isValidPrivateKey(e){try{return V(e),!0}catch{return!1}},normPrivateKeyToScalar:V,randomPrivateKey:()=>{const e=n.randomBytes(t.BYTES+8),s=_.hashToPrivateScalar(e,x);return m.numberToBytesBE(s,n.nByteLength)},precompute(e=8,s=S.BASE){return s._setWindowSize(e),s.multiply(BigInt(3)),s}};function f(e,s=!0){return S.fromPrivateKey(e).toRawBytes(s)}function g(e){const s=e instanceof Uint8Array,l=typeof e=="string",b=(s||l)&&e.length;return s?b===O||b===T:l?b===2*O||b===2*T:e instanceof S}function h(e,s,l=!0){if(g(e))throw new Error("first arg must be private key");if(!g(s))throw new Error("second arg must be public key");return S.fromHex(s).multiply(V(e)).toRawBytes(l)}const a=n.bits2int||function(e){const s=m.bytesToNumberBE(e),l=e.length*8-n.nBitLength;return l>0?s>>BigInt(l):s},c=n.bits2int_modN||function(e){return R(a(e))},d=m.bitMask(n.nBitLength);function z(e){if(typeof e!="bigint")throw new Error("bigint expected");if(!(P<=e&&e<d))throw new Error(`bigint expected < 2^${n.nBitLength}`);return m.numberToBytesBE(e,n.nByteLength)}function B(e,s,l=p){if(["recovered","canonical"].some(k=>k in l))throw new Error("sign() legacy options not supported");const{hash:b,randomBytes:E}=n;let{lowS:A,prehash:I,extraEntropy:q}=l;A==null&&(A=!0),e=m.ensureBytes("msgHash",e),I&&(e=m.ensureBytes("prehashed msgHash",b(e)));const D=c(e),j=V(s),X=[z(j),z(D)];if(q!=null){const k=q===!0?E(t.BYTES):q;X.push(m.ensureBytes("extraEntropy",k,t.BYTES))}const J=m.concatBytes(...X),K=D;function tt(k){const G=a(k);if(!W(G))return;const rt=C(G),M=S.BASE.multiply(G).toAffine(),Y=R(M.x);if(Y===P)return;const Q=R(rt*R(K+Y*j));if(Q===P)return;let nt=(M.x===Y?0:2)|Number(M.y&U),st=Q;return A&&y(Q)&&(st=r(Q),nt^=1),new o(Y,st,nt)}return{seed:J,k2sig:tt}}const p={lowS:n.lowS,prehash:!1},N={lowS:n.lowS,prehash:!1};function Z(e,s,l=p){const{seed:b,k2sig:E}=B(e,s,l),A=n;return m.createHmacDrbg(A.hash.outputLen,A.nByteLength,A.hmac)(b,E)}S.BASE._setWindowSize(8);function H(e,s,l,b=N){var M;const E=e;if(s=m.ensureBytes("msgHash",s),l=m.ensureBytes("publicKey",l),"strict"in b)throw new Error("options.strict was renamed to lowS");const{lowS:A,prehash:I}=b;let q,D;try{if(typeof E=="string"||E instanceof Uint8Array)try{q=o.fromDER(E)}catch(Y){if(!(Y instanceof $.Err))throw Y;q=o.fromCompact(E)}else if(typeof E=="object"&&typeof E.r=="bigint"&&typeof E.s=="bigint"){const{r:Y,s:Q}=E;q=new o(Y,Q)}else throw new Error("PARSE");D=S.fromHex(l)}catch(Y){if(Y.message==="PARSE")throw new Error("signature must be Signature instance, Uint8Array or hex string");return!1}if(A&&q.hasHighS())return!1;I&&(s=n.hash(s));const{r:j,s:X}=q,J=c(s),K=C(X),tt=R(J*K),k=R(j*K),G=(M=S.BASE.multiplyAndAddUnsafe(D,tt,k))==null?void 0:M.toAffine();return G?R(G.x)===j:!1}return{CURVE:n,getPublicKey:f,getSharedSecret:h,sign:Z,verify:H,ProjectivePoint:S,Signature:o,utils:u}}exports.DER=$;exports.weierstrass=ft;exports.weierstrassPoints=it;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const _=require("./modular.cjs"),h=require("./utils.cjs"),et=require("./curve.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(v){const n=et.validateBasic(v);h.validateObject(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:x,a:A}=n;if(t){if(!x.eql(A,x.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:ct,hexToBytes:ut}=h,$={Err:class extends Error{constructor(n=""){super(n)}},_parseInt(v){const{Err:n}=$;if(v.length<2||v[0]!==2)throw new n("Invalid signature integer tag");const t=v[1],x=v.subarray(2,t+2);if(!t||x.length!==t)throw new n("Invalid signature integer: wrong length");if(x[0]&128)throw new n("Invalid signature integer: negative");if(x[0]===0&&!(x[1]&128))throw new n("Invalid signature integer: unnecessary leading zero");return{d:ct(x),l:v.subarray(t+2)}},toSig(v){const{Err:n}=$,t=typeof v=="string"?ut(v):v;if(!h.isBytes(t))throw new Error("ui8a expected");let x=t.length;if(x<2||t[0]!=48)throw new n("Invalid signature tag");if(t[1]!==x-2)throw new n("Invalid signature: incorrect length");const{d:A,l:T}=$._parseInt(t.subarray(2)),{d:P,l:R}=$._parseInt(T);if(R.length)throw new n("Invalid signature: left bytes after parsing");return{r:A,s:P}},hexFromSig(v){const n=S=>Number.parseInt(S[0],16)&8?"00"+S:S,t=S=>{const V=S.toString(16);return V.length&1?`0${V}`:V},x=n(t(v.s)),A=n(t(v.r)),T=x.length/2,P=A.length/2,R=t(T),C=t(P);return`30${t(P+T+4)}02${C}${A}02${R}${x}`}},Y=BigInt(0),F=BigInt(1);BigInt(2);const ot=BigInt(3);BigInt(4);function it(v){const n=at(v),{Fp:t}=n,x=n.toBytes||((m,r,i)=>{const o=r.toAffine();return h.concatBytes(Uint8Array.from([4]),t.toBytes(o.x),t.toBytes(o.y))}),A=n.fromBytes||(m=>{const r=m.subarray(1),i=t.fromBytes(r.subarray(0,t.BYTES)),o=t.fromBytes(r.subarray(t.BYTES,2*t.BYTES));return{x:i,y:o}});function T(m){const{a:r,b:i}=n,o=t.sqr(m),u=t.mul(o,m);return t.add(t.add(u,t.mul(m,r)),i)}if(!t.eql(t.sqr(n.Gy),T(n.Gx)))throw new Error("bad generator point: equation left != right");function P(m){return typeof m=="bigint"&&Y<m&&m<n.n}function R(m){if(!P(m))throw new Error("Expected valid bigint: 0 < bigint < curve.n")}function C(m){const{allowedPrivateKeyLengths:r,nByteLength:i,wrapPrivateKey:o,n:u}=n;if(r&&typeof m!="bigint"){if(h.isBytes(m)&&(m=h.bytesToHex(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:h.bytesToNumberBE(h.ensureBytes("private key",m,i))}catch{throw new Error(`private key must be ${i} bytes, hex or bigint, not ${typeof m}`)}return o&&(f=_.mod(f,u)),R(f),f}const S=new Map;function V(m){if(!(m instanceof w))throw new Error("ProjectivePoint expected")}class w{constructor(r,i,o){if(this.px=r,this.py=i,this.pz=o,r==null||!t.isValid(r))throw new Error("x required");if(i==null||!t.isValid(i))throw new Error("y required");if(o==null||!t.isValid(o))throw new Error("z required")}static fromAffine(r){const{x:i,y:o}=r||{};if(!r||!t.isValid(i)||!t.isValid(o))throw new Error("invalid affine point");if(r instanceof w)throw new Error("projective point not allowed");const u=f=>t.eql(f,t.ZERO);return u(i)&&u(o)?w.ZERO:new w(i,o,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(r){const i=t.invertBatch(r.map(o=>o.pz));return r.map((o,u)=>o.toAffine(i[u])).map(w.fromAffine)}static fromHex(r){const i=w.fromAffine(A(h.ensureBytes("pointHex",r)));return i.assertValidity(),i}static fromPrivateKey(r){return w.BASE.multiply(C(r))}_setWindowSize(r){this._WINDOW_SIZE=r,S.delete(this)}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 o=t.sqr(i),u=T(r);if(!t.eql(o,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")}equals(r){V(r);const{px:i,py:o,pz:u}=this,{px:f,py:g,pz:y}=r,a=t.eql(t.mul(i,y),t.mul(f,u)),c=t.eql(t.mul(o,y),t.mul(g,u));return a&&c}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:r,b:i}=n,o=t.mul(i,ot),{px:u,py:f,pz:g}=this;let y=t.ZERO,a=t.ZERO,c=t.ZERO,d=t.mul(u,u),z=t.mul(f,f),B=t.mul(g,g),p=t.mul(u,f);return p=t.add(p,p),c=t.mul(u,g),c=t.add(c,c),y=t.mul(r,c),a=t.mul(o,B),a=t.add(y,a),y=t.sub(z,a),a=t.add(z,a),a=t.mul(y,a),y=t.mul(p,y),c=t.mul(o,c),B=t.mul(r,B),p=t.sub(d,B),p=t.mul(r,p),p=t.add(p,c),c=t.add(d,d),d=t.add(c,d),d=t.add(d,B),d=t.mul(d,p),a=t.add(a,d),B=t.mul(f,g),B=t.add(B,B),d=t.mul(B,p),y=t.sub(y,d),c=t.mul(B,z),c=t.add(c,c),c=t.add(c,c),new w(y,a,c)}add(r){V(r);const{px:i,py:o,pz:u}=this,{px:f,py:g,pz:y}=r;let a=t.ZERO,c=t.ZERO,d=t.ZERO;const z=n.a,B=t.mul(n.b,ot);let p=t.mul(i,f),N=t.mul(o,g),Z=t.mul(u,y),U=t.add(i,o),e=t.add(f,g);U=t.mul(U,e),e=t.add(p,N),U=t.sub(U,e),e=t.add(i,u);let s=t.add(f,y);return e=t.mul(e,s),s=t.add(p,Z),e=t.sub(e,s),s=t.add(o,u),a=t.add(g,y),s=t.mul(s,a),a=t.add(N,Z),s=t.sub(s,a),d=t.mul(z,e),a=t.mul(B,Z),d=t.add(a,d),a=t.sub(N,d),d=t.add(N,d),c=t.mul(a,d),N=t.add(p,p),N=t.add(N,p),Z=t.mul(z,Z),e=t.mul(B,e),N=t.add(N,Z),Z=t.sub(p,Z),Z=t.mul(z,Z),e=t.add(e,Z),p=t.mul(N,e),c=t.add(c,p),p=t.mul(s,e),a=t.mul(U,a),a=t.sub(a,p),p=t.mul(U,N),d=t.mul(s,d),d=t.add(d,p),new w(a,c,d)}subtract(r){return this.add(r.negate())}is0(){return this.equals(w.ZERO)}wNAF(r){return L.wNAFCached(this,S,r,i=>{const o=t.invertBatch(i.map(u=>u.pz));return i.map((u,f)=>u.toAffine(o[f])).map(w.fromAffine)})}multiplyUnsafe(r){const i=w.ZERO;if(r===Y)return i;if(R(r),r===F)return this;const{endo:o}=n;if(!o)return L.unsafeLadder(this,r);let{k1neg:u,k1:f,k2neg:g,k2:y}=o.splitScalar(r),a=i,c=i,d=this;for(;f>Y||y>Y;)f&F&&(a=a.add(d)),y&F&&(c=c.add(d)),d=d.double(),f>>=F,y>>=F;return u&&(a=a.negate()),g&&(c=c.negate()),c=new w(t.mul(c.px,o.beta),c.py,c.pz),a.add(c)}multiply(r){R(r);let i=r,o,u;const{endo:f}=n;if(f){const{k1neg:g,k1:y,k2neg:a,k2:c}=f.splitScalar(i);let{p:d,f:z}=this.wNAF(y),{p:B,f:p}=this.wNAF(c);d=L.constTimeNegate(g,d),B=L.constTimeNegate(a,B),B=new w(t.mul(B.px,f.beta),B.py,B.pz),o=d.add(B),u=z.add(p)}else{const{p:g,f:y}=this.wNAF(i);o=g,u=y}return w.normalizeZ([o,u])[0]}multiplyAndAddUnsafe(r,i,o){const u=w.BASE,f=(y,a)=>a===Y||a===F||!y.equals(u)?y.multiplyUnsafe(a):y.multiply(a),g=f(this,i).add(f(r,o));return g.is0()?void 0:g}toAffine(r){const{px:i,py:o,pz:u}=this,f=this.is0();r==null&&(r=f?t.ONE:t.inv(u));const g=t.mul(i,r),y=t.mul(o,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:g,y}}isTorsionFree(){const{h:r,isTorsionFree:i}=n;if(r===F)return!0;if(i)return i(w,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:r,clearCofactor:i}=n;return r===F?this:i?i(w,this):this.multiplyUnsafe(n.h)}toRawBytes(r=!0){return this.assertValidity(),x(w,this,r)}toHex(r=!0){return h.bytesToHex(this.toRawBytes(r))}}w.BASE=new w(n.Gx,n.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO);const W=n.nBitLength,L=et.wNAF(w,n.endo?Math.ceil(W/2):W);return{CURVE:n,ProjectivePoint:w,normPrivateKeyToScalar:C,weierstrassEquation:T,isWithinCurveOrder:P}}function lt(v){const n=et.validateBasic(v);return h.validateObject(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function ft(v){const n=lt(v),{Fp:t,n:x}=n,A=t.BYTES+1,T=2*t.BYTES+1;function P(e){return Y<e&&e<t.ORDER}function R(e){return _.mod(e,x)}function C(e){return _.invert(e,x)}const{ProjectivePoint:S,normPrivateKeyToScalar:V,weierstrassEquation:w,isWithinCurveOrder:W}=it({...n,toBytes(e,s,l){const b=s.toAffine(),E=t.toBytes(b.x),O=h.concatBytes;return l?O(Uint8Array.from([s.hasEvenY()?2:3]),E):O(Uint8Array.from([4]),E,t.toBytes(b.y))},fromBytes(e){const s=e.length,l=e[0],b=e.subarray(1);if(s===A&&(l===2||l===3)){const E=h.bytesToNumberBE(b);if(!P(E))throw new Error("Point is not on curve");const O=w(E);let I=t.sqrt(O);const q=(I&F)===F;return(l&1)===1!==q&&(I=t.neg(I)),{x:E,y:I}}else if(s===T&&l===4){const E=t.fromBytes(b.subarray(0,t.BYTES)),O=t.fromBytes(b.subarray(t.BYTES,2*t.BYTES));return{x:E,y:O}}else throw new Error(`Point of length ${s} was invalid. Expected ${A} compressed bytes or ${T} uncompressed bytes`)}}),L=e=>h.bytesToHex(h.numberToBytesBE(e,n.nByteLength));function m(e){const s=x>>F;return e>s}function r(e){return m(e)?R(-e):e}const i=(e,s,l)=>h.bytesToNumberBE(e.slice(s,l));class o{constructor(s,l,b){this.r=s,this.s=l,this.recovery=b,this.assertValidity()}static fromCompact(s){const l=n.nByteLength;return s=h.ensureBytes("compactSignature",s,l*2),new o(i(s,0,l),i(s,l,2*l))}static fromDER(s){const{r:l,s:b}=$.toSig(h.ensureBytes("DER",s));return new o(l,b)}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(s){return new o(this.r,this.s,s)}recoverPublicKey(s){const{r:l,s:b,recovery:E}=this,O=c(h.ensureBytes("msgHash",s));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const I=E===2||E===3?l+n.n:l;if(I>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const q=E&1?"03":"02",D=S.fromHex(q+L(I)),j=C(I),X=R(-O*j),J=R(b*j),K=S.BASE.multiplyAndAddUnsafe(D,X,J);if(!K)throw new Error("point at infinify");return K.assertValidity(),K}hasHighS(){return m(this.s)}normalizeS(){return this.hasHighS()?new o(this.r,R(-this.s),this.recovery):this}toDERRawBytes(){return h.hexToBytes(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return h.hexToBytes(this.toCompactHex())}toCompactHex(){return L(this.r)+L(this.s)}}const u={isValidPrivateKey(e){try{return V(e),!0}catch{return!1}},normPrivateKeyToScalar:V,randomPrivateKey:()=>{const e=_.getMinHashLength(n.n);return _.mapHashToField(n.randomBytes(e),n.n)},precompute(e=8,s=S.BASE){return s._setWindowSize(e),s.multiply(BigInt(3)),s}};function f(e,s=!0){return S.fromPrivateKey(e).toRawBytes(s)}function g(e){const s=h.isBytes(e),l=typeof e=="string",b=(s||l)&&e.length;return s?b===A||b===T:l?b===2*A||b===2*T:e instanceof S}function y(e,s,l=!0){if(g(e))throw new Error("first arg must be private key");if(!g(s))throw new Error("second arg must be public key");return S.fromHex(s).multiply(V(e)).toRawBytes(l)}const a=n.bits2int||function(e){const s=h.bytesToNumberBE(e),l=e.length*8-n.nBitLength;return l>0?s>>BigInt(l):s},c=n.bits2int_modN||function(e){return R(a(e))},d=h.bitMask(n.nBitLength);function z(e){if(typeof e!="bigint")throw new Error("bigint expected");if(!(Y<=e&&e<d))throw new Error(`bigint expected < 2^${n.nBitLength}`);return h.numberToBytesBE(e,n.nByteLength)}function B(e,s,l=p){if(["recovered","canonical"].some(k=>k in l))throw new Error("sign() legacy options not supported");const{hash:b,randomBytes:E}=n;let{lowS:O,prehash:I,extraEntropy:q}=l;O==null&&(O=!0),e=h.ensureBytes("msgHash",e),I&&(e=h.ensureBytes("prehashed msgHash",b(e)));const D=c(e),j=V(s),X=[z(j),z(D)];if(q!=null){const k=q===!0?E(t.BYTES):q;X.push(h.ensureBytes("extraEntropy",k))}const J=h.concatBytes(...X),K=D;function tt(k){const G=a(k);if(!W(G))return;const rt=C(G),M=S.BASE.multiply(G).toAffine(),H=R(M.x);if(H===Y)return;const Q=R(rt*R(K+H*j));if(Q===Y)return;let nt=(M.x===H?0:2)|Number(M.y&F),st=Q;return O&&m(Q)&&(st=r(Q),nt^=1),new o(H,st,nt)}return{seed:J,k2sig:tt}}const p={lowS:n.lowS,prehash:!1},N={lowS:n.lowS,prehash:!1};function Z(e,s,l=p){const{seed:b,k2sig:E}=B(e,s,l),O=n;return h.createHmacDrbg(O.hash.outputLen,O.nByteLength,O.hmac)(b,E)}S.BASE._setWindowSize(8);function U(e,s,l,b=N){var M;const E=e;if(s=h.ensureBytes("msgHash",s),l=h.ensureBytes("publicKey",l),"strict"in b)throw new Error("options.strict was renamed to lowS");const{lowS:O,prehash:I}=b;let q,D;try{if(typeof E=="string"||h.isBytes(E))try{q=o.fromDER(E)}catch(H){if(!(H instanceof $.Err))throw H;q=o.fromCompact(E)}else if(typeof E=="object"&&typeof E.r=="bigint"&&typeof E.s=="bigint"){const{r:H,s:Q}=E;q=new o(H,Q)}else throw new Error("PARSE");D=S.fromHex(l)}catch(H){if(H.message==="PARSE")throw new Error("signature must be Signature instance, Uint8Array or hex string");return!1}if(O&&q.hasHighS())return!1;I&&(s=n.hash(s));const{r:j,s:X}=q,J=c(s),K=C(X),tt=R(J*K),k=R(j*K),G=(M=S.BASE.multiplyAndAddUnsafe(D,tt,k))==null?void 0:M.toAffine();return G?R(G.x)===j:!1}return{CURVE:n,getPublicKey:f,getSharedSecret:y,sign:Z,verify:U,ProjectivePoint:S,Signature:o,utils:u}}exports.DER=$;exports.weierstrass=ft;exports.weierstrassPoints=it;