@argent/x-shared 1.75.5 → 1.75.6

package/dist/node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/_md.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./utils.cjs");function b(u,t,s){return u&t^~u&s}function p(u,t,s){return u&t^u&s^t&s}class d{blockLen;outputLen;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor(t,s,n,i){this.blockLen=t,this.outputLen=s,this.padOffset=n,this.isLE=i,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),f.abytes(t);const{view:s,buffer:n,blockLen:i}=this,r=t.length;for(let e=0;e<r;){const o=Math.min(i-this.pos,r-e);if(o===i){const c=f.createView(t);for(;i<=r-e;e+=i)this.process(c,e);continue}n.set(t.subarray(e,e+o),this.pos),this.pos+=o,e+=o,this.pos===i&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:n,blockLen:i,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>i-e&&(this.process(n,0),e=0);for(let h=e;h<i;h++)s[h]=0;n.setBigUint64(i-8,BigInt(this.length*8),r),this.process(n,0);const o=f.createView(t),c=this.outputLen;if(c%4)throw new Error("_sha2: outputLen must be aligned to 32bit");const a=c/4,l=this.get();if(a>l.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<a;h++)o.setUint32(4*h,l[h],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const n=t.slice(0,s);return this.destroy(),n}_cloneInto(t){t||=new this.constructor,t.set(...this.get());const{blockLen:s,buffer:n,length:i,finished:r,destroyed:e,pos:o}=this;return t.destroyed=e,t.finished=r,t.length=i,t.pos=o,i%s&&t.buffer.set(n),t}clone(){return this._cloneInto()}}const g=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=b;exports.HashMD=d;exports.Maj=p;exports.SHA256_IV=g;

package/dist/node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/_md.js

@@ -0,0 +1,85 @@
+import { createView as c, aexists as a, abytes as b, aoutput as d, clean as g } from "./utils.js";
+function w(f, t, e) {
+  return f & t ^ ~f & e;
+}
+function x(f, t, e) {
+  return f & t ^ f & e ^ t & e;
+}
+class y {
+  blockLen;
+  outputLen;
+  padOffset;
+  isLE;
+  // For partial updates less than block size
+  buffer;
+  view;
+  finished = !1;
+  length = 0;
+  pos = 0;
+  destroyed = !1;
+  constructor(t, e, n, i) {
+    this.blockLen = t, this.outputLen = e, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = c(this.buffer);
+  }
+  update(t) {
+    a(this), b(t);
+    const { view: e, buffer: n, blockLen: i } = this, o = t.length;
+    for (let s = 0; s < o; ) {
+      const r = Math.min(i - this.pos, o - s);
+      if (r === i) {
+        const u = c(t);
+        for (; i <= o - s; s += i)
+          this.process(u, s);
+        continue;
+      }
+      n.set(t.subarray(s, s + r), this.pos), this.pos += r, s += r, this.pos === i && (this.process(e, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    a(this), d(t, this), this.finished = !0;
+    const { buffer: e, view: n, blockLen: i, isLE: o } = this;
+    let { pos: s } = this;
+    e[s++] = 128, g(this.buffer.subarray(s)), this.padOffset > i - s && (this.process(n, 0), s = 0);
+    for (let h = s; h < i; h++)
+      e[h] = 0;
+    n.setBigUint64(i - 8, BigInt(this.length * 8), o), this.process(n, 0);
+    const r = c(t), u = this.outputLen;
+    if (u % 4)
+      throw new Error("_sha2: outputLen must be aligned to 32bit");
+    const l = u / 4, p = this.get();
+    if (l > p.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let h = 0; h < l; h++)
+      r.setUint32(4 * h, p[h], o);
+  }
+  digest() {
+    const { buffer: t, outputLen: e } = this;
+    this.digestInto(t);
+    const n = t.slice(0, e);
+    return this.destroy(), n;
+  }
+  _cloneInto(t) {
+    t ||= new this.constructor(), t.set(...this.get());
+    const { blockLen: e, buffer: n, length: i, finished: o, destroyed: s, pos: r } = this;
+    return t.destroyed = s, t.finished = o, t.length = i, t.pos = r, i % e && t.buffer.set(n), t;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+}
+const I = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
+export {
+  w as Chi,
+  y as HashMD,
+  x as Maj,
+  I as SHA256_IV
+};

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

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

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

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

package/dist/node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/sha2.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./_md.cjs"),c=require("./utils.cjs"),I=Uint32Array.from([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(64);class V extends e.HashMD{constructor(f){super(64,f,8,!1)}get(){const{A:f,B:n,C:x,D:a,E:r,F:o,G:s,H:i}=this;return[f,n,x,a,r,o,s,i]}set(f,n,x,a,r,o,s,i){this.A=f|0,this.B=n|0,this.C=x|0,this.D=a|0,this.E=r|0,this.F=o|0,this.G=s|0,this.H=i|0}process(f,n){for(let t=0;t<16;t++,n+=4)b[t]=f.getUint32(n,!1);for(let t=16;t<64;t++){const H=b[t-15],h=b[t-2],S=c.rotr(H,7)^c.rotr(H,18)^H>>>3,l=c.rotr(h,17)^c.rotr(h,19)^h>>>10;b[t]=l+b[t-7]+S+b[t-16]|0}let{A:x,B:a,C:r,D:o,E:s,F:i,G:d,H:A}=this;for(let t=0;t<64;t++){const H=c.rotr(s,6)^c.rotr(s,11)^c.rotr(s,25),h=A+H+e.Chi(s,i,d)+I[t]+b[t]|0,l=(c.rotr(x,2)^c.rotr(x,13)^c.rotr(x,22))+e.Maj(x,a,r)|0;A=d,d=i,i=s,s=o+h|0,o=r,r=a,a=x,x=h+l|0}x=x+this.A|0,a=a+this.B|0,r=r+this.C|0,o=o+this.D|0,s=s+this.E|0,i=i+this.F|0,d=d+this.G|0,A=A+this.H|0,this.set(x,a,r,o,s,i,d,A)}roundClean(){c.clean(b)}destroy(){this.set(0,0,0,0,0,0,0,0),c.clean(this.buffer)}}class _ extends V{A=e.SHA256_IV[0]|0;B=e.SHA256_IV[1]|0;C=e.SHA256_IV[2]|0;D=e.SHA256_IV[3]|0;E=e.SHA256_IV[4]|0;F=e.SHA256_IV[5]|0;G=e.SHA256_IV[6]|0;H=e.SHA256_IV[7]|0;constructor(){super(32)}}const g=c.createHasher(()=>new _,c.oidNist(1));exports._SHA256=_;exports.sha256=g;

package/dist/node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/sha2.js

@@ -0,0 +1,124 @@
+import { SHA256_IV as i, HashMD as p, Chi as B, Maj as D } from "./_md.js";
+import { createHasher as g, oidNist as E, clean as u, rotr as f } from "./utils.js";
+const F = /* @__PURE__ */ Uint32Array.from([
+  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(64);
+class G extends p {
+  constructor(r) {
+    super(64, r, 8, !1);
+  }
+  get() {
+    const { A: r, B: h, C: c, D: t, E: e, F: b, G: s, H: a } = this;
+    return [r, h, c, t, e, b, s, a];
+  }
+  // prettier-ignore
+  set(r, h, c, t, e, b, s, a) {
+    this.A = r | 0, this.B = h | 0, this.C = c | 0, this.D = t | 0, this.E = e | 0, this.F = b | 0, this.G = s | 0, this.H = a | 0;
+  }
+  process(r, h) {
+    for (let x = 0; x < 16; x++, h += 4)
+      o[x] = r.getUint32(h, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = o[x - 15], d = o[x - 2], m = f(H, 7) ^ f(H, 18) ^ H >>> 3, l = f(d, 17) ^ f(d, 19) ^ d >>> 10;
+      o[x] = l + o[x - 7] + m + o[x - 16] | 0;
+    }
+    let { A: c, B: t, C: e, D: b, E: s, F: a, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = f(s, 6) ^ f(s, 11) ^ f(s, 25), d = A + H + B(s, a, n) + F[x] + o[x] | 0, l = (f(c, 2) ^ f(c, 13) ^ f(c, 22)) + D(c, t, e) | 0;
+      A = n, n = a, a = s, s = b + d | 0, b = e, e = t, t = c, c = d + l | 0;
+    }
+    c = c + this.A | 0, t = t + this.B | 0, e = e + this.C | 0, b = b + this.D | 0, s = s + this.E | 0, a = a + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(c, t, e, b, s, a, n, A);
+  }
+  roundClean() {
+    u(o);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), u(this.buffer);
+  }
+}
+class S extends G {
+  // We cannot use array here since array allows indexing by variable
+  // which means optimizer/compiler cannot use registers.
+  A = i[0] | 0;
+  B = i[1] | 0;
+  C = i[2] | 0;
+  D = i[3] | 0;
+  E = i[4] | 0;
+  F = i[5] | 0;
+  G = i[6] | 0;
+  H = i[7] | 0;
+  constructor() {
+    super(32);
+  }
+}
+const U = /* @__PURE__ */ g(
+  () => new S(),
+  /* @__PURE__ */ E(1)
+);
+export {
+  S as _SHA256,
+  U as sha256
+};

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

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

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

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

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function u(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function p(e,t=""){if(!Number.isSafeInteger(e)||e<0){const n=t&&`"${t}" `;throw new Error(`${n}expected integer >0, got ${e}`)}}function i(e,t,n=""){const r=u(e),o=e?.length;if(!r||t!==void 0){const y=n&&`"${n}" `,x="",d=r?`length=${o}`:`type=${typeof e}`;throw new Error(y+"expected Uint8Array"+x+", got "+d)}return e}function b(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 g(e,t){i(e,void 0,"digestInto() output");const n=t.outputLen;if(e.length<n)throw new Error('"digestInto() output" expected to be of length >='+n)}function h(e){return new Uint32Array(e.buffer,e.byteOffset,Math.floor(e.byteLength/4))}function w(...e){for(let t=0;t<e.length;t++)e[t].fill(0)}function l(e){return new DataView(e.buffer,e.byteOffset,e.byteLength)}function A(e,t){return e<<32-t|e>>>t}const s=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function c(e){return e<<24&4278190080|e<<8&16711680|e>>>8&65280|e>>>24&255}function a(e){for(let t=0;t<e.length;t++)e[t]=c(e[t]);return e}const L=s?e=>e:a,m=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",E=Array.from({length:256},(e,t)=>t.toString(16).padStart(2,"0"));function H(e){if(i(e),m)return e.toHex();let t="";for(let n=0;n<e.length;n++)t+=E[e[n]];return t}function U(e){if(typeof e!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(e))}function S(e,t={}){const n=(o,f)=>e(f).update(o).digest(),r=e(void 0);return n.outputLen=r.outputLen,n.blockLen=r.blockLen,n.create=o=>e(o),Object.assign(n,t),Object.freeze(n)}const B=e=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,e])});exports.abytes=i;exports.aexists=b;exports.anumber=p;exports.aoutput=g;exports.byteSwap=c;exports.byteSwap32=a;exports.bytesToHex=H;exports.clean=w;exports.createHasher=S;exports.createView=l;exports.isBytes=u;exports.isLE=s;exports.oidNist=B;exports.rotr=A;exports.swap32IfBE=L;exports.u32=h;exports.utf8ToBytes=U;

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

@@ -0,0 +1,92 @@
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function x(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function h(e, t = "") {
+  if (!Number.isSafeInteger(e) || e < 0) {
+    const n = t && `"${t}" `;
+    throw new Error(`${n}expected integer >0, got ${e}`);
+  }
+}
+function i(e, t, n = "") {
+  const r = x(e), o = e?.length;
+  if (!r || t !== void 0) {
+    const u = n && `"${n}" `, c = "", s = r ? `length=${o}` : `type=${typeof e}`;
+    throw new Error(u + "expected Uint8Array" + c + ", got " + s);
+  }
+  return e;
+}
+function w(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 b(e, t) {
+  i(e, void 0, "digestInto() output");
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error('"digestInto() output" expected to be of length >=' + n);
+}
+function l(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function A(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+function L(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function U(e, t) {
+  return e << 32 - t | e >>> t;
+}
+const a = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function y(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function d(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = y(e[t]);
+  return e;
+}
+const m = a ? (e) => e : d, p = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", g = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function E(e) {
+  if (i(e), p)
+    return e.toHex();
+  let t = "";
+  for (let n = 0; n < e.length; n++)
+    t += g[e[n]];
+  return t;
+}
+function H(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function $(e, t = {}) {
+  const n = (o, f) => e(f).update(o).digest(), r = e(void 0);
+  return n.outputLen = r.outputLen, n.blockLen = r.blockLen, n.create = (o) => e(o), Object.assign(n, t), Object.freeze(n);
+}
+const B = (e) => ({
+  oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
+});
+export {
+  i as abytes,
+  w as aexists,
+  h as anumber,
+  b as aoutput,
+  y as byteSwap,
+  d as byteSwap32,
+  E as bytesToHex,
+  A as clean,
+  $ as createHasher,
+  L as createView,
+  x as isBytes,
+  a as isLE,
+  B as oidNist,
+  U as rotr,
+  m as swap32IfBE,
+  l as u32,
+  H as utf8ToBytes
+};

package/dist/src/accountNameGenerator/index.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha256.cjs"),h=require("lodash-es"),d=require("./colors.cjs"),l=require("./x-names.json.cjs");class m{constructor(t,e){this.nameList=t||l.default,this.colorList=e||d.nameDataColors}generate(t){const e=this.hashSeed(t),n=e.getUint32(0)%this.nameList.items.length,s=this.nameList.items[n],o=e.getUint32(4)%s.adjectives.length,i=s.adjectives[o],r=e.getUint32(8)%this.colorList.length,c=this.colorList[r];return{name:`${h.upperFirst(i)} ${s.name}`,emoji:s.emoji,color:c}}hashSeed(t){const e=a.sha256(new TextEncoder().encode(t));return new DataView(e.buffer,e.byteOffset,e.byteLength)}}exports.AccountNameGenerator=m;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../../node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/sha2.cjs"),h=require("lodash-es"),d=require("./colors.cjs"),l=require("./x-names.json.cjs");class m{constructor(t,e){this.nameList=t||l.default,this.colorList=e||d.nameDataColors}generate(t){const e=this.hashSeed(t),n=e.getUint32(0)%this.nameList.items.length,s=this.nameList.items[n],o=e.getUint32(4)%s.adjectives.length,i=s.adjectives[o],r=e.getUint32(8)%this.colorList.length,c=this.colorList[r];return{name:`${h.upperFirst(i)} ${s.name}`,emoji:s.emoji,color:c}}hashSeed(t){const e=a.sha256(new TextEncoder().encode(t));return new DataView(e.buffer,e.byteOffset,e.byteLength)}}exports.AccountNameGenerator=m;

package/dist/src/accountNameGenerator/index.js

@@ -1,4 +1,4 @@
-import { sha256 as c } from "../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha256.js";
+import { sha256 as c } from "../../node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/sha2.js";
 import { upperFirst as m } from "lodash-es";
 import { nameDataColors as h } from "./colors.js";
 import d from "./x-names.json.js";

package/dist/src/utils/id.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha3.cjs"),e=require("../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/utils.cjs");function i(t){return`0x${e.bytesToHex(r.keccak_256(e.utf8ToBytes(t)))}`}exports.id=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("../../node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/sha3.cjs"),e=require("../../node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/utils.cjs");function i(t){return`0x${e.bytesToHex(r.keccak_256(e.utf8ToBytes(t)))}`}exports.id=i;

package/dist/src/utils/id.js

@@ -1,5 +1,5 @@
-import { keccak_256 as t } from "../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha3.js";
-import { bytesToHex as r, utf8ToBytes as e } from "../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/utils.js";
+import { keccak_256 as t } from "../../node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/sha3.js";
+import { bytesToHex as r, utf8ToBytes as e } from "../../node_modules/.pnpm/@noble_hashes@2.0.0/node_modules/@noble/hashes/utils.js";
 function m(o) {
   return `0x${r(t(e(o)))}`;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@argent/x-shared",
-  "version": "1.75.5",
+  "version": "1.75.6",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/argentlabs/x-shared.git"
@@ -64,8 +64,8 @@
     "@types/lodash-es": "4.17.12",
     "@types/numeral": "2.0.5",
     "@types/ua-parser-js": "0.7.39",
-    "@typescript-eslint/eslint-plugin": "8.40.0",
-    "@typescript-eslint/parser": "8.40.0",
+    "@typescript-eslint/eslint-plugin": "8.41.0",
+    "@typescript-eslint/parser": "8.41.0",
     "esbuild": "0.25.9",
     "esbuild-register": "3.6.0",
     "eslint": "8.57.1",
@@ -89,7 +89,7 @@
     "@langchain/core": "^0.3.43",
     "@langchain/google-genai": "^0.2.2",
     "@lokalise/node-api": "^15.0.0",
-    "@noble/hashes": "^1.3.1",
+    "@noble/hashes": "^2.0.0",
     "@starknet-io/types-js": "0.9.1",
     "@types/fs-extra": "^11.0.4",
     "big-decimal-number": "npm:bignumber.js@^9.1.2",
@@ -105,8 +105,8 @@
     "zod-to-json-schema": "^3.24.5"
   },
   "peerDependencies": {
-    "@scure/base": "^1.1.1",
-    "@scure/bip39": "^1.2.1",
+    "@scure/base": "^2.0.0",
+    "@scure/bip39": "^2.0.0",
     "async-retry": "^1.3.3",
     "lodash-es": "^4.17.21",
     "ua-parser-js": "^1.0.38 || ^2.0.0",

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

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

@@ -1,32 +0,0 @@
-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/_md.cjs

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

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

@@ -1,64 +0,0 @@
-import { exists as g, output as d } from "./_assert.js";
-import { Hash as b, createView as p, toBytes as a } from "./utils.js";
-function w(o, t, s, i) {
-  if (typeof o.setBigUint64 == "function")
-    return o.setBigUint64(t, s, i);
-  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), c = i ? 4 : 0, u = i ? 0 : 4;
-  o.setUint32(t + c, e, i), o.setUint32(t + u, r, i);
-}
-const B = (o, t, s) => o & t ^ ~o & s, L = (o, t, s) => o & t ^ o & s ^ t & s;
-class U extends b {
-  constructor(t, s, i, n) {
-    super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, 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: s, buffer: i, blockLen: n } = this;
-    t = a(t);
-    const h = t.length;
-    for (let e = 0; e < h; ) {
-      const r = Math.min(n - this.pos, h - e);
-      if (r === n) {
-        const c = p(t);
-        for (; n <= h - e; e += n)
-          this.process(c, e);
-        continue;
-      }
-      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    g(this), d(t, this), this.finished = !0;
-    const { buffer: s, view: i, blockLen: n, isLE: h } = this;
-    let { pos: e } = this;
-    s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
-    for (let f = e; f < n; f++)
-      s[f] = 0;
-    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
-    const r = p(t), c = this.outputLen;
-    if (c % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = c / 4, l = this.get();
-    if (u > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let f = 0; f < u; f++)
-      r.setUint32(4 * f, l[f], h);
-  }
-  digest() {
-    const { buffer: t, outputLen: s } = this;
-    this.digestInto(t);
-    const i = t.slice(0, s);
-    return this.destroy(), i;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
-    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
-  }
-}
-export {
-  B as Chi,
-  U as HashMD,
-  L as Maj
-};

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

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

@@ -1,21 +0,0 @@
-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/sha256.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./_md.cjs"),s=require("./utils.cjs"),S=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]),f=new Uint32Array(64);class g extends H.HashMD{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:d,B:o,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[d,o,x,e,a,i,c,r]}set(d,o,x,e,a,i,c,r){this.A=d|0,this.B=o|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(d,o){for(let t=0;t<16;t++,o+=4)f[t]=d.getUint32(o,!1);for(let t=16;t<64;t++){const A=f[t-15],n=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(n,17)^s.rotr(n,19)^n>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:h,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),n=l+A+H.Chi(c,r,h)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=h,h=r,r=c,c=i+n|0,i=a,a=e,e=x,x=n+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,h=h+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,h,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;

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

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

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

@@ -1 +0,0 @@
-"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)!==0&&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

@@ -1,107 +0,0 @@
-import { number as d, exists as k, bytes as B, output as A } from "./_assert.js";
-import { rotlSH as H, rotlSL as m, rotlBH as S, rotlBL as T, split 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__ */ F(b, !0), O = (e, t, s) => s > 32 ? S(e, t, s) : H(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : m(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) !== 0 && 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

@@ -1 +0,0 @@
-"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 u=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),y=(t,e)=>t<<32-e|t>>>e,b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,r=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function p(t){for(let e=0;e<t.length;e++)t[e]=r(t[e])}const l=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function g(t){o.bytes(t);let e="";for(let n=0;n<t.length;n++)e+=l[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 w{clone(){return this._cloneInto()}}function x(t){const e=c=>t().update(s(c)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=w;exports.byteSwap=r;exports.byteSwap32=p;exports.bytesToHex=g;exports.createView=i;exports.isLE=b;exports.rotr=y;exports.toBytes=s;exports.u32=u;exports.utf8ToBytes=f;exports.wrapConstructor=x;

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

@@ -1,46 +0,0 @@
-import { bytes as o } from "./_assert.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const y = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), p = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), l = (t, e) => t << 32 - e | t >>> e, x = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, r = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-function b(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = r(t[e]);
-}
-const c = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
-function g(t) {
-  o(t);
-  let e = "";
-  for (let n = 0; n < t.length; n++)
-    e += c[t[n]];
-  return e;
-}
-function i(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function u(t) {
-  return typeof t == "string" && (t = i(t)), o(t), t;
-}
-class w {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-function h(t) {
-  const e = (f) => t().update(u(f)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
-export {
-  w as Hash,
-  r as byteSwap,
-  b as byteSwap32,
-  g as bytesToHex,
-  p as createView,
-  x as isLE,
-  l as rotr,
-  u as toBytes,
-  y as u32,
-  i as utf8ToBytes,
-  h as wrapConstructor
-};