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

package/dist/index244.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index233.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const m=BigInt(0),l=BigInt(1);function T(e,t=""){if(typeof e!="boolean"){const n=t&&`"${t}"`;throw new Error(n+"expected boolean, got type="+typeof e)}return e}function x(e,t,n=""){const o=i.isBytes(e),s=e==null?void 0:e.length,r=t!==void 0;if(!o||r&&s!==t){const u=n&&`"${n}" `,f=r?` of length ${t}`:"",y=o?`length=${s}`:`type=${typeof e}`;throw new Error(u+"expected Uint8Array"+f+", got "+y)}return e}function U(e){const t=e.toString(16);return t.length&1?"0"+t:t}function p(e){if(typeof e!="string")throw new Error("hex string expected, got "+typeof e);return e===""?m:BigInt("0x"+e)}function H(e){return p(i.bytesToHex(e))}function _(e){return i.abytes(e),p(i.bytesToHex(Uint8Array.from(e).reverse()))}function w(e,t){return i.hexToBytes(e.toString(16).padStart(t*2,"0"))}function $(e,t){return w(e,t).reverse()}function A(e,t,n){let o;if(typeof t=="string")try{o=i.hexToBytes(t)}catch(s){throw new Error(e+" must be hex string or Uint8Array, cause: "+s)}else if(i.isBytes(t))o=Uint8Array.from(t);else throw new Error(e+" must be hex string or Uint8Array");return o.length,o}const d=e=>typeof e=="bigint"&&m<=e;function h(e,t,n){return d(e)&&d(t)&&d(n)&&t<=e&&e<n}function I(e,t,n,o){if(!h(t,n,o))throw new Error("expected valid "+e+": "+n+" <= n < "+o+", got "+t)}function L(e){let t;for(t=0;e>m;e>>=l,t+=1);return t}const j=e=>(l<<BigInt(e))-l;function k(e,t,n){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 n!="function")throw new Error("hmacFn must be a function");const o=c=>new Uint8Array(c),s=c=>Uint8Array.of(c);let r=o(e),u=o(e),f=0;const y=()=>{r.fill(1),u.fill(0),f=0},b=(...c)=>n(u,r,...c),B=(c=o(0))=>{u=b(s(0),c),r=b(),c.length!==0&&(u=b(s(1),c),r=b())},E=()=>{if(f++>=1e3)throw new Error("drbg: tried 1000 values");let c=0;const a=[];for(;c<t;){r=b();const g=r.slice();a.push(g),c+=r.length}return i.concatBytes(...a)};return(c,a)=>{y(),B(c);let g;for(;!(g=a(E()));)B();return y(),g}}function N(e,t,n={}){if(!e||typeof e!="object")throw new Error("expected valid options object");function o(s,r,u){const f=e[s];if(u&&f===void 0)return;const y=typeof f;if(y!==r||f===null)throw new Error(`param "${s}" is invalid: expected ${r}, got ${y}`)}Object.entries(t).forEach(([s,r])=>o(s,r,!1)),Object.entries(n).forEach(([s,r])=>o(s,r,!0))}function O(e){const t=new WeakMap;return(n,...o)=>{const s=t.get(n);if(s!==void 0)return s;const r=e(n,...o);return t.set(n,r),r}}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._abool2=T;exports._abytes2=x;exports._validateObject=N;exports.aInRange=I;exports.bitLen=L;exports.bitMask=j;exports.bytesToNumberBE=H;exports.bytesToNumberLE=_;exports.createHmacDrbg=k;exports.ensureBytes=A;exports.hexToNumber=p;exports.inRange=h;exports.memoized=O;exports.numberToBytesBE=w;exports.numberToBytesLE=$;exports.numberToHexUnpadded=U;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index232.cjs"),m=require("./index243.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),A=BigInt(1);function N(e,a){const t=a.negate();return e?t:a}function x(e,a){if(!Number.isSafeInteger(e)||e<=0||e>a)throw new Error("invalid window size, expected [1.."+a+"], got W="+e)}function b(e,a){x(e,a);const t=Math.ceil(a/e)+1,n=2**(e-1),o=2**e,i=m.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function M(e,a,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),s=e>>r;f>n&&(f-=i,s+=A);const c=a*n,d=c+Math.abs(f)-1,g=f===0,l=f<0,u=a%2!==0;return{nextN:s,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:c}}function O(e,a){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof a))throw new Error("invalid point at index "+n)})}function z(e,a){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!a.isValid(t))throw new Error("invalid scalar at index "+n)})}const S=new WeakMap,I=new WeakMap;function F(e){return I.get(e)||1}function k(e,a){return{constTimeNegate:N,hasPrecomputes(t){return F(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>E;)n&A&&(o=o.add(i)),i=i.double(),n>>=A;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,a),r=[];let f=t,s=f;for(let c=0;c<o;c++){s=f,r.push(s);for(let d=1;d<i;d++)s=s.add(f),r.push(s);f=s.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=b(t,a);for(let s=0;s<f.windows;s++){const{nextN:c,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:h}=M(o,s,f);o=c,g?r=r.add(N(u,n[h])):i=i.add(N(l,n[d]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=b(t,a);for(let f=0;f<r.windows&&o!==E;f++){const{nextN:s,offset:c,isZero:d,isNeg:g}=M(o,f,r);if(o=s,!d){const l=n[c];i=i.add(g?l.negate():l)}}return i},getPrecomputes(t,n,o){let i=S.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&S.set(n,o(i))),i},wNAFCached(t,n,o){const i=F(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=F(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){x(n,a),I.set(t,n),S.delete(t)}}}function L(e,a,t,n){O(t,e),z(n,a);const o=t.length,i=n.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const r=e.ZERO,f=m.bitLen(BigInt(o));let s=1;f>12?s=f-3:f>4?s=f-2:f>0&&(s=2);const c=m.bitMask(s),d=new Array(Number(c)+1).fill(r),g=Math.floor((a.BITS-1)/s)*s;let l=r;for(let u=g;u>=0;u-=s){d.fill(r);for(let w=0;w<i;w++){const p=n[w],y=Number(p>>BigInt(u)&c);d[y]=d[y].add(t[w])}let h=r;for(let w=d.length-1,p=r;w>0;w--)p=p.add(d[w]),h=h.add(p);if(l=l.add(h),u!==0)for(let w=0;w<s;w++)l=l.double()}return l}function Z(e){return B.validateField(e.Fp),m.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...B.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=L;exports.validateBasic=Z;exports.wNAF=k;

package/dist/index244.js

@@ -1,151 +1,180 @@
-import { bytesToHex as d, isBytes as m, hexToBytes as h, abytes as x, concatBytes as U } from "./index233.js";
-import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index233.js";
+import { validateField as M, nLength as z } from "./index232.js";
+import { validateObject as O, bitLen as k, bitMask as x } from "./index243.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const l = /* @__PURE__ */ BigInt(0), a = /* @__PURE__ */ BigInt(1);
-function _(t, e = "") {
-  if (typeof t != "boolean") {
-    const n = e && `"${e}"`;
-    throw new Error(n + "expected boolean, got type=" + typeof t);
-  }
-  return t;
-}
-function k(t, e, n = "") {
-  const o = m(t), i = t == null ? void 0 : t.length, r = e !== void 0;
-  if (!o || r && i !== e) {
-    const c = n && `"${n}" `, f = r ? ` of length ${e}` : "", u = o ? `length=${i}` : `type=${typeof t}`;
-    throw new Error(c + "expected Uint8Array" + f + ", got " + u);
-  }
-  return t;
-}
-function j(t) {
-  const e = t.toString(16);
-  return e.length & 1 ? "0" + e : e;
+const E = BigInt(0), F = BigInt(1);
+function m(e, a) {
+  const t = a.negate();
+  return e ? t : a;
 }
-function E(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? l : BigInt("0x" + t);
+function y(e, a) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > a)
+    throw new Error("invalid window size, expected [1.." + a + "], got W=" + e);
 }
-function H(t) {
-  return E(d(t));
+function N(e, a) {
+  y(e, a);
+  const t = Math.ceil(a / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = x(e), r = BigInt(e);
+  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
 }
-function L(t) {
-  return x(t), E(d(Uint8Array.from(t).reverse()));
+function B(e, a, t) {
+  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
+  let f = Number(e & i), s = e >> r;
+  f > n && (f -= o, s += F);
+  const c = a * n, d = c + Math.abs(f) - 1, g = f === 0, l = f < 0, u = a % 2 !== 0;
+  return { nextN: s, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: c };
 }
-function T(t, e) {
-  return h(t.toString(16).padStart(e * 2, "0"));
-}
-function O(t, e) {
-  return T(t, e).reverse();
-}
-function S(t, e, n) {
-  let o;
-  if (typeof e == "string")
-    try {
-      o = h(e);
-    } catch (i) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
-    }
-  else if (m(e))
-    o = Uint8Array.from(e);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  return o.length, o;
+function L(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+  e.forEach((t, n) => {
+    if (!(t instanceof a))
+      throw new Error("invalid point at index " + n);
+  });
 }
-const g = (t) => typeof t == "bigint" && l <= t;
-function $(t, e, n) {
-  return g(t) && g(e) && g(n) && e <= t && t < n;
+function Z(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array of scalars expected");
+  e.forEach((t, n) => {
+    if (!a.isValid(t))
+      throw new Error("invalid scalar at index " + n);
+  });
 }
-function M(t, e, n, o) {
-  if (!$(e, n, o))
-    throw new Error("expected valid " + t + ": " + n + " <= n < " + o + ", got " + e);
+const b = /* @__PURE__ */ new WeakMap(), I = /* @__PURE__ */ new WeakMap();
+function S(e) {
+  return I.get(e) || 1;
 }
-function N(t) {
-  let e;
-  for (e = 0; t > l; t >>= a, e += 1)
-    ;
-  return e;
-}
-const R = (t) => (a << BigInt(t)) - a;
-function v(t, e, n) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof e != "number" || e < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof n != "function")
-    throw new Error("hmacFn must be a function");
-  const o = (s) => new Uint8Array(s), i = (s) => Uint8Array.of(s);
-  let r = o(t), c = o(t), f = 0;
-  const u = () => {
-    r.fill(1), c.fill(0), f = 0;
-  }, y = (...s) => n(c, r, ...s), w = (s = o(0)) => {
-    c = y(i(0), s), r = y(), s.length !== 0 && (c = y(i(1), s), r = y());
-  }, B = () => {
-    if (f++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let s = 0;
-    const b = [];
-    for (; s < e; ) {
-      r = y();
-      const p = r.slice();
-      b.push(p), s += r.length;
+function v(e, a) {
+  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 > E; )
+        n & F && (i = i.add(o)), o = o.double(), n >>= F;
+      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 } = N(n, a), r = [];
+      let f = t, s = f;
+      for (let c = 0; c < i; c++) {
+        s = f, r.push(s);
+        for (let d = 1; d < o; d++)
+          s = s.add(f), r.push(s);
+        f = s.double();
+      }
+      return r;
+    },
+    /**
+     * 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) {
+      let o = e.ZERO, r = e.BASE;
+      const f = N(t, a);
+      for (let s = 0; s < f.windows; s++) {
+        const { nextN: c, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: h } = B(i, s, f);
+        i = c, g ? r = r.add(m(u, n[h])) : o = o.add(m(l, n[d]));
+      }
+      return { p: o, f: r };
+    },
+    /**
+     * 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 r = N(t, a);
+      for (let f = 0; f < r.windows && i !== E; f++) {
+        const { nextN: s, offset: c, isZero: d, isNeg: g } = B(i, f, r);
+        if (i = s, !d) {
+          const l = n[c];
+          o = o.add(g ? l.negate() : l);
+        }
+      }
+      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 r = S(t);
+      return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, 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) {
+      y(n, a), I.set(t, n), b.delete(t);
     }
-    return U(...b);
-  };
-  return (s, b) => {
-    u(), w(s);
-    let p;
-    for (; !(p = b(B())); )
-      w();
-    return u(), p;
   };
 }
-function z(t, e, n = {}) {
-  if (!t || typeof t != "object")
-    throw new Error("expected valid options object");
-  function o(i, r, c) {
-    const f = t[i];
-    if (c && f === void 0)
-      return;
-    const u = typeof f;
-    if (u !== r || f === null)
-      throw new Error(`param "${i}" is invalid: expected ${r}, got ${u}`);
+function U(e, a, t, n) {
+  L(t, e), Z(n, a);
+  const i = t.length, o = n.length;
+  if (i !== o)
+    throw new Error("arrays of points and scalars must have equal length");
+  const r = e.ZERO, f = k(BigInt(i));
+  let s = 1;
+  f > 12 ? s = f - 3 : f > 4 ? s = f - 2 : f > 0 && (s = 2);
+  const c = x(s), d = new Array(Number(c) + 1).fill(r), g = Math.floor((a.BITS - 1) / s) * s;
+  let l = r;
+  for (let u = g; u >= 0; u -= s) {
+    d.fill(r);
+    for (let w = 0; w < o; w++) {
+      const p = n[w], A = Number(p >> BigInt(u) & c);
+      d[A] = d[A].add(t[w]);
+    }
+    let h = r;
+    for (let w = d.length - 1, p = r; w > 0; w--)
+      p = p.add(d[w]), h = h.add(p);
+    if (l = l.add(h), u !== 0)
+      for (let w = 0; w < s; w++)
+        l = l.double();
   }
-  Object.entries(e).forEach(([i, r]) => o(i, r, !1)), Object.entries(n).forEach(([i, r]) => o(i, r, !0));
+  return l;
 }
-function D(t) {
-  const e = /* @__PURE__ */ new WeakMap();
-  return (n, ...o) => {
-    const i = e.get(n);
-    if (i !== void 0)
-      return i;
-    const r = t(n, ...o);
-    return e.set(n, r), r;
-  };
+function C(e) {
+  return M(e.Fp), O(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...z(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
 }
 export {
-  _ as _abool2,
-  k as _abytes2,
-  z as _validateObject,
-  M as aInRange,
-  x as abytes,
-  W as anumber,
-  N as bitLen,
-  R as bitMask,
-  d as bytesToHex,
-  H as bytesToNumberBE,
-  L as bytesToNumberLE,
-  U as concatBytes,
-  v as createHmacDrbg,
-  S as ensureBytes,
-  h as hexToBytes,
-  E as hexToNumber,
-  $ as inRange,
-  m as isBytes,
-  D as memoized,
-  T as numberToBytesBE,
-  O as numberToBytesLE,
-  j as numberToHexUnpadded,
-  C as randomBytes,
-  G as utf8ToBytes
+  U as pippenger,
+  C as validateBasic,
+  v as wNAF
 };

package/dist/index245.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index244.cjs"),v=require("./index228.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index247.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/index245.js

@@ -1,203 +1,69 @@
-import { bitLen as M, bitMask as y } from "./index244.js";
-import { validateField as I, Field as z, FpInvertBatch as R } from "./index228.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const m = BigInt(0), b = BigInt(1);
-function v(r, t) {
-  const e = t.negate();
-  return r ? e : t;
-}
-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 O(r, t) {
-  if (!Number.isSafeInteger(r) || r <= 0 || r > t)
-    throw new Error("invalid window size, expected [1.." + t + "], got W=" + r);
-}
-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 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 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 _(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);
-  });
-}
-const E = /* @__PURE__ */ new WeakMap(), B = /* @__PURE__ */ new WeakMap();
-function N(r) {
-  return B.get(r) || 1;
-}
-function Z(r) {
-  if (r !== m)
-    throw new Error("invalid wNAF");
-}
-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);
+import { getVersion as n } from "./index247.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 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);
+      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;
   }
-  hasCache(t) {
-    return N(t) !== 1;
+  walk(t) {
+    return l(this, t);
   }
 }
-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 };
-}
-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]);
-    }
-    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();
-  }
-  return w;
-}
-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 };
+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 {
-  P as _createCurveFields,
-  q as mulEndoUnsafe,
-  v as negateCt,
-  D as normalizeZ,
-  K as pippenger,
-  G as wNAF
+  c as BaseError
 };

package/dist/index246.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index248.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index233.cjs");function d(r,i={}){const{dir:n,size:e=32}=i;if(e===0)return r;const t=r.replace("0x","");if(t.length>e*2)throw new a.SizeExceedsPaddingSizeError({size:Math.ceil(t.length/2),targetSize:e,type:"Hex"});return`0x${t[n==="right"?"padEnd":"padStart"](e*2,"0")}`}exports.pad=d;