@gardenfi/utils 2.1.3-beta.1 → 2.1.3-beta.11

package/dist/index278.js

@@ -1,226 +1,19 @@
-import { numberToBytesLE as S, numberToBytesBE as x, bitMask as _, bytesToNumberLE as y, bytesToNumberBE as L, validateObject as M } from "./index294.js";
+import { hmac as c } from "./index293.js";
+import { randomBytes as m, concatBytes as n } from "./index284.js";
+import { weierstrass as a } from "./index297.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const d = BigInt(0), c = BigInt(1), w = /* @__PURE__ */ BigInt(2), C = /* @__PURE__ */ BigInt(3), b = /* @__PURE__ */ BigInt(4), N = /* @__PURE__ */ BigInt(5), m = /* @__PURE__ */ BigInt(8);
-function g(t, i) {
-  const r = t % i;
-  return r >= d ? r : i + r;
-}
-function Z(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 e = c;
-  for (; i > d; )
-    i & c && (e = e * t % r), t = t * t % r, i >>= c;
-  return e;
-}
-function V(t, i, r) {
-  let e = t;
-  for (; i-- > d; )
-    e *= e, e %= r;
-  return e;
-}
-function I(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), e = i, s = d, u = c;
-  for (; r !== d; ) {
-    const o = e / r, n = e % r, l = s - u * o;
-    e = r, r = n, s = u, u = l;
-  }
-  if (e !== c)
-    throw new Error("invert: does not exist");
-  return g(s, i);
-}
-function j(t) {
-  const i = (t - c) / w;
-  let r, e, s;
-  for (r = t - c, e = 0; r % w === d; r /= w, e++)
-    ;
-  for (s = w; s < t && Z(s, i, t) !== t - c; s++)
-    if (s > 1e3)
-      throw new Error("Cannot find square root: likely non-prime P");
-  if (e === 1) {
-    const f = (t + c) / b;
-    return function(n, l) {
-      const h = n.pow(l, f);
-      if (!n.eql(n.sqr(h), l))
-        throw new Error("Cannot find square root");
-      return h;
-    };
-  }
-  const u = (r + c) / w;
-  return function(o, n) {
-    if (o.pow(n, i) === o.neg(o.ONE))
-      throw new Error("Cannot find square root");
-    let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
-    for (; !o.eql(a, o.ONE); ) {
-      if (o.eql(a, o.ZERO))
-        return o.ZERO;
-      let q = 1;
-      for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
-        B = o.sqr(B);
-      const E = o.pow(h, c << BigInt(l - q - 1));
-      h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
-    }
-    return v;
+function i(r) {
+  return {
+    hash: r,
+    hmac: (e, ...t) => c(r, e, n(...t)),
+    randomBytes: m
   };
 }
-function z(t) {
-  if (t % b === C) {
-    const i = (t + c) / b;
-    return function(e, s) {
-      const u = e.pow(s, i);
-      if (!e.eql(e.sqr(u), s))
-        throw new Error("Cannot find square root");
-      return u;
-    };
-  }
-  if (t % m === N) {
-    const i = (t - N) / m;
-    return function(e, s) {
-      const u = e.mul(s, w), f = e.pow(u, i), o = e.mul(s, f), n = e.mul(e.mul(o, w), f), l = e.mul(o, e.sub(n, e.ONE));
-      if (!e.eql(e.sqr(l), s))
-        throw new Error("Cannot find square root");
-      return l;
-    };
-  }
-  return j(t);
-}
-const A = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function Y(t) {
-  const i = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, r = A.reduce((e, s) => (e[s] = "function", e), i);
-  return M(t, r);
-}
-function k(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 e = t.ONE, s = i;
-  for (; r > d; )
-    r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
-  return e;
-}
-function H(t, i) {
-  const r = new Array(i.length), e = i.reduce((u, f, o) => t.is0(f) ? u : (r[o] = u, t.mul(u, f)), t.ONE), s = t.inv(e);
-  return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
-}
-function K(t, i) {
-  const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
-  return { nBitLength: r, nByteLength: e };
-}
-function p(t, i, r = !1, e = {}) {
-  if (t <= d)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  const { nBitLength: s, nByteLength: u } = K(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: _(s),
-    ZERO: d,
-    ONE: c,
-    create: (n) => g(n, t),
-    isValid: (n) => {
-      if (typeof n != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof n);
-      return d <= n && n < t;
-    },
-    is0: (n) => n === d,
-    isOdd: (n) => (n & c) === c,
-    neg: (n) => g(-n, t),
-    eql: (n, l) => n === l,
-    sqr: (n) => g(n * n, t),
-    add: (n, l) => g(n + l, t),
-    sub: (n, l) => g(n - l, t),
-    mul: (n, l) => g(n * l, t),
-    pow: (n, l) => k(o, n, l),
-    div: (n, l) => g(n * I(l, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (n) => n * n,
-    addN: (n, l) => n + l,
-    subN: (n, l) => n - l,
-    mulN: (n, l) => n * l,
-    inv: (n) => I(n, t),
-    sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
-    invertBatch: (n) => H(o, n),
-    // TODO: do we really need constant cmov?
-    // We don't have const-time bigints anyway, so probably will be not very useful
-    cmov: (n, l, h) => h ? l : n,
-    toBytes: (n) => r ? S(n, u) : x(n, u),
-    fromBytes: (n) => {
-      if (n.length !== u)
-        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
-      return r ? y(n) : L(n);
-    }
-  });
-  return Object.freeze(o);
-}
-function T(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 O(t) {
-  const i = T(t);
-  return i + Math.ceil(i / 2);
-}
-function G(t, i, r = !1) {
-  const e = t.length, s = T(i), u = O(i);
-  if (e < 16 || e < u || e > 1024)
-    throw new Error("expected " + u + "-1024 bytes of input, got " + e);
-  const f = r ? y(t) : L(t), o = g(f, i - c) + c;
-  return r ? S(o, s) : x(o, s);
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
 }
 export {
-  p as Field,
-  H as FpInvertBatch,
-  k as FpPow,
-  z as FpSqrt,
-  T as getFieldBytesLength,
-  O as getMinHashLength,
-  I as invert,
-  G as mapHashToField,
-  g as mod,
-  K as nLength,
-  Z as pow,
-  V as pow2,
-  j as tonelliShanks,
-  Y as validateField
+  p as createCurve,
+  i as getHash
 };

package/dist/index279.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index149.cjs"),r=require("./index151.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index284.cjs"),a=require("./index298.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/index279.js

@@ -1,9 +1,217 @@
-import { toBytes as o } from "./index149.js";
-import { keccak256 as r } from "./index151.js";
-const e = (t) => r(o(t));
-function c(t) {
-  return e(t);
+import { anumber as C } from "./index284.js";
+import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index298.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);
+    }
+    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 {
-  c as hashSignature
+  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/index28.cjs

@@ -1,16 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index296.cjs"),M=require("./index159.cjs"),h=require("./index297.cjs");function R(r){const{chainId:o,domain:s,expirationTime:l,issuedAt:m=new Date,nonce:a,notBefore:f,requestId:w,resources:g,scheme:i,uri:c,version:d}=r;{if(o!==Math.floor(o))throw new e.SiweInvalidMessageFieldError({field:"chainId",metaMessages:["- Chain ID must be a EIP-155 chain ID.","- See https://eips.ethereum.org/EIPS/eip-155","",`Provided value: ${o}`]});if(!(E.test(s)||F.test(s)||b.test(s)))throw new e.SiweInvalidMessageFieldError({field:"domain",metaMessages:["- Domain must be an RFC 3986 authority.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${s}`]});if(!A.test(a))throw new e.SiweInvalidMessageFieldError({field:"nonce",metaMessages:["- Nonce must be at least 8 characters.","- Nonce must be alphanumeric.","",`Provided value: ${a}`]});if(!h.isUri(c))throw new e.SiweInvalidMessageFieldError({field:"uri",metaMessages:["- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${c}`]});if(d!=="1")throw new e.SiweInvalidMessageFieldError({field:"version",metaMessages:["- Version must be '1'.","",`Provided value: ${d}`]});if(i&&!P.test(i))throw new e.SiweInvalidMessageFieldError({field:"scheme",metaMessages:["- Scheme must be an RFC 3986 URI scheme.","- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1","",`Provided value: ${i}`]});const t=r.statement;if(t!=null&&t.includes(`
-`))throw new e.SiweInvalidMessageFieldError({field:"statement",metaMessages:["- Statement must not include '\\n'.","",`Provided value: ${t}`]})}const $=M.getAddress(r.address),v=i?`${i}://${s}`:s,I=r.statement?`${r.statement}
-`:"",S=`${v} wants you to sign in with your Ethereum account:
-${$}
-
-${I}`;let n=`URI: ${c}
-Version: ${d}
-Chain ID: ${o}
-Nonce: ${a}
-Issued At: ${m.toISOString()}`;if(l&&(n+=`
-Expiration Time: ${l.toISOString()}`),f&&(n+=`
-Not Before: ${f.toISOString()}`),w&&(n+=`
-Request ID: ${w}`),g){let t=`
-Resources:`;for(const u of g){if(!h.isUri(u))throw new e.SiweInvalidMessageFieldError({field:"resources",metaMessages:["- Every resource must be a RFC 3986 URI.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${u}`]});t+=`
-- ${u}`}n+=t}return`${S}
-${n}`}const E=/^([a-zA-Z0-9]([a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/,F=/^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/,b=/^localhost(:[0-9]{1,5})?$/,A=/^[a-zA-Z0-9]{8,}$/,P=/^([a-zA-Z][a-zA-Z0-9+-.]*)$/;exports.createSiweMessage=R;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index44.cjs"),n=require("./index52.cjs");function l(e){const{key:t="public",name:i="Public Client"}=e;return c.createClient({...e,key:t,name:i,type:"publicClient"}).extend(n.publicActions)}exports.createPublicClient=l;

package/dist/index28.js

@@ -1,116 +1,14 @@
-import { SiweInvalidMessageFieldError as e } from "./index296.js";
-import { getAddress as S } from "./index159.js";
-import { isUri as $ } from "./index297.js";
-function C(n) {
-  const { chainId: i, domain: s, expirationTime: u, issuedAt: g = /* @__PURE__ */ new Date(), nonce: a, notBefore: m, requestId: h, resources: w, scheme: o, uri: c, version: f } = n;
-  {
-    if (i !== Math.floor(i))
-      throw new e({
-        field: "chainId",
-        metaMessages: [
-          "- Chain ID must be a EIP-155 chain ID.",
-          "- See https://eips.ethereum.org/EIPS/eip-155",
-          "",
-          `Provided value: ${i}`
-        ]
-      });
-    if (!(p.test(s) || M.test(s) || x.test(s)))
-      throw new e({
-        field: "domain",
-        metaMessages: [
-          "- Domain must be an RFC 3986 authority.",
-          "- See https://www.rfc-editor.org/rfc/rfc3986",
-          "",
-          `Provided value: ${s}`
-        ]
-      });
-    if (!A.test(a))
-      throw new e({
-        field: "nonce",
-        metaMessages: [
-          "- Nonce must be at least 8 characters.",
-          "- Nonce must be alphanumeric.",
-          "",
-          `Provided value: ${a}`
-        ]
-      });
-    if (!$(c))
-      throw new e({
-        field: "uri",
-        metaMessages: [
-          "- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.",
-          "- See https://www.rfc-editor.org/rfc/rfc3986",
-          "",
-          `Provided value: ${c}`
-        ]
-      });
-    if (f !== "1")
-      throw new e({
-        field: "version",
-        metaMessages: [
-          "- Version must be '1'.",
-          "",
-          `Provided value: ${f}`
-        ]
-      });
-    if (o && !P.test(o))
-      throw new e({
-        field: "scheme",
-        metaMessages: [
-          "- Scheme must be an RFC 3986 URI scheme.",
-          "- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1",
-          "",
-          `Provided value: ${o}`
-        ]
-      });
-    const t = n.statement;
-    if (t != null && t.includes(`
-`))
-      throw new e({
-        field: "statement",
-        metaMessages: [
-          "- Statement must not include '\\n'.",
-          "",
-          `Provided value: ${t}`
-        ]
-      });
-  }
-  const l = S(n.address), v = o ? `${o}://${s}` : s, I = n.statement ? `${n.statement}
-` : "", R = `${v} wants you to sign in with your Ethereum account:
-${l}
-
-${I}`;
-  let r = `URI: ${c}
-Version: ${f}
-Chain ID: ${i}
-Nonce: ${a}
-Issued At: ${g.toISOString()}`;
-  if (u && (r += `
-Expiration Time: ${u.toISOString()}`), m && (r += `
-Not Before: ${m.toISOString()}`), h && (r += `
-Request ID: ${h}`), w) {
-    let t = `
-Resources:`;
-    for (const d of w) {
-      if (!$(d))
-        throw new e({
-          field: "resources",
-          metaMessages: [
-            "- Every resource must be a RFC 3986 URI.",
-            "- See https://www.rfc-editor.org/rfc/rfc3986",
-            "",
-            `Provided value: ${d}`
-          ]
-        });
-      t += `
-- ${d}`;
-    }
-    r += t;
-  }
-  return `${R}
-${r}`;
+import { createClient as n } from "./index44.js";
+import { publicActions as c } from "./index52.js";
+function u(t) {
+  const { key: e = "public", name: i = "Public Client" } = t;
+  return n({
+    ...t,
+    key: e,
+    name: i,
+    type: "publicClient"
+  }).extend(c);
 }
-const p = /^([a-zA-Z0-9]([a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/, M = /^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/, x = /^localhost(:[0-9]{1,5})?$/, A = /^[a-zA-Z0-9]{8,}$/, P = /^([a-zA-Z][a-zA-Z0-9+-.]*)$/;
 export {
-  C as createSiweMessage
+  u as createPublicClient
 };

package/dist/index280.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index281.cjs"),n=require("./index260.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index149.cjs"),r=require("./index151.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index280.js

@@ -1,9 +1,9 @@
-import { normalizeSignature as o } from "./index281.js";
-import { formatAbiItem as n } from "./index260.js";
-const m = (r) => {
-  const t = typeof r == "string" ? r : n(r);
-  return o(t);
-};
+import { toBytes as o } from "./index149.js";
+import { keccak256 as r } from "./index151.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
+}
 export {
-  m as toSignature
+  c as hashSignature
 };

package/dist/index281.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index38.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index282.cjs"),n=require("./index260.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;