@ozdao/prometheus-framework 0.1.63 → 0.1.67

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

@@ -0,0 +1,48 @@
+function r(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 n(e, ...t) {
+  if (!(e instanceof Uint8Array))
+    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 f(e) {
+  if (typeof e != "function" || typeof e.create != "function")
+    throw new Error("Hash should be wrapped by utils.wrapConstructor");
+  r(e.outputLen), r(e.blockLen);
+}
+function u(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 s(e, t) {
+  n(e);
+  const o = t.outputLen;
+  if (e.length < o)
+    throw new Error(`digestInto() expects output buffer of length at least ${o}`);
+}
+const a = {
+  number: r,
+  bool: i,
+  bytes: n,
+  hash: f,
+  exists: u,
+  output: s
+};
+export {
+  i as bool,
+  n as bytes,
+  a as default,
+  u as exists,
+  f as hash,
+  r as number,
+  s as output
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./_assert.cjs"),c=require("./utils.cjs");function d(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 a 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.default.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.default.exists(this),p.default.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;d(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=a;

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

@@ -0,0 +1,61 @@
+import p from "./_assert.js";
+import { Hash as b, createView as l, toBytes as d } from "./utils.js";
+function a(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), h = Number(n & o), f = e ? 4 : 0, c = e ? 0 : 4;
+  u.setUint32(t + f, s, e), u.setUint32(t + c, h, e);
+}
+class y extends b {
+  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 = l(this.buffer);
+  }
+  update(t) {
+    p.exists(this);
+    const { view: n, buffer: e, blockLen: i } = this;
+    t = d(t);
+    const o = t.length;
+    for (let s = 0; s < o; ) {
+      const h = Math.min(i - this.pos, o - s);
+      if (h === i) {
+        const f = l(t);
+        for (; i <= o - s; s += i)
+          this.process(f, s);
+        continue;
+      }
+      e.set(t.subarray(s, s + h), this.pos), this.pos += h, s += h, 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 r = s; r < i; r++)
+      n[r] = 0;
+    a(e, i - 8, BigInt(this.length * 8), o), this.process(e, 0);
+    const h = l(t), f = this.outputLen;
+    if (f % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const c = f / 4, g = this.get();
+    if (c > g.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let r = 0; r < c; r++)
+      h.setUint32(4 * r, g[r], 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: h } = this;
+    return t.length = i, t.pos = h, t.finished = o, t.destroyed = s, i % n && t.buffer.set(e), t;
+  }
+}
+export {
+  y as SHA2
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const c=BigInt(2**32-1),s=BigInt(32);function i(t,n=!1){return n?{h:Number(t&c),l:Number(t>>s&c)}:{h:Number(t>>s&c)|0,l:Number(t&c)|0}}function d(t,n=!1){let o=new Uint32Array(t.length),r=new Uint32Array(t.length);for(let e=0;e<t.length;e++){const{h:l,l:g}=i(t[e],n);[o[e],r[e]]=[l,g]}return[o,r]}const u=(t,n)=>BigInt(t>>>0)<<s|BigInt(n>>>0),B=(t,n,o)=>t>>>o,f=(t,n,o)=>t<<32-o|n>>>o,h=(t,n,o)=>t>>>o|n<<32-o,H=(t,n,o)=>t<<32-o|n>>>o,L=(t,n,o)=>t<<64-o|n>>>o-32,S=(t,n,o)=>t>>>o-32|n<<64-o,m=(t,n)=>n,b=(t,n)=>t,A=(t,n,o)=>t<<o|n>>>32-o,I=(t,n,o)=>n<<o|t>>>32-o,N=(t,n,o)=>n<<o-32|t>>>64-o,_=(t,n,o)=>t<<o-32|n>>>64-o;function a(t,n,o,r){const e=(n>>>0)+(r>>>0);return{h:t+o+(e/2**32|0)|0,l:e|0}}const p=(t,n,o)=>(t>>>0)+(n>>>0)+(o>>>0),y=(t,n,o,r)=>n+o+r+(t/2**32|0)|0,M=(t,n,o,r)=>(t>>>0)+(n>>>0)+(o>>>0)+(r>>>0),U=(t,n,o,r,e)=>n+o+r+e+(t/2**32|0)|0,v=(t,n,o,r,e)=>(t>>>0)+(n>>>0)+(o>>>0)+(r>>>0)+(e>>>0),w=(t,n,o,r,e,l)=>n+o+r+e+l+(t/2**32|0)|0,j={fromBig:i,split:d,toBig:u,shrSH:B,shrSL:f,rotrSH:h,rotrSL:H,rotrBH:L,rotrBL:S,rotr32H:m,rotr32L:b,rotlSH:A,rotlSL:I,rotlBH:N,rotlBL:_,add:a,add3L:p,add3H:y,add4L:M,add4H:U,add5H:w,add5L:v};exports.add=a;exports.default=j;exports.fromBig=i;exports.split=d;exports.toBig=u;

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

@@ -0,0 +1,48 @@
+const e = BigInt(4294967295), s = BigInt(32);
+function d(t, o = !1) {
+  return o ? { h: Number(t & e), l: Number(t >> s & e) } : { h: Number(t >> s & e) | 0, l: Number(t & e) | 0 };
+}
+function a(t, o = !1) {
+  let n = new Uint32Array(t.length), r = new Uint32Array(t.length);
+  for (let c = 0; c < t.length; c++) {
+    const { h: l, l: i } = d(t[c], o);
+    [n[c], r[c]] = [l, i];
+  }
+  return [n, r];
+}
+const u = (t, o) => BigInt(t >>> 0) << s | BigInt(o >>> 0), h = (t, o, n) => t >>> n, B = (t, o, n) => t << 32 - n | o >>> n, f = (t, o, n) => t >>> n | o << 32 - n, g = (t, o, n) => t << 32 - n | o >>> n, H = (t, o, n) => t << 64 - n | o >>> n - 32, L = (t, o, n) => t >>> n - 32 | o << 64 - n, S = (t, o) => o, m = (t, o) => t, A = (t, o, n) => t << n | o >>> 32 - n, b = (t, o, n) => o << n | t >>> 32 - n, I = (t, o, n) => o << n - 32 | t >>> 64 - n, N = (t, o, n) => t << n - 32 | o >>> 64 - n;
+function U(t, o, n, r) {
+  const c = (o >>> 0) + (r >>> 0);
+  return { h: t + n + (c / 2 ** 32 | 0) | 0, l: c | 0 };
+}
+const p = (t, o, n) => (t >>> 0) + (o >>> 0) + (n >>> 0), w = (t, o, n, r) => o + n + r + (t / 2 ** 32 | 0) | 0, y = (t, o, n, r) => (t >>> 0) + (o >>> 0) + (n >>> 0) + (r >>> 0), _ = (t, o, n, r, c) => o + n + r + c + (t / 2 ** 32 | 0) | 0, x = (t, o, n, r, c) => (t >>> 0) + (o >>> 0) + (n >>> 0) + (r >>> 0) + (c >>> 0), K = (t, o, n, r, c, l) => o + n + r + c + l + (t / 2 ** 32 | 0) | 0, M = {
+  fromBig: d,
+  split: a,
+  toBig: u,
+  shrSH: h,
+  shrSL: B,
+  rotrSH: f,
+  rotrSL: g,
+  rotrBH: H,
+  rotrBL: L,
+  rotr32H: S,
+  rotr32L: m,
+  rotlSH: A,
+  rotlSL: b,
+  rotlBH: I,
+  rotlBL: N,
+  add: U,
+  add3L: p,
+  add3H: w,
+  add4L: y,
+  add4H: _,
+  add5H: K,
+  add5L: x
+};
+export {
+  U as add,
+  M as default,
+  d as fromBig,
+  a as split,
+  u as toBig
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

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

@@ -0,0 +1,4 @@
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+export {
+  o as crypto
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./_assert.cjs"),d=require("./utils.cjs");class r extends d.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.default.hash(t);const h=d.toBytes(i);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(h.length>a?t.create().update(h).digest():h);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),e.fill(0)}update(t){return o.default.exists(this),this.iHash.update(t),this}digestInto(t){o.default.exists(this),o.default.bytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:i,iHash:h,finished:a,destroyed:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=u,t.oHash=i._cloneInto(t.oHash),t.iHash=h._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(n,t,i)=>new r(n,t).update(i).digest();c.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=c;

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

@@ -0,0 +1,43 @@
+import a from "./_assert.js";
+import { Hash as c, toBytes as u } from "./utils.js";
+class r extends c {
+  constructor(t, i) {
+    super(), this.finished = !1, this.destroyed = !1, a.hash(t);
+    const h = u(i);
+    if (this.iHash = t.create(), typeof this.iHash.update != "function")
+      throw new Error("Expected instance of class which extends utils.Hash");
+    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+    const o = this.blockLen, s = new Uint8Array(o);
+    s.set(h.length > o ? t.create().update(h).digest() : h);
+    for (let e = 0; e < s.length; e++)
+      s[e] ^= 54;
+    this.iHash.update(s), this.oHash = t.create();
+    for (let e = 0; e < s.length; e++)
+      s[e] ^= 106;
+    this.oHash.update(s), s.fill(0);
+  }
+  update(t) {
+    return a.exists(this), this.iHash.update(t), this;
+  }
+  digestInto(t) {
+    a.exists(this), a.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+  }
+  digest() {
+    const t = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(t), t;
+  }
+  _cloneInto(t) {
+    t || (t = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: i, iHash: h, finished: o, destroyed: s, blockLen: e, outputLen: d } = this;
+    return t = t, t.finished = o, t.destroyed = s, t.blockLen = e, t.outputLen = d, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
+}
+const H = (n, t, i) => new r(n, t).update(i).digest();
+H.create = (n, t) => new r(n, t);
+export {
+  r as HMAC,
+  H as hmac
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./_assert.cjs"),g=require("./hmac.cjs"),w=require("./utils.cjs");function m(n,c,u,o){k.default.hash(n);const a=w.checkOpts({dkLen:32,asyncTick:10},o),{c:i,dkLen:r,asyncTick:t}=a;if(k.default.number(i),k.default.number(r),k.default.number(t),i<1)throw new Error("PBKDF2: iterations (c) should be >= 1");const l=w.toBytes(c),s=w.toBytes(u),d=new Uint8Array(r),f=g.hmac.create(n,l),e=f._cloneInto().update(s);return{c:i,dkLen:r,asyncTick:t,DK:d,PRF:f,PRFSalt:e}}function L(n,c,u,o,a){return n.destroy(),c.destroy(),o&&o.destroy(),a.fill(0),u}function P(n,c,u,o){const{c:a,dkLen:i,DK:r,PRF:t,PRFSalt:l}=m(n,c,u,o);let s;const d=new Uint8Array(4),f=w.createView(d),e=new Uint8Array(t.outputLen);for(let h=1,p=0;p<i;h++,p+=t.outputLen){const y=r.subarray(p,p+t.outputLen);f.setInt32(0,h,!1),(s=l._cloneInto(s)).update(d).digestInto(e),y.set(e.subarray(0,y.length));for(let I=1;I<a;I++){t._cloneInto(s).update(e).digestInto(e);for(let b=0;b<y.length;b++)y[b]^=e[b]}}return L(t,l,r,s,e)}exports.pbkdf2=P;

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

@@ -0,0 +1,32 @@
+import b from "./_assert.js";
+import { hmac as h } from "./hmac.js";
+import { createView as L, checkOpts as F, toBytes as I } from "./utils.js";
+function P(e, c, i, o) {
+  b.hash(e);
+  const u = F({ dkLen: 32, asyncTick: 10 }, o), { c: a, dkLen: r, asyncTick: t } = u;
+  if (b.number(a), b.number(r), b.number(t), a < 1)
+    throw new Error("PBKDF2: iterations (c) should be >= 1");
+  const p = I(c), s = I(i), d = new Uint8Array(r), f = h.create(e, p), n = f._cloneInto().update(s);
+  return { c: a, dkLen: r, asyncTick: t, DK: d, PRF: f, PRFSalt: n };
+}
+function g(e, c, i, o, u) {
+  return e.destroy(), c.destroy(), o && o.destroy(), u.fill(0), i;
+}
+function K(e, c, i, o) {
+  const { c: u, dkLen: a, DK: r, PRF: t, PRFSalt: p } = P(e, c, i, o);
+  let s;
+  const d = new Uint8Array(4), f = L(d), n = new Uint8Array(t.outputLen);
+  for (let k = 1, l = 0; l < a; k++, l += t.outputLen) {
+    const y = r.subarray(l, l + t.outputLen);
+    f.setInt32(0, k, !1), (s = p._cloneInto(s)).update(d).digestInto(n), y.set(n.subarray(0, y.length));
+    for (let w = 1; w < u; w++) {
+      t._cloneInto(s).update(n).digestInto(n);
+      for (let m = 0; m < y.length; m++)
+        y[m] ^= n[m];
+    }
+  }
+  return g(t, p, r, s, n);
+}
+export {
+  K as pbkdf2
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const I=require("./_assert.cjs"),J=require("./sha256.cjs"),K=require("./pbkdf2.cjs"),D=require("./utils.cjs"),t=(r,l)=>r<<l|r>>>32-l;function H(r,l,n,s,e,c){let a=r[l++]^n[s++],o=r[l++]^n[s++],x=r[l++]^n[s++],b=r[l++]^n[s++],d=r[l++]^n[s++],y=r[l++]^n[s++],S=r[l++]^n[s++],h=r[l++]^n[s++],m=r[l++]^n[s++],f=r[l++]^n[s++],w=r[l++]^n[s++],k=r[l++]^n[s++],X=r[l++]^n[s++],$=r[l++]^n[s++],_=r[l++]^n[s++],g=r[l++]^n[s++],M=a,q=o,u=x,B=b,E=d,L=y,C=S,N=h,P=m,z=f,A=w,O=k,T=X,U=$,j=_,V=g;for(let G=0;G<8;G+=2)E^=t(M+T|0,7),P^=t(E+M|0,9),T^=t(P+E|0,13),M^=t(T+P|0,18),z^=t(L+q|0,7),U^=t(z+L|0,9),q^=t(U+z|0,13),L^=t(q+U|0,18),j^=t(A+C|0,7),u^=t(j+A|0,9),C^=t(u+j|0,13),A^=t(C+u|0,18),B^=t(V+O|0,7),N^=t(B+V|0,9),O^=t(N+B|0,13),V^=t(O+N|0,18),q^=t(M+B|0,7),u^=t(q+M|0,9),B^=t(u+q|0,13),M^=t(B+u|0,18),C^=t(L+E|0,7),N^=t(C+L|0,9),E^=t(N+C|0,13),L^=t(E+N|0,18),O^=t(A+z|0,7),P^=t(O+A|0,9),z^=t(P+O|0,13),A^=t(z+P|0,18),T^=t(V+j|0,7),U^=t(T+V|0,9),j^=t(U+T|0,13),V^=t(j+U|0,18);e[c++]=a+M|0,e[c++]=o+q|0,e[c++]=x+u|0,e[c++]=b+B|0,e[c++]=d+E|0,e[c++]=y+L|0,e[c++]=S+C|0,e[c++]=h+N|0,e[c++]=m+P|0,e[c++]=f+z|0,e[c++]=w+A|0,e[c++]=k+O|0,e[c++]=X+T|0,e[c++]=$+U|0,e[c++]=_+j|0,e[c++]=g+V|0}function F(r,l,n,s,e){let c=s+0,a=s+16*e;for(let o=0;o<16;o++)n[a+o]=r[l+(2*e-1)*16+o];for(let o=0;o<e;o++,c+=16,l+=16)H(n,a,r,l,n,c),o>0&&(a+=16),H(n,c,r,l+=16,n,a)}function Q(r,l,n){const s=D.checkOpts({dkLen:32,asyncTick:10,maxmem:1073742848},n),{N:e,r:c,p:a,dkLen:o,asyncTick:x,maxmem:b,onProgress:d}=s;if(I.default.number(e),I.default.number(c),I.default.number(a),I.default.number(o),I.default.number(x),I.default.number(b),d!==void 0&&typeof d!="function")throw new Error("progressCb should be function");const y=128*c,S=y/4;if(e<=1||e&e-1||e>=2**(y/8)||e>2**32)throw new Error("Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32");if(a<0||a>(2**32-1)*32/y)throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");if(o<0||o>(2**32-1)*32)throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");const h=y*(e+a);if(h>b)throw new Error(`Scrypt: parameters too large, ${h} (128 * r * (N + p)) > ${b} (maxmem)`);const m=K.pbkdf2(J.sha256,r,l,{c:1,dkLen:y*a}),f=D.u32(m),w=D.u32(new Uint8Array(y*e)),k=D.u32(new Uint8Array(y));let X=()=>{};if(d){const $=2*e*a,_=Math.max(Math.floor($/1e4),1);let g=0;X=()=>{g++,d&&(!(g%_)||g===$)&&d(g/$)}}return{N:e,r:c,p:a,dkLen:o,blockSize32:S,V:w,B32:f,B:m,tmp:k,blockMixCb:X,asyncTick:x}}function R(r,l,n,s,e){const c=K.pbkdf2(J.sha256,r,n,{c:1,dkLen:l});return n.fill(0),s.fill(0),e.fill(0),c}function W(r,l,n){const{N:s,r:e,p:c,dkLen:a,blockSize32:o,V:x,B32:b,B:d,tmp:y,blockMixCb:S}=Q(r,l,n);for(let h=0;h<c;h++){const m=o*h;for(let f=0;f<o;f++)x[f]=b[m+f];for(let f=0,w=0;f<s-1;f++)F(x,w,x,w+=o,e),S();F(x,(s-1)*o,b,m,e),S();for(let f=0;f<s;f++){const w=b[m+o-16]%s;for(let k=0;k<o;k++)y[k]=b[m+k]^x[w*o+k];F(y,0,b,m,e),S()}}return R(r,a,d,x,y)}exports.scrypt=W;

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

@@ -0,0 +1,73 @@
+import X from "./_assert.js";
+import { sha256 as Q } from "./sha256.js";
+import { pbkdf2 as R } from "./pbkdf2.js";
+import { checkOpts as W, u32 as G } from "./utils.js";
+const r = (t, l) => t << l | t >>> 32 - l;
+function K(t, l, n, c, e, s) {
+  let f = t[l++] ^ n[c++], o = t[l++] ^ n[c++], y = t[l++] ^ n[c++], x = t[l++] ^ n[c++], k = t[l++] ^ n[c++], m = t[l++] ^ n[c++], S = t[l++] ^ n[c++], d = t[l++] ^ n[c++], b = t[l++] ^ n[c++], a = t[l++] ^ n[c++], w = t[l++] ^ n[c++], h = t[l++] ^ n[c++], D = t[l++] ^ n[c++], I = t[l++] ^ n[c++], F = t[l++] ^ n[c++], M = t[l++] ^ n[c++], g = f, B = o, E = y, L = x, C = k, N = m, z = S, A = d, P = b, U = a, q = w, O = h, T = D, V = I, $ = F, j = M;
+  for (let J = 0; J < 8; J += 2)
+    C ^= r(g + T | 0, 7), P ^= r(C + g | 0, 9), T ^= r(P + C | 0, 13), g ^= r(T + P | 0, 18), U ^= r(N + B | 0, 7), V ^= r(U + N | 0, 9), B ^= r(V + U | 0, 13), N ^= r(B + V | 0, 18), $ ^= r(q + z | 0, 7), E ^= r($ + q | 0, 9), z ^= r(E + $ | 0, 13), q ^= r(z + E | 0, 18), L ^= r(j + O | 0, 7), A ^= r(L + j | 0, 9), O ^= r(A + L | 0, 13), j ^= r(O + A | 0, 18), B ^= r(g + L | 0, 7), E ^= r(B + g | 0, 9), L ^= r(E + B | 0, 13), g ^= r(L + E | 0, 18), z ^= r(N + C | 0, 7), A ^= r(z + N | 0, 9), C ^= r(A + z | 0, 13), N ^= r(C + A | 0, 18), O ^= r(q + U | 0, 7), P ^= r(O + q | 0, 9), U ^= r(P + O | 0, 13), q ^= r(U + P | 0, 18), T ^= r(j + $ | 0, 7), V ^= r(T + j | 0, 9), $ ^= r(V + T | 0, 13), j ^= r($ + V | 0, 18);
+  e[s++] = f + g | 0, e[s++] = o + B | 0, e[s++] = y + E | 0, e[s++] = x + L | 0, e[s++] = k + C | 0, e[s++] = m + N | 0, e[s++] = S + z | 0, e[s++] = d + A | 0, e[s++] = b + P | 0, e[s++] = a + U | 0, e[s++] = w + q | 0, e[s++] = h + O | 0, e[s++] = D + T | 0, e[s++] = I + V | 0, e[s++] = F + $ | 0, e[s++] = M + j | 0;
+}
+function H(t, l, n, c, e) {
+  let s = c + 0, f = c + 16 * e;
+  for (let o = 0; o < 16; o++)
+    n[f + o] = t[l + (2 * e - 1) * 16 + o];
+  for (let o = 0; o < e; o++, s += 16, l += 16)
+    K(n, f, t, l, n, s), o > 0 && (f += 16), K(n, s, t, l += 16, n, f);
+}
+function Y(t, l, n) {
+  const c = W({
+    dkLen: 32,
+    asyncTick: 10,
+    maxmem: 1073742848
+  }, n), { N: e, r: s, p: f, dkLen: o, asyncTick: y, maxmem: x, onProgress: k } = c;
+  if (X.number(e), X.number(s), X.number(f), X.number(o), X.number(y), X.number(x), k !== void 0 && typeof k != "function")
+    throw new Error("progressCb should be function");
+  const m = 128 * s, S = m / 4;
+  if (e <= 1 || e & e - 1 || e >= 2 ** (m / 8) || e > 2 ** 32)
+    throw new Error("Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32");
+  if (f < 0 || f > (2 ** 32 - 1) * 32 / m)
+    throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");
+  if (o < 0 || o > (2 ** 32 - 1) * 32)
+    throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");
+  const d = m * (e + f);
+  if (d > x)
+    throw new Error(`Scrypt: parameters too large, ${d} (128 * r * (N + p)) > ${x} (maxmem)`);
+  const b = R(Q, t, l, { c: 1, dkLen: m * f }), a = G(b), w = G(new Uint8Array(m * e)), h = G(new Uint8Array(m));
+  let D = () => {
+  };
+  if (k) {
+    const I = 2 * e * f, F = Math.max(Math.floor(I / 1e4), 1);
+    let M = 0;
+    D = () => {
+      M++, k && (!(M % F) || M === I) && k(M / I);
+    };
+  }
+  return { N: e, r: s, p: f, dkLen: o, blockSize32: S, V: w, B32: a, B: b, tmp: h, blockMixCb: D, asyncTick: y };
+}
+function Z(t, l, n, c, e) {
+  const s = R(Q, t, n, { c: 1, dkLen: l });
+  return n.fill(0), c.fill(0), e.fill(0), s;
+}
+function i(t, l, n) {
+  const { N: c, r: e, p: s, dkLen: f, blockSize32: o, V: y, B32: x, B: k, tmp: m, blockMixCb: S } = Y(t, l, n);
+  for (let d = 0; d < s; d++) {
+    const b = o * d;
+    for (let a = 0; a < o; a++)
+      y[a] = x[b + a];
+    for (let a = 0, w = 0; a < c - 1; a++)
+      H(y, w, y, w += o, e), S();
+    H(y, (c - 1) * o, x, b, e), S();
+    for (let a = 0; a < c; a++) {
+      const w = x[b + o - 16] % c;
+      for (let h = 0; h < o; h++)
+        m[h] = x[b + h] ^ y[w * o + h];
+      H(m, 0, x, b, e), S();
+    }
+  }
+  return Z(t, f, k, y, m);
+}
+export {
+  i as scrypt
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./_sha2.cjs"),c=require("./utils.cjs"),w=(n,a,e)=>n&a^~n&e,S=(n,a,e)=>n&a^n&e^a&e,y=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),h=new Uint32Array(64);class g extends p.SHA2{constructor(){super(64,32,8,!1),this.A=b[0]|0,this.B=b[1]|0,this.C=b[2]|0,this.D=b[3]|0,this.E=b[4]|0,this.F=b[5]|0,this.G=b[6]|0,this.H=b[7]|0}get(){const{A:a,B:e,C:s,D:i,E:r,F:o,G:x,H:f}=this;return[a,e,s,i,r,o,x,f]}set(a,e,s,i,r,o,x,f){this.A=a|0,this.B=e|0,this.C=s|0,this.D=i|0,this.E=r|0,this.F=o|0,this.G=x|0,this.H=f|0}process(a,e){for(let t=0;t<16;t++,e+=4)h[t]=a.getUint32(e,!1);for(let t=16;t<64;t++){const A=h[t-15],l=h[t-2],C=c.rotr(A,7)^c.rotr(A,18)^A>>>3,H=c.rotr(l,17)^c.rotr(l,19)^l>>>10;h[t]=H+h[t-7]+C+h[t-16]|0}let{A:s,B:i,C:r,D:o,E:x,F:f,G:d,H:u}=this;for(let t=0;t<64;t++){const A=c.rotr(x,6)^c.rotr(x,11)^c.rotr(x,25),l=u+A+w(x,f,d)+y[t]+h[t]|0,H=(c.rotr(s,2)^c.rotr(s,13)^c.rotr(s,22))+S(s,i,r)|0;u=d,d=f,f=x,x=o+l|0,o=r,r=i,i=s,s=l+H|0}s=s+this.A|0,i=i+this.B|0,r=r+this.C|0,o=o+this.D|0,x=x+this.E|0,f=f+this.F|0,d=d+this.G|0,u=u+this.H|0,this.set(s,i,r,o,x,f,d,u)}roundClean(){h.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}class B extends g{constructor(){super(),this.A=-1056596264,this.B=914150663,this.C=812702999,this.D=-150054599,this.E=-4191439,this.F=1750603025,this.G=1694076839,this.H=-1090891868,this.outputLen=28}}const D=c.wrapConstructor(()=>new g);c.wrapConstructor(()=>new B);exports.sha256=D;

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

@@ -0,0 +1,120 @@
+import { SHA2 as w } from "./_sha2.js";
+import { wrapConstructor as p, rotr as b } from "./utils.js";
+const B = (r, e, c) => r & e ^ ~r & c, D = (r, e, c) => r & e ^ r & c ^ e & c, E = new Uint32Array([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), n = new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), o = new Uint32Array(64);
+class m extends w {
+  constructor() {
+    super(64, 32, 8, !1), this.A = n[0] | 0, this.B = n[1] | 0, this.C = n[2] | 0, this.D = n[3] | 0, this.E = n[4] | 0, this.F = n[5] | 0, this.G = n[6] | 0, this.H = n[7] | 0;
+  }
+  get() {
+    const { A: e, B: c, C: t, D: a, E: i, F: h, G: s, H: f } = this;
+    return [e, c, t, a, i, h, s, f];
+  }
+  // prettier-ignore
+  set(e, c, t, a, i, h, s, f) {
+    this.A = e | 0, this.B = c | 0, this.C = t | 0, this.D = a | 0, this.E = i | 0, this.F = h | 0, this.G = s | 0, this.H = f | 0;
+  }
+  process(e, c) {
+    for (let x = 0; x < 16; x++, c += 4)
+      o[x] = e.getUint32(c, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = o[x - 15], A = o[x - 2], C = b(H, 7) ^ b(H, 18) ^ H >>> 3, u = b(A, 17) ^ b(A, 19) ^ A >>> 10;
+      o[x] = u + o[x - 7] + C + o[x - 16] | 0;
+    }
+    let { A: t, B: a, C: i, D: h, E: s, F: f, G: d, H: l } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = b(s, 6) ^ b(s, 11) ^ b(s, 25), A = l + H + B(s, f, d) + E[x] + o[x] | 0, u = (b(t, 2) ^ b(t, 13) ^ b(t, 22)) + D(t, a, i) | 0;
+      l = d, d = f, f = s, s = h + A | 0, h = i, i = a, a = t, t = A + u | 0;
+    }
+    t = t + this.A | 0, a = a + this.B | 0, i = i + this.C | 0, h = h + this.D | 0, s = s + this.E | 0, f = f + this.F | 0, d = d + this.G | 0, l = l + this.H | 0, this.set(t, a, i, h, s, f, d, l);
+  }
+  roundClean() {
+    o.fill(0);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
+  }
+}
+class F extends m {
+  constructor() {
+    super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
+  }
+}
+const S = p(() => new m());
+p(() => new F());
+export {
+  S as sha256
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./_assert.cjs"),d=require("./_u64.cjs"),a=require("./utils.cjs"),[y,b,L]=[[],[],[]],H=BigInt(0),l=BigInt(1),S=BigInt(2),T=BigInt(7),F=BigInt(256),X=BigInt(113);for(let n=0,t=l,s=1,i=0;n<24;n++){[s,i]=[i,(2*s+3*i)%5],y.push(2*(5*i+s)),b.push((n+1)*(n+2)/2%64);let o=H;for(let r=0;r<7;r++)t=(t<<l^(t>>T)*X)%F,t&S&&(o^=l<<(l<<BigInt(r))-l);L.push(o)}const[m,P]=d.default.split(L,!0),I=(n,t,s)=>s>32?d.default.rotlBH(n,t,s):d.default.rotlSH(n,t,s),w=(n,t,s)=>s>32?d.default.rotlBL(n,t,s):d.default.rotlSL(n,t,s);function _(n,t=24){const s=new Uint32Array(10);for(let i=24-t;i<24;i++){for(let e=0;e<10;e++)s[e]=n[e]^n[e+10]^n[e+20]^n[e+30]^n[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,k=(e+2)%10,x=s[k],u=s[k+1],B=I(x,u,1)^s[h],A=w(x,u,1)^s[h+1];for(let O=0;O<50;O+=10)n[e+O]^=B,n[e+O+1]^=A}let o=n[2],r=n[3];for(let e=0;e<24;e++){const h=b[e],k=I(o,r,h),x=w(o,r,h),u=y[e];o=n[u],r=n[u+1],n[u]=k,n[u+1]=x}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=n[e+h];for(let h=0;h<10;h++)n[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}n[0]^=m[i],n[1]^=P[i]}s.fill(0)}class p extends a.Hash{constructor(t,s,i,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=i,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,f.default.number(i),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=a.u32(this.state)}keccak(){_(this.state32,this.rounds),this.posOut=0,this.pos=0}update(t){f.default.exists(this);const{blockLen:s,state:i}=this;t=a.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)i[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:i,blockLen:o}=this;t[i]^=s,s&128&&i===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){f.default.exists(this,!1),f.default.bytes(t),this.finish();const s=this.state,{blockLen:i}=this;for(let o=0,r=t.length;o<r;){this.posOut>=i&&this.keccak();const e=Math.min(i-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return f.default.number(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(f.default.output(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:i,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new p(s,i,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=i,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const c=(n,t,s)=>a.wrapConstructor(()=>new p(t,n,s));c(6,144,224/8);c(6,136,256/8);c(6,104,384/8);c(6,72,512/8);c(1,144,224/8);const U=c(1,136,256/8);c(1,104,384/8);c(1,72,512/8);const g=(n,t,s)=>a.wrapXOFConstructorWithOpts((i={})=>new p(t,n,i.dkLen===void 0?s:i.dkLen,!0));g(31,168,128/8);g(31,136,256/8);exports.Keccak=p;exports.keccakP=_;exports.keccak_256=U;

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

@@ -0,0 +1,118 @@
+import u from "./_assert.js";
+import a from "./_u64.js";
+import { wrapConstructor as B, wrapXOFConstructorWithOpts as A, Hash as H, u32 as m, toBytes as S } from "./utils.js";
+const [w, L, y] = [[], [], []], T = BigInt(0), l = BigInt(1), F = BigInt(2), X = BigInt(7), U = BigInt(256), E = BigInt(113);
+for (let n = 0, t = l, s = 1, i = 0; n < 24; n++) {
+  [s, i] = [i, (2 * s + 3 * i) % 5], w.push(2 * (5 * i + s)), L.push((n + 1) * (n + 2) / 2 % 64);
+  let o = T;
+  for (let r = 0; r < 7; r++)
+    t = (t << l ^ (t >> X) * E) % U, t & F && (o ^= l << (l << BigInt(r)) - l);
+  y.push(o);
+}
+const [P, C] = a.split(y, !0), O = (n, t, s) => s > 32 ? a.rotlBH(n, t, s) : a.rotlSH(n, t, s), I = (n, t, s) => s > 32 ? a.rotlBL(n, t, s) : a.rotlSL(n, t, s);
+function M(n, t = 24) {
+  const s = new Uint32Array(10);
+  for (let i = 24 - t; i < 24; i++) {
+    for (let e = 0; e < 10; e++)
+      s[e] = n[e] ^ n[e + 10] ^ n[e + 20] ^ n[e + 30] ^ n[e + 40];
+    for (let e = 0; e < 10; e += 2) {
+      const h = (e + 8) % 10, p = (e + 2) % 10, d = s[p], f = s[p + 1], g = O(d, f, 1) ^ s[h], _ = I(d, f, 1) ^ s[h + 1];
+      for (let x = 0; x < 50; x += 10)
+        n[e + x] ^= g, n[e + x + 1] ^= _;
+    }
+    let o = n[2], r = n[3];
+    for (let e = 0; e < 24; e++) {
+      const h = L[e], p = O(o, r, h), d = I(o, r, h), f = w[e];
+      o = n[f], r = n[f + 1], n[f] = p, n[f + 1] = d;
+    }
+    for (let e = 0; e < 50; e += 10) {
+      for (let h = 0; h < 10; h++)
+        s[h] = n[e + h];
+      for (let h = 0; h < 10; h++)
+        n[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+    }
+    n[0] ^= P[i], n[1] ^= C[i];
+  }
+  s.fill(0);
+}
+class k extends H {
+  // NOTE: we accept arguments in bytes instead of bits here.
+  constructor(t, s, i, o = !1, r = 24) {
+    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = i, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, u.number(i), 0 >= this.blockLen || this.blockLen >= 200)
+      throw new Error("Sha3 supports only keccak-f1600 function");
+    this.state = new Uint8Array(200), this.state32 = m(this.state);
+  }
+  keccak() {
+    M(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
+  }
+  update(t) {
+    u.exists(this);
+    const { blockLen: s, state: i } = this;
+    t = S(t);
+    const o = t.length;
+    for (let r = 0; r < o; ) {
+      const e = Math.min(s - this.pos, o - r);
+      for (let h = 0; h < e; h++)
+        i[this.pos++] ^= t[r++];
+      this.pos === s && this.keccak();
+    }
+    return this;
+  }
+  finish() {
+    if (this.finished)
+      return;
+    this.finished = !0;
+    const { state: t, suffix: s, pos: i, blockLen: o } = this;
+    t[i] ^= s, s & 128 && i === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
+  }
+  writeInto(t) {
+    u.exists(this, !1), u.bytes(t), this.finish();
+    const s = this.state, { blockLen: i } = this;
+    for (let o = 0, r = t.length; o < r; ) {
+      this.posOut >= i && this.keccak();
+      const e = Math.min(i - this.posOut, r - o);
+      t.set(s.subarray(this.posOut, this.posOut + e), o), this.posOut += e, o += e;
+    }
+    return t;
+  }
+  xofInto(t) {
+    if (!this.enableXOF)
+      throw new Error("XOF is not possible for this instance");
+    return this.writeInto(t);
+  }
+  xof(t) {
+    return u.number(t), this.xofInto(new Uint8Array(t));
+  }
+  digestInto(t) {
+    if (u.output(t, this), this.finished)
+      throw new Error("digest() was already called");
+    return this.writeInto(t), this.destroy(), t;
+  }
+  digest() {
+    return this.digestInto(new Uint8Array(this.outputLen));
+  }
+  destroy() {
+    this.destroyed = !0, this.state.fill(0);
+  }
+  _cloneInto(t) {
+    const { blockLen: s, suffix: i, outputLen: o, rounds: r, enableXOF: e } = this;
+    return t || (t = new k(s, i, o, e, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = i, t.outputLen = o, t.enableXOF = e, t.destroyed = this.destroyed, t;
+  }
+}
+const c = (n, t, s) => B(() => new k(t, n, s));
+c(6, 144, 224 / 8);
+c(6, 136, 256 / 8);
+c(6, 104, 384 / 8);
+c(6, 72, 512 / 8);
+c(1, 144, 224 / 8);
+const q = c(1, 136, 256 / 8);
+c(1, 104, 384 / 8);
+c(1, 72, 512 / 8);
+const b = (n, t, s) => A((i = {}) => new k(t, n, i.dkLen === void 0 ? s : i.dkLen, !0));
+b(31, 168, 128 / 8);
+b(31, 136, 256 / 8);
+export {
+  k as Keccak,
+  M as keccakP,
+  q as keccak_256
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const I=require("./_sha2.cjs"),t=require("./_u64.cjs"),m=require("./utils.cjs"),[J,K]=t.default.split(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map(F=>BigInt(F))),C=new Uint32Array(80),L=new Uint32Array(80);class g extends I.SHA2{constructor(){super(128,64,16,!1),this.Ah=1779033703,this.Al=-205731576,this.Bh=-1150833019,this.Bl=-2067093701,this.Ch=1013904242,this.Cl=-23791573,this.Dh=-1521486534,this.Dl=1595750129,this.Eh=1359893119,this.El=-1377402159,this.Fh=-1694144372,this.Fl=725511199,this.Gh=528734635,this.Gl=-79577749,this.Hh=1541459225,this.Hl=327033209}get(){const{Ah:E,Al:D,Bh:h,Bl:a,Ch:c,Cl:f,Dh:l,Dl:x,Eh:u,El:n,Fh:s,Fl:d,Gh:b,Gl:i,Hh:r,Hl:o}=this;return[E,D,h,a,c,f,l,x,u,n,s,d,b,i,r,o]}set(E,D,h,a,c,f,l,x,u,n,s,d,b,i,r,o){this.Ah=E|0,this.Al=D|0,this.Bh=h|0,this.Bl=a|0,this.Ch=c|0,this.Cl=f|0,this.Dh=l|0,this.Dl=x|0,this.Eh=u|0,this.El=n|0,this.Fh=s|0,this.Fl=d|0,this.Gh=b|0,this.Gl=i|0,this.Hh=r|0,this.Hl=o|0}process(E,D){for(let e=0;e<16;e++,D+=4)C[e]=E.getUint32(D),L[e]=E.getUint32(D+=4);for(let e=16;e<80;e++){const S=C[e-15]|0,B=L[e-15]|0,U=t.default.rotrSH(S,B,1)^t.default.rotrSH(S,B,8)^t.default.shrSH(S,B,7),W=t.default.rotrSL(S,B,1)^t.default.rotrSL(S,B,8)^t.default.shrSL(S,B,7),H=C[e-2]|0,A=L[e-2]|0,_=t.default.rotrSH(H,A,19)^t.default.rotrBH(H,A,61)^t.default.shrSH(H,A,6),y=t.default.rotrSL(H,A,19)^t.default.rotrBL(H,A,61)^t.default.shrSL(H,A,6),w=t.default.add4L(W,y,L[e-7],L[e-16]),M=t.default.add4H(w,U,_,C[e-7],C[e-16]);C[e]=M|0,L[e]=w|0}let{Ah:h,Al:a,Bh:c,Bl:f,Ch:l,Cl:x,Dh:u,Dl:n,Eh:s,El:d,Fh:b,Fl:i,Gh:r,Gl:o,Hh:G,Hl:p}=this;for(let e=0;e<80;e++){const S=t.default.rotrSH(s,d,14)^t.default.rotrSH(s,d,18)^t.default.rotrBH(s,d,41),B=t.default.rotrSL(s,d,14)^t.default.rotrSL(s,d,18)^t.default.rotrBL(s,d,41),U=s&b^~s&r,W=d&i^~d&o,H=t.default.add5L(p,B,W,K[e],L[e]),A=t.default.add5H(H,G,S,U,J[e],C[e]),_=H|0,y=t.default.rotrSH(h,a,28)^t.default.rotrBH(h,a,34)^t.default.rotrBH(h,a,39),w=t.default.rotrSL(h,a,28)^t.default.rotrBL(h,a,34)^t.default.rotrBL(h,a,39),M=h&c^h&l^c&l,q=a&f^a&x^f&x;G=r|0,p=o|0,r=b|0,o=i|0,b=s|0,i=d|0,{h:s,l:d}=t.default.add(u|0,n|0,A|0,_|0),u=l|0,n=x|0,l=c|0,x=f|0,c=h|0,f=a|0;const T=t.default.add3L(_,w,q);h=t.default.add3H(T,A,y,M),a=T|0}({h,l:a}=t.default.add(this.Ah|0,this.Al|0,h|0,a|0)),{h:c,l:f}=t.default.add(this.Bh|0,this.Bl|0,c|0,f|0),{h:l,l:x}=t.default.add(this.Ch|0,this.Cl|0,l|0,x|0),{h:u,l:n}=t.default.add(this.Dh|0,this.Dl|0,u|0,n|0),{h:s,l:d}=t.default.add(this.Eh|0,this.El|0,s|0,d|0),{h:b,l:i}=t.default.add(this.Fh|0,this.Fl|0,b|0,i|0),{h:r,l:o}=t.default.add(this.Gh|0,this.Gl|0,r|0,o|0),{h:G,l:p}=t.default.add(this.Hh|0,this.Hl|0,G|0,p|0),this.set(h,a,c,f,l,x,u,n,s,d,b,i,r,o,G,p)}roundClean(){C.fill(0),L.fill(0)}destroy(){this.buffer.fill(0),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class j extends g{constructor(){super(),this.Ah=-1942145080,this.Al=424955298,this.Bh=1944164710,this.Bl=-1982016298,this.Ch=502970286,this.Cl=855612546,this.Dh=1738396948,this.Dl=1479516111,this.Eh=258812777,this.El=2077511080,this.Fh=2011393907,this.Fl=79989058,this.Gh=1067287976,this.Gl=1780299464,this.Hh=286451373,this.Hl=-1848208735,this.outputLen=28}}class O extends g{constructor(){super(),this.Ah=573645204,this.Al=-64227540,this.Bh=-1621794909,this.Bl=-934517566,this.Ch=596883563,this.Cl=1867755857,this.Dh=-1774684391,this.Dl=1497426621,this.Eh=-1775747358,this.El=-1467023389,this.Fh=-1101128155,this.Fl=1401305490,this.Gh=721525244,this.Gl=746961066,this.Hh=246885852,this.Hl=-2117784414,this.outputLen=32}}class P extends g{constructor(){super(),this.Ah=-876896931,this.Al=-1056596264,this.Bh=1654270250,this.Bl=914150663,this.Ch=-1856437926,this.Cl=812702999,this.Dh=355462360,this.Dl=-150054599,this.Eh=1731405415,this.El=-4191439,this.Fh=-1900787065,this.Fl=1750603025,this.Gh=-619958771,this.Gl=1694076839,this.Hh=1203062813,this.Hl=-1090891868,this.outputLen=48}}const k=m.wrapConstructor(()=>new g);m.wrapConstructor(()=>new j);m.wrapConstructor(()=>new O);m.wrapConstructor(()=>new P);exports.SHA512=g;exports.sha512=k;