@argent/x-shared 1.75.4 → 1.75.6

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
-};