@gardenfi/utils 2.5.2 → 2.5.3-beta.0

package/dist/index302.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index288.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),g=BigInt(1);function T(e,t){if(typeof t!="boolean")throw new Error(e+" boolean expected, got "+t)}function x(e){const t=e.toString(16);return t.length&1?"0"+t:t}function w(e){if(typeof e!="string")throw new Error("hex string expected, got "+typeof e);return e===""?d:BigInt("0x"+e)}function v(e){return w(i.bytesToHex(e))}function U(e){return i.abytes(e),w(i.bytesToHex(Uint8Array.from(e).reverse()))}function h(e,t){return i.hexToBytes(e.toString(16).padStart(t*2,"0"))}function H(e,t){return h(e,t).reverse()}function A(e,t,r){let o;if(typeof t=="string")try{o=i.hexToBytes(t)}catch(n){throw new Error(e+" must be hex string or Uint8Array, cause: "+n)}else if(i.isBytes(t))o=Uint8Array.from(t);else throw new Error(e+" must be hex string or Uint8Array");const s=o.length;if(typeof r=="number"&&s!==r)throw new Error(e+" of length "+r+" expected, got "+s);return o}const m=e=>typeof e=="bigint"&&d<=e;function p(e,t,r){return m(e)&&m(t)&&m(r)&&t<=e&&e<r}function I(e,t,r,o){if(!p(t,r,o))throw new Error("expected valid "+e+": "+r+" <= n < "+o+", got "+t)}function j(e){let t;for(t=0;e>d;e>>=g,t+=1);return t}const k=e=>(g<<BigInt(e))-g;function N(e,t,r){if(typeof e!="number"||e<2)throw new Error("hashLen must be a number");if(typeof t!="number"||t<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");const o=u=>new Uint8Array(u),s=u=>Uint8Array.of(u);let n=o(e),c=o(e),f=0;const a=()=>{n.fill(1),c.fill(0),f=0},b=(...u)=>r(c,n,...u),B=(u=o(0))=>{c=b(s(0),u),n=b(),u.length!==0&&(c=b(s(1),u),n=b())},E=()=>{if(f++>=1e3)throw new Error("drbg: tried 1000 values");let u=0;const y=[];for(;u<t;){n=b();const l=n.slice();y.push(l),u+=n.length}return i.concatBytes(...y)};return(u,y)=>{a(),B(u);let l;for(;!(l=y(E()));)B();return a(),l}}function O(e,t,r={}){if(!e||typeof e!="object")throw new Error("expected valid options object");function o(s,n,c){const f=e[s];if(c&&f===void 0)return;const a=typeof f;if(a!==n||f===null)throw new Error(`param "${s}" is invalid: expected ${n}, got ${a}`)}Object.entries(t).forEach(([s,n])=>o(s,n,!1)),Object.entries(r).forEach(([s,n])=>o(s,n,!0))}function S(e){const t=new WeakMap;return(r,...o)=>{const s=t.get(r);if(s!==void 0)return s;const n=e(r,...o);return t.set(r,n),n}}exports.abytes=i.abytes;exports.anumber=i.anumber;exports.bytesToHex=i.bytesToHex;exports.concatBytes=i.concatBytes;exports.hexToBytes=i.hexToBytes;exports.isBytes=i.isBytes;exports.randomBytes=i.randomBytes;exports.utf8ToBytes=i.utf8ToBytes;exports._validateObject=O;exports.aInRange=I;exports.abool=T;exports.bitLen=j;exports.bitMask=k;exports.bytesToNumberBE=v;exports.bytesToNumberLE=U;exports.createHmacDrbg=N;exports.ensureBytes=A;exports.hexToNumber=w;exports.inRange=p;exports.memoized=S;exports.numberToBytesBE=h;exports.numberToBytesLE=H;exports.numberToHexUnpadded=x;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index301.cjs"),v=require("./index282.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const g=BigInt(0),b=BigInt(1);function S(r,e){const t=e.negate();return r?t:e}function z(r,e){const t=v.FpInvertBatch(r.Fp,e.map(n=>n.Z));return e.map((n,i)=>r.fromAffine(n.toAffine(t[i])))}function x(r,e){if(!Number.isSafeInteger(r)||r<=0||r>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+r)}function F(r,e){x(r,e);const t=Math.ceil(e/r)+1,n=2**(r-1),i=2**r,o=A.bitMask(r),s=BigInt(r);return{windows:t,windowSize:n,mask:o,maxNumber:i,shiftBy:s}}function Z(r,e,t){const{windowSize:n,mask:i,maxNumber:o,shiftBy:s}=t;let a=Number(r&i),f=r>>s;a>n&&(a-=o,f+=b);const c=e*n,d=c+Math.abs(a)-1,w=a===0,u=a<0,h=e%2!==0;return{nextN:f,offset:d,isZero:w,isNeg:u,isNegF:h,offsetF:c}}function I(r,e){if(!Array.isArray(r))throw new Error("array expected");r.forEach((t,n)=>{if(!(t instanceof e))throw new Error("invalid point at index "+n)})}function j(r,e){if(!Array.isArray(r))throw new Error("array of scalars expected");r.forEach((t,n)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+n)})}const E=new WeakMap,B=new WeakMap;function N(r){return B.get(r)||1}function O(r){if(r!==g)throw new Error("invalid wNAF")}class R{constructor(e,t){this.BASE=e.BASE,this.ZERO=e.ZERO,this.Fn=e.Fn,this.bits=t}_unsafeLadder(e,t,n=this.ZERO){let i=e;for(;t>g;)t&b&&(n=n.add(i)),i=i.double(),t>>=b;return n}precomputeWindow(e,t){const{windows:n,windowSize:i}=F(t,this.bits),o=[];let s=e,a=s;for(let f=0;f<n;f++){a=s,o.push(a);for(let c=1;c<i;c++)a=a.add(s),o.push(a);s=a.double()}return o}wNAF(e,t,n){if(!this.Fn.isValid(n))throw new Error("invalid scalar");let i=this.ZERO,o=this.BASE;const s=F(e,this.bits);for(let a=0;a<s.windows;a++){const{nextN:f,offset:c,isZero:d,isNeg:w,isNegF:u,offsetF:h}=Z(n,a,s);n=f,d?o=o.add(S(u,t[h])):i=i.add(S(w,t[c]))}return O(n),{p:i,f:o}}wNAFUnsafe(e,t,n,i=this.ZERO){const o=F(e,this.bits);for(let s=0;s<o.windows&&n!==g;s++){const{nextN:a,offset:f,isZero:c,isNeg:d}=Z(n,s,o);if(n=a,!c){const w=t[f];i=i.add(d?w.negate():w)}}return O(n),i}getPrecomputes(e,t,n){let i=E.get(t);return i||(i=this.precomputeWindow(t,e),e!==1&&(typeof n=="function"&&(i=n(i)),E.set(t,i))),i}cached(e,t,n){const i=N(e);return this.wNAF(i,this.getPrecomputes(i,e,n),t)}unsafe(e,t,n,i){const o=N(e);return o===1?this._unsafeLadder(e,t,i):this.wNAFUnsafe(o,this.getPrecomputes(o,e,n),t,i)}createCache(e,t){x(t,this.bits),B.set(e,t),E.delete(e)}hasCache(e){return N(e)!==1}}function _(r,e,t,n){let i=e,o=r.ZERO,s=r.ZERO;for(;t>g||n>g;)t&b&&(o=o.add(i)),n&b&&(s=s.add(i)),i=i.double(),t>>=b,n>>=b;return{p1:o,p2:s}}function k(r,e,t,n){I(t,r),j(n,e);const i=t.length,o=n.length;if(i!==o)throw new Error("arrays of points and scalars must have equal length");const s=r.ZERO,a=A.bitLen(BigInt(i));let f=1;a>12?f=a-3:a>4?f=a-2:a>0&&(f=2);const c=A.bitMask(f),d=new Array(Number(c)+1).fill(s),w=Math.floor((e.BITS-1)/f)*f;let u=s;for(let h=w;h>=0;h-=f){d.fill(s);for(let l=0;l<o;l++){const p=n[l],y=Number(p>>BigInt(h)&c);d[y]=d[y].add(t[l])}let m=s;for(let l=d.length-1,p=s;l>0;l--)p=p.add(d[l]),m=m.add(p);if(u=u.add(m),h!==0)for(let l=0;l<f;l++)u=u.double()}return u}function M(r,e,t){if(e){if(e.ORDER!==r)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return v.validateField(e),e}else return v.Field(r,{isLE:t})}function q(r,e,t={},n){if(n===void 0&&(n=r==="edwards"),!e||typeof e!="object")throw new Error(`expected valid ${r} CURVE object`);for(const f of["p","n","h"]){const c=e[f];if(!(typeof c=="bigint"&&c>g))throw new Error(`CURVE.${f} must be positive bigint`)}const i=M(e.p,t.Fp,n),o=M(e.n,t.Fn,n),a=["Gx","Gy","a","b"];for(const f of a)if(!i.isValid(e[f]))throw new Error(`CURVE.${f} must be valid field element of CURVE.Fp`);return e=Object.freeze(Object.assign({},e)),{CURVE:e,Fp:i,Fn:o}}exports._createCurveFields=q;exports.mulEndoUnsafe=_;exports.negateCt=S;exports.normalizeZ=z;exports.pippenger=k;exports.wNAF=R;

package/dist/index302.js

@@ -1,142 +1,203 @@
-import { hexToBytes as p, isBytes as B, abytes as v, bytesToHex as d, concatBytes as U } from "./index288.js";
-import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index288.js";
+import { bitLen as M, bitMask as y } from "./index301.js";
+import { validateField as I, Field as z, FpInvertBatch as R } from "./index282.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const y = /* @__PURE__ */ BigInt(0), g = /* @__PURE__ */ BigInt(1);
-function k(t, r) {
-  if (typeof r != "boolean")
-    throw new Error(t + " boolean expected, got " + r);
+const m = BigInt(0), b = BigInt(1);
+function v(r, t) {
+  const e = t.negate();
+  return r ? e : t;
 }
-function j(t) {
-  const r = t.toString(16);
-  return r.length & 1 ? "0" + r : r;
+function D(r, t) {
+  const e = R(r.Fp, t.map((n) => n.Z));
+  return t.map((n, i) => r.fromAffine(n.toAffine(e[i])));
 }
-function h(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? y : BigInt("0x" + t);
+function O(r, t) {
+  if (!Number.isSafeInteger(r) || r <= 0 || r > t)
+    throw new Error("invalid window size, expected [1.." + t + "], got W=" + r);
 }
-function H(t) {
-  return h(d(t));
+function F(r, t) {
+  O(r, t);
+  const e = Math.ceil(t / r) + 1, n = 2 ** (r - 1), i = 2 ** r, o = y(r), s = BigInt(r);
+  return { windows: e, windowSize: n, mask: o, maxNumber: i, shiftBy: s };
 }
-function O(t) {
-  return v(t), h(d(Uint8Array.from(t).reverse()));
+function S(r, t, e) {
+  const { windowSize: n, mask: i, maxNumber: o, shiftBy: s } = e;
+  let a = Number(r & i), f = r >> s;
+  a > n && (a -= o, f += b);
+  const c = t * n, d = c + Math.abs(a) - 1, u = a === 0, w = a < 0, h = t % 2 !== 0;
+  return { nextN: f, offset: d, isZero: u, isNeg: w, isNegF: h, offsetF: c };
 }
-function x(t, r) {
-  return p(t.toString(16).padStart(r * 2, "0"));
+function j(r, t) {
+  if (!Array.isArray(r))
+    throw new Error("array expected");
+  r.forEach((e, n) => {
+    if (!(e instanceof t))
+      throw new Error("invalid point at index " + n);
+  });
 }
-function S(t, r) {
-  return x(t, r).reverse();
+function _(r, t) {
+  if (!Array.isArray(r))
+    throw new Error("array of scalars expected");
+  r.forEach((e, n) => {
+    if (!t.isValid(e))
+      throw new Error("invalid scalar at index " + n);
+  });
 }
-function _(t, r, n) {
-  let o;
-  if (typeof r == "string")
-    try {
-      o = p(r);
-    } catch (e) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + e);
-    }
-  else if (B(r))
-    o = Uint8Array.from(r);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const i = o.length;
-  if (typeof n == "number" && i !== n)
-    throw new Error(t + " of length " + n + " expected, got " + i);
-  return o;
+const E = /* @__PURE__ */ new WeakMap(), B = /* @__PURE__ */ new WeakMap();
+function N(r) {
+  return B.get(r) || 1;
 }
-const w = (t) => typeof t == "bigint" && y <= t;
-function T(t, r, n) {
-  return w(t) && w(r) && w(n) && r <= t && t < n;
+function Z(r) {
+  if (r !== m)
+    throw new Error("invalid wNAF");
 }
-function $(t, r, n, o) {
-  if (!T(r, n, o))
-    throw new Error("expected valid " + t + ": " + n + " <= n < " + o + ", got " + r);
+class G {
+  // Parametrized with a given Point class (not individual point)
+  constructor(t, e) {
+    this.BASE = t.BASE, this.ZERO = t.ZERO, this.Fn = t.Fn, this.bits = e;
+  }
+  // non-const time multiplication ladder
+  _unsafeLadder(t, e, n = this.ZERO) {
+    let i = t;
+    for (; e > m; )
+      e & b && (n = n.add(i)), i = i.double(), e >>= b;
+    return n;
+  }
+  /**
+   * 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 point Point instance
+   * @param W window size
+   * @returns precomputed point tables flattened to a single array
+   */
+  precomputeWindow(t, e) {
+    const { windows: n, windowSize: i } = F(e, this.bits), o = [];
+    let s = t, a = s;
+    for (let f = 0; f < n; f++) {
+      a = s, o.push(a);
+      for (let c = 1; c < i; c++)
+        a = a.add(s), o.push(a);
+      s = a.double();
+    }
+    return o;
+  }
+  /**
+   * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
+   * More compact implementation:
+   * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541
+   * @returns real and fake (for const-time) points
+   */
+  wNAF(t, e, n) {
+    if (!this.Fn.isValid(n))
+      throw new Error("invalid scalar");
+    let i = this.ZERO, o = this.BASE;
+    const s = F(t, this.bits);
+    for (let a = 0; a < s.windows; a++) {
+      const { nextN: f, offset: c, isZero: d, isNeg: u, isNegF: w, offsetF: h } = S(n, a, s);
+      n = f, d ? o = o.add(v(w, e[h])) : i = i.add(v(u, e[c]));
+    }
+    return Z(n), { p: i, f: o };
+  }
+  /**
+   * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
+   * @param acc accumulator point to add result of multiplication
+   * @returns point
+   */
+  wNAFUnsafe(t, e, n, i = this.ZERO) {
+    const o = F(t, this.bits);
+    for (let s = 0; s < o.windows && n !== m; s++) {
+      const { nextN: a, offset: f, isZero: c, isNeg: d } = S(n, s, o);
+      if (n = a, !c) {
+        const u = e[f];
+        i = i.add(d ? u.negate() : u);
+      }
+    }
+    return Z(n), i;
+  }
+  getPrecomputes(t, e, n) {
+    let i = E.get(e);
+    return i || (i = this.precomputeWindow(e, t), t !== 1 && (typeof n == "function" && (i = n(i)), E.set(e, i))), i;
+  }
+  cached(t, e, n) {
+    const i = N(t);
+    return this.wNAF(i, this.getPrecomputes(i, t, n), e);
+  }
+  unsafe(t, e, n, i) {
+    const o = N(t);
+    return o === 1 ? this._unsafeLadder(t, e, i) : this.wNAFUnsafe(o, this.getPrecomputes(o, t, n), e, i);
+  }
+  // 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.
+  createCache(t, e) {
+    O(e, this.bits), B.set(t, e), E.delete(t);
+  }
+  hasCache(t) {
+    return N(t) !== 1;
+  }
 }
-function M(t) {
-  let r;
-  for (r = 0; t > y; t >>= g, r += 1)
-    ;
-  return r;
+function q(r, t, e, n) {
+  let i = t, o = r.ZERO, s = r.ZERO;
+  for (; e > m || n > m; )
+    e & b && (o = o.add(i)), n & b && (s = s.add(i)), i = i.double(), e >>= b, n >>= b;
+  return { p1: o, p2: s };
 }
-const N = (t) => (g << BigInt(t)) - g;
-function R(t, r, n) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof r != "number" || r < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof n != "function")
-    throw new Error("hmacFn must be a function");
-  const o = (u) => new Uint8Array(u), i = (u) => Uint8Array.of(u);
-  let e = o(t), s = o(t), f = 0;
-  const c = () => {
-    e.fill(1), s.fill(0), f = 0;
-  }, l = (...u) => n(s, e, ...u), m = (u = o(0)) => {
-    s = l(i(0), u), e = l(), u.length !== 0 && (s = l(i(1), u), e = l());
-  }, E = () => {
-    if (f++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let u = 0;
-    const a = [];
-    for (; u < r; ) {
-      e = l();
-      const b = e.slice();
-      a.push(b), u += e.length;
+function K(r, t, e, n) {
+  j(e, r), _(n, t);
+  const i = e.length, o = n.length;
+  if (i !== o)
+    throw new Error("arrays of points and scalars must have equal length");
+  const s = r.ZERO, a = M(BigInt(i));
+  let f = 1;
+  a > 12 ? f = a - 3 : a > 4 ? f = a - 2 : a > 0 && (f = 2);
+  const c = y(f), d = new Array(Number(c) + 1).fill(s), u = Math.floor((t.BITS - 1) / f) * f;
+  let w = s;
+  for (let h = u; h >= 0; h -= f) {
+    d.fill(s);
+    for (let l = 0; l < o; l++) {
+      const p = n[l], A = Number(p >> BigInt(h) & c);
+      d[A] = d[A].add(e[l]);
     }
-    return U(...a);
-  };
-  return (u, a) => {
-    c(), m(u);
-    let b;
-    for (; !(b = a(E())); )
-      m();
-    return c(), b;
-  };
-}
-function z(t, r, n = {}) {
-  if (!t || typeof t != "object")
-    throw new Error("expected valid options object");
-  function o(i, e, s) {
-    const f = t[i];
-    if (s && f === void 0)
-      return;
-    const c = typeof f;
-    if (c !== e || f === null)
-      throw new Error(`param "${i}" is invalid: expected ${e}, got ${c}`);
+    let g = s;
+    for (let l = d.length - 1, p = s; l > 0; l--)
+      p = p.add(d[l]), g = g.add(p);
+    if (w = w.add(g), h !== 0)
+      for (let l = 0; l < f; l++)
+        w = w.double();
   }
-  Object.entries(r).forEach(([i, e]) => o(i, e, !1)), Object.entries(n).forEach(([i, e]) => o(i, e, !0));
+  return w;
 }
-function D(t) {
-  const r = /* @__PURE__ */ new WeakMap();
-  return (n, ...o) => {
-    const i = r.get(n);
-    if (i !== void 0)
-      return i;
-    const e = t(n, ...o);
-    return r.set(n, e), e;
-  };
+function x(r, t, e) {
+  if (t) {
+    if (t.ORDER !== r)
+      throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
+    return I(t), t;
+  } else
+    return z(r, { isLE: e });
+}
+function P(r, t, e = {}, n) {
+  if (n === void 0 && (n = r === "edwards"), !t || typeof t != "object")
+    throw new Error(`expected valid ${r} CURVE object`);
+  for (const f of ["p", "n", "h"]) {
+    const c = t[f];
+    if (!(typeof c == "bigint" && c > m))
+      throw new Error(`CURVE.${f} must be positive bigint`);
+  }
+  const i = x(t.p, e.Fp, n), o = x(t.n, e.Fn, n), a = ["Gx", "Gy", "a", "b"];
+  for (const f of a)
+    if (!i.isValid(t[f]))
+      throw new Error(`CURVE.${f} must be valid field element of CURVE.Fp`);
+  return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: i, Fn: o };
 }
 export {
-  z as _validateObject,
-  $ as aInRange,
-  k as abool,
-  v as abytes,
-  W as anumber,
-  M as bitLen,
-  N as bitMask,
-  d as bytesToHex,
-  H as bytesToNumberBE,
-  O as bytesToNumberLE,
-  U as concatBytes,
-  R as createHmacDrbg,
-  _ as ensureBytes,
-  p as hexToBytes,
-  h as hexToNumber,
-  T as inRange,
-  B as isBytes,
-  D as memoized,
-  x as numberToBytesBE,
-  S as numberToBytesLE,
-  j as numberToHexUnpadded,
-  C as randomBytes,
-  G as utf8ToBytes
+  P as _createCurveFields,
+  q as mulEndoUnsafe,
+  v as negateCt,
+  D as normalizeZ,
+  K as pippenger,
+  G as wNAF
 };

package/dist/index303.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index302.cjs"),v=require("./index283.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const m=BigInt(0),h=BigInt(1);function b(t,r){const e=r.negate();return t?e:r}function B(t,r,e){const n=s=>s.pz,i=v.FpInvertBatch(t.Fp,e.map(n));return e.map((s,a)=>s.toAffine(i[a])).map(t.fromAffine)}function I(t,r){if(!Number.isSafeInteger(t)||t<=0||t>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+t)}function E(t,r){I(t,r);const e=Math.ceil(r/t)+1,n=2**(t-1),i=2**t,o=y.bitMask(t),s=BigInt(t);return{windows:e,windowSize:n,mask:o,maxNumber:i,shiftBy:s}}function M(t,r,e){const{windowSize:n,mask:i,maxNumber:o,shiftBy:s}=e;let a=Number(t&i),f=t>>s;a>n&&(a-=o,f+=h);const d=r*n,c=d+Math.abs(a)-1,p=a===0,l=a<0,w=r%2!==0;return{nextN:f,offset:c,isZero:p,isNeg:l,isNegF:w,offsetF:d}}function O(t,r){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,n)=>{if(!(e instanceof r))throw new Error("invalid point at index "+n)})}function R(t,r){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,n)=>{if(!r.isValid(e))throw new Error("invalid scalar at index "+n)})}const N=new WeakMap,Z=new WeakMap;function A(t){return Z.get(t)||1}function x(t){if(t!==m)throw new Error("invalid wNAF")}function j(t,r){return{constTimeNegate:b,hasPrecomputes(e){return A(e)!==1},unsafeLadder(e,n,i=t.ZERO){let o=e;for(;n>m;)n&h&&(i=i.add(o)),o=o.double(),n>>=h;return i},precomputeWindow(e,n){const{windows:i,windowSize:o}=E(n,r),s=[];let a=e,f=a;for(let d=0;d<i;d++){f=a,s.push(f);for(let c=1;c<o;c++)f=f.add(a),s.push(f);a=f.double()}return s},wNAF(e,n,i){let o=t.ZERO,s=t.BASE;const a=E(e,r);for(let f=0;f<a.windows;f++){const{nextN:d,offset:c,isZero:p,isNeg:l,isNegF:w,offsetF:g}=M(i,f,a);i=d,p?s=s.add(b(w,n[g])):o=o.add(b(l,n[c]))}return x(i),{p:o,f:s}},wNAFUnsafe(e,n,i,o=t.ZERO){const s=E(e,r);for(let a=0;a<s.windows&&i!==m;a++){const{nextN:f,offset:d,isZero:c,isNeg:p}=M(i,a,s);if(i=f,!c){const l=n[d];o=o.add(p?l.negate():l)}}return x(i),o},getPrecomputes(e,n,i){let o=N.get(n);return o||(o=this.precomputeWindow(n,e),e!==1&&(typeof i=="function"&&(o=i(o)),N.set(n,o))),o},wNAFCached(e,n,i){const o=A(e);return this.wNAF(o,this.getPrecomputes(o,e,i),n)},wNAFCachedUnsafe(e,n,i,o){const s=A(e);return s===1?this.unsafeLadder(e,n,o):this.wNAFUnsafe(s,this.getPrecomputes(s,e,i),n,o)},setWindowSize(e,n){I(n,r),Z.set(e,n),N.delete(e)}}}function _(t,r,e,n){let i=r,o=t.ZERO,s=t.ZERO;for(;e>m||n>m;)e&h&&(o=o.add(i)),n&h&&(s=s.add(i)),i=i.double(),e>>=h,n>>=h;return{p1:o,p2:s}}function C(t,r,e,n){O(e,t),R(n,r);const i=e.length,o=n.length;if(i!==o)throw new Error("arrays of points and scalars must have equal length");const s=t.ZERO,a=y.bitLen(BigInt(i));let f=1;a>12?f=a-3:a>4?f=a-2:a>0&&(f=2);const d=y.bitMask(f),c=new Array(Number(d)+1).fill(s),p=Math.floor((r.BITS-1)/f)*f;let l=s;for(let w=p;w>=0;w-=f){c.fill(s);for(let u=0;u<o;u++){const F=n[u],S=Number(F>>BigInt(w)&d);c[S]=c[S].add(e[u])}let g=s;for(let u=c.length-1,F=s;u>0;u--)F=F.add(c[u]),g=g.add(F);if(l=l.add(g),w!==0)for(let u=0;u<f;u++)l=l.double()}return l}function z(t,r){if(r){if(r.ORDER!==t)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return v.validateField(r),r}else return v.Field(t)}function k(t,r,e={}){if(!r||typeof r!="object")throw new Error(`expected valid ${t} CURVE object`);for(const a of["p","n","h"]){const f=r[a];if(!(typeof f=="bigint"&&f>m))throw new Error(`CURVE.${a} must be positive bigint`)}const n=z(r.p,e.Fp),i=z(r.n,e.Fn),s=["Gx","Gy","a","b"];for(const a of s)if(!n.isValid(r[a]))throw new Error(`CURVE.${a} must be valid field element of CURVE.Fp`);return{Fp:n,Fn:i}}exports._createCurveFields=k;exports.mulEndoUnsafe=_;exports.negateCt=b;exports.normalizeZ=B;exports.pippenger=C;exports.wNAF=j;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index326.cjs");class c extends Error{constructor(r,e={}){const a=(()=>{var s;if(e.cause instanceof c){if(e.cause.details)return e.cause.details;if(e.cause.shortMessage)return e.cause.shortMessage}return e.cause&&"details"in e.cause&&typeof e.cause.details=="string"?e.cause.details:(s=e.cause)!=null&&s.message?e.cause.message:e.details})(),u=e.cause instanceof c&&e.cause.docsPath||e.docsPath,i=`https://oxlib.sh${u??""}`,d=[r||"An error occurred.",...e.metaMessages?["",...e.metaMessages]:[],...a||u?["",a?`Details: ${a}`:void 0,u?`See: ${i}`:void 0]:[]].filter(s=>typeof s=="string").join(`
+`);super(d,e.cause?{cause:e.cause}:void 0),Object.defineProperty(this,"details",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docs",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docsPath",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"shortMessage",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"cause",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"BaseError"}),Object.defineProperty(this,"version",{enumerable:!0,configurable:!0,writable:!0,value:`ox@${n.getVersion()}`}),this.cause=e.cause,this.details=a,this.docs=i,this.docsPath=u,this.shortMessage=r}walk(r){return l(this,r)}}function l(t,r){return r!=null&&r(t)?t:t&&typeof t=="object"&&"cause"in t&&t.cause?l(t.cause,r):r?null:t}exports.BaseError=c;

package/dist/index303.js

@@ -1,204 +1,69 @@
-import { bitLen as B, bitMask as z } from "./index302.js";
-import { validateField as Z, Field as O, FpInvertBatch as R } from "./index283.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const g = BigInt(0), h = BigInt(1);
-function b(t, r) {
-  const e = r.negate();
-  return t ? e : r;
-}
-function L(t, r, e) {
-  const n = (s) => s.pz, i = R(t.Fp, e.map(n));
-  return e.map((s, f) => s.toAffine(i[f])).map(t.fromAffine);
-}
-function I(t, r) {
-  if (!Number.isSafeInteger(t) || t <= 0 || t > r)
-    throw new Error("invalid window size, expected [1.." + r + "], got W=" + t);
-}
-function E(t, r) {
-  I(t, r);
-  const e = Math.ceil(r / t) + 1, n = 2 ** (t - 1), i = 2 ** t, o = z(t), s = BigInt(t);
-  return { windows: e, windowSize: n, mask: o, maxNumber: i, shiftBy: s };
-}
-function v(t, r, e) {
-  const { windowSize: n, mask: i, maxNumber: o, shiftBy: s } = e;
-  let f = Number(t & i), a = t >> s;
-  f > n && (f -= o, a += h);
-  const d = r * n, c = d + Math.abs(f) - 1, p = f === 0, l = f < 0, u = r % 2 !== 0;
-  return { nextN: a, offset: c, isZero: p, isNeg: l, isNegF: u, offsetF: d };
-}
-function j(t, r) {
-  if (!Array.isArray(t))
-    throw new Error("array expected");
-  t.forEach((e, n) => {
-    if (!(e instanceof r))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function _(t, r) {
-  if (!Array.isArray(t))
-    throw new Error("array of scalars expected");
-  t.forEach((e, n) => {
-    if (!r.isValid(e))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const N = /* @__PURE__ */ new WeakMap(), M = /* @__PURE__ */ new WeakMap();
-function A(t) {
-  return M.get(t) || 1;
-}
-function S(t) {
-  if (t !== g)
-    throw new Error("invalid wNAF");
-}
-function U(t, r) {
-  return {
-    constTimeNegate: b,
-    hasPrecomputes(e) {
-      return A(e) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(e, n, i = t.ZERO) {
-      let o = e;
-      for (; n > g; )
-        n & h && (i = i.add(o)), o = o.double(), n >>= h;
-      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(e, n) {
-      const { windows: i, windowSize: o } = E(n, r), s = [];
-      let f = e, a = f;
-      for (let d = 0; d < i; d++) {
-        a = f, s.push(a);
-        for (let c = 1; c < o; c++)
-          a = a.add(f), s.push(a);
-        f = a.double();
-      }
-      return s;
-    },
-    /**
-     * 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(e, n, i) {
-      let o = t.ZERO, s = t.BASE;
-      const f = E(e, r);
-      for (let a = 0; a < f.windows; a++) {
-        const { nextN: d, offset: c, isZero: p, isNeg: l, isNegF: u, offsetF: m } = v(i, a, f);
-        i = d, p ? s = s.add(b(u, n[m])) : o = o.add(b(l, n[c]));
+import { getVersion as n } from "./index326.js";
+class c extends Error {
+  constructor(t, e = {}) {
+    const a = (() => {
+      var s;
+      if (e.cause instanceof c) {
+        if (e.cause.details)
+          return e.cause.details;
+        if (e.cause.shortMessage)
+          return e.cause.shortMessage;
       }
-      return S(i), { p: o, f: s };
-    },
-    /**
-     * 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(e, n, i, o = t.ZERO) {
-      const s = E(e, r);
-      for (let f = 0; f < s.windows && i !== g; f++) {
-        const { nextN: a, offset: d, isZero: c, isNeg: p } = v(i, f, s);
-        if (i = a, !c) {
-          const l = n[d];
-          o = o.add(p ? l.negate() : l);
-        }
-      }
-      return S(i), o;
-    },
-    getPrecomputes(e, n, i) {
-      let o = N.get(n);
-      return o || (o = this.precomputeWindow(n, e), e !== 1 && (typeof i == "function" && (o = i(o)), N.set(n, o))), o;
-    },
-    wNAFCached(e, n, i) {
-      const o = A(e);
-      return this.wNAF(o, this.getPrecomputes(o, e, i), n);
-    },
-    wNAFCachedUnsafe(e, n, i, o) {
-      const s = A(e);
-      return s === 1 ? this.unsafeLadder(e, n, o) : this.wNAFUnsafe(s, this.getPrecomputes(s, e, 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(e, n) {
-      I(n, r), M.set(e, n), N.delete(e);
-    }
-  };
-}
-function $(t, r, e, n) {
-  let i = r, o = t.ZERO, s = t.ZERO;
-  for (; e > g || n > g; )
-    e & h && (o = o.add(i)), n & h && (s = s.add(i)), i = i.double(), e >>= h, n >>= h;
-  return { p1: o, p2: s };
-}
-function D(t, r, e, n) {
-  j(e, t), _(n, r);
-  const i = e.length, o = n.length;
-  if (i !== o)
-    throw new Error("arrays of points and scalars must have equal length");
-  const s = t.ZERO, f = B(BigInt(i));
-  let a = 1;
-  f > 12 ? a = f - 3 : f > 4 ? a = f - 2 : f > 0 && (a = 2);
-  const d = z(a), c = new Array(Number(d) + 1).fill(s), p = Math.floor((r.BITS - 1) / a) * a;
-  let l = s;
-  for (let u = p; u >= 0; u -= a) {
-    c.fill(s);
-    for (let w = 0; w < o; w++) {
-      const F = n[w], y = Number(F >> BigInt(u) & d);
-      c[y] = c[y].add(e[w]);
-    }
-    let m = s;
-    for (let w = c.length - 1, F = s; w > 0; w--)
-      F = F.add(c[w]), m = m.add(F);
-    if (l = l.add(m), u !== 0)
-      for (let w = 0; w < a; w++)
-        l = l.double();
+      return e.cause && "details" in e.cause && typeof e.cause.details == "string" ? e.cause.details : (s = e.cause) != null && s.message ? e.cause.message : e.details;
+    })(), u = e.cause instanceof c && e.cause.docsPath || e.docsPath, i = `https://oxlib.sh${u ?? ""}`, d = [
+      t || "An error occurred.",
+      ...e.metaMessages ? ["", ...e.metaMessages] : [],
+      ...a || u ? [
+        "",
+        a ? `Details: ${a}` : void 0,
+        u ? `See: ${i}` : void 0
+      ] : []
+    ].filter((s) => typeof s == "string").join(`
+`);
+    super(d, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "docs", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "docsPath", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "shortMessage", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "cause", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "BaseError"
+    }), Object.defineProperty(this, "version", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: `ox@${n()}`
+    }), this.cause = e.cause, this.details = a, this.docs = i, this.docsPath = u, this.shortMessage = t;
   }
-  return l;
-}
-function x(t, r) {
-  if (r) {
-    if (r.ORDER !== t)
-      throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return Z(r), r;
-  } else
-    return O(t);
-}
-function G(t, r, e = {}) {
-  if (!r || typeof r != "object")
-    throw new Error(`expected valid ${t} CURVE object`);
-  for (const f of ["p", "n", "h"]) {
-    const a = r[f];
-    if (!(typeof a == "bigint" && a > g))
-      throw new Error(`CURVE.${f} must be positive bigint`);
+  walk(t) {
+    return l(this, t);
   }
-  const n = x(r.p, e.Fp), i = x(r.n, e.Fn), s = ["Gx", "Gy", "a", "b"];
-  for (const f of s)
-    if (!n.isValid(r[f]))
-      throw new Error(`CURVE.${f} must be valid field element of CURVE.Fp`);
-  return { Fp: n, Fn: i };
+}
+function l(r, t) {
+  return t != null && t(r) ? r : r && typeof r == "object" && "cause" in r && r.cause ? l(r.cause, t) : t ? null : r;
 }
 export {
-  G as _createCurveFields,
-  $ as mulEndoUnsafe,
-  b as negateCt,
-  L as normalizeZ,
-  D as pippenger,
-  U as wNAF
+  c as BaseError
 };