@gardenfi/utils 2.5.2 → 2.5.3-beta.1

package/dist/index229.js

@@ -1,107 +1,9 @@
-import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index287.js";
-import { createHasher as X, Hash as E, anumber as d, u32 as U, swap32IfBE as I, aexists as x, toBytes as P, abytes as k, aoutput as M, clean as y } from "./index288.js";
-const R = BigInt(0), f = BigInt(1), j = BigInt(2), q = BigInt(7), v = BigInt(256), z = BigInt(113), _ = [], g = [], B = [];
-for (let n = 0, t = f, s = 1, i = 0; n < 24; n++) {
-  [s, i] = [i, (2 * s + 3 * i) % 5], _.push(2 * (5 * i + s)), g.push((n + 1) * (n + 2) / 2 % 64);
-  let o = R;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> q) * z) % v, t & j && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  B.push(o);
+import { toBytes as o } from "./index113.js";
+import { keccak256 as r } from "./index129.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
 }
-const A = L(B, !0), C = A[0], D = A[1], O = (n, t, s) => s > 32 ? m(n, t, s) : T(n, t, s), w = (n, t, s) => s > 32 ? F(n, t, s) : S(n, t, s);
-function G(n, t = 24) {
-  const s = new Uint32Array(10);
-  for (let i = 24 - t; i < 24; i++) {
-    for (let e = 0; e < 10; e++)
-      s[e] = n[e] ^ n[e + 10] ^ n[e + 20] ^ n[e + 30] ^ n[e + 40];
-    for (let e = 0; e < 10; e += 2) {
-      const h = (e + 8) % 10, l = (e + 2) % 10, u = s[l], c = s[l + 1], b = O(u, c, 1) ^ s[h], H = w(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        n[e + a] ^= b, n[e + a + 1] ^= H;
-    }
-    let o = n[2], r = n[3];
-    for (let e = 0; e < 24; e++) {
-      const h = g[e], l = O(o, r, h), u = w(o, r, h), c = _[e];
-      o = n[c], r = n[c + 1], n[c] = l, n[c + 1] = u;
-    }
-    for (let e = 0; e < 50; e += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = n[e + h];
-      for (let h = 0; h < 10; h++)
-        n[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
-    }
-    n[0] ^= C[i], n[1] ^= D[i];
-  }
-  y(s);
-}
-class p extends E {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, i, o = !1, r = 24) {
-    if (super(), this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, this.enableXOF = !1, this.blockLen = t, this.suffix = s, this.outputLen = i, this.enableXOF = o, this.rounds = r, d(i), !(0 < t && t < 200))
-      throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = U(this.state);
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  keccak() {
-    I(this.state32), G(this.state32, this.rounds), I(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    x(this), t = P(t), k(t);
-    const { blockLen: s, state: i } = this, 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++)
-        i[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: i, blockLen: o } = this;
-    t[i] ^= s, s & 128 && i === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    x(this, !1), k(t), this.finish();
-    const s = this.state, { blockLen: i } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= i && this.keccak();
-      const e = Math.min(i - 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 d(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (M(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, y(this.state);
-  }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: i, outputLen: o, rounds: r, enableXOF: e } = this;
-    return t || (t = new p(s, i, 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 = i, t.outputLen = o, t.enableXOF = e, t.destroyed = this.destroyed, t;
-  }
-}
-const J = (n, t, s) => X(() => new p(t, n, s)), Q = J(1, 136, 256 / 8);
 export {
-  p as Keccak,
-  G as keccakP,
-  Q as keccak_256
+  c as hashSignature
 };

package/dist/index23.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index197.cjs"),u=require("./index155.cjs"),a=require("./index255.cjs"),g=require("./index195.cjs"),y=require("./index256.cjs"),d=require("./index257.cjs"),T=require("./index258.cjs"),l=require("./index259.cjs"),q=require("./index260.cjs");function A(s,t={}){const{nonceManager:c}=t,e=u.toHex(i.secp256k1.getPublicKey(s.slice(2),!1)),o=g.publicKeyToAddress(e);return{...a.toAccount({address:o,nonceManager:c,async sign({hash:n}){return y.sign({hash:n,privateKey:s,to:"hex"})},async signAuthorization(n){return d.signAuthorization({...n,privateKey:s})},async signMessage({message:n}){return T.signMessage({message:n,privateKey:s})},async signTransaction(n,{serializer:r}={}){return l.signTransaction({privateKey:s,transaction:n,serializer:r})},async signTypedData(n){return q.signTypedData({...n,privateKey:s})}}),publicKey:e,source:"privateKey"}}exports.privateKeyToAccount=A;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index3.cjs");class i{constructor(e,t){this.maxRetries=Math.max(e,0),this.delay=t}async retry(e){let t=0,r;for(;t<this.maxRetries+1;)try{return await e()}catch(s){t++,r=s,await a.sleep(this.delay*t)}throw r}}exports.Retry=i;

package/dist/index23.js

@@ -1,38 +1,29 @@
-import { secp256k1 as e } from "./index197.js";
-import { toHex as a } from "./index155.js";
-import { toAccount as m } from "./index255.js";
-import { publicKeyToAddress as u } from "./index195.js";
-import { sign as g } from "./index256.js";
-import { signAuthorization as p } from "./index257.js";
-import { signMessage as f } from "./index258.js";
-import { signTransaction as y } from "./index259.js";
-import { signTypedData as d } from "./index260.js";
-function H(n, t = {}) {
-  const { nonceManager: s } = t, r = a(e.getPublicKey(n.slice(2), !1)), c = u(r);
-  return {
-    ...m({
-      address: c,
-      nonceManager: s,
-      async sign({ hash: o }) {
-        return g({ hash: o, privateKey: n, to: "hex" });
-      },
-      async signAuthorization(o) {
-        return p({ ...o, privateKey: n });
-      },
-      async signMessage({ message: o }) {
-        return f({ message: o, privateKey: n });
-      },
-      async signTransaction(o, { serializer: i } = {}) {
-        return y({ privateKey: n, transaction: o, serializer: i });
-      },
-      async signTypedData(o) {
-        return d({ ...o, privateKey: n });
+import { sleep as s } from "./index3.js";
+class l {
+  /**
+   * @param {number} maxRetries - The maximum number of retries, if less < 0 then it is set to 0
+   * @param {number} delay - The delay between retries
+   */
+  constructor(e, t) {
+    this.maxRetries = Math.max(e, 0), this.delay = t;
+  }
+  /**
+   * Retries a function until it succeeds or the max number of retries is reached
+   *
+   * @param {() => Promise<T>} fn - The function to retry
+   * @return {Promise<T>} a Promise that resolves to the result of the function
+   */
+  async retry(e) {
+    let t = 0, r;
+    for (; t < this.maxRetries + 1; )
+      try {
+        return await e();
+      } catch (a) {
+        t++, r = a, await s(this.delay * t);
       }
-    }),
-    publicKey: r,
-    source: "privateKey"
-  };
+    throw r;
+  }
 }
 export {
-  H as privateKeyToAccount
+  l as Retry
 };

package/dist/index230.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index281.cjs"),s=e.sha256;exports.sha256=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index231.cjs"),n=require("./index212.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index230.js

@@ -1,5 +1,9 @@
-import { sha256 as s } from "./index281.js";
-const o = s;
+import { normalizeSignature as o } from "./index231.js";
+import { formatAbiItem as n } from "./index212.js";
+const m = (r) => {
+  const t = typeof r == "string" ? r : n(r);
+  return o(t);
+};
 export {
-  o as sha256
+  m as toSignature
 };

package/dist/index231.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index150.cjs"),d=require("./index140.cjs"),l=require("./index176.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 f=require("./index38.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;

package/dist/index231.js

@@ -1,21 +1,29 @@
-import { InvalidAddressError as s } from "./index150.js";
-import { InvalidStorageKeySizeError as l } from "./index140.js";
-import { isAddress as f } from "./index176.js";
+import { BaseError as u } from "./index38.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]);
+  let l = !0, i = "", f = 0, t = "", o = !1;
+  for (let n = 0; n < r.length; n++) {
+    const e = r[n];
+    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
+      if (f === 0) {
+        if (e === " " && ["event", "function", ""].includes(t))
+          t = "";
+        else if (t += e, e === ")") {
+          o = !0;
+          break;
+        }
+        continue;
+      }
+      if (e === " ") {
+        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
+        continue;
+      }
+      t += e, i += e;
+    }
   }
-  return n;
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return t;
 }
 export {
-  a as serializeAccessList
+  a as normalizeSignature
 };

package/dist/index232.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const F=require("./index140.cjs"),G=require("./index233.cjs"),R=require("./index209.cjs"),S=require("./index213.cjs"),B=require("./index212.cjs"),V=require("./index214.cjs"),L=require("./index159.cjs"),h=require("./index167.cjs"),r=require("./index155.cjs"),d=require("./index199.cjs"),y=require("./index203.cjs"),C=require("./index191.cjs"),v=require("./index231.cjs");function k(e,o){const n=C.getTransactionType(e);return n==="eip1559"?_(e,o):n==="eip2930"?j(e,o):n==="eip4844"?Y(e,o):n==="eip7702"?w(e,o):M(e,o)}function w(e,o){const{authorizationList:n,chainId:s,gas:i,nonce:c,to:a,value:x,maxFeePerGas:u,maxPriorityFeePerGas:t,accessList:l,data:T}=e;y.assertTransactionEIP7702(e);const b=v.serializeAccessList(l),m=G.serializeAuthorizationList(n);return L.concatHex(["0x04",d.toRlp([r.numberToHex(s),c?r.numberToHex(c):"0x",t?r.numberToHex(t):"0x",u?r.numberToHex(u):"0x",i?r.numberToHex(i):"0x",a??"0x",x?r.numberToHex(x):"0x",T??"0x",b,m,...z(e,o)])])}function Y(e,o){const{chainId:n,gas:s,nonce:i,to:c,value:a,maxFeePerBlobGas:x,maxFeePerGas:u,maxPriorityFeePerGas:t,accessList:l,data:T}=e;y.assertTransactionEIP4844(e);let b=e.blobVersionedHashes,m=e.sidecars;if(e.blobs&&(typeof b>"u"||typeof m>"u")){const f=typeof e.blobs[0]=="string"?e.blobs:e.blobs.map(p=>r.bytesToHex(p)),P=e.kzg,H=R.blobsToCommitments({blobs:f,kzg:P});if(typeof b>"u"&&(b=B.commitmentsToVersionedHashes({commitments:H})),typeof m>"u"){const p=S.blobsToProofs({blobs:f,commitments:H,kzg:P});m=V.toBlobSidecars({blobs:f,commitments:H,proofs:p})}}const I=v.serializeAccessList(l),A=[r.numberToHex(n),i?r.numberToHex(i):"0x",t?r.numberToHex(t):"0x",u?r.numberToHex(u):"0x",s?r.numberToHex(s):"0x",c??"0x",a?r.numberToHex(a):"0x",T??"0x",I,x?r.numberToHex(x):"0x",b??[],...z(e,o)],q=[],g=[],E=[];if(m)for(let f=0;f<m.length;f++){const{blob:P,commitment:H,proof:p}=m[f];q.push(P),g.push(H),E.push(p)}return L.concatHex(["0x03",m?d.toRlp([A,q,g,E]):d.toRlp(A)])}function _(e,o){const{chainId:n,gas:s,nonce:i,to:c,value:a,maxFeePerGas:x,maxPriorityFeePerGas:u,accessList:t,data:l}=e;y.assertTransactionEIP1559(e);const T=v.serializeAccessList(t),b=[r.numberToHex(n),i?r.numberToHex(i):"0x",u?r.numberToHex(u):"0x",x?r.numberToHex(x):"0x",s?r.numberToHex(s):"0x",c??"0x",a?r.numberToHex(a):"0x",l??"0x",T,...z(e,o)];return L.concatHex(["0x02",d.toRlp(b)])}function j(e,o){const{chainId:n,gas:s,data:i,nonce:c,to:a,value:x,accessList:u,gasPrice:t}=e;y.assertTransactionEIP2930(e);const l=v.serializeAccessList(u),T=[r.numberToHex(n),c?r.numberToHex(c):"0x",t?r.numberToHex(t):"0x",s?r.numberToHex(s):"0x",a??"0x",x?r.numberToHex(x):"0x",i??"0x",l,...z(e,o)];return L.concatHex(["0x01",d.toRlp(T)])}function M(e,o){const{chainId:n=0,gas:s,data:i,nonce:c,to:a,value:x,gasPrice:u}=e;y.assertTransactionLegacy(e);let t=[c?r.numberToHex(c):"0x",u?r.numberToHex(u):"0x",s?r.numberToHex(s):"0x",a??"0x",x?r.numberToHex(x):"0x",i??"0x"];if(o){const l=(()=>{if(o.v>=35n)return(o.v-35n)/2n>0?o.v:27n+(o.v===35n?0n:1n);if(n>0)return BigInt(n*2)+BigInt(35n+o.v-27n);const m=27n+(o.v===27n?0n:1n);if(o.v!==m)throw new F.InvalidLegacyVError({v:o.v});return m})(),T=h.trim(o.r),b=h.trim(o.s);t=[...t,r.numberToHex(l),T==="0x00"?"0x":T,b==="0x00"?"0x":b]}else n>0&&(t=[...t,r.numberToHex(n),"0x","0x"]);return d.toRlp(t)}function z(e,o){const n=o??e,{v:s,yParity:i}=n;if(typeof n.r>"u")return[];if(typeof n.s>"u")return[];if(typeof s>"u"&&typeof i>"u")return[];const c=h.trim(n.r),a=h.trim(n.s);return[typeof i=="number"?i?r.numberToHex(1):"0x":s===0n?"0x":s===1n?r.numberToHex(1):s===27n?"0x":r.numberToHex(1),c==="0x00"?"0x":c,a==="0x00"?"0x":a]}exports.serializeTransaction=k;exports.toYParitySignatureArray=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=BigInt(2**32-1),c=BigInt(32);function u(t,o=!1){return o?{h:Number(t&l),l:Number(t>>c&l)}:{h:Number(t>>c&l)|0,l:Number(t&l)|0}}function B(t,o=!1){const r=t.length;let n=new Uint32Array(r),i=new Uint32Array(r);for(let e=0;e<r;e++){const{h:f,l:s}=u(t[e],o);[n[e],i[e]]=[f,s]}return[n,i]}const g=(t,o,r)=>t<<r|o>>>32-r,m=(t,o,r)=>o<<r|t>>>32-r,S=(t,o,r)=>o<<r-32|t>>>64-r,a=(t,o,r)=>t<<r-32|o>>>64-r;exports.fromBig=u;exports.rotlBH=S;exports.rotlBL=a;exports.rotlSH=g;exports.rotlSL=m;exports.split=B;

package/dist/index232.js

@@ -1,174 +1,22 @@
-import { InvalidLegacyVError as H } from "./index140.js";
-import { serializeAuthorizationList as g } from "./index233.js";
-import { blobsToCommitments as B } from "./index209.js";
-import { blobsToProofs as V } from "./index213.js";
-import { commitmentsToVersionedHashes as C } from "./index212.js";
-import { toBlobSidecars as k } from "./index214.js";
-import { concatHex as h } from "./index159.js";
-import { trim as T } from "./index167.js";
-import { numberToHex as o, bytesToHex as w } from "./index155.js";
-import { toRlp as b } from "./index199.js";
-import { assertTransactionEIP1559 as S, assertTransactionEIP2930 as _, assertTransactionEIP4844 as R, assertTransactionEIP7702 as Y, assertTransactionLegacy as j } from "./index203.js";
-import { getTransactionType as q } from "./index191.js";
-import { serializeAccessList as v } from "./index231.js";
-function te(e, r) {
-  const i = q(e);
-  return i === "eip1559" ? K(e, r) : i === "eip2930" ? M(e, r) : i === "eip4844" ? J(e, r) : i === "eip7702" ? D(e, r) : N(e, r);
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function s(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 D(e, r) {
-  const { authorizationList: i, chainId: s, gas: n, nonce: c, to: f, value: a, maxFeePerGas: x, maxPriorityFeePerGas: t, accessList: p, data: l } = e;
-  Y(e);
-  const d = v(p), m = g(i);
-  return h([
-    "0x04",
-    b([
-      o(s),
-      c ? o(c) : "0x",
-      t ? o(t) : "0x",
-      x ? o(x) : "0x",
-      n ? o(n) : "0x",
-      f ?? "0x",
-      a ? o(a) : "0x",
-      l ?? "0x",
-      d,
-      m,
-      ...I(e, r)
-    ])
-  ]);
-}
-function J(e, r) {
-  const { chainId: i, gas: s, nonce: n, to: c, value: f, maxFeePerBlobGas: a, maxFeePerGas: x, maxPriorityFeePerGas: t, accessList: p, data: l } = e;
-  R(e);
-  let d = e.blobVersionedHashes, m = e.sidecars;
-  if (e.blobs && (typeof d > "u" || typeof m > "u")) {
-    const u = typeof e.blobs[0] == "string" ? e.blobs : e.blobs.map((P) => w(P)), z = e.kzg, y = B({
-      blobs: u,
-      kzg: z
-    });
-    if (typeof d > "u" && (d = C({
-      commitments: y
-    })), typeof m > "u") {
-      const P = V({ blobs: u, commitments: y, kzg: z });
-      m = k({ blobs: u, commitments: y, proofs: P });
-    }
+function h(t, r = !1) {
+  const n = t.length;
+  let l = new Uint32Array(n), c = new Uint32Array(n);
+  for (let e = 0; e < n; e++) {
+    const { h: u, l: f } = s(t[e], r);
+    [l[e], c[e]] = [u, f];
   }
-  const L = v(p), E = [
-    o(i),
-    n ? o(n) : "0x",
-    t ? o(t) : "0x",
-    x ? o(x) : "0x",
-    s ? o(s) : "0x",
-    c ?? "0x",
-    f ? o(f) : "0x",
-    l ?? "0x",
-    L,
-    a ? o(a) : "0x",
-    d ?? [],
-    ...I(e, r)
-  ], A = [], F = [], G = [];
-  if (m)
-    for (let u = 0; u < m.length; u++) {
-      const { blob: z, commitment: y, proof: P } = m[u];
-      A.push(z), F.push(y), G.push(P);
-    }
-  return h([
-    "0x03",
-    m ? (
-      // If sidecars are enabled, envelope turns into a "wrapper":
-      b([E, A, F, G])
-    ) : (
-      // If sidecars are disabled, standard envelope is used:
-      b(E)
-    )
-  ]);
-}
-function K(e, r) {
-  const { chainId: i, gas: s, nonce: n, to: c, value: f, maxFeePerGas: a, maxPriorityFeePerGas: x, accessList: t, data: p } = e;
-  S(e);
-  const l = v(t), d = [
-    o(i),
-    n ? o(n) : "0x",
-    x ? o(x) : "0x",
-    a ? o(a) : "0x",
-    s ? o(s) : "0x",
-    c ?? "0x",
-    f ? o(f) : "0x",
-    p ?? "0x",
-    l,
-    ...I(e, r)
-  ];
-  return h([
-    "0x02",
-    b(d)
-  ]);
-}
-function M(e, r) {
-  const { chainId: i, gas: s, data: n, nonce: c, to: f, value: a, accessList: x, gasPrice: t } = e;
-  _(e);
-  const p = v(x), l = [
-    o(i),
-    c ? o(c) : "0x",
-    t ? o(t) : "0x",
-    s ? o(s) : "0x",
-    f ?? "0x",
-    a ? o(a) : "0x",
-    n ?? "0x",
-    p,
-    ...I(e, r)
-  ];
-  return h([
-    "0x01",
-    b(l)
-  ]);
-}
-function N(e, r) {
-  const { chainId: i = 0, gas: s, data: n, nonce: c, to: f, value: a, gasPrice: x } = e;
-  j(e);
-  let t = [
-    c ? o(c) : "0x",
-    x ? o(x) : "0x",
-    s ? o(s) : "0x",
-    f ?? "0x",
-    a ? o(a) : "0x",
-    n ?? "0x"
-  ];
-  if (r) {
-    const p = (() => {
-      if (r.v >= 35n)
-        return (r.v - 35n) / 2n > 0 ? r.v : 27n + (r.v === 35n ? 0n : 1n);
-      if (i > 0)
-        return BigInt(i * 2) + BigInt(35n + r.v - 27n);
-      const m = 27n + (r.v === 27n ? 0n : 1n);
-      if (r.v !== m)
-        throw new H({ v: r.v });
-      return m;
-    })(), l = T(r.r), d = T(r.s);
-    t = [
-      ...t,
-      o(p),
-      l === "0x00" ? "0x" : l,
-      d === "0x00" ? "0x" : d
-    ];
-  } else i > 0 && (t = [
-    ...t,
-    o(i),
-    "0x",
-    "0x"
-  ]);
-  return b(t);
-}
-function I(e, r) {
-  const i = r ?? e, { v: s, yParity: n } = i;
-  if (typeof i.r > "u")
-    return [];
-  if (typeof i.s > "u")
-    return [];
-  if (typeof s > "u" && typeof n > "u")
-    return [];
-  const c = T(i.r), f = T(i.s);
-  return [typeof n == "number" ? n ? o(1) : "0x" : s === 0n ? "0x" : s === 1n ? o(1) : s === 27n ? "0x" : o(1), c === "0x00" ? "0x" : c, f === "0x00" ? "0x" : f];
+  return [l, c];
 }
+const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  te as serializeTransaction,
-  I as toYParitySignatureArray
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
 };

package/dist/index233.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index155.cjs"),c=require("./index232.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"});const u=require("./index239.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function s(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function c(t,...e){if(!p(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function m(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");s(t.outputLen),s(t.blockLen)}function B(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function E(t,e){c(t);const n=e.outputLen;if(t.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}function H(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function U(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function L(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function S(t,e){return t<<32-e|t>>>e}const h=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function w(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function g(t){for(let e=0;e<t.length;e++)t[e]=w(t[e]);return t}const T=h?t=>t:g,d=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",V=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function _(t){if(c(t),d)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=V[t[n]];return e}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function l(t){if(t>=f._0&&t<=f._9)return t-f._0;if(t>=f.A&&t<=f.F)return t-(f.A-10);if(t>=f.a&&t<=f.f)return t-(f.a-10)}function I(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(d)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let o=0,i=0;o<n;o++,i+=2){const a=l(t.charCodeAt(i)),y=l(t.charCodeAt(i+1));if(a===void 0||y===void 0){const A=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+A+'" at index '+i)}r[o]=a*16+y}return r}function x(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function b(t){return typeof t=="string"&&(t=x(t)),c(t),t}function k(...t){let e=0;for(let r=0;r<t.length;r++){const o=t[r];c(o),e+=o.length}const n=new Uint8Array(e);for(let r=0,o=0;r<t.length;r++){const i=t[r];n.set(i,o),o+=i.length}return n}class O{}function R(t){const e=r=>t().update(b(r)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}function v(t=32){if(u.crypto&&typeof u.crypto.getRandomValues=="function")return u.crypto.getRandomValues(new Uint8Array(t));if(u.crypto&&typeof u.crypto.randomBytes=="function")return Uint8Array.from(u.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=O;exports.abytes=c;exports.aexists=B;exports.ahash=m;exports.anumber=s;exports.aoutput=E;exports.byteSwap=w;exports.byteSwap32=g;exports.bytesToHex=_;exports.clean=U;exports.concatBytes=k;exports.createHasher=R;exports.createView=L;exports.hexToBytes=I;exports.isBytes=p;exports.isLE=h;exports.randomBytes=v;exports.rotr=S;exports.swap32IfBE=T;exports.toBytes=b;exports.u32=H;exports.utf8ToBytes=x;

package/dist/index233.js

@@ -1,20 +1,149 @@
-import { toHex as i } from "./index155.js";
-import { toYParitySignatureArray as c } from "./index232.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)
-    ]);
-  }
+import { crypto as u } from "./index239.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function w(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function l(t) {
+  if (!Number.isSafeInteger(t) || t < 0)
+    throw new Error("positive integer expected, got " + t);
+}
+function c(t, ...e) {
+  if (!w(t))
+    throw new Error("Uint8Array expected");
+  if (e.length > 0 && !e.includes(t.length))
+    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
+}
+function U(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  l(t.outputLen), l(t.blockLen);
+}
+function B(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function H(t, e) {
+  c(t);
+  const n = e.outputLen;
+  if (t.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
+}
+function L(t) {
+  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+}
+function V(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function _(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function S(t, e) {
+  return t << 32 - e | t >>> e;
+}
+const d = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function h(t) {
+  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+}
+function x(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = h(t[e]);
   return t;
 }
+const T = d ? (t) => t : x, p = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", A = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function k(t) {
+  if (c(t), p)
+    return t.toHex();
+  let e = "";
+  for (let n = 0; n < t.length; n++)
+    e += A[t[n]];
+  return e;
+}
+const f = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function y(t) {
+  if (t >= f._0 && t <= f._9)
+    return t - f._0;
+  if (t >= f.A && t <= f.F)
+    return t - (f.A - 10);
+  if (t >= f.a && t <= f.f)
+    return t - (f.a - 10);
+}
+function I(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (p)
+    return Uint8Array.fromHex(t);
+  const e = t.length, n = e / 2;
+  if (e % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + e);
+  const r = new Uint8Array(n);
+  for (let o = 0, i = 0; o < n; o++, i += 2) {
+    const s = y(t.charCodeAt(i)), a = y(t.charCodeAt(i + 1));
+    if (s === void 0 || a === void 0) {
+      const g = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + g + '" at index ' + i);
+    }
+    r[o] = s * 16 + a;
+  }
+  return r;
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function b(t) {
+  return typeof t == "string" && (t = m(t)), c(t), t;
+}
+function R(...t) {
+  let e = 0;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    c(o), e += o.length;
+  }
+  const n = new Uint8Array(e);
+  for (let r = 0, o = 0; r < t.length; r++) {
+    const i = t[r];
+    n.set(i, o), o += i.length;
+  }
+  return n;
+}
+class F {
+}
+function O(t) {
+  const e = (r) => t().update(b(r)).digest(), n = t();
+  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
+}
+function v(t = 32) {
+  if (u && typeof u.getRandomValues == "function")
+    return u.getRandomValues(new Uint8Array(t));
+  if (u && typeof u.randomBytes == "function")
+    return Uint8Array.from(u.randomBytes(t));
+  throw new Error("crypto.getRandomValues must be defined");
+}
 export {
-  f as serializeAuthorizationList
+  F as Hash,
+  c as abytes,
+  B as aexists,
+  U as ahash,
+  l as anumber,
+  H as aoutput,
+  h as byteSwap,
+  x as byteSwap32,
+  k as bytesToHex,
+  V as clean,
+  R as concatBytes,
+  O as createHasher,
+  _ as createView,
+  I as hexToBytes,
+  w as isBytes,
+  d as isLE,
+  v as randomBytes,
+  S as rotr,
+  T as swap32IfBE,
+  b as toBytes,
+  L as u32,
+  m as utf8ToBytes
 };