@nihilium/client-sdk 0.1.2 → 0.2.0

package/dist/{index-DFD-0QrS-DqRwsoRk-DaSQ-uF-.js → index-DFD-0QrS-T8cg-3OU-Dqbi8PAZ.js}

@@ -1,4 +1,4 @@
-import { Z as tt, j as O, V as R, X as et, b as I, q as vt, W as x, z, c as nt, e as Ut, B as St } from "./index-78RSe_cY.js";
+import { _ as tt, P as O, a as R, Q as et, H as I, h as Ut, K as x, N as z, z as nt, l as St, B as vt } from "./types-C-XvYweP.js";
 /**
  * @module @zk-kit/utils
  * @version 1.2.1
@@ -14,14 +14,14 @@ function xt(t, e) {
   if (!Et(t))
     throw new TypeError(`Parameter '${e}' is not a Buffer instance`);
 }
-function Kt(t) {
+function Pt(t) {
   if (t <= 0)
     throw Error(`size ${t} is too small, need at least 1`);
   return crypto.getRandomValues(new Uint8Array(t));
 }
-var Pt = /* @__PURE__ */ Object.freeze({
+var Kt = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  getRandomValues: Kt
+  getRandomValues: Pt
 });
 /**
  * @module @zk-kit/utils
@@ -48,7 +48,7 @@ const Ot = [
 function gt(t) {
   return typeof t == "number";
 }
-function X(t) {
+function Z(t) {
   return typeof t == "string";
 }
 function Rt(t) {
@@ -60,17 +60,17 @@ function G(t) {
 function dt(t) {
   return G(t) && Array.isArray(t);
 }
-function N(t) {
+function J(t) {
   return t instanceof Uint8Array;
 }
-function Q(t) {
+function W(t) {
   return I.Buffer.isBuffer(t);
 }
-function H(t) {
+function j(t) {
   return typeof t == "bigint";
 }
-function Y(t) {
-  if (!X(t))
+function X(t) {
+  if (!Z(t))
     return !1;
   try {
     return BigInt(t), !0;
@@ -79,40 +79,40 @@ function Y(t) {
   }
 }
 function pt(t, e = !0) {
-  return X(t) ? e ? /^(0x|0X)[0-9a-fA-F]+$/.test(t) : /^[0-9a-fA-F]+$/.test(t) : !1;
+  return Z(t) ? e ? /^(0x|0X)[0-9a-fA-F]+$/.test(t) : /^[0-9a-fA-F]+$/.test(t) : !1;
 }
-function j(t) {
-  return H(t) || Y(t);
+function H(t) {
+  return j(t) || X(t);
 }
-function J(t) {
-  return gt(t) || H(t) || Y(t) || pt(t) || Q(t) || N(t);
+function Y(t) {
+  return gt(t) || j(t) || X(t) || pt(t) || W(t) || J(t);
 }
 function zt(t, e) {
   switch (e) {
     case "number":
       return gt(t);
     case "string":
-      return X(t);
+      return Z(t);
     case "function":
       return Rt(t);
     case "Array":
       return dt(t);
     case "Uint8Array":
-      return N(t);
+      return J(t);
     case "Buffer":
-      return Q(t);
+      return W(t);
     case "object":
       return G(t);
     case "bigint":
-      return H(t);
+      return j(t);
     case "stringified-bigint":
-      return Y(t);
+      return X(t);
     case "hexadecimal":
       return pt(t);
     case "bignumber":
-      return j(t);
+      return H(t);
     case "bignumberish":
-      return J(t);
+      return Y(t);
     default:
       return !1;
   }
@@ -128,12 +128,12 @@ function $t(t) {
  * @license MIT
  * @see [Github]{@link https://github.com/privacy-scaling-explorations/zk-kit/tree/main/packages/utils}
 */
-function jt(t, e) {
-  if (!H(t))
+function Ht(t, e) {
+  if (!j(t))
     throw new TypeError(`Parameter '${e}' is not a bigint, received type: ${typeof t}`);
 }
 function wt(t, e) {
-  if (!J(t))
+  if (!Y(t))
     throw new TypeError(`Parameter '${e}' is not a bignumber-ish`);
 }
 function F(t, e, r) {
@@ -153,29 +153,29 @@ function F(t, e, r) {
  * @license MIT
  * @see [Github]{@link https://github.com/privacy-scaling-explorations/zk-kit/tree/main/packages/utils}
 */
-function Ht(t) {
-  jt(t, "value");
+function jt(t) {
+  Ht(t, "value");
   let e = t.toString(16);
   return e.length % 2 !== 0 && (e = `0${e}`), e;
 }
 function Ft(t) {
   return F(t, "value", ["Buffer", "Uint8Array"]), BigInt(`0x${I.Buffer.from(t).toString("hex")}`);
 }
-function K(t) {
+function P(t) {
   return F(t, "value", ["Buffer", "Uint8Array"]), BigInt(`0x${I.Buffer.from(t).reverse().toString("hex")}`);
 }
 function yt(t) {
   return Ft(t);
 }
 function T(t, e) {
-  const r = Ht(t), n = Math.ceil(r.length / 2);
+  const r = jt(t), n = Math.ceil(r.length / 2);
   if (e < n)
     throw Error(`Size ${e} is too small, need at least ${n} bytes`);
   const g = I.Buffer.alloc(e, 0);
   return I.Buffer.from(r, "hex").reverse().copy(g, 0), g;
 }
-function kt(t) {
-  return wt(t, "value"), Q(t) || N(t) ? yt(t) : BigInt(t);
+function _t(t) {
+  return wt(t, "value"), W(t) || J(t) ? yt(t) : BigInt(t);
 }
 /**
  * @module @zk-kit/utils
@@ -191,7 +191,7 @@ function Tt(t) {
 function rt(t, e) {
   return t >> e;
 }
-function qt(t, e) {
+function Nt(t, e) {
   return t * e;
 }
 function Dt(t) {
@@ -366,9 +366,9 @@ class Mt {
     return g;
   }
 }
-var it = vt(), q, ot;
-function _t() {
-  if (ot) return q;
+var it = Ut(), N, ot;
+function kt() {
+  if (ot) return N;
   ot = 1;
   const t = "Input must be an string, Buffer or Uint8Array";
   function e(f) {
@@ -390,64 +390,64 @@ function _t() {
     return (4294967296 + f).toString(16).substring(1);
   }
   function g(f, a, u) {
-    let k = `
+    let _ = `
 ` + f + " = ";
     for (let b = 0; b < a.length; b += 2) {
       if (u === 32)
-        k += n(a[b]).toUpperCase(), k += " ", k += n(a[b + 1]).toUpperCase();
+        _ += n(a[b]).toUpperCase(), _ += " ", _ += n(a[b + 1]).toUpperCase();
       else if (u === 64)
-        k += n(a[b + 1]).toUpperCase(), k += n(a[b]).toUpperCase();
+        _ += n(a[b + 1]).toUpperCase(), _ += n(a[b]).toUpperCase();
       else throw new Error("Invalid size " + u);
-      b % 6 === 4 ? k += `
-` + new Array(f.length + 4).join(" ") : b < a.length - 2 && (k += " ");
+      b % 6 === 4 ? _ += `
+` + new Array(f.length + 4).join(" ") : b < a.length - 2 && (_ += " ");
     }
-    console.log(k);
+    console.log(_);
   }
   function h(f, a, u) {
-    let k = (/* @__PURE__ */ new Date()).getTime();
+    let _ = (/* @__PURE__ */ new Date()).getTime();
     const b = new Uint8Array(a);
     for (let y = 0; y < a; y++)
       b[y] = y % 256;
     const l = (/* @__PURE__ */ new Date()).getTime();
-    console.log("Generated random input in " + (l - k) + "ms"), k = l;
+    console.log("Generated random input in " + (l - _) + "ms"), _ = l;
     for (let y = 0; y < u; y++) {
-      const B = f(b), c = (/* @__PURE__ */ new Date()).getTime(), p = c - k;
-      k = c, console.log("Hashed in " + p + "ms: " + B.substring(0, 20) + "..."), console.log(
+      const B = f(b), c = (/* @__PURE__ */ new Date()).getTime(), p = c - _;
+      _ = c, console.log("Hashed in " + p + "ms: " + B.substring(0, 20) + "..."), console.log(
         Math.round(a / (1 << 20) / (p / 1e3) * 100) / 100 + " MB PER SECOND"
       );
     }
   }
-  return q = {
+  return N = {
     normalizeInput: e,
     toHex: r,
     debugPrint: g,
     testSpeed: h
-  }, q;
+  }, N;
 }
 var D, st;
-function Ct() {
+function qt() {
   if (st) return D;
   st = 1;
-  const t = _t();
+  const t = kt();
   function e(i, d, o) {
     const w = i[d] + i[o];
-    let _ = i[d + 1] + i[o + 1];
-    w >= 4294967296 && _++, i[d] = w, i[d + 1] = _;
+    let k = i[d + 1] + i[o + 1];
+    w >= 4294967296 && k++, i[d] = w, i[d + 1] = k;
   }
   function r(i, d, o, w) {
-    let _ = i[d] + o;
-    o < 0 && (_ += 4294967296);
+    let k = i[d] + o;
+    o < 0 && (k += 4294967296);
     let m = i[d + 1] + w;
-    _ >= 4294967296 && m++, i[d] = _, i[d + 1] = m;
+    k >= 4294967296 && m++, i[d] = k, i[d + 1] = m;
   }
   function n(i, d) {
     return i[d] ^ i[d + 1] << 8 ^ i[d + 2] << 16 ^ i[d + 3] << 24;
   }
-  function g(i, d, o, w, _, m) {
-    const Bt = k[_], mt = k[_ + 1], It = k[m], At = k[m + 1];
+  function g(i, d, o, w, k, m) {
+    const Bt = _[k], mt = _[k + 1], It = _[m], At = _[m + 1];
     e(u, i, d), r(u, i, Bt, mt);
-    let A = u[w] ^ u[i], v = u[w + 1] ^ u[i + 1];
-    u[w] = v, u[w + 1] = A, e(u, o, w), A = u[d] ^ u[o], v = u[d + 1] ^ u[o + 1], u[d] = A >>> 24 ^ v << 8, u[d + 1] = v >>> 24 ^ A << 8, e(u, i, d), r(u, i, It, At), A = u[w] ^ u[i], v = u[w + 1] ^ u[i + 1], u[w] = A >>> 16 ^ v << 16, u[w + 1] = v >>> 16 ^ A << 16, e(u, o, w), A = u[d] ^ u[o], v = u[d + 1] ^ u[o + 1], u[d] = v >>> 31 ^ A << 1, u[d + 1] = A >>> 31 ^ v << 1;
+    let A = u[w] ^ u[i], U = u[w + 1] ^ u[i + 1];
+    u[w] = U, u[w + 1] = A, e(u, o, w), A = u[d] ^ u[o], U = u[d + 1] ^ u[o + 1], u[d] = A >>> 24 ^ U << 8, u[d + 1] = U >>> 24 ^ A << 8, e(u, i, d), r(u, i, It, At), A = u[w] ^ u[i], U = u[w + 1] ^ u[i + 1], u[w] = A >>> 16 ^ U << 16, u[w + 1] = U >>> 16 ^ A << 16, e(u, o, w), A = u[d] ^ u[o], U = u[d + 1] ^ u[o + 1], u[d] = U >>> 31 ^ A << 1, u[d + 1] = A >>> 31 ^ U << 1;
   }
   const h = new Uint32Array([
     4089235720,
@@ -663,13 +663,13 @@ function Ct() {
     f.map(function(i) {
       return i * 2;
     })
-  ), u = new Uint32Array(32), k = new Uint32Array(32);
+  ), u = new Uint32Array(32), _ = new Uint32Array(32);
   function b(i, d) {
     let o = 0;
     for (o = 0; o < 16; o++)
       u[o] = i.h[o], u[o + 16] = h[o];
     for (u[24] = u[24] ^ i.t, u[25] = u[25] ^ i.t / 4294967296, d && (u[28] = ~u[28], u[29] = ~u[29]), o = 0; o < 32; o++)
-      k[o] = n(i.b, 4 * o);
+      _[o] = n(i.b, 4 * o);
     for (o = 0; o < 12; o++)
       g(0, 8, 16, 24, a[o * 16 + 0], a[o * 16 + 1]), g(2, 10, 18, 26, a[o * 16 + 2], a[o * 16 + 3]), g(4, 12, 20, 28, a[o * 16 + 4], a[o * 16 + 5]), g(6, 14, 22, 30, a[o * 16 + 6], a[o * 16 + 7]), g(0, 10, 20, 30, a[o * 16 + 8], a[o * 16 + 9]), g(2, 12, 22, 24, a[o * 16 + 10], a[o * 16 + 11]), g(4, 14, 16, 26, a[o * 16 + 12], a[o * 16 + 13]), g(6, 8, 18, 28, a[o * 16 + 14], a[o * 16 + 15]);
     for (o = 0; o < 16; o++)
@@ -766,7 +766,7 @@ function Ct() {
       throw new Error("Illegal salt, expected Uint8Array with length is 16");
     if (w && w.length !== 16)
       throw new Error("Illegal personal, expected Uint8Array with length is 16");
-    const _ = {
+    const k = {
       b: new Uint8Array(128),
       h: new Uint32Array(16),
       t: 0,
@@ -778,8 +778,8 @@ function Ct() {
     };
     l.fill(0), l[0] = i, d && (l[1] = d.length), l[2] = 1, l[3] = 1, o && l.set(o, 32), w && l.set(w, 48);
     for (let m = 0; m < 16; m++)
-      _.h[m] = h[m] ^ n(l, m * 4);
-    return d && (B(_, d), _.c = 128), _;
+      k.h[m] = h[m] ^ n(l, m * 4);
+    return d && (B(k, d), k.c = 128), k;
   }
   function B(i, d) {
     for (let o = 0; o < d.length; o++)
@@ -794,13 +794,13 @@ function Ct() {
       d[o] = i.h[o >> 2] >> 8 * (o & 3);
     return d;
   }
-  function p(i, d, o, w, _) {
-    o = o || 64, i = t.normalizeInput(i), w && (w = t.normalizeInput(w)), _ && (_ = t.normalizeInput(_));
-    const m = y(o, d, w, _);
+  function p(i, d, o, w, k) {
+    o = o || 64, i = t.normalizeInput(i), w && (w = t.normalizeInput(w)), k && (k = t.normalizeInput(k));
+    const m = y(o, d, w, k);
     return B(m, i), c(m);
   }
-  function s(i, d, o, w, _) {
-    const m = p(i, d, o, w, _);
+  function s(i, d, o, w, k) {
+    const m = p(i, d, o, w, k);
     return t.toHex(m);
   }
   return D = {
@@ -812,10 +812,10 @@ function Ct() {
   }, D;
 }
 var M, ut;
-function Lt() {
+function Ct() {
   if (ut) return M;
   ut = 1;
-  const t = _t();
+  const t = kt();
   function e(c, p) {
     return c[p] ^ c[p + 1] << 8 ^ c[p + 2] << 16 ^ c[p + 3] << 24;
   }
@@ -1007,7 +1007,7 @@ function Lt() {
     for (s = 0; s < 8; s++)
       c.h[s] ^= f[s] ^ f[s + 8];
   }
-  function k(c, p) {
+  function _(c, p) {
     if (!(c > 0 && c <= 32))
       throw new Error("Incorrect output length, should be in [1, 32]");
     const s = p ? p.length : 0;
@@ -1042,7 +1042,7 @@ function Lt() {
   }
   function y(c, p, s) {
     s = s || 32, c = t.normalizeInput(c);
-    const i = k(s, p);
+    const i = _(s, p);
     return b(i, c), l(i);
   }
   function B(c, p, s) {
@@ -1052,17 +1052,17 @@ function Lt() {
   return M = {
     blake2s: y,
     blake2sHex: B,
-    blake2sInit: k,
+    blake2sInit: _,
     blake2sUpdate: b,
     blake2sFinal: l
   }, M;
 }
-var C, at;
-function Vt() {
-  if (at) return C;
+var q, at;
+function Lt() {
+  if (at) return q;
   at = 1;
-  const t = Ct(), e = Lt();
-  return C = {
+  const t = qt(), e = Ct();
+  return q = {
     blake2b: t.blake2b,
     blake2bHex: t.blake2bHex,
     blake2bInit: t.blake2bInit,
@@ -1073,9 +1073,9 @@ function Vt() {
     blake2sInit: e.blake2sInit,
     blake2sUpdate: e.blake2sUpdate,
     blake2sFinal: e.blake2sFinal
-  }, C;
+  }, q;
 }
-var L = Vt();
+var C = Lt();
 /**
  * @module @zk-kit/eddsa-poseidon
  * @version 1.1.0
@@ -1084,7 +1084,7 @@ var L = Vt();
  * @license MIT
  * @see [Github]{@link https://github.com/privacy-scaling-explorations/zk-kit/tree/main/packages/eddsa-poseidon}
 */
-const Zt = I.Buffer.from([1]), Wt = I.Buffer.from([129]), U = [
+const Vt = I.Buffer.from([1]), Qt = I.Buffer.from([129]), S = [
   [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15],
   [14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3],
   [11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4],
@@ -1134,7 +1134,7 @@ const Zt = I.Buffer.from([1]), Wt = I.Buffer.from([129]), U = [
   2240740374,
   1667834072,
   1901547113
-], V = I.Buffer.from([
+], L = I.Buffer.from([
   128,
   0,
   0,
@@ -1269,15 +1269,15 @@ function $(t, e, r, n) {
   let g = t[e * 2] ^ t[r * 2], h = t[e * 2 + 1] ^ t[r * 2 + 1];
   n >= 32 && (h ^= g, g ^= h, h ^= g, n -= 32), n === 0 ? (t[e * 2] = g >>> 0, t[e * 2 + 1] = h >>> 0) : (t[e * 2] = (g >>> n | h << 32 - n) >>> 0, t[e * 2 + 1] = (h >>> n | g << 32 - n) >>> 0);
 }
-function S(t, e, r, n, g, h, f, a) {
+function v(t, e, r, n, g, h, f, a) {
   let u;
-  u = t[n * 2 + 1] + ((e[U[r][a] * 2 + 1] ^ E[U[r][a + 1] * 2 + 1]) >>> 0) + t[g * 2 + 1], t[n * 2] = t[n * 2] + ((e[U[r][a] * 2] ^ E[U[r][a + 1] * 2]) >>> 0) + t[g * 2] + ~~(u / 4294967296) >>> 0, t[n * 2 + 1] = u >>> 0, $(t, f, n, 32), u = t[h * 2 + 1] + t[f * 2 + 1], t[h * 2] = t[h * 2] + t[f * 2] + ~~(u / 4294967296) >>> 0, t[h * 2 + 1] = u >>> 0, $(t, g, h, 25), u = t[n * 2 + 1] + ((e[U[r][a + 1] * 2 + 1] ^ E[U[r][a] * 2 + 1]) >>> 0) + t[g * 2 + 1], t[n * 2] = t[n * 2] + ((e[U[r][a + 1] * 2] ^ E[U[r][a] * 2]) >>> 0) + t[g * 2] + ~~(u / 4294967296) >>> 0, t[n * 2 + 1] = u >>> 0, $(t, f, n, 16), u = t[h * 2 + 1] + t[f * 2 + 1], t[h * 2] = t[h * 2] + t[f * 2] + ~~(u / 4294967296) >>> 0, t[h * 2 + 1] = u >>> 0, $(t, g, h, 11);
+  u = t[n * 2 + 1] + ((e[S[r][a] * 2 + 1] ^ E[S[r][a + 1] * 2 + 1]) >>> 0) + t[g * 2 + 1], t[n * 2] = t[n * 2] + ((e[S[r][a] * 2] ^ E[S[r][a + 1] * 2]) >>> 0) + t[g * 2] + ~~(u / 4294967296) >>> 0, t[n * 2 + 1] = u >>> 0, $(t, f, n, 32), u = t[h * 2 + 1] + t[f * 2 + 1], t[h * 2] = t[h * 2] + t[f * 2] + ~~(u / 4294967296) >>> 0, t[h * 2 + 1] = u >>> 0, $(t, g, h, 25), u = t[n * 2 + 1] + ((e[S[r][a + 1] * 2 + 1] ^ E[S[r][a] * 2 + 1]) >>> 0) + t[g * 2 + 1], t[n * 2] = t[n * 2] + ((e[S[r][a + 1] * 2] ^ E[S[r][a] * 2]) >>> 0) + t[g * 2] + ~~(u / 4294967296) >>> 0, t[n * 2 + 1] = u >>> 0, $(t, f, n, 16), u = t[h * 2 + 1] + t[f * 2 + 1], t[h * 2] = t[h * 2] + t[f * 2] + ~~(u / 4294967296) >>> 0, t[h * 2 + 1] = u >>> 0, $(t, g, h, 11);
 }
 function ct(t) {
   for (let e = 0; e < t.length && !(t[e] < 4294967296); e += 1)
     t[e] -= 4294967296, t[e + 1] += 1;
 }
-class Xt {
+class Zt {
   /**
    * Initializes a new Blake-512 hash instance with the default parameters.
    */
@@ -1299,7 +1299,7 @@ class Xt {
       4215389547,
       1541459225,
       327033209
-    ], this._s = [0, 0, 0, 0, 0, 0, 0, 0], this._block = I.Buffer.alloc(128), this._blockOffset = 0, this._length = [0, 0, 0, 0], this._nullt = !1, this._zo = Zt, this._oo = Wt;
+    ], this._s = [0, 0, 0, 0, 0, 0, 0, 0], this._block = I.Buffer.alloc(128), this._blockOffset = 0, this._length = [0, 0, 0, 0], this._nullt = !1, this._zo = Vt, this._oo = Qt;
   }
   /**
    * The core compression function for Blake-512. It transforms the internal
@@ -1317,7 +1317,7 @@ class Xt {
     for (n = 24; n < 32; n += 1)
       e[n] = E[n - 16];
     for (this._nullt || (e[24] = (e[24] ^ this._length[1]) >>> 0, e[25] = (e[25] ^ this._length[0]) >>> 0, e[26] = (e[26] ^ this._length[1]) >>> 0, e[27] = (e[27] ^ this._length[0]) >>> 0, e[28] = (e[28] ^ this._length[3]) >>> 0, e[29] = (e[29] ^ this._length[2]) >>> 0, e[30] = (e[30] ^ this._length[3]) >>> 0, e[31] = (e[31] ^ this._length[2]) >>> 0), n = 0; n < 16; n += 1)
-      S(e, r, n, 0, 4, 8, 12, 0), S(e, r, n, 1, 5, 9, 13, 2), S(e, r, n, 2, 6, 10, 14, 4), S(e, r, n, 3, 7, 11, 15, 6), S(e, r, n, 0, 5, 10, 15, 8), S(e, r, n, 1, 6, 11, 12, 10), S(e, r, n, 2, 7, 8, 13, 12), S(e, r, n, 3, 4, 9, 14, 14);
+      v(e, r, n, 0, 4, 8, 12, 0), v(e, r, n, 1, 5, 9, 13, 2), v(e, r, n, 2, 6, 10, 14, 4), v(e, r, n, 3, 7, 11, 15, 6), v(e, r, n, 0, 5, 10, 15, 8), v(e, r, n, 1, 6, 11, 12, 10), v(e, r, n, 2, 7, 8, 13, 12), v(e, r, n, 3, 4, 9, 14, 14);
     for (n = 0; n < 16; n += 1)
       this._h[n % 8 * 2] = (this._h[n % 8 * 2] ^ e[n * 2]) >>> 0, this._h[n % 8 * 2 + 1] = (this._h[n % 8 * 2 + 1] ^ e[n * 2 + 1]) >>> 0;
     for (n = 0; n < 8; n += 1)
@@ -1333,7 +1333,7 @@ class Xt {
     const r = I.Buffer.alloc(16);
     for (let n = 0; n < 4; n += 1)
       r.writeUInt32BE(e[3 - n], n * 4);
-    this._blockOffset === 111 ? (this._length[0] -= 8, this.update(this._oo)) : (this._blockOffset < 111 ? (this._blockOffset === 0 && (this._nullt = !0), this._length[0] -= (111 - this._blockOffset) * 8, this.update(V.subarray(0, 111 - this._blockOffset))) : (this._length[0] -= (128 - this._blockOffset) * 8, this.update(V.subarray(0, 128 - this._blockOffset)), this._length[0] -= 111 * 8, this.update(V.subarray(1, 112)), this._nullt = !0), this.update(this._zo), this._length[0] -= 8), this._length[0] -= 128, this.update(r);
+    this._blockOffset === 111 ? (this._length[0] -= 8, this.update(this._oo)) : (this._blockOffset < 111 ? (this._blockOffset === 0 && (this._nullt = !0), this._length[0] -= (111 - this._blockOffset) * 8, this.update(L.subarray(0, 111 - this._blockOffset))) : (this._length[0] -= (128 - this._blockOffset) * 8, this.update(L.subarray(0, 128 - this._blockOffset)), this._length[0] -= 111 * 8, this.update(L.subarray(1, 112)), this._nullt = !0), this.update(this._zo), this._length[0] -= 8), this._length[0] -= 128, this.update(r);
   }
   /**
    * Completes the hash computation and returns the final hash value.
@@ -1377,7 +1377,7 @@ class Gt {
   constructor(e = 64, r) {
     if (this.key = null, this.outlen = 64, r && (this.key = r), e <= 0 || e > 64)
       throw new Error("Illegal output length, expected 0 < length <= 64");
-    this.outlen = e, this.context = L.blake2bInit(this.outlen, r);
+    this.outlen = e, this.context = C.blake2bInit(this.outlen, r);
   }
   /**
    * Updates the hash with new data. This method can be called multiple
@@ -1386,7 +1386,7 @@ class Gt {
    * @returns The instance, to allow method chaining.
    */
   update(e) {
-    return L.blake2bUpdate(this.context, e), this;
+    return C.blake2bUpdate(this.context, e), this;
   }
   /**
    * Completes the hash computation and returns the final hash value.
@@ -1395,32 +1395,32 @@ class Gt {
    * @returns The Blake2b hash of the input data.
    */
   digest() {
-    return St.from(L.blake2bFinal(this.context));
+    return vt.from(C.blake2bFinal(this.context));
   }
 }
 function ft(t) {
   return t[0] &= 248, t[31] &= 127, t[31] |= 64, t;
 }
-function W(t) {
-  return dt(t) && t.length === 2 && j(t[0]) && j(t[1]);
+function Q(t) {
+  return dt(t) && t.length === 2 && H(t[0]) && H(t[1]);
 }
 function lt(t) {
-  return G(t) && Object.prototype.hasOwnProperty.call(t, "R8") && Object.prototype.hasOwnProperty.call(t, "S") && W(t.R8) && j(t.S);
+  return G(t) && Object.prototype.hasOwnProperty.call(t, "R8") && Object.prototype.hasOwnProperty.call(t, "S") && Q(t.R8) && H(t.S);
 }
 function ht(t) {
   return F(t, "privateKey", ["Buffer", "Uint8Array", "string"]), I.Buffer.from(t);
 }
 function bt(t) {
-  return F(t, "message", ["bignumberish", "string"]), J(t) ? kt(t) : yt(I.Buffer.from(t));
+  return F(t, "message", ["bignumberish", "string"]), Y(t) ? _t(t) : yt(I.Buffer.from(t));
 }
-function Z(t, e) {
+function V(t, e) {
   let r;
   switch (e) {
-    case P.BLAKE1: {
-      r = new Xt();
+    case K.BLAKE1: {
+      r = new Zt();
       break;
     }
-    case P.BLAKE2b: {
+    case K.BLAKE2b: {
       r = new Gt();
       break;
     }
@@ -1429,15 +1429,15 @@ function Z(t, e) {
   }
   return r.update(I.Buffer.from(t)), r.digest();
 }
-var P;
+var K;
 (function(t) {
   t.BLAKE1 = "blake-1", t.BLAKE2b = "blake-2b";
-})(P || (P = {}));
-const Nt = (t) => {
+})(K || (K = {}));
+const Jt = (t) => {
   const e = (b) => {
     b = ht(b);
-    let l = Z(b, t);
-    return l = l.slice(0, 32), l = ft(l), rt(K(l), BigInt(3)) % R;
+    let l = V(b, t);
+    return l = l.slice(0, 32), l = ft(l), rt(P(l), BigInt(3)) % R;
   };
   function r(b) {
     const l = e(b);
@@ -1445,29 +1445,29 @@ const Nt = (t) => {
   }
   function n(b, l) {
     b = ht(b), l = bt(l);
-    const y = Z(b, t), B = ft(y.slice(0, 32)), c = K(B), p = x(z, rt(c, BigInt(3))), s = T(l, 32), i = Z(I.Buffer.concat([y.slice(32, 64), s]), t), d = new Mt(R), o = d.e(K(i)), w = x(z, o), _ = it.poseidon5([w[0], w[1], p[0], p[1], l]), m = d.add(o, d.mul(_, c));
+    const y = V(b, t), B = ft(y.slice(0, 32)), c = P(B), p = x(z, rt(c, BigInt(3))), s = T(l, 32), i = V(I.Buffer.concat([y.slice(32, 64), s]), t), d = new Mt(R), o = d.e(P(i)), w = x(z, o), k = it.poseidon5([w[0], w[1], p[0], p[1], l]), m = d.add(o, d.mul(k, c));
     return { R8: w, S: m };
   }
   function g(b, l, y) {
-    if (!W(y) || !lt(l) || !O(l.R8) || !O(y) || BigInt(l.S) >= R)
+    if (!Q(y) || !lt(l) || !O(l.R8) || !O(y) || BigInt(l.S) >= R)
       return !1;
     b = bt(b);
     const B = {
       R8: [BigInt(l.R8[0]), BigInt(l.R8[1])],
       S: BigInt(l.S)
     }, c = [BigInt(y[0]), BigInt(y[1])], p = it.poseidon5([l.R8[0], l.R8[1], y[0], y[1], b]), s = x(z, BigInt(l.S));
-    let i = x(c, qt(p, BigInt(8)));
-    return i = Ut(B.R8, i), nt.eq(s[0], i[0]) && nt.eq(s[1], i[1]);
+    let i = x(c, Nt(p, BigInt(8)));
+    return i = St(B.R8, i), nt.eq(s[0], i[0]) && nt.eq(s[1], i[1]);
   }
   function h(b) {
-    if (!W(b) || !O(b))
+    if (!Q(b) || !O(b))
       throw new Error("Invalid public key");
     const l = [BigInt(b[0]), BigInt(b[1])];
     return et(l);
   }
   function f(b) {
     wt(b, "publicKey");
-    const l = tt(kt(b));
+    const l = tt(_t(b));
     if (l === null)
       throw new Error("Invalid public key");
     return l;
@@ -1484,15 +1484,15 @@ const Nt = (t) => {
   function u(b) {
     if (xt(b, "packedSignature"), b.length !== 64)
       throw new Error("Packed signature must be 64 bytes");
-    const l = b.subarray(0, 32), y = b.subarray(32, 64), B = tt(K(l));
+    const l = b.subarray(0, 32), y = b.subarray(32, 64), B = tt(P(l));
     if (B === null)
       throw new Error(`Invalid packed signature point ${y.toString("hex")}.`);
     return {
       R8: B,
-      S: K(y)
+      S: P(y)
     };
   }
-  class k {
+  class _ {
     /**
      * Initializes a new instance, deriving necessary cryptographic parameters from the provided private key.
      * If the private key is not passed as a parameter, a random 32-byte hexadecimal key is generated.
@@ -1505,7 +1505,7 @@ const Nt = (t) => {
      *
      * @param privateKey The private key used for signing and public key derivation.
      */
-    constructor(l = Pt.getRandomValues(32)) {
+    constructor(l = Kt.getRandomValues(32)) {
       this.privateKey = l, this.secretScalar = e(l), this.publicKey = r(l), this.packedPublicKey = h(this.publicKey);
     }
     /**
@@ -1535,12 +1535,12 @@ const Nt = (t) => {
     unpackPublicKey: f,
     packSignature: a,
     unpackSignature: u,
-    EdDSAPoseidon: k
+    EdDSAPoseidon: _
   };
-}, { EdDSAPoseidon: Yt, derivePublicKey: Jt, deriveSecretScalar: te, packPublicKey: ee, packSignature: ne, signMessage: re, unpackPublicKey: ie, unpackSignature: oe, verifySignature: se } = Nt(P.BLAKE1);
+}, { EdDSAPoseidon: Xt, derivePublicKey: Yt, deriveSecretScalar: te, packPublicKey: ee, packSignature: ne, signMessage: re, unpackPublicKey: ie, unpackSignature: oe, verifySignature: se } = Jt(K.BLAKE1);
 export {
-  Yt as EdDSAPoseidon,
-  Jt as derivePublicKey,
+  Xt as EdDSAPoseidon,
+  Yt as derivePublicKey,
   te as deriveSecretScalar,
   ee as packPublicKey,
   ne as packSignature,