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

package/dist/index83.js

@@ -1,107 +1,234 @@
-import { anumber as d, aexists as k, abytes as B, aoutput as A } from "./index74.js";
-import { rotlSH as H, rotlSL as m, rotlBH as S, rotlBL as T, split as F } from "./index102.js";
-import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index75.js";
-const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
-for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
-  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
-  let o = M;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  b.push(o);
-}
-const [v, z] = /* @__PURE__ */ F(b, !0), O = (e, t, s) => s > 32 ? S(e, t, s) : H(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : m(e, t, s);
-function D(e, t = 24) {
-  const s = new Uint32Array(10);
-  for (let n = 24 - t; n < 24; n++) {
-    for (let i = 0; i < 10; i++)
-      s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
-    for (let i = 0; i < 10; i += 2) {
-      const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        e[i + a] ^= _, e[i + a + 1] ^= g;
-    }
-    let o = e[2], r = e[3];
-    for (let i = 0; i < 24; i++) {
-      const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
-      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
-    }
-    for (let i = 0; i < 50; i += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = e[i + h];
-      for (let h = 0; h < 10; h++)
-        e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
+function h(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function b(t) {
+  if (!h(t))
+    throw new Error("Uint8Array expected");
+}
+function O(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function B(t) {
+  b(t);
+  let n = "";
+  for (let r = 0; r < t.length; r++)
+    n += T[t[r]];
+  return n;
+}
+function S(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function U(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? d : BigInt("0x" + t);
+}
+const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function E(t) {
+  if (t >= s._0 && t <= s._9)
+    return t - s._0;
+  if (t >= s.A && t <= s.F)
+    return t - (s.A - 10);
+  if (t >= s.a && t <= s.f)
+    return t - (s.a - 10);
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  const n = t.length, r = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const e = new Uint8Array(r);
+  for (let o = 0, i = 0; o < r; o++, i += 2) {
+    const a = E(t.charCodeAt(i)), f = E(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);
     }
-    e[0] ^= v[n], e[1] ^= z[n];
-  }
-  s.fill(0);
-}
-class p extends E {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, n, o = !1, r = 24) {
-    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = U(this.state);
+    e[o] = a * 16 + f;
   }
-  keccak() {
-    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    k(this);
-    const { blockLen: s, state: n } = this;
-    t = P(t);
-    const o = t.length;
-    for (let r = 0; r < o; ) {
-      const i = Math.min(s - this.pos, o - r);
-      for (let h = 0; h < i; h++)
-        n[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
+  return e;
+}
+function V(t) {
+  return U(B(t));
+}
+function H(t) {
+  return b(t), U(B(Uint8Array.from(t).reverse()));
+}
+function v(t, n) {
+  return m(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return v(t, n).reverse();
+}
+function M(t) {
+  return m(S(t));
+}
+function R(t, n, r) {
+  let e;
+  if (typeof n == "string")
+    try {
+      e = m(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
     }
-    return this;
+  else if (h(n))
+    e = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = e.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(t + " of length " + r + " expected, got " + o);
+  return e;
+}
+function _(...t) {
+  let n = 0;
+  for (let e = 0; e < t.length; e++) {
+    const o = t[e];
+    b(o), n += o.length;
   }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: s, pos: n, blockLen: o } = this;
-    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
+  const r = new Uint8Array(n);
+  for (let e = 0, o = 0; e < t.length; e++) {
+    const i = t[e];
+    r.set(i, o), o += i.length;
   }
-  writeInto(t) {
-    k(this, !1), B(t), this.finish();
-    const s = this.state, { blockLen: n } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= n && this.keccak();
-      const i = Math.min(n - this.posOut, r - o);
-      t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
+  return r;
+}
+function j(t, n) {
+  if (t.length !== n.length)
+    return !1;
+  let r = 0;
+  for (let e = 0; e < t.length; e++)
+    r |= t[e] ^ n[e];
+  return r === 0;
+}
+function z(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+const w = (t) => typeof t == "bigint" && d <= t;
+function N(t, n, r) {
+  return w(t) && w(n) && w(r) && n <= t && t < r;
+}
+function D(t, n, r, e) {
+  if (!N(n, r, e))
+    throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
+}
+function G(t) {
+  let n;
+  for (n = 0; t > d; t >>= y, n += 1)
+    ;
+  return n;
+}
+function P(t, n) {
+  return t >> BigInt(n) & y;
+}
+function W(t, n, r) {
+  return t | (r ? y : d) << BigInt(n);
+}
+const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function J(t, n, r) {
+  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 r != "function")
+    throw new Error("hmacFn must be a function");
+  let e = p(t), o = p(t), i = 0;
+  const a = () => {
+    e.fill(1), o.fill(0), i = 0;
+  }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
+    o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
+  }, x = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let u = 0;
+    const l = [];
+    for (; u < n; ) {
+      e = f();
+      const g = e.slice();
+      l.push(g), u += e.length;
     }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return d(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (A(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, this.state.fill(0);
-  }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
-    return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
-  }
+    return _(...l);
+  };
+  return (u, l) => {
+    a(), c(u);
+    let g;
+    for (; !(g = l(x())); )
+      c();
+    return a(), g;
+  };
+}
+const k = {
+  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" || h(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 K(t, n, r = {}) {
+  const e = (o, i, a) => {
+    const f = k[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))
+    e(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    e(o, i, !0);
+  return t;
+}
+const Q = () => {
+  throw new Error("not implemented");
+};
+function X(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (r, ...e) => {
+    const o = n.get(r);
+    if (o !== void 0)
+      return o;
+    const i = t(r, ...e);
+    return n.set(r, i), i;
+  };
 }
-const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
 export {
-  p as Keccak,
-  D as keccakP,
-  Q as keccak_256
+  D as aInRange,
+  O as abool,
+  b as abytes,
+  P as bitGet,
+  G as bitLen,
+  q as bitMask,
+  W as bitSet,
+  B as bytesToHex,
+  V as bytesToNumberBE,
+  H as bytesToNumberLE,
+  _ as concatBytes,
+  J as createHmacDrbg,
+  R as ensureBytes,
+  j as equalBytes,
+  m as hexToBytes,
+  U as hexToNumber,
+  N as inRange,
+  h as isBytes,
+  X as memoized,
+  Q as notImplemented,
+  v as numberToBytesBE,
+  C as numberToBytesLE,
+  S as numberToHexUnpadded,
+  M as numberToVarBytesBE,
+  z as utf8ToBytes,
+  K as validateObject
 };

package/dist/index84.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index26.cjs"),c=require("./index42.cjs");function u(t){if(!t||t.length===0)return[];const e=[];for(const r of t){const{chainId:i,nonce:o,...s}=r,a=r.address;e.push([i?n.toHex(i):"0x",a,o?n.toHex(o):"0x",...c.toYParitySignatureArray({},s)])}return e}exports.serializeAuthorizationList=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function n(e){return{formatters:void 0,fees:void 0,serializers:void 0,...e}}exports.defineChain=n;

package/dist/index84.js

@@ -1,20 +1,11 @@
-import { toHex as i } from "./index26.js";
-import { toYParitySignatureArray as c } from "./index42.js";
-function f(r) {
-  if (!r || r.length === 0)
-    return [];
-  const t = [];
-  for (const o of r) {
-    const { chainId: n, nonce: e, ...s } = o, a = o.address;
-    t.push([
-      n ? i(n) : "0x",
-      a,
-      e ? i(e) : "0x",
-      ...c({}, s)
-    ]);
-  }
-  return t;
+function n(e) {
+  return {
+    formatters: void 0,
+    fees: void 0,
+    serializers: void 0,
+    ...e
+  };
 }
 export {
-  f as serializeAuthorizationList
+  n as defineChain
 };

package/dist/index85.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const E=require("./index97.cjs"),w=require("./index94.cjs"),t=require("./index34.cjs"),P=require("./index48.cjs"),h=require("./index98.cjs"),d=require("./index50.cjs"),n=require("./index55.cjs"),c=require("./index35.cjs"),I=require("./index51.cjs"),u=require("./index91.cjs"),l=require("./index37.cjs");function m(o){const{authorizationList:e}=o;if(e)for(const s of e){const{chainId:r}=s,i=s.address;if(!c.isAddress(i))throw new t.InvalidAddressError({address:i});if(r<0)throw new d.InvalidChainIdError({chainId:r})}f(o)}function T(o){const{blobVersionedHashes:e}=o;if(e){if(e.length===0)throw new h.EmptyBlobError;for(const s of e){const r=I.size(s),i=l.hexToNumber(u.slice(s,0,1));if(r!==32)throw new h.InvalidVersionedHashSizeError({hash:s,size:r});if(i!==E.versionedHashVersionKzg)throw new h.InvalidVersionedHashVersionError({hash:s,version:i})}}f(o)}function f(o){const{chainId:e,maxPriorityFeePerGas:s,maxFeePerGas:r,to:i}=o;if(e<=0)throw new d.InvalidChainIdError({chainId:e});if(i&&!c.isAddress(i))throw new t.InvalidAddressError({address:i});if(r&&r>w.maxUint256)throw new n.FeeCapTooHighError({maxFeePerGas:r});if(s&&r&&s>r)throw new n.TipAboveFeeCapError({maxFeePerGas:r,maxPriorityFeePerGas:s})}function x(o){const{chainId:e,maxPriorityFeePerGas:s,gasPrice:r,maxFeePerGas:i,to:a}=o;if(e<=0)throw new d.InvalidChainIdError({chainId:e});if(a&&!c.isAddress(a))throw new t.InvalidAddressError({address:a});if(s||i)throw new P.BaseError("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid EIP-2930 Transaction attribute.");if(r&&r>w.maxUint256)throw new n.FeeCapTooHighError({maxFeePerGas:r})}function v(o){const{chainId:e,maxPriorityFeePerGas:s,gasPrice:r,maxFeePerGas:i,to:a}=o;if(a&&!c.isAddress(a))throw new t.InvalidAddressError({address:a});if(typeof e<"u"&&e<=0)throw new d.InvalidChainIdError({chainId:e});if(s||i)throw new P.BaseError("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid Legacy Transaction attribute.");if(r&&r>w.maxUint256)throw new n.FeeCapTooHighError({maxFeePerGas:r})}exports.assertTransactionEIP1559=f;exports.assertTransactionEIP2930=x;exports.assertTransactionEIP4844=T;exports.assertTransactionEIP7702=m;exports.assertTransactionLegacy=v;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index48.cjs"),u=require("./index95.cjs"),f=require("./index38.cjs"),g=require("./index26.cjs");function c(n,e="hex"){const i=o(n),s=u.createCursor(new Uint8Array(i.length));return i.encode(s),e==="hex"?g.bytesToHex(s.bytes):s.bytes}function o(n){return Array.isArray(n)?p(n.map(e=>o(e))):y(n)}function p(n){const e=n.reduce((t,h)=>t+h.length,0),i=l(e);return{length:e<=55?1+e:1+i+e,encode(t){e<=55?t.pushByte(192+e):(t.pushByte(247+i),i===1?t.pushUint8(e):i===2?t.pushUint16(e):i===3?t.pushUint24(e):t.pushUint32(e));for(const{encode:h}of n)h(t)}}}function y(n){const e=typeof n=="string"?f.hexToBytes(n):n,i=l(e.length);return{length:e.length===1&&e[0]<128?1:e.length<=55?1+e.length:1+i+e.length,encode(t){e.length===1&&e[0]<128?t.pushBytes(e):e.length<=55?(t.pushByte(128+e.length),t.pushBytes(e)):(t.pushByte(183+i),i===1?t.pushUint8(e.length):i===2?t.pushUint16(e.length):i===3?t.pushUint24(e.length):t.pushUint32(e.length),t.pushBytes(e))}}}function l(n){if(n<2**8)return 1;if(n<2**16)return 2;if(n<2**24)return 3;if(n<2**32)return 4;throw new r.BaseError("Length is too large.")}exports.toRlp=c;

package/dist/index85.js

@@ -1,81 +1,45 @@
-import { versionedHashVersionKzg as c } from "./index97.js";
-import { maxUint256 as m } from "./index94.js";
-import { InvalidAddressError as s } from "./index34.js";
-import { BaseError as h } from "./index48.js";
-import { EmptyBlobError as P, InvalidVersionedHashSizeError as p, InvalidVersionedHashVersionError as x } from "./index98.js";
-import { InvalidChainIdError as n } from "./index50.js";
-import { FeeCapTooHighError as w, TipAboveFeeCapError as E } from "./index55.js";
-import { isAddress as f } from "./index35.js";
-import { size as F } from "./index51.js";
-import { slice as I } from "./index91.js";
-import { hexToNumber as G } from "./index37.js";
-function C(t) {
-  const { authorizationList: e } = t;
-  if (e)
-    for (const o of e) {
-      const { chainId: r } = o, i = o.address;
-      if (!f(i))
-        throw new s({ address: i });
-      if (r < 0)
-        throw new n({ chainId: r });
-    }
-  d(t);
+import { BaseError as l } from "./index48.js";
+import { createCursor as r } from "./index95.js";
+import { hexToBytes as g } from "./index38.js";
+import { bytesToHex as u } from "./index26.js";
+function m(n, e = "hex") {
+  const i = s(n), h = r(new Uint8Array(i.length));
+  return i.encode(h), e === "hex" ? u(h.bytes) : h.bytes;
 }
-function L(t) {
-  const { blobVersionedHashes: e } = t;
-  if (e) {
-    if (e.length === 0)
-      throw new P();
-    for (const o of e) {
-      const r = F(o), i = G(I(o, 0, 1));
-      if (r !== 32)
-        throw new p({ hash: o, size: r });
-      if (i !== c)
-        throw new x({
-          hash: o,
-          version: i
-        });
-    }
-  }
-  d(t);
+function s(n) {
+  return Array.isArray(n) ? p(n.map((e) => s(e))) : y(n);
 }
-function d(t) {
-  const { chainId: e, maxPriorityFeePerGas: o, maxFeePerGas: r, to: i } = t;
-  if (e <= 0)
-    throw new n({ chainId: e });
-  if (i && !f(i))
-    throw new s({ address: i });
-  if (r && r > m)
-    throw new w({ maxFeePerGas: r });
-  if (o && r && o > r)
-    throw new E({ maxFeePerGas: r, maxPriorityFeePerGas: o });
+function p(n) {
+  const e = n.reduce((t, f) => t + f.length, 0), i = o(e);
+  return {
+    length: e <= 55 ? 1 + e : 1 + i + e,
+    encode(t) {
+      e <= 55 ? t.pushByte(192 + e) : (t.pushByte(247 + i), i === 1 ? t.pushUint8(e) : i === 2 ? t.pushUint16(e) : i === 3 ? t.pushUint24(e) : t.pushUint32(e));
+      for (const { encode: f } of n)
+        f(t);
+    }
+  };
 }
-function B(t) {
-  const { chainId: e, maxPriorityFeePerGas: o, gasPrice: r, maxFeePerGas: i, to: a } = t;
-  if (e <= 0)
-    throw new n({ chainId: e });
-  if (a && !f(a))
-    throw new s({ address: a });
-  if (o || i)
-    throw new h("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid EIP-2930 Transaction attribute.");
-  if (r && r > m)
-    throw new w({ maxFeePerGas: r });
+function y(n) {
+  const e = typeof n == "string" ? g(n) : n, i = o(e.length);
+  return {
+    length: e.length === 1 && e[0] < 128 ? 1 : e.length <= 55 ? 1 + e.length : 1 + i + e.length,
+    encode(t) {
+      e.length === 1 && e[0] < 128 ? t.pushBytes(e) : e.length <= 55 ? (t.pushByte(128 + e.length), t.pushBytes(e)) : (t.pushByte(183 + i), i === 1 ? t.pushUint8(e.length) : i === 2 ? t.pushUint16(e.length) : i === 3 ? t.pushUint24(e.length) : t.pushUint32(e.length), t.pushBytes(e));
+    }
+  };
 }
-function K(t) {
-  const { chainId: e, maxPriorityFeePerGas: o, gasPrice: r, maxFeePerGas: i, to: a } = t;
-  if (a && !f(a))
-    throw new s({ address: a });
-  if (typeof e < "u" && e <= 0)
-    throw new n({ chainId: e });
-  if (o || i)
-    throw new h("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid Legacy Transaction attribute.");
-  if (r && r > m)
-    throw new w({ maxFeePerGas: r });
+function o(n) {
+  if (n < 2 ** 8)
+    return 1;
+  if (n < 2 ** 16)
+    return 2;
+  if (n < 2 ** 24)
+    return 3;
+  if (n < 2 ** 32)
+    return 4;
+  throw new l("Length is too large.");
 }
 export {
-  d as assertTransactionEIP1559,
-  B as assertTransactionEIP2930,
-  L as assertTransactionEIP4844,
-  C as assertTransactionEIP7702,
-  K as assertTransactionLegacy
+  m as toRlp
 };

package/dist/index86.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index34.cjs"),d=require("./index23.cjs"),l=require("./index35.cjs");function a(e){if(!e||e.length===0)return[];const n=[];for(let t=0;t<e.length;t++){const{address:i,storageKeys:r}=e[t];for(let s=0;s<r.length;s++)if(r[s].length-2!==64)throw new d.InvalidStorageKeySizeError({storageKey:r[s]});if(!l.isAddress(i,{strict:!1}))throw new o.InvalidAddressError({address:i});n.push([i,r])}return n}exports.serializeAccessList=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index76.cjs"),f=require("./index102.cjs"),c=require("./index77.cjs"),I=[],O=[],w=[],B=BigInt(0),a=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=a,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],I.push(2*(5*n+s)),O.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<a^(t>>S)*T)%H,t&A&&(o^=a<<(a<<BigInt(r))-a);w.push(o)}const[m,E]=f.split(w,!0),y=(i,t,s)=>s>32?f.rotlBH(i,t,s):f.rotlSH(i,t,s),b=(i,t,s)=>s>32?f.rotlBL(i,t,s):f.rotlSL(i,t,s);function L(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,p=(e+2)%10,d=s[p],u=s[p+1],_=y(d,u,1)^s[h],g=b(d,u,1)^s[h+1];for(let k=0;k<50;k+=10)i[e+k]^=_,i[e+k+1]^=g}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=O[e],p=y(o,r,h),d=b(o,r,h),u=I[e];o=i[u],r=i[u+1],i[u]=p,i[u+1]=d}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=E[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,l.anumber(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}keccak(){c.isLE||c.byteSwap32(this.state32),L(this.state32,this.rounds),c.isLE||c.byteSwap32(this.state32),this.posOut=0,this.pos=0}update(t){l.aexists(this);const{blockLen:s,state:n}=this;t=c.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){l.aexists(this,!1),l.abytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return l.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.aoutput(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const F=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),P=F(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=P;

package/dist/index86.js

@@ -1,21 +1,107 @@
-import { InvalidAddressError as s } from "./index34.js";
-import { InvalidStorageKeySizeError as l } from "./index23.js";
-import { isAddress as f } from "./index35.js";
-function a(r) {
-  if (!r || r.length === 0)
-    return [];
-  const n = [];
-  for (let o = 0; o < r.length; o++) {
-    const { address: i, storageKeys: e } = r[o];
-    for (let t = 0; t < e.length; t++)
-      if (e[t].length - 2 !== 64)
-        throw new l({ storageKey: e[t] });
-    if (!f(i, { strict: !1 }))
-      throw new s({ address: i });
-    n.push([i, e]);
-  }
-  return n;
+import { anumber as d, aexists as k, abytes as B, aoutput as A } from "./index76.js";
+import { rotlSH as H, rotlSL as m, rotlBH as S, rotlBL as T, split as F } from "./index102.js";
+import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index77.js";
+const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
+for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
+  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
+  let o = M;
+  for (let r = 0; r < 7; r++)
+    t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
+  b.push(o);
 }
+const [v, z] = /* @__PURE__ */ F(b, !0), O = (e, t, s) => s > 32 ? S(e, t, s) : H(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : m(e, t, s);
+function D(e, t = 24) {
+  const s = new Uint32Array(10);
+  for (let n = 24 - t; n < 24; n++) {
+    for (let i = 0; i < 10; i++)
+      s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
+    for (let i = 0; i < 10; i += 2) {
+      const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
+      for (let a = 0; a < 50; a += 10)
+        e[i + a] ^= _, e[i + a + 1] ^= g;
+    }
+    let o = e[2], r = e[3];
+    for (let i = 0; i < 24; i++) {
+      const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
+      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
+    }
+    for (let i = 0; i < 50; i += 10) {
+      for (let h = 0; h < 10; h++)
+        s[h] = e[i + h];
+      for (let h = 0; h < 10; h++)
+        e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+    }
+    e[0] ^= v[n], e[1] ^= z[n];
+  }
+  s.fill(0);
+}
+class p extends E {
+  // NOTE: we accept arguments in bytes instead of bits here.
+  constructor(t, s, n, o = !1, r = 24) {
+    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
+      throw new Error("Sha3 supports only keccak-f1600 function");
+    this.state = new Uint8Array(200), this.state32 = U(this.state);
+  }
+  keccak() {
+    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
+  }
+  update(t) {
+    k(this);
+    const { blockLen: s, state: n } = this;
+    t = P(t);
+    const o = t.length;
+    for (let r = 0; r < o; ) {
+      const i = Math.min(s - this.pos, o - r);
+      for (let h = 0; h < i; h++)
+        n[this.pos++] ^= t[r++];
+      this.pos === s && this.keccak();
+    }
+    return this;
+  }
+  finish() {
+    if (this.finished)
+      return;
+    this.finished = !0;
+    const { state: t, suffix: s, pos: n, blockLen: o } = this;
+    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
+  }
+  writeInto(t) {
+    k(this, !1), B(t), this.finish();
+    const s = this.state, { blockLen: n } = this;
+    for (let o = 0, r = t.length; o < r; ) {
+      this.posOut >= n && this.keccak();
+      const i = Math.min(n - this.posOut, r - o);
+      t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
+    }
+    return t;
+  }
+  xofInto(t) {
+    if (!this.enableXOF)
+      throw new Error("XOF is not possible for this instance");
+    return this.writeInto(t);
+  }
+  xof(t) {
+    return d(t), this.xofInto(new Uint8Array(t));
+  }
+  digestInto(t) {
+    if (A(t, this), this.finished)
+      throw new Error("digest() was already called");
+    return this.writeInto(t), this.destroy(), t;
+  }
+  digest() {
+    return this.digestInto(new Uint8Array(this.outputLen));
+  }
+  destroy() {
+    this.destroyed = !0, this.state.fill(0);
+  }
+  _cloneInto(t) {
+    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
+    return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
+  }
+}
+const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
 export {
-  a as serializeAccessList
+  p as Keccak,
+  D as keccakP,
+  Q as keccak_256
 };