@hinkal/common 0.0.65 → 0.0.67

package/assets/{snarkjsWorkerLogic-scy9tbGQ.js → snarkjsWorkerLogic-BkSolcWj.js}

@@ -1,13 +1,13 @@
-import { p as Se, B as po } from "./zkProofWorkerLauncher-B54jpyIs.js";
-import { e as Ua, r as ho, g as Lo, a as mo, b as bo, c as en, d as ja, f as $a, u as zn, h as yo } from "./zkProofWorkerLogic-g413cUJh.js";
+import { p as Se, B as Lo } from "./zkProofWorkerLauncher-C2KuMm7O.js";
+import { r as sn, g as ja, a as mo, b as bo, c as en, e as $a, d as Ga, u as Un, f as yo } from "./zkProofWorkerLogic-Bd0sRQ50.js";
 const Co = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
-function sn(c, t) {
+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 ve = sn;
+const ve = rn;
 function Ao(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
@@ -15,7 +15,7 @@ function Ao(c, t) {
     e = e * t + BigInt(c[n]);
   return e;
 }
-function Ga(c) {
+function Za(c) {
   const t = c.toString(16);
   return (t.length - 1) * 4 + Co[parseInt(t[0], 16)];
 }
@@ -25,13 +25,13 @@ function Fo(c) {
 function Eo(c) {
   return !c;
 }
-function Za(c, t) {
+function Wa(c, t) {
   return BigInt(c) << BigInt(t);
 }
-function Un(c, t) {
+function jn(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const wo = Za, Bo = Un;
+const wo = Wa, Bo = jn;
 function vo(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
@@ -55,7 +55,7 @@ function So(c) {
     t & BigInt(1) ? e.push(1) : e.push(0), t = t >> BigInt(1);
   return e;
 }
-function Wa(c) {
+function Xa(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
@@ -115,7 +115,7 @@ function Zo(c, t) {
 function Wo(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function Xa(c, t) {
+function Va(c, t) {
   return BigInt(c) & BigInt(t);
 }
 function Xo(c, t) {
@@ -133,14 +133,14 @@ function Qo(c, t) {
 function Jo(c) {
   return !BigInt(c);
 }
-function Va(c, t, e, n) {
+function Ha(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] = Wa(Xa(Un(e, d * 8), 255));
+    c[d] = Xa(Va(jn(e, d * 8), 255));
 }
 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;
@@ -152,29 +152,29 @@ function Ko(c, t, e, n) {
 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")), 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 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 sn(a.join(""), 16);
+  return rn(a.join(""), 16);
 }
 function ec(c, t) {
   return c.toString(t);
 }
 function nc(c) {
-  const t = new Uint8Array(Math.floor((Ga(c) - 1) / 8) + 1);
-  return Va(t, 0, c, t.byteLength), t;
+  const t = new Uint8Array(Math.floor((Za(c) - 1) / 8) + 1);
+  return Ha(t, 0, c, t.byteLength), t;
 }
 const ac = ve(0), ic = ve(1);
 var oc = /* @__PURE__ */ Object.freeze({
   __proto__: null,
   abs: Ro,
   add: Oo,
-  band: Xa,
-  bitLength: Ga,
+  band: Va,
+  bitLength: Za,
   bits: So,
   bor: Xo,
   bxor: Vo,
@@ -185,7 +185,7 @@ var oc = /* @__PURE__ */ Object.freeze({
   fromArray: Ao,
   fromRprBE: tc,
   fromRprLE: Yo,
-  fromString: sn,
+  fromString: rn,
   geq: Wo,
   gt: Go,
   isNegative: Fo,
@@ -203,22 +203,22 @@ var oc = /* @__PURE__ */ Object.freeze({
   neq: jo,
   one: ic,
   pow: Do,
-  shiftLeft: Za,
-  shiftRight: Un,
+  shiftLeft: Wa,
+  shiftRight: jn,
   shl: wo,
   shr: Bo,
   square: qo,
   sub: Po,
   toArray: Io,
   toLEBuff: nc,
-  toNumber: Wa,
+  toNumber: Xa,
   toRprBE: Ko,
-  toRprLE: Va,
+  toRprLE: Ha,
   toString: ec,
   zero: ac
 });
 const ce = 1 << 30;
-let cc = class xn {
+let cc = class Sn {
   constructor(t) {
     this.buffers = [], this.byteLength = t;
     for (let e = 0; e < t; e += ce) {
@@ -236,7 +236,7 @@ let cc = class xn {
       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 <= ce ? 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 Sn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
     }
     return g;
   }
@@ -247,7 +247,7 @@ let cc = class xn {
       return;
     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 % ce) : this.buffers[a].set(t, e % ce);
+      return t instanceof Sn && 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 > ce ? ce - d : C, o = t.slice(n - C, n - C + l);
@@ -384,14 +384,15 @@ ve("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 ve("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 ve("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 ve("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Ha = oc;
-async function Qa(c, t, e, n) {
+const Qa = oc;
+var rc = sn(), Ja = /* @__PURE__ */ ja(rc);
+async function Ka(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 Ua.promises.open(c, t), s = await a.stat();
-  return new rc(a, s, e, n, c);
+  const a = await Ja.promises.open(c, t), s = await a.stat();
+  return new lc(a, s, e, n, c);
 }
-class rc {
+class lc {
   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 +565,7 @@ class rc {
     });
   }
   async discard() {
-    await this.close(), await Ua.promises.unlink(this.fileName);
+    await this.close(), await Ja.promises.unlink(this.fileName);
   }
   async writeULE32(t, e) {
     const n = this, a = new Uint8Array(4);
@@ -610,16 +611,16 @@ class rc {
     return g;
   }
 }
-function lc(c) {
-  const t = c.initialSize || 1048576, e = new Ka();
+function uc(c) {
+  const t = c.initialSize || 1048576, e = new ti();
   return e.o = c, e.o.data = new Uint8Array(t), e.allocSize = t, e.totalSize = 0, e.readOnly = !1, e.pos = 0, e;
 }
-function uc(c) {
-  const t = new Ka();
+function dc(c) {
+  const t = new ti();
   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), Ja = new Uint8Array(8), ca = new DataView(Ja.buffer);
-class Ka {
+const In = new Uint8Array(4), ca = new DataView(In.buffer), Ya = new Uint8Array(8), sa = new DataView(Ya.buffer);
+class ti {
   constructor() {
     this.pageSize = 16384;
   }
@@ -656,15 +657,15 @@ class Ka {
   }
   async writeULE32(t, e) {
     const n = this;
-    oa.setUint32(0, t, !0), await n.write(Sn, e);
+    ca.setUint32(0, t, !0), await n.write(In, e);
   }
   async writeUBE32(t, e) {
     const n = this;
-    oa.setUint32(0, t, !1), await n.write(Sn, e);
+    ca.setUint32(0, t, !1), await n.write(In, e);
   }
   async writeULE64(t, e) {
     const n = this;
-    ca.setUint32(0, t & 4294967295, !0), ca.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ja, e);
+    sa.setUint32(0, t & 4294967295, !0), sa.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ya, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -696,8 +697,8 @@ class Ka {
   }
 }
 const ne = 1 << 22;
-function dc(c) {
-  const t = c.initialSize || 0, e = new ti();
+function fc(c) {
+  const t = c.initialSize || 0, e = new ni();
   e.o = c;
   const n = t ? Math.floor((t - 1) / ne) + 1 : 0;
   e.o.data = [];
@@ -705,12 +706,12 @@ function dc(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 fc(c) {
-  const t = new ti();
+function _c(c) {
+  const t = new ni();
   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), Ya = new Uint8Array(8), ra = new DataView(Ya.buffer);
-class ti {
+const On = new Uint8Array(4), ra = new DataView(On.buffer), ei = new Uint8Array(8), la = new DataView(ei.buffer);
+class ni {
   constructor() {
     this.pageSize = 16384;
   }
@@ -760,15 +761,15 @@ class ti {
   }
   async writeULE32(t, e) {
     const n = this;
-    sa.setUint32(0, t, !0), await n.write(In, e);
+    ra.setUint32(0, t, !0), await n.write(On, e);
   }
   async writeUBE32(t, e) {
     const n = this;
-    sa.setUint32(0, t, !1), await n.write(In, e);
+    ra.setUint32(0, t, !1), await n.write(On, e);
   }
   async writeULE64(t, e) {
     const n = this;
-    ra.setUint32(0, t & 4294967295, !0), ra.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ya, e);
+    la.setUint32(0, t & 4294967295, !0), la.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(ei, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -803,22 +804,22 @@ class ti {
     return g;
   }
 }
-const _c = 0, gc = 2, pc = 512, hc = 1024, ei = 65536, ni = 8192;
-async function ai(c, t, e) {
+const gc = 0, pc = 2, hc = 512, Lc = 1024, ai = 65536, ii = 8192;
+async function oi(c, t, e) {
   if (typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || ei,
-    pageSize: e || ni
+    cacheSize: t || ai,
+    pageSize: e || ii
   }), c.type == "file")
-    return await Qa(c.fileName, hc | pc | gc, c.cacheSize, c.pageSize);
+    return await Ka(c.fileName, Lc | hc | pc, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return lc(c);
+    return uc(c);
   if (c.type == "bigMem")
-    return dc(c);
+    return fc(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function ii(c, t, e) {
+async function ci(c, t, e) {
   if (c instanceof Uint8Array && (c = {
     type: "mem",
     data: c
@@ -832,18 +833,18 @@ async function ii(c, t, e) {
   }) : typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || ei,
-    pageSize: e || ni
+    cacheSize: t || ai,
+    pageSize: e || ii
   }), c.type == "file")
-    return await Qa(c.fileName, _c, c.cacheSize, c.pageSize);
+    return await Ka(c.fileName, gc, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return await uc(c);
+    return await dc(c);
   if (c.type == "bigMem")
-    return await fc(c);
+    return await _c(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function la(c, t, e, n, a) {
-  const s = await ii(c, n, a), g = await s.read(4);
+async function ua(c, t, e, n, a) {
+  const s = await ci(c, n, a), g = await s.read(4);
   let d = "";
   for (let y = 0; y < 4; y++)
     d += String.fromCharCode(g[y]);
@@ -862,20 +863,20 @@ async function la(c, t, e, n, a) {
   }
   return { fd: s, sections: o };
 }
-async function Lc(c, t, e, n, a, s) {
-  const g = await ai(c, a, s), d = new Uint8Array(4);
+async function mc(c, t, e, n, a, s) {
+  const g = await oi(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;
 }
-async function ua(c, t) {
+async function da(c, t) {
   if (typeof c.writingSection < "u")
     throw new Error("Already writing a section");
   await c.writeULE32(t), c.writingSection = {
     pSectionSize: c.pos
   }, await c.writeULE64(0);
 }
-async function da(c) {
+async function fa(c) {
   if (typeof c.writingSection > "u")
     throw new Error("Not writing a section");
   const t = c.pos - c.writingSection.pSectionSize - 8, e = c.pos;
@@ -897,13 +898,13 @@ async function Xe(c, t) {
     throw new Error("Invalid section size reading");
   delete c.readingSection;
 }
-async function mc(c, t, e, n) {
+async function bc(c, t, e, n) {
   const a = new Uint8Array(e);
-  Ha.toRprLE(a, 0, t, e), await c.write(a, n);
+  Qa.toRprLE(a, 0, t, e), await c.write(a, n);
 }
 async function Be(c, t, e) {
   const n = await c.read(t, e);
-  return Ha.fromRprLE(n, 0, t);
+  return Qa.fromRprLE(n, 0, t);
 }
 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)
@@ -911,15 +912,15 @@ async function Fe(c, t, e, n, a) {
   let 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 bc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
-function rn(c, t) {
+const yc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+function ln(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 = rn;
-function yc(c, t) {
+const ee = ln;
+function Cc(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
   for (let n = 0; n < c.length; n++)
@@ -928,12 +929,12 @@ function yc(c, t) {
 }
 function Ve(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + bc[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + yc[parseInt(t[0], 16)];
 }
-function oi(c) {
+function si(c) {
   return BigInt(c) < BigInt(0);
 }
-function ci(c) {
+function ri(c) {
   return !c;
 }
 function nn(c, t) {
@@ -942,11 +943,11 @@ function nn(c, t) {
 function Ie(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const Cc = nn, Ac = Ie;
-function jn(c) {
+const Ac = nn, Fc = Ie;
+function $n(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function Fc(c) {
+function Ec(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -959,47 +960,47 @@ function Fc(c) {
   }
   return e;
 }
-function si(c) {
+function li(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 ri(c) {
+function ui(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function Ec(c, t) {
+function wc(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
     e.unshift(Number(n % t)), n = n / t;
   return e;
 }
-function $n(c, t) {
+function Gn(c, t) {
   return BigInt(c) + BigInt(t);
 }
 function Le(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function li(c) {
+function di(c) {
   return -BigInt(c);
 }
-function ui(c, t) {
+function fi(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function wc(c) {
+function Bc(c) {
   return BigInt(c) * BigInt(c);
 }
 function He(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function Bc(c, t) {
+function vc(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function vc(c) {
+function xc(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
 function Oe(c, t) {
@@ -1011,37 +1012,37 @@ function ge(c, t) {
 function Ee(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function xc(c, t) {
+function Sc(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function Sc(c, t) {
+function Ic(c, t) {
   return BigInt(c) < BigInt(t);
 }
-function On(c, t) {
+function Pn(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Ic(c, t) {
+function Oc(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function di(c, t) {
+function _i(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function Gn(c, t) {
+function Zn(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function Oc(c, t) {
+function Pc(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function Pc(c, t) {
+function kc(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function kc(c, t) {
+function Tc(c, t) {
   return BigInt(c) && BigInt(t);
 }
-function Tc(c, t) {
+function qc(c, t) {
   return BigInt(c) || BigInt(t);
 }
-function qc(c) {
+function Dc(c) {
   return !BigInt(c);
 }
 function Ge(c, t, e, n) {
@@ -1051,9 +1052,9 @@ function Ge(c, t, e, n) {
   for (let d = g; d < s.length; d++)
     s[d] = 0;
   for (let d = s.length * 4; d < n; d++)
-    c[d] = ri(Gn(Ie(e, d * 8), 255));
+    c[d] = ui(Zn(Ie(e, d * 8), 255));
 }
-function fi(c, t, e, n) {
+function gi(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);
@@ -1063,75 +1064,75 @@ function fi(c, t, e, n) {
 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")), rn(a.join(""), 16);
+  return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), ln(a.join(""), 16);
 }
-function _i(c, t, e) {
+function pi(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 rn(a.join(""), 16);
+  return ln(a.join(""), 16);
 }
-function gi(c, t) {
+function hi(c, t) {
   return c.toString(t);
 }
 function Pe(c) {
   const t = new Uint8Array(Math.floor((Ve(c) - 1) / 8) + 1);
   return Ge(t, 0, c, t.byteLength), t;
 }
-const pi = ee(0), we = ee(1);
-var Dc = /* @__PURE__ */ Object.freeze({
+const Li = ee(0), we = ee(1);
+var Mc = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  abs: vc,
-  add: $n,
-  band: Gn,
+  abs: xc,
+  add: Gn,
+  band: Zn,
   bitLength: Ve,
-  bits: si,
-  bor: Oc,
-  bxor: Pc,
+  bits: li,
+  bor: Pc,
+  bxor: kc,
   div: Oe,
   e: ee,
   eq: Ee,
-  exp: Bc,
-  fromArray: yc,
-  fromRprBE: _i,
+  exp: vc,
+  fromArray: Cc,
+  fromRprBE: pi,
   fromRprLE: Ze,
-  fromString: rn,
-  geq: di,
-  gt: On,
-  isNegative: oi,
-  isOdd: jn,
-  isZero: ci,
-  land: kc,
-  leq: Ic,
-  lnot: qc,
-  lor: Tc,
-  lt: Sc,
+  fromString: ln,
+  geq: _i,
+  gt: Pn,
+  isNegative: si,
+  isOdd: $n,
+  isZero: ri,
+  land: Tc,
+  leq: Oc,
+  lnot: Dc,
+  lor: qc,
+  lt: Ic,
   mod: ge,
-  mul: ui,
-  naf: Fc,
-  neg: li,
-  neq: xc,
+  mul: fi,
+  naf: Ec,
+  neg: di,
+  neq: Sc,
   one: we,
   pow: He,
   shiftLeft: nn,
   shiftRight: Ie,
-  shl: Cc,
-  shr: Ac,
-  square: wc,
+  shl: Ac,
+  shr: Fc,
+  square: Bc,
   sub: Le,
-  toArray: Ec,
+  toArray: wc,
   toLEBuff: Pe,
-  toNumber: ri,
-  toRprBE: fi,
+  toNumber: ui,
+  toRprBE: gi,
   toRprLE: Ge,
-  toString: gi,
-  zero: pi
+  toString: hi,
+  zero: Li
 });
-function fa(c, t, e) {
-  if (ci(e))
+function _a(c, t, e) {
+  if (ri(e))
     return c.one;
-  const n = si(e);
+  const n = li(e);
   if (n.length == 0)
     return c.one;
   let a = t;
@@ -1139,29 +1140,29 @@ function fa(c, t, e) {
     a = c.square(a), n[s] && (a = c.mul(a, t));
   return a;
 }
-function Mc(c) {
+function Rc(c) {
   if (c.m % 2 == 1)
     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 if (Ee(ge(c.p, 16), 9))
+          zc(c);
         else
           throw new Error("Field withot sqrt");
       else if (Ee(ge(c.p, 8), 5))
-        zc(c);
+        Uc(c);
       else
         throw new Error("Field withot sqrt");
     else
-      Ee(ge(c.p, 4), 3) && Uc(c);
+      Ee(ge(c.p, 4), 3) && jc(c);
   else {
     const t = ge(He(c.p, c.m / 2), 4);
-    t == 1 ? jc(c) : t == 3 ? $c(c) : Gc(c);
+    t == 1 ? $c(c) : t == 3 ? Gc(c) : Zc(c);
   }
 }
-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); )
+function Nc(c) {
+  for (c.sqrt_q = He(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = Le(c.sqrt_q, 1); !$n(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); ) {
@@ -1189,17 +1190,17 @@ function Rc(c) {
     return n.geq(d, n.zero) ? d : n.neg(d);
   };
 }
-function Nc(c) {
+function zc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 4 not implemented");
   };
 }
-function zc(c) {
+function Uc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 3 not implemented");
   };
 }
-function Uc(c) {
+function jc(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;
@@ -1210,12 +1211,12 @@ function Uc(c) {
     return c.geq(a, c.zero) ? a : c.neg(a);
   };
 }
-function jc(c) {
+function $c(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 10 not implemented");
   };
 }
-function $c(c) {
+function Gc(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) {
@@ -1233,7 +1234,7 @@ function $c(c) {
     return e.geq(d, e.zero) ? d : e.neg(d);
   };
 }
-function Gc(c) {
+function Zc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 8 not implemented");
   };
@@ -1241,10 +1242,10 @@ function Gc(c) {
 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 Zc(c) {
+function Wc(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 Wc {
+class Xc {
   constructor(t) {
     t = t || [0, 0, 0, 0, 0, 0, 0, 0], this.state = [
       1634760805,
@@ -1269,7 +1270,7 @@ class Wc {
     return this.idx == 16 && this.update(), this.buff[this.idx++];
   }
   nextU64() {
-    return $n(ui(this.nextU32(), 4294967296), this.nextU32());
+    return Gn(fi(this.nextU32(), 4294967296), this.nextU32());
   }
   nextBool() {
     return (this.nextU32() & 1) == 1;
@@ -1278,14 +1279,14 @@ class Wc {
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.state[t];
     for (let t = 0; t < 10; t++)
-      Zc(this.buff);
+      Wc(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)));
   }
 }
-var Xc = ho(), Vc = /* @__PURE__ */ Lo(Xc);
-function hi(c) {
+var Vc = mo(), Hc = /* @__PURE__ */ ja(Vc);
+function mi(c) {
   let t = new Uint8Array(c);
   if (Se.browser)
     if (typeof globalThis.crypto < "u")
@@ -1294,20 +1295,20 @@ function hi(c) {
       for (let e = 0; e < c; e++)
         t[e] = Math.random() * 4294967296 >>> 0;
   else
-    Vc.randomFillSync(t);
+    Hc.randomFillSync(t);
   return t;
 }
-function Hc() {
-  const c = hi(32), t = new Uint32Array(c.buffer), e = [];
+function Qc() {
+  const c = mi(32), t = new Uint32Array(c.buffer), e = [];
   for (let n = 0; n < 8; n++)
     e.push(t[n]);
   return e;
 }
 let Ke = null;
-function Zn() {
-  return Ke || (Ke = new Wc(Hc()), Ke);
+function Wn() {
+  return Ke || (Ke = new Xc(Qc()), Ke);
 }
-class Qc {
+class Jc {
   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;
@@ -1331,7 +1332,7 @@ class Qc {
   fft(t) {
     if (t.length <= 1)
       return t;
-    const e = _a(t.length - 1) + 1;
+    const e = ga(t.length - 1) + 1;
     this._setRoots(e);
     const n = 1 << e;
     if (t.length != n)
@@ -1341,7 +1342,7 @@ class Qc {
   ifft(t) {
     if (t.length <= 1)
       return t;
-    const e = _a(t.length - 1) + 1;
+    const e = ga(t.length - 1) + 1;
     this._setRoots(e);
     const n = 1 << e;
     if (t.length != n)
@@ -1352,7 +1353,7 @@ class Qc {
     return g;
   }
 }
-function _a(c) {
+function ga(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 an(c, t, e, n, a) {
@@ -1369,7 +1370,7 @@ function an(c, t, e, n, a) {
     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 Kc {
   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 = 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;
@@ -1379,7 +1380,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), 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);
+    this.nqr_to_t = this.pow(this.nqr, this.t), Rc(this), this.FFT = new Jc(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;
@@ -1452,10 +1453,10 @@ class Jc {
     return t % e;
   }
   pow(t, e) {
-    return fa(this, t, e);
+    return _a(this, t, e);
   }
   exp(t, e) {
-    return fa(this, t, e);
+    return _a(this, t, e);
   }
   band(t, e) {
     const n = t & e & this.mask;
@@ -1531,7 +1532,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(hi(1)[0]);
+      e = (e << BigInt(8)) + BigInt(mi(1)[0]);
     return e % this.p;
   }
   toString(t, e) {
@@ -1564,7 +1565,7 @@ class Jc {
   }
   // Returns a buffer with Big Endian Representation
   toRprBE(t, e, n) {
-    fi(t, e, n, this.n64 * 8);
+    gi(t, e, n, this.n64 * 8);
   }
   // Returns a buffer with Big Endian Montgomery Representation
   toRprBEM(t, e, n) {
@@ -1579,7 +1580,7 @@ class Jc {
   }
   // Pases a buffer with Big Endian Representation
   fromRprBE(t, e) {
-    return _i(t, e, this.n8);
+    return pi(t, e, this.n8);
   }
   fromRprLEM(t, e) {
     return this.mul(this.fromRprLE(t, e), this.Ri);
@@ -1609,7 +1610,7 @@ ye.bigInt2U32LE = function(t, e) {
 ye.isOcamNum = function(c) {
   return !(!Array.isArray(c) || c.length != 3 || typeof c[0] != "number" || typeof c[1] != "number" || !Array.isArray(c[2]));
 };
-var Kc = function(t, e, n) {
+var Yc = function(t, e, n) {
   const a = n || "int";
   if (t.modules[a])
     return a;
@@ -2335,7 +2336,7 @@ var Kc = function(t, e, n) {
     ));
   }
   return d(), C(), o(), l(), y(), E(), m(), x(), O(), L(), I(), w(), S(), t.exportFunction(a + "_copy"), t.exportFunction(a + "_zero"), t.exportFunction(a + "_one"), t.exportFunction(a + "_isZero"), t.exportFunction(a + "_eq"), t.exportFunction(a + "_gte"), t.exportFunction(a + "_add"), t.exportFunction(a + "_sub"), t.exportFunction(a + "_mul"), t.exportFunction(a + "_square"), t.exportFunction(a + "_squareOld"), t.exportFunction(a + "_div"), t.exportFunction(a + "_inverseMod"), a;
-}, Wn = function(t, e, n, a, s, g, d) {
+}, Xn = function(t, e, n, a, s, g, d) {
   const C = t.addFunction(e);
   C.addParam("base", "i32"), C.addParam("scalar", "i32"), C.addParam("scalarLength", "i32"), C.addParam("r", "i32"), C.addLocal("i", "i32"), C.addLocal("b", "i32");
   const l = C.getCodeBuilder(), o = l.i32_const(t.alloc(n));
@@ -2383,8 +2384,8 @@ var Kc = function(t, e, n) {
       );
     return E;
   }
-}, Xn = Yc;
-function Yc(c, t) {
+}, Vn = ts;
+function ts(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));
@@ -2491,8 +2492,8 @@ function Yc(c, t) {
     )
   );
 }
-var Li = ts;
-function ts(c, t, e, n, a, s) {
+var bi = es;
+function es(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");
@@ -2547,8 +2548,8 @@ function ts(c, t, e, n, a, s) {
     ))
   );
 }
-var es = ns;
-function ns(c, t, e, n, a, s) {
+var ns = as;
+function as(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");
@@ -2620,26 +2621,26 @@ function ns(c, t, e, n, a, s) {
   );
 }
 var le = {};
-function mi(c, t) {
+function yi(c, t) {
   return c === t ? 0 : c > t ? 1 : -1;
 }
-function Vn(c) {
+function Hn(c) {
   return c * c;
 }
-function bi(c) {
+function Ci(c) {
   return c % 2n !== 0n;
 }
-function Hn(c) {
+function Qn(c) {
   return c % 2n === 0n;
 }
-function ln(c) {
+function un(c) {
   return c < 0n;
 }
-function as(c) {
+function is(c) {
   return c > 0n;
 }
-function yi(c) {
-  return ln(c) ? c.toString(2).length - 1 : c.toString(2).length;
+function Ai(c) {
+  return un(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
 function Qe(c) {
   return c < 0n ? -c : c;
@@ -2647,52 +2648,52 @@ function Qe(c) {
 function ke(c) {
   return Qe(c) === 1n;
 }
-function Ci(c, t) {
+function Fi(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 (!ke(a))
     throw new Error(c.toString() + " and " + t.toString() + " are not co-prime");
-  return mi(e, 0n) === -1 && (e = e + t), ln(c) ? -e : e;
+  return yi(e, 0n) === -1 && (e = e + t), un(c) ? -e : e;
 }
-function Ai(c, t, e) {
+function Ei(c, t, e) {
   if (e === 0n)
     throw new Error("Cannot take modPow with modulus 0");
   var n = 1n, a = c % e;
-  for (ln(t) && (t = t * -1n, a = Ci(a, e)); as(t); ) {
+  for (un(t) && (t = t * -1n, a = Fi(a, e)); is(t); ) {
     if (a === 0n)
       return 0n;
-    bi(t) && (n = n * a % e), t = t / 2n, a = Vn(a) % e;
+    Ci(t) && (n = n * a % e), t = t / 2n, a = Hn(a) % e;
   }
   return n;
 }
-function is(c, t) {
+function os(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 : ke(t) ? !0 : is(t, 2n) === 0 ? Hn(c) : c % t === 0n;
+function pa(c, t) {
+  return t === 0n ? !1 : ke(t) ? !0 : os(t, 2n) === 0 ? Qn(c) : c % t === 0n;
 }
-function os(c) {
+function cs(c) {
   var t = Qe(c);
   if (ke(t))
     return !1;
   if (t === 2n || t === 3n || t === 5n)
     return !0;
-  if (Hn(t) || ga(t, 3n) || ga(t, 5n))
+  if (Qn(t) || pa(t, 3n) || pa(t, 5n))
     return !1;
   if (t < 49n)
     return !0;
 }
-function cs(c) {
+function ss(c) {
   return c - 1n;
 }
-function pa(c, t) {
-  for (var e = cs(c), n = e, a = 0, s, g, d; Hn(n); )
+function ha(c, t) {
+  for (var e = ss(c), n = e, a = 0, s, g, d; Qn(n); )
     n = n / 2n, a++;
   t:
     for (g = 0; g < t.length; g++)
-      if (!(c < t[g]) && (d = Ai(BigInt(t[g]), n, c), !(ke(d) || d === e))) {
+      if (!(c < t[g]) && (d = Ei(BigInt(t[g]), n, c), !(ke(d) || d === e))) {
         for (s = a - 1; s != 0; s--) {
-          if (d = Vn(d) % c, ke(d))
+          if (d = Hn(d) % c, ke(d))
             return !1;
           if (d === e)
             continue t;
@@ -2701,33 +2702,33 @@ function pa(c, t) {
       }
   return !0;
 }
-function ss(c) {
-  var t = os(c);
+function rs(c) {
+  var t = cs(c);
   if (t !== void 0)
     return t;
-  var e = Qe(c), n = yi(e);
+  var e = Qe(c), n = Ai(e);
   if (n <= 64)
-    return pa(e, [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]);
+    return ha(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);
+  return ha(e, g);
 }
-le.bitLength = yi;
-le.isOdd = bi;
-le.isNegative = ln;
+le.bitLength = Ai;
+le.isOdd = Ci;
+le.isNegative = un;
 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((ds(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
+le.compare = yi;
+le.modInv = Fi;
+le.modPow = Ei;
+le.isPrime = rs;
+le.square = Hn;
+const ls = Yc, pe = ye, us = Xn, ds = Vn, Ln = bi, mn = ns, { bitLength: fs, modInv: bn, modPow: La, isPrime: ma, isOdd: _s, square: gs } = le;
+var Jn = function(t, e, n, a) {
+  const s = BigInt(e), g = Math.floor((fs(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
   if (t.modules[l])
     return l;
-  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));
+  const o = ls(t, g, a), y = t.alloc(C, pe.bigInt2BytesLE(s, C)), E = t.alloc(pe.bigInt2BytesLE(gs(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,
@@ -2806,7 +2807,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 - mn(s, 0x100000000n));
+    const it = b.getCodeBuilder(), At = Number(0x100000000n - bn(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(
@@ -2868,7 +2869,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 - mn(s, 0x100000000n));
+    const b = z.getCodeBuilder(), it = Number(0x100000000n - bn(s, 0x100000000n));
     z.addCode(b.setLocal("np32", b.i64_const(it)));
     const At = [], Lt = [], yt = [];
     function It(Et, bt) {
@@ -3007,7 +3008,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 - mn(s, 0x100000000n));
+    const b = z.getCodeBuilder(), it = Number(0x100000000n - bn(s, 0x100000000n));
     z.addCode(b.setLocal("np32", b.i64_const(it)));
     const At = [], Lt = [];
     function yt(bt, pt) {
@@ -3250,13 +3251,13 @@ var Qn = function(t, e, n, a) {
     z.addCode(b.call(l + "_fromMontgomery", b.getLocal("x"), b.getLocal("r"))), z.addCode(b.call(o + "_inverseMod", b.getLocal("r"), b.i32_const(y), b.getLocal("r"))), z.addCode(b.call(l + "_toMontgomery", b.getLocal("r"), b.getLocal("r")));
   }
   let nt = 2n;
-  if (La(s))
-    for (; ha(nt, L, s) !== O; )
+  if (ma(s))
+    for (; La(nt, L, s) !== O; )
       nt = nt + 1n;
   let J = 0, ft = O;
-  for (; !fs(ft) && ft !== 0n; )
+  for (; !_s(ft) && ft !== 0n; )
     J++, ft = ft >> 1n;
-  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));
+  const at = t.alloc(C, pe.bigInt2BytesLE(ft, C)), _t = La(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");
@@ -3380,7 +3381,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(), 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(
+  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(), ds(t, l), Ln(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), Ln(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), Ln(t, l + "_batchNeg", l + "_neg", C, C), mn(t, l + "_batchAdd", l + "_add", C, C), mn(t, l + "_batchSub", l + "_sub", C, C), mn(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"), us(
     t,
     l + "_exp",
     C,
@@ -3388,17 +3389,17 @@ var Qn = function(t, e, n, a) {
     l + "_square",
     o + "_copy",
     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;
+  ), t.exportFunction(l + "_exp"), t.exportFunction(l + "_batchInverse"), ma(s) && (P(), i(), t.exportFunction(l + "_sqrt"), t.exportFunction(l + "_isSquare")), t.exportFunction(l + "_batchToMontgomery"), t.exportFunction(l + "_batchFromMontgomery"), l;
 };
-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";
+const ps = Jn, { bitLength: hs } = le;
+var wi = function(t, e, n, a, s) {
+  const g = BigInt(e), d = Math.floor((hs(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 = gs(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
+  const o = s || "int", y = ps(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");
@@ -3427,8 +3428,8 @@ var Fi = 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 hs = Wn, Ls = Xn, bn = ye;
-var Ei = function(t, e, n, a) {
+const Ls = Xn, ms = Vn, yn = ye;
+var Bi = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8, g = t.modules[a].q;
@@ -3661,7 +3662,7 @@ var Ei = 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(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));
+    const A = D.getCodeBuilder(), M = A.i32_const(t.alloc(yn.bigInt2BytesLE((BigInt(g || 0) - 3n) / 4n, s))), H = A.i32_const(t.alloc(yn.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),
@@ -3700,7 +3701,7 @@ var Ei = 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(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);
+    const A = D.getCodeBuilder(), M = A.i32_const(t.alloc(yn.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),
@@ -3724,7 +3725,7 @@ var Ei = 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"), Ls(t, n), hs(
+  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"), ms(t, n), Ls(
     t,
     n + "_exp",
     s * 2,
@@ -3734,8 +3735,8 @@ var Ei = 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 ms = Wn, bs = Xn;
-var wi = function(t, e, n, a) {
+const bs = Xn, ys = Vn;
+var vi = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8;
@@ -3992,7 +3993,7 @@ var wi = 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"), bs(t, n), ms(
+  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"), ys(t, n), bs(
     t,
     n + "_exp",
     s * 3,
@@ -4001,7 +4002,7 @@ var wi = 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;
-}, ys = function(t, e, n, a, s, g, d, C) {
+}, Cs = 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));
@@ -4184,7 +4185,7 @@ var wi = function(t, e, n, a) {
     )),
     o.i32_store(o.i32_const(0), o.getLocal("old0"))
   );
-}, Cs = function(t, e, n, a, s) {
+}, As = function(t, e, n, a, s) {
   const d = t.modules[e].n64 * 8;
   function C() {
     const E = t.addFunction(n + "_getChunk");
@@ -4576,8 +4577,8 @@ var wi = function(t, e, n, a) {
   }
   C(), y(), l(), o(), t.exportFunction(n), t.exportFunction(n + "_chunk");
 };
-const ma = ys, Me = Li, ba = Cs;
-var Bi = function(t, e, n, a) {
+const ba = Cs, Me = bi, ya = As;
+var xi = function(t, e, n, a) {
   const s = t.modules[n].n64, g = s * 8;
   if (t.modules[e])
     return e;
@@ -5475,7 +5476,7 @@ var Bi = 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(), 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(
+  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), ya(t, e, e + "_multiexp", e + "_add", g * 3), ya(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), ba(
     t,
     e + "_timesScalar",
     g * 3,
@@ -5484,7 +5485,7 @@ var Bi = function(t, e, n, a) {
     e + "_sub",
     e + "_copy",
     e + "_zero"
-  ), ma(
+  ), ba(
     t,
     e + "_timesScalarAffine",
     g * 2,
@@ -5495,11 +5496,11 @@ var Bi = 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: As, modInv: ya, modPow: Re } = le, Ye = ye;
-var vi = function(t, e, n, a, s) {
+const { isOdd: Fs, modInv: Ca, modPow: Re } = le, Ye = ye;
+var Si = 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 (; !As(y); )
+  for (; !Fs(y); )
     E++, y = y >> 1n;
   let m = 2n;
   for (; Re(m, o >> 1n, o) === 1n; )
@@ -5520,12 +5521,12 @@ var vi = function(t, e, n, a, s) {
     U[q] = U[q - 1] * 2n;
   const w = [];
   for (let q = 0; q <= E; q++) {
-    const u = ya(U[q], o) * I % o;
+    const u = Ca(U[q], o) * I % o;
     w.push(...Ye.bigInt2BytesLE(u, d));
   }
   const S = t.alloc(w), F = Re(m, 2n, o), r = [], h = [];
   for (let q = 0; q <= E; q++) {
-    const u = Re(F, 2n ** BigInt(q), o), W = ya(o + 1n - u, o);
+    const u = Re(F, 2n ** BigInt(q), o), W = Ca(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);
@@ -6518,7 +6519,7 @@ var vi = 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");
-}, xi = function(t, e, n) {
+}, Ii = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const C = t.addFunction(e + "_zero");
@@ -6611,7 +6612,7 @@ var vi = function(t, e, n, a, s) {
     );
   }
   return g(), d(), t.exportFunction(e + "_zero"), t.exportFunction(e + "_constructLC"), e;
-}, Si = function(t, e, n) {
+}, Oi = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const l = t.addFunction(e + "_buildABC");
@@ -6881,7 +6882,7 @@ var vi = function(t, e, n, a, s) {
     );
   }
   return g(), d(), C(), t.exportFunction(e + "_buildABC"), t.exportFunction(e + "_joinABC"), t.exportFunction(e + "_batchAdd"), e;
-}, Ii = function(t, e, n, a, s, g, d, C) {
+}, Pi = 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));
@@ -6918,19 +6919,19 @@ var vi = function(t, e, n, a, s) {
     ))
   ), t.exportFunction(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 Nt = ye, Es = Jn, ws = wi, Aa = Bi, Bs = vi, Fa = xi, Cn = Si, vs = Ii, xs = Oi, Ne = Pi, { bitLength: Ss, modInv: Is, isOdd: Ea, isNegative: Os } = le;
+var Ps = function(t, e) {
   const n = e || "bn128";
   if (t.modules[n])
     return n;
-  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);
-  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([
+  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((Ss(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 = Es(t, a, "f1m");
+  ws(t, s, "fr", "frm");
+  const x = t.alloc(Nt.bigInt2BytesLE(w(3n), l)), O = Fa(t, "g1m", "f1m", x);
+  Cn(t, "frm", "frm", "frm", "frm_mul"), vs(t, "pol", "frm"), xs(t, "qap", "frm");
+  const L = Aa(t, "f1m_neg", "f2m", "f1m"), I = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
     ...Nt.bigInt2BytesLE(w(266929791119991161246907387137283842545076965332900288569378510910307636690n), l)
-  ]), v = Aa(t, "g2m", "f2m", I);
+  ]), v = Fa(t, "g2m", "f2m", I);
   function U(Y, f) {
     const _ = t.addFunction(Y);
     _.addParam("pG", "i32"), _.addParam("pFr", "i32"), _.addParam("pr", "i32");
@@ -6946,7 +6947,7 @@ var Os = function(t, e) {
       )
     ), t.exportFunction(Y);
   }
-  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");
+  U("g1m_timesFr", "g1m_timesScalar"), Cn(t, "g1m", "g1m", "frm", "g1m_timesFr"), U("g2m_timesFr", "g2m_timesScalar"), Cn(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;
   }
@@ -7031,7 +7032,7 @@ var Os = function(t, e) {
     ...Nt.bigInt2BytesLE(w(9), l),
     ...Nt.bigInt2BytesLE(w(1), l)
   ]), H = t.alloc([
-    ...Nt.bigInt2BytesLE(w(Ss(2n, a)), l),
+    ...Nt.bigInt2BytesLE(w(Is(2n, a)), l),
     ...Nt.bigInt2BytesLE(0n, l)
   ]), ut = M, nt = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
@@ -7051,7 +7052,7 @@ var Os = function(t, e) {
     );
   }
   J();
-  const ft = ws(t, n + "_mulNR6", "f6m", "f2m");
+  const ft = Bs(t, n + "_mulNR6", "f6m", "f2m");
   function at() {
     const Y = t.addFunction(n + "_mulNR12");
     Y.addParam("x", "i32"), Y.addParam("pr", "i32");
@@ -7076,7 +7077,7 @@ var Os = function(t, e) {
     );
   }
   at();
-  const _t = Ca(t, n + "_mulNR12", "ftm", ft), G = At(29793968203157093288n), K = t.alloc(G), P = 3 * o, i = G.length - 1, u = G.reduce((Y, f) => Y + (f != 0 ? 1 : 0), 0) + i + 1, W = 3 * 2 * d, z = 3 * d * 2 + u * P;
+  const _t = Aa(t, n + "_mulNR12", "ftm", ft), G = At(29793968203157093288n), K = t.alloc(G), P = 3 * o, i = G.length - 1, u = G.reduce((Y, f) => Y + (f != 0 ? 1 : 0), 0) + i + 1, W = 3 * 2 * d, z = 3 * d * 2 + u * P;
   t.modules[n] = {
     n64: g,
     pG1gen: F,
@@ -7098,7 +7099,7 @@ var Os = function(t, e) {
     let f = Y;
     const _ = [];
     for (; f > 0n; ) {
-      if (Fa(f)) {
+      if (Ea(f)) {
         const Z = 2 - Number(f % 4n);
         _.push(Z), f = f - BigInt(Z);
       } else
@@ -7111,7 +7112,7 @@ var Os = function(t, e) {
     let f = Y;
     const _ = [];
     for (; f > 0n; )
-      Fa(f) ? _.push(1) : _.push(0), f = f >> 1n;
+      Ea(f) ? _.push(1) : _.push(0), f = f >> 1n;
     return _;
   }
   function Lt() {
@@ -7505,7 +7506,7 @@ var Os = function(t, e) {
         (ct * rt - st * ot) % a,
         (ct * ot + st * rt) % a
       ];
-      return Is(gt[0]) && (gt[0] = gt[0] + a), gt;
+      return Os(gt[0]) && (gt[0] = gt[0] + a), gt;
     }
   }
   function $t() {
@@ -7738,19 +7739,19 @@ var Os = 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 = 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 Mt = ye, ks = Jn, Ts = wi, wa = Bi, qs = vi, Ba = xi, An = Si, Ds = Ii, Ms = Oi, ze = Pi, { bitLength: va, isOdd: xa, isNegative: Rs } = le;
+var Ns = 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 = 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);
-  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([
+  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((va(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((va(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = ks(t, a, "f1m", "intq");
+  Ts(t, s, "fr", "frm", "intr");
+  const L = t.alloc(Mt.bigInt2BytesLE(F(4n), C)), I = Ba(t, "g1m", "f1m", L);
+  An(t, "frm", "frm", "frm", "frm_mul"), Ds(t, "pol", "frm"), Ms(t, "qap", "frm");
+  const v = wa(t, "f1m_neg", "f2m", "f1m"), U = t.alloc([
     ...Mt.bigInt2BytesLE(F(4n), C),
     ...Mt.bigInt2BytesLE(F(4n), C)
-  ]), w = wa(t, "g2m", "f2m", U);
+  ]), w = Ba(t, "g2m", "f2m", U);
   function S(f, _) {
     const Z = t.addFunction(f);
     Z.addParam("pG", "i32"), Z.addParam("pFr", "i32"), Z.addParam("pr", "i32");
@@ -7766,7 +7767,7 @@ var Rs = function(t, e) {
       )
     ), t.exportFunction(f);
   }
-  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");
+  S("g1m_timesFr", "g1m_timesScalar"), An(t, "g1m", "g1m", "frm", "g1m_timesFr"), S("g2m_timesFr", "g2m_timesScalar"), An(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;
   }
@@ -7862,7 +7863,7 @@ var Rs = function(t, e) {
     );
   }
   nt();
-  const J = Ts(t, v + "_mulNR", "f6m", "f2m");
+  const J = qs(t, v + "_mulNR", "f6m", "f2m");
   function ft() {
     const f = t.addFunction(J + "_mulNR");
     f.addParam("x", "i32"), f.addParam("pr", "i32");
@@ -7891,7 +7892,7 @@ var Rs = function(t, e) {
     );
   }
   ft();
-  const at = Ea(t, J + "_mulNR", "ftm", J), zt = At(0xd201000000010000n), G = t.alloc(zt), K = 3 * l, P = zt.length - 1, q = zt.reduce((f, _) => f + (_ != 0 ? 1 : 0), 0) + P + 1, u = 3 * 2 * d, W = 3 * d * 2 + q * K, z = !0, b = 15132376222941642752n;
+  const at = wa(t, J + "_mulNR", "ftm", J), zt = At(0xd201000000010000n), G = t.alloc(zt), K = 3 * l, P = zt.length - 1, q = zt.reduce((f, _) => f + (_ != 0 ? 1 : 0), 0) + P + 1, u = 3 * 2 * d, W = 3 * d * 2 + q * K, z = !0, b = 15132376222941642752n;
   t.modules[n] = {
     n64q: g,
     n64r: y,
@@ -7915,7 +7916,7 @@ var Rs = function(t, e) {
     let _ = f;
     const Z = [];
     for (; _ > 0n; ) {
-      if (va(_)) {
+      if (xa(_)) {
         const Q = 2 - Number(_ % 4n);
         Z.push(Q), _ = _ - BigInt(Q);
       } else
@@ -7928,7 +7929,7 @@ var Rs = function(t, e) {
     let _ = f;
     const Z = [];
     for (; _ > 0n; )
-      va(_) ? Z.push(1) : Z.push(0), _ = _ >> 1n;
+      xa(_) ? Z.push(1) : Z.push(0), _ = _ >> 1n;
     return Z;
   }
   function Lt() {
@@ -8321,7 +8322,7 @@ var Rs = function(t, e) {
         (st * ot - rt * gt) % a,
         (st * gt + rt * ot) % a
       ];
-      return Ms(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
+      return Rs(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
     }
   }
   function Jt() {
@@ -8552,7 +8553,7 @@ var Rs = 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), fe = _.i32_const(dt + l), Ce = _.i32_const(dt + l), qe = _.i32_const(dt + l + C), gn = _.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), pn = _.i32_const(dt + l * 2);
     f.addCode(
       _.if(
         _.call(w + "_isZeroAffine", _.getLocal("p")),
@@ -8580,7 +8581,7 @@ var Rs = function(t, e) {
       _.call(O + "_sub", qe, Ce, gt),
       _.call(O + "_add", Ce, qe, qe),
       _.call(O + "_copy", gt, Ce),
-      _.call(v + "_one", gn),
+      _.call(v + "_one", pn),
       _.call(w + "_timesScalar", qt, st, _.i32_const(8), qt),
       _.call(w + "_addMixed", qt, xt, qt),
       _.ret(
@@ -8638,47 +8639,47 @@ var Rs = 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");
-}, Ns = Os, zs = Rs;
-function Pn(c) {
+}, zs = Ps, Us = Ns;
+function kn(c) {
   if (typeof c == "bigint" || c.eq !== void 0)
     return c.toString(10);
   if (c instanceof Uint8Array)
     return Ze(c, 0);
   if (Array.isArray(c))
-    return c.map(Pn);
+    return c.map(kn);
   if (typeof c == "object") {
     const t = {};
     return Object.keys(c).forEach((n) => {
-      t[n] = Pn(c[n]);
+      t[n] = kn(c[n]);
     }), t;
   } else
     return c;
 }
-function kn(c) {
+function Tn(c) {
   if (typeof c == "string" && /^[0-9]+$/.test(c))
     return BigInt(c);
   if (typeof c == "string" && /^0x[0-9a-fA-F]+$/.test(c))
     return BigInt(c);
   if (Array.isArray(c))
-    return c.map(kn);
+    return c.map(Tn);
   if (typeof c == "object") {
     if (c === null)
       return null;
     const t = {};
     return Object.keys(c).forEach((n) => {
-      t[n] = kn(c[n]);
+      t[n] = Tn(c[n]);
     }), t;
   } else
     return c;
 }
-function Us(c) {
+function js(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 js(c, t) {
+function $s(c, t) {
   let e = c;
   const n = new Uint8Array(t), a = new DataView(n.buffer);
   let s = t;
@@ -8688,14 +8689,14 @@ function js(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function $s(c) {
+function Gs(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 Oi(c, t) {
+function ki(c, t) {
   let e = c;
   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);
@@ -8706,66 +8707,66 @@ function Oi(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function Tn(c, t) {
+function qn(c, t) {
   if (typeof t == "bigint" || t.eq !== void 0)
     return t.toString(10);
   if (t instanceof Uint8Array)
     return c.toString(c.e(t));
   if (Array.isArray(t))
-    return t.map(Tn.bind(this, c));
+    return t.map(qn.bind(this, c));
   if (typeof t == "object") {
     const e = {};
     return Object.keys(t).forEach((a) => {
-      e[a] = Tn(c, t[a]);
+      e[a] = qn(c, t[a]);
     }), e;
   } else
     return t;
 }
-function qn(c, t) {
+function Dn(c, t) {
   if (typeof t == "string" && /^[0-9]+$/.test(t))
     return c.e(t);
   if (typeof t == "string" && /^0x[0-9a-fA-F]+$/.test(t))
     return c.e(t);
   if (Array.isArray(t))
-    return t.map(qn.bind(this, c));
+    return t.map(Dn.bind(this, c));
   if (typeof t == "object") {
     if (t === null)
       return null;
     const e = {};
     return Object.keys(t).forEach((a) => {
-      e[a] = qn(c, t[a]);
+      e[a] = Dn(c, t[a]);
     }), e;
   } else
     return t;
 }
 const je = [];
 for (let c = 0; c < 256; c++)
-  je[c] = Gs(c, 8);
-function Gs(c, t) {
+  je[c] = Zs(c, 8);
+function Zs(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 Pi(c, t) {
+function Ti(c, t) {
   return (je[c >>> 24] | je[c >>> 16 & 255] << 8 | je[c >>> 8 & 255] << 16 | je[c & 255] << 24) >>> 32 - t;
 }
 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 ki(c, t) {
+function qi(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 = Pi(a, n);
+    const s = Ti(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);
     }
   }
 }
-function Jn(c, t) {
+function Kn(c, t) {
   const e = new Uint8Array(t * c.length);
   for (let n = 0; n < c.length; n++)
     e.set(c[n], n * t);
@@ -8777,21 +8778,21 @@ function on(c, t) {
     n[a] = c.slice(a * t, a * t + t);
   return n;
 }
-var Zs = /* @__PURE__ */ Object.freeze({
+var Ws = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  array2buffer: Jn,
-  beBuff2int: Us,
-  beInt2Buff: js,
-  bitReverse: Pi,
-  buffReverseBits: ki,
+  array2buffer: Kn,
+  beBuff2int: js,
+  beInt2Buff: $s,
+  bitReverse: Ti,
+  buffReverseBits: qi,
   buffer2array: on,
-  leBuff2int: $s,
-  leInt2Buff: Oi,
+  leBuff2int: Gs,
+  leInt2Buff: ki,
   log2: ue,
-  stringifyBigInts: Pn,
-  stringifyFElements: Tn,
-  unstringifyBigInts: kn,
-  unstringifyFElements: qn
+  stringifyBigInts: kn,
+  stringifyFElements: qn,
+  unstringifyBigInts: Tn,
+  unstringifyFElements: Dn
 });
 const se = 1 << 30;
 class Vt {
@@ -8864,7 +8865,7 @@ function be(c, t, e, n) {
     return o;
   };
 }
-class xa {
+class Sa {
   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 = 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");
@@ -8874,7 +8875,7 @@ class xa {
       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 = Le(this.p, we);
-    for (; !jn(g); )
+    for (; !$n(g); )
       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--)
@@ -8944,27 +8945,27 @@ class xa {
     if (t instanceof Uint8Array)
       return t;
     let n = ee(t, e);
-    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);
+    si(n) ? (n = di(n), Pn(n, this.p) && (n = ge(n, this.p)), n = Le(this.p, n)) : Pn(n, this.p) && (n = ge(n, this.p));
+    const a = ki(n, this.n8);
     return this.toMontgomery(a);
   }
   toString(t, e) {
     const n = this.fromMontgomery(t), a = Ze(n, 0);
-    return gi(a, e);
+    return hi(a, e);
   }
   fromRng(t) {
     let e;
     const n = new Uint8Array(this.n8);
     do {
-      e = pi;
+      e = Li;
       for (let a = 0; a < this.n64; a++)
-        e = $n(e, nn(t.nextU64(), 64 * a));
-      e = Gn(e, this.mask);
-    } while (di(e, this.p));
+        e = Gn(e, nn(t.nextU64(), 64 * a));
+      e = Zn(e, this.mask);
+    } while (_i(e, this.p));
     return Ge(n, 0, e, this.n8), n;
   }
   random() {
-    return this.fromRng(Zn());
+    return this.fromRng(Wn());
   }
   toObject(t) {
     const e = this.fromMontgomery(t);
@@ -8993,7 +8994,7 @@ class xa {
   async batchInverse(t) {
     let e = !1;
     const n = this.n8, a = this.n8;
-    Array.isArray(t) ? (t = Jn(t, n), e = !0) : t = t.slice(0, t.byteLength);
+    Array.isArray(t) ? (t = Kn(t, n), e = !0) : t = t.slice(0, t.byteLength);
     const s = Math.floor(t.byteLength / n);
     if (s * n !== t.byteLength)
       throw new Error("Invalid buffer size");
@@ -9027,7 +9028,7 @@ class xa {
     return e ? on(l, a) : l;
   }
 }
-class Sa {
+class Ia {
   constructor(t, e, n) {
     this.tm = t, this.prefix = e, this.F = n, this.type = "F2", this.m = n.m * 2, this.n8 = this.F.n8 * 2, this.n32 = this.F.n32 * 2, this.n64 = this.F.n64 * 2, this.pOp1 = t.alloc(n.n8 * 2), this.pOp2 = t.alloc(n.n8 * 2), this.pOp3 = t.alloc(n.n8 * 2), 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);
   }
@@ -9109,7 +9110,7 @@ class Sa {
     return a.set(e), a.set(n, this.F.n8), a;
   }
   random() {
-    return this.fromRng(Zn());
+    return this.fromRng(Wn());
   }
   toObject(t) {
     const e = this.F.toObject(t.slice(0, this.F.n8)), n = this.F.toObject(t.slice(this.F.n8, this.F.n8 * 2));
@@ -9126,7 +9127,7 @@ class Sa {
     return t.slice(this.F.n8);
   }
 }
-class Ws {
+class Xs {
   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);
   }
@@ -9205,7 +9206,7 @@ class Ws {
     return s.set(e), s.set(n, this.F.n8), s.set(a, this.F.n8 * 2), s;
   }
   random() {
-    return this.fromRng(Zn());
+    return this.fromRng(Wn());
   }
   toObject(t) {
     const e = this.F.toObject(t.slice(0, this.F.n8)), n = this.F.toObject(t.slice(this.F.n8, this.F.n8 * 2)), a = this.F.toObject(t.slice(this.F.n8 * 2, this.F.n8 * 3));
@@ -9225,7 +9226,7 @@ class Ws {
     return t.slice(this.F.n8 * 2);
   }
 }
-class Ia {
+class Oa {
   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 = 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);
   }
@@ -9454,7 +9455,7 @@ class Ia {
     return this.toAffine(t).slice(this.F.n8);
   }
 }
-function Ti(c) {
+function Di(c) {
   let e, n;
   c && (c.onmessage = function(o) {
     let y;
@@ -9583,34 +9584,34 @@ ie.EOL = `
 ie.homedir = function() {
   return "/";
 };
-var Xs = Worker;
-const An = 25;
-class Oa {
+var Vs = Worker;
+const Fn = 25;
+class Pa {
   constructor() {
     this.promise = new Promise((t, e) => {
       this.reject = e, this.resolve = t;
     });
   }
 }
-function Vs(c) {
+function Hs(c) {
   return new Promise((t) => setTimeout(t, c));
 }
-function Hs(c) {
-  return Se.browser ? globalThis.btoa(c) : po.from(c).toString("base64");
+function Qs(c) {
+  return Se.browser ? globalThis.btoa(c) : Lo.from(c).toString("base64");
 }
-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 Js = Qs("(" + Di.toString() + ")(self)"), Ks = "data:application/javascript;base64," + Js;
+async function Ys(c, t) {
+  const e = new tr();
+  e.memory = new WebAssembly.Memory({ initial: Fn }), 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 = Ti(), await e.taskManager([{
+    e.code = c.code, e.taskManager = Di(), await e.taskManager([{
       cmd: "INIT",
-      init: An,
+      init: Fn,
       code: e.code.slice()
     }]), e.concurrency = 1;
   else {
@@ -9618,13 +9619,13 @@ async function Ks(c, t) {
     let 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 Xs(Js), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
+      e.workers[d] = new Vs(Ks), 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: An,
+        init: Fn,
         code: C
       }], [C.buffer]));
     }
@@ -9638,7 +9639,7 @@ async function Ks(c, t) {
     };
   }
 }
-class Ys {
+class tr {
   constructor() {
     this.actionQueue = [], this.oldPFree = 0;
   }
@@ -9655,7 +9656,7 @@ class Ys {
   postAction(t, e, n, a) {
     if (this.working[t])
       throw new Error("Posting a job t a working worker");
-    return this.working[t] = !0, this.pendingDeferreds[t] = a || new Oa(), this.workers[t].postMessage(e, n), this.pendingDeferreds[t].promise;
+    return this.working[t] = !0, this.pendingDeferreds[t] = a || new Pa(), this.workers[t].postMessage(e, n), this.pendingDeferreds[t].promise;
   }
   processWorks() {
     for (let t = 0; t < this.workers.length && this.actionQueue.length > 0; t++)
@@ -9665,7 +9666,7 @@ class Ys {
       }
   }
   queueAction(t, e) {
-    const n = new Oa();
+    const n = new Pa();
     if (this.singleThread) {
       const a = this.taskManager(t);
       n.resolve(a);
@@ -9699,10 +9700,10 @@ class Ys {
   async terminate() {
     for (let t = 0; t < this.workers.length; t++)
       this.workers[t].postMessage([{ cmd: "TERMINATE" }]);
-    await Vs(200);
+    await Hs(200);
   }
 }
-function Fn(c, t) {
+function En(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";
@@ -9756,7 +9757,7 @@ function Fn(c, t) {
     return w;
   };
 }
-function tr(c) {
+function er(c) {
   const t = c.tm;
   c.pairing = function(n, a) {
     t.startSyncOp();
@@ -9823,7 +9824,7 @@ function tr(c) {
     return this.tm.endSyncOp(), s;
   };
 }
-const Pa = [
+const ka = [
   1,
   1,
   1,
@@ -9857,7 +9858,7 @@ const Pa = [
   17,
   17
 ];
-function ka(c, t) {
+function Ta(c, t) {
   const e = c[t], n = e.tm;
   async function a(g, d, C, l, o) {
     if (!(g instanceof Uint8Array))
@@ -9878,7 +9879,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[ue(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
+    const O = ka[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 },
@@ -9920,7 +9921,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[ue(x)], I = Math.floor((O * 8 - 1) / L) + 1;
+    const L = ka[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 = [];
@@ -9941,7 +9942,7 @@ function ka(c, t) {
     return await s(d, C, "affine", l, o);
   };
 }
-function En(c, t) {
+function wn(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";
@@ -9949,7 +9950,7 @@ function En(c, t) {
     let L, I, v, U, w, S, F, r;
     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);
+    Array.isArray(l) ? (l = Kn(l, L), h = !0) : l = l.slice(0, l.byteLength);
     const R = l.byteLength / L, j = ue(R);
     if (1 << j != R)
       throw new Error("fft must be multiple of 2");
@@ -9960,7 +9961,7 @@ function En(c, t) {
     let T;
     o && (T = n.inv(n.e(R)));
     let D;
-    ki(l, L);
+    qi(l, L);
     let A, M = Math.min(1 << O, R), H = R / M;
     for (; H < a.concurrency && M >= 16; )
       H *= 2, M /= 2;
@@ -10243,9 +10244,9 @@ function En(c, t) {
     return w;
   };
 }
-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) {
+async function Mi(c) {
+  const t = await Ys(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 Sa(t, "frm", c.n8r, c.r), e.F1 = new Sa(t, "f1m", c.n8q, c.q), e.F2 = new Ia(t, "f2m", e.F1), e.G1 = new Oa(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Oa(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Xs(t, "f6m", e.F2), e.F12 = new Ia(t, "ftm", e.F6), e.Gt = e.F12, En(e, "G1"), En(e, "G2"), En(e, "Fr"), Ta(e, "G1"), Ta(e, "G2"), wn(e, "G1"), wn(e, "G2"), wn(e, "Fr"), er(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);
@@ -10260,20 +10261,20 @@ async function qi(c) {
 function Te(c) {
   return BigInt(c);
 }
-function Di(c) {
+function Ri(c) {
   return c < 0n;
 }
-function er(c) {
+function nr(c) {
   return c === 0n;
 }
-function nr(c) {
-  return Di(c) ? c.toString(2).length - 1 : c.toString(2).length;
+function ar(c) {
+  return Ri(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
-function wn(c) {
+function Bn(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 ar(c) {
+function ir(c) {
   for (var t = [], e = 0; e < c.length; e++) {
     var n = c.charCodeAt(e);
     n < 128 ? t.push(n) : n < 2048 ? t.push(
@@ -10293,56 +10294,56 @@ function ar(c) {
   return t;
 }
 function Ue(c) {
-  const t = ar(c);
+  const t = ir(c);
   return [...Rt(t.length), ...t];
 }
-function Mi(c) {
+function Ni(c) {
   const t = [];
   let e = Te(c);
-  if (Di(e))
+  if (Ri(e))
     throw new Error("Number cannot be negative");
-  for (; !er(e); )
+  for (; !nr(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 Ri(c) {
+function zi(c) {
   let t, e;
-  const n = nr(c);
+  const n = ar(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);
+  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = Ni(t + s);
   return e || (d[d.length - 1] = d[d.length - 1] & g), d;
 }
-function Dn(c) {
+function Mn(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 Ri(t);
+  return zi(t);
 }
-function ir(c) {
+function or(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 Ri(t);
+  return zi(t);
 }
 function Rt(c) {
   let t = Te(c);
   if (t > 0xFFFFFFFFn)
     throw new Error("Number too big");
-  return Mi(t);
+  return Ni(t);
 }
-function Ta(c) {
+function qa(c) {
   return Array.from(c, function(t) {
     return ("0" + (t & 255).toString(16)).slice(-2);
   }).join("");
 }
-class or {
+class cr {
   constructor(t) {
     this.func = t, this.functionName = t.functionName, this.module = t.module;
   }
@@ -10471,10 +10472,10 @@ class or {
     return [...t, 26];
   }
   i64_const(t) {
-    return [66, ...ir(t)];
+    return [66, ...or(t)];
   }
   i32_const(t) {
-    return [65, ...Dn(t)];
+    return [65, ...Mn(t)];
   }
   i64_eqz(t) {
     return [...t, 80];
@@ -10657,7 +10658,7 @@ class or {
     return [];
   }
 }
-const Bn = {
+const vn = {
   i32: 127,
   i64: 126,
   f32: 125,
@@ -10666,7 +10667,7 @@ const Bn = {
   func: 96,
   emptyblock: 64
 };
-class qa {
+class Da {
   constructor(t, e, n, a, s) {
     if (n == "import")
       this.fnType = "import", this.moduleName = a, this.fieldName = s;
@@ -10700,13 +10701,13 @@ class qa {
     this.returnType = t;
   }
   getSignature() {
-    const t = [...Rt(this.params.length), ...this.params.map((n) => Bn[n.type])], e = this.returnType ? [1, Bn[this.returnType]] : [0];
+    const t = [...Rt(this.params.length), ...this.params.map((n) => vn[n.type])], e = this.returnType ? [1, vn[this.returnType]] : [0];
     return [96, ...t, ...e];
   }
   getBody() {
     const t = this.locals.map((n) => [
       ...Rt(n.length),
-      Bn[n.type]
+      vn[n.type]
     ]), e = [
       ...Rt(this.locals.length),
       ...[].concat(...t),
@@ -10722,10 +10723,10 @@ class qa {
     this.code.push(...[].concat(...t));
   }
   getCodeBuilder() {
-    return new or(this);
+    return new cr(this);
   }
 }
-class Ni {
+class Ui {
   constructor() {
     this.functions = [], this.functionIdxByName = {}, this.nImportFunctions = 0, this.nInternalFunctions = 0, this.memory = {
       pagesSize: 1,
@@ -10735,8 +10736,8 @@ class Ni {
   }
   build() {
     return this._setSignatures(), new Uint8Array([
-      ...wn(1836278016),
-      ...wn(1),
+      ...Bn(1836278016),
+      ...Bn(1),
       ...this._buildType(),
       ...this._buildImport(),
       ...this._buildFunctionDeclarations(),
@@ -10751,7 +10752,7 @@ class Ni {
     if (typeof this.functionIdxByName[t] < "u")
       throw new Error(`Function already defined: ${t}`);
     const e = this.functions.length;
-    return this.functionIdxByName[t] = e, this.functions.push(new qa(this, t, "internal")), this.nInternalFunctions++, this.functions[e];
+    return this.functionIdxByName[t] = e, this.functions.push(new Da(this, t, "internal")), this.nInternalFunctions++, this.functions[e];
   }
   addIimportFunction(t, e, n) {
     if (typeof this.functionIdxByName[t] < "u")
@@ -10760,7 +10761,7 @@ class Ni {
       throw new Error(`Import functions must be declared before internal: ${t}`);
     let a = n || t;
     const s = this.functions.length;
-    return this.functionIdxByName[t] = s, this.functions.push(new qa(this, t, "import", e, a)), this.nImportFunctions++, this.functions[s];
+    return this.functionIdxByName[t] = s, this.functions.push(new Da(this, t, "import", e, a)), this.nImportFunctions++, this.functions[s];
   }
   setMemory(t, e, n) {
     this.memory = {
@@ -10803,11 +10804,11 @@ class Ni {
     this.signatures = [];
     const t = {};
     if (this.functionsTable.length > 0) {
-      const e = this.functions[this.functionsTable[0]].getSignature(), n = "s_" + Ta(e);
+      const e = this.functions[this.functionsTable[0]].getSignature(), n = "s_" + qa(e);
       t[n] = 0, this.signatures.push(e);
     }
     for (let e = 0; e < this.functions.length; e++) {
-      const n = this.functions[e].getSignature(), a = "s_" + Ta(n);
+      const n = this.functions[e].getSignature(), a = "s_" + qa(n);
       typeof t[a] > "u" && (t[a] = this.signatures.length, this.signatures.push(n)), this.functions[e].signatureIdx = t[a];
     }
   }
@@ -10883,7 +10884,7 @@ class Ni {
         // Table (0 in MVP)
         65,
         // offset 0
-        ...Dn(0),
+        ...Mn(0),
         11,
         ...Rt(this.functionsTable.length),
         ...t
@@ -10920,13 +10921,13 @@ class Ni {
       0,
       11,
       4,
-      ...wn(this.free)
+      ...Bn(this.free)
     ]);
     for (let e = 0; e < this.datas.length; e++)
       t.push([
         0,
         65,
-        ...Dn(this.datas[e].offset),
+        ...Mn(this.datas[e].offset),
         11,
         ...Rt(this.datas[e].bytes.length),
         ...this.datas[e].bytes
@@ -10938,9 +10939,9 @@ class Ni {
   }
 }
 globalThis.curve_bn128 = null;
-async function cr(c, t) {
-  const e = new Ni();
-  e.setMemory(25), Ns(e), t && t(e);
+async function sr(c, t) {
+  const e = new Ui();
+  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.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;
@@ -10953,15 +10954,15 @@ async function cr(c, t) {
     n8r: 32,
     cofactorG2: ee("30644e72e131a029b85045b68181585e06ceecda572a2489345f2299c0f9fa8d", 16),
     singleThread: !!c
-  }, s = await qi(a);
+  }, s = await Mi(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 sr(c, t) {
-  const e = new Ni();
-  e.setMemory(25), zs(e), t && t(e);
+async function rr(c, t) {
+  const e = new Ui();
+  e.setMemory(25), Us(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;
@@ -10975,7 +10976,7 @@ async function sr(c, t) {
     cofactorG1: ee("0x396c8c005555e1568c00aaab0000aaab", 16),
     cofactorG2: ee("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5", 16),
     singleThread: !!c
-  }, s = await qi(a);
+  }, s = await Mi(a);
   return s.terminate = async function() {
     a.singleThread || (globalThis.curve_bls12381 = null, await this.tm.terminate());
   }, c || (globalThis.curve_bls12381 = s), s;
@@ -10984,24 +10985,24 @@ ee("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 ee("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 ee("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 ee("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Yt = Dc, un = Zs;
+const Yt = Mc, dn = Ws;
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-const rr = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), lr = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-async function Kn(c) {
+const lr = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), ur = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
+async function Yn(c) {
   let t;
-  if (Yt.eq(c, lr))
-    t = await cr();
-  else if (Yt.eq(c, rr))
+  if (Yt.eq(c, ur))
     t = await sr();
+  else if (Yt.eq(c, lr))
+    t = await rr();
   else
     throw new Error(`Curve not supported: ${Yt.toString(c)}`);
   return t;
 }
-function dn(c) {
+function fn(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 ur = 1, dr = 2, zi = 10, fr = 2;
+const dr = 1, fr = 2, ji = 10, _r = 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;
@@ -11010,71 +11011,71 @@ 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 _r(c, t, e) {
+async function gr(c, t, e) {
   await We(c, t, 1);
   const n = await c.readULE32();
-  if (await Xe(c), n === ur)
-    return await gr(c, t, e);
-  if (n === dr)
+  if (await Xe(c), n === dr)
     return await pr(c, t, e);
-  if (n === zi)
+  if (n === fr)
     return await hr(c, t, e);
+  if (n === ji)
+    return await Lr(c, t, e);
   throw new Error("Protocol not supported: ");
 }
-async function gr(c, t, e) {
+async function pr(c, t, e) {
   const n = {};
   n.protocol = "groth16", await We(c, t, 2);
   const a = await c.readULE32();
   n.n8q = a, n.q = await Be(c, a);
   const s = await c.readULE32();
-  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;
+  return n.n8r = s, n.r = await Be(c, s), n.curve = await Yn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(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 pr(c, t, e) {
+async function hr(c, t, e) {
   const n = {};
   n.protocol = "plonk", await We(c, t, 2);
   const a = await c.readULE32();
   n.n8q = a, n.q = await Be(c, a);
   const s = await c.readULE32();
-  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;
+  return n.n8r = s, n.r = await Be(c, s), n.curve = await Yn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(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 hr(c, t, e) {
+async function Lr(c, t, e) {
   const n = {};
-  n.protocol = "fflonk", n.protocolId = zi, await We(c, t, fr);
+  n.protocol = "fflonk", n.protocolId = ji, await We(c, t, _r);
   const a = await c.readULE32();
-  n.n8q = a, n.q = await Be(c, a), n.curve = await Kn(n.q);
+  n.n8q = a, n.q = await Be(c, a), n.curve = await Yn(n.q);
   const s = await c.readULE32();
-  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;
+  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 = fn(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 Lr(c, t, e) {
-  await ua(c, 1);
+async function mr(c, t, e) {
+  await da(c, 1);
   const n = (Math.floor((Yt.bitLength(e) - 1) / 64) + 1) * 8;
-  if (await c.writeULE32(n), await mc(c, e, n), t.byteLength % n != 0)
+  if (await c.writeULE32(n), await bc(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);
+  await c.writeULE32(t.byteLength / n), await fa(c), await da(c, 2), await c.write(t), await fa(c);
 }
-async function mr(c, t) {
+async function br(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 } = 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);
+const { stringifyBigInts: Ma } = dn;
+async function yr(c, t, e) {
+  const { fd: n, sections: a } = await ua(t, "wtns", 2, 33554432, 8388608), s = await br(n, a), { fd: g, sections: d } = await ua(c, "zkey", 2, 1 << 25, 1 << 23), C = await gr(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 = dn(C.domainSize);
+  const l = C.curve, o = l.Fr, y = l.G1, E = l.G2, m = fn(C.domainSize);
   e && e.debug("Reading Wtns");
   const x = await Fe(n, a, 2);
   e && e.debug("Reading Coeffs");
   const O = await Fe(g, d, 4);
   e && e.debug("Building ABC");
-  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");
+  const [L, I, v] = await Cr(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 Cr(l, C, F, R, D, e);
+  const A = await Ar(l, C, F, R, D, e);
   let M = {};
   e && e.debug("Reading A Points");
   const H = await Fe(g, d, 5);
@@ -11093,9 +11094,9 @@ async function br(c, t, e) {
     const i = x.slice(P * o.n8, P * o.n8 + o.n8);
     K.push(Yt.fromRprLE(i));
   }
-  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 };
+  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 = Ma(M), K = Ma(K), { proof: M, publicSignals: K };
 }
-async function yr(c, t, e, n, a) {
+async function Cr(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}`);
@@ -11118,7 +11119,7 @@ async function yr(c, t, e, n, a) {
     );
   return [C, l, o];
 }
-async function Cr(c, t, e, n, a, s) {
+async function Ar(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}`);
@@ -11143,7 +11144,7 @@ async function Cr(c, t, e, n, a, s) {
     y.set(o[m][0], E), E += o[m][0].byteLength;
   return y;
 }
-function Ui(c) {
+function $i(c) {
   var t = [];
   return e(t, c), t;
   function e(n, a) {
@@ -11154,7 +11155,7 @@ function Ui(c) {
       n.push(a);
   }
 }
-function ji(c) {
+function Gi(c) {
   const t = BigInt(2) ** BigInt(64);
   let e = BigInt("0xCBF29CE484222325");
   for (var n = 0; n < c.length; n++)
@@ -11162,7 +11163,7 @@ function ji(c) {
   let a = e.toString(16), s = 16 - a.length;
   return a = "0".repeat(s).concat(a), a;
 }
-function Ar(c, t) {
+function Fr(c, t) {
   const e = [];
   let n = BigInt(c);
   const a = BigInt(4294967296);
@@ -11173,7 +11174,7 @@ function Ar(c, t) {
       e.unshift(0), s--;
   return e;
 }
-async function Fr(c, t) {
+async function Er(c, t) {
   t = t || {};
   let e = 32767, n, a = !1;
   for (; !a; )
@@ -11240,7 +11241,7 @@ async function Fr(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 wr(E, m) : g = new Er(n, E, m), g;
+  return l === 2 ? g = new Br(E, m) : g = new wr(n, E, m), g;
   function x() {
     for (var L = "", I = E.exports.getMessageChar(); I != 0; )
       L += String.fromCharCode(I), I = E.exports.getMessageChar();
@@ -11253,13 +11254,13 @@ async function Fr(c, t) {
     return String.fromCharCode.apply(null, v);
   }
 }
-class Er {
+class wr {
   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 Kc(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;
@@ -11268,13 +11269,13 @@ class Er {
     this.instance.exports.init(this.sanityCheck || e ? 1 : 0);
     const n = this.allocInt(), a = this.allocFr();
     Object.keys(t).forEach((g) => {
-      const d = ji(g), C = parseInt(d.slice(0, 8), 16), l = parseInt(d.slice(8, 16), 16);
+      const d = Gi(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 = Ui(t[g]);
+      const o = this.getInt(n), y = $i(t[g]);
       for (let E = 0; E < y.length; E++)
         this.setFr(a, y[E]), this.instance.exports.setSignal(0, 0, o + E, a);
     });
@@ -11341,7 +11342,7 @@ class Er {
     }
   }
 }
-class wr {
+class Br {
   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);
@@ -11357,9 +11358,9 @@ class wr {
     const n = Object.keys(t);
     var a = 0;
     if (n.forEach((s) => {
-      const g = ji(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = Ui(t[s]);
+      const g = Gi(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = $i(t[s]);
       for (let o = 0; o < l.length; o++) {
-        const y = Ar(l[o], this.n32);
+        const y = Fr(l[o], this.n32);
         for (let E = 0; E < this.n32; E++)
           this.instance.exports.writeSharedRWMemory(E, y[this.n32 - 1 - E]);
         try {
@@ -11403,35 +11404,35 @@ class wr {
     return a;
   }
 }
-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);
+const { unstringifyBigInts: vr } = dn;
+async function xr(c, t, e, n) {
+  const a = vr(c), s = await ci(t), g = await s.read(s.totalSize);
   await s.close();
-  const d = await Fr(g);
+  const d = await Er(g);
   if (d.circom_version() == 1) {
-    const C = await d.calculateBinWitness(a), l = await Lc(e, "wtns", 2, 2);
-    await Lr(l, C, d.prime), await l.close();
+    const C = await d.calculateBinWitness(a), l = await mc(e, "wtns", 2, 2);
+    await mr(l, C, d.prime), await l.close();
   } else {
-    const C = await ai(e), l = await d.calculateWTNSBin(a);
+    const C = await oi(e), l = await d.calculateWTNSBin(a);
     await C.write(l), await C.close();
   }
 }
-const { unstringifyBigInts: xr } = un;
-async function Sr(c, t, e, n) {
-  const a = xr(c), s = {
+const { unstringifyBigInts: Sr } = dn;
+async function Ir(c, t, e, n) {
+  const a = Sr(c), s = {
     type: "mem"
   };
-  return await vr(a, t, s), await br(e, s, n);
+  return await xr(a, t, s), await yr(e, s, n);
 }
-const { unstringifyBigInts: Ma } = un;
+const { unstringifyBigInts: Ra } = dn;
 function he(c) {
   let t = c.toString(16);
   for (; t.length < 64; )
     t = "0" + t;
   return t = `"0x${t}"`, t;
 }
-async function Ir(c, t) {
-  const e = Ma(c), n = Ma(t);
+async function Or(c, t) {
+  const e = Ra(c), n = Ra(t);
   let a = "";
   for (let g = 0; g < n.length; g++)
     a != "" && (a = a + ","), a = a + he(n[g]);
@@ -11440,7 +11441,7 @@ async function Ir(c, t) {
 }
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-var Or = {}, $i = {};
+var Pr = {}, Zi = {};
 (function(c) {
   var t = /[|\\{}()[\]^$+*?.]/g, e = Object.prototype.hasOwnProperty, n = function(l, o) {
     return e.apply(l, [o]);
@@ -11525,19 +11526,19 @@ function encode_char(c) {
       return { __proto__: null };
     };
   }();
-})($i);
-const Pr = "ejs", kr = "Embedded JavaScript templates", Tr = [
+})(Zi);
+const kr = "ejs", Tr = "Embedded JavaScript templates", qr = [
   "template",
   "engine",
   "ejs"
-], qr = "3.1.9", Dr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", Mr = "Apache-2.0", Rr = {
+], Dr = "3.1.9", Mr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", Rr = "Apache-2.0", Nr = {
   ejs: "./bin/cli.js"
-}, Nr = "./lib/ejs.js", zr = "ejs.min.js", Ur = "ejs.min.js", jr = {
+}, zr = "./lib/ejs.js", Ur = "ejs.min.js", jr = "ejs.min.js", $r = {
   type: "git",
   url: "git://github.com/mde/ejs.git"
-}, $r = "https://github.com/mde/ejs/issues", Gr = "https://github.com/mde/ejs", Zr = {
+}, Gr = "https://github.com/mde/ejs/issues", Zr = "https://github.com/mde/ejs", Wr = {
   jake: "^10.8.5"
-}, Wr = {
+}, Xr = {
   browserify: "^16.5.1",
   eslint: "^6.8.0",
   "git-directory-deploy": "^1.5.1",
@@ -11545,29 +11546,29 @@ const Pr = "ejs", kr = "Embedded JavaScript templates", Tr = [
   "lru-cache": "^4.0.1",
   mocha: "^10.2.0",
   "uglify-js": "^3.3.16"
-}, Xr = {
-  node: ">=0.10.0"
 }, Vr = {
+  node: ">=0.10.0"
+}, Hr = {
   test: "mocha -u tdd"
 };
-var 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
+var Qr = {
+  name: kr,
+  description: Tr,
+  keywords: qr,
+  version: Dr,
+  author: Mr,
+  license: Rr,
+  bin: Nr,
+  main: zr,
+  jsdelivr: Ur,
+  unpkg: jr,
+  repository: $r,
+  bugs: Gr,
+  homepage: Zr,
+  dependencies: Wr,
+  devDependencies: Xr,
+  engines: Vr,
+  scripts: Hr
 };
 (function(c) {
   /**
@@ -11577,7 +11578,7 @@ var Hr = {
    * @project EJS
    * @license {@link http://www.apache.org/licenses/LICENSE-2.0 Apache License, Version 2.0}
    */
-  var t = bo, e = mo(), n = $i, a = !1, s = Hr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
+  var t = sn(), e = bo(), n = Zi, a = !1, s = Qr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
     "delimiter",
     "scope",
     "context",
@@ -11873,9 +11874,9 @@ try {
 `);
     }
   }, c.escapeXML = n.escapeXML, c.__express = c.renderFile, c.VERSION = s, c.name = o, typeof window < "u" && (window.ejs = c);
-})(Or);
-var Yn = { exports: {} };
-Yn.exports;
+})(Pr);
+var ta = { exports: {} };
+ta.exports;
 (function(c) {
   (function(t) {
     var e, n, a, s, g, d, C, l, o, y, E, m, x, O, L, I, v;
@@ -12315,8 +12316,8 @@ Yn.exports;
       c !== null && c.exports ? c.exports = k : t.check = k;
     }
   })(en);
-})(Yn);
-var ta = Yn.exports, Qr = { exports: {} };
+})(ta);
+var ea = ta.exports, Jr = { exports: {} };
 (function(c) {
   c.exports = {
     array: "arr",
@@ -12329,28 +12330,28 @@ var ta = Yn.exports, Qr = { 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`;
-})(Qr);
-ja.EventEmitter;
-const Jr = zn, Gi = $a().Readable, Ra = ta;
-Jr.inherits(cn, Gi);
-var Zi = cn;
+})(Jr);
+$a.EventEmitter;
+const Kr = Un, Wi = Ga().Readable, Na = ea;
+Kr.inherits(cn, Wi);
+var Xi = cn;
 function cn(c, t) {
-  return Ra.not.instanceStrict(this, cn) ? new cn(c) : (Ra.assert.function(c, "Invalid read implementation"), this._read = function() {
+  return Na.not.instanceStrict(this, cn) ? new cn(c) : (Na.assert.function(c, "Invalid read implementation"), this._read = function() {
     c();
-  }, Gi.call(this, t));
+  }, Wi.call(this, t));
 }
-const Kr = ta, Wi = Zi, Yr = zn;
-Yr.inherits(Mn, Wi);
-function Mn(c, t) {
-  return Kr.not.instanceStrict(this, Mn) ? new Mn(c, t) : Wi.call(this, c, { ...t, objectMode: !0 });
+const Yr = ea, Vi = Xi, tl = Un;
+tl.inherits(Rn, Vi);
+function Rn(c, t) {
+  return Yr.not.instanceStrict(this, Rn) ? new Rn(c, t) : Vi.call(this, c, { ...t, objectMode: !0 });
 }
-class fn extends Array {
+class _n extends Array {
   constructor(t) {
     let e, n;
-    if (!Na(t))
+    if (!za(t))
       throw new TypeError("Argument `size` must be a positive integer.");
     return super(t), this.grow = (a) => {
-      if (!Na(a))
+      if (!za(a))
         throw new TypeError("Argument `by` must be a positive integer.");
       let s;
       const g = t + a;
@@ -12364,38 +12365,38 @@ class fn extends Array {
       t = g;
     }, new Proxy(this, {
       get(a, s) {
-        return Rn(s) ? a[za(s, t)] : a[s];
+        return Nn(s) ? a[Ua(s, t)] : a[s];
       },
       set(a, s, g) {
-        return Rn(s) ? (e = za(s, t), a[e] = g, Math.abs(s) >= t ? n = !0 : n = !1) : a[s] = g, !0;
+        return Nn(s) ? (e = Ua(s, t), a[e] = g, Math.abs(s) >= t ? n = !0 : n = !1) : a[s] = g, !0;
       }
     });
   }
 }
-function Na(c) {
-  return Rn(c) && c > 0;
+function za(c) {
+  return Nn(c) && c > 0;
 }
-function Rn(c) {
+function Nn(c) {
   try {
     return +c % 1 === 0;
   } catch {
   }
   return !1;
 }
-function za(c, t) {
+function Ua(c, t) {
   return c === 0 ? 0 : c < 0 ? (t - Math.abs(c)) % t : c % t;
 }
-function _n() {
+function gn() {
   throw new Error("Not implemented");
 }
-fn.prototype.push = _n;
-fn.prototype.pop = _n;
-fn.prototype.shift = _n;
-fn.prototype.unshift = _n;
+_n.prototype.push = gn;
+_n.prototype.pop = gn;
+_n.prototype.shift = gn;
+_n.prototype.unshift = gn;
 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 tl = { exports: {} };
+var el = { exports: {} };
 /*! jsonpath 1.1.1 */
 (function(c, t) {
   (function(e) {
@@ -13526,7 +13527,7 @@ var tl = { exports: {} };
         }
         function $(p, B) {
           var N, 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);
+          return N = O, lt = S, X = hn(), 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;
@@ -13565,7 +13566,7 @@ var tl = { exports: {} };
             O && S.octal && Dt(S, y.StrictOctalLiteral), N = w.createLiteral(pt());
           else if (p === g.Keyword) {
             if (Y("function"))
-              return lo();
+              return fo();
             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());
@@ -13735,7 +13736,7 @@ var tl = { exports: {} };
           var p;
           return Wt("var"), p = Ce(), _(), w.createVariableDeclaration(p, "var");
         }
-        function gn(p) {
+        function pn(p) {
           var B, N;
           return N = S, Wt(p), B = Ce(p), _(), w.markEnd(w.createVariableDeclaration(B, p), N);
         }
@@ -13750,65 +13751,65 @@ var tl = { exports: {} };
           var 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 Hi() {
+        function Ji() {
           var p, B, N;
           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 Qi() {
+        function Ki() {
           var p, B, N;
           return Wt("while"), vt("("), p = qt(), vt(")"), N = F.inIteration, F.inIteration = !0, B = _e(), F.inIteration = N, w.createWhileStatement(p, B);
         }
-        function Ji() {
+        function Yi() {
           var p, B, N;
           return N = S, p = pt(), B = Ce(), w.markEnd(w.createVariableDeclaration(B, p.value), N);
         }
-        function Ki() {
+        function to() {
           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 = 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);
+          return p = B = N = null, Wt("for"), vt("("), wt(";") ? pt() : (Y("var") || Y("let") ? (F.allowIn = !1, p = Yi(), 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 Yi() {
+        function eo() {
           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 to() {
+        function no() {
           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 eo() {
+        function ao() {
           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 no() {
+        function io() {
           var p, B;
           return O && (G(), Dt({}, y.StrictModeWith)), Wt("with"), vt("("), p = qt(), vt(")"), B = _e(), w.createWithStatement(p, B);
         }
-        function ao() {
+        function oo() {
           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 = _e(), B.push(N);
           return w.markEnd(w.createSwitchCase(p, B), X);
         }
-        function io() {
+        function co() {
           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 = ao(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
+            N = oo(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
           return F.inSwitch = X, vt("}"), w.createSwitchStatement(p, B);
         }
-        function oo() {
+        function so() {
           var p;
           return Wt("throw"), te() && Pt({}, y.NewlineAfterThrow), p = qt(), _(), w.createThrowStatement(p);
         }
-        function co() {
+        function ro() {
           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 so() {
+        function lo() {
           var p, B = [], N = null;
-          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);
+          return Wt("try"), p = Qt(), Y("catch") && B.push(ro()), Y("finally") && (pt(), N = Qt()), B.length === 0 && !N && Pt({}, y.NoCatchOrFinally), w.createTryStatement(p, [], B, N);
         }
-        function ro() {
+        function uo() {
           return Wt("debugger"), _(), w.createDebuggerStatement();
         }
         function _e() {
@@ -13825,37 +13826,37 @@ var tl = { exports: {} };
           if (p === g.Keyword)
             switch (S.value) {
               case "break":
-                return w.markEnd(to(), lt);
+                return w.markEnd(no(), lt);
               case "continue":
-                return w.markEnd(Yi(), lt);
+                return w.markEnd(eo(), lt);
               case "debugger":
-                return w.markEnd(ro(), lt);
+                return w.markEnd(uo(), lt);
               case "do":
-                return w.markEnd(Hi(), lt);
+                return w.markEnd(Ji(), lt);
               case "for":
-                return w.markEnd(Ki(), lt);
+                return w.markEnd(to(), lt);
               case "function":
-                return w.markEnd(aa(), lt);
+                return w.markEnd(ia(), lt);
               case "if":
                 return w.markEnd(Je(), lt);
               case "return":
-                return w.markEnd(eo(), lt);
+                return w.markEnd(ao(), lt);
               case "switch":
-                return w.markEnd(io(), lt);
+                return w.markEnd(co(), lt);
               case "throw":
-                return w.markEnd(oo(), lt);
-              case "try":
                 return w.markEnd(so(), lt);
+              case "try":
+                return w.markEnd(lo(), lt);
               case "var":
                 return w.markEnd(qe(), lt);
               case "while":
-                return w.markEnd(Qi(), lt);
+                return w.markEnd(Ki(), lt);
               case "with":
-                return w.markEnd(no(), lt);
+                return w.markEnd(io(), 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 pn() {
+        function hn() {
           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);
@@ -13863,7 +13864,7 @@ var tl = { exports: {} };
             B.push(p);
           return vt("}"), F.labelSet = Ct, F.inIteration = Gt, F.inSwitch = Xt, F.inFunctionBody = oe, w.markEnd(w.createBlockStatement(B), ae);
         }
-        function na(p) {
+        function aa(p) {
           var B, N = [], X, lt, Ct, Gt, Xt;
           if (vt("("), !wt(")"))
             for (Ct = {}; L < U && (X = S, B = Kt(), Gt = "$" + X.value, O ? (J(X.value) && (lt = X, Xt = y.StrictParamName), Object.prototype.hasOwnProperty.call(Ct, Gt) && (lt = X, Xt = y.StrictParamDupe)) : p || (J(X.value) ? (p = X, Xt = y.StrictParamName) : nt(X.value) ? (p = X, Xt = y.StrictReservedWord) : Object.prototype.hasOwnProperty.call(Ct, Gt) && (p = X, Xt = y.StrictParamDupe)), N.push(B), Ct[Gt] = !0, !wt(")")); )
@@ -13875,40 +13876,40 @@ var tl = { exports: {} };
             message: Xt
           };
         }
-        function aa() {
+        function ia() {
           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);
+          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 = aa(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), oe = O, N = hn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = oe, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
         }
-        function lo() {
+        function fo() {
           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);
+          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 = aa(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), oe = O, Xt = hn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = oe, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
         }
         function De() {
           if (S.type === g.Keyword)
             switch (S.value) {
               case "const":
               case "let":
-                return gn(S.value);
+                return pn(S.value);
               case "function":
-                return aa();
+                return ia();
               default:
                 return _e();
             }
           if (S.type !== g.EOF)
             return _e();
         }
-        function uo() {
+        function _o() {
           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 = De(), !(typeof p > "u")); )
             B.push(p);
           return B;
         }
-        function fo() {
+        function go() {
           var p, B;
-          return G(), $t(), B = S, O = !1, p = uo(), w.markEnd(w.createProgram(p), B);
+          return G(), $t(), B = S, O = !1, p = _o(), w.markEnd(w.createProgram(p), B);
         }
-        function ia() {
+        function oa() {
           var p, B, N, X = [];
           for (p = 0; p < r.tokens.length; ++p)
             B = r.tokens[p], N = {
@@ -13917,7 +13918,7 @@ var tl = { exports: {} };
             }, r.range && (N.range = B.range), r.loc && (N.loc = B.loc), X.push(N);
           r.tokens = X;
         }
-        function _o(p, B) {
+        function po(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,
@@ -13940,7 +13941,7 @@ var tl = { exports: {} };
                 } else
                   throw Ct;
               }
-            ia(), lt = r.tokens, typeof r.comments < "u" && (lt.comments = r.comments), typeof r.errors < "u" && (lt.errors = r.errors);
+            oa(), lt = r.tokens, typeof r.comments < "u" && (lt.comments = r.comments), typeof r.errors < "u" && (lt.errors = r.errors);
           } catch (Ct) {
             throw Ct;
           } finally {
@@ -13948,7 +13949,7 @@ var tl = { exports: {} };
           }
           return lt;
         }
-        function go(p, B) {
+        function ho(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,
@@ -13959,7 +13960,7 @@ var tl = { 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 = 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);
+            N = go(), typeof r.comments < "u" && (N.comments = r.comments), typeof r.tokens < "u" && (oa(), N.tokens = r.tokens), typeof r.errors < "u" && (N.errors = r.errors);
           } catch (lt) {
             throw lt;
           } finally {
@@ -13967,7 +13968,7 @@ var tl = { exports: {} };
           }
           return N;
         }
-        s.version = "1.2.2", s.tokenize = _o, s.parse = go, s.Syntax = function() {
+        s.version = "1.2.2", s.tokenize = po, s.parse = ho, s.Syntax = function() {
           var p, B = {};
           typeof Object.create == "function" && (B = /* @__PURE__ */ Object.create(null));
           for (p in l)
@@ -15563,16 +15564,17 @@ Expecting ` + ft.join(", ") + ", got '" + (this.terminals_[T] || T) + "'" : at =
       n.exports = e("./lib/index");
     }, { "./lib/index": 5 }] }, {}, ["jsonpath"])("jsonpath");
   });
-})(tl);
-$a();
-ja.EventEmitter;
-const el = ta, Xi = Zi, nl = zn;
-nl.inherits(Nn, Xi);
-function Nn(c, t) {
-  return el.not.instanceStrict(this, Nn) ? new Nn(c, t) : Xi.call(this, c, { ...t, encoding: "utf8" });
-}
-var ea = { exports: {} };
-ea.exports;
+})(el);
+Ga();
+sn();
+$a.EventEmitter;
+const nl = ea, Hi = Xi, al = Un;
+al.inherits(zn, Hi);
+function zn(c, t) {
+  return nl.not.instanceStrict(this, zn) ? new zn(c, t) : Hi.call(this, c, { ...t, encoding: "utf8" });
+}
+var na = { exports: {} };
+na.exports;
 (function(c) {
   (function(t) {
     c !== null ? c.exports = e : t.tryer = e;
@@ -15649,12 +15651,13 @@ ea.exports;
       setTimeout(I, Math.abs(v));
     }
   })(en);
-})(ea);
-ea.exports;
-const al = typeof Se < "u" && Se.versions != null && Se.versions.node != null, vn = (
+})(na);
+na.exports;
+sn();
+const il = typeof Se < "u" && Se.versions != null && Se.versions.node != null, xn = (
   // @ts-expect-error webpack check is done like this
   typeof __webpack_require__ < "u"
-), Vi = new yo(), il = async (c) => {
+), Qi = new yo(), ol = async (c) => {
   const { input: t, wasmFilePath: e, zKeyFilePath: n, chainId: a } = c.payload.data, {
     hostLocation: { origin: s },
     constants: {
@@ -15663,21 +15666,21 @@ const al = typeof Se < "u" && Se.versions != null && Se.versions.node != null, v
     }
   } = c.metadata;
   let C = e, l = 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}`);
+  if (console.log({ isWebpack: xn }), il) {
+    g && !xn ? (C = `test/circuits/${e}`, l = `test/circuits/${n}`) : xn && (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 Sr(t, C, l), E = await Ir(o, y), m = JSON.parse(`[${E}]`);
-    Vi.postMessageToMainThread({ zkCallData: m, proof: o, publicSignals: y });
+    const { proof: o, publicSignals: y } = await Ir(t, C, l), E = await Or(o, y), m = JSON.parse(`[${E}]`);
+    Qi.postMessageToMainThread({ zkCallData: m, proof: o, publicSignals: y });
   } catch (o) {
     console.log(o);
   }
 };
-Vi.attachWorkerSideOnMessage(il);
+Qi.attachWorkerSideOnMessage(ol);
 export {
-  Vi as default,
-  il as onWorkerMessage
+  Qi as default,
+  ol as onWorkerMessage
 };