eth-compress 0.2.0 → 0.2.1

package/README.md

@@ -113,9 +113,11 @@ For eligible `eth_call`s it chooses between:
 Selection logic (subject to change, but current behaviour):
 
 - **Size gating**:
-  - `< 800 bytes`: no compression.
-  - `≥ 800 bytes`: compression considered.
-  - `≥ 1150 bytes`: JIT is preferred.
+  - `< 1150 bytes`: no compression.
+  - `≥ 1150 bytes`: compression considered.
+  - `3000 ≥ 1150 bytes or > 8000`: JIT is preferred.
+  - `8000 ≥ size ≥ 3000`: FastLZ or RLE.
+
 - **Algorithm choice**:
   - For mid-sized payloads, FLZ and CD are tried and the smaller output is chosen.
   - For larger payloads, JIT is used directly, focusing on gas-efficient decompression.
@@ -124,9 +126,7 @@ Selection logic (subject to change, but current behaviour):
 
 
 ### Implementation notes & compression flavours
-- **JIT calldata compiler (`compress_call` JIT mode)**: Views the calldata as a zero‑initialized memory image and synthesises bytecode that rebuilds it word-by-word in-place. In the first pass it walks the data in 32-byte slices, detects non-zero segments per word, and for each word chooses the cheapest of three strategies: store a literal tail, assemble segments using SHL/OR, or reuse an earlier word via MLOAD/MSTORE, under a rough opcode-count cost model. In the second pass it materialises this plan into concrete PUSH/MSTORE/SHL/OR/DUP opcodes, pre-seeds the stack with frequently used constants, and appends a small CALL/RETURNDATA stub that forwards the reconstructed calldata to the original `to` address. The execution is realized through a `stateDiff` passed together with the eth_call. The 4‑byte selector is right‑aligned in the first 32‑byte slot so that the rest of the calldata can be reconstructed on mostly word‑aligned boundaries, with the decompressor stateDiff being placed at `0x00000000000000000000000000000000000000e0` such that `0xe0` can be obtained from `ADDRESS` with a single opcode instead of an explicit literal. Achieves higher compression ratios compared to both FastLZ & Run-Length-Encoding (-15-25%), at a fraction of the gas footprint (<2%).
-
-_For the culture_, freedom of choice, and in-cases where larger dictionaries, or deeply nested / unaligned calldata prove to be more efficient, the alternatives are still included.
+- **JIT calldata compiler (`compress_call` JIT mode)**: Views the calldata as a zero‑initialized memory image and synthesises bytecode that rebuilds it word-by-word in-place. In the first pass it walks the data in 32-byte slices, detects non-zero segments per word, and for each word chooses the cheapest of three strategies: store a literal tail, assemble segments using SHL/OR, or reuse an earlier word via MLOAD/MSTORE, under a rough opcode-count cost model. In the second pass it materialises this plan into concrete PUSH/MSTORE/SHL/OR/DUP opcodes, pre-seeds the stack with frequently used constants, and appends a small CALL/RETURNDATA stub that forwards the reconstructed calldata to the original `to` address. The execution is realized through a `stateDiff` passed together with the eth_call. The 4‑byte selector is right‑aligned in the first 32‑byte slot so that the rest of the calldata can be reconstructed on mostly word‑aligned boundaries, with the decompressor stateDiff being placed at `0x00000000000000000000000000000000000000e0` such that `0xe0` can be obtained from `ADDRESS` with a single opcode instead of an explicit literal. Achieves higher compression ratios compared to both FastLZ & Run-Length-Encoding (-10-15%) for smaller calldata <3kb, and roughly on par above 8kb (except in cases with deeply nested calls and types, minimally worse), at a fraction of the gas footprint (<5%).
 
 - **FastLZ path (`LibZip.flzCompress` / `flzDecompress`)**: Implements a minimal LZ77-style compressor over raw bytes with a 3-byte rolling window. Each 24-bit chunk is hashed into a tiny table; repeated substrings within a bounded look-back distance are emitted as (length, distance) match tokens, and everything else is emitted as literal runs. Decompression is a simple loop over this stream that copies literals and then copies `length` bytes from `distance` bytes back in the already-produced output.
 

package/_cjs/index.cjs

@@ -1,3 +1,3 @@
-var K=Object.defineProperty;var me=Object.getOwnPropertyDescriptor;var pe=Object.getOwnPropertyNames;var de=Object.prototype.hasOwnProperty;var he=(t,n)=>()=>(t&&(n=t(t=0)),n);var v=(t,n)=>{for(var o in n)K(t,o,{get:n[o],enumerable:!0})},xe=(t,n,o,u)=>{if(n&&typeof n=="object"||typeof n=="function")for(let i of pe(n))!de.call(t,i)&&i!==o&&K(t,i,{get:()=>n[i],enumerable:!(u=me(n,i))||u.enumerable});return t};var ye=t=>xe(K({},"__esModule",{value:!0}),t);var ce={};v(ce,{compress_call:()=>_e,flzFwdBytecode:()=>re,jitBytecode:()=>Se,rleFwdBytecode:()=>oe});var J,we,w,Me,ee,re,oe,Se,ie,Re,te,ne,H,se,_e,fe=he(()=>{J=require("solady"),we=(1n<<160n)-1n,w=t=>t.replace(/^0x/,"").toLowerCase(),Me=t=>{let n=w(t),o=n.length,u=new Uint8Array(o/2);for(let i=0;i<o;i+=2)u[i/2]=Number.parseInt(n.slice(i,i+2),16);return u},ee=t=>{let n="";for(let o=0;o<t.length;o++)n+=t[o].toString(16).padStart(2,"0");return n};re=t=>`0x365f73${w(t)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;oe=t=>`0x5f5f5b368110602d575f8083813473${w(t)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;Se=function(t){return ie("0x"+w(t))},ie=function(t){let n=w(t),o=Me(n),u=28,i=new Uint8Array(u+o.length);i.set(o,u);let m=i.length,f=[],l=[],b=[],M=new Map,x=0,p=new Map,S=e=>{let s=b.lastIndexOf(e);return s===-1?-1:b.length-1-s},W=new Map,q=new Map,N=new Map,k=new Map,O=new Map,ae=e=>e+31&-32,Z=0,E=new Map,A=()=>[b.pop(),b.pop()],F=(1n<<256n)-1n,P=(e,s)=>e.set(s,(e.get(s)||0)+1),T=e=>{f.push(e),P(W,e)},D=e=>{l.push(e||null),P(q,e||null)},C=e=>{b.push(e),P(N,e),P(M,e),++Z,E.set(e,Z)},$=(e,s)=>{x=ae(e+s)},I=(e,s)=>{if(e===89)C(BigInt(x));else if(e===27){let[r,a]=A();C(a<<r&F)}else if(e===23){let[r,a]=A();C((r|a)&F)}else if(e>=96&&e<=127||e===95){let r=0n;for(let g of s||[])r=r<<8n|BigInt(g);let a=S(r);if(C(r),a!==-1&&e!=95){M.get(r)*2<N.get(r)&&(T(128+a),D(null));return}if(r==224n){T(48),D(null);return}}else if(e===81){let r=Number(b.pop());C(p.has(r)?p.get(r):0n)}else if(e===82){let[r,a]=A(),g=Number(r);p.set(g,a&F),$(g,32)}else if(e===83){let[r,a]=A();$(Number(r),1)}else e===243&&A();T(e),D(s||null)},z=e=>I(e),U=e=>{if(e>0&&e===x)return I(89);if(!e)return I(95,void 0);let s=BigInt(e),r=[];for(;s;)r.unshift(Number(s&0xffn)),s>>=8n;return I(95+r.length,r)},X=e=>I(95+e.length,Array.from(e)),be=(e,s)=>(e.match(new RegExp(s,"g"))||[]).length,ge=e=>{let s=0,r=!0;for(let{s:a,e:g}of e)s+=1+g-a+1,31-g>0&&(s+=3),r||(s+=1),r=!1;return s},B=[],R=e=>(B.push({t:"num",v:e}),U(e)),G=e=>(B.push({t:"bytes",b:e}),X(e)),_=e=>(B.push({t:"op",o:e}),z(e));for(let e=0;e<m;e+=32){let s=new Uint8Array(32);s.set(i.slice(e,Math.min(e+32,m)),0);let r=[];for(let c=0;c<32;){for(;c<32&&s[c]===0;)++c;if(c>=32)break;let h=c;for(;c<32&&s[c]!==0;)++c;r.push({s:h,e:c-1})}if(!r.length)continue;if(r.every(({s:c,e:h})=>c===h)){for(let{s:c}of r)R(s[c]),R(e+c),_(83);continue}let g=s.slice(r[0].s),j=1+g.length,Q=Math.ceil(Math.log2(e+1)/8),y=ee(s);if(j>8){if(k.has(y)){if(j>O.get(y)+Q){R(k.get(y)),_(81),R(e),_(82);continue}}else if(O.get(y)!=-1){let c=Q+3,h=be(n,y);O.set(y,h*32>h*c?c:-1),k.set(y,e)}}if(j<=ge(r))G(g);else{let c=!0;for(let{s:h,e:V}of r){let Y=31-V;G(s.slice(h,V+1)),Y>0&&(R(Y*8),_(27)),c||_(23),c=!1}}R(e),_(82)}f=[],l=[],b=[],x=0,p=new Map,Array.from(N.entries()).filter(([e,s])=>s>1&&e!==0n&&e!==224n).filter(([e,s])=>typeof e=="number"?e:Number(e)<=we).sort((e,s)=>E.get(s[0])-E.get(e[0])).slice(0,14).forEach(([e,s])=>{U(e)}),M=new Map;for(let e of B)e.t==="num"?U(e.v):e.t==="bytes"?X(e.b):e.t==="op"&&z(e.o);z(95),z(95),U(o.length),U(u);let L=[];for(let e=0;e<f.length;++e)L.push(f[e]),f[e]>=96&&f[e]<=127&&l[e]&&L.push(...l[e]);return"0x"+ee(new Uint8Array(L))+"345f355af1503d5f5f3e3d5ff3"},Re=800,te="0x00000000000000000000000000000000000000e0",ne="jit",H="flz",se="cd";_e=function(t,n){let o=t.params?.[0]?.method||t.method;if(o&&o!=="eth_call")return t;let u=w(t.data||"0x"),i=(t.data||"0x").length;if(i<Re)return t;let m=t.to||"",f="0x"+u,l=!n&&i<1150,b=n===H||l?J.LibZip.flzCompress(f):null,M=n===se||l?J.LibZip.cdCompress(f):null,x=n||(i>=1150?ne:b.length<M.length?H:se),p,S;if(x===ne)p=ie(f),S="0x"+w(m).padStart(64,"0");else{let q=x===H;S=q?b:M,p=q?re(m):oe(m)}return p.length+S.length>=i?t:{...t,to:te,data:S,stateDiff:{...t.stateDiff||{},[te]:{code:p}}}}});var Ie={};v(Ie,{compressModule:()=>le,compressModuleWithJIT:()=>Ce});module.exports=ye(Ie);var ue=new Map,Ae=["deflate-raw","deflate","gzip"],d=typeof CompressionStream>"u"?-1:null;async function le(t,n,o){let u=typeof t=="string"?t:t instanceof URL?t.toString():t.url,i=ue.get(u);if(d=d===-1||i===-1?-1:i?.[0]??null,o&&n?.body&&typeof n.body=="string"&&(d===-1||d===null))try{let f=JSON.parse(n.body),l=o(f);l!==void 0&&(n={...n,body:JSON.stringify(l)})}catch{}if(d&&d!==-1&&n?.body){let f=await new Response(new Blob([n.body]).stream().pipeThrough(new CompressionStream(d))).blob();n={...n,body:f,headers:{...n&&n.headers,"Content-Encoding":d}}}let m=await fetch(u,n);if(d===null){let f=m.headers.get("Accept-Encoding")?.split(",").filter(l=>Ae.includes(l));ue.set(u,f?.length?f:-1)}return m}var Ce=(t,n)=>Promise.resolve().then(()=>(fe(),ce)).then(({compress_call:o})=>le(t,n,o));0&&(module.exports={compressModule,compressModuleWithJIT});
+var W=Object.defineProperty;var ht=Object.getOwnPropertyDescriptor;var xt=Object.getOwnPropertyNames;var yt=Object.prototype.hasOwnProperty;var wt=(e,n)=>()=>(e&&(n=e(e=0)),n);var st=(e,n)=>{for(var o in n)W(e,o,{get:n[o],enumerable:!0})},Mt=(e,n,o,a)=>{if(n&&typeof n=="object"||typeof n=="function")for(let u of xt(n))!yt.call(e,u)&&u!==o&&W(e,u,{get:()=>n[u],enumerable:!(a=ht(n,u))||a.enumerable});return e};var St=e=>Mt(W({},"__esModule",{value:!0}),e);var ut={};st(ut,{compress_call:()=>Ct,flzFwdBytecode:()=>it,jitBytecode:()=>At,rleFwdBytecode:()=>ct});var X,Rt,_,_t,rt,it,ct,At,ft,It,Z,ot,$,V,Ct,lt=wt(()=>{X=require("solady"),Rt=(1n<<128n)-1n,_=e=>e.replace(/^0x/,"").toLowerCase(),_t=e=>{let n=_(e),o=n.length,a=new Uint8Array(o/2);for(let u=0;u<o;u+=2)a[u/2]=Number.parseInt(n.slice(u,u+2),16);return a},rt=e=>{let n="";for(let o=0;o<e.length;o++)n+=e[o].toString(16).padStart(2,"0");return n};it=e=>`0x365f73${_(e)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;ct=e=>`0x5f5f5b368110602d575f8083813473${_(e)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;At=function(e){return ft("0x"+_(e))},ft=function(e){let n=_(e),o=_t(n),a=28,u=new Uint8Array(a+o.length);u.set(o,a);let d=u.length,c=[],l=[],b=[],h=0,M=new Map,P=t=>{let s=b.lastIndexOf(t);return s===-1?-1:b.length-1-s},O=new Map,A=new Map,g=new Map,x=new Map,k=new Map,q=t=>t+31&-32,G=0,L=new Map,I=()=>[b.pop(),b.pop()],j=(1n<<256n)-1n,D=(t,s,r)=>t.set(s,(t.get(s)||0)+r),Q=(t,s)=>D(t,s,1),Y=(t,s)=>D(t,s,-1),z=t=>{c.push(t),Q(O,t)},N=t=>{l.push(t||null),Q(A,t||null)},y=(t,s=1)=>{b.push(t),D(g,t,s),++G,L.set(t,G)},v=(t,s)=>{h=q(t+s)},C=(t,s)=>{if(t===54)y(32n,0);else if(t===89)y(BigInt(h),0);else if(t===27){let[r,f]=I();c[c.length-1]==144&&(c.pop(),l.pop(),[r,f]=[f,r]),y(f<<BigInt(r)&j)}else if(t===23){let[r,f]=I();c[c.length-1]==144&&(c.pop(),l.pop()),y((r|f)&j)}else if(t>=96&&t<=127||t===95){let r=0n;for(let p of s||[])r=r<<8n|BigInt(p);if(r==224n){y(r),z(48),N(null);return}let f=P(r);if(f!==-1&&t!=95){let p=g.get(r)==0;if(f==0&&p){Y(g,r);return}if(f==1&&p){z(144);let[F,T]=I();b.push(T),b.push(F),N(null),Y(g,r);return}y(r,-1),z(128+f),N(null);return}y(r)}else if(t===81){let r=Number(b.pop());y(M.has(r)?M.get(r):0n)}else if(t===82){let[r,f]=I(),p=Number(r);M.set(p,f&j),v(p,32)}else if(t===83){let[r,f]=I();v(Number(r),1)}else t===243&&I();z(t),N(s||null)},pt=t=>b.includes(t)||t==224||t==32n,K=t=>C(t),S=t=>{if(t>0&&t===h)return C(89);if(t==32n)return C(54);if(!t)return C(95,void 0);let s=BigInt(t),r=[];for(;s;)r.unshift(Number(s&0xffn)),s>>=8n;return C(95+r.length,r)},tt=t=>C(95+t.length,Array.from(t)),gt=(t,s)=>(t.match(new RegExp(s,"g"))||[]).length,mt=t=>{let s=0,r=!0;for(let{s:f,e:p}of t)s+=1+p-f+1,31-p>0&&(s+=3),r||(s+=1),r=!1;return s},E=[],U=t=>(E.push({t:"num",v:t}),S(t)),H=t=>(E.push({t:"bytes",b:t}),tt(t)),B=t=>(E.push({t:"op",o:t}),K(t));S(1n);for(let t=0;t<d;t+=32){let s=new Uint8Array(32);s.set(u.slice(t,Math.min(t+32,d)),0);let r=[];for(let i=0;i<32;){for(;i<32&&s[i]===0;)++i;if(i>=32)break;let w=i;for(;i<32&&s[i]!==0;)++i;r.push({s:w,e:i-1})}if(!r.length)continue;let f=s.slice(r[0].s),p=1+f.length,F=0n;for(let i of f)F=F<<8n|BigInt(i);let T=Math.ceil(Math.log2(t+1)/8),R=rt(s);if(p>8){if(x.has(R)){if(p>k.get(R)+T){U(x.get(R)),B(81),U(t),B(82);continue}}else if(k.get(R)!=-1){let i=T+3,w=gt(n,R);k.set(R,w*32>w*i?i:-1),x.set(R,t)}}let dt=r.every(({s:i,e:w})=>i===w);if(pt(f))H(f);else if(dt){for(let{s:i}of r)U(s[i]),U(t+i),B(83);continue}else if(p<=mt(r))H(f);else{let i=!0;for(let{s:w,e:et}of r){let nt=31-et;H(s.slice(w,et+1)),nt>0&&(U(nt*8),B(27)),i||B(23),i=!1}}U(t),B(82)}c=[],l=[],b=[],h=0,M=new Map,Array.from(g.entries()).filter(([t,s])=>s>1&&t>1n&&t!==32n&&t!==224n).sort((t,s)=>L.get(s[0])-L.get(t[0])).filter(([t,s])=>typeof t=="number"?BigInt(t):t<=Rt).slice(0,13).forEach(([t,s])=>{S(t)}),S(1n);for(let t of E)t.t==="num"?S(t.v):t.t==="bytes"?tt(t.b):t.t==="op"&&K(t.o);K(95),K(95),S(o.length),S(a);let J=[];for(let t=0;t<c.length;++t)J.push(c[t]),c[t]>=96&&c[t]<=127&&l[t]&&J.push(...l[t]);return"0x"+rt(new Uint8Array(J))+"345f355af13d5f5f3e3d5ff3"},It=1150,Z="0x00000000000000000000000000000000000000e0",ot="jit",$="flz",V="cd";Ct=function(e,n){let o=e.params?.[0]?.method||e.method;if(o&&o!=="eth_call")return e;let a=e.params?.[0]||e,u=e.params?.[1]||"latest",d=e.params?.[2]||{},c=_(a.data||"0x"),l=(a.data||"0x").length;if(l<It||d[Z])return e;let b=a.to||"",h="0x"+c,M=!n&&l<1150,P=n===$||M?X.LibZip.flzCompress(h):null,O=n===V||M?X.LibZip.cdCompress(h):null,A=n;A||(A=l>=1150&&(l<3e3||l>=8e3)?ot:l>=3e3&&l<8e3&&P.length<O.length?$:V);let g,x;if(A===ot)g=ft(h),x="0x"+_(b).padStart(64,"0");else{let q=A===$;x=q?P:O,g=q?it(b):ct(b)}return g.length+x.length>=l?e:{...e,params:[{...a,to:Z,data:x},u,{...d,[Z]:{code:g}}]}}});var Pt={};st(Pt,{compressModule:()=>bt,compressModuleWithJIT:()=>Bt});module.exports=St(Pt);var at=new Map,Ut=["deflate-raw","deflate","gzip"],m=typeof CompressionStream>"u"?-1:null;async function bt(e,n,o){let a=typeof e=="string"?e:e instanceof URL?e.toString():e.url,u=at.get(a);if(m=m===-1||u===-1?-1:u?.[0]??null,o&&n?.body&&typeof n.body=="string"&&(m===-1||m===null))try{let c=JSON.parse(n.body),l=o(c);l!==void 0&&(n={...n,body:JSON.stringify(l)})}catch{}if(m&&m!==-1&&n?.body){let c=await new Response(new Blob([n.body]).stream().pipeThrough(new CompressionStream(m))).blob();n={...n,body:c,headers:{...n&&n.headers,"Content-Encoding":m}}}let d=await fetch(a,n);if(m===null){let c=d.headers.get("Accept-Encoding")?.split(",").filter(l=>Ut.includes(l));at.set(a,c?.length?c:-1)}return d}var Bt=(e,n)=>Promise.resolve().then(()=>(lt(),ut)).then(({compress_call:o})=>bt(e,n,o));0&&(module.exports={compressModule,compressModuleWithJIT});
 //! @__PURE__
 //# sourceMappingURL=index.cjs.map

package/_cjs/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/jit-compressor.ts", "../../src/index.ts"],
-  "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 160n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n  return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let stackFreq2 = new Map<bigint, number>();\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  const getStackIdx = (val: bigint): number => {\n    const idx = stack.lastIndexOf(val);\n    return idx === -1 ? -1 : stack.length - 1 - idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const MASK32 = (1n << 256n) - 1n;\n\n  const bump = <K>(m: Map<K, number>, k: K) => m.set(k, (m.get(k) || 0) + 1);\n  const pushOp = (op: number) => {\n    ops.push(op);\n    bump(opFreq, op);\n  };\n  const pushD = (d: number[] | null) => {\n    data.push(d || null);\n    bump(dataFreq, d || null);\n  };\n  const pushS = (v: bigint) => {\n    stack.push(v);\n    bump(stackFreq, v);\n    bump(stackFreq2, v);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x59) {\n      pushS(BigInt(trackedMemSize));\n    } else if (op === 0x1b) {\n      // SHL\n      const [shift, val] = pop2();\n      pushS((val << shift) & MASK32);\n    } else if (op === 0x17) {\n      // OR\n      const [a, b] = pop2();\n      pushS((a | b) & MASK32);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      const idx = getStackIdx(v);\n      pushS(v);\n      if (idx !== -1 && op != 0x5f) {\n        if (stackFreq2.get(v)! * 2 < stackFreq.get(v)!) {\n          pushOp(128 + idx);\n          pushD(null);\n        }\n        return;\n      }\n      if (v == 224n) {\n        // Special\u2011case the literal 0xe0 (224):\n        // the decompressor is always deployed at 0x...00e0, so the final\n        // byte of ADDRESS is exactly 0xe0. Since we must send our own\n        // address with the eth_call anyway, we can synthesize this value \n        // with a single opcode instead of encoding a literal, effectively\n        // giving us one more hot constant slot on the stack.\n        pushOp(0x30); // ADDRESS\n        pushD(null);\n        return;\n      }\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MASK32);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op);\n    pushD(imm || null);\n  };\n\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    if (byte8s) {\n      for (const { s } of seg) {\n        emitPushN(word[s]);\n        emitPushN(base + s);\n        emitOp(0x53); // MSTORE8\n      }\n      continue;\n    }\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    if (literalCost <= estShlCost(seg)) {\n      emitPushB(literal);\n    } else {\n      let first = true;\n      for (const { s, e } of seg) {\n        const suffix0s = 31 - e;\n        emitPushB(word.slice(s, e + 1));\n        if (suffix0s > 0) {\n          emitPushN(suffix0s * 8);\n          emitOp(0x1b); // SHL\n        }\n        if (!first) emitOp(0x17); // OR\n        first = false;\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val !== 0n && val !== 224n)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? val : Number(val) <= MAX_160_BIT;\n    })\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .slice(0, 14)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n\n  stackFreq2 = new Map();\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  // - 0x50: POP (discard success value)\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af1503d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 800;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const rpcMethod = payload.params?.[0]?.method || payload.method;\n  if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n  const hex = _normHex(payload.data || '0x');\n  const originalSize = (payload.data || '0x').length;\n  if (originalSize < MIN_SIZE_FOR_COMPRESSION) return payload;\n\n  const targetAddress = payload.to || '';\n  const data = '0x' + hex;\n\n  const autoSelect = !alg && originalSize < 1150;\n  const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n  const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n\n  const selectedMethod =\n    alg || (originalSize >= 1150 ? _jit : flz!.length < cd!.length ? _flz : _cd);\n\n  let bytecode: string;\n  let calldata: string;\n\n  if (selectedMethod === _jit) {\n    bytecode = _jitDecompressor(data);\n    calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n  } else {\n    const isFlz = selectedMethod === _flz;\n    calldata = isFlz ? flz! : cd!;\n    bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n  }\n\n  const compressedSize = bytecode.length + calldata.length;\n  if (compressedSize >= originalSize) return payload;\n\n  return {\n    ...payload,\n    to: DECOMPRESSOR_ADDRESS,\n    data: calldata,\n    stateDiff: {\n      ...(payload.stateDiff || {}),\n      [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n    },\n  };\n};\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  if (supported && supported !== -1 && init?.body) {\n    const compressed = await new Response(\n      new Blob([init.body as string])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
-  "mappings": "ycAAA,IAAAA,GAAA,GAAAC,EAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,IAAAC,EAEMC,GAEAC,EAEAC,GAUAC,GAeOP,GAUAE,GASAD,GAIPO,GA6RAC,GACAC,GAEAC,GACAC,EACAC,GAWOd,GAnWbe,GAAAC,GAAA,KAAAZ,EAAuB,kBAEjBC,IAAe,IAAM,MAAQ,GAE7BC,EAAYW,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEV,GAAoBU,GAA4B,CACpD,IAAMC,EAAaZ,EAASW,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAAS,EAAI,EAAG,EAAIA,EAAK,GAAK,EAC5BC,EAAM,EAAI,CAAC,EAAI,OAAO,SAASF,EAAW,MAAM,EAAG,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOE,CACT,EAEMZ,GAAoBY,GAA8B,CACtD,IAAIH,EAAM,GACV,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EASahB,GAAkBqB,GAC7B,WAAWhB,EAASgB,CAAO,CAAC,iYASjBnB,GAAkBmB,GAC7B,mCAAmChB,EAASgB,CAAO,CAAC,qLAQzCpB,GAAc,SAAUqB,EAA0B,CAC7D,OAAOd,GAAiB,KAAOH,EAASiB,CAAQ,CAAC,CACnD,EAEMd,GAAmB,SAAUc,EAA0B,CAC3D,IAAMN,EAAMX,EAASiB,CAAQ,EACvBC,EAAcjB,GAAiBU,CAAG,EAOlCQ,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAa,IAAI,IACjBC,EAAiB,EACjBC,EAAM,IAAI,IACRC,EAAeC,GAAwB,CAC3C,IAAMC,EAAMN,EAAM,YAAYK,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAExCC,EAAc,EACZC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAU,IAAM,MAAQ,GAExBC,EAAO,CAAIC,EAAmBC,IAASD,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAK,CAAC,EACnEC,EAAUC,GAAe,CAC7BxB,EAAI,KAAKwB,CAAE,EACXJ,EAAKX,EAAQe,CAAE,CACjB,EACMC,EAASC,GAAuB,CACpCzB,EAAK,KAAKyB,GAAK,IAAI,EACnBN,EAAKV,EAAUgB,GAAK,IAAI,CAC1B,EACMC,EAASC,GAAc,CAC3B1B,EAAM,KAAK0B,CAAC,EACZR,EAAKT,EAAWiB,CAAC,EACjBR,EAAKjB,EAAYyB,CAAC,EAClB,EAAEZ,EACFC,EAAS,IAAIW,EAAGZ,CAAW,CAC7B,EAEMa,EAAW,CAACC,EAAgBC,IAAiB,CACjD3B,EAAiBU,GAAUgB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACR,EAAYS,IAAmB,CAC5C,GAAIT,IAAO,GACTG,EAAM,OAAOvB,CAAc,CAAC,UACnBoB,IAAO,GAAM,CAEtB,GAAM,CAACU,EAAO3B,CAAG,EAAIW,EAAK,EAC1BS,EAAOpB,GAAO2B,EAASf,CAAM,CAC/B,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACW,EAAGC,CAAC,EAAIlB,EAAK,EACpBS,GAAOQ,EAAIC,GAAKjB,CAAM,CACxB,SAAYK,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAWQ,KAAKH,GAAO,CAAC,EAAGL,EAAKA,GAAK,GAAM,OAAOQ,CAAC,EACnD,IAAM5B,EAAMF,EAAYsB,CAAC,EAEzB,GADAD,EAAMC,CAAC,EACHpB,IAAQ,IAAMgB,GAAM,GAAM,CACxBrB,EAAW,IAAIyB,CAAC,EAAK,EAAIjB,EAAU,IAAIiB,CAAC,IAC1CL,EAAO,IAAMf,CAAG,EAChBiB,EAAM,IAAI,GAEZ,MACF,CACA,GAAIG,GAAK,KAAM,CAObL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACF,SAAWD,IAAO,GAAM,CAEtB,IAAMF,EAAI,OAAOpB,EAAM,IAAI,CAAE,EAC7ByB,EAAMtB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWE,IAAO,GAAM,CAEtB,GAAM,CAACM,EAAQO,CAAK,EAAInB,EAAK,EACvBI,EAAI,OAAOQ,CAAM,EACvBzB,EAAI,IAAIiB,EAAGe,EAAQlB,CAAM,EACzBU,EAASP,EAAG,EAAE,CAChB,SAAWE,IAAO,GAAM,CAEtB,GAAM,CAACM,EAAQQ,CAAC,EAAIpB,EAAK,EACzBW,EAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWN,IAAO,KAEhBN,EAAK,EAEPK,EAAOC,CAAE,EACTC,EAAMQ,GAAO,IAAI,CACnB,EAEMT,EAAMe,GAAmBP,EAAMO,CAAM,EACrCC,EAASH,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUjC,EAAgB,OAAO4B,EAAM,EAAI,EAC5D,GAAI,CAACK,EAAO,OAAOL,EAAM,GAAM,MAAS,EACxC,IAAIJ,EAAI,OAAOS,CAAK,EAChB7C,EAAkB,CAAC,EACvB,KAAOoC,GACLpC,EAAM,QAAQ,OAAOoC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOI,EAAM,GAAOxC,EAAM,OAAQA,CAAK,CACzC,EACMiD,EAAS3C,GAAoBkC,EAAM,GAAOlC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrE4C,GAAW,CAACrD,EAAasD,KAC5BtD,EAAI,MAAM,IAAI,OAAOsD,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAavB,IAAwBsB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAtB,CAAE,CAAC,EAAGY,EAAMZ,CAAC,GACxEwB,EAAahB,IAAmBc,EAAK,KAAK,CAAE,EAAG,QAAS,EAAAd,CAAE,CAAC,EAAGK,EAAML,CAAC,GACrEiB,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG9B,EAAG8B,CAAC,GAG9D,QAASC,EAAO,EAAGA,EAAOxD,EAAGwD,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAI1D,EAAI,MAAMyD,EAAM,KAAK,IAAIA,EAAO,GAAIxD,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAM8C,EAAuC,CAAC,EAC9C,QAASpD,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAM+D,EAAK/D,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAMuD,EAAIvD,EACV,KAAOA,EAAI,IAAM+D,EAAK/D,CAAC,IAAM,GAAG,EAAEA,EAClCoD,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAGvD,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACoD,EAAI,OAAQ,SAGjB,GADeA,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAClC,CACV,OAAW,CAAE,EAAAD,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,CAGA,IAAMI,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAE1BE,EAAY,KAAK,KAAK,KAAK,KAAKJ,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAU/D,GAAiB4E,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAI9C,EAAU,IAAI+B,CAAO,GACvB,GAAIe,EAAc7C,EAAc,IAAI8B,CAAO,EAAKgB,EAAW,CACzDR,EAAUvC,EAAU,IAAI+B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACSxC,EAAc,IAAI8B,CAAO,GAAK,GAAI,CAC3C,IAAMiB,EAAYD,EAAY,EACxBE,EAAOnB,GAASrD,EAAKsD,CAAO,EAClC9B,EAAc,IAAI8B,EAASkB,EAAO,GAAKA,EAAOD,EAAYA,EAAY,EAAE,EACxEhD,EAAU,IAAI+B,EAASY,CAAI,CAC7B,EAGF,GAAIG,GAAed,GAAWC,CAAG,EAC/BO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,IAAMiB,EAAW,GAAKb,EACtBG,EAAUI,EAAK,MAAMR,EAAGC,EAAI,CAAC,CAAC,EAC1Ba,EAAW,IACbX,EAAUW,EAAW,CAAC,EACtBT,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEArD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTE,EAAiB,EACjBC,EAAM,IAAI,IAGV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKsD,CAAI,IAAMA,EAAO,GAAKtD,IAAQ,IAAMA,IAAQ,IAAI,EAC9D,OAAO,CAAC,CAACA,EAAK+B,CAAC,IACP,OAAO/B,GAAQ,SAAWA,EAAM,OAAOA,CAAG,GAAK9B,EACvD,EACA,KAAK,CAAC0D,EAAGC,IAAMnB,EAAS,IAAImB,EAAE,CAAC,CAAC,EAAKnB,EAAS,IAAIkB,EAAE,CAAC,CAAC,CAAE,EACxD,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC5B,EAAK+B,CAAC,IAAM,CACrBE,EAAMjC,CAAG,CACX,CAAC,EAEHJ,EAAa,IAAI,IAEjB,QAAW4D,KAAQb,EACba,EAAK,IAAM,MAAOvB,EAAMuB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAStB,EAAMsB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAMvC,EAAGuC,EAAK,CAAC,EAqBrCvC,EAAG,EAAI,EACPA,EAAG,EAAI,EACPgB,EAAM5C,EAAY,MAAM,EACxB4C,EAAM3C,CAAO,EAEb,IAAMmE,EAAgB,CAAC,EACvB,QAASvE,EAAI,EAAGA,EAAIO,EAAI,OAAQ,EAAEP,EAChCuE,EAAI,KAAKhE,EAAIP,CAAC,CAAC,EACXO,EAAIP,CAAC,GAAK,IAAQO,EAAIP,CAAC,GAAK,KAAQQ,EAAKR,CAAC,GAAGuE,EAAI,KAAK,GAAG/D,EAAKR,CAAC,CAAE,EAMvE,MAAO,KAAOb,GAAiB,IAAI,WAAWoF,CAAG,CAAC,EAAI,4BACxD,EAEMlF,GAA2B,IAC3BC,GAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,GAAM,KAWCd,GAAgB,SAAU6F,EAAcC,EAAmB,CACtE,IAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAElD,IAAM5E,EAAMX,EAASuF,EAAQ,MAAQ,IAAI,EACnCG,GAAgBH,EAAQ,MAAQ,MAAM,OAC5C,GAAIG,EAAetF,GAA0B,OAAOmF,EAEpD,IAAMI,EAAgBJ,EAAQ,IAAM,GAC9BhE,EAAO,KAAOZ,EAEdiF,EAAa,CAACJ,GAAOE,EAAe,KACpCG,EAAML,IAAQjF,GAAQqF,EAAa,SAAO,YAAYrE,CAAI,EAAI,KAC9DuE,EAAKN,IAAQhF,IAAOoF,EAAa,SAAO,WAAWrE,CAAI,EAAI,KAE3DwE,EACJP,IAAQE,GAAgB,KAAOpF,GAAOuF,EAAK,OAASC,EAAI,OAASvF,EAAOC,IAEtEwF,EACA/E,EAEJ,GAAI8E,IAAmBzF,GACrB0F,EAAW7F,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAAS2F,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmBxF,EACjCU,EAAWgF,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQtG,GAAegG,CAAa,EAAI9F,GAAe8F,CAAa,CACjF,CAGA,OADuBK,EAAS,OAAS/E,EAAS,QAC5ByE,EAAqBH,EAEpC,CACL,GAAGA,EACH,GAAIlF,GACJ,KAAMY,EACN,UAAW,CACT,GAAIsE,EAAQ,WAAa,CAAC,EAC1B,CAAClF,EAAoB,EAAG,CAAE,KAAM2F,CAAS,CAC3C,CACF,CACF,IC7YA,IAAAE,GAAA,GAAAC,EAAAD,GAAA,oBAAAE,GAAA,0BAAAC,KAAA,eAAAC,GAAAJ,IAAA,IAAMK,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBL,GACpBM,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASP,GAAS,IAAIM,CAAG,EAK/B,GAJAJ,EAAYA,IAAc,IAAUK,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDF,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMM,EAAS,KAAK,MAAMJ,EAAK,IAAc,EACvCK,EAAOJ,EAAiBG,CAAM,EAChCC,IAAS,SACXL,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUK,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIP,GAAaA,IAAc,IAAME,GAAM,KAAM,CAC/C,IAAMM,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACN,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBF,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPE,EAAO,CACL,GAAGA,EACH,KAAMM,EACN,QAAS,CAAE,GAAIN,GAAQA,EAAK,QAAU,mBAAoBF,CAAU,CACtE,CACF,CACA,IAAMS,EAAW,MAAM,MAAML,EAAKF,CAAI,EAEtC,GAAIF,IAAc,KAAM,CACtB,IAAMU,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMZ,GAAK,SAASY,CAAC,CAAC,EACjCb,GAAS,IAAIM,EAAKM,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMb,GAAwB,CACnCK,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAU,CAAc,IACtDjB,GAAeM,EAAOC,EAAMU,CAAa,CAC3C",
-  "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "import_solady", "MAX_160_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "_jitDecompressor", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "stackFreq2", "trackedMemSize", "mem", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "MASK32", "bump", "m", "k", "pushOp", "op", "pushD", "d", "pushS", "v", "trackMem", "offset", "size", "addOp", "imm", "shift", "a", "b", "value", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "base", "word", "literal", "literalCost", "baseBytes", "reuseCost", "freq", "suffix0s", "step", "out", "payload", "alg", "rpcMethod", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "index_exports", "__export", "compressModule", "compressModuleWithJIT", "__toCommonJS", "_sup_enc", "_enc", "supported", "input", "init", "transformPayload", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compress_call"]
+  "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 128n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n  return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  const getStackIdx = (val: bigint): number => {\n    const idx = stack.lastIndexOf(val);\n    return idx === -1 ? -1 : stack.length - 1 - idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const MASK32 = (1n << 256n) - 1n;\n\n  const ctr = <K>(m: Map<K, number>, k: K, delta: number) => m.set(k, (m.get(k) || 0) + delta);\n  const inc = <K>(m: Map<K, number>, k: K) => ctr(m, k, 1);\n  const dec = <K>(m: Map<K, number>, k: K) => ctr(m, k, -1);\n  const pushOp = (op: number) => {\n    ops.push(op);\n    inc(opFreq, op);\n  };\n  const pushD = (d: number[] | null) => {\n    data.push(d || null);\n    inc(dataFreq, d || null);\n  };\n  const pushS = (v: bigint, freq: number = 1) => {\n    stack.push(v);\n    ctr(stackFreq, v, freq);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x36) {\n      pushS(32n, 0);\n    } else if (op === 0x59) {\n      pushS(BigInt(trackedMemSize), 0);\n    } else if (op === 0x1b) {\n      let [shift, val] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n        [shift, val] = [val, shift];\n      }\n      pushS((val << BigInt(shift)) & MASK32);\n    } else if (op === 0x17) {\n      // OR\n      const [a, b] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n      }\n      pushS((a | b) & MASK32);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      if (v == 224n) {\n        // Special\u2011case the literal 0xe0 (224):\n        // the decompressor is always deployed at 0x...00e0, so the final\n        // byte of ADDRESS is exactly 0xe0. Since we must send our own\n        // address with the eth_call anyway, we can synthesize this value\n        // with a single opcode instead of encoding a literal, effectively\n        // giving us one more hot constant slot on the stack.\n        pushS(v);\n        pushOp(0x30); // ADDRESS\n        pushD(null);\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        const last = stackFreq.get(v) == 0;\n        if (idx == 0 && last) {\n          dec(stackFreq, v);\n          return;\n        }\n        if (idx == 1 && last) {\n          pushOp(144);\n          const [a, b] = pop2();\n          stack.push(b);\n          stack.push(a);\n          pushD(null);\n          dec(stackFreq, v);\n          return;\n        }\n        pushS(v, -1);\n        pushOp(128 + idx);\n        pushD(null);\n        return;\n      }\n      pushS(v);\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MASK32);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op);\n    pushD(imm || null);\n  };\n  const isInStack = (w) => stack.includes(w) || w == 0xe0 || w == 32n;\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (value == 32n) return addOp(0x36);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n  pushN(1n);\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n    let literalVal = 0n;\n    for (const b of literal) literalVal = (literalVal << 8n) | BigInt(b);\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    // Convert literal bytes to bigint for stack comparison\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    if (isInStack(literal)) {\n      emitPushB(literal);\n    } else if (byte8s) {\n      for (const { s } of seg) {\n        emitPushN(word[s]);\n        emitPushN(base + s);\n        emitOp(0x53); // MSTORE8\n      }\n      continue;\n    } else if (literalCost <= estShlCost(seg)) {\n      emitPushB(literal);\n    } else {\n      let first = true;\n      for (const { s, e } of seg) {\n        const suffix0s = 31 - e;\n        emitPushB(word.slice(s, e + 1));\n        if (suffix0s > 0) {\n          emitPushN(suffix0s * 8);\n          emitOp(0x1b); // SHL\n        }\n        if (!first) emitOp(0x17); // OR\n        first = false;\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val > 1n && val !== 32n && val !== 224n)\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? BigInt(val) : val <= MAX_160_BIT;\n    })\n    .slice(0, 13)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n  pushN(1n);\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af13d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 1150;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const rpcMethod = payload.params?.[0]?.method || payload.method;\n  if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n  // Extract data and target address from params[0] if available, otherwise top-level\n  const txObj = payload.params?.[0] || payload;\n  const blockParam = payload.params?.[1] || 'latest';\n  const existingStateOverride = payload.params?.[2] || {};\n\n  // If there are any existing state overrides for the decompressor address, do not compress\n  const hex = _normHex(txObj.data || '0x');\n  const originalSize = (txObj.data || '0x').length;\n  if (originalSize < MIN_SIZE_FOR_COMPRESSION || (existingStateOverride[DECOMPRESSOR_ADDRESS])) return payload;\n\n  const targetAddress = txObj.to || '';\n  const data = '0x' + hex;\n\n  const autoSelect = !alg && originalSize < 1150;\n  const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n  const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n  let selectedMethod = alg;\n  if (!selectedMethod) {\n    selectedMethod =\n      originalSize >= 1150 && (originalSize < 3000 || originalSize >= 8000)\n        ? _jit\n        : originalSize >= 3000 && originalSize < 8000\n          ? flz!.length < cd!.length\n            ? _flz\n            : _cd\n          : _cd;\n  }\n\n  let bytecode: string;\n  let calldata: string;\n\n  if (selectedMethod === _jit) {\n    bytecode = _jitDecompressor(data);\n    calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n  } else {\n    const isFlz = selectedMethod === _flz;\n    calldata = isFlz ? flz! : cd!;\n    bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n  }\n\n  const compressedSize = bytecode.length + calldata.length;\n  if (compressedSize >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      {\n        ...txObj,\n        to: DECOMPRESSOR_ADDRESS,\n        data: calldata,\n      },\n      blockParam,\n      {\n        ...existingStateOverride,\n        [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n      },\n    ],\n  };\n};\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  if (supported && supported !== -1 && init?.body) {\n    const compressed = await new Response(\n      new Blob([init.body as string])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
+  "mappings": "0cAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,IAAAC,EAEMC,GAEAC,EAEAC,GAUAC,GAeOP,GAUAE,GASAD,GAIPO,GAsTAC,GACAC,EAEAC,GACAC,EACAC,EAWOd,GA5Xbe,GAAAC,GAAA,KAAAZ,EAAuB,kBAEjBC,IAAe,IAAM,MAAQ,GAE7BC,EAAYW,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEV,GAAoBU,GAA4B,CACpD,IAAMC,EAAaZ,EAASW,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAASE,EAAI,EAAGA,EAAIF,EAAKE,GAAK,EAC5BD,EAAMC,EAAI,CAAC,EAAI,OAAO,SAASH,EAAW,MAAMG,EAAGA,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOD,CACT,EAEMZ,GAAoBY,GAA8B,CACtD,IAAIH,EAAM,GACV,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EASahB,GAAkBqB,GAC7B,WAAWhB,EAASgB,CAAO,CAAC,iYASjBnB,GAAkBmB,GAC7B,mCAAmChB,EAASgB,CAAO,CAAC,qLAQzCpB,GAAc,SAAUqB,EAA0B,CAC7D,OAAOd,GAAiB,KAAOH,EAASiB,CAAQ,CAAC,CACnD,EAEMd,GAAmB,SAAUc,EAA0B,CAC3D,IAAMN,EAAMX,EAASiB,CAAQ,EACvBC,EAAcjB,GAAiBU,CAAG,EAOlCQ,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAiB,EACjBC,EAAM,IAAI,IACRC,EAAeC,GAAwB,CAC3C,IAAMC,EAAML,EAAM,YAAYI,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKL,EAAM,OAAS,EAAIK,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,EAAaC,GAAeA,EAAI,GAAM,IAExCC,EAAc,EACZC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAACf,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DgB,GAAU,IAAM,MAAQ,GAExBC,EAAM,CAAIC,EAAmBC,EAAMC,IAAkBF,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAKC,CAAK,EACrFC,EAAM,CAAIH,EAAmBC,IAASF,EAAIC,EAAGC,EAAG,CAAC,EACjDG,EAAM,CAAIJ,EAAmBC,IAASF,EAAIC,EAAGC,EAAG,EAAE,EAClDI,EAAUC,GAAe,CAC7B1B,EAAI,KAAK0B,CAAE,EACXH,EAAIf,EAAQkB,CAAE,CAChB,EACMC,EAASC,GAAuB,CACpC3B,EAAK,KAAK2B,GAAK,IAAI,EACnBL,EAAId,EAAUmB,GAAK,IAAI,CACzB,EACMC,EAAQ,CAACC,EAAWC,EAAe,IAAM,CAC7C7B,EAAM,KAAK4B,CAAC,EACZX,EAAIT,EAAWoB,EAAGC,CAAI,EACtB,EAAEhB,EACFC,EAAS,IAAIc,EAAGf,CAAW,CAC7B,EAEMiB,EAAW,CAACC,EAAgBC,IAAiB,CACjD/B,EAAiBU,EAAUoB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACT,EAAYU,IAAmB,CAC5C,GAAIV,IAAO,GACTG,EAAM,IAAK,CAAC,UACHH,IAAO,GAChBG,EAAM,OAAO1B,CAAc,EAAG,CAAC,UACtBuB,IAAO,GAAM,CACtB,GAAI,CAACW,EAAO/B,CAAG,EAAIW,EAAK,EACpBjB,EAAIA,EAAI,OAAS,CAAC,GAAK,MACzBA,EAAI,IAAI,EACRC,EAAK,IAAI,EACT,CAACoC,EAAO/B,CAAG,EAAI,CAACA,EAAK+B,CAAK,GAE5BR,EAAOvB,GAAO,OAAO+B,CAAK,EAAKnB,CAAM,CACvC,SAAWQ,IAAO,GAAM,CAEtB,GAAM,CAACY,EAAGC,CAAC,EAAItB,EAAK,EAChBjB,EAAIA,EAAI,OAAS,CAAC,GAAK,MACzBA,EAAI,IAAI,EACRC,EAAK,IAAI,GAEX4B,GAAOS,EAAIC,GAAKrB,CAAM,CACxB,SAAYQ,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAWS,KAAKH,GAAO,CAAC,EAAGN,EAAKA,GAAK,GAAM,OAAOS,CAAC,EACnD,GAAIT,GAAK,KAAM,CAObD,EAAMC,CAAC,EACPL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACA,IAAMpB,EAAMF,EAAYyB,CAAC,EACzB,GAAIvB,IAAQ,IAAMmB,GAAM,GAAM,CAC5B,IAAMc,EAAO9B,EAAU,IAAIoB,CAAC,GAAK,EACjC,GAAIvB,GAAO,GAAKiC,EAAM,CACpBhB,EAAId,EAAWoB,CAAC,EAChB,MACF,CACA,GAAIvB,GAAO,GAAKiC,EAAM,CACpBf,EAAO,GAAG,EACV,GAAM,CAACa,EAAGC,CAAC,EAAItB,EAAK,EACpBf,EAAM,KAAKqC,CAAC,EACZrC,EAAM,KAAKoC,CAAC,EACZX,EAAM,IAAI,EACVH,EAAId,EAAWoB,CAAC,EAChB,MACF,CACAD,EAAMC,EAAG,EAAE,EACXL,EAAO,IAAMlB,CAAG,EAChBoB,EAAM,IAAI,EACV,MACF,CACAE,EAAMC,CAAC,CACT,SAAWJ,IAAO,GAAM,CAEtB,IAAML,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B2B,EAAMzB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQQ,CAAK,EAAIxB,EAAK,EACvBI,EAAI,OAAOY,CAAM,EACvB7B,EAAI,IAAIiB,EAAGoB,EAAQvB,CAAM,EACzBc,EAASX,EAAG,EAAE,CAChB,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQS,CAAC,EAAIzB,EAAK,EACzBe,EAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWP,IAAO,KAEhBT,EAAK,EAEPQ,EAAOC,CAAE,EACTC,EAAMS,GAAO,IAAI,CACnB,EACMO,GAAaC,GAAM1C,EAAM,SAAS0C,CAAC,GAAKA,GAAK,KAAQA,GAAK,IAC1DlB,EAAMmB,GAAmBV,EAAMU,CAAM,EACrCC,EAASL,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUtC,EAAgB,OAAOgC,EAAM,EAAI,EAC5D,GAAIM,GAAS,IAAK,OAAON,EAAM,EAAI,EACnC,GAAI,CAACM,EAAO,OAAON,EAAM,GAAM,MAAS,EACxC,IAAIL,EAAI,OAAOW,CAAK,EAChBjD,EAAkB,CAAC,EACvB,KAAOsC,GACLtC,EAAM,QAAQ,OAAOsC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAO3C,EAAM,OAAQA,CAAK,CACzC,EACMuD,GAASjD,GAAoBqC,EAAM,GAAOrC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrEkD,GAAW,CAAC3D,EAAa4D,KAC5B5D,EAAI,MAAM,IAAI,OAAO4D,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAa3B,IAAwB0B,EAAK,KAAK,CAAE,EAAG,MAAO,EAAA1B,CAAE,CAAC,EAAGgB,EAAMhB,CAAC,GACxE4B,EAAanB,IAAmBiB,EAAK,KAAK,CAAE,EAAG,QAAS,EAAAjB,CAAE,CAAC,EAAGQ,GAAMR,CAAC,GACrEoB,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAGlC,EAAGkC,CAAC,GAC9Dd,EAAM,EAAE,EAER,QAASe,EAAO,EAAGA,EAAO9D,EAAG8D,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAIhE,EAAI,MAAM+D,EAAM,KAAK,IAAIA,EAAO,GAAI9D,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAMoD,EAAuC,CAAC,EAC9C,QAAS,EAAI,EAAG,EAAI,IAAM,CACxB,KAAO,EAAI,IAAMW,EAAK,CAAC,IAAM,GAAG,EAAE,EAClC,GAAI,GAAK,GAAI,MACb,IAAMR,EAAI,EACV,KAAO,EAAI,IAAMQ,EAAK,CAAC,IAAM,GAAG,EAAE,EAClCX,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACH,EAAI,OAAQ,SAGjB,IAAMY,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAC5BE,EAAa,GACjB,QAAW1B,KAAKwB,EAASE,EAAcA,GAAc,GAAM,OAAO1B,CAAC,EACnE,IAAM2B,EAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAUrE,GAAiBkF,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAIrD,EAAU,IAAIsC,CAAO,GACvB,GAAIe,EAAcpD,EAAc,IAAIqC,CAAO,EAAKiB,EAAW,CACzDT,EAAU9C,EAAU,IAAIsC,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACS/C,EAAc,IAAIqC,CAAO,GAAK,GAAI,CAC3C,IAAMkB,EAAYD,EAAY,EACxBnC,EAAOiB,GAAS3D,EAAK4D,CAAO,EAClCrC,EAAc,IAAIqC,EAASlB,EAAO,GAAKA,EAAOoC,EAAYA,EAAY,EAAE,EACxExD,EAAU,IAAIsC,EAASY,CAAI,CAC7B,EAKF,IAAMO,GAASjB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAC9C,GAAIZ,GAAUoB,CAAO,EACnBL,EAAUK,CAAO,UACRK,GAAQ,CACjB,OAAW,CAAE,EAAAd,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,SAAWK,GAAed,GAAWC,CAAG,EACtCO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,EAAE,IAAKJ,EAAK,CAC1B,IAAMkB,GAAW,GAAKd,GACtBG,EAAUI,EAAK,MAAMR,EAAGC,GAAI,CAAC,CAAC,EAC1Bc,GAAW,IACbZ,EAAUY,GAAW,CAAC,EACtBV,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEA3D,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTC,EAAiB,EACjBC,EAAM,IAAI,IAEV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKyB,CAAI,IAAMA,EAAO,GAAKzB,EAAM,IAAMA,IAAQ,KAAOA,IAAQ,IAAI,EAC3E,KAAK,CAACgC,EAAGC,IAAMvB,EAAS,IAAIuB,EAAE,CAAC,CAAC,EAAKvB,EAAS,IAAIsB,EAAE,CAAC,CAAC,CAAE,EACxD,OAAO,CAAC,CAAChC,EAAKoC,CAAC,IACP,OAAOpC,GAAQ,SAAW,OAAOA,CAAG,EAAIA,GAAO7B,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC6B,EAAKoC,CAAC,IAAM,CACrBI,EAAMxC,CAAG,CACX,CAAC,EACHwC,EAAM,EAAE,EAER,QAAWwB,KAAQd,EACbc,EAAK,IAAM,MAAOxB,EAAMwB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAASvB,GAAMuB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAM5C,EAAG4C,EAAK,CAAC,EAoBrC5C,EAAG,EAAI,EACPA,EAAG,EAAI,EACPoB,EAAMlD,EAAY,MAAM,EACxBkD,EAAMjD,CAAO,EAEb,IAAM0E,EAAgB,CAAC,EACvB,QAAS9E,EAAI,EAAGA,EAAIO,EAAI,OAAQ,EAAEP,EAChC8E,EAAI,KAAKvE,EAAIP,CAAC,CAAC,EACXO,EAAIP,CAAC,GAAK,IAAQO,EAAIP,CAAC,GAAK,KAAQQ,EAAKR,CAAC,GAAG8E,EAAI,KAAK,GAAGtE,EAAKR,CAAC,CAAE,EAMvE,MAAO,KAAOb,GAAiB,IAAI,WAAW2F,CAAG,CAAC,EAAI,0BACxD,EAEMzF,GAA2B,KAC3BC,EAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,EAAM,KAWCd,GAAgB,SAAUoG,EAAcC,EAAmB,CACtE,IAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAGlD,IAAMG,EAAQH,EAAQ,SAAS,CAAC,GAAKA,EAC/BI,EAAaJ,EAAQ,SAAS,CAAC,GAAK,SACpCK,EAAwBL,EAAQ,SAAS,CAAC,GAAK,CAAC,EAGhDnF,EAAMX,EAASiG,EAAM,MAAQ,IAAI,EACjCG,GAAgBH,EAAM,MAAQ,MAAM,OAC1C,GAAIG,EAAehG,IAA6B+F,EAAsB9F,CAAoB,EAAI,OAAOyF,EAErG,IAAMO,EAAgBJ,EAAM,IAAM,GAC5B1E,EAAO,KAAOZ,EAEd2F,EAAa,CAACP,GAAOK,EAAe,KACpCG,EAAMR,IAAQxF,GAAQ+F,EAAa,SAAO,YAAY/E,CAAI,EAAI,KAC9DiF,EAAKT,IAAQvF,GAAO8F,EAAa,SAAO,WAAW/E,CAAI,EAAI,KAC7DkF,EAAiBV,EAChBU,IACHA,EACEL,GAAgB,OAASA,EAAe,KAAQA,GAAgB,KAC5D9F,GACA8F,GAAgB,KAAQA,EAAe,KACrCG,EAAK,OAASC,EAAI,OAChBjG,EAEFC,GAGV,IAAIkG,EACAzF,EAEJ,GAAIwF,IAAmBnG,GACrBoG,EAAWvG,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAASqG,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmBlG,EACjCU,EAAW0F,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQhH,GAAe0G,CAAa,EAAIxG,GAAewG,CAAa,CACjF,CAGA,OADuBK,EAAS,OAASzF,EAAS,QAC5BmF,EAAqBN,EAEpC,CACL,GAAGA,EACH,OAAQ,CACN,CACE,GAAGG,EACH,GAAI5F,EACJ,KAAMY,CACR,EACAiF,EACA,CACE,GAAGC,EACH,CAAC9F,CAAoB,EAAG,CAAE,KAAMqG,CAAS,CAC3C,CACF,CACF,CACF,IC1bA,IAAAE,GAAA,GAAAC,GAAAD,GAAA,oBAAAE,GAAA,0BAAAC,KAAA,eAAAC,GAAAJ,IAAA,IAAMK,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBL,GACpBM,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASP,GAAS,IAAIM,CAAG,EAK/B,GAJAJ,EAAYA,IAAc,IAAUK,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDF,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMM,EAAS,KAAK,MAAMJ,EAAK,IAAc,EACvCK,EAAOJ,EAAiBG,CAAM,EAChCC,IAAS,SACXL,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUK,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIP,GAAaA,IAAc,IAAME,GAAM,KAAM,CAC/C,IAAMM,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACN,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBF,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPE,EAAO,CACL,GAAGA,EACH,KAAMM,EACN,QAAS,CAAE,GAAIN,GAAQA,EAAK,QAAU,mBAAoBF,CAAU,CACtE,CACF,CACA,IAAMS,EAAW,MAAM,MAAML,EAAKF,CAAI,EAEtC,GAAIF,IAAc,KAAM,CACtB,IAAMU,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMZ,GAAK,SAASY,CAAC,CAAC,EACjCb,GAAS,IAAIM,EAAKM,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMb,GAAwB,CACnCK,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAU,CAAc,IACtDjB,GAAeM,EAAOC,EAAMU,CAAa,CAC3C",
+  "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "import_solady", "MAX_160_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "_jitDecompressor", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "trackedMemSize", "mem", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "MASK32", "ctr", "m", "k", "delta", "inc", "dec", "pushOp", "op", "pushD", "d", "pushS", "v", "freq", "trackMem", "offset", "size", "addOp", "imm", "shift", "a", "b", "last", "value", "_", "isInStack", "w", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "base", "word", "literal", "literalCost", "literalVal", "baseBytes", "reuseCost", "byte8s", "suffix0s", "step", "out", "payload", "alg", "rpcMethod", "txObj", "blockParam", "existingStateOverride", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "index_exports", "__export", "compressModule", "compressModuleWithJIT", "__toCommonJS", "_sup_enc", "_enc", "supported", "input", "init", "transformPayload", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compress_call"]
 }

package/_cjs/index.node.cjs

@@ -1,3 +1,3 @@
-var he=Object.create;var k=Object.defineProperty;var xe=Object.getOwnPropertyDescriptor;var ye=Object.getOwnPropertyNames;var we=Object.getPrototypeOf,Se=Object.prototype.hasOwnProperty;var Me=(t,n)=>()=>(t&&(n=t(t=0)),n);var ee=(t,n)=>{for(var s in n)k(t,s,{get:n[s],enumerable:!0})},te=(t,n,s,f)=>{if(n&&typeof n=="object"||typeof n=="function")for(let i of ye(n))!Se.call(t,i)&&i!==s&&k(t,i,{get:()=>n[i],enumerable:!(f=xe(n,i))||f.enumerable});return t};var Re=(t,n,s)=>(s=t!=null?he(we(t)):{},te(n||!t||!t.__esModule?k(s,"default",{value:t,enumerable:!0}):s,t)),Ce=t=>te(k({},"__esModule",{value:!0}),t);var ae={};ee(ae,{compress_call:()=>Ue,flzFwdBytecode:()=>ie,jitBytecode:()=>Ie,rleFwdBytecode:()=>ce});var W,_e,S,Ae,ne,ie,ce,Ie,fe,ze,se,re,J,oe,Ue,le=Me(()=>{W=require("solady"),_e=(1n<<160n)-1n,S=t=>t.replace(/^0x/,"").toLowerCase(),Ae=t=>{let n=S(t),s=n.length,f=new Uint8Array(s/2);for(let i=0;i<s;i+=2)f[i/2]=Number.parseInt(n.slice(i,i+2),16);return f},ne=t=>{let n="";for(let s=0;s<t.length;s++)n+=t[s].toString(16).padStart(2,"0");return n};ie=t=>`0x365f73${S(t)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;ce=t=>`0x5f5f5b368110602d575f8083813473${S(t)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;Ie=function(t){return fe("0x"+S(t))},fe=function(t){let n=S(t),s=Ae(n),f=28,i=new Uint8Array(f+s.length);i.set(s,f);let p=i.length,a=[],l=[],b=[],M=new Map,y=0,g=new Map,R=e=>{let r=b.lastIndexOf(e);return r===-1?-1:b.length-1-r},G=new Map,P=new Map,N=new Map,O=new Map,T=new Map,pe=e=>e+31&-32,Z=0,E=new Map,A=()=>[b.pop(),b.pop()],F=(1n<<256n)-1n,q=(e,r)=>e.set(r,(e.get(r)||0)+1),L=e=>{a.push(e),q(G,e)},j=e=>{l.push(e||null),q(P,e||null)},I=e=>{b.push(e),q(N,e),q(M,e),++Z,E.set(e,Z)},$=(e,r)=>{y=pe(e+r)},z=(e,r)=>{if(e===89)I(BigInt(y));else if(e===27){let[o,u]=A();I(u<<o&F)}else if(e===23){let[o,u]=A();I((o|u)&F)}else if(e>=96&&e<=127||e===95){let o=0n;for(let m of r||[])o=o<<8n|BigInt(m);let u=R(o);if(I(o),u!==-1&&e!=95){M.get(o)*2<N.get(o)&&(L(128+u),j(null));return}if(o==224n){L(48),j(null);return}}else if(e===81){let o=Number(b.pop());I(g.has(o)?g.get(o):0n)}else if(e===82){let[o,u]=A(),m=Number(o);g.set(m,u&F),$(m,32)}else if(e===83){let[o,u]=A();$(Number(o),1)}else e===243&&A();L(e),j(r||null)},B=e=>z(e),U=e=>{if(e>0&&e===y)return z(89);if(!e)return z(95,void 0);let r=BigInt(e),o=[];for(;r;)o.unshift(Number(r&0xffn)),r>>=8n;return z(95+o.length,o)},X=e=>z(95+e.length,Array.from(e)),ge=(e,r)=>(e.match(new RegExp(r,"g"))||[]).length,de=e=>{let r=0,o=!0;for(let{s:u,e:m}of e)r+=1+m-u+1,31-m>0&&(r+=3),o||(r+=1),o=!1;return r},D=[],C=e=>(D.push({t:"num",v:e}),U(e)),Q=e=>(D.push({t:"bytes",b:e}),X(e)),_=e=>(D.push({t:"op",o:e}),B(e));for(let e=0;e<p;e+=32){let r=new Uint8Array(32);r.set(i.slice(e,Math.min(e+32,p)),0);let o=[];for(let c=0;c<32;){for(;c<32&&r[c]===0;)++c;if(c>=32)break;let x=c;for(;c<32&&r[c]!==0;)++c;o.push({s:x,e:c-1})}if(!o.length)continue;if(o.every(({s:c,e:x})=>c===x)){for(let{s:c}of o)C(r[c]),C(e+c),_(83);continue}let m=r.slice(o[0].s),H=1+m.length,V=Math.ceil(Math.log2(e+1)/8),w=ne(r);if(H>8){if(O.has(w)){if(H>T.get(w)+V){C(O.get(w)),_(81),C(e),_(82);continue}}else if(T.get(w)!=-1){let c=V+3,x=ge(n,w);T.set(w,x*32>x*c?c:-1),O.set(w,e)}}if(H<=de(o))Q(m);else{let c=!0;for(let{s:x,e:Y}of o){let v=31-Y;Q(r.slice(x,Y+1)),v>0&&(C(v*8),_(27)),c||_(23),c=!1}}C(e),_(82)}a=[],l=[],b=[],y=0,g=new Map,Array.from(N.entries()).filter(([e,r])=>r>1&&e!==0n&&e!==224n).filter(([e,r])=>typeof e=="number"?e:Number(e)<=_e).sort((e,r)=>E.get(r[0])-E.get(e[0])).slice(0,14).forEach(([e,r])=>{U(e)}),M=new Map;for(let e of D)e.t==="num"?U(e.v):e.t==="bytes"?X(e.b):e.t==="op"&&B(e.o);B(95),B(95),U(s.length),U(f);let K=[];for(let e=0;e<a.length;++e)K.push(a[e]),a[e]>=96&&a[e]<=127&&l[e]&&K.push(...l[e]);return"0x"+ne(new Uint8Array(K))+"345f355af1503d5f5f3e3d5ff3"},ze=800,se="0x00000000000000000000000000000000000000e0",re="jit",J="flz",oe="cd";Ue=function(t,n){let s=t.params?.[0]?.method||t.method;if(s&&s!=="eth_call")return t;let f=S(t.data||"0x"),i=(t.data||"0x").length;if(i<ze)return t;let p=t.to||"",a="0x"+f,l=!n&&i<1150,b=n===J||l?W.LibZip.flzCompress(a):null,M=n===oe||l?W.LibZip.cdCompress(a):null,y=n||(i>=1150?re:b.length<M.length?J:oe),g,R;if(y===re)g=fe(a),R="0x"+S(p).padStart(64,"0");else{let P=y===J;R=P?b:M,g=P?ie(p):ce(p)}return g.length+R.length>=i?t:{...t,to:se,data:R,stateDiff:{...t.stateDiff||{},[se]:{code:g}}}}});var Be={};ee(Be,{compressModule:()=>be,compressModuleWithJIT:()=>qe});module.exports=Ce(Be);var h=Re(require("node:zlib"),1);var ue=new Map,Pe=["deflate-raw","deflate","gzip"],d=typeof CompressionStream>"u"?-1:null;async function be(t,n,s){let f=typeof t=="string"?t:t instanceof URL?t.toString():t.url,i=ue.get(f);if(d=d===-1||i===-1?-1:i?.[0]??null,s&&n?.body&&typeof n.body=="string"&&(d===-1||d===null))try{let a=JSON.parse(n.body),l=s(a);l!==void 0&&(n={...n,body:JSON.stringify(l)})}catch{}if(d&&d!==-1&&n?.body){let a=await new Response(new Blob([n.body]).stream().pipeThrough(new CompressionStream(d))).blob();n={...n,body:a,headers:{...n&&n.headers,"Content-Encoding":d}}}let p=await fetch(f,n);if(d===null){let a=p.headers.get("Accept-Encoding")?.split(",").filter(l=>Pe.includes(l));ue.set(f,a?.length?a:-1)}return p}var qe=(t,n)=>Promise.resolve().then(()=>(le(),ae)).then(({compress_call:s})=>be(t,n,s));var me=(t,n)=>Object.assign(t,{writable:new WritableStream({write(s){return n.write(s),Promise.resolve()},close(){return n.end(),Promise.resolve()}}),readable:new ReadableStream({type:"bytes",start(s){n.on("data",f=>s.enqueue(f)),n.once("end",()=>s.close())}})});globalThis.CompressionStream||(globalThis.CompressionStream=class{constructor(n){let s;n==="deflate"?s=h.default.createDeflate():n==="gzip"?s=h.default.createGzip():n==="br"?s=h.default.createBrotliCompress():s=h.default.createDeflateRaw(),me(this,s)}});globalThis.DecompressionStream||(globalThis.DecompressionStream=class{constructor(n){let s;n==="deflate"?s=h.default.createInflate():n==="gzip"?s=h.default.createGunzip():n==="br"?s=h.default.createBrotliDecompress():s=h.default.createInflateRaw(),me(this,s)}});0&&(module.exports={compressModule,compressModuleWithJIT});
+var we=Object.create;var L=Object.defineProperty;var Se=Object.getOwnPropertyDescriptor;var Me=Object.getOwnPropertyNames;var Re=Object.getPrototypeOf,Ie=Object.prototype.hasOwnProperty;var Ce=(t,n)=>()=>(t&&(n=t(t=0)),n);var re=(t,n)=>{for(var s in n)L(t,s,{get:n[s],enumerable:!0})},oe=(t,n,s,a)=>{if(n&&typeof n=="object"||typeof n=="function")for(let f of Me(n))!Ie.call(t,f)&&f!==s&&L(t,f,{get:()=>n[f],enumerable:!(a=Se(n,f))||a.enumerable});return t};var _e=(t,n,s)=>(s=t!=null?we(Re(t)):{},oe(n||!t||!t.__esModule?L(s,"default",{value:t,enumerable:!0}):s,t)),Ae=t=>oe(L({},"__esModule",{value:!0}),t);var ue={};re(ue,{compress_call:()=>Oe,flzFwdBytecode:()=>le,jitBytecode:()=>Pe,rleFwdBytecode:()=>ae});var X,ze,C,Be,ie,le,ae,Pe,fe,Ue,Z,ce,$,V,Oe,be=Ce(()=>{X=require("solady"),ze=(1n<<128n)-1n,C=t=>t.replace(/^0x/,"").toLowerCase(),Be=t=>{let n=C(t),s=n.length,a=new Uint8Array(s/2);for(let f=0;f<s;f+=2)a[f/2]=Number.parseInt(n.slice(f,f+2),16);return a},ie=t=>{let n="";for(let s=0;s<t.length;s++)n+=t[s].toString(16).padStart(2,"0");return n};le=t=>`0x365f73${C(t)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;ae=t=>`0x5f5f5b368110602d575f8083813473${C(t)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;Pe=function(t){return fe("0x"+C(t))},fe=function(t){let n=C(t),s=Be(n),a=28,f=new Uint8Array(a+s.length);f.set(s,a);let h=f.length,c=[],u=[],b=[],x=0,M=new Map,U=e=>{let r=b.lastIndexOf(e);return r===-1?-1:b.length-1-r},O=new Map,_=new Map,m=new Map,y=new Map,k=new Map,q=e=>e+31&-32,Q=0,j=new Map,A=()=>[b.pop(),b.pop()],H=(1n<<256n)-1n,J=(e,r,o)=>e.set(r,(e.get(r)||0)+o),Y=(e,r)=>J(e,r,1),v=(e,r)=>J(e,r,-1),T=e=>{c.push(e),Y(O,e)},D=e=>{u.push(e||null),Y(_,e||null)},w=(e,r=1)=>{b.push(e),J(m,e,r),++Q,j.set(e,Q)},ee=(e,r)=>{x=q(e+r)},z=(e,r)=>{if(e===54)w(32n,0);else if(e===89)w(BigInt(x),0);else if(e===27){let[o,l]=A();c[c.length-1]==144&&(c.pop(),u.pop(),[o,l]=[l,o]),w(l<<BigInt(o)&H)}else if(e===23){let[o,l]=A();c[c.length-1]==144&&(c.pop(),u.pop()),w((o|l)&H)}else if(e>=96&&e<=127||e===95){let o=0n;for(let p of r||[])o=o<<8n|BigInt(p);if(o==224n){w(o),T(48),D(null);return}let l=U(o);if(l!==-1&&e!=95){let p=m.get(o)==0;if(l==0&&p){v(m,o);return}if(l==1&&p){T(144);let[E,F]=A();b.push(F),b.push(E),D(null),v(m,o);return}w(o,-1),T(128+l),D(null);return}w(o)}else if(e===81){let o=Number(b.pop());w(M.has(o)?M.get(o):0n)}else if(e===82){let[o,l]=A(),p=Number(o);M.set(p,l&H),ee(p,32)}else if(e===83){let[o,l]=A();ee(Number(o),1)}else e===243&&A();T(e),D(r||null)},de=e=>b.includes(e)||e==224||e==32n,N=e=>z(e),R=e=>{if(e>0&&e===x)return z(89);if(e==32n)return z(54);if(!e)return z(95,void 0);let r=BigInt(e),o=[];for(;r;)o.unshift(Number(r&0xffn)),r>>=8n;return z(95+o.length,o)},te=e=>z(95+e.length,Array.from(e)),he=(e,r)=>(e.match(new RegExp(r,"g"))||[]).length,xe=e=>{let r=0,o=!0;for(let{s:l,e:p}of e)r+=1+p-l+1,31-p>0&&(r+=3),o||(r+=1),o=!1;return r},K=[],B=e=>(K.push({t:"num",v:e}),R(e)),W=e=>(K.push({t:"bytes",b:e}),te(e)),P=e=>(K.push({t:"op",o:e}),N(e));R(1n);for(let e=0;e<h;e+=32){let r=new Uint8Array(32);r.set(f.slice(e,Math.min(e+32,h)),0);let o=[];for(let i=0;i<32;){for(;i<32&&r[i]===0;)++i;if(i>=32)break;let S=i;for(;i<32&&r[i]!==0;)++i;o.push({s:S,e:i-1})}if(!o.length)continue;let l=r.slice(o[0].s),p=1+l.length,E=0n;for(let i of l)E=E<<8n|BigInt(i);let F=Math.ceil(Math.log2(e+1)/8),I=ie(r);if(p>8){if(y.has(I)){if(p>k.get(I)+F){B(y.get(I)),P(81),B(e),P(82);continue}}else if(k.get(I)!=-1){let i=F+3,S=he(n,I);k.set(I,S*32>S*i?i:-1),y.set(I,e)}}let ye=o.every(({s:i,e:S})=>i===S);if(de(l))W(l);else if(ye){for(let{s:i}of o)B(r[i]),B(e+i),P(83);continue}else if(p<=xe(o))W(l);else{let i=!0;for(let{s:S,e:ne}of o){let se=31-ne;W(r.slice(S,ne+1)),se>0&&(B(se*8),P(27)),i||P(23),i=!1}}B(e),P(82)}c=[],u=[],b=[],x=0,M=new Map,Array.from(m.entries()).filter(([e,r])=>r>1&&e>1n&&e!==32n&&e!==224n).sort((e,r)=>j.get(r[0])-j.get(e[0])).filter(([e,r])=>typeof e=="number"?BigInt(e):e<=ze).slice(0,13).forEach(([e,r])=>{R(e)}),R(1n);for(let e of K)e.t==="num"?R(e.v):e.t==="bytes"?te(e.b):e.t==="op"&&N(e.o);N(95),N(95),R(s.length),R(a);let G=[];for(let e=0;e<c.length;++e)G.push(c[e]),c[e]>=96&&c[e]<=127&&u[e]&&G.push(...u[e]);return"0x"+ie(new Uint8Array(G))+"345f355af13d5f5f3e3d5ff3"},Ue=1150,Z="0x00000000000000000000000000000000000000e0",ce="jit",$="flz",V="cd";Oe=function(t,n){let s=t.params?.[0]?.method||t.method;if(s&&s!=="eth_call")return t;let a=t.params?.[0]||t,f=t.params?.[1]||"latest",h=t.params?.[2]||{},c=C(a.data||"0x"),u=(a.data||"0x").length;if(u<Ue||h[Z])return t;let b=a.to||"",x="0x"+c,M=!n&&u<1150,U=n===$||M?X.LibZip.flzCompress(x):null,O=n===V||M?X.LibZip.cdCompress(x):null,_=n;_||(_=u>=1150&&(u<3e3||u>=8e3)?ce:u>=3e3&&u<8e3&&U.length<O.length?$:V);let m,y;if(_===ce)m=fe(x),y="0x"+C(b).padStart(64,"0");else{let q=_===$;y=q?U:O,m=q?le(b):ae(b)}return m.length+y.length>=u?t:{...t,params:[{...a,to:Z,data:y},f,{...h,[Z]:{code:m}}]}}});var Te={};re(Te,{compressModule:()=>me,compressModuleWithJIT:()=>qe});module.exports=Ae(Te);var d=_e(require("node:zlib"),1);var pe=new Map,ke=["deflate-raw","deflate","gzip"],g=typeof CompressionStream>"u"?-1:null;async function me(t,n,s){let a=typeof t=="string"?t:t instanceof URL?t.toString():t.url,f=pe.get(a);if(g=g===-1||f===-1?-1:f?.[0]??null,s&&n?.body&&typeof n.body=="string"&&(g===-1||g===null))try{let c=JSON.parse(n.body),u=s(c);u!==void 0&&(n={...n,body:JSON.stringify(u)})}catch{}if(g&&g!==-1&&n?.body){let c=await new Response(new Blob([n.body]).stream().pipeThrough(new CompressionStream(g))).blob();n={...n,body:c,headers:{...n&&n.headers,"Content-Encoding":g}}}let h=await fetch(a,n);if(g===null){let c=h.headers.get("Accept-Encoding")?.split(",").filter(u=>ke.includes(u));pe.set(a,c?.length?c:-1)}return h}var qe=(t,n)=>Promise.resolve().then(()=>(be(),ue)).then(({compress_call:s})=>me(t,n,s));var ge=(t,n)=>Object.assign(t,{writable:new WritableStream({write(s){return n.write(s),Promise.resolve()},close(){return n.end(),Promise.resolve()}}),readable:new ReadableStream({type:"bytes",start(s){n.on("data",a=>s.enqueue(a)),n.once("end",()=>s.close())}})});globalThis.CompressionStream||(globalThis.CompressionStream=class{constructor(n){let s;n==="deflate"?s=d.default.createDeflate():n==="gzip"?s=d.default.createGzip():n==="br"?s=d.default.createBrotliCompress():s=d.default.createDeflateRaw(),ge(this,s)}});globalThis.DecompressionStream||(globalThis.DecompressionStream=class{constructor(n){let s;n==="deflate"?s=d.default.createInflate():n==="gzip"?s=d.default.createGunzip():n==="br"?s=d.default.createBrotliDecompress():s=d.default.createInflateRaw(),ge(this,s)}});0&&(module.exports={compressModule,compressModuleWithJIT});
 //! @__PURE__
 //# sourceMappingURL=index.node.cjs.map

package/_cjs/index.node.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/jit-compressor.ts", "../../src/index.node.ts", "../../src/index.ts"],
-  "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 160n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n  return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let stackFreq2 = new Map<bigint, number>();\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  const getStackIdx = (val: bigint): number => {\n    const idx = stack.lastIndexOf(val);\n    return idx === -1 ? -1 : stack.length - 1 - idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const MASK32 = (1n << 256n) - 1n;\n\n  const bump = <K>(m: Map<K, number>, k: K) => m.set(k, (m.get(k) || 0) + 1);\n  const pushOp = (op: number) => {\n    ops.push(op);\n    bump(opFreq, op);\n  };\n  const pushD = (d: number[] | null) => {\n    data.push(d || null);\n    bump(dataFreq, d || null);\n  };\n  const pushS = (v: bigint) => {\n    stack.push(v);\n    bump(stackFreq, v);\n    bump(stackFreq2, v);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x59) {\n      pushS(BigInt(trackedMemSize));\n    } else if (op === 0x1b) {\n      // SHL\n      const [shift, val] = pop2();\n      pushS((val << shift) & MASK32);\n    } else if (op === 0x17) {\n      // OR\n      const [a, b] = pop2();\n      pushS((a | b) & MASK32);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      const idx = getStackIdx(v);\n      pushS(v);\n      if (idx !== -1 && op != 0x5f) {\n        if (stackFreq2.get(v)! * 2 < stackFreq.get(v)!) {\n          pushOp(128 + idx);\n          pushD(null);\n        }\n        return;\n      }\n      if (v == 224n) {\n        // Special\u2011case the literal 0xe0 (224):\n        // the decompressor is always deployed at 0x...00e0, so the final\n        // byte of ADDRESS is exactly 0xe0. Since we must send our own\n        // address with the eth_call anyway, we can synthesize this value \n        // with a single opcode instead of encoding a literal, effectively\n        // giving us one more hot constant slot on the stack.\n        pushOp(0x30); // ADDRESS\n        pushD(null);\n        return;\n      }\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MASK32);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op);\n    pushD(imm || null);\n  };\n\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    if (byte8s) {\n      for (const { s } of seg) {\n        emitPushN(word[s]);\n        emitPushN(base + s);\n        emitOp(0x53); // MSTORE8\n      }\n      continue;\n    }\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    if (literalCost <= estShlCost(seg)) {\n      emitPushB(literal);\n    } else {\n      let first = true;\n      for (const { s, e } of seg) {\n        const suffix0s = 31 - e;\n        emitPushB(word.slice(s, e + 1));\n        if (suffix0s > 0) {\n          emitPushN(suffix0s * 8);\n          emitOp(0x1b); // SHL\n        }\n        if (!first) emitOp(0x17); // OR\n        first = false;\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val !== 0n && val !== 224n)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? val : Number(val) <= MAX_160_BIT;\n    })\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .slice(0, 14)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n\n  stackFreq2 = new Map();\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  // - 0x50: POP (discard success value)\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af1503d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 800;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const rpcMethod = payload.params?.[0]?.method || payload.method;\n  if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n  const hex = _normHex(payload.data || '0x');\n  const originalSize = (payload.data || '0x').length;\n  if (originalSize < MIN_SIZE_FOR_COMPRESSION) return payload;\n\n  const targetAddress = payload.to || '';\n  const data = '0x' + hex;\n\n  const autoSelect = !alg && originalSize < 1150;\n  const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n  const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n\n  const selectedMethod =\n    alg || (originalSize >= 1150 ? _jit : flz!.length < cd!.length ? _flz : _cd);\n\n  let bytecode: string;\n  let calldata: string;\n\n  if (selectedMethod === _jit) {\n    bytecode = _jitDecompressor(data);\n    calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n  } else {\n    const isFlz = selectedMethod === _flz;\n    calldata = isFlz ? flz! : cd!;\n    bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n  }\n\n  const compressedSize = bytecode.length + calldata.length;\n  if (compressedSize >= originalSize) return payload;\n\n  return {\n    ...payload,\n    to: DECOMPRESSOR_ADDRESS,\n    data: calldata,\n    stateDiff: {\n      ...(payload.stateDiff || {}),\n      [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n    },\n  };\n};\n", "import zlib from 'node:zlib';\n\n// Polyfill for CompressionStream/DecompressionStream in Node.js\nconst make = (ctx: any, handle: any) =>\n  Object.assign(ctx, {\n    writable: new WritableStream({\n      write(chunk) {\n        handle.write(chunk);\n        return Promise.resolve();\n      },\n      close() {\n        handle.end();\n        return Promise.resolve();\n      },\n    }),\n    readable: new ReadableStream({\n      type: 'bytes',\n      start(ctrl) {\n        handle.on('data', (chunk: any) => ctrl.enqueue(chunk));\n        handle.once('end', () => ctrl.close());\n      },\n    }),\n  });\n\nif (!globalThis.CompressionStream) {\n  globalThis.CompressionStream = class CompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createDeflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliCompress();\n      } else {\n        handle = zlib.createDeflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nif (!globalThis.DecompressionStream) {\n  globalThis.DecompressionStream = class DecompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createInflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGunzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliDecompress();\n      } else {\n        handle = zlib.createInflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nexport * from './index';\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  if (supported && supported !== -1 && init?.body) {\n    const compressed = await new Response(\n      new Blob([init.body as string])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
-  "mappings": "imBAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,IAAAC,EAEMC,GAEAC,EAEAC,GAUAC,GAeOP,GAUAE,GASAD,GAIPO,GA6RAC,GACAC,GAEAC,GACAC,EACAC,GAWOd,GAnWbe,GAAAC,GAAA,KAAAZ,EAAuB,kBAEjBC,IAAe,IAAM,MAAQ,GAE7BC,EAAYW,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEV,GAAoBU,GAA4B,CACpD,IAAMC,EAAaZ,EAASW,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAAS,EAAI,EAAG,EAAIA,EAAK,GAAK,EAC5BC,EAAM,EAAI,CAAC,EAAI,OAAO,SAASF,EAAW,MAAM,EAAG,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOE,CACT,EAEMZ,GAAoBY,GAA8B,CACtD,IAAIH,EAAM,GACV,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EASahB,GAAkBqB,GAC7B,WAAWhB,EAASgB,CAAO,CAAC,iYASjBnB,GAAkBmB,GAC7B,mCAAmChB,EAASgB,CAAO,CAAC,qLAQzCpB,GAAc,SAAUqB,EAA0B,CAC7D,OAAOd,GAAiB,KAAOH,EAASiB,CAAQ,CAAC,CACnD,EAEMd,GAAmB,SAAUc,EAA0B,CAC3D,IAAMN,EAAMX,EAASiB,CAAQ,EACvBC,EAAcjB,GAAiBU,CAAG,EAOlCQ,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAa,IAAI,IACjBC,EAAiB,EACjBC,EAAM,IAAI,IACRC,EAAeC,GAAwB,CAC3C,IAAMC,EAAMN,EAAM,YAAYK,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAExCC,EAAc,EACZC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAU,IAAM,MAAQ,GAExBC,EAAO,CAAIC,EAAmBC,IAASD,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAK,CAAC,EACnEC,EAAUC,GAAe,CAC7BxB,EAAI,KAAKwB,CAAE,EACXJ,EAAKX,EAAQe,CAAE,CACjB,EACMC,EAASC,GAAuB,CACpCzB,EAAK,KAAKyB,GAAK,IAAI,EACnBN,EAAKV,EAAUgB,GAAK,IAAI,CAC1B,EACMC,EAASC,GAAc,CAC3B1B,EAAM,KAAK0B,CAAC,EACZR,EAAKT,EAAWiB,CAAC,EACjBR,EAAKjB,EAAYyB,CAAC,EAClB,EAAEZ,EACFC,EAAS,IAAIW,EAAGZ,CAAW,CAC7B,EAEMa,EAAW,CAACC,EAAgBC,IAAiB,CACjD3B,EAAiBU,GAAUgB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACR,EAAYS,IAAmB,CAC5C,GAAIT,IAAO,GACTG,EAAM,OAAOvB,CAAc,CAAC,UACnBoB,IAAO,GAAM,CAEtB,GAAM,CAACU,EAAO3B,CAAG,EAAIW,EAAK,EAC1BS,EAAOpB,GAAO2B,EAASf,CAAM,CAC/B,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACW,EAAGC,CAAC,EAAIlB,EAAK,EACpBS,GAAOQ,EAAIC,GAAKjB,CAAM,CACxB,SAAYK,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAWQ,KAAKH,GAAO,CAAC,EAAGL,EAAKA,GAAK,GAAM,OAAOQ,CAAC,EACnD,IAAM5B,EAAMF,EAAYsB,CAAC,EAEzB,GADAD,EAAMC,CAAC,EACHpB,IAAQ,IAAMgB,GAAM,GAAM,CACxBrB,EAAW,IAAIyB,CAAC,EAAK,EAAIjB,EAAU,IAAIiB,CAAC,IAC1CL,EAAO,IAAMf,CAAG,EAChBiB,EAAM,IAAI,GAEZ,MACF,CACA,GAAIG,GAAK,KAAM,CAObL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACF,SAAWD,IAAO,GAAM,CAEtB,IAAMF,EAAI,OAAOpB,EAAM,IAAI,CAAE,EAC7ByB,EAAMtB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWE,IAAO,GAAM,CAEtB,GAAM,CAACM,EAAQO,CAAK,EAAInB,EAAK,EACvBI,EAAI,OAAOQ,CAAM,EACvBzB,EAAI,IAAIiB,EAAGe,EAAQlB,CAAM,EACzBU,EAASP,EAAG,EAAE,CAChB,SAAWE,IAAO,GAAM,CAEtB,GAAM,CAACM,EAAQQ,CAAC,EAAIpB,EAAK,EACzBW,EAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWN,IAAO,KAEhBN,EAAK,EAEPK,EAAOC,CAAE,EACTC,EAAMQ,GAAO,IAAI,CACnB,EAEMT,EAAMe,GAAmBP,EAAMO,CAAM,EACrCC,EAASH,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUjC,EAAgB,OAAO4B,EAAM,EAAI,EAC5D,GAAI,CAACK,EAAO,OAAOL,EAAM,GAAM,MAAS,EACxC,IAAIJ,EAAI,OAAOS,CAAK,EAChB7C,EAAkB,CAAC,EACvB,KAAOoC,GACLpC,EAAM,QAAQ,OAAOoC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOI,EAAM,GAAOxC,EAAM,OAAQA,CAAK,CACzC,EACMiD,EAAS3C,GAAoBkC,EAAM,GAAOlC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrE4C,GAAW,CAACrD,EAAasD,KAC5BtD,EAAI,MAAM,IAAI,OAAOsD,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAavB,IAAwBsB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAtB,CAAE,CAAC,EAAGY,EAAMZ,CAAC,GACxEwB,EAAahB,IAAmBc,EAAK,KAAK,CAAE,EAAG,QAAS,EAAAd,CAAE,CAAC,EAAGK,EAAML,CAAC,GACrEiB,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG9B,EAAG8B,CAAC,GAG9D,QAASC,EAAO,EAAGA,EAAOxD,EAAGwD,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAI1D,EAAI,MAAMyD,EAAM,KAAK,IAAIA,EAAO,GAAIxD,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAM8C,EAAuC,CAAC,EAC9C,QAASpD,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAM+D,EAAK/D,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAMuD,EAAIvD,EACV,KAAOA,EAAI,IAAM+D,EAAK/D,CAAC,IAAM,GAAG,EAAEA,EAClCoD,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAGvD,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACoD,EAAI,OAAQ,SAGjB,GADeA,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAClC,CACV,OAAW,CAAE,EAAAD,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,CAGA,IAAMI,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAE1BE,EAAY,KAAK,KAAK,KAAK,KAAKJ,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAU/D,GAAiB4E,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAI9C,EAAU,IAAI+B,CAAO,GACvB,GAAIe,EAAc7C,EAAc,IAAI8B,CAAO,EAAKgB,EAAW,CACzDR,EAAUvC,EAAU,IAAI+B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACSxC,EAAc,IAAI8B,CAAO,GAAK,GAAI,CAC3C,IAAMiB,EAAYD,EAAY,EACxBE,EAAOnB,GAASrD,EAAKsD,CAAO,EAClC9B,EAAc,IAAI8B,EAASkB,EAAO,GAAKA,EAAOD,EAAYA,EAAY,EAAE,EACxEhD,EAAU,IAAI+B,EAASY,CAAI,CAC7B,EAGF,GAAIG,GAAed,GAAWC,CAAG,EAC/BO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,IAAMiB,EAAW,GAAKb,EACtBG,EAAUI,EAAK,MAAMR,EAAGC,EAAI,CAAC,CAAC,EAC1Ba,EAAW,IACbX,EAAUW,EAAW,CAAC,EACtBT,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEArD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTE,EAAiB,EACjBC,EAAM,IAAI,IAGV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKsD,CAAI,IAAMA,EAAO,GAAKtD,IAAQ,IAAMA,IAAQ,IAAI,EAC9D,OAAO,CAAC,CAACA,EAAK+B,CAAC,IACP,OAAO/B,GAAQ,SAAWA,EAAM,OAAOA,CAAG,GAAK9B,EACvD,EACA,KAAK,CAAC0D,EAAGC,IAAMnB,EAAS,IAAImB,EAAE,CAAC,CAAC,EAAKnB,EAAS,IAAIkB,EAAE,CAAC,CAAC,CAAE,EACxD,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC5B,EAAK+B,CAAC,IAAM,CACrBE,EAAMjC,CAAG,CACX,CAAC,EAEHJ,EAAa,IAAI,IAEjB,QAAW4D,KAAQb,EACba,EAAK,IAAM,MAAOvB,EAAMuB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAStB,EAAMsB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAMvC,EAAGuC,EAAK,CAAC,EAqBrCvC,EAAG,EAAI,EACPA,EAAG,EAAI,EACPgB,EAAM5C,EAAY,MAAM,EACxB4C,EAAM3C,CAAO,EAEb,IAAMmE,EAAgB,CAAC,EACvB,QAASvE,EAAI,EAAGA,EAAIO,EAAI,OAAQ,EAAEP,EAChCuE,EAAI,KAAKhE,EAAIP,CAAC,CAAC,EACXO,EAAIP,CAAC,GAAK,IAAQO,EAAIP,CAAC,GAAK,KAAQQ,EAAKR,CAAC,GAAGuE,EAAI,KAAK,GAAG/D,EAAKR,CAAC,CAAE,EAMvE,MAAO,KAAOb,GAAiB,IAAI,WAAWoF,CAAG,CAAC,EAAI,4BACxD,EAEMlF,GAA2B,IAC3BC,GAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,GAAM,KAWCd,GAAgB,SAAU6F,EAAcC,EAAmB,CACtE,IAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAElD,IAAM5E,EAAMX,EAASuF,EAAQ,MAAQ,IAAI,EACnCG,GAAgBH,EAAQ,MAAQ,MAAM,OAC5C,GAAIG,EAAetF,GAA0B,OAAOmF,EAEpD,IAAMI,EAAgBJ,EAAQ,IAAM,GAC9BhE,EAAO,KAAOZ,EAEdiF,EAAa,CAACJ,GAAOE,EAAe,KACpCG,EAAML,IAAQjF,GAAQqF,EAAa,SAAO,YAAYrE,CAAI,EAAI,KAC9DuE,EAAKN,IAAQhF,IAAOoF,EAAa,SAAO,WAAWrE,CAAI,EAAI,KAE3DwE,EACJP,IAAQE,GAAgB,KAAOpF,GAAOuF,EAAK,OAASC,EAAI,OAASvF,EAAOC,IAEtEwF,EACA/E,EAEJ,GAAI8E,IAAmBzF,GACrB0F,EAAW7F,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAAS2F,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmBxF,EACjCU,EAAWgF,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQtG,GAAegG,CAAa,EAAI9F,GAAe8F,CAAa,CACjF,CAGA,OADuBK,EAAS,OAAS/E,EAAS,QAC5ByE,EAAqBH,EAEpC,CACL,GAAGA,EACH,GAAIlF,GACJ,KAAMY,EACN,UAAW,CACT,GAAIsE,EAAQ,WAAa,CAAC,EAC1B,CAAClF,EAAoB,EAAG,CAAE,KAAM2F,CAAS,CAC3C,CACF,CACF,IC7YA,IAAAE,GAAA,GAAAC,GAAAD,GAAA,oBAAAE,GAAA,0BAAAC,KAAA,eAAAC,GAAAJ,IAAA,IAAAK,EAAiB,2BCAjB,IAAMC,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBC,GACpBC,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASR,GAAS,IAAIO,CAAG,EAK/B,GAJAL,EAAYA,IAAc,IAAUM,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDH,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMO,EAAS,KAAK,MAAMJ,EAAK,IAAc,EACvCK,EAAOJ,EAAiBG,CAAM,EAChCC,IAAS,SACXL,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUK,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIR,GAAaA,IAAc,IAAMG,GAAM,KAAM,CAC/C,IAAMM,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACN,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPG,EAAO,CACL,GAAGA,EACH,KAAMM,EACN,QAAS,CAAE,GAAIN,GAAQA,EAAK,QAAU,mBAAoBH,CAAU,CACtE,CACF,CACA,IAAMU,EAAW,MAAM,MAAML,EAAKF,CAAI,EAEtC,GAAIH,IAAc,KAAM,CACtB,IAAMW,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMb,GAAK,SAASa,CAAC,CAAC,EACjCd,GAAS,IAAIO,EAAKM,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMG,GAAwB,CACnCX,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAW,CAAc,IACtDb,GAAeC,EAAOC,EAAMW,CAAa,CAC3C,ED7GF,IAAMC,GAAO,CAACC,EAAUC,IACtB,OAAO,OAAOD,EAAK,CACjB,SAAU,IAAI,eAAe,CAC3B,MAAME,EAAO,CACX,OAAAD,EAAO,MAAMC,CAAK,EACX,QAAQ,QAAQ,CACzB,EACA,OAAQ,CACN,OAAAD,EAAO,IAAI,EACJ,QAAQ,QAAQ,CACzB,CACF,CAAC,EACD,SAAU,IAAI,eAAe,CAC3B,KAAM,QACN,MAAME,EAAM,CACVF,EAAO,GAAG,OAASC,GAAeC,EAAK,QAAQD,CAAK,CAAC,EACrDD,EAAO,KAAK,MAAO,IAAME,EAAK,MAAM,CAAC,CACvC,CACF,CAAC,CACH,CAAC,EAEE,WAAW,oBACd,WAAW,kBAAoB,KAAwB,CACrD,YAAYC,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAAS,EAAAI,QAAK,cAAc,EACnBD,IAAW,OACpBH,EAAS,EAAAI,QAAK,WAAW,EAChBD,IAAW,KACpBH,EAAS,EAAAI,QAAK,qBAAqB,EAEnCJ,EAAS,EAAAI,QAAK,iBAAiB,EAEjCN,GAAK,KAAME,CAAM,CACnB,CACF,GAGG,WAAW,sBACd,WAAW,oBAAsB,KAA0B,CACzD,YAAYG,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAAS,EAAAI,QAAK,cAAc,EACnBD,IAAW,OACpBH,EAAS,EAAAI,QAAK,aAAa,EAClBD,IAAW,KACpBH,EAAS,EAAAI,QAAK,uBAAuB,EAErCJ,EAAS,EAAAI,QAAK,iBAAiB,EAEjCN,GAAK,KAAME,CAAM,CACnB,CACF",
-  "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "import_solady", "MAX_160_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "_jitDecompressor", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "stackFreq2", "trackedMemSize", "mem", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "MASK32", "bump", "m", "k", "pushOp", "op", "pushD", "d", "pushS", "v", "trackMem", "offset", "size", "addOp", "imm", "shift", "a", "b", "value", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "base", "word", "literal", "literalCost", "baseBytes", "reuseCost", "freq", "suffix0s", "step", "out", "payload", "alg", "rpcMethod", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "index_node_exports", "__export", "compressModule", "compressModuleWithJIT", "__toCommonJS", "import_node_zlib", "_sup_enc", "_enc", "supported", "compressModule", "input", "init", "transformPayload", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compressModuleWithJIT", "compress_call", "make", "ctx", "handle", "chunk", "ctrl", "format", "zlib"]
+  "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 128n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n  return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  const getStackIdx = (val: bigint): number => {\n    const idx = stack.lastIndexOf(val);\n    return idx === -1 ? -1 : stack.length - 1 - idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const MASK32 = (1n << 256n) - 1n;\n\n  const ctr = <K>(m: Map<K, number>, k: K, delta: number) => m.set(k, (m.get(k) || 0) + delta);\n  const inc = <K>(m: Map<K, number>, k: K) => ctr(m, k, 1);\n  const dec = <K>(m: Map<K, number>, k: K) => ctr(m, k, -1);\n  const pushOp = (op: number) => {\n    ops.push(op);\n    inc(opFreq, op);\n  };\n  const pushD = (d: number[] | null) => {\n    data.push(d || null);\n    inc(dataFreq, d || null);\n  };\n  const pushS = (v: bigint, freq: number = 1) => {\n    stack.push(v);\n    ctr(stackFreq, v, freq);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x36) {\n      pushS(32n, 0);\n    } else if (op === 0x59) {\n      pushS(BigInt(trackedMemSize), 0);\n    } else if (op === 0x1b) {\n      let [shift, val] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n        [shift, val] = [val, shift];\n      }\n      pushS((val << BigInt(shift)) & MASK32);\n    } else if (op === 0x17) {\n      // OR\n      const [a, b] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n      }\n      pushS((a | b) & MASK32);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      if (v == 224n) {\n        // Special\u2011case the literal 0xe0 (224):\n        // the decompressor is always deployed at 0x...00e0, so the final\n        // byte of ADDRESS is exactly 0xe0. Since we must send our own\n        // address with the eth_call anyway, we can synthesize this value\n        // with a single opcode instead of encoding a literal, effectively\n        // giving us one more hot constant slot on the stack.\n        pushS(v);\n        pushOp(0x30); // ADDRESS\n        pushD(null);\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        const last = stackFreq.get(v) == 0;\n        if (idx == 0 && last) {\n          dec(stackFreq, v);\n          return;\n        }\n        if (idx == 1 && last) {\n          pushOp(144);\n          const [a, b] = pop2();\n          stack.push(b);\n          stack.push(a);\n          pushD(null);\n          dec(stackFreq, v);\n          return;\n        }\n        pushS(v, -1);\n        pushOp(128 + idx);\n        pushD(null);\n        return;\n      }\n      pushS(v);\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MASK32);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op);\n    pushD(imm || null);\n  };\n  const isInStack = (w) => stack.includes(w) || w == 0xe0 || w == 32n;\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (value == 32n) return addOp(0x36);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n  pushN(1n);\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n    let literalVal = 0n;\n    for (const b of literal) literalVal = (literalVal << 8n) | BigInt(b);\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    // Convert literal bytes to bigint for stack comparison\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    if (isInStack(literal)) {\n      emitPushB(literal);\n    } else if (byte8s) {\n      for (const { s } of seg) {\n        emitPushN(word[s]);\n        emitPushN(base + s);\n        emitOp(0x53); // MSTORE8\n      }\n      continue;\n    } else if (literalCost <= estShlCost(seg)) {\n      emitPushB(literal);\n    } else {\n      let first = true;\n      for (const { s, e } of seg) {\n        const suffix0s = 31 - e;\n        emitPushB(word.slice(s, e + 1));\n        if (suffix0s > 0) {\n          emitPushN(suffix0s * 8);\n          emitOp(0x1b); // SHL\n        }\n        if (!first) emitOp(0x17); // OR\n        first = false;\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val > 1n && val !== 32n && val !== 224n)\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? BigInt(val) : val <= MAX_160_BIT;\n    })\n    .slice(0, 13)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n  pushN(1n);\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af13d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 1150;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const rpcMethod = payload.params?.[0]?.method || payload.method;\n  if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n  // Extract data and target address from params[0] if available, otherwise top-level\n  const txObj = payload.params?.[0] || payload;\n  const blockParam = payload.params?.[1] || 'latest';\n  const existingStateOverride = payload.params?.[2] || {};\n\n  // If there are any existing state overrides for the decompressor address, do not compress\n  const hex = _normHex(txObj.data || '0x');\n  const originalSize = (txObj.data || '0x').length;\n  if (originalSize < MIN_SIZE_FOR_COMPRESSION || (existingStateOverride[DECOMPRESSOR_ADDRESS])) return payload;\n\n  const targetAddress = txObj.to || '';\n  const data = '0x' + hex;\n\n  const autoSelect = !alg && originalSize < 1150;\n  const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n  const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n  let selectedMethod = alg;\n  if (!selectedMethod) {\n    selectedMethod =\n      originalSize >= 1150 && (originalSize < 3000 || originalSize >= 8000)\n        ? _jit\n        : originalSize >= 3000 && originalSize < 8000\n          ? flz!.length < cd!.length\n            ? _flz\n            : _cd\n          : _cd;\n  }\n\n  let bytecode: string;\n  let calldata: string;\n\n  if (selectedMethod === _jit) {\n    bytecode = _jitDecompressor(data);\n    calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n  } else {\n    const isFlz = selectedMethod === _flz;\n    calldata = isFlz ? flz! : cd!;\n    bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n  }\n\n  const compressedSize = bytecode.length + calldata.length;\n  if (compressedSize >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      {\n        ...txObj,\n        to: DECOMPRESSOR_ADDRESS,\n        data: calldata,\n      },\n      blockParam,\n      {\n        ...existingStateOverride,\n        [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n      },\n    ],\n  };\n};\n", "import zlib from 'node:zlib';\n\n// Polyfill for CompressionStream/DecompressionStream in Node.js\nconst make = (ctx: any, handle: any) =>\n  Object.assign(ctx, {\n    writable: new WritableStream({\n      write(chunk) {\n        handle.write(chunk);\n        return Promise.resolve();\n      },\n      close() {\n        handle.end();\n        return Promise.resolve();\n      },\n    }),\n    readable: new ReadableStream({\n      type: 'bytes',\n      start(ctrl) {\n        handle.on('data', (chunk: any) => ctrl.enqueue(chunk));\n        handle.once('end', () => ctrl.close());\n      },\n    }),\n  });\n\nif (!globalThis.CompressionStream) {\n  globalThis.CompressionStream = class CompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createDeflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliCompress();\n      } else {\n        handle = zlib.createDeflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nif (!globalThis.DecompressionStream) {\n  globalThis.DecompressionStream = class DecompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createInflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGunzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliDecompress();\n      } else {\n        handle = zlib.createInflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nexport * from './index';\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  if (supported && supported !== -1 && init?.body) {\n    const compressed = await new Response(\n      new Blob([init.body as string])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
+  "mappings": "imBAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,IAAAC,EAEMC,GAEAC,EAEAC,GAUAC,GAeOP,GAUAE,GASAD,GAIPO,GAsTAC,GACAC,EAEAC,GACAC,EACAC,EAWOd,GA5Xbe,GAAAC,GAAA,KAAAZ,EAAuB,kBAEjBC,IAAe,IAAM,MAAQ,GAE7BC,EAAYW,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEV,GAAoBU,GAA4B,CACpD,IAAMC,EAAaZ,EAASW,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAASE,EAAI,EAAGA,EAAIF,EAAKE,GAAK,EAC5BD,EAAMC,EAAI,CAAC,EAAI,OAAO,SAASH,EAAW,MAAMG,EAAGA,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOD,CACT,EAEMZ,GAAoBY,GAA8B,CACtD,IAAIH,EAAM,GACV,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EASahB,GAAkBqB,GAC7B,WAAWhB,EAASgB,CAAO,CAAC,iYASjBnB,GAAkBmB,GAC7B,mCAAmChB,EAASgB,CAAO,CAAC,qLAQzCpB,GAAc,SAAUqB,EAA0B,CAC7D,OAAOd,GAAiB,KAAOH,EAASiB,CAAQ,CAAC,CACnD,EAEMd,GAAmB,SAAUc,EAA0B,CAC3D,IAAMN,EAAMX,EAASiB,CAAQ,EACvBC,EAAcjB,GAAiBU,CAAG,EAOlCQ,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAiB,EACjBC,EAAM,IAAI,IACRC,EAAeC,GAAwB,CAC3C,IAAMC,EAAML,EAAM,YAAYI,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKL,EAAM,OAAS,EAAIK,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,EAAaC,GAAeA,EAAI,GAAM,IAExCC,EAAc,EACZC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAACf,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DgB,GAAU,IAAM,MAAQ,GAExBC,EAAM,CAAIC,EAAmBC,EAAMC,IAAkBF,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAKC,CAAK,EACrFC,EAAM,CAAIH,EAAmBC,IAASF,EAAIC,EAAGC,EAAG,CAAC,EACjDG,EAAM,CAAIJ,EAAmBC,IAASF,EAAIC,EAAGC,EAAG,EAAE,EAClDI,EAAUC,GAAe,CAC7B1B,EAAI,KAAK0B,CAAE,EACXH,EAAIf,EAAQkB,CAAE,CAChB,EACMC,EAASC,GAAuB,CACpC3B,EAAK,KAAK2B,GAAK,IAAI,EACnBL,EAAId,EAAUmB,GAAK,IAAI,CACzB,EACMC,EAAQ,CAACC,EAAWC,EAAe,IAAM,CAC7C7B,EAAM,KAAK4B,CAAC,EACZX,EAAIT,EAAWoB,EAAGC,CAAI,EACtB,EAAEhB,EACFC,EAAS,IAAIc,EAAGf,CAAW,CAC7B,EAEMiB,GAAW,CAACC,EAAgBC,IAAiB,CACjD/B,EAAiBU,EAAUoB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACT,EAAYU,IAAmB,CAC5C,GAAIV,IAAO,GACTG,EAAM,IAAK,CAAC,UACHH,IAAO,GAChBG,EAAM,OAAO1B,CAAc,EAAG,CAAC,UACtBuB,IAAO,GAAM,CACtB,GAAI,CAACW,EAAO/B,CAAG,EAAIW,EAAK,EACpBjB,EAAIA,EAAI,OAAS,CAAC,GAAK,MACzBA,EAAI,IAAI,EACRC,EAAK,IAAI,EACT,CAACoC,EAAO/B,CAAG,EAAI,CAACA,EAAK+B,CAAK,GAE5BR,EAAOvB,GAAO,OAAO+B,CAAK,EAAKnB,CAAM,CACvC,SAAWQ,IAAO,GAAM,CAEtB,GAAM,CAACY,EAAGC,CAAC,EAAItB,EAAK,EAChBjB,EAAIA,EAAI,OAAS,CAAC,GAAK,MACzBA,EAAI,IAAI,EACRC,EAAK,IAAI,GAEX4B,GAAOS,EAAIC,GAAKrB,CAAM,CACxB,SAAYQ,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAWS,KAAKH,GAAO,CAAC,EAAGN,EAAKA,GAAK,GAAM,OAAOS,CAAC,EACnD,GAAIT,GAAK,KAAM,CAObD,EAAMC,CAAC,EACPL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACA,IAAMpB,EAAMF,EAAYyB,CAAC,EACzB,GAAIvB,IAAQ,IAAMmB,GAAM,GAAM,CAC5B,IAAMc,EAAO9B,EAAU,IAAIoB,CAAC,GAAK,EACjC,GAAIvB,GAAO,GAAKiC,EAAM,CACpBhB,EAAId,EAAWoB,CAAC,EAChB,MACF,CACA,GAAIvB,GAAO,GAAKiC,EAAM,CACpBf,EAAO,GAAG,EACV,GAAM,CAACa,EAAGC,CAAC,EAAItB,EAAK,EACpBf,EAAM,KAAKqC,CAAC,EACZrC,EAAM,KAAKoC,CAAC,EACZX,EAAM,IAAI,EACVH,EAAId,EAAWoB,CAAC,EAChB,MACF,CACAD,EAAMC,EAAG,EAAE,EACXL,EAAO,IAAMlB,CAAG,EAChBoB,EAAM,IAAI,EACV,MACF,CACAE,EAAMC,CAAC,CACT,SAAWJ,IAAO,GAAM,CAEtB,IAAML,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B2B,EAAMzB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQQ,CAAK,EAAIxB,EAAK,EACvBI,EAAI,OAAOY,CAAM,EACvB7B,EAAI,IAAIiB,EAAGoB,EAAQvB,CAAM,EACzBc,GAASX,EAAG,EAAE,CAChB,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQS,CAAC,EAAIzB,EAAK,EACzBe,GAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWP,IAAO,KAEhBT,EAAK,EAEPQ,EAAOC,CAAE,EACTC,EAAMS,GAAO,IAAI,CACnB,EACMO,GAAaC,GAAM1C,EAAM,SAAS0C,CAAC,GAAKA,GAAK,KAAQA,GAAK,IAC1DlB,EAAMmB,GAAmBV,EAAMU,CAAM,EACrCC,EAASL,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUtC,EAAgB,OAAOgC,EAAM,EAAI,EAC5D,GAAIM,GAAS,IAAK,OAAON,EAAM,EAAI,EACnC,GAAI,CAACM,EAAO,OAAON,EAAM,GAAM,MAAS,EACxC,IAAIL,EAAI,OAAOW,CAAK,EAChBjD,EAAkB,CAAC,EACvB,KAAOsC,GACLtC,EAAM,QAAQ,OAAOsC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAO3C,EAAM,OAAQA,CAAK,CACzC,EACMuD,GAASjD,GAAoBqC,EAAM,GAAOrC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrEkD,GAAW,CAAC3D,EAAa4D,KAC5B5D,EAAI,MAAM,IAAI,OAAO4D,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAa3B,IAAwB0B,EAAK,KAAK,CAAE,EAAG,MAAO,EAAA1B,CAAE,CAAC,EAAGgB,EAAMhB,CAAC,GACxE4B,EAAanB,IAAmBiB,EAAK,KAAK,CAAE,EAAG,QAAS,EAAAjB,CAAE,CAAC,EAAGQ,GAAMR,CAAC,GACrEoB,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAGlC,EAAGkC,CAAC,GAC9Dd,EAAM,EAAE,EAER,QAASe,EAAO,EAAGA,EAAO9D,EAAG8D,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAIhE,EAAI,MAAM+D,EAAM,KAAK,IAAIA,EAAO,GAAI9D,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAMoD,EAAuC,CAAC,EAC9C,QAAS,EAAI,EAAG,EAAI,IAAM,CACxB,KAAO,EAAI,IAAMW,EAAK,CAAC,IAAM,GAAG,EAAE,EAClC,GAAI,GAAK,GAAI,MACb,IAAMR,EAAI,EACV,KAAO,EAAI,IAAMQ,EAAK,CAAC,IAAM,GAAG,EAAE,EAClCX,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACH,EAAI,OAAQ,SAGjB,IAAMY,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAC5BE,EAAa,GACjB,QAAW1B,KAAKwB,EAASE,EAAcA,GAAc,GAAM,OAAO1B,CAAC,EACnE,IAAM2B,EAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAUrE,GAAiBkF,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAIrD,EAAU,IAAIsC,CAAO,GACvB,GAAIe,EAAcpD,EAAc,IAAIqC,CAAO,EAAKiB,EAAW,CACzDT,EAAU9C,EAAU,IAAIsC,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACS/C,EAAc,IAAIqC,CAAO,GAAK,GAAI,CAC3C,IAAMkB,EAAYD,EAAY,EACxBnC,EAAOiB,GAAS3D,EAAK4D,CAAO,EAClCrC,EAAc,IAAIqC,EAASlB,EAAO,GAAKA,EAAOoC,EAAYA,EAAY,EAAE,EACxExD,EAAU,IAAIsC,EAASY,CAAI,CAC7B,EAKF,IAAMO,GAASjB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAC9C,GAAIZ,GAAUoB,CAAO,EACnBL,EAAUK,CAAO,UACRK,GAAQ,CACjB,OAAW,CAAE,EAAAd,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,SAAWK,GAAed,GAAWC,CAAG,EACtCO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,EAAE,IAAKJ,EAAK,CAC1B,IAAMkB,GAAW,GAAKd,GACtBG,EAAUI,EAAK,MAAMR,EAAGC,GAAI,CAAC,CAAC,EAC1Bc,GAAW,IACbZ,EAAUY,GAAW,CAAC,EACtBV,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEA3D,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTC,EAAiB,EACjBC,EAAM,IAAI,IAEV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKyB,CAAI,IAAMA,EAAO,GAAKzB,EAAM,IAAMA,IAAQ,KAAOA,IAAQ,IAAI,EAC3E,KAAK,CAACgC,EAAGC,IAAMvB,EAAS,IAAIuB,EAAE,CAAC,CAAC,EAAKvB,EAAS,IAAIsB,EAAE,CAAC,CAAC,CAAE,EACxD,OAAO,CAAC,CAAChC,EAAKoC,CAAC,IACP,OAAOpC,GAAQ,SAAW,OAAOA,CAAG,EAAIA,GAAO7B,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC6B,EAAKoC,CAAC,IAAM,CACrBI,EAAMxC,CAAG,CACX,CAAC,EACHwC,EAAM,EAAE,EAER,QAAWwB,KAAQd,EACbc,EAAK,IAAM,MAAOxB,EAAMwB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAASvB,GAAMuB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAM5C,EAAG4C,EAAK,CAAC,EAoBrC5C,EAAG,EAAI,EACPA,EAAG,EAAI,EACPoB,EAAMlD,EAAY,MAAM,EACxBkD,EAAMjD,CAAO,EAEb,IAAM0E,EAAgB,CAAC,EACvB,QAAS9E,EAAI,EAAGA,EAAIO,EAAI,OAAQ,EAAEP,EAChC8E,EAAI,KAAKvE,EAAIP,CAAC,CAAC,EACXO,EAAIP,CAAC,GAAK,IAAQO,EAAIP,CAAC,GAAK,KAAQQ,EAAKR,CAAC,GAAG8E,EAAI,KAAK,GAAGtE,EAAKR,CAAC,CAAE,EAMvE,MAAO,KAAOb,GAAiB,IAAI,WAAW2F,CAAG,CAAC,EAAI,0BACxD,EAEMzF,GAA2B,KAC3BC,EAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,EAAM,KAWCd,GAAgB,SAAUoG,EAAcC,EAAmB,CACtE,IAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAGlD,IAAMG,EAAQH,EAAQ,SAAS,CAAC,GAAKA,EAC/BI,EAAaJ,EAAQ,SAAS,CAAC,GAAK,SACpCK,EAAwBL,EAAQ,SAAS,CAAC,GAAK,CAAC,EAGhDnF,EAAMX,EAASiG,EAAM,MAAQ,IAAI,EACjCG,GAAgBH,EAAM,MAAQ,MAAM,OAC1C,GAAIG,EAAehG,IAA6B+F,EAAsB9F,CAAoB,EAAI,OAAOyF,EAErG,IAAMO,EAAgBJ,EAAM,IAAM,GAC5B1E,EAAO,KAAOZ,EAEd2F,EAAa,CAACP,GAAOK,EAAe,KACpCG,EAAMR,IAAQxF,GAAQ+F,EAAa,SAAO,YAAY/E,CAAI,EAAI,KAC9DiF,EAAKT,IAAQvF,GAAO8F,EAAa,SAAO,WAAW/E,CAAI,EAAI,KAC7DkF,EAAiBV,EAChBU,IACHA,EACEL,GAAgB,OAASA,EAAe,KAAQA,GAAgB,KAC5D9F,GACA8F,GAAgB,KAAQA,EAAe,KACrCG,EAAK,OAASC,EAAI,OAChBjG,EAEFC,GAGV,IAAIkG,EACAzF,EAEJ,GAAIwF,IAAmBnG,GACrBoG,EAAWvG,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAASqG,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmBlG,EACjCU,EAAW0F,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQhH,GAAe0G,CAAa,EAAIxG,GAAewG,CAAa,CACjF,CAGA,OADuBK,EAAS,OAASzF,EAAS,QAC5BmF,EAAqBN,EAEpC,CACL,GAAGA,EACH,OAAQ,CACN,CACE,GAAGG,EACH,GAAI5F,EACJ,KAAMY,CACR,EACAiF,EACA,CACE,GAAGC,EACH,CAAC9F,CAAoB,EAAG,CAAE,KAAMqG,CAAS,CAC3C,CACF,CACF,CACF,IC1bA,IAAAE,GAAA,GAAAC,GAAAD,GAAA,oBAAAE,GAAA,0BAAAC,KAAA,eAAAC,GAAAJ,IAAA,IAAAK,EAAiB,2BCAjB,IAAMC,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBC,GACpBC,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASR,GAAS,IAAIO,CAAG,EAK/B,GAJAL,EAAYA,IAAc,IAAUM,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDH,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMO,EAAS,KAAK,MAAMJ,EAAK,IAAc,EACvCK,EAAOJ,EAAiBG,CAAM,EAChCC,IAAS,SACXL,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUK,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIR,GAAaA,IAAc,IAAMG,GAAM,KAAM,CAC/C,IAAMM,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACN,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPG,EAAO,CACL,GAAGA,EACH,KAAMM,EACN,QAAS,CAAE,GAAIN,GAAQA,EAAK,QAAU,mBAAoBH,CAAU,CACtE,CACF,CACA,IAAMU,EAAW,MAAM,MAAML,EAAKF,CAAI,EAEtC,GAAIH,IAAc,KAAM,CACtB,IAAMW,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMb,GAAK,SAASa,CAAC,CAAC,EACjCd,GAAS,IAAIO,EAAKM,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMG,GAAwB,CACnCX,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAW,CAAc,IACtDb,GAAeC,EAAOC,EAAMW,CAAa,CAC3C,ED7GF,IAAMC,GAAO,CAACC,EAAUC,IACtB,OAAO,OAAOD,EAAK,CACjB,SAAU,IAAI,eAAe,CAC3B,MAAME,EAAO,CACX,OAAAD,EAAO,MAAMC,CAAK,EACX,QAAQ,QAAQ,CACzB,EACA,OAAQ,CACN,OAAAD,EAAO,IAAI,EACJ,QAAQ,QAAQ,CACzB,CACF,CAAC,EACD,SAAU,IAAI,eAAe,CAC3B,KAAM,QACN,MAAME,EAAM,CACVF,EAAO,GAAG,OAASC,GAAeC,EAAK,QAAQD,CAAK,CAAC,EACrDD,EAAO,KAAK,MAAO,IAAME,EAAK,MAAM,CAAC,CACvC,CACF,CAAC,CACH,CAAC,EAEE,WAAW,oBACd,WAAW,kBAAoB,KAAwB,CACrD,YAAYC,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAAS,EAAAI,QAAK,cAAc,EACnBD,IAAW,OACpBH,EAAS,EAAAI,QAAK,WAAW,EAChBD,IAAW,KACpBH,EAAS,EAAAI,QAAK,qBAAqB,EAEnCJ,EAAS,EAAAI,QAAK,iBAAiB,EAEjCN,GAAK,KAAME,CAAM,CACnB,CACF,GAGG,WAAW,sBACd,WAAW,oBAAsB,KAA0B,CACzD,YAAYG,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAAS,EAAAI,QAAK,cAAc,EACnBD,IAAW,OACpBH,EAAS,EAAAI,QAAK,aAAa,EAClBD,IAAW,KACpBH,EAAS,EAAAI,QAAK,uBAAuB,EAErCJ,EAAS,EAAAI,QAAK,iBAAiB,EAEjCN,GAAK,KAAME,CAAM,CACnB,CACF",
+  "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "import_solady", "MAX_160_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "_jitDecompressor", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "trackedMemSize", "mem", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "MASK32", "ctr", "m", "k", "delta", "inc", "dec", "pushOp", "op", "pushD", "d", "pushS", "v", "freq", "trackMem", "offset", "size", "addOp", "imm", "shift", "a", "b", "last", "value", "_", "isInStack", "w", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "base", "word", "literal", "literalCost", "literalVal", "baseBytes", "reuseCost", "byte8s", "suffix0s", "step", "out", "payload", "alg", "rpcMethod", "txObj", "blockParam", "existingStateOverride", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "index_node_exports", "__export", "compressModule", "compressModuleWithJIT", "__toCommonJS", "import_node_zlib", "_sup_enc", "_enc", "supported", "compressModule", "input", "init", "transformPayload", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compressModuleWithJIT", "compress_call", "make", "ctx", "handle", "chunk", "ctrl", "format", "zlib"]
 }

package/_cjs/jit-compressor.cjs

@@ -1,6 +1,6 @@
-var H=Object.defineProperty;var ft=Object.getOwnPropertyDescriptor;var ut=Object.getOwnPropertyNames;var lt=Object.prototype.hasOwnProperty;var bt=(n,r)=>{for(var c in r)H(n,c,{get:r[c],enumerable:!0})},at=(n,r,c,u)=>{if(r&&typeof r=="object"||typeof r=="function")for(let i of ut(r))!lt.call(n,i)&&i!==c&&H(n,i,{get:()=>r[i],enumerable:!(u=ft(r,i))||u.enumerable});return n};var gt=n=>at(H({},"__esModule",{value:!0}),n);var wt={};bt(wt,{compress_call:()=>dt,flzFwdBytecode:()=>st,jitBytecode:()=>xt,rleFwdBytecode:()=>rt});module.exports=gt(wt);var L=require("solady");const mt=(1n<<160n)-1n,d=n=>n.replace(/^0x/,"").toLowerCase(),ht=n=>{const r=d(n),c=r.length,u=new Uint8Array(c/2);for(let i=0;i<c;i+=2)u[i/2]=Number.parseInt(r.slice(i,i+2),16);return u},Y=n=>{let r="";for(let c=0;c<n.length;c++)r+=n[c].toString(16).padStart(2,"0");return r};//! @__PURE__
-const st=n=>`0x365f73${d(n)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;//! @__PURE__
-const rt=n=>`0x5f5f5b368110602d575f8083813473${d(n)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;//! @__PURE__
-const xt=function(n){return v("0x"+d(n))},v=function(n){const r=d(n),c=ht(r),u=28,i=new Uint8Array(u+c.length);i.set(c,u);const w=i.length;let l=[],h=[],b=[],M=new Map,x=0,g=new Map;const y=t=>{const e=b.lastIndexOf(t);return e===-1?-1:b.length-1-e},Z=new Map,U=new Map,O=new Map,F=new Map,D=new Map,ot=t=>t+31&-32;let $=0;const E=new Map,_=()=>[b.pop(),b.pop()],P=(1n<<256n)-1n,I=(t,e)=>t.set(e,(t.get(e)||0)+1),R=t=>{l.push(t),I(Z,t)},q=t=>{h.push(t||null),I(U,t||null)},C=t=>{b.push(t),I(O,t),I(M,t),++$,E.set(t,$)},W=(t,e)=>{x=ot(t+e)},z=(t,e)=>{if(t===89)C(BigInt(x));else if(t===27){const[s,f]=_();C(f<<s&P)}else if(t===23){const[s,f]=_();C((s|f)&P)}else if(t>=96&&t<=127||t===95){let s=0n;for(const a of e||[])s=s<<8n|BigInt(a);const f=y(s);if(C(s),f!==-1&&t!=95){M.get(s)*2<O.get(s)&&(R(128+f),q(null));return}if(s==224n){R(48),q(null);return}}else if(t===81){const s=Number(b.pop());C(g.has(s)?g.get(s):0n)}else if(t===82){const[s,f]=_(),a=Number(s);g.set(a,f&P),W(a,32)}else if(t===83){const[s,f]=_();W(Number(s),1)}else t===243&&_();R(t),q(e||null)},N=t=>z(t),B=t=>{if(t>0&&t===x)return z(89);if(!t)return z(95,void 0);let e=BigInt(t),s=[];for(;e;)s.unshift(Number(e&0xffn)),e>>=8n;return z(95+s.length,s)},X=t=>z(95+t.length,Array.from(t)),it=(t,e)=>(t.match(new RegExp(e,"g"))||[]).length,ct=t=>{let e=0,s=!0;for(const{s:f,e:a}of t)e+=1+a-f+1,31-a>0&&(e+=3),s||(e+=1),s=!1;return e},k=[],S=t=>(k.push({t:"num",v:t}),B(t)),G=t=>(k.push({t:"bytes",b:t}),X(t)),A=t=>(k.push({t:"op",o:t}),N(t));for(let t=0;t<w;t+=32){const e=new Uint8Array(32);e.set(i.slice(t,Math.min(t+32,w)),0);const s=[];for(let o=0;o<32;){for(;o<32&&e[o]===0;)++o;if(o>=32)break;const m=o;for(;o<32&&e[o]!==0;)++o;s.push({s:m,e:o-1})}if(!s.length)continue;if(s.every(({s:o,e:m})=>o===m)){for(const{s:o}of s)S(e[o]),S(t+o),A(83);continue}const a=e.slice(s[0].s),K=1+a.length,J=Math.ceil(Math.log2(t+1)/8),p=Y(e);if(K>8){if(F.has(p)){if(K>D.get(p)+J){S(F.get(p)),A(81),S(t),A(82);continue}}else if(D.get(p)!=-1){const o=J+3,m=it(r,p);D.set(p,m*32>m*o?o:-1),F.set(p,t)}}if(K<=ct(s))G(a);else{let o=!0;for(const{s:m,e:Q}of s){const V=31-Q;G(e.slice(m,Q+1)),V>0&&(S(V*8),A(27)),o||A(23),o=!1}}S(t),A(82)}l=[],h=[],b=[],x=0,g=new Map,Array.from(O.entries()).filter(([t,e])=>e>1&&t!==0n&&t!==224n).filter(([t,e])=>typeof t=="number"?t:Number(t)<=mt).sort((t,e)=>E.get(e[0])-E.get(t[0])).slice(0,14).forEach(([t,e])=>{B(t)}),M=new Map;for(const t of k)t.t==="num"?B(t.v):t.t==="bytes"?X(t.b):t.t==="op"&&N(t.o);N(95),N(95),B(c.length),B(u);const j=[];for(let t=0;t<l.length;++t)j.push(l[t]),l[t]>=96&&l[t]<=127&&h[t]&&j.push(...h[t]);return"0x"+Y(new Uint8Array(j))+"345f355af1503d5f5f3e3d5ff3"},pt=800,tt="0x00000000000000000000000000000000000000e0",et="jit",T="flz",nt="cd";//! @__PURE__
-const dt=function(n,r){const c=n.params?.[0]?.method||n.method;if(c&&c!=="eth_call")return n;const u=d(n.data||"0x"),i=(n.data||"0x").length;if(i<pt)return n;const w=n.to||"",l="0x"+u,h=!r&&i<1150,b=r===T||h?L.LibZip.flzCompress(l):null,M=r===nt||h?L.LibZip.cdCompress(l):null,x=r||(i>=1150?et:b.length<M.length?T:nt);let g,y;if(x===et)g=v(l),y="0x"+d(w).padStart(64,"0");else{const U=x===T;y=U?b:M,g=U?st(w):rt(w)}return g.length+y.length>=i?n:{...n,to:tt,data:y,stateDiff:{...n.stateDiff||{},[tt]:{code:g}}}};
+var Z=Object.defineProperty;var at=Object.getOwnPropertyDescriptor;var bt=Object.getOwnPropertyNames;var gt=Object.prototype.hasOwnProperty;var mt=(s,r)=>{for(var c in r)Z(s,c,{get:r[c],enumerable:!0})},ht=(s,r,c,u)=>{if(r&&typeof r=="object"||typeof r=="function")for(let f of bt(r))!gt.call(s,f)&&f!==c&&Z(s,f,{get:()=>r[f],enumerable:!(u=at(r,f))||u.enumerable});return s};var pt=s=>ht(Z({},"__esModule",{value:!0}),s);var yt={};mt(yt,{compress_call:()=>wt,flzFwdBytecode:()=>ot,jitBytecode:()=>Mt,rleFwdBytecode:()=>it});module.exports=pt(yt);var X=require("solady");const xt=(1n<<128n)-1n,y=s=>s.replace(/^0x/,"").toLowerCase(),dt=s=>{const r=y(s),c=r.length,u=new Uint8Array(c/2);for(let f=0;f<c;f+=2)u[f/2]=Number.parseInt(r.slice(f,f+2),16);return u},et=s=>{let r="";for(let c=0;c<s.length;c++)r+=s[c].toString(16).padStart(2,"0");return r};//! @__PURE__
+const ot=s=>`0x365f73${y(s)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;//! @__PURE__
+const it=s=>`0x5f5f5b368110602d575f8083813473${y(s)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;//! @__PURE__
+const Mt=function(s){return st("0x"+y(s))},st=function(s){const r=y(s),c=dt(r),u=28,f=new Uint8Array(u+c.length);f.set(c,u);const z=f.length;let a=[],l=[],b=[],h=0,M=new Map;const O=t=>{const n=b.lastIndexOf(t);return n===-1?-1:b.length-1-n},U=new Map,A=new Map,m=new Map,p=new Map,k=new Map,K=t=>t+31&-32;let G=0;const D=new Map,_=()=>[b.pop(),b.pop()],q=(1n<<256n)-1n,H=(t,n,e)=>t.set(n,(t.get(n)||0)+e),J=(t,n)=>H(t,n,1),Q=(t,n)=>H(t,n,-1),N=t=>{a.push(t),J(U,t)},E=t=>{l.push(t||null),J(A,t||null)},x=(t,n=1)=>{b.push(t),H(m,t,n),++G,D.set(t,G)},Y=(t,n)=>{h=K(t+n)},B=(t,n)=>{if(t===54)x(32n,0);else if(t===89)x(BigInt(h),0);else if(t===27){let[e,i]=_();a[a.length-1]==144&&(a.pop(),l.pop(),[e,i]=[i,e]),x(i<<BigInt(e)&q)}else if(t===23){const[e,i]=_();a[a.length-1]==144&&(a.pop(),l.pop()),x((e|i)&q)}else if(t>=96&&t<=127||t===95){let e=0n;for(const g of n||[])e=e<<8n|BigInt(g);if(e==224n){x(e),N(48),E(null);return}const i=O(e);if(i!==-1&&t!=95){const g=m.get(e)==0;if(i==0&&g){Q(m,e);return}if(i==1&&g){N(144);const[R,j]=_();b.push(j),b.push(R),E(null),Q(m,e);return}x(e,-1),N(128+i),E(null);return}x(e)}else if(t===81){const e=Number(b.pop());x(M.has(e)?M.get(e):0n)}else if(t===82){const[e,i]=_(),g=Number(e);M.set(g,i&q),Y(g,32)}else if(t===83){const[e,i]=_();Y(Number(e),1)}else t===243&&_();N(t),E(n||null)},ct=t=>b.includes(t)||t==224||t==32n,F=t=>B(t),S=t=>{if(t>0&&t===h)return B(89);if(t==32n)return B(54);if(!t)return B(95,void 0);let n=BigInt(t),e=[];for(;n;)e.unshift(Number(n&0xffn)),n>>=8n;return B(95+e.length,e)},v=t=>B(95+t.length,Array.from(t)),ft=(t,n)=>(t.match(new RegExp(n,"g"))||[]).length,lt=t=>{let n=0,e=!0;for(const{s:i,e:g}of t)n+=1+g-i+1,31-g>0&&(n+=3),e||(n+=1),e=!1;return n},P=[],I=t=>(P.push({t:"num",v:t}),S(t)),T=t=>(P.push({t:"bytes",b:t}),v(t)),C=t=>(P.push({t:"op",o:t}),F(t));S(1n);for(let t=0;t<z;t+=32){const n=new Uint8Array(32);n.set(f.slice(t,Math.min(t+32,z)),0);const e=[];for(let o=0;o<32;){for(;o<32&&n[o]===0;)++o;if(o>=32)break;const d=o;for(;o<32&&n[o]!==0;)++o;e.push({s:d,e:o-1})}if(!e.length)continue;const i=n.slice(e[0].s),g=1+i.length;let R=0n;for(const o of i)R=R<<8n|BigInt(o);const j=Math.ceil(Math.log2(t+1)/8),w=et(n);if(g>8){if(p.has(w)){if(g>k.get(w)+j){I(p.get(w)),C(81),I(t),C(82);continue}}else if(k.get(w)!=-1){const o=j+3,d=ft(r,w);k.set(w,d*32>d*o?o:-1),p.set(w,t)}}const ut=e.every(({s:o,e:d})=>o===d);if(ct(i))T(i);else if(ut){for(const{s:o}of e)I(n[o]),I(t+o),C(83);continue}else if(g<=lt(e))T(i);else{let o=!0;for(const{s:d,e:tt}of e){const nt=31-tt;T(n.slice(d,tt+1)),nt>0&&(I(nt*8),C(27)),o||C(23),o=!1}}I(t),C(82)}a=[],l=[],b=[],h=0,M=new Map,Array.from(m.entries()).filter(([t,n])=>n>1&&t>1n&&t!==32n&&t!==224n).sort((t,n)=>D.get(n[0])-D.get(t[0])).filter(([t,n])=>typeof t=="number"?BigInt(t):t<=xt).slice(0,13).forEach(([t,n])=>{S(t)}),S(1n);for(const t of P)t.t==="num"?S(t.v):t.t==="bytes"?v(t.b):t.t==="op"&&F(t.o);F(95),F(95),S(c.length),S(u);const L=[];for(let t=0;t<a.length;++t)L.push(a[t]),a[t]>=96&&a[t]<=127&&l[t]&&L.push(...l[t]);return"0x"+et(new Uint8Array(L))+"345f355af13d5f5f3e3d5ff3"},St=1150,$="0x00000000000000000000000000000000000000e0",rt="jit",V="flz",W="cd";//! @__PURE__
+const wt=function(s,r){const c=s.params?.[0]?.method||s.method;if(c&&c!=="eth_call")return s;const u=s.params?.[0]||s,f=s.params?.[1]||"latest",z=s.params?.[2]||{},a=y(u.data||"0x"),l=(u.data||"0x").length;if(l<St||z[$])return s;const b=u.to||"",h="0x"+a,M=!r&&l<1150,O=r===V||M?X.LibZip.flzCompress(h):null,U=r===W||M?X.LibZip.cdCompress(h):null;let A=r;A||(A=l>=1150&&(l<3e3||l>=8e3)?rt:l>=3e3&&l<8e3&&O.length<U.length?V:W);let m,p;if(A===rt)m=st(h),p="0x"+y(b).padStart(64,"0");else{const K=A===V;p=K?O:U,m=K?ot(b):it(b)}return m.length+p.length>=l?s:{...s,params:[{...u,to:$,data:p},f,{...z,[$]:{code:m}}]}};
 //# sourceMappingURL=jit-compressor.cjs.map