@ozdao/prometheus-framework 0.2.31 → 0.2.33

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

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

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

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

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

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

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

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

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

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

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

@@ -1,24 +1,24 @@
-import p from "./_assert.js";
-import { Hash as b, createView as l, toBytes as d } from "./utils.js";
-function a(u, t, n, e) {
+import { exists as g, output as b } from "./_assert.js";
+import { Hash as d, createView as p, toBytes as a } from "./utils.js";
+function w(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 {
+class B extends d {
   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);
+    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 = p(this.buffer);
   }
   update(t) {
-    p.exists(this);
+    g(this);
     const { view: n, buffer: e, blockLen: i } = this;
-    t = d(t);
+    t = a(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);
+        const f = p(t);
         for (; i <= o - s; s += i)
           this.process(f, s);
         continue;
@@ -28,21 +28,21 @@ class y extends b {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    p.exists(this), p.output(t, this), this.finished = !0;
+    g(this), b(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;
+    w(e, i - 8, BigInt(this.length * 8), o), this.process(e, 0);
+    const h = p(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)
+    const c = f / 4, l = this.get();
+    if (c > l.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let r = 0; r < c; r++)
-      h.setUint32(4 * r, g[r], o);
+      h.setUint32(4 * r, l[r], o);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -57,5 +57,5 @@ class y extends b {
   }
 }
 export {
-  y as SHA2
+  B as SHA2
 };

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

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

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

@@ -1,8 +1,8 @@
-const e = BigInt(4294967295), s = BigInt(32);
+const e = /* @__PURE__ */ BigInt(4294967295), s = /* @__PURE__ */ 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) {
+function u(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);
@@ -10,15 +10,15 @@ function a(t, o = !1) {
   }
   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 a = (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, _ = (t, o, n) => o << n | t >>> 32 - n, b = (t, o, n) => o << n - 32 | t >>> 64 - n, I = (t, o, n) => t << n - 32 | o >>> 64 - n;
+function N(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 = {
+const U = (t, o, n) => (t >>> 0) + (o >>> 0) + (n >>> 0), p = (t, o, n, r) => o + n + r + (t / 2 ** 32 | 0) | 0, w = (t, o, n, r) => (t >>> 0) + (o >>> 0) + (n >>> 0) + (r >>> 0), y = (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,
+  split: u,
+  toBig: a,
   shrSH: h,
   shrSL: B,
   rotrSH: f,
@@ -28,21 +28,39 @@ const p = (t, o, n) => (t >>> 0) + (o >>> 0) + (n >>> 0), w = (t, o, n, r) => o
   rotr32H: S,
   rotr32L: m,
   rotlSH: A,
-  rotlSL: b,
-  rotlBH: I,
-  rotlBL: N,
-  add: U,
-  add3L: p,
-  add3H: w,
-  add4L: y,
-  add4H: _,
+  rotlSL: _,
+  rotlBH: b,
+  rotlBL: I,
+  add: N,
+  add3L: U,
+  add3H: p,
+  add4L: w,
+  add4H: y,
   add5H: K,
   add5L: x
-};
+}, $ = M;
 export {
-  U as add,
-  M as default,
+  N as add,
+  p as add3H,
+  U as add3L,
+  y as add4H,
+  w as add4L,
+  K as add5H,
+  x as add5L,
+  $ as default,
   d as fromBig,
-  a as split,
-  u as toBig
+  b as rotlBH,
+  I as rotlBL,
+  A as rotlSH,
+  _ as rotlSL,
+  S as rotr32H,
+  m as rotr32L,
+  H as rotrBH,
+  L as rotrBL,
+  f as rotrSH,
+  g as rotrSL,
+  h as shrSH,
+  B as shrSL,
+  u as split,
+  a as toBig
 };

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

@@ -1 +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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./_assert.cjs"),c=require("./utils.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,a.hash(t);const h=c.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 o=this.blockLen,e=new Uint8Array(o);e.set(h.length>o?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 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:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=o,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 d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;

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

@@ -1,26 +1,26 @@
-import a from "./_assert.js";
-import { Hash as c, toBytes as u } from "./utils.js";
-class r extends c {
+import { hash as c, exists as a, bytes as u } from "./_assert.js";
+import { Hash as H, toBytes as p } from "./utils.js";
+class r extends H {
   constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, a.hash(t);
-    const h = u(i);
+    super(), this.finished = !1, this.destroyed = !1, c(t);
+    const h = p(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);
+    const o = this.blockLen, e = new Uint8Array(o);
+    e.set(h.length > o ? 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 a.exists(this), this.iHash.update(t), this;
+    return a(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();
+    a(this), u(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);
@@ -28,16 +28,16 @@ class r extends c {
   }
   _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;
+    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: d } = this;
+    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, 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);
+const l = (n, t, i) => new r(n, t).update(i).digest();
+l.create = (n, t) => new r(n, t);
 export {
   r as HMAC,
-  H as hmac
+  l as hmac
 };

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

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

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

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

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

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

@@ -1,72 +1,72 @@
-import X from "./_assert.js";
+import { number as 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;
+function K(t, l, c, n, e, o) {
+  let f = t[l++] ^ c[n++], s = t[l++] ^ c[n++], m = t[l++] ^ c[n++], x = t[l++] ^ c[n++], h = t[l++] ^ c[n++], y = t[l++] ^ c[n++], S = t[l++] ^ c[n++], d = t[l++] ^ c[n++], k = t[l++] ^ c[n++], a = t[l++] ^ c[n++], w = t[l++] ^ c[n++], b = t[l++] ^ c[n++], D = t[l++] ^ c[n++], I = t[l++] ^ c[n++], F = t[l++] ^ c[n++], M = t[l++] ^ c[n++], g = f, B = s, E = m, L = x, C = h, N = y, z = S, A = d, P = k, U = a, q = w, O = b, 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;
+  e[o++] = f + g | 0, e[o++] = s + B | 0, e[o++] = m + E | 0, e[o++] = x + L | 0, e[o++] = h + C | 0, e[o++] = y + N | 0, e[o++] = S + z | 0, e[o++] = d + A | 0, e[o++] = k + P | 0, e[o++] = a + U | 0, e[o++] = w + q | 0, e[o++] = b + O | 0, e[o++] = D + T | 0, e[o++] = I + V | 0, e[o++] = F + $ | 0, e[o++] = 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 H(t, l, c, n, e) {
+  let o = n + 0, f = n + 16 * e;
+  for (let s = 0; s < 16; s++)
+    c[f + s] = t[l + (2 * e - 1) * 16 + s];
+  for (let s = 0; s < e; s++, o += 16, l += 16)
+    K(c, f, t, l, c, o), s > 0 && (f += 16), K(c, o, t, l += 16, c, f);
 }
-function Y(t, l, n) {
-  const c = W({
+function Y(t, l, c) {
+  const n = 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")
+  }, c), { N: e, r: o, p: f, dkLen: s, asyncTick: m, maxmem: x, onProgress: h } = n;
+  if (X(e), X(o), X(f), X(s), X(m), X(x), h !== void 0 && typeof h != "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)
+  const y = 128 * o, 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 (f < 0 || f > (2 ** 32 - 1) * 32 / m)
+  if (f < 0 || f > (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)
+  if (s < 0 || s > (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);
+  const d = y * (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));
+  const k = R(Q, t, l, { c: 1, dkLen: y * f }), a = G(k), w = G(new Uint8Array(y * e)), b = G(new Uint8Array(y));
   let D = () => {
   };
-  if (k) {
+  if (h) {
     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);
+      M++, h && (!(M % F) || M === I) && h(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 };
+  return { N: e, r: o, p: f, dkLen: s, blockSize32: S, V: w, B32: a, B: k, tmp: b, blockMixCb: D, asyncTick: m };
 }
-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 Z(t, l, c, n, e) {
+  const o = R(Q, t, c, { c: 1, dkLen: l });
+  return c.fill(0), n.fill(0), e.fill(0), o;
 }
-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();
+function i(t, l, c) {
+  const { N: n, r: e, p: o, dkLen: f, blockSize32: s, V: m, B32: x, B: h, tmp: y, blockMixCb: S } = Y(t, l, c);
+  for (let d = 0; d < o; d++) {
+    const k = s * d;
+    for (let a = 0; a < s; a++)
+      m[a] = x[k + a];
+    for (let a = 0, w = 0; a < n - 1; a++)
+      H(m, w, m, w += s, e), S();
+    H(m, (n - 1) * s, x, k, e), S();
+    for (let a = 0; a < n; a++) {
+      const w = x[k + s - 16] % n;
+      for (let b = 0; b < s; b++)
+        y[b] = x[k + b] ^ m[w * s + b];
+      H(y, 0, x, k, e), S();
     }
   }
-  return Z(t, f, k, y, m);
+  return Z(t, f, h, m, y);
 }
 export {
   i as scrypt