@hinkal/common 0.0.17 → 0.0.20

package/{snarkjsWorkerLogic-D0EKr8Rb.js → snarkjsWorkerLogic-CJ6jLJrl.js}

@@ -1,41 +1,41 @@
-import { W as _o } from "./workerProxy-BDj498Ht.js";
-import { f as on, r as vn, c as Ye, e as Ua, u as zn } from "./index-DVX9ShLf.js";
-const go = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
-function cn(c, t) {
+import { e as Ua, p as Se, r as po, g as ho, B as Lo, a as mo, b as bo, c as en, d as ja, f as $a, u as zn } from "./index-CRZ_sTGy.js";
+import { W as yo } from "./workerProxy-DTKGeJe4.js";
+const Co = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+function sn(c, t) {
   if (!t || t == 10)
     return BigInt(c);
   if (t == 16)
     return c.slice(0, 2) == "0x" ? BigInt(c) : BigInt("0x" + c);
 }
-const Be = cn;
-function po(c, t) {
+const ve = sn;
+function Ao(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
   for (let n = 0; n < c.length; n++)
     e = e * t + BigInt(c[n]);
   return e;
 }
-function ja(c) {
+function Ga(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + go[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + Co[parseInt(t[0], 16)];
 }
-function ho(c) {
+function Fo(c) {
   return BigInt(c) < BigInt(0);
 }
-function Lo(c) {
+function Eo(c) {
   return !c;
 }
-function $a(c, t) {
+function Za(c, t) {
   return BigInt(c) << BigInt(t);
 }
 function Un(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const mo = $a, bo = Un;
-function yo(c) {
+const wo = Za, Bo = Un;
+function vo(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function Co(c) {
+function xo(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -48,195 +48,195 @@ function Co(c) {
   }
   return e;
 }
-function Ao(c) {
+function So(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; )
     t & BigInt(1) ? e.push(1) : e.push(0), t = t >> BigInt(1);
   return e;
 }
-function Ga(c) {
+function Wa(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function Fo(c, t) {
+function Io(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
     e.unshift(Number(n % t)), n = n / t;
   return e;
 }
-function Eo(c, t) {
+function Oo(c, t) {
   return BigInt(c) + BigInt(t);
 }
-function wo(c, t) {
+function Po(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function Bo(c) {
+function ko(c) {
   return -BigInt(c);
 }
-function vo(c, t) {
+function To(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function xo(c) {
+function qo(c) {
   return BigInt(c) * BigInt(c);
 }
-function So(c, t) {
+function Do(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function Io(c, t) {
+function Mo(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function Oo(c) {
+function Ro(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
-function Po(c, t) {
+function No(c, t) {
   return BigInt(c) / BigInt(t);
 }
-function ko(c, t) {
+function zo(c, t) {
   return BigInt(c) % BigInt(t);
 }
-function To(c, t) {
+function Uo(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function qo(c, t) {
+function jo(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function Do(c, t) {
+function $o(c, t) {
   return BigInt(c) < BigInt(t);
 }
-function Mo(c, t) {
+function Go(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Ro(c, t) {
+function Zo(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function No(c, t) {
+function Wo(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function Za(c, t) {
+function Xa(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function zo(c, t) {
+function Xo(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function Uo(c, t) {
+function Vo(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function jo(c, t) {
+function Ho(c, t) {
   return BigInt(c) && BigInt(t);
 }
-function $o(c, t) {
+function Qo(c, t) {
   return BigInt(c) || BigInt(t);
 }
-function Go(c) {
+function Jo(c) {
   return !BigInt(c);
 }
-function Wa(c, t, e, n) {
+function Va(c, t, e, n) {
   const a = "0000000" + e.toString(16), s = new Uint32Array(c.buffer, c.byteOffset + t, n / 4), g = ((a.length - 7) * 4 - 1 >> 5) + 1;
   for (let d = 0; d < g; d++)
     s[d] = parseInt(a.substring(a.length - 8 * d - 8, a.length - 8 * d), 16);
   for (let d = g; d < s.length; d++)
     s[d] = 0;
   for (let d = s.length * 4; d < n; d++)
-    c[d] = Ga(Za(Un(e, d * 8), 255));
+    c[d] = Wa(Xa(Un(e, d * 8), 255));
 }
-function Zo(c, t, e, n) {
+function Ko(c, t, e, n) {
   const a = "0000000" + e.toString(16), s = new DataView(c.buffer, c.byteOffset + t, n), g = ((a.length - 7) * 4 - 1 >> 5) + 1;
   for (let d = 0; d < g; d++)
     s.setUint32(n - d * 4 - 4, parseInt(a.substring(a.length - 8 * d - 8, a.length - 8 * d), 16), !1);
   for (let d = 0; d < n / 4 - g; d++)
     s[d] = 0;
 }
-function Wo(c, t, e) {
+function Yo(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new Uint32Array(c.buffer, c.byteOffset + t, e / 4), a = new Array(e / 4);
-  return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), cn(a.join(""), 16);
+  return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), sn(a.join(""), 16);
 }
-function Xo(c, t, e) {
+function tc(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new DataView(c.buffer, c.byteOffset + t, e), a = new Array(e / 4);
   for (let s = 0; s < e / 4; s++)
     a[s] = n.getUint32(s * 4, !1).toString(16).padStart(8, "0");
-  return cn(a.join(""), 16);
+  return sn(a.join(""), 16);
 }
-function Vo(c, t) {
+function ec(c, t) {
   return c.toString(t);
 }
-function Ho(c) {
-  const t = new Uint8Array(Math.floor((ja(c) - 1) / 8) + 1);
-  return Wa(t, 0, c, t.byteLength), t;
+function nc(c) {
+  const t = new Uint8Array(Math.floor((Ga(c) - 1) / 8) + 1);
+  return Va(t, 0, c, t.byteLength), t;
 }
-const Qo = Be(0), Jo = Be(1);
-var Ko = /* @__PURE__ */ Object.freeze({
+const ac = ve(0), ic = ve(1);
+var oc = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  abs: Oo,
-  add: Eo,
-  band: Za,
-  bitLength: ja,
-  bits: Ao,
-  bor: zo,
-  bxor: Uo,
-  div: Po,
-  e: Be,
-  eq: To,
-  exp: Io,
-  fromArray: po,
-  fromRprBE: Xo,
-  fromRprLE: Wo,
-  fromString: cn,
-  geq: No,
-  gt: Mo,
-  isNegative: ho,
-  isOdd: yo,
-  isZero: Lo,
-  land: jo,
-  leq: Ro,
-  lnot: Go,
-  lor: $o,
-  lt: Do,
-  mod: ko,
-  mul: vo,
-  naf: Co,
-  neg: Bo,
-  neq: qo,
-  one: Jo,
-  pow: So,
-  shiftLeft: $a,
+  abs: Ro,
+  add: Oo,
+  band: Xa,
+  bitLength: Ga,
+  bits: So,
+  bor: Xo,
+  bxor: Vo,
+  div: No,
+  e: ve,
+  eq: Uo,
+  exp: Mo,
+  fromArray: Ao,
+  fromRprBE: tc,
+  fromRprLE: Yo,
+  fromString: sn,
+  geq: Wo,
+  gt: Go,
+  isNegative: Fo,
+  isOdd: vo,
+  isZero: Eo,
+  land: Ho,
+  leq: Zo,
+  lnot: Jo,
+  lor: Qo,
+  lt: $o,
+  mod: zo,
+  mul: To,
+  naf: xo,
+  neg: ko,
+  neq: jo,
+  one: ic,
+  pow: Do,
+  shiftLeft: Za,
   shiftRight: Un,
-  shl: mo,
-  shr: bo,
-  square: xo,
-  sub: wo,
-  toArray: Fo,
-  toLEBuff: Ho,
-  toNumber: Ga,
-  toRprBE: Zo,
-  toRprLE: Wa,
-  toString: Vo,
-  zero: Qo
+  shl: wo,
+  shr: Bo,
+  square: qo,
+  sub: Po,
+  toArray: Io,
+  toLEBuff: nc,
+  toNumber: Wa,
+  toRprBE: Ko,
+  toRprLE: Va,
+  toString: ec,
+  zero: ac
 });
-const oe = 1 << 30;
-let Yo = class xn {
+const ce = 1 << 30;
+let cc = class xn {
   constructor(t) {
     this.buffers = [], this.byteLength = t;
-    for (let e = 0; e < t; e += oe) {
-      const n = Math.min(t - e, oe);
+    for (let e = 0; e < t; e += ce) {
+      const n = Math.min(t - e, ce);
       this.buffers.push(new Uint8Array(n));
     }
   }
   slice(t, e) {
     e === void 0 && (e = this.byteLength), t === void 0 && (t = 0);
-    const n = e - t, a = Math.floor(t / oe), s = Math.floor((t + n - 1) / oe);
+    const n = e - t, a = Math.floor(t / ce), s = Math.floor((t + n - 1) / ce);
     if (a == s || n == 0)
-      return this.buffers[a].slice(t % oe, t % oe + n);
-    let g, d = a, C = t % oe, l = n;
+      return this.buffers[a].slice(t % ce, t % ce + n);
+    let g, d = a, C = t % ce, l = n;
     for (; l > 0; ) {
-      const o = C + l > oe ? oe - C : l, y = new Uint8Array(this.buffers[d].buffer, this.buffers[d].byteOffset + C, o);
+      const o = C + l > ce ? ce - C : l, y = new Uint8Array(this.buffers[d].buffer, this.buffers[d].byteOffset + C, o);
       if (o == n)
         return y.slice();
-      g || (n <= oe ? g = new Uint8Array(n) : g = new xn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
+      g || (n <= ce ? g = new Uint8Array(n) : g = new xn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
     }
     return g;
   }
@@ -245,20 +245,20 @@ let Yo = class xn {
     const n = t.byteLength;
     if (n == 0)
       return;
-    const a = Math.floor(e / oe), s = Math.floor((e + n - 1) / oe);
+    const a = Math.floor(e / ce), s = Math.floor((e + n - 1) / ce);
     if (a == s)
-      return t instanceof xn && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % oe) : this.buffers[a].set(t, e % oe);
-    let g = a, d = e % oe, C = n;
+      return t instanceof xn && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % ce) : this.buffers[a].set(t, e % ce);
+    let g = a, d = e % ce, C = n;
     for (; C > 0; ) {
-      const l = d + C > oe ? oe - d : C, o = t.slice(n - C, n - C + l);
+      const l = d + C > ce ? ce - d : C, o = t.slice(n - C, n - C + l);
       new Uint8Array(this.buffers[g].buffer, this.buffers[g].byteOffset + d, l).set(o), C = C - l, g++, d = 0;
     }
   }
 };
-function tc(c) {
+function sc(c) {
   return globalThis.btoa(c);
 }
-tc(`(function thread(self) {
+sc(`(function thread(self) {
     const MAXMEM = 32767;
     let instance;
     let memory;
@@ -380,18 +380,18 @@ tc(`(function thread(self) {
 })(self)`);
 globalThis.curve_bn128 = null;
 globalThis.curve_bls12381 = null;
-Be("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
-Be("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-Be("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
-Be("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Xa = Ko;
-async function Va(c, t, e, n) {
+ve("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
+ve("21888242871839275222246405745257275088548364400416034343698204186575808495617");
+ve("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
+ve("21888242871839275222246405745257275088696311157297823662689037894645226208583");
+const Ha = oc;
+async function Qa(c, t, e, n) {
   if (e = e || 4096 * 64, typeof t != "number" && ["w+", "wx+", "r", "ax+", "a+"].indexOf(t) < 0)
     throw new Error("Invalid open option");
-  const a = await on.promises.open(c, t), s = await a.stat();
-  return new ec(a, s, e, n, c);
+  const a = await Ua.promises.open(c, t), s = await a.stat();
+  return new rc(a, s, e, n, c);
 }
-class ec {
+class rc {
   constructor(t, e, n, a, s) {
     for (this.fileName = s, this.fd = t, this.pos = 0, this.pageSize = a || 256; this.pageSize < e.blksize; )
       this.pageSize *= 2;
@@ -564,7 +564,7 @@ class ec {
     });
   }
   async discard() {
-    await this.close(), await on.promises.unlink(this.fileName);
+    await this.close(), await Ua.promises.unlink(this.fileName);
   }
   async writeULE32(t, e) {
     const n = this, a = new Uint8Array(4);
@@ -610,16 +610,16 @@ class ec {
     return g;
   }
 }
-function nc(c) {
-  const t = c.initialSize || 1048576, e = new Qa();
+function lc(c) {
+  const t = c.initialSize || 1048576, e = new Ka();
   return e.o = c, e.o.data = new Uint8Array(t), e.allocSize = t, e.totalSize = 0, e.readOnly = !1, e.pos = 0, e;
 }
-function ac(c) {
-  const t = new Qa();
+function uc(c) {
+  const t = new Ka();
   return t.o = c, t.allocSize = c.data.byteLength, t.totalSize = c.data.byteLength, t.readOnly = !0, t.pos = 0, t;
 }
-const Sn = new Uint8Array(4), oa = new DataView(Sn.buffer), Ha = new Uint8Array(8), ca = new DataView(Ha.buffer);
-class Qa {
+const Sn = new Uint8Array(4), oa = new DataView(Sn.buffer), Ja = new Uint8Array(8), ca = new DataView(Ja.buffer);
+class Ka {
   constructor() {
     this.pageSize = 16384;
   }
@@ -664,7 +664,7 @@ class Qa {
   }
   async writeULE64(t, e) {
     const n = this;
-    ca.setUint32(0, t & 4294967295, !0), ca.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ha, e);
+    ca.setUint32(0, t & 4294967295, !0), ca.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ja, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -696,8 +696,8 @@ class Qa {
   }
 }
 const ne = 1 << 22;
-function ic(c) {
-  const t = c.initialSize || 0, e = new Ka();
+function dc(c) {
+  const t = c.initialSize || 0, e = new ti();
   e.o = c;
   const n = t ? Math.floor((t - 1) / ne) + 1 : 0;
   e.o.data = [];
@@ -705,12 +705,12 @@ function ic(c) {
     e.o.data.push(new Uint8Array(ne));
   return n && e.o.data.push(new Uint8Array(t - ne * (n - 1))), e.totalSize = 0, e.readOnly = !1, e.pos = 0, e;
 }
-function oc(c) {
-  const t = new Ka();
+function fc(c) {
+  const t = new ti();
   return t.o = c, t.totalSize = (c.data.length - 1) * ne + c.data[c.data.length - 1].byteLength, t.readOnly = !0, t.pos = 0, t;
 }
-const In = new Uint8Array(4), sa = new DataView(In.buffer), Ja = new Uint8Array(8), ra = new DataView(Ja.buffer);
-class Ka {
+const In = new Uint8Array(4), sa = new DataView(In.buffer), Ya = new Uint8Array(8), ra = new DataView(Ya.buffer);
+class ti {
   constructor() {
     this.pageSize = 16384;
   }
@@ -768,7 +768,7 @@ class Ka {
   }
   async writeULE64(t, e) {
     const n = this;
-    ra.setUint32(0, t & 4294967295, !0), ra.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ja, e);
+    ra.setUint32(0, t & 4294967295, !0), ra.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ya, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -803,26 +803,26 @@ class Ka {
     return g;
   }
 }
-const cc = 1024, sc = 512, rc = 2, lc = 0, Ya = 65536, ti = 8192;
-async function ei(c, t, e) {
+const _c = 0, gc = 2, pc = 512, hc = 1024, ei = 65536, ni = 8192;
+async function ai(c, t, e) {
   if (typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || Ya,
-    pageSize: e || ti
+    cacheSize: t || ei,
+    pageSize: e || ni
   }), c.type == "file")
-    return await Va(c.fileName, cc | sc | rc, c.cacheSize, c.pageSize);
+    return await Qa(c.fileName, hc | pc | gc, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return nc(c);
+    return lc(c);
   if (c.type == "bigMem")
-    return ic(c);
+    return dc(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function ni(c, t, e) {
+async function ii(c, t, e) {
   if (c instanceof Uint8Array && (c = {
     type: "mem",
     data: c
-  }), process.browser ? typeof c == "string" && (c = {
+  }), Se.browser ? typeof c == "string" && (c = {
     type: "mem",
     data: await fetch(c).then(function(a) {
       return a.arrayBuffer();
@@ -832,18 +832,18 @@ async function ni(c, t, e) {
   }) : typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || Ya,
-    pageSize: e || ti
+    cacheSize: t || ei,
+    pageSize: e || ni
   }), c.type == "file")
-    return await Va(c.fileName, lc, c.cacheSize, c.pageSize);
+    return await Qa(c.fileName, _c, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return await ac(c);
+    return await uc(c);
   if (c.type == "bigMem")
-    return await oc(c);
+    return await fc(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
 async function la(c, t, e, n, a) {
-  const s = await ni(c, n, a), g = await s.read(4);
+  const s = await ii(c, n, a), g = await s.read(4);
   let d = "";
   for (let y = 0; y < 4; y++)
     d += String.fromCharCode(g[y]);
@@ -862,8 +862,8 @@ async function la(c, t, e, n, a) {
   }
   return { fd: s, sections: o };
 }
-async function uc(c, t, e, n, a, s) {
-  const g = await ei(c, a, s), d = new Uint8Array(4);
+async function Lc(c, t, e, n, a, s) {
+  const g = await ai(c, a, s), d = new Uint8Array(4);
   for (let C = 0; C < 4; C++)
     d[C] = t.charCodeAt(C);
   return await g.write(d, 0), await g.writeULE32(e), await g.writeULE32(n), g;
@@ -881,7 +881,7 @@ async function da(c) {
   const t = c.pos - c.writingSection.pSectionSize - 8, e = c.pos;
   c.pos = c.writingSection.pSectionSize, await c.writeULE64(t), c.pos = e, delete c.writingSection;
 }
-async function Ge(c, t, e) {
+async function We(c, t, e) {
   if (typeof c.readingSection < "u")
     throw new Error("Already reading a section");
   if (!t[e])
@@ -890,63 +890,63 @@ async function Ge(c, t, e) {
     throw new Error(c.fileName + ": Section Duplicated " + e);
   c.pos = t[e][0].p, c.readingSection = t[e][0];
 }
-async function Ze(c, t) {
+async function Xe(c, t) {
   if (typeof c.readingSection > "u")
     throw new Error("Not reading a section");
   if (!t && c.pos - c.readingSection.p != c.readingSection.size)
     throw new Error("Invalid section size reading");
   delete c.readingSection;
 }
-async function dc(c, t, e, n) {
+async function mc(c, t, e, n) {
   const a = new Uint8Array(e);
-  Xa.toRprLE(a, 0, t, e), await c.write(a, n);
+  Ha.toRprLE(a, 0, t, e), await c.write(a, n);
 }
-async function we(c, t, e) {
+async function Be(c, t, e) {
   const n = await c.read(t, e);
-  return Xa.fromRprLE(n, 0, t);
+  return Ha.fromRprLE(n, 0, t);
 }
-async function Ae(c, t, e, n, a) {
+async function Fe(c, t, e, n, a) {
   if (n = typeof n > "u" ? 0 : n, a = typeof a > "u" ? t[e][0].size - n : a, n + a > t[e][0].size)
     throw new Error("Reading out of the range of the section");
   let s;
-  return a < 1 << 30 ? s = new Uint8Array(a) : s = new Yo(a), await c.readToBuffer(s, 0, a, t[e][0].p + n), s;
+  return a < 1 << 30 ? s = new Uint8Array(a) : s = new cc(a), await c.readToBuffer(s, 0, a, t[e][0].p + n), s;
 }
-const fc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
-function sn(c, t) {
+const bc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+function rn(c, t) {
   if (!t || t == 10)
     return BigInt(c);
   if (t == 16)
     return c.slice(0, 2) == "0x" ? BigInt(c) : BigInt("0x" + c);
 }
-const ee = sn;
-function _c(c, t) {
+const ee = rn;
+function yc(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
   for (let n = 0; n < c.length; n++)
     e = e * t + BigInt(c[n]);
   return e;
 }
-function We(c) {
+function Ve(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + fc[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + bc[parseInt(t[0], 16)];
 }
-function ai(c) {
+function oi(c) {
   return BigInt(c) < BigInt(0);
 }
-function ii(c) {
+function ci(c) {
   return !c;
 }
-function tn(c, t) {
+function nn(c, t) {
   return BigInt(c) << BigInt(t);
 }
-function xe(c, t) {
+function Ie(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const gc = tn, pc = xe;
+const Cc = nn, Ac = Ie;
 function jn(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function hc(c) {
+function Fc(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -959,19 +959,19 @@ function hc(c) {
   }
   return e;
 }
-function oi(c) {
+function si(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; )
     t & BigInt(1) ? e.push(1) : e.push(0), t = t >> BigInt(1);
   return e;
 }
-function ci(c) {
+function ri(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function Lc(c, t) {
+function Ec(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
@@ -981,156 +981,156 @@ function Lc(c, t) {
 function $n(c, t) {
   return BigInt(c) + BigInt(t);
 }
-function he(c, t) {
+function Le(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function si(c) {
+function li(c) {
   return -BigInt(c);
 }
-function ri(c, t) {
+function ui(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function mc(c) {
+function wc(c) {
   return BigInt(c) * BigInt(c);
 }
-function Xe(c, t) {
+function He(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function bc(c, t) {
+function Bc(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function yc(c) {
+function vc(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
-function Se(c, t) {
+function Oe(c, t) {
   return BigInt(c) / BigInt(t);
 }
-function _e(c, t) {
+function ge(c, t) {
   return BigInt(c) % BigInt(t);
 }
-function Fe(c, t) {
+function Ee(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function Cc(c, t) {
+function xc(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function Ac(c, t) {
+function Sc(c, t) {
   return BigInt(c) < BigInt(t);
 }
 function On(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Fc(c, t) {
+function Ic(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function li(c, t) {
+function di(c, t) {
   return BigInt(c) >= BigInt(t);
 }
 function Gn(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function Ec(c, t) {
+function Oc(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function wc(c, t) {
+function Pc(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function Bc(c, t) {
+function kc(c, t) {
   return BigInt(c) && BigInt(t);
 }
-function vc(c, t) {
+function Tc(c, t) {
   return BigInt(c) || BigInt(t);
 }
-function xc(c) {
+function qc(c) {
   return !BigInt(c);
 }
-function je(c, t, e, n) {
+function Ge(c, t, e, n) {
   const a = "0000000" + e.toString(16), s = new Uint32Array(c.buffer, t, n / 4), g = ((a.length - 7) * 4 - 1 >> 5) + 1;
   for (let d = 0; d < g; d++)
     s[d] = parseInt(a.substring(a.length - 8 * d - 8, a.length - 8 * d), 16);
   for (let d = g; d < s.length; d++)
     s[d] = 0;
   for (let d = s.length * 4; d < n; d++)
-    c[d] = ci(Gn(xe(e, d * 8), 255));
+    c[d] = ri(Gn(Ie(e, d * 8), 255));
 }
-function ui(c, t, e, n) {
+function fi(c, t, e, n) {
   const a = "0000000" + e.toString(16), s = new DataView(c.buffer, c.byteOffset + t, n), g = ((a.length - 7) * 4 - 1 >> 5) + 1;
   for (let d = 0; d < g; d++)
     s.setUint32(n - d * 4 - 4, parseInt(a.substring(a.length - 8 * d - 8, a.length - 8 * d), 16), !1);
   for (let d = 0; d < n / 4 - g; d++)
     s[d] = 0;
 }
-function $e(c, t, e) {
+function Ze(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new Uint32Array(c.buffer, t, e / 4), a = new Array(e / 4);
-  return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), sn(a.join(""), 16);
+  return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), rn(a.join(""), 16);
 }
-function di(c, t, e) {
+function _i(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new DataView(c.buffer, c.byteOffset + t, e), a = new Array(e / 4);
   for (let s = 0; s < e / 4; s++)
     a[s] = n.getUint32(s * 4, !1).toString(16).padStart(8, "0");
-  return sn(a.join(""), 16);
+  return rn(a.join(""), 16);
 }
-function fi(c, t) {
+function gi(c, t) {
   return c.toString(t);
 }
-function Ie(c) {
-  const t = new Uint8Array(Math.floor((We(c) - 1) / 8) + 1);
-  return je(t, 0, c, t.byteLength), t;
+function Pe(c) {
+  const t = new Uint8Array(Math.floor((Ve(c) - 1) / 8) + 1);
+  return Ge(t, 0, c, t.byteLength), t;
 }
-const _i = ee(0), Ee = ee(1), Sc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const pi = ee(0), we = ee(1), Dc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  abs: yc,
+  abs: vc,
   add: $n,
   band: Gn,
-  bitLength: We,
-  bits: oi,
-  bor: Ec,
-  bxor: wc,
-  div: Se,
+  bitLength: Ve,
+  bits: si,
+  bor: Oc,
+  bxor: Pc,
+  div: Oe,
   e: ee,
-  eq: Fe,
-  exp: bc,
-  fromArray: _c,
-  fromRprBE: di,
-  fromRprLE: $e,
-  fromString: sn,
-  geq: li,
+  eq: Ee,
+  exp: Bc,
+  fromArray: yc,
+  fromRprBE: _i,
+  fromRprLE: Ze,
+  fromString: rn,
+  geq: di,
   gt: On,
-  isNegative: ai,
+  isNegative: oi,
   isOdd: jn,
-  isZero: ii,
-  land: Bc,
-  leq: Fc,
-  lnot: xc,
-  lor: vc,
-  lt: Ac,
-  mod: _e,
-  mul: ri,
-  naf: hc,
-  neg: si,
-  neq: Cc,
-  one: Ee,
-  pow: Xe,
-  shiftLeft: tn,
-  shiftRight: xe,
-  shl: gc,
-  shr: pc,
-  square: mc,
-  sub: he,
-  toArray: Lc,
-  toLEBuff: Ie,
-  toNumber: ci,
-  toRprBE: ui,
-  toRprLE: je,
-  toString: fi,
-  zero: _i
+  isZero: ci,
+  land: kc,
+  leq: Ic,
+  lnot: qc,
+  lor: Tc,
+  lt: Sc,
+  mod: ge,
+  mul: ui,
+  naf: Fc,
+  neg: li,
+  neq: xc,
+  one: we,
+  pow: He,
+  shiftLeft: nn,
+  shiftRight: Ie,
+  shl: Cc,
+  shr: Ac,
+  square: wc,
+  sub: Le,
+  toArray: Ec,
+  toLEBuff: Pe,
+  toNumber: ri,
+  toRprBE: fi,
+  toRprLE: Ge,
+  toString: gi,
+  zero: pi
 }, Symbol.toStringTag, { value: "Module" }));
 function fa(c, t, e) {
-  if (ii(e))
+  if (ci(e))
     return c.one;
-  const n = oi(e);
+  const n = si(e);
   if (n.length == 0)
     return c.one;
   let a = t;
@@ -1138,36 +1138,36 @@ function fa(c, t, e) {
     a = c.square(a), n[s] && (a = c.mul(a, t));
   return a;
 }
-function Ic(c) {
+function Mc(c) {
   if (c.m % 2 == 1)
-    if (Fe(_e(c.p, 4), 1))
-      if (Fe(_e(c.p, 8), 1))
-        if (Fe(_e(c.p, 16), 1))
-          Oc(c);
-        else if (Fe(_e(c.p, 16), 9))
-          Pc(c);
+    if (Ee(ge(c.p, 4), 1))
+      if (Ee(ge(c.p, 8), 1))
+        if (Ee(ge(c.p, 16), 1))
+          Rc(c);
+        else if (Ee(ge(c.p, 16), 9))
+          Nc(c);
         else
           throw new Error("Field withot sqrt");
-      else if (Fe(_e(c.p, 8), 5))
-        kc(c);
+      else if (Ee(ge(c.p, 8), 5))
+        zc(c);
       else
         throw new Error("Field withot sqrt");
     else
-      Fe(_e(c.p, 4), 3) && Tc(c);
+      Ee(ge(c.p, 4), 3) && Uc(c);
   else {
-    const t = _e(Xe(c.p, c.m / 2), 4);
-    t == 1 ? qc(c) : t == 3 ? Dc(c) : Mc(c);
+    const t = ge(He(c.p, c.m / 2), 4);
+    t == 1 ? jc(c) : t == 3 ? $c(c) : Gc(c);
   }
 }
-function Oc(c) {
-  for (c.sqrt_q = Xe(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = he(c.sqrt_q, 1); !jn(c.sqrt_t); )
-    c.sqrt_s = c.sqrt_s + 1, c.sqrt_t = Se(c.sqrt_t, 2);
+function Rc(c) {
+  for (c.sqrt_q = He(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = Le(c.sqrt_q, 1); !jn(c.sqrt_t); )
+    c.sqrt_s = c.sqrt_s + 1, c.sqrt_t = Oe(c.sqrt_t, 2);
   let t = c.one;
   for (; c.eq(t, c.one); ) {
     const e = c.random();
     c.sqrt_z = c.pow(e, c.sqrt_t), t = c.pow(c.sqrt_z, 2 ** (c.sqrt_s - 1));
   }
-  c.sqrt_tm1d2 = Se(he(c.sqrt_t, 1), 2), c.sqrt = function(e) {
+  c.sqrt_tm1d2 = Oe(Le(c.sqrt_t, 1), 2), c.sqrt = function(e) {
     const n = this;
     if (n.isZero(e))
       return n.zero;
@@ -1188,18 +1188,18 @@ function Oc(c) {
     return n.geq(d, n.zero) ? d : n.neg(d);
   };
 }
-function Pc(c) {
+function Nc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 4 not implemented");
   };
 }
-function kc(c) {
+function zc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 3 not implemented");
   };
 }
-function Tc(c) {
-  c.sqrt_q = Xe(c.p, c.m), c.sqrt_e1 = Se(he(c.sqrt_q, 3), 4), c.sqrt = function(t) {
+function Uc(c) {
+  c.sqrt_q = He(c.p, c.m), c.sqrt_e1 = Oe(Le(c.sqrt_q, 3), 4), c.sqrt = function(t) {
     if (this.isZero(t))
       return this.zero;
     const e = this.pow(t, this.sqrt_e1), n = this.mul(this.square(e), t);
@@ -1209,13 +1209,13 @@ function Tc(c) {
     return c.geq(a, c.zero) ? a : c.neg(a);
   };
 }
-function qc(c) {
+function jc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 10 not implemented");
   };
 }
-function Dc(c) {
-  c.sqrt_q = Xe(c.p, c.m / 2), c.sqrt_e34 = Se(he(c.sqrt_q, 3), 4), c.sqrt_e12 = Se(he(c.sqrt_q, 1), 2), c.frobenius = function(t, e) {
+function $c(c) {
+  c.sqrt_q = He(c.p, c.m / 2), c.sqrt_e34 = Oe(Le(c.sqrt_q, 3), 4), c.sqrt_e12 = Oe(Le(c.sqrt_q, 1), 2), c.frobenius = function(t, e) {
     return t % 2 == 1 ? c.conjugate(e) : e;
   }, c.sqrt = function(t) {
     const e = this, n = e.pow(t, e.sqrt_e34), a = e.mul(e.square(n), t), s = e.mul(e.frobenius(1, a), a);
@@ -1232,18 +1232,18 @@ function Dc(c) {
     return e.geq(d, e.zero) ? d : e.neg(d);
   };
 }
-function Mc(c) {
+function Gc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 8 not implemented");
   };
 }
-function Le(c, t, e, n, a) {
+function me(c, t, e, n, a) {
   c[t] = c[t] + c[e] >>> 0, c[a] = (c[a] ^ c[t]) >>> 0, c[a] = (c[a] << 16 | c[a] >>> 16 & 65535) >>> 0, c[n] = c[n] + c[a] >>> 0, c[e] = (c[e] ^ c[n]) >>> 0, c[e] = (c[e] << 12 | c[e] >>> 20 & 4095) >>> 0, c[t] = c[t] + c[e] >>> 0, c[a] = (c[a] ^ c[t]) >>> 0, c[a] = (c[a] << 8 | c[a] >>> 24 & 255) >>> 0, c[n] = c[n] + c[a] >>> 0, c[e] = (c[e] ^ c[n]) >>> 0, c[e] = (c[e] << 7 | c[e] >>> 25 & 127) >>> 0;
 }
-function Rc(c) {
-  Le(c, 0, 4, 8, 12), Le(c, 1, 5, 9, 13), Le(c, 2, 6, 10, 14), Le(c, 3, 7, 11, 15), Le(c, 0, 5, 10, 15), Le(c, 1, 6, 11, 12), Le(c, 2, 7, 8, 13), Le(c, 3, 4, 9, 14);
+function Zc(c) {
+  me(c, 0, 4, 8, 12), me(c, 1, 5, 9, 13), me(c, 2, 6, 10, 14), me(c, 3, 7, 11, 15), me(c, 0, 5, 10, 15), me(c, 1, 6, 11, 12), me(c, 2, 7, 8, 13), me(c, 3, 4, 9, 14);
 }
-class Nc {
+class Wc {
   constructor(t) {
     t = t || [0, 0, 0, 0, 0, 0, 0, 0], this.state = [
       1634760805,
@@ -1268,7 +1268,7 @@ class Nc {
     return this.idx == 16 && this.update(), this.buff[this.idx++];
   }
   nextU64() {
-    return $n(ri(this.nextU32(), 4294967296), this.nextU32());
+    return $n(ui(this.nextU32(), 4294967296), this.nextU32());
   }
   nextBool() {
     return (this.nextU32() & 1) == 1;
@@ -1277,35 +1277,37 @@ class Nc {
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.state[t];
     for (let t = 0; t < 10; t++)
-      Rc(this.buff);
+      Zc(this.buff);
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.buff[t] + this.state[t] >>> 0;
     this.idx = 0, this.state[12] = this.state[12] + 1 >>> 0, this.state[12] == 0 && (this.state[13] = this.state[13] + 1 >>> 0, this.state[13] == 0 && (this.state[14] = this.state[14] + 1 >>> 0, this.state[14] == 0 && (this.state[15] = this.state[15] + 1 >>> 0)));
   }
 }
-function gi(c) {
+var Xc = po();
+const Vc = /* @__PURE__ */ ho(Xc);
+function hi(c) {
   let t = new Uint8Array(c);
-  if (process.browser)
+  if (Se.browser)
     if (typeof globalThis.crypto < "u")
       globalThis.crypto.getRandomValues(t);
     else
       for (let e = 0; e < c; e++)
         t[e] = Math.random() * 4294967296 >>> 0;
   else
-    on.randomFillSync(t);
+    Vc.randomFillSync(t);
   return t;
 }
-function zc() {
-  const c = gi(32), t = new Uint32Array(c.buffer), e = [];
+function Hc() {
+  const c = hi(32), t = new Uint32Array(c.buffer), e = [];
   for (let n = 0; n < 8; n++)
     e.push(t[n]);
   return e;
 }
-let Qe = null;
+let Ke = null;
 function Zn() {
-  return Qe || (Qe = new Nc(zc()), Qe);
+  return Ke || (Ke = new Wc(Hc()), Ke);
 }
-class Uc {
+class Qc {
   constructor(t, e, n) {
     this.F = e, this.G = t, this.opMulGF = n;
     let a = e.sqrt_t || e.t, s = e.sqrt_s || e.s, g = e.one;
@@ -1334,7 +1336,7 @@ class Uc {
     const n = 1 << e;
     if (t.length != n)
       throw new Error("Size must be multiple of 2");
-    return en(this, t, e, 0, 1);
+    return an(this, t, e, 0, 1);
   }
   ifft(t) {
     if (t.length <= 1)
@@ -1344,7 +1346,7 @@ class Uc {
     const n = 1 << e;
     if (t.length != n)
       throw new Error("Size must be multiple of 2");
-    const a = en(this, t, e, 0, 1), s = this.F.inv(this.F.mulScalar(this.F.one, n)), g = new Array(n);
+    const a = an(this, t, e, 0, 1), s = this.F.inv(this.F.mulScalar(this.F.one, n)), g = new Array(n);
     for (let d = 0; d < n; d++)
       g[d] = this.opMulGF(a[(n - d) % n], s);
     return g;
@@ -1353,7 +1355,7 @@ class Uc {
 function _a(c) {
   return (c & 4294901760 ? (c &= 4294901760, 16) : 0) | (c & 4278255360 ? (c &= 4278255360, 8) : 0) | (c & 4042322160 ? (c &= 4042322160, 4) : 0) | (c & 3435973836 ? (c &= 3435973836, 2) : 0) | (c & 2863311530) !== 0;
 }
-function en(c, t, e, n, a) {
+function an(c, t, e, n, a) {
   const s = 1 << e;
   if (s == 1)
     return [t[n]];
@@ -1362,14 +1364,14 @@ function en(c, t, e, n, a) {
       c.G.add(t[n], t[n + a]),
       c.G.sub(t[n], t[n + a])
     ];
-  const g = s >> 1, d = en(c, t, e - 1, n, a * 2), C = en(c, t, e - 1, n + a, a * 2), l = new Array(s);
+  const g = s >> 1, d = an(c, t, e - 1, n, a * 2), C = an(c, t, e - 1, n + a, a * 2), l = new Array(s);
   for (let o = 0; o < g; o++)
     l[o] = c.G.add(d[o], c.opMulGF(C[o], c.roots[e][o])), l[o + g] = c.G.sub(d[o], c.opMulGF(C[o], c.roots[e][o]));
   return l;
 }
-class jc {
+class Jc {
   constructor(t) {
-    this.type = "F1", this.one = BigInt(1), this.zero = BigInt(0), this.p = BigInt(t), this.m = 1, this.negone = this.p - this.one, this.two = BigInt(2), this.half = this.p >> this.one, this.bitLength = We(this.p), this.mask = (this.one << BigInt(this.bitLength)) - this.one, this.n64 = Math.floor((this.bitLength - 1) / 64) + 1, this.n32 = this.n64 * 2, this.n8 = this.n64 * 8, this.R = this.e(this.one << BigInt(this.n64 * 64)), this.Ri = this.inv(this.R);
+    this.type = "F1", this.one = BigInt(1), this.zero = BigInt(0), this.p = BigInt(t), this.m = 1, this.negone = this.p - this.one, this.two = BigInt(2), this.half = this.p >> this.one, this.bitLength = Ve(this.p), this.mask = (this.one << BigInt(this.bitLength)) - this.one, this.n64 = Math.floor((this.bitLength - 1) / 64) + 1, this.n32 = this.n64 * 2, this.n8 = this.n64 * 8, this.R = this.e(this.one << BigInt(this.n64 * 64)), this.Ri = this.inv(this.R);
     const e = this.negone >> this.one;
     this.nqr = this.two;
     let n = this.pow(this.nqr, e);
@@ -1377,7 +1379,7 @@ class jc {
       this.nqr = this.nqr + this.one, n = this.pow(this.nqr, e);
     for (this.s = 0, this.t = this.negone; (this.t & this.one) == this.zero; )
       this.s = this.s + 1, this.t = this.t >> this.one;
-    this.nqr_to_t = this.pow(this.nqr, this.t), Ic(this), this.FFT = new Uc(this, this, this.mul.bind(this)), this.fft = this.FFT.fft.bind(this.FFT), this.ifft = this.FFT.ifft.bind(this.FFT), this.w = this.FFT.w, this.wi = this.FFT.wi, this.shift = this.square(this.nqr), this.k = this.exp(this.nqr, 2 ** this.s);
+    this.nqr_to_t = this.pow(this.nqr, this.t), Mc(this), this.FFT = new Qc(this, this, this.mul.bind(this)), this.fft = this.FFT.fft.bind(this.FFT), this.ifft = this.FFT.ifft.bind(this.FFT), this.w = this.FFT.w, this.wi = this.FFT.wi, this.shift = this.square(this.nqr), this.k = this.exp(this.nqr, 2 ** this.s);
   }
   e(t, e) {
     let n;
@@ -1529,7 +1531,7 @@ class jc {
     const t = this.bitLength * 2 / 8;
     let e = this.zero;
     for (let n = 0; n < t; n++)
-      e = (e << BigInt(8)) + BigInt(gi(1)[0]);
+      e = (e << BigInt(8)) + BigInt(hi(1)[0]);
     return e % this.p;
   }
   toString(t, e) {
@@ -1558,11 +1560,11 @@ class jc {
   }
   // Returns a buffer with Little Endian Representation
   toRprLE(t, e, n) {
-    je(t, e, n, this.n64 * 8);
+    Ge(t, e, n, this.n64 * 8);
   }
   // Returns a buffer with Big Endian Representation
   toRprBE(t, e, n) {
-    ui(t, e, n, this.n64 * 8);
+    fi(t, e, n, this.n64 * 8);
   }
   // Returns a buffer with Big Endian Montgomery Representation
   toRprBEM(t, e, n) {
@@ -1573,11 +1575,11 @@ class jc {
   }
   // Pases a buffer with Little Endian Representation
   fromRprLE(t, e) {
-    return $e(t, e, this.n8);
+    return Ze(t, e, this.n8);
   }
   // Pases a buffer with Big Endian Representation
   fromRprBE(t, e) {
-    return di(t, e, this.n8);
+    return _i(t, e, this.n8);
   }
   fromRprLEM(t, e) {
     return this.mul(this.fromRprLE(t, e), this.Ri);
@@ -1589,25 +1591,25 @@ class jc {
     return t;
   }
 }
-var be = {};
-be.bigInt2BytesLE = function(t, e) {
+var ye = {};
+ye.bigInt2BytesLE = function(t, e) {
   const n = Array(e);
   let a = BigInt(t);
   for (let s = 0; s < e; s++)
     n[s] = Number(a & 0xFFn), a = a >> 8n;
   return n;
 };
-be.bigInt2U32LE = function(t, e) {
+ye.bigInt2U32LE = function(t, e) {
   const n = Array(e);
   let a = BigInt(t);
   for (let s = 0; s < e; s++)
     n[s] = Number(a & 0xFFFFFFFFn), a = a >> 32n;
   return n;
 };
-be.isOcamNum = function(c) {
+ye.isOcamNum = function(c) {
   return !(!Array.isArray(c) || c.length != 3 || typeof c[0] != "number" || typeof c[1] != "number" || !Array.isArray(c[2]));
 };
-var $c = function(t, e, n) {
+var Kc = function(t, e, n) {
   const a = n || "int";
   if (t.modules[a])
     return a;
@@ -2381,8 +2383,8 @@ var $c = function(t, e, n) {
       );
     return E;
   }
-}, Xn = Gc;
-function Gc(c, t) {
+}, Xn = Yc;
+function Yc(c, t) {
   const e = c.modules[t].n64 * 8, n = c.addFunction(t + "_batchInverse");
   n.addParam("pIn", "i32"), n.addParam("inStep", "i32"), n.addParam("n", "i32"), n.addParam("pOut", "i32"), n.addParam("outStep", "i32"), n.addLocal("itAux", "i32"), n.addLocal("itIn", "i32"), n.addLocal("itOut", "i32"), n.addLocal("i", "i32");
   const a = n.getCodeBuilder(), s = a.i32_const(c.alloc(e));
@@ -2489,8 +2491,8 @@ function Gc(c, t) {
     )
   );
 }
-var pi = Zc;
-function Zc(c, t, e, n, a, s) {
+var Li = ts;
+function ts(c, t, e, n, a, s) {
   typeof s > "u" && (n < a ? s = !0 : s = !1);
   const g = c.addFunction(t);
   g.addParam("pIn", "i32"), g.addParam("n", "i32"), g.addParam("pOut", "i32"), g.addLocal("i", "i32"), g.addLocal("itIn", "i32"), g.addLocal("itOut", "i32");
@@ -2545,8 +2547,8 @@ function Zc(c, t, e, n, a, s) {
     ))
   );
 }
-var Wc = Xc;
-function Xc(c, t, e, n, a, s) {
+var es = ns;
+function ns(c, t, e, n, a, s) {
   typeof s > "u" && (n < a ? s = !0 : s = !1);
   const g = c.addFunction(t);
   g.addParam("pIn1", "i32"), g.addParam("pIn2", "i32"), g.addParam("n", "i32"), g.addParam("pOut", "i32"), g.addLocal("i", "i32"), g.addLocal("itIn1", "i32"), g.addLocal("itIn2", "i32"), g.addLocal("itOut", "i32");
@@ -2617,61 +2619,61 @@ function Xc(c, t, e, n, a, s) {
     ))
   );
 }
-var re = {};
-function hi(c, t) {
+var le = {};
+function mi(c, t) {
   return c === t ? 0 : c > t ? 1 : -1;
 }
 function Vn(c) {
   return c * c;
 }
-function Li(c) {
+function bi(c) {
   return c % 2n !== 0n;
 }
 function Hn(c) {
   return c % 2n === 0n;
 }
-function rn(c) {
+function ln(c) {
   return c < 0n;
 }
-function Vc(c) {
+function as(c) {
   return c > 0n;
 }
-function mi(c) {
-  return rn(c) ? c.toString(2).length - 1 : c.toString(2).length;
+function yi(c) {
+  return ln(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
-function Ve(c) {
+function Qe(c) {
   return c < 0n ? -c : c;
 }
-function Oe(c) {
-  return Ve(c) === 1n;
+function ke(c) {
+  return Qe(c) === 1n;
 }
-function bi(c, t) {
-  for (var e = 0n, n = 1n, a = t, s = Ve(c), g, d, C; s !== 0n; )
+function Ci(c, t) {
+  for (var e = 0n, n = 1n, a = t, s = Qe(c), g, d, C; s !== 0n; )
     g = a / s, d = e, C = a, e = n, a = s, n = d - g * n, s = C - g * s;
-  if (!Oe(a))
+  if (!ke(a))
     throw new Error(c.toString() + " and " + t.toString() + " are not co-prime");
-  return hi(e, 0n) === -1 && (e = e + t), rn(c) ? -e : e;
+  return mi(e, 0n) === -1 && (e = e + t), ln(c) ? -e : e;
 }
-function yi(c, t, e) {
+function Ai(c, t, e) {
   if (e === 0n)
     throw new Error("Cannot take modPow with modulus 0");
   var n = 1n, a = c % e;
-  for (rn(t) && (t = t * -1n, a = bi(a, e)); Vc(t); ) {
+  for (ln(t) && (t = t * -1n, a = Ci(a, e)); as(t); ) {
     if (a === 0n)
       return 0n;
-    Li(t) && (n = n * a % e), t = t / 2n, a = Vn(a) % e;
+    bi(t) && (n = n * a % e), t = t / 2n, a = Vn(a) % e;
   }
   return n;
 }
-function Hc(c, t) {
+function is(c, t) {
   return c = c >= 0n ? c : -c, t = t >= 0n ? t : -t, c === t ? 0 : c > t ? 1 : -1;
 }
 function ga(c, t) {
-  return t === 0n ? !1 : Oe(t) ? !0 : Hc(t, 2n) === 0 ? Hn(c) : c % t === 0n;
+  return t === 0n ? !1 : ke(t) ? !0 : is(t, 2n) === 0 ? Hn(c) : c % t === 0n;
 }
-function Qc(c) {
-  var t = Ve(c);
-  if (Oe(t))
+function os(c) {
+  var t = Qe(c);
+  if (ke(t))
     return !1;
   if (t === 2n || t === 3n || t === 5n)
     return !0;
@@ -2680,17 +2682,17 @@ function Qc(c) {
   if (t < 49n)
     return !0;
 }
-function Jc(c) {
+function cs(c) {
   return c - 1n;
 }
 function pa(c, t) {
-  for (var e = Jc(c), n = e, a = 0, s, g, d; Hn(n); )
+  for (var e = cs(c), n = e, a = 0, s, g, d; Hn(n); )
     n = n / 2n, a++;
   t:
     for (g = 0; g < t.length; g++)
-      if (!(c < t[g]) && (d = yi(BigInt(t[g]), n, c), !(Oe(d) || d === e))) {
+      if (!(c < t[g]) && (d = Ai(BigInt(t[g]), n, c), !(ke(d) || d === e))) {
         for (s = a - 1; s != 0; s--) {
-          if (d = Vn(d) % c, Oe(d))
+          if (d = Vn(d) % c, ke(d))
             return !1;
           if (d === e)
             continue t;
@@ -2699,33 +2701,33 @@ function pa(c, t) {
       }
   return !0;
 }
-function Kc(c) {
-  var t = Qc(c);
+function ss(c) {
+  var t = os(c);
   if (t !== void 0)
     return t;
-  var e = Ve(c), n = mi(e);
+  var e = Qe(c), n = yi(e);
   if (n <= 64)
     return pa(e, [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]);
   for (var a = Math.log(2) * Number(n), s = Math.ceil(a), g = [], d = 0; d < s; d++)
     g.push(BigInt(d + 2));
   return pa(e, g);
 }
-re.bitLength = mi;
-re.isOdd = Li;
-re.isNegative = rn;
-re.abs = Ve;
-re.isUnit = Oe;
-re.compare = hi;
-re.modInv = bi;
-re.modPow = yi;
-re.isPrime = Kc;
-re.square = Vn;
-const Yc = $c, ge = be, ts = Wn, es = Xn, pn = pi, hn = Wc, { bitLength: ns, modInv: Ln, modPow: ha, isPrime: La, isOdd: as, square: is } = re;
+le.bitLength = yi;
+le.isOdd = bi;
+le.isNegative = ln;
+le.abs = Qe;
+le.isUnit = ke;
+le.compare = mi;
+le.modInv = Ci;
+le.modPow = Ai;
+le.isPrime = ss;
+le.square = Vn;
+const rs = Kc, pe = ye, ls = Wn, us = Xn, hn = Li, Ln = es, { bitLength: ds, modInv: mn, modPow: ha, isPrime: La, isOdd: fs, square: _s } = le;
 var Qn = function(t, e, n, a) {
-  const s = BigInt(e), g = Math.floor((ns(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
+  const s = BigInt(e), g = Math.floor((ds(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
   if (t.modules[l])
     return l;
-  const o = Yc(t, g, a), y = t.alloc(C, ge.bigInt2BytesLE(s, C)), E = t.alloc(ge.bigInt2BytesLE(is(1n << BigInt(g * 64)) % s, C)), m = t.alloc(ge.bigInt2BytesLE((1n << BigInt(g * 64)) % s, C)), x = t.alloc(ge.bigInt2BytesLE(0n, C)), O = s - 1n, L = O >> 1n, I = t.alloc(C, ge.bigInt2BytesLE(L, C)), v = L + 1n, U = t.alloc(C, ge.bigInt2BytesLE(v, C));
+  const o = rs(t, g, a), y = t.alloc(C, pe.bigInt2BytesLE(s, C)), E = t.alloc(pe.bigInt2BytesLE(_s(1n << BigInt(g * 64)) % s, C)), m = t.alloc(pe.bigInt2BytesLE((1n << BigInt(g * 64)) % s, C)), x = t.alloc(pe.bigInt2BytesLE(0n, C)), O = s - 1n, L = O >> 1n, I = t.alloc(C, pe.bigInt2BytesLE(L, C)), v = L + 1n, U = t.alloc(C, pe.bigInt2BytesLE(v, C));
   t.modules[l] = {
     pq: y,
     pR2: E,
@@ -2804,7 +2806,7 @@ var Qn = function(t, e, n, a) {
   function j() {
     const z = t.alloc(d * d * 8), b = t.addFunction(l + "_mReduct");
     b.addParam("t", "i32"), b.addParam("r", "i32"), b.addLocal("np32", "i64"), b.addLocal("c", "i64"), b.addLocal("m", "i64");
-    const it = b.getCodeBuilder(), At = Number(0x100000000n - Ln(s, 0x100000000n));
+    const it = b.getCodeBuilder(), At = Number(0x100000000n - mn(s, 0x100000000n));
     b.addCode(it.setLocal("np32", it.i64_const(At)));
     for (let Lt = 0; Lt < d; Lt++) {
       b.addCode(it.setLocal("c", it.i64_const(0))), b.addCode(
@@ -2866,7 +2868,7 @@ var Qn = function(t, e, n, a) {
     z.addParam("x", "i32"), z.addParam("y", "i32"), z.addParam("r", "i32"), z.addLocal("c0", "i64"), z.addLocal("c1", "i64"), z.addLocal("np32", "i64");
     for (let Et = 0; Et < d; Et++)
       z.addLocal("x" + Et, "i64"), z.addLocal("y" + Et, "i64"), z.addLocal("m" + Et, "i64"), z.addLocal("q" + Et, "i64");
-    const b = z.getCodeBuilder(), it = Number(0x100000000n - Ln(s, 0x100000000n));
+    const b = z.getCodeBuilder(), it = Number(0x100000000n - mn(s, 0x100000000n));
     z.addCode(b.setLocal("np32", b.i64_const(it)));
     const At = [], Lt = [], yt = [];
     function It(Et, bt) {
@@ -3005,7 +3007,7 @@ var Qn = function(t, e, n, a) {
     z.addParam("x", "i32"), z.addParam("r", "i32"), z.addLocal("c0", "i64"), z.addLocal("c1", "i64"), z.addLocal("c0_old", "i64"), z.addLocal("c1_old", "i64"), z.addLocal("np32", "i64");
     for (let bt = 0; bt < d; bt++)
       z.addLocal("x" + bt, "i64"), z.addLocal("m" + bt, "i64"), z.addLocal("q" + bt, "i64");
-    const b = z.getCodeBuilder(), it = Number(0x100000000n - Ln(s, 0x100000000n));
+    const b = z.getCodeBuilder(), it = Number(0x100000000n - mn(s, 0x100000000n));
     z.addCode(b.setLocal("np32", b.i64_const(it)));
     const At = [], Lt = [];
     function yt(bt, pt) {
@@ -3252,9 +3254,9 @@ var Qn = function(t, e, n, a) {
     for (; ha(nt, L, s) !== O; )
       nt = nt + 1n;
   let J = 0, ft = O;
-  for (; !as(ft) && ft !== 0n; )
+  for (; !fs(ft) && ft !== 0n; )
     J++, ft = ft >> 1n;
-  const at = t.alloc(C, ge.bigInt2BytesLE(ft, C)), _t = ha(nt, ft, s), zt = t.alloc(ge.bigInt2BytesLE((_t << BigInt(g * 64)) % s, C)), G = ft + 1n >> 1n, K = t.alloc(C, ge.bigInt2BytesLE(G, C));
+  const at = t.alloc(C, pe.bigInt2BytesLE(ft, C)), _t = ha(nt, ft, s), zt = t.alloc(pe.bigInt2BytesLE((_t << BigInt(g * 64)) % s, C)), G = ft + 1n >> 1n, K = t.alloc(C, pe.bigInt2BytesLE(G, C));
   function P() {
     const z = t.addFunction(l + "_sqrt");
     z.addParam("n", "i32"), z.addParam("r", "i32"), z.addLocal("m", "i32"), z.addLocal("i", "i32"), z.addLocal("j", "i32");
@@ -3378,7 +3380,7 @@ var Qn = function(t, e, n, a) {
       b.ret(b.call(o + "_eq", b.getLocal("x"), b.i32_const(m)))
     );
   }
-  return t.exportFunction(o + "_copy", l + "_copy"), t.exportFunction(o + "_zero", l + "_zero"), t.exportFunction(o + "_isZero", l + "_isZero"), t.exportFunction(o + "_eq", l + "_eq"), W(), S(), F(), r(), j(), T(), D(), A(), M(), H(), h(), R(), ut(), w(), q(), u(), es(t, l), pn(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), pn(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), pn(t, l + "_batchNeg", l + "_neg", C, C), hn(t, l + "_batchAdd", l + "_add", C, C), hn(t, l + "_batchSub", l + "_sub", C, C), hn(t, l + "_batchMul", l + "_mul", C, C), t.exportFunction(l + "_add"), t.exportFunction(l + "_sub"), t.exportFunction(l + "_neg"), t.exportFunction(l + "_isNegative"), t.exportFunction(l + "_isOne"), t.exportFunction(l + "_sign"), t.exportFunction(l + "_mReduct"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_squareOld"), t.exportFunction(l + "_fromMontgomery"), t.exportFunction(l + "_toMontgomery"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_one"), t.exportFunction(l + "_load"), t.exportFunction(l + "_timesScalar"), ts(
+  return t.exportFunction(o + "_copy", l + "_copy"), t.exportFunction(o + "_zero", l + "_zero"), t.exportFunction(o + "_isZero", l + "_isZero"), t.exportFunction(o + "_eq", l + "_eq"), W(), S(), F(), r(), j(), T(), D(), A(), M(), H(), h(), R(), ut(), w(), q(), u(), us(t, l), hn(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), hn(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), hn(t, l + "_batchNeg", l + "_neg", C, C), Ln(t, l + "_batchAdd", l + "_add", C, C), Ln(t, l + "_batchSub", l + "_sub", C, C), Ln(t, l + "_batchMul", l + "_mul", C, C), t.exportFunction(l + "_add"), t.exportFunction(l + "_sub"), t.exportFunction(l + "_neg"), t.exportFunction(l + "_isNegative"), t.exportFunction(l + "_isOne"), t.exportFunction(l + "_sign"), t.exportFunction(l + "_mReduct"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_squareOld"), t.exportFunction(l + "_fromMontgomery"), t.exportFunction(l + "_toMontgomery"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_one"), t.exportFunction(l + "_load"), t.exportFunction(l + "_timesScalar"), ls(
     t,
     l + "_exp",
     C,
@@ -3388,15 +3390,15 @@ var Qn = function(t, e, n, a) {
     l + "_one"
   ), t.exportFunction(l + "_exp"), t.exportFunction(l + "_batchInverse"), La(s) && (P(), i(), t.exportFunction(l + "_sqrt"), t.exportFunction(l + "_isSquare")), t.exportFunction(l + "_batchToMontgomery"), t.exportFunction(l + "_batchFromMontgomery"), l;
 };
-const os = Qn, { bitLength: cs } = re;
-var Ci = function(t, e, n, a, s) {
-  const g = BigInt(e), d = Math.floor((cs(g - 1n) - 1) / 64) + 1, C = d * 8, l = n || "f1";
+const gs = Qn, { bitLength: ps } = le;
+var Fi = function(t, e, n, a, s) {
+  const g = BigInt(e), d = Math.floor((ps(g - 1n) - 1) / 64) + 1, C = d * 8, l = n || "f1";
   if (t.modules[l])
     return l;
   t.modules[l] = {
     n64: d
   };
-  const o = s || "int", y = os(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
+  const o = s || "int", y = gs(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
   function O() {
     const U = t.alloc(C), w = t.addFunction(l + "_mul");
     w.addParam("x", "i32"), w.addParam("y", "i32"), w.addParam("r", "i32");
@@ -3425,8 +3427,8 @@ var Ci = function(t, e, n, a, s) {
   }
   return O(), L(), I(), v(), t.exportFunction(y + "_add", l + "_add"), t.exportFunction(y + "_sub", l + "_sub"), t.exportFunction(y + "_neg", l + "_neg"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_isNegative"), t.exportFunction(y + "_copy", l + "_copy"), t.exportFunction(y + "_zero", l + "_zero"), t.exportFunction(y + "_one", l + "_one"), t.exportFunction(y + "_isZero", l + "_isZero"), t.exportFunction(y + "_eq", l + "_eq"), l;
 };
-const ss = Wn, rs = Xn, mn = be;
-var Ai = function(t, e, n, a) {
+const hs = Wn, Ls = Xn, bn = ye;
+var Ei = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8, g = t.modules[a].q;
@@ -3659,7 +3661,7 @@ var Ai = function(t, e, n, a) {
   function j() {
     const D = t.addFunction(n + "_sqrt");
     D.addParam("a", "i32"), D.addParam("pr", "i32");
-    const A = D.getCodeBuilder(), M = A.i32_const(t.alloc(mn.bigInt2BytesLE((BigInt(g || 0) - 3n) / 4n, s))), H = A.i32_const(t.alloc(mn.bigInt2BytesLE((BigInt(g || 0) - 1n) / 2n, s))), ut = A.getLocal("a"), nt = A.i32_const(t.alloc(s * 2)), J = A.i32_const(t.alloc(s * 2)), ft = A.i32_const(t.alloc(s * 2)), at = t.alloc(s * 2), _t = A.i32_const(at), zt = A.i32_const(at), G = A.i32_const(at + s), K = A.i32_const(t.alloc(s * 2)), P = A.i32_const(t.alloc(s * 2));
+    const A = D.getCodeBuilder(), M = A.i32_const(t.alloc(bn.bigInt2BytesLE((BigInt(g || 0) - 3n) / 4n, s))), H = A.i32_const(t.alloc(bn.bigInt2BytesLE((BigInt(g || 0) - 1n) / 2n, s))), ut = A.getLocal("a"), nt = A.i32_const(t.alloc(s * 2)), J = A.i32_const(t.alloc(s * 2)), ft = A.i32_const(t.alloc(s * 2)), at = t.alloc(s * 2), _t = A.i32_const(at), zt = A.i32_const(at), G = A.i32_const(at + s), K = A.i32_const(t.alloc(s * 2)), P = A.i32_const(t.alloc(s * 2));
     D.addCode(
       A.call(n + "_one", _t),
       A.call(n + "_neg", _t, _t),
@@ -3698,7 +3700,7 @@ var Ai = function(t, e, n, a) {
   function T() {
     const D = t.addFunction(n + "_isSquare");
     D.addParam("a", "i32"), D.setReturnType("i32");
-    const A = D.getCodeBuilder(), M = A.i32_const(t.alloc(mn.bigInt2BytesLE((BigInt(g || 0) - 3n) / 4n, s))), H = A.getLocal("a"), ut = A.i32_const(t.alloc(s * 2)), nt = A.i32_const(t.alloc(s * 2)), J = A.i32_const(t.alloc(s * 2)), ft = t.alloc(s * 2), at = A.i32_const(ft);
+    const A = D.getCodeBuilder(), M = A.i32_const(t.alloc(bn.bigInt2BytesLE((BigInt(g || 0) - 3n) / 4n, s))), H = A.getLocal("a"), ut = A.i32_const(t.alloc(s * 2)), nt = A.i32_const(t.alloc(s * 2)), J = A.i32_const(t.alloc(s * 2)), ft = t.alloc(s * 2), at = A.i32_const(ft);
     D.addCode(
       A.call(n + "_one", at),
       A.call(n + "_neg", at, at),
@@ -3722,7 +3724,7 @@ var Ai = function(t, e, n, a) {
       A.ret(A.i32_const(1))
     );
   }
-  return F(), R(), U(), w(), v(), m(), x(), O(), d(), l(), o(), y(), L(), I(), S(), r(), C(), h(), E(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_mul1"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_conjugate"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), rs(t, n), ss(
+  return F(), R(), U(), w(), v(), m(), x(), O(), d(), l(), o(), y(), L(), I(), S(), r(), C(), h(), E(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_mul1"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_conjugate"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), Ls(t, n), hs(
     t,
     n + "_exp",
     s * 2,
@@ -3732,8 +3734,8 @@ var Ai = function(t, e, n, a) {
     n + "_one"
   ), j(), T(), t.exportFunction(n + "_exp"), t.exportFunction(n + "_timesScalar"), t.exportFunction(n + "_batchInverse"), t.exportFunction(n + "_sqrt"), t.exportFunction(n + "_isSquare"), t.exportFunction(n + "_isNegative"), n;
 };
-const ls = Wn, us = Xn;
-var Fi = function(t, e, n, a) {
+const ms = Wn, bs = Xn;
+var wi = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8;
@@ -3990,7 +3992,7 @@ var Fi = function(t, e, n, a) {
       )
     );
   }
-  return U(), F(), L(), I(), O(), y(), E(), g(), C(), l(), S(), m(), x(), v(), w(), d(), o(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), us(t, n), ls(
+  return U(), F(), L(), I(), O(), y(), E(), g(), C(), l(), S(), m(), x(), v(), w(), d(), o(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), bs(t, n), ms(
     t,
     n + "_exp",
     s * 3,
@@ -3999,7 +4001,7 @@ var Fi = function(t, e, n, a) {
     n + "_copy",
     n + "_one"
   ), t.exportFunction(n + "_exp"), t.exportFunction(n + "_timesScalar"), t.exportFunction(n + "_batchInverse"), t.exportFunction(n + "_isNegative"), n;
-}, ds = function(t, e, n, a, s, g, d, C) {
+}, ys = function(t, e, n, a, s, g, d, C) {
   const l = t.addFunction(e);
   l.addParam("base", "i32"), l.addParam("scalar", "i32"), l.addParam("scalarLength", "i32"), l.addParam("r", "i32"), l.addLocal("old0", "i32"), l.addLocal("nbits", "i32"), l.addLocal("i", "i32"), l.addLocal("last", "i32"), l.addLocal("cur", "i32"), l.addLocal("carry", "i32"), l.addLocal("p", "i32");
   const o = l.getCodeBuilder(), y = o.i32_const(t.alloc(n));
@@ -4182,7 +4184,7 @@ var Fi = function(t, e, n, a) {
     )),
     o.i32_store(o.i32_const(0), o.getLocal("old0"))
   );
-}, fs = function(t, e, n, a, s) {
+}, Cs = function(t, e, n, a, s) {
   const d = t.modules[e].n64 * 8;
   function C() {
     const E = t.addFunction(n + "_getChunk");
@@ -4574,8 +4576,8 @@ var Fi = function(t, e, n, a) {
   }
   C(), y(), l(), o(), t.exportFunction(n), t.exportFunction(n + "_chunk");
 };
-const ma = ds, qe = pi, ba = fs;
-var Ei = function(t, e, n, a) {
+const ma = ys, Me = Li, ba = Cs;
+var Bi = function(t, e, n, a) {
   const s = t.modules[n].n64, g = s * 8;
   if (t.modules[e])
     return e;
@@ -4933,7 +4935,7 @@ var Ei = function(t, e, n, a) {
     P.addCode(i.setLocal("z1", i.i32_add(i.getLocal("p1"), i.i32_const(g * 2))));
     const W = i.getLocal("z1"), z = i.getLocal("p2"), b = i.i32_add(i.getLocal("p2"), i.i32_const(g));
     P.addCode(i.setLocal("z2", i.i32_add(i.getLocal("p2"), i.i32_const(g * 2))));
-    const it = i.getLocal("z2"), At = i.getLocal("pr"), Lt = i.i32_add(i.getLocal("pr"), i.i32_const(g)), yt = i.i32_add(i.getLocal("pr"), i.i32_const(g * 2)), It = i.i32_const(t.alloc(g)), mt = i.i32_const(t.alloc(g)), Ot = i.i32_const(t.alloc(g)), jt = i.i32_const(t.alloc(g)), Et = i.i32_const(t.alloc(g)), bt = i.i32_const(t.alloc(g)), pt = i.i32_const(t.alloc(g)), $t = i.i32_const(t.alloc(g)), Jt = i.i32_const(t.alloc(g)), se = i.i32_const(t.alloc(g)), te = i.i32_const(t.alloc(g)), Pt = i.i32_const(t.alloc(g)), Dt = i.i32_const(t.alloc(g)), Zt = i.i32_const(t.alloc(g)), vt = i.i32_const(t.alloc(g)), Wt = i.i32_const(t.alloc(g)), wt = i.i32_const(t.alloc(g));
+    const it = i.getLocal("z2"), At = i.getLocal("pr"), Lt = i.i32_add(i.getLocal("pr"), i.i32_const(g)), yt = i.i32_add(i.getLocal("pr"), i.i32_const(g * 2)), It = i.i32_const(t.alloc(g)), mt = i.i32_const(t.alloc(g)), Ot = i.i32_const(t.alloc(g)), jt = i.i32_const(t.alloc(g)), Et = i.i32_const(t.alloc(g)), bt = i.i32_const(t.alloc(g)), pt = i.i32_const(t.alloc(g)), $t = i.i32_const(t.alloc(g)), Jt = i.i32_const(t.alloc(g)), re = i.i32_const(t.alloc(g)), te = i.i32_const(t.alloc(g)), Pt = i.i32_const(t.alloc(g)), Dt = i.i32_const(t.alloc(g)), Zt = i.i32_const(t.alloc(g)), vt = i.i32_const(t.alloc(g)), Wt = i.i32_const(t.alloc(g)), wt = i.i32_const(t.alloc(g));
     P.addCode(
       i.if(
         i.call(e + "_isZero", i.getLocal("p1")),
@@ -4982,11 +4984,11 @@ var Ei = function(t, e, n, a) {
         )
       ),
       i.call(n + "_sub", jt, Ot, Jt),
-      i.call(n + "_sub", $t, pt, se),
+      i.call(n + "_sub", $t, pt, re),
       i.call(n + "_add", Jt, Jt, te),
       i.call(n + "_square", te, te),
       i.call(n + "_mul", Jt, te, Pt),
-      i.call(n + "_add", se, se, Dt),
+      i.call(n + "_add", re, re, Dt),
       i.call(n + "_mul", Ot, te, vt),
       i.call(n + "_square", Dt, Zt),
       i.call(n + "_add", vt, vt, Wt),
@@ -5009,7 +5011,7 @@ var Ei = function(t, e, n, a) {
     P.addParam("p1", "i32"), P.addParam("p2", "i32"), P.addParam("pr", "i32"), P.addLocal("z1", "i32");
     const i = P.getCodeBuilder(), q = i.getLocal("p1"), u = i.i32_add(i.getLocal("p1"), i.i32_const(g));
     P.addCode(i.setLocal("z1", i.i32_add(i.getLocal("p1"), i.i32_const(g * 2))));
-    const W = i.getLocal("z1"), z = i.getLocal("p2"), b = i.i32_add(i.getLocal("p2"), i.i32_const(g)), it = i.getLocal("pr"), At = i.i32_add(i.getLocal("pr"), i.i32_const(g)), Lt = i.i32_add(i.getLocal("pr"), i.i32_const(g * 2)), yt = i.i32_const(t.alloc(g)), It = i.i32_const(t.alloc(g)), mt = i.i32_const(t.alloc(g)), Ot = i.i32_const(t.alloc(g)), jt = i.i32_const(t.alloc(g)), Et = i.i32_const(t.alloc(g)), bt = i.i32_const(t.alloc(g)), pt = i.i32_const(t.alloc(g)), $t = i.i32_const(t.alloc(g)), Jt = i.i32_const(t.alloc(g)), se = i.i32_const(t.alloc(g)), te = i.i32_const(t.alloc(g)), Pt = i.i32_const(t.alloc(g)), Dt = i.i32_const(t.alloc(g));
+    const W = i.getLocal("z1"), z = i.getLocal("p2"), b = i.i32_add(i.getLocal("p2"), i.i32_const(g)), it = i.getLocal("pr"), At = i.i32_add(i.getLocal("pr"), i.i32_const(g)), Lt = i.i32_add(i.getLocal("pr"), i.i32_const(g * 2)), yt = i.i32_const(t.alloc(g)), It = i.i32_const(t.alloc(g)), mt = i.i32_const(t.alloc(g)), Ot = i.i32_const(t.alloc(g)), jt = i.i32_const(t.alloc(g)), Et = i.i32_const(t.alloc(g)), bt = i.i32_const(t.alloc(g)), pt = i.i32_const(t.alloc(g)), $t = i.i32_const(t.alloc(g)), Jt = i.i32_const(t.alloc(g)), re = i.i32_const(t.alloc(g)), te = i.i32_const(t.alloc(g)), Pt = i.i32_const(t.alloc(g)), Dt = i.i32_const(t.alloc(g));
     P.addCode(
       i.if(
         i.call(e + "_isZero", i.getLocal("p1")),
@@ -5055,9 +5057,9 @@ var Ei = function(t, e, n, a) {
       i.call(n + "_mul", jt, pt, $t),
       i.call(n + "_add", bt, bt, Jt),
       i.call(n + "_mul", q, pt, te),
-      i.call(n + "_square", Jt, se),
+      i.call(n + "_square", Jt, re),
       i.call(n + "_add", te, te, Pt),
-      i.call(n + "_sub", se, $t, it),
+      i.call(n + "_sub", re, $t, it),
       i.call(n + "_sub", it, Pt, it),
       i.call(n + "_mul", u, $t, Dt),
       i.call(n + "_add", Dt, Dt, Dt),
@@ -5473,7 +5475,7 @@ var Ei = function(t, e, n, a) {
       )
     );
   }
-  return C(), d(), E(), y(), o(), l(), ut(), I(), x(), m(), L(), O(), h(), r(), F(), j(), R(), A(), D(), T(), S(), w(), U(), v(), H(), G(), K(), nt(), M(), J(), at(), ft(), _t(), zt(), qe(t, e + "_batchLEMtoU", e + "_LEMtoU", g * 2, g * 2), qe(t, e + "_batchLEMtoC", e + "_LEMtoC", g * 2, g), qe(t, e + "_batchUtoLEM", e + "_UtoLEM", g * 2, g * 2), qe(t, e + "_batchCtoLEM", e + "_CtoLEM", g, g * 2, !0), qe(t, e + "_batchToJacobian", e + "_toJacobian", g * 2, g * 3, !0), ba(t, e, e + "_multiexp", e + "_add", g * 3), ba(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), ma(
+  return C(), d(), E(), y(), o(), l(), ut(), I(), x(), m(), L(), O(), h(), r(), F(), j(), R(), A(), D(), T(), S(), w(), U(), v(), H(), G(), K(), nt(), M(), J(), at(), ft(), _t(), zt(), Me(t, e + "_batchLEMtoU", e + "_LEMtoU", g * 2, g * 2), Me(t, e + "_batchLEMtoC", e + "_LEMtoC", g * 2, g), Me(t, e + "_batchUtoLEM", e + "_UtoLEM", g * 2, g * 2), Me(t, e + "_batchCtoLEM", e + "_CtoLEM", g, g * 2, !0), Me(t, e + "_batchToJacobian", e + "_toJacobian", g * 2, g * 3, !0), ba(t, e, e + "_multiexp", e + "_add", g * 3), ba(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), ma(
     t,
     e + "_timesScalar",
     g * 3,
@@ -5493,24 +5495,24 @@ var Ei = function(t, e, n, a) {
     e + "_zero"
   ), t.exportFunction(e + "_isZero"), t.exportFunction(e + "_isZeroAffine"), t.exportFunction(e + "_eq"), t.exportFunction(e + "_eqMixed"), t.exportFunction(e + "_eqAffine"), t.exportFunction(e + "_copy"), t.exportFunction(e + "_copyAffine"), t.exportFunction(e + "_zero"), t.exportFunction(e + "_zeroAffine"), t.exportFunction(e + "_double"), t.exportFunction(e + "_doubleAffine"), t.exportFunction(e + "_add"), t.exportFunction(e + "_addMixed"), t.exportFunction(e + "_addAffine"), t.exportFunction(e + "_neg"), t.exportFunction(e + "_negAffine"), t.exportFunction(e + "_sub"), t.exportFunction(e + "_subMixed"), t.exportFunction(e + "_subAffine"), t.exportFunction(e + "_fromMontgomery"), t.exportFunction(e + "_fromMontgomeryAffine"), t.exportFunction(e + "_toMontgomery"), t.exportFunction(e + "_toMontgomeryAffine"), t.exportFunction(e + "_timesScalar"), t.exportFunction(e + "_timesScalarAffine"), t.exportFunction(e + "_normalize"), t.exportFunction(e + "_LEMtoU"), t.exportFunction(e + "_LEMtoC"), t.exportFunction(e + "_UtoLEM"), t.exportFunction(e + "_CtoLEM"), t.exportFunction(e + "_batchLEMtoU"), t.exportFunction(e + "_batchLEMtoC"), t.exportFunction(e + "_batchUtoLEM"), t.exportFunction(e + "_batchCtoLEM"), t.exportFunction(e + "_toAffine"), t.exportFunction(e + "_toJacobian"), t.exportFunction(e + "_batchToAffine"), t.exportFunction(e + "_batchToJacobian"), t.exportFunction(e + "_inCurve"), t.exportFunction(e + "_inCurveAffine"), e;
 };
-const { isOdd: _s, modInv: ya, modPow: De } = re, Je = be;
-var wi = function(t, e, n, a, s) {
+const { isOdd: As, modInv: ya, modPow: Re } = le, Ye = ye;
+var vi = function(t, e, n, a, s) {
   const d = t.modules[a].n64 * 8, l = t.modules[n].n64 * 8, o = t.modules[a].q;
   let y = o - 1n, E = 0;
-  for (; !_s(y); )
+  for (; !As(y); )
     E++, y = y >> 1n;
   let m = 2n;
-  for (; De(m, o >> 1n, o) === 1n; )
+  for (; Re(m, o >> 1n, o) === 1n; )
     m = m + 1n;
   const x = new Array(E + 1);
-  x[E] = De(m, y, o);
+  x[E] = Re(m, y, o);
   let O = E - 1;
   for (; O >= 0; )
-    x[O] = De(x[O + 1], 2n, o), O--;
+    x[O] = Re(x[O + 1], 2n, o), O--;
   const L = [], I = (1n << BigInt(d * 8)) % o;
   for (let q = 0; q < x.length; q++) {
     const u = x[q] * I % o;
-    L.push(...Je.bigInt2BytesLE(u, d));
+    L.push(...Ye.bigInt2BytesLE(u, d));
   }
   const v = t.alloc(L), U = new Array(E + 1);
   U[0] = 1n;
@@ -5519,12 +5521,12 @@ var wi = function(t, e, n, a, s) {
   const w = [];
   for (let q = 0; q <= E; q++) {
     const u = ya(U[q], o) * I % o;
-    w.push(...Je.bigInt2BytesLE(u, d));
+    w.push(...Ye.bigInt2BytesLE(u, d));
   }
-  const S = t.alloc(w), F = De(m, 2n, o), r = [], h = [];
+  const S = t.alloc(w), F = Re(m, 2n, o), r = [], h = [];
   for (let q = 0; q <= E; q++) {
-    const u = De(F, 2n ** BigInt(q), o), W = ya(o + 1n - u, o);
-    r.push(...Je.bigInt2BytesLE(u * I % o, d)), h.push(...Je.bigInt2BytesLE(W * I % o, d));
+    const u = Re(F, 2n ** BigInt(q), o), W = ya(o + 1n - u, o);
+    r.push(...Ye.bigInt2BytesLE(u * I % o, d)), h.push(...Ye.bigInt2BytesLE(W * I % o, d));
   }
   const R = t.alloc(r), j = t.alloc(h);
   function T(q) {
@@ -6516,7 +6518,7 @@ var wi = function(t, e, n, a, s) {
     );
   }
   at(), ft(), J(), nt(), M(), H(), ut(), _t(), zt(), G(), P(), i(), K(), t.exportFunction(e + "_fft"), t.exportFunction(e + "_ifft"), t.exportFunction(e + "_rawfft"), t.exportFunction(e + "_fftJoin"), t.exportFunction(e + "_fftJoinExt"), t.exportFunction(e + "_fftJoinExtInv"), t.exportFunction(e + "_fftMix"), t.exportFunction(e + "_fftFinal"), t.exportFunction(e + "_prepareLagrangeEvaluation");
-}, Bi = function(t, e, n) {
+}, xi = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const C = t.addFunction(e + "_zero");
@@ -6609,7 +6611,7 @@ var wi = function(t, e, n, a, s) {
     );
   }
   return g(), d(), t.exportFunction(e + "_zero"), t.exportFunction(e + "_constructLC"), e;
-}, vi = function(t, e, n) {
+}, Si = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const l = t.addFunction(e + "_buildABC");
@@ -6879,7 +6881,7 @@ var wi = function(t, e, n, a, s) {
     );
   }
   return g(), d(), C(), t.exportFunction(e + "_buildABC"), t.exportFunction(e + "_joinABC"), t.exportFunction(e + "_batchAdd"), e;
-}, xi = function(t, e, n, a, s, g, d, C) {
+}, Ii = function(t, e, n, a, s, g, d, C) {
   const l = t.addFunction(e);
   l.addParam("pIn", "i32"), l.addParam("n", "i32"), l.addParam("pFirst", "i32"), l.addParam("pInc", "i32"), l.addParam("pOut", "i32"), l.addLocal("pOldFree", "i32"), l.addLocal("i", "i32"), l.addLocal("pFrom", "i32"), l.addLocal("pTo", "i32");
   const o = l.getCodeBuilder(), y = o.i32_const(t.alloc(d));
@@ -6916,15 +6918,15 @@ var wi = function(t, e, n, a, s) {
     ))
   ), t.exportFunction(e);
 };
-const Nt = be, gs = Qn, ps = Ci, Ca = Ai, hs = Fi, Aa = Ei, bn = wi, Ls = Bi, ms = vi, Me = xi, { bitLength: bs, modInv: ys, isOdd: Fa, isNegative: Cs } = re;
-var As = function(t, e) {
+const Nt = ye, Fs = Qn, Es = Fi, Ca = Ei, ws = wi, Aa = Bi, yn = vi, Bs = xi, vs = Si, Ne = Ii, { bitLength: xs, modInv: Ss, isOdd: Fa, isNegative: Is } = le;
+var Os = function(t, e) {
   const n = e || "bn128";
   if (t.modules[n])
     return n;
-  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((bs(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = d, o = l * 2, y = l * 12, E = t.alloc(Nt.bigInt2BytesLE(s, C)), m = gs(t, a, "f1m");
-  ps(t, s, "fr", "frm");
+  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((xs(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = d, o = l * 2, y = l * 12, E = t.alloc(Nt.bigInt2BytesLE(s, C)), m = Fs(t, a, "f1m");
+  Es(t, s, "fr", "frm");
   const x = t.alloc(Nt.bigInt2BytesLE(w(3n), l)), O = Aa(t, "g1m", "f1m", x);
-  bn(t, "frm", "frm", "frm", "frm_mul"), Ls(t, "pol", "frm"), ms(t, "qap", "frm");
+  yn(t, "frm", "frm", "frm", "frm_mul"), Bs(t, "pol", "frm"), vs(t, "qap", "frm");
   const L = Ca(t, "f1m_neg", "f2m", "f1m"), I = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
     ...Nt.bigInt2BytesLE(w(266929791119991161246907387137283842545076965332900288569378510910307636690n), l)
@@ -6944,7 +6946,7 @@ var As = function(t, e) {
       )
     ), t.exportFunction(Y);
   }
-  U("g1m_timesFr", "g1m_timesScalar"), bn(t, "g1m", "g1m", "frm", "g1m_timesFr"), U("g2m_timesFr", "g2m_timesScalar"), bn(t, "g2m", "g2m", "frm", "g2m_timesFr"), U("g1m_timesFrAffine", "g1m_timesScalarAffine"), U("g2m_timesFrAffine", "g2m_timesScalarAffine"), Me(t, "frm_batchApplyKey", "fmr", "frm", d, d, d, "frm_mul"), Me(t, "g1m_batchApplyKey", "g1m", "frm", d * 3, d * 3, d, "g1m_timesFr"), Me(t, "g1m_batchApplyKeyMixed", "g1m", "frm", d * 2, d * 3, d, "g1m_timesFrAffine"), Me(t, "g2m_batchApplyKey", "g2m", "frm", d * 2 * 3, d * 3 * 2, d, "g2m_timesFr"), Me(t, "g2m_batchApplyKeyMixed", "g2m", "frm", d * 2 * 2, d * 3 * 2, d, "g2m_timesFrAffine");
+  U("g1m_timesFr", "g1m_timesScalar"), yn(t, "g1m", "g1m", "frm", "g1m_timesFr"), U("g2m_timesFr", "g2m_timesScalar"), yn(t, "g2m", "g2m", "frm", "g2m_timesFr"), U("g1m_timesFrAffine", "g1m_timesScalarAffine"), U("g2m_timesFrAffine", "g2m_timesScalarAffine"), Ne(t, "frm_batchApplyKey", "fmr", "frm", d, d, d, "frm_mul"), Ne(t, "g1m_batchApplyKey", "g1m", "frm", d * 3, d * 3, d, "g1m_timesFr"), Ne(t, "g1m_batchApplyKeyMixed", "g1m", "frm", d * 2, d * 3, d, "g1m_timesFrAffine"), Ne(t, "g2m_batchApplyKey", "g2m", "frm", d * 2 * 3, d * 3 * 2, d, "g2m_timesFr"), Ne(t, "g2m_batchApplyKeyMixed", "g2m", "frm", d * 2 * 2, d * 3 * 2, d, "g2m_timesFrAffine");
   function w(Y) {
     return BigInt(Y) * (1n << BigInt(l * 8)) % a;
   }
@@ -7029,7 +7031,7 @@ var As = function(t, e) {
     ...Nt.bigInt2BytesLE(w(9), l),
     ...Nt.bigInt2BytesLE(w(1), l)
   ]), H = t.alloc([
-    ...Nt.bigInt2BytesLE(w(ys(2n, a)), l),
+    ...Nt.bigInt2BytesLE(w(Ss(2n, a)), l),
     ...Nt.bigInt2BytesLE(0n, l)
   ]), ut = M, nt = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
@@ -7049,7 +7051,7 @@ var As = function(t, e) {
     );
   }
   J();
-  const ft = hs(t, n + "_mulNR6", "f6m", "f2m");
+  const ft = ws(t, n + "_mulNR6", "f6m", "f2m");
   function at() {
     const Y = t.addFunction(n + "_mulNR12");
     Y.addParam("x", "i32"), Y.addParam("pr", "i32");
@@ -7503,7 +7505,7 @@ var As = function(t, e) {
         (ct * rt - st * ot) % a,
         (ct * ot + st * rt) % a
       ];
-      return Cs(gt[0]) && (gt[0] = gt[0] + a), gt;
+      return Is(gt[0]) && (gt[0] = gt[0] + a), gt;
     }
   }
   function $t() {
@@ -7598,7 +7600,7 @@ var As = function(t, e) {
       f.call(L + "_add", Tt, Bt, Bt)
     );
   }
-  function se(Y, f) {
+  function re(Y, f) {
     const _ = it(Y).map((st) => st == -1 ? 255 : st), Z = t.alloc(_), Q = t.addFunction(n + "__cyclotomicExp_" + f);
     Q.addParam("x", "i32"), Q.addParam("r", "i32"), Q.addLocal("bit", "i32"), Q.addLocal("i", "i32");
     const $ = Q.getCodeBuilder(), tt = $.getLocal("x"), V = $.getLocal("r"), ct = $.i32_const(t.alloc(y));
@@ -7637,7 +7639,7 @@ var As = function(t, e) {
     );
   }
   function te() {
-    Jt(), se(b, "w0");
+    Jt(), re(b, "w0");
     const Y = t.addFunction(n + "__finalExponentiationLastChunk");
     Y.addParam("x", "i32"), Y.addParam("r", "i32");
     const f = Y.getCodeBuilder(), _ = f.getLocal("x"), Z = f.getLocal("r"), Q = f.i32_const(t.alloc(y)), $ = f.i32_const(t.alloc(y)), tt = f.i32_const(t.alloc(y)), V = f.i32_const(t.alloc(y)), ct = f.i32_const(t.alloc(y)), st = f.i32_const(t.alloc(y)), rt = f.i32_const(t.alloc(y)), ot = f.i32_const(t.alloc(y)), gt = f.i32_const(t.alloc(y)), Bt = f.i32_const(t.alloc(y)), Ft = f.i32_const(t.alloc(y)), ht = f.i32_const(t.alloc(y)), xt = f.i32_const(t.alloc(y)), Tt = f.i32_const(t.alloc(y)), Ut = f.i32_const(t.alloc(y)), St = f.i32_const(t.alloc(y)), kt = f.i32_const(t.alloc(y)), k = f.i32_const(t.alloc(y)), et = f.i32_const(t.alloc(y)), dt = f.i32_const(t.alloc(y)), qt = f.i32_const(t.alloc(y));
@@ -7736,15 +7738,15 @@ var As = function(t, e) {
     Wt(Y), t.exportFunction(n + "_pairingEq" + Y);
   wt(), t.exportFunction(n + "_pairing"), t.exportFunction(n + "_prepareG1"), t.exportFunction(n + "_prepareG2"), t.exportFunction(n + "_millerLoop"), t.exportFunction(n + "_finalExponentiation"), t.exportFunction(n + "_finalExponentiationOld"), t.exportFunction(n + "__mulBy024"), t.exportFunction(n + "__mulBy024Old"), t.exportFunction(n + "__cyclotomicSquare"), t.exportFunction(n + "__cyclotomicExp_w0");
 };
-const Mt = be, Fs = Qn, Es = Ci, Ea = Ai, ws = Fi, wa = Ei, yn = wi, Bs = Bi, vs = vi, Re = xi, { bitLength: Ba, isOdd: va, isNegative: xs } = re;
-var Ss = function(t, e) {
+const Mt = ye, Ps = Qn, ks = Fi, Ea = Ei, Ts = wi, wa = Bi, Cn = vi, qs = xi, Ds = Si, ze = Ii, { bitLength: Ba, isOdd: va, isNegative: Ms } = le;
+var Rs = function(t, e) {
   const n = e || "bls12381";
   if (t.modules[n])
     return n;
-  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((Ba(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((Ba(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = Fs(t, a, "f1m", "intq");
-  Es(t, s, "fr", "frm", "intr");
+  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((Ba(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((Ba(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = Ps(t, a, "f1m", "intq");
+  ks(t, s, "fr", "frm", "intr");
   const L = t.alloc(Mt.bigInt2BytesLE(F(4n), C)), I = wa(t, "g1m", "f1m", L);
-  yn(t, "frm", "frm", "frm", "frm_mul"), Bs(t, "pol", "frm"), vs(t, "qap", "frm");
+  Cn(t, "frm", "frm", "frm", "frm_mul"), qs(t, "pol", "frm"), Ds(t, "qap", "frm");
   const v = Ea(t, "f1m_neg", "f2m", "f1m"), U = t.alloc([
     ...Mt.bigInt2BytesLE(F(4n), C),
     ...Mt.bigInt2BytesLE(F(4n), C)
@@ -7764,7 +7766,7 @@ var Ss = function(t, e) {
       )
     ), t.exportFunction(f);
   }
-  S("g1m_timesFr", "g1m_timesScalar"), yn(t, "g1m", "g1m", "frm", "g1m_timesFr"), S("g2m_timesFr", "g2m_timesScalar"), yn(t, "g2m", "g2m", "frm", "g2m_timesFr"), S("g1m_timesFrAffine", "g1m_timesScalarAffine"), S("g2m_timesFrAffine", "g2m_timesScalarAffine"), Re(t, "frm_batchApplyKey", "fmr", "frm", E, E, E, "frm_mul"), Re(t, "g1m_batchApplyKey", "g1m", "frm", d * 3, d * 3, E, "g1m_timesFr"), Re(t, "g1m_batchApplyKeyMixed", "g1m", "frm", d * 2, d * 3, E, "g1m_timesFrAffine"), Re(t, "g2m_batchApplyKey", "g2m", "frm", d * 2 * 3, d * 3 * 2, E, "g2m_timesFr"), Re(t, "g2m_batchApplyKeyMixed", "g2m", "frm", d * 2 * 2, d * 3 * 2, E, "g2m_timesFrAffine");
+  S("g1m_timesFr", "g1m_timesScalar"), Cn(t, "g1m", "g1m", "frm", "g1m_timesFr"), S("g2m_timesFr", "g2m_timesScalar"), Cn(t, "g2m", "g2m", "frm", "g2m_timesFr"), S("g1m_timesFrAffine", "g1m_timesScalarAffine"), S("g2m_timesFrAffine", "g2m_timesScalarAffine"), ze(t, "frm_batchApplyKey", "fmr", "frm", E, E, E, "frm_mul"), ze(t, "g1m_batchApplyKey", "g1m", "frm", d * 3, d * 3, E, "g1m_timesFr"), ze(t, "g1m_batchApplyKeyMixed", "g1m", "frm", d * 2, d * 3, E, "g1m_timesFrAffine"), ze(t, "g2m_batchApplyKey", "g2m", "frm", d * 2 * 3, d * 3 * 2, E, "g2m_timesFr"), ze(t, "g2m_batchApplyKeyMixed", "g2m", "frm", d * 2 * 2, d * 3 * 2, E, "g2m_timesFrAffine");
   function F(f) {
     return BigInt(f) * (1n << BigInt(C * 8)) % a;
   }
@@ -7860,7 +7862,7 @@ var Ss = function(t, e) {
     );
   }
   nt();
-  const J = ws(t, v + "_mulNR", "f6m", "f2m");
+  const J = Ts(t, v + "_mulNR", "f6m", "f2m");
   function ft() {
     const f = t.addFunction(J + "_mulNR");
     f.addParam("x", "i32"), f.addParam("pr", "i32");
@@ -8319,7 +8321,7 @@ var Ss = function(t, e) {
         (st * ot - rt * gt) % a,
         (st * gt + rt * ot) % a
       ];
-      return xs(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
+      return Ms(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
     }
   }
   function Jt() {
@@ -8396,7 +8398,7 @@ var Ss = function(t, e) {
       _.call(v + "_add", Ut, Ft, Ft)
     );
   }
-  function se(f, _, Z) {
+  function re(f, _, Z) {
     const Q = it(f).map((ot) => ot == -1 ? 255 : ot), $ = t.alloc(Q), tt = t.addFunction(n + "__cyclotomicExp_" + Z);
     tt.addParam("x", "i32"), tt.addParam("r", "i32"), tt.addLocal("bit", "i32"), tt.addLocal("i", "i32");
     const V = tt.getCodeBuilder(), ct = V.getLocal("x"), st = V.getLocal("r"), rt = V.i32_const(t.alloc(o));
@@ -8437,7 +8439,7 @@ var Ss = function(t, e) {
     );
   }
   function te() {
-    Jt(), se(b, z, "w0");
+    Jt(), re(b, z, "w0");
     const f = t.addFunction(n + "_finalExponentiation");
     f.addParam("x", "i32"), f.addParam("r", "i32");
     const _ = f.getCodeBuilder(), Z = _.getLocal("x"), Q = _.getLocal("r"), $ = _.i32_const(t.alloc(o)), tt = _.i32_const(t.alloc(o)), V = _.i32_const(t.alloc(o)), ct = _.i32_const(t.alloc(o)), st = _.i32_const(t.alloc(o)), rt = _.i32_const(t.alloc(o)), ot = _.i32_const(t.alloc(o));
@@ -8550,7 +8552,7 @@ var Ss = function(t, e) {
     ])), V = _.i32_const(t.alloc(Mt.bigInt2BytesLE(F(Q), d))), ct = _.i32_const(t.alloc([
       ...Mt.bigInt2BytesLE(F($[0]), d),
       ...Mt.bigInt2BytesLE(F($[1]), d)
-    ])), st = _.i32_const(t.alloc(Mt.bigInt2BytesLE(b, 8))), rt = _.getLocal("p"), ot = _.i32_add(_.getLocal("p"), _.i32_const(l)), gt = _.i32_const(t.alloc(C)), Bt = _.i32_const(t.alloc(l)), Ft = _.i32_const(t.alloc(l)), ht = t.alloc(l * 2), xt = _.i32_const(ht), Tt = _.i32_const(ht), Ut = _.i32_const(ht), St = _.i32_const(ht + C), kt = _.i32_const(ht + l), k = _.i32_const(ht + l), et = _.i32_const(ht + l + C), dt = t.alloc(l * 3), qt = _.i32_const(dt), Ht = _.i32_const(dt), Qt = _.i32_const(dt), Kt = _.i32_const(dt + C), de = _.i32_const(dt + l), ye = _.i32_const(dt + l), ke = _.i32_const(dt + l + C), _n = _.i32_const(dt + l * 2);
+    ])), st = _.i32_const(t.alloc(Mt.bigInt2BytesLE(b, 8))), rt = _.getLocal("p"), ot = _.i32_add(_.getLocal("p"), _.i32_const(l)), gt = _.i32_const(t.alloc(C)), Bt = _.i32_const(t.alloc(l)), Ft = _.i32_const(t.alloc(l)), ht = t.alloc(l * 2), xt = _.i32_const(ht), Tt = _.i32_const(ht), Ut = _.i32_const(ht), St = _.i32_const(ht + C), kt = _.i32_const(ht + l), k = _.i32_const(ht + l), et = _.i32_const(ht + l + C), dt = t.alloc(l * 3), qt = _.i32_const(dt), Ht = _.i32_const(dt), Qt = _.i32_const(dt), Kt = _.i32_const(dt + C), fe = _.i32_const(dt + l), Ce = _.i32_const(dt + l), qe = _.i32_const(dt + l + C), gn = _.i32_const(dt + l * 2);
     f.addCode(
       _.if(
         _.call(w + "_isZeroAffine", _.getLocal("p")),
@@ -8565,7 +8567,7 @@ var Ss = function(t, e) {
       _.call(v + "_mul1", Bt, V, Tt),
       _.call(v + "_neg", Ft, kt),
       _.call(v + "_neg", Bt, Ht),
-      _.call(v + "_mul", Ft, ct, de),
+      _.call(v + "_mul", Ft, ct, fe),
       _.call(O + "_sub", Ut, St, gt),
       _.call(O + "_add", Ut, St, St),
       _.call(O + "_copy", gt, Ut),
@@ -8575,23 +8577,23 @@ var Ss = function(t, e) {
       _.call(O + "_add", Qt, Kt, gt),
       _.call(O + "_sub", Qt, Kt, Kt),
       _.call(O + "_copy", gt, Qt),
-      _.call(O + "_sub", ke, ye, gt),
-      _.call(O + "_add", ye, ke, ke),
-      _.call(O + "_copy", gt, ye),
-      _.call(v + "_one", _n),
+      _.call(O + "_sub", qe, Ce, gt),
+      _.call(O + "_add", Ce, qe, qe),
+      _.call(O + "_copy", gt, Ce),
+      _.call(v + "_one", gn),
       _.call(w + "_timesScalar", qt, st, _.i32_const(8), qt),
       _.call(w + "_addMixed", qt, xt, qt),
       _.ret(
         _.call(w + "_eqMixed", qt, _.getLocal("p"))
       )
     );
-    const ve = t.addFunction(w + "_inGroup");
-    ve.addParam("pIn", "i32"), ve.setReturnType("i32");
-    const Ce = ve.getCodeBuilder(), He = Ce.i32_const(t.alloc(l * 2));
-    ve.addCode(
-      Ce.call(w + "_toAffine", Ce.getLocal("pIn"), He),
-      Ce.ret(
-        Ce.call(w + "_inGroupAffine", He)
+    const xe = t.addFunction(w + "_inGroup");
+    xe.addParam("pIn", "i32"), xe.setReturnType("i32");
+    const Ae = xe.getCodeBuilder(), Je = Ae.i32_const(t.alloc(l * 2));
+    xe.addCode(
+      Ae.call(w + "_toAffine", Ae.getLocal("pIn"), Je),
+      Ae.ret(
+        Ae.call(w + "_inGroupAffine", Je)
       )
     );
   }
@@ -8636,12 +8638,12 @@ var Ss = function(t, e) {
   for (let f = 1; f <= 5; f++)
     vt(f), t.exportFunction(n + "_pairingEq" + f);
   Wt(), t.exportFunction(n + "_pairing"), t.exportFunction(n + "_prepareG1"), t.exportFunction(n + "_prepareG2"), t.exportFunction(n + "_millerLoop"), t.exportFunction(n + "_finalExponentiation"), t.exportFunction(n + "_finalExponentiationOld"), t.exportFunction(n + "__cyclotomicSquare"), t.exportFunction(n + "__cyclotomicExp_w0"), t.exportFunction(J + "_mul1"), t.exportFunction(J + "_mul01"), t.exportFunction(at + "_mul014"), t.exportFunction(I + "_inGroupAffine"), t.exportFunction(I + "_inGroup"), t.exportFunction(w + "_inGroupAffine"), t.exportFunction(w + "_inGroup");
-}, Is = As, Os = Ss;
+}, Ns = Os, zs = Rs;
 function Pn(c) {
   if (typeof c == "bigint" || c.eq !== void 0)
     return c.toString(10);
   if (c instanceof Uint8Array)
-    return $e(c, 0);
+    return Ze(c, 0);
   if (Array.isArray(c))
     return c.map(Pn);
   if (typeof c == "object") {
@@ -8669,14 +8671,14 @@ function kn(c) {
   } else
     return c;
 }
-function Ps(c) {
+function Us(c) {
   let t = BigInt(0), e = c.length, n = 0;
   const a = new DataView(c.buffer, c.byteOffset, c.byteLength);
   for (; e > 0; )
     e >= 4 ? (e -= 4, t += BigInt(a.getUint32(e)) << BigInt(n * 8), n += 4) : e >= 2 ? (e -= 2, t += BigInt(a.getUint16(e)) << BigInt(n * 8), n += 2) : (e -= 1, t += BigInt(a.getUint8(e)) << BigInt(n * 8), n += 1);
   return t;
 }
-function ks(c, t) {
+function js(c, t) {
   let e = c;
   const n = new Uint8Array(t), a = new DataView(n.buffer);
   let s = t;
@@ -8686,16 +8688,16 @@ function ks(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function Ts(c) {
+function $s(c) {
   let t = BigInt(0), e = 0;
   const n = new DataView(c.buffer, c.byteOffset, c.byteLength);
   for (; e < c.length; )
     e + 4 <= c.length ? (t += BigInt(n.getUint32(e, !0)) << BigInt(e * 8), e += 4) : e + 2 <= c.length ? (t += BigInt(n.getUint16(e, !0)) << BigInt(e * 8), e += 2) : (t += BigInt(n.getUint8(e, !0)) << BigInt(e * 8), e += 1);
   return t;
 }
-function Si(c, t) {
+function Oi(c, t) {
   let e = c;
-  typeof t > "u" && (t = Math.floor((We(c) - 1) / 8) + 1, t == 0 && (t = 1));
+  typeof t > "u" && (t = Math.floor((Ve(c) - 1) / 8) + 1, t == 0 && (t = 1));
   const n = new Uint8Array(t), a = new DataView(n.buffer);
   let s = 0;
   for (; s < t; )
@@ -8736,27 +8738,27 @@ function qn(c, t) {
   } else
     return t;
 }
-const ze = [];
+const je = [];
 for (let c = 0; c < 256; c++)
-  ze[c] = qs(c, 8);
-function qs(c, t) {
+  je[c] = Gs(c, 8);
+function Gs(c, t) {
   let e = 0, n = c;
   for (let a = 0; a < t; a++)
     e <<= 1, e = e | n & 1, n >>= 1;
   return e;
 }
-function Ii(c, t) {
-  return (ze[c >>> 24] | ze[c >>> 16 & 255] << 8 | ze[c >>> 8 & 255] << 16 | ze[c & 255] << 24) >>> 32 - t;
+function Pi(c, t) {
+  return (je[c >>> 24] | je[c >>> 16 & 255] << 8 | je[c >>> 8 & 255] << 16 | je[c & 255] << 24) >>> 32 - t;
 }
-function le(c) {
+function ue(c) {
   return (c & 4294901760 ? (c &= 4294901760, 16) : 0) | (c & 4278255360 ? (c &= 4278255360, 8) : 0) | (c & 4042322160 ? (c &= 4042322160, 4) : 0) | (c & 3435973836 ? (c &= 3435973836, 2) : 0) | (c & 2863311530) !== 0;
 }
-function Oi(c, t) {
-  const e = c.byteLength / t, n = le(e);
+function ki(c, t) {
+  const e = c.byteLength / t, n = ue(e);
   if (e != 1 << n)
     throw new Error("Invalid number of pointers");
   for (let a = 0; a < e; a++) {
-    const s = Ii(a, n);
+    const s = Pi(a, n);
     if (a > s) {
       const g = c.slice(a * t, (a + 1) * t);
       c.set(c.slice(s * t, (s + 1) * t), a * t), c.set(g, s * t);
@@ -8769,47 +8771,47 @@ function Jn(c, t) {
     e.set(c[n], n * t);
   return e;
 }
-function nn(c, t) {
+function on(c, t) {
   const e = c.byteLength / t, n = new Array(e);
   for (let a = 0; a < e; a++)
     n[a] = c.slice(a * t, a * t + t);
   return n;
 }
-const Ds = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Zs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   array2buffer: Jn,
-  beBuff2int: Ps,
-  beInt2Buff: ks,
-  bitReverse: Ii,
-  buffReverseBits: Oi,
-  buffer2array: nn,
-  leBuff2int: Ts,
-  leInt2Buff: Si,
-  log2: le,
+  beBuff2int: Us,
+  beInt2Buff: js,
+  bitReverse: Pi,
+  buffReverseBits: ki,
+  buffer2array: on,
+  leBuff2int: $s,
+  leInt2Buff: Oi,
+  log2: ue,
   stringifyBigInts: Pn,
   stringifyFElements: Tn,
   unstringifyBigInts: kn,
   unstringifyFElements: qn
-}, Symbol.toStringTag, { value: "Module" })), ce = 1 << 30;
+}, Symbol.toStringTag, { value: "Module" })), se = 1 << 30;
 class Vt {
   constructor(t) {
     this.buffers = [], this.byteLength = t;
-    for (let e = 0; e < t; e += ce) {
-      const n = Math.min(t - e, ce);
+    for (let e = 0; e < t; e += se) {
+      const n = Math.min(t - e, se);
       this.buffers.push(new Uint8Array(n));
     }
   }
   slice(t, e) {
     e === void 0 && (e = this.byteLength), t === void 0 && (t = 0);
-    const n = e - t, a = Math.floor(t / ce), s = Math.floor((t + n - 1) / ce);
+    const n = e - t, a = Math.floor(t / se), s = Math.floor((t + n - 1) / se);
     if (a == s || n == 0)
-      return this.buffers[a].slice(t % ce, t % ce + n);
-    let g, d = a, C = t % ce, l = n;
+      return this.buffers[a].slice(t % se, t % se + n);
+    let g, d = a, C = t % se, l = n;
     for (; l > 0; ) {
-      const o = C + l > ce ? ce - C : l, y = new Uint8Array(this.buffers[d].buffer, this.buffers[d].byteOffset + C, o);
+      const o = C + l > se ? se - C : l, y = new Uint8Array(this.buffers[d].buffer, this.buffers[d].byteOffset + C, o);
       if (o == n)
         return y.slice();
-      g || (n <= ce ? g = new Uint8Array(n) : g = new Vt(n)), g.set(y, n - l), l = l - o, d++, C = 0;
+      g || (n <= se ? g = new Uint8Array(n) : g = new Vt(n)), g.set(y, n - l), l = l - o, d++, C = 0;
     }
     return g;
   }
@@ -8818,17 +8820,17 @@ class Vt {
     const n = t.byteLength;
     if (n == 0)
       return;
-    const a = Math.floor(e / ce), s = Math.floor((e + n - 1) / ce);
+    const a = Math.floor(e / se), s = Math.floor((e + n - 1) / se);
     if (a == s)
-      return t instanceof Vt && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % ce) : this.buffers[a].set(t, e % ce);
-    let g = a, d = e % ce, C = n;
+      return t instanceof Vt && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % se) : this.buffers[a].set(t, e % se);
+    let g = a, d = e % se, C = n;
     for (; C > 0; ) {
-      const l = d + C > ce ? ce - d : C, o = t.slice(n - C, n - C + l);
+      const l = d + C > se ? se - d : C, o = t.slice(n - C, n - C + l);
       new Uint8Array(this.buffers[g].buffer, this.buffers[g].byteOffset + d, l).set(o), C = C - l, g++, d = 0;
     }
   }
 }
-function me(c, t, e, n) {
+function be(c, t, e, n) {
   return async function(s) {
     const g = Math.floor(s.byteLength / e);
     if (g * e !== s.byteLength)
@@ -8863,22 +8865,22 @@ function me(c, t, e, n) {
 }
 class xa {
   constructor(t, e, n, a) {
-    if (this.tm = t, this.prefix = e, this.p = a, this.n8 = n, this.type = "F1", this.m = 1, this.half = xe(a, Ee), this.bitLength = We(a), this.mask = he(tn(Ee, this.bitLength), Ee), this.pOp1 = t.alloc(n), this.pOp2 = t.alloc(n), this.pOp3 = t.alloc(n), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, this.n8), this.tm.instance.exports[e + "_one"](this.pOp1), this.one = this.tm.getBuff(this.pOp1, this.n8), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.n64 = Math.floor(n / 8), this.n32 = Math.floor(n / 4), this.n64 * 8 != this.n8)
+    if (this.tm = t, this.prefix = e, this.p = a, this.n8 = n, this.type = "F1", this.m = 1, this.half = Ie(a, we), this.bitLength = Ve(a), this.mask = Le(nn(we, this.bitLength), we), this.pOp1 = t.alloc(n), this.pOp2 = t.alloc(n), this.pOp3 = t.alloc(n), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, this.n8), this.tm.instance.exports[e + "_one"](this.pOp1), this.one = this.tm.getBuff(this.pOp1, this.n8), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.n64 = Math.floor(n / 8), this.n32 = Math.floor(n / 4), this.n64 * 8 != this.n8)
       throw new Error("n8 must be a multiple of 8");
-    this.half = xe(this.p, Ee), this.nqr = this.two;
+    this.half = Ie(this.p, we), this.nqr = this.two;
     let s = this.exp(this.nqr, this.half);
     for (; !this.eq(s, this.negone); )
       this.nqr = this.add(this.nqr, this.one), s = this.exp(this.nqr, this.half);
     this.shift = this.mul(this.nqr, this.nqr), this.shiftInv = this.inv(this.shift), this.s = 0;
-    let g = he(this.p, Ee);
+    let g = Le(this.p, we);
     for (; !jn(g); )
-      this.s = this.s + 1, g = xe(g, Ee);
+      this.s = this.s + 1, g = Ie(g, we);
     this.w = [], this.w[this.s] = this.exp(this.nqr, g);
     for (let d = this.s - 1; d >= 0; d--)
       this.w[d] = this.square(this.w[d + 1]);
     if (!this.eq(this.w[0], this.one))
       throw new Error("Error calculating roots of unity");
-    this.batchToMontgomery = me(t, e + "_batchToMontgomery", this.n8, this.n8), this.batchFromMontgomery = me(t, e + "_batchFromMontgomery", this.n8, this.n8);
+    this.batchToMontgomery = be(t, e + "_batchToMontgomery", this.n8, this.n8), this.batchFromMontgomery = be(t, e + "_batchFromMontgomery", this.n8, this.n8);
   }
   op2(t, e, n) {
     return this.tm.setBuff(this.pOp1, e), this.tm.setBuff(this.pOp2, n), this.tm.instance.exports[this.prefix + t](this.pOp1, this.pOp2, this.pOp3), this.tm.getBuff(this.pOp3, this.n8);
@@ -8932,7 +8934,7 @@ class xa {
     return this.op1("_sqrt", t);
   }
   exp(t, e) {
-    return e instanceof Uint8Array || (e = Ie(ee(e))), this.tm.setBuff(this.pOp1, t), this.tm.setBuff(this.pOp2, e), this.tm.instance.exports[this.prefix + "_exp"](this.pOp1, this.pOp2, e.byteLength, this.pOp3), this.tm.getBuff(this.pOp3, this.n8);
+    return e instanceof Uint8Array || (e = Pe(ee(e))), this.tm.setBuff(this.pOp1, t), this.tm.setBuff(this.pOp2, e), this.tm.instance.exports[this.prefix + "_exp"](this.pOp1, this.pOp2, e.byteLength, this.pOp3), this.tm.getBuff(this.pOp3, this.n8);
   }
   isNegative(t) {
     return this.op1Bool("_isNegative", t);
@@ -8941,35 +8943,35 @@ class xa {
     if (t instanceof Uint8Array)
       return t;
     let n = ee(t, e);
-    ai(n) ? (n = si(n), On(n, this.p) && (n = _e(n, this.p)), n = he(this.p, n)) : On(n, this.p) && (n = _e(n, this.p));
-    const a = Si(n, this.n8);
+    oi(n) ? (n = li(n), On(n, this.p) && (n = ge(n, this.p)), n = Le(this.p, n)) : On(n, this.p) && (n = ge(n, this.p));
+    const a = Oi(n, this.n8);
     return this.toMontgomery(a);
   }
   toString(t, e) {
-    const n = this.fromMontgomery(t), a = $e(n, 0);
-    return fi(a, e);
+    const n = this.fromMontgomery(t), a = Ze(n, 0);
+    return gi(a, e);
   }
   fromRng(t) {
     let e;
     const n = new Uint8Array(this.n8);
     do {
-      e = _i;
+      e = pi;
       for (let a = 0; a < this.n64; a++)
-        e = $n(e, tn(t.nextU64(), 64 * a));
+        e = $n(e, nn(t.nextU64(), 64 * a));
       e = Gn(e, this.mask);
-    } while (li(e, this.p));
-    return je(n, 0, e, this.n8), n;
+    } while (di(e, this.p));
+    return Ge(n, 0, e, this.n8), n;
   }
   random() {
     return this.fromRng(Zn());
   }
   toObject(t) {
     const e = this.fromMontgomery(t);
-    return $e(e, 0);
+    return Ze(e, 0);
   }
   fromObject(t) {
     const e = new Uint8Array(this.n8);
-    return je(e, 0, t, this.n8), this.toMontgomery(e);
+    return Ge(e, 0, t, this.n8), this.toMontgomery(e);
   }
   toRprLE(t, e, n) {
     t.set(this.fromMontgomery(n), e);
@@ -9021,7 +9023,7 @@ class xa {
     let o = 0;
     for (let y = 0; y < C.length; y++)
       l.set(C[y][0], o), o += C[y][0].byteLength;
-    return e ? nn(l, a) : l;
+    return e ? on(l, a) : l;
   }
 }
 class Sa {
@@ -9086,7 +9088,7 @@ class Sa {
     return this.op1("_sqrt", t);
   }
   exp(t, e) {
-    return e instanceof Uint8Array || (e = Ie(ee(e))), this.tm.setBuff(this.pOp1, t), this.tm.setBuff(this.pOp2, e), this.tm.instance.exports[this.prefix + "_exp"](this.pOp1, this.pOp2, e.byteLength, this.pOp3), this.tm.getBuff(this.pOp3, this.n8);
+    return e instanceof Uint8Array || (e = Pe(ee(e))), this.tm.setBuff(this.pOp1, t), this.tm.setBuff(this.pOp2, e), this.tm.instance.exports[this.prefix + "_exp"](this.pOp1, this.pOp2, e.byteLength, this.pOp3), this.tm.getBuff(this.pOp3, this.n8);
   }
   e(t, e) {
     if (t instanceof Uint8Array)
@@ -9123,7 +9125,7 @@ class Sa {
     return t.slice(this.F.n8);
   }
 }
-class Ms {
+class Ws {
   constructor(t, e, n) {
     this.tm = t, this.prefix = e, this.F = n, this.type = "F3", this.m = n.m * 3, this.n8 = this.F.n8 * 3, this.n32 = this.F.n32 * 3, this.n64 = this.F.n64 * 3, this.pOp1 = t.alloc(n.n8 * 3), this.pOp2 = t.alloc(n.n8 * 3), this.pOp3 = t.alloc(n.n8 * 3), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = t.getBuff(this.pOp1, this.n8), this.tm.instance.exports[e + "_one"](this.pOp1), this.one = t.getBuff(this.pOp1, this.n8), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one);
   }
@@ -9182,7 +9184,7 @@ class Ms {
     return this.op1("_sqrt", t);
   }
   exp(t, e) {
-    return e instanceof Uint8Array || (e = Ie(ee(e))), this.tm.setBuff(this.pOp1, t), this.tm.setBuff(this.pOp2, e), this.tm.instance.exports[this.prefix + "_exp"](this.pOp1, this.pOp2, e.byteLength, this.pOp3), this.getBuff(this.pOp3, this.n8);
+    return e instanceof Uint8Array || (e = Pe(ee(e))), this.tm.setBuff(this.pOp1, t), this.tm.setBuff(this.pOp2, e), this.tm.instance.exports[this.prefix + "_exp"](this.pOp1, this.pOp2, e.byteLength, this.pOp3), this.getBuff(this.pOp3, this.n8);
   }
   e(t, e) {
     if (t instanceof Uint8Array)
@@ -9224,7 +9226,7 @@ class Ms {
 }
 class Ia {
   constructor(t, e, n, a, s, g) {
-    this.tm = t, this.prefix = e, this.F = n, this.pOp1 = t.alloc(n.n8 * 3), this.pOp2 = t.alloc(n.n8 * 3), this.pOp3 = t.alloc(n.n8 * 3), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, n.n8 * 3), this.tm.instance.exports[e + "_zeroAffine"](this.pOp1), this.zeroAffine = this.tm.getBuff(this.pOp1, n.n8 * 2), this.one = this.tm.getBuff(a, n.n8 * 3), this.g = this.one, this.oneAffine = this.tm.getBuff(a, n.n8 * 2), this.gAffine = this.oneAffine, this.b = this.tm.getBuff(s, n.n8), g && (this.cofactor = Ie(g)), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.batchLEMtoC = me(t, e + "_batchLEMtoC", n.n8 * 2, n.n8), this.batchLEMtoU = me(t, e + "_batchLEMtoU", n.n8 * 2, n.n8 * 2), this.batchCtoLEM = me(t, e + "_batchCtoLEM", n.n8, n.n8 * 2), this.batchUtoLEM = me(t, e + "_batchUtoLEM", n.n8 * 2, n.n8 * 2), this.batchToJacobian = me(t, e + "_batchToJacobian", n.n8 * 2, n.n8 * 3), this.batchToAffine = me(t, e + "_batchToAffine", n.n8 * 3, n.n8 * 2);
+    this.tm = t, this.prefix = e, this.F = n, this.pOp1 = t.alloc(n.n8 * 3), this.pOp2 = t.alloc(n.n8 * 3), this.pOp3 = t.alloc(n.n8 * 3), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, n.n8 * 3), this.tm.instance.exports[e + "_zeroAffine"](this.pOp1), this.zeroAffine = this.tm.getBuff(this.pOp1, n.n8 * 2), this.one = this.tm.getBuff(a, n.n8 * 3), this.g = this.one, this.oneAffine = this.tm.getBuff(a, n.n8 * 2), this.gAffine = this.oneAffine, this.b = this.tm.getBuff(s, n.n8), g && (this.cofactor = Pe(g)), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.batchLEMtoC = be(t, e + "_batchLEMtoC", n.n8 * 2, n.n8), this.batchLEMtoU = be(t, e + "_batchLEMtoU", n.n8 * 2, n.n8 * 2), this.batchCtoLEM = be(t, e + "_batchCtoLEM", n.n8, n.n8 * 2), this.batchUtoLEM = be(t, e + "_batchUtoLEM", n.n8 * 2, n.n8 * 2), this.batchToJacobian = be(t, e + "_batchToJacobian", n.n8 * 2, n.n8 * 3), this.batchToAffine = be(t, e + "_batchToAffine", n.n8 * 3, n.n8 * 2);
   }
   op2(t, e, n) {
     return this.tm.setBuff(this.pOp1, e), this.tm.setBuff(this.pOp2, n), this.tm.instance.exports[this.prefix + t](this.pOp1, this.pOp2, this.pOp3), this.tm.getBuff(this.pOp3, this.F.n8 * 3);
@@ -9295,7 +9297,7 @@ class Ia {
     throw new Error("invalid point size");
   }
   timesScalar(t, e) {
-    e instanceof Uint8Array || (e = Ie(ee(e)));
+    e instanceof Uint8Array || (e = Pe(ee(e)));
     let n;
     if (t.byteLength == this.F.n8 * 3)
       n = this.prefix + "_timesScalar";
@@ -9451,7 +9453,7 @@ class Ia {
     return this.toAffine(t).slice(this.F.n8);
   }
 }
-function Pi(c) {
+function Ti(c) {
   let e, n;
   c && (c.onmessage = function(o) {
     let y;
@@ -9535,7 +9537,52 @@ function Pi(c) {
   }
   return l;
 }
-const Rs = Worker, Cn = 25;
+var ie = {};
+ie.endianness = function() {
+  return "LE";
+};
+ie.hostname = function() {
+  return typeof location < "u" ? location.hostname : "";
+};
+ie.loadavg = function() {
+  return [];
+};
+ie.uptime = function() {
+  return 0;
+};
+ie.freemem = function() {
+  return Number.MAX_VALUE;
+};
+ie.totalmem = function() {
+  return Number.MAX_VALUE;
+};
+ie.cpus = function() {
+  return [];
+};
+ie.type = function() {
+  return "Browser";
+};
+ie.release = function() {
+  return typeof navigator < "u" ? navigator.appVersion : "";
+};
+ie.networkInterfaces = ie.getNetworkInterfaces = function() {
+  return {};
+};
+ie.arch = function() {
+  return "javascript";
+};
+ie.platform = function() {
+  return "browser";
+};
+ie.tmpdir = ie.tmpDir = function() {
+  return "/tmp";
+};
+ie.EOL = `
+`;
+ie.homedir = function() {
+  return "/";
+};
+const Xs = Worker, An = 25;
 class Oa {
   constructor() {
     this.promise = new Promise((t, e) => {
@@ -9543,39 +9590,39 @@ class Oa {
     });
   }
 }
-function Ns(c) {
+function Vs(c) {
   return new Promise((t) => setTimeout(t, c));
 }
-function zs(c) {
-  return process.browser ? globalThis.btoa(c) : Buffer.from(c).toString("base64");
+function Hs(c) {
+  return Se.browser ? globalThis.btoa(c) : Lo.from(c).toString("base64");
 }
-const Us = zs("(" + Pi.toString() + ")(self)"), js = "data:application/javascript;base64," + Us;
-async function $s(c, t) {
-  const e = new Gs();
-  e.memory = new WebAssembly.Memory({ initial: Cn }), e.u8 = new Uint8Array(e.memory.buffer), e.u32 = new Uint32Array(e.memory.buffer);
+const Qs = Hs("(" + Ti.toString() + ")(self)"), Js = "data:application/javascript;base64," + Qs;
+async function Ks(c, t) {
+  const e = new Ys();
+  e.memory = new WebAssembly.Memory({ initial: An }), e.u8 = new Uint8Array(e.memory.buffer), e.u32 = new Uint32Array(e.memory.buffer);
   const n = await WebAssembly.compile(c.code);
   if (e.instance = await WebAssembly.instantiate(n, {
     env: {
       memory: e.memory
     }
   }), e.singleThread = t, e.initalPFree = e.u32[0], e.pq = c.pq, e.pr = c.pr, e.pG1gen = c.pG1gen, e.pG1zero = c.pG1zero, e.pG2gen = c.pG2gen, e.pG2zero = c.pG2zero, e.pOneT = c.pOneT, t)
-    e.code = c.code, e.taskManager = Pi(), await e.taskManager([{
+    e.code = c.code, e.taskManager = Ti(), await e.taskManager([{
       cmd: "INIT",
-      init: Cn,
+      init: An,
       code: e.code.slice()
     }]), e.concurrency = 1;
   else {
     e.workers = [], e.pendingDeferreds = [], e.working = [];
     let s;
-    typeof navigator == "object" && navigator.hardwareConcurrency ? s = navigator.hardwareConcurrency : s = on.cpus().length, s == 0 && (s = 2), s > 64 && (s = 64), e.concurrency = s;
+    typeof navigator == "object" && navigator.hardwareConcurrency ? s = navigator.hardwareConcurrency : s = ie.cpus().length, s == 0 && (s = 2), s > 64 && (s = 64), e.concurrency = s;
     for (let d = 0; d < s; d++)
-      e.workers[d] = new Rs(js), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
+      e.workers[d] = new Xs(Js), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
     const g = [];
     for (let d = 0; d < e.workers.length; d++) {
       const C = c.code.slice();
       g.push(e.postAction(d, [{
         cmd: "INIT",
-        init: Cn,
+        init: An,
         code: C
       }], [C.buffer]));
     }
@@ -9589,7 +9636,7 @@ async function $s(c, t) {
     };
   }
 }
-class Gs {
+class Ys {
   constructor() {
     this.actionQueue = [], this.oldPFree = 0;
   }
@@ -9650,10 +9697,10 @@ class Gs {
   async terminate() {
     for (let t = 0; t < this.workers.length; t++)
       this.workers[t].postMessage([{ cmd: "TERMINATE" }]);
-    await Ns(200);
+    await Vs(200);
   }
 }
-function An(c, t) {
+function Fn(c, t) {
   const e = c[t], n = c.Fr, a = c.tm;
   c[t].batchApplyKey = async function(s, g, d, C, l) {
     C = C || "affine", l = l || "affine";
@@ -9707,7 +9754,7 @@ function An(c, t) {
     return w;
   };
 }
-function Zs(c) {
+function tr(c) {
   const t = c.tm;
   c.pairing = function(n, a) {
     t.startSyncOp();
@@ -9829,7 +9876,7 @@ function ka(c, t) {
     const x = Math.floor(d.byteLength / m);
     if (x * m != d.byteLength)
       throw new Error("Scalar size does not match");
-    const O = Pa[le(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
+    const O = Pa[ue(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
     for (let w = 0; w < L; w++) {
       const S = [
         { cmd: "ALLOCSET", var: 0, buff: g },
@@ -9871,7 +9918,7 @@ function ka(c, t) {
     const x = Math.floor(g.byteLength / m), O = Math.floor(d.byteLength / x);
     if (O * x != d.byteLength)
       throw new Error("Scalar size does not match");
-    const L = Pa[le(x)], I = Math.floor((O * 8 - 1) / L) + 1;
+    const L = Pa[ue(x)], I = Math.floor((O * 8 - 1) / L) + 1;
     let v;
     v = Math.floor(x / (n.concurrency / I)), v > 4194304 && (v = 4194304), v < 1024 && (v = 1024);
     const U = [];
@@ -9892,7 +9939,7 @@ function ka(c, t) {
     return await s(d, C, "affine", l, o);
   };
 }
-function Fn(c, t) {
+function En(c, t) {
   const e = c[t], n = c.Fr, a = e.tm;
   async function s(l, o, y, E, m, x) {
     y = y || "affine", E = E || "affine";
@@ -9901,21 +9948,21 @@ function Fn(c, t) {
     t == "G1" ? (y == "affine" ? (L = e.F.n8 * 2, U = "g1m_batchToJacobian") : L = e.F.n8 * 3, I = e.F.n8 * 3, o && (r = "g1m_fftFinal"), F = "g1m_fftJoin", S = "g1m_fftMix", E == "affine" ? (v = e.F.n8 * 2, w = "g1m_batchToAffine") : v = e.F.n8 * 3) : t == "G2" ? (y == "affine" ? (L = e.F.n8 * 2, U = "g2m_batchToJacobian") : L = e.F.n8 * 3, I = e.F.n8 * 3, o && (r = "g2m_fftFinal"), F = "g2m_fftJoin", S = "g2m_fftMix", E == "affine" ? (v = e.F.n8 * 2, w = "g2m_batchToAffine") : v = e.F.n8 * 3) : t == "Fr" && (L = e.n8, I = e.n8, v = e.n8, o && (r = "frm_fftFinal"), S = "frm_fftMix", F = "frm_fftJoin");
     let h = !1;
     Array.isArray(l) ? (l = Jn(l, L), h = !0) : l = l.slice(0, l.byteLength);
-    const R = l.byteLength / L, j = le(R);
+    const R = l.byteLength / L, j = ue(R);
     if (1 << j != R)
       throw new Error("fft must be multiple of 2");
     if (j == n.s + 1) {
       let J;
-      return o ? J = await d(l, y, E, m, x) : J = await g(l, y, E, m, x), h ? nn(J, v) : J;
+      return o ? J = await d(l, y, E, m, x) : J = await g(l, y, E, m, x), h ? on(J, v) : J;
     }
     let T;
     o && (T = n.inv(n.e(R)));
     let D;
-    Oi(l, L);
+    ki(l, L);
     let A, M = Math.min(1 << O, R), H = R / M;
     for (; H < a.concurrency && M >= 16; )
       H *= 2, M /= 2;
-    const ut = le(M), nt = [];
+    const ut = ue(M), nt = [];
     for (let J = 0; J < H; J++) {
       m && m.debug(`${x}: fft ${j} mix start: ${J}/${H}`);
       const ft = [];
@@ -9971,7 +10018,7 @@ function Fn(c, t) {
     } else
       for (let J = 0; J < H; J++)
         D.set(A[J], M * v * J), delete A[J];
-    return h ? nn(D, v) : D;
+    return h ? on(D, v) : D;
   }
   async function g(l, o, y, E, m) {
     let x, O;
@@ -10004,7 +10051,7 @@ function Fn(c, t) {
     if (l.byteLength != o.byteLength)
       throw new Error("Invalid buffer size");
     const j = Math.floor(l.byteLength / h);
-    if (j != 1 << le(j))
+    if (j != 1 << ue(j))
       throw new Error("Invalid number of points");
     let T = Math.floor(j / a.concurrency);
     T < 16 && (T = 16), T > 65536 && (T = 65536);
@@ -10046,7 +10093,7 @@ function Fn(c, t) {
       x = n.n8;
     else
       throw new Error("Invalid group");
-    const O = l.byteLength / x, L = le(O);
+    const O = l.byteLength / x, L = ue(O);
     if (2 ** L * x != l.byteLength)
       throw E && E.error("lagrangeEvaluations iinvalid input size"), new Error("lagrangeEvaluations invalid Input size");
     if (L <= n.s)
@@ -10071,10 +10118,10 @@ function Fn(c, t) {
       E = "frm_fftMix", m = "frm_fftJoin";
     else
       throw new Error("Invalid group");
-    const x = Math.floor(o.byteLength / y), O = le(x);
-    let L = 1 << le(a.concurrency);
+    const x = Math.floor(o.byteLength / y), O = ue(x);
+    let L = 1 << ue(a.concurrency);
     x <= L * 2 && (L = 1);
-    const I = x / L, v = le(I), U = [];
+    const I = x / L, v = ue(I), U = [];
     for (let h = 0; h < L; h++) {
       const R = [], j = o.slice(h * I * y, (h + 1) * I * y);
       R.push({ cmd: "ALLOCSET", var: 0, buff: j });
@@ -10131,9 +10178,9 @@ function Fn(c, t) {
     if (o.byteLength != y.byteLength)
       throw new Error("Invalid buffer size");
     const L = Math.floor(o.byteLength / x);
-    if (L != 1 << le(L))
+    if (L != 1 << ue(L))
       throw new Error("Invalid number of points");
-    let I = 1 << le(a.concurrency);
+    let I = 1 << ue(a.concurrency);
     L <= I * 2 && (I = 1);
     const v = L / I, U = [];
     for (let h = 0; h < I; h++) {
@@ -10165,7 +10212,7 @@ function Fn(c, t) {
     else
       throw new Error("Invalid group");
     const L = Math.floor(o.byteLength / E);
-    if (L != 1 << le(L))
+    if (L != 1 << ue(L))
       throw new Error("Invalid number of points");
     const I = Math.floor(L / a.concurrency), v = [];
     for (let F = 0; F < a.concurrency; F++) {
@@ -10194,9 +10241,9 @@ function Fn(c, t) {
     return w;
   };
 }
-async function ki(c) {
-  const t = await $s(c.wasm, c.singleThread), e = {};
-  return e.q = ee(c.wasm.q.toString()), e.r = ee(c.wasm.r.toString()), e.name = c.name, e.tm = t, e.prePSize = c.wasm.prePSize, e.preQSize = c.wasm.preQSize, e.Fr = new xa(t, "frm", c.n8r, c.r), e.F1 = new xa(t, "f1m", c.n8q, c.q), e.F2 = new Sa(t, "f2m", e.F1), e.G1 = new Ia(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Ia(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Ms(t, "f6m", e.F2), e.F12 = new Sa(t, "ftm", e.F6), e.Gt = e.F12, An(e, "G1"), An(e, "G2"), An(e, "Fr"), ka(e, "G1"), ka(e, "G2"), Fn(e, "G1"), Fn(e, "G2"), Fn(e, "Fr"), Zs(e), e.array2buffer = function(n, a) {
+async function qi(c) {
+  const t = await Ks(c.wasm, c.singleThread), e = {};
+  return e.q = ee(c.wasm.q.toString()), e.r = ee(c.wasm.r.toString()), e.name = c.name, e.tm = t, e.prePSize = c.wasm.prePSize, e.preQSize = c.wasm.preQSize, e.Fr = new xa(t, "frm", c.n8r, c.r), e.F1 = new xa(t, "f1m", c.n8q, c.q), e.F2 = new Sa(t, "f2m", e.F1), e.G1 = new Ia(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Ia(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Ws(t, "f6m", e.F2), e.F12 = new Sa(t, "ftm", e.F6), e.Gt = e.F12, Fn(e, "G1"), Fn(e, "G2"), Fn(e, "Fr"), ka(e, "G1"), ka(e, "G2"), En(e, "G1"), En(e, "G2"), En(e, "Fr"), tr(e), e.array2buffer = function(n, a) {
     const s = new Uint8Array(a * n.length);
     for (let g = 0; g < n.length; g++)
       s.set(n[g], g * a);
@@ -10208,23 +10255,23 @@ async function ki(c) {
     return g;
   }, e;
 }
-function Pe(c) {
+function Te(c) {
   return BigInt(c);
 }
-function Ti(c) {
+function Di(c) {
   return c < 0n;
 }
-function Ws(c) {
+function er(c) {
   return c === 0n;
 }
-function Xs(c) {
-  return Ti(c) ? c.toString(2).length - 1 : c.toString(2).length;
+function nr(c) {
+  return Di(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
-function En(c) {
-  const t = [], e = Pe(c);
+function wn(c) {
+  const t = [], e = Te(c);
   return t.push(Number(e & 0xFFn)), t.push(Number(e >> 8n & 0xFFn)), t.push(Number(e >> 16n & 0xFFn)), t.push(Number(e >> 24n & 0xFFn)), t;
 }
-function Vs(c) {
+function ar(c) {
   for (var t = [], e = 0; e < c.length; e++) {
     var n = c.charCodeAt(e);
     n < 128 ? t.push(n) : n < 2048 ? t.push(
@@ -10243,57 +10290,57 @@ function Vs(c) {
   }
   return t;
 }
-function Ne(c) {
-  const t = Vs(c);
+function Ue(c) {
+  const t = ar(c);
   return [...Rt(t.length), ...t];
 }
-function qi(c) {
+function Mi(c) {
   const t = [];
-  let e = Pe(c);
-  if (Ti(e))
+  let e = Te(c);
+  if (Di(e))
     throw new Error("Number cannot be negative");
-  for (; !Ws(e); )
+  for (; !er(e); )
     t.push(Number(e & 0x7Fn)), e = e >> 7n;
   t.length == 0 && t.push(0);
   for (let n = 0; n < t.length - 1; n++)
     t[n] = t[n] | 128;
   return t;
 }
-function Di(c) {
+function Ri(c) {
   let t, e;
-  const n = Xs(c);
-  c < 0 ? (e = !0, t = (1n << BigInt(n)) + c) : (e = !1, t = Pe(c));
-  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = qi(t + s);
+  const n = nr(c);
+  c < 0 ? (e = !0, t = (1n << BigInt(n)) + c) : (e = !1, t = Te(c));
+  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = Mi(t + s);
   return e || (d[d.length - 1] = d[d.length - 1] & g), d;
 }
 function Dn(c) {
-  let t = Pe(c);
+  let t = Te(c);
   if (t > 0xFFFFFFFFn)
     throw new Error("Number too big");
   if (t > 0x7FFFFFFFn && (t = t - 0x100000000n), t < -2147483648n)
     throw new Error("Number too small");
-  return Di(t);
+  return Ri(t);
 }
-function Hs(c) {
-  let t = Pe(c);
+function ir(c) {
+  let t = Te(c);
   if (t > 0xFFFFFFFFFFFFFFFFn)
     throw new Error("Number too big");
   if (t > 0x7FFFFFFFFFFFFFFFn && (t = t - 0x10000000000000000n), t < -9223372036854775808n)
     throw new Error("Number too small");
-  return Di(t);
+  return Ri(t);
 }
 function Rt(c) {
-  let t = Pe(c);
+  let t = Te(c);
   if (t > 0xFFFFFFFFn)
     throw new Error("Number too big");
-  return qi(t);
+  return Mi(t);
 }
 function Ta(c) {
   return Array.from(c, function(t) {
     return ("0" + (t & 255).toString(16)).slice(-2);
   }).join("");
 }
-class Qs {
+class or {
   constructor(t) {
     this.func = t, this.functionName = t.functionName, this.module = t.module;
   }
@@ -10422,7 +10469,7 @@ class Qs {
     return [...t, 26];
   }
   i64_const(t) {
-    return [66, ...Hs(t)];
+    return [66, ...ir(t)];
   }
   i32_const(t) {
     return [65, ...Dn(t)];
@@ -10608,7 +10655,7 @@ class Qs {
     return [];
   }
 }
-const wn = {
+const Bn = {
   i32: 127,
   i64: 126,
   f32: 125,
@@ -10651,13 +10698,13 @@ class qa {
     this.returnType = t;
   }
   getSignature() {
-    const t = [...Rt(this.params.length), ...this.params.map((n) => wn[n.type])], e = this.returnType ? [1, wn[this.returnType]] : [0];
+    const t = [...Rt(this.params.length), ...this.params.map((n) => Bn[n.type])], e = this.returnType ? [1, Bn[this.returnType]] : [0];
     return [96, ...t, ...e];
   }
   getBody() {
     const t = this.locals.map((n) => [
       ...Rt(n.length),
-      wn[n.type]
+      Bn[n.type]
     ]), e = [
       ...Rt(this.locals.length),
       ...[].concat(...t),
@@ -10673,10 +10720,10 @@ class qa {
     this.code.push(...[].concat(...t));
   }
   getCodeBuilder() {
-    return new Qs(this);
+    return new or(this);
   }
 }
-class Mi {
+class Ni {
   constructor() {
     this.functions = [], this.functionIdxByName = {}, this.nImportFunctions = 0, this.nInternalFunctions = 0, this.memory = {
       pagesSize: 1,
@@ -10686,8 +10733,8 @@ class Mi {
   }
   build() {
     return this._setSignatures(), new Uint8Array([
-      ...En(1836278016),
-      ...En(1),
+      ...wn(1836278016),
+      ...wn(1),
       ...this._buildType(),
       ...this._buildImport(),
       ...this._buildFunctionDeclarations(),
@@ -10777,8 +10824,8 @@ class Mi {
   _buildImport() {
     const t = [];
     t.push([
-      ...Ne(this.memory.moduleName),
-      ...Ne(this.memory.fieldName),
+      ...Ue(this.memory.moduleName),
+      ...Ue(this.memory.fieldName),
       2,
       0,
       //Flags no init valua
@@ -10786,8 +10833,8 @@ class Mi {
     ]);
     for (let e = 0; e < this.nImportFunctions; e++)
       t.push([
-        ...Ne(this.functions[e].moduleName),
-        ...Ne(this.functions[e].fieldName),
+        ...Ue(this.functions[e].moduleName),
+        ...Ue(this.functions[e].fieldName),
         0,
         ...Rt(this.functions[e].signatureIdx)
       ]);
@@ -10845,7 +10892,7 @@ class Mi {
     const t = [];
     for (let e = 0; e < this.exports.length; e++)
       t.push([
-        ...Ne(this.exports[e].exportName),
+        ...Ue(this.exports[e].exportName),
         0,
         ...Rt(this.exports[e].idx)
       ]);
@@ -10871,7 +10918,7 @@ class Mi {
       0,
       11,
       4,
-      ...En(this.free)
+      ...wn(this.free)
     ]);
     for (let e = 0; e < this.datas.length; e++)
       t.push([
@@ -10889,9 +10936,9 @@ class Mi {
   }
 }
 globalThis.curve_bn128 = null;
-async function Js(c, t) {
-  const e = new Mi();
-  e.setMemory(25), Is(e), t && t(e);
+async function cr(c, t) {
+  const e = new Ni();
+  e.setMemory(25), Ns(e), t && t(e);
   const n = {};
   if (n.code = e.build(), n.pq = e.modules.f1m.pq, n.pr = e.modules.frm.pq, n.pG1gen = e.modules.bn128.pG1gen, n.pG1zero = e.modules.bn128.pG1zero, n.pG1b = e.modules.bn128.pG1b, n.pG2gen = e.modules.bn128.pG2gen, n.pG2zero = e.modules.bn128.pG2zero, n.pG2b = e.modules.bn128.pG2b, n.pOneT = e.modules.bn128.pOneT, n.prePSize = e.modules.bn128.prePSize, n.preQSize = e.modules.bn128.preQSize, n.n8q = 32, n.n8r = 32, n.q = e.modules.bn128.q, n.r = e.modules.bn128.r, !c && globalThis.curve_bn128)
     return globalThis.curve_bn128;
@@ -10904,15 +10951,15 @@ async function Js(c, t) {
     n8r: 32,
     cofactorG2: ee("30644e72e131a029b85045b68181585e06ceecda572a2489345f2299c0f9fa8d", 16),
     singleThread: !!c
-  }, s = await ki(a);
+  }, s = await qi(a);
   return s.terminate = async function() {
     a.singleThread || (globalThis.curve_bn128 = null, await this.tm.terminate());
   }, c || (globalThis.curve_bn128 = s), s;
 }
 globalThis.curve_bls12381 = null;
-async function Ks(c, t) {
-  const e = new Mi();
-  e.setMemory(25), Os(e), t && t(e);
+async function sr(c, t) {
+  const e = new Ni();
+  e.setMemory(25), zs(e), t && t(e);
   const n = {};
   if (n.code = e.build(), n.pq = e.modules.f1m.pq, n.pr = e.modules.frm.pq, n.pG1gen = e.modules.bls12381.pG1gen, n.pG1zero = e.modules.bls12381.pG1zero, n.pG1b = e.modules.bls12381.pG1b, n.pG2gen = e.modules.bls12381.pG2gen, n.pG2zero = e.modules.bls12381.pG2zero, n.pG2b = e.modules.bls12381.pG2b, n.pOneT = e.modules.bls12381.pOneT, n.prePSize = e.modules.bls12381.prePSize, n.preQSize = e.modules.bls12381.preQSize, n.n8q = 48, n.n8r = 32, n.q = e.modules.bls12381.q, n.r = e.modules.bls12381.r, !c && globalThis.curve_bls12381)
     return globalThis.curve_bls12381;
@@ -10926,7 +10973,7 @@ async function Ks(c, t) {
     cofactorG1: ee("0x396c8c005555e1568c00aaab0000aaab", 16),
     cofactorG2: ee("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5", 16),
     singleThread: !!c
-  }, s = await ki(a);
+  }, s = await qi(a);
   return s.terminate = async function() {
     a.singleThread || (globalThis.curve_bls12381 = null, await this.tm.terminate());
   }, c || (globalThis.curve_bls12381 = s), s;
@@ -10935,109 +10982,109 @@ ee("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 ee("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 ee("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 ee("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Yt = Sc, ln = Ds;
+const Yt = Dc, un = Zs;
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-const Ys = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), tr = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
+const rr = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), lr = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
 async function Kn(c) {
   let t;
-  if (Yt.eq(c, tr))
-    t = await Js();
-  else if (Yt.eq(c, Ys))
-    t = await Ks();
+  if (Yt.eq(c, lr))
+    t = await cr();
+  else if (Yt.eq(c, rr))
+    t = await sr();
   else
     throw new Error(`Curve not supported: ${Yt.toString(c)}`);
   return t;
 }
-function un(c) {
+function dn(c) {
   return (c & 4294901760 ? (c &= 4294901760, 16) : 0) | (c & 4278255360 ? (c &= 4278255360, 8) : 0) | (c & 4042322160 ? (c &= 4042322160, 4) : 0) | (c & 3435973836 ? (c &= 3435973836, 2) : 0) | (c & 2863311530) !== 0;
 }
-const er = 1, nr = 2, Ri = 10, ar = 2;
-async function ue(c, t, e) {
+const ur = 1, dr = 2, zi = 10, fr = 2;
+async function de(c, t, e) {
   const n = await c.read(t.G1.F.n8 * 2), a = t.G1.fromRprLEM(n, 0);
   return e ? t.G1.toObject(a) : a;
 }
-async function Ue(c, t, e) {
+async function $e(c, t, e) {
   const n = await c.read(t.G2.F.n8 * 2), a = t.G2.fromRprLEM(n, 0);
   return e ? t.G2.toObject(a) : a;
 }
-async function ir(c, t, e) {
-  await Ge(c, t, 1);
+async function _r(c, t, e) {
+  await We(c, t, 1);
   const n = await c.readULE32();
-  if (await Ze(c), n === er)
-    return await or(c, t, e);
-  if (n === nr)
-    return await cr(c, t, e);
-  if (n === Ri)
-    return await sr(c, t, e);
+  if (await Xe(c), n === ur)
+    return await gr(c, t, e);
+  if (n === dr)
+    return await pr(c, t, e);
+  if (n === zi)
+    return await hr(c, t, e);
   throw new Error("Protocol not supported: ");
 }
-async function or(c, t, e) {
+async function gr(c, t, e) {
   const n = {};
-  n.protocol = "groth16", await Ge(c, t, 2);
+  n.protocol = "groth16", await We(c, t, 2);
   const a = await c.readULE32();
-  n.n8q = a, n.q = await we(c, a);
+  n.n8q = a, n.q = await Be(c, a);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await we(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.vk_alpha_1 = await ue(c, n.curve, e), n.vk_beta_1 = await ue(c, n.curve, e), n.vk_beta_2 = await Ue(c, n.curve, e), n.vk_gamma_2 = await Ue(c, n.curve, e), n.vk_delta_1 = await ue(c, n.curve, e), n.vk_delta_2 = await Ue(c, n.curve, e), await Ze(c), n;
+  return n.n8r = s, n.r = await Be(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = dn(n.domainSize), n.vk_alpha_1 = await de(c, n.curve, e), n.vk_beta_1 = await de(c, n.curve, e), n.vk_beta_2 = await $e(c, n.curve, e), n.vk_gamma_2 = await $e(c, n.curve, e), n.vk_delta_1 = await de(c, n.curve, e), n.vk_delta_2 = await $e(c, n.curve, e), await Xe(c), n;
 }
-async function cr(c, t, e) {
+async function pr(c, t, e) {
   const n = {};
-  n.protocol = "plonk", await Ge(c, t, 2);
+  n.protocol = "plonk", await We(c, t, 2);
   const a = await c.readULE32();
-  n.n8q = a, n.q = await we(c, a);
+  n.n8q = a, n.q = await Be(c, a);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await we(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstrains = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.Qm = await ue(c, n.curve, e), n.Ql = await ue(c, n.curve, e), n.Qr = await ue(c, n.curve, e), n.Qo = await ue(c, n.curve, e), n.Qc = await ue(c, n.curve, e), n.S1 = await ue(c, n.curve, e), n.S2 = await ue(c, n.curve, e), n.S3 = await ue(c, n.curve, e), n.X_2 = await Ue(c, n.curve, e), await Ze(c), n;
+  return n.n8r = s, n.r = await Be(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = dn(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstrains = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.Qm = await de(c, n.curve, e), n.Ql = await de(c, n.curve, e), n.Qr = await de(c, n.curve, e), n.Qo = await de(c, n.curve, e), n.Qc = await de(c, n.curve, e), n.S1 = await de(c, n.curve, e), n.S2 = await de(c, n.curve, e), n.S3 = await de(c, n.curve, e), n.X_2 = await $e(c, n.curve, e), await Xe(c), n;
 }
-async function sr(c, t, e) {
+async function hr(c, t, e) {
   const n = {};
-  n.protocol = "fflonk", n.protocolId = Ri, await Ge(c, t, ar);
+  n.protocol = "fflonk", n.protocolId = zi, await We(c, t, fr);
   const a = await c.readULE32();
-  n.n8q = a, n.q = await we(c, a), n.curve = await Kn(n.q);
+  n.n8q = a, n.q = await Be(c, a), n.curve = await Kn(n.q);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await we(c, s), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstraints = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.w3 = await c.read(s), n.w4 = await c.read(s), n.w8 = await c.read(s), n.wr = await c.read(s), n.X_2 = await Ue(c, n.curve, e), n.C0 = await ue(c, n.curve, e), await Ze(c), n;
+  return n.n8r = s, n.r = await Be(c, s), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = dn(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstraints = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.w3 = await c.read(s), n.w4 = await c.read(s), n.w8 = await c.read(s), n.wr = await c.read(s), n.X_2 = await $e(c, n.curve, e), n.C0 = await de(c, n.curve, e), await Xe(c), n;
 }
-async function rr(c, t, e) {
+async function Lr(c, t, e) {
   await ua(c, 1);
   const n = (Math.floor((Yt.bitLength(e) - 1) / 64) + 1) * 8;
-  if (await c.writeULE32(n), await dc(c, e, n), t.byteLength % n != 0)
+  if (await c.writeULE32(n), await mc(c, e, n), t.byteLength % n != 0)
     throw new Error("Invalid witness length");
   await c.writeULE32(t.byteLength / n), await da(c), await ua(c, 2), await c.write(t), await da(c);
 }
-async function lr(c, t) {
-  await Ge(c, t, 1);
-  const e = await c.readULE32(), n = await we(c, e), a = await c.readULE32();
-  return await Ze(c), { n8: e, q: n, nWitness: a };
+async function mr(c, t) {
+  await We(c, t, 1);
+  const e = await c.readULE32(), n = await Be(c, e), a = await c.readULE32();
+  return await Xe(c), { n8: e, q: n, nWitness: a };
 }
-const { stringifyBigInts: Da } = ln;
-async function ur(c, t, e) {
-  const { fd: n, sections: a } = await la(t, "wtns", 2, 33554432, 8388608), s = await lr(n, a), { fd: g, sections: d } = await la(c, "zkey", 2, 1 << 25, 1 << 23), C = await ir(g, d);
+const { stringifyBigInts: Da } = un;
+async function br(c, t, e) {
+  const { fd: n, sections: a } = await la(t, "wtns", 2, 33554432, 8388608), s = await mr(n, a), { fd: g, sections: d } = await la(c, "zkey", 2, 1 << 25, 1 << 23), C = await _r(g, d);
   if (C.protocol != "groth16")
     throw new Error("zkey file is not groth16");
   if (!Yt.eq(C.r, s.q))
     throw new Error("Curve of the witness does not match the curve of the proving key");
   if (s.nWitness != C.nVars)
     throw new Error(`Invalid witness length. Circuit: ${C.nVars}, witness: ${s.nWitness}`);
-  const l = C.curve, o = l.Fr, y = l.G1, E = l.G2, m = un(C.domainSize);
+  const l = C.curve, o = l.Fr, y = l.G1, E = l.G2, m = dn(C.domainSize);
   e && e.debug("Reading Wtns");
-  const x = await Ae(n, a, 2);
+  const x = await Fe(n, a, 2);
   e && e.debug("Reading Coeffs");
-  const O = await Ae(g, d, 4);
+  const O = await Fe(g, d, 4);
   e && e.debug("Building ABC");
-  const [L, I, v] = await dr(l, C, x, O, e), U = m == o.s ? l.Fr.shift : l.Fr.w[m + 1], w = await o.ifft(L, "", "", e, "IFFT_A"), S = await o.batchApplyKey(w, o.e(1), U), F = await o.fft(S, "", "", e, "FFT_A"), r = await o.ifft(I, "", "", e, "IFFT_B"), h = await o.batchApplyKey(r, o.e(1), U), R = await o.fft(h, "", "", e, "FFT_B"), j = await o.ifft(v, "", "", e, "IFFT_C"), T = await o.batchApplyKey(j, o.e(1), U), D = await o.fft(T, "", "", e, "FFT_C");
+  const [L, I, v] = await yr(l, C, x, O, e), U = m == o.s ? l.Fr.shift : l.Fr.w[m + 1], w = await o.ifft(L, "", "", e, "IFFT_A"), S = await o.batchApplyKey(w, o.e(1), U), F = await o.fft(S, "", "", e, "FFT_A"), r = await o.ifft(I, "", "", e, "IFFT_B"), h = await o.batchApplyKey(r, o.e(1), U), R = await o.fft(h, "", "", e, "FFT_B"), j = await o.ifft(v, "", "", e, "IFFT_C"), T = await o.batchApplyKey(j, o.e(1), U), D = await o.fft(T, "", "", e, "FFT_C");
   e && e.debug("Join ABC");
-  const A = await fr(l, C, F, R, D, e);
+  const A = await Cr(l, C, F, R, D, e);
   let M = {};
   e && e.debug("Reading A Points");
-  const H = await Ae(g, d, 5);
+  const H = await Fe(g, d, 5);
   M.pi_a = await l.G1.multiExpAffine(H, x, e, "multiexp A"), e && e.debug("Reading B1 Points");
-  const ut = await Ae(g, d, 6);
+  const ut = await Fe(g, d, 6);
   let nt = await l.G1.multiExpAffine(ut, x, e, "multiexp B1");
   e && e.debug("Reading B2 Points");
-  const J = await Ae(g, d, 7);
+  const J = await Fe(g, d, 7);
   M.pi_b = await l.G2.multiExpAffine(J, x, e, "multiexp B2"), e && e.debug("Reading C Points");
-  const ft = await Ae(g, d, 8);
+  const ft = await Fe(g, d, 8);
   M.pi_c = await l.G1.multiExpAffine(ft, x.slice((C.nPublic + 1) * l.Fr.n8), e, "multiexp C"), e && e.debug("Reading H Points");
-  const at = await Ae(g, d, 9), _t = await l.G1.multiExpAffine(at, A, e, "multiexp H"), zt = l.Fr.random(), G = l.Fr.random();
+  const at = await Fe(g, d, 9), _t = await l.G1.multiExpAffine(at, A, e, "multiexp H"), zt = l.Fr.random(), G = l.Fr.random();
   M.pi_a = y.add(M.pi_a, C.vk_alpha_1), M.pi_a = y.add(M.pi_a, y.timesFr(C.vk_delta_1, zt)), M.pi_b = E.add(M.pi_b, C.vk_beta_2), M.pi_b = E.add(M.pi_b, E.timesFr(C.vk_delta_2, G)), nt = y.add(nt, C.vk_beta_1), nt = y.add(nt, y.timesFr(C.vk_delta_1, G)), M.pi_c = y.add(M.pi_c, _t), M.pi_c = y.add(M.pi_c, y.timesFr(M.pi_a, G)), M.pi_c = y.add(M.pi_c, y.timesFr(nt, zt)), M.pi_c = y.add(M.pi_c, y.timesFr(C.vk_delta_1, o.neg(o.mul(zt, G))));
   let K = [];
   for (let P = 1; P <= C.nPublic; P++) {
@@ -11046,7 +11093,7 @@ async function ur(c, t, e) {
   }
   return M.pi_a = y.toObject(y.toAffine(M.pi_a)), M.pi_b = E.toObject(E.toAffine(M.pi_b)), M.pi_c = y.toObject(y.toAffine(M.pi_c)), M.protocol = "groth16", M.curve = l.name, await g.close(), await n.close(), M = Da(M), K = Da(K), { proof: M, publicSignals: K };
 }
-async function dr(c, t, e, n, a) {
+async function yr(c, t, e, n, a) {
   const s = c.Fr.n8, g = 4 * 3 + t.n8r, d = (n.byteLength - 4) / g, C = new Vt(t.domainSize * s), l = new Vt(t.domainSize * s), o = new Vt(t.domainSize * s), y = [C, l];
   for (let E = 0; E < d; E++) {
     a && E % 1e6 == 0 && a.debug(`QAP AB: ${E}/${d}`);
@@ -11069,7 +11116,7 @@ async function dr(c, t, e, n, a) {
     );
   return [C, l, o];
 }
-async function fr(c, t, e, n, a, s) {
+async function Cr(c, t, e, n, a, s) {
   const d = c.Fr.n8, C = Math.floor(e.byteLength / c.Fr.n8), l = [];
   for (let m = 0; m < C; m += 4194304) {
     s && s.debug(`JoinABC: ${m}/${C}`);
@@ -11094,7 +11141,7 @@ async function fr(c, t, e, n, a, s) {
     y.set(o[m][0], E), E += o[m][0].byteLength;
   return y;
 }
-function Ni(c) {
+function Ui(c) {
   var t = [];
   return e(t, c), t;
   function e(n, a) {
@@ -11105,7 +11152,7 @@ function Ni(c) {
       n.push(a);
   }
 }
-function zi(c) {
+function ji(c) {
   const t = BigInt(2) ** BigInt(64);
   let e = BigInt("0xCBF29CE484222325");
   for (var n = 0; n < c.length; n++)
@@ -11113,7 +11160,7 @@ function zi(c) {
   let a = e.toString(16), s = 16 - a.length;
   return a = "0".repeat(s).concat(a), a;
 }
-function _r(c, t) {
+function Ar(c, t) {
   const e = [];
   let n = BigInt(c);
   const a = BigInt(4294967296);
@@ -11124,7 +11171,7 @@ function _r(c, t) {
       e.unshift(0), s--;
   return e;
 }
-async function gr(c, t) {
+async function Fr(c, t) {
   t = t || {};
   let e = 32767, n, a = !1;
   for (; !a; )
@@ -11191,7 +11238,7 @@ async function gr(c, t) {
   });
   typeof E.exports.getVersion == "function" && (l = E.exports.getVersion()), typeof E.exports.getMinorVersion == "function" && (o = E.exports.getMinorVersion()), typeof E.exports.getPatchVersion == "function" && (y = E.exports.getPatchVersion());
   const m = t && (t.sanityCheck || t.logGetSignal || t.logSetSignal || t.logStartComponent || t.logFinishComponent);
-  return l === 2 ? g = new hr(E, m) : g = new pr(n, E, m), g;
+  return l === 2 ? g = new wr(E, m) : g = new Er(n, E, m), g;
   function x() {
     for (var L = "", I = E.exports.getMessageChar(); I != 0; )
       L += String.fromCharCode(I), I = E.exports.getMessageChar();
@@ -11204,13 +11251,13 @@ async function gr(c, t) {
     return String.fromCharCode.apply(null, v);
   }
 }
-class pr {
+class Er {
   constructor(t, e, n) {
     this.memory = t, this.i32 = new Uint32Array(t.buffer), this.instance = e, this.n32 = (this.instance.exports.getFrLen() >> 2) - 2;
     const a = this.instance.exports.getPRawPrime(), s = new Array(this.n32);
     for (let g = 0; g < this.n32; g++)
       s[this.n32 - 1 - g] = this.i32[(a >> 2) + g];
-    this.prime = Yt.fromArray(s, 4294967296), this.Fr = new jc(this.prime), this.mask32 = Yt.fromString("FFFFFFFF", 16), this.NVars = this.instance.exports.getNVars(), this.n64 = Math.floor((this.Fr.bitLength - 1) / 64) + 1, this.R = this.Fr.e(Yt.shiftLeft(1, this.n64 * 64)), this.RInv = this.Fr.inv(this.R), this.sanityCheck = n;
+    this.prime = Yt.fromArray(s, 4294967296), this.Fr = new Jc(this.prime), this.mask32 = Yt.fromString("FFFFFFFF", 16), this.NVars = this.instance.exports.getNVars(), this.n64 = Math.floor((this.Fr.bitLength - 1) / 64) + 1, this.R = this.Fr.e(Yt.shiftLeft(1, this.n64 * 64)), this.RInv = this.Fr.inv(this.R), this.sanityCheck = n;
   }
   circom_version() {
     return 1;
@@ -11219,13 +11266,13 @@ class pr {
     this.instance.exports.init(this.sanityCheck || e ? 1 : 0);
     const n = this.allocInt(), a = this.allocFr();
     Object.keys(t).forEach((g) => {
-      const d = zi(g), C = parseInt(d.slice(0, 8), 16), l = parseInt(d.slice(8, 16), 16);
+      const d = ji(g), C = parseInt(d.slice(0, 8), 16), l = parseInt(d.slice(8, 16), 16);
       try {
         this.instance.exports.getSignalOffset32(n, 0, C, l);
       } catch {
         throw new Error(`Signal ${g} is not an input of the circuit.`);
       }
-      const o = this.getInt(n), y = Ni(t[g]);
+      const o = this.getInt(n), y = Ui(t[g]);
       for (let E = 0; E < y.length; E++)
         this.setFr(a, y[E]), this.instance.exports.setSignal(0, 0, o + E, a);
     });
@@ -11292,7 +11339,7 @@ class pr {
     }
   }
 }
-class hr {
+class wr {
   constructor(t, e) {
     this.instance = t, this.version = this.instance.exports.getVersion(), this.n32 = this.instance.exports.getFieldNumLen32(), this.instance.exports.getRawPrime();
     const n = new Array(this.n32);
@@ -11308,9 +11355,9 @@ class hr {
     const n = Object.keys(t);
     var a = 0;
     if (n.forEach((s) => {
-      const g = zi(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = Ni(t[s]);
+      const g = ji(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = Ui(t[s]);
       for (let o = 0; o < l.length; o++) {
-        const y = _r(l[o], this.n32);
+        const y = Ar(l[o], this.n32);
         for (let E = 0; E < this.n32; E++)
           this.instance.exports.writeSharedRWMemory(E, y[this.n32 - 1 - E]);
         try {
@@ -11354,44 +11401,44 @@ class hr {
     return a;
   }
 }
-const { unstringifyBigInts: Lr } = ln;
-async function mr(c, t, e, n) {
-  const a = Lr(c), s = await ni(t), g = await s.read(s.totalSize);
+const { unstringifyBigInts: Br } = un;
+async function vr(c, t, e, n) {
+  const a = Br(c), s = await ii(t), g = await s.read(s.totalSize);
   await s.close();
-  const d = await gr(g);
+  const d = await Fr(g);
   if (d.circom_version() == 1) {
-    const C = await d.calculateBinWitness(a), l = await uc(e, "wtns", 2, 2);
-    await rr(l, C, d.prime), await l.close();
+    const C = await d.calculateBinWitness(a), l = await Lc(e, "wtns", 2, 2);
+    await Lr(l, C, d.prime), await l.close();
   } else {
-    const C = await ei(e), l = await d.calculateWTNSBin(a);
+    const C = await ai(e), l = await d.calculateWTNSBin(a);
     await C.write(l), await C.close();
   }
 }
-const { unstringifyBigInts: br } = ln;
-async function yr(c, t, e, n) {
-  const a = br(c), s = {
+const { unstringifyBigInts: xr } = un;
+async function Sr(c, t, e, n) {
+  const a = xr(c), s = {
     type: "mem"
   };
-  return await mr(a, t, s), await ur(e, s, n);
+  return await vr(a, t, s), await br(e, s, n);
 }
-const { unstringifyBigInts: Ma } = ln;
-function pe(c) {
+const { unstringifyBigInts: Ma } = un;
+function he(c) {
   let t = c.toString(16);
   for (; t.length < 64; )
     t = "0" + t;
   return t = `"0x${t}"`, t;
 }
-async function Cr(c, t) {
+async function Ir(c, t) {
   const e = Ma(c), n = Ma(t);
   let a = "";
   for (let g = 0; g < n.length; g++)
-    a != "" && (a = a + ","), a = a + pe(n[g]);
+    a != "" && (a = a + ","), a = a + he(n[g]);
   let s;
-  return s = `[${pe(e.pi_a[0])}, ${pe(e.pi_a[1])}],[[${pe(e.pi_b[0][1])}, ${pe(e.pi_b[0][0])}],[${pe(e.pi_b[1][1])}, ${pe(e.pi_b[1][0])}]],[${pe(e.pi_c[0])}, ${pe(e.pi_c[1])}],[${a}]`, s;
+  return s = `[${he(e.pi_a[0])}, ${he(e.pi_a[1])}],[[${he(e.pi_b[0][1])}, ${he(e.pi_b[0][0])}],[${he(e.pi_b[1][1])}, ${he(e.pi_b[1][0])}]],[${he(e.pi_c[0])}, ${he(e.pi_c[1])}],[${a}]`, s;
 }
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-var Ar = {}, Ui = {};
+var Or = {}, $i = {};
 (function(c) {
   var t = /[|\\{}()[\]^$+*?.]/g, e = Object.prototype.hasOwnProperty, n = function(l, o) {
     return e.apply(l, [o]);
@@ -11476,19 +11523,19 @@ function encode_char(c) {
       return { __proto__: null };
     };
   }();
-})(Ui);
-const Fr = "ejs", Er = "Embedded JavaScript templates", wr = [
+})($i);
+const Pr = "ejs", kr = "Embedded JavaScript templates", Tr = [
   "template",
   "engine",
   "ejs"
-], Br = "3.1.9", vr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", xr = "Apache-2.0", Sr = {
+], qr = "3.1.9", Dr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", Mr = "Apache-2.0", Rr = {
   ejs: "./bin/cli.js"
-}, Ir = "./lib/ejs.js", Or = "ejs.min.js", Pr = "ejs.min.js", kr = {
+}, Nr = "./lib/ejs.js", zr = "ejs.min.js", Ur = "ejs.min.js", jr = {
   type: "git",
   url: "git://github.com/mde/ejs.git"
-}, Tr = "https://github.com/mde/ejs/issues", qr = "https://github.com/mde/ejs", Dr = {
+}, $r = "https://github.com/mde/ejs/issues", Gr = "https://github.com/mde/ejs", Zr = {
   jake: "^10.8.5"
-}, Mr = {
+}, Wr = {
   browserify: "^16.5.1",
   eslint: "^6.8.0",
   "git-directory-deploy": "^1.5.1",
@@ -11496,28 +11543,28 @@ const Fr = "ejs", Er = "Embedded JavaScript templates", wr = [
   "lru-cache": "^4.0.1",
   mocha: "^10.2.0",
   "uglify-js": "^3.3.16"
-}, Rr = {
+}, Xr = {
   node: ">=0.10.0"
-}, Nr = {
+}, Vr = {
   test: "mocha -u tdd"
-}, zr = {
-  name: Fr,
-  description: Er,
-  keywords: wr,
-  version: Br,
-  author: vr,
-  license: xr,
-  bin: Sr,
-  main: Ir,
-  jsdelivr: Or,
-  unpkg: Pr,
-  repository: kr,
-  bugs: Tr,
-  homepage: qr,
-  dependencies: Dr,
-  devDependencies: Mr,
-  engines: Rr,
-  scripts: Nr
+}, Hr = {
+  name: Pr,
+  description: kr,
+  keywords: Tr,
+  version: qr,
+  author: Dr,
+  license: Mr,
+  bin: Rr,
+  main: Nr,
+  jsdelivr: zr,
+  unpkg: Ur,
+  repository: jr,
+  bugs: $r,
+  homepage: Gr,
+  dependencies: Zr,
+  devDependencies: Wr,
+  engines: Xr,
+  scripts: Vr
 };
 (function(c) {
   /**
@@ -11527,7 +11574,7 @@ const Fr = "ejs", Er = "Embedded JavaScript templates", wr = [
    * @project EJS
    * @license {@link http://www.apache.org/licenses/LICENSE-2.0 Apache License, Version 2.0}
    */
-  var t = vn, e = vn, n = Ui, a = !1, s = zr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
+  var t = bo, e = mo(), n = $i, a = !1, s = Hr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
     "delimiter",
     "scope",
     "context",
@@ -11823,7 +11870,7 @@ try {
 `);
     }
   }, c.escapeXML = n.escapeXML, c.__express = c.renderFile, c.VERSION = s, c.name = o, typeof window < "u" && (window.ejs = c);
-})(Ar);
+})(Or);
 var Yn = { exports: {} };
 Yn.exports;
 (function(c) {
@@ -11837,7 +11884,7 @@ Yn.exports;
       { n: "primitive", f: r, s: "be primitive type" },
       { n: "contains", f: $t, s: "contain {e}" },
       { n: "in", f: Jt, s: "be in {e}" },
-      { n: "containsKey", f: se, s: "contain key {e}" },
+      { n: "containsKey", f: re, s: "contain key {e}" },
       { n: "keyIn", f: te, s: "be key in {e}" },
       { n: "zero", f: h, s: "be 0" },
       { n: "one", f: R, s: "be 1" },
@@ -12084,11 +12131,11 @@ Yn.exports;
     function Jt(k, et) {
       return $t(et, k);
     }
-    function se(k, et) {
+    function re(k, et) {
       return F(k) ? I && Lt(k, Map) ? k.has(et) : pt(k) && !T(+et) ? !1 : !!k[et] : !1;
     }
     function te(k, et) {
-      return se(et, k);
+      return re(et, k);
     }
     function Pt(k, et) {
       return F(k) && k.length === et;
@@ -12119,8 +12166,8 @@ Yn.exports;
         m(et) || s.object(et);
         var qt = y(k || {});
         wt(et, function(Ht, Qt) {
-          qt.some(function(Kt, de) {
-            return Kt === Ht ? (qt.splice(de, 1), !0) : !1;
+          qt.some(function(Kt, fe) {
+            return Kt === Ht ? (qt.splice(fe, 1), !0) : !1;
           }), Zt(Qt) ? g.assigned(k) ? dt[Ht] = !!Qt.m : dt[Ht] = Qt(k[Ht]) : dt[Ht] = Wt(k[Ht], Qt);
         });
       }
@@ -12234,12 +12281,12 @@ Yn.exports;
     function ht(k) {
       var et, dt, qt, Ht;
       return et = k.shift(), dt = k.pop(), qt = k.pop(), Ht = k.pop(), wt(Ht, function(Qt, Kt) {
-        var de = e[Qt];
-        de && dt && (de = de.replace("to", dt + "to")), Object.defineProperty(qt, Qt, {
+        var fe = e[Qt];
+        fe && dt && (fe = fe.replace("to", dt + "to")), Object.defineProperty(qt, Qt, {
           configurable: !1,
           enumerable: !0,
           writable: !1,
-          value: et.apply(null, k.concat(Kt, de))
+          value: et.apply(null, k.concat(Kt, fe))
         });
       }), qt;
     }
@@ -12264,9 +12311,9 @@ Yn.exports;
     function kt(k) {
       c !== null && c.exports ? c.exports = k : t.check = k;
     }
-  })(Ye);
+  })(en);
 })(Yn);
-var ta = Yn.exports, Ur = { exports: {} };
+var ta = Yn.exports, Qr = { exports: {} };
 (function(c) {
   c.exports = {
     array: "arr",
@@ -12279,22 +12326,22 @@ var ta = Yn.exports, Ur = { exports: {} };
     end: "end",
     error: "err"
   }, c.exports.endArray = c.exports.endPrefix + c.exports.array, c.exports.endObject = c.exports.endPrefix + c.exports.object, c.exports.endLine = `${c.exports.endPrefix}line`, c.exports.dataError = `${c.exports.error}-data`;
-})(Ur);
-Ua.EventEmitter;
-const jr = zn, ji = vn.Readable, Ra = ta;
-jr.inherits(an, ji);
-var $i = an;
-function an(c, t) {
-  return Ra.not.instanceStrict(this, an) ? new an(c) : (Ra.assert.function(c, "Invalid read implementation"), this._read = function() {
+})(Qr);
+ja.EventEmitter;
+const Jr = zn, Gi = $a().Readable, Ra = ta;
+Jr.inherits(cn, Gi);
+var Zi = cn;
+function cn(c, t) {
+  return Ra.not.instanceStrict(this, cn) ? new cn(c) : (Ra.assert.function(c, "Invalid read implementation"), this._read = function() {
     c();
-  }, ji.call(this, t));
+  }, Gi.call(this, t));
 }
-const $r = ta, Gi = $i, Gr = zn;
-Gr.inherits(Mn, Gi);
+const Kr = ta, Wi = Zi, Yr = zn;
+Yr.inherits(Mn, Wi);
 function Mn(c, t) {
-  return $r.not.instanceStrict(this, Mn) ? new Mn(c, t) : Gi.call(this, c, { ...t, objectMode: !0 });
+  return Kr.not.instanceStrict(this, Mn) ? new Mn(c, t) : Wi.call(this, c, { ...t, objectMode: !0 });
 }
-class dn extends Array {
+class fn extends Array {
   constructor(t) {
     let e, n;
     if (!Na(t))
@@ -12335,17 +12382,17 @@ function Rn(c) {
 function za(c, t) {
   return c === 0 ? 0 : c < 0 ? (t - Math.abs(c)) % t : c % t;
 }
-function fn() {
+function _n() {
   throw new Error("Not implemented");
 }
-dn.prototype.push = fn;
-dn.prototype.pop = fn;
-dn.prototype.shift = fn;
-dn.prototype.unshift = fn;
-function Ke(c) {
+fn.prototype.push = _n;
+fn.prototype.pop = _n;
+fn.prototype.shift = _n;
+fn.prototype.unshift = _n;
+function tn(c) {
   throw new Error('Could not dynamically require "' + c + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
-var Zr = { exports: {} };
+var tl = { exports: {} };
 /*! jsonpath 1.1.1 */
 (function(c, t) {
   (function(e) {
@@ -12355,7 +12402,7 @@ var Zr = { exports: {} };
       function g(l, o) {
         if (!a[l]) {
           if (!n[l]) {
-            var y = typeof Ke == "function" && Ke;
+            var y = typeof tn == "function" && tn;
             if (!o && y)
               return y(l, !0);
             if (d)
@@ -12371,7 +12418,7 @@ var Zr = { exports: {} };
         }
         return a[l].exports;
       }
-      for (var d = typeof Ke == "function" && Ke, C = 0; C < s.length; C++)
+      for (var d = typeof tn == "function" && tn, C = 0; C < s.length; C++)
         g(s[C]);
       return g;
     }({ "./aesprim": [function(e, n, a) {
@@ -12889,8 +12936,8 @@ var Zr = { exports: {} };
           };
         }
         function it() {
-          var p = "", B, N, X, lt, Ct, Gt, Xt = !1, ie, ae;
-          for (ie = I, ae = v, B = x[L], h(
+          var p = "", B, N, X, lt, Ct, Gt, Xt = !1, oe, ae;
+          for (oe = I, ae = v, B = x[L], h(
             B === "'" || B === '"',
             "String literal must starts with a quote"
           ), N = L, ++L; L < U; )
@@ -12939,7 +12986,7 @@ var Zr = { exports: {} };
             type: g.StringLiteral,
             value: p,
             octal: Xt,
-            startLineNumber: ie,
+            startLineNumber: oe,
             startLineStart: ae,
             lineNumber: I,
             lineStart: v,
@@ -13093,7 +13140,7 @@ var Zr = { exports: {} };
         function Jt(p, B) {
           this.line = p, this.column = B;
         }
-        function se(p, B, N, X) {
+        function re(p, B, N, X) {
           this.start = new Jt(p, B), this.end = new Jt(N, X);
         }
         m = {
@@ -13107,7 +13154,7 @@ var Zr = { exports: {} };
             }
           },
           markEnd: function(p, B) {
-            return r.range && (p.range = [B.start, L]), r.loc && (p.loc = new se(
+            return r.range && (p.range = [B.start, L]), r.loc && (p.loc = new re(
               B.startLineNumber === void 0 ? B.lineNumber : B.startLineNumber,
               B.start - (B.startLineStart === void 0 ? B.lineStart : B.startLineStart),
               I,
@@ -13476,7 +13523,7 @@ var Zr = { exports: {} };
         }
         function $(p, B) {
           var N, X, lt;
-          return N = O, lt = S, X = gn(), B && O && J(p[0].name) && Dt(B, y.StrictParamName), O = N, w.markEnd(w.createFunctionExpression(null, p, [], X), lt);
+          return N = O, lt = S, X = pn(), B && O && J(p[0].name) && Dt(B, y.StrictParamName), O = N, w.markEnd(w.createFunctionExpression(null, p, [], X), lt);
         }
         function tt() {
           var p, B;
@@ -13515,7 +13562,7 @@ var Zr = { exports: {} };
             O && S.octal && Dt(S, y.StrictOctalLiteral), N = w.createLiteral(pt());
           else if (p === g.Keyword) {
             if (Y("function"))
-              return so();
+              return lo();
             Y("this") ? (pt(), N = w.createThisExpression()) : Zt(pt());
           } else
             p === g.BooleanLiteral ? (B = pt(), B.value = B.value === "true", N = w.createLiteral(B)) : p === g.NullLiteral ? (B = pt(), B.value = null, N = w.createLiteral(B)) : wt("/") || wt("/=") ? (typeof r.tokens < "u" ? N = w.createLiteral(mt()) : N = w.createLiteral(It()), $t()) : Zt(pt());
@@ -13626,12 +13673,12 @@ var Zr = { exports: {} };
           return N;
         }
         function k() {
-          var p, B, N, X, lt, Ct, Gt, Xt, ie, ae;
-          if (p = S, ie = St(), X = S, lt = kt(X, F.allowIn), lt === 0)
-            return ie;
-          for (X.prec = lt, pt(), B = [p, S], Gt = St(), Ct = [ie, X, Gt]; (lt = kt(S, F.allowIn)) > 0; ) {
+          var p, B, N, X, lt, Ct, Gt, Xt, oe, ae;
+          if (p = S, oe = St(), X = S, lt = kt(X, F.allowIn), lt === 0)
+            return oe;
+          for (X.prec = lt, pt(), B = [p, S], Gt = St(), Ct = [oe, X, Gt]; (lt = kt(S, F.allowIn)) > 0; ) {
             for (; Ct.length > 2 && lt <= Ct[Ct.length - 2].prec; )
-              Gt = Ct.pop(), Xt = Ct.pop().value, ie = Ct.pop(), N = w.createBinaryExpression(Xt, ie, Gt), B.pop(), p = B[B.length - 1], w.markEnd(N, p), Ct.push(N);
+              Gt = Ct.pop(), Xt = Ct.pop().value, oe = Ct.pop(), N = w.createBinaryExpression(Xt, oe, Gt), B.pop(), p = B[B.length - 1], w.markEnd(N, p), Ct.push(N);
             X = pt(), X.prec = lt, Ct.push(X), B.push(S), N = St(), Ct.push(N);
           }
           for (ae = Ct.length - 1, N = Ct[ae], B.pop(); ae > 1; )
@@ -13656,7 +13703,7 @@ var Zr = { exports: {} };
           return p;
         }
         function Ht() {
-          for (var p = [], B; L < U && !(wt("}") || (B = Te(), typeof B > "u")); )
+          for (var p = [], B; L < U && !(wt("}") || (B = De(), typeof B > "u")); )
             p.push(B);
           return p;
         }
@@ -13668,150 +13715,150 @@ var Zr = { exports: {} };
           var p, B;
           return B = S, p = pt(), p.type !== g.Identifier && Zt(p), w.markEnd(w.createIdentifier(p.value), B);
         }
-        function de(p) {
+        function fe(p) {
           var B = null, N, X;
           return X = S, N = Kt(), O && J(N.name) && Dt({}, y.StrictVarName), p === "const" ? (vt("="), B = dt()) : wt("=") && (pt(), B = dt()), w.markEnd(w.createVariableDeclarator(N, B), X);
         }
-        function ye(p) {
+        function Ce(p) {
           var B = [];
           do {
-            if (B.push(de(p)), !wt(","))
+            if (B.push(fe(p)), !wt(","))
               break;
             pt();
           } while (L < U);
           return B;
         }
-        function ke() {
+        function qe() {
           var p;
-          return Wt("var"), p = ye(), _(), w.createVariableDeclaration(p, "var");
+          return Wt("var"), p = Ce(), _(), w.createVariableDeclaration(p, "var");
         }
-        function _n(p) {
+        function gn(p) {
           var B, N;
-          return N = S, Wt(p), B = ye(p), _(), w.markEnd(w.createVariableDeclaration(B, p), N);
+          return N = S, Wt(p), B = Ce(p), _(), w.markEnd(w.createVariableDeclaration(B, p), N);
         }
-        function ve() {
+        function xe() {
           return vt(";"), w.createEmptyStatement();
         }
-        function Ce() {
+        function Ae() {
           var p = qt();
           return _(), w.createExpressionStatement(p);
         }
-        function He() {
+        function Je() {
           var p, B, N;
-          return Wt("if"), vt("("), p = qt(), vt(")"), B = fe(), Y("else") ? (pt(), N = fe()) : N = null, w.createIfStatement(p, B, N);
+          return Wt("if"), vt("("), p = qt(), vt(")"), B = _e(), Y("else") ? (pt(), N = _e()) : N = null, w.createIfStatement(p, B, N);
         }
-        function Xi() {
+        function Hi() {
           var p, B, N;
-          return Wt("do"), N = F.inIteration, F.inIteration = !0, p = fe(), F.inIteration = N, Wt("while"), vt("("), B = qt(), vt(")"), wt(";") && pt(), w.createDoWhileStatement(p, B);
+          return Wt("do"), N = F.inIteration, F.inIteration = !0, p = _e(), F.inIteration = N, Wt("while"), vt("("), B = qt(), vt(")"), wt(";") && pt(), w.createDoWhileStatement(p, B);
         }
-        function Vi() {
+        function Qi() {
           var p, B, N;
-          return Wt("while"), vt("("), p = qt(), vt(")"), N = F.inIteration, F.inIteration = !0, B = fe(), F.inIteration = N, w.createWhileStatement(p, B);
+          return Wt("while"), vt("("), p = qt(), vt(")"), N = F.inIteration, F.inIteration = !0, B = _e(), F.inIteration = N, w.createWhileStatement(p, B);
         }
-        function Hi() {
+        function Ji() {
           var p, B, N;
-          return N = S, p = pt(), B = ye(), w.markEnd(w.createVariableDeclaration(B, p.value), N);
+          return N = S, p = pt(), B = Ce(), w.markEnd(w.createVariableDeclaration(B, p.value), N);
         }
-        function Qi() {
+        function Ki() {
           var p, B, N, X, lt, Ct, Gt;
-          return p = B = N = null, Wt("for"), vt("("), wt(";") ? pt() : (Y("var") || Y("let") ? (F.allowIn = !1, p = Hi(), F.allowIn = !0, p.declarations.length === 1 && Y("in") && (pt(), X = p, lt = qt(), p = null)) : (F.allowIn = !1, p = qt(), F.allowIn = !0, Y("in") && (Z(p) || Dt({}, y.InvalidLHSInForIn), pt(), X = p, lt = qt(), p = null)), typeof X > "u" && vt(";")), typeof X > "u" && (wt(";") || (B = qt()), vt(";"), wt(")") || (N = qt())), vt(")"), Gt = F.inIteration, F.inIteration = !0, Ct = fe(), F.inIteration = Gt, typeof X > "u" ? w.createForStatement(p, B, N, Ct) : w.createForInStatement(X, lt, Ct);
+          return p = B = N = null, Wt("for"), vt("("), wt(";") ? pt() : (Y("var") || Y("let") ? (F.allowIn = !1, p = Ji(), F.allowIn = !0, p.declarations.length === 1 && Y("in") && (pt(), X = p, lt = qt(), p = null)) : (F.allowIn = !1, p = qt(), F.allowIn = !0, Y("in") && (Z(p) || Dt({}, y.InvalidLHSInForIn), pt(), X = p, lt = qt(), p = null)), typeof X > "u" && vt(";")), typeof X > "u" && (wt(";") || (B = qt()), vt(";"), wt(")") || (N = qt())), vt(")"), Gt = F.inIteration, F.inIteration = !0, Ct = _e(), F.inIteration = Gt, typeof X > "u" ? w.createForStatement(p, B, N, Ct) : w.createForInStatement(X, lt, Ct);
         }
-        function Ji() {
+        function Yi() {
           var p = null, B;
           return Wt("continue"), x.charCodeAt(L) === 59 ? (pt(), F.inIteration || Pt({}, y.IllegalContinue), w.createContinueStatement(null)) : te() ? (F.inIteration || Pt({}, y.IllegalContinue), w.createContinueStatement(null)) : (S.type === g.Identifier && (p = Kt(), B = "$" + p.name, Object.prototype.hasOwnProperty.call(F.labelSet, B) || Pt({}, y.UnknownLabel, p.name)), _(), p === null && !F.inIteration && Pt({}, y.IllegalContinue), w.createContinueStatement(p));
         }
-        function Ki() {
+        function to() {
           var p = null, B;
           return Wt("break"), x.charCodeAt(L) === 59 ? (pt(), F.inIteration || F.inSwitch || Pt({}, y.IllegalBreak), w.createBreakStatement(null)) : te() ? (F.inIteration || F.inSwitch || Pt({}, y.IllegalBreak), w.createBreakStatement(null)) : (S.type === g.Identifier && (p = Kt(), B = "$" + p.name, Object.prototype.hasOwnProperty.call(F.labelSet, B) || Pt({}, y.UnknownLabel, p.name)), _(), p === null && !(F.inIteration || F.inSwitch) && Pt({}, y.IllegalBreak), w.createBreakStatement(p));
         }
-        function Yi() {
+        function eo() {
           var p = null;
           return Wt("return"), F.inFunctionBody || Dt({}, y.IllegalReturn), x.charCodeAt(L) === 32 && M(x.charCodeAt(L + 1)) ? (p = qt(), _(), w.createReturnStatement(p)) : te() ? w.createReturnStatement(null) : (wt(";") || !wt("}") && S.type !== g.EOF && (p = qt()), _(), w.createReturnStatement(p));
         }
-        function to() {
+        function no() {
           var p, B;
-          return O && (G(), Dt({}, y.StrictModeWith)), Wt("with"), vt("("), p = qt(), vt(")"), B = fe(), w.createWithStatement(p, B);
+          return O && (G(), Dt({}, y.StrictModeWith)), Wt("with"), vt("("), p = qt(), vt(")"), B = _e(), w.createWithStatement(p, B);
         }
-        function eo() {
+        function ao() {
           var p, B = [], N, X;
           for (X = S, Y("default") ? (pt(), p = null) : (Wt("case"), p = qt()), vt(":"); L < U && !(wt("}") || Y("default") || Y("case")); )
-            N = fe(), B.push(N);
+            N = _e(), B.push(N);
           return w.markEnd(w.createSwitchCase(p, B), X);
         }
-        function no() {
+        function io() {
           var p, B, N, X, lt;
           if (Wt("switch"), vt("("), p = qt(), vt(")"), vt("{"), B = [], wt("}"))
             return pt(), w.createSwitchStatement(p, B);
           for (X = F.inSwitch, F.inSwitch = !0, lt = !1; L < U && !wt("}"); )
-            N = eo(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
+            N = ao(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
           return F.inSwitch = X, vt("}"), w.createSwitchStatement(p, B);
         }
-        function ao() {
+        function oo() {
           var p;
           return Wt("throw"), te() && Pt({}, y.NewlineAfterThrow), p = qt(), _(), w.createThrowStatement(p);
         }
-        function io() {
+        function co() {
           var p, B, N;
           return N = S, Wt("catch"), vt("("), wt(")") && Zt(S), p = Kt(), O && J(p.name) && Dt({}, y.StrictCatchVariable), vt(")"), B = Qt(), w.markEnd(w.createCatchClause(p, B), N);
         }
-        function oo() {
+        function so() {
           var p, B = [], N = null;
-          return Wt("try"), p = Qt(), Y("catch") && B.push(io()), Y("finally") && (pt(), N = Qt()), B.length === 0 && !N && Pt({}, y.NoCatchOrFinally), w.createTryStatement(p, [], B, N);
+          return Wt("try"), p = Qt(), Y("catch") && B.push(co()), Y("finally") && (pt(), N = Qt()), B.length === 0 && !N && Pt({}, y.NoCatchOrFinally), w.createTryStatement(p, [], B, N);
         }
-        function co() {
+        function ro() {
           return Wt("debugger"), _(), w.createDebuggerStatement();
         }
-        function fe() {
+        function _e() {
           var p = S.type, B, N, X, lt;
           if (p === g.EOF && Zt(S), p === g.Punctuator && S.value === "{")
             return Qt();
           if (lt = S, p === g.Punctuator)
             switch (S.value) {
               case ";":
-                return w.markEnd(ve(), lt);
+                return w.markEnd(xe(), lt);
               case "(":
-                return w.markEnd(Ce(), lt);
+                return w.markEnd(Ae(), lt);
             }
           if (p === g.Keyword)
             switch (S.value) {
               case "break":
-                return w.markEnd(Ki(), lt);
+                return w.markEnd(to(), lt);
               case "continue":
-                return w.markEnd(Ji(), lt);
+                return w.markEnd(Yi(), lt);
               case "debugger":
-                return w.markEnd(co(), lt);
+                return w.markEnd(ro(), lt);
               case "do":
-                return w.markEnd(Xi(), lt);
+                return w.markEnd(Hi(), lt);
               case "for":
-                return w.markEnd(Qi(), lt);
+                return w.markEnd(Ki(), lt);
               case "function":
                 return w.markEnd(aa(), lt);
               case "if":
-                return w.markEnd(He(), lt);
+                return w.markEnd(Je(), lt);
               case "return":
-                return w.markEnd(Yi(), lt);
+                return w.markEnd(eo(), lt);
               case "switch":
-                return w.markEnd(no(), lt);
+                return w.markEnd(io(), lt);
               case "throw":
-                return w.markEnd(ao(), lt);
-              case "try":
                 return w.markEnd(oo(), lt);
+              case "try":
+                return w.markEnd(so(), lt);
               case "var":
-                return w.markEnd(ke(), lt);
+                return w.markEnd(qe(), lt);
               case "while":
-                return w.markEnd(Vi(), lt);
+                return w.markEnd(Qi(), lt);
               case "with":
-                return w.markEnd(to(), lt);
+                return w.markEnd(no(), lt);
             }
-          return B = qt(), B.type === l.Identifier && wt(":") ? (pt(), X = "$" + B.name, Object.prototype.hasOwnProperty.call(F.labelSet, X) && Pt({}, y.Redeclaration, "Label", B.name), F.labelSet[X] = !0, N = fe(), delete F.labelSet[X], w.markEnd(w.createLabeledStatement(B, N), lt)) : (_(), w.markEnd(w.createExpressionStatement(B), lt));
+          return B = qt(), B.type === l.Identifier && wt(":") ? (pt(), X = "$" + B.name, Object.prototype.hasOwnProperty.call(F.labelSet, X) && Pt({}, y.Redeclaration, "Label", B.name), F.labelSet[X] = !0, N = _e(), delete F.labelSet[X], w.markEnd(w.createLabeledStatement(B, N), lt)) : (_(), w.markEnd(w.createExpressionStatement(B), lt));
         }
-        function gn() {
-          var p, B = [], N, X, lt, Ct, Gt, Xt, ie, ae;
-          for (ae = S, vt("{"); L < U && !(S.type !== g.StringLiteral || (N = S, p = Te(), B.push(p), p.expression.type !== l.Literal)); )
+        function pn() {
+          var p, B = [], N, X, lt, Ct, Gt, Xt, oe, ae;
+          for (ae = S, vt("{"); L < U && !(S.type !== g.StringLiteral || (N = S, p = De(), B.push(p), p.expression.type !== l.Literal)); )
             X = x.slice(N.start + 1, N.end - 1), X === "use strict" ? (O = !0, lt && Dt(lt, y.StrictOctalLiteral)) : !lt && N.octal && (lt = N);
-          for (Ct = F.labelSet, Gt = F.inIteration, Xt = F.inSwitch, ie = F.inFunctionBody, F.labelSet = {}, F.inIteration = !1, F.inSwitch = !1, F.inFunctionBody = !0; L < U && !(wt("}") || (p = Te(), typeof p > "u")); )
+          for (Ct = F.labelSet, Gt = F.inIteration, Xt = F.inSwitch, oe = F.inFunctionBody, F.labelSet = {}, F.inIteration = !1, F.inSwitch = !1, F.inFunctionBody = !0; L < U && !(wt("}") || (p = De(), typeof p > "u")); )
             B.push(p);
-          return vt("}"), F.labelSet = Ct, F.inIteration = Gt, F.inSwitch = Xt, F.inFunctionBody = ie, w.markEnd(w.createBlockStatement(B), ae);
+          return vt("}"), F.labelSet = Ct, F.inIteration = Gt, F.inSwitch = Xt, F.inFunctionBody = oe, w.markEnd(w.createBlockStatement(B), ae);
         }
         function na(p) {
           var B, N = [], X, lt, Ct, Gt, Xt;
@@ -13826,37 +13873,37 @@ var Zr = { exports: {} };
           };
         }
         function aa() {
-          var p, B = [], N, X, lt, Ct, Gt, Xt, ie, ae;
-          return ae = S, Wt("function"), X = S, p = Kt(), O ? J(X.value) && Dt(X, y.StrictFunctionName) : J(X.value) ? (Gt = X, Xt = y.StrictFunctionName) : nt(X.value) && (Gt = X, Xt = y.StrictReservedWord), Ct = na(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), ie = O, N = gn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = ie, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
+          var p, B = [], N, X, lt, Ct, Gt, Xt, oe, ae;
+          return ae = S, Wt("function"), X = S, p = Kt(), O ? J(X.value) && Dt(X, y.StrictFunctionName) : J(X.value) ? (Gt = X, Xt = y.StrictFunctionName) : nt(X.value) && (Gt = X, Xt = y.StrictReservedWord), Ct = na(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), oe = O, N = pn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = oe, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
         }
-        function so() {
-          var p, B = null, N, X, lt, Ct, Gt = [], Xt, ie, ae;
-          return ae = S, Wt("function"), wt("(") || (p = S, B = Kt(), O ? J(p.value) && Dt(p, y.StrictFunctionName) : J(p.value) ? (X = p, lt = y.StrictFunctionName) : nt(p.value) && (X = p, lt = y.StrictReservedWord)), Ct = na(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), ie = O, Xt = gn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = ie, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
+        function lo() {
+          var p, B = null, N, X, lt, Ct, Gt = [], Xt, oe, ae;
+          return ae = S, Wt("function"), wt("(") || (p = S, B = Kt(), O ? J(p.value) && Dt(p, y.StrictFunctionName) : J(p.value) ? (X = p, lt = y.StrictFunctionName) : nt(p.value) && (X = p, lt = y.StrictReservedWord)), Ct = na(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), oe = O, Xt = pn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = oe, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
         }
-        function Te() {
+        function De() {
           if (S.type === g.Keyword)
             switch (S.value) {
               case "const":
               case "let":
-                return _n(S.value);
+                return gn(S.value);
               case "function":
                 return aa();
               default:
-                return fe();
+                return _e();
             }
           if (S.type !== g.EOF)
-            return fe();
+            return _e();
         }
-        function ro() {
-          for (var p, B = [], N, X, lt; L < U && (N = S, !(N.type !== g.StringLiteral || (p = Te(), B.push(p), p.expression.type !== l.Literal))); )
+        function uo() {
+          for (var p, B = [], N, X, lt; L < U && (N = S, !(N.type !== g.StringLiteral || (p = De(), B.push(p), p.expression.type !== l.Literal))); )
             X = x.slice(N.start + 1, N.end - 1), X === "use strict" ? (O = !0, lt && Dt(lt, y.StrictOctalLiteral)) : !lt && N.octal && (lt = N);
-          for (; L < U && (p = Te(), !(typeof p > "u")); )
+          for (; L < U && (p = De(), !(typeof p > "u")); )
             B.push(p);
           return B;
         }
-        function lo() {
+        function fo() {
           var p, B;
-          return G(), $t(), B = S, O = !1, p = ro(), w.markEnd(w.createProgram(p), B);
+          return G(), $t(), B = S, O = !1, p = uo(), w.markEnd(w.createProgram(p), B);
         }
         function ia() {
           var p, B, N, X = [];
@@ -13867,7 +13914,7 @@ var Zr = { exports: {} };
             }, r.range && (N.range = B.range), r.loc && (N.loc = B.loc), X.push(N);
           r.tokens = X;
         }
-        function uo(p, B) {
+        function _o(p, B) {
           var N, X, lt;
           N = String, typeof p != "string" && !(p instanceof String) && (p = N(p)), w = m, x = p, L = 0, I = x.length > 0 ? 1 : 0, v = 0, U = x.length, S = null, F = {
             allowIn: !0,
@@ -13898,7 +13945,7 @@ var Zr = { exports: {} };
           }
           return lt;
         }
-        function fo(p, B) {
+        function go(p, B) {
           var N, X;
           X = String, typeof p != "string" && !(p instanceof String) && (p = X(p)), w = m, x = p, L = 0, I = x.length > 0 ? 1 : 0, v = 0, U = x.length, S = null, F = {
             allowIn: !0,
@@ -13909,7 +13956,7 @@ var Zr = { exports: {} };
             lastCommentStart: -1
           }, r = {}, typeof B < "u" && (r.range = typeof B.range == "boolean" && B.range, r.loc = typeof B.loc == "boolean" && B.loc, r.attachComment = typeof B.attachComment == "boolean" && B.attachComment, r.loc && B.source !== null && B.source !== void 0 && (r.source = X(B.source)), typeof B.tokens == "boolean" && B.tokens && (r.tokens = []), typeof B.comment == "boolean" && B.comment && (r.comments = []), typeof B.tolerant == "boolean" && B.tolerant && (r.errors = []), r.attachComment && (r.range = !0, r.comments = [], r.bottomRightStack = [], r.trailingComments = [], r.leadingComments = []));
           try {
-            N = lo(), typeof r.comments < "u" && (N.comments = r.comments), typeof r.tokens < "u" && (ia(), N.tokens = r.tokens), typeof r.errors < "u" && (N.errors = r.errors);
+            N = fo(), typeof r.comments < "u" && (N.comments = r.comments), typeof r.tokens < "u" && (ia(), N.tokens = r.tokens), typeof r.errors < "u" && (N.errors = r.errors);
           } catch (lt) {
             throw lt;
           } finally {
@@ -13917,7 +13964,7 @@ var Zr = { exports: {} };
           }
           return N;
         }
-        s.version = "1.2.2", s.tokenize = uo, s.parse = fo, s.Syntax = function() {
+        s.version = "1.2.2", s.tokenize = _o, s.parse = go, s.Syntax = function() {
           var p, B = {};
           typeof Object.create == "function" && (B = /* @__PURE__ */ Object.create(null));
           for (p in l)
@@ -15197,7 +15244,7 @@ Expecting ` + ft.join(", ") + ", got '" + (this.terminals_[T] || T) + "'" : at =
         function zt(G, K) {
           return Object.prototype.hasOwnProperty.call(G, K);
         }
-      }).call(this, e("_process"), typeof Ye < "u" ? Ye : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }).call(this, e("_process"), typeof en < "u" ? en : typeof self < "u" ? self : typeof window < "u" ? window : {});
     }, { "./support/isBuffer": 10, _process: 14, inherits: 9 }], 12: [function(e, n, a) {
     }, {}], 13: [function(e, n, a) {
       (function(s) {
@@ -15513,12 +15560,13 @@ Expecting ` + ft.join(", ") + ", got '" + (this.terminals_[T] || T) + "'" : at =
       n.exports = e("./lib/index");
     }, { "./lib/index": 5 }] }, {}, ["jsonpath"])("jsonpath");
   });
-})(Zr);
-Ua.EventEmitter;
-const Wr = ta, Zi = $i, Xr = zn;
-Xr.inherits(Nn, Zi);
+})(tl);
+$a();
+ja.EventEmitter;
+const el = ta, Xi = Zi, nl = zn;
+nl.inherits(Nn, Xi);
 function Nn(c, t) {
-  return Wr.not.instanceStrict(this, Nn) ? new Nn(c, t) : Zi.call(this, c, { ...t, encoding: "utf8" });
+  return el.not.instanceStrict(this, Nn) ? new Nn(c, t) : Xi.call(this, c, { ...t, encoding: "utf8" });
 }
 var ea = { exports: {} };
 ea.exports;
@@ -15597,13 +15645,13 @@ ea.exports;
     function L(I, v) {
       setTimeout(I, Math.abs(v));
     }
-  })(Ye);
+  })(en);
 })(ea);
 ea.exports;
-const Vr = typeof process < "u" && process.versions != null && process.versions.node != null, Bn = (
+const al = typeof Se < "u" && Se.versions != null && Se.versions.node != null, vn = (
   // @ts-expect-error webpack check is done like this
   typeof __webpack_require__ < "u"
-), Wi = new _o(), Hr = async (c) => {
+), Vi = new yo(), il = async (c) => {
   const { input: t, wasmFilePath: e, zKeyFilePath: n, chainId: a } = c.payload.data, {
     hostLocation: { origin: s },
     constants: {
@@ -15612,21 +15660,21 @@ const Vr = typeof process < "u" && process.versions != null && process.versions.
     }
   } = c.metadata;
   let C = e, l = n;
-  if (console.log({ isWebpack: Bn }), Vr) {
-    g && !Bn ? (C = `test/circuits/${e}`, l = `test/circuits/${n}`) : Bn && (C = `libs/hardhat/test/circuits/${e}`, l = `libs/hardhat/test/circuits/${n}`);
+  if (console.log({ isWebpack: vn }), al) {
+    g && !vn ? (C = `test/circuits/${e}`, l = `test/circuits/${n}`) : vn && (C = `libs/hardhat/test/circuits/${e}`, l = `libs/hardhat/test/circuits/${n}`);
     const o = require("path");
     C = o.resolve(C), l = o.resolve(l);
   } else
     a === d.localhost && (C = `${s}/${e}`, l = `${s}/${n}`);
   try {
-    const { proof: o, publicSignals: y } = await yr(t, C, l), E = await Cr(o, y), m = JSON.parse(`[${E}]`);
-    Wi.postMessageToMainThread({ zkCallData: m, proof: o, publicSignals: y });
+    const { proof: o, publicSignals: y } = await Sr(t, C, l), E = await Ir(o, y), m = JSON.parse(`[${E}]`);
+    Vi.postMessageToMainThread({ zkCallData: m, proof: o, publicSignals: y });
   } catch (o) {
     console.log(o);
   }
 };
-Wi.attachWorkerSideOnMessage(Hr);
+Vi.attachWorkerSideOnMessage(il);
 export {
-  Wi as default,
-  Hr as onWorkerMessage
+  Vi as default,
+  il as onWorkerMessage
 };