@argent/x-shared 1.48.2 → 1.49.0

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.js

@@ -1,12 +1,12 @@
 import { hmac as m } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.js";
-import { concatBytes as c, randomBytes as e } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js";
+import { randomBytes as c, concatBytes as e } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js";
 import "./abstract/weierstrass.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function p(t) {
   return {
     hash: t,
-    hmac: (o, ...r) => m(t, o, c(...r)),
-    randomBytes: e
+    hmac: (o, ...r) => m(t, o, e(...r)),
+    randomBytes: c
   };
 }
 export {

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.js

@@ -1,4 +1,4 @@
-import { bitMask as L, numberToBytesLE as T, numberToBytesBE as _, bytesToNumberLE as y, bytesToNumberBE as m, validateObject as $, ensureBytes as C } from "./utils.js";
+import { validateObject as L, ensureBytes as T, bytesToNumberLE as y, bytesToNumberBE as m, numberToBytesBE as _, bitMask as $, numberToBytesLE as C } from "./utils.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const f = BigInt(0), u = BigInt(1), w = BigInt(2), M = BigInt(3), E = BigInt(4), b = BigInt(5), I = BigInt(8);
 BigInt(9);
@@ -109,7 +109,7 @@ function Q(e) {
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
   }, n = A.reduce((r, s) => (r[s] = "function", r), o);
-  return $(e, n);
+  return L(e, n);
 }
 function O(e, o, n) {
   if (n < f)
@@ -141,7 +141,7 @@ function V(e, o, n = !1, r = {}) {
     ORDER: e,
     BITS: s,
     BYTES: c,
-    MASK: L(s),
+    MASK: $(s),
     ZERO: f,
     ONE: u,
     create: (t) => g(t, e),
@@ -171,7 +171,7 @@ function V(e, o, n = !1, r = {}) {
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (t, l, a) => a ? l : t,
-    toBytes: (t) => n ? T(t, c) : _(t, c),
+    toBytes: (t) => n ? C(t, c) : _(t, c),
     fromBytes: (t) => {
       if (t.length !== c)
         throw new Error(`Fp.fromBytes: expected ${c}, got ${t.length}`);
@@ -181,7 +181,7 @@ function V(e, o, n = !1, r = {}) {
   return Object.freeze(i);
 }
 function Y(e, o, n = !1) {
-  e = C("privateHash", e);
+  e = T("privateHash", e);
   const r = e.length, s = x(o).nByteLength + 8;
   if (s < 24 || r < s || r > 1024)
     throw new Error(`hashToPrivateScalar: expected ${s}-1024 bytes of input, got ${r}`);

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/weierstrass.js

@@ -1,7 +1,7 @@
 import { mod as ut, hashToPrivateScalar as dt, invert as ht } from "./modular.js";
 import * as mt from "./utils.js";
-import { bytesToNumberBE as _, bitMask as yt, concatBytes as et, validateObject as lt, ensureBytes as Y, hexToBytes as at, numberToBytesBE as rt, createHmacDrbg as pt, bytesToHex as nt } from "./utils.js";
-import { wNAF as wt, validateBasic as ft } from "./curve.js";
+import { validateObject as lt, concatBytes as et, ensureBytes as Y, bytesToHex as nt, bytesToNumberBE as _, bitMask as yt, numberToBytesBE as rt, hexToBytes as at, createHmacDrbg as pt } from "./utils.js";
+import { validateBasic as ft, wNAF as wt } from "./curve.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function Et(B) {
   const n = ft(B);

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

@@ -1,5 +1,5 @@
 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 { rotlBH as B, rotlSH as A, rotlBL as H, rotlSL as m, split 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++) {
@@ -9,7 +9,7 @@ for (let i = 0, t = f, s = 1, n = 0; i < 24; i++) {
     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);
+const [C, q] = /* @__PURE__ */ S(y, !0), x = (i, t, s) => s > 32 ? B(i, t, s) : A(i, t, s), I = (i, t, s) => s > 32 ? H(i, t, s) : m(i, t, s);
 function v(i, t = 24) {
   const s = new Uint32Array(10);
   for (let n = 24 - t; n < 24; n++) {

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

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

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

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

@@ -0,0 +1,115 @@
+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.js

@@ -1,5 +1,5 @@
 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 { rotlBH as H, rotlSH as m, rotlBL as S, rotlSL 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++) {
@@ -9,7 +9,7 @@ for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
     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);
+const [v, z] = /* @__PURE__ */ F(b, !0), O = (e, t, s) => s > 32 ? H(e, t, s) : m(e, t, s), w = (e, t, s) => s > 32 ? S(e, t, s) : T(e, t, s);
 function D(e, t = 24) {
   const s = new Uint32Array(10);
   for (let n = 24 - t; n < 24; n++) {

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

@@ -1 +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;
+"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,12 +1,12 @@
 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 = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, r = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-function l(t) {
+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 x(t) {
+function g(t) {
   o(t);
   let e = "";
   for (let n = 0; n < t.length; n++)
@@ -21,24 +21,26 @@ function i(t) {
 function u(t) {
   return typeof t == "string" && (t = i(t)), o(t), t;
 }
-class g {
+class w {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function b(t) {
+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 {
-  g as Hash,
+  w as Hash,
   r as byteSwap,
-  l as byteSwap32,
-  x as bytesToHex,
-  p as isLE,
+  b as byteSwap32,
+  g as bytesToHex,
+  p as createView,
+  x as isLE,
+  l as rotr,
   u as toBytes,
   y as u32,
   i as utf8ToBytes,
-  b as wrapConstructor
+  h as wrapConstructor
 };

package/dist/node_modules/.pnpm/micro-starknet@0.2.3/node_modules/micro-starknet/lib/esm/index.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const P=require("../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha3.cjs"),E=require("../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha256.cjs"),h=require("../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/utils.cjs"),c=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.cjs"),N=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/poseidon.cjs"),R=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/weierstrass.cjs"),i=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/utils.cjs"),F=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.cjs"),p=BigInt("3618502788666131213697322783095070105526743751716087489154079457884512865583"),w=252;function g(e){for(;e[0]===0;)e=e.subarray(1);const n=e.length*8-w,t=i.bytesToNumberBE(e);return n>0?t>>BigInt(n):t}function m(e){return typeof e=="string"&&(e=$(e),e.length&1&&(e="0"+e)),i.hexToBytes(e)}const b=R.weierstrass({a:BigInt(1),b:BigInt("3141592653589793238462643383279502884197169399375105820974944592307816406665"),Fp:c.Field(BigInt("0x800000000000011000000000000000000000000000000000000000000000001")),n:p,nBitLength:w,Gx:BigInt("874739451078007766457464989774322083649278607533249481151382481072868806602"),Gy:BigInt("152666792071518830868575557812948353041420400780739481342941381225525861407"),h:BigInt(1),lowS:!1,...F.getHash(E.sha256),bits2int:g,bits2int_modN:e=>{const n=i.bytesToNumberBE(e).toString(16);return n.length===63&&(e=m(n+"0")),c.mod(g(e),p)}});function T(e){return i.ensureBytes("",typeof e=="string"?m(e):e)}const{CURVE:v,ProjectivePoint:u,Signature:_,utils:q}=b;function x(e){return`0x${i.bytesToHex(e.subarray(1)).replace(/^0+/gm,"")}`}function $(e){return e.replace(/^0x/i,"")}const a=[new u(2089986280348253421170679821480865132823066470938446095505822317253594081284n,1713931329540660377023406109199410414810705867260802078187082345529207694986n,1n),new u(996781205833008774514500082376783249102396023663454813447423147977397232763n,1668503676786377725805489344771023921079126552019160156920634619255970485781n,1n),new u(2251563274489750535117886426533222435294046428347329203627021249169616184184n,1798716007562728905295480679789526322175868328062420237419143593021674992973n,1n),new u(2138414695194151160943305727036575959195309218611738193261179310511854807447n,113410276730064486255102093846540133784865286929052426931474106396135072156n,1n),new u(2379962749567351885752724891227938183011949129833673362440656643086021394946n,776496453633298175483985398648758586525933812536653089401905292063708816422n,1n)];function y(e,n){const t=[];let r=e;for(let o=0;o<248;o++)t.push(r),r=r.double();r=n;for(let o=0;o<4;o++)t.push(r),r=r.double();return t}const k=y(a[1],a[2]),C=y(a[3],a[4]);function D(e){let n;if(typeof e=="bigint")n=e;else if(typeof e=="number"){if(!Number.isSafeInteger(e))throw new Error(`Invalid pedersenArg: ${e}`);n=BigInt(e)}else n=i.bytesToNumberBE(T(e));if(!(0n<=n&&n<b.CURVE.Fp.ORDER))throw new Error(`PedersenArg should be 0 <= value < CURVE.P: ${n}`);return n}function B(e,n,t){let r=D(n);for(let o=0;o<252;o++){const s=t[o];if(s.equals(e))throw new Error("Same point");(r&1n)!==0n&&(e=e.add(s)),r>>=1n}return e}function O(e,n){let t=a[0];return t=B(t,e,k),t=B(t,n,C),x(t.toRawBytes(!0))}const j=i.bitMask(250),A=e=>i.bytesToNumberBE(P.keccak_256(e))&j;c.Field(BigInt("14474011154664525231415395255581126252639794253786371766033694892385558855681"));const I=c.Field(BigInt("3618502788666131213697322783095070105623107215331596699973092056135872020481"));function M(e,n,t){const r=e.fromBytes(E.sha256(h.utf8ToBytes(`${n}${t}`)));return e.create(r)}const U=[[3,1,1],[1,-1,1],[1,1,-2]].map(e=>e.map(BigInt));function S(e,n){if(c.validateField(e.Fp),!Number.isSafeInteger(e.rate)||!Number.isSafeInteger(e.capacity))throw new Error(`Wrong poseidon opts: ${e}`);const t=e.rate+e.capacity,r=e.roundsFull+e.roundsPartial,o=[];for(let l=0;l<r;l++){const f=[];for(let d=0;d<t;d++)f.push(M(e.Fp,"Hades",t*l+d));o.push(f)}const s=N.poseidon({...e,t,sboxPower:3,reversePartialPowIdx:!0,mds:n,roundConstants:o});return s.m=t,s.rate=e.rate,s.capacity=e.capacity,s}S({Fp:I,rate:2,capacity:1,roundsFull:8,roundsPartial:83},U);exports.CURVE=v;exports.Fp251=I;exports.ProjectivePoint=u;exports.Signature=_;exports.keccak=A;exports.pedersen=O;exports.poseidonBasic=S;exports.utils=q;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha3.cjs"),w=require("../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha256.cjs"),S=require("../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/utils.cjs"),c=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.cjs"),N=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/poseidon.cjs"),F=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/weierstrass.cjs"),i=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/utils.cjs"),R=require("../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.cjs"),p=BigInt("3618502788666131213697322783095070105526743751716087489154079457884512865583"),E=252;function g(e){for(;e[0]===0;)e=e.subarray(1);const n=e.length*8-E,t=i.bytesToNumberBE(e);return n>0?t>>BigInt(n):t}function m(e){return typeof e=="string"&&(e=_(e),e.length&1&&(e="0"+e)),i.hexToBytes(e)}const b=F.weierstrass({a:BigInt(1),b:BigInt("3141592653589793238462643383279502884197169399375105820974944592307816406665"),Fp:c.Field(BigInt("0x800000000000011000000000000000000000000000000000000000000000001")),n:p,nBitLength:E,Gx:BigInt("874739451078007766457464989774322083649278607533249481151382481072868806602"),Gy:BigInt("152666792071518830868575557812948353041420400780739481342941381225525861407"),h:BigInt(1),lowS:!1,...R.getHash(w.sha256),bits2int:g,bits2int_modN:e=>{const n=i.bytesToNumberBE(e).toString(16);return n.length===63&&(e=m(n+"0")),c.mod(g(e),p)}});function T(e){return i.ensureBytes("",typeof e=="string"?m(e):e)}const{ProjectivePoint:u}=b;function v(e){return`0x${i.bytesToHex(e.subarray(1)).replace(/^0+/gm,"")}`}function _(e){return e.replace(/^0x/i,"")}const a=[new u(2089986280348253421170679821480865132823066470938446095505822317253594081284n,1713931329540660377023406109199410414810705867260802078187082345529207694986n,1n),new u(996781205833008774514500082376783249102396023663454813447423147977397232763n,1668503676786377725805489344771023921079126552019160156920634619255970485781n,1n),new u(2251563274489750535117886426533222435294046428347329203627021249169616184184n,1798716007562728905295480679789526322175868328062420237419143593021674992973n,1n),new u(2138414695194151160943305727036575959195309218611738193261179310511854807447n,113410276730064486255102093846540133784865286929052426931474106396135072156n,1n),new u(2379962749567351885752724891227938183011949129833673362440656643086021394946n,776496453633298175483985398648758586525933812536653089401905292063708816422n,1n)];function y(e,n){const t=[];let r=e;for(let o=0;o<248;o++)t.push(r),r=r.double();r=n;for(let o=0;o<4;o++)t.push(r),r=r.double();return t}const q=y(a[1],a[2]),x=y(a[3],a[4]);function k(e){let n;if(typeof e=="bigint")n=e;else if(typeof e=="number"){if(!Number.isSafeInteger(e))throw new Error(`Invalid pedersenArg: ${e}`);n=BigInt(e)}else n=i.bytesToNumberBE(T(e));if(!(0n<=n&&n<b.CURVE.Fp.ORDER))throw new Error(`PedersenArg should be 0 <= value < CURVE.P: ${n}`);return n}function B(e,n,t){let r=k(n);for(let o=0;o<252;o++){const s=t[o];if(s.equals(e))throw new Error("Same point");(r&1n)!==0n&&(e=e.add(s)),r>>=1n}return e}function $(e,n){let t=a[0];return t=B(t,e,q),t=B(t,n,x),v(t.toRawBytes(!0))}const D=i.bitMask(250),O=e=>i.bytesToNumberBE(h.keccak_256(e))&D;c.Field(BigInt("14474011154664525231415395255581126252639794253786371766033694892385558855681"));const I=c.Field(BigInt("3618502788666131213697322783095070105623107215331596699973092056135872020481"));function j(e,n,t){const r=e.fromBytes(w.sha256(S.utf8ToBytes(`${n}${t}`)));return e.create(r)}const A=[[3,1,1],[1,-1,1],[1,1,-2]].map(e=>e.map(BigInt));function P(e,n){if(c.validateField(e.Fp),!Number.isSafeInteger(e.rate)||!Number.isSafeInteger(e.capacity))throw new Error(`Wrong poseidon opts: ${e}`);const t=e.rate+e.capacity,r=e.roundsFull+e.roundsPartial,o=[];for(let l=0;l<r;l++){const f=[];for(let d=0;d<t;d++)f.push(j(e.Fp,"Hades",t*l+d));o.push(f)}const s=N.poseidon({...e,t,sboxPower:3,reversePartialPowIdx:!0,mds:n,roundConstants:o});return s.m=t,s.rate=e.rate,s.capacity=e.capacity,s}P({Fp:I,rate:2,capacity:1,roundsFull:8,roundsPartial:83},A);exports.Fp251=I;exports.ProjectivePoint=u;exports.keccak=O;exports.pedersen=$;exports.poseidonBasic=P;

package/dist/node_modules/.pnpm/micro-starknet@0.2.3/node_modules/micro-starknet/lib/esm/index.js

@@ -1,22 +1,22 @@
-import { keccak_256 as y } from "../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha3.js";
+import { keccak_256 as P } from "../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha3.js";
 import { sha256 as B } from "../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha256.js";
-import { utf8ToBytes as P } from "../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/utils.js";
-import { Field as l, mod as h, validateField as R } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.js";
-import { poseidon as b } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/poseidon.js";
+import { utf8ToBytes as S } from "../../../../../@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/utils.js";
+import { mod as h, Field as l, validateField as b } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.js";
+import { poseidon as R } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/poseidon.js";
 import { weierstrass as N } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/weierstrass.js";
-import { bytesToNumberBE as c, bitMask as x, hexToBytes as F, bytesToHex as v, ensureBytes as T } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/utils.js";
+import { bytesToNumberBE as c, ensureBytes as x, hexToBytes as F, bytesToHex as v, bitMask as T } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/utils.js";
 import { getHash as _ } from "../../../../../@noble_curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.js";
 const d = BigInt("3618502788666131213697322783095070105526743751716087489154079457884512865583"), w = 252;
 function m(n) {
   for (; n[0] === 0; )
     n = n.subarray(1);
-  const t = n.length * 8 - w, e = c(n);
-  return t > 0 ? e >> BigInt(t) : e;
+  const e = n.length * 8 - w, t = c(n);
+  return e > 0 ? t >> BigInt(e) : t;
 }
-function E(n) {
-  return typeof n == "string" && (n = D(n), n.length & 1 && (n = "0" + n)), F(n);
+function I(n) {
+  return typeof n == "string" && (n = k(n), n.length & 1 && (n = "0" + n)), F(n);
 }
-const I = N({
+const E = N({
   a: BigInt(1),
   b: BigInt("3141592653589793238462643383279502884197169399375105820974944592307816406665"),
   Fp: l(BigInt("0x800000000000011000000000000000000000000000000000000000000000001")),
@@ -29,18 +29,18 @@ const I = N({
   ..._(B),
   bits2int: m,
   bits2int_modN: (n) => {
-    const t = c(n).toString(16);
-    return t.length === 63 && (n = E(t + "0")), h(m(n), d);
+    const e = c(n).toString(16);
+    return e.length === 63 && (n = I(e + "0")), h(m(n), d);
   }
 });
 function $(n) {
-  return T("", typeof n == "string" ? E(n) : n);
+  return x("", typeof n == "string" ? I(n) : n);
 }
-const { CURVE: Q, ProjectivePoint: s, Signature: Y, utils: Z } = I;
-function C(n) {
+const { ProjectivePoint: s } = E;
+function D(n) {
   return `0x${v(n.subarray(1)).replace(/^0+/gm, "")}`;
 }
-function D(n) {
+function k(n) {
   return n.replace(/^0x/i, "");
 }
 const u = [
@@ -50,85 +50,82 @@ const u = [
   new s(2138414695194151160943305727036575959195309218611738193261179310511854807447n, 113410276730064486255102093846540133784865286929052426931474106396135072156n, 1n),
   new s(2379962749567351885752724891227938183011949129833673362440656643086021394946n, 776496453633298175483985398648758586525933812536653089401905292063708816422n, 1n)
 ];
-function S(n, t) {
-  const e = [];
+function y(n, e) {
+  const t = [];
   let r = n;
   for (let o = 0; o < 248; o++)
-    e.push(r), r = r.double();
-  r = t;
+    t.push(r), r = r.double();
+  r = e;
   for (let o = 0; o < 4; o++)
-    e.push(r), r = r.double();
-  return e;
+    t.push(r), r = r.double();
+  return t;
 }
-const k = S(u[1], u[2]), A = S(u[3], u[4]);
+const A = y(u[1], u[2]), C = y(u[3], u[4]);
 function O(n) {
-  let t;
+  let e;
   if (typeof n == "bigint")
-    t = n;
+    e = n;
   else if (typeof n == "number") {
     if (!Number.isSafeInteger(n))
       throw new Error(`Invalid pedersenArg: ${n}`);
-    t = BigInt(n);
+    e = BigInt(n);
   } else
-    t = c($(n));
-  if (!(0n <= t && t < I.CURVE.Fp.ORDER))
-    throw new Error(`PedersenArg should be 0 <= value < CURVE.P: ${t}`);
-  return t;
+    e = c($(n));
+  if (!(0n <= e && e < E.CURVE.Fp.ORDER))
+    throw new Error(`PedersenArg should be 0 <= value < CURVE.P: ${e}`);
+  return e;
 }
-function g(n, t, e) {
-  let r = O(t);
+function g(n, e, t) {
+  let r = O(e);
   for (let o = 0; o < 252; o++) {
-    const i = e[o];
+    const i = t[o];
     if (i.equals(n))
       throw new Error("Same point");
     (r & 1n) !== 0n && (n = n.add(i)), r >>= 1n;
   }
   return n;
 }
-function n0(n, t) {
-  let e = u[0];
-  return e = g(e, n, k), e = g(e, t, A), C(e.toRawBytes(!0));
+function Q(n, e) {
+  let t = u[0];
+  return t = g(t, n, A), t = g(t, e, C), D(t.toRawBytes(!0));
 }
-const M = x(250), t0 = (n) => c(y(n)) & M;
+const M = T(250), Y = (n) => c(P(n)) & M;
 l(BigInt("14474011154664525231415395255581126252639794253786371766033694892385558855681"));
-const U = l(BigInt("3618502788666131213697322783095070105623107215331596699973092056135872020481"));
-function V(n, t, e) {
-  const r = n.fromBytes(B(P(`${t}${e}`)));
+const j = l(BigInt("3618502788666131213697322783095070105623107215331596699973092056135872020481"));
+function H(n, e, t) {
+  const r = n.fromBytes(B(S(`${e}${t}`)));
   return n.create(r);
 }
-const j = [
+const L = [
   [3, 1, 1],
   [1, -1, 1],
   [1, 1, -2]
 ].map((n) => n.map(BigInt));
-function H(n, t) {
-  if (R(n.Fp), !Number.isSafeInteger(n.rate) || !Number.isSafeInteger(n.capacity))
+function U(n, e) {
+  if (b(n.Fp), !Number.isSafeInteger(n.rate) || !Number.isSafeInteger(n.capacity))
     throw new Error(`Wrong poseidon opts: ${n}`);
-  const e = n.rate + n.capacity, r = n.roundsFull + n.roundsPartial, o = [];
+  const t = n.rate + n.capacity, r = n.roundsFull + n.roundsPartial, o = [];
   for (let a = 0; a < r; a++) {
     const p = [];
-    for (let f = 0; f < e; f++)
-      p.push(V(n.Fp, "Hades", e * a + f));
+    for (let f = 0; f < t; f++)
+      p.push(H(n.Fp, "Hades", t * a + f));
     o.push(p);
   }
-  const i = b({
+  const i = R({
     ...n,
-    t: e,
+    t,
     sboxPower: 3,
     reversePartialPowIdx: !0,
-    mds: t,
+    mds: e,
     roundConstants: o
   });
-  return i.m = e, i.rate = n.rate, i.capacity = n.capacity, i;
+  return i.m = t, i.rate = n.rate, i.capacity = n.capacity, i;
 }
-H({ Fp: U, rate: 2, capacity: 1, roundsFull: 8, roundsPartial: 83 }, j);
+U({ Fp: j, rate: 2, capacity: 1, roundsFull: 8, roundsPartial: 83 }, L);
 export {
-  Q as CURVE,
-  U as Fp251,
+  j as Fp251,
   s as ProjectivePoint,
-  Y as Signature,
-  t0 as keccak,
-  n0 as pedersen,
-  H as poseidonBasic,
-  Z as utils
+  Y as keccak,
+  Q as pedersen,
+  U as poseidonBasic
 };

package/dist/src/accountNameGenerator/colors.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=[{token:"accent-sky-blue",hex:"#29C5FF"},{token:"accent-yellow",hex:"#FFBF3D"},{token:"accent-brand",hex:"#FF875B"},{token:"accent-green",hex:"#2CD3A9"},{token:"accent-hot-pink",hex:"#FF5B81"}];exports.nameDataColors=e;

package/dist/src/accountNameGenerator/colors.d.ts

@@ -0,0 +1,2 @@
+import { NameColor } from './types';
+export declare const nameDataColors: NameColor[];

package/dist/src/accountNameGenerator/colors.js

@@ -0,0 +1,25 @@
+const e = [
+  {
+    token: "accent-sky-blue",
+    hex: "#29C5FF"
+  },
+  {
+    token: "accent-yellow",
+    hex: "#FFBF3D"
+  },
+  {
+    token: "accent-brand",
+    hex: "#FF875B"
+  },
+  {
+    token: "accent-green",
+    hex: "#2CD3A9"
+  },
+  {
+    token: "accent-hot-pink",
+    hex: "#FF5B81"
+  }
+];
+export {
+  e as nameDataColors
+};

package/dist/src/accountNameGenerator/index.cjs

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

package/dist/src/accountNameGenerator/index.d.ts

@@ -0,0 +1,9 @@
+import { GeneratedNameData, NameColor, NameDataList } from './types';
+export declare class AccountNameGenerator {
+    nameList: NameDataList;
+    colorList: NameColor[];
+    constructor(nameList?: NameDataList, colorList?: NameColor[]);
+    generate(seed: string): GeneratedNameData;
+    private hashSeed;
+}
+export type * from './types';

package/dist/src/accountNameGenerator/index.js

@@ -0,0 +1,24 @@
+import { sha256 as c } from "../../node_modules/.pnpm/@noble_hashes@1.5.0/node_modules/@noble/hashes/esm/sha256.js";
+import { upperFirst as m } from "lodash-es";
+import { nameDataColors as h } from "./colors.js";
+import d from "./x-names.json.js";
+class j {
+  constructor(t, e) {
+    this.nameList = t || d, this.colorList = e || h;
+  }
+  generate(t) {
+    const e = this.hashSeed(t), s = e.getUint32(0) % this.nameList.items.length, o = this.nameList.items[s], n = e.getUint32(4) % o.adjectives.length, i = o.adjectives[n], r = e.getUint32(8) % this.colorList.length, a = this.colorList[r];
+    return {
+      name: `${m(i)} ${o.name}`,
+      emoji: o.emoji,
+      color: a
+    };
+  }
+  hashSeed(t) {
+    const e = c(new TextEncoder().encode(t));
+    return new DataView(e.buffer, e.byteOffset, e.byteLength);
+  }
+}
+export {
+  j as AccountNameGenerator
+};