eth-compress 0.2.1 → 0.2.2

package/README.md

@@ -8,9 +8,9 @@ _Plug'n Play with viem & with a simple API_
 
 ### Scope
   - **Only read-only `eth_call`'s are considered**
-  - Compression is only attempted above a size threshold (currently 800 bytes), and only applied if it strictly reduces total request size.
-  - The transform re-targets the call through a decompressor contract and forwards calldata to the original `to` address.
-  - For reference: Large eth_call's >70kb at a <40% compression ratio result in roughly 30-40% latency reduction. (precise benefits largely depend on a variety of factors, non-the-less the said estimate is a sane projection for the average case)
+  - Compression is only attempted above a size threshold (currently 1150 bytes of JSON body for HTTP compression, and similarly gated for JIT calldata compression), and only applied if it strictly reduces total request size.
+  - The HTTP path uses standard `Content-Encoding` (e.g. gzip/deflate) negotiation; the EVM path rewrites eligible `eth_call`s through a transient decompressor contract and forwards calldata to the original `to` address via state overrides.
+  - For reference: Large `eth_call`s >70kb that compress to about **40% smaller payload size** (i.e. ~60% of the original bytes on the wire) can see roughly 30–40% latency reduction. (Precise benefits depend on many factors; this is a reasonable average-case projection.)
 
 ### Installation
 
@@ -18,9 +18,9 @@ _Plug'n Play with viem & with a simple API_
 npm i eth-compress
 ```
 ---
-### HTTP request compression
+### HTTP request compression (transport-level)
 
-`eth-compress` exposes a `fetch`-compatible function that transparently compresses JSON-RPC request bodies using standard HTTP content-encoding.
+`eth-compress` exposes a `fetch`-compatible function that transparently compresses JSON-RPC request bodies using the CompressionStreams API, when the target RPC endpoint supports it and the payload is large enough to benefit.
 
 ```ts
 import { compressModule } from 'eth-compress';
@@ -56,7 +56,7 @@ import { createPublicClient, http } from 'viem';
 import { base } from 'viem/chains';
 import { compressModule, compressModuleWithJIT } from 'eth-compress';
 
-// HTTP compression only
+// HTTP compression only (transport-level)
 const httpCompressedClient = createPublicClient({
   chain: base,
   transport: http(rpcUrl, {
@@ -64,7 +64,7 @@ const httpCompressedClient = createPublicClient({
   }),
 });
 
-// HTTP compression + eth_call JIT calldata compression
+// HTTP compression + optional eth_call JIT calldata compression (application-level)
 const jitCompressedClient = createPublicClient({
   chain: base,
   transport: http(rpcUrl, {
@@ -82,9 +82,9 @@ const jitCompressedClient = createPublicClient({
 
 ----
 
-### eth_call JIT calldata compression
+### eth_call JIT calldata compression (application-level)
 
-For backwards compatibility and immediate benefit, calldata compression is implemented on the application layer: requests are rewritten client-side and executed as usual by existing nodes.
+For backwards compatibility and immediate benefit, calldata compression is implemented purely at the application layer: requests are rewritten client-side and executed as usual by existing nodes, using a just-in-time compiled decompressor contract that is injected via `stateOverride`/`stateDiff`.
 The goal here is the same: **reduce request size -> latency** for large `eth_call` payloads, and secondarily to **stay under eth_call gas/memory limits** by reducing calldata size and gas footprint.
 
 ```ts
@@ -104,7 +104,7 @@ const payload = {
 const compressedPayload = compress_call(payload); // safe to send instead of `payload`
 ```
 
-`compress_call` can be used directly or via `compressModuleWithJIT` (which feeds it into `compressModule` as a payload transform).
+`compress_call` can be used directly or via `compressModuleWithJIT` (which feeds it into `compressModule` as a payload transform when HTTP content-encoding is not available for the target URL).
 For eligible `eth_call`s it chooses between:
 
 - **JIT**: Compiles just-in-time, a one-off decompressor contract that reconstructs calldata to forward the call.
@@ -112,11 +112,11 @@ For eligible `eth_call`s it chooses between:
 
 Selection logic (subject to change, but current behaviour):
 
-- **Size gating**:
-  - `< 1150 bytes`: no compression.
+- **Size gating (JIT / EVM path)**:
+  - `< 1150 bytes (effective payload)`: no EVM-level compression.
   - `≥ 1150 bytes`: compression considered.
-  - `3000 ≥ 1150 bytes or > 8000`: JIT is preferred.
-  - `8000 ≥ size ≥ 3000`: FastLZ or RLE.
+  - `size ≤ ~3000 bytes or > ~8000 bytes`: JIT is preferred.
+  - `~3000 ≤ size ≤ ~8000 bytes`: FastLZ or RLE.
 
 - **Algorithm choice**:
   - For mid-sized payloads, FLZ and CD are tried and the smaller output is chosen.
@@ -125,8 +125,22 @@ Selection logic (subject to change, but current behaviour):
   aiming to keep the total request size within the [Ethernet MTU](https://en.wikipedia.org/wiki/Maximum_transmission_unit).
 
 
+
+### Important considerations
+
+The JIT calldata compressor is **experimental** and targets efficient compression of **read-only `eth_call`s for auxiliary dApp data loaded in bulk** (e.g. dashboards, analytics, non-critical views). It is **not recommended** for on-chain deployment or for critical paths in dApp flows that directly influence user operations. For separation of concerns, it is recommended to initialize **one client for auxiliary data** (with JIT compression enabled) and **another client for user operations**, and perform a separate requests for user‑facing operations.
+
+
 ### 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 (-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%).
+- **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 (around 10–15% **smaller payloads**) for smaller calldata <3kb, and 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 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});
+var G=Object.defineProperty;var Ot=Object.getOwnPropertyDescriptor;var Pt=Object.getOwnPropertyNames;var qt=Object.prototype.hasOwnProperty;var dt=(s,n)=>()=>(s&&(n=s(s=0)),n);var ht=(s,n)=>{for(var f in n)G(s,f,{get:n[f],enumerable:!0})},zt=(s,n,f,l)=>{if(n&&typeof n=="object"||typeof n=="function")for(let o of Pt(n))!qt.call(s,o)&&o!==f&&G(s,o,{get:()=>n[o],enumerable:!(l=Ot(n,o))||l.enumerable});return s};var Et=s=>zt(G({},"__esModule",{value:!0}),s);var St={};ht(St,{compress_call:()=>Ht});var tt,Dt,w,D,Tt,pt,Q,Ft,Lt,Kt,xt,yt,wt,Bt,jt,Vt,Zt,It,Ht,Ct=dt(()=>{tt=require("solady"),Dt=(1n<<128n)-1n,w=(1n<<256n)-1n,D=s=>s.replace(/^0x/,"").toLowerCase(),Tt=s=>{let n=D(s),f=n.length,l=new Uint8Array(f/2);for(let o=0;o<f;o+=2)l[o/2]=Number.parseInt(n.slice(o,o+2),16);return l},pt=s=>{let n="";for(let f=0;f<s.length;f++)n+=s[f].toString(16).padStart(2,"0");return n},Q=s=>~s&w,Ft=(s,n)=>s&n&w,Lt=(s,n)=>(s|n)&w,Kt=(s,n)=>(s^n)&w,xt=(s,n)=>n<<s&w,yt=(s,n)=>n>>s&w,wt=(s,n)=>s-n&w,Bt=(s,n)=>{let f=Number(s)+1,l=(1n<<BigInt(f*8))-1n,o=1n<<BigInt(f*8-1),d=n&l;return(d&o?d|~l&w:d)&w};jt=s=>`0x365f73${D(s)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;Vt=s=>`0x5f5f5b368110602d575f8083813473${D(s)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`,Zt=function(s){let n=D(s),f=Tt(n),l=28,o=new Uint8Array(l+f.length);o.set(f,l);let d=o.length,h=[],g=[],a=[],M=0,B=new Map,k=!0,R=t=>{let i=a.lastIndexOf(t);return i=i===-1?-1:a.length-1-i,i>15?-1:i},T=new Map,nt=new Map,et=new Map,H=new Map,J=new Map,kt=t=>t+31&-32,st=0,Y=new Map,I=()=>[a.pop(),a.pop()],it=(t,i,e)=>t.set(i,(t.get(i)||0)+e),rt=(t,i)=>it(t,i,1),A=(t,i)=>{h.push(t),rt(T,t);let e=i??null;g.push(e),rt(nt,e)},b=(t,i=1)=>{a.push(t),it(et,t,i),++st,Y.set(t,st)},ot=(t,i)=>{M=kt(t+i)},P=(t,i)=>{if(t===54)b(32n,0);else if(t===89)b(BigInt(M),0);else if(t===11){let[e,c]=I();b(Bt(e,c),1)}else if(t===25){let e=a.pop();b(Q(e),0)}else if(t===24){let[e,c]=I();b(Kt(e,c),1)}else if(t===22){let[e,c]=I();b(Ft(e,c),1)}else if(t===3){let[e,c]=I();b(wt(e,c),1)}else if(t===27){let[e,c]=I();b(xt(e,c),1)}else if(t===28){let[e,c]=I();b(yt(e,c),1)}else if(t===23){let[e,c]=I();b(Lt(e,c),1)}else if(t>=96&&t<=127||t===95){let e=0n;for(let y of i||[])e=e<<8n|BigInt(y);if(e==224n){b(e,0),A(48);return}if(e==32n){b(e,0),A(54);return}if(e===BigInt(M)){b(e,0),A(89);return}let c=R(e);if(c!==-1&&t!=95){b(e,k?1:-1),A(128+c);return}if(e==w){b(e),A(95),A(25);return}b(e)}else if(t===81){let e=Number(a.pop());b(B.has(e)?B.get(e):0n)}else if(t===82){let[e,c]=I(),y=Number(e);B.set(y,c&w),ot(y,32)}else if(t===83){let[e,c]=I();ot(Number(e),1)}else t===243&&I();A(t,i||null)},j=t=>P(t),U=t=>{if(t>0&&t===M)return P(89);if(t==32n)return P(54);if(!t)return P(95,void 0);let i=BigInt(t),e=[];for(;i;)e.unshift(Number(i&0xffn)),i>>=8n;return P(95+e.length,e)},ct=t=>P(95+t.length,Array.from(t)),At=(t,i)=>(t.match(new RegExp(i,"g"))||[]).length,Ut=t=>{let i=0,e=!0;for(let{s:c,e:y}of t)i+=1+y-c+1,31-y>0&&(i+=3),e||(i+=1),e=!1;return i},V=[],m=t=>(V.push({t:"num",v:t}),U(t)),Z=t=>(V.push({t:"bytes",b:t}),ct(t)),p=t=>(V.push({t:"op",o:t}),j(t));U(1n);let W=[1n,32n,224n];for(let t=0;t<d;t+=32){let i=new Uint8Array(32);i.set(o.slice(t,Math.min(t+32,d)),0);let e=[];for(let r=0;r<32;){for(;r<32&&i[r]===0;)++r;if(r>=32)break;let x=r;for(;r<32&&i[r]!==0;)++r;e.push({s:x,e:r-1})}if(!e.length)continue;let c=i.slice(e[0].s),y=1+c.length,S=0n;for(let r of c)S=S<<8n|BigInt(r);let ft=Math.ceil(Math.log2(t+1)/8),N=pt(i),lt=Ut(e),ut=W.includes(S);if(ut){Z(c),m(t),p(82);continue}if(y>8){if(H.has(N)){if(y>J.get(N)+ft){m(H.get(N)),p(81),m(t),p(82);continue}}else if(J.get(N)!=-1){let r=ft+3,x=At(n,N);J.set(N,x*32>x*r?r:-1),H.set(N,t)}}let Nt=e.every(({s:r,e:x})=>r===x),at=e.length*3;if(ut)Z(c);else{let r=y,x=()=>{Z(c)};S==w&&(r=2,x=()=>{m($),p(25)});let $=Q(S),q=0,F=$;for(;F>0n;)++q,F>>=8n;q=1+q;let bt=q+1;bt<r&&(r=bt,x=()=>{m($),p(25)});let v=wt(0n,S),L=0;for(F=v;F>0n;)++L,F>>=8n;L===0&&(L=1),W.includes(v)&&(L=1);let gt=1+(1+L)+1;gt<r&&(r=gt,x=()=>{m(0),m(v),p(3)});for(let u=1;u<c.length;u++){let z=(1n<<BigInt(u*8))-1n,C=S&z,E=Bt(BigInt(u-1),C);if(E===S&&(C&1n<<BigInt(u*8-1))!==0n){let O=1+u;W.includes(BigInt(E))&&(O=1);let K=O+2+1;K<r&&(r=K,x=()=>{m(C),m(u-1),p(11)});break}}for(let u=8;u<=248;u+=8){let z=yt(BigInt(u),S);if(z===0n)break;let C=Q(z);if(xt(BigInt(u),C)===S){let O=0,K=C;for(;K>0n;)++O,K>>=8n;O===0&&(O=1);let mt=1+O+2+1+1;mt<r&&(r=mt,x=()=>{m(C),m(u),p(27),p(25)})}}if(Nt&&at<r&&at<=lt){for(let{s:u}of e)m(i[u]),m(t+u),p(83);continue}else if(lt<r){let u=!0;for(let{s:z,e:C}of e){let E=31-C;Z(i.slice(z,C+1)),E>0&&(m(E*8),p(27)),u||p(23),u=!1}}else x()}m(t),p(82)}h=[],g=[],a=[],M=0,B=new Map,Array.from(et.entries()).filter(([t,i])=>i>1&&t>1n&&t!==32n&&t!==224n).sort((t,i)=>Y.get(i[0])-Y.get(t[0])).filter(([t,i])=>typeof t=="number"?BigInt(t):t<=Dt).slice(0,15).forEach(([t,i])=>{U(t)}),U(1n);for(let t of V)t.t==="num"?U(t.v):t.t==="bytes"?ct(t.b):t.t==="op"&&j(t.o);j(95),j(95),U(f.length),U(l);let X=[];for(let t=0;t<h.length;++t)X.push(h[t]),h[t]>=96&&h[t]<=127&&g[t]&&X.push(...g[t]);return"0x"+pt(new Uint8Array(X))+"345f355af13d5f5f3e3d5ff3"},It="0x00000000000000000000000000000000000000e0";Ht=function(s,n){let{method:f,params:l}=s;if(f&&f!=="eth_call")return s;let o=l?.[0]||s,d=l?.[1],h=l?.[2];if(d&&d!=="latest"||h&&Object.keys(h).length>0||!o?.to||!o?.data||Object.keys(o).some(R=>!["to","data","from"].includes(R)))return s;let g=o.data.length;if(g<1150)return s;let a="0x"+D(o.data),M=o.to,B,k;if(n==="jit"||!n&&(g<3e3||g>=8e3))B=Zt(a),k="0x"+D(M).padStart(64,"0");else{let R=n==="flz"||!n?tt.LibZip.flzCompress(a):null,T=n==="cd"||!n&&R?tt.LibZip.cdCompress(a):null;n==="flz"||!n&&R&&(!T||R.length<T.length)?(k=R,B=jt(M)):(k=T,B=Vt(M))}return B.length+k.length>=g?s:{...s,params:[{...o,to:It,data:k},d||"latest",{...h,[It]:{code:B}}]}}});var Wt={};ht(Wt,{MIN_BODY_SIZE:()=>Mt,compressModule:()=>Rt,compressModuleWithJIT:()=>Yt});module.exports=Et(Wt);async function Rt(s,n,f){let l=typeof s=="string"?s:s instanceof URL?s.toString():s.url,o=_t.get(l);if(_=_===-1||o===-1?-1:o?.[0]??null,f&&n?.body&&typeof n.body=="string"&&(_===-1||_===null))try{let g=JSON.parse(n.body),a=f(g);a!==void 0&&(n={...n,body:JSON.stringify(a)})}catch{}let d=typeof n?.body=="string"?n.body:null;if(_&&_!==-1&&d&&d.length>=1150){let g=await new Response(new Blob([d]).stream().pipeThrough(new CompressionStream(_))).blob();n={...n,body:g,headers:{...n&&n.headers,"Content-Encoding":_}}}let h=await fetch(l,n);if(_===null){let g=h.headers.get("Accept-Encoding")?.split(",").filter(a=>Jt.includes(a));_t.set(l,g?.length?g:-1)}return h}var Mt,_t,Jt,_,Yt,Xt=dt(()=>{Mt=1150,_t=new Map,Jt=["deflate-raw","deflate","gzip"],_=typeof CompressionStream>"u"?-1:null;Yt=(s,n)=>Promise.resolve().then(()=>(Ct(),St)).then(({compress_call:f})=>Rt(s,n,f))});Xt();0&&(module.exports={MIN_BODY_SIZE,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 << 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"]
+  "sourcesContent": ["import { LibZip } from 'solady';\nimport { MIN_BODY_SIZE } from './index';\n\nconst MAX_128_BIT = (1n << 128n) - 1n;\nconst MAX_256_BIT = (1n << 256n) - 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\nconst not = (a: bigint): bigint => ~a & MAX_256_BIT;\nconst and = (a: bigint, b: bigint): bigint => a & b & MAX_256_BIT;\nconst or = (a: bigint, b: bigint): bigint => (a | b) & MAX_256_BIT;\nconst xor = (a: bigint, b: bigint): bigint => (a ^ b) & MAX_256_BIT;\nconst shl = (shift: bigint, value: bigint): bigint => (value << shift) & MAX_256_BIT;\nconst shr = (shift: bigint, value: bigint): bigint => (value >> shift) & MAX_256_BIT;\nconst sub = (a: bigint, b: bigint): bigint => (a - b) & MAX_256_BIT;\nconst sigext = (byteSize: bigint, value: bigint): bigint => {\n  const numBytes = Number(byteSize) + 1;\n  const mask = (1n << BigInt(numBytes * 8)) - 1n;\n  const signBit = 1n << BigInt(numBytes * 8 - 1);\n  const maskedVal = value & mask;\n  const extended = maskedVal & signBit ? maskedVal | (~mask & MAX_256_BIT) : maskedVal;\n  return extended & MAX_256_BIT;\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__\nconst 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__\nconst rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\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  let firstPass = true;\n  const getStackIdx = (val: bigint): number => {\n    let idx = stack.lastIndexOf(val);\n    idx = idx === -1 ? -1 : stack.length - 1 - idx;\n    return idx > 15 ? -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  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\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 pushOp = (op: number, d?: number[] | null) => {\n    ops.push(op);\n    inc(opFreq, op);\n    const imm = d ?? null;\n    data.push(imm);\n    inc(dataFreq, imm);\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 === 0x0b) {\n      // SIGNEXTEND\n      const [byteSize, val] = pop2();\n      pushS(sigext(byteSize, val), 1);\n    } else if (op === 0x19) {\n      // NOT\n      const val = stack.pop()!;\n      pushS(not(val), 0);\n    } else if (op === 0x18) {\n      // XOR\n      const [a, b] = pop2();\n      pushS(xor(a, b), 1);\n    } else if (op === 0x16) {\n      // AND\n      const [a, b] = pop2();\n      pushS(and(a, b), 1);\n    } else if (op === 0x03) {\n      // SUB\n      const [a, b] = pop2();\n      pushS(sub(a, b), 1);\n    } else if (op === 0x1b) {\n      // SHL\n      let [shift, val] = pop2();\n      pushS(shl(shift, val), 1);\n    } else if (op === 0x1c) {\n      // SHR\n      let [shift, val] = pop2();\n      pushS(shr(shift, val), 1);\n    } else if (op === 0x17) {\n      // OR\n      let [a, b] = pop2();\n      pushS(or(a, b), 1);\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        pushS(v, 0);\n        pushOp(0x30); // ADDRESS\n        return;\n      }\n      if (v == 32n) {\n        pushS(v, 0);\n        pushOp(0x36); // ADDRESS\n        return;\n      }\n      if (v === BigInt(trackedMemSize)) {\n        pushS(v, 0);\n        pushOp(0x59); // MemSize\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        let pushCtr = firstPass ? 1 : -1;\n        pushS(v, pushCtr);\n        pushOp(128 + idx);\n        return;\n      }\n      if (v == MAX_256_BIT) {\n        pushS(v);\n        pushOp(0x5f); // 0\n        pushOp(0x19); // NOT\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 & MAX_256_BIT);\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, imm || null);\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 == 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  const _stack = [1n, 32n, 224n];\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    const shlCost = estShlCost(seg);\n\n    const inStack = _stack.includes(literalVal);\n    if (inStack) {\n      emitPushB(literal);\n      emitPushN(base);\n      emitOp(0x52); // MSTORE\n      continue;\n    }\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    const byte8s = seg.every(({ s, e }) => s === e);\n    const byte8sCost = seg.length * 3; // each: PUSH1 (value), PUSH1 (offset), MSTORE8\n    if (inStack) {\n      emitPushB(literal);\n    } else {\n      // Aggregate all costs\n      let bestCost = literalCost;\n      let bestEmit: (() => void) | null = () => {\n        emitPushB(literal);\n      };\n      if (literalVal == MAX_256_BIT) {\n        bestCost = 2;\n        bestEmit = () => {\n          emitPushN(notVal);\n          emitOp(0x19);\n        };\n      }\n      // Try NOT: PUSH<n> ~val, NOT\n      const notVal = not(literalVal);\n      let notBytes = 0;\n      let tmp = notVal;\n      while (tmp > 0n) {\n        ++notBytes;\n        tmp >>= 8n;\n      }\n      notBytes = 1 + notBytes;\n      if (notBytes === 0) notBytes;\n      const notCost = notBytes + 1; // PUSH<n> + NOT\n      if (notCost < bestCost) {\n        bestCost = notCost;\n        bestEmit = () => {\n          emitPushN(notVal);\n          emitOp(0x19);\n        };\n      }\n\n      // Try SUB: PUSH1 0, PUSH<n> val, SUB\n      const subVal = sub(0n, literalVal);\n      let subBytes = 0;\n      tmp = subVal;\n      while (tmp > 0n) {\n        ++subBytes;\n        tmp >>= 8n;\n      }\n      if (subBytes === 0) subBytes = 1;\n      if (_stack.includes(subVal)) subBytes = 1;\n      const subCost = 1 + (1 + subBytes) + 1; // PUSH0 + PUSH<n> + SUB\n      if (subCost < bestCost) {\n        bestCost = subCost;\n        bestEmit = () => {\n          emitPushN(0);\n          emitPushN(subVal);\n          emitOp(0x03);\n        };\n      }\n\n      // Try SIGNEXTEND: PUSH<n> truncated, PUSH1 byteSize, SIGNEXTEND\n      for (let numBytes = 1; numBytes < literal.length; numBytes++) {\n        const mask = (1n << BigInt(numBytes * 8)) - 1n;\n        const truncated = literalVal & mask;\n        const extended = sigext(BigInt(numBytes - 1), truncated);\n        if (extended === literalVal && (truncated & (1n << BigInt(numBytes * 8 - 1))) !== 0n) {\n          let trueByteCost = 1 + numBytes;\n          if (_stack.includes(BigInt(extended))) trueByteCost = 1;\n          let signCost = trueByteCost + (1 + 1) + 1; // PUSH<n> + PUSH1 + SIGNEXTEND\n          if (signCost < bestCost) {\n            bestCost = signCost;\n            bestEmit = () => {\n              emitPushN(truncated);\n              emitPushN(numBytes - 1);\n              emitOp(0x0b);\n            };\n          }\n          break;\n        }\n      }\n\n      // Try SHIFT+NOT: PUSH<n> val, PUSH1 shift, SHL, NOT\n      for (let shiftBits = 8; shiftBits <= 248; shiftBits += 8) {\n        const shifted = shr(BigInt(shiftBits), literalVal);\n        if (shifted === 0n) break;\n\n        const notShifted = not(shifted);\n        const reconstructed = shl(BigInt(shiftBits), notShifted);\n\n        if (reconstructed === literalVal) {\n          let shiftedBytes = 0;\n          let tmpShifted = notShifted;\n          while (tmpShifted > 0n) {\n            ++shiftedBytes;\n            tmpShifted >>= 8n;\n          }\n          if (shiftedBytes === 0) shiftedBytes = 1;\n          const shiftNotCost = 1 + shiftedBytes + 2 + 1 + 1; // PUSH<n> + PUSH1 + SHL + NOT\n          if (shiftNotCost < bestCost) {\n            bestCost = shiftNotCost;\n            bestEmit = () => {\n              emitPushN(notShifted);\n              emitPushN(shiftBits);\n              emitOp(0x1b); // SHL\n              emitOp(0x19); // NOT\n            };\n          }\n        }\n      }\n\n      if (byte8s && byte8sCost < bestCost && byte8sCost <= shlCost) {\n        for (const { s } of seg) {\n          emitPushN(word[s]);\n          emitPushN(base + s);\n          emitOp(0x53); // MSTORE8\n        }\n        continue; // Skip the single MSTORE at the end\n      } else if (shlCost < bestCost) {\n        // Use SHL/OR\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      } else {\n        bestEmit!();\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_128_BIT;\n    })\n    .slice(0, 15)\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 DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\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 *\n * Only applies compression to calls that:\n * - target the latest block ID\n * - have no state overrides\n * - have a target address and calldata\n * - have no other properties (nonce, gas, etc.)\n *\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 { method, params } = payload;\n  if (method && method !== 'eth_call') return payload;\n  const txObj = params?.[0] || payload;\n  const blockParam = params?.[1];\n  const overrides = params?.[2];\n\n  // Validation\n  if (\n    (blockParam && blockParam !== 'latest') ||\n    (overrides && Object.keys(overrides).length > 0) ||\n    !txObj?.to ||\n    !txObj?.data ||\n    Object.keys(txObj).some((k) => !['to', 'data', 'from'].includes(k))\n  ) {\n    return payload;\n  }\n\n  const originalSize = txObj.data.length;\n  if (originalSize < MIN_BODY_SIZE) return payload;\n\n  const inputData = '0x' + _normHex(txObj.data);\n  const to = txObj.to;\n\n  // Determine compression method and generate bytecode/calldata\n  let bytecode: string;\n  let calldata: string;\n\n  if (alg === 'jit' || (!alg && (originalSize < 3000 || originalSize >= 8000))) {\n    bytecode = _jitDecompressor(inputData);\n    calldata = '0x' + _normHex(to).padStart(64, '0');\n  } else {\n    // Need FLZ and/or CD compression\n    const flzData = alg === 'flz' || !alg ? LibZip.flzCompress(inputData) : null;\n    const cdData = alg === 'cd' || (!alg && flzData) ? LibZip.cdCompress(inputData) : null;\n\n    // Pick the best or requested one\n    const useFlz =\n      alg === 'flz' || (!alg && flzData && (!cdData || flzData.length < cdData.length));\n\n    if (useFlz) {\n      calldata = flzData!;\n      bytecode = flzFwdBytecode(to);\n    } else {\n      calldata = cdData!;\n      bytecode = rleFwdBytecode(to);\n    }\n  }\n\n  // Skip if not beneficial\n  if (bytecode.length + calldata.length >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      { ...txObj, to: DECOMPRESSOR_ADDRESS, data: calldata },\n      blockParam || 'latest',\n      { ...overrides, [DECOMPRESSOR_ADDRESS]: { code: bytecode } },\n    ],\n  };\n};\n", "export const MIN_BODY_SIZE = 1150;\n\nconst _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  const bodyStr = typeof init?.body === 'string' ? (init.body as string) : null;\n\n  if (supported && supported !== -1 && bodyStr && bodyStr.length >= MIN_BODY_SIZE) {\n    const compressed = await new Response(\n      new Blob([bodyStr])\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,KAAA,IAAAC,GAGMC,GACAC,EAEAC,EAEAC,GAUAC,GAQAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAgBAC,GAUAC,GAGAC,GA6aAC,GAkBOlB,GA7fbmB,GAAAC,GAAA,KAAAnB,GAAuB,kBAGjBC,IAAe,IAAM,MAAQ,GAC7BC,GAAe,IAAM,MAAQ,GAE7BC,EAAYiB,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEhB,GAAoBgB,GAA4B,CACpD,IAAMC,EAAalB,EAASiB,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,EAEMlB,GAAoBkB,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,EAEMd,EAAOmB,GAAsB,CAACA,EAAIvB,EAClCK,GAAM,CAACkB,EAAWC,IAAsBD,EAAIC,EAAIxB,EAChDM,GAAK,CAACiB,EAAWC,KAAuBD,EAAIC,GAAKxB,EACjDO,GAAM,CAACgB,EAAWC,KAAuBD,EAAIC,GAAKxB,EAClDQ,GAAM,CAACiB,EAAeC,IAA2BA,GAASD,EAASzB,EACnES,GAAM,CAACgB,EAAeC,IAA2BA,GAASD,EAASzB,EACnEU,GAAM,CAACa,EAAWC,IAAuBD,EAAIC,EAAKxB,EAClDW,GAAS,CAACgB,EAAkBD,IAA0B,CAC1D,IAAME,EAAW,OAAOD,CAAQ,EAAI,EAC9BE,GAAQ,IAAM,OAAOD,EAAW,CAAC,GAAK,GACtCE,EAAU,IAAM,OAAOF,EAAW,EAAI,CAAC,EACvCG,EAAYL,EAAQG,EAE1B,OADiBE,EAAYD,EAAUC,EAAa,CAACF,EAAO7B,EAAe+B,GACzD/B,CACpB,EASMY,GAAkBoB,GACtB,WAAW/B,EAAS+B,CAAO,CAAC,iYASxBnB,GAAkBmB,GACtB,mCAAmC/B,EAAS+B,CAAO,CAAC,qLAEhDlB,GAAmB,SAAUmB,EAA0B,CAC3D,IAAMf,EAAMjB,EAASgC,CAAQ,EACvBC,EAAchC,GAAiBgB,CAAG,EAOlCiB,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,IACVC,EAAY,GACVC,EAAeC,GAAwB,CAC3C,IAAIC,EAAMN,EAAM,YAAYK,CAAG,EAC/B,OAAAC,EAAMA,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,EACpCA,EAAM,GAAK,GAAKA,CACzB,EAEMC,EAAS,IAAI,IACbC,GAAW,IAAI,IACfC,GAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAExCC,GAAc,EACZC,EAAW,IAAI,IACfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAM,CAAIC,EAAmBC,EAAMC,IAAkBF,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAKC,CAAK,EACrFC,GAAM,CAAIH,EAAmBC,IAASF,GAAIC,EAAGC,EAAG,CAAC,EACjDG,EAAS,CAACC,EAAYC,IAAwB,CAClD1B,EAAI,KAAKyB,CAAE,EACXF,GAAId,EAAQgB,CAAE,EACd,IAAME,EAAMD,GAAK,KACjBzB,EAAK,KAAK0B,CAAG,EACbJ,GAAIb,GAAUiB,CAAG,CACnB,EACMC,EAAQ,CAACC,EAAWC,EAAe,IAAM,CAC7C5B,EAAM,KAAK2B,CAAC,EACZV,GAAIR,GAAWkB,EAAGC,CAAI,EACtB,EAAEd,GACFC,EAAS,IAAIY,EAAGb,EAAW,CAC7B,EAEMe,GAAW,CAACC,EAAgBC,IAAiB,CACjD9B,EAAiBW,GAAUkB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACT,EAAYE,IAAmB,CAC5C,GAAIF,IAAO,GACTG,EAAM,IAAK,CAAC,UACHH,IAAO,GAChBG,EAAM,OAAOzB,CAAc,EAAG,CAAC,UACtBsB,IAAO,GAAM,CAEtB,GAAM,CAACpC,EAAUkB,CAAG,EAAIW,EAAK,EAC7BU,EAAMvD,GAAOgB,EAAUkB,CAAG,EAAG,CAAC,CAChC,SAAWkB,IAAO,GAAM,CAEtB,IAAMlB,EAAML,EAAM,IAAI,EACtB0B,EAAM9D,EAAIyC,CAAG,EAAG,CAAC,CACnB,SAAWkB,IAAO,GAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAM3D,GAAIgB,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,GAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAM7D,GAAIkB,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,EAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAMxD,GAAIa,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,GAAM,CAEtB,GAAI,CAACtC,EAAOoB,CAAG,EAAIW,EAAK,EACxBU,EAAM1D,GAAIiB,EAAOoB,CAAG,EAAG,CAAC,CAC1B,SAAWkB,IAAO,GAAM,CAEtB,GAAI,CAACtC,EAAOoB,CAAG,EAAIW,EAAK,EACxBU,EAAMzD,GAAIgB,EAAOoB,CAAG,EAAG,CAAC,CAC1B,SAAWkB,IAAO,GAAM,CAEtB,GAAI,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EAClBU,EAAM5D,GAAGiB,EAAGC,CAAC,EAAG,CAAC,CACnB,SAAYuC,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAW3C,KAAKyC,GAAO,CAAC,EAAGE,EAAKA,GAAK,GAAM,OAAO3C,CAAC,EACnD,GAAI2C,GAAK,KAAM,CACbD,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,GAAIK,GAAK,IAAK,CACZD,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,GAAIK,IAAM,OAAO1B,CAAc,EAAG,CAChCyB,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,IAAMhB,EAAMF,EAAYuB,CAAC,EACzB,GAAIrB,IAAQ,IAAMiB,GAAM,GAAM,CAE5BG,EAAMC,EADQxB,EAAY,EAAI,EACd,EAChBmB,EAAO,IAAMhB,CAAG,EAChB,MACF,CACA,GAAIqB,GAAKnE,EAAa,CACpBkE,EAAMC,CAAC,EACPL,EAAO,EAAI,EACXA,EAAO,EAAI,EACX,MACF,CACAI,EAAMC,CAAC,CACT,SAAWJ,IAAO,GAAM,CAEtB,IAAMJ,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B0B,EAAMxB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWI,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQ5C,CAAK,EAAI8B,EAAK,EACvBG,EAAI,OAAOW,CAAM,EACvB5B,EAAI,IAAIiB,EAAGjC,EAAQ1B,CAAW,EAC9BqE,GAASV,EAAG,EAAE,CAChB,SAAWI,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQG,CAAC,EAAIjB,EAAK,EACzBa,GAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWP,IAAO,KAEhBP,EAAK,EAEPM,EAAOC,EAAIE,GAAO,IAAI,CACxB,EACMF,EAAMW,GAAmBF,EAAME,CAAM,EACrCC,EAASjD,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUe,EAAgB,OAAO+B,EAAM,EAAI,EAC5D,GAAI9C,GAAS,IAAK,OAAO8C,EAAM,EAAI,EACnC,GAAI,CAAC9C,EAAO,OAAO8C,EAAM,GAAM,MAAS,EACxC,IAAIL,EAAI,OAAOzC,CAAK,EAChBL,EAAkB,CAAC,EACvB,KAAO8C,GACL9C,EAAM,QAAQ,OAAO8C,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAOnD,EAAM,OAAQA,CAAK,CACzC,EACMuD,GAASxC,GAAoBoC,EAAM,GAAOpC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrEyC,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,EAAanB,IAAwBkB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAlB,CAAE,CAAC,EAAGQ,EAAMR,CAAC,GACxEoB,EAAa/D,IAAmB6D,EAAK,KAAK,CAAE,EAAG,QAAS,EAAA7D,CAAE,CAAC,EAAGoD,GAAMpD,CAAC,GACrEgE,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG1B,EAAG0B,CAAC,GAC9Dd,EAAM,EAAE,EAER,IAAMe,EAAS,CAAC,GAAI,IAAK,IAAI,EAC7B,QAASC,EAAO,EAAGA,EAAOtD,EAAGsD,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAIxD,EAAI,MAAMuD,EAAM,KAAK,IAAIA,EAAO,GAAItD,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAM2C,EAAuC,CAAC,EAC9C,QAAS1D,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAMsE,EAAKtE,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAM6D,EAAI7D,EACV,KAAOA,EAAI,IAAMsE,EAAKtE,CAAC,IAAM,GAAG,EAAEA,EAClC0D,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG7D,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAAC0D,EAAI,OAAQ,SAGjB,IAAMa,EAAUD,EAAK,MAAMZ,EAAI,CAAC,EAAE,CAAC,EAC7Bc,EAAc,EAAID,EAAQ,OAC5BE,EAAa,GACjB,QAAWvE,KAAKqE,EAASE,EAAcA,GAAc,GAAM,OAAOvE,CAAC,EACnE,IAAMwE,GAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7Cb,EAAU3E,GAAiByF,CAAI,EAC/BK,GAAUlB,GAAWC,CAAG,EAExBkB,GAAUR,EAAO,SAASK,CAAU,EAC1C,GAAIG,GAAS,CACXX,EAAUM,CAAO,EACjBP,EAAUK,CAAI,EACdH,EAAO,EAAI,EACX,QACF,CACA,GAAIM,EAAc,GAChB,GAAI5C,EAAU,IAAI4B,CAAO,GACvB,GAAIgB,EAAc3C,EAAc,IAAI2B,CAAO,EAAKkB,GAAW,CACzDV,EAAUpC,EAAU,IAAI4B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUK,CAAI,EACdH,EAAO,EAAI,EACX,QACF,UACSrC,EAAc,IAAI2B,CAAO,GAAK,GAAI,CAC3C,IAAMqB,EAAYH,GAAY,EACxB5B,EAAOS,GAAS3D,EAAK4D,CAAO,EAClC3B,EAAc,IAAI2B,EAASV,EAAO,GAAKA,EAAO+B,EAAYA,EAAY,EAAE,EACxEjD,EAAU,IAAI4B,EAASa,CAAI,CAC7B,EAGF,IAAMS,GAASpB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EACxCiB,GAAarB,EAAI,OAAS,EAChC,GAAIkB,GACFX,EAAUM,CAAO,MACZ,CAEL,IAAIS,EAAWR,EACXS,EAAgC,IAAM,CACxChB,EAAUM,CAAO,CACnB,EACIE,GAAc/F,IAChBsG,EAAW,EACXC,EAAW,IAAM,CACfjB,EAAUkB,CAAM,EAChBhB,EAAO,EAAI,CACb,GAGF,IAAMgB,EAASpG,EAAI2F,CAAU,EACzBU,EAAW,EACXC,EAAMF,EACV,KAAOE,EAAM,IACX,EAAED,EACFC,IAAQ,GAEVD,EAAW,EAAIA,EAEf,IAAME,GAAUF,EAAW,EACvBE,GAAUL,IACZA,EAAWK,GACXJ,EAAW,IAAM,CACfjB,EAAUkB,CAAM,EAChBhB,EAAO,EAAI,CACb,GAIF,IAAMoB,EAASlG,GAAI,GAAIqF,CAAU,EAC7Bc,EAAW,EAEf,IADAH,EAAME,EACCF,EAAM,IACX,EAAEG,EACFH,IAAQ,GAENG,IAAa,IAAGA,EAAW,GAC3BnB,EAAO,SAASkB,CAAM,IAAGC,EAAW,GACxC,IAAMC,GAAU,GAAK,EAAID,GAAY,EACjCC,GAAUR,IACZA,EAAWQ,GACXP,EAAW,IAAM,CACfjB,EAAU,CAAC,EACXA,EAAUsB,CAAM,EAChBpB,EAAO,CAAI,CACb,GAIF,QAAS5D,EAAW,EAAGA,EAAWiE,EAAQ,OAAQjE,IAAY,CAC5D,IAAMC,GAAQ,IAAM,OAAOD,EAAW,CAAC,GAAK,GACtCmF,EAAYhB,EAAalE,EACzBmF,EAAWrG,GAAO,OAAOiB,EAAW,CAAC,EAAGmF,CAAS,EACvD,GAAIC,IAAajB,IAAegB,EAAa,IAAM,OAAOnF,EAAW,EAAI,CAAC,KAAQ,GAAI,CACpF,IAAIqF,EAAe,EAAIrF,EACnB8D,EAAO,SAAS,OAAOsB,CAAQ,CAAC,IAAGC,EAAe,GACtD,IAAIC,EAAWD,EAAgB,EAAS,EACpCC,EAAWZ,IACbA,EAAWY,EACXX,EAAW,IAAM,CACfjB,EAAUyB,CAAS,EACnBzB,EAAU1D,EAAW,CAAC,EACtB4D,EAAO,EAAI,CACb,GAEF,KACF,CACF,CAGA,QAAS2B,EAAY,EAAGA,GAAa,IAAKA,GAAa,EAAG,CACxD,IAAMC,EAAU3G,GAAI,OAAO0G,CAAS,EAAGpB,CAAU,EACjD,GAAIqB,IAAY,GAAI,MAEpB,IAAMC,EAAajH,EAAIgH,CAAO,EAG9B,GAFsB5G,GAAI,OAAO2G,CAAS,EAAGE,CAAU,IAEjCtB,EAAY,CAChC,IAAIuB,EAAe,EACfC,EAAaF,EACjB,KAAOE,EAAa,IAClB,EAAED,EACFC,IAAe,GAEbD,IAAiB,IAAGA,EAAe,GACvC,IAAME,GAAe,EAAIF,EAAe,EAAI,EAAI,EAC5CE,GAAelB,IACjBA,EAAWkB,GACXjB,EAAW,IAAM,CACfjB,EAAU+B,CAAU,EACpB/B,EAAU6B,CAAS,EACnB3B,EAAO,EAAI,EACXA,EAAO,EAAI,CACb,EAEJ,CACF,CAEA,GAAIY,IAAUC,GAAaC,GAAYD,IAAcJ,GAAS,CAC5D,OAAW,CAAE,EAAAd,CAAE,IAAKH,EAClBM,EAAUM,EAAKT,CAAC,CAAC,EACjBG,EAAUK,EAAOR,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,SAAWS,GAAUK,EAAU,CAE7B,IAAIpB,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,IAAMyC,EAAW,GAAKrC,EACtBG,EAAUK,EAAK,MAAMT,EAAGC,EAAI,CAAC,CAAC,EAC1BqC,EAAW,IACbnC,EAAUmC,EAAW,CAAC,EACtBjC,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,MACEqB,EAAU,CAEd,CACAjB,EAAUK,CAAI,EACdH,EAAO,EAAI,CACb,CAEAlD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTC,EAAiB,EACjBC,EAAM,IAAI,IAEV,MAAM,KAAKO,GAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKuB,CAAI,IAAMA,EAAO,GAAKvB,EAAM,IAAMA,IAAQ,KAAOA,IAAQ,IAAI,EAC3E,KAAK,CAACtB,EAAGC,IAAM+B,EAAS,IAAI/B,EAAE,CAAC,CAAC,EAAK+B,EAAS,IAAIhC,EAAE,CAAC,CAAC,CAAE,EACxD,OAAO,CAAC,CAACsB,EAAK4B,CAAC,IACP,OAAO5B,GAAQ,SAAW,OAAOA,CAAG,EAAIA,GAAO9C,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC8C,EAAK4B,CAAC,IAAM,CACrBE,EAAM9B,CAAG,CACX,CAAC,EACH8B,EAAM,EAAE,EAER,QAAW+C,KAAQrC,EACbqC,EAAK,IAAM,MAAO/C,EAAM+C,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAS9C,GAAM8C,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAM3D,EAAG2D,EAAK,CAAC,EAoBrC3D,EAAG,EAAI,EACPA,EAAG,EAAI,EACPY,EAAMzC,EAAY,MAAM,EACxByC,EAAMxC,CAAO,EAEb,IAAMwF,EAAgB,CAAC,EACvB,QAASrG,EAAI,EAAGA,EAAIgB,EAAI,OAAQ,EAAEhB,EAChCqG,EAAI,KAAKrF,EAAIhB,CAAC,CAAC,EACXgB,EAAIhB,CAAC,GAAK,IAAQgB,EAAIhB,CAAC,GAAK,KAAQiB,EAAKjB,CAAC,GAAGqG,EAAI,KAAK,GAAGpF,EAAKjB,CAAC,CAAE,EAMvE,MAAO,KAAOnB,GAAiB,IAAI,WAAWwH,CAAG,CAAC,EAAI,0BACxD,EAEM5G,GAAuB,6CAkBhBlB,GAAgB,SAAU+H,EAAcC,EAAmB,CACtE,GAAM,CAAE,OAAAC,EAAQ,OAAAC,CAAO,EAAIH,EAC3B,GAAIE,GAAUA,IAAW,WAAY,OAAOF,EAC5C,IAAMI,EAAQD,IAAS,CAAC,GAAKH,EACvBK,EAAaF,IAAS,CAAC,EACvBG,EAAYH,IAAS,CAAC,EAG5B,GACGE,GAAcA,IAAe,UAC7BC,GAAa,OAAO,KAAKA,CAAS,EAAE,OAAS,GAC9C,CAACF,GAAO,IACR,CAACA,GAAO,MACR,OAAO,KAAKA,CAAK,EAAE,KAAMrE,GAAM,CAAC,CAAC,KAAM,OAAQ,MAAM,EAAE,SAASA,CAAC,CAAC,EAElE,OAAOiE,EAGT,IAAMO,EAAeH,EAAM,KAAK,OAChC,GAAIG,EAAe,KAAe,OAAOP,EAEzC,IAAMQ,EAAY,KAAOnI,EAAS+H,EAAM,IAAI,EACtCK,EAAKL,EAAM,GAGbM,EACArG,EAEJ,GAAI4F,IAAQ,OAAU,CAACA,IAAQM,EAAe,KAAQA,GAAgB,KACpEG,EAAWxH,GAAiBsH,CAAS,EACrCnG,EAAW,KAAOhC,EAASoI,CAAE,EAAE,SAAS,GAAI,GAAG,MAC1C,CAEL,IAAME,EAAUV,IAAQ,OAAS,CAACA,EAAM,UAAO,YAAYO,CAAS,EAAI,KAClEI,EAASX,IAAQ,MAAS,CAACA,GAAOU,EAAW,UAAO,WAAWH,CAAS,EAAI,KAIhFP,IAAQ,OAAU,CAACA,GAAOU,IAAY,CAACC,GAAUD,EAAQ,OAASC,EAAO,SAGzEvG,EAAWsG,EACXD,EAAW1H,GAAeyH,CAAE,IAE5BpG,EAAWuG,EACXF,EAAWzH,GAAewH,CAAE,EAEhC,CAGA,OAAIC,EAAS,OAASrG,EAAS,QAAUkG,EAAqBP,EAEvD,CACL,GAAGA,EACH,OAAQ,CACN,CAAE,GAAGI,EAAO,GAAIjH,GAAsB,KAAMkB,CAAS,EACrDgG,GAAc,SACd,CAAE,GAAGC,EAAW,CAACnH,EAAoB,EAAG,CAAE,KAAMuH,CAAS,CAAE,CAC7D,CACF,CACF,ICzjBA,IAAAG,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,0BAAAC,KAAA,eAAAC,GAAAL,IA+BA,eAAsBG,GACpBG,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASC,GAAS,IAAIF,CAAG,EAK/B,GAJAG,EAAYA,IAAc,IAAUF,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDK,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMC,EAAS,KAAK,MAAMN,EAAK,IAAc,EACvCO,EAAON,EAAiBK,CAAM,EAChCC,IAAS,SACXP,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUO,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,IAAMC,EAAU,OAAOR,GAAM,MAAS,SAAYA,EAAK,KAAkB,KAEzE,GAAIK,GAAaA,IAAc,IAAMG,GAAWA,EAAQ,QAAU,KAAe,CAC/E,IAAMC,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACD,CAAO,CAAC,EACf,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPL,EAAO,CACL,GAAGA,EACH,KAAMS,EACN,QAAS,CAAE,GAAIT,GAAQA,EAAK,QAAU,mBAAoBK,CAAU,CACtE,CACF,CACA,IAAMK,EAAW,MAAM,MAAMR,EAAKF,CAAI,EAEtC,GAAIK,IAAc,KAAM,CACtB,IAAMM,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMC,GAAK,SAASD,CAAC,CAAC,EACjCR,GAAS,IAAIF,EAAKS,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAtFA,IAAaf,GAEPS,GACAS,GACFR,EA0GSR,GA9GbiB,GAAAC,GAAA,KAAapB,GAAgB,KAEvBS,GAAW,IAAI,IACfS,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CR,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA0GvER,GAAwB,CACnCE,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAgB,CAAc,IACtDpB,GAAeG,EAAOC,EAAMgB,CAAa,CAC3C",
+  "names": ["jit_compressor_exports", "__export", "compress_call", "import_solady", "MAX_128_BIT", "MAX_256_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "not", "and", "or", "xor", "shl", "shr", "sub", "sigext", "flzFwdBytecode", "rleFwdBytecode", "_jitDecompressor", "DECOMPRESSOR_ADDRESS", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "a", "b", "shift", "value", "byteSize", "numBytes", "mask", "signBit", "maskedVal", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "trackedMemSize", "mem", "firstPass", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "ctr", "m", "k", "delta", "inc", "pushOp", "op", "d", "imm", "pushS", "v", "freq", "trackMem", "offset", "size", "addOp", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "_stack", "base", "word", "literal", "literalCost", "literalVal", "baseBytes", "shlCost", "inStack", "reuseCost", "byte8s", "byte8sCost", "bestCost", "bestEmit", "notVal", "notBytes", "tmp", "notCost", "subVal", "subBytes", "subCost", "truncated", "extended", "trueByteCost", "signCost", "shiftBits", "shifted", "notShifted", "shiftedBytes", "tmpShifted", "shiftNotCost", "suffix0s", "step", "out", "payload", "alg", "method", "params", "txObj", "blockParam", "overrides", "originalSize", "inputData", "to", "bytecode", "flzData", "cdData", "index_exports", "__export", "MIN_BODY_SIZE", "compressModule", "compressModuleWithJIT", "__toCommonJS", "input", "init", "transformPayload", "url", "cached", "_sup_enc", "supported", "parsed", "next", "bodyStr", "compressed", "response", "encodings", "e", "_enc", "init_index", "__esmMin", "compress_call"]
 }

package/_cjs/index.node.cjs

@@ -1,3 +1,3 @@
-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});
+var Nt=Object.create;var H=Object.defineProperty;var qt=Object.getOwnPropertyDescriptor;var Tt=Object.getOwnPropertyNames;var Et=Object.getPrototypeOf,Ft=Object.prototype.hasOwnProperty;var pt=(n,e)=>()=>(n&&(e=n(n=0)),e);var ht=(n,e)=>{for(var r in e)H(n,r,{get:e[r],enumerable:!0})},xt=(n,e,r,f)=>{if(e&&typeof e=="object"||typeof e=="function")for(let c of Tt(e))!Ft.call(n,c)&&c!==r&&H(n,c,{get:()=>e[c],enumerable:!(f=qt(e,c))||f.enumerable});return n};var Lt=(n,e,r)=>(r=n!=null?Nt(Et(n)):{},xt(e||!n||!n.__esModule?H(r,"default",{value:n,enumerable:!0}):r,n)),jt=n=>xt(H({},"__esModule",{value:!0}),n);var Mt={};ht(Mt,{compress_call:()=>Gt});var et,Kt,w,E,Vt,yt,tt,Zt,vt,Ht,wt,Bt,St,It,Jt,Wt,Yt,Ct,Gt,Rt=pt(()=>{et=require("solady"),Kt=(1n<<128n)-1n,w=(1n<<256n)-1n,E=n=>n.replace(/^0x/,"").toLowerCase(),Vt=n=>{let e=E(n),r=e.length,f=new Uint8Array(r/2);for(let c=0;c<r;c+=2)f[c/2]=Number.parseInt(e.slice(c,c+2),16);return f},yt=n=>{let e="";for(let r=0;r<n.length;r++)e+=n[r].toString(16).padStart(2,"0");return e},tt=n=>~n&w,Zt=(n,e)=>n&e&w,vt=(n,e)=>(n|e)&w,Ht=(n,e)=>(n^e)&w,wt=(n,e)=>e<<n&w,Bt=(n,e)=>e>>n&w,St=(n,e)=>n-e&w,It=(n,e)=>{let r=Number(n)+1,f=(1n<<BigInt(r*8))-1n,c=1n<<BigInt(r*8-1),d=e&f;return(d&c?d|~f&w:d)&w};Jt=n=>`0x365f73${E(n)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;Wt=n=>`0x5f5f5b368110602d575f8083813473${E(n)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`,Yt=function(n){let e=E(n),r=Vt(e),f=28,c=new Uint8Array(f+r.length);c.set(r,f);let d=c.length,p=[],g=[],u=[],M=0,B=new Map,A=!0,k=t=>{let i=u.lastIndexOf(t);return i=i===-1?-1:u.length-1-i,i>15?-1:i},F=new Map,nt=new Map,st=new Map,J=new Map,W=new Map,Dt=t=>t+31&-32,rt=0,Y=new Map,S=()=>[u.pop(),u.pop()],it=(t,i,s)=>t.set(i,(t.get(i)||0)+s),ot=(t,i)=>it(t,i,1),z=(t,i)=>{p.push(t),ot(F,t);let s=i??null;g.push(s),ot(nt,s)},b=(t,i=1)=>{u.push(t),it(st,t,i),++rt,Y.set(t,rt)},ct=(t,i)=>{M=Dt(t+i)},O=(t,i)=>{if(t===54)b(32n,0);else if(t===89)b(BigInt(M),0);else if(t===11){let[s,l]=S();b(It(s,l),1)}else if(t===25){let s=u.pop();b(tt(s),0)}else if(t===24){let[s,l]=S();b(Ht(s,l),1)}else if(t===22){let[s,l]=S();b(Zt(s,l),1)}else if(t===3){let[s,l]=S();b(St(s,l),1)}else if(t===27){let[s,l]=S();b(wt(s,l),1)}else if(t===28){let[s,l]=S();b(Bt(s,l),1)}else if(t===23){let[s,l]=S();b(vt(s,l),1)}else if(t>=96&&t<=127||t===95){let s=0n;for(let y of i||[])s=s<<8n|BigInt(y);if(s==224n){b(s,0),z(48);return}if(s==32n){b(s,0),z(54);return}if(s===BigInt(M)){b(s,0),z(89);return}let l=k(s);if(l!==-1&&t!=95){b(s,A?1:-1),z(128+l);return}if(s==w){b(s),z(95),z(25);return}b(s)}else if(t===81){let s=Number(u.pop());b(B.has(s)?B.get(s):0n)}else if(t===82){let[s,l]=S(),y=Number(s);B.set(y,l&w),ct(y,32)}else if(t===83){let[s,l]=S();ct(Number(s),1)}else t===243&&S();z(t,i||null)},V=t=>O(t),D=t=>{if(t>0&&t===M)return O(89);if(t==32n)return O(54);if(!t)return O(95,void 0);let i=BigInt(t),s=[];for(;i;)s.unshift(Number(i&0xffn)),i>>=8n;return O(95+s.length,s)},lt=t=>O(95+t.length,Array.from(t)),Pt=(t,i)=>(t.match(new RegExp(i,"g"))||[]).length,Ut=t=>{let i=0,s=!0;for(let{s:l,e:y}of t)i+=1+y-l+1,31-y>0&&(i+=3),s||(i+=1),s=!1;return i},Z=[],m=t=>(Z.push({t:"num",v:t}),D(t)),v=t=>(Z.push({t:"bytes",b:t}),lt(t)),h=t=>(Z.push({t:"op",o:t}),V(t));D(1n);let G=[1n,32n,224n];for(let t=0;t<d;t+=32){let i=new Uint8Array(32);i.set(c.slice(t,Math.min(t+32,d)),0);let s=[];for(let o=0;o<32;){for(;o<32&&i[o]===0;)++o;if(o>=32)break;let x=o;for(;o<32&&i[o]!==0;)++o;s.push({s:x,e:o-1})}if(!s.length)continue;let l=i.slice(s[0].s),y=1+l.length,I=0n;for(let o of l)I=I<<8n|BigInt(o);let ft=Math.ceil(Math.log2(t+1)/8),P=yt(i),at=Ut(s),ut=G.includes(I);if(ut){v(l),m(t),h(82);continue}if(y>8){if(J.has(P)){if(y>W.get(P)+ft){m(J.get(P)),h(81),m(t),h(82);continue}}else if(W.get(P)!=-1){let o=ft+3,x=Pt(e,P);W.set(P,x*32>x*o?o:-1),J.set(P,t)}}let Ot=s.every(({s:o,e:x})=>o===x),bt=s.length*3;if(ut)v(l);else{let o=y,x=()=>{v(l)};I==w&&(o=2,x=()=>{m($),h(25)});let $=tt(I),N=0,L=$;for(;L>0n;)++N,L>>=8n;N=1+N;let gt=N+1;gt<o&&(o=gt,x=()=>{m($),h(25)});let Q=St(0n,I),j=0;for(L=Q;L>0n;)++j,L>>=8n;j===0&&(j=1),G.includes(Q)&&(j=1);let mt=1+(1+j)+1;mt<o&&(o=mt,x=()=>{m(0),m(Q),h(3)});for(let a=1;a<l.length;a++){let q=(1n<<BigInt(a*8))-1n,C=I&q,T=It(BigInt(a-1),C);if(T===I&&(C&1n<<BigInt(a*8-1))!==0n){let U=1+a;G.includes(BigInt(T))&&(U=1);let K=U+2+1;K<o&&(o=K,x=()=>{m(C),m(a-1),h(11)});break}}for(let a=8;a<=248;a+=8){let q=Bt(BigInt(a),I);if(q===0n)break;let C=tt(q);if(wt(BigInt(a),C)===I){let U=0,K=C;for(;K>0n;)++U,K>>=8n;U===0&&(U=1);let dt=1+U+2+1+1;dt<o&&(o=dt,x=()=>{m(C),m(a),h(27),h(25)})}}if(Ot&&bt<o&&bt<=at){for(let{s:a}of s)m(i[a]),m(t+a),h(83);continue}else if(at<o){let a=!0;for(let{s:q,e:C}of s){let T=31-C;v(i.slice(q,C+1)),T>0&&(m(T*8),h(27)),a||h(23),a=!1}}else x()}m(t),h(82)}p=[],g=[],u=[],M=0,B=new Map,Array.from(st.entries()).filter(([t,i])=>i>1&&t>1n&&t!==32n&&t!==224n).sort((t,i)=>Y.get(i[0])-Y.get(t[0])).filter(([t,i])=>typeof t=="number"?BigInt(t):t<=Kt).slice(0,15).forEach(([t,i])=>{D(t)}),D(1n);for(let t of Z)t.t==="num"?D(t.v):t.t==="bytes"?lt(t.b):t.t==="op"&&V(t.o);V(95),V(95),D(r.length),D(f);let X=[];for(let t=0;t<p.length;++t)X.push(p[t]),p[t]>=96&&p[t]<=127&&g[t]&&X.push(...g[t]);return"0x"+yt(new Uint8Array(X))+"345f355af13d5f5f3e3d5ff3"},Ct="0x00000000000000000000000000000000000000e0";Gt=function(n,e){let{method:r,params:f}=n;if(r&&r!=="eth_call")return n;let c=f?.[0]||n,d=f?.[1],p=f?.[2];if(d&&d!=="latest"||p&&Object.keys(p).length>0||!c?.to||!c?.data||Object.keys(c).some(k=>!["to","data","from"].includes(k)))return n;let g=c.data.length;if(g<1150)return n;let u="0x"+E(c.data),M=c.to,B,A;if(e==="jit"||!e&&(g<3e3||g>=8e3))B=Yt(u),A="0x"+E(M).padStart(64,"0");else{let k=e==="flz"||!e?et.LibZip.flzCompress(u):null,F=e==="cd"||!e&&k?et.LibZip.cdCompress(u):null;e==="flz"||!e&&k&&(!F||k.length<F.length)?(A=k,B=Jt(M)):(A=F,B=Wt(M))}return B.length+A.length>=g?n:{...n,params:[{...c,to:Ct,data:A},d||"latest",{...p,[Ct]:{code:B}}]}}});async function kt(n,e,r){let f=typeof n=="string"?n:n instanceof URL?n.toString():n.url,c=_t.get(f);if(R=R===-1||c===-1?-1:c?.[0]??null,r&&e?.body&&typeof e.body=="string"&&(R===-1||R===null))try{let g=JSON.parse(e.body),u=r(g);u!==void 0&&(e={...e,body:JSON.stringify(u)})}catch{}let d=typeof e?.body=="string"?e.body:null;if(R&&R!==-1&&d&&d.length>=1150){let g=await new Response(new Blob([d]).stream().pipeThrough(new CompressionStream(R))).blob();e={...e,body:g,headers:{...e&&e.headers,"Content-Encoding":R}}}let p=await fetch(f,e);if(R===null){let g=p.headers.get("Accept-Encoding")?.split(",").filter(u=>$t.includes(u));_t.set(f,g?.length?g:-1)}return p}var Xt,_t,$t,R,Qt,At=pt(()=>{Xt=1150,_t=new Map,$t=["deflate-raw","deflate","gzip"],R=typeof CompressionStream>"u"?-1:null;Qt=(n,e)=>Promise.resolve().then(()=>(Rt(),Mt)).then(({compress_call:r})=>kt(n,e,r))});var te={};ht(te,{MIN_BODY_SIZE:()=>Xt,compressModule:()=>kt,compressModuleWithJIT:()=>Qt});module.exports=jt(te);var _=Lt(require("node:zlib"),1);At();var zt=(n,e)=>Object.assign(n,{writable:new WritableStream({write(r){return e.write(r),Promise.resolve()},close(){return e.end(),Promise.resolve()}}),readable:new ReadableStream({type:"bytes",start(r){e.on("data",f=>r.enqueue(f)),e.once("end",()=>r.close())}})});globalThis.CompressionStream||(globalThis.CompressionStream=class{constructor(e){let r;e==="deflate"?r=_.default.createDeflate():e==="gzip"?r=_.default.createGzip():e==="br"?r=_.default.createBrotliCompress():r=_.default.createDeflateRaw(),zt(this,r)}});globalThis.DecompressionStream||(globalThis.DecompressionStream=class{constructor(e){let r;e==="deflate"?r=_.default.createInflate():e==="gzip"?r=_.default.createGunzip():e==="br"?r=_.default.createBrotliDecompress():r=_.default.createInflateRaw(),zt(this,r)}});0&&(module.exports={MIN_BODY_SIZE,compressModule,compressModuleWithJIT});
 //! @__PURE__
 //# sourceMappingURL=index.node.cjs.map