@hinkal/common 0.0.72 → 0.0.74

package/assets/{snarkjsWorkerLogic-xEosgVqd.js → snarkjsWorkerLogic-DBACYRYM.js}

@@ -1,6 +1,6 @@
-import { p as Se, B as Lo } from "./zkProofWorkerLauncher--xKCZpsZ.js";
-import { r as sn, g as ja, a as mo, b as bo, c as en, e as $a, d as Ga, u as Un, f as yo } from "./zkProofWorkerLogic-BR49pUpc.js";
-const Co = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+import { p as Se, B as ho } from "./zkProofWorkerLauncher-BFtv6oo6.js";
+import { r as sn, g as Ua, a as Lo, b as mo, c as en, d as ja, e as $a, u as zn, f as bo } from "./zkProofWorkerLogic-CAu7zHKp.js";
+const yo = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
 function rn(c, t) {
   if (!t || t == 10)
     return BigInt(c);
@@ -8,34 +8,34 @@ function rn(c, t) {
     return c.slice(0, 2) == "0x" ? BigInt(c) : BigInt("0x" + c);
 }
 const ve = rn;
-function Ao(c, t) {
+function Co(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 Za(c) {
+function Ga(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + Co[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + yo[parseInt(t[0], 16)];
 }
-function Fo(c) {
+function Ao(c) {
   return BigInt(c) < BigInt(0);
 }
-function Eo(c) {
+function Fo(c) {
   return !c;
 }
-function Wa(c, t) {
+function Za(c, t) {
   return BigInt(c) << BigInt(t);
 }
-function jn(c, t) {
+function Un(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const wo = Wa, Bo = jn;
-function vo(c) {
+const Eo = Za, wo = Un;
+function Bo(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function xo(c) {
+function vo(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -48,177 +48,177 @@ function xo(c) {
   }
   return e;
 }
-function So(c) {
+function xo(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 Xa(c) {
+function Wa(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function Io(c, t) {
+function So(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
     e.unshift(Number(n % t)), n = n / t;
   return e;
 }
-function Oo(c, t) {
+function Io(c, t) {
   return BigInt(c) + BigInt(t);
 }
-function Po(c, t) {
+function Oo(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function ko(c) {
+function Po(c) {
   return -BigInt(c);
 }
-function To(c, t) {
+function ko(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function qo(c) {
+function To(c) {
   return BigInt(c) * BigInt(c);
 }
-function Do(c, t) {
+function qo(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function Mo(c, t) {
+function Do(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function Ro(c) {
+function Mo(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
-function No(c, t) {
+function Ro(c, t) {
   return BigInt(c) / BigInt(t);
 }
-function zo(c, t) {
+function No(c, t) {
   return BigInt(c) % BigInt(t);
 }
-function Uo(c, t) {
+function zo(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function jo(c, t) {
+function Uo(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function $o(c, t) {
+function jo(c, t) {
   return BigInt(c) < BigInt(t);
 }
-function Go(c, t) {
+function $o(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Zo(c, t) {
+function Go(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function Wo(c, t) {
+function Zo(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function Va(c, t) {
+function Xa(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function Xo(c, t) {
+function Wo(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function Vo(c, t) {
+function Xo(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function Ho(c, t) {
+function Vo(c, t) {
   return BigInt(c) && BigInt(t);
 }
-function Qo(c, t) {
+function Ho(c, t) {
   return BigInt(c) || BigInt(t);
 }
-function Jo(c) {
+function Qo(c) {
   return !BigInt(c);
 }
-function Ha(c, t, e, n) {
+function Va(c, t, e, n) {
   const a = "0000000" + e.toString(16), s = new Uint32Array(c.buffer, c.byteOffset + t, n / 4), g = ((a.length - 7) * 4 - 1 >> 5) + 1;
   for (let d = 0; d < g; d++)
     s[d] = parseInt(a.substring(a.length - 8 * d - 8, a.length - 8 * d), 16);
   for (let d = g; d < s.length; d++)
     s[d] = 0;
   for (let d = s.length * 4; d < n; d++)
-    c[d] = Xa(Va(jn(e, d * 8), 255));
+    c[d] = Wa(Xa(Un(e, d * 8), 255));
 }
-function Ko(c, t, e, n) {
+function Jo(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 Yo(c, t, e) {
+function Ko(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")), rn(a.join(""), 16);
 }
-function tc(c, t, e) {
+function Yo(c, t, e) {
   e = e || c.byteLength, t = t || 0;
   const n = new DataView(c.buffer, c.byteOffset + t, e), a = new Array(e / 4);
   for (let s = 0; s < e / 4; s++)
     a[s] = n.getUint32(s * 4, !1).toString(16).padStart(8, "0");
   return rn(a.join(""), 16);
 }
-function ec(c, t) {
+function tc(c, t) {
   return c.toString(t);
 }
-function nc(c) {
-  const t = new Uint8Array(Math.floor((Za(c) - 1) / 8) + 1);
-  return Ha(t, 0, c, t.byteLength), t;
+function ec(c) {
+  const t = new Uint8Array(Math.floor((Ga(c) - 1) / 8) + 1);
+  return Va(t, 0, c, t.byteLength), t;
 }
-const ac = ve(0), ic = ve(1);
-var oc = /* @__PURE__ */ Object.freeze({
+const nc = ve(0), ac = ve(1);
+var ic = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  abs: Ro,
-  add: Oo,
-  band: Va,
-  bitLength: Za,
-  bits: So,
-  bor: Xo,
-  bxor: Vo,
-  div: No,
+  abs: Mo,
+  add: Io,
+  band: Xa,
+  bitLength: Ga,
+  bits: xo,
+  bor: Wo,
+  bxor: Xo,
+  div: Ro,
   e: ve,
-  eq: Uo,
-  exp: Mo,
-  fromArray: Ao,
-  fromRprBE: tc,
-  fromRprLE: Yo,
+  eq: zo,
+  exp: Do,
+  fromArray: Co,
+  fromRprBE: Yo,
+  fromRprLE: Ko,
   fromString: rn,
-  geq: Wo,
-  gt: Go,
-  isNegative: Fo,
-  isOdd: vo,
-  isZero: Eo,
-  land: Ho,
-  leq: Zo,
-  lnot: Jo,
-  lor: Qo,
-  lt: $o,
-  mod: zo,
-  mul: To,
-  naf: xo,
-  neg: ko,
-  neq: jo,
-  one: ic,
-  pow: Do,
-  shiftLeft: Wa,
-  shiftRight: jn,
-  shl: wo,
-  shr: Bo,
-  square: qo,
-  sub: Po,
-  toArray: Io,
-  toLEBuff: nc,
-  toNumber: Xa,
-  toRprBE: Ko,
-  toRprLE: Ha,
-  toString: ec,
-  zero: ac
+  geq: Zo,
+  gt: $o,
+  isNegative: Ao,
+  isOdd: Bo,
+  isZero: Fo,
+  land: Vo,
+  leq: Go,
+  lnot: Qo,
+  lor: Ho,
+  lt: jo,
+  mod: No,
+  mul: ko,
+  naf: vo,
+  neg: Po,
+  neq: Uo,
+  one: ac,
+  pow: qo,
+  shiftLeft: Za,
+  shiftRight: Un,
+  shl: Eo,
+  shr: wo,
+  square: To,
+  sub: Oo,
+  toArray: So,
+  toLEBuff: ec,
+  toNumber: Wa,
+  toRprBE: Jo,
+  toRprLE: Va,
+  toString: tc,
+  zero: nc
 });
 const ce = 1 << 30;
-let cc = class Sn {
+let oc = class xn {
   constructor(t) {
     this.buffers = [], this.byteLength = t;
     for (let e = 0; e < t; e += ce) {
@@ -236,7 +236,7 @@ let cc = class Sn {
       const o = C + l > ce ? ce - C : l, y = new Uint8Array(this.buffers[d].buffer, this.buffers[d].byteOffset + C, o);
       if (o == n)
         return y.slice();
-      g || (n <= ce ? g = new Uint8Array(n) : g = new Sn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
+      g || (n <= ce ? g = new Uint8Array(n) : g = new xn(n)), g.set(y, n - l), l = l - o, d++, C = 0;
     }
     return g;
   }
@@ -247,7 +247,7 @@ let cc = class Sn {
       return;
     const a = Math.floor(e / ce), s = Math.floor((e + n - 1) / ce);
     if (a == s)
-      return t instanceof Sn && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % ce) : this.buffers[a].set(t, e % ce);
+      return t instanceof xn && t.buffers.length == 1 ? this.buffers[a].set(t.buffers[0], e % ce) : this.buffers[a].set(t, e % ce);
     let g = a, d = e % ce, C = n;
     for (; C > 0; ) {
       const l = d + C > ce ? ce - d : C, o = t.slice(n - C, n - C + l);
@@ -255,10 +255,10 @@ let cc = class Sn {
     }
   }
 };
-function sc(c) {
+function cc(c) {
   return globalThis.btoa(c);
 }
-sc(`(function thread(self) {
+cc(`(function thread(self) {
     const MAXMEM = 32767;
     let instance;
     let memory;
@@ -384,15 +384,15 @@ ve("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 ve("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 ve("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 ve("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Qa = oc;
-var rc = sn(), Ja = /* @__PURE__ */ ja(rc);
-async function Ka(c, t, e, n) {
+const Ha = ic;
+var sc = sn(), Qa = /* @__PURE__ */ Ua(sc);
+async function Ja(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 Ja.promises.open(c, t), s = await a.stat();
-  return new lc(a, s, e, n, c);
+  const a = await Qa.promises.open(c, t), s = await a.stat();
+  return new rc(a, s, e, n, c);
 }
-class lc {
+class rc {
   constructor(t, e, n, a, s) {
     for (this.fileName = s, this.fd = t, this.pos = 0, this.pageSize = a || 256; this.pageSize < e.blksize; )
       this.pageSize *= 2;
@@ -565,7 +565,7 @@ class lc {
     });
   }
   async discard() {
-    await this.close(), await Ja.promises.unlink(this.fileName);
+    await this.close(), await Qa.promises.unlink(this.fileName);
   }
   async writeULE32(t, e) {
     const n = this, a = new Uint8Array(4);
@@ -611,16 +611,16 @@ class lc {
     return g;
   }
 }
-function uc(c) {
-  const t = c.initialSize || 1048576, e = new ti();
+function lc(c) {
+  const t = c.initialSize || 1048576, e = new Ya();
   return e.o = c, e.o.data = new Uint8Array(t), e.allocSize = t, e.totalSize = 0, e.readOnly = !1, e.pos = 0, e;
 }
-function dc(c) {
-  const t = new ti();
+function uc(c) {
+  const t = new Ya();
   return t.o = c, t.allocSize = c.data.byteLength, t.totalSize = c.data.byteLength, t.readOnly = !0, t.pos = 0, t;
 }
-const In = new Uint8Array(4), ca = new DataView(In.buffer), Ya = new Uint8Array(8), sa = new DataView(Ya.buffer);
-class ti {
+const Sn = new Uint8Array(4), oa = new DataView(Sn.buffer), Ka = new Uint8Array(8), ca = new DataView(Ka.buffer);
+class Ya {
   constructor() {
     this.pageSize = 16384;
   }
@@ -657,15 +657,15 @@ class ti {
   }
   async writeULE32(t, e) {
     const n = this;
-    ca.setUint32(0, t, !0), await n.write(In, e);
+    oa.setUint32(0, t, !0), await n.write(Sn, e);
   }
   async writeUBE32(t, e) {
     const n = this;
-    ca.setUint32(0, t, !1), await n.write(In, e);
+    oa.setUint32(0, t, !1), await n.write(Sn, 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(Ya, e);
+    ca.setUint32(0, t & 4294967295, !0), ca.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(Ka, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -697,8 +697,8 @@ class ti {
   }
 }
 const ne = 1 << 22;
-function fc(c) {
-  const t = c.initialSize || 0, e = new ni();
+function dc(c) {
+  const t = c.initialSize || 0, e = new ei();
   e.o = c;
   const n = t ? Math.floor((t - 1) / ne) + 1 : 0;
   e.o.data = [];
@@ -706,12 +706,12 @@ function fc(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 _c(c) {
-  const t = new ni();
+function fc(c) {
+  const t = new ei();
   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 On = new Uint8Array(4), ra = new DataView(On.buffer), ei = new Uint8Array(8), la = new DataView(ei.buffer);
-class ni {
+const In = new Uint8Array(4), sa = new DataView(In.buffer), ti = new Uint8Array(8), ra = new DataView(ti.buffer);
+class ei {
   constructor() {
     this.pageSize = 16384;
   }
@@ -761,15 +761,15 @@ class ni {
   }
   async writeULE32(t, e) {
     const n = this;
-    ra.setUint32(0, t, !0), await n.write(On, e);
+    sa.setUint32(0, t, !0), await n.write(In, e);
   }
   async writeUBE32(t, e) {
     const n = this;
-    ra.setUint32(0, t, !1), await n.write(On, e);
+    sa.setUint32(0, t, !1), await n.write(In, e);
   }
   async writeULE64(t, e) {
     const n = this;
-    la.setUint32(0, t & 4294967295, !0), la.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(ei, e);
+    ra.setUint32(0, t & 4294967295, !0), ra.setUint32(4, Math.floor(t / 4294967296), !0), await n.write(ti, e);
   }
   async readULE32(t) {
     const n = await this.read(4, t);
@@ -804,22 +804,22 @@ class ni {
     return g;
   }
 }
-const gc = 0, pc = 2, hc = 512, Lc = 1024, ai = 65536, ii = 8192;
-async function oi(c, t, e) {
+const _c = 0, gc = 2, pc = 512, hc = 1024, ni = 65536, ai = 8192;
+async function ii(c, t, e) {
   if (typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || ai,
-    pageSize: e || ii
+    cacheSize: t || ni,
+    pageSize: e || ai
   }), c.type == "file")
-    return await Ka(c.fileName, Lc | hc | pc, c.cacheSize, c.pageSize);
+    return await Ja(c.fileName, hc | pc | gc, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return uc(c);
+    return lc(c);
   if (c.type == "bigMem")
-    return fc(c);
+    return dc(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function ci(c, t, e) {
+async function oi(c, t, e) {
   if (c instanceof Uint8Array && (c = {
     type: "mem",
     data: c
@@ -833,18 +833,18 @@ async function ci(c, t, e) {
   }) : typeof c == "string" && (c = {
     type: "file",
     fileName: c,
-    cacheSize: t || ai,
-    pageSize: e || ii
+    cacheSize: t || ni,
+    pageSize: e || ai
   }), c.type == "file")
-    return await Ka(c.fileName, gc, c.cacheSize, c.pageSize);
+    return await Ja(c.fileName, _c, c.cacheSize, c.pageSize);
   if (c.type == "mem")
-    return await dc(c);
+    return await uc(c);
   if (c.type == "bigMem")
-    return await _c(c);
+    return await fc(c);
   throw new Error("Invalid FastFile type: " + c.type);
 }
-async function ua(c, t, e, n, a) {
-  const s = await ci(c, n, a), g = await s.read(4);
+async function la(c, t, e, n, a) {
+  const s = await oi(c, n, a), g = await s.read(4);
   let d = "";
   for (let y = 0; y < 4; y++)
     d += String.fromCharCode(g[y]);
@@ -863,20 +863,20 @@ async function ua(c, t, e, n, a) {
   }
   return { fd: s, sections: o };
 }
-async function mc(c, t, e, n, a, s) {
-  const g = await oi(c, a, s), d = new Uint8Array(4);
+async function Lc(c, t, e, n, a, s) {
+  const g = await ii(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 da(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 fa(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;
@@ -898,21 +898,21 @@ async function Xe(c, t) {
     throw new Error("Invalid section size reading");
   delete c.readingSection;
 }
-async function bc(c, t, e, n) {
+async function mc(c, t, e, n) {
   const a = new Uint8Array(e);
-  Qa.toRprLE(a, 0, t, e), await c.write(a, n);
+  Ha.toRprLE(a, 0, t, e), await c.write(a, n);
 }
 async function Be(c, t, e) {
   const n = await c.read(t, e);
-  return Qa.fromRprLE(n, 0, t);
+  return Ha.fromRprLE(n, 0, t);
 }
 async function Fe(c, t, e, n, a) {
   if (n = typeof n > "u" ? 0 : n, a = typeof a > "u" ? t[e][0].size - n : a, n + a > t[e][0].size)
     throw new Error("Reading out of the range of the section");
   let s;
-  return a < 1 << 30 ? s = new Uint8Array(a) : s = new cc(a), await c.readToBuffer(s, 0, a, t[e][0].p + n), s;
+  return a < 1 << 30 ? s = new Uint8Array(a) : s = new oc(a), await c.readToBuffer(s, 0, a, t[e][0].p + n), s;
 }
-const yc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
+const bc = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4];
 function ln(c, t) {
   if (!t || t == 10)
     return BigInt(c);
@@ -920,7 +920,7 @@ function ln(c, t) {
     return c.slice(0, 2) == "0x" ? BigInt(c) : BigInt("0x" + c);
 }
 const ee = ln;
-function Cc(c, t) {
+function yc(c, t) {
   let e = BigInt(0);
   t = BigInt(t);
   for (let n = 0; n < c.length; n++)
@@ -929,12 +929,12 @@ function Cc(c, t) {
 }
 function Ve(c) {
   const t = c.toString(16);
-  return (t.length - 1) * 4 + yc[parseInt(t[0], 16)];
+  return (t.length - 1) * 4 + bc[parseInt(t[0], 16)];
 }
-function si(c) {
+function ci(c) {
   return BigInt(c) < BigInt(0);
 }
-function ri(c) {
+function si(c) {
   return !c;
 }
 function nn(c, t) {
@@ -943,11 +943,11 @@ function nn(c, t) {
 function Ie(c, t) {
   return BigInt(c) >> BigInt(t);
 }
-const Ac = nn, Fc = Ie;
-function $n(c) {
+const Cc = nn, Ac = Ie;
+function jn(c) {
   return (BigInt(c) & BigInt(1)) == BigInt(1);
 }
-function Ec(c) {
+function Fc(c) {
   let t = BigInt(c);
   const e = [];
   for (; t; ) {
@@ -960,47 +960,47 @@ function Ec(c) {
   }
   return e;
 }
-function li(c) {
+function ri(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 ui(c) {
+function li(c) {
   if (c > BigInt(Number.MAX_SAFE_INTEGER))
     throw new Error("Number too big");
   return Number(c);
 }
-function wc(c, t) {
+function Ec(c, t) {
   const e = [];
   let n = BigInt(c);
   for (t = BigInt(t); n; )
     e.unshift(Number(n % t)), n = n / t;
   return e;
 }
-function Gn(c, t) {
+function $n(c, t) {
   return BigInt(c) + BigInt(t);
 }
 function Le(c, t) {
   return BigInt(c) - BigInt(t);
 }
-function di(c) {
+function ui(c) {
   return -BigInt(c);
 }
-function fi(c, t) {
+function di(c, t) {
   return BigInt(c) * BigInt(t);
 }
-function Bc(c) {
+function wc(c) {
   return BigInt(c) * BigInt(c);
 }
 function He(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function vc(c, t) {
+function Bc(c, t) {
   return BigInt(c) ** BigInt(t);
 }
-function xc(c) {
+function vc(c) {
   return BigInt(c) >= 0 ? BigInt(c) : -BigInt(c);
 }
 function Oe(c, t) {
@@ -1012,37 +1012,37 @@ function ge(c, t) {
 function Ee(c, t) {
   return BigInt(c) == BigInt(t);
 }
-function Sc(c, t) {
+function xc(c, t) {
   return BigInt(c) != BigInt(t);
 }
-function Ic(c, t) {
+function Sc(c, t) {
   return BigInt(c) < BigInt(t);
 }
-function Pn(c, t) {
+function On(c, t) {
   return BigInt(c) > BigInt(t);
 }
-function Oc(c, t) {
+function Ic(c, t) {
   return BigInt(c) <= BigInt(t);
 }
-function _i(c, t) {
+function fi(c, t) {
   return BigInt(c) >= BigInt(t);
 }
-function Zn(c, t) {
+function Gn(c, t) {
   return BigInt(c) & BigInt(t);
 }
-function Pc(c, t) {
+function Oc(c, t) {
   return BigInt(c) | BigInt(t);
 }
-function kc(c, t) {
+function Pc(c, t) {
   return BigInt(c) ^ BigInt(t);
 }
-function Tc(c, t) {
+function kc(c, t) {
   return BigInt(c) && BigInt(t);
 }
-function qc(c, t) {
+function Tc(c, t) {
   return BigInt(c) || BigInt(t);
 }
-function Dc(c) {
+function qc(c) {
   return !BigInt(c);
 }
 function Ge(c, t, e, n) {
@@ -1052,9 +1052,9 @@ function Ge(c, t, e, n) {
   for (let d = g; d < s.length; d++)
     s[d] = 0;
   for (let d = s.length * 4; d < n; d++)
-    c[d] = ui(Zn(Ie(e, d * 8), 255));
+    c[d] = li(Gn(Ie(e, d * 8), 255));
 }
-function gi(c, t, e, n) {
+function _i(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);
@@ -1066,73 +1066,73 @@ function Ze(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")), ln(a.join(""), 16);
 }
-function pi(c, t, e) {
+function gi(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 ln(a.join(""), 16);
 }
-function hi(c, t) {
+function pi(c, t) {
   return c.toString(t);
 }
 function Pe(c) {
   const t = new Uint8Array(Math.floor((Ve(c) - 1) / 8) + 1);
   return Ge(t, 0, c, t.byteLength), t;
 }
-const Li = ee(0), we = ee(1);
-var Mc = /* @__PURE__ */ Object.freeze({
+const hi = ee(0), we = ee(1);
+var Dc = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  abs: xc,
-  add: Gn,
-  band: Zn,
+  abs: vc,
+  add: $n,
+  band: Gn,
   bitLength: Ve,
-  bits: li,
-  bor: Pc,
-  bxor: kc,
+  bits: ri,
+  bor: Oc,
+  bxor: Pc,
   div: Oe,
   e: ee,
   eq: Ee,
-  exp: vc,
-  fromArray: Cc,
-  fromRprBE: pi,
+  exp: Bc,
+  fromArray: yc,
+  fromRprBE: gi,
   fromRprLE: Ze,
   fromString: ln,
-  geq: _i,
-  gt: Pn,
-  isNegative: si,
-  isOdd: $n,
-  isZero: ri,
-  land: Tc,
-  leq: Oc,
-  lnot: Dc,
-  lor: qc,
-  lt: Ic,
+  geq: fi,
+  gt: On,
+  isNegative: ci,
+  isOdd: jn,
+  isZero: si,
+  land: kc,
+  leq: Ic,
+  lnot: qc,
+  lor: Tc,
+  lt: Sc,
   mod: ge,
-  mul: fi,
-  naf: Ec,
-  neg: di,
-  neq: Sc,
+  mul: di,
+  naf: Fc,
+  neg: ui,
+  neq: xc,
   one: we,
   pow: He,
   shiftLeft: nn,
   shiftRight: Ie,
-  shl: Ac,
-  shr: Fc,
-  square: Bc,
+  shl: Cc,
+  shr: Ac,
+  square: wc,
   sub: Le,
-  toArray: wc,
+  toArray: Ec,
   toLEBuff: Pe,
-  toNumber: ui,
-  toRprBE: gi,
+  toNumber: li,
+  toRprBE: _i,
   toRprLE: Ge,
-  toString: hi,
-  zero: Li
+  toString: pi,
+  zero: hi
 });
-function _a(c, t, e) {
-  if (ri(e))
+function fa(c, t, e) {
+  if (si(e))
     return c.one;
-  const n = li(e);
+  const n = ri(e);
   if (n.length == 0)
     return c.one;
   let a = t;
@@ -1140,29 +1140,29 @@ function _a(c, t, e) {
     a = c.square(a), n[s] && (a = c.mul(a, t));
   return a;
 }
-function Rc(c) {
+function Mc(c) {
   if (c.m % 2 == 1)
     if (Ee(ge(c.p, 4), 1))
       if (Ee(ge(c.p, 8), 1))
         if (Ee(ge(c.p, 16), 1))
-          Nc(c);
+          Rc(c);
         else if (Ee(ge(c.p, 16), 9))
-          zc(c);
+          Nc(c);
         else
           throw new Error("Field withot sqrt");
       else if (Ee(ge(c.p, 8), 5))
-        Uc(c);
+        zc(c);
       else
         throw new Error("Field withot sqrt");
     else
-      Ee(ge(c.p, 4), 3) && jc(c);
+      Ee(ge(c.p, 4), 3) && Uc(c);
   else {
     const t = ge(He(c.p, c.m / 2), 4);
-    t == 1 ? $c(c) : t == 3 ? Gc(c) : Zc(c);
+    t == 1 ? jc(c) : t == 3 ? $c(c) : Gc(c);
   }
 }
-function Nc(c) {
-  for (c.sqrt_q = He(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = Le(c.sqrt_q, 1); !$n(c.sqrt_t); )
+function Rc(c) {
+  for (c.sqrt_q = He(c.p, c.m), c.sqrt_s = 0, c.sqrt_t = Le(c.sqrt_q, 1); !jn(c.sqrt_t); )
     c.sqrt_s = c.sqrt_s + 1, c.sqrt_t = Oe(c.sqrt_t, 2);
   let t = c.one;
   for (; c.eq(t, c.one); ) {
@@ -1190,17 +1190,17 @@ function Nc(c) {
     return n.geq(d, n.zero) ? d : n.neg(d);
   };
 }
-function zc(c) {
+function Nc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 4 not implemented");
   };
 }
-function Uc(c) {
+function zc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 3 not implemented");
   };
 }
-function jc(c) {
+function Uc(c) {
   c.sqrt_q = He(c.p, c.m), c.sqrt_e1 = Oe(Le(c.sqrt_q, 3), 4), c.sqrt = function(t) {
     if (this.isZero(t))
       return this.zero;
@@ -1211,12 +1211,12 @@ function jc(c) {
     return c.geq(a, c.zero) ? a : c.neg(a);
   };
 }
-function $c(c) {
+function jc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 10 not implemented");
   };
 }
-function Gc(c) {
+function $c(c) {
   c.sqrt_q = He(c.p, c.m / 2), c.sqrt_e34 = Oe(Le(c.sqrt_q, 3), 4), c.sqrt_e12 = Oe(Le(c.sqrt_q, 1), 2), c.frobenius = function(t, e) {
     return t % 2 == 1 ? c.conjugate(e) : e;
   }, c.sqrt = function(t) {
@@ -1234,7 +1234,7 @@ function Gc(c) {
     return e.geq(d, e.zero) ? d : e.neg(d);
   };
 }
-function Zc(c) {
+function Gc(c) {
   c.sqrt = function() {
     throw new Error("Sqrt alg 8 not implemented");
   };
@@ -1242,10 +1242,10 @@ function Zc(c) {
 function me(c, t, e, n, a) {
   c[t] = c[t] + c[e] >>> 0, c[a] = (c[a] ^ c[t]) >>> 0, c[a] = (c[a] << 16 | c[a] >>> 16 & 65535) >>> 0, c[n] = c[n] + c[a] >>> 0, c[e] = (c[e] ^ c[n]) >>> 0, c[e] = (c[e] << 12 | c[e] >>> 20 & 4095) >>> 0, c[t] = c[t] + c[e] >>> 0, c[a] = (c[a] ^ c[t]) >>> 0, c[a] = (c[a] << 8 | c[a] >>> 24 & 255) >>> 0, c[n] = c[n] + c[a] >>> 0, c[e] = (c[e] ^ c[n]) >>> 0, c[e] = (c[e] << 7 | c[e] >>> 25 & 127) >>> 0;
 }
-function Wc(c) {
+function Zc(c) {
   me(c, 0, 4, 8, 12), me(c, 1, 5, 9, 13), me(c, 2, 6, 10, 14), me(c, 3, 7, 11, 15), me(c, 0, 5, 10, 15), me(c, 1, 6, 11, 12), me(c, 2, 7, 8, 13), me(c, 3, 4, 9, 14);
 }
-class Xc {
+class Wc {
   constructor(t) {
     t = t || [0, 0, 0, 0, 0, 0, 0, 0], this.state = [
       1634760805,
@@ -1270,7 +1270,7 @@ class Xc {
     return this.idx == 16 && this.update(), this.buff[this.idx++];
   }
   nextU64() {
-    return Gn(fi(this.nextU32(), 4294967296), this.nextU32());
+    return $n(di(this.nextU32(), 4294967296), this.nextU32());
   }
   nextBool() {
     return (this.nextU32() & 1) == 1;
@@ -1279,14 +1279,14 @@ class Xc {
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.state[t];
     for (let t = 0; t < 10; t++)
-      Wc(this.buff);
+      Zc(this.buff);
     for (let t = 0; t < 16; t++)
       this.buff[t] = this.buff[t] + this.state[t] >>> 0;
     this.idx = 0, this.state[12] = this.state[12] + 1 >>> 0, this.state[12] == 0 && (this.state[13] = this.state[13] + 1 >>> 0, this.state[13] == 0 && (this.state[14] = this.state[14] + 1 >>> 0, this.state[14] == 0 && (this.state[15] = this.state[15] + 1 >>> 0)));
   }
 }
-var Vc = mo(), Hc = /* @__PURE__ */ ja(Vc);
-function mi(c) {
+var Xc = Lo(), Vc = /* @__PURE__ */ Ua(Xc);
+function Li(c) {
   let t = new Uint8Array(c);
   if (Se.browser)
     if (typeof globalThis.crypto < "u")
@@ -1295,20 +1295,20 @@ function mi(c) {
       for (let e = 0; e < c; e++)
         t[e] = Math.random() * 4294967296 >>> 0;
   else
-    Hc.randomFillSync(t);
+    Vc.randomFillSync(t);
   return t;
 }
-function Qc() {
-  const c = mi(32), t = new Uint32Array(c.buffer), e = [];
+function Hc() {
+  const c = Li(32), t = new Uint32Array(c.buffer), e = [];
   for (let n = 0; n < 8; n++)
     e.push(t[n]);
   return e;
 }
 let Ke = null;
-function Wn() {
-  return Ke || (Ke = new Xc(Qc()), Ke);
+function Zn() {
+  return Ke || (Ke = new Wc(Hc()), Ke);
 }
-class Jc {
+class Qc {
   constructor(t, e, n) {
     this.F = e, this.G = t, this.opMulGF = n;
     let a = e.sqrt_t || e.t, s = e.sqrt_s || e.s, g = e.one;
@@ -1332,7 +1332,7 @@ class Jc {
   fft(t) {
     if (t.length <= 1)
       return t;
-    const e = ga(t.length - 1) + 1;
+    const e = _a(t.length - 1) + 1;
     this._setRoots(e);
     const n = 1 << e;
     if (t.length != n)
@@ -1342,7 +1342,7 @@ class Jc {
   ifft(t) {
     if (t.length <= 1)
       return t;
-    const e = ga(t.length - 1) + 1;
+    const e = _a(t.length - 1) + 1;
     this._setRoots(e);
     const n = 1 << e;
     if (t.length != n)
@@ -1353,7 +1353,7 @@ class Jc {
     return g;
   }
 }
-function ga(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 an(c, t, e, n, a) {
@@ -1370,7 +1370,7 @@ function an(c, t, e, n, a) {
     l[o] = c.G.add(d[o], c.opMulGF(C[o], c.roots[e][o])), l[o + g] = c.G.sub(d[o], c.opMulGF(C[o], c.roots[e][o]));
   return l;
 }
-class Kc {
+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 = Ve(this.p), this.mask = (this.one << BigInt(this.bitLength)) - this.one, this.n64 = Math.floor((this.bitLength - 1) / 64) + 1, this.n32 = this.n64 * 2, this.n8 = this.n64 * 8, this.R = this.e(this.one << BigInt(this.n64 * 64)), this.Ri = this.inv(this.R);
     const e = this.negone >> this.one;
@@ -1380,7 +1380,7 @@ class Kc {
       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), Rc(this), this.FFT = new Jc(this, this, this.mul.bind(this)), this.fft = this.FFT.fft.bind(this.FFT), this.ifft = this.FFT.ifft.bind(this.FFT), this.w = this.FFT.w, this.wi = this.FFT.wi, this.shift = this.square(this.nqr), this.k = this.exp(this.nqr, 2 ** this.s);
+    this.nqr_to_t = this.pow(this.nqr, this.t), Mc(this), this.FFT = new Qc(this, this, this.mul.bind(this)), this.fft = this.FFT.fft.bind(this.FFT), this.ifft = this.FFT.ifft.bind(this.FFT), this.w = this.FFT.w, this.wi = this.FFT.wi, this.shift = this.square(this.nqr), this.k = this.exp(this.nqr, 2 ** this.s);
   }
   e(t, e) {
     let n;
@@ -1453,10 +1453,10 @@ class Kc {
     return t % e;
   }
   pow(t, e) {
-    return _a(this, t, e);
+    return fa(this, t, e);
   }
   exp(t, e) {
-    return _a(this, t, e);
+    return fa(this, t, e);
   }
   band(t, e) {
     const n = t & e & this.mask;
@@ -1532,7 +1532,7 @@ class Kc {
     const t = this.bitLength * 2 / 8;
     let e = this.zero;
     for (let n = 0; n < t; n++)
-      e = (e << BigInt(8)) + BigInt(mi(1)[0]);
+      e = (e << BigInt(8)) + BigInt(Li(1)[0]);
     return e % this.p;
   }
   toString(t, e) {
@@ -1565,7 +1565,7 @@ class Kc {
   }
   // Returns a buffer with Big Endian Representation
   toRprBE(t, e, n) {
-    gi(t, e, n, this.n64 * 8);
+    _i(t, e, n, this.n64 * 8);
   }
   // Returns a buffer with Big Endian Montgomery Representation
   toRprBEM(t, e, n) {
@@ -1580,7 +1580,7 @@ class Kc {
   }
   // Pases a buffer with Big Endian Representation
   fromRprBE(t, e) {
-    return pi(t, e, this.n8);
+    return gi(t, e, this.n8);
   }
   fromRprLEM(t, e) {
     return this.mul(this.fromRprLE(t, e), this.Ri);
@@ -1610,7 +1610,7 @@ ye.bigInt2U32LE = function(t, e) {
 ye.isOcamNum = function(c) {
   return !(!Array.isArray(c) || c.length != 3 || typeof c[0] != "number" || typeof c[1] != "number" || !Array.isArray(c[2]));
 };
-var Yc = function(t, e, n) {
+var Kc = function(t, e, n) {
   const a = n || "int";
   if (t.modules[a])
     return a;
@@ -2336,7 +2336,7 @@ var Yc = 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;
-}, Xn = 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));
@@ -2384,8 +2384,8 @@ var Yc = function(t, e, n) {
       );
     return E;
   }
-}, Vn = ts;
-function ts(c, t) {
+}, Xn = Yc;
+function Yc(c, t) {
   const e = c.modules[t].n64 * 8, n = c.addFunction(t + "_batchInverse");
   n.addParam("pIn", "i32"), n.addParam("inStep", "i32"), n.addParam("n", "i32"), n.addParam("pOut", "i32"), n.addParam("outStep", "i32"), n.addLocal("itAux", "i32"), n.addLocal("itIn", "i32"), n.addLocal("itOut", "i32"), n.addLocal("i", "i32");
   const a = n.getCodeBuilder(), s = a.i32_const(c.alloc(e));
@@ -2492,8 +2492,8 @@ function ts(c, t) {
     )
   );
 }
-var bi = es;
-function es(c, t, e, n, a, s) {
+var mi = ts;
+function ts(c, t, e, n, a, s) {
   typeof s > "u" && (n < a ? s = !0 : s = !1);
   const g = c.addFunction(t);
   g.addParam("pIn", "i32"), g.addParam("n", "i32"), g.addParam("pOut", "i32"), g.addLocal("i", "i32"), g.addLocal("itIn", "i32"), g.addLocal("itOut", "i32");
@@ -2548,8 +2548,8 @@ function es(c, t, e, n, a, s) {
     ))
   );
 }
-var ns = as;
-function as(c, t, e, n, a, s) {
+var es = ns;
+function ns(c, t, e, n, a, s) {
   typeof s > "u" && (n < a ? s = !0 : s = !1);
   const g = c.addFunction(t);
   g.addParam("pIn1", "i32"), g.addParam("pIn2", "i32"), g.addParam("n", "i32"), g.addParam("pOut", "i32"), g.addLocal("i", "i32"), g.addLocal("itIn1", "i32"), g.addLocal("itIn2", "i32"), g.addLocal("itOut", "i32");
@@ -2621,25 +2621,25 @@ function as(c, t, e, n, a, s) {
   );
 }
 var le = {};
-function yi(c, t) {
+function bi(c, t) {
   return c === t ? 0 : c > t ? 1 : -1;
 }
-function Hn(c) {
+function Vn(c) {
   return c * c;
 }
-function Ci(c) {
+function yi(c) {
   return c % 2n !== 0n;
 }
-function Qn(c) {
+function Hn(c) {
   return c % 2n === 0n;
 }
 function un(c) {
   return c < 0n;
 }
-function is(c) {
+function as(c) {
   return c > 0n;
 }
-function Ai(c) {
+function Ci(c) {
   return un(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
 function Qe(c) {
@@ -2648,52 +2648,52 @@ function Qe(c) {
 function ke(c) {
   return Qe(c) === 1n;
 }
-function Fi(c, t) {
+function Ai(c, t) {
   for (var e = 0n, n = 1n, a = t, s = Qe(c), g, d, C; s !== 0n; )
     g = a / s, d = e, C = a, e = n, a = s, n = d - g * n, s = C - g * s;
   if (!ke(a))
     throw new Error(c.toString() + " and " + t.toString() + " are not co-prime");
-  return yi(e, 0n) === -1 && (e = e + t), un(c) ? -e : e;
+  return bi(e, 0n) === -1 && (e = e + t), un(c) ? -e : e;
 }
-function Ei(c, t, e) {
+function Fi(c, t, e) {
   if (e === 0n)
     throw new Error("Cannot take modPow with modulus 0");
   var n = 1n, a = c % e;
-  for (un(t) && (t = t * -1n, a = Fi(a, e)); is(t); ) {
+  for (un(t) && (t = t * -1n, a = Ai(a, e)); as(t); ) {
     if (a === 0n)
       return 0n;
-    Ci(t) && (n = n * a % e), t = t / 2n, a = Hn(a) % e;
+    yi(t) && (n = n * a % e), t = t / 2n, a = Vn(a) % e;
   }
   return n;
 }
-function os(c, t) {
+function is(c, t) {
   return c = c >= 0n ? c : -c, t = t >= 0n ? t : -t, c === t ? 0 : c > t ? 1 : -1;
 }
-function pa(c, t) {
-  return t === 0n ? !1 : ke(t) ? !0 : os(t, 2n) === 0 ? Qn(c) : c % t === 0n;
+function ga(c, t) {
+  return t === 0n ? !1 : ke(t) ? !0 : is(t, 2n) === 0 ? Hn(c) : c % t === 0n;
 }
-function cs(c) {
+function os(c) {
   var t = Qe(c);
   if (ke(t))
     return !1;
   if (t === 2n || t === 3n || t === 5n)
     return !0;
-  if (Qn(t) || pa(t, 3n) || pa(t, 5n))
+  if (Hn(t) || ga(t, 3n) || ga(t, 5n))
     return !1;
   if (t < 49n)
     return !0;
 }
-function ss(c) {
+function cs(c) {
   return c - 1n;
 }
-function ha(c, t) {
-  for (var e = ss(c), n = e, a = 0, s, g, d; Qn(n); )
+function pa(c, t) {
+  for (var e = cs(c), n = e, a = 0, s, g, d; Hn(n); )
     n = n / 2n, a++;
   t:
     for (g = 0; g < t.length; g++)
-      if (!(c < t[g]) && (d = Ei(BigInt(t[g]), n, c), !(ke(d) || d === e))) {
+      if (!(c < t[g]) && (d = Fi(BigInt(t[g]), n, c), !(ke(d) || d === e))) {
         for (s = a - 1; s != 0; s--) {
-          if (d = Hn(d) % c, ke(d))
+          if (d = Vn(d) % c, ke(d))
             return !1;
           if (d === e)
             continue t;
@@ -2702,33 +2702,33 @@ function ha(c, t) {
       }
   return !0;
 }
-function rs(c) {
-  var t = cs(c);
+function ss(c) {
+  var t = os(c);
   if (t !== void 0)
     return t;
-  var e = Qe(c), n = Ai(e);
+  var e = Qe(c), n = Ci(e);
   if (n <= 64)
-    return ha(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 ha(e, g);
+  return pa(e, g);
 }
-le.bitLength = Ai;
-le.isOdd = Ci;
+le.bitLength = Ci;
+le.isOdd = yi;
 le.isNegative = un;
 le.abs = Qe;
 le.isUnit = ke;
-le.compare = yi;
-le.modInv = Fi;
-le.modPow = Ei;
-le.isPrime = rs;
-le.square = Hn;
-const ls = Yc, pe = ye, us = Xn, ds = Vn, Ln = bi, mn = ns, { bitLength: fs, modInv: bn, modPow: La, isPrime: ma, isOdd: _s, square: gs } = le;
-var Jn = function(t, e, n, a) {
-  const s = BigInt(e), g = Math.floor((fs(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
+le.compare = bi;
+le.modInv = Ai;
+le.modPow = Fi;
+le.isPrime = ss;
+le.square = Vn;
+const rs = Kc, pe = ye, ls = Wn, us = Xn, Ln = mi, mn = es, { bitLength: ds, modInv: bn, modPow: ha, isPrime: La, isOdd: fs, square: _s } = le;
+var Qn = function(t, e, n, a) {
+  const s = BigInt(e), g = Math.floor((ds(s - 1n) - 1) / 64) + 1, d = g * 2, C = g * 8, l = n || "f1m";
   if (t.modules[l])
     return l;
-  const o = ls(t, g, a), y = t.alloc(C, pe.bigInt2BytesLE(s, C)), E = t.alloc(pe.bigInt2BytesLE(gs(1n << BigInt(g * 64)) % s, C)), m = t.alloc(pe.bigInt2BytesLE((1n << BigInt(g * 64)) % s, C)), x = t.alloc(pe.bigInt2BytesLE(0n, C)), O = s - 1n, L = O >> 1n, I = t.alloc(C, pe.bigInt2BytesLE(L, C)), v = L + 1n, U = t.alloc(C, pe.bigInt2BytesLE(v, C));
+  const o = rs(t, g, a), y = t.alloc(C, pe.bigInt2BytesLE(s, C)), E = t.alloc(pe.bigInt2BytesLE(_s(1n << BigInt(g * 64)) % s, C)), m = t.alloc(pe.bigInt2BytesLE((1n << BigInt(g * 64)) % s, C)), x = t.alloc(pe.bigInt2BytesLE(0n, C)), O = s - 1n, L = O >> 1n, I = t.alloc(C, pe.bigInt2BytesLE(L, C)), v = L + 1n, U = t.alloc(C, pe.bigInt2BytesLE(v, C));
   t.modules[l] = {
     pq: y,
     pR2: E,
@@ -3251,13 +3251,13 @@ var Jn = 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 (ma(s))
-    for (; La(nt, L, s) !== O; )
+  if (La(s))
+    for (; ha(nt, L, s) !== O; )
       nt = nt + 1n;
   let J = 0, ft = O;
-  for (; !_s(ft) && ft !== 0n; )
+  for (; !fs(ft) && ft !== 0n; )
     J++, ft = ft >> 1n;
-  const at = t.alloc(C, pe.bigInt2BytesLE(ft, C)), _t = La(nt, ft, s), zt = t.alloc(pe.bigInt2BytesLE((_t << BigInt(g * 64)) % s, C)), G = ft + 1n >> 1n, K = t.alloc(C, pe.bigInt2BytesLE(G, C));
+  const at = t.alloc(C, pe.bigInt2BytesLE(ft, C)), _t = ha(nt, ft, s), zt = t.alloc(pe.bigInt2BytesLE((_t << BigInt(g * 64)) % s, C)), G = ft + 1n >> 1n, K = t.alloc(C, pe.bigInt2BytesLE(G, C));
   function P() {
     const z = t.addFunction(l + "_sqrt");
     z.addParam("n", "i32"), z.addParam("r", "i32"), z.addLocal("m", "i32"), z.addLocal("i", "i32"), z.addLocal("j", "i32");
@@ -3381,7 +3381,7 @@ var Jn = 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(), ds(t, l), Ln(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), Ln(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), Ln(t, l + "_batchNeg", l + "_neg", C, C), mn(t, l + "_batchAdd", l + "_add", C, C), mn(t, l + "_batchSub", l + "_sub", C, C), mn(t, l + "_batchMul", l + "_mul", C, C), t.exportFunction(l + "_add"), t.exportFunction(l + "_sub"), t.exportFunction(l + "_neg"), t.exportFunction(l + "_isNegative"), t.exportFunction(l + "_isOne"), t.exportFunction(l + "_sign"), t.exportFunction(l + "_mReduct"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_squareOld"), t.exportFunction(l + "_fromMontgomery"), t.exportFunction(l + "_toMontgomery"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_one"), t.exportFunction(l + "_load"), t.exportFunction(l + "_timesScalar"), us(
+  return t.exportFunction(o + "_copy", l + "_copy"), t.exportFunction(o + "_zero", l + "_zero"), t.exportFunction(o + "_isZero", l + "_isZero"), t.exportFunction(o + "_eq", l + "_eq"), W(), S(), F(), r(), j(), T(), D(), A(), M(), H(), h(), R(), ut(), w(), q(), u(), us(t, l), Ln(t, l + "_batchToMontgomery", l + "_toMontgomery", C, C), Ln(t, l + "_batchFromMontgomery", l + "_fromMontgomery", C, C), Ln(t, l + "_batchNeg", l + "_neg", C, C), mn(t, l + "_batchAdd", l + "_add", C, C), mn(t, l + "_batchSub", l + "_sub", C, C), mn(t, l + "_batchMul", l + "_mul", C, C), t.exportFunction(l + "_add"), t.exportFunction(l + "_sub"), t.exportFunction(l + "_neg"), t.exportFunction(l + "_isNegative"), t.exportFunction(l + "_isOne"), t.exportFunction(l + "_sign"), t.exportFunction(l + "_mReduct"), t.exportFunction(l + "_mul"), t.exportFunction(l + "_square"), t.exportFunction(l + "_squareOld"), t.exportFunction(l + "_fromMontgomery"), t.exportFunction(l + "_toMontgomery"), t.exportFunction(l + "_inverse"), t.exportFunction(l + "_one"), t.exportFunction(l + "_load"), t.exportFunction(l + "_timesScalar"), ls(
     t,
     l + "_exp",
     C,
@@ -3389,17 +3389,17 @@ var Jn = function(t, e, n, a) {
     l + "_square",
     o + "_copy",
     l + "_one"
-  ), t.exportFunction(l + "_exp"), t.exportFunction(l + "_batchInverse"), ma(s) && (P(), i(), t.exportFunction(l + "_sqrt"), t.exportFunction(l + "_isSquare")), t.exportFunction(l + "_batchToMontgomery"), t.exportFunction(l + "_batchFromMontgomery"), l;
+  ), 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 ps = Jn, { bitLength: hs } = le;
-var wi = function(t, e, n, a, s) {
-  const g = BigInt(e), d = Math.floor((hs(g - 1n) - 1) / 64) + 1, C = d * 8, l = n || "f1";
+const gs = Qn, { bitLength: ps } = le;
+var Ei = function(t, e, n, a, s) {
+  const g = BigInt(e), d = Math.floor((ps(g - 1n) - 1) / 64) + 1, C = d * 8, l = n || "f1";
   if (t.modules[l])
     return l;
   t.modules[l] = {
     n64: d
   };
-  const o = s || "int", y = ps(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
+  const o = s || "int", y = gs(t, g, a, o), E = t.modules[y].pR2, m = t.modules[y].pq, x = t.modules[y].pePlusOne;
   function O() {
     const U = t.alloc(C), w = t.addFunction(l + "_mul");
     w.addParam("x", "i32"), w.addParam("y", "i32"), w.addParam("r", "i32");
@@ -3428,8 +3428,8 @@ var wi = 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 Ls = Xn, ms = Vn, yn = ye;
-var Bi = function(t, e, n, a) {
+const hs = Wn, Ls = Xn, yn = ye;
+var wi = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8, g = t.modules[a].q;
@@ -3725,7 +3725,7 @@ var Bi = 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"), ms(t, n), Ls(
+  return F(), R(), U(), w(), v(), m(), x(), O(), d(), l(), o(), y(), L(), I(), S(), r(), C(), h(), E(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_mul1"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_conjugate"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), Ls(t, n), hs(
     t,
     n + "_exp",
     s * 2,
@@ -3735,8 +3735,8 @@ var Bi = 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 bs = Xn, ys = Vn;
-var vi = function(t, e, n, a) {
+const ms = Wn, bs = Xn;
+var Bi = function(t, e, n, a) {
   if (t.modules[n])
     return n;
   const s = t.modules[a].n64 * 8;
@@ -3993,7 +3993,7 @@ var vi = 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"), ys(t, n), bs(
+  return U(), F(), L(), I(), O(), y(), E(), g(), C(), l(), S(), m(), x(), v(), w(), d(), o(), t.exportFunction(n + "_isZero"), t.exportFunction(n + "_isOne"), t.exportFunction(n + "_zero"), t.exportFunction(n + "_one"), t.exportFunction(n + "_copy"), t.exportFunction(n + "_mul"), t.exportFunction(n + "_square"), t.exportFunction(n + "_add"), t.exportFunction(n + "_sub"), t.exportFunction(n + "_neg"), t.exportFunction(n + "_sign"), t.exportFunction(n + "_fromMontgomery"), t.exportFunction(n + "_toMontgomery"), t.exportFunction(n + "_eq"), t.exportFunction(n + "_inverse"), bs(t, n), ms(
     t,
     n + "_exp",
     s * 3,
@@ -4002,7 +4002,7 @@ var vi = 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;
-}, Cs = function(t, e, n, a, s, g, d, C) {
+}, ys = function(t, e, n, a, s, g, d, C) {
   const l = t.addFunction(e);
   l.addParam("base", "i32"), l.addParam("scalar", "i32"), l.addParam("scalarLength", "i32"), l.addParam("r", "i32"), l.addLocal("old0", "i32"), l.addLocal("nbits", "i32"), l.addLocal("i", "i32"), l.addLocal("last", "i32"), l.addLocal("cur", "i32"), l.addLocal("carry", "i32"), l.addLocal("p", "i32");
   const o = l.getCodeBuilder(), y = o.i32_const(t.alloc(n));
@@ -4185,7 +4185,7 @@ var vi = function(t, e, n, a) {
     )),
     o.i32_store(o.i32_const(0), o.getLocal("old0"))
   );
-}, As = function(t, e, n, a, s) {
+}, Cs = function(t, e, n, a, s) {
   const d = t.modules[e].n64 * 8;
   function C() {
     const E = t.addFunction(n + "_getChunk");
@@ -4577,8 +4577,8 @@ var vi = function(t, e, n, a) {
   }
   C(), y(), l(), o(), t.exportFunction(n), t.exportFunction(n + "_chunk");
 };
-const ba = Cs, Me = bi, ya = As;
-var xi = function(t, e, n, a) {
+const ma = ys, Me = mi, ba = Cs;
+var vi = function(t, e, n, a) {
   const s = t.modules[n].n64, g = s * 8;
   if (t.modules[e])
     return e;
@@ -5476,7 +5476,7 @@ var xi = function(t, e, n, a) {
       )
     );
   }
-  return C(), d(), E(), y(), o(), l(), ut(), I(), x(), m(), L(), O(), h(), r(), F(), j(), R(), A(), D(), T(), S(), w(), U(), v(), H(), G(), K(), nt(), M(), J(), at(), ft(), _t(), zt(), Me(t, e + "_batchLEMtoU", e + "_LEMtoU", g * 2, g * 2), Me(t, e + "_batchLEMtoC", e + "_LEMtoC", g * 2, g), Me(t, e + "_batchUtoLEM", e + "_UtoLEM", g * 2, g * 2), Me(t, e + "_batchCtoLEM", e + "_CtoLEM", g, g * 2, !0), Me(t, e + "_batchToJacobian", e + "_toJacobian", g * 2, g * 3, !0), ya(t, e, e + "_multiexp", e + "_add", g * 3), ya(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), ba(
+  return C(), d(), E(), y(), o(), l(), ut(), I(), x(), m(), L(), O(), h(), r(), F(), j(), R(), A(), D(), T(), S(), w(), U(), v(), H(), G(), K(), nt(), M(), J(), at(), ft(), _t(), zt(), Me(t, e + "_batchLEMtoU", e + "_LEMtoU", g * 2, g * 2), Me(t, e + "_batchLEMtoC", e + "_LEMtoC", g * 2, g), Me(t, e + "_batchUtoLEM", e + "_UtoLEM", g * 2, g * 2), Me(t, e + "_batchCtoLEM", e + "_CtoLEM", g, g * 2, !0), Me(t, e + "_batchToJacobian", e + "_toJacobian", g * 2, g * 3, !0), ba(t, e, e + "_multiexp", e + "_add", g * 3), ba(t, e, e + "_multiexpAffine", e + "_addMixed", g * 2), ma(
     t,
     e + "_timesScalar",
     g * 3,
@@ -5485,7 +5485,7 @@ var xi = function(t, e, n, a) {
     e + "_sub",
     e + "_copy",
     e + "_zero"
-  ), ba(
+  ), ma(
     t,
     e + "_timesScalarAffine",
     g * 2,
@@ -5496,11 +5496,11 @@ var xi = 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: Ca, modPow: Re } = le, Ye = ye;
-var Si = function(t, e, n, a, s) {
+const { isOdd: As, modInv: ya, modPow: Re } = le, Ye = ye;
+var xi = 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 (; !As(y); )
     E++, y = y >> 1n;
   let m = 2n;
   for (; Re(m, o >> 1n, o) === 1n; )
@@ -5521,12 +5521,12 @@ var Si = function(t, e, n, a, s) {
     U[q] = U[q - 1] * 2n;
   const w = [];
   for (let q = 0; q <= E; q++) {
-    const u = Ca(U[q], o) * I % o;
+    const u = ya(U[q], o) * I % o;
     w.push(...Ye.bigInt2BytesLE(u, d));
   }
   const S = t.alloc(w), F = Re(m, 2n, o), r = [], h = [];
   for (let q = 0; q <= E; q++) {
-    const u = Re(F, 2n ** BigInt(q), o), W = Ca(o + 1n - u, o);
+    const u = Re(F, 2n ** BigInt(q), o), W = ya(o + 1n - u, o);
     r.push(...Ye.bigInt2BytesLE(u * I % o, d)), h.push(...Ye.bigInt2BytesLE(W * I % o, d));
   }
   const R = t.alloc(r), j = t.alloc(h);
@@ -6519,7 +6519,7 @@ var Si = 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");
-}, Ii = function(t, e, n) {
+}, Si = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const C = t.addFunction(e + "_zero");
@@ -6612,7 +6612,7 @@ var Si = function(t, e, n, a, s) {
     );
   }
   return g(), d(), t.exportFunction(e + "_zero"), t.exportFunction(e + "_constructLC"), e;
-}, Oi = function(t, e, n) {
+}, Ii = function(t, e, n) {
   const s = t.modules[n].n64 * 8;
   function g() {
     const l = t.addFunction(e + "_buildABC");
@@ -6882,7 +6882,7 @@ var Si = function(t, e, n, a, s) {
     );
   }
   return g(), d(), C(), t.exportFunction(e + "_buildABC"), t.exportFunction(e + "_joinABC"), t.exportFunction(e + "_batchAdd"), e;
-}, Pi = function(t, e, n, a, s, g, d, C) {
+}, Oi = 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));
@@ -6919,19 +6919,19 @@ var Si = function(t, e, n, a, s) {
     ))
   ), t.exportFunction(e);
 };
-const Nt = ye, Es = Jn, ws = wi, Aa = Bi, Bs = vi, Fa = xi, Cn = Si, vs = Ii, xs = Oi, Ne = Pi, { bitLength: Ss, modInv: Is, isOdd: Ea, isNegative: Os } = le;
-var Ps = function(t, e) {
+const Nt = ye, Fs = Qn, Es = Ei, Ca = wi, ws = Bi, Aa = vi, Cn = xi, Bs = Si, vs = Ii, Ne = Oi, { bitLength: xs, modInv: Ss, isOdd: Fa, isNegative: Is } = le;
+var Os = function(t, e) {
   const n = e || "bn128";
   if (t.modules[n])
     return n;
-  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((Ss(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = d, o = l * 2, y = l * 12, E = t.alloc(Nt.bigInt2BytesLE(s, C)), m = Es(t, a, "f1m");
-  ws(t, s, "fr", "frm");
-  const x = t.alloc(Nt.bigInt2BytesLE(w(3n), l)), O = Fa(t, "g1m", "f1m", x);
-  Cn(t, "frm", "frm", "frm", "frm_mul"), vs(t, "pol", "frm"), xs(t, "qap", "frm");
-  const L = Aa(t, "f1m_neg", "f2m", "f1m"), I = t.alloc([
+  const a = 21888242871839275222246405745257275088696311157297823662689037894645226208583n, s = 21888242871839275222246405745257275088548364400416034343698204186575808495617n, g = Math.floor((xs(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = d, o = l * 2, y = l * 12, E = t.alloc(Nt.bigInt2BytesLE(s, C)), m = Fs(t, a, "f1m");
+  Es(t, s, "fr", "frm");
+  const x = t.alloc(Nt.bigInt2BytesLE(w(3n), l)), O = Aa(t, "g1m", "f1m", x);
+  Cn(t, "frm", "frm", "frm", "frm_mul"), Bs(t, "pol", "frm"), vs(t, "qap", "frm");
+  const L = Ca(t, "f1m_neg", "f2m", "f1m"), I = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
     ...Nt.bigInt2BytesLE(w(266929791119991161246907387137283842545076965332900288569378510910307636690n), l)
-  ]), v = Fa(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");
@@ -7032,7 +7032,7 @@ var Ps = function(t, e) {
     ...Nt.bigInt2BytesLE(w(9), l),
     ...Nt.bigInt2BytesLE(w(1), l)
   ]), H = t.alloc([
-    ...Nt.bigInt2BytesLE(w(Is(2n, a)), l),
+    ...Nt.bigInt2BytesLE(w(Ss(2n, a)), l),
     ...Nt.bigInt2BytesLE(0n, l)
   ]), ut = M, nt = t.alloc([
     ...Nt.bigInt2BytesLE(w(19485874751759354771024239261021720505790618469301721065564631296452457478373n), l),
@@ -7052,7 +7052,7 @@ var Ps = function(t, e) {
     );
   }
   J();
-  const ft = Bs(t, n + "_mulNR6", "f6m", "f2m");
+  const ft = ws(t, n + "_mulNR6", "f6m", "f2m");
   function at() {
     const Y = t.addFunction(n + "_mulNR12");
     Y.addParam("x", "i32"), Y.addParam("pr", "i32");
@@ -7077,7 +7077,7 @@ var Ps = function(t, e) {
     );
   }
   at();
-  const _t = Aa(t, n + "_mulNR12", "ftm", ft), G = At(29793968203157093288n), K = t.alloc(G), P = 3 * o, i = G.length - 1, u = G.reduce((Y, f) => Y + (f != 0 ? 1 : 0), 0) + i + 1, W = 3 * 2 * d, z = 3 * d * 2 + u * P;
+  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,
@@ -7099,7 +7099,7 @@ var Ps = function(t, e) {
     let f = Y;
     const _ = [];
     for (; f > 0n; ) {
-      if (Ea(f)) {
+      if (Fa(f)) {
         const Z = 2 - Number(f % 4n);
         _.push(Z), f = f - BigInt(Z);
       } else
@@ -7112,7 +7112,7 @@ var Ps = function(t, e) {
     let f = Y;
     const _ = [];
     for (; f > 0n; )
-      Ea(f) ? _.push(1) : _.push(0), f = f >> 1n;
+      Fa(f) ? _.push(1) : _.push(0), f = f >> 1n;
     return _;
   }
   function Lt() {
@@ -7506,7 +7506,7 @@ var Ps = function(t, e) {
         (ct * rt - st * ot) % a,
         (ct * ot + st * rt) % a
       ];
-      return Os(gt[0]) && (gt[0] = gt[0] + a), gt;
+      return Is(gt[0]) && (gt[0] = gt[0] + a), gt;
     }
   }
   function $t() {
@@ -7739,19 +7739,19 @@ var Ps = function(t, e) {
     Wt(Y), t.exportFunction(n + "_pairingEq" + Y);
   wt(), t.exportFunction(n + "_pairing"), t.exportFunction(n + "_prepareG1"), t.exportFunction(n + "_prepareG2"), t.exportFunction(n + "_millerLoop"), t.exportFunction(n + "_finalExponentiation"), t.exportFunction(n + "_finalExponentiationOld"), t.exportFunction(n + "__mulBy024"), t.exportFunction(n + "__mulBy024Old"), t.exportFunction(n + "__cyclotomicSquare"), t.exportFunction(n + "__cyclotomicExp_w0");
 };
-const Mt = ye, ks = Jn, Ts = wi, wa = Bi, qs = vi, Ba = xi, An = Si, Ds = Ii, Ms = Oi, ze = Pi, { bitLength: va, isOdd: xa, isNegative: Rs } = le;
-var Ns = function(t, e) {
+const Mt = ye, Ps = Qn, ks = Ei, Ea = wi, Ts = Bi, wa = vi, An = xi, qs = Si, Ds = Ii, ze = Oi, { bitLength: Ba, isOdd: va, isNegative: Ms } = le;
+var Rs = function(t, e) {
   const n = e || "bls12381";
   if (t.modules[n])
     return n;
-  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((va(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((va(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = ks(t, a, "f1m", "intq");
-  Ts(t, s, "fr", "frm", "intr");
-  const L = t.alloc(Mt.bigInt2BytesLE(F(4n), C)), I = Ba(t, "g1m", "f1m", L);
-  An(t, "frm", "frm", "frm", "frm_mul"), Ds(t, "pol", "frm"), Ms(t, "qap", "frm");
-  const v = wa(t, "f1m_neg", "f2m", "f1m"), U = t.alloc([
+  const a = 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn, s = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001n, g = Math.floor((Ba(a - 1n) - 1) / 64) + 1, d = g * 8, C = d, l = C * 2, o = C * 12, y = Math.floor((Ba(s - 1n) - 1) / 64) + 1, E = y * 8, m = E, x = t.alloc(Mt.bigInt2BytesLE(s, m)), O = Ps(t, a, "f1m", "intq");
+  ks(t, s, "fr", "frm", "intr");
+  const L = t.alloc(Mt.bigInt2BytesLE(F(4n), C)), I = wa(t, "g1m", "f1m", L);
+  An(t, "frm", "frm", "frm", "frm_mul"), qs(t, "pol", "frm"), Ds(t, "qap", "frm");
+  const v = Ea(t, "f1m_neg", "f2m", "f1m"), U = t.alloc([
     ...Mt.bigInt2BytesLE(F(4n), C),
     ...Mt.bigInt2BytesLE(F(4n), C)
-  ]), w = Ba(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");
@@ -7863,7 +7863,7 @@ var Ns = function(t, e) {
     );
   }
   nt();
-  const J = qs(t, v + "_mulNR", "f6m", "f2m");
+  const J = Ts(t, v + "_mulNR", "f6m", "f2m");
   function ft() {
     const f = t.addFunction(J + "_mulNR");
     f.addParam("x", "i32"), f.addParam("pr", "i32");
@@ -7892,7 +7892,7 @@ var Ns = function(t, e) {
     );
   }
   ft();
-  const at = wa(t, J + "_mulNR", "ftm", J), zt = At(0xd201000000010000n), G = t.alloc(zt), K = 3 * l, P = zt.length - 1, q = zt.reduce((f, _) => f + (_ != 0 ? 1 : 0), 0) + P + 1, u = 3 * 2 * d, W = 3 * d * 2 + q * K, z = !0, b = 15132376222941642752n;
+  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,
@@ -7916,7 +7916,7 @@ var Ns = function(t, e) {
     let _ = f;
     const Z = [];
     for (; _ > 0n; ) {
-      if (xa(_)) {
+      if (va(_)) {
         const Q = 2 - Number(_ % 4n);
         Z.push(Q), _ = _ - BigInt(Q);
       } else
@@ -7929,7 +7929,7 @@ var Ns = function(t, e) {
     let _ = f;
     const Z = [];
     for (; _ > 0n; )
-      xa(_) ? Z.push(1) : Z.push(0), _ = _ >> 1n;
+      va(_) ? Z.push(1) : Z.push(0), _ = _ >> 1n;
     return Z;
   }
   function Lt() {
@@ -8322,7 +8322,7 @@ var Ns = function(t, e) {
         (st * ot - rt * gt) % a,
         (st * gt + rt * ot) % a
       ];
-      return Rs(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
+      return Ms(Bt[0]) && (Bt[0] = Bt[0] + a), Bt;
     }
   }
   function Jt() {
@@ -8639,47 +8639,47 @@ var Ns = 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");
-}, zs = Ps, Us = Ns;
-function kn(c) {
+}, Ns = Os, zs = Rs;
+function Pn(c) {
   if (typeof c == "bigint" || c.eq !== void 0)
     return c.toString(10);
   if (c instanceof Uint8Array)
     return Ze(c, 0);
   if (Array.isArray(c))
-    return c.map(kn);
+    return c.map(Pn);
   if (typeof c == "object") {
     const t = {};
     return Object.keys(c).forEach((n) => {
-      t[n] = kn(c[n]);
+      t[n] = Pn(c[n]);
     }), t;
   } else
     return c;
 }
-function Tn(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(Tn);
+    return c.map(kn);
   if (typeof c == "object") {
     if (c === null)
       return null;
     const t = {};
     return Object.keys(c).forEach((n) => {
-      t[n] = Tn(c[n]);
+      t[n] = kn(c[n]);
     }), t;
   } else
     return c;
 }
-function js(c) {
+function Us(c) {
   let t = BigInt(0), e = c.length, n = 0;
   const a = new DataView(c.buffer, c.byteOffset, c.byteLength);
   for (; e > 0; )
     e >= 4 ? (e -= 4, t += BigInt(a.getUint32(e)) << BigInt(n * 8), n += 4) : e >= 2 ? (e -= 2, t += BigInt(a.getUint16(e)) << BigInt(n * 8), n += 2) : (e -= 1, t += BigInt(a.getUint8(e)) << BigInt(n * 8), n += 1);
   return t;
 }
-function $s(c, t) {
+function js(c, t) {
   let e = c;
   const n = new Uint8Array(t), a = new DataView(n.buffer);
   let s = t;
@@ -8689,14 +8689,14 @@ function $s(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function Gs(c) {
+function $s(c) {
   let t = BigInt(0), e = 0;
   const n = new DataView(c.buffer, c.byteOffset, c.byteLength);
   for (; e < c.length; )
     e + 4 <= c.length ? (t += BigInt(n.getUint32(e, !0)) << BigInt(e * 8), e += 4) : e + 2 <= c.length ? (t += BigInt(n.getUint16(e, !0)) << BigInt(e * 8), e += 2) : (t += BigInt(n.getUint8(e, !0)) << BigInt(e * 8), e += 1);
   return t;
 }
-function ki(c, t) {
+function Pi(c, t) {
   let e = c;
   typeof t > "u" && (t = Math.floor((Ve(c) - 1) / 8) + 1, t == 0 && (t = 1));
   const n = new Uint8Array(t), a = new DataView(n.buffer);
@@ -8707,66 +8707,66 @@ function ki(c, t) {
     throw new Error("Number does not fit in this length");
   return n;
 }
-function qn(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(qn.bind(this, c));
+    return t.map(Tn.bind(this, c));
   if (typeof t == "object") {
     const e = {};
     return Object.keys(t).forEach((a) => {
-      e[a] = qn(c, t[a]);
+      e[a] = Tn(c, t[a]);
     }), e;
   } else
     return t;
 }
-function Dn(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(Dn.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] = Dn(c, t[a]);
+      e[a] = qn(c, t[a]);
     }), e;
   } else
     return t;
 }
 const je = [];
 for (let c = 0; c < 256; c++)
-  je[c] = Zs(c, 8);
-function Zs(c, t) {
+  je[c] = Gs(c, 8);
+function Gs(c, t) {
   let e = 0, n = c;
   for (let a = 0; a < t; a++)
     e <<= 1, e = e | n & 1, n >>= 1;
   return e;
 }
-function Ti(c, t) {
+function ki(c, t) {
   return (je[c >>> 24] | je[c >>> 16 & 255] << 8 | je[c >>> 8 & 255] << 16 | je[c & 255] << 24) >>> 32 - t;
 }
 function ue(c) {
   return (c & 4294901760 ? (c &= 4294901760, 16) : 0) | (c & 4278255360 ? (c &= 4278255360, 8) : 0) | (c & 4042322160 ? (c &= 4042322160, 4) : 0) | (c & 3435973836 ? (c &= 3435973836, 2) : 0) | (c & 2863311530) !== 0;
 }
-function qi(c, t) {
+function Ti(c, t) {
   const e = c.byteLength / t, n = ue(e);
   if (e != 1 << n)
     throw new Error("Invalid number of pointers");
   for (let a = 0; a < e; a++) {
-    const s = Ti(a, n);
+    const s = ki(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 Kn(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);
@@ -8778,21 +8778,21 @@ function on(c, t) {
     n[a] = c.slice(a * t, a * t + t);
   return n;
 }
-var Ws = /* @__PURE__ */ Object.freeze({
+var Zs = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  array2buffer: Kn,
-  beBuff2int: js,
-  beInt2Buff: $s,
-  bitReverse: Ti,
-  buffReverseBits: qi,
+  array2buffer: Jn,
+  beBuff2int: Us,
+  beInt2Buff: js,
+  bitReverse: ki,
+  buffReverseBits: Ti,
   buffer2array: on,
-  leBuff2int: Gs,
-  leInt2Buff: ki,
+  leBuff2int: $s,
+  leInt2Buff: Pi,
   log2: ue,
-  stringifyBigInts: kn,
-  stringifyFElements: qn,
-  unstringifyBigInts: Tn,
-  unstringifyFElements: Dn
+  stringifyBigInts: Pn,
+  stringifyFElements: Tn,
+  unstringifyBigInts: kn,
+  unstringifyFElements: qn
 });
 const se = 1 << 30;
 class Vt {
@@ -8865,7 +8865,7 @@ function be(c, t, e, n) {
     return o;
   };
 }
-class Sa {
+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 = Ie(a, we), this.bitLength = Ve(a), this.mask = Le(nn(we, this.bitLength), we), this.pOp1 = t.alloc(n), this.pOp2 = t.alloc(n), this.pOp3 = t.alloc(n), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = this.tm.getBuff(this.pOp1, this.n8), this.tm.instance.exports[e + "_one"](this.pOp1), this.one = this.tm.getBuff(this.pOp1, this.n8), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.n64 = Math.floor(n / 8), this.n32 = Math.floor(n / 4), this.n64 * 8 != this.n8)
       throw new Error("n8 must be a multiple of 8");
@@ -8875,7 +8875,7 @@ class Sa {
       this.nqr = this.add(this.nqr, this.one), s = this.exp(this.nqr, this.half);
     this.shift = this.mul(this.nqr, this.nqr), this.shiftInv = this.inv(this.shift), this.s = 0;
     let g = Le(this.p, we);
-    for (; !$n(g); )
+    for (; !jn(g); )
       this.s = this.s + 1, g = Ie(g, we);
     this.w = [], this.w[this.s] = this.exp(this.nqr, g);
     for (let d = this.s - 1; d >= 0; d--)
@@ -8945,27 +8945,27 @@ class Sa {
     if (t instanceof Uint8Array)
       return t;
     let n = ee(t, e);
-    si(n) ? (n = di(n), Pn(n, this.p) && (n = ge(n, this.p)), n = Le(this.p, n)) : Pn(n, this.p) && (n = ge(n, this.p));
-    const a = ki(n, this.n8);
+    ci(n) ? (n = ui(n), On(n, this.p) && (n = ge(n, this.p)), n = Le(this.p, n)) : On(n, this.p) && (n = ge(n, this.p));
+    const a = Pi(n, this.n8);
     return this.toMontgomery(a);
   }
   toString(t, e) {
     const n = this.fromMontgomery(t), a = Ze(n, 0);
-    return hi(a, e);
+    return pi(a, e);
   }
   fromRng(t) {
     let e;
     const n = new Uint8Array(this.n8);
     do {
-      e = Li;
+      e = hi;
       for (let a = 0; a < this.n64; a++)
-        e = Gn(e, nn(t.nextU64(), 64 * a));
-      e = Zn(e, this.mask);
-    } while (_i(e, this.p));
+        e = $n(e, nn(t.nextU64(), 64 * a));
+      e = Gn(e, this.mask);
+    } while (fi(e, this.p));
     return Ge(n, 0, e, this.n8), n;
   }
   random() {
-    return this.fromRng(Wn());
+    return this.fromRng(Zn());
   }
   toObject(t) {
     const e = this.fromMontgomery(t);
@@ -8994,7 +8994,7 @@ class Sa {
   async batchInverse(t) {
     let e = !1;
     const n = this.n8, a = this.n8;
-    Array.isArray(t) ? (t = Kn(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");
@@ -9028,7 +9028,7 @@ class Sa {
     return e ? on(l, a) : l;
   }
 }
-class Ia {
+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);
   }
@@ -9110,7 +9110,7 @@ class Ia {
     return a.set(e), a.set(n, this.F.n8), a;
   }
   random() {
-    return this.fromRng(Wn());
+    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));
@@ -9127,7 +9127,7 @@ class Ia {
     return t.slice(this.F.n8);
   }
 }
-class Xs {
+class Ws {
   constructor(t, e, n) {
     this.tm = t, this.prefix = e, this.F = n, this.type = "F3", this.m = n.m * 3, this.n8 = this.F.n8 * 3, this.n32 = this.F.n32 * 3, this.n64 = this.F.n64 * 3, this.pOp1 = t.alloc(n.n8 * 3), this.pOp2 = t.alloc(n.n8 * 3), this.pOp3 = t.alloc(n.n8 * 3), this.tm.instance.exports[e + "_zero"](this.pOp1), this.zero = t.getBuff(this.pOp1, this.n8), this.tm.instance.exports[e + "_one"](this.pOp1), this.one = t.getBuff(this.pOp1, this.n8), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one);
   }
@@ -9206,7 +9206,7 @@ class Xs {
     return s.set(e), s.set(n, this.F.n8), s.set(a, this.F.n8 * 2), s;
   }
   random() {
-    return this.fromRng(Wn());
+    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));
@@ -9226,7 +9226,7 @@ class Xs {
     return t.slice(this.F.n8 * 2);
   }
 }
-class Oa {
+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 = Pe(g)), this.negone = this.neg(this.one), this.two = this.add(this.one, this.one), this.batchLEMtoC = be(t, e + "_batchLEMtoC", n.n8 * 2, n.n8), this.batchLEMtoU = be(t, e + "_batchLEMtoU", n.n8 * 2, n.n8 * 2), this.batchCtoLEM = be(t, e + "_batchCtoLEM", n.n8, n.n8 * 2), this.batchUtoLEM = be(t, e + "_batchUtoLEM", n.n8 * 2, n.n8 * 2), this.batchToJacobian = be(t, e + "_batchToJacobian", n.n8 * 2, n.n8 * 3), this.batchToAffine = be(t, e + "_batchToAffine", n.n8 * 3, n.n8 * 2);
   }
@@ -9455,7 +9455,7 @@ class Oa {
     return this.toAffine(t).slice(this.F.n8);
   }
 }
-function Di(c) {
+function qi(c) {
   let e, n;
   c && (c.onmessage = function(o) {
     let y;
@@ -9584,24 +9584,24 @@ ie.EOL = `
 ie.homedir = function() {
   return "/";
 };
-var Vs = Worker;
+var Xs = Worker;
 const Fn = 25;
-class Pa {
+class Oa {
   constructor() {
     this.promise = new Promise((t, e) => {
       this.reject = e, this.resolve = t;
     });
   }
 }
-function Hs(c) {
+function Vs(c) {
   return new Promise((t) => setTimeout(t, c));
 }
-function Qs(c) {
-  return Se.browser ? globalThis.btoa(c) : Lo.from(c).toString("base64");
+function Hs(c) {
+  return Se.browser ? globalThis.btoa(c) : ho.from(c).toString("base64");
 }
-const Js = Qs("(" + Di.toString() + ")(self)"), Ks = "data:application/javascript;base64," + Js;
-async function Ys(c, t) {
-  const e = new tr();
+const Qs = Hs("(" + qi.toString() + ")(self)"), Js = "data:application/javascript;base64," + Qs;
+async function Ks(c, t) {
+  const e = new Ys();
   e.memory = new WebAssembly.Memory({ initial: Fn }), e.u8 = new Uint8Array(e.memory.buffer), e.u32 = new Uint32Array(e.memory.buffer);
   const n = await WebAssembly.compile(c.code);
   if (e.instance = await WebAssembly.instantiate(n, {
@@ -9609,7 +9609,7 @@ async function Ys(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 = Di(), await e.taskManager([{
+    e.code = c.code, e.taskManager = qi(), await e.taskManager([{
       cmd: "INIT",
       init: Fn,
       code: e.code.slice()
@@ -9619,7 +9619,7 @@ async function Ys(c, t) {
     let s;
     typeof navigator == "object" && navigator.hardwareConcurrency ? s = navigator.hardwareConcurrency : s = ie.cpus().length, s == 0 && (s = 2), s > 64 && (s = 64), e.concurrency = s;
     for (let d = 0; d < s; d++)
-      e.workers[d] = new Vs(Ks), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
+      e.workers[d] = new Xs(Js), e.workers[d].addEventListener("message", a(d)), e.working[d] = !1;
     const g = [];
     for (let d = 0; d < e.workers.length; d++) {
       const C = c.code.slice();
@@ -9639,7 +9639,7 @@ async function Ys(c, t) {
     };
   }
 }
-class tr {
+class Ys {
   constructor() {
     this.actionQueue = [], this.oldPFree = 0;
   }
@@ -9656,7 +9656,7 @@ class tr {
   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 Pa(), 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++)
@@ -9666,7 +9666,7 @@ class tr {
       }
   }
   queueAction(t, e) {
-    const n = new Pa();
+    const n = new Oa();
     if (this.singleThread) {
       const a = this.taskManager(t);
       n.resolve(a);
@@ -9700,7 +9700,7 @@ class tr {
   async terminate() {
     for (let t = 0; t < this.workers.length; t++)
       this.workers[t].postMessage([{ cmd: "TERMINATE" }]);
-    await Hs(200);
+    await Vs(200);
   }
 }
 function En(c, t) {
@@ -9757,7 +9757,7 @@ function En(c, t) {
     return w;
   };
 }
-function er(c) {
+function tr(c) {
   const t = c.tm;
   c.pairing = function(n, a) {
     t.startSyncOp();
@@ -9824,7 +9824,7 @@ function er(c) {
     return this.tm.endSyncOp(), s;
   };
 }
-const ka = [
+const Pa = [
   1,
   1,
   1,
@@ -9858,7 +9858,7 @@ const ka = [
   17,
   17
 ];
-function Ta(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))
@@ -9879,7 +9879,7 @@ function Ta(c, t) {
     const x = Math.floor(d.byteLength / m);
     if (x * m != d.byteLength)
       throw new Error("Scalar size does not match");
-    const O = ka[ue(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
+    const O = Pa[ue(m)], L = Math.floor((x * 8 - 1) / O) + 1, I = [];
     for (let w = 0; w < L; w++) {
       const S = [
         { cmd: "ALLOCSET", var: 0, buff: g },
@@ -9921,7 +9921,7 @@ function Ta(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 = ka[ue(x)], I = Math.floor((O * 8 - 1) / L) + 1;
+    const L = Pa[ue(x)], I = Math.floor((O * 8 - 1) / L) + 1;
     let v;
     v = Math.floor(x / (n.concurrency / I)), v > 4194304 && (v = 4194304), v < 1024 && (v = 1024);
     const U = [];
@@ -9950,7 +9950,7 @@ function wn(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 = Kn(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 = ue(R);
     if (1 << j != R)
       throw new Error("fft must be multiple of 2");
@@ -9961,7 +9961,7 @@ function wn(c, t) {
     let T;
     o && (T = n.inv(n.e(R)));
     let D;
-    qi(l, L);
+    Ti(l, L);
     let A, M = Math.min(1 << O, R), H = R / M;
     for (; H < a.concurrency && M >= 16; )
       H *= 2, M /= 2;
@@ -10244,9 +10244,9 @@ function wn(c, t) {
     return w;
   };
 }
-async function Mi(c) {
-  const t = await Ys(c.wasm, c.singleThread), e = {};
-  return e.q = ee(c.wasm.q.toString()), e.r = ee(c.wasm.r.toString()), e.name = c.name, e.tm = t, e.prePSize = c.wasm.prePSize, e.preQSize = c.wasm.preQSize, e.Fr = new Sa(t, "frm", c.n8r, c.r), e.F1 = new Sa(t, "f1m", c.n8q, c.q), e.F2 = new Ia(t, "f2m", e.F1), e.G1 = new Oa(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Oa(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Xs(t, "f6m", e.F2), e.F12 = new Ia(t, "ftm", e.F6), e.Gt = e.F12, En(e, "G1"), En(e, "G2"), En(e, "Fr"), Ta(e, "G1"), Ta(e, "G2"), wn(e, "G1"), wn(e, "G2"), wn(e, "Fr"), er(e), e.array2buffer = function(n, a) {
+async function Di(c) {
+  const t = await Ks(c.wasm, c.singleThread), e = {};
+  return e.q = ee(c.wasm.q.toString()), e.r = ee(c.wasm.r.toString()), e.name = c.name, e.tm = t, e.prePSize = c.wasm.prePSize, e.preQSize = c.wasm.preQSize, e.Fr = new xa(t, "frm", c.n8r, c.r), e.F1 = new xa(t, "f1m", c.n8q, c.q), e.F2 = new Sa(t, "f2m", e.F1), e.G1 = new Ia(t, "g1m", e.F1, c.wasm.pG1gen, c.wasm.pG1b, c.cofactorG1), e.G2 = new Ia(t, "g2m", e.F2, c.wasm.pG2gen, c.wasm.pG2b, c.cofactorG2), e.F6 = new Ws(t, "f6m", e.F2), e.F12 = new Sa(t, "ftm", e.F6), e.Gt = e.F12, En(e, "G1"), En(e, "G2"), En(e, "Fr"), ka(e, "G1"), ka(e, "G2"), wn(e, "G1"), wn(e, "G2"), wn(e, "Fr"), tr(e), e.array2buffer = function(n, a) {
     const s = new Uint8Array(a * n.length);
     for (let g = 0; g < n.length; g++)
       s.set(n[g], g * a);
@@ -10261,20 +10261,20 @@ async function Mi(c) {
 function Te(c) {
   return BigInt(c);
 }
-function Ri(c) {
+function Mi(c) {
   return c < 0n;
 }
-function nr(c) {
+function er(c) {
   return c === 0n;
 }
-function ar(c) {
-  return Ri(c) ? c.toString(2).length - 1 : c.toString(2).length;
+function nr(c) {
+  return Mi(c) ? c.toString(2).length - 1 : c.toString(2).length;
 }
 function Bn(c) {
   const t = [], e = Te(c);
   return t.push(Number(e & 0xFFn)), t.push(Number(e >> 8n & 0xFFn)), t.push(Number(e >> 16n & 0xFFn)), t.push(Number(e >> 24n & 0xFFn)), t;
 }
-function ir(c) {
+function ar(c) {
   for (var t = [], e = 0; e < c.length; e++) {
     var n = c.charCodeAt(e);
     n < 128 ? t.push(n) : n < 2048 ? t.push(
@@ -10294,56 +10294,56 @@ function ir(c) {
   return t;
 }
 function Ue(c) {
-  const t = ir(c);
+  const t = ar(c);
   return [...Rt(t.length), ...t];
 }
-function Ni(c) {
+function Ri(c) {
   const t = [];
   let e = Te(c);
-  if (Ri(e))
+  if (Mi(e))
     throw new Error("Number cannot be negative");
-  for (; !nr(e); )
+  for (; !er(e); )
     t.push(Number(e & 0x7Fn)), e = e >> 7n;
   t.length == 0 && t.push(0);
   for (let n = 0; n < t.length - 1; n++)
     t[n] = t[n] | 128;
   return t;
 }
-function zi(c) {
+function Ni(c) {
   let t, e;
-  const n = ar(c);
+  const n = nr(c);
   c < 0 ? (e = !0, t = (1n << BigInt(n)) + c) : (e = !1, t = Te(c));
-  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = Ni(t + s);
+  const a = 7 - n % 7, s = (1n << BigInt(a)) - 1n << BigInt(n), g = (1 << 7 - a) - 1 | 128, d = Ri(t + s);
   return e || (d[d.length - 1] = d[d.length - 1] & g), d;
 }
-function Mn(c) {
+function Dn(c) {
   let t = Te(c);
   if (t > 0xFFFFFFFFn)
     throw new Error("Number too big");
   if (t > 0x7FFFFFFFn && (t = t - 0x100000000n), t < -2147483648n)
     throw new Error("Number too small");
-  return zi(t);
+  return Ni(t);
 }
-function or(c) {
+function ir(c) {
   let t = Te(c);
   if (t > 0xFFFFFFFFFFFFFFFFn)
     throw new Error("Number too big");
   if (t > 0x7FFFFFFFFFFFFFFFn && (t = t - 0x10000000000000000n), t < -9223372036854775808n)
     throw new Error("Number too small");
-  return zi(t);
+  return Ni(t);
 }
 function Rt(c) {
   let t = Te(c);
   if (t > 0xFFFFFFFFn)
     throw new Error("Number too big");
-  return Ni(t);
+  return Ri(t);
 }
-function qa(c) {
+function Ta(c) {
   return Array.from(c, function(t) {
     return ("0" + (t & 255).toString(16)).slice(-2);
   }).join("");
 }
-class cr {
+class or {
   constructor(t) {
     this.func = t, this.functionName = t.functionName, this.module = t.module;
   }
@@ -10472,10 +10472,10 @@ class cr {
     return [...t, 26];
   }
   i64_const(t) {
-    return [66, ...or(t)];
+    return [66, ...ir(t)];
   }
   i32_const(t) {
-    return [65, ...Mn(t)];
+    return [65, ...Dn(t)];
   }
   i64_eqz(t) {
     return [...t, 80];
@@ -10667,7 +10667,7 @@ const vn = {
   func: 96,
   emptyblock: 64
 };
-class Da {
+class qa {
   constructor(t, e, n, a, s) {
     if (n == "import")
       this.fnType = "import", this.moduleName = a, this.fieldName = s;
@@ -10723,10 +10723,10 @@ class Da {
     this.code.push(...[].concat(...t));
   }
   getCodeBuilder() {
-    return new cr(this);
+    return new or(this);
   }
 }
-class Ui {
+class zi {
   constructor() {
     this.functions = [], this.functionIdxByName = {}, this.nImportFunctions = 0, this.nInternalFunctions = 0, this.memory = {
       pagesSize: 1,
@@ -10752,7 +10752,7 @@ class Ui {
     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 Da(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")
@@ -10761,7 +10761,7 @@ class Ui {
       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 Da(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 = {
@@ -10804,11 +10804,11 @@ class Ui {
     this.signatures = [];
     const t = {};
     if (this.functionsTable.length > 0) {
-      const e = this.functions[this.functionsTable[0]].getSignature(), n = "s_" + qa(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_" + qa(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];
     }
   }
@@ -10884,7 +10884,7 @@ class Ui {
         // Table (0 in MVP)
         65,
         // offset 0
-        ...Mn(0),
+        ...Dn(0),
         11,
         ...Rt(this.functionsTable.length),
         ...t
@@ -10927,7 +10927,7 @@ class Ui {
       t.push([
         0,
         65,
-        ...Mn(this.datas[e].offset),
+        ...Dn(this.datas[e].offset),
         11,
         ...Rt(this.datas[e].bytes.length),
         ...this.datas[e].bytes
@@ -10939,9 +10939,9 @@ class Ui {
   }
 }
 globalThis.curve_bn128 = null;
-async function sr(c, t) {
-  const e = new Ui();
-  e.setMemory(25), zs(e), t && t(e);
+async function cr(c, t) {
+  const e = new zi();
+  e.setMemory(25), Ns(e), t && t(e);
   const n = {};
   if (n.code = e.build(), n.pq = e.modules.f1m.pq, n.pr = e.modules.frm.pq, n.pG1gen = e.modules.bn128.pG1gen, n.pG1zero = e.modules.bn128.pG1zero, n.pG1b = e.modules.bn128.pG1b, n.pG2gen = e.modules.bn128.pG2gen, n.pG2zero = e.modules.bn128.pG2zero, n.pG2b = e.modules.bn128.pG2b, n.pOneT = e.modules.bn128.pOneT, n.prePSize = e.modules.bn128.prePSize, n.preQSize = e.modules.bn128.preQSize, n.n8q = 32, n.n8r = 32, n.q = e.modules.bn128.q, n.r = e.modules.bn128.r, !c && globalThis.curve_bn128)
     return globalThis.curve_bn128;
@@ -10954,15 +10954,15 @@ async function sr(c, t) {
     n8r: 32,
     cofactorG2: ee("30644e72e131a029b85045b68181585e06ceecda572a2489345f2299c0f9fa8d", 16),
     singleThread: !!c
-  }, s = await Mi(a);
+  }, s = await Di(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 rr(c, t) {
-  const e = new Ui();
-  e.setMemory(25), Us(e), t && t(e);
+async function sr(c, t) {
+  const e = new zi();
+  e.setMemory(25), zs(e), t && t(e);
   const n = {};
   if (n.code = e.build(), n.pq = e.modules.f1m.pq, n.pr = e.modules.frm.pq, n.pG1gen = e.modules.bls12381.pG1gen, n.pG1zero = e.modules.bls12381.pG1zero, n.pG1b = e.modules.bls12381.pG1b, n.pG2gen = e.modules.bls12381.pG2gen, n.pG2zero = e.modules.bls12381.pG2zero, n.pG2b = e.modules.bls12381.pG2b, n.pOneT = e.modules.bls12381.pOneT, n.prePSize = e.modules.bls12381.prePSize, n.preQSize = e.modules.bls12381.preQSize, n.n8q = 48, n.n8r = 32, n.q = e.modules.bls12381.q, n.r = e.modules.bls12381.r, !c && globalThis.curve_bls12381)
     return globalThis.curve_bls12381;
@@ -10976,7 +10976,7 @@ async function rr(c, t) {
     cofactorG1: ee("0x396c8c005555e1568c00aaab0000aaab", 16),
     cofactorG2: ee("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5", 16),
     singleThread: !!c
-  }, s = await Mi(a);
+  }, s = await Di(a);
   return s.terminate = async function() {
     a.singleThread || (globalThis.curve_bls12381 = null, await this.tm.terminate());
   }, c || (globalThis.curve_bls12381 = s), s;
@@ -10985,16 +10985,16 @@ ee("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 ee("21888242871839275222246405745257275088548364400416034343698204186575808495617");
 ee("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16);
 ee("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-const Yt = Mc, dn = Ws;
+const Yt = Dc, dn = Zs;
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-const lr = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), ur = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
-async function Yn(c) {
+const rr = Yt.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), lr = Yt.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
+async function Kn(c) {
   let t;
-  if (Yt.eq(c, ur))
+  if (Yt.eq(c, lr))
+    t = await cr();
+  else if (Yt.eq(c, rr))
     t = await sr();
-  else if (Yt.eq(c, lr))
-    t = await rr();
   else
     throw new Error(`Curve not supported: ${Yt.toString(c)}`);
   return t;
@@ -11002,7 +11002,7 @@ async function Yn(c) {
 function fn(c) {
   return (c & 4294901760 ? (c &= 4294901760, 16) : 0) | (c & 4278255360 ? (c &= 4278255360, 8) : 0) | (c & 4042322160 ? (c &= 4042322160, 4) : 0) | (c & 3435973836 ? (c &= 3435973836, 2) : 0) | (c & 2863311530) !== 0;
 }
-const dr = 1, fr = 2, ji = 10, _r = 2;
+const ur = 1, dr = 2, Ui = 10, fr = 2;
 async function de(c, t, e) {
   const n = await c.read(t.G1.F.n8 * 2), a = t.G1.fromRprLEM(n, 0);
   return e ? t.G1.toObject(a) : a;
@@ -11011,56 +11011,56 @@ async function $e(c, t, e) {
   const n = await c.read(t.G2.F.n8 * 2), a = t.G2.fromRprLEM(n, 0);
   return e ? t.G2.toObject(a) : a;
 }
-async function gr(c, t, e) {
+async function _r(c, t, e) {
   await We(c, t, 1);
   const n = await c.readULE32();
-  if (await Xe(c), n === dr)
+  if (await Xe(c), n === ur)
+    return await gr(c, t, e);
+  if (n === dr)
     return await pr(c, t, e);
-  if (n === fr)
+  if (n === Ui)
     return await hr(c, t, e);
-  if (n === ji)
-    return await Lr(c, t, e);
   throw new Error("Protocol not supported: ");
 }
-async function pr(c, t, e) {
+async function gr(c, t, e) {
   const n = {};
   n.protocol = "groth16", await We(c, t, 2);
   const a = await c.readULE32();
   n.n8q = a, n.q = await Be(c, a);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await Be(c, s), n.curve = await Yn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(n.domainSize), n.vk_alpha_1 = await de(c, n.curve, e), n.vk_beta_1 = await de(c, n.curve, e), n.vk_beta_2 = await $e(c, n.curve, e), n.vk_gamma_2 = await $e(c, n.curve, e), n.vk_delta_1 = await de(c, n.curve, e), n.vk_delta_2 = await $e(c, n.curve, e), await Xe(c), n;
+  return n.n8r = s, n.r = await Be(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(n.domainSize), n.vk_alpha_1 = await de(c, n.curve, e), n.vk_beta_1 = await de(c, n.curve, e), n.vk_beta_2 = await $e(c, n.curve, e), n.vk_gamma_2 = await $e(c, n.curve, e), n.vk_delta_1 = await de(c, n.curve, e), n.vk_delta_2 = await $e(c, n.curve, e), await Xe(c), n;
 }
-async function hr(c, t, e) {
+async function pr(c, t, e) {
   const n = {};
   n.protocol = "plonk", await We(c, t, 2);
   const a = await c.readULE32();
   n.n8q = a, n.q = await Be(c, a);
   const s = await c.readULE32();
-  return n.n8r = s, n.r = await Be(c, s), n.curve = await Yn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstrains = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.Qm = await de(c, n.curve, e), n.Ql = await de(c, n.curve, e), n.Qr = await de(c, n.curve, e), n.Qo = await de(c, n.curve, e), n.Qc = await de(c, n.curve, e), n.S1 = await de(c, n.curve, e), n.S2 = await de(c, n.curve, e), n.S3 = await de(c, n.curve, e), n.X_2 = await $e(c, n.curve, e), await Xe(c), n;
+  return n.n8r = s, n.r = await Be(c, s), n.curve = await Kn(n.q), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstrains = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.Qm = await de(c, n.curve, e), n.Ql = await de(c, n.curve, e), n.Qr = await de(c, n.curve, e), n.Qo = await de(c, n.curve, e), n.Qc = await de(c, n.curve, e), n.S1 = await de(c, n.curve, e), n.S2 = await de(c, n.curve, e), n.S3 = await de(c, n.curve, e), n.X_2 = await $e(c, n.curve, e), await Xe(c), n;
 }
-async function Lr(c, t, e) {
+async function hr(c, t, e) {
   const n = {};
-  n.protocol = "fflonk", n.protocolId = ji, await We(c, t, _r);
+  n.protocol = "fflonk", n.protocolId = Ui, await We(c, t, fr);
   const a = await c.readULE32();
-  n.n8q = a, n.q = await Be(c, a), n.curve = await Yn(n.q);
+  n.n8q = a, n.q = await Be(c, a), n.curve = await Kn(n.q);
   const s = await c.readULE32();
   return n.n8r = s, n.r = await Be(c, s), n.nVars = await c.readULE32(), n.nPublic = await c.readULE32(), n.domainSize = await c.readULE32(), n.power = fn(n.domainSize), n.nAdditions = await c.readULE32(), n.nConstraints = await c.readULE32(), n.k1 = await c.read(s), n.k2 = await c.read(s), n.w3 = await c.read(s), n.w4 = await c.read(s), n.w8 = await c.read(s), n.wr = await c.read(s), n.X_2 = await $e(c, n.curve, e), n.C0 = await de(c, n.curve, e), await Xe(c), n;
 }
-async function mr(c, t, e) {
-  await da(c, 1);
+async function Lr(c, t, e) {
+  await ua(c, 1);
   const n = (Math.floor((Yt.bitLength(e) - 1) / 64) + 1) * 8;
-  if (await c.writeULE32(n), await bc(c, e, n), t.byteLength % n != 0)
+  if (await c.writeULE32(n), await mc(c, e, n), t.byteLength % n != 0)
     throw new Error("Invalid witness length");
-  await c.writeULE32(t.byteLength / n), await fa(c), await da(c, 2), await c.write(t), await fa(c);
+  await c.writeULE32(t.byteLength / n), await da(c), await ua(c, 2), await c.write(t), await da(c);
 }
-async function br(c, t) {
+async function mr(c, t) {
   await We(c, t, 1);
   const e = await c.readULE32(), n = await Be(c, e), a = await c.readULE32();
   return await Xe(c), { n8: e, q: n, nWitness: a };
 }
-const { stringifyBigInts: Ma } = dn;
-async function yr(c, t, e) {
-  const { fd: n, sections: a } = await ua(t, "wtns", 2, 33554432, 8388608), s = await br(n, a), { fd: g, sections: d } = await ua(c, "zkey", 2, 1 << 25, 1 << 23), C = await gr(g, d);
+const { stringifyBigInts: Da } = dn;
+async function br(c, t, e) {
+  const { fd: n, sections: a } = await la(t, "wtns", 2, 33554432, 8388608), s = await mr(n, a), { fd: g, sections: d } = await la(c, "zkey", 2, 1 << 25, 1 << 23), C = await _r(g, d);
   if (C.protocol != "groth16")
     throw new Error("zkey file is not groth16");
   if (!Yt.eq(C.r, s.q))
@@ -11073,9 +11073,9 @@ async function yr(c, t, e) {
   e && e.debug("Reading Coeffs");
   const O = await Fe(g, d, 4);
   e && e.debug("Building ABC");
-  const [L, I, v] = await Cr(l, C, x, O, e), U = m == o.s ? l.Fr.shift : l.Fr.w[m + 1], w = await o.ifft(L, "", "", e, "IFFT_A"), S = await o.batchApplyKey(w, o.e(1), U), F = await o.fft(S, "", "", e, "FFT_A"), r = await o.ifft(I, "", "", e, "IFFT_B"), h = await o.batchApplyKey(r, o.e(1), U), R = await o.fft(h, "", "", e, "FFT_B"), j = await o.ifft(v, "", "", e, "IFFT_C"), T = await o.batchApplyKey(j, o.e(1), U), D = await o.fft(T, "", "", e, "FFT_C");
+  const [L, I, v] = await yr(l, C, x, O, e), U = m == o.s ? l.Fr.shift : l.Fr.w[m + 1], w = await o.ifft(L, "", "", e, "IFFT_A"), S = await o.batchApplyKey(w, o.e(1), U), F = await o.fft(S, "", "", e, "FFT_A"), r = await o.ifft(I, "", "", e, "IFFT_B"), h = await o.batchApplyKey(r, o.e(1), U), R = await o.fft(h, "", "", e, "FFT_B"), j = await o.ifft(v, "", "", e, "IFFT_C"), T = await o.batchApplyKey(j, o.e(1), U), D = await o.fft(T, "", "", e, "FFT_C");
   e && e.debug("Join ABC");
-  const A = await Ar(l, C, F, R, D, e);
+  const A = await Cr(l, C, F, R, D, e);
   let M = {};
   e && e.debug("Reading A Points");
   const H = await Fe(g, d, 5);
@@ -11094,9 +11094,9 @@ async function yr(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 = Ma(M), K = Ma(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 Cr(c, t, e, n, a) {
+async function yr(c, t, e, n, a) {
   const s = c.Fr.n8, g = 4 * 3 + t.n8r, d = (n.byteLength - 4) / g, C = new Vt(t.domainSize * s), l = new Vt(t.domainSize * s), o = new Vt(t.domainSize * s), y = [C, l];
   for (let E = 0; E < d; E++) {
     a && E % 1e6 == 0 && a.debug(`QAP AB: ${E}/${d}`);
@@ -11119,7 +11119,7 @@ async function Cr(c, t, e, n, a) {
     );
   return [C, l, o];
 }
-async function Ar(c, t, e, n, a, s) {
+async function Cr(c, t, e, n, a, s) {
   const d = c.Fr.n8, C = Math.floor(e.byteLength / c.Fr.n8), l = [];
   for (let m = 0; m < C; m += 4194304) {
     s && s.debug(`JoinABC: ${m}/${C}`);
@@ -11144,7 +11144,7 @@ async function Ar(c, t, e, n, a, s) {
     y.set(o[m][0], E), E += o[m][0].byteLength;
   return y;
 }
-function $i(c) {
+function ji(c) {
   var t = [];
   return e(t, c), t;
   function e(n, a) {
@@ -11155,7 +11155,7 @@ function $i(c) {
       n.push(a);
   }
 }
-function Gi(c) {
+function $i(c) {
   const t = BigInt(2) ** BigInt(64);
   let e = BigInt("0xCBF29CE484222325");
   for (var n = 0; n < c.length; n++)
@@ -11163,7 +11163,7 @@ function Gi(c) {
   let a = e.toString(16), s = 16 - a.length;
   return a = "0".repeat(s).concat(a), a;
 }
-function Fr(c, t) {
+function Ar(c, t) {
   const e = [];
   let n = BigInt(c);
   const a = BigInt(4294967296);
@@ -11174,7 +11174,7 @@ function Fr(c, t) {
       e.unshift(0), s--;
   return e;
 }
-async function Er(c, t) {
+async function Fr(c, t) {
   t = t || {};
   let e = 32767, n, a = !1;
   for (; !a; )
@@ -11241,7 +11241,7 @@ async function Er(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 Br(E, m) : g = new wr(n, E, m), g;
+  return l === 2 ? g = new wr(E, m) : g = new Er(n, E, m), g;
   function x() {
     for (var L = "", I = E.exports.getMessageChar(); I != 0; )
       L += String.fromCharCode(I), I = E.exports.getMessageChar();
@@ -11254,13 +11254,13 @@ async function Er(c, t) {
     return String.fromCharCode.apply(null, v);
   }
 }
-class wr {
+class Er {
   constructor(t, e, n) {
     this.memory = t, this.i32 = new Uint32Array(t.buffer), this.instance = e, this.n32 = (this.instance.exports.getFrLen() >> 2) - 2;
     const a = this.instance.exports.getPRawPrime(), s = new Array(this.n32);
     for (let g = 0; g < this.n32; g++)
       s[this.n32 - 1 - g] = this.i32[(a >> 2) + g];
-    this.prime = Yt.fromArray(s, 4294967296), this.Fr = new Kc(this.prime), this.mask32 = Yt.fromString("FFFFFFFF", 16), this.NVars = this.instance.exports.getNVars(), this.n64 = Math.floor((this.Fr.bitLength - 1) / 64) + 1, this.R = this.Fr.e(Yt.shiftLeft(1, this.n64 * 64)), this.RInv = this.Fr.inv(this.R), this.sanityCheck = n;
+    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;
@@ -11269,13 +11269,13 @@ class wr {
     this.instance.exports.init(this.sanityCheck || e ? 1 : 0);
     const n = this.allocInt(), a = this.allocFr();
     Object.keys(t).forEach((g) => {
-      const d = Gi(g), C = parseInt(d.slice(0, 8), 16), l = parseInt(d.slice(8, 16), 16);
+      const d = $i(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 = $i(t[g]);
+      const o = this.getInt(n), y = ji(t[g]);
       for (let E = 0; E < y.length; E++)
         this.setFr(a, y[E]), this.instance.exports.setSignal(0, 0, o + E, a);
     });
@@ -11342,7 +11342,7 @@ class wr {
     }
   }
 }
-class Br {
+class wr {
   constructor(t, e) {
     this.instance = t, this.version = this.instance.exports.getVersion(), this.n32 = this.instance.exports.getFieldNumLen32(), this.instance.exports.getRawPrime();
     const n = new Array(this.n32);
@@ -11358,9 +11358,9 @@ class Br {
     const n = Object.keys(t);
     var a = 0;
     if (n.forEach((s) => {
-      const g = Gi(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = $i(t[s]);
+      const g = $i(s), d = parseInt(g.slice(0, 8), 16), C = parseInt(g.slice(8, 16), 16), l = ji(t[s]);
       for (let o = 0; o < l.length; o++) {
-        const y = Fr(l[o], this.n32);
+        const y = Ar(l[o], this.n32);
         for (let E = 0; E < this.n32; E++)
           this.instance.exports.writeSharedRWMemory(E, y[this.n32 - 1 - E]);
         try {
@@ -11404,35 +11404,35 @@ class Br {
     return a;
   }
 }
-const { unstringifyBigInts: vr } = dn;
-async function xr(c, t, e, n) {
-  const a = vr(c), s = await ci(t), g = await s.read(s.totalSize);
+const { unstringifyBigInts: Br } = dn;
+async function vr(c, t, e, n) {
+  const a = Br(c), s = await oi(t), g = await s.read(s.totalSize);
   await s.close();
-  const d = await Er(g);
+  const d = await Fr(g);
   if (d.circom_version() == 1) {
-    const C = await d.calculateBinWitness(a), l = await mc(e, "wtns", 2, 2);
-    await mr(l, C, d.prime), await l.close();
+    const C = await d.calculateBinWitness(a), l = await Lc(e, "wtns", 2, 2);
+    await Lr(l, C, d.prime), await l.close();
   } else {
-    const C = await oi(e), l = await d.calculateWTNSBin(a);
+    const C = await ii(e), l = await d.calculateWTNSBin(a);
     await C.write(l), await C.close();
   }
 }
-const { unstringifyBigInts: Sr } = dn;
-async function Ir(c, t, e, n) {
-  const a = Sr(c), s = {
+const { unstringifyBigInts: xr } = dn;
+async function Sr(c, t, e, n) {
+  const a = xr(c), s = {
     type: "mem"
   };
-  return await xr(a, t, s), await yr(e, s, n);
+  return await vr(a, t, s), await br(e, s, n);
 }
-const { unstringifyBigInts: Ra } = dn;
+const { unstringifyBigInts: Ma } = dn;
 function he(c) {
   let t = c.toString(16);
   for (; t.length < 64; )
     t = "0" + t;
   return t = `"0x${t}"`, t;
 }
-async function Or(c, t) {
-  const e = Ra(c), n = Ra(t);
+async function Ir(c, t) {
+  const e = Ma(c), n = Ma(t);
   let a = "";
   for (let g = 0; g < n.length; g++)
     a != "" && (a = a + ","), a = a + he(n[g]);
@@ -11441,7 +11441,7 @@ async function Or(c, t) {
 }
 Yt.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
 Yt.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
-var Pr = {}, Zi = {};
+var Or = {}, Gi = {};
 (function(c) {
   var t = /[|\\{}()[\]^$+*?.]/g, e = Object.prototype.hasOwnProperty, n = function(l, o) {
     return e.apply(l, [o]);
@@ -11526,19 +11526,19 @@ function encode_char(c) {
       return { __proto__: null };
     };
   }();
-})(Zi);
-const kr = "ejs", Tr = "Embedded JavaScript templates", qr = [
+})(Gi);
+const Pr = "ejs", kr = "Embedded JavaScript templates", Tr = [
   "template",
   "engine",
   "ejs"
-], Dr = "3.1.9", Mr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", Rr = "Apache-2.0", Nr = {
+], qr = "3.1.9", Dr = "Matthew Eernisse <mde@fleegix.org> (http://fleegix.org)", Mr = "Apache-2.0", Rr = {
   ejs: "./bin/cli.js"
-}, zr = "./lib/ejs.js", Ur = "ejs.min.js", jr = "ejs.min.js", $r = {
+}, Nr = "./lib/ejs.js", zr = "ejs.min.js", Ur = "ejs.min.js", jr = {
   type: "git",
   url: "git://github.com/mde/ejs.git"
-}, Gr = "https://github.com/mde/ejs/issues", Zr = "https://github.com/mde/ejs", Wr = {
+}, $r = "https://github.com/mde/ejs/issues", Gr = "https://github.com/mde/ejs", Zr = {
   jake: "^10.8.5"
-}, Xr = {
+}, Wr = {
   browserify: "^16.5.1",
   eslint: "^6.8.0",
   "git-directory-deploy": "^1.5.1",
@@ -11546,29 +11546,29 @@ const kr = "ejs", Tr = "Embedded JavaScript templates", qr = [
   "lru-cache": "^4.0.1",
   mocha: "^10.2.0",
   "uglify-js": "^3.3.16"
-}, Vr = {
+}, Xr = {
   node: ">=0.10.0"
-}, Hr = {
+}, Vr = {
   test: "mocha -u tdd"
 };
-var Qr = {
-  name: kr,
-  description: Tr,
-  keywords: qr,
-  version: Dr,
-  author: Mr,
-  license: Rr,
-  bin: Nr,
-  main: zr,
-  jsdelivr: Ur,
-  unpkg: jr,
-  repository: $r,
-  bugs: Gr,
-  homepage: Zr,
-  dependencies: Wr,
-  devDependencies: Xr,
-  engines: Vr,
-  scripts: Hr
+var Hr = {
+  name: Pr,
+  description: kr,
+  keywords: Tr,
+  version: qr,
+  author: Dr,
+  license: Mr,
+  bin: Rr,
+  main: Nr,
+  jsdelivr: zr,
+  unpkg: Ur,
+  repository: jr,
+  bugs: $r,
+  homepage: Gr,
+  dependencies: Zr,
+  devDependencies: Wr,
+  engines: Xr,
+  scripts: Vr
 };
 (function(c) {
   /**
@@ -11578,7 +11578,7 @@ var Qr = {
    * @project EJS
    * @license {@link http://www.apache.org/licenses/LICENSE-2.0 Apache License, Version 2.0}
    */
-  var t = sn(), e = bo(), n = Zi, a = !1, s = Qr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
+  var t = sn(), e = mo(), n = Gi, a = !1, s = Hr.version, g = "<", d = ">", C = "%", l = "locals", o = "ejs", y = "(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)", E = [
     "delimiter",
     "scope",
     "context",
@@ -11874,9 +11874,9 @@ try {
 `);
     }
   }, c.escapeXML = n.escapeXML, c.__express = c.renderFile, c.VERSION = s, c.name = o, typeof window < "u" && (window.ejs = c);
-})(Pr);
-var ta = { exports: {} };
-ta.exports;
+})(Or);
+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;
@@ -12316,8 +12316,8 @@ ta.exports;
       c !== null && c.exports ? c.exports = k : t.check = k;
     }
   })(en);
-})(ta);
-var ea = ta.exports, Jr = { exports: {} };
+})(Yn);
+var ta = Yn.exports, Qr = { exports: {} };
 (function(c) {
   c.exports = {
     array: "arr",
@@ -12330,28 +12330,28 @@ var ea = ta.exports, Jr = { 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`;
-})(Jr);
-$a.EventEmitter;
-const Kr = Un, Wi = Ga().Readable, Na = ea;
-Kr.inherits(cn, Wi);
-var Xi = cn;
+})(Qr);
+ja().EventEmitter;
+const Jr = zn, Zi = $a().Readable, Ra = ta;
+Jr.inherits(cn, Zi);
+var Wi = cn;
 function cn(c, t) {
-  return Na.not.instanceStrict(this, cn) ? new cn(c) : (Na.assert.function(c, "Invalid read implementation"), this._read = function() {
+  return Ra.not.instanceStrict(this, cn) ? new cn(c) : (Ra.assert.function(c, "Invalid read implementation"), this._read = function() {
     c();
-  }, Wi.call(this, t));
+  }, Zi.call(this, t));
 }
-const Yr = ea, Vi = Xi, tl = Un;
-tl.inherits(Rn, Vi);
-function Rn(c, t) {
-  return Yr.not.instanceStrict(this, Rn) ? new Rn(c, t) : Vi.call(this, c, { ...t, objectMode: !0 });
+const Kr = ta, Xi = Wi, Yr = zn;
+Yr.inherits(Mn, Xi);
+function Mn(c, t) {
+  return Kr.not.instanceStrict(this, Mn) ? new Mn(c, t) : Xi.call(this, c, { ...t, objectMode: !0 });
 }
 class _n extends Array {
   constructor(t) {
     let e, n;
-    if (!za(t))
+    if (!Na(t))
       throw new TypeError("Argument `size` must be a positive integer.");
     return super(t), this.grow = (a) => {
-      if (!za(a))
+      if (!Na(a))
         throw new TypeError("Argument `by` must be a positive integer.");
       let s;
       const g = t + a;
@@ -12365,25 +12365,25 @@ class _n extends Array {
       t = g;
     }, new Proxy(this, {
       get(a, s) {
-        return Nn(s) ? a[Ua(s, t)] : a[s];
+        return Rn(s) ? a[za(s, t)] : a[s];
       },
       set(a, s, g) {
-        return Nn(s) ? (e = Ua(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 za(c) {
-  return Nn(c) && c > 0;
+function Na(c) {
+  return Rn(c) && c > 0;
 }
-function Nn(c) {
+function Rn(c) {
   try {
     return +c % 1 === 0;
   } catch {
   }
   return !1;
 }
-function Ua(c, t) {
+function za(c, t) {
   return c === 0 ? 0 : c < 0 ? (t - Math.abs(c)) % t : c % t;
 }
 function gn() {
@@ -12396,7 +12396,7 @@ _n.prototype.unshift = gn;
 function tn(c) {
   throw new Error('Could not dynamically require "' + c + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
-var el = { exports: {} };
+var tl = { exports: {} };
 /*! jsonpath 1.1.1 */
 (function(c, t) {
   (function(e) {
@@ -13566,7 +13566,7 @@ var el = { exports: {} };
             O && S.octal && Dt(S, y.StrictOctalLiteral), N = w.createLiteral(pt());
           else if (p === g.Keyword) {
             if (Y("function"))
-              return fo();
+              return uo();
             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());
@@ -13751,65 +13751,65 @@ var el = { exports: {} };
           var p, B, N;
           return Wt("if"), vt("("), p = qt(), vt(")"), B = _e(), Y("else") ? (pt(), N = _e()) : N = null, w.createIfStatement(p, B, N);
         }
-        function Ji() {
+        function Qi() {
           var p, B, N;
           return Wt("do"), N = F.inIteration, F.inIteration = !0, p = _e(), F.inIteration = N, Wt("while"), vt("("), B = qt(), vt(")"), wt(";") && pt(), w.createDoWhileStatement(p, B);
         }
-        function Ki() {
+        function Ji() {
           var p, B, N;
           return Wt("while"), vt("("), p = qt(), vt(")"), N = F.inIteration, F.inIteration = !0, B = _e(), F.inIteration = N, w.createWhileStatement(p, B);
         }
-        function Yi() {
+        function Ki() {
           var p, B, N;
           return N = S, p = pt(), B = Ce(), w.markEnd(w.createVariableDeclaration(B, p.value), N);
         }
-        function to() {
+        function Yi() {
           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 = Yi(), F.allowIn = !0, p.declarations.length === 1 && Y("in") && (pt(), X = p, lt = qt(), p = null)) : (F.allowIn = !1, p = qt(), F.allowIn = !0, Y("in") && (Z(p) || Dt({}, y.InvalidLHSInForIn), pt(), X = p, lt = qt(), p = null)), typeof X > "u" && vt(";")), typeof X > "u" && (wt(";") || (B = qt()), vt(";"), wt(")") || (N = qt())), vt(")"), Gt = F.inIteration, F.inIteration = !0, Ct = _e(), F.inIteration = Gt, typeof X > "u" ? w.createForStatement(p, B, N, Ct) : w.createForInStatement(X, lt, Ct);
+          return p = B = N = null, Wt("for"), vt("("), wt(";") ? pt() : (Y("var") || Y("let") ? (F.allowIn = !1, p = Ki(), F.allowIn = !0, p.declarations.length === 1 && Y("in") && (pt(), X = p, lt = qt(), p = null)) : (F.allowIn = !1, p = qt(), F.allowIn = !0, Y("in") && (Z(p) || Dt({}, y.InvalidLHSInForIn), pt(), X = p, lt = qt(), p = null)), typeof X > "u" && vt(";")), typeof X > "u" && (wt(";") || (B = qt()), vt(";"), wt(")") || (N = qt())), vt(")"), Gt = F.inIteration, F.inIteration = !0, Ct = _e(), F.inIteration = Gt, typeof X > "u" ? w.createForStatement(p, B, N, Ct) : w.createForInStatement(X, lt, Ct);
         }
-        function eo() {
+        function to() {
           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 no() {
+        function eo() {
           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 ao() {
+        function no() {
           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 io() {
+        function ao() {
           var p, B;
           return O && (G(), Dt({}, y.StrictModeWith)), Wt("with"), vt("("), p = qt(), vt(")"), B = _e(), w.createWithStatement(p, B);
         }
-        function oo() {
+        function io() {
           var p, B = [], N, X;
           for (X = S, Y("default") ? (pt(), p = null) : (Wt("case"), p = qt()), vt(":"); L < U && !(wt("}") || Y("default") || Y("case")); )
             N = _e(), B.push(N);
           return w.markEnd(w.createSwitchCase(p, B), X);
         }
-        function co() {
+        function oo() {
           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 = oo(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
+            N = io(), N.test === null && (lt && Pt({}, y.MultipleDefaultsInSwitch), lt = !0), B.push(N);
           return F.inSwitch = X, vt("}"), w.createSwitchStatement(p, B);
         }
-        function so() {
+        function co() {
           var p;
           return Wt("throw"), te() && Pt({}, y.NewlineAfterThrow), p = qt(), _(), w.createThrowStatement(p);
         }
-        function ro() {
+        function so() {
           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 lo() {
+        function ro() {
           var p, B = [], N = null;
-          return Wt("try"), p = Qt(), Y("catch") && B.push(ro()), Y("finally") && (pt(), N = Qt()), B.length === 0 && !N && Pt({}, y.NoCatchOrFinally), w.createTryStatement(p, [], B, N);
+          return Wt("try"), p = Qt(), Y("catch") && B.push(so()), Y("finally") && (pt(), N = Qt()), B.length === 0 && !N && Pt({}, y.NoCatchOrFinally), w.createTryStatement(p, [], B, N);
         }
-        function uo() {
+        function lo() {
           return Wt("debugger"), _(), w.createDebuggerStatement();
         }
         function _e() {
@@ -13826,33 +13826,33 @@ var el = { exports: {} };
           if (p === g.Keyword)
             switch (S.value) {
               case "break":
-                return w.markEnd(no(), lt);
-              case "continue":
                 return w.markEnd(eo(), lt);
+              case "continue":
+                return w.markEnd(to(), lt);
               case "debugger":
-                return w.markEnd(uo(), lt);
+                return w.markEnd(lo(), lt);
               case "do":
-                return w.markEnd(Ji(), lt);
+                return w.markEnd(Qi(), lt);
               case "for":
-                return w.markEnd(to(), lt);
+                return w.markEnd(Yi(), lt);
               case "function":
-                return w.markEnd(ia(), lt);
+                return w.markEnd(aa(), lt);
               case "if":
                 return w.markEnd(Je(), lt);
               case "return":
-                return w.markEnd(ao(), lt);
+                return w.markEnd(no(), lt);
               case "switch":
-                return w.markEnd(co(), lt);
+                return w.markEnd(oo(), lt);
               case "throw":
-                return w.markEnd(so(), lt);
+                return w.markEnd(co(), lt);
               case "try":
-                return w.markEnd(lo(), lt);
+                return w.markEnd(ro(), lt);
               case "var":
                 return w.markEnd(qe(), lt);
               case "while":
-                return w.markEnd(Ki(), lt);
+                return w.markEnd(Ji(), lt);
               case "with":
-                return w.markEnd(io(), lt);
+                return w.markEnd(ao(), lt);
             }
           return B = qt(), B.type === l.Identifier && wt(":") ? (pt(), X = "$" + B.name, Object.prototype.hasOwnProperty.call(F.labelSet, X) && Pt({}, y.Redeclaration, "Label", B.name), F.labelSet[X] = !0, N = _e(), delete F.labelSet[X], w.markEnd(w.createLabeledStatement(B, N), lt)) : (_(), w.markEnd(w.createExpressionStatement(B), lt));
         }
@@ -13864,7 +13864,7 @@ var el = { exports: {} };
             B.push(p);
           return vt("}"), F.labelSet = Ct, F.inIteration = Gt, F.inSwitch = Xt, F.inFunctionBody = oe, w.markEnd(w.createBlockStatement(B), ae);
         }
-        function aa(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(")")); )
@@ -13876,13 +13876,13 @@ var el = { exports: {} };
             message: Xt
           };
         }
-        function ia() {
+        function aa() {
           var p, B = [], N, X, lt, Ct, Gt, Xt, oe, ae;
-          return ae = S, Wt("function"), X = S, p = Kt(), O ? J(X.value) && Dt(X, y.StrictFunctionName) : J(X.value) ? (Gt = X, Xt = y.StrictFunctionName) : nt(X.value) && (Gt = X, Xt = y.StrictReservedWord), Ct = aa(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), oe = O, N = hn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = oe, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
+          return ae = S, Wt("function"), X = S, p = Kt(), O ? J(X.value) && Dt(X, y.StrictFunctionName) : J(X.value) ? (Gt = X, Xt = y.StrictFunctionName) : nt(X.value) && (Gt = X, Xt = y.StrictReservedWord), Ct = na(Gt), B = Ct.params, lt = Ct.stricted, Gt = Ct.firstRestricted, Ct.message && (Xt = Ct.message), oe = O, N = hn(), O && Gt && Pt(Gt, Xt), O && lt && Dt(lt, Xt), O = oe, w.markEnd(w.createFunctionDeclaration(p, B, [], N), ae);
         }
-        function fo() {
+        function uo() {
           var p, B = null, N, X, lt, Ct, Gt = [], Xt, oe, ae;
-          return ae = S, Wt("function"), wt("(") || (p = S, B = Kt(), O ? J(p.value) && Dt(p, y.StrictFunctionName) : J(p.value) ? (X = p, lt = y.StrictFunctionName) : nt(p.value) && (X = p, lt = y.StrictReservedWord)), Ct = aa(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), oe = O, Xt = hn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = oe, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
+          return ae = S, Wt("function"), wt("(") || (p = S, B = Kt(), O ? J(p.value) && Dt(p, y.StrictFunctionName) : J(p.value) ? (X = p, lt = y.StrictFunctionName) : nt(p.value) && (X = p, lt = y.StrictReservedWord)), Ct = na(X), Gt = Ct.params, N = Ct.stricted, X = Ct.firstRestricted, Ct.message && (lt = Ct.message), oe = O, Xt = hn(), O && X && Pt(X, lt), O && N && Dt(N, lt), O = oe, w.markEnd(w.createFunctionExpression(B, Gt, [], Xt), ae);
         }
         function De() {
           if (S.type === g.Keyword)
@@ -13891,25 +13891,25 @@ var el = { exports: {} };
               case "let":
                 return pn(S.value);
               case "function":
-                return ia();
+                return aa();
               default:
                 return _e();
             }
           if (S.type !== g.EOF)
             return _e();
         }
-        function _o() {
+        function fo() {
           for (var p, B = [], N, X, lt; L < U && (N = S, !(N.type !== g.StringLiteral || (p = De(), B.push(p), p.expression.type !== l.Literal))); )
             X = x.slice(N.start + 1, N.end - 1), X === "use strict" ? (O = !0, lt && Dt(lt, y.StrictOctalLiteral)) : !lt && N.octal && (lt = N);
           for (; L < U && (p = De(), !(typeof p > "u")); )
             B.push(p);
           return B;
         }
-        function go() {
+        function _o() {
           var p, B;
-          return G(), $t(), B = S, O = !1, p = _o(), w.markEnd(w.createProgram(p), B);
+          return G(), $t(), B = S, O = !1, p = fo(), w.markEnd(w.createProgram(p), B);
         }
-        function oa() {
+        function ia() {
           var p, B, N, X = [];
           for (p = 0; p < r.tokens.length; ++p)
             B = r.tokens[p], N = {
@@ -13918,7 +13918,7 @@ var el = { exports: {} };
             }, r.range && (N.range = B.range), r.loc && (N.loc = B.loc), X.push(N);
           r.tokens = X;
         }
-        function po(p, B) {
+        function go(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,
@@ -13941,7 +13941,7 @@ var el = { exports: {} };
                 } else
                   throw Ct;
               }
-            oa(), 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 {
@@ -13949,7 +13949,7 @@ var el = { exports: {} };
           }
           return lt;
         }
-        function ho(p, B) {
+        function po(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,
@@ -13960,7 +13960,7 @@ var el = { 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 = go(), typeof r.comments < "u" && (N.comments = r.comments), typeof r.tokens < "u" && (oa(), N.tokens = r.tokens), typeof r.errors < "u" && (N.errors = r.errors);
+            N = _o(), 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 {
@@ -13968,7 +13968,7 @@ var el = { exports: {} };
           }
           return N;
         }
-        s.version = "1.2.2", s.tokenize = po, s.parse = ho, s.Syntax = function() {
+        s.version = "1.2.2", s.tokenize = go, s.parse = po, s.Syntax = function() {
           var p, B = {};
           typeof Object.create == "function" && (B = /* @__PURE__ */ Object.create(null));
           for (p in l)
@@ -15564,17 +15564,17 @@ Expecting ` + ft.join(", ") + ", got '" + (this.terminals_[T] || T) + "'" : at =
       n.exports = e("./lib/index");
     }, { "./lib/index": 5 }] }, {}, ["jsonpath"])("jsonpath");
   });
-})(el);
-Ga();
+})(tl);
+$a();
 sn();
-$a.EventEmitter;
-const nl = ea, Hi = Xi, al = Un;
-al.inherits(zn, Hi);
-function zn(c, t) {
-  return nl.not.instanceStrict(this, zn) ? new zn(c, t) : Hi.call(this, c, { ...t, encoding: "utf8" });
-}
-var na = { exports: {} };
-na.exports;
+ja().EventEmitter;
+const el = ta, Vi = Wi, nl = zn;
+nl.inherits(Nn, Vi);
+function Nn(c, t) {
+  return el.not.instanceStrict(this, Nn) ? new Nn(c, t) : Vi.call(this, c, { ...t, encoding: "utf8" });
+}
+var ea = { exports: {} };
+ea.exports;
 (function(c) {
   (function(t) {
     c !== null ? c.exports = e : t.tryer = e;
@@ -15651,36 +15651,27 @@ na.exports;
       setTimeout(I, Math.abs(v));
     }
   })(en);
-})(na);
-na.exports;
+})(ea);
+ea.exports;
 sn();
-const il = typeof Se < "u" && Se.versions != null && Se.versions.node != null, xn = (
+typeof Se < "u" && Se.versions != null && Se.versions.node != null;
+const al = (
   // @ts-expect-error webpack check is done like this
   typeof __webpack_require__ < "u"
-), Qi = new yo(), ol = 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: xn }), console.log({ wasmFilePath: e }), il) {
-    g && !xn ? (C = `test/circuits/${e}`, l = `test/circuits/${n}`) : xn && (C = `libs/hardhat/test/circuits/${e}`, l = `libs/hardhat/test/circuits/${n}`);
-    const o = require("path");
-    C = o.resolve(C), l = o.resolve(l);
-  }
-  console.log({ wasmFullFilePath: C });
+), Hi = new bo(), il = async (c) => {
+  const { input: t, wasmFilePath: e, zKeyFilePath: n, chainId: a } = c.payload.data;
+  c.metadata;
+  let s = e, g = n;
+  console.log({ isWebpack: al }), console.log({ wasmFilePath: e }), console.log({ wasmFullFilePath: s });
   try {
-    const { proof: o, publicSignals: y } = await Ir(t, C, l), E = await Or(o, y), m = JSON.parse(`[${E}]`);
-    Qi.postMessageToMainThread({ zkCallData: m, proof: o, publicSignals: y });
-  } catch (o) {
-    console.log(o);
+    const { proof: d, publicSignals: C } = await Sr(t, s, g), l = await Ir(d, C), o = JSON.parse(`[${l}]`);
+    Hi.postMessageToMainThread({ zkCallData: o, proof: d, publicSignals: C });
+  } catch (d) {
+    console.log(d);
   }
 };
-Qi.attachWorkerSideOnMessage(ol);
+Hi.attachWorkerSideOnMessage(il);
 export {
-  Qi as default,
-  ol as onWorkerMessage
+  Hi as default,
+  il as onWorkerMessage
 };