@gardenfi/utils 2.1.3-beta.3 → 2.1.3-beta.4

package/dist/index3.js

@@ -6,7 +6,7 @@ const h = (t) => t.startsWith("0x") ? t : `0x${t}`, T = (t) => `Bearer ${t}`, f
     return;
   }
 };
-var c = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t.LOCALNET = "localnet", t))(c || {}), i = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t.LOCALNET = "localnet", t))(i || {});
+var c = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t))(c || {}), i = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t.LOCALNET = "localnet", t))(i || {});
 const x = (t) => t.startsWith("0x") ? t : `0x${t}`;
 function E(t, r = "big") {
   if (t = t.replace("0x", ""), t.length !== 64)

package/dist/index30.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index201.cjs"),f=require("./index223.cjs"),x=require("./index81.cjs"),z=Array.from({length:256},(e,n)=>n.toString(16).padStart(2,"0"));function H(e,n={}){return typeof e=="number"||typeof e=="bigint"?d(e,n):typeof e=="string"?m(e,n):typeof e=="boolean"?b(e,n):u(e,n)}function b(e,n={}){const t=`0x${Number(e)}`;return typeof n.size=="number"?(x.assertSize(t,{size:n.size}),f.pad(t,{size:n.size})):t}function u(e,n={}){let t="";for(let i=0;i<e.length;i++)t+=z[e[i]];const r=`0x${t}`;return typeof n.size=="number"?(x.assertSize(r,{size:n.size}),f.pad(r,{dir:"right",size:n.size})):r}function d(e,n={}){const{signed:t,size:r}=n,i=BigInt(e);let o;r?t?o=(1n<<BigInt(r)*8n-1n)-1n:o=2n**(BigInt(r)*8n)-1n:typeof e=="number"&&(o=BigInt(Number.MAX_SAFE_INTEGER));const c=typeof o=="bigint"&&t?-o-1n:0;if(o&&i>o||i<c){const s=typeof e=="bigint"?"n":"";throw new y.IntegerOutOfRangeError({max:o?`${o}${s}`:void 0,min:`${c}${s}`,signed:t,size:r,value:`${e}${s}`})}const g=`0x${(t&&i<0?(1n<<BigInt(r*8))+BigInt(i):i).toString(16)}`;return r?f.pad(g,{size:r}):g}const T=new TextEncoder;function m(e,n={}){const t=T.encode(e);return u(t,n)}exports.boolToHex=b;exports.bytesToHex=u;exports.numberToHex=d;exports.stringToHex=m;exports.toHex=H;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index176.cjs"),s=require("./index150.cjs"),q=require("./index238.cjs");async function b(r,a){const{address:u,abi:n,args:c,eventName:e,fromBlock:t,strict:l,toBlock:o}=a,d=q.createFilterRequestScope(r,{method:"eth_newFilter"}),p=e?m.encodeEventTopics({abi:n,args:c,eventName:e}):void 0,i=await r.request({method:"eth_newFilter",params:[{address:u,fromBlock:typeof t=="bigint"?s.numberToHex(t):t,toBlock:typeof o=="bigint"?s.numberToHex(o):o,topics:p}]});return{abi:n,args:c,eventName:e,id:i,request:d(i),strict:!!l,type:"event"}}exports.createContractEventFilter=b;

package/dist/index30.js

@@ -1,48 +1,34 @@
-import { IntegerOutOfRangeError as x } from "./index201.js";
-import { pad as s } from "./index223.js";
-import { assertSize as c } from "./index81.js";
-const b = /* @__PURE__ */ Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0"));
-function B(n, e = {}) {
-  return typeof n == "number" || typeof n == "bigint" ? y(n, e) : typeof n == "string" ? $(n, e) : typeof n == "boolean" ? z(n, e) : m(n, e);
-}
-function z(n, e = {}) {
-  const t = `0x${Number(n)}`;
-  return typeof e.size == "number" ? (c(t, { size: e.size }), s(t, { size: e.size })) : t;
-}
-function m(n, e = {}) {
-  let t = "";
-  for (let i = 0; i < n.length; i++)
-    t += b[n[i]];
-  const r = `0x${t}`;
-  return typeof e.size == "number" ? (c(r, { size: e.size }), s(r, { dir: "right", size: e.size })) : r;
-}
-function y(n, e = {}) {
-  const { signed: t, size: r } = e, i = BigInt(n);
-  let o;
-  r ? t ? o = (1n << BigInt(r) * 8n - 1n) - 1n : o = 2n ** (BigInt(r) * 8n) - 1n : typeof n == "number" && (o = BigInt(Number.MAX_SAFE_INTEGER));
-  const g = typeof o == "bigint" && t ? -o - 1n : 0;
-  if (o && i > o || i < g) {
-    const f = typeof n == "bigint" ? "n" : "";
-    throw new x({
-      max: o ? `${o}${f}` : void 0,
-      min: `${g}${f}`,
-      signed: t,
-      size: r,
-      value: `${n}${f}`
-    });
-  }
-  const u = `0x${(t && i < 0 ? (1n << BigInt(r * 8)) + BigInt(i) : i).toString(16)}`;
-  return r ? s(u, { size: r }) : u;
-}
-const d = /* @__PURE__ */ new TextEncoder();
-function $(n, e = {}) {
-  const t = d.encode(n);
-  return m(t, e);
+import { encodeEventTopics as l } from "./index176.js";
+import { numberToHex as s } from "./index150.js";
+import { createFilterRequestScope as u } from "./index238.js";
+async function h(r, a) {
+  const { address: m, abi: n, args: i, eventName: e, fromBlock: t, strict: p, toBlock: o } = a, f = u(r, {
+    method: "eth_newFilter"
+  }), d = e ? l({
+    abi: n,
+    args: i,
+    eventName: e
+  }) : void 0, c = await r.request({
+    method: "eth_newFilter",
+    params: [
+      {
+        address: m,
+        fromBlock: typeof t == "bigint" ? s(t) : t,
+        toBlock: typeof o == "bigint" ? s(o) : o,
+        topics: d
+      }
+    ]
+  });
+  return {
+    abi: n,
+    args: i,
+    eventName: e,
+    id: c,
+    request: f(c),
+    strict: !!p,
+    type: "event"
+  };
 }
 export {
-  z as boolToHex,
-  m as bytesToHex,
-  y as numberToHex,
-  $ as stringToHex,
-  B as toHex
+  h as createContractEventFilter
 };

package/dist/index300.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index311.cjs"),o=require("./index308.cjs"),n=require("./index260.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;
+"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;

package/dist/index300.js

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

package/dist/index301.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index302.cjs"),a=require("./index297.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 A=require("./index278.cjs"),h=require("./index300.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const y=BigInt(0),S=BigInt(1);function p(e,s){const t=s.negate();return e?t:s}function E(e,s){if(!Number.isSafeInteger(e)||e<=0||e>s)throw new Error("invalid window size, expected [1.."+s+"], got W="+e)}function m(e,s){E(e,s);const t=Math.ceil(s/e)+1,n=2**(e-1),o=2**e,i=h.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function B(e,s,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),a=e>>r;f>n&&(f-=i,a+=S);const l=s*n,c=l+Math.abs(f)-1,w=f===0,u=f<0,d=s%2!==0;return{nextN:a,offset:c,isZero:w,isNeg:u,isNegF:d,offsetF:l}}function x(e,s){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof s))throw new Error("invalid point at index "+n)})}function I(e,s){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!s.isValid(t))throw new Error("invalid scalar at index "+n)})}const N=new WeakMap,M=new WeakMap;function b(e){return M.get(e)||1}function O(e,s){return{constTimeNegate:p,hasPrecomputes(t){return b(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>y;)n&S&&(o=o.add(i)),i=i.double(),n>>=S;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=m(n,s),r=[];let f=t,a=f;for(let l=0;l<o;l++){a=f,r.push(a);for(let c=1;c<i;c++)a=a.add(f),r.push(a);f=a.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=m(t,s);for(let a=0;a<f.windows;a++){const{nextN:l,offset:c,isZero:w,isNeg:u,isNegF:d,offsetF:g}=B(o,a,f);o=l,w?r=r.add(p(d,n[g])):i=i.add(p(u,n[c]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=m(t,s);for(let f=0;f<r.windows&&o!==y;f++){const{nextN:a,offset:l,isZero:c,isNeg:w}=B(o,f,r);if(o=a,!c){const u=n[l];i=i.add(w?u.negate():u)}}return i},getPrecomputes(t,n,o){let i=N.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&N.set(n,o(i))),i},wNAFCached(t,n,o){const i=b(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=b(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){E(n,s),M.set(t,n),N.delete(t)}}}function z(e,s,t,n){if(x(t,e),I(n,s),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=h.bitLen(BigInt(t.length)),r=i>12?i-3:i>4?i-2:i?2:1,f=h.bitMask(r),a=new Array(Number(f)+1).fill(o),l=Math.floor((s.BITS-1)/r)*r;let c=o;for(let w=l;w>=0;w-=r){a.fill(o);for(let d=0;d<n.length;d++){const g=n[d],F=Number(g>>BigInt(w)&f);a[F]=a[F].add(t[d])}let u=o;for(let d=a.length-1,g=o;d>0;d--)g=g.add(a[d]),u=u.add(g);if(c=c.add(u),w!==0)for(let d=0;d<r;d++)c=c.double()}return c}function k(e){return A.validateField(e.Fp),h.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=z;exports.validateBasic=k;exports.wNAF=O;

package/dist/index301.js

@@ -1,65 +1,175 @@
-import { validate as c } from "./index302.js";
-import { BaseError as f } from "./index297.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;
+import { validateField as y, nLength as I } from "./index278.js";
+import { validateObject as M, bitLen as z, bitMask as E } from "./index300.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const F = BigInt(0), b = BigInt(1);
+function h(e, s) {
+  const t = s.negate();
+  return e ? t : s;
+}
+function B(e, s) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > s)
+    throw new Error("invalid window size, expected [1.." + s + "], got W=" + e);
+}
+function m(e, s) {
+  B(e, s);
+  const t = Math.ceil(s / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = E(e), r = BigInt(e);
+  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
+}
+function A(e, s, t) {
+  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
+  let f = Number(e & i), a = e >> r;
+  f > n && (f -= o, a += b);
+  const w = s * n, c = w + Math.abs(f) - 1, l = f === 0, u = f < 0, d = s % 2 !== 0;
+  return { nextN: a, offset: c, isZero: l, isNeg: u, isNegF: d, offsetF: w };
+}
+function O(e, s) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+  e.forEach((t, n) => {
+    if (!(t instanceof s))
+      throw new Error("invalid point at index " + n);
+  });
+}
+function k(e, s) {
+  if (!Array.isArray(e))
+    throw new Error("array of scalars expected");
+  e.forEach((t, n) => {
+    if (!s.isValid(t))
+      throw new Error("invalid scalar at index " + n);
+  });
+}
+const p = /* @__PURE__ */ new WeakMap(), x = /* @__PURE__ */ new WeakMap();
+function N(e) {
+  return x.get(e) || 1;
+}
+function R(e, s) {
+  return {
+    constTimeNegate: h,
+    hasPrecomputes(t) {
+      return N(t) !== 1;
+    },
+    // non-const time multiplication ladder
+    unsafeLadder(t, n, i = e.ZERO) {
+      let o = t;
+      for (; n > F; )
+        n & b && (i = i.add(o)), o = o.double(), n >>= b;
+      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 } = m(n, s), r = [];
+      let f = t, a = f;
+      for (let w = 0; w < i; w++) {
+        a = f, r.push(a);
+        for (let c = 1; c < o; c++)
+          a = a.add(f), r.push(a);
+        f = a.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 = m(t, s);
+      for (let a = 0; a < f.windows; a++) {
+        const { nextN: w, offset: c, isZero: l, isNeg: u, isNegF: d, offsetF: g } = A(i, a, f);
+        i = w, l ? r = r.add(h(d, n[g])) : o = o.add(h(u, n[c]));
       }
-      if (u === " ") {
-        r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
-        continue;
+      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 = m(t, s);
+      for (let f = 0; f < r.windows && i !== F; f++) {
+        const { nextN: a, offset: w, isZero: c, isNeg: l } = A(i, f, r);
+        if (i = a, !c) {
+          const u = n[w];
+          o = o.add(l ? u.negate() : u);
+        }
       }
-      n += u, t += u;
+      return o;
+    },
+    getPrecomputes(t, n, i) {
+      let o = p.get(n);
+      return o || (o = this.precomputeWindow(n, t), t !== 1 && p.set(n, i(o))), o;
+    },
+    wNAFCached(t, n, i) {
+      const o = N(t);
+      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
+    },
+    wNAFCachedUnsafe(t, n, i, o) {
+      const r = N(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) {
+      B(n, s), x.set(t, n), p.delete(t);
     }
-  }
-  if (!o)
-    throw new f("Unable to normalize signature.");
-  return n;
+  };
 }
-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 j(e, s, t, n) {
+  if (O(t, e), k(n, s), t.length !== n.length)
+    throw new Error("arrays of points and scalars must have equal length");
+  const i = e.ZERO, o = z(BigInt(t.length)), r = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, f = E(r), a = new Array(Number(f) + 1).fill(i), w = Math.floor((s.BITS - 1) / r) * r;
+  let c = i;
+  for (let l = w; l >= 0; l -= r) {
+    a.fill(i);
+    for (let d = 0; d < n.length; d++) {
+      const g = n[d], S = Number(g >> BigInt(l) & f);
+      a[S] = a[S].add(t[d]);
+    }
+    let u = i;
+    for (let d = a.length - 1, g = i; d > 0; d--)
+      g = g.add(a[d]), u = u.add(g);
+    if (c = c.add(u), l !== 0)
+      for (let d = 0; d < r; d++)
+        c = c.double();
   }
+  return c;
 }
-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 v(e) {
+  return y(e.Fp), M(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...I(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
 }
 export {
-  a as getAmbiguousTypes,
-  l as isArgOfType,
-  y as normalizeSignature
+  j as pippenger,
+  v as validateBasic,
+  R as wNAF
 };

package/dist/index302.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index308.cjs"),c=require("./index312.cjs"),o=require("./index297.cjs"),m=require("./index300.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"});const d=require("./index313.cjs");class c extends Error{constructor(r,e={}){const u=(()=>{var s;if(e.cause instanceof c){if(e.cause.details)return e.cause.details;if(e.cause.shortMessage)return e.cause.shortMessage}return(s=e.cause)!=null&&s.message?e.cause.message:e.details})(),a=e.cause instanceof c&&e.cause.docsPath||e.docsPath,i=`https://oxlib.sh${a??""}`,n=[r||"An error occurred.",...e.metaMessages?["",...e.metaMessages]:[],...u||a?["",u?`Details: ${u}`:void 0,a?`See: ${i}`:void 0]:[]].filter(s=>typeof s=="string").join(`
+`);super(n,e.cause?{cause:e.cause}:void 0),Object.defineProperty(this,"details",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docs",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docsPath",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"shortMessage",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"cause",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"BaseError"}),Object.defineProperty(this,"version",{enumerable:!0,configurable:!0,writable:!0,value:`ox@${d.getVersion()}`}),this.cause=e.cause,this.details=u,this.docs=i,this.docsPath=a,this.shortMessage=r}walk(r){return l(this,r)}}function l(t,r){return r!=null&&r(t)?t:t&&typeof t=="object"&&"cause"in t&&t.cause?l(t.cause,r):r?null:t}exports.BaseError=c;