@gardenfi/utils 2.1.2-beta.1 → 2.1.2-beta.3

package/dist/index118.js

@@ -1,175 +0,0 @@
-import { validateField as z, nLength as F } from "./index97.js";
-import { validateObject as x, bitLen as O } from "./index98.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const I = BigInt(0), p = BigInt(1);
-function m(e, r) {
-  const t = r.negate();
-  return e ? t : r;
-}
-function A(e, r) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > r)
-    throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
-}
-function b(e, r) {
-  A(e, r);
-  const t = Math.ceil(r / e) + 1, n = 2 ** (e - 1);
-  return { windows: t, windowSize: n };
-}
-function L(e, r) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((t, n) => {
-    if (!(t instanceof r))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function k(e, r) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((t, n) => {
-    if (!r.isValid(t))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const B = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
-function S(e) {
-  return E.get(e) || 1;
-}
-function v(e, r) {
-  return {
-    constTimeNegate: m,
-    hasPrecomputes(t) {
-      return S(t) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(t, n, i = e.ZERO) {
-      let o = t;
-      for (; n > I; )
-        n & p && (i = i.add(o)), o = o.double(), n >>= p;
-      return i;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(t, n) {
-      const { windows: i, windowSize: o } = b(n, r), a = [];
-      let c = t, d = c;
-      for (let h = 0; h < i; h++) {
-        d = c, a.push(d);
-        for (let w = 1; w < o; w++)
-          d = d.add(c), a.push(d);
-        c = d.double();
-      }
-      return a;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(t, n, i) {
-      const { windows: o, windowSize: a } = b(t, r);
-      let c = e.ZERO, d = e.BASE;
-      const h = BigInt(2 ** t - 1), w = 2 ** t, l = BigInt(t);
-      for (let u = 0; u < o; u++) {
-        const s = u * a;
-        let f = Number(i & h);
-        i >>= l, f > a && (f -= w, i += p);
-        const g = s, N = s + Math.abs(f) - 1, y = u % 2 !== 0, M = f < 0;
-        f === 0 ? d = d.add(m(y, n[g])) : c = c.add(m(M, n[N]));
-      }
-      return { p: c, f: d };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(t, n, i, o = e.ZERO) {
-      const { windows: a, windowSize: c } = b(t, r), d = BigInt(2 ** t - 1), h = 2 ** t, w = BigInt(t);
-      for (let l = 0; l < a; l++) {
-        const u = l * c;
-        if (i === I)
-          break;
-        let s = Number(i & d);
-        if (i >>= w, s > c && (s -= h, i += p), s === 0)
-          continue;
-        let f = n[u + Math.abs(s) - 1];
-        s < 0 && (f = f.negate()), o = o.add(f);
-      }
-      return o;
-    },
-    getPrecomputes(t, n, i) {
-      let o = B.get(n);
-      return o || (o = this.precomputeWindow(n, t), t !== 1 && B.set(n, i(o))), o;
-    },
-    wNAFCached(t, n, i) {
-      const o = S(t);
-      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
-    },
-    wNAFCachedUnsafe(t, n, i, o) {
-      const a = S(t);
-      return a === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, t, i), n, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(t, n) {
-      A(n, r), E.set(t, n), B.delete(t);
-    }
-  };
-}
-function Z(e, r, t, n) {
-  if (L(t, e), k(n, r), t.length !== n.length)
-    throw new Error("arrays of points and scalars must have equal length");
-  const i = e.ZERO, o = O(BigInt(t.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, c = (1 << a) - 1, d = new Array(c + 1).fill(i), h = Math.floor((r.BITS - 1) / a) * a;
-  let w = i;
-  for (let l = h; l >= 0; l -= a) {
-    d.fill(i);
-    for (let s = 0; s < n.length; s++) {
-      const f = n[s], g = Number(f >> BigInt(l) & BigInt(c));
-      d[g] = d[g].add(t[s]);
-    }
-    let u = i;
-    for (let s = d.length - 1, f = i; s > 0; s--)
-      f = f.add(d[s]), u = u.add(f);
-    if (w = w.add(u), l !== 0)
-      for (let s = 0; s < a; s++)
-        w = w.double();
-  }
-  return w;
-}
-function U(e) {
-  return z(e.Fp), x(e, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...F(e.n, e.nBitLength),
-    ...e,
-    p: e.Fp.ORDER
-  });
-}
-export {
-  Z as pippenger,
-  U as validateBasic,
-  v as wNAF
-};