@gardenfi/utils 3.1.1-beta.16 → 3.1.1-beta.18

package/dist/index241.js

@@ -1,29 +1,22 @@
-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;
-    }
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function s(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  const n = t.length;
+  let l = new Uint32Array(n), c = new Uint32Array(n);
+  for (let e = 0; e < n; e++) {
+    const { h: u, l: f } = s(t[e], r);
+    [l[e], c[e]] = [u, f];
   }
-  if (!o)
-    throw new u("Unable to normalize signature.");
-  return t;
+  return [l, c];
 }
+const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  a as normalizeSignature
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
 };

package/dist/index242.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index245.cjs"),s=require("./index237.cjs"),o=require("./index253.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 e=require("./index243.cjs"),n=require("./index227.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index242.js

@@ -1,19 +1,9 @@
-import { hmac as c } from "./index245.js";
-import { randomBytes as m, concatBytes as n } from "./index237.js";
-import { weierstrass as a } from "./index253.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 };
-}
+import { normalizeSignature as o } from "./index243.js";
+import { formatAbiItem as n } from "./index227.js";
+const m = (r) => {
+  const t = typeof r == "string" ? r : n(r);
+  return o(t);
+};
 export {
-  p as createCurve,
-  i as getHash
+  m as toSignature
 };

package/dist/index243.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index237.cjs"),a=require("./index244.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index60.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/index243.js

@@ -1,217 +1,29 @@
-import { anumber as C } from "./index237.js";
-import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index244.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;
-}
-function $(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 = 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);
+import { BaseError as u } from "./index60.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;
     }
-    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);
+  }
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return t;
 }
 export {
-  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
+  a as normalizeSignature
 };

package/dist/index244.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const w=BigInt(0),m=BigInt(1);function y(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function d(t){if(!y(t))throw new Error("Uint8Array expected")}function I(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}function N(t){const e=t.toString(16);return e.length&1?"0"+e:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?w:BigInt("0x"+t)}const U=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",_=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function E(t){if(d(t),U)return t.toHex();let e="";for(let r=0;r<t.length;r++)e+=_[t[r]];return e}const u={_0:48,_9:57,A:65,F:70,a:97,f:102};function B(t){if(t>=u._0&&t<=u._9)return t-u._0;if(t>=u.A&&t<=u.F)return t-(u.A-10);if(t>=u.a&&t<=u.f)return t-(u.a-10)}function A(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(U)return Uint8Array.fromHex(t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=B(t.charCodeAt(i)),f=B(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)}n[o]=a*16+f}return n}function k(t){return h(E(t))}function O(t){return d(t),h(E(Uint8Array.from(t).reverse()))}function T(t,e){return A(t.toString(16).padStart(e*2,"0"))}function F(t,e){return T(t,e).reverse()}function M(t,e,r){let n;if(typeof e=="string")try{n=A(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(y(e))n=Uint8Array.from(e);else throw new Error(t+" must be hex string or Uint8Array");const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(t+" of length "+r+" expected, got "+o);return n}function v(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];d(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}const b=t=>typeof t=="bigint"&&w<=t;function H(t,e,r){return b(t)&&b(e)&&b(r)&&e<=t&&t<r}function R(t,e,r,n){if(!H(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function j(t){let e;for(e=0;t>w;t>>=m,e+=1);return e}const V=t=>(m<<BigInt(t))-m,p=t=>new Uint8Array(t),x=t=>Uint8Array.from(t);function z(t,e,r){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 r!="function")throw new Error("hmacFn must be a function");let n=p(t),o=p(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},f=(...s)=>r(o,n,...s),c=(s=p(0))=>{o=f(x([0]),s),n=f(),s.length!==0&&(o=f(x([1]),s),n=f())},S=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const l=[];for(;s<e;){n=f();const g=n.slice();l.push(g),s+=n.length}return v(...l)};return(s,l)=>{a(),c(s);let g;for(;!(g=l(S()));)c();return a(),g}}const C={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"||y(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function D(t,e,r={}){const n=(o,i,a)=>{const f=C[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(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}function L(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=R;exports.abool=I;exports.abytes=d;exports.bitLen=j;exports.bitMask=V;exports.bytesToHex=E;exports.bytesToNumberBE=k;exports.bytesToNumberLE=O;exports.concatBytes=v;exports.createHmacDrbg=z;exports.ensureBytes=M;exports.hexToBytes=A;exports.hexToNumber=h;exports.inRange=H;exports.isBytes=y;exports.memoized=L;exports.numberToBytesBE=T;exports.numberToBytesLE=F;exports.numberToHexUnpadded=N;exports.validateObject=D;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index32.cjs"),r=require("./index45.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index244.js

@@ -1,209 +1,9 @@
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
-function b(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function h(t) {
-  if (!b(t))
-    throw new Error("Uint8Array expected");
-}
-function k(t, n) {
-  if (typeof n != "boolean")
-    throw new Error(t + " boolean expected, got " + n);
-}
-function F(t) {
-  const n = t.toString(16);
-  return n.length & 1 ? "0" + n : n;
-}
-function E(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? w : BigInt("0x" + t);
-}
-const U = (
-  // @ts-ignore
-  typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
-), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
-function x(t) {
-  if (h(t), U)
-    return t.toHex();
-  let n = "";
-  for (let e = 0; e < t.length; e++)
-    n += S[t[e]];
-  return n;
-}
-const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function m(t) {
-  if (t >= u._0 && t <= u._9)
-    return t - u._0;
-  if (t >= u.A && t <= u.F)
-    return t - (u.A - 10);
-  if (t >= u.a && t <= u.f)
-    return t - (u.a - 10);
-}
-function B(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  if (U)
-    return Uint8Array.fromHex(t);
-  const n = t.length, e = n / 2;
-  if (n % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + n);
-  const r = new Uint8Array(e);
-  for (let o = 0, i = 0; o < e; o++, i += 2) {
-    const a = m(t.charCodeAt(i)), f = m(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);
-    }
-    r[o] = a * 16 + f;
-  }
-  return r;
-}
-function O(t) {
-  return E(x(t));
-}
-function V(t) {
-  return h(t), E(x(Uint8Array.from(t).reverse()));
-}
-function T(t, n) {
-  return B(t.toString(16).padStart(n * 2, "0"));
-}
-function C(t, n) {
-  return T(t, n).reverse();
-}
-function M(t, n, e) {
-  let r;
-  if (typeof n == "string")
-    try {
-      r = B(n);
-    } catch (i) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
-    }
-  else if (b(n))
-    r = Uint8Array.from(n);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const o = r.length;
-  if (typeof e == "number" && o !== e)
-    throw new Error(t + " of length " + e + " expected, got " + o);
-  return r;
-}
-function H(...t) {
-  let n = 0;
-  for (let r = 0; r < t.length; r++) {
-    const o = t[r];
-    h(o), n += o.length;
-  }
-  const e = new Uint8Array(n);
-  for (let r = 0, o = 0; r < t.length; r++) {
-    const i = t[r];
-    e.set(i, o), o += i.length;
-  }
-  return e;
-}
-const y = (t) => typeof t == "bigint" && w <= t;
-function I(t, n, e) {
-  return y(t) && y(n) && y(e) && n <= t && t < e;
-}
-function R(t, n, e, r) {
-  if (!I(n, e, r))
-    throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
-}
-function j(t) {
-  let n;
-  for (n = 0; t > w; t >>= p, n += 1)
-    ;
-  return n;
-}
-const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
-function D(t, n, e) {
-  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 e != "function")
-    throw new Error("hmacFn must be a function");
-  let r = d(t), o = d(t), i = 0;
-  const a = () => {
-    r.fill(1), o.fill(0), i = 0;
-  }, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
-    o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
-  }, v = () => {
-    if (i++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let s = 0;
-    const l = [];
-    for (; s < n; ) {
-      r = f();
-      const g = r.slice();
-      l.push(g), s += r.length;
-    }
-    return H(...l);
-  };
-  return (s, l) => {
-    a(), c(s);
-    let g;
-    for (; !(g = l(v())); )
-      c();
-    return a(), g;
-  };
-}
-const _ = {
-  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" || b(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 P(t, n, e = {}) {
-  const r = (o, i, a) => {
-    const f = _[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))
-    r(o, i, !1);
-  for (const [o, i] of Object.entries(e))
-    r(o, i, !0);
-  return t;
-}
-function W(t) {
-  const n = /* @__PURE__ */ new WeakMap();
-  return (e, ...r) => {
-    const o = n.get(e);
-    if (o !== void 0)
-      return o;
-    const i = t(e, ...r);
-    return n.set(e, i), i;
-  };
+import { toBytes as o } from "./index32.js";
+import { keccak256 as r } from "./index45.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
 }
 export {
-  R as aInRange,
-  k as abool,
-  h as abytes,
-  j as bitLen,
-  z as bitMask,
-  x as bytesToHex,
-  O as bytesToNumberBE,
-  V as bytesToNumberLE,
-  H as concatBytes,
-  D as createHmacDrbg,
-  M as ensureBytes,
-  B as hexToBytes,
-  E as hexToNumber,
-  I as inRange,
-  b as isBytes,
-  W as memoized,
-  T as numberToBytesBE,
-  C as numberToBytesLE,
-  F as numberToHexUnpadded,
-  P as validateObject
+  c as hashSignature
 };

package/dist/index245.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index237.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index60.cjs"),o=require("./index126.cjs");function s(n,e){const t=(n.details||"").toLowerCase(),i=n instanceof c.BaseError?n.walk(r=>(r==null?void 0:r.code)===o.ExecutionRevertedError.code):n;return i instanceof c.BaseError?new o.ExecutionRevertedError({cause:n,message:i.details}):o.ExecutionRevertedError.nodeMessage.test(t)?new o.ExecutionRevertedError({cause:n,message:n.details}):o.FeeCapTooHighError.nodeMessage.test(t)?new o.FeeCapTooHighError({cause:n,maxFeePerGas:e==null?void 0:e.maxFeePerGas}):o.FeeCapTooLowError.nodeMessage.test(t)?new o.FeeCapTooLowError({cause:n,maxFeePerGas:e==null?void 0:e.maxFeePerGas}):o.NonceTooHighError.nodeMessage.test(t)?new o.NonceTooHighError({cause:n,nonce:e==null?void 0:e.nonce}):o.NonceTooLowError.nodeMessage.test(t)?new o.NonceTooLowError({cause:n,nonce:e==null?void 0:e.nonce}):o.NonceMaxValueError.nodeMessage.test(t)?new o.NonceMaxValueError({cause:n,nonce:e==null?void 0:e.nonce}):o.InsufficientFundsError.nodeMessage.test(t)?new o.InsufficientFundsError({cause:n}):o.IntrinsicGasTooHighError.nodeMessage.test(t)?new o.IntrinsicGasTooHighError({cause:n,gas:e==null?void 0:e.gas}):o.IntrinsicGasTooLowError.nodeMessage.test(t)?new o.IntrinsicGasTooLowError({cause:n,gas:e==null?void 0:e.gas}):o.TransactionTypeNotSupportedError.nodeMessage.test(t)?new o.TransactionTypeNotSupportedError({cause:n}):o.TipAboveFeeCapError.nodeMessage.test(t)?new o.TipAboveFeeCapError({cause:n,maxFeePerGas:e==null?void 0:e.maxFeePerGas,maxPriorityFeePerGas:e==null?void 0:e.maxPriorityFeePerGas}):new o.UnknownNodeError({cause:n})}exports.getNodeError=s;

package/dist/index245.js

@@ -1,45 +1,27 @@
-import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index237.js";
-class r extends d {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, u(t);
-    const h = H(i);
-    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 o = this.blockLen, e = new Uint8Array(o);
-    e.set(h.length > o ? t.create().update(h).digest() : h);
-    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), l(e);
-  }
-  update(t) {
-    return a(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a(this), p(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: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
+import { BaseError as c } from "./index60.js";
+import { ExecutionRevertedError as t, FeeCapTooHighError as u, FeeCapTooLowError as d, NonceTooHighError as a, NonceTooLowError as f, NonceMaxValueError as w, InsufficientFundsError as r, IntrinsicGasTooHighError as E, IntrinsicGasTooLowError as m, TransactionTypeNotSupportedError as x, TipAboveFeeCapError as F, UnknownNodeError as M } from "./index126.js";
+function P(o, e) {
+  const n = (o.details || "").toLowerCase(), s = o instanceof c ? o.walk((i) => (i == null ? void 0 : i.code) === t.code) : o;
+  return s instanceof c ? new t({
+    cause: o,
+    message: s.details
+  }) : t.nodeMessage.test(n) ? new t({
+    cause: o,
+    message: o.details
+  }) : u.nodeMessage.test(n) ? new u({
+    cause: o,
+    maxFeePerGas: e == null ? void 0 : e.maxFeePerGas
+  }) : d.nodeMessage.test(n) ? new d({
+    cause: o,
+    maxFeePerGas: e == null ? void 0 : e.maxFeePerGas
+  }) : a.nodeMessage.test(n) ? new a({ cause: o, nonce: e == null ? void 0 : e.nonce }) : f.nodeMessage.test(n) ? new f({ cause: o, nonce: e == null ? void 0 : e.nonce }) : w.nodeMessage.test(n) ? new w({ cause: o, nonce: e == null ? void 0 : e.nonce }) : r.nodeMessage.test(n) ? new r({ cause: o }) : E.nodeMessage.test(n) ? new E({ cause: o, gas: e == null ? void 0 : e.gas }) : m.nodeMessage.test(n) ? new m({ cause: o, gas: e == null ? void 0 : e.gas }) : x.nodeMessage.test(n) ? new x({ cause: o }) : F.nodeMessage.test(n) ? new F({
+    cause: o,
+    maxFeePerGas: e == null ? void 0 : e.maxFeePerGas,
+    maxPriorityFeePerGas: e == null ? void 0 : e.maxPriorityFeePerGas
+  }) : new M({
+    cause: o
+  });
 }
-const y = (n, t, i) => new r(n, t).update(i).digest();
-y.create = (n, t) => new r(n, t);
 export {
-  r as HMAC,
-  y as hmac
+  P as getNodeError
 };