@hinkal/common 0.0.116 → 0.0.118

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/scrypt-js/scrypt.mjs

@@ -0,0 +1,298 @@
+import { getDefaultExportFromCjs as Q } from "../../../../../../../_virtual/_commonjsHelpers.mjs";
+import { __module as q } from "../../../../../../../_virtual/scrypt.mjs";
+(function(z, C) {
+  (function(B) {
+    function S(e) {
+      const f = new Uint32Array([
+        1116352408,
+        1899447441,
+        3049323471,
+        3921009573,
+        961987163,
+        1508970993,
+        2453635748,
+        2870763221,
+        3624381080,
+        310598401,
+        607225278,
+        1426881987,
+        1925078388,
+        2162078206,
+        2614888103,
+        3248222580,
+        3835390401,
+        4022224774,
+        264347078,
+        604807628,
+        770255983,
+        1249150122,
+        1555081692,
+        1996064986,
+        2554220882,
+        2821834349,
+        2952996808,
+        3210313671,
+        3336571891,
+        3584528711,
+        113926993,
+        338241895,
+        666307205,
+        773529912,
+        1294757372,
+        1396182291,
+        1695183700,
+        1986661051,
+        2177026350,
+        2456956037,
+        2730485921,
+        2820302411,
+        3259730800,
+        3345764771,
+        3516065817,
+        3600352804,
+        4094571909,
+        275423344,
+        430227734,
+        506948616,
+        659060556,
+        883997877,
+        958139571,
+        1322822218,
+        1537002063,
+        1747873779,
+        1955562222,
+        2024104815,
+        2227730452,
+        2361852424,
+        2428436474,
+        2756734187,
+        3204031479,
+        3329325298
+      ]);
+      let t = 1779033703, c = 3144134277, r = 1013904242, i = 2773480762, n = 1359893119, a = 2600822924, h = 528734635, s = 1541459225;
+      const w = new Uint32Array(64);
+      function y(U) {
+        let P = 0, m = U.length;
+        for (; m >= 64; ) {
+          let d = t, _ = c, M = r, j = i, u = n, g = a, l = h, V = s, p, b, v, O, F;
+          for (b = 0; b < 16; b++)
+            v = P + b * 4, w[b] = (U[v] & 255) << 24 | (U[v + 1] & 255) << 16 | (U[v + 2] & 255) << 8 | U[v + 3] & 255;
+          for (b = 16; b < 64; b++)
+            p = w[b - 2], O = (p >>> 17 | p << 15) ^ (p >>> 19 | p << 13) ^ p >>> 10, p = w[b - 15], F = (p >>> 7 | p << 25) ^ (p >>> 18 | p << 14) ^ p >>> 3, w[b] = (O + w[b - 7] | 0) + (F + w[b - 16] | 0) | 0;
+          for (b = 0; b < 64; b++)
+            O = (((u >>> 6 | u << 26) ^ (u >>> 11 | u << 21) ^ (u >>> 25 | u << 7)) + (u & g ^ ~u & l) | 0) + (V + (f[b] + w[b] | 0) | 0) | 0, F = ((d >>> 2 | d << 30) ^ (d >>> 13 | d << 19) ^ (d >>> 22 | d << 10)) + (d & _ ^ d & M ^ _ & M) | 0, V = l, l = g, g = u, u = j + O | 0, j = M, M = _, _ = d, d = O + F | 0;
+          t = t + d | 0, c = c + _ | 0, r = r + M | 0, i = i + j | 0, n = n + u | 0, a = a + g | 0, h = h + l | 0, s = s + V | 0, P += 64, m -= 64;
+        }
+      }
+      y(e);
+      let I, H = e.length % 64, E = e.length / 536870912 | 0, A = e.length << 3, L = H < 56 ? 56 : 120, x = e.slice(e.length - H, e.length);
+      for (x.push(128), I = H + 1; I < L; I++)
+        x.push(0);
+      return x.push(E >>> 24 & 255), x.push(E >>> 16 & 255), x.push(E >>> 8 & 255), x.push(E >>> 0 & 255), x.push(A >>> 24 & 255), x.push(A >>> 16 & 255), x.push(A >>> 8 & 255), x.push(A >>> 0 & 255), y(x), [
+        t >>> 24 & 255,
+        t >>> 16 & 255,
+        t >>> 8 & 255,
+        t >>> 0 & 255,
+        c >>> 24 & 255,
+        c >>> 16 & 255,
+        c >>> 8 & 255,
+        c >>> 0 & 255,
+        r >>> 24 & 255,
+        r >>> 16 & 255,
+        r >>> 8 & 255,
+        r >>> 0 & 255,
+        i >>> 24 & 255,
+        i >>> 16 & 255,
+        i >>> 8 & 255,
+        i >>> 0 & 255,
+        n >>> 24 & 255,
+        n >>> 16 & 255,
+        n >>> 8 & 255,
+        n >>> 0 & 255,
+        a >>> 24 & 255,
+        a >>> 16 & 255,
+        a >>> 8 & 255,
+        a >>> 0 & 255,
+        h >>> 24 & 255,
+        h >>> 16 & 255,
+        h >>> 8 & 255,
+        h >>> 0 & 255,
+        s >>> 24 & 255,
+        s >>> 16 & 255,
+        s >>> 8 & 255,
+        s >>> 0 & 255
+      ];
+    }
+    function T(e, f, t) {
+      e = e.length <= 64 ? e : S(e);
+      const c = 64 + f.length + 4, r = new Array(c), i = new Array(64);
+      let n, a = [];
+      for (n = 0; n < 64; n++)
+        r[n] = 54;
+      for (n = 0; n < e.length; n++)
+        r[n] ^= e[n];
+      for (n = 0; n < f.length; n++)
+        r[64 + n] = f[n];
+      for (n = c - 4; n < c; n++)
+        r[n] = 0;
+      for (n = 0; n < 64; n++)
+        i[n] = 92;
+      for (n = 0; n < e.length; n++)
+        i[n] ^= e[n];
+      function h() {
+        for (let s = c - 1; s >= c - 4; s--) {
+          if (r[s]++, r[s] <= 255)
+            return;
+          r[s] = 0;
+        }
+      }
+      for (; t >= 32; )
+        h(), a = a.concat(S(i.concat(S(r)))), t -= 32;
+      return t > 0 && (h(), a = a.concat(S(i.concat(S(r))).slice(0, t))), a;
+    }
+    function X(e, f, t, c, r) {
+      let i;
+      for (K(e, (2 * t - 1) * 16, r, 0, 16), i = 0; i < 2 * t; i++)
+        R(e, i * 16, r, 16), G(r, c), K(r, 0, e, f + i * 16, 16);
+      for (i = 0; i < t; i++)
+        K(e, f + i * 2 * 16, e, i * 16, 16);
+      for (i = 0; i < t; i++)
+        K(e, f + (i * 2 + 1) * 16, e, (i + t) * 16, 16);
+    }
+    function o(e, f) {
+      return e << f | e >>> 32 - f;
+    }
+    function G(e, f) {
+      K(e, 0, f, 0, 16);
+      for (let t = 8; t > 0; t -= 2)
+        f[4] ^= o(f[0] + f[12], 7), f[8] ^= o(f[4] + f[0], 9), f[12] ^= o(f[8] + f[4], 13), f[0] ^= o(f[12] + f[8], 18), f[9] ^= o(f[5] + f[1], 7), f[13] ^= o(f[9] + f[5], 9), f[1] ^= o(f[13] + f[9], 13), f[5] ^= o(f[1] + f[13], 18), f[14] ^= o(f[10] + f[6], 7), f[2] ^= o(f[14] + f[10], 9), f[6] ^= o(f[2] + f[14], 13), f[10] ^= o(f[6] + f[2], 18), f[3] ^= o(f[15] + f[11], 7), f[7] ^= o(f[3] + f[15], 9), f[11] ^= o(f[7] + f[3], 13), f[15] ^= o(f[11] + f[7], 18), f[1] ^= o(f[0] + f[3], 7), f[2] ^= o(f[1] + f[0], 9), f[3] ^= o(f[2] + f[1], 13), f[0] ^= o(f[3] + f[2], 18), f[6] ^= o(f[5] + f[4], 7), f[7] ^= o(f[6] + f[5], 9), f[4] ^= o(f[7] + f[6], 13), f[5] ^= o(f[4] + f[7], 18), f[11] ^= o(f[10] + f[9], 7), f[8] ^= o(f[11] + f[10], 9), f[9] ^= o(f[8] + f[11], 13), f[10] ^= o(f[9] + f[8], 18), f[12] ^= o(f[15] + f[14], 7), f[13] ^= o(f[12] + f[15], 9), f[14] ^= o(f[13] + f[12], 13), f[15] ^= o(f[14] + f[13], 18);
+      for (let t = 0; t < 16; ++t)
+        e[t] += f[t];
+    }
+    function R(e, f, t, c) {
+      for (let r = 0; r < c; r++)
+        t[r] ^= e[f + r];
+    }
+    function K(e, f, t, c, r) {
+      for (; r--; )
+        t[c++] = e[f++];
+    }
+    function Z(e) {
+      if (!e || typeof e.length != "number")
+        return !1;
+      for (let f = 0; f < e.length; f++) {
+        const t = e[f];
+        if (typeof t != "number" || t % 1 || t < 0 || t >= 256)
+          return !1;
+      }
+      return !0;
+    }
+    function D(e, f) {
+      if (typeof e != "number" || e % 1)
+        throw new Error("invalid " + f);
+      return e;
+    }
+    function $(e, f, t, c, r, i, n) {
+      if (t = D(t, "N"), c = D(c, "r"), r = D(r, "p"), i = D(i, "dkLen"), t === 0 || t & t - 1)
+        throw new Error("N must be power of 2");
+      if (t > 2147483647 / 128 / c)
+        throw new Error("N too large");
+      if (c > 2147483647 / 128 / r)
+        throw new Error("r too large");
+      if (!Z(e))
+        throw new Error("password must be an array or buffer");
+      if (e = Array.prototype.slice.call(e), !Z(f))
+        throw new Error("salt must be an array or buffer");
+      f = Array.prototype.slice.call(f);
+      let a = T(e, f, r * 128 * c);
+      const h = new Uint32Array(r * 32 * c);
+      for (let u = 0; u < h.length; u++) {
+        const g = u * 4;
+        h[u] = (a[g + 3] & 255) << 24 | (a[g + 2] & 255) << 16 | (a[g + 1] & 255) << 8 | (a[g + 0] & 255) << 0;
+      }
+      const s = new Uint32Array(64 * c), w = new Uint32Array(32 * c * t), y = 32 * c, I = new Uint32Array(16), H = new Uint32Array(16), E = r * t * 2;
+      let A = 0, L = null, x = !1, U = 0, P = 0, m, d;
+      const _ = n ? parseInt(1e3 / c) : 4294967295, M = typeof setImmediate < "u" ? setImmediate : setTimeout, j = function() {
+        if (x)
+          return n(new Error("cancelled"), A / E);
+        let u;
+        switch (U) {
+          case 0:
+            d = P * 32 * c, K(h, d, s, 0, y), U = 1, m = 0;
+          case 1:
+            u = t - m, u > _ && (u = _);
+            for (let l = 0; l < u; l++)
+              K(s, 0, w, (m + l) * y, y), X(s, y, c, I, H);
+            if (m += u, A += u, n) {
+              const l = parseInt(1e3 * A / E);
+              if (l !== L) {
+                if (x = n(null, A / E), x)
+                  break;
+                L = l;
+              }
+            }
+            if (m < t)
+              break;
+            m = 0, U = 2;
+          case 2:
+            u = t - m, u > _ && (u = _);
+            for (let l = 0; l < u; l++) {
+              const V = (2 * c - 1) * 16, p = s[V] & t - 1;
+              R(w, p * y, s, y), X(s, y, c, I, H);
+            }
+            if (m += u, A += u, n) {
+              const l = parseInt(1e3 * A / E);
+              if (l !== L) {
+                if (x = n(null, A / E), x)
+                  break;
+                L = l;
+              }
+            }
+            if (m < t)
+              break;
+            if (K(s, 0, h, d, y), P++, P < r) {
+              U = 0;
+              break;
+            }
+            a = [];
+            for (let l = 0; l < h.length; l++)
+              a.push(h[l] >> 0 & 255), a.push(h[l] >> 8 & 255), a.push(h[l] >> 16 & 255), a.push(h[l] >> 24 & 255);
+            const g = T(e, a, i);
+            return n && n(null, 1, g), g;
+        }
+        n && M(j);
+      };
+      if (!n)
+        for (; ; ) {
+          const u = j();
+          if (u != null)
+            return u;
+        }
+      j();
+    }
+    const J = {
+      scrypt: function(e, f, t, c, r, i, n) {
+        return new Promise(function(a, h) {
+          let s = 0;
+          n && n(0), $(e, f, t, c, r, i, function(w, y, I) {
+            if (w)
+              h(w);
+            else if (I)
+              n && s !== 1 && n(1), a(new Uint8Array(I));
+            else if (n && y !== s)
+              return s = y, n(y);
+          });
+        });
+      },
+      syncScrypt: function(e, f, t, c, r, i) {
+        return new Uint8Array($(e, f, t, c, r, i));
+      }
+    };
+    z.exports = J;
+  })();
+})(q);
+var W = q.exports;
+const f0 = /* @__PURE__ */ Q(W);
+export {
+  f0 as default
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/set-function-length/index.mjs

@@ -0,0 +1,32 @@
+import { g as u } from "../get-intrinsic/index.mjs";
+import { d as p } from "../define-data-property/index.mjs";
+import { h as g } from "../has-property-descriptors/index.mjs";
+import { g as m } from "../gopd/index.mjs";
+import { t as v } from "../es-errors/type.mjs";
+var h = u, a = p, l = g(), n = m, s = v, F = h("%Math.floor%"), L = function(t, r) {
+  if (typeof t != "function")
+    throw new s("`fn` is not a function");
+  if (typeof r != "number" || r < 0 || r > 4294967295 || F(r) !== r)
+    throw new s("`length` must be a positive 32-bit integer");
+  var f = arguments.length > 2 && !!arguments[2], o = !0, i = !0;
+  if ("length" in t && n) {
+    var e = n(t, "length");
+    e && !e.configurable && (o = !1), e && !e.writable && (i = !1);
+  }
+  return (o || i || !f) && (l ? a(
+    /** @type {Parameters<define>[0]} */
+    t,
+    "length",
+    r,
+    !0,
+    !0
+  ) : a(
+    /** @type {Parameters<define>[0]} */
+    t,
+    "length",
+    r
+  )), t;
+};
+export {
+  L as s
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/shallow-clone/index.mjs

@@ -0,0 +1,66 @@
+import { k as c } from "../kind-of/index.mjs";
+/*!
+ * shallow-clone <https://github.com/jonschlinkert/shallow-clone>
+ *
+ * Copyright (c) 2015-present, Jon Schlinkert.
+ * Released under the MIT License.
+ */
+const t = Symbol.prototype.valueOf, s = c;
+function o(e, r) {
+  switch (s(e)) {
+    case "array":
+      return e.slice();
+    case "object":
+      return Object.assign({}, e);
+    case "date":
+      return new e.constructor(Number(e));
+    case "map":
+      return new Map(e);
+    case "set":
+      return new Set(e);
+    case "buffer":
+      return y(e);
+    case "symbol":
+      return i(e);
+    case "arraybuffer":
+      return u(e);
+    case "float32array":
+    case "float64array":
+    case "int16array":
+    case "int32array":
+    case "int8array":
+    case "uint16array":
+    case "uint32array":
+    case "uint8clampedarray":
+    case "uint8array":
+      return f(e);
+    case "regexp":
+      return a(e);
+    case "error":
+      return Object.create(e);
+    default:
+      return e;
+  }
+}
+function a(e) {
+  const r = e.flags !== void 0 ? e.flags : /\w+$/.exec(e) || void 0, n = new e.constructor(e.source, r);
+  return n.lastIndex = e.lastIndex, n;
+}
+function u(e) {
+  const r = new e.constructor(e.byteLength);
+  return new Uint8Array(r).set(new Uint8Array(e)), r;
+}
+function f(e, r) {
+  return new e.constructor(e.buffer, e.byteOffset, e.length);
+}
+function y(e) {
+  const r = e.length, n = Buffer.allocUnsafe ? Buffer.allocUnsafe(r) : Buffer.from(r);
+  return e.copy(n), n;
+}
+function i(e) {
+  return t ? Object(t.call(e)) : {};
+}
+var p = o;
+export {
+  p as s
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/curves.mjs

@@ -0,0 +1,19 @@
+import { Scalar as f } from "../../ffjavascript/main.mjs";
+import r from "../../ffjavascript/src/bn128.mjs";
+import b from "../../ffjavascript/src/bls12381.mjs";
+f.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
+f.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");
+const t = f.e("1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab", 16), o = f.e("21888242871839275222246405745257275088696311157297823662689037894645226208583");
+async function l(e) {
+  let a;
+  if (f.eq(e, o))
+    a = await r();
+  else if (f.eq(e, t))
+    a = await b();
+  else
+    throw new Error(`Curve not supported: ${f.toString(e)}`);
+  return a;
+}
+export {
+  l as getCurveFromQ
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/fflonk.mjs

@@ -0,0 +1,4 @@
+const E = 2;
+export {
+  E as ZKEY_FF_HEADER_SECTION
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/groth16_exportsoliditycalldata.mjs

@@ -0,0 +1,19 @@
+import { utils as $ } from "../../ffjavascript/main.mjs";
+const { unstringifyBigInts: s } = $;
+function t(p) {
+  let i = p.toString(16);
+  for (; i.length < 64; )
+    i = "0" + i;
+  return i = `"0x${i}"`, i;
+}
+async function a(p, i) {
+  const n = s(p), l = s(i);
+  let o = "";
+  for (let r = 0; r < l.length; r++)
+    o != "" && (o = o + ","), o = o + t(l[r]);
+  let e;
+  return e = `[${t(n.pi_a[0])}, ${t(n.pi_a[1])}],[[${t(n.pi_b[0][1])}, ${t(n.pi_b[0][0])}],[${t(n.pi_b[1][1])}, ${t(n.pi_b[1][0])}]],[${t(n.pi_c[0])}, ${t(n.pi_c[1])}],[${o}]`, e;
+}
+export {
+  a as default
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/groth16_fullprove.mjs

@@ -0,0 +1,13 @@
+import a from "./groth16_prove.mjs";
+import e from "./wtns_calculate.mjs";
+import { utils as m } from "../../ffjavascript/main.mjs";
+const { unstringifyBigInts: u } = m;
+async function p(o, r, n, i) {
+  const s = u(o), t = {
+    type: "mem"
+  };
+  return await e(s, r, t), await a(n, t, i);
+}
+export {
+  p as default
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/groth16_prove.mjs

@@ -0,0 +1,96 @@
+import { readBinFile as S, readSection as h } from "../../@iden3/binfileutils/src/binfileutils.mjs";
+import { readHeader as X } from "./zkey_utils.mjs";
+import { readHeader as J } from "./wtns_utils.mjs";
+import "./curves.mjs";
+import { log2 as Q } from "./misc.mjs";
+import { Scalar as P, utils as D } from "../../ffjavascript/main.mjs";
+import F from "../../ffjavascript/src/bigbuffer.mjs";
+const { stringifyBigInts: k } = D;
+async function ot(b, m, t) {
+  const { fd: w, sections: _ } = await S(m, "wtns", 2, 33554432, 8388608), n = await J(w, _), { fd: r, sections: u } = await S(b, "zkey", 2, 1 << 25, 1 << 23), a = await X(r, u);
+  if (a.protocol != "groth16")
+    throw new Error("zkey file is not groth16");
+  if (!P.eq(a.r, n.q))
+    throw new Error("Curve of the witness does not match the curve of the proving key");
+  if (n.nWitness != a.nVars)
+    throw new Error(`Invalid witness length. Circuit: ${a.nVars}, witness: ${n.nWitness}`);
+  const o = a.curve, s = o.Fr, e = o.G1, f = o.G2, c = Q(a.domainSize);
+  t && t.debug("Reading Wtns");
+  const d = await h(w, _, 2);
+  t && t.debug("Reading Coeffs");
+  const p = await h(r, u, 4);
+  t && t.debug("Building ABC");
+  const [A, l, C] = await Y(o, a, d, p, t), E = c == s.s ? o.Fr.shift : o.Fr.w[c + 1], x = await s.ifft(A, "", "", t, "IFFT_A"), G = await s.batchApplyKey(x, s.e(1), E), H = await s.fft(G, "", "", t, "FFT_A"), $ = await s.ifft(l, "", "", t, "IFFT_B"), I = await s.batchApplyKey($, s.e(1), E), K = await s.fft(I, "", "", t, "FFT_B"), R = await s.ifft(C, "", "", t, "IFFT_C"), O = await s.batchApplyKey(R, s.e(1), E), U = await s.fft(O, "", "", t, "FFT_C");
+  t && t.debug("Join ABC");
+  const M = await g(o, a, H, K, U, t);
+  let i = {};
+  t && t.debug("Reading A Points");
+  const W = await h(r, u, 5);
+  i.pi_a = await o.G1.multiExpAffine(W, d, t, "multiexp A"), t && t.debug("Reading B1 Points");
+  const j = await h(r, u, 6);
+  let B = await o.G1.multiExpAffine(j, d, t, "multiexp B1");
+  t && t.debug("Reading B2 Points");
+  const z = await h(r, u, 7);
+  i.pi_b = await o.G2.multiExpAffine(z, d, t, "multiexp B2"), t && t.debug("Reading C Points");
+  const N = await h(r, u, 8);
+  i.pi_c = await o.G1.multiExpAffine(N, d.slice((a.nPublic + 1) * o.Fr.n8), t, "multiexp C"), t && t.debug("Reading H Points");
+  const Z = await h(r, u, 9), q = await o.G1.multiExpAffine(Z, M, t, "multiexp H"), T = o.Fr.random(), v = o.Fr.random();
+  i.pi_a = e.add(i.pi_a, a.vk_alpha_1), i.pi_a = e.add(i.pi_a, e.timesFr(a.vk_delta_1, T)), i.pi_b = f.add(i.pi_b, a.vk_beta_2), i.pi_b = f.add(i.pi_b, f.timesFr(a.vk_delta_2, v)), B = e.add(B, a.vk_beta_1), B = e.add(B, e.timesFr(a.vk_delta_1, v)), i.pi_c = e.add(i.pi_c, q), i.pi_c = e.add(i.pi_c, e.timesFr(i.pi_a, v)), i.pi_c = e.add(i.pi_c, e.timesFr(B, T)), i.pi_c = e.add(i.pi_c, e.timesFr(a.vk_delta_1, s.neg(s.mul(T, v))));
+  let y = [];
+  for (let L = 1; L <= a.nPublic; L++) {
+    const V = d.slice(L * s.n8, L * s.n8 + s.n8);
+    y.push(P.fromRprLE(V));
+  }
+  return i.pi_a = e.toObject(e.toAffine(i.pi_a)), i.pi_b = f.toObject(f.toAffine(i.pi_b)), i.pi_c = e.toObject(e.toAffine(i.pi_c)), i.protocol = "groth16", i.curve = o.name, await r.close(), await w.close(), i = k(i), y = k(y), { proof: i, publicSignals: y };
+}
+async function Y(b, m, t, w, _) {
+  const n = b.Fr.n8, r = 4 * 3 + m.n8r, u = (w.byteLength - 4) / r, a = new F(m.domainSize * n), o = new F(m.domainSize * n), s = new F(m.domainSize * n), e = [a, o];
+  for (let f = 0; f < u; f++) {
+    _ && f % 1e6 == 0 && _.debug(`QAP AB: ${f}/${u}`);
+    const c = w.slice(4 + f * r, 4 + f * r + r), d = new DataView(c.buffer), p = d.getUint32(0, !0), A = d.getUint32(4, !0), l = d.getUint32(8, !0), C = c.slice(12, 12 + n);
+    e[p].set(
+      b.Fr.add(
+        e[p].slice(A * n, A * n + n),
+        b.Fr.mul(C, t.slice(l * n, l * n + n))
+      ),
+      A * n
+    );
+  }
+  for (let f = 0; f < m.domainSize; f++)
+    _ && f % 1e6 == 0 && _.debug(`QAP C: ${f}/${m.domainSize}`), s.set(
+      b.Fr.mul(
+        a.slice(f * n, f * n + n),
+        o.slice(f * n, f * n + n)
+      ),
+      f * n
+    );
+  return [a, o, s];
+}
+async function g(b, m, t, w, _, n) {
+  const u = b.Fr.n8, a = Math.floor(t.byteLength / b.Fr.n8), o = [];
+  for (let c = 0; c < a; c += 4194304) {
+    n && n.debug(`JoinABC: ${c}/${a}`);
+    const d = Math.min(a - c, 4194304), p = [], A = t.slice(c * u, (c + d) * u), l = w.slice(c * u, (c + d) * u), C = _.slice(c * u, (c + d) * u);
+    p.push({ cmd: "ALLOCSET", var: 0, buff: A }), p.push({ cmd: "ALLOCSET", var: 1, buff: l }), p.push({ cmd: "ALLOCSET", var: 2, buff: C }), p.push({ cmd: "ALLOC", var: 3, len: d * u }), p.push({ cmd: "CALL", fnName: "qap_joinABC", params: [
+      { var: 0 },
+      { var: 1 },
+      { var: 2 },
+      { val: d },
+      { var: 3 }
+    ] }), p.push({ cmd: "CALL", fnName: "frm_batchFromMontgomery", params: [
+      { var: 3 },
+      { val: d },
+      { var: 3 }
+    ] }), p.push({ cmd: "GET", out: 0, var: 3, len: d * u }), o.push(b.tm.queueAction(p));
+  }
+  const s = await Promise.all(o);
+  let e;
+  t instanceof F ? e = new F(t.byteLength) : e = new Uint8Array(t.byteLength);
+  let f = 0;
+  for (let c = 0; c < s.length; c++)
+    e.set(s[c][0], f), f += s[c][0].byteLength;
+  return e;
+}
+export {
+  ot as default
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/misc.mjs

@@ -0,0 +1,12 @@
+import "../../blake2b-wasm/index.mjs";
+import "../../ffjavascript/src/scalar.mjs";
+import "../../ffjavascript/src/bn128.mjs";
+import "../../ffjavascript/src/bls12381.mjs";
+import "../../ffjavascript/src/utils.mjs";
+import "../../ffjavascript/src/curves.mjs";
+function i(F) {
+  return (F & 4294901760 ? (F &= 4294901760, 16) : 0) | (F & 4278255360 ? (F &= 4278255360, 8) : 0) | (F & 4042322160 ? (F &= 4042322160, 4) : 0) | (F & 3435973836 ? (F &= 3435973836, 2) : 0) | (F & 2863311530) !== 0;
+}
+export {
+  i as log2
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/r1cs_info.mjs

@@ -0,0 +1,6 @@
+import { Scalar as f } from "../../ffjavascript/main.mjs";
+import "../../@iden3/binfileutils/node_modules/ffjavascript/build/browser.esm.mjs";
+import "../../fastfile/src/memfile.mjs";
+import "../../fastfile/src/bigmemfile.mjs";
+f.e("73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001", 16);
+f.e("21888242871839275222246405745257275088548364400416034343698204186575808495617");

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/wtns_calculate.mjs

@@ -0,0 +1,21 @@
+import { readExisting as w, createOverride as l } from "../../fastfile/src/fastfile.mjs";
+import m from "../../circom_runtime/js/witness_calculator.mjs";
+import { writeBin as f } from "./wtns_utils.mjs";
+import { createBinFile as p } from "../../@iden3/binfileutils/src/binfileutils.mjs";
+import { utils as u } from "../../ffjavascript/main.mjs";
+const { unstringifyBigInts: d } = u;
+async function S(c, e, s, B) {
+  const n = d(c), o = await w(e), r = await o.read(o.totalSize);
+  await o.close();
+  const t = await m(r);
+  if (t.circom_version() == 1) {
+    const i = await t.calculateBinWitness(n), a = await p(s, "wtns", 2, 2);
+    await f(a, i, t.prime), await a.close();
+  } else {
+    const i = await l(s), a = await t.calculateWTNSBin(n);
+    await i.write(a), await i.close();
+  }
+}
+export {
+  S as default
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/wtns_utils.mjs

@@ -0,0 +1,18 @@
+import { Scalar as w } from "../../ffjavascript/main.mjs";
+import { startWriteSection as n, writeBigInt as c, endWriteSection as r, startReadUniqueSection as s, readBigInt as L, endReadSection as g } from "../../@iden3/binfileutils/src/binfileutils.mjs";
+async function S(t, i, e) {
+  await n(t, 1);
+  const a = (Math.floor((w.bitLength(e) - 1) / 64) + 1) * 8;
+  if (await t.writeULE32(a), await c(t, e, a), i.byteLength % a != 0)
+    throw new Error("Invalid witness length");
+  await t.writeULE32(i.byteLength / a), await r(t), await n(t, 2), await t.write(i), await r(t);
+}
+async function U(t, i) {
+  await s(t, i, 1);
+  const e = await t.readULE32(), a = await L(t, e), o = await t.readULE32();
+  return await g(t), { n8: e, q: a, nWitness: o };
+}
+export {
+  U as readHeader,
+  S as writeBin
+};

package/Users/nkoreli/Documents/GitHub/Hinkal-Protocol/node_modules/snarkjs/src/zkey_constants.mjs

@@ -0,0 +1,6 @@
+const O = 1, _ = 2, L = 10;
+export {
+  L as FFLONK_PROTOCOL_ID,
+  O as GROTH16_PROTOCOL_ID,
+  _ as PLONK_PROTOCOL_ID
+};