@gardenfi/utils 2.0.6-beta.3 → 2.0.6-beta.5

package/dist/index104.js

@@ -1,20 +1,234 @@
-import { toHex as i } from "./index24.js";
-import { toYParitySignatureArray as c } from "./index87.js";
-function d(r) {
-  if (!r || r.length === 0)
-    return [];
-  const t = [];
-  for (const e of r) {
-    const { contractAddress: s, chainId: o, nonce: n, ...a } = e;
-    t.push([
-      o ? i(o) : "0x",
-      s,
-      n ? i(n) : "0x",
-      ...c({}, a)
-    ]);
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
+function h(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function b(t) {
+  if (!h(t))
+    throw new Error("Uint8Array expected");
+}
+function O(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function B(t) {
+  b(t);
+  let n = "";
+  for (let r = 0; r < t.length; r++)
+    n += T[t[r]];
+  return n;
+}
+function S(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function U(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? d : BigInt("0x" + t);
+}
+const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function E(t) {
+  if (t >= s._0 && t <= s._9)
+    return t - s._0;
+  if (t >= s.A && t <= s.F)
+    return t - (s.A - 10);
+  if (t >= s.a && t <= s.f)
+    return t - (s.a - 10);
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  const n = t.length, r = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const e = new Uint8Array(r);
+  for (let o = 0, i = 0; o < r; o++, i += 2) {
+    const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
+    if (a === void 0 || f === void 0) {
+      const c = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
+    }
+    e[o] = a * 16 + f;
+  }
+  return e;
+}
+function V(t) {
+  return U(B(t));
+}
+function H(t) {
+  return b(t), U(B(Uint8Array.from(t).reverse()));
+}
+function v(t, n) {
+  return m(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return v(t, n).reverse();
+}
+function M(t) {
+  return m(S(t));
+}
+function R(t, n, r) {
+  let e;
+  if (typeof n == "string")
+    try {
+      e = m(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
+    }
+  else if (h(n))
+    e = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = e.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(t + " of length " + r + " expected, got " + o);
+  return e;
+}
+function _(...t) {
+  let n = 0;
+  for (let e = 0; e < t.length; e++) {
+    const o = t[e];
+    b(o), n += o.length;
+  }
+  const r = new Uint8Array(n);
+  for (let e = 0, o = 0; e < t.length; e++) {
+    const i = t[e];
+    r.set(i, o), o += i.length;
   }
+  return r;
+}
+function j(t, n) {
+  if (t.length !== n.length)
+    return !1;
+  let r = 0;
+  for (let e = 0; e < t.length; e++)
+    r |= t[e] ^ n[e];
+  return r === 0;
+}
+function z(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+const w = (t) => typeof t == "bigint" && d <= t;
+function N(t, n, r) {
+  return w(t) && w(n) && w(r) && n <= t && t < r;
+}
+function D(t, n, r, e) {
+  if (!N(n, r, e))
+    throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
+}
+function G(t) {
+  let n;
+  for (n = 0; t > d; t >>= y, n += 1)
+    ;
+  return n;
+}
+function P(t, n) {
+  return t >> BigInt(n) & y;
+}
+function W(t, n, r) {
+  return t | (r ? y : d) << BigInt(n);
+}
+const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function J(t, n, r) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof n != "number" || n < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof r != "function")
+    throw new Error("hmacFn must be a function");
+  let e = p(t), o = p(t), i = 0;
+  const a = () => {
+    e.fill(1), o.fill(0), i = 0;
+  }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
+    o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
+  }, x = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let u = 0;
+    const l = [];
+    for (; u < n; ) {
+      e = f();
+      const g = e.slice();
+      l.push(g), u += e.length;
+    }
+    return _(...l);
+  };
+  return (u, l) => {
+    a(), c(u);
+    let g;
+    for (; !(g = l(x())); )
+      c();
+    return a(), g;
+  };
+}
+const k = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  stringOrUint8Array: (t) => typeof t == "string" || h(t),
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, n) => n.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function K(t, n, r = {}) {
+  const e = (o, i, a) => {
+    const f = k[i];
+    if (typeof f != "function")
+      throw new Error("invalid validator function");
+    const c = t[o];
+    if (!(a && c === void 0) && !f(c, t))
+      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
+  };
+  for (const [o, i] of Object.entries(n))
+    e(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    e(o, i, !0);
   return t;
 }
+const Q = () => {
+  throw new Error("not implemented");
+};
+function X(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (r, ...e) => {
+    const o = n.get(r);
+    if (o !== void 0)
+      return o;
+    const i = t(r, ...e);
+    return n.set(r, i), i;
+  };
+}
 export {
-  d as serializeAuthorizationList
+  D as aInRange,
+  O as abool,
+  b as abytes,
+  P as bitGet,
+  G as bitLen,
+  q as bitMask,
+  W as bitSet,
+  B as bytesToHex,
+  V as bytesToNumberBE,
+  H as bytesToNumberLE,
+  _ as concatBytes,
+  J as createHmacDrbg,
+  R as ensureBytes,
+  j as equalBytes,
+  m as hexToBytes,
+  U as hexToNumber,
+  N as inRange,
+  h as isBytes,
+  X as memoized,
+  Q as notImplemented,
+  v as numberToBytesBE,
+  C as numberToBytesLE,
+  S as numberToHexUnpadded,
+  M as numberToVarBytesBE,
+  z as utf8ToBytes,
+  K as validateObject
 };

package/dist/index105.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index54.cjs"),d=require("./index29.cjs"),l=require("./index58.cjs");function a(e){if(!e||e.length===0)return[];const n=[];for(let t=0;t<e.length;t++){const{address:i,storageKeys:r}=e[t];for(let s=0;s<r.length;s++)if(r[s].length-2!==64)throw new d.InvalidStorageKeySizeError({storageKey:r[s]});if(!l.isAddress(i,{strict:!1}))throw new o.InvalidAddressError({address:i});n.push([i,r])}return n}exports.serializeAccessList=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index62.cjs"),y=require("./index104.cjs");/*! 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 E(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){E(e,r);const t=Math.ceil(r/e)+1,n=2**(e-1);return{windows:t,windowSize:n}}function O(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 x(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=new WeakMap,N=new WeakMap;function S(e){return N.get(e)||1}function L(e,r){return{constTimeNegate:m,hasPrecomputes(t){return S(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>I;)n&p&&(o=o.add(i)),i=i.double(),n>>=p;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,r),a=[];let c=t,d=c;for(let g=0;g<o;g++){d=c,a.push(d);for(let l=1;l<i;l++)d=d.add(c),a.push(d);c=d.double()}return a},wNAF(t,n,o){const{windows:i,windowSize:a}=b(t,r);let c=e.ZERO,d=e.BASE;const g=BigInt(2**t-1),l=2**t,w=BigInt(t);for(let u=0;u<i;u++){const s=u*a;let f=Number(o&g);o>>=w,f>a&&(f-=l,o+=p);const h=s,M=s+Math.abs(f)-1,F=u%2!==0,z=f<0;f===0?d=d.add(m(F,n[h])):c=c.add(m(z,n[M]))}return{p:c,f:d}},wNAFUnsafe(t,n,o,i=e.ZERO){const{windows:a,windowSize:c}=b(t,r),d=BigInt(2**t-1),g=2**t,l=BigInt(t);for(let w=0;w<a;w++){const u=w*c;if(o===I)break;let s=Number(o&d);if(o>>=l,s>c&&(s-=g,o+=p),s===0)continue;let f=n[u+Math.abs(s)-1];s<0&&(f=f.negate()),i=i.add(f)}return i},getPrecomputes(t,n,o){let i=B.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&B.set(n,o(i))),i},wNAFCached(t,n,o){const i=S(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const a=S(t);return a===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(a,this.getPrecomputes(a,t,o),n,i)},setWindowSize(t,n){E(n,r),N.set(t,n),B.delete(t)}}}function j(e,r,t,n){if(O(t,e),x(n,r),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=y.bitLen(BigInt(t.length)),a=i>12?i-3:i>4?i-2:i?2:1,c=(1<<a)-1,d=new Array(c+1).fill(o),g=Math.floor((r.BITS-1)/a)*a;let l=o;for(let w=g;w>=0;w-=a){d.fill(o);for(let s=0;s<n.length;s++){const f=n[s],h=Number(f>>BigInt(w)&BigInt(c));d[h]=d[h].add(t[s])}let u=o;for(let s=d.length-1,f=o;s>0;s--)f=f.add(d[s]),u=u.add(f);if(l=l.add(u),w!==0)for(let s=0;s<a;s++)l=l.double()}return l}function k(e){return A.validateField(e.Fp),y.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=j;exports.validateBasic=k;exports.wNAF=L;

package/dist/index105.js

@@ -1,21 +1,175 @@
-import { InvalidAddressError as s } from "./index54.js";
-import { InvalidStorageKeySizeError as l } from "./index29.js";
-import { isAddress as f } from "./index58.js";
-function a(r) {
-  if (!r || r.length === 0)
-    return [];
-  const n = [];
-  for (let o = 0; o < r.length; o++) {
-    const { address: i, storageKeys: e } = r[o];
-    for (let t = 0; t < e.length; t++)
-      if (e[t].length - 2 !== 64)
-        throw new l({ storageKey: e[t] });
-    if (!f(i, { strict: !1 }))
-      throw new s({ address: i });
-    n.push([i, e]);
+import { validateField as z, nLength as F } from "./index62.js";
+import { validateObject as x, bitLen as O } from "./index104.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 n;
+  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 {
-  a as serializeAccessList
+  Z as pippenger,
+  U as validateBasic,
+  v as wNAF
 };

package/dist/index106.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index114.cjs"),s=require("./index111.cjs"),o=require("./index115.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index65.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;

package/dist/index106.js

@@ -1,19 +1,15 @@
-import { hmac as c } from "./index114.js";
-import { concatBytes as m, randomBytes as n } from "./index111.js";
-import { weierstrass as a } from "./index115.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function i(r) {
-  return {
-    hash: r,
-    hmac: (e, ...t) => c(r, e, m(...t)),
-    randomBytes: n
-  };
+import { BaseError as o } from "./index65.js";
+class d extends o {
+  constructor({ offset: r, position: s, size: e }) {
+    super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
+  }
 }
-function p(r, e) {
-  const t = (o) => a({ ...r, ...i(o) });
-  return { ...t(e), create: t };
+class n extends o {
+  constructor({ size: r, targetSize: s, type: e }) {
+    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
+  }
 }
 export {
-  p as createCurve,
-  i as getHash
+  n as SizeExceedsPaddingSizeError,
+  d as SliceOffsetOutOfBoundsError
 };

package/dist/index107.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index116.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),c=BigInt(1),w=BigInt(2),j=BigInt(3),E=BigInt(4),S=BigInt(5),I=BigInt(8);function g(t,i){const r=t%i;return r>=d?r:i+r}function L(t,i,r){if(i<d)throw new Error("invalid exponent, negatives unsupported");if(r<=d)throw new Error("invalid modulus");if(r===c)return d;let n=c;for(;i>d;)i&c&&(n=n*t%r),t=t*t%r,i>>=c;return n}function H(t,i,r){let n=t;for(;i-- >d;)n*=n,n%=r;return n}function m(t,i){if(t===d)throw new Error("invert: expected non-zero number");if(i<=d)throw new Error("invert: expected positive modulus, got "+i);let r=g(t,i),n=i,s=d,u=c;for(;r!==d;){const o=n/r,e=n%r,l=s-u*o;n=r,r=e,s=u,u=l}if(n!==c)throw new Error("invert: does not exist");return g(s,i)}function T(t){const i=(t-c)/w;let r,n,s;for(r=t-c,n=0;r%w===d;r/=w,n++);for(s=w;s<t&&L(s,i,t)!==t-c;s++)if(s>1e3)throw new Error("Cannot find square root: likely non-prime P");if(n===1){const f=(t+c)/E;return function(e,l){const h=e.pow(l,f);if(!e.eql(e.sqr(h),l))throw new Error("Cannot find square root");return h}}const u=(r+c)/w;return function(o,e){if(o.pow(e,i)===o.neg(o.ONE))throw new Error("Cannot find square root");let l=n,h=o.pow(o.mul(o.ONE,s),r),v=o.pow(e,u),q=o.pow(e,r);for(;!o.eql(q,o.ONE);){if(o.eql(q,o.ZERO))return o.ZERO;let b=1;for(let B=o.sqr(q);b<l&&!o.eql(B,o.ONE);b++)B=o.sqr(B);const y=o.pow(h,c<<BigInt(l-b-1));h=o.sqr(y),v=o.mul(v,y),q=o.mul(q,h),l=b}return v}}function x(t){if(t%E===j){const i=(t+c)/E;return function(n,s){const u=n.pow(s,i);if(!n.eql(n.sqr(u),s))throw new Error("Cannot find square root");return u}}if(t%I===S){const i=(t-S)/I;return function(n,s){const u=n.mul(s,w),f=n.pow(u,i),o=n.mul(s,f),e=n.mul(n.mul(o,w),f),l=n.mul(o,n.sub(e,n.ONE));if(!n.eql(n.sqr(l),s))throw new Error("Cannot find square root");return l}}return T(t)}const Z=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const i={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},r=Z.reduce((n,s)=>(n[s]="function",n),i);return a.validateObject(t,r)}function M(t,i,r){if(r<d)throw new Error("invalid exponent, negatives unsupported");if(r===d)return t.ONE;if(r===c)return i;let n=t.ONE,s=i;for(;r>d;)r&c&&(n=t.mul(n,s)),s=t.sqr(s),r>>=c;return n}function _(t,i){const r=new Array(i.length),n=i.reduce((u,f,o)=>t.is0(f)?u:(r[o]=u,t.mul(u,f)),t.ONE),s=t.inv(n);return i.reduceRight((u,f,o)=>t.is0(f)?u:(r[o]=t.mul(u,r[o]),t.mul(u,f)),s),r}function p(t,i){const r=i!==void 0?i:t.toString(2).length,n=Math.ceil(r/8);return{nBitLength:r,nByteLength:n}}function z(t,i,r=!1,n={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:u}=p(t,i);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let f;const o=Object.freeze({ORDER:t,isLE:r,BITS:s,BYTES:u,MASK:a.bitMask(s),ZERO:d,ONE:c,create:e=>g(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return d<=e&&e<t},is0:e=>e===d,isOdd:e=>(e&c)===c,neg:e=>g(-e,t),eql:(e,l)=>e===l,sqr:e=>g(e*e,t),add:(e,l)=>g(e+l,t),sub:(e,l)=>g(e-l,t),mul:(e,l)=>g(e*l,t),pow:(e,l)=>M(o,e,l),div:(e,l)=>g(e*m(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>m(e,t),sqrt:n.sqrt||(e=>(f||(f=x(t)),f(o,e))),invertBatch:e=>_(o,e),cmov:(e,l,h)=>h?l:e,toBytes:e=>r?a.numberToBytesLE(e,u):a.numberToBytesBE(e,u),fromBytes:e=>{if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);return r?a.bytesToNumberLE(e):a.bytesToNumberBE(e)}});return Object.freeze(o)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const i=t.toString(2).length;return Math.ceil(i/8)}function C(t){const i=N(t);return i+Math.ceil(i/2)}function A(t,i,r=!1){const n=t.length,s=N(i),u=C(i);if(n<16||n<u||n>1024)throw new Error("expected "+u+"-1024 bytes of input, got "+n);const f=r?a.bytesToNumberLE(t):a.bytesToNumberBE(t),o=g(f,i-c)+c;return r?a.numberToBytesLE(o,s):a.numberToBytesBE(o,s)}exports.Field=z;exports.FpInvertBatch=_;exports.FpPow=M;exports.FpSqrt=x;exports.getFieldBytesLength=N;exports.getMinHashLength=C;exports.invert=m;exports.mapHashToField=A;exports.mod=g;exports.nLength=p;exports.pow=L;exports.pow2=H;exports.tonelliShanks=T;exports.validateField=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=`Ethereum Signed Message:
+`;exports.presignMessagePrefix=e;