@nihilium/client-sdk 0.1.2 → 0.2.1

package/dist/{index-C3cHMpbE-BjZqbn-8.js → index-ToaS6unp-DgCzjWB-.js}

@@ -1,4 +1,5 @@
-import { A as Dt, Y as Ct, B as Lt } from "./index-78RSe_cY.js";
+import { X as Dt, B as Ct } from "./types-B5eO7zCS.js";
+import { b as Lt } from "./index-DCjxkCyO.js";
 var I = Dt();
 /**
  * @module @zk-kit/utils
@@ -22,19 +23,19 @@ const Zt = [
   "bignumber",
   "bignumberish"
 ];
-function wt(t) {
+function mt(t) {
   return typeof t == "number";
 }
-function W(t) {
+function Y(t) {
   return typeof t == "string";
 }
-function Vt(t) {
+function Xt(t) {
   return typeof t == "function";
 }
 function kt(t) {
   return typeof t == "object";
 }
-function Xt(t) {
+function Vt(t) {
   return kt(t) && Array.isArray(t);
 }
 function It(t) {
@@ -47,7 +48,7 @@ function F(t) {
   return typeof t == "bigint";
 }
 function tt(t) {
-  if (!W(t))
+  if (!Y(t))
     return !1;
   try {
     return BigInt(t), !0;
@@ -56,24 +57,24 @@ function tt(t) {
   }
 }
 function vt(t, e = !0) {
-  return W(t) ? e ? /^(0x|0X)[0-9a-fA-F]+$/.test(t) : /^[0-9a-fA-F]+$/.test(t) : !1;
+  return Y(t) ? e ? /^(0x|0X)[0-9a-fA-F]+$/.test(t) : /^[0-9a-fA-F]+$/.test(t) : !1;
 }
-function Yt(t) {
+function Nt(t) {
   return F(t) || tt(t);
 }
 function Gt(t) {
-  return wt(t) || F(t) || tt(t) || vt(t) || At(t) || It(t);
+  return mt(t) || F(t) || tt(t) || vt(t) || At(t) || It(t);
 }
-function Nt(t, e) {
+function Jt(t, e) {
   switch (e) {
     case "number":
-      return wt(t);
+      return mt(t);
     case "string":
-      return W(t);
+      return Y(t);
     case "function":
-      return Vt(t);
-    case "Array":
       return Xt(t);
+    case "Array":
+      return Vt(t);
     case "Uint8Array":
       return It(t);
     case "Buffer":
@@ -87,14 +88,14 @@ function Nt(t, e) {
     case "hexadecimal":
       return vt(t);
     case "bignumber":
-      return Yt(t);
+      return Nt(t);
     case "bignumberish":
       return Gt(t);
     default:
       return !1;
   }
 }
-function Jt(t) {
+function Qt(t) {
   return Zt.includes(t);
 }
 /**
@@ -105,16 +106,16 @@ function Jt(t) {
  * @license MIT
  * @see [Github]{@link https://github.com/privacy-scaling-explorations/zk-kit/tree/main/packages/utils}
 */
-function Qt(t, e) {
+function Wt(t, e) {
   if (!F(t))
     throw new TypeError(`Parameter '${e}' is not a bigint, received type: ${typeof t}`);
 }
-function Wt(t, e, r) {
+function Yt(t, e, r) {
   for (const n of r)
-    if (!Jt(n))
+    if (!Qt(n))
       throw new Error(`Type '${n}' is not supported`);
   for (const n of r)
-    if (Nt(t, n))
+    if (Jt(t, n))
       return;
   throw new TypeError(`Parameter '${e}' is none of the following types: ${r.join(", ")}`);
 }
@@ -127,12 +128,12 @@ function Wt(t, e, r) {
  * @see [Github]{@link https://github.com/privacy-scaling-explorations/zk-kit/tree/main/packages/utils}
 */
 function te(t) {
-  Qt(t, "value");
+  Wt(t, "value");
   let e = t.toString(16);
   return e.length % 2 !== 0 && (e = `0${e}`), e;
 }
 function Ut(t) {
-  return Wt(t, "value", ["Buffer", "Uint8Array"]), BigInt(`0x${I.Buffer.from(t).reverse().toString("hex")}`);
+  return Yt(t, "value", ["Buffer", "Uint8Array"]), BigInt(`0x${I.Buffer.from(t).reverse().toString("hex")}`);
 }
 function St(t, e) {
   const r = te(t), n = Math.ceil(r.length / 2);
@@ -351,7 +352,7 @@ function ie(t, e) {
   const l = r.pow(r.mul(r.square(s), t), BigInt(2 ** (n - 1)));
   if (r.eq(l, r._negone))
     return null;
-  let c = n, m = r.mul(t, s), b = r.mul(m, s), g = o;
+  let c = n, w = r.mul(t, s), b = r.mul(w, s), g = o;
   for (; !r.eq(b, r.one); ) {
     let _ = r.square(b), k = 1;
     for (; !r.eq(_, r.one); )
@@ -359,22 +360,22 @@ function ie(t, e) {
     s = g;
     for (let a = 0; a < c - k - 1; a += 1)
       s = r.square(s);
-    g = r.square(s), b = r.mul(b, g), m = r.mul(m, s), c = k;
+    g = r.square(s), b = r.mul(b, g), w = r.mul(w, s), c = k;
   }
-  return r.geq(m, r.zero) ? m : r.neg(m);
+  return r.geq(w, r.zero) ? w : r.neg(w);
 }
-const N = BigInt("21888242871839275222246405745257275088548364400416034343698204186575808495617"), y = new $t(N), q = [
+const J = BigInt("21888242871839275222246405745257275088548364400416034343698204186575808495617"), y = new $t(J), q = [
   y.e(BigInt("5299619240641551281634865583518297030282874472190772894086521144482721001553")),
   y.e(BigInt("16950150798460657717958625567821834550301663161624707787222815936182638968203"))
 ], j = y.e(BigInt("168700")), et = y.e(BigInt("168696")), oe = BigInt("21888242871839275222246405745257275088614511777268538073601725287587578984328"), K = xt(oe, BigInt(3));
-function J(t, e) {
+function Q(t, e) {
   const r = y.mul(t[0], e[1]), n = y.mul(t[1], e[0]), o = y.mul(y.sub(t[1], y.mul(j, t[0])), y.add(e[0], e[1])), h = y.mul(r, n), s = y.mul(et, h), l = y.div(y.add(r, n), y.add(y.one, s)), c = y.div(y.add(o, y.sub(y.mul(j, r), n)), y.sub(y.one, s));
   return [l, c];
 }
 function $(t, e) {
   let r = [y.e(BigInt(0)), y.e(BigInt(1))], n = e, o = t;
   for (; !Et(n); )
-    ee(n) && (r = J(r, o)), o = J(o, o), n = xt(n, BigInt(1));
+    ee(n) && (r = Q(r, o)), o = Q(o, o), n = xt(n, BigInt(1));
   return r;
 }
 function O(t) {
@@ -388,10 +389,10 @@ function ft(t) {
 function ct(t) {
   const e = St(t), r = new Array(2);
   let n = !1;
-  if (e[31] & 128 && (n = !0, e[31] &= 127), r[1] = Ut(e), re(r[1], N))
+  if (e[31] & 128 && (n = !0, e[31] &= 127), r[1] = Ut(e), re(r[1], J))
     return null;
   const o = y.square(r[1]);
-  let h = ie(y.div(y.sub(y.one, o), y.sub(j, y.mul(et, o))), N);
+  let h = ie(y.div(y.sub(y.one, o), y.sub(j, y.mul(et, o))), J);
   return h == null ? null : (n && (h = y.neg(h)), r[0] = h, r);
 }
 /**
@@ -589,7 +590,7 @@ function lt(t, e) {
 function _e(t, e) {
   return t * e;
 }
-function me(t) {
+function we(t) {
   const e = [];
   let r = t;
   for (; r; )
@@ -752,7 +753,7 @@ class Be {
     if (de(r))
       return this.one;
     r < 0n && (e = this.inv(e), r = -r);
-    const n = me(r);
+    const n = we(r);
     if (n.length === 0)
       return this.one;
     let o = e;
@@ -761,7 +762,7 @@ class Be {
     return o;
   }
 }
-var at = Ct(), C, ht;
+var at = Lt(), C, ht;
 function jt() {
   if (ht) return C;
   ht = 1;
@@ -785,29 +786,29 @@ function jt() {
     return (4294967296 + s).toString(16).substring(1);
   }
   function o(s, l, c) {
-    let m = `
+    let w = `
 ` + s + " = ";
     for (let b = 0; b < l.length; b += 2) {
       if (c === 32)
-        m += n(l[b]).toUpperCase(), m += " ", m += n(l[b + 1]).toUpperCase();
+        w += n(l[b]).toUpperCase(), w += " ", w += n(l[b + 1]).toUpperCase();
       else if (c === 64)
-        m += n(l[b + 1]).toUpperCase(), m += n(l[b]).toUpperCase();
+        w += n(l[b + 1]).toUpperCase(), w += n(l[b]).toUpperCase();
       else throw new Error("Invalid size " + c);
-      b % 6 === 4 ? m += `
-` + new Array(s.length + 4).join(" ") : b < l.length - 2 && (m += " ");
+      b % 6 === 4 ? w += `
+` + new Array(s.length + 4).join(" ") : b < l.length - 2 && (w += " ");
     }
-    console.log(m);
+    console.log(w);
   }
   function h(s, l, c) {
-    let m = (/* @__PURE__ */ new Date()).getTime();
+    let w = (/* @__PURE__ */ new Date()).getTime();
     const b = new Uint8Array(l);
     for (let _ = 0; _ < l; _++)
       b[_] = _ % 256;
     const g = (/* @__PURE__ */ new Date()).getTime();
-    console.log("Generated random input in " + (g - m) + "ms"), m = g;
+    console.log("Generated random input in " + (g - w) + "ms"), w = g;
     for (let _ = 0; _ < c; _++) {
-      const k = s(b), a = (/* @__PURE__ */ new Date()).getTime(), d = a - m;
-      m = a, console.log("Hashed in " + d + "ms: " + k.substring(0, 20) + "..."), console.log(
+      const k = s(b), a = (/* @__PURE__ */ new Date()).getTime(), d = a - w;
+      w = a, console.log("Hashed in " + d + "ms: " + k.substring(0, 20) + "..."), console.log(
         Math.round(l / (1 << 20) / (d / 1e3) * 100) / 100 + " MB PER SECOND"
       );
     }
@@ -820,26 +821,26 @@ function jt() {
   }, C;
 }
 var L, gt;
-function we() {
+function me() {
   if (gt) return L;
   gt = 1;
   const t = jt();
   function e(i, p, u) {
     const B = i[p] + i[u];
-    let w = i[p + 1] + i[u + 1];
-    B >= 4294967296 && w++, i[p] = B, i[p + 1] = w;
+    let m = i[p + 1] + i[u + 1];
+    B >= 4294967296 && m++, i[p] = B, i[p + 1] = m;
   }
   function r(i, p, u, B) {
-    let w = i[p] + u;
-    u < 0 && (w += 4294967296);
+    let m = i[p] + u;
+    u < 0 && (m += 4294967296);
     let A = i[p + 1] + B;
-    w >= 4294967296 && A++, i[p] = w, i[p + 1] = A;
+    m >= 4294967296 && A++, i[p] = m, i[p + 1] = A;
   }
   function n(i, p) {
     return i[p] ^ i[p + 1] << 8 ^ i[p + 2] << 16 ^ i[p + 3] << 24;
   }
-  function o(i, p, u, B, w, A) {
-    const Tt = m[w], Ft = m[w + 1], Ht = m[A], Mt = m[A + 1];
+  function o(i, p, u, B, m, A) {
+    const Tt = w[m], Ft = w[m + 1], Ht = w[A], Mt = w[A + 1];
     e(c, i, p), r(c, i, Tt, Ft);
     let v = c[B] ^ c[i], U = c[B + 1] ^ c[i + 1];
     c[B] = U, c[B + 1] = v, e(c, u, B), v = c[p] ^ c[u], U = c[p + 1] ^ c[u + 1], c[p] = v >>> 24 ^ U << 8, c[p + 1] = U >>> 24 ^ v << 8, e(c, i, p), r(c, i, Ht, Mt), v = c[B] ^ c[i], U = c[B + 1] ^ c[i + 1], c[B] = v >>> 16 ^ U << 16, c[B + 1] = U >>> 16 ^ v << 16, e(c, u, B), v = c[p] ^ c[u], U = c[p + 1] ^ c[u + 1], c[p] = U >>> 31 ^ v << 1, c[p + 1] = v >>> 31 ^ U << 1;
@@ -1058,13 +1059,13 @@ function we() {
     s.map(function(i) {
       return i * 2;
     })
-  ), c = new Uint32Array(32), m = new Uint32Array(32);
+  ), c = new Uint32Array(32), w = new Uint32Array(32);
   function b(i, p) {
     let u = 0;
     for (u = 0; u < 16; u++)
       c[u] = i.h[u], c[u + 16] = h[u];
     for (c[24] = c[24] ^ i.t, c[25] = c[25] ^ i.t / 4294967296, p && (c[28] = ~c[28], c[29] = ~c[29]), u = 0; u < 32; u++)
-      m[u] = n(i.b, 4 * u);
+      w[u] = n(i.b, 4 * u);
     for (u = 0; u < 12; u++)
       o(0, 8, 16, 24, l[u * 16 + 0], l[u * 16 + 1]), o(2, 10, 18, 26, l[u * 16 + 2], l[u * 16 + 3]), o(4, 12, 20, 28, l[u * 16 + 4], l[u * 16 + 5]), o(6, 14, 22, 30, l[u * 16 + 6], l[u * 16 + 7]), o(0, 10, 20, 30, l[u * 16 + 8], l[u * 16 + 9]), o(2, 12, 22, 24, l[u * 16 + 10], l[u * 16 + 11]), o(4, 14, 16, 26, l[u * 16 + 12], l[u * 16 + 13]), o(6, 8, 18, 28, l[u * 16 + 14], l[u * 16 + 15]);
     for (u = 0; u < 16; u++)
@@ -1161,7 +1162,7 @@ function we() {
       throw new Error("Illegal salt, expected Uint8Array with length is 16");
     if (B && B.length !== 16)
       throw new Error("Illegal personal, expected Uint8Array with length is 16");
-    const w = {
+    const m = {
       b: new Uint8Array(128),
       h: new Uint32Array(16),
       t: 0,
@@ -1173,8 +1174,8 @@ function we() {
     };
     g.fill(0), g[0] = i, p && (g[1] = p.length), g[2] = 1, g[3] = 1, u && g.set(u, 32), B && g.set(B, 48);
     for (let A = 0; A < 16; A++)
-      w.h[A] = h[A] ^ n(g, A * 4);
-    return p && (k(w, p), w.c = 128), w;
+      m.h[A] = h[A] ^ n(g, A * 4);
+    return p && (k(m, p), m.c = 128), m;
   }
   function k(i, p) {
     for (let u = 0; u < p.length; u++)
@@ -1189,13 +1190,13 @@ function we() {
       p[u] = i.h[u >> 2] >> 8 * (u & 3);
     return p;
   }
-  function d(i, p, u, B, w) {
-    u = u || 64, i = t.normalizeInput(i), B && (B = t.normalizeInput(B)), w && (w = t.normalizeInput(w));
-    const A = _(u, p, B, w);
+  function d(i, p, u, B, m) {
+    u = u || 64, i = t.normalizeInput(i), B && (B = t.normalizeInput(B)), m && (m = t.normalizeInput(m));
+    const A = _(u, p, B, m);
     return k(A, i), a(A);
   }
-  function f(i, p, u, B, w) {
-    const A = d(i, p, u, B, w);
+  function f(i, p, u, B, m) {
+    const A = d(i, p, u, B, m);
     return t.toHex(A);
   }
   return L = {
@@ -1402,7 +1403,7 @@ function ke() {
     for (f = 0; f < 8; f++)
       a.h[f] ^= s[f] ^ s[f + 8];
   }
-  function m(a, d) {
+  function w(a, d) {
     if (!(a > 0 && a <= 32))
       throw new Error("Incorrect output length, should be in [1, 32]");
     const f = d ? d.length : 0;
@@ -1437,7 +1438,7 @@ function ke() {
   }
   function _(a, d, f) {
     f = f || 32, a = t.normalizeInput(a);
-    const i = m(f, d);
+    const i = w(f, d);
     return b(i, a), g(i);
   }
   function k(a, d, f) {
@@ -1447,17 +1448,17 @@ function ke() {
   return Z = {
     blake2s: _,
     blake2sHex: k,
-    blake2sInit: m,
+    blake2sInit: w,
     blake2sUpdate: b,
     blake2sFinal: g
   }, Z;
 }
-var V, pt;
+var X, pt;
 function Ie() {
-  if (pt) return V;
+  if (pt) return X;
   pt = 1;
-  const t = we(), e = ke();
-  return V = {
+  const t = me(), e = ke();
+  return X = {
     blake2b: t.blake2b,
     blake2bHex: t.blake2bHex,
     blake2bInit: t.blake2bInit,
@@ -1468,9 +1469,9 @@ function Ie() {
     blake2sInit: e.blake2sInit,
     blake2sUpdate: e.blake2sUpdate,
     blake2sFinal: e.blake2sFinal
-  }, V;
+  }, X;
 }
-var X = Ie();
+var V = Ie();
 /**
  * @module @zk-kit/eddsa-poseidon
  * @version 1.1.0
@@ -1529,7 +1530,7 @@ const Ae = I.Buffer.from([1]), ve = I.Buffer.from([129]), S = [
   2240740374,
   1667834072,
   1901547113
-], Y = I.Buffer.from([
+], N = I.Buffer.from([
   128,
   0,
   0,
@@ -1728,7 +1729,7 @@ class Ue {
     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(Y.subarray(0, 111 - this._blockOffset))) : (this._length[0] -= (128 - this._blockOffset) * 8, this.update(Y.subarray(0, 128 - this._blockOffset)), this._length[0] -= 111 * 8, this.update(Y.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(N.subarray(0, 111 - this._blockOffset))) : (this._length[0] -= (128 - this._blockOffset) * 8, this.update(N.subarray(0, 128 - this._blockOffset)), this._length[0] -= 111 * 8, this.update(N.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.
@@ -1772,7 +1773,7 @@ class Se {
   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 = X.blake2bInit(this.outlen, r);
+    this.outlen = e, this.context = V.blake2bInit(this.outlen, r);
   }
   /**
    * Updates the hash with new data. This method can be called multiple
@@ -1781,7 +1782,7 @@ class Se {
    * @returns The instance, to allow method chaining.
    */
   update(e) {
-    return X.blake2bUpdate(this.context, e), this;
+    return V.blake2bUpdate(this.context, e), this;
   }
   /**
    * Completes the hash computation and returns the final hash value.
@@ -1790,19 +1791,19 @@ class Se {
    * @returns The Blake2b hash of the input data.
    */
   digest() {
-    return Lt.from(X.blake2bFinal(this.context));
+    return Ct.from(V.blake2bFinal(this.context));
   }
 }
 function dt(t) {
   return t[0] &= 248, t[31] &= 127, t[31] |= 64, t;
 }
-function Q(t) {
+function W(t) {
   return Pt(t) && t.length === 2 && T(t[0]) && T(t[1]);
 }
 function _t(t) {
-  return nt(t) && Object.prototype.hasOwnProperty.call(t, "R8") && Object.prototype.hasOwnProperty.call(t, "S") && Q(t.R8) && T(t.S);
+  return nt(t) && Object.prototype.hasOwnProperty.call(t, "R8") && Object.prototype.hasOwnProperty.call(t, "S") && W(t.R8) && T(t.S);
 }
-function mt(t) {
+function wt(t) {
   return M(t, "privateKey", ["Buffer", "Uint8Array", "string"]), I.Buffer.from(t);
 }
 function Bt(t) {
@@ -1830,7 +1831,7 @@ var P;
 })(P || (P = {}));
 const Ee = (t) => {
   const e = (b) => {
-    b = mt(b);
+    b = wt(b);
     let g = G(b, t);
     return g = g.slice(0, 32), g = dt(g), lt(z(g), BigInt(3)) % K;
   };
@@ -1839,12 +1840,12 @@ const Ee = (t) => {
     return $(q, g);
   }
   function n(b, g) {
-    b = mt(b), g = Bt(g);
-    const _ = G(b, t), k = dt(_.slice(0, 32)), a = z(k), d = $(q, lt(a, BigInt(3))), f = D(g, 32), i = G(I.Buffer.concat([_.slice(32, 64), f]), t), p = new Be(K), u = p.e(z(i)), B = $(q, u), w = at.poseidon5([B[0], B[1], d[0], d[1], g]), A = p.add(u, p.mul(w, a));
+    b = wt(b), g = Bt(g);
+    const _ = G(b, t), k = dt(_.slice(0, 32)), a = z(k), d = $(q, lt(a, BigInt(3))), f = D(g, 32), i = G(I.Buffer.concat([_.slice(32, 64), f]), t), p = new Be(K), u = p.e(z(i)), B = $(q, u), m = at.poseidon5([B[0], B[1], d[0], d[1], g]), A = p.add(u, p.mul(m, a));
     return { R8: B, S: A };
   }
   function o(b, g, _) {
-    if (!Q(_) || !_t(g) || !O(g.R8) || !O(_) || BigInt(g.S) >= K)
+    if (!W(_) || !_t(g) || !O(g.R8) || !O(_) || BigInt(g.S) >= K)
       return !1;
     b = Bt(b);
     const k = {
@@ -1852,10 +1853,10 @@ const Ee = (t) => {
       S: BigInt(g.S)
     }, a = [BigInt(_[0]), BigInt(_[1])], d = at.poseidon5([g.R8[0], g.R8[1], _[0], _[1], b]), f = $(q, BigInt(g.S));
     let i = $(a, _e(d, BigInt(8)));
-    return i = J(k.R8, i), y.eq(f[0], i[0]) && y.eq(f[1], i[1]);
+    return i = Q(k.R8, i), y.eq(f[0], i[0]) && y.eq(f[1], i[1]);
   }
   function h(b) {
-    if (!Q(b) || !O(b))
+    if (!W(b) || !O(b))
       throw new Error("Invalid public key");
     const g = [BigInt(b[0]), BigInt(b[1])];
     return ft(g);
@@ -1887,7 +1888,7 @@ const Ee = (t) => {
       S: z(_)
     };
   }
-  class m {
+  class w {
     /**
      * 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.
@@ -1930,17 +1931,17 @@ const Ee = (t) => {
     unpackPublicKey: s,
     packSignature: l,
     unpackSignature: c,
-    EdDSAPoseidon: m
+    EdDSAPoseidon: w
   };
-}, { EdDSAPoseidon: $e, derivePublicKey: ze, deriveSecretScalar: Pe, packPublicKey: qe, packSignature: Ke, signMessage: Oe, unpackPublicKey: Re, unpackSignature: je, verifySignature: Te } = Ee(P.BLAKE1);
+}, { EdDSAPoseidon: ze, derivePublicKey: Pe, deriveSecretScalar: qe, packPublicKey: Ke, packSignature: Oe, signMessage: Re, unpackPublicKey: je, unpackSignature: Te, verifySignature: Fe } = Ee(P.BLAKE1);
 export {
-  $e as EdDSAPoseidon,
-  ze as derivePublicKey,
-  Pe as deriveSecretScalar,
-  qe as packPublicKey,
-  Ke as packSignature,
-  Oe as signMessage,
-  Re as unpackPublicKey,
-  je as unpackSignature,
-  Te as verifySignature
+  ze as EdDSAPoseidon,
+  Pe as derivePublicKey,
+  qe as deriveSecretScalar,
+  Ke as packPublicKey,
+  Oe as packSignature,
+  Re as signMessage,
+  je as unpackPublicKey,
+  Te as unpackSignature,
+  Fe as verifySignature
 };