@argent/x-shared 1.37.0 → 1.38.1

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js

@@ -0,0 +1,47 @@
+import { crypto as o } from "./crypto.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const c = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!c)
+  throw new Error("Non little-endian hardware is not supported");
+Array.from({ length: 256 }, (t, r) => r.toString(16).padStart(2, "0"));
+function s(t) {
+  if (typeof t != "string")
+    throw new TypeError(`utf8ToBytes expected string, got ${typeof t}`);
+  return new TextEncoder().encode(t);
+}
+function p(t) {
+  if (typeof t == "string" && (t = s(t)), !(t instanceof Uint8Array))
+    throw new TypeError(`Expected input type is Uint8Array (got ${typeof t})`);
+  return t;
+}
+function y(...t) {
+  if (!t.every((e) => e instanceof Uint8Array))
+    throw new Error("Uint8Array list expected");
+  if (t.length === 1)
+    return t[0];
+  const r = t.reduce((e, n) => e + n.length, 0), i = new Uint8Array(r);
+  for (let e = 0, n = 0; e < t.length; e++) {
+    const f = t[e];
+    i.set(f, n), n += f.length;
+  }
+  return i;
+}
+class l {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
+  }
+}
+function w(t = 32) {
+  if (o && typeof o.getRandomValues == "function")
+    return o.getRandomValues(new Uint8Array(t));
+  throw new Error("crypto.getRandomValues must be defined");
+}
+export {
+  l as Hash,
+  y as concatBytes,
+  c as isLE,
+  w as randomBytes,
+  p as toBytes,
+  s as utf8ToBytes
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_assert.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`Wrong positive integer: ${e}`)}function i(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function n(e,...t){if(!i(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 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 u(e,t){n(e);const r=t.outputLen;if(e.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=n;exports.exists=s;exports.number=o;exports.output=u;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_assert.js

@@ -0,0 +1,31 @@
+function i(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error(`Wrong positive integer: ${e}`);
+}
+function n(e) {
+  return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
+}
+function o(e, ...t) {
+  if (!n(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 f(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) {
+  o(e);
+  const r = t.outputLen;
+  if (e.length < r)
+    throw new Error(`digestInto() expects output buffer of length at least ${r}`);
+}
+export {
+  o as bytes,
+  f as exists,
+  i as number,
+  s as output
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/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 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/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_sha2.js

@@ -0,0 +1,61 @@
+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 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 = p(this.buffer);
+  }
+  update(t) {
+    g(this);
+    const { view: n, buffer: e, blockLen: i } = this;
+    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 = p(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) {
+    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;
+    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, 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, l[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 {
+  B as SHA2
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_u64.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_u64.js

@@ -0,0 +1,21 @@
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function f(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
+  for (let e = 0; e < t.length; e++) {
+    const { h: c, l: u } = f(t[e], r);
+    [n[e], l[e]] = [c, u];
+  }
+  return [n, l];
+}
+const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
+export {
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha256.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./_sha2.cjs"),e=require("./utils.cjs"),y=(n,a,c)=>n&a^~n&c,S=(n,a,c)=>n&a^n&c^a&c,w=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]),o=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),h=new Uint32Array(64);class B extends g.SHA2{constructor(){super(64,32,8,!1),this.A=o[0]|0,this.B=o[1]|0,this.C=o[2]|0,this.D=o[3]|0,this.E=o[4]|0,this.F=o[5]|0,this.G=o[6]|0,this.H=o[7]|0}get(){const{A:a,B:c,C:x,D:r,E:i,F:b,G:s,H:f}=this;return[a,c,x,r,i,b,s,f]}set(a,c,x,r,i,b,s,f){this.A=a|0,this.B=c|0,this.C=x|0,this.D=r|0,this.E=i|0,this.F=b|0,this.G=s|0,this.H=f|0}process(a,c){for(let t=0;t<16;t++,c+=4)h[t]=a.getUint32(c,!1);for(let t=16;t<64;t++){const A=h[t-15],l=h[t-2],C=e.rotr(A,7)^e.rotr(A,18)^A>>>3,H=e.rotr(l,17)^e.rotr(l,19)^l>>>10;h[t]=H+h[t-7]+C+h[t-16]|0}let{A:x,B:r,C:i,D:b,E:s,F:f,G:d,H:u}=this;for(let t=0;t<64;t++){const A=e.rotr(s,6)^e.rotr(s,11)^e.rotr(s,25),l=u+A+y(s,f,d)+w[t]+h[t]|0,H=(e.rotr(x,2)^e.rotr(x,13)^e.rotr(x,22))+S(x,r,i)|0;u=d,d=f,f=s,s=b+l|0,b=i,i=r,r=x,x=l+H|0}x=x+this.A|0,r=r+this.B|0,i=i+this.C|0,b=b+this.D|0,s=s+this.E|0,f=f+this.F|0,d=d+this.G|0,u=u+this.H|0,this.set(x,r,i,b,s,f,d,u)}roundClean(){h.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const D=e.wrapConstructor(()=>new B);exports.sha256=D;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha256.js

@@ -0,0 +1,114 @@
+import { SHA2 as p } from "./_sha2.js";
+import { wrapConstructor as u, rotr as b } from "./utils.js";
+const g = (r, e, s) => r & e ^ ~r & s, w = (r, e, s) => r & e ^ r & s ^ e & s, B = /* @__PURE__ */ 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
+]), o = /* @__PURE__ */ new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), n = /* @__PURE__ */ new Uint32Array(64);
+class D extends p {
+  constructor() {
+    super(64, 32, 8, !1), this.A = o[0] | 0, this.B = o[1] | 0, this.C = o[2] | 0, this.D = o[3] | 0, this.E = o[4] | 0, this.F = o[5] | 0, this.G = o[6] | 0, this.H = o[7] | 0;
+  }
+  get() {
+    const { A: e, B: s, C: t, D: a, E: i, F: h, G: c, H: f } = this;
+    return [e, s, t, a, i, h, c, f];
+  }
+  // prettier-ignore
+  set(e, s, t, a, i, h, c, f) {
+    this.A = e | 0, this.B = s | 0, this.C = t | 0, this.D = a | 0, this.E = i | 0, this.F = h | 0, this.G = c | 0, this.H = f | 0;
+  }
+  process(e, s) {
+    for (let x = 0; x < 16; x++, s += 4)
+      n[x] = e.getUint32(s, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = n[x - 15], l = n[x - 2], m = b(H, 7) ^ b(H, 18) ^ H >>> 3, C = b(l, 17) ^ b(l, 19) ^ l >>> 10;
+      n[x] = C + n[x - 7] + m + n[x - 16] | 0;
+    }
+    let { A: t, B: a, C: i, D: h, E: c, F: f, G: d, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = b(c, 6) ^ b(c, 11) ^ b(c, 25), l = A + H + g(c, f, d) + B[x] + n[x] | 0, C = (b(t, 2) ^ b(t, 13) ^ b(t, 22)) + w(t, a, i) | 0;
+      A = d, d = f, f = c, c = h + l | 0, h = i, i = a, a = t, t = l + C | 0;
+    }
+    t = t + this.A | 0, a = a + this.B | 0, i = i + this.C | 0, h = h + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, d = d + this.G | 0, A = A + this.H | 0, this.set(t, a, i, h, c, f, d, A);
+  }
+  roundClean() {
+    n.fill(0);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
+  }
+}
+const G = /* @__PURE__ */ u(() => new D());
+export {
+  G as sha256
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha3.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./_assert.cjs"),f=require("./_u64.cjs"),k=require("./utils.cjs"),[y,b,_]=[[],[],[]],B=BigInt(0),l=BigInt(1),A=BigInt(2),H=BigInt(7),S=BigInt(256),T=BigInt(113);for(let i=0,t=l,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],y.push(2*(5*n+s)),b.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<l^(t>>H)*T)%S,t&A&&(o^=l<<(l<<BigInt(r))-l);_.push(o)}const[m,F]=f.split(_,!0),I=(i,t,s)=>s>32?f.rotlBH(i,t,s):f.rotlSH(i,t,s),O=(i,t,s)=>s>32?f.rotlBL(i,t,s):f.rotlSL(i,t,s);function w(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,a=(e+2)%10,p=s[a],c=s[a+1],g=I(p,c,1)^s[h],L=O(p,c,1)^s[h+1];for(let d=0;d<50;d+=10)i[e+d]^=g,i[e+d+1]^=L}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=b[e],a=I(o,r,h),p=O(o,r,h),c=y[e];o=i[c],r=i[c+1],i[c]=a,i[c+1]=p}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=F[n]}s.fill(0)}class x extends k.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,u.number(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=k.u32(this.state)}keccak(){w(this.state32,this.rounds),this.posOut=0,this.pos=0}update(t){u.exists(this);const{blockLen:s,state:n}=this;t=k.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++)n[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:n,blockLen:o}=this;t[n]^=s,s&128&&n===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:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-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:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,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=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const P=(i,t,s)=>k.wrapConstructor(()=>new x(t,i,s)),X=P(1,136,256/8);exports.Keccak=x;exports.keccakP=w;exports.keccak_256=X;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha3.js

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

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/utils.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const u=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4));function f(t){return t instanceof Uint8Array||t!=null&&typeof t=="object"&&t.constructor.name==="Uint8Array"}const s=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),y=(t,e)=>t<<32-e|t>>>e,r=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;if(!r)throw new Error("Non little-endian hardware is not supported");function o(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function i(t){if(typeof t=="string"&&(t=o(t)),!f(t))throw new Error(`expected Uint8Array, got ${typeof t}`);return t}class w{clone(){return this._cloneInto()}}function p(t){const e=c=>t().update(i(c)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=w;exports.createView=s;exports.isLE=r;exports.rotr=y;exports.toBytes=i;exports.u32=u;exports.utf8ToBytes=o;exports.wrapConstructor=p;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/utils.js

@@ -0,0 +1,38 @@
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const u = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+function o(t) {
+  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
+}
+const s = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), y = (t, e) => t << 32 - e | t >>> e, i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!i)
+  throw new Error("Non little-endian hardware is not supported");
+function c(t) {
+  if (typeof t != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function f(t) {
+  if (typeof t == "string" && (t = c(t)), !o(t))
+    throw new Error(`expected Uint8Array, got ${typeof t}`);
+  return t;
+}
+class p {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
+  }
+}
+function w(t) {
+  const e = (r) => t().update(f(r)).digest(), n = t();
+  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
+}
+export {
+  p as Hash,
+  s as createView,
+  i as isLE,
+  y as rotr,
+  f as toBytes,
+  u as u32,
+  c as utf8ToBytes,
+  w as wrapConstructor
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/_assert.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function n(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!n(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}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 u(e,t){o(e);const r=t.outputLen;if(e.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=o;exports.exists=s;exports.isBytes=n;exports.number=i;exports.output=u;

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/_assert.js

@@ -0,0 +1,32 @@
+function i(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error(`positive integer expected, not ${e}`);
+}
+function n(e) {
+  return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
+}
+function o(e, ...t) {
+  if (!n(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
+}
+function f(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) {
+  o(e);
+  const r = t.outputLen;
+  if (e.length < r)
+    throw new Error(`digestInto() expects output buffer of length at least ${r}`);
+}
+export {
+  o as bytes,
+  f as exists,
+  n as isBytes,
+  i as number,
+  s as output
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/_u64.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/_u64.js

@@ -0,0 +1,21 @@
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function f(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
+  for (let e = 0; e < t.length; e++) {
+    const { h: c, l: u } = f(t[e], r);
+    [n[e], l[e]] = [c, u];
+  }
+  return [n, l];
+}
+const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
+export {
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
+};

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha3.cjs

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

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha3.js

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

package/dist/node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/utils.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./_assert.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const c=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,r=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function y(t){for(let e=0;e<t.length;e++)t[e]=r(t[e])}const p=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function l(t){o.bytes(t);let e="";for(let n=0;n<t.length;n++)e+=p[t[n]];return e}function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function s(t){return typeof t=="string"&&(t=f(t)),o.bytes(t),t}class b{clone(){return this._cloneInto()}}function g(t){const e=u=>t().update(s(u)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=b;exports.byteSwap=r;exports.byteSwap32=y;exports.bytesToHex=l;exports.isLE=i;exports.toBytes=s;exports.u32=c;exports.utf8ToBytes=f;exports.wrapConstructor=g;