@hinkal/common 0.0.81 → 0.0.82

package/{snarkjsWorkerLogic-DI9paiU-.mjs → snarkjsWorkerLogic-De3osVcO.mjs}

@@ -1,6 +1,6 @@
-import { W as fo } from "./workerProxy-BDj498Ht.mjs";
-import { f as on, r as Bn, c as Ye, e as za, u as Nn } from "./index-DdDIk6Jw.mjs";
-const _o = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+import { W as _o } from "./workerProxy-BDj498Ht.mjs";
+import { f as on, r as vn, c as Ye, e as Ua, u as zn } from "./index-DhAeLLFR.mjs";
+const go = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
 function cn(c, t) {
   if (!t || t == 10)
     return BigInt(c);
@@ -8,34 +8,34 @@ function cn(c, t) {
     return c.slice(0, 2) == "0x" ? BigInt(c) : BigInt("0x" + c);
 }
 const Be = cn;
-function go(c, t) {
+function po(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
   for (let n = 0; n < c.length; n++)
     e = e * t + BigInt(c[n]);
   return e;
 }
-function Ua(c) {
+function ja(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + _o[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + go[parseInt(t[0], 16)];
 }
-function po(c) {
+function ho(c) {
   return BigInt(c) < BigInt(0);
 }
-function ho(c) {
+function Lo(c) {
   return !c;
 }
-function ja(c, t) {
+function $a(c, t) {
   return BigInt(c) << BigInt(t);
 }
-function zn(c, t) {
+function Un(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const Lo = ja, mo = zn;
-function bo(c) {
+const mo = $a, bo = Un;
+function yo(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function yo(c) {
+function Co(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -48,177 +48,177 @@ function yo(c) {
   }
   return e;
 }
-function Co(c) {
+function Ao(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 $a(c) {
+function Ga(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function Ao(c, t) {
+function Fo(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
     e.unshift(Number(n % t)), n = n / t;
   return e;
 }
-function Fo(c, t) {
+function Eo(c, t) {
   return BigInt(c) + BigInt(t);
 }
-function Eo(c, t) {
+function wo(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function wo(c) {
+function Bo(c) {
   return -BigInt(c);
 }
-function Bo(c, t) {
+function vo(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function vo(c) {
+function xo(c) {
   return BigInt(c) * BigInt(c);
 }
-function xo(c, t) {
+function So(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function So(c, t) {
+function Io(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function Io(c) {
+function Oo(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
-function Oo(c, t) {
+function Po(c, t) {
   return BigInt(c) / BigInt(t);
 }
-function Po(c, t) {
+function ko(c, t) {
   return BigInt(c) % BigInt(t);
 }
-function ko(c, t) {
+function To(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function To(c, t) {
+function qo(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function qo(c, t) {
+function Do(c, t) {
   return BigInt(c) < BigInt(t);
 }
-function Do(c, t) {
+function Mo(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Mo(c, t) {
+function Ro(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function Ro(c, t) {
+function No(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function Ga(c, t) {
+function Za(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function No(c, t) {
+function zo(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function zo(c, t) {
+function Uo(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function Uo(c, t) {
+function jo(c, t) {
   return BigInt(c) && BigInt(t);
 }
-function jo(c, t) {
+function $o(c, t) {
   return BigInt(c) || BigInt(t);
 }
-function $o(c) {
+function Go(c) {
   return !BigInt(c);
 }
-function Za(c, t, e, n) {
+function Wa(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] = $a(Ga(zn(e, d * 8), 255));
+    c[d] = Ga(Za(Un(e, d * 8), 255));
 }
-function Go(c, t, e, n) {
+function Zo(c, t, e, n) {
   const a = "0000000" + e.toString(16), s = new DataView(c.buffer, c.byteOffset + t, n), g = ((a.length - 7) * 4 - 1 >> 5) + 1;
   for (let d = 0; d < g; d++)
     s.setUint32(n - d * 4 - 4, parseInt(a.substring(a.length - 8 * d - 8, a.length - 8 * d), 16), !1);
   for (let d = 0; d < n / 4 - g; d++)
     s[d] = 0;
 }
-function Zo(c, t, e) {
+function Wo(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new Uint32Array(c.buffer, c.byteOffset + t, e / 4), a = new Array(e / 4);
   return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), cn(a.join(""), 16);
 }
-function Wo(c, t, e) {
+function Xo(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new DataView(c.buffer, c.byteOffset + t, e), a = new Array(e / 4);
   for (let s = 0; s < e / 4; s++)
     a[s] = n.getUint32(s * 4, !1).toString(16).padStart(8, "0");
   return cn(a.join(""), 16);
 }
-function Xo(c, t) {
+function Vo(c, t) {
   return c.toString(t);
 }
-function Vo(c) {
-  const t = new Uint8Array(Math.floor((Ua(c) - 1) / 8) + 1);
-  return Za(t, 0, c, t.byteLength), t;
+function Ho(c) {
+  const t = new Uint8Array(Math.floor((ja(c) - 1) / 8) + 1);
+  return Wa(t, 0, c, t.byteLength), t;
 }
-const Ho = Be(0), Qo = Be(1);
-var Jo = /* @__PURE__ */ Object.freeze({
+const Qo = Be(0), Jo = Be(1);
+var Ko = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  abs: Io,
-  add: Fo,
-  band: Ga,
-  bitLength: Ua,
-  bits: Co,
-  bor: No,
-  bxor: zo,
-  div: Oo,
+  abs: Oo,
+  add: Eo,
+  band: Za,
+  bitLength: ja,
+  bits: Ao,
+  bor: zo,
+  bxor: Uo,
+  div: Po,
   e: Be,
-  eq: ko,
-  exp: So,
-  fromArray: go,
-  fromRprBE: Wo,
-  fromRprLE: Zo,
+  eq: To,
+  exp: Io,
+  fromArray: po,
+  fromRprBE: Xo,
+  fromRprLE: Wo,
   fromString: cn,
-  geq: Ro,
-  gt: Do,
-  isNegative: po,
-  isOdd: bo,
-  isZero: ho,
-  land: Uo,
-  leq: Mo,
-  lnot: $o,
-  lor: jo,
-  lt: qo,
-  mod: Po,
-  mul: Bo,
-  naf: yo,
-  neg: wo,
-  neq: To,
-  one: Qo,
-  pow: xo,
-  shiftLeft: ja,
-  shiftRight: zn,
-  shl: Lo,
-  shr: mo,
-  square: vo,
-  sub: Eo,
-  toArray: Ao,
-  toLEBuff: Vo,
-  toNumber: $a,
-  toRprBE: Go,
-  toRprLE: Za,
-  toString: Xo,
-  zero: Ho
+  geq: No,
+  gt: Mo,
+  isNegative: ho,
+  isOdd: yo,
+  isZero: Lo,
+  land: jo,
+  leq: Ro,
+  lnot: Go,
+  lor: $o,
+  lt: Do,
+  mod: ko,
+  mul: vo,
+  naf: Co,
+  neg: Bo,
+  neq: qo,
+  one: Jo,
+  pow: So,
+  shiftLeft: $a,
+  shiftRight: Un,
+  shl: mo,
+  shr: bo,
+  square: xo,
+  sub: wo,
+  toArray: Fo,
+  toLEBuff: Ho,
+  toNumber: Ga,
+  toRprBE: Zo,
+  toRprLE: Wa,
+  toString: Vo,
+  zero: Qo
 });
 const oe = 1 << 30;
-let Ko = class vn {
+let Yo = class xn {
   constructor(t) {
     this.buffers = [], this.byteLength = t;
     for (let e = 0; e < t; e += oe) {
@@ -236,7 +236,7 @@ let Ko = class vn {
       const o = C + l > oe ? oe - C : l, y = new Uint8Array(this.buffers[d].buffer, this.buffers[d].byteOffset + C, o);
       if (o == n)
         return y.slice();
-      g || (n <= oe ? g = new Uint8Array(n) : g = new vn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
+      g || (n <= oe ? g = new Uint8Array(n) : g = new xn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
     }
     return g;
   }
@@ -247,7 +247,7 @@ let Ko = class vn {
       return;
     const a = Math.floor(e / oe), s = Math.floor((e + n - 1) / oe);
     if (a == s)
-      return t instanceof vn && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % oe) : this.buffers[a].set(t, e % oe);
+      return t instanceof xn && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % oe) : this.buffers[a].set(t, e % oe);
     let g = a, d = e % oe, C = n;
     for (; C > 0; ) {
       const l = d + C > oe ? oe - d : C, o = t.slice(n - C, n - C + l);
@@ -255,10 +255,10 @@ let Ko = class vn {
     }
   }
 };
-function Yo(c) {
+function tc(c) {
   return globalThis.btoa(c);
 }
-Yo(`(function thread(self) {
+tc(`(function thread(self) {
     const MAXMEM = 32767;
     let instance;
     let memory;
@@ -384,14 +384,14 @@ Be("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Be("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 Be("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 Be("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Wa = Jo;
-async function Xa(c, t, e, n) {
+const Xa = Ko;
+async function Va(c, t, e, n) {
   if (e = e || 4096 * 64, typeof t != "number" && ["w+", "wx+", "r", "ax+", "a+"].indexOf(t) < 0)
     throw new Error("Invalid open option");
   const a = await on.promises.open(c, t), s = await a.stat();
-  return new tc(a, s, e, n, c);
+  return new ec(a, s, e, n, c);
 }
-class tc {
+class ec {
   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;
@@ -610,16 +610,16 @@ class tc {
     return g;
   }
 }
-function ec(c) {
-  const t = c.initialSize || 1048576, e = new Ha();
+function nc(c) {
+  const t = c.initialSize || 1048576, e = new Qa();
   return e.o = c, e.o.data = new Uint8Array(t), e.allocSize = t, e.totalSize = 0, e.readOnly = !1, e.pos = 0, e;
 }
-function nc(c) {
-  const t = new Ha();
+function ac(c) {
+  const t = new Qa();
   return t.o = c, t.allocSize = c.data.byteLength, t.totalSize = c.data.byteLength, t.readOnly = !0, t.pos = 0, t;
 }
-const xn = new Uint8Array(4), ia = new DataView(xn.buffer), Va = new Uint8Array(8), oa = new DataView(Va.buffer);
-class Ha {
+const Sn = new Uint8Array(4), oa = new DataView(Sn.buffer), Ha = new Uint8Array(8), ca = new DataView(Ha.buffer);
+class Qa {
   constructor() {
     this.pageSize = 16384;
   }
@@ -656,15 +656,15 @@ class Ha {
   }
   async writeULE32(t, e) {
     const n = this;
-    ia.setUint32(0, t, !0), await n.write(xn, e);
+    oa.setUint32(0, t, !0), await n.write(Sn, e);
   }
   async writeUBE32(t, e) {
     const n = this;
-    ia.setUint32(0, t, !1), await n.write(xn, e);
+    oa.setUint32(0, t, !1), await n.write(Sn, e);
   }
   async writeULE64(t, e) {
     const n = this;
-    oa.setUint32(0, t & 4294967295, !0), oa.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Va, e);
+    ca.setUint32(0, t & 4294967295, !0), ca.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ha, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -696,8 +696,8 @@ class Ha {
   }
 }
 const ne = 1 << 22;
-function ac(c) {
-  const t = c.initialSize || 0, e = new Ja();
+function ic(c) {
+  const t = c.initialSize || 0, e = new Ka();
   e.o = c;
   const n = t ? Math.floor((t - 1) / ne) + 1 : 0;
   e.o.data = [];
@@ -705,12 +705,12 @@ function ac(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 ic(c) {
-  const t = new Ja();
+function oc(c) {
+  const t = new Ka();
   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 Sn = new Uint8Array(4), ca = new DataView(Sn.buffer), Qa = new Uint8Array(8), sa = new DataView(Qa.buffer);
-class Ja {
+const In = new Uint8Array(4), sa = new DataView(In.buffer), Ja = new Uint8Array(8), ra = new DataView(Ja.buffer);
+class Ka {
   constructor() {
     this.pageSize = 16384;
   }
@@ -760,15 +760,15 @@ class Ja {
   }
   async writeULE32(t, e) {
     const n = this;
-    ca.setUint32(0, t, !0), await n.write(Sn, e);
+    sa.setUint32(0, t, !0), await n.write(In, e);
   }
   async writeUBE32(t, e) {
     const n = this;
-    ca.setUint32(0, t, !1), await n.write(Sn, e);
+    sa.setUint32(0, t, !1), await n.write(In, e);
   }
   async writeULE64(t, e) {
     const n = this;
-    sa.setUint32(0, t & 4294967295, !0), sa.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Qa, e);
+    ra.setUint32(0, t & 4294967295, !0), ra.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ja, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -803,22 +803,22 @@ class Ja {
     return g;
   }
 }
-const oc = 1024, cc = 512, sc = 2, rc = 0, Ka = 65536, Ya = 8192;
-async function ti(c, t, e) {
+const cc = 1024, sc = 512, rc = 2, lc = 0, Ya = 65536, ti = 8192;
+async function ei(c, t, e) {
   if (typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || Ka,
-    pageSize: e || Ya
+    cacheSize: t || Ya,
+    pageSize: e || ti
   }), c.type == "file")
-    return await Xa(c.fileName, oc | cc | sc, c.cacheSize, c.pageSize);
+    return await Va(c.fileName, cc | sc | rc, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return ec(c);
+    return nc(c);
   if (c.type == "bigMem")
-    return ac(c);
+    return ic(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function ei(c, t, e) {
+async function ni(c, t, e) {
   if (c instanceof Uint8Array && (c = {
     type: "mem",
     data: c
@@ -832,18 +832,18 @@ async function ei(c, t, e) {
   }) : typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || Ka,
-    pageSize: e || Ya
+    cacheSize: t || Ya,
+    pageSize: e || ti
   }), c.type == "file")
-    return await Xa(c.fileName, rc, c.cacheSize, c.pageSize);
+    return await Va(c.fileName, lc, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return await nc(c);
+    return await ac(c);
   if (c.type == "bigMem")
-    return await ic(c);
+    return await oc(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function ra(c, t, e, n, a) {
-  const s = await ei(c, n, a), g = await s.read(4);
+async function la(c, t, e, n, a) {
+  const s = await ni(c, n, a), g = await s.read(4);
   let d = "";
   for (let y = 0; y < 4; y++)
     d += String.fromCharCode(g[y]);
@@ -862,20 +862,20 @@ async function ra(c, t, e, n, a) {
   }
   return { fd: s, sections: o };
 }
-async function lc(c, t, e, n, a, s) {
-  const g = await ti(c, a, s), d = new Uint8Array(4);
+async function uc(c, t, e, n, a, s) {
+  const g = await ei(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 la(c, t) {
+async function ua(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 ua(c) {
+async function da(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,21 +897,21 @@ async function Ze(c, t) {
     throw new Error("Invalid section size reading");
   delete c.readingSection;
 }
-async function uc(c, t, e, n) {
+async function dc(c, t, e, n) {
   const a = new Uint8Array(e);
-  Wa.toRprLE(a, 0, t, e), await c.write(a, n);
+  Xa.toRprLE(a, 0, t, e), await c.write(a, n);
 }
 async function we(c, t, e) {
   const n = await c.read(t, e);
-  return Wa.fromRprLE(n, 0, t);
+  return Xa.fromRprLE(n, 0, t);
 }
 async function Ae(c, t, e, n, a) {
   if (n = typeof n > "u" ? 0 : n, a = typeof a > "u" ? t[e][0].size - n : a, n + a > t[e][0].size)
     throw new Error("Reading out of the range of the section");
   let s;
-  return a < 1 << 30 ? s = new Uint8Array(a) : s = new Ko(a), await c.readToBuffer(s, 0, a, t[e][0].p + n), s;
+  return a < 1 << 30 ? s = new Uint8Array(a) : s = new Yo(a), await c.readToBuffer(s, 0, a, t[e][0].p + n), s;
 }
-const dc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+const fc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
 function sn(c, t) {
   if (!t || t == 10)
     return BigInt(c);
@@ -919,7 +919,7 @@ function sn(c, t) {
     return c.slice(0, 2) == "0x" ? BigInt(c) : BigInt("0x" + c);
 }
 const ee = sn;
-function fc(c, t) {
+function _c(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
   for (let n = 0; n < c.length; n++)
@@ -928,12 +928,12 @@ function fc(c, t) {
 }
 function We(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + dc[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + fc[parseInt(t[0], 16)];
 }
-function ni(c) {
+function ai(c) {
   return BigInt(c) < BigInt(0);
 }
-function ai(c) {
+function ii(c) {
   return !c;
 }
 function tn(c, t) {
@@ -942,11 +942,11 @@ function tn(c, t) {
 function xe(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const _c = tn, gc = xe;
-function Un(c) {
+const gc = tn, pc = xe;
+function jn(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function pc(c) {
+function hc(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -959,47 +959,47 @@ function pc(c) {
   }
   return e;
 }
-function ii(c) {
+function oi(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 oi(c) {
+function ci(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function hc(c, t) {
+function Lc(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
     e.unshift(Number(n % t)), n = n / t;
   return e;
 }
-function jn(c, t) {
+function $n(c, t) {
   return BigInt(c) + BigInt(t);
 }
 function he(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function ci(c) {
+function si(c) {
   return -BigInt(c);
 }
-function si(c, t) {
+function ri(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function Lc(c) {
+function mc(c) {
   return BigInt(c) * BigInt(c);
 }
 function Xe(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function mc(c, t) {
+function bc(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function bc(c) {
+function yc(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
 function Se(c, t) {
@@ -1011,37 +1011,37 @@ function _e(c, t) {
 function Fe(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function yc(c, t) {
+function Cc(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function Cc(c, t) {
+function Ac(c, t) {
   return BigInt(c) < BigInt(t);
 }
-function In(c, t) {
+function On(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Ac(c, t) {
+function Fc(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function ri(c, t) {
+function li(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function $n(c, t) {
+function Gn(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function Fc(c, t) {
+function Ec(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function Ec(c, t) {
+function wc(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function wc(c, t) {
+function Bc(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);
 }
 function je(c, t, e, n) {
@@ -1051,9 +1051,9 @@ function je(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] = oi($n(xe(e, d * 8), 255));
+    c[d] = ci(Gn(xe(e, d * 8), 255));
 }
-function li(c, t, e, n) {
+function ui(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);
@@ -1065,72 +1065,72 @@ function $e(c, t, e) {
   const n = new Uint32Array(c.buffer, t, e / 4), a = new Array(e / 4);
   return n.forEach((s, g) => a[a.length - g - 1] = s.toString(16).padStart(8, "0")), sn(a.join(""), 16);
 }
-function ui(c, t, e) {
+function di(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);
 }
-function di(c, t) {
+function fi(c, t) {
   return c.toString(t);
 }
 function Ie(c) {
   const t = new Uint8Array(Math.floor((We(c) - 1) / 8) + 1);
   return je(t, 0, c, t.byteLength), t;
 }
-const fi = ee(0), Ee = ee(1), xc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const _i = ee(0), Ee = ee(1), Sc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  abs: bc,
-  add: jn,
-  band: $n,
+  abs: yc,
+  add: $n,
+  band: Gn,
   bitLength: We,
-  bits: ii,
-  bor: Fc,
-  bxor: Ec,
+  bits: oi,
+  bor: Ec,
+  bxor: wc,
   div: Se,
   e: ee,
   eq: Fe,
-  exp: mc,
-  fromArray: fc,
-  fromRprBE: ui,
+  exp: bc,
+  fromArray: _c,
+  fromRprBE: di,
   fromRprLE: $e,
   fromString: sn,
-  geq: ri,
-  gt: In,
-  isNegative: ni,
-  isOdd: Un,
-  isZero: ai,
-  land: wc,
-  leq: Ac,
-  lnot: vc,
-  lor: Bc,
-  lt: Cc,
+  geq: li,
+  gt: On,
+  isNegative: ai,
+  isOdd: jn,
+  isZero: ii,
+  land: Bc,
+  leq: Fc,
+  lnot: xc,
+  lor: vc,
+  lt: Ac,
   mod: _e,
-  mul: si,
-  naf: pc,
-  neg: ci,
-  neq: yc,
+  mul: ri,
+  naf: hc,
+  neg: si,
+  neq: Cc,
   one: Ee,
   pow: Xe,
   shiftLeft: tn,
   shiftRight: xe,
-  shl: _c,
-  shr: gc,
-  square: Lc,
+  shl: gc,
+  shr: pc,
+  square: mc,
   sub: he,
-  toArray: hc,
+  toArray: Lc,
   toLEBuff: Ie,
-  toNumber: oi,
-  toRprBE: li,
+  toNumber: ci,
+  toRprBE: ui,
   toRprLE: je,
-  toString: di,
-  zero: fi
+  toString: fi,
+  zero: _i
 }, Symbol.toStringTag, { value: "Module" }));
-function da(c, t, e) {
-  if (ai(e))
+function fa(c, t, e) {
+  if (ii(e))
     return c.one;
-  const n = ii(e);
+  const n = oi(e);
   if (n.length == 0)
     return c.one;
   let a = t;
@@ -1138,29 +1138,29 @@ function da(c, t, e) {
     a = c.square(a), n[s] && (a = c.mul(a, t));
   return a;
 }
-function Sc(c) {
+function Ic(c) {
   if (c.m % 2 == 1)
     if (Fe(_e(c.p, 4), 1))
       if (Fe(_e(c.p, 8), 1))
         if (Fe(_e(c.p, 16), 1))
-          Ic(c);
-        else if (Fe(_e(c.p, 16), 9))
           Oc(c);
+        else if (Fe(_e(c.p, 16), 9))
+          Pc(c);
         else
           throw new Error("Field withot sqrt");
       else if (Fe(_e(c.p, 8), 5))
-        Pc(c);
+        kc(c);
       else
         throw new Error("Field withot sqrt");
     else
-      Fe(_e(c.p, 4), 3) && kc(c);
+      Fe(_e(c.p, 4), 3) && Tc(c);
   else {
     const t = _e(Xe(c.p, c.m / 2), 4);
-    t == 1 ? Tc(c) : t == 3 ? qc(c) : Dc(c);
+    t == 1 ? qc(c) : t == 3 ? Dc(c) : Mc(c);
   }
 }
-function Ic(c) {
-  for (c.sqrt_q = Xe(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = he(c.sqrt_q, 1); !Un(c.sqrt_t); )
+function Oc(c) {
+  for (c.sqrt_q = Xe(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = he(c.sqrt_q, 1); !jn(c.sqrt_t); )
     c.sqrt_s = c.sqrt_s + 1, c.sqrt_t = Se(c.sqrt_t, 2);
   let t = c.one;
   for (; c.eq(t, c.one); ) {
@@ -1188,17 +1188,17 @@ function Ic(c) {
     return n.geq(d, n.zero) ? d : n.neg(d);
   };
 }
-function Oc(c) {
+function Pc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 4 not implemented");
   };
 }
-function Pc(c) {
+function kc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 3 not implemented");
   };
 }
-function kc(c) {
+function Tc(c) {
   c.sqrt_q = Xe(c.p, c.m), c.sqrt_e1 = Se(he(c.sqrt_q, 3), 4), c.sqrt = function(t) {
     if (this.isZero(t))
       return this.zero;
@@ -1209,12 +1209,12 @@ function kc(c) {
     return c.geq(a, c.zero) ? a : c.neg(a);
   };
 }
-function Tc(c) {
+function qc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 10 not implemented");
   };
 }
-function qc(c) {
+function Dc(c) {
   c.sqrt_q = Xe(c.p, c.m / 2), c.sqrt_e34 = Se(he(c.sqrt_q, 3), 4), c.sqrt_e12 = Se(he(c.sqrt_q, 1), 2), c.frobenius = function(t, e) {
     return t % 2 == 1 ? c.conjugate(e) : e;
   }, c.sqrt = function(t) {
@@ -1232,7 +1232,7 @@ function qc(c) {
     return e.geq(d, e.zero) ? d : e.neg(d);
   };
 }
-function Dc(c) {
+function Mc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 8 not implemented");
   };
@@ -1240,10 +1240,10 @@ function Dc(c) {
 function Le(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 Mc(c) {
+function Rc(c) {
   Le(c, 0, 4, 8, 12), Le(c, 1, 5, 9, 13), Le(c, 2, 6, 10, 14), Le(c, 3, 7, 11, 15), Le(c, 0, 5, 10, 15), Le(c, 1, 6, 11, 12), Le(c, 2, 7, 8, 13), Le(c, 3, 4, 9, 14);
 }
-class Rc {
+class Nc {
   constructor(t) {
     t = t || [0, 0, 0, 0, 0, 0, 0, 0], this.state = [
       1634760805,
@@ -1268,7 +1268,7 @@ class Rc {
     return this.idx == 16 && this.update(), this.buff[this.idx++];
   }
   nextU64() {
-    return jn(si(this.nextU32(), 4294967296), this.nextU32());
+    return $n(ri(this.nextU32(), 4294967296), this.nextU32());
   }
   nextBool() {
     return (this.nextU32() & 1) == 1;
@@ -1277,13 +1277,13 @@ class Rc {
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.state[t];
     for (let t = 0; t < 10; t++)
-      Mc(this.buff);
+      Rc(this.buff);
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.buff[t] + this.state[t] >>> 0;
     this.idx = 0, this.state[12] = this.state[12] + 1 >>> 0, this.state[12] == 0 && (this.state[13] = this.state[13] + 1 >>> 0, this.state[13] == 0 && (this.state[14] = this.state[14] + 1 >>> 0, this.state[14] == 0 && (this.state[15] = this.state[15] + 1 >>> 0)));
   }
 }
-function _i(c) {
+function gi(c) {
   let t = new Uint8Array(c);
   if (process.browser)
     if (typeof globalThis.crypto < "u")
@@ -1295,17 +1295,17 @@ function _i(c) {
     on.randomFillSync(t);
   return t;
 }
-function Nc() {
-  const c = _i(32), t = new Uint32Array(c.buffer), e = [];
+function zc() {
+  const c = gi(32), t = new Uint32Array(c.buffer), e = [];
   for (let n = 0; n < 8; n++)
     e.push(t[n]);
   return e;
 }
 let Qe = null;
-function Gn() {
-  return Qe || (Qe = new Rc(Nc()), Qe);
+function Zn() {
+  return Qe || (Qe = new Nc(zc()), Qe);
 }
-class zc {
+class Uc {
   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;
@@ -1329,7 +1329,7 @@ class zc {
   fft(t) {
     if (t.length <= 1)
       return t;
-    const e = fa(t.length - 1) + 1;
+    const e = _a(t.length - 1) + 1;
     this._setRoots(e);
     const n = 1 << e;
     if (t.length != n)
@@ -1339,7 +1339,7 @@ class zc {
   ifft(t) {
     if (t.length <= 1)
       return t;
-    const e = fa(t.length - 1) + 1;
+    const e = _a(t.length - 1) + 1;
     this._setRoots(e);
     const n = 1 << e;
     if (t.length != n)
@@ -1350,7 +1350,7 @@ class zc {
     return g;
   }
 }
-function fa(c) {
+function _a(c) {
   return (c & 4294901760 ? (c &= 4294901760, 16) : 0) | (c & 4278255360 ? (c &= 4278255360, 8) : 0) | (c & 4042322160 ? (c &= 4042322160, 4) : 0) | (c & 3435973836 ? (c &= 3435973836, 2) : 0) | (c & 2863311530) !== 0;
 }
 function en(c, t, e, n, a) {
@@ -1367,7 +1367,7 @@ function en(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 Uc {
+class jc {
   constructor(t) {
     this.type = "F1", this.one = BigInt(1), this.zero = BigInt(0), this.p = BigInt(t), this.m = 1, this.negone = this.p - this.one, this.two = BigInt(2), this.half = this.p >> this.one, this.bitLength = We(this.p), this.mask = (this.one << BigInt(this.bitLength)) - this.one, this.n64 = Math.floor((this.bitLength - 1) / 64) + 1, this.n32 = this.n64 * 2, this.n8 = this.n64 * 8, this.R = this.e(this.one << BigInt(this.n64 * 64)), this.Ri = this.inv(this.R);
     const e = this.negone >> this.one;
@@ -1377,7 +1377,7 @@ class Uc {
       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), Sc(this), this.FFT = new zc(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), Ic(this), this.FFT = new Uc(this, this, this.mul.bind(this)), this.fft = this.FFT.fft.bind(this.FFT), this.ifft = this.FFT.ifft.bind(this.FFT), this.w = this.FFT.w, this.wi = this.FFT.wi, this.shift = this.square(this.nqr), this.k = this.exp(this.nqr, 2 ** this.s);
   }
   e(t, e) {
     let n;
@@ -1450,10 +1450,10 @@ class Uc {
     return t % e;
   }
   pow(t, e) {
-    return da(this, t, e);
+    return fa(this, t, e);
   }
   exp(t, e) {
-    return da(this, t, e);
+    return fa(this, t, e);
   }
   band(t, e) {
     const n = t & e & this.mask;
@@ -1529,7 +1529,7 @@ class Uc {
     const t = this.bitLength * 2 / 8;
     let e = this.zero;
     for (let n = 0; n < t; n++)
-      e = (e << BigInt(8)) + BigInt(_i(1)[0]);
+      e = (e << BigInt(8)) + BigInt(gi(1)[0]);
     return e % this.p;
   }
   toString(t, e) {
@@ -1562,7 +1562,7 @@ class Uc {
   }
   // Returns a buffer with Big Endian Representation
   toRprBE(t, e, n) {
-    li(t, e, n, this.n64 * 8);
+    ui(t, e, n, this.n64 * 8);
   }
   // Returns a buffer with Big Endian Montgomery Representation
   toRprBEM(t, e, n) {
@@ -1577,7 +1577,7 @@ class Uc {
   }
   // Pases a buffer with Big Endian Representation
   fromRprBE(t, e) {
-    return ui(t, e, this.n8);
+    return di(t, e, this.n8);
   }
   fromRprLEM(t, e) {
     return this.mul(this.fromRprLE(t, e), this.Ri);
@@ -1607,7 +1607,7 @@ be.bigInt2U32LE = function(t, e) {
 be.isOcamNum = function(c) {
   return !(!Array.isArray(c) || c.length != 3 || typeof c[0] != "number" || typeof c[1] != "number" || !Array.isArray(c[2]));
 };
-var jc = function(t, e, n) {
+var $c = function(t, e, n) {
   const a = n || "int";
   if (t.modules[a])
     return a;
@@ -2333,7 +2333,7 @@ var jc = 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;
-}, Zn = function(t, e, n, a, s, g, d) {
+}, Wn = 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));
@@ -2381,8 +2381,8 @@ var jc = function(t, e, n) {
       );
     return E;
   }
-}, Wn = $c;
-function $c(c, t) {
+}, Xn = Gc;
+function Gc(c, t) {
   const e = c.modules[t].n64 * 8, n = c.addFunction(t + "_batchInverse");
   n.addParam("pIn", "i32"), n.addParam("inStep", "i32"), n.addParam("n", "i32"), n.addParam("pOut", "i32"), n.addParam("outStep", "i32"), n.addLocal("itAux", "i32"), n.addLocal("itIn", "i32"), n.addLocal("itOut", "i32"), n.addLocal("i", "i32");
   const a = n.getCodeBuilder(), s = a.i32_const(c.alloc(e));
@@ -2489,8 +2489,8 @@ function $c(c, t) {
     )
   );
 }
-var gi = Gc;
-function Gc(c, t, e, n, a, s) {
+var pi = Zc;
+function Zc(c, t, e, n, a, s) {
   typeof s > "u" && (n < a ? s = !0 : s = !1);
   const g = c.addFunction(t);
   g.addParam("pIn", "i32"), g.addParam("n", "i32"), g.addParam("pOut", "i32"), g.addLocal("i", "i32"), g.addLocal("itIn", "i32"), g.addLocal("itOut", "i32");
@@ -2545,8 +2545,8 @@ function Gc(c, t, e, n, a, s) {
     ))
   );
 }
-var Zc = Wc;
-function Wc(c, t, e, n, a, s) {
+var Wc = Xc;
+function Xc(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");
@@ -2618,25 +2618,25 @@ function Wc(c, t, e, n, a, s) {
   );
 }
 var re = {};
-function pi(c, t) {
+function hi(c, t) {
   return c === t ? 0 : c > t ? 1 : -1;
 }
-function Xn(c) {
+function Vn(c) {
   return c * c;
 }
-function hi(c) {
+function Li(c) {
   return c % 2n !== 0n;
 }
-function Vn(c) {
+function Hn(c) {
   return c % 2n === 0n;
 }
 function rn(c) {
   return c < 0n;
 }
-function Xc(c) {
+function Vc(c) {
   return c > 0n;
 }
-function Li(c) {
+function mi(c) {
   return rn(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
 function Ve(c) {
@@ -2645,52 +2645,52 @@ function Ve(c) {
 function Oe(c) {
   return Ve(c) === 1n;
 }
-function mi(c, t) {
+function bi(c, t) {
   for (var e = 0n, n = 1n, a = t, s = Ve(c), g, d, C; s !== 0n; )
     g = a / s, d = e, C = a, e = n, a = s, n = d - g * n, s = C - g * s;
   if (!Oe(a))
     throw new Error(c.toString() + " and " + t.toString() + " are not co-prime");
-  return pi(e, 0n) === -1 && (e = e + t), rn(c) ? -e : e;
+  return hi(e, 0n) === -1 && (e = e + t), rn(c) ? -e : e;
 }
-function bi(c, t, e) {
+function yi(c, t, e) {
   if (e === 0n)
     throw new Error("Cannot take modPow with modulus 0");
   var n = 1n, a = c % e;
-  for (rn(t) && (t = t * -1n, a = mi(a, e)); Xc(t); ) {
+  for (rn(t) && (t = t * -1n, a = bi(a, e)); Vc(t); ) {
     if (a === 0n)
       return 0n;
-    hi(t) && (n = n * a % e), t = t / 2n, a = Xn(a) % e;
+    Li(t) && (n = n * a % e), t = t / 2n, a = Vn(a) % e;
   }
   return n;
 }
-function Vc(c, t) {
+function Hc(c, t) {
   return c = c >= 0n ? c : -c, t = t >= 0n ? t : -t, c === t ? 0 : c > t ? 1 : -1;
 }
-function _a(c, t) {
-  return t === 0n ? !1 : Oe(t) ? !0 : Vc(t, 2n) === 0 ? Vn(c) : c % t === 0n;
+function ga(c, t) {
+  return t === 0n ? !1 : Oe(t) ? !0 : Hc(t, 2n) === 0 ? Hn(c) : c % t === 0n;
 }
-function Hc(c) {
+function Qc(c) {
   var t = Ve(c);
   if (Oe(t))
     return !1;
   if (t === 2n || t === 3n || t === 5n)
     return !0;
-  if (Vn(t) || _a(t, 3n) || _a(t, 5n))
+  if (Hn(t) || ga(t, 3n) || ga(t, 5n))
     return !1;
   if (t < 49n)
     return !0;
 }
-function Qc(c) {
+function Jc(c) {
   return c - 1n;
 }
-function ga(c, t) {
-  for (var e = Qc(c), n = e, a = 0, s, g, d; Vn(n); )
+function pa(c, t) {
+  for (var e = Jc(c), n = e, a = 0, s, g, d; Hn(n); )
     n = n / 2n, a++;
   t:
     for (g = 0; g < t.length; g++)
-      if (!(c < t[g]) && (d = bi(BigInt(t[g]), n, c), !(Oe(d) || d === e))) {
+      if (!(c < t[g]) && (d = yi(BigInt(t[g]), n, c), !(Oe(d) || d === e))) {
         for (s = a - 1; s != 0; s--) {
-          if (d = Xn(d) % c, Oe(d))
+          if (d = Vn(d) % c, Oe(d))
             return !1;
           if (d === e)
             continue t;
@@ -2699,33 +2699,33 @@ function ga(c, t) {
       }
   return !0;
 }
-function Jc(c) {
-  var t = Hc(c);
+function Kc(c) {
+  var t = Qc(c);
   if (t !== void 0)
     return t;
-  var e = Ve(c), n = Li(e);
+  var e = Ve(c), n = mi(e);
   if (n <= 64)
-    return ga(e, [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]);
+    return pa(e, [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]);
   for (var a = Math.log(2) * Number(n), s = Math.ceil(a), g = [], d = 0; d < s; d++)
     g.push(BigInt(d + 2));
-  return ga(e, g);
+  return pa(e, g);
 }
-re.bitLength = Li;
-re.isOdd = hi;
+re.bitLength = mi;
+re.isOdd = Li;
 re.isNegative = rn;
 re.abs = Ve;
 re.isUnit = Oe;
-re.compare = pi;
-re.modInv = mi;
-re.modPow = bi;
-re.isPrime = Jc;
-re.square = Xn;
-const Kc = jc, ge = be, Yc = Zn, ts = Wn, pn = gi, hn = Zc, { bitLength: es, modInv: Ln, modPow: pa, isPrime: ha, isOdd: ns, square: as } = re;
-var Hn = function(t, e, n, a) {
-  const s = BigInt(e), g = Math.floor((es(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
+re.compare = hi;
+re.modInv = bi;
+re.modPow = yi;
+re.isPrime = Kc;
+re.square = Vn;
+const Yc = $c, ge = be, ts = Wn, es = Xn, pn = pi, hn = Wc, { bitLength: ns, modInv: Ln, modPow: ha, isPrime: La, isOdd: as, square: is } = re;
+var Qn = function(t, e, n, a) {
+  const s = BigInt(e), g = Math.floor((ns(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
   if (t.modules[l])
     return l;
-  const o = Kc(t, g, a), y = t.alloc(C, ge.bigInt2BytesLE(s, C)), E = t.alloc(ge.bigInt2BytesLE(as(1n << BigInt(g * 64)) % s, C)), m = t.alloc(ge.bigInt2BytesLE((1n << BigInt(g * 64)) % s, C)), x = t.alloc(ge.bigInt2BytesLE(0n, C)), O = s - 1n, L = O >> 1n, I = t.alloc(C, ge.bigInt2BytesLE(L, C)), v = L + 1n, U = t.alloc(C, ge.bigInt2BytesLE(v, C));
+  const o = Yc(t, g, a), y = t.alloc(C, ge.bigInt2BytesLE(s, C)), E = t.alloc(ge.bigInt2BytesLE(is(1n << BigInt(g * 64)) % s, C)), m = t.alloc(ge.bigInt2BytesLE((1n << BigInt(g * 64)) % s, C)), x = t.alloc(ge.bigInt2BytesLE(0n, C)), O = s - 1n, L = O >> 1n, I = t.alloc(C, ge.bigInt2BytesLE(L, C)), v = L + 1n, U = t.alloc(C, ge.bigInt2BytesLE(v, C));
   t.modules[l] = {
     pq: y,
     pR2: E,
@@ -3248,13 +3248,13 @@ var Hn = 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 (ha(s))
-    for (; pa(nt, L, s) !== O; )
+  if (La(s))
+    for (; ha(nt, L, s) !== O; )
       nt = nt + 1n;
   let J = 0, ft = O;
-  for (; !ns(ft) && ft !== 0n; )
+  for (; !as(ft) && ft !== 0n; )
     J++, ft = ft >> 1n;
-  const at = t.alloc(C, ge.bigInt2BytesLE(ft, C)), _t = pa(nt, ft, s), zt = t.alloc(ge.bigInt2BytesLE((_t << BigInt(g * 64)) % s, C)), G = ft + 1n >> 1n, K = t.alloc(C, ge.bigInt2BytesLE(G, C));
+  const at = t.alloc(C, ge.bigInt2BytesLE(ft, C)), _t = ha(nt, ft, s), zt = t.alloc(ge.bigInt2BytesLE((_t << BigInt(g * 64)) % s, C)), G = ft + 1n >> 1n, K = t.alloc(C, ge.bigInt2BytesLE(G, C));
   function P() {
     const z = t.addFunction(l + "_sqrt");
     z.addParam("n", "i32"), z.addParam("r", "i32"), z.addLocal("m", "i32"), z.addLocal("i", "i32"), z.addLocal("j", "i32");
@@ -3378,7 +3378,7 @@ var Hn = 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(), ts(t, l), pn(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), pn(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), pn(t, l + "_batchNeg", l + "_neg", C, C), hn(t, l + "_batchAdd", l + "_add", C, C), hn(t, l + "_batchSub", l + "_sub", C, C), hn(t, l + "_batchMul", l + "_mul", C, C), t.exportFunction(l + "_add"), t.exportFunction(l + "_sub"), t.exportFunction(l + "_neg"), t.exportFunction(l + "_isNegative"), t.exportFunction(l + "_isOne"), t.exportFunction(l + "_sign"), t.exportFunction(l + "_mReduct"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_squareOld"), t.exportFunction(l + "_fromMontgomery"), t.exportFunction(l + "_toMontgomery"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_one"), t.exportFunction(l + "_load"), t.exportFunction(l + "_timesScalar"), Yc(
+  return t.exportFunction(o + "_copy", l + "_copy"), t.exportFunction(o + "_zero", l + "_zero"), t.exportFunction(o + "_isZero", l + "_isZero"), t.exportFunction(o + "_eq", l + "_eq"), W(), S(), F(), r(), j(), T(), D(), A(), M(), H(), h(), R(), ut(), w(), q(), u(), es(t, l), pn(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), pn(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), pn(t, l + "_batchNeg", l + "_neg", C, C), hn(t, l + "_batchAdd", l + "_add", C, C), hn(t, l + "_batchSub", l + "_sub", C, C), hn(t, l + "_batchMul", l + "_mul", C, C), t.exportFunction(l + "_add"), t.exportFunction(l + "_sub"), t.exportFunction(l + "_neg"), t.exportFunction(l + "_isNegative"), t.exportFunction(l + "_isOne"), t.exportFunction(l + "_sign"), t.exportFunction(l + "_mReduct"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_squareOld"), t.exportFunction(l + "_fromMontgomery"), t.exportFunction(l + "_toMontgomery"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_one"), t.exportFunction(l + "_load"), t.exportFunction(l + "_timesScalar"), ts(
     t,
     l + "_exp",
     C,
@@ -3386,17 +3386,17 @@ var Hn = function(t, e, n, a) {
     l + "_square",
     o + "_copy",
     l + "_one"
-  ), t.exportFunction(l + "_exp"), t.exportFunction(l + "_batchInverse"), ha(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"), La(s) && (P(), i(), t.exportFunction(l + "_sqrt"), t.exportFunction(l + "_isSquare")), t.exportFunction(l + "_batchToMontgomery"), t.exportFunction(l + "_batchFromMontgomery"), l;
 };
-const is = Hn, { bitLength: os } = re;
-var yi = function(t, e, n, a, s) {
-  const g = BigInt(e), d = Math.floor((os(g - 1n) - 1) / 64) + 1, C = d * 8, l = n || "f1";
+const os = Qn, { bitLength: cs } = re;
+var Ci = function(t, e, n, a, s) {
+  const g = BigInt(e), d = Math.floor((cs(g - 1n) - 1) / 64) + 1, C = d * 8, l = n || "f1";
   if (t.modules[l])
     return l;
   t.modules[l] = {
     n64: d
   };
-  const o = s || "int", y = is(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
+  const o = s || "int", y = os(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
   function O() {
     const U = t.alloc(C), w = t.addFunction(l + "_mul");
     w.addParam("x", "i32"), w.addParam("y", "i32"), w.addParam("r", "i32");
@@ -3425,8 +3425,8 @@ var yi = 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 cs = Zn, ss = Wn, mn = be;
-var Ci = function(t, e, n, a) {
+const ss = Wn, rs = Xn, mn = be;
+var Ai = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8, g = t.modules[a].q;
@@ -3722,7 +3722,7 @@ var Ci = 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"), ss(t, n), cs(
+  return F(), R(), U(), w(), v(), m(), x(), O(), d(), l(), o(), y(), L(), I(), S(), r(), C(), h(), E(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_mul1"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_conjugate"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), rs(t, n), ss(
     t,
     n + "_exp",
     s * 2,
@@ -3732,8 +3732,8 @@ var Ci = 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 rs = Zn, ls = Wn;
-var Ai = function(t, e, n, a) {
+const ls = Wn, us = Xn;
+var Fi = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8;
@@ -3990,7 +3990,7 @@ var Ai = 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"), ls(t, n), rs(
+  return U(), F(), L(), I(), O(), y(), E(), g(), C(), l(), S(), m(), x(), v(), w(), d(), o(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), us(t, n), ls(
     t,
     n + "_exp",
     s * 3,
@@ -3999,7 +3999,7 @@ var Ai = 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;
-}, us = function(t, e, n, a, s, g, d, C) {
+}, ds = function(t, e, n, a, s, g, d, C) {
   const l = t.addFunction(e);
   l.addParam("base", "i32"), l.addParam("scalar", "i32"), l.addParam("scalarLength", "i32"), l.addParam("r", "i32"), l.addLocal("old0", "i32"), l.addLocal("nbits", "i32"), l.addLocal("i", "i32"), l.addLocal("last", "i32"), l.addLocal("cur", "i32"), l.addLocal("carry", "i32"), l.addLocal("p", "i32");
   const o = l.getCodeBuilder(), y = o.i32_const(t.alloc(n));
@@ -4182,7 +4182,7 @@ var Ai = function(t, e, n, a) {
     )),
     o.i32_store(o.i32_const(0), o.getLocal("old0"))
   );
-}, ds = function(t, e, n, a, s) {
+}, fs = function(t, e, n, a, s) {
   const d = t.modules[e].n64 * 8;
   function C() {
     const E = t.addFunction(n + "_getChunk");
@@ -4574,8 +4574,8 @@ var Ai = function(t, e, n, a) {
   }
   C(), y(), l(), o(), t.exportFunction(n), t.exportFunction(n + "_chunk");
 };
-const La = us, qe = gi, ma = ds;
-var Fi = function(t, e, n, a) {
+const ma = ds, qe = pi, ba = fs;
+var Ei = function(t, e, n, a) {
   const s = t.modules[n].n64, g = s * 8;
   if (t.modules[e])
     return e;
@@ -5473,7 +5473,7 @@ var Fi = function(t, e, n, a) {
       )
     );
   }
-  return C(), d(), E(), y(), o(), l(), ut(), I(), x(), m(), L(), O(), h(), r(), F(), j(), R(), A(), D(), T(), S(), w(), U(), v(), H(), G(), K(), nt(), M(), J(), at(), ft(), _t(), zt(), qe(t, e + "_batchLEMtoU", e + "_LEMtoU", g * 2, g * 2), qe(t, e + "_batchLEMtoC", e + "_LEMtoC", g * 2, g), qe(t, e + "_batchUtoLEM", e + "_UtoLEM", g * 2, g * 2), qe(t, e + "_batchCtoLEM", e + "_CtoLEM", g, g * 2, !0), qe(t, e + "_batchToJacobian", e + "_toJacobian", g * 2, g * 3, !0), ma(t, e, e + "_multiexp", e + "_add", g * 3), ma(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), La(
+  return C(), d(), E(), y(), o(), l(), ut(), I(), x(), m(), L(), O(), h(), r(), F(), j(), R(), A(), D(), T(), S(), w(), U(), v(), H(), G(), K(), nt(), M(), J(), at(), ft(), _t(), zt(), qe(t, e + "_batchLEMtoU", e + "_LEMtoU", g * 2, g * 2), qe(t, e + "_batchLEMtoC", e + "_LEMtoC", g * 2, g), qe(t, e + "_batchUtoLEM", e + "_UtoLEM", g * 2, g * 2), qe(t, e + "_batchCtoLEM", e + "_CtoLEM", g, g * 2, !0), qe(t, e + "_batchToJacobian", e + "_toJacobian", g * 2, g * 3, !0), ba(t, e, e + "_multiexp", e + "_add", g * 3), ba(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), ma(
     t,
     e + "_timesScalar",
     g * 3,
@@ -5482,7 +5482,7 @@ var Fi = function(t, e, n, a) {
     e + "_sub",
     e + "_copy",
     e + "_zero"
-  ), La(
+  ), ma(
     t,
     e + "_timesScalarAffine",
     g * 2,
@@ -5493,11 +5493,11 @@ var Fi = 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: fs, modInv: ba, modPow: De } = re, Je = be;
-var Ei = function(t, e, n, a, s) {
+const { isOdd: _s, modInv: ya, modPow: De } = re, Je = be;
+var wi = 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 (; !fs(y); )
+  for (; !_s(y); )
     E++, y = y >> 1n;
   let m = 2n;
   for (; De(m, o >> 1n, o) === 1n; )
@@ -5518,12 +5518,12 @@ var Ei = function(t, e, n, a, s) {
     U[q] = U[q - 1] * 2n;
   const w = [];
   for (let q = 0; q <= E; q++) {
-    const u = ba(U[q], o) * I % o;
+    const u = ya(U[q], o) * I % o;
     w.push(...Je.bigInt2BytesLE(u, d));
   }
   const S = t.alloc(w), F = De(m, 2n, o), r = [], h = [];
   for (let q = 0; q <= E; q++) {
-    const u = De(F, 2n ** BigInt(q), o), W = ba(o + 1n - u, o);
+    const u = De(F, 2n ** BigInt(q), o), W = ya(o + 1n - u, o);
     r.push(...Je.bigInt2BytesLE(u * I % o, d)), h.push(...Je.bigInt2BytesLE(W * I % o, d));
   }
   const R = t.alloc(r), j = t.alloc(h);
@@ -6516,7 +6516,7 @@ var Ei = 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");
-}, wi = function(t, e, n) {
+}, Bi = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const C = t.addFunction(e + "_zero");
@@ -6609,7 +6609,7 @@ var Ei = function(t, e, n, a, s) {
     );
   }
   return g(), d(), t.exportFunction(e + "_zero"), t.exportFunction(e + "_constructLC"), e;
-}, Bi = function(t, e, n) {
+}, vi = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const l = t.addFunction(e + "_buildABC");
@@ -6879,7 +6879,7 @@ var Ei = function(t, e, n, a, s) {
     );
   }
   return g(), d(), C(), t.exportFunction(e + "_buildABC"), t.exportFunction(e + "_joinABC"), t.exportFunction(e + "_batchAdd"), e;
-}, vi = function(t, e, n, a, s, g, d, C) {
+}, xi = function(t, e, n, a, s, g, d, C) {
   const l = t.addFunction(e);
   l.addParam("pIn", "i32"), l.addParam("n", "i32"), l.addParam("pFirst", "i32"), l.addParam("pInc", "i32"), l.addParam("pOut", "i32"), l.addLocal("pOldFree", "i32"), l.addLocal("i", "i32"), l.addLocal("pFrom", "i32"), l.addLocal("pTo", "i32");
   const o = l.getCodeBuilder(), y = o.i32_const(t.alloc(d));
@@ -6916,19 +6916,19 @@ var Ei = function(t, e, n, a, s) {
     ))
   ), t.exportFunction(e);
 };
-const Nt = be, _s = Hn, gs = yi, ya = Ci, ps = Ai, Ca = Fi, bn = Ei, hs = wi, Ls = Bi, Me = vi, { bitLength: ms, modInv: bs, isOdd: Aa, isNegative: ys } = re;
-var Cs = function(t, e) {
+const Nt = be, gs = Qn, ps = Ci, Ca = Ai, hs = Fi, Aa = Ei, bn = wi, Ls = Bi, ms = vi, Me = xi, { bitLength: bs, modInv: ys, isOdd: Fa, isNegative: Cs } = re;
+var As = function(t, e) {
   const n = e || "bn128";
   if (t.modules[n])
     return n;
-  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((ms(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 = _s(t, a, "f1m");
-  gs(t, s, "fr", "frm");
-  const x = t.alloc(Nt.bigInt2BytesLE(w(3n), l)), O = Ca(t, "g1m", "f1m", x);
-  bn(t, "frm", "frm", "frm", "frm_mul"), hs(t, "pol", "frm"), Ls(t, "qap", "frm");
-  const L = ya(t, "f1m_neg", "f2m", "f1m"), I = t.alloc([
+  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((bs(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = d, o = l * 2, y = l * 12, E = t.alloc(Nt.bigInt2BytesLE(s, C)), m = gs(t, a, "f1m");
+  ps(t, s, "fr", "frm");
+  const x = t.alloc(Nt.bigInt2BytesLE(w(3n), l)), O = Aa(t, "g1m", "f1m", x);
+  bn(t, "frm", "frm", "frm", "frm_mul"), Ls(t, "pol", "frm"), ms(t, "qap", "frm");
+  const L = Ca(t, "f1m_neg", "f2m", "f1m"), I = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
     ...Nt.bigInt2BytesLE(w(266929791119991161246907387137283842545076965332900288569378510910307636690n), l)
-  ]), v = Ca(t, "g2m", "f2m", I);
+  ]), v = Aa(t, "g2m", "f2m", I);
   function U(Y, f) {
     const _ = t.addFunction(Y);
     _.addParam("pG", "i32"), _.addParam("pFr", "i32"), _.addParam("pr", "i32");
@@ -7029,7 +7029,7 @@ var Cs = function(t, e) {
     ...Nt.bigInt2BytesLE(w(9), l),
     ...Nt.bigInt2BytesLE(w(1), l)
   ]), H = t.alloc([
-    ...Nt.bigInt2BytesLE(w(bs(2n, a)), l),
+    ...Nt.bigInt2BytesLE(w(ys(2n, a)), l),
     ...Nt.bigInt2BytesLE(0n, l)
   ]), ut = M, nt = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
@@ -7049,7 +7049,7 @@ var Cs = function(t, e) {
     );
   }
   J();
-  const ft = ps(t, n + "_mulNR6", "f6m", "f2m");
+  const ft = hs(t, n + "_mulNR6", "f6m", "f2m");
   function at() {
     const Y = t.addFunction(n + "_mulNR12");
     Y.addParam("x", "i32"), Y.addParam("pr", "i32");
@@ -7074,7 +7074,7 @@ var Cs = function(t, e) {
     );
   }
   at();
-  const _t = ya(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 = 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;
   t.modules[n] = {
     n64: g,
     pG1gen: F,
@@ -7096,7 +7096,7 @@ var Cs = function(t, e) {
     let f = Y;
     const _ = [];
     for (; f > 0n; ) {
-      if (Aa(f)) {
+      if (Fa(f)) {
         const Z = 2 - Number(f % 4n);
         _.push(Z), f = f - BigInt(Z);
       } else
@@ -7109,7 +7109,7 @@ var Cs = function(t, e) {
     let f = Y;
     const _ = [];
     for (; f > 0n; )
-      Aa(f) ? _.push(1) : _.push(0), f = f >> 1n;
+      Fa(f) ? _.push(1) : _.push(0), f = f >> 1n;
     return _;
   }
   function Lt() {
@@ -7503,7 +7503,7 @@ var Cs = function(t, e) {
         (ct * rt - st * ot) % a,
         (ct * ot + st * rt) % a
       ];
-      return ys(gt[0]) && (gt[0] = gt[0] + a), gt;
+      return Cs(gt[0]) && (gt[0] = gt[0] + a), gt;
     }
   }
   function $t() {
@@ -7736,19 +7736,19 @@ var Cs = function(t, e) {
     Wt(Y), t.exportFunction(n + "_pairingEq" + Y);
   wt(), t.exportFunction(n + "_pairing"), t.exportFunction(n + "_prepareG1"), t.exportFunction(n + "_prepareG2"), t.exportFunction(n + "_millerLoop"), t.exportFunction(n + "_finalExponentiation"), t.exportFunction(n + "_finalExponentiationOld"), t.exportFunction(n + "__mulBy024"), t.exportFunction(n + "__mulBy024Old"), t.exportFunction(n + "__cyclotomicSquare"), t.exportFunction(n + "__cyclotomicExp_w0");
 };
-const Mt = be, As = Hn, Fs = yi, Fa = Ci, Es = Ai, Ea = Fi, yn = Ei, ws = wi, Bs = Bi, Re = vi, { bitLength: wa, isOdd: Ba, isNegative: vs } = re;
-var xs = function(t, e) {
+const Mt = be, Fs = Qn, Es = Ci, Ea = Ai, ws = Fi, wa = Ei, yn = wi, Bs = Bi, vs = vi, Re = xi, { bitLength: Ba, isOdd: va, isNegative: xs } = re;
+var Ss = function(t, e) {
   const n = e || "bls12381";
   if (t.modules[n])
     return n;
-  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((wa(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((wa(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = As(t, a, "f1m", "intq");
-  Fs(t, s, "fr", "frm", "intr");
-  const L = t.alloc(Mt.bigInt2BytesLE(F(4n), C)), I = Ea(t, "g1m", "f1m", L);
-  yn(t, "frm", "frm", "frm", "frm_mul"), ws(t, "pol", "frm"), Bs(t, "qap", "frm");
-  const v = Fa(t, "f1m_neg", "f2m", "f1m"), U = t.alloc([
+  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((Ba(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((Ba(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = Fs(t, a, "f1m", "intq");
+  Es(t, s, "fr", "frm", "intr");
+  const L = t.alloc(Mt.bigInt2BytesLE(F(4n), C)), I = wa(t, "g1m", "f1m", L);
+  yn(t, "frm", "frm", "frm", "frm_mul"), Bs(t, "pol", "frm"), vs(t, "qap", "frm");
+  const v = Ea(t, "f1m_neg", "f2m", "f1m"), U = t.alloc([
     ...Mt.bigInt2BytesLE(F(4n), C),
     ...Mt.bigInt2BytesLE(F(4n), C)
-  ]), w = Ea(t, "g2m", "f2m", U);
+  ]), w = wa(t, "g2m", "f2m", U);
   function S(f, _) {
     const Z = t.addFunction(f);
     Z.addParam("pG", "i32"), Z.addParam("pFr", "i32"), Z.addParam("pr", "i32");
@@ -7860,7 +7860,7 @@ var xs = function(t, e) {
     );
   }
   nt();
-  const J = Es(t, v + "_mulNR", "f6m", "f2m");
+  const J = ws(t, v + "_mulNR", "f6m", "f2m");
   function ft() {
     const f = t.addFunction(J + "_mulNR");
     f.addParam("x", "i32"), f.addParam("pr", "i32");
@@ -7889,7 +7889,7 @@ var xs = function(t, e) {
     );
   }
   ft();
-  const at = Fa(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 = 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;
   t.modules[n] = {
     n64q: g,
     n64r: y,
@@ -7913,7 +7913,7 @@ var xs = function(t, e) {
     let _ = f;
     const Z = [];
     for (; _ > 0n; ) {
-      if (Ba(_)) {
+      if (va(_)) {
         const Q = 2 - Number(_ % 4n);
         Z.push(Q), _ = _ - BigInt(Q);
       } else
@@ -7926,7 +7926,7 @@ var xs = function(t, e) {
     let _ = f;
     const Z = [];
     for (; _ > 0n; )
-      Ba(_) ? Z.push(1) : Z.push(0), _ = _ >> 1n;
+      va(_) ? Z.push(1) : Z.push(0), _ = _ >> 1n;
     return Z;
   }
   function Lt() {
@@ -8319,7 +8319,7 @@ var xs = function(t, e) {
         (st * ot - rt * gt) % a,
         (st * gt + rt * ot) % a
       ];
-      return vs(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
+      return xs(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
     }
   }
   function Jt() {
@@ -8636,47 +8636,47 @@ var xs = 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");
-}, Ss = Cs, Is = xs;
-function On(c) {
+}, Is = As, Os = Ss;
+function Pn(c) {
   if (typeof c == "bigint" || c.eq !== void 0)
     return c.toString(10);
   if (c instanceof Uint8Array)
     return $e(c, 0);
   if (Array.isArray(c))
-    return c.map(On);
+    return c.map(Pn);
   if (typeof c == "object") {
     const t = {};
     return Object.keys(c).forEach((n) => {
-      t[n] = On(c[n]);
+      t[n] = Pn(c[n]);
     }), t;
   } else
     return c;
 }
-function Pn(c) {
+function kn(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(Pn);
+    return c.map(kn);
   if (typeof c == "object") {
     if (c === null)
       return null;
     const t = {};
     return Object.keys(c).forEach((n) => {
-      t[n] = Pn(c[n]);
+      t[n] = kn(c[n]);
     }), t;
   } else
     return c;
 }
-function Os(c) {
+function Ps(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 Ps(c, t) {
+function ks(c, t) {
   let e = c;
   const n = new Uint8Array(t), a = new DataView(n.buffer);
   let s = t;
@@ -8686,14 +8686,14 @@ function Ps(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function ks(c) {
+function Ts(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 xi(c, t) {
+function Si(c, t) {
   let e = c;
   typeof t > "u" && (t = Math.floor((We(c) - 1) / 8) + 1, t == 0 && (t = 1));
   const n = new Uint8Array(t), a = new DataView(n.buffer);
@@ -8704,66 +8704,66 @@ function xi(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function kn(c, t) {
+function Tn(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(kn.bind(this, c));
+    return t.map(Tn.bind(this, c));
   if (typeof t == "object") {
     const e = {};
     return Object.keys(t).forEach((a) => {
-      e[a] = kn(c, t[a]);
+      e[a] = Tn(c, t[a]);
     }), e;
   } else
     return t;
 }
-function Tn(c, t) {
+function qn(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(Tn.bind(this, c));
+    return t.map(qn.bind(this, c));
   if (typeof t == "object") {
     if (t === null)
       return null;
     const e = {};
     return Object.keys(t).forEach((a) => {
-      e[a] = Tn(c, t[a]);
+      e[a] = qn(c, t[a]);
     }), e;
   } else
     return t;
 }
 const ze = [];
 for (let c = 0; c < 256; c++)
-  ze[c] = Ts(c, 8);
-function Ts(c, t) {
+  ze[c] = qs(c, 8);
+function qs(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 Si(c, t) {
+function Ii(c, t) {
   return (ze[c >>> 24] | ze[c >>> 16 & 255] << 8 | ze[c >>> 8 & 255] << 16 | ze[c & 255] << 24) >>> 32 - t;
 }
 function le(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 Ii(c, t) {
+function Oi(c, t) {
   const e = c.byteLength / t, n = le(e);
   if (e != 1 << n)
     throw new Error("Invalid number of pointers");
   for (let a = 0; a < e; a++) {
-    const s = Si(a, n);
+    const s = Ii(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 Qn(c, t) {
+function Jn(c, t) {
   const e = new Uint8Array(t * c.length);
   for (let n = 0; n < c.length; n++)
     e.set(c[n], n * t);
@@ -8775,21 +8775,21 @@ function nn(c, t) {
     n[a] = c.slice(a * t, a * t + t);
   return n;
 }
-const qs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ds = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  array2buffer: Qn,
-  beBuff2int: Os,
-  beInt2Buff: Ps,
-  bitReverse: Si,
-  buffReverseBits: Ii,
+  array2buffer: Jn,
+  beBuff2int: Ps,
+  beInt2Buff: ks,
+  bitReverse: Ii,
+  buffReverseBits: Oi,
   buffer2array: nn,
-  leBuff2int: ks,
-  leInt2Buff: xi,
+  leBuff2int: Ts,
+  leInt2Buff: Si,
   log2: le,
-  stringifyBigInts: On,
-  stringifyFElements: kn,
-  unstringifyBigInts: Pn,
-  unstringifyFElements: Tn
+  stringifyBigInts: Pn,
+  stringifyFElements: Tn,
+  unstringifyBigInts: kn,
+  unstringifyFElements: qn
 }, Symbol.toStringTag, { value: "Module" })), ce = 1 << 30;
 class Vt {
   constructor(t) {
@@ -8861,7 +8861,7 @@ function me(c, t, e, n) {
     return o;
   };
 }
-class va {
+class xa {
   constructor(t, e, n, a) {
     if (this.tm = t, this.prefix = e, this.p = a, this.n8 = n, this.type = "F1", this.m = 1, this.half = xe(a, Ee), this.bitLength = We(a), this.mask = he(tn(Ee, this.bitLength), Ee), this.pOp1 = t.alloc(n), this.pOp2 = t.alloc(n), this.pOp3 = t.alloc(n), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, this.n8), this.tm.instance.exports[e + "_one"](this.pOp1), this.one = this.tm.getBuff(this.pOp1, this.n8), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.n64 = Math.floor(n / 8), this.n32 = Math.floor(n / 4), this.n64 * 8 != this.n8)
       throw new Error("n8 must be a multiple of 8");
@@ -8871,7 +8871,7 @@ class va {
       this.nqr = this.add(this.nqr, this.one), s = this.exp(this.nqr, this.half);
     this.shift = this.mul(this.nqr, this.nqr), this.shiftInv = this.inv(this.shift), this.s = 0;
     let g = he(this.p, Ee);
-    for (; !Un(g); )
+    for (; !jn(g); )
       this.s = this.s + 1, g = xe(g, Ee);
     this.w = [], this.w[this.s] = this.exp(this.nqr, g);
     for (let d = this.s - 1; d >= 0; d--)
@@ -8941,27 +8941,27 @@ class va {
     if (t instanceof Uint8Array)
       return t;
     let n = ee(t, e);
-    ni(n) ? (n = ci(n), In(n, this.p) && (n = _e(n, this.p)), n = he(this.p, n)) : In(n, this.p) && (n = _e(n, this.p));
-    const a = xi(n, this.n8);
+    ai(n) ? (n = si(n), On(n, this.p) && (n = _e(n, this.p)), n = he(this.p, n)) : On(n, this.p) && (n = _e(n, this.p));
+    const a = Si(n, this.n8);
     return this.toMontgomery(a);
   }
   toString(t, e) {
     const n = this.fromMontgomery(t), a = $e(n, 0);
-    return di(a, e);
+    return fi(a, e);
   }
   fromRng(t) {
     let e;
     const n = new Uint8Array(this.n8);
     do {
-      e = fi;
+      e = _i;
       for (let a = 0; a < this.n64; a++)
-        e = jn(e, tn(t.nextU64(), 64 * a));
-      e = $n(e, this.mask);
-    } while (ri(e, this.p));
+        e = $n(e, tn(t.nextU64(), 64 * a));
+      e = Gn(e, this.mask);
+    } while (li(e, this.p));
     return je(n, 0, e, this.n8), n;
   }
   random() {
-    return this.fromRng(Gn());
+    return this.fromRng(Zn());
   }
   toObject(t) {
     const e = this.fromMontgomery(t);
@@ -8990,7 +8990,7 @@ class va {
   async batchInverse(t) {
     let e = !1;
     const n = this.n8, a = this.n8;
-    Array.isArray(t) ? (t = Qn(t, n), e = !0) : t = t.slice(0, t.byteLength);
+    Array.isArray(t) ? (t = Jn(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");
@@ -9024,7 +9024,7 @@ class va {
     return e ? nn(l, a) : l;
   }
 }
-class xa {
+class Sa {
   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);
   }
@@ -9106,7 +9106,7 @@ class xa {
     return a.set(e), a.set(n, this.F.n8), a;
   }
   random() {
-    return this.fromRng(Gn());
+    return this.fromRng(Zn());
   }
   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));
@@ -9123,7 +9123,7 @@ class xa {
     return t.slice(this.F.n8);
   }
 }
-class Ds {
+class Ms {
   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);
   }
@@ -9202,7 +9202,7 @@ class Ds {
     return s.set(e), s.set(n, this.F.n8), s.set(a, this.F.n8 * 2), s;
   }
   random() {
-    return this.fromRng(Gn());
+    return this.fromRng(Zn());
   }
   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));
@@ -9222,7 +9222,7 @@ class Ds {
     return t.slice(this.F.n8 * 2);
   }
 }
-class Sa {
+class Ia {
   constructor(t, e, n, a, s, g) {
     this.tm = t, this.prefix = e, this.F = n, this.pOp1 = t.alloc(n.n8 * 3), this.pOp2 = t.alloc(n.n8 * 3), this.pOp3 = t.alloc(n.n8 * 3), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, n.n8 * 3), this.tm.instance.exports[e + "_zeroAffine"](this.pOp1), this.zeroAffine = this.tm.getBuff(this.pOp1, n.n8 * 2), this.one = this.tm.getBuff(a, n.n8 * 3), this.g = this.one, this.oneAffine = this.tm.getBuff(a, n.n8 * 2), this.gAffine = this.oneAffine, this.b = this.tm.getBuff(s, n.n8), g && (this.cofactor = Ie(g)), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.batchLEMtoC = me(t, e + "_batchLEMtoC", n.n8 * 2, n.n8), this.batchLEMtoU = me(t, e + "_batchLEMtoU", n.n8 * 2, n.n8 * 2), this.batchCtoLEM = me(t, e + "_batchCtoLEM", n.n8, n.n8 * 2), this.batchUtoLEM = me(t, e + "_batchUtoLEM", n.n8 * 2, n.n8 * 2), this.batchToJacobian = me(t, e + "_batchToJacobian", n.n8 * 2, n.n8 * 3), this.batchToAffine = me(t, e + "_batchToAffine", n.n8 * 3, n.n8 * 2);
   }
@@ -9451,7 +9451,7 @@ class Sa {
     return this.toAffine(t).slice(this.F.n8);
   }
 }
-function Oi(c) {
+function Pi(c) {
   let e, n;
   c && (c.onmessage = function(o) {
     let y;
@@ -9535,23 +9535,23 @@ function Oi(c) {
   }
   return l;
 }
-const Ms = Worker, Cn = 25;
-class Ia {
+const Rs = Worker, Cn = 25;
+class Oa {
   constructor() {
     this.promise = new Promise((t, e) => {
       this.reject = e, this.resolve = t;
     });
   }
 }
-function Rs(c) {
+function Ns(c) {
   return new Promise((t) => setTimeout(t, c));
 }
-function Ns(c) {
+function zs(c) {
   return process.browser ? globalThis.btoa(c) : Buffer.from(c).toString("base64");
 }
-const zs = Ns("(" + Oi.toString() + ")(self)"), Us = "data:application/javascript;base64," + zs;
-async function js(c, t) {
-  const e = new $s();
+const Us = zs("(" + Pi.toString() + ")(self)"), js = "data:application/javascript;base64," + Us;
+async function $s(c, t) {
+  const e = new Gs();
   e.memory = new WebAssembly.Memory({ initial: Cn }), e.u8 = new Uint8Array(e.memory.buffer), e.u32 = new Uint32Array(e.memory.buffer);
   const n = await WebAssembly.compile(c.code);
   if (e.instance = await WebAssembly.instantiate(n, {
@@ -9559,7 +9559,7 @@ async function js(c, t) {
       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 = Oi(), await e.taskManager([{
+    e.code = c.code, e.taskManager = Pi(), await e.taskManager([{
       cmd: "INIT",
       init: Cn,
       code: e.code.slice()
@@ -9569,7 +9569,7 @@ async function js(c, t) {
     let s;
     typeof navigator == "object" && navigator.hardwareConcurrency ? s = navigator.hardwareConcurrency : s = on.cpus().length, s == 0 && (s = 2), s > 64 && (s = 64), e.concurrency = s;
     for (let d = 0; d < s; d++)
-      e.workers[d] = new Ms(Us), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
+      e.workers[d] = new Rs(js), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
     const g = [];
     for (let d = 0; d < e.workers.length; d++) {
       const C = c.code.slice();
@@ -9589,7 +9589,7 @@ async function js(c, t) {
     };
   }
 }
-class $s {
+class Gs {
   constructor() {
     this.actionQueue = [], this.oldPFree = 0;
   }
@@ -9606,7 +9606,7 @@ class $s {
   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 Ia(), this.workers[t].postMessage(e, n), this.pendingDeferreds[t].promise;
+    return this.working[t] = !0, this.pendingDeferreds[t] = a || new Oa(), this.workers[t].postMessage(e, n), this.pendingDeferreds[t].promise;
   }
   processWorks() {
     for (let t = 0; t < this.workers.length && this.actionQueue.length > 0; t++)
@@ -9616,7 +9616,7 @@ class $s {
       }
   }
   queueAction(t, e) {
-    const n = new Ia();
+    const n = new Oa();
     if (this.singleThread) {
       const a = this.taskManager(t);
       n.resolve(a);
@@ -9650,7 +9650,7 @@ class $s {
   async terminate() {
     for (let t = 0; t < this.workers.length; t++)
       this.workers[t].postMessage([{ cmd: "TERMINATE" }]);
-    await Rs(200);
+    await Ns(200);
   }
 }
 function An(c, t) {
@@ -9707,7 +9707,7 @@ function An(c, t) {
     return w;
   };
 }
-function Gs(c) {
+function Zs(c) {
   const t = c.tm;
   c.pairing = function(n, a) {
     t.startSyncOp();
@@ -9774,7 +9774,7 @@ function Gs(c) {
     return this.tm.endSyncOp(), s;
   };
 }
-const Oa = [
+const Pa = [
   1,
   1,
   1,
@@ -9808,7 +9808,7 @@ const Oa = [
   17,
   17
 ];
-function Pa(c, t) {
+function ka(c, t) {
   const e = c[t], n = e.tm;
   async function a(g, d, C, l, o) {
     if (!(g instanceof Uint8Array))
@@ -9829,7 +9829,7 @@ function Pa(c, t) {
     const x = Math.floor(d.byteLength / m);
     if (x * m != d.byteLength)
       throw new Error("Scalar size does not match");
-    const O = Oa[le(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
+    const O = Pa[le(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
     for (let w = 0; w < L; w++) {
       const S = [
         { cmd: "ALLOCSET", var: 0, buff: g },
@@ -9871,7 +9871,7 @@ function Pa(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 = Oa[le(x)], I = Math.floor((O * 8 - 1) / L) + 1;
+    const L = Pa[le(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 = [];
@@ -9900,7 +9900,7 @@ function Fn(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 = Qn(l, L), h = !0) : l = l.slice(0, l.byteLength);
+    Array.isArray(l) ? (l = Jn(l, L), h = !0) : l = l.slice(0, l.byteLength);
     const R = l.byteLength / L, j = le(R);
     if (1 << j != R)
       throw new Error("fft must be multiple of 2");
@@ -9911,7 +9911,7 @@ function Fn(c, t) {
     let T;
     o && (T = n.inv(n.e(R)));
     let D;
-    Ii(l, L);
+    Oi(l, L);
     let A, M = Math.min(1 << O, R), H = R / M;
     for (; H < a.concurrency && M >= 16; )
       H *= 2, M /= 2;
@@ -10194,9 +10194,9 @@ function Fn(c, t) {
     return w;
   };
 }
-async function Pi(c) {
-  const t = await js(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 va(t, "frm", c.n8r, c.r), e.F1 = new va(t, "f1m", c.n8q, c.q), e.F2 = new xa(t, "f2m", e.F1), e.G1 = new Sa(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Sa(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Ds(t, "f6m", e.F2), e.F12 = new xa(t, "ftm", e.F6), e.Gt = e.F12, An(e, "G1"), An(e, "G2"), An(e, "Fr"), Pa(e, "G1"), Pa(e, "G2"), Fn(e, "G1"), Fn(e, "G2"), Fn(e, "Fr"), Gs(e), e.array2buffer = function(n, a) {
+async function ki(c) {
+  const t = await $s(c.wasm, c.singleThread), e = {};
+  return e.q = ee(c.wasm.q.toString()), e.r = ee(c.wasm.r.toString()), e.name = c.name, e.tm = t, e.prePSize = c.wasm.prePSize, e.preQSize = c.wasm.preQSize, e.Fr = new xa(t, "frm", c.n8r, c.r), e.F1 = new xa(t, "f1m", c.n8q, c.q), e.F2 = new Sa(t, "f2m", e.F1), e.G1 = new Ia(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Ia(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Ms(t, "f6m", e.F2), e.F12 = new Sa(t, "ftm", e.F6), e.Gt = e.F12, An(e, "G1"), An(e, "G2"), An(e, "Fr"), ka(e, "G1"), ka(e, "G2"), Fn(e, "G1"), Fn(e, "G2"), Fn(e, "Fr"), Zs(e), e.array2buffer = function(n, a) {
     const s = new Uint8Array(a * n.length);
     for (let g = 0; g < n.length; g++)
       s.set(n[g], g * a);
@@ -10211,20 +10211,20 @@ async function Pi(c) {
 function Pe(c) {
   return BigInt(c);
 }
-function ki(c) {
+function Ti(c) {
   return c < 0n;
 }
-function Zs(c) {
+function Ws(c) {
   return c === 0n;
 }
-function Ws(c) {
-  return ki(c) ? c.toString(2).length - 1 : c.toString(2).length;
+function Xs(c) {
+  return Ti(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
 function En(c) {
   const t = [], e = Pe(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 Xs(c) {
+function Vs(c) {
   for (var t = [], e = 0; e < c.length; e++) {
     var n = c.charCodeAt(e);
     n < 128 ? t.push(n) : n < 2048 ? t.push(
@@ -10244,56 +10244,56 @@ function Xs(c) {
   return t;
 }
 function Ne(c) {
-  const t = Xs(c);
+  const t = Vs(c);
   return [...Rt(t.length), ...t];
 }
-function Ti(c) {
+function qi(c) {
   const t = [];
   let e = Pe(c);
-  if (ki(e))
+  if (Ti(e))
     throw new Error("Number cannot be negative");
-  for (; !Zs(e); )
+  for (; !Ws(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 qi(c) {
+function Di(c) {
   let t, e;
-  const n = Ws(c);
+  const n = Xs(c);
   c < 0 ? (e = !0, t = (1n << BigInt(n)) + c) : (e = !1, t = Pe(c));
-  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = Ti(t + s);
+  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = qi(t + s);
   return e || (d[d.length - 1] = d[d.length - 1] & g), d;
 }
-function qn(c) {
+function Dn(c) {
   let t = Pe(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 qi(t);
+  return Di(t);
 }
-function Vs(c) {
+function Hs(c) {
   let t = Pe(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 qi(t);
+  return Di(t);
 }
 function Rt(c) {
   let t = Pe(c);
   if (t > 0xFFFFFFFFn)
     throw new Error("Number too big");
-  return Ti(t);
+  return qi(t);
 }
-function ka(c) {
+function Ta(c) {
   return Array.from(c, function(t) {
     return ("0" + (t & 255).toString(16)).slice(-2);
   }).join("");
 }
-class Hs {
+class Qs {
   constructor(t) {
     this.func = t, this.functionName = t.functionName, this.module = t.module;
   }
@@ -10422,10 +10422,10 @@ class Hs {
     return [...t, 26];
   }
   i64_const(t) {
-    return [66, ...Vs(t)];
+    return [66, ...Hs(t)];
   }
   i32_const(t) {
-    return [65, ...qn(t)];
+    return [65, ...Dn(t)];
   }
   i64_eqz(t) {
     return [...t, 80];
@@ -10617,7 +10617,7 @@ const wn = {
   func: 96,
   emptyblock: 64
 };
-class Ta {
+class qa {
   constructor(t, e, n, a, s) {
     if (n == "import")
       this.fnType = "import", this.moduleName = a, this.fieldName = s;
@@ -10673,10 +10673,10 @@ class Ta {
     this.code.push(...[].concat(...t));
   }
   getCodeBuilder() {
-    return new Hs(this);
+    return new Qs(this);
   }
 }
-class Di {
+class Mi {
   constructor() {
     this.functions = [], this.functionIdxByName = {}, this.nImportFunctions = 0, this.nInternalFunctions = 0, this.memory = {
       pagesSize: 1,
@@ -10702,7 +10702,7 @@ class Di {
     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 Ta(this, t, "internal")), this.nInternalFunctions++, this.functions[e];
+    return this.functionIdxByName[t] = e, this.functions.push(new qa(this, t, "internal")), this.nInternalFunctions++, this.functions[e];
   }
   addIimportFunction(t, e, n) {
     if (typeof this.functionIdxByName[t] < "u")
@@ -10711,7 +10711,7 @@ class Di {
       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 Ta(this, t, "import", e, a)), this.nImportFunctions++, this.functions[s];
+    return this.functionIdxByName[t] = s, this.functions.push(new qa(this, t, "import", e, a)), this.nImportFunctions++, this.functions[s];
   }
   setMemory(t, e, n) {
     this.memory = {
@@ -10754,11 +10754,11 @@ class Di {
     this.signatures = [];
     const t = {};
     if (this.functionsTable.length > 0) {
-      const e = this.functions[this.functionsTable[0]].getSignature(), n = "s_" + ka(e);
+      const e = this.functions[this.functionsTable[0]].getSignature(), n = "s_" + Ta(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_" + ka(n);
+      const n = this.functions[e].getSignature(), a = "s_" + Ta(n);
       typeof t[a] > "u" && (t[a] = this.signatures.length, this.signatures.push(n)), this.functions[e].signatureIdx = t[a];
     }
   }
@@ -10834,7 +10834,7 @@ class Di {
         // Table (0 in MVP)
         65,
         // offset 0
-        ...qn(0),
+        ...Dn(0),
         11,
         ...Rt(this.functionsTable.length),
         ...t
@@ -10877,7 +10877,7 @@ class Di {
       t.push([
         0,
         65,
-        ...qn(this.datas[e].offset),
+        ...Dn(this.datas[e].offset),
         11,
         ...Rt(this.datas[e].bytes.length),
         ...this.datas[e].bytes
@@ -10889,9 +10889,9 @@ class Di {
   }
 }
 globalThis.curve_bn128 = null;
-async function Qs(c, t) {
-  const e = new Di();
-  e.setMemory(25), Ss(e), t && t(e);
+async function Js(c, t) {
+  const e = new Mi();
+  e.setMemory(25), Is(e), t && t(e);
   const n = {};
   if (n.code = e.build(), n.pq = e.modules.f1m.pq, n.pr = e.modules.frm.pq, n.pG1gen = e.modules.bn128.pG1gen, n.pG1zero = e.modules.bn128.pG1zero, n.pG1b = e.modules.bn128.pG1b, n.pG2gen = e.modules.bn128.pG2gen, n.pG2zero = e.modules.bn128.pG2zero, n.pG2b = e.modules.bn128.pG2b, n.pOneT = e.modules.bn128.pOneT, n.prePSize = e.modules.bn128.prePSize, n.preQSize = e.modules.bn128.preQSize, n.n8q = 32, n.n8r = 32, n.q = e.modules.bn128.q, n.r = e.modules.bn128.r, !c && globalThis.curve_bn128)
     return globalThis.curve_bn128;
@@ -10904,15 +10904,15 @@ async function Qs(c, t) {
     n8r: 32,
     cofactorG2: ee("30644e72e131a029b85045b68181585e06ceecda572a2489345f2299c0f9fa8d", 16),
     singleThread: !!c
-  }, s = await Pi(a);
+  }, s = await ki(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 Js(c, t) {
-  const e = new Di();
-  e.setMemory(25), Is(e), t && t(e);
+async function Ks(c, t) {
+  const e = new Mi();
+  e.setMemory(25), Os(e), t && t(e);
   const n = {};
   if (n.code = e.build(), n.pq = e.modules.f1m.pq, n.pr = e.modules.frm.pq, n.pG1gen = e.modules.bls12381.pG1gen, n.pG1zero = e.modules.bls12381.pG1zero, n.pG1b = e.modules.bls12381.pG1b, n.pG2gen = e.modules.bls12381.pG2gen, n.pG2zero = e.modules.bls12381.pG2zero, n.pG2b = e.modules.bls12381.pG2b, n.pOneT = e.modules.bls12381.pOneT, n.prePSize = e.modules.bls12381.prePSize, n.preQSize = e.modules.bls12381.preQSize, n.n8q = 48, n.n8r = 32, n.q = e.modules.bls12381.q, n.r = e.modules.bls12381.r, !c && globalThis.curve_bls12381)
     return globalThis.curve_bls12381;
@@ -10926,7 +10926,7 @@ async function Js(c, t) {
     cofactorG1: ee("0x396c8c005555e1568c00aaab0000aaab", 16),
     cofactorG2: ee("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5", 16),
     singleThread: !!c
-  }, s = await Pi(a);
+  }, s = await ki(a);
   return s.terminate = async function() {
     a.singleThread || (globalThis.curve_bls12381 = null, await this.tm.terminate());
   }, c || (globalThis.curve_bls12381 = s), s;
@@ -10935,16 +10935,16 @@ ee("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 ee("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 ee("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 ee("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Yt = xc, ln = qs;
+const Yt = Sc, ln = Ds;
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-const Ks = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), Ys = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-async function Jn(c) {
+const Ys = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), tr = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
+async function Kn(c) {
   let t;
-  if (Yt.eq(c, Ys))
-    t = await Qs();
-  else if (Yt.eq(c, Ks))
+  if (Yt.eq(c, tr))
     t = await Js();
+  else if (Yt.eq(c, Ys))
+    t = await Ks();
   else
     throw new Error(`Curve not supported: ${Yt.toString(c)}`);
   return t;
@@ -10952,7 +10952,7 @@ async function Jn(c) {
 function un(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 tr = 1, er = 2, Mi = 10, nr = 2;
+const er = 1, nr = 2, Ri = 10, ar = 2;
 async function ue(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;
@@ -10961,56 +10961,56 @@ async function Ue(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 ar(c, t, e) {
+async function ir(c, t, e) {
   await Ge(c, t, 1);
   const n = await c.readULE32();
-  if (await Ze(c), n === tr)
-    return await ir(c, t, e);
-  if (n === er)
+  if (await Ze(c), n === er)
     return await or(c, t, e);
-  if (n === Mi)
+  if (n === nr)
     return await cr(c, t, e);
+  if (n === Ri)
+    return await sr(c, t, e);
   throw new Error("Protocol not supported: ");
 }
-async function ir(c, t, e) {
+async function or(c, t, e) {
   const n = {};
   n.protocol = "groth16", await Ge(c, t, 2);
   const a = await c.readULE32();
   n.n8q = a, n.q = await we(c, a);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await we(c, s), n.curve = await Jn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.vk_alpha_1 = await ue(c, n.curve, e), n.vk_beta_1 = await ue(c, n.curve, e), n.vk_beta_2 = await Ue(c, n.curve, e), n.vk_gamma_2 = await Ue(c, n.curve, e), n.vk_delta_1 = await ue(c, n.curve, e), n.vk_delta_2 = await Ue(c, n.curve, e), await Ze(c), n;
+  return n.n8r = s, n.r = await we(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.vk_alpha_1 = await ue(c, n.curve, e), n.vk_beta_1 = await ue(c, n.curve, e), n.vk_beta_2 = await Ue(c, n.curve, e), n.vk_gamma_2 = await Ue(c, n.curve, e), n.vk_delta_1 = await ue(c, n.curve, e), n.vk_delta_2 = await Ue(c, n.curve, e), await Ze(c), n;
 }
-async function or(c, t, e) {
+async function cr(c, t, e) {
   const n = {};
   n.protocol = "plonk", await Ge(c, t, 2);
   const a = await c.readULE32();
   n.n8q = a, n.q = await we(c, a);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await we(c, s), n.curve = await Jn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstrains = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.Qm = await ue(c, n.curve, e), n.Ql = await ue(c, n.curve, e), n.Qr = await ue(c, n.curve, e), n.Qo = await ue(c, n.curve, e), n.Qc = await ue(c, n.curve, e), n.S1 = await ue(c, n.curve, e), n.S2 = await ue(c, n.curve, e), n.S3 = await ue(c, n.curve, e), n.X_2 = await Ue(c, n.curve, e), await Ze(c), n;
+  return n.n8r = s, n.r = await we(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstrains = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.Qm = await ue(c, n.curve, e), n.Ql = await ue(c, n.curve, e), n.Qr = await ue(c, n.curve, e), n.Qo = await ue(c, n.curve, e), n.Qc = await ue(c, n.curve, e), n.S1 = await ue(c, n.curve, e), n.S2 = await ue(c, n.curve, e), n.S3 = await ue(c, n.curve, e), n.X_2 = await Ue(c, n.curve, e), await Ze(c), n;
 }
-async function cr(c, t, e) {
+async function sr(c, t, e) {
   const n = {};
-  n.protocol = "fflonk", n.protocolId = Mi, await Ge(c, t, nr);
+  n.protocol = "fflonk", n.protocolId = Ri, await Ge(c, t, ar);
   const a = await c.readULE32();
-  n.n8q = a, n.q = await we(c, a), n.curve = await Jn(n.q);
+  n.n8q = a, n.q = await we(c, a), n.curve = await Kn(n.q);
   const s = await c.readULE32();
   return n.n8r = s, n.r = await we(c, s), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = un(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstraints = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.w3 = await c.read(s), n.w4 = await c.read(s), n.w8 = await c.read(s), n.wr = await c.read(s), n.X_2 = await Ue(c, n.curve, e), n.C0 = await ue(c, n.curve, e), await Ze(c), n;
 }
-async function sr(c, t, e) {
-  await la(c, 1);
+async function rr(c, t, e) {
+  await ua(c, 1);
   const n = (Math.floor((Yt.bitLength(e) - 1) / 64) + 1) * 8;
-  if (await c.writeULE32(n), await uc(c, e, n), t.byteLength % n != 0)
+  if (await c.writeULE32(n), await dc(c, e, n), t.byteLength % n != 0)
     throw new Error("Invalid witness length");
-  await c.writeULE32(t.byteLength / n), await ua(c), await la(c, 2), await c.write(t), await ua(c);
+  await c.writeULE32(t.byteLength / n), await da(c), await ua(c, 2), await c.write(t), await da(c);
 }
-async function rr(c, t) {
+async function lr(c, t) {
   await Ge(c, t, 1);
   const e = await c.readULE32(), n = await we(c, e), a = await c.readULE32();
   return await Ze(c), { n8: e, q: n, nWitness: a };
 }
-const { stringifyBigInts: qa } = ln;
-async function lr(c, t, e) {
-  const { fd: n, sections: a } = await ra(t, "wtns", 2, 33554432, 8388608), s = await rr(n, a), { fd: g, sections: d } = await ra(c, "zkey", 2, 1 << 25, 1 << 23), C = await ar(g, d);
+const { stringifyBigInts: Da } = ln;
+async function ur(c, t, e) {
+  const { fd: n, sections: a } = await la(t, "wtns", 2, 33554432, 8388608), s = await lr(n, a), { fd: g, sections: d } = await la(c, "zkey", 2, 1 << 25, 1 << 23), C = await ir(g, d);
   if (C.protocol != "groth16")
     throw new Error("zkey file is not groth16");
   if (!Yt.eq(C.r, s.q))
@@ -11023,9 +11023,9 @@ async function lr(c, t, e) {
   e && e.debug("Reading Coeffs");
   const O = await Ae(g, d, 4);
   e && e.debug("Building ABC");
-  const [L, I, v] = await ur(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 dr(l, C, x, O, e), U = m == o.s ? l.Fr.shift : l.Fr.w[m + 1], w = await o.ifft(L, "", "", e, "IFFT_A"), S = await o.batchApplyKey(w, o.e(1), U), F = await o.fft(S, "", "", e, "FFT_A"), r = await o.ifft(I, "", "", e, "IFFT_B"), h = await o.batchApplyKey(r, o.e(1), U), R = await o.fft(h, "", "", e, "FFT_B"), j = await o.ifft(v, "", "", e, "IFFT_C"), T = await o.batchApplyKey(j, o.e(1), U), D = await o.fft(T, "", "", e, "FFT_C");
   e && e.debug("Join ABC");
-  const A = await dr(l, C, F, R, D, e);
+  const A = await fr(l, C, F, R, D, e);
   let M = {};
   e && e.debug("Reading A Points");
   const H = await Ae(g, d, 5);
@@ -11044,9 +11044,9 @@ async function lr(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 = qa(M), K = qa(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 = Da(M), K = Da(K), { proof: M, publicSignals: K };
 }
-async function ur(c, t, e, n, a) {
+async function dr(c, t, e, n, a) {
   const s = c.Fr.n8, g = 4 * 3 + t.n8r, d = (n.byteLength - 4) / g, C = new Vt(t.domainSize * s), l = new Vt(t.domainSize * s), o = new Vt(t.domainSize * s), y = [C, l];
   for (let E = 0; E < d; E++) {
     a && E % 1e6 == 0 && a.debug(`QAP AB: ${E}/${d}`);
@@ -11069,7 +11069,7 @@ async function ur(c, t, e, n, a) {
     );
   return [C, l, o];
 }
-async function dr(c, t, e, n, a, s) {
+async function fr(c, t, e, n, a, s) {
   const d = c.Fr.n8, C = Math.floor(e.byteLength / c.Fr.n8), l = [];
   for (let m = 0; m < C; m += 4194304) {
     s && s.debug(`JoinABC: ${m}/${C}`);
@@ -11094,7 +11094,7 @@ async function dr(c, t, e, n, a, s) {
     y.set(o[m][0], E), E += o[m][0].byteLength;
   return y;
 }
-function Ri(c) {
+function Ni(c) {
   var t = [];
   return e(t, c), t;
   function e(n, a) {
@@ -11105,7 +11105,7 @@ function Ri(c) {
       n.push(a);
   }
 }
-function Ni(c) {
+function zi(c) {
   const t = BigInt(2) ** BigInt(64);
   let e = BigInt("0xCBF29CE484222325");
   for (var n = 0; n < c.length; n++)
@@ -11113,7 +11113,7 @@ function Ni(c) {
   let a = e.toString(16), s = 16 - a.length;
   return a = "0".repeat(s).concat(a), a;
 }
-function fr(c, t) {
+function _r(c, t) {
   const e = [];
   let n = BigInt(c);
   const a = BigInt(4294967296);
@@ -11124,7 +11124,7 @@ function fr(c, t) {
       e.unshift(0), s--;
   return e;
 }
-async function _r(c, t) {
+async function gr(c, t) {
   t = t || {};
   let e = 32767, n, a = !1;
   for (; !a; )
@@ -11191,7 +11191,7 @@ async function _r(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 pr(E, m) : g = new gr(n, E, m), g;
+  return l === 2 ? g = new hr(E, m) : g = new pr(n, E, m), g;
   function x() {
     for (var L = "", I = E.exports.getMessageChar(); I != 0; )
       L += String.fromCharCode(I), I = E.exports.getMessageChar();
@@ -11204,13 +11204,13 @@ async function _r(c, t) {
     return String.fromCharCode.apply(null, v);
   }
 }
-class gr {
+class pr {
   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 Uc(this.prime), this.mask32 = Yt.fromString("FFFFFFFF", 16), this.NVars = this.instance.exports.getNVars(), this.n64 = Math.floor((this.Fr.bitLength - 1) / 64) + 1, this.R = this.Fr.e(Yt.shiftLeft(1, this.n64 * 64)), this.RInv = this.Fr.inv(this.R), this.sanityCheck = n;
+    this.prime = Yt.fromArray(s, 4294967296), this.Fr = new jc(this.prime), this.mask32 = Yt.fromString("FFFFFFFF", 16), this.NVars = this.instance.exports.getNVars(), this.n64 = Math.floor((this.Fr.bitLength - 1) / 64) + 1, this.R = this.Fr.e(Yt.shiftLeft(1, this.n64 * 64)), this.RInv = this.Fr.inv(this.R), this.sanityCheck = n;
   }
   circom_version() {
     return 1;
@@ -11219,13 +11219,13 @@ class gr {
     this.instance.exports.init(this.sanityCheck || e ? 1 : 0);
     const n = this.allocInt(), a = this.allocFr();
     Object.keys(t).forEach((g) => {
-      const d = Ni(g), C = parseInt(d.slice(0, 8), 16), l = parseInt(d.slice(8, 16), 16);
+      const d = zi(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 = Ri(t[g]);
+      const o = this.getInt(n), y = Ni(t[g]);
       for (let E = 0; E < y.length; E++)
         this.setFr(a, y[E]), this.instance.exports.setSignal(0, 0, o + E, a);
     });
@@ -11292,7 +11292,7 @@ class gr {
     }
   }
 }
-class pr {
+class hr {
   constructor(t, e) {
     this.instance = t, this.version = this.instance.exports.getVersion(), this.n32 = this.instance.exports.getFieldNumLen32(), this.instance.exports.getRawPrime();
     const n = new Array(this.n32);
@@ -11308,9 +11308,9 @@ class pr {
     const n = Object.keys(t);
     var a = 0;
     if (n.forEach((s) => {
-      const g = Ni(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = Ri(t[s]);
+      const g = zi(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = Ni(t[s]);
       for (let o = 0; o < l.length; o++) {
-        const y = fr(l[o], this.n32);
+        const y = _r(l[o], this.n32);
         for (let E = 0; E < this.n32; E++)
           this.instance.exports.writeSharedRWMemory(E, y[this.n32 - 1 - E]);
         try {
@@ -11354,35 +11354,35 @@ class pr {
     return a;
   }
 }
-const { unstringifyBigInts: hr } = ln;
-async function Lr(c, t, e, n) {
-  const a = hr(c), s = await ei(t), g = await s.read(s.totalSize);
+const { unstringifyBigInts: Lr } = ln;
+async function mr(c, t, e, n) {
+  const a = Lr(c), s = await ni(t), g = await s.read(s.totalSize);
   await s.close();
-  const d = await _r(g);
+  const d = await gr(g);
   if (d.circom_version() == 1) {
-    const C = await d.calculateBinWitness(a), l = await lc(e, "wtns", 2, 2);
-    await sr(l, C, d.prime), await l.close();
+    const C = await d.calculateBinWitness(a), l = await uc(e, "wtns", 2, 2);
+    await rr(l, C, d.prime), await l.close();
   } else {
-    const C = await ti(e), l = await d.calculateWTNSBin(a);
+    const C = await ei(e), l = await d.calculateWTNSBin(a);
     await C.write(l), await C.close();
   }
 }
-const { unstringifyBigInts: mr } = ln;
-async function br(c, t, e, n) {
-  const a = mr(c), s = {
+const { unstringifyBigInts: br } = ln;
+async function yr(c, t, e, n) {
+  const a = br(c), s = {
     type: "mem"
   };
-  return await Lr(a, t, s), await lr(e, s, n);
+  return await mr(a, t, s), await ur(e, s, n);
 }
-const { unstringifyBigInts: Da } = ln;
+const { unstringifyBigInts: Ma } = ln;
 function pe(c) {
   let t = c.toString(16);
   for (; t.length < 64; )
     t = "0" + t;
   return t = `"0x${t}"`, t;
 }
-async function yr(c, t) {
-  const e = Da(c), n = Da(t);
+async function Cr(c, t) {
+  const e = Ma(c), n = Ma(t);
   let a = "";
   for (let g = 0; g < n.length; g++)
     a != "" && (a = a + ","), a = a + pe(n[g]);
@@ -11391,7 +11391,7 @@ async function yr(c, t) {
 }
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-var Cr = {}, zi = {};
+var Ar = {}, Ui = {};
 (function(c) {
   var t = /[|\\{}()[\]^$+*?.]/g, e = Object.prototype.hasOwnProperty, n = function(l, o) {
     return e.apply(l, [o]);
@@ -11476,19 +11476,19 @@ function encode_char(c) {
       return { __proto__: null };
     };
   }();
-})(zi);
-const Ar = "ejs", Fr = "Embedded JavaScript templates", Er = [
+})(Ui);
+const Fr = "ejs", Er = "Embedded JavaScript templates", wr = [
   "template",
   "engine",
   "ejs"
-], wr = "3.1.9", Br = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", vr = "Apache-2.0", xr = {
+], Br = "3.1.9", vr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", xr = "Apache-2.0", Sr = {
   ejs: "./bin/cli.js"
-}, Sr = "./lib/ejs.js", Ir = "ejs.min.js", Or = "ejs.min.js", Pr = {
+}, Ir = "./lib/ejs.js", Or = "ejs.min.js", Pr = "ejs.min.js", kr = {
   type: "git",
   url: "git://github.com/mde/ejs.git"
-}, kr = "https://github.com/mde/ejs/issues", Tr = "https://github.com/mde/ejs", qr = {
+}, Tr = "https://github.com/mde/ejs/issues", qr = "https://github.com/mde/ejs", Dr = {
   jake: "^10.8.5"
-}, Dr = {
+}, Mr = {
   browserify: "^16.5.1",
   eslint: "^6.8.0",
   "git-directory-deploy": "^1.5.1",
@@ -11496,28 +11496,28 @@ const Ar = "ejs", Fr = "Embedded JavaScript templates", Er = [
   "lru-cache": "^4.0.1",
   mocha: "^10.2.0",
   "uglify-js": "^3.3.16"
-}, Mr = {
-  node: ">=0.10.0"
 }, Rr = {
-  test: "mocha -u tdd"
+  node: ">=0.10.0"
 }, Nr = {
-  name: Ar,
-  description: Fr,
-  keywords: Er,
-  version: wr,
-  author: Br,
-  license: vr,
-  bin: xr,
-  main: Sr,
-  jsdelivr: Ir,
-  unpkg: Or,
-  repository: Pr,
-  bugs: kr,
-  homepage: Tr,
-  dependencies: qr,
-  devDependencies: Dr,
-  engines: Mr,
-  scripts: Rr
+  test: "mocha -u tdd"
+}, zr = {
+  name: Fr,
+  description: Er,
+  keywords: wr,
+  version: Br,
+  author: vr,
+  license: xr,
+  bin: Sr,
+  main: Ir,
+  jsdelivr: Or,
+  unpkg: Pr,
+  repository: kr,
+  bugs: Tr,
+  homepage: qr,
+  dependencies: Dr,
+  devDependencies: Mr,
+  engines: Rr,
+  scripts: Nr
 };
 (function(c) {
   /**
@@ -11527,7 +11527,7 @@ const Ar = "ejs", Fr = "Embedded JavaScript templates", Er = [
    * @project EJS
    * @license {@link http://www.apache.org/licenses/LICENSE-2.0 Apache License, Version 2.0}
    */
-  var t = Bn, e = Bn, n = zi, a = !1, s = Nr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
+  var t = vn, e = vn, n = Ui, a = !1, s = zr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
     "delimiter",
     "scope",
     "context",
@@ -11823,9 +11823,9 @@ try {
 `);
     }
   }, c.escapeXML = n.escapeXML, c.__express = c.renderFile, c.VERSION = s, c.name = o, typeof window < "u" && (window.ejs = c);
-})(Cr);
-var Kn = { exports: {} };
-Kn.exports;
+})(Ar);
+var Yn = { exports: {} };
+Yn.exports;
 (function(c) {
   (function(t) {
     var e, n, a, s, g, d, C, l, o, y, E, m, x, O, L, I, v;
@@ -12265,8 +12265,8 @@ Kn.exports;
       c !== null && c.exports ? c.exports = k : t.check = k;
     }
   })(Ye);
-})(Kn);
-var Yn = Kn.exports, zr = { exports: {} };
+})(Yn);
+var ta = Yn.exports, Ur = { exports: {} };
 (function(c) {
   c.exports = {
     array: "arr",
@@ -12279,28 +12279,28 @@ var Yn = Kn.exports, zr = { 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`;
-})(zr);
-za.EventEmitter;
-const Ur = Nn, Ui = Bn.Readable, Ma = Yn;
-Ur.inherits(an, Ui);
-var ji = an;
+})(Ur);
+Ua.EventEmitter;
+const jr = zn, ji = vn.Readable, Ra = ta;
+jr.inherits(an, ji);
+var $i = an;
 function an(c, t) {
-  return Ma.not.instanceStrict(this, an) ? new an(c) : (Ma.assert.function(c, "Invalid read implementation"), this._read = function() {
+  return Ra.not.instanceStrict(this, an) ? new an(c) : (Ra.assert.function(c, "Invalid read implementation"), this._read = function() {
     c();
-  }, Ui.call(this, t));
+  }, ji.call(this, t));
 }
-const jr = Yn, $i = ji, $r = Nn;
-$r.inherits(Dn, $i);
-function Dn(c, t) {
-  return jr.not.instanceStrict(this, Dn) ? new Dn(c, t) : $i.call(this, c, { ...t, objectMode: !0 });
+const $r = ta, Gi = $i, Gr = zn;
+Gr.inherits(Mn, Gi);
+function Mn(c, t) {
+  return $r.not.instanceStrict(this, Mn) ? new Mn(c, t) : Gi.call(this, c, { ...t, objectMode: !0 });
 }
 class dn extends Array {
   constructor(t) {
     let e, n;
-    if (!Ra(t))
+    if (!Na(t))
       throw new TypeError("Argument `size` must be a positive integer.");
     return super(t), this.grow = (a) => {
-      if (!Ra(a))
+      if (!Na(a))
         throw new TypeError("Argument `by` must be a positive integer.");
       let s;
       const g = t + a;
@@ -12314,25 +12314,25 @@ class dn extends Array {
       t = g;
     }, new Proxy(this, {
       get(a, s) {
-        return Mn(s) ? a[Na(s, t)] : a[s];
+        return Rn(s) ? a[za(s, t)] : a[s];
       },
       set(a, s, g) {
-        return Mn(s) ? (e = Na(s, t), a[e] = g, Math.abs(s) >= t ? n = !0 : n = !1) : a[s] = g, !0;
+        return Rn(s) ? (e = za(s, t), a[e] = g, Math.abs(s) >= t ? n = !0 : n = !1) : a[s] = g, !0;
       }
     });
   }
 }
-function Ra(c) {
-  return Mn(c) && c > 0;
+function Na(c) {
+  return Rn(c) && c > 0;
 }
-function Mn(c) {
+function Rn(c) {
   try {
     return +c % 1 === 0;
   } catch {
   }
   return !1;
 }
-function Na(c, t) {
+function za(c, t) {
   return c === 0 ? 0 : c < 0 ? (t - Math.abs(c)) % t : c % t;
 }
 function fn() {
@@ -12345,7 +12345,7 @@ dn.prototype.unshift = fn;
 function Ke(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 Gr = { exports: {} };
+var Zr = { exports: {} };
 /*! jsonpath 1.1.1 */
 (function(c, t) {
   (function(e) {
@@ -13515,7 +13515,7 @@ var Gr = { exports: {} };
             O && S.octal && Dt(S, y.StrictOctalLiteral), N = w.createLiteral(pt());
           else if (p === g.Keyword) {
             if (Y("function"))
-              return co();
+              return so();
             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());
@@ -13700,65 +13700,65 @@ var Gr = { exports: {} };
           var p, B, N;
           return Wt("if"), vt("("), p = qt(), vt(")"), B = fe(), Y("else") ? (pt(), N = fe()) : N = null, w.createIfStatement(p, B, N);
         }
-        function Wi() {
+        function Xi() {
           var p, B, N;
           return Wt("do"), N = F.inIteration, F.inIteration = !0, p = fe(), F.inIteration = N, Wt("while"), vt("("), B = qt(), vt(")"), wt(";") && pt(), w.createDoWhileStatement(p, B);
         }
-        function Xi() {
+        function Vi() {
           var p, B, N;
           return Wt("while"), vt("("), p = qt(), vt(")"), N = F.inIteration, F.inIteration = !0, B = fe(), F.inIteration = N, w.createWhileStatement(p, B);
         }
-        function Vi() {
+        function Hi() {
           var p, B, N;
           return N = S, p = pt(), B = ye(), w.markEnd(w.createVariableDeclaration(B, p.value), N);
         }
-        function Hi() {
+        function Qi() {
           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 = Vi(), F.allowIn = !0, p.declarations.length === 1 && Y("in") && (pt(), X = p, lt = qt(), p = null)) : (F.allowIn = !1, p = qt(), F.allowIn = !0, Y("in") && (Z(p) || Dt({}, y.InvalidLHSInForIn), pt(), X = p, lt = qt(), p = null)), typeof X > "u" && vt(";")), typeof X > "u" && (wt(";") || (B = qt()), vt(";"), wt(")") || (N = qt())), vt(")"), Gt = F.inIteration, F.inIteration = !0, Ct = fe(), F.inIteration = Gt, typeof X > "u" ? w.createForStatement(p, B, N, Ct) : w.createForInStatement(X, lt, Ct);
+          return p = B = N = null, Wt("for"), vt("("), wt(";") ? pt() : (Y("var") || Y("let") ? (F.allowIn = !1, p = Hi(), F.allowIn = !0, p.declarations.length === 1 && Y("in") && (pt(), X = p, lt = qt(), p = null)) : (F.allowIn = !1, p = qt(), F.allowIn = !0, Y("in") && (Z(p) || Dt({}, y.InvalidLHSInForIn), pt(), X = p, lt = qt(), p = null)), typeof X > "u" && vt(";")), typeof X > "u" && (wt(";") || (B = qt()), vt(";"), wt(")") || (N = qt())), vt(")"), Gt = F.inIteration, F.inIteration = !0, Ct = fe(), F.inIteration = Gt, typeof X > "u" ? w.createForStatement(p, B, N, Ct) : w.createForInStatement(X, lt, Ct);
         }
-        function Qi() {
+        function Ji() {
           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 Ji() {
+        function Ki() {
           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 Ki() {
+        function Yi() {
           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 Yi() {
+        function to() {
           var p, B;
           return O && (G(), Dt({}, y.StrictModeWith)), Wt("with"), vt("("), p = qt(), vt(")"), B = fe(), w.createWithStatement(p, B);
         }
-        function to() {
+        function eo() {
           var p, B = [], N, X;
           for (X = S, Y("default") ? (pt(), p = null) : (Wt("case"), p = qt()), vt(":"); L < U && !(wt("}") || Y("default") || Y("case")); )
             N = fe(), B.push(N);
           return w.markEnd(w.createSwitchCase(p, B), X);
         }
-        function eo() {
+        function no() {
           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 = to(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
+            N = eo(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
           return F.inSwitch = X, vt("}"), w.createSwitchStatement(p, B);
         }
-        function no() {
+        function ao() {
           var p;
           return Wt("throw"), te() && Pt({}, y.NewlineAfterThrow), p = qt(), _(), w.createThrowStatement(p);
         }
-        function ao() {
+        function io() {
           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 io() {
+        function oo() {
           var p, B = [], N = null;
-          return Wt("try"), p = Qt(), Y("catch") && B.push(ao()), 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(io()), Y("finally") && (pt(), N = Qt()), B.length === 0 && !N && Pt({}, y.NoCatchOrFinally), w.createTryStatement(p, [], B, N);
         }
-        function oo() {
+        function co() {
           return Wt("debugger"), _(), w.createDebuggerStatement();
         }
         function fe() {
@@ -13775,33 +13775,33 @@ var Gr = { exports: {} };
           if (p === g.Keyword)
             switch (S.value) {
               case "break":
-                return w.markEnd(Ji(), lt);
+                return w.markEnd(Ki(), lt);
               case "continue":
-                return w.markEnd(Qi(), lt);
+                return w.markEnd(Ji(), lt);
               case "debugger":
-                return w.markEnd(oo(), lt);
+                return w.markEnd(co(), lt);
               case "do":
-                return w.markEnd(Wi(), lt);
+                return w.markEnd(Xi(), lt);
               case "for":
-                return w.markEnd(Hi(), lt);
+                return w.markEnd(Qi(), lt);
               case "function":
-                return w.markEnd(na(), lt);
+                return w.markEnd(aa(), lt);
               case "if":
                 return w.markEnd(He(), lt);
               case "return":
-                return w.markEnd(Ki(), lt);
+                return w.markEnd(Yi(), lt);
               case "switch":
-                return w.markEnd(eo(), lt);
-              case "throw":
                 return w.markEnd(no(), lt);
+              case "throw":
+                return w.markEnd(ao(), lt);
               case "try":
-                return w.markEnd(io(), lt);
+                return w.markEnd(oo(), lt);
               case "var":
                 return w.markEnd(ke(), lt);
               case "while":
-                return w.markEnd(Xi(), lt);
+                return w.markEnd(Vi(), lt);
               case "with":
-                return w.markEnd(Yi(), lt);
+                return w.markEnd(to(), lt);
             }
           return B = qt(), B.type === l.Identifier && wt(":") ? (pt(), X = "$" + B.name, Object.prototype.hasOwnProperty.call(F.labelSet, X) && Pt({}, y.Redeclaration, "Label", B.name), F.labelSet[X] = !0, N = fe(), delete F.labelSet[X], w.markEnd(w.createLabeledStatement(B, N), lt)) : (_(), w.markEnd(w.createExpressionStatement(B), lt));
         }
@@ -13813,7 +13813,7 @@ var Gr = { exports: {} };
             B.push(p);
           return vt("}"), F.labelSet = Ct, F.inIteration = Gt, F.inSwitch = Xt, F.inFunctionBody = ie, w.markEnd(w.createBlockStatement(B), ae);
         }
-        function ea(p) {
+        function na(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(")")); )
@@ -13825,13 +13825,13 @@ var Gr = { exports: {} };
             message: Xt
           };
         }
-        function na() {
+        function aa() {
           var p, B = [], N, X, lt, Ct, Gt, Xt, ie, ae;
-          return ae = S, Wt("function"), X = S, p = Kt(), O ? J(X.value) && Dt(X, y.StrictFunctionName) : J(X.value) ? (Gt = X, Xt = y.StrictFunctionName) : nt(X.value) && (Gt = X, Xt = y.StrictReservedWord), Ct = ea(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), ie = O, N = gn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = ie, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
+          return ae = S, Wt("function"), X = S, p = Kt(), O ? J(X.value) && Dt(X, y.StrictFunctionName) : J(X.value) ? (Gt = X, Xt = y.StrictFunctionName) : nt(X.value) && (Gt = X, Xt = y.StrictReservedWord), Ct = na(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), ie = O, N = gn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = ie, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
         }
-        function co() {
+        function so() {
           var p, B = null, N, X, lt, Ct, Gt = [], Xt, ie, ae;
-          return ae = S, Wt("function"), wt("(") || (p = S, B = Kt(), O ? J(p.value) && Dt(p, y.StrictFunctionName) : J(p.value) ? (X = p, lt = y.StrictFunctionName) : nt(p.value) && (X = p, lt = y.StrictReservedWord)), Ct = ea(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), ie = O, Xt = gn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = ie, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
+          return ae = S, Wt("function"), wt("(") || (p = S, B = Kt(), O ? J(p.value) && Dt(p, y.StrictFunctionName) : J(p.value) ? (X = p, lt = y.StrictFunctionName) : nt(p.value) && (X = p, lt = y.StrictReservedWord)), Ct = na(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), ie = O, Xt = gn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = ie, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
         }
         function Te() {
           if (S.type === g.Keyword)
@@ -13840,25 +13840,25 @@ var Gr = { exports: {} };
               case "let":
                 return _n(S.value);
               case "function":
-                return na();
+                return aa();
               default:
                 return fe();
             }
           if (S.type !== g.EOF)
             return fe();
         }
-        function so() {
+        function ro() {
           for (var p, B = [], N, X, lt; L < U && (N = S, !(N.type !== g.StringLiteral || (p = Te(), B.push(p), p.expression.type !== l.Literal))); )
             X = x.slice(N.start + 1, N.end - 1), X === "use strict" ? (O = !0, lt && Dt(lt, y.StrictOctalLiteral)) : !lt && N.octal && (lt = N);
           for (; L < U && (p = Te(), !(typeof p > "u")); )
             B.push(p);
           return B;
         }
-        function ro() {
+        function lo() {
           var p, B;
-          return G(), $t(), B = S, O = !1, p = so(), w.markEnd(w.createProgram(p), B);
+          return G(), $t(), B = S, O = !1, p = ro(), w.markEnd(w.createProgram(p), B);
         }
-        function aa() {
+        function ia() {
           var p, B, N, X = [];
           for (p = 0; p < r.tokens.length; ++p)
             B = r.tokens[p], N = {
@@ -13867,7 +13867,7 @@ var Gr = { exports: {} };
             }, r.range && (N.range = B.range), r.loc && (N.loc = B.loc), X.push(N);
           r.tokens = X;
         }
-        function lo(p, B) {
+        function uo(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,
@@ -13890,7 +13890,7 @@ var Gr = { exports: {} };
                 } else
                   throw Ct;
               }
-            aa(), lt = r.tokens, typeof r.comments < "u" && (lt.comments = r.comments), typeof r.errors < "u" && (lt.errors = r.errors);
+            ia(), lt = r.tokens, typeof r.comments < "u" && (lt.comments = r.comments), typeof r.errors < "u" && (lt.errors = r.errors);
           } catch (Ct) {
             throw Ct;
           } finally {
@@ -13898,7 +13898,7 @@ var Gr = { exports: {} };
           }
           return lt;
         }
-        function uo(p, B) {
+        function fo(p, B) {
           var N, X;
           X = String, typeof p != "string" && !(p instanceof String) && (p = X(p)), w = m, x = p, L = 0, I = x.length > 0 ? 1 : 0, v = 0, U = x.length, S = null, F = {
             allowIn: !0,
@@ -13909,7 +13909,7 @@ var Gr = { 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 = ro(), typeof r.comments < "u" && (N.comments = r.comments), typeof r.tokens < "u" && (aa(), N.tokens = r.tokens), typeof r.errors < "u" && (N.errors = r.errors);
+            N = lo(), typeof r.comments < "u" && (N.comments = r.comments), typeof r.tokens < "u" && (ia(), N.tokens = r.tokens), typeof r.errors < "u" && (N.errors = r.errors);
           } catch (lt) {
             throw lt;
           } finally {
@@ -13917,7 +13917,7 @@ var Gr = { exports: {} };
           }
           return N;
         }
-        s.version = "1.2.2", s.tokenize = lo, s.parse = uo, s.Syntax = function() {
+        s.version = "1.2.2", s.tokenize = uo, s.parse = fo, s.Syntax = function() {
           var p, B = {};
           typeof Object.create == "function" && (B = /* @__PURE__ */ Object.create(null));
           for (p in l)
@@ -15513,15 +15513,15 @@ Expecting ` + ft.join(", ") + ", got '" + (this.terminals_[T] || T) + "'" : at =
       n.exports = e("./lib/index");
     }, { "./lib/index": 5 }] }, {}, ["jsonpath"])("jsonpath");
   });
-})(Gr);
-za.EventEmitter;
-const Zr = Yn, Gi = ji, Wr = Nn;
-Wr.inherits(Rn, Gi);
-function Rn(c, t) {
-  return Zr.not.instanceStrict(this, Rn) ? new Rn(c, t) : Gi.call(this, c, { ...t, encoding: "utf8" });
-}
-var ta = { exports: {} };
-ta.exports;
+})(Zr);
+Ua.EventEmitter;
+const Wr = ta, Zi = $i, Xr = zn;
+Xr.inherits(Nn, Zi);
+function Nn(c, t) {
+  return Wr.not.instanceStrict(this, Nn) ? new Nn(c, t) : Zi.call(this, c, { ...t, encoding: "utf8" });
+}
+var ea = { exports: {} };
+ea.exports;
 (function(c) {
   (function(t) {
     c !== null ? c.exports = e : t.tryer = e;
@@ -15598,30 +15598,35 @@ ta.exports;
       setTimeout(I, Math.abs(v));
     }
   })(Ye);
-})(ta);
-ta.exports;
-typeof process < "u" && process.versions != null && process.versions.node != null;
-const Xr = (
+})(ea);
+ea.exports;
+const Vr = typeof process < "u" && process.versions != null && process.versions.node != null, Bn = (
   // @ts-expect-error webpack check is done like this
   typeof __webpack_require__ < "u"
-), Zi = new fo(), Vr = async (c) => {
-  console.log("1");
-  const { input: t, wasmFilePath: e, zKeyFilePath: n, chainId: a } = c.payload.data;
-  console.log("2", { input: t, wasmFilePath: e, zKeyFilePath: n }), c.metadata, console.log("3");
-  let s = e;
-  console.log("4");
-  let g = n;
-  console.log({ isWebpack: Xr }), console.log({ wasmFilePath: e }), console.log("5"), console.log("6"), console.log({ wasmFullFilePath: s });
+), Wi = new _o(), Hr = async (c) => {
+  const { input: t, wasmFilePath: e, zKeyFilePath: n, chainId: a } = c.payload.data, {
+    hostLocation: { origin: s },
+    constants: {
+      isDevelopment: g,
+      chains: { chainIds: d }
+    }
+  } = c.metadata;
+  let C = e, l = n;
+  if (console.log({ isWebpack: Bn }), Vr) {
+    g && !Bn ? (C = `test/circuits/${e}`, l = `test/circuits/${n}`) : Bn && (C = `libs/hardhat/test/circuits/${e}`, l = `libs/hardhat/test/circuits/${n}`);
+    const o = require("path");
+    C = o.resolve(C), l = o.resolve(l);
+  } else
+    a === d.localhost && (C = `${s}/${e}`, l = `${s}/${n}`);
   try {
-    console.log("7");
-    const { proof: d, publicSignals: C } = await br(t, s, g), l = await yr(d, C), o = JSON.parse(`[${l}]`);
-    Zi.postMessageToMainThread({ zkCallData: o, proof: d, publicSignals: C });
-  } catch (d) {
-    console.log(d);
+    const { proof: o, publicSignals: y } = await yr(t, C, l), E = await Cr(o, y), m = JSON.parse(`[${E}]`);
+    Wi.postMessageToMainThread({ zkCallData: m, proof: o, publicSignals: y });
+  } catch (o) {
+    console.log(o);
   }
 };
-Zi.attachWorkerSideOnMessage(Vr);
+Wi.attachWorkerSideOnMessage(Hr);
 export {
-  Zi as default,
-  Vr as onWorkerMessage
+  Wi as default,
+  Hr as onWorkerMessage
 };