@gardenfi/utils 2.4.4 → 2.4.5-beta.1

package/dist/index306.js

@@ -1,10 +1,6 @@
-import { keccak_256 as f } from "./index236.js";
-import { from as m } from "./index312.js";
-import { fromBytes as s } from "./index294.js";
-function p(t, o = {}) {
-  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
-  return e === "Bytes" ? r : s(r);
-}
+const e = /^(.*)\[([0-9]*)\]$/, t = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, 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)?$/;
 export {
-  p as keccak256
+  e as arrayRegex,
+  t as bytesRegex,
+  n as integerRegex
 };

package/dist/index307.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index265.cjs"),w=require("./index305.cjs"),N=require("./index300.cjs"),c=require("./index262.cjs"),x=require("./index306.cjs");function P({checksumAddress:e,parameters:r,values:n}){const t=[];for(let o=0;o<r.length;o++)t.push(f({checksumAddress:e,parameter:r[o],value:n[o]}));return t}function f({checksumAddress:e=!1,parameter:r,value:n}){const t=r,o=S(t.type);if(o){const[i,s]=o;return h(n,{checksumAddress:e,length:i,parameter:{...t,type:s}})}if(t.type==="tuple")return A(n,{checksumAddress:e,parameter:t});if(t.type==="address")return y(n,{checksum:e});if(t.type==="bool")return g(n);if(t.type.startsWith("uint")||t.type.startsWith("int")){const i=t.type.startsWith("int"),[,,s="256"]=x.integerRegex.exec(t.type)??[];return b(n,{signed:i,size:Number(s)})}if(t.type.startsWith("bytes"))return l(n,{type:t.type});if(t.type==="string")return z(n);throw new m.InvalidTypeError(t.type)}function u(e){let r=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?r+=32:r+=c.size(a)}const n=[],t=[];let o=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?(n.push(c.fromNumber(r+o,{size:32})),t.push(a),o+=c.size(a)):n.push(a)}return c.concat(...n,...t)}function y(e,r){const{checksum:n=!1}=r;return w.assert(e,{strict:n}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function h(e,r){const{checksumAddress:n,length:t,parameter:o}=r,i=t===null;if(!Array.isArray(e))throw new m.InvalidArrayError(e);if(!i&&e.length!==t)throw new m.ArrayLengthMismatchError({expectedLength:t,givenLength:e.length,type:`${o.type}[${t}]`});let s=!1;const a=[];for(let d=0;d<e.length;d++){const p=f({checksumAddress:n,parameter:o,value:e[d]});p.dynamic&&(s=!0),a.push(p)}if(i||s){const d=u(a);if(i){const p=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(p,d):p}}if(s)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function l(e,{type:r}){const[,n]=r.split("bytes"),t=c.size(e);if(!n){let o=e;return t%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(t,{size:32})),o)}}if(t!==Number.parseInt(n))throw new m.BytesSizeMismatchError({expectedSize:Number.parseInt(n),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function g(e){if(typeof e!="boolean")throw new N.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function b(e,{signed:r,size:n}){if(typeof n=="number"){const t=2n**(BigInt(n)-(r?1n:0n))-1n,o=r?-t-1n:0n;if(e>t||e<o)throw new c.IntegerOutOfRangeError({max:t.toString(),min:o.toString(),signed:r,size:n/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:r})}}function z(e){const r=c.fromString(e),n=Math.ceil(c.size(r)/32),t=[];for(let o=0;o<n;o++)t.push(c.padRight(c.slice(r,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(r),{size:32})),...t)}}function A(e,r){const{checksumAddress:n,parameter:t}=r;let o=!1;const i=[];for(let s=0;s<t.components.length;s++){const a=t.components[s],d=Array.isArray(e)?s:a.name,p=f({checksumAddress:n,parameter:a,value:e[d]});i.push(p),p.dynamic&&(o=!0)}return{dynamic:o,encoded:o?u(i):c.concat(...i.map(({encoded:s})=>s))}}function S(e){const r=e.match(/^(.*)\[(\d+)?\]$/);return r?[r[2]?Number(r[2]):null,r[1]]:void 0}exports.encode=u;exports.encodeAddress=y;exports.encodeArray=h;exports.encodeBoolean=g;exports.encodeBytes=l;exports.encodeNumber=b;exports.encodeString=z;exports.encodeTuple=A;exports.getArrayComponents=S;exports.prepareParameter=f;exports.prepareParameters=P;

package/dist/index307.js

@@ -1,65 +1,197 @@
-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;
+import { InvalidTypeError as g, InvalidArrayError as b, ArrayLengthMismatchError as w, BytesSizeMismatchError as z } from "./index265.js";
+import { assert as x } from "./index305.js";
+import { BaseError as S } from "./index300.js";
+import { size as d, fromNumber as f, concat as p, padLeft as h, fromBoolean as A, IntegerOutOfRangeError as E, padRight as y, fromString as I, slice as B } from "./index262.js";
+import { integerRegex as L } from "./index306.js";
+function q({ checksumAddress: e, parameters: n, values: r }) {
+  const t = [];
+  for (let o = 0; o < n.length; o++)
+    t.push(u({
+      checksumAddress: e,
+      parameter: n[o],
+      value: r[o]
+    }));
+  return t;
+}
+function u({ checksumAddress: e = !1, parameter: n, value: r }) {
+  const t = n, o = k(t.type);
+  if (o) {
+    const [i, c] = o;
+    return P(r, {
+      checksumAddress: e,
+      length: i,
+      parameter: {
+        ...t,
+        type: c
       }
-      n += u, t += u;
+    });
+  }
+  if (t.type === "tuple")
+    return R(r, {
+      checksumAddress: e,
+      parameter: t
+    });
+  if (t.type === "address")
+    return N(r, {
+      checksum: e
+    });
+  if (t.type === "bool")
+    return C(r);
+  if (t.type.startsWith("uint") || t.type.startsWith("int")) {
+    const i = t.type.startsWith("int"), [, , c = "256"] = L.exec(t.type) ?? [];
+    return M(r, {
+      signed: i,
+      size: Number(c)
+    });
+  }
+  if (t.type.startsWith("bytes"))
+    return $(r, { type: t.type });
+  if (t.type === "string")
+    return W(r);
+  throw new g(t.type);
+}
+function l(e) {
+  let n = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? n += 32 : n += d(s);
+  }
+  const r = [], t = [];
+  let o = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? (r.push(f(n + o, { size: 32 })), t.push(s), o += d(s)) : r.push(s);
+  }
+  return p(...r, ...t);
+}
+function N(e, n) {
+  const { checksum: r = !1 } = n;
+  return x(e, { strict: r }), {
+    dynamic: !1,
+    encoded: h(e.toLowerCase())
+  };
+}
+function P(e, n) {
+  const { checksumAddress: r, length: t, parameter: o } = n, i = t === null;
+  if (!Array.isArray(e))
+    throw new b(e);
+  if (!i && e.length !== t)
+    throw new w({
+      expectedLength: t,
+      givenLength: e.length,
+      type: `${o.type}[${t}]`
+    });
+  let c = !1;
+  const s = [];
+  for (let a = 0; a < e.length; a++) {
+    const m = u({
+      checksumAddress: r,
+      parameter: o,
+      value: e[a]
+    });
+    m.dynamic && (c = !0), s.push(m);
+  }
+  if (i || c) {
+    const a = l(s);
+    if (i) {
+      const m = f(s.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: s.length > 0 ? p(m, a) : m
+      };
     }
+    if (c)
+      return { dynamic: !0, encoded: a };
   }
-  if (!o)
-    throw new f("Unable to normalize signature.");
-  return n;
+  return {
+    dynamic: !1,
+    encoded: p(...s.map(({ encoded: a }) => a))
+  };
 }
-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;
+function $(e, { type: n }) {
+  const [, r] = n.split("bytes"), t = d(e);
+  if (!r) {
+    let o = e;
+    return t % 32 !== 0 && (o = y(o, Math.ceil((e.length - 2) / 2 / 32) * 32)), {
+      dynamic: !0,
+      encoded: p(h(f(t, { size: 32 })), o)
+    };
   }
+  if (t !== Number.parseInt(r))
+    throw new z({
+      expectedSize: Number.parseInt(r),
+      value: e
+    });
+  return { dynamic: !1, encoded: y(e) };
 }
-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;
+function C(e) {
+  if (typeof e != "boolean")
+    throw new S(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: h(A(e)) };
+}
+function M(e, { signed: n, size: r }) {
+  if (typeof r == "number") {
+    const t = 2n ** (BigInt(r) - (n ? 1n : 0n)) - 1n, o = n ? -t - 1n : 0n;
+    if (e > t || e < o)
+      throw new E({
+        max: t.toString(),
+        min: o.toString(),
+        signed: n,
+        size: r / 8,
+        value: e.toString()
+      });
   }
+  return {
+    dynamic: !1,
+    encoded: f(e, {
+      size: 32,
+      signed: n
+    })
+  };
+}
+function W(e) {
+  const n = I(e), r = Math.ceil(d(n) / 32), t = [];
+  for (let o = 0; o < r; o++)
+    t.push(y(B(n, o * 32, (o + 1) * 32)));
+  return {
+    dynamic: !0,
+    encoded: p(y(f(d(n), { size: 32 })), ...t)
+  };
+}
+function R(e, n) {
+  const { checksumAddress: r, parameter: t } = n;
+  let o = !1;
+  const i = [];
+  for (let c = 0; c < t.components.length; c++) {
+    const s = t.components[c], a = Array.isArray(e) ? c : s.name, m = u({
+      checksumAddress: r,
+      parameter: s,
+      value: e[a]
+    });
+    i.push(m), m.dynamic && (o = !0);
+  }
+  return {
+    dynamic: o,
+    encoded: o ? l(i) : p(...i.map(({ encoded: c }) => c))
+  };
+}
+function k(e) {
+  const n = e.match(/^(.*)\[(\d+)?\]$/);
+  return n ? (
+    // Return `null` if the array is dynamic.
+    [n[2] ? Number(n[2]) : null, n[1]]
+  ) : void 0;
 }
 export {
-  a as getAmbiguousTypes,
-  l as isArgOfType,
-  y as normalizeSignature
+  l as encode,
+  N as encodeAddress,
+  P as encodeArray,
+  C as encodeBoolean,
+  $ as encodeBytes,
+  M as encodeNumber,
+  W as encodeString,
+  R as encodeTuple,
+  k as getArrayComponents,
+  u as prepareParameter,
+  q as prepareParameters
 };

package/dist/index308.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index312.cjs"),c=require("./index313.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(n,a,y){let i="";if(y)for(const e of Object.entries(y)){if(!e)continue;let s="";for(const t of e[1])s+=`[${t.type}${t.name?`:${t.name}`:""}]`;i+=`(${e[0]}{${s}})`}return a?`${a}:${n}${i}`:n}const d=new Map([["address",{type:"address"}],["bool",{type:"bool"}],["bytes",{type:"bytes"}],["bytes32",{type:"bytes32"}],["int",{type:"int256"}],["int256",{type:"int256"}],["string",{type:"string"}],["uint",{type:"uint256"}],["uint8",{type:"uint8"}],["uint16",{type:"uint16"}],["uint24",{type:"uint24"}],["uint32",{type:"uint32"}],["uint64",{type:"uint64"}],["uint96",{type:"uint96"}],["uint112",{type:"uint112"}],["uint160",{type:"uint160"}],["uint192",{type:"uint192"}],["uint256",{type:"uint256"}],["address owner",{type:"address",name:"owner"}],["address to",{type:"address",name:"to"}],["bool approved",{type:"bool",name:"approved"}],["bytes _data",{type:"bytes",name:"_data"}],["bytes data",{type:"bytes",name:"data"}],["bytes signature",{type:"bytes",name:"signature"}],["bytes32 hash",{type:"bytes32",name:"hash"}],["bytes32 r",{type:"bytes32",name:"r"}],["bytes32 root",{type:"bytes32",name:"root"}],["bytes32 s",{type:"bytes32",name:"s"}],["string name",{type:"string",name:"name"}],["string symbol",{type:"string",name:"symbol"}],["string tokenURI",{type:"string",name:"tokenURI"}],["uint tokenId",{type:"uint256",name:"tokenId"}],["uint8 v",{type:"uint8",name:"v"}],["uint256 balance",{type:"uint256",name:"balance"}],["uint256 tokenId",{type:"uint256",name:"tokenId"}],["uint256 value",{type:"uint256",name:"value"}],["event:address indexed from",{type:"address",name:"from",indexed:!0}],["event:address indexed to",{type:"address",name:"to",indexed:!0}],["event:uint indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}],["event:uint256 indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}]]);exports.getParameterCacheKey=r;exports.parameterCache=d;

package/dist/index308.js

@@ -1,80 +1,71 @@
-import { fromString as d } from "./index312.js";
-import { checksum as o } from "./index313.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()
-      });
-  }
-}
-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 k(r, t = {}) {
-  const { strict: s = !0 } = t ?? {};
-  try {
-    return u(r, { strict: s }), !0;
-  } catch {
-    return !1;
-  }
-}
-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 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: "Address.InvalidInputError"
-    });
-  }
-}
-class p extends c {
-  constructor() {
-    super("Address does not match its checksum counterpart."), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Address.InvalidChecksumError"
-    });
-  }
+function d(n, y, i) {
+  let a = "";
+  if (i)
+    for (const e of Object.entries(i)) {
+      if (!e)
+        continue;
+      let s = "";
+      for (const t of e[1])
+        s += `[${t.type}${t.name ? `:${t.name}` : ""}]`;
+      a += `(${e[0]}{${s}})`;
+    }
+  return y ? `${y}:${n}${a}` : n;
 }
+const p = /* @__PURE__ */ new Map([
+  // Unnamed
+  ["address", { type: "address" }],
+  ["bool", { type: "bool" }],
+  ["bytes", { type: "bytes" }],
+  ["bytes32", { type: "bytes32" }],
+  ["int", { type: "int256" }],
+  ["int256", { type: "int256" }],
+  ["string", { type: "string" }],
+  ["uint", { type: "uint256" }],
+  ["uint8", { type: "uint8" }],
+  ["uint16", { type: "uint16" }],
+  ["uint24", { type: "uint24" }],
+  ["uint32", { type: "uint32" }],
+  ["uint64", { type: "uint64" }],
+  ["uint96", { type: "uint96" }],
+  ["uint112", { type: "uint112" }],
+  ["uint160", { type: "uint160" }],
+  ["uint192", { type: "uint192" }],
+  ["uint256", { type: "uint256" }],
+  // Named
+  ["address owner", { type: "address", name: "owner" }],
+  ["address to", { type: "address", name: "to" }],
+  ["bool approved", { type: "bool", name: "approved" }],
+  ["bytes _data", { type: "bytes", name: "_data" }],
+  ["bytes data", { type: "bytes", name: "data" }],
+  ["bytes signature", { type: "bytes", name: "signature" }],
+  ["bytes32 hash", { type: "bytes32", name: "hash" }],
+  ["bytes32 r", { type: "bytes32", name: "r" }],
+  ["bytes32 root", { type: "bytes32", name: "root" }],
+  ["bytes32 s", { type: "bytes32", name: "s" }],
+  ["string name", { type: "string", name: "name" }],
+  ["string symbol", { type: "string", name: "symbol" }],
+  ["string tokenURI", { type: "string", name: "tokenURI" }],
+  ["uint tokenId", { type: "uint256", name: "tokenId" }],
+  ["uint8 v", { type: "uint8", name: "v" }],
+  ["uint256 balance", { type: "uint256", name: "balance" }],
+  ["uint256 tokenId", { type: "uint256", name: "tokenId" }],
+  ["uint256 value", { type: "uint256", name: "value" }],
+  // Indexed
+  [
+    "event:address indexed from",
+    { type: "address", name: "from", indexed: !0 }
+  ],
+  ["event:address indexed to", { type: "address", name: "to", indexed: !0 }],
+  [
+    "event:uint indexed tokenId",
+    { type: "uint256", name: "tokenId", indexed: !0 }
+  ],
+  [
+    "event:uint256 indexed tokenId",
+    { type: "uint256", name: "tokenId", indexed: !0 }
+  ]
+]);
 export {
-  i as InvalidAddressError,
-  p as InvalidChecksumError,
-  h as InvalidInputError,
-  u as assert,
-  m as checksum,
-  k as validate
+  d as getParameterCacheKey,
+  p as parameterCache
 };

package/dist/index309.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const lt=require("./index297.cjs"),p=require("./index310.cjs"),K=require("./index311.cjs"),et=require("./index289.cjs"),N=require("./index294.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function nt(e){e.lowS!==void 0&&p.abool("lowS",e.lowS),e.prehash!==void 0&&p.abool("prehash",e.prehash)}class ot extends Error{constructor(s=""){super(s)}}const z={Err:ot,_tlv:{encode:(e,s)=>{const{Err:t}=z;if(e<0||e>256)throw new t("tlv.encode: wrong tag");if(s.length&1)throw new t("tlv.encode: unpadded data");const m=s.length/2,g=p.numberToHexUnpadded(m);if(g.length/2&128)throw new t("tlv.encode: long form length too big");const B=m>127?p.numberToHexUnpadded(g.length/2|128):"";return p.numberToHexUnpadded(e)+B+g+s},decode(e,s){const{Err:t}=z;let m=0;if(e<0||e>256)throw new t("tlv.encode: wrong tag");if(s.length<2||s[m++]!==e)throw new t("tlv.decode: wrong tlv");const g=s[m++],B=!!(g&128);let u=0;if(!B)u=g;else{const R=g&127;if(!R)throw new t("tlv.decode(long): indefinite length not supported");if(R>4)throw new t("tlv.decode(long): byte length is too big");const q=s.subarray(m,m+R);if(q.length!==R)throw new t("tlv.decode: length bytes not complete");if(q[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const L of q)u=u<<8|L;if(m+=R,u<128)throw new t("tlv.decode(long): not minimal encoding")}const S=s.subarray(m,m+u);if(S.length!==u)throw new t("tlv.decode: wrong value length");return{v:S,l:s.subarray(m+u)}}},_int:{encode(e){const{Err:s}=z;if(e<k)throw new s("integer: negative integers are not allowed");let t=p.numberToHexUnpadded(e);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new s("unexpected DER parsing assertion: unpadded hex");return t},decode(e){const{Err:s}=z;if(e[0]&128)throw new s("invalid signature integer: negative");if(e[0]===0&&!(e[1]&128))throw new s("invalid signature integer: unnecessary leading zero");return p.bytesToNumberBE(e)}},toSig(e){const{Err:s,_int:t,_tlv:m}=z,g=p.ensureBytes("signature",e),{v:B,l:u}=m.decode(48,g);if(u.length)throw new s("invalid signature: left bytes after parsing");const{v:S,l:R}=m.decode(2,B),{v:q,l:L}=m.decode(2,R);if(L.length)throw new s("invalid signature: left bytes after parsing");return{r:t.decode(S),s:t.decode(q)}},hexFromSig(e){const{_tlv:s,_int:t}=z,m=s.encode(2,t.encode(e.r)),g=s.encode(2,t.encode(e.s)),B=m+g;return s.encode(48,B)}},k=BigInt(0),C=BigInt(1),ut=BigInt(2),W=BigInt(3),dt=BigInt(4);function st(e,s,t){function m(g){const B=e.sqr(g),u=e.mul(B,g);return e.add(e.add(u,e.mul(g,s)),t)}return m}function rt(e,s,t){const{BYTES:m}=e;function g(B){let u;if(typeof B=="bigint")u=B;else{let S=p.ensureBytes("private key",B);if(s){if(!s.includes(S.length*2))throw new Error("invalid private key");const R=new Uint8Array(m);R.set(S,R.length-S.length),S=R}try{u=e.fromBytes(S)}catch{throw new Error(`invalid private key: expected ui8a of size ${m}, got ${typeof B}`)}}if(t&&(u=e.create(u)),!e.isValidNot0(u))throw new Error("invalid private key: out of range [1..N-1]");return u}return g}function it(e,s={}){const{Fp:t,Fn:m}=K._createCurveFields("weierstrass",e,s),{h:g,n:B}=e;p._validateObject(s,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:u}=s;if(u&&(!t.is0(e.a)||typeof u.beta!="bigint"||typeof u.splitScalar!="function"))throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function');function S(){if(!t.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}function R(v,r,i){const{x:n,y:o}=r.toAffine(),a=t.toBytes(n);if(p.abool("isCompressed",i),i){S();const d=!t.isOdd(o);return N.concatBytes(at(d),a)}else return N.concatBytes(Uint8Array.of(4),a,t.toBytes(o))}function q(v){N.abytes(v);const r=t.BYTES,i=r+1,n=2*r+1,o=v.length,a=v[0],d=v.subarray(1);if(o===i&&(a===2||a===3)){const c=t.fromBytes(d);if(!t.isValid(c))throw new Error("bad point: is not on curve, wrong x");const l=Z(c);let h;try{h=t.sqrt(l)}catch(E){const y=E instanceof Error?": "+E.message:"";throw new Error("bad point: is not on curve, sqrt error"+y)}S();const f=t.isOdd(h);return(a&1)===1!==f&&(h=t.neg(h)),{x:c,y:h}}else if(o===n&&a===4){const c=t.fromBytes(d.subarray(r*0,r*1)),l=t.fromBytes(d.subarray(r*1,r*2));if(!_(c,l))throw new Error("bad point: is not on curve");return{x:c,y:l}}else throw new Error(`bad point: got length ${o}, expected compressed=${i} or uncompressed=${n}`)}const L=s.toBytes||R,$=s.fromBytes||q,Z=st(t,e.a,e.b);function _(v,r){const i=t.sqr(r),n=Z(v);return t.eql(i,n)}if(!_(e.Gx,e.Gy))throw new Error("bad curve params: generator point");const Q=t.mul(t.pow(e.a,W),dt),J=t.mul(t.sqr(e.b),BigInt(27));if(t.is0(t.add(Q,J)))throw new Error("bad curve params: a or b");function j(v,r,i=!1){if(!t.isValid(r)||i&&t.is0(r))throw new Error(`bad point coordinate ${v}`);return r}function P(v){if(!(v instanceof w))throw new Error("ProjectivePoint expected")}const G=p.memoized((v,r)=>{const{px:i,py:n,pz:o}=v;if(t.eql(o,t.ONE))return{x:i,y:n};const a=v.is0();r==null&&(r=a?t.ONE:t.inv(o));const d=t.mul(i,r),c=t.mul(n,r),l=t.mul(o,r);if(a)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:d,y:c}}),I=p.memoized(v=>{if(v.is0()){if(s.allowInfinityPoint&&!t.is0(v.py))return;throw new Error("bad point: ZERO")}const{x:r,y:i}=v.toAffine();if(!t.isValid(r)||!t.isValid(i))throw new Error("bad point: x or y not field elements");if(!_(r,i))throw new Error("bad point: equation left != right");if(!v.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});function X(v,r,i,n,o){return i=new w(t.mul(i.px,v),i.py,i.pz),r=K.negateCt(n,r),i=K.negateCt(o,i),r.add(i)}class w{constructor(r,i,n){this.px=j("x",r),this.py=j("y",i,!0),this.pz=j("z",n),Object.freeze(this)}static fromAffine(r){const{x:i,y:n}=r||{};if(!r||!t.isValid(i)||!t.isValid(n))throw new Error("invalid affine point");if(r instanceof w)throw new Error("projective point not allowed");return t.is0(i)&&t.is0(n)?w.ZERO:new w(i,n,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(r){return K.normalizeZ(w,"pz",r)}static fromBytes(r){return N.abytes(r),w.fromHex(r)}static fromHex(r){const i=w.fromAffine($(p.ensureBytes("pointHex",r)));return i.assertValidity(),i}static fromPrivateKey(r){const i=rt(m,s.allowedPrivateKeyLengths,s.wrapPrivateKey);return w.BASE.multiply(i(r))}static msm(r,i){return K.pippenger(w,m,r,i)}precompute(r=8,i=!0){return F.setWindowSize(this,r),i||this.multiply(W),this}_setWindowSize(r){this.precompute(r)}assertValidity(){I(this)}hasEvenY(){const{y:r}=this.toAffine();if(!t.isOdd)throw new Error("Field doesn't support isOdd");return!t.isOdd(r)}equals(r){P(r);const{px:i,py:n,pz:o}=this,{px:a,py:d,pz:c}=r,l=t.eql(t.mul(i,c),t.mul(a,o)),h=t.eql(t.mul(n,c),t.mul(d,o));return l&&h}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:r,b:i}=e,n=t.mul(i,W),{px:o,py:a,pz:d}=this;let c=t.ZERO,l=t.ZERO,h=t.ZERO,f=t.mul(o,o),x=t.mul(a,a),E=t.mul(d,d),y=t.mul(o,a);return y=t.add(y,y),h=t.mul(o,d),h=t.add(h,h),c=t.mul(r,h),l=t.mul(n,E),l=t.add(c,l),c=t.sub(x,l),l=t.add(x,l),l=t.mul(c,l),c=t.mul(y,c),h=t.mul(n,h),E=t.mul(r,E),y=t.sub(f,E),y=t.mul(r,y),y=t.add(y,h),h=t.add(f,f),f=t.add(h,f),f=t.add(f,E),f=t.mul(f,y),l=t.add(l,f),E=t.mul(a,d),E=t.add(E,E),f=t.mul(E,y),c=t.sub(c,f),h=t.mul(E,x),h=t.add(h,h),h=t.add(h,h),new w(c,l,h)}add(r){P(r);const{px:i,py:n,pz:o}=this,{px:a,py:d,pz:c}=r;let l=t.ZERO,h=t.ZERO,f=t.ZERO;const x=e.a,E=t.mul(e.b,W);let y=t.mul(i,a),T=t.mul(n,d),O=t.mul(o,c),A=t.add(i,n),b=t.add(a,d);A=t.mul(A,b),b=t.add(y,T),A=t.sub(A,b),b=t.add(i,o);let H=t.add(a,c);return b=t.mul(b,H),H=t.add(y,O),b=t.sub(b,H),H=t.add(n,o),l=t.add(d,c),H=t.mul(H,l),l=t.add(T,O),H=t.sub(H,l),f=t.mul(x,b),l=t.mul(E,O),f=t.add(l,f),l=t.sub(T,f),f=t.add(T,f),h=t.mul(l,f),T=t.add(y,y),T=t.add(T,y),O=t.mul(x,O),b=t.mul(E,b),T=t.add(T,O),O=t.sub(y,O),O=t.mul(x,O),b=t.add(b,O),y=t.mul(T,b),h=t.add(h,y),y=t.mul(H,b),l=t.mul(A,l),l=t.sub(l,y),y=t.mul(A,T),f=t.mul(H,f),f=t.add(f,y),new w(l,h,f)}subtract(r){return this.add(r.negate())}is0(){return this.equals(w.ZERO)}multiply(r){const{endo:i}=s;if(!m.isValidNot0(r))throw new Error("invalid scalar: out of range");let n,o;const a=d=>F.wNAFCached(this,d,w.normalizeZ);if(i){const{k1neg:d,k1:c,k2neg:l,k2:h}=i.splitScalar(r),{p:f,f:x}=a(c),{p:E,f:y}=a(h);o=x.add(y),n=X(i.beta,f,E,d,l)}else{const{p:d,f:c}=a(r);n=d,o=c}return w.normalizeZ([n,o])[0]}multiplyUnsafe(r){const{endo:i}=s,n=this;if(!m.isValid(r))throw new Error("invalid scalar: out of range");if(r===k||n.is0())return w.ZERO;if(r===C)return n;if(F.hasPrecomputes(this))return this.multiply(r);if(i){const{k1neg:o,k1:a,k2neg:d,k2:c}=i.splitScalar(r),{p1:l,p2:h}=K.mulEndoUnsafe(w,n,a,c);return X(i.beta,l,h,o,d)}else return F.wNAFCachedUnsafe(n,r)}multiplyAndAddUnsafe(r,i,n){const o=this.multiplyUnsafe(i).add(r.multiplyUnsafe(n));return o.is0()?void 0:o}toAffine(r){return G(this,r)}isTorsionFree(){const{isTorsionFree:r}=s;return g===C?!0:r?r(w,this):F.wNAFCachedUnsafe(this,B).is0()}clearCofactor(){const{clearCofactor:r}=s;return g===C?this:r?r(w,this):this.multiplyUnsafe(g)}toBytes(r=!0){return p.abool("isCompressed",r),this.assertValidity(),L(w,this,r)}toRawBytes(r=!0){return this.toBytes(r)}toHex(r=!0){return N.bytesToHex(this.toBytes(r))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}w.BASE=new w(e.Gx,e.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO),w.Fp=t,w.Fn=m;const M=m.BITS,F=K.wNAF(w,s.endo?Math.ceil(M/2):M);return w}function at(e){return Uint8Array.of(e?2:3)}function ct(e,s,t={}){p._validateObject(s,{hash:"function"},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const m=s.randomBytes||N.randomBytes,g=s.hmac||((n,...o)=>lt.hmac(s.hash,n,N.concatBytes(...o))),{Fp:B,Fn:u}=e,{ORDER:S,BITS:R}=u;function q(n){const o=S>>C;return n>o}function L(n){return q(n)?u.neg(n):n}function $(n,o){if(!u.isValidNot0(o))throw new Error(`invalid signature ${n}: out of range 1..CURVE.n`)}class Z{constructor(o,a,d){$("r",o),$("s",a),this.r=o,this.s=a,d!=null&&(this.recovery=d),Object.freeze(this)}static fromCompact(o){const a=u.BYTES,d=p.ensureBytes("compactSignature",o,a*2);return new Z(u.fromBytes(d.subarray(0,a)),u.fromBytes(d.subarray(a,a*2)))}static fromDER(o){const{r:a,s:d}=z.toSig(p.ensureBytes("DER",o));return new Z(a,d)}assertValidity(){}addRecoveryBit(o){return new Z(this.r,this.s,o)}recoverPublicKey(o){const a=B.ORDER,{r:d,s:c,recovery:l}=this;if(l==null||![0,1,2,3].includes(l))throw new Error("recovery id invalid");if(S*ut<a&&l>1)throw new Error("recovery id is ambiguous for h>1 curve");const f=l===2||l===3?d+S:d;if(!B.isValid(f))throw new Error("recovery id 2 or 3 invalid");const x=B.toBytes(f),E=e.fromHex(N.concatBytes(at((l&1)===0),x)),y=u.inv(f),T=I(p.ensureBytes("msgHash",o)),O=u.create(-T*y),A=u.create(c*y),b=e.BASE.multiplyUnsafe(O).add(E.multiplyUnsafe(A));if(b.is0())throw new Error("point at infinify");return b.assertValidity(),b}hasHighS(){return q(this.s)}normalizeS(){return this.hasHighS()?new Z(this.r,u.neg(this.s),this.recovery):this}toBytes(o){if(o==="compact")return N.concatBytes(u.toBytes(this.r),u.toBytes(this.s));if(o==="der")return N.hexToBytes(z.hexFromSig(this));throw new Error("invalid format")}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return N.bytesToHex(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return N.bytesToHex(this.toBytes("compact"))}}const _=rt(u,t.allowedPrivateKeyLengths,t.wrapPrivateKey),Q={isValidPrivateKey(n){try{return _(n),!0}catch{return!1}},normPrivateKeyToScalar:_,randomPrivateKey:()=>{const n=S;return et.mapHashToField(m(et.getMinHashLength(n)),n)},precompute(n=8,o=e.BASE){return o.precompute(n,!1)}};function J(n,o=!0){return e.fromPrivateKey(n).toBytes(o)}function j(n){if(typeof n=="bigint")return!1;if(n instanceof e)return!0;const a=p.ensureBytes("key",n).length,d=B.BYTES,c=d+1,l=2*d+1;if(!(t.allowedPrivateKeyLengths||u.BYTES===c))return a===c||a===l}function P(n,o,a=!0){if(j(n)===!0)throw new Error("first arg must be private key");if(j(o)===!1)throw new Error("second arg must be public key");return e.fromHex(o).multiply(_(n)).toBytes(a)}const G=s.bits2int||function(n){if(n.length>8192)throw new Error("input is too large");const o=p.bytesToNumberBE(n),a=n.length*8-R;return a>0?o>>BigInt(a):o},I=s.bits2int_modN||function(n){return u.create(G(n))},X=p.bitMask(R);function w(n){return p.aInRange("num < 2^"+R,n,k,X),u.toBytes(n)}function M(n,o,a=F){if(["recovered","canonical"].some(A=>A in a))throw new Error("sign() legacy options not supported");const{hash:d}=s;let{lowS:c,prehash:l,extraEntropy:h}=a;c==null&&(c=!0),n=p.ensureBytes("msgHash",n),nt(a),l&&(n=p.ensureBytes("prehashed msgHash",d(n)));const f=I(n),x=_(o),E=[w(x),w(f)];if(h!=null&&h!==!1){const A=h===!0?m(B.BYTES):h;E.push(p.ensureBytes("extraEntropy",A))}const y=N.concatBytes(...E),T=f;function O(A){const b=G(A);if(!u.isValidNot0(b))return;const H=u.inv(b),V=e.BASE.multiply(b).toAffine(),U=u.create(V.x);if(U===k)return;const D=u.create(H*u.create(T+U*x));if(D===k)return;let tt=(V.x===U?0:2)|Number(V.y&C),Y=D;return c&&q(D)&&(Y=L(D),tt^=1),new Z(U,Y,tt)}return{seed:y,k2sig:O}}const F={lowS:s.lowS,prehash:!1},v={lowS:s.lowS,prehash:!1};function r(n,o,a=F){const{seed:d,k2sig:c}=M(n,o,a);return p.createHmacDrbg(s.hash.outputLen,u.BYTES,g)(d,c)}e.BASE.precompute(8);function i(n,o,a,d=v){const c=n;o=p.ensureBytes("msgHash",o),a=p.ensureBytes("publicKey",a),nt(d);const{lowS:l,prehash:h,format:f}=d;if("strict"in d)throw new Error("options.strict was renamed to lowS");if(f!==void 0&&!["compact","der","js"].includes(f))throw new Error('format must be "compact", "der" or "js"');const x=typeof c=="string"||N.isBytes(c),E=!x&&!f&&typeof c=="object"&&c!==null&&typeof c.r=="bigint"&&typeof c.s=="bigint";if(!x&&!E)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let y,T;try{if(E)if(f===void 0||f==="js")y=new Z(c.r,c.s);else throw new Error("invalid format");if(x){try{f!=="compact"&&(y=Z.fromDER(c))}catch(Y){if(!(Y instanceof z.Err))throw Y}!y&&f!=="der"&&(y=Z.fromCompact(c))}T=e.fromHex(a)}catch{return!1}if(!y||l&&y.hasHighS())return!1;h&&(o=s.hash(o));const{r:O,s:A}=y,b=I(o),H=u.inv(A),V=u.create(b*H),U=u.create(O*H),D=e.BASE.multiplyUnsafe(V).add(T.multiplyUnsafe(U));return D.is0()?!1:u.create(D.x)===O}return Object.freeze({getPublicKey:J,getSharedSecret:P,sign:r,verify:i,utils:Q,Point:e,Signature:Z})}function ft(e){const s={a:e.a,b:e.b,p:e.Fp.ORDER,n:e.n,h:e.h,Gx:e.Gx,Gy:e.Gy},t=e.Fp,m=et.Field(s.n,e.nBitLength),g={Fp:t,Fn:m,allowedPrivateKeyLengths:e.allowedPrivateKeyLengths,allowInfinityPoint:e.allowInfinityPoint,endo:e.endo,wrapPrivateKey:e.wrapPrivateKey,isTorsionFree:e.isTorsionFree,clearCofactor:e.clearCofactor,fromBytes:e.fromBytes,toBytes:e.toBytes};return{CURVE:s,curveOpts:g}}function ht(e){const{CURVE:s,curveOpts:t}=ft(e),m={hash:e.hash,hmac:e.hmac,randomBytes:e.randomBytes,lowS:e.lowS,bits2int:e.bits2int,bits2int_modN:e.bits2int_modN};return{CURVE:s,curveOpts:t,ecdsaOpts:m}}function yt(e,s){return Object.assign({},s,{ProjectivePoint:s.Point,CURVE:e})}function mt(e){const{CURVE:s,curveOpts:t,ecdsaOpts:m}=ht(e),g=it(s,t),B=ct(g,m,t);return yt(e,B)}exports.DER=z;exports.DERErr=ot;exports._legacyHelperEquat=st;exports._legacyHelperNormPriv=rt;exports.ecdsa=ct;exports.weierstrass=mt;exports.weierstrassN=it;