@gardenfi/utils 2.0.6-beta.1 → 2.0.6-beta.10

package/dist/index92.js

@@ -1,20 +1,226 @@
-import { toHex as i } from "./index25.js";
-import { toYParitySignatureArray as c } from "./index57.js";
-function d(r) {
-  if (!r || r.length === 0)
-    return [];
-  const t = [];
-  for (const e of r) {
-    const { contractAddress: s, chainId: o, nonce: n, ...a } = e;
-    t.push([
-      o ? i(o) : "0x",
-      s,
-      n ? i(n) : "0x",
-      ...c({}, a)
-    ]);
+import { bitMask as _, numberToBytesLE as S, numberToBytesBE as x, bytesToNumberLE as y, bytesToNumberBE as L, validateObject as M } from "./index116.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), c = BigInt(1), w = /* @__PURE__ */ BigInt(2), C = /* @__PURE__ */ BigInt(3), b = /* @__PURE__ */ BigInt(4), N = /* @__PURE__ */ BigInt(5), m = /* @__PURE__ */ BigInt(8);
+function g(t, i) {
+  const r = t % i;
+  return r >= d ? r : i + r;
+}
+function Z(t, i, r) {
+  if (i < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r <= d)
+    throw new Error("invalid modulus");
+  if (r === c)
+    return d;
+  let e = c;
+  for (; i > d; )
+    i & c && (e = e * t % r), t = t * t % r, i >>= c;
+  return e;
+}
+function V(t, i, r) {
+  let e = t;
+  for (; i-- > d; )
+    e *= e, e %= r;
+  return e;
+}
+function I(t, i) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (i <= d)
+    throw new Error("invert: expected positive modulus, got " + i);
+  let r = g(t, i), e = i, s = d, u = c;
+  for (; r !== d; ) {
+    const o = e / r, n = e % r, l = s - u * o;
+    e = r, r = n, s = u, u = l;
+  }
+  if (e !== c)
+    throw new Error("invert: does not exist");
+  return g(s, i);
+}
+function j(t) {
+  const i = (t - c) / w;
+  let r, e, s;
+  for (r = t - c, e = 0; r % w === d; r /= w, e++)
+    ;
+  for (s = w; s < t && Z(s, i, t) !== t - c; s++)
+    if (s > 1e3)
+      throw new Error("Cannot find square root: likely non-prime P");
+  if (e === 1) {
+    const f = (t + c) / b;
+    return function(n, l) {
+      const h = n.pow(l, f);
+      if (!n.eql(n.sqr(h), l))
+        throw new Error("Cannot find square root");
+      return h;
+    };
+  }
+  const u = (r + c) / w;
+  return function(o, n) {
+    if (o.pow(n, i) === o.neg(o.ONE))
+      throw new Error("Cannot find square root");
+    let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
+    for (; !o.eql(a, o.ONE); ) {
+      if (o.eql(a, o.ZERO))
+        return o.ZERO;
+      let q = 1;
+      for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
+        B = o.sqr(B);
+      const E = o.pow(h, c << BigInt(l - q - 1));
+      h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
+    }
+    return v;
+  };
+}
+function z(t) {
+  if (t % b === C) {
+    const i = (t + c) / b;
+    return function(e, s) {
+      const u = e.pow(s, i);
+      if (!e.eql(e.sqr(u), s))
+        throw new Error("Cannot find square root");
+      return u;
+    };
+  }
+  if (t % m === N) {
+    const i = (t - N) / m;
+    return function(e, s) {
+      const u = e.mul(s, w), f = e.pow(u, i), o = e.mul(s, f), n = e.mul(e.mul(o, w), f), l = e.mul(o, e.sub(n, e.ONE));
+      if (!e.eql(e.sqr(l), s))
+        throw new Error("Cannot find square root");
+      return l;
+    };
   }
-  return t;
+  return j(t);
+}
+const A = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function Y(t) {
+  const i = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, r = A.reduce((e, s) => (e[s] = "function", e), i);
+  return M(t, r);
+}
+function k(t, i, r) {
+  if (r < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r === d)
+    return t.ONE;
+  if (r === c)
+    return i;
+  let e = t.ONE, s = i;
+  for (; r > d; )
+    r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
+  return e;
+}
+function H(t, i) {
+  const r = new Array(i.length), e = i.reduce((u, f, o) => t.is0(f) ? u : (r[o] = u, t.mul(u, f)), t.ONE), s = t.inv(e);
+  return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
+}
+function K(t, i) {
+  const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
+  return { nBitLength: r, nByteLength: e };
+}
+function p(t, i, r = !1, e = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: u } = K(t, i);
+  if (u > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let f;
+  const o = Object.freeze({
+    ORDER: t,
+    isLE: r,
+    BITS: s,
+    BYTES: u,
+    MASK: _(s),
+    ZERO: d,
+    ONE: c,
+    create: (n) => g(n, t),
+    isValid: (n) => {
+      if (typeof n != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof n);
+      return d <= n && n < t;
+    },
+    is0: (n) => n === d,
+    isOdd: (n) => (n & c) === c,
+    neg: (n) => g(-n, t),
+    eql: (n, l) => n === l,
+    sqr: (n) => g(n * n, t),
+    add: (n, l) => g(n + l, t),
+    sub: (n, l) => g(n - l, t),
+    mul: (n, l) => g(n * l, t),
+    pow: (n, l) => k(o, n, l),
+    div: (n, l) => g(n * I(l, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (n) => n * n,
+    addN: (n, l) => n + l,
+    subN: (n, l) => n - l,
+    mulN: (n, l) => n * l,
+    inv: (n) => I(n, t),
+    sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
+    invertBatch: (n) => H(o, n),
+    // TODO: do we really need constant cmov?
+    // We don't have const-time bigints anyway, so probably will be not very useful
+    cmov: (n, l, h) => h ? l : n,
+    toBytes: (n) => r ? S(n, u) : x(n, u),
+    fromBytes: (n) => {
+      if (n.length !== u)
+        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
+      return r ? y(n) : L(n);
+    }
+  });
+  return Object.freeze(o);
+}
+function T(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const i = t.toString(2).length;
+  return Math.ceil(i / 8);
+}
+function O(t) {
+  const i = T(t);
+  return i + Math.ceil(i / 2);
+}
+function G(t, i, r = !1) {
+  const e = t.length, s = T(i), u = O(i);
+  if (e < 16 || e < u || e > 1024)
+    throw new Error("expected " + u + "-1024 bytes of input, got " + e);
+  const f = r ? y(t) : L(t), o = g(f, i - c) + c;
+  return r ? S(o, s) : x(o, s);
 }
 export {
-  d as serializeAuthorizationList
+  p as Field,
+  H as FpInvertBatch,
+  k as FpPow,
+  z as FpSqrt,
+  T as getFieldBytesLength,
+  O as getMinHashLength,
+  I as invert,
+  G as mapHashToField,
+  g as mod,
+  K as nLength,
+  Z as pow,
+  V as pow2,
+  j as tonelliShanks,
+  Y as validateField
 };

package/dist/index93.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const E=require("./index108.cjs"),w=require("./index100.cjs"),t=require("./index50.cjs"),P=require("./index63.cjs"),h=require("./index106.cjs"),d=require("./index65.cjs"),n=require("./index69.cjs"),c=require("./index51.cjs"),I=require("./index66.cjs"),u=require("./index99.cjs"),l=require("./index35.cjs");function m(o){const{authorizationList:e}=o;if(e)for(const s of e){const{contractAddress:r,chainId:i}=s;if(!c.isAddress(r))throw new t.InvalidAddressError({address:r});if(i<0)throw new d.InvalidChainIdError({chainId:i})}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("./index63.cjs"),u=require("./index107.cjs"),f=require("./index53.cjs"),g=require("./index25.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/index93.js

@@ -1,81 +1,45 @@
-import { versionedHashVersionKzg as d } from "./index108.js";
-import { maxUint256 as m } from "./index100.js";
-import { InvalidAddressError as s } from "./index50.js";
-import { BaseError as h } from "./index63.js";
-import { EmptyBlobError as P, InvalidVersionedHashSizeError as p, InvalidVersionedHashVersionError as x } from "./index106.js";
-import { InvalidChainIdError as n } from "./index65.js";
-import { FeeCapTooHighError as w, TipAboveFeeCapError as E } from "./index69.js";
-import { isAddress as f } from "./index51.js";
-import { size as F } from "./index66.js";
-import { slice as I } from "./index99.js";
-import { hexToNumber as G } from "./index35.js";
-function C(t) {
-  const { authorizationList: e } = t;
-  if (e)
-    for (const o of e) {
-      const { contractAddress: r, chainId: i } = o;
-      if (!f(r))
-        throw new s({ address: r });
-      if (i < 0)
-        throw new n({ chainId: i });
-    }
-  c(t);
+import { BaseError as l } from "./index63.js";
+import { createCursor as r } from "./index107.js";
+import { hexToBytes as g } from "./index53.js";
+import { bytesToHex as u } from "./index25.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 !== d)
-        throw new x({
-          hash: o,
-          version: i
-        });
-    }
-  }
-  c(t);
+function s(n) {
+  return Array.isArray(n) ? p(n.map((e) => s(e))) : y(n);
 }
-function c(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 {
-  c as assertTransactionEIP1559,
-  B as assertTransactionEIP2930,
-  L as assertTransactionEIP4844,
-  C as assertTransactionEIP7702,
-  K as assertTransactionLegacy
+  m as toRlp
 };

package/dist/index94.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index50.cjs"),d=require("./index30.cjs"),l=require("./index51.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("./index113.cjs"),f=require("./index118.cjs"),c=require("./index111.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/index94.js

@@ -1,21 +1,107 @@
-import { InvalidAddressError as s } from "./index50.js";
-import { InvalidStorageKeySizeError as l } from "./index30.js";
-import { isAddress as f } from "./index51.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 "./index113.js";
+import { split as H, rotlBH as m, rotlSH as S, rotlBL as T, rotlSL as F } from "./index118.js";
+import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index111.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__ */ H(b, !0), O = (e, t, s) => s > 32 ? m(e, t, s) : S(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : F(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
 };

package/dist/index95.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index25.cjs"),c=require("./index57.cjs");function u(t){if(!t||t.length===0)return[];const e=[];for(const n of t){const{contractAddress:s,chainId:r,nonce:i,...a}=n;e.push([r?o.toHex(r):"0x",s,i?o.toHex(i):"0x",...c.toYParitySignatureArray({},a)])}return e}exports.serializeAuthorizationList=u;

package/dist/index95.js

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

package/dist/index96.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index63.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const E=require("./index108.cjs"),w=require("./index100.cjs"),t=require("./index50.cjs"),P=require("./index63.cjs"),h=require("./index106.cjs"),d=require("./index65.cjs"),n=require("./index69.cjs"),c=require("./index51.cjs"),I=require("./index66.cjs"),u=require("./index99.cjs"),l=require("./index35.cjs");function m(o){const{authorizationList:e}=o;if(e)for(const s of e){const{contractAddress:r,chainId:i}=s;if(!c.isAddress(r))throw new t.InvalidAddressError({address:r});if(i<0)throw new d.InvalidChainIdError({chainId:i})}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;

package/dist/index96.js

@@ -1,15 +1,81 @@
-import { BaseError as o } from "./index63.js";
-class d extends o {
-  constructor({ offset: r, position: s, size: e }) {
-    super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
-  }
+import { versionedHashVersionKzg as d } from "./index108.js";
+import { maxUint256 as m } from "./index100.js";
+import { InvalidAddressError as s } from "./index50.js";
+import { BaseError as h } from "./index63.js";
+import { EmptyBlobError as P, InvalidVersionedHashSizeError as p, InvalidVersionedHashVersionError as x } from "./index106.js";
+import { InvalidChainIdError as n } from "./index65.js";
+import { FeeCapTooHighError as w, TipAboveFeeCapError as E } from "./index69.js";
+import { isAddress as f } from "./index51.js";
+import { size as F } from "./index66.js";
+import { slice as I } from "./index99.js";
+import { hexToNumber as G } from "./index35.js";
+function C(t) {
+  const { authorizationList: e } = t;
+  if (e)
+    for (const o of e) {
+      const { contractAddress: r, chainId: i } = o;
+      if (!f(r))
+        throw new s({ address: r });
+      if (i < 0)
+        throw new n({ chainId: i });
+    }
+  c(t);
 }
-class n extends o {
-  constructor({ size: r, targetSize: s, type: e }) {
-    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
+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 !== d)
+        throw new x({
+          hash: o,
+          version: i
+        });
+    }
   }
+  c(t);
+}
+function c(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 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 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 });
 }
 export {
-  n as SizeExceedsPaddingSizeError,
-  d as SliceOffsetOutOfBoundsError
+  c as assertTransactionEIP1559,
+  B as assertTransactionEIP2930,
+  L as assertTransactionEIP4844,
+  C as assertTransactionEIP7702,
+  K as assertTransactionLegacy
 };