@gardenfi/utils 2.5.3 → 3.0.0-beta.1

package/dist/index232.js

@@ -1,194 +1,106 @@
-import { AbiEncodingLengthMismatchError as y, InvalidAbiEncodingTypeError as u, InvalidArrayError as g, AbiEncodingArrayLengthMismatchError as l, AbiEncodingBytesSizeMismatchError as b } from "./index134.js";
-import { InvalidAddressError as w } from "./index41.js";
-import { BaseError as A } from "./index78.js";
-import { IntegerOutOfRangeError as x } from "./index221.js";
-import { isAddress as z } from "./index42.js";
-import { concat as f } from "./index137.js";
-import { padHex as d } from "./index237.js";
-import { size as a } from "./index212.js";
-import { slice as E } from "./index159.js";
-import { numberToHex as m, boolToHex as P, stringToHex as S } from "./index33.js";
-import { integerRegex as I } from "./index238.js";
-function K(e, t) {
-  if (e.length !== t.length)
-    throw new y({
-      expectedLength: e.length,
-      givenLength: t.length
-    });
-  const o = L({
-    params: e,
-    values: t
-  }), n = h(o);
-  return n.length === 0 ? "0x" : n;
-}
-function L({ params: e, values: t }) {
-  const o = [];
-  for (let n = 0; n < e.length; n++)
-    o.push(p({ param: e[n], value: t[n] }));
-  return o;
-}
-function p({ param: e, value: t }) {
-  const o = W(e.type);
-  if (o) {
-    const [n, r] = o;
-    return M(t, { length: n, param: { ...e, type: r } });
-  }
-  if (e.type === "tuple")
-    return H(t, {
-      param: e
-    });
-  if (e.type === "address")
-    return B(t);
-  if (e.type === "bool")
-    return T(t);
-  if (e.type.startsWith("uint") || e.type.startsWith("int")) {
-    const n = e.type.startsWith("int"), [, , r = "256"] = I.exec(e.type) ?? [];
-    return $(t, {
-      signed: n,
-      size: Number(r)
-    });
-  }
-  if (e.type.startsWith("bytes"))
-    return N(t, { param: e });
-  if (e.type === "string")
-    return C(t);
-  throw new u(e.type, {
-    docsPath: "/docs/contract/encodeAbiParameters"
-  });
-}
-function h(e) {
-  let t = 0;
-  for (let i = 0; i < e.length; i++) {
-    const { dynamic: c, encoded: s } = e[i];
-    c ? t += 32 : t += a(s);
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index237.js";
+import { createHasher as u, clean as C, rotr as i } from "./index229.js";
+const B = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class E extends D {
+  constructor(o = 32) {
+    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
   }
-  const o = [], n = [];
-  let r = 0;
-  for (let i = 0; i < e.length; i++) {
-    const { dynamic: c, encoded: s } = e[i];
-    c ? (o.push(m(t + r, { size: 32 })), n.push(s), r += a(s)) : o.push(s);
+  get() {
+    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [o, r, t, s, a, f, c, e];
   }
-  return f([...o, ...n]);
-}
-function B(e) {
-  if (!z(e))
-    throw new w({ address: e });
-  return { dynamic: !1, encoded: d(e.toLowerCase()) };
-}
-function M(e, { length: t, param: o }) {
-  const n = t === null;
-  if (!Array.isArray(e))
-    throw new g(e);
-  if (!n && e.length !== t)
-    throw new l({
-      expectedLength: t,
-      givenLength: e.length,
-      type: `${o.type}[${t}]`
-    });
-  let r = !1;
-  const i = [];
-  for (let c = 0; c < e.length; c++) {
-    const s = p({ param: o, value: e[c] });
-    s.dynamic && (r = !0), i.push(s);
+  // prettier-ignore
+  set(o, r, t, s, a, f, c, e) {
+    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
   }
-  if (n || r) {
-    const c = h(i);
-    if (n) {
-      const s = m(i.length, { size: 32 });
-      return {
-        dynamic: !0,
-        encoded: i.length > 0 ? f([s, c]) : s
-      };
+  process(o, r) {
+    for (let x = 0; x < 16; x++, r += 4)
+      h[x] = o.getUint32(r, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
+      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
     }
-    if (r)
-      return { dynamic: !0, encoded: c };
-  }
-  return {
-    dynamic: !1,
-    encoded: f(i.map(({ encoded: c }) => c))
-  };
-}
-function N(e, { param: t }) {
-  const [, o] = t.type.split("bytes"), n = a(e);
-  if (!o) {
-    let r = e;
-    return n % 32 !== 0 && (r = d(r, {
-      dir: "right",
-      size: Math.ceil((e.length - 2) / 2 / 32) * 32
-    })), {
-      dynamic: !0,
-      encoded: f([d(m(n, { size: 32 })), r])
-    };
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
+      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
   }
-  if (n !== Number.parseInt(o))
-    throw new b({
-      expectedSize: Number.parseInt(o),
-      value: e
-    });
-  return { dynamic: !1, encoded: d(e, { dir: "right" }) };
-}
-function T(e) {
-  if (typeof e != "boolean")
-    throw new A(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
-  return { dynamic: !1, encoded: d(P(e)) };
-}
-function $(e, { signed: t, size: o = 256 }) {
-  if (typeof o == "number") {
-    const n = 2n ** (BigInt(o) - (t ? 1n : 0n)) - 1n, r = t ? -n - 1n : 0n;
-    if (e > n || e < r)
-      throw new x({
-        max: n.toString(),
-        min: r.toString(),
-        signed: t,
-        size: o / 8,
-        value: e.toString()
-      });
+  roundClean() {
+    C(h);
   }
-  return {
-    dynamic: !1,
-    encoded: m(e, {
-      size: 32,
-      signed: t
-    })
-  };
-}
-function C(e) {
-  const t = S(e), o = Math.ceil(a(t) / 32), n = [];
-  for (let r = 0; r < o; r++)
-    n.push(d(E(t, r * 32, (r + 1) * 32), {
-      dir: "right"
-    }));
-  return {
-    dynamic: !0,
-    encoded: f([
-      d(m(a(t), { size: 32 })),
-      ...n
-    ])
-  };
-}
-function H(e, { param: t }) {
-  let o = !1;
-  const n = [];
-  for (let r = 0; r < t.components.length; r++) {
-    const i = t.components[r], c = Array.isArray(e) ? r : i.name, s = p({
-      param: i,
-      value: e[c]
-    });
-    n.push(s), s.dynamic && (o = !0);
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
   }
-  return {
-    dynamic: o,
-    encoded: o ? h(n) : f(n.map(({ encoded: r }) => r))
-  };
-}
-function W(e) {
-  const t = e.match(/^(.*)\[(\d+)?\]$/);
-  return t ? (
-    // Return `null` if the array is dynamic.
-    [t[2] ? Number(t[2]) : null, t[1]]
-  ) : void 0;
 }
+const y = /* @__PURE__ */ u(() => new E());
 export {
-  K as encodeAbiParameters,
-  W as getArrayComponents
+  E as SHA256,
+  y as sha256
 };

package/dist/index233.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index159.cjs"),o=require("./index256.cjs"),r=e=>t.slice(o.toSignatureHash(e),0,4);exports.toFunctionSelector=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index35.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;

package/dist/index233.js

@@ -1,6 +1,29 @@
-import { slice as t } from "./index159.js";
-import { toSignatureHash as r } from "./index256.js";
-const c = (o) => t(r(o), 0, 4);
+import { BaseError as u } from "./index35.js";
+function a(r) {
+  let l = !0, i = "", f = 0, t = "", o = !1;
+  for (let n = 0; n < r.length; n++) {
+    const e = r[n];
+    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
+      if (f === 0) {
+        if (e === " " && ["event", "function", ""].includes(t))
+          t = "";
+        else if (t += e, e === ")") {
+          o = !0;
+          break;
+        }
+        continue;
+      }
+      if (e === " ") {
+        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
+        continue;
+      }
+      t += e, i += e;
+    }
+  }
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return t;
+}
 export {
-  c as toFunctionSelector
+  a as normalizeSignature
 };

package/dist/index234.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index256.cjs"),e=t.toSignatureHash;exports.toEventSelector=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index236.cjs"),s=require("./index229.cjs"),o=require("./index244.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;

package/dist/index234.js

@@ -1,5 +1,19 @@
-import { toSignatureHash as t } from "./index256.js";
-const e = t;
+import { hmac as c } from "./index236.js";
+import { randomBytes as m, concatBytes as n } from "./index229.js";
+import { weierstrass as a } from "./index244.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function i(r) {
+  return {
+    hash: r,
+    hmac: (e, ...t) => c(r, e, n(...t)),
+    randomBytes: m
+  };
+}
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
+}
 export {
-  e as toEventSelector
+  p as createCurve,
+  i as getHash
 };

package/dist/index235.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index78.cjs");class t extends o.BaseError{constructor({offset:e}){super(`Offset \`${e}\` cannot be negative.`,{name:"NegativeOffsetError"})}}class i extends o.BaseError{constructor({length:e,position:r}){super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`,{name:"PositionOutOfBoundsError"})}}class n extends o.BaseError{constructor({count:e,limit:r}){super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`,{name:"RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=t;exports.PositionOutOfBoundsError=i;exports.RecursiveReadLimitExceededError=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index229.cjs"),a=require("./index245.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),f=BigInt(1),h=BigInt(2),K=BigInt(3),I=BigInt(4),L=BigInt(5),T=BigInt(8);function g(t,n){const o=t%n;return o>=d?o:n+o}function Q(t,n,o){let r=t;for(;n-- >d;)r*=r,r%=o;return r}function B(t,n){if(t===d)throw new Error("invert: expected non-zero number");if(n<=d)throw new Error("invert: expected positive modulus, got "+n);let o=g(t,n),r=n,s=d,l=f;for(;o!==d;){const c=r/o,e=r%o,i=s-l*c;r=o,o=e,s=l,l=i}if(r!==f)throw new Error("invert: does not exist");return g(s,n)}function x(t,n){const o=(t.ORDER+f)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function V(t,n){const o=(t.ORDER-L)/T,r=t.mul(n,h),s=t.pow(r,o),l=t.mul(n,s),u=t.mul(t.mul(l,h),s),c=t.mul(l,t.sub(u,t.ONE));if(!t.eql(t.sqr(c),n))throw new Error("Cannot find square root");return c}function _(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-f,o=0;for(;n%h===d;)n/=h,o++;let r=h;const s=Z(t);for(;y(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(o===1)return x;let l=s.pow(r,n);const u=(n+f)/h;return function(e,i){if(e.is0(i))return i;if(y(e,i)!==1)throw new Error("Cannot find square root");let w=o,v=e.mul(e.ONE,l),b=e.pow(i,n),E=e.pow(i,u);for(;!e.eql(b,e.ONE);){if(e.is0(b))return e.ZERO;let q=1,m=e.sqr(b);for(;!e.eql(m,e.ONE);)if(q++,m=e.sqr(m),q===w)throw new Error("Cannot find square root");const z=f<<BigInt(w-q-1),S=e.pow(v,z);w=q,v=e.sqr(S),b=e.mul(b,v),E=e.mul(E,S)}return E}}function M(t){return t%I===K?x:t%T===L?V:_(t)}const Y=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},o=Y.reduce((r,s)=>(r[s]="function",r),n);return a.validateObject(t,o)}function O(t,n,o){if(o<d)throw new Error("invalid exponent, negatives unsupported");if(o===d)return t.ONE;if(o===f)return n;let r=t.ONE,s=n;for(;o>d;)o&f&&(r=t.mul(r,s)),s=t.sqr(s),o>>=f;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((u,c,e)=>t.is0(c)?u:(r[e]=u,t.mul(u,c)),t.ONE),l=t.inv(s);return n.reduceRight((u,c,e)=>t.is0(c)?u:(r[e]=t.mul(u,r[e]),t.mul(u,c)),l),r}function y(t,n){const o=(t.ORDER-f)/h,r=t.pow(n,o),s=t.eql(r,t.ONE),l=t.eql(r,t.ZERO),u=t.eql(r,t.neg(t.ONE));if(!s&&!l&&!u)throw new Error("invalid Legendre symbol result");return s?1:l?0:-1}function C(t,n){n!==void 0&&H.anumber(n);const o=n!==void 0?n:t.toString(2).length,r=Math.ceil(o/8);return{nBitLength:o,nByteLength:r}}function Z(t,n,o=!1,r={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:l}=C(t,n);if(l>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let u;const c=Object.freeze({ORDER:t,isLE:o,BITS:s,BYTES:l,MASK:a.bitMask(s),ZERO:d,ONE:f,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&f)===f,neg:e=>g(-e,t),eql:(e,i)=>e===i,sqr:e=>g(e*e,t),add:(e,i)=>g(e+i,t),sub:(e,i)=>g(e-i,t),mul:(e,i)=>g(e*i,t),pow:(e,i)=>O(c,e,i),div:(e,i)=>g(e*B(i,t),t),sqrN:e=>e*e,addN:(e,i)=>e+i,subN:(e,i)=>e-i,mulN:(e,i)=>e*i,inv:e=>B(e,t),sqrt:r.sqrt||(e=>(u||(u=M(t)),u(c,e))),toBytes:e=>o?a.numberToBytesLE(e,l):a.numberToBytesBE(e,l),fromBytes:e=>{if(e.length!==l)throw new Error("Field.fromBytes: expected "+l+" bytes, got "+e.length);return o?a.bytesToNumberLE(e):a.bytesToNumberBE(e)},invertBatch:e=>A(c,e),cmov:(e,i,w)=>w?i:e});return Object.freeze(c)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function j(t){const n=N(t);return n+Math.ceil(n/2)}function P(t,n,o=!1){const r=t.length,s=N(n),l=j(n);if(r<16||r<l||r>1024)throw new Error("expected "+l+"-1024 bytes of input, got "+r);const u=o?a.bytesToNumberLE(t):a.bytesToNumberBE(t),c=g(u,n-f)+f;return o?a.numberToBytesLE(c,s):a.numberToBytesBE(c,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=O;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=j;exports.invert=B;exports.mapHashToField=P;exports.mod=g;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=_;exports.validateField=k;

package/dist/index235.js

@@ -1,23 +1,217 @@
-import { BaseError as o } from "./index78.js";
-class i extends o {
-  constructor({ offset: e }) {
-    super(`Offset \`${e}\` cannot be negative.`, {
-      name: "NegativeOffsetError"
-    });
-  }
+import { anumber as C } from "./index229.js";
+import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index245.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
+function w(t, n) {
+  const o = t % n;
+  return o >= d ? o : n + o;
 }
-class n extends o {
-  constructor({ length: e, position: r }) {
-    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
-  }
+function $(t, n, o) {
+  let r = t;
+  for (; n-- > d; )
+    r *= r, r %= o;
+  return r;
 }
-class c extends o {
-  constructor({ count: e, limit: r }) {
-    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+function B(t, n) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (n <= d)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let o = w(t, n), r = n, s = d, l = f;
+  for (; o !== d; ) {
+    const c = r / o, e = r % o, i = s - l * c;
+    r = o, o = e, s = l, l = i;
   }
+  if (r !== f)
+    throw new Error("invert: does not exist");
+  return w(s, n);
+}
+function M(t, n) {
+  const o = (t.ORDER + f) / L, r = t.pow(n, o);
+  if (!t.eql(t.sqr(r), n))
+    throw new Error("Cannot find square root");
+  return r;
+}
+function H(t, n) {
+  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
+  if (!t.eql(t.sqr(c), n))
+    throw new Error("Cannot find square root");
+  return c;
+}
+function K(t) {
+  if (t < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let n = t - f, o = 0;
+  for (; n % g === d; )
+    n /= g, o++;
+  let r = g;
+  const s = J(t);
+  for (; N(s, r) === 1; )
+    if (r++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (o === 1)
+    return M;
+  let l = s.pow(r, n);
+  const u = (n + f) / g;
+  return function(e, i) {
+    if (e.is0(i))
+      return i;
+    if (N(e, i) !== 1)
+      throw new Error("Cannot find square root");
+    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
+    for (; !e.eql(a, e.ONE); ) {
+      if (e.is0(a))
+        return e.ZERO;
+      let q = 1, v = e.sqr(a);
+      for (; !e.eql(v, e.ONE); )
+        if (q++, v = e.sqr(v), q === h)
+          throw new Error("Cannot find square root");
+      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
+      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
+    }
+    return m;
+  };
+}
+function Q(t) {
+  return t % L === j ? M : t % T === _ ? H : K(t);
+}
+const V = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function P(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
+  return z(t, o);
+}
+function Y(t, n, o) {
+  if (o < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (o === d)
+    return t.ONE;
+  if (o === f)
+    return n;
+  let r = t.ONE, s = n;
+  for (; o > d; )
+    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
+  return r;
+}
+function k(t, n, o = !1) {
+  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
+  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
+}
+function N(t, n) {
+  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
+  if (!s && !l && !u)
+    throw new Error("invalid Legendre symbol result");
+  return s ? 1 : l ? 0 : -1;
+}
+function G(t, n) {
+  n !== void 0 && C(n);
+  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
+  return { nBitLength: o, nByteLength: r };
+}
+function J(t, n, o = !1, r = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: l } = G(t, n);
+  if (l > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let u;
+  const c = Object.freeze({
+    ORDER: t,
+    isLE: o,
+    BITS: s,
+    BYTES: l,
+    MASK: Z(s),
+    ZERO: d,
+    ONE: f,
+    create: (e) => w(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 & f) === f,
+    neg: (e) => w(-e, t),
+    eql: (e, i) => e === i,
+    sqr: (e) => w(e * e, t),
+    add: (e, i) => w(e + i, t),
+    sub: (e, i) => w(e - i, t),
+    mul: (e, i) => w(e * i, t),
+    pow: (e, i) => Y(c, e, i),
+    div: (e, i) => w(e * B(i, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, i) => e + i,
+    subN: (e, i) => e - i,
+    mulN: (e, i) => e * i,
+    inv: (e) => B(e, t),
+    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
+    toBytes: (e) => o ? I(e, l) : y(e, l),
+    fromBytes: (e) => {
+      if (e.length !== l)
+        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
+      return o ? S(e) : x(e);
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => k(c, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, i, h) => h ? i : e
+  });
+  return Object.freeze(c);
+}
+function O(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function U(t) {
+  const n = O(t);
+  return n + Math.ceil(n / 2);
+}
+function D(t, n, o = !1) {
+  const r = t.length, s = O(n), l = U(n);
+  if (r < 16 || r < l || r > 1024)
+    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
+  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
+  return o ? I(c, s) : y(c, s);
 }
 export {
-  i as NegativeOffsetError,
-  n as PositionOutOfBoundsError,
-  c as RecursiveReadLimitExceededError
+  J as Field,
+  k as FpInvertBatch,
+  N as FpLegendre,
+  Y as FpPow,
+  Q as FpSqrt,
+  O as getFieldBytesLength,
+  U as getMinHashLength,
+  B as invert,
+  D as mapHashToField,
+  w as mod,
+  G as nLength,
+  $ as pow2,
+  K as tonelliShanks,
+  P as validateField
 };

package/dist/index236.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index134.cjs"),o=require("./index159.cjs"),u=require("./index233.cjs"),s=require("./index229.cjs"),d=require("./index211.cjs");function b(c){const{abi:r,data:e}=c,n=o.slice(e,0,4),t=r.find(i=>i.type==="function"&&n===u.toFunctionSelector(d.formatAbiItem(i)));if(!t)throw new a.AbiFunctionSignatureNotFoundError(n,{docsPath:"/docs/contract/decodeFunctionData"});return{functionName:t.name,args:"inputs"in t&&t.inputs&&t.inputs.length>0?s.decodeAbiParameters(t.inputs,o.slice(e,4)):void 0}}exports.decodeFunctionData=b;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index229.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;