@gardenfi/utils 2.1.3 → 2.2.0

package/dist/index191.js

@@ -1,23 +1,27 @@
-import { isHex as c } from "./index185.js";
-import { hexToBigInt as n, hexToNumber as a } from "./index182.js";
-import { toHex as i } from "./index150.js";
-async function R({ hash: e, signature: r }) {
-  const u = c(e) ? e : i(e), { secp256k1: o } = await import("./index192.js");
+import { isHex as i } from "./index185.js";
+import { size as b } from "./index124.js";
+import { hexToBigInt as n, hexToNumber as d } from "./index182.js";
+import { toHex as c } from "./index150.js";
+async function R({ hash: r, signature: e }) {
+  const u = i(r) ? r : c(r), { secp256k1: t } = await import("./index192.js");
   return `0x${(() => {
-    if (typeof r == "object" && "r" in r && "s" in r) {
-      const { r: y, s: p, v, yParity: x } = r, b = Number(x ?? v), l = s(b);
-      return new o.Signature(n(y), n(p)).addRecoveryBit(l);
+    if (typeof e == "object" && "r" in e && "s" in e) {
+      const { r: p, s: v, v: y, yParity: l } = e, x = Number(l ?? y), a = s(x);
+      return new t.Signature(n(p), n(v)).addRecoveryBit(a);
     }
-    const t = c(r) ? r : i(r), f = a(`0x${t.slice(130)}`), m = s(f);
-    return o.Signature.fromCompact(t.substring(2, 130)).addRecoveryBit(m);
+    const o = i(e) ? e : c(e);
+    if (b(o) !== 65)
+      throw new Error("invalid signature length");
+    const f = d(`0x${o.slice(130)}`), m = s(f);
+    return t.Signature.fromCompact(o.substring(2, 130)).addRecoveryBit(m);
   })().recoverPublicKey(u.substring(2)).toHex(!1)}`;
 }
-function s(e) {
-  if (e === 0 || e === 1)
-    return e;
-  if (e === 27)
+function s(r) {
+  if (r === 0 || r === 1)
+    return r;
+  if (r === 27)
     return 0;
-  if (e === 28)
+  if (r === 28)
     return 1;
   throw new Error("Invalid yParityOrV value");
 }

package/dist/index192.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const j=require("./index277.cjs"),n=require("./index278.cjs"),C=require("./index226.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const k=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),x=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),G=BigInt(1),w=BigInt(2),h=(t,f)=>(t+f/w)/f;function M(t){const f=k,e=BigInt(3),r=BigInt(6),p=BigInt(11),a=BigInt(22),s=BigInt(23),i=BigInt(44),d=BigInt(88),o=t*t*t%f,c=o*o*t%f,g=n.pow2(c,e,f)*c%f,b=n.pow2(g,e,f)*c%f,l=n.pow2(b,w,f)*o%f,B=n.pow2(l,p,f)*l%f,I=n.pow2(B,a,f)*B%f,_=n.pow2(I,i,f)*I%f,P=n.pow2(_,d,f)*_%f,S=n.pow2(P,i,f)*I%f,v=n.pow2(S,e,f)*c%f,E=n.pow2(v,s,f)*B%f,F=n.pow2(E,r,f)*o%f,q=n.pow2(F,w,f);if(!u.eql(u.sqr(q),t))throw new Error("Cannot find square root");return q}const u=n.Field(k,void 0,void 0,{sqrt:M}),m=j.createCurve({a:BigInt(0),b:BigInt(7),Fp:u,n:x,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const f=x,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-G*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),p=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),a=e,s=BigInt("0x100000000000000000000000000000000"),i=h(a*t,f),d=h(-r*t,f);let o=n.mod(t-i*e-d*p,f),c=n.mod(-i*r-d*a,f);const g=o>s,b=c>s;if(g&&(o=f-o),b&&(c=f-c),o>s||c>s)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:g,k1:o,k2neg:b,k2:c}}}},C.sha256);BigInt(0);m.ProjectivePoint;exports.secp256k1=m;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const C=require("./index277.cjs"),F=require("./index278.cjs"),n=require("./index279.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const p={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")};BigInt(0);const P=BigInt(1),u=BigInt(2),h=(t,f)=>(t+f/u)/f;function G(t){const f=p.p,e=BigInt(3),a=BigInt(6),B=BigInt(11),r=BigInt(22),s=BigInt(23),i=BigInt(44),d=BigInt(88),o=t*t*t%f,c=o*o*t%f,b=n.pow2(c,e,f)*c%f,g=n.pow2(b,e,f)*c%f,_=n.pow2(g,u,f)*o%f,I=n.pow2(_,B,f)*_%f,w=n.pow2(I,r,f)*I%f,x=n.pow2(w,i,f)*w%f,k=n.pow2(x,d,f)*x%f,m=n.pow2(k,i,f)*w%f,S=n.pow2(m,e,f)*c%f,E=n.pow2(S,s,f)*I%f,v=n.pow2(E,a,f)*o%f,q=n.pow2(v,u,f);if(!l.eql(l.sqr(q),t))throw new Error("Cannot find square root");return q}const l=n.Field(p.p,void 0,void 0,{sqrt:G}),M=F.createCurve({...p,Fp:l,lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const f=p.n,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),a=-P*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),B=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),r=e,s=BigInt("0x100000000000000000000000000000000"),i=h(r*t,f),d=h(-a*t,f);let o=n.mod(t-i*e-d*B,f),c=n.mod(-i*a-d*r,f);const b=o>s,g=c>s;if(b&&(o=f-o),g&&(c=f-c),o>s||c>s)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:b,k1:o,k2neg:g,k2:c}}}},C.sha256);exports.secp256k1=M;

package/dist/index192.js

@@ -1,40 +1,42 @@
-import { createCurve as C } from "./index277.js";
-import { Field as G, mod as k, pow2 as t } from "./index278.js";
-import { sha256 as N } from "./index226.js";
+import { sha256 as v } from "./index277.js";
+import { createCurve as G } from "./index278.js";
+import { Field as P, mod as h, pow2 as t } from "./index279.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const q = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), w = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), j = BigInt(1), _ = BigInt(2), h = (n, f) => (n + f / _) / f;
-function M(n) {
-  const f = q, e = BigInt(3), r = BigInt(6), I = BigInt(11), a = BigInt(22), s = BigInt(23), i = BigInt(44), g = BigInt(88), o = n * n * n % f, c = o * o * n % f, d = t(c, e, f) * c % f, B = t(d, e, f) * c % f, m = t(B, _, f) * o % f, b = t(m, I, f) * m % f, p = t(b, a, f) * b % f, x = t(p, i, f) * p % f, P = t(x, g, f) * x % f, v = t(P, i, f) * p % f, E = t(v, e, f) * c % f, F = t(E, s, f) * b % f, S = t(F, r, f) * o % f, u = t(S, _, f);
-  if (!l.eql(l.sqr(u), n))
-    throw new Error("Cannot find square root");
-  return u;
-}
-const l = G(q, void 0, void 0, { sqrt: M }), O = C({
+const B = {
+  p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
+  n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
+  h: BigInt(1),
   a: BigInt(0),
   b: BigInt(7),
+  Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
+  Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
+};
+BigInt(0);
+const M = BigInt(1), x = BigInt(2), k = (n, f) => (n + f / x) / f;
+function N(n) {
+  const f = B.p, e = BigInt(3), a = BigInt(6), I = BigInt(11), b = BigInt(22), s = BigInt(23), i = BigInt(44), r = BigInt(88), c = n * n * n % f, o = c * c * n % f, d = t(o, e, f) * o % f, g = t(d, e, f) * o % f, m = t(g, x, f) * c % f, p = t(m, I, f) * m % f, _ = t(p, b, f) * p % f, u = t(_, i, f) * _ % f, q = t(u, r, f) * u % f, E = t(q, i, f) * _ % f, C = t(E, e, f) * o % f, F = t(C, s, f) * p % f, S = t(F, a, f) * c % f, w = t(S, x, f);
+  if (!l.eql(l.sqr(w), n))
+    throw new Error("Cannot find square root");
+  return w;
+}
+const l = P(B.p, void 0, void 0, { sqrt: N }), V = G({
+  ...B,
   Fp: l,
-  n: w,
-  Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
-  Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
-  h: BigInt(1),
-  // Cofactor
   lowS: !0,
   // Allow only low-S signatures by default in sign() and verify()
   endo: {
     // Endomorphism, see above
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (n) => {
-      const f = w, e = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -j * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), I = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), a = e, s = BigInt("0x100000000000000000000000000000000"), i = h(a * n, f), g = h(-r * n, f);
-      let o = k(n - i * e - g * I, f), c = k(-i * r - g * a, f);
-      const d = o > s, B = c > s;
-      if (d && (o = f - o), B && (c = f - c), o > s || c > s)
+      const f = B.n, e = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), a = -M * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), I = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), b = e, s = BigInt("0x100000000000000000000000000000000"), i = k(b * n, f), r = k(-a * n, f);
+      let c = h(n - i * e - r * I, f), o = h(-i * a - r * b, f);
+      const d = c > s, g = o > s;
+      if (d && (c = f - c), g && (o = f - o), c > s || o > s)
         throw new Error("splitScalar: Endomorphism failed, k=" + n);
-      return { k1neg: d, k1: o, k2neg: B, k2: c };
+      return { k1neg: d, k1: c, k2neg: g, k2: o };
     }
   }
-}, N);
-BigInt(0);
-O.ProjectivePoint;
+}, v);
 export {
-  O as secp256k1
+  V as secp256k1
 };

package/dist/index203.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index21.cjs"),y=require("./index128.cjs"),d=require("./index169.cjs"),c=require("./index175.cjs"),b=require("./index179.cjs"),h="x-batch-gateway:true";async function q(e){const{data:o,ccipRequest:n}=e,{args:[u]}=d.decodeFunctionData({abi:r.batchGatewayAbi,data:o}),a=[],s=[];return await Promise.all(u.map(async(i,t)=>{try{s[t]=await n(i),a[t]=!1}catch(l){a[t]=!0,s[t]=g(l)}})),b.encodeFunctionResult({abi:r.batchGatewayAbi,functionName:"query",result:[a,s]})}function g(e){return e.name==="HttpRequestError"&&e.status?c.encodeErrorResult({abi:r.batchGatewayAbi,errorName:"HttpError",args:[e.status,e.shortMessage]}):c.encodeErrorResult({abi:[y.solidityError],errorName:"Error",args:["shortMessage"in e?e.shortMessage:e.message]})}exports.localBatchGatewayRequest=q;exports.localBatchGatewayUrl=h;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index21.cjs"),y=require("./index128.cjs"),h=require("./index169.cjs"),n=require("./index175.cjs"),w=require("./index179.cjs"),u="x-batch-gateway:true";async function i(t){const{data:l,ccipRequest:o}=t,{args:[d]}=h.decodeFunctionData({abi:c.batchGatewayAbi,data:l}),a=[],s=[];return await Promise.all(d.map(async(r,e)=>{try{s[e]=r.urls.includes(u)?await i({data:r.data,ccipRequest:o}):await o(r),a[e]=!1}catch(b){a[e]=!0,s[e]=g(b)}})),w.encodeFunctionResult({abi:c.batchGatewayAbi,functionName:"query",result:[a,s]})}function g(t){return t.name==="HttpRequestError"&&t.status?n.encodeErrorResult({abi:c.batchGatewayAbi,errorName:"HttpError",args:[t.status,t.shortMessage]}):n.encodeErrorResult({abi:[y.solidityError],errorName:"Error",args:["shortMessage"in t?t.shortMessage:t.message]})}exports.localBatchGatewayRequest=i;exports.localBatchGatewayUrl=u;

package/dist/index203.js

@@ -1,35 +1,35 @@
-import { batchGatewayAbi as s } from "./index21.js";
+import { batchGatewayAbi as o } from "./index21.js";
 import { solidityError as l } from "./index128.js";
 import { decodeFunctionData as f } from "./index169.js";
-import { encodeErrorResult as o } from "./index175.js";
+import { encodeErrorResult as n } from "./index175.js";
 import { encodeFunctionResult as p } from "./index179.js";
-const E = "x-batch-gateway:true";
-async function q(t) {
-  const { data: c, ccipRequest: n } = t, { args: [i] } = f({ abi: s, data: c }), e = [], r = [];
-  return await Promise.all(i.map(async (u, a) => {
+const d = "x-batch-gateway:true";
+async function g(t) {
+  const { data: i, ccipRequest: c } = t, { args: [u] } = f({ abi: o, data: i }), e = [], s = [];
+  return await Promise.all(u.map(async (r, a) => {
     try {
-      r[a] = await n(u), e[a] = !1;
+      s[a] = r.urls.includes(d) ? await g({ data: r.data, ccipRequest: c }) : await c(r), e[a] = !1;
     } catch (m) {
-      e[a] = !0, r[a] = y(m);
+      e[a] = !0, s[a] = h(m);
     }
   })), p({
-    abi: s,
+    abi: o,
     functionName: "query",
-    result: [e, r]
+    result: [e, s]
   });
 }
-function y(t) {
-  return t.name === "HttpRequestError" && t.status ? o({
-    abi: s,
+function h(t) {
+  return t.name === "HttpRequestError" && t.status ? n({
+    abi: o,
     errorName: "HttpError",
     args: [t.status, t.shortMessage]
-  }) : o({
+  }) : n({
     abi: [l],
     errorName: "Error",
     args: ["shortMessage" in t ? t.shortMessage : t.message]
   });
 }
 export {
-  q as localBatchGatewayRequest,
-  E as localBatchGatewayUrl
+  g as localBatchGatewayRequest,
+  d as localBatchGatewayUrl
 };

package/dist/index222.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index279.cjs"),r=require("./index280.cjs");function n(t){return e.hashSignature(r.toSignature(t))}exports.toSignatureHash=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index280.cjs"),r=require("./index281.cjs");function n(t){return e.hashSignature(r.toSignature(t))}exports.toSignatureHash=n;

package/dist/index222.js

@@ -1,5 +1,5 @@
-import { hashSignature as t } from "./index279.js";
-import { toSignature as o } from "./index280.js";
+import { hashSignature as t } from "./index280.js";
+import { toSignature as o } from "./index281.js";
 function a(r) {
   return t(o(r));
 }

package/dist/index225.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index282.cjs"),f=require("./index283.cjs"),c=require("./index284.cjs"),O=[],I=[],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],O.push(2*(5*n+s)),I.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[F,X]=f.split(w,!0),b=(i,t,s)=>s>32?f.rotlBH(i,t,s):f.rotlSH(i,t,s),y=(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],l=s[p+1],_=b(d,l,1)^s[h],g=y(d,l,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=I[e],p=b(o,r,h),d=y(o,r,h),l=O[e];o=i[l],r=i[l+1],i[l]=p,i[l+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]^=F[n],i[1]^=X[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,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=n,this.enableXOF=o,this.rounds=r,u.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){u.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){u.aexists(this,!1),u.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 u.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(u.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 m=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),E=m(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=E;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index283.cjs"),c=require("./index284.cjs"),A=BigInt(0),u=BigInt(1),H=BigInt(2),L=BigInt(7),S=BigInt(256),T=BigInt(113),O=[],y=[],w=[];for(let n=0,t=u,s=1,i=0;n<24;n++){[s,i]=[i,(2*s+3*i)%5],O.push(2*(5*i+s)),y.push((n+1)*(n+2)/2%64);let o=A;for(let r=0;r<7;r++)t=(t<<u^(t>>L)*T)%S,t&H&&(o^=u<<(u<<BigInt(r))-u);w.push(o)}const _=f.split(w,!0),F=_[0],X=_[1],I=(n,t,s)=>s>32?f.rotlBH(n,t,s):f.rotlSH(n,t,s),x=(n,t,s)=>s>32?f.rotlBL(n,t,s):f.rotlSL(n,t,s);function b(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,p=s[l],a=s[l+1],g=I(p,a,1)^s[h],B=x(p,a,1)^s[h+1];for(let d=0;d<50;d+=10)n[e+d]^=g,n[e+d+1]^=B}let o=n[2],r=n[3];for(let e=0;e<24;e++){const h=y[e],l=I(o,r,h),p=x(o,r,h),a=O[e];o=n[a],r=n[a+1],n[a]=l,n[a+1]=p}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]^=F[i],n[1]^=X[i]}c.clean(s)}class k extends c.Hash{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,c.anumber(i),!(0<t&&t<200))throw new Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}clone(){return this._cloneInto()}keccak(){c.swap32IfBE(this.state32),b(this.state32,this.rounds),c.swap32IfBE(this.state32),this.posOut=0,this.pos=0}update(t){c.aexists(this),t=c.toBytes(t),c.abytes(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){c.aexists(this,!1),c.abytes(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 c.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(c.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,c.clean(this.state)}_cloneInto(t){const{blockLen:s,suffix:i,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new k(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 m=(n,t,s)=>c.createHasher(()=>new k(t,n,s)),E=m(1,136,256/8);exports.Keccak=k;exports.keccakP=b;exports.keccak_256=E;

package/dist/index225.js

@@ -1,59 +1,59 @@
-import { anumber as d, aexists as k, abytes as B, aoutput as A } from "./index282.js";
-import { rotlSH as H, rotlSL as m, rotlBH as S, rotlBL as T, split as F } from "./index283.js";
-import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index284.js";
-const y = [], b = [], L = [], 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 i = 0, t = f, s = 1, n = 0; i < 24; i++) {
-  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), b.push((i + 1) * (i + 2) / 2 % 64);
-  let o = M;
+import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index283.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 "./index284.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 >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  L.push(o);
+    t = (t << f ^ (t >> q) * z) % v, t & j && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
+  B.push(o);
 }
-const [v, z] = /* @__PURE__ */ F(L, !0), O = (i, t, s) => s > 32 ? S(i, t, s) : H(i, t, s), w = (i, t, s) => s > 32 ? T(i, t, s) : m(i, t, s);
-function D(i, t = 24) {
+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 n = 24 - t; n < 24; n++) {
+  for (let i = 24 - t; i < 24; i++) {
     for (let e = 0; e < 10; e++)
-      s[e] = i[e] ^ i[e + 10] ^ i[e + 20] ^ i[e + 30] ^ i[e + 40];
+      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], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
+      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)
-        i[e + a] ^= _, i[e + a + 1] ^= g;
+        n[e + a] ^= b, n[e + a + 1] ^= H;
     }
-    let o = i[2], r = i[3];
+    let o = n[2], r = n[3];
     for (let e = 0; e < 24; e++) {
-      const h = b[e], l = O(o, r, h), u = w(o, r, h), c = y[e];
-      o = i[c], r = i[c + 1], i[c] = l, i[c + 1] = u;
+      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] = i[e + h];
+        s[h] = n[e + h];
       for (let h = 0; h < 10; h++)
-        i[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+        n[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
     }
-    i[0] ^= v[n], i[1] ^= z[n];
+    n[0] ^= C[i], n[1] ^= D[i];
   }
-  s.fill(0);
+  y(s);
 }
 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.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, this.enableXOF = !1, this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, d(n), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
+  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() {
-    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
+    I(this.state32), G(this.state32, this.rounds), 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;
+    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++)
-        n[this.pos++] ^= t[r++];
+        i[this.pos++] ^= t[r++];
       this.pos === s && this.keccak();
     }
     return this;
@@ -62,15 +62,15 @@ class p extends E {
     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 { 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) {
-    k(this, !1), B(t), this.finish();
-    const s = this.state, { blockLen: n } = this;
+    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 >= n && this.keccak();
-      const e = Math.min(n - this.posOut, r - o);
+      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;
@@ -84,7 +84,7 @@ class p extends E {
     return d(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (A(t, this), this.finished)
+    if (M(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -92,16 +92,16 @@ class p extends E {
     return this.digestInto(new Uint8Array(this.outputLen));
   }
   destroy() {
-    this.destroyed = !0, this.state.fill(0);
+    this.destroyed = !0, y(this.state);
   }
   _cloneInto(t) {
-    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: e } = this;
-    return t || (t = new p(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 { 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 G = (i, t, s) => X(() => new p(t, i, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
+const J = (n, t, s) => X(() => new p(t, n, s)), Q = J(1, 136, 256 / 8);
 export {
   p as Keccak,
-  D as keccakP,
+  G as keccakP,
   Q as keccak_256
 };

package/dist/index226.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index285.cjs"),s=require("./index284.cjs"),S=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),f=new Uint32Array(64);class g extends H.HashMD{constructor(o=32){super(64,o,8,!1),this.A=b[0]|0,this.B=b[1]|0,this.C=b[2]|0,this.D=b[3]|0,this.E=b[4]|0,this.F=b[5]|0,this.G=b[6]|0,this.H=b[7]|0}get(){const{A:o,B:h,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[o,h,x,e,a,i,c,r]}set(o,h,x,e,a,i,c,r){this.A=o|0,this.B=h|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(o,h){for(let t=0;t<16;t++,h+=4)f[t]=o.getUint32(h,!1);for(let t=16;t<64;t++){const A=f[t-15],d=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(d,17)^s.rotr(d,19)^d>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:n,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),d=l+A+H.Chi(c,r,n)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=n,n=r,r=c,c=i+d|0,i=a,a=e,e=x,x=d+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,n=n+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,n,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index277.cjs"),s=e.sha256;exports.sha256=s;

package/dist/index226.js

@@ -1,115 +1,5 @@
-import { HashMD as m, Chi as p, Maj as u } from "./index285.js";
-import { wrapConstructor as D, rotr as i } from "./index284.js";
-const g = /* @__PURE__ */ new Uint32Array([
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-]), b = /* @__PURE__ */ new Uint32Array([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]), h = /* @__PURE__ */ new Uint32Array(64);
-class w extends m {
-  constructor(o = 32) {
-    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
-  }
-  get() {
-    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
-    return [o, r, t, s, a, f, c, e];
-  }
-  // prettier-ignore
-  set(o, r, t, s, a, f, c, e) {
-    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
-  }
-  process(o, r) {
-    for (let x = 0; x < 16; x++, r += 4)
-      h[x] = o.getUint32(r, !1);
-    for (let x = 16; x < 64; x++) {
-      const A = h[x - 15], d = h[x - 2], C = i(A, 7) ^ i(A, 18) ^ A >>> 3, H = i(d, 17) ^ i(d, 19) ^ d >>> 10;
-      h[x] = H + h[x - 7] + C + h[x - 16] | 0;
-    }
-    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: l } = this;
-    for (let x = 0; x < 64; x++) {
-      const A = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = l + A + p(c, e, n) + g[x] + h[x] | 0, H = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + u(t, s, a) | 0;
-      l = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + H | 0;
-    }
-    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, l = l + this.H | 0, this.set(t, s, a, f, c, e, n, l);
-  }
-  roundClean() {
-    h.fill(0);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
-  }
-}
-const G = /* @__PURE__ */ D(() => new w());
+import { sha256 as s } from "./index277.js";
+const o = s;
 export {
-  w as SHA256,
-  G as sha256
+  o as sha256
 };

package/dist/index228.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const F=require("./index135.cjs"),G=require("./index229.cjs"),R=require("./index204.cjs"),S=require("./index208.cjs"),B=require("./index207.cjs"),V=require("./index209.cjs"),L=require("./index154.cjs"),h=require("./index162.cjs"),t=require("./index150.cjs"),b=require("./index194.cjs"),z=require("./index198.cjs"),C=require("./index186.cjs"),v=require("./index227.cjs");function k(e,o){const s=C.getTransactionType(e);return s==="eip1559"?_(e,o):s==="eip2930"?j(e,o):s==="eip4844"?Y(e,o):s==="eip7702"?w(e,o):M(e,o)}function w(e,o){const{authorizationList:s,chainId:i,gas:r,nonce:c,to:a,value:x,maxFeePerGas:l,maxPriorityFeePerGas:n,accessList:H,data:d}=e;z.assertTransactionEIP7702(e);const f=v.serializeAccessList(H),u=G.serializeAuthorizationList(s);return L.concatHex(["0x04",b.toRlp([t.toHex(i),c?t.toHex(c):"0x",n?t.toHex(n):"0x",l?t.toHex(l):"0x",r?t.toHex(r):"0x",a??"0x",x?t.toHex(x):"0x",d??"0x",f,u,...T(e,o)])])}function Y(e,o){const{chainId:s,gas:i,nonce:r,to:c,value:a,maxFeePerBlobGas:x,maxFeePerGas:l,maxPriorityFeePerGas:n,accessList:H,data:d}=e;z.assertTransactionEIP4844(e);let f=e.blobVersionedHashes,u=e.sidecars;if(e.blobs&&(typeof f>"u"||typeof u>"u")){const m=typeof e.blobs[0]=="string"?e.blobs:e.blobs.map(y=>t.bytesToHex(y)),P=e.kzg,p=R.blobsToCommitments({blobs:m,kzg:P});if(typeof f>"u"&&(f=B.commitmentsToVersionedHashes({commitments:p})),typeof u>"u"){const y=S.blobsToProofs({blobs:m,commitments:p,kzg:P});u=V.toBlobSidecars({blobs:m,commitments:p,proofs:y})}}const I=v.serializeAccessList(H),A=[t.toHex(s),r?t.toHex(r):"0x",n?t.toHex(n):"0x",l?t.toHex(l):"0x",i?t.toHex(i):"0x",c??"0x",a?t.toHex(a):"0x",d??"0x",I,x?t.toHex(x):"0x",f??[],...T(e,o)],q=[],g=[],E=[];if(u)for(let m=0;m<u.length;m++){const{blob:P,commitment:p,proof:y}=u[m];q.push(P),g.push(p),E.push(y)}return L.concatHex(["0x03",u?b.toRlp([A,q,g,E]):b.toRlp(A)])}function _(e,o){const{chainId:s,gas:i,nonce:r,to:c,value:a,maxFeePerGas:x,maxPriorityFeePerGas:l,accessList:n,data:H}=e;z.assertTransactionEIP1559(e);const d=v.serializeAccessList(n),f=[t.toHex(s),r?t.toHex(r):"0x",l?t.toHex(l):"0x",x?t.toHex(x):"0x",i?t.toHex(i):"0x",c??"0x",a?t.toHex(a):"0x",H??"0x",d,...T(e,o)];return L.concatHex(["0x02",b.toRlp(f)])}function j(e,o){const{chainId:s,gas:i,data:r,nonce:c,to:a,value:x,accessList:l,gasPrice:n}=e;z.assertTransactionEIP2930(e);const H=v.serializeAccessList(l),d=[t.toHex(s),c?t.toHex(c):"0x",n?t.toHex(n):"0x",i?t.toHex(i):"0x",a??"0x",x?t.toHex(x):"0x",r??"0x",H,...T(e,o)];return L.concatHex(["0x01",b.toRlp(d)])}function M(e,o){const{chainId:s=0,gas:i,data:r,nonce:c,to:a,value:x,gasPrice:l}=e;z.assertTransactionLegacy(e);let n=[c?t.toHex(c):"0x",l?t.toHex(l):"0x",i?t.toHex(i):"0x",a??"0x",x?t.toHex(x):"0x",r??"0x"];if(o){const H=(()=>{if(o.v>=35n)return(o.v-35n)/2n>0?o.v:27n+(o.v===35n?0n:1n);if(s>0)return BigInt(s*2)+BigInt(35n+o.v-27n);const u=27n+(o.v===27n?0n:1n);if(o.v!==u)throw new F.InvalidLegacyVError({v:o.v});return u})(),d=h.trim(o.r),f=h.trim(o.s);n=[...n,t.toHex(H),d==="0x00"?"0x":d,f==="0x00"?"0x":f]}else s>0&&(n=[...n,t.toHex(s),"0x","0x"]);return b.toRlp(n)}function T(e,o){const s=o??e,{v:i,yParity:r}=s;if(typeof s.r>"u")return[];if(typeof s.s>"u")return[];if(typeof i>"u"&&typeof r>"u")return[];const c=h.trim(s.r),a=h.trim(s.s);return[typeof r=="number"?r?t.toHex(1):"0x":i===0n?"0x":i===1n?t.toHex(1):i===27n?"0x":t.toHex(1),c==="0x00"?"0x":c,a==="0x00"?"0x":a]}exports.serializeTransaction=k;exports.toYParitySignatureArray=T;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const F=require("./index135.cjs"),G=require("./index229.cjs"),R=require("./index204.cjs"),S=require("./index208.cjs"),B=require("./index207.cjs"),V=require("./index209.cjs"),L=require("./index154.cjs"),h=require("./index162.cjs"),r=require("./index150.cjs"),d=require("./index194.cjs"),y=require("./index198.cjs"),C=require("./index186.cjs"),v=require("./index227.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;

package/dist/index228.js

@@ -6,8 +6,8 @@ import { commitmentsToVersionedHashes as C } from "./index207.js";
 import { toBlobSidecars as k } from "./index209.js";
 import { concatHex as h } from "./index154.js";
 import { trim as T } from "./index162.js";
-import { toHex as o, bytesToHex as w } from "./index150.js";
-import { toRlp as y } from "./index194.js";
+import { numberToHex as o, bytesToHex as w } from "./index150.js";
+import { toRlp as b } from "./index194.js";
 import { assertTransactionEIP1559 as S, assertTransactionEIP2930 as _, assertTransactionEIP4844 as R, assertTransactionEIP7702 as Y, assertTransactionLegacy as j } from "./index198.js";
 import { getTransactionType as q } from "./index186.js";
 import { serializeAccessList as v } from "./index227.js";
@@ -21,7 +21,7 @@ function D(e, r) {
   const d = v(p), m = g(i);
   return h([
     "0x04",
-    y([
+    b([
       o(s),
       c ? o(c) : "0x",
       t ? o(t) : "0x",
@@ -41,15 +41,15 @@ function J(e, r) {
   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, b = B({
+    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: b
+      commitments: y
     })), typeof m > "u") {
-      const P = V({ blobs: u, commitments: b, kzg: z });
-      m = k({ blobs: u, commitments: b, proofs: P });
+      const P = V({ blobs: u, commitments: y, kzg: z });
+      m = k({ blobs: u, commitments: y, proofs: P });
     }
   }
   const L = v(p), E = [
@@ -68,17 +68,17 @@ function J(e, r) {
   ], A = [], F = [], G = [];
   if (m)
     for (let u = 0; u < m.length; u++) {
-      const { blob: z, commitment: b, proof: P } = m[u];
-      A.push(z), F.push(b), G.push(P);
+      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":
-      y([E, A, F, G])
+      b([E, A, F, G])
     ) : (
       // If sidecars are disabled, standard envelope is used:
-      y(E)
+      b(E)
     )
   ]);
 }
@@ -99,7 +99,7 @@ function K(e, r) {
   ];
   return h([
     "0x02",
-    y(d)
+    b(d)
   ]);
 }
 function M(e, r) {
@@ -118,7 +118,7 @@ function M(e, r) {
   ];
   return h([
     "0x01",
-    y(l)
+    b(l)
   ]);
 }
 function N(e, r) {
@@ -155,7 +155,7 @@ function N(e, r) {
     "0x",
     "0x"
   ]);
-  return y(t);
+  return b(t);
 }
 function I(e, r) {
   const i = r ?? e, { v: s, yParity: n } = i;

package/dist/index231.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index149.cjs"),a=require("./index286.cjs"),c=require("./index148.cjs");function h(i){const r=i.replace(/^\.|\.$/gm,"");if(r.length===0)return new Uint8Array(1);const e=new Uint8Array(l.stringToBytes(r).byteLength+2);let t=0;const o=r.split(".");for(let s=0;s<o.length;s++){let n=l.stringToBytes(o[s]);n.byteLength>255&&(n=l.stringToBytes(a.encodeLabelhash(c.labelhash(o[s])))),e[t]=n.length,e.set(n,t+1),t+=n.length+1}return e.byteLength!==t+1?e.slice(0,t+1):e}exports.packetToBytes=h;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index149.cjs"),a=require("./index285.cjs"),c=require("./index148.cjs");function h(i){const r=i.replace(/^\.|\.$/gm,"");if(r.length===0)return new Uint8Array(1);const e=new Uint8Array(l.stringToBytes(r).byteLength+2);let t=0;const o=r.split(".");for(let s=0;s<o.length;s++){let n=l.stringToBytes(o[s]);n.byteLength>255&&(n=l.stringToBytes(a.encodeLabelhash(c.labelhash(o[s])))),e[t]=n.length,e.set(n,t+1),t+=n.length+1}return e.byteLength!==t+1?e.slice(0,t+1):e}exports.packetToBytes=h;