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

package/dist/index306.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 c=require("./index315.cjs"),o=require("./index312.cjs"),n=require("./index289.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;

package/dist/index306.js

@@ -1,209 +1,10 @@
-/*! 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 { keccak_256 as f } from "./index315.js";
+import { from as m } from "./index312.js";
+import { fromBytes as s } from "./index289.js";
+function p(t, o = {}) {
+  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
+  return e === "Bytes" ? r : s(r);
 }
 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
+  p as keccak256
 };

package/dist/index307.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index285.cjs"),m=require("./index306.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),A=BigInt(1);function N(e,a){const t=a.negate();return e?t:a}function x(e,a){if(!Number.isSafeInteger(e)||e<=0||e>a)throw new Error("invalid window size, expected [1.."+a+"], got W="+e)}function b(e,a){x(e,a);const t=Math.ceil(a/e)+1,n=2**(e-1),o=2**e,i=m.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function M(e,a,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),s=e>>r;f>n&&(f-=i,s+=A);const c=a*n,d=c+Math.abs(f)-1,g=f===0,l=f<0,u=a%2!==0;return{nextN:s,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:c}}function O(e,a){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof a))throw new Error("invalid point at index "+n)})}function z(e,a){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!a.isValid(t))throw new Error("invalid scalar at index "+n)})}const S=new WeakMap,I=new WeakMap;function F(e){return I.get(e)||1}function k(e,a){return{constTimeNegate:N,hasPrecomputes(t){return F(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>E;)n&A&&(o=o.add(i)),i=i.double(),n>>=A;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,a),r=[];let f=t,s=f;for(let c=0;c<o;c++){s=f,r.push(s);for(let d=1;d<i;d++)s=s.add(f),r.push(s);f=s.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=b(t,a);for(let s=0;s<f.windows;s++){const{nextN:c,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:h}=M(o,s,f);o=c,g?r=r.add(N(u,n[h])):i=i.add(N(l,n[d]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=b(t,a);for(let f=0;f<r.windows&&o!==E;f++){const{nextN:s,offset:c,isZero:d,isNeg:g}=M(o,f,r);if(o=s,!d){const l=n[c];i=i.add(g?l.negate():l)}}return i},getPrecomputes(t,n,o){let i=S.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&S.set(n,o(i))),i},wNAFCached(t,n,o){const i=F(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=F(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){x(n,a),I.set(t,n),S.delete(t)}}}function L(e,a,t,n){O(t,e),z(n,a);const o=t.length,i=n.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const r=e.ZERO,f=m.bitLen(BigInt(o));let s=1;f>12?s=f-3:f>4?s=f-2:f>0&&(s=2);const c=m.bitMask(s),d=new Array(Number(c)+1).fill(r),g=Math.floor((a.BITS-1)/s)*s;let l=r;for(let u=g;u>=0;u-=s){d.fill(r);for(let w=0;w<i;w++){const p=n[w],y=Number(p>>BigInt(u)&c);d[y]=d[y].add(t[w])}let h=r;for(let w=d.length-1,p=r;w>0;w--)p=p.add(d[w]),h=h.add(p);if(l=l.add(h),u!==0)for(let w=0;w<s;w++)l=l.double()}return l}function Z(e){return B.validateField(e.Fp),m.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...B.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=L;exports.validateBasic=Z;exports.wNAF=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index308.cjs"),a=require("./index303.cjs");function d(r){let i=!0,t="",e=0,n="",o=!1;for(let s=0;s<r.length;s++){const u=r[s];if(["(",")",","].includes(u)&&(i=!0),u==="("&&e++,u===")"&&e--,!!i){if(e===0){if(u===" "&&["event","function","error",""].includes(n))n="";else if(n+=u,u===")"){o=!0;break}continue}if(u===" "){r[s-1]!==","&&t!==","&&t!==",("&&(t="",i=!1);continue}n+=u,t+=u}}if(!o)throw new a.BaseError("Unable to normalize signature.");return n}function l(r,i){const t=typeof r,e=i.type;switch(e){case"address":return c.validate(r,{strict:!1});case"bool":return t==="boolean";case"function":return t==="string";case"string":return t==="string";default:return e==="tuple"&&"components"in i?Object.values(i.components).every((n,o)=>l(Object.values(r)[o],n)):/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e)?t==="number"||t==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e)?t==="string"||r instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e)?Array.isArray(r)&&r.every(n=>l(n,{...i,type:e.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function f(r,i,t){for(const e in r){const n=r[e],o=i[e];if(n.type==="tuple"&&o.type==="tuple"&&"components"in n&&"components"in o)return f(n.components,o.components,t[e]);const s=[n.type,o.type];if(s.includes("address")&&s.includes("bytes20")?!0:s.includes("address")&&s.includes("string")?c.validate(t[e],{strict:!1}):s.includes("address")&&s.includes("bytes")?c.validate(t[e],{strict:!1}):!1)return s}}exports.getAmbiguousTypes=f;exports.isArgOfType=l;exports.normalizeSignature=d;

package/dist/index307.js

@@ -1,180 +1,65 @@
-import { validateField as M, nLength as z } from "./index285.js";
-import { validateObject as O, bitLen as k, bitMask as x } from "./index306.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const E = BigInt(0), F = BigInt(1);
-function m(e, a) {
-  const t = a.negate();
-  return e ? t : a;
-}
-function y(e, a) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > a)
-    throw new Error("invalid window size, expected [1.." + a + "], got W=" + e);
-}
-function N(e, a) {
-  y(e, a);
-  const t = Math.ceil(a / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = x(e), r = BigInt(e);
-  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
-}
-function B(e, a, t) {
-  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
-  let f = Number(e & i), s = e >> r;
-  f > n && (f -= o, s += F);
-  const c = a * n, d = c + Math.abs(f) - 1, g = f === 0, l = f < 0, u = a % 2 !== 0;
-  return { nextN: s, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: c };
-}
-function L(e, a) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((t, n) => {
-    if (!(t instanceof a))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function Z(e, a) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((t, n) => {
-    if (!a.isValid(t))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const b = /* @__PURE__ */ new WeakMap(), I = /* @__PURE__ */ new WeakMap();
-function S(e) {
-  return I.get(e) || 1;
-}
-function v(e, a) {
-  return {
-    constTimeNegate: m,
-    hasPrecomputes(t) {
-      return S(t) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(t, n, i = e.ZERO) {
-      let o = t;
-      for (; n > E; )
-        n & F && (i = i.add(o)), o = o.double(), n >>= F;
-      return i;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(t, n) {
-      const { windows: i, windowSize: o } = N(n, a), r = [];
-      let f = t, s = f;
-      for (let c = 0; c < i; c++) {
-        s = f, r.push(s);
-        for (let d = 1; d < o; d++)
-          s = s.add(f), r.push(s);
-        f = s.double();
-      }
-      return r;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(t, n, i) {
-      let o = e.ZERO, r = e.BASE;
-      const f = N(t, a);
-      for (let s = 0; s < f.windows; s++) {
-        const { nextN: c, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: h } = B(i, s, f);
-        i = c, g ? r = r.add(m(u, n[h])) : o = o.add(m(l, n[d]));
-      }
-      return { p: o, f: r };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(t, n, i, o = e.ZERO) {
-      const r = N(t, a);
-      for (let f = 0; f < r.windows && i !== E; f++) {
-        const { nextN: s, offset: c, isZero: d, isNeg: g } = B(i, f, r);
-        if (i = s, !d) {
-          const l = n[c];
-          o = o.add(g ? l.negate() : l);
+import { validate as c } from "./index308.js";
+import { BaseError as f } from "./index303.js";
+function y(r) {
+  let i = !0, t = "", e = 0, n = "", o = !1;
+  for (let s = 0; s < r.length; s++) {
+    const u = r[s];
+    if (["(", ")", ","].includes(u) && (i = !0), u === "(" && e++, u === ")" && e--, !!i) {
+      if (e === 0) {
+        if (u === " " && ["event", "function", "error", ""].includes(n))
+          n = "";
+        else if (n += u, u === ")") {
+          o = !0;
+          break;
         }
+        continue;
+      }
+      if (u === " ") {
+        r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
+        continue;
       }
-      return o;
-    },
-    getPrecomputes(t, n, i) {
-      let o = b.get(n);
-      return o || (o = this.precomputeWindow(n, t), t !== 1 && b.set(n, i(o))), o;
-    },
-    wNAFCached(t, n, i) {
-      const o = S(t);
-      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
-    },
-    wNAFCachedUnsafe(t, n, i, o) {
-      const r = S(t);
-      return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, t, i), n, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(t, n) {
-      y(n, a), I.set(t, n), b.delete(t);
+      n += u, t += u;
     }
-  };
+  }
+  if (!o)
+    throw new f("Unable to normalize signature.");
+  return n;
 }
-function U(e, a, t, n) {
-  L(t, e), Z(n, a);
-  const i = t.length, o = n.length;
-  if (i !== o)
-    throw new Error("arrays of points and scalars must have equal length");
-  const r = e.ZERO, f = k(BigInt(i));
-  let s = 1;
-  f > 12 ? s = f - 3 : f > 4 ? s = f - 2 : f > 0 && (s = 2);
-  const c = x(s), d = new Array(Number(c) + 1).fill(r), g = Math.floor((a.BITS - 1) / s) * s;
-  let l = r;
-  for (let u = g; u >= 0; u -= s) {
-    d.fill(r);
-    for (let w = 0; w < o; w++) {
-      const p = n[w], A = Number(p >> BigInt(u) & c);
-      d[A] = d[A].add(t[w]);
-    }
-    let h = r;
-    for (let w = d.length - 1, p = r; w > 0; w--)
-      p = p.add(d[w]), h = h.add(p);
-    if (l = l.add(h), u !== 0)
-      for (let w = 0; w < s; w++)
-        l = l.double();
+function l(r, i) {
+  const t = typeof r, e = i.type;
+  switch (e) {
+    case "address":
+      return c(r, { strict: !1 });
+    case "bool":
+      return t === "boolean";
+    case "function":
+      return t === "string";
+    case "string":
+      return t === "string";
+    default:
+      return e === "tuple" && "components" in i ? Object.values(i.components).every((n, o) => l(Object.values(r)[o], n)) : /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e) ? t === "number" || t === "bigint" : /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e) ? t === "string" || r instanceof Uint8Array : /[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e) ? Array.isArray(r) && r.every((n) => l(n, {
+        ...i,
+        // Pop off `[]` or `[M]` from end of type
+        type: e.replace(/(\[[0-9]{0,}\])$/, "")
+      })) : !1;
   }
-  return l;
 }
-function C(e) {
-  return M(e.Fp), O(e, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...z(e.n, e.nBitLength),
-    ...e,
-    p: e.Fp.ORDER
-  });
+function a(r, i, t) {
+  for (const e in r) {
+    const n = r[e], o = i[e];
+    if (n.type === "tuple" && o.type === "tuple" && "components" in n && "components" in o)
+      return a(n.components, o.components, t[e]);
+    const s = [n.type, o.type];
+    if (s.includes("address") && s.includes("bytes20") ? !0 : s.includes("address") && s.includes("string") ? c(t[e], {
+      strict: !1
+    }) : s.includes("address") && s.includes("bytes") ? c(t[e], {
+      strict: !1
+    }) : !1)
+      return s;
+  }
 }
 export {
-  U as pippenger,
-  C as validateBasic,
-  v as wNAF
+  a as getAmbiguousTypes,
+  l as isArgOfType,
+  y as normalizeSignature
 };

package/dist/index308.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index296.cjs"),y=require("./index260.cjs"),s=require("./index309.cjs"),z=require("./index298.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index312.cjs"),c=require("./index316.cjs"),o=require("./index303.cjs"),m=require("./index306.cjs"),b=/^0x[a-fA-F0-9]{40}$/;function i(e,t={}){const{strict:s=!0}=t;if(!b.test(e))throw new a({address:e,cause:new l});if(s){if(e.toLowerCase()===e)return;if(d(e)!==e)throw new a({address:e,cause:new h})}}function d(e){if(c.checksum.has(e))return c.checksum.get(e);i(e,{strict:!1});const t=e.substring(2).toLowerCase(),s=m.keccak256(f.fromString(t),{as:"Bytes"}),n=t.split("");for(let r=0;r<40;r+=2)s[r>>1]>>4>=8&&n[r]&&(n[r]=n[r].toUpperCase()),(s[r>>1]&15)>=8&&n[r+1]&&(n[r+1]=n[r+1].toUpperCase());const u=`0x${n.join("")}`;return c.checksum.set(e,u),u}function p(e,t={}){const{strict:s=!0}=t??{};try{return i(e,{strict:s}),!0}catch{return!1}}class a extends o.BaseError{constructor({address:t,cause:s}){super(`Address "${t}" is invalid.`,{cause:s}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidAddressError"})}}class l extends o.BaseError{constructor(){super("Address is not a 20 byte (40 hexadecimal character) value."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidInputError"})}}class h extends o.BaseError{constructor(){super("Address does not match its checksum counterpart."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidChecksumError"})}}exports.InvalidAddressError=a;exports.InvalidChecksumError=h;exports.InvalidInputError=l;exports.assert=i;exports.checksum=d;exports.validate=p;

package/dist/index308.js

@@ -1,66 +1,80 @@
-import { BaseError as c } from "./index296.js";
-import { padRight as h } from "./index260.js";
-import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index309.js";
-import { assertSize as p } from "./index298.js";
-const l = /* @__PURE__ */ new TextEncoder();
-function E(e) {
-  return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
-}
-function z(e) {
-  return e instanceof Uint8Array ? e : new Uint8Array(e);
-}
-function y(e, t = {}) {
-  const { size: r } = t;
-  let n = e;
-  r && (p(e, r), n = h(e, r));
-  let i = n.slice(2);
-  i.length % 2 && (i = `0${i}`);
-  const f = i.length / 2, a = new Uint8Array(f);
-  for (let s = 0, o = 0; s < f; s++) {
-    const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
-    if (d === void 0 || u === void 0)
-      throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
-    a[s] = d * 16 + u;
+import { fromString as d } from "./index312.js";
+import { checksum as o } from "./index316.js";
+import { BaseError as c } from "./index303.js";
+import { keccak256 as f } from "./index306.js";
+const l = /^0x[a-fA-F0-9]{40}$/;
+function u(r, t = {}) {
+  const { strict: s = !0 } = t;
+  if (!l.test(r))
+    throw new i({
+      address: r,
+      cause: new h()
+    });
+  if (s) {
+    if (r.toLowerCase() === r)
+      return;
+    if (m(r) !== r)
+      throw new i({
+        address: r,
+        cause: new p()
+      });
   }
-  return a;
 }
-function C(e, t = {}) {
-  const { size: r } = t, n = l.encode(e);
-  return typeof r == "number" ? (g(n, r), x(n, r)) : n;
+function m(r) {
+  if (o.has(r))
+    return o.get(r);
+  u(r, { strict: !1 });
+  const t = r.substring(2).toLowerCase(), s = f(d(t), { as: "Bytes" }), n = t.split("");
+  for (let e = 0; e < 40; e += 2)
+    s[e >> 1] >> 4 >= 8 && n[e] && (n[e] = n[e].toUpperCase()), (s[e >> 1] & 15) >= 8 && n[e + 1] && (n[e + 1] = n[e + 1].toUpperCase());
+  const a = `0x${n.join("")}`;
+  return o.set(r, a), a;
 }
-function x(e, t) {
-  return m(e, { dir: "right", size: t });
+function k(r, t = {}) {
+  const { strict: s = !0 } = t ?? {};
+  try {
+    return u(r, { strict: s }), !0;
+  } catch {
+    return !1;
+  }
 }
-function U(e) {
-  return e.length;
+class i extends c {
+  constructor({ address: t, cause: s }) {
+    super(`Address "${t}" is invalid.`, {
+      cause: s
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidAddressError"
+    });
+  }
 }
-class B extends c {
-  constructor({ givenSize: t, maxSize: r }) {
-    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
+class h extends c {
+  constructor() {
+    super("Address is not a 20 byte (40 hexadecimal character) value."), Object.defineProperty(this, "name", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: "Bytes.SizeOverflowError"
+      value: "Address.InvalidInputError"
     });
   }
 }
-class O extends c {
-  constructor({ size: t, targetSize: r, type: n }) {
-    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
+class p extends c {
+  constructor() {
+    super("Address does not match its checksum counterpart."), Object.defineProperty(this, "name", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: "Bytes.SizeExceedsPaddingSizeError"
+      value: "Address.InvalidChecksumError"
     });
   }
 }
 export {
-  O as SizeExceedsPaddingSizeError,
-  B as SizeOverflowError,
-  E as from,
-  z as fromArray,
-  y as fromHex,
-  C as fromString,
-  x as padRight,
-  U as size
+  i as InvalidAddressError,
+  p as InvalidChecksumError,
+  h as InvalidInputError,
+  u as assert,
+  m as checksum,
+  k as validate
 };

package/dist/index309.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index308.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=/^(.*)\[([0-9]*)\]$/,t=/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/,g=/^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;exports.arrayRegex=e;exports.bytesRegex=t;exports.integerRegex=g;