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

package/dist/index299.js

@@ -0,0 +1,209 @@
+/*! 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 {
+  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/index30.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index63.cjs");function c(t){const r=Object.entries(t).map(([a,e])=>e===void 0||e===!1?null:[a,e]).filter(Boolean),s=r.reduce((a,[e])=>Math.max(a,e.length),0);return r.map(([a,e])=>`  ${`${a}:`.padEnd(s+1)}  ${e}`).join(`
-`)}class d extends o.BaseError{constructor({v:r}){super(`Invalid \`v\` value "${r}". Expected 27 or 28.`,{name:"InvalidLegacyVError"})}}class l extends o.BaseError{constructor({transaction:r}){super("Cannot infer a transaction type from provided transaction.",{metaMessages:["Provided Transaction:","{",c(r),"}","","To infer the type, either provide:","- a `type` to the Transaction, or","- an EIP-1559 Transaction with `maxFeePerGas`, or","- an EIP-2930 Transaction with `gasPrice` & `accessList`, or","- an EIP-4844 Transaction with `blobs`, `blobVersionedHashes`, `sidecars`, or","- an EIP-7702 Transaction with `authorizationList`, or","- a Legacy Transaction with `gasPrice`"],name:"InvalidSerializableTransactionError"})}}class u extends o.BaseError{constructor({storageKey:r}){super(`Size for storage key "${r}" is invalid. Expected 32 bytes. Got ${Math.floor((r.length-2)/2)} bytes.`,{name:"InvalidStorageKeySizeError"})}}class T extends o.BaseError{constructor({blockHash:r,blockNumber:s,blockTag:a,hash:e,index:n}){let i="Transaction";a&&n!==void 0&&(i=`Transaction at block time "${a}" at index "${n}"`),r&&n!==void 0&&(i=`Transaction at block hash "${r}" at index "${n}"`),s&&n!==void 0&&(i=`Transaction at block number "${s}" at index "${n}"`),e&&(i=`Transaction with hash "${e}"`),super(`${i} could not be found.`,{name:"TransactionNotFoundError"})}}class E extends o.BaseError{constructor({hash:r}){super(`Transaction receipt with hash "${r}" could not be found. The Transaction may not be processed on a block yet.`,{name:"TransactionReceiptNotFoundError"})}}class p extends o.BaseError{constructor({hash:r}){super(`Timed out while waiting for transaction with hash "${r}" to be confirmed.`,{name:"WaitForTransactionReceiptTimeoutError"})}}exports.InvalidLegacyVError=d;exports.InvalidSerializableTransactionError=l;exports.InvalidStorageKeySizeError=u;exports.TransactionNotFoundError=T;exports.TransactionReceiptNotFoundError=E;exports.WaitForTransactionReceiptTimeoutError=p;exports.prettyPrint=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index160.cjs"),f=require("./index186.cjs"),x=require("./index41.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;

package/dist/index30.js

@@ -1,68 +1,48 @@
-import { BaseError as o } from "./index63.js";
-function c(e) {
-  const r = Object.entries(e).map(([t, n]) => n === void 0 || n === !1 ? null : [t, n]).filter(Boolean), s = r.reduce((t, [n]) => Math.max(t, n.length), 0);
-  return r.map(([t, n]) => `  ${`${t}:`.padEnd(s + 1)}  ${n}`).join(`
-`);
+import { IntegerOutOfRangeError as x } from "./index160.js";
+import { pad as s } from "./index186.js";
+import { assertSize as c } from "./index41.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);
 }
-class u extends o {
-  constructor({ v: r }) {
-    super(`Invalid \`v\` value "${r}". Expected 27 or 28.`, {
-      name: "InvalidLegacyVError"
-    });
-  }
-}
-class l extends o {
-  constructor({ transaction: r }) {
-    super("Cannot infer a transaction type from provided transaction.", {
-      metaMessages: [
-        "Provided Transaction:",
-        "{",
-        c(r),
-        "}",
-        "",
-        "To infer the type, either provide:",
-        "- a `type` to the Transaction, or",
-        "- an EIP-1559 Transaction with `maxFeePerGas`, or",
-        "- an EIP-2930 Transaction with `gasPrice` & `accessList`, or",
-        "- an EIP-4844 Transaction with `blobs`, `blobVersionedHashes`, `sidecars`, or",
-        "- an EIP-7702 Transaction with `authorizationList`, or",
-        "- a Legacy Transaction with `gasPrice`"
-      ],
-      name: "InvalidSerializableTransactionError"
-    });
-  }
+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;
 }
-class T extends o {
-  constructor({ storageKey: r }) {
-    super(`Size for storage key "${r}" is invalid. Expected 32 bytes. Got ${Math.floor((r.length - 2) / 2)} bytes.`, { name: "InvalidStorageKeySizeError" });
-  }
+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;
 }
-class h extends o {
-  constructor({ blockHash: r, blockNumber: s, blockTag: t, hash: n, index: a }) {
-    let i = "Transaction";
-    t && a !== void 0 && (i = `Transaction at block time "${t}" at index "${a}"`), r && a !== void 0 && (i = `Transaction at block hash "${r}" at index "${a}"`), s && a !== void 0 && (i = `Transaction at block number "${s}" at index "${a}"`), n && (i = `Transaction with hash "${n}"`), super(`${i} could not be found.`, {
-      name: "TransactionNotFoundError"
+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;
 }
-class p extends o {
-  constructor({ hash: r }) {
-    super(`Transaction receipt with hash "${r}" could not be found. The Transaction may not be processed on a block yet.`, {
-      name: "TransactionReceiptNotFoundError"
-    });
-  }
-}
-class f extends o {
-  constructor({ hash: r }) {
-    super(`Timed out while waiting for transaction with hash "${r}" to be confirmed.`, { name: "WaitForTransactionReceiptTimeoutError" });
-  }
+const d = /* @__PURE__ */ new TextEncoder();
+function $(n, e = {}) {
+  const t = d.encode(n);
+  return m(t, e);
 }
 export {
-  u as InvalidLegacyVError,
-  l as InvalidSerializableTransactionError,
-  T as InvalidStorageKeySizeError,
-  h as TransactionNotFoundError,
-  p as TransactionReceiptNotFoundError,
-  f as WaitForTransactionReceiptTimeoutError,
-  c as prettyPrint
+  z as boolToHex,
+  m as bytesToHex,
+  y as numberToHex,
+  $ as stringToHex,
+  B as toHex
 };

package/dist/index300.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index259.cjs"),h=require("./index299.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/index300.js

@@ -0,0 +1,175 @@
+import { validateField as y, nLength as I } from "./index259.js";
+import { validateObject as M, bitLen as z, bitMask as E } from "./index299.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]));
+      }
+      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);
+        }
+      }
+      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);
+    }
+  };
+}
+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 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 {
+  j as pippenger,
+  v as validateBasic,
+  R as wNAF
+};

package/dist/index301.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;

package/dist/index301.js

@@ -0,0 +1,21 @@
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function f(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
+  for (let e = 0; e < t.length; e++) {
+    const { h: c, l: u } = f(t[e], r);
+    [n[e], l[e]] = [c, u];
+  }
+  return [n, l];
+}
+const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
+export {
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
+};

package/dist/index302.cjs

@@ -0,0 +1 @@
+"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/index302.js

@@ -0,0 +1,71 @@
+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 {
+  d as getParameterCacheKey,
+  p as parameterCache
+};

package/dist/index303.cjs

@@ -0,0 +1,2 @@
+"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;