eth-compress 0.2.0 → 0.2.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (16) hide show
  1. package/README.md +6 -6
  2. package/_cjs/index.cjs +1 -1
  3. package/_cjs/index.cjs.map +3 -3
  4. package/_cjs/index.node.cjs +1 -1
  5. package/_cjs/index.node.cjs.map +3 -3
  6. package/_cjs/jit-compressor.cjs +5 -5
  7. package/_cjs/jit-compressor.cjs.map +3 -3
  8. package/_esm/index.js +1 -1
  9. package/_esm/index.js.map +3 -3
  10. package/_esm/index.node.js +1 -1
  11. package/_esm/index.node.js.map +3 -3
  12. package/_esm/jit-compressor.js +5 -5
  13. package/_esm/jit-compressor.js.map +3 -3
  14. package/_types/jit-compressor.d.ts.map +1 -1
  15. package/jit-compressor.ts +105 -60
  16. package/package.json +11 -10
package/_cjs/jit-compressor.cjs.map CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "version": 3,
3
3
  "sources": ["../../src/jit-compressor.ts"],
4
- "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 160n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n const normalized = _normHex(hex);\n const len = normalized.length;\n const bytes = new Uint8Array(len / 2);\n for (let i = 0; i < len; i += 2) {\n bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n }\n return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += bytes[i].toString(16).padStart(2, '0');\n }\n return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n const hex = _normHex(calldata);\n const originalBuf = _hexToUint8Array(hex);\n\n // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n // so that everything after the selector is reconstructed on mostly\n // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n // calldata reconstruction) 32\u2011byte aligned in memory.\n // That way we avoid encoding offsets for writes (most of the time),\n const padding = 28;\n const buf = new Uint8Array(padding + originalBuf.length);\n buf.set(originalBuf, padding);\n\n const n = buf.length;\n\n let ops: number[] = [];\n let data: (number[] | null)[] = [];\n let stack: bigint[] = [];\n let stackFreq2 = new Map<bigint, number>();\n let trackedMemSize = 0;\n let mem = new Map<number, bigint>();\n const getStackIdx = (val: bigint): number => {\n const idx = stack.lastIndexOf(val);\n return idx === -1 ? -1 : stack.length - 1 - idx;\n };\n\n const opFreq = new Map<number, number>();\n const dataFreq = new Map<number[] | null, number>();\n const stackFreq = new Map<bigint, number>();\n const wordCache = new Map<string, number>();\n const wordCacheCost = new Map<string, number>();\n const roundUp32 = (x: number) => (x + 31) & ~31;\n\n let pushCounter = 0;\n const stackCnt = new Map<bigint, number>();\n\n const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n const MASK32 = (1n << 256n) - 1n;\n\n const bump = <K>(m: Map<K, number>, k: K) => m.set(k, (m.get(k) || 0) + 1);\n const pushOp = (op: number) => {\n ops.push(op);\n bump(opFreq, op);\n };\n const pushD = (d: number[] | null) => {\n data.push(d || null);\n bump(dataFreq, d || null);\n };\n const pushS = (v: bigint) => {\n stack.push(v);\n bump(stackFreq, v);\n bump(stackFreq2, v);\n ++pushCounter;\n stackCnt.set(v, pushCounter);\n };\n\n const trackMem = (offset: number, size: number) => {\n trackedMemSize = roundUp32(offset + size);\n };\n\n const addOp = (op: number, imm?: number[]) => {\n if (op === 0x59) {\n pushS(BigInt(trackedMemSize));\n } else if (op === 0x1b) {\n // SHL\n const [shift, val] = pop2();\n pushS((val << shift) & MASK32);\n } else if (op === 0x17) {\n // OR\n const [a, b] = pop2();\n pushS((a | b) & MASK32);\n } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n // PUSH\n let v = 0n;\n for (const b of imm || []) v = (v << 8n) | BigInt(b);\n const idx = getStackIdx(v);\n pushS(v);\n if (idx !== -1 && op != 0x5f) {\n if (stackFreq2.get(v)! * 2 < stackFreq.get(v)!) {\n pushOp(128 + idx);\n pushD(null);\n }\n return;\n }\n if (v == 224n) {\n // Special\u2011case the literal 0xe0 (224):\n // the decompressor is always deployed at 0x...00e0, so the final\n // byte of ADDRESS is exactly 0xe0. Since we must send our own\n // address with the eth_call anyway, we can synthesize this value \n // with a single opcode instead of encoding a literal, effectively\n // giving us one more hot constant slot on the stack.\n pushOp(0x30); // ADDRESS\n pushD(null);\n return;\n }\n } else if (op === 0x51) {\n // MLOAD\n const k = Number(stack.pop()!);\n pushS(mem.has(k) ? mem.get(k)! : 0n);\n } else if (op === 0x52) {\n // MSTORE\n const [offset, value] = pop2();\n const k = Number(offset);\n mem.set(k, value & MASK32);\n trackMem(k, 32);\n } else if (op === 0x53) {\n // MSTORE8\n const [offset, _] = pop2();\n trackMem(Number(offset), 1);\n } else if (op === 0xf3) {\n // RETURN\n pop2();\n }\n pushOp(op);\n pushD(imm || null);\n };\n\n const op = (opcode: number) => addOp(opcode);\n const pushN = (value: number | bigint) => {\n if (value > 0 && value === trackedMemSize) return addOp(0x59);\n if (!value) return addOp(0x5f, undefined); // PUSH0\n let v = BigInt(value);\n let bytes: number[] = [];\n while (v) {\n bytes.unshift(Number(v & 0xffn));\n v >>= 8n;\n }\n return addOp(0x5f + bytes.length, bytes);\n };\n const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n const cntWords = (hex: string, wordHex: string) =>\n (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n // Rough cost model\n const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n let cost = 0;\n let first = true;\n for (const { s, e } of seg) {\n cost += 1 + e - s + 1; // PUSH segLen bytes\n if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n if (!first) cost += 1; // OR\n first = false;\n }\n return cost;\n };\n\n type PlanStep =\n | { t: 'num'; v: number | bigint }\n | { t: 'bytes'; b: Uint8Array }\n | { t: 'op'; o: number };\n\n const plan: PlanStep[] = [];\n const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n\n // First pass: decide how to build each 32-byte word without emitting bytecode\n for (let base = 0; base < n; base += 32) {\n const word = new Uint8Array(32);\n word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n const seg: Array<{ s: number; e: number }> = [];\n for (let i = 0; i < 32; ) {\n while (i < 32 && word[i] === 0) ++i;\n if (i >= 32) break;\n const s = i;\n while (i < 32 && word[i] !== 0) ++i;\n seg.push({ s, e: i - 1 });\n }\n\n if (!seg.length) continue;\n\n const byte8s = seg.every(({ s, e }) => s === e);\n if (byte8s) {\n for (const { s } of seg) {\n emitPushN(word[s]);\n emitPushN(base + s);\n emitOp(0x53); // MSTORE8\n }\n continue;\n }\n\n // Decide whether to build this word via SHL/OR or as a single literal word\n const literal = word.slice(seg[0].s);\n const literalCost = 1 + literal.length;\n\n const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n const wordHex = _uint8ArrayToHex(word);\n if (literalCost > 8) {\n if (wordCache.has(wordHex)) {\n if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n emitPushN(wordCache.get(wordHex)!);\n emitOp(0x51);\n emitPushN(base);\n emitOp(0x52); // MSTORE\n continue;\n }\n } else if (wordCacheCost.get(wordHex) != -1) {\n const reuseCost = baseBytes + 3;\n const freq = cntWords(hex, wordHex);\n wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n wordCache.set(wordHex, base);\n }\n }\n\n if (literalCost <= estShlCost(seg)) {\n emitPushB(literal);\n } else {\n let first = true;\n for (const { s, e } of seg) {\n const suffix0s = 31 - e;\n emitPushB(word.slice(s, e + 1));\n if (suffix0s > 0) {\n emitPushN(suffix0s * 8);\n emitOp(0x1b); // SHL\n }\n if (!first) emitOp(0x17); // OR\n first = false;\n }\n }\n emitPushN(base);\n emitOp(0x52); // MSTORE\n }\n\n ops = [];\n data = [];\n stack = [];\n trackedMemSize = 0;\n mem = new Map();\n\n // Pre 2nd pass. Push most frequent literals into stack.\n Array.from(stackFreq.entries())\n .filter(([val, freq]) => freq > 1 && val !== 0n && val !== 224n)\n .filter(([val, _]) => {\n return typeof val === 'number' ? val : Number(val) <= MAX_160_BIT;\n })\n .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n .slice(0, 14)\n .forEach(([val, _]) => {\n pushN(val);\n });\n\n stackFreq2 = new Map();\n // Second pass: emit ops and track mem/stack\n for (const step of plan) {\n if (step.t === 'num') pushN(step.v);\n else if (step.t === 'bytes') pushB(step.b);\n else if (step.t === 'op') op(step.o);\n }\n\n // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n //\n // Opcodes breakdown:\n // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n // - pushN(originalBuf.length): argsSize = actual data length\n // - pushN(padding): argsOffset (skip leading alignment bytes)\n // - 0x34: CALLVALUE (value)\n // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n // - 0x5a: GAS (remaining gas)\n // - 0xf1: CALL\n // - 0x50: POP (discard success value)\n //\n // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n //\n // RETURN(offset=0, size=RETURNDATASIZE):\n // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n op(0x5f); // PUSH0 (retSize)\n op(0x5f); // PUSH0 (retOffset)\n pushN(originalBuf.length); // argsSize = actual data length\n pushN(padding); // argsOffset = padding\n\n const out: number[] = [];\n for (let i = 0; i < ops.length; ++i) {\n out.push(ops[i]);\n if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n }\n\n // - CALLVALUE, load target address from calldata[0], GAS, CALL\n // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n // - RETURN(0, RETURNDATASIZE)\n return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af1503d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 800;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n const rpcMethod = payload.params?.[0]?.method || payload.method;\n if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n const hex = _normHex(payload.data || '0x');\n const originalSize = (payload.data || '0x').length;\n if (originalSize < MIN_SIZE_FOR_COMPRESSION) return payload;\n\n const targetAddress = payload.to || '';\n const data = '0x' + hex;\n\n const autoSelect = !alg && originalSize < 1150;\n const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n\n const selectedMethod =\n alg || (originalSize >= 1150 ? _jit : flz!.length < cd!.length ? _flz : _cd);\n\n let bytecode: string;\n let calldata: string;\n\n if (selectedMethod === _jit) {\n bytecode = _jitDecompressor(data);\n calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n } else {\n const isFlz = selectedMethod === _flz;\n calldata = isFlz ? flz! : cd!;\n bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n }\n\n const compressedSize = bytecode.length + calldata.length;\n if (compressedSize >= originalSize) return payload;\n\n return {\n ...payload,\n to: DECOMPRESSOR_ADDRESS,\n data: calldata,\n stateDiff: {\n ...(payload.stateDiff || {}),\n [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n },\n };\n};\n"],
5
- "mappings": "saAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,eAAAC,GAAAN,IAAA,IAAAO,EAAuB,kBAEvB,MAAMC,IAAe,IAAM,MAAQ,GAE7BC,EAAYC,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEC,GAAoBD,GAA4B,CACpD,MAAME,EAAaH,EAASC,CAAG,EACzBG,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAAS,EAAI,EAAG,EAAIA,EAAK,GAAK,EAC5BC,EAAM,EAAI,CAAC,EAAI,OAAO,SAASF,EAAW,MAAM,EAAG,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOE,CACT,EAEMC,EAAoBD,GAA8B,CACtD,IAAIJ,EAAM,GACV,QAASM,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAChCN,GAAOI,EAAME,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAON,CACT,EAQA;AACO,MAAMP,GAAkBc,GAC7B,WAAWR,EAASQ,CAAO,CAAC,iYAQ9B;AACO,MAAMZ,GAAkBY,GAC7B,mCAAmCR,EAASQ,CAAO,CAAC,qLAOtD;AACO,MAAMb,GAAc,SAAUc,EAA0B,CAC7D,OAAOC,EAAiB,KAAOV,EAASS,CAAQ,CAAC,CACnD,EAEMC,EAAmB,SAAUD,EAA0B,CAC3D,MAAMR,EAAMD,EAASS,CAAQ,EACvBE,EAAcT,GAAiBD,CAAG,EAOlCW,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,MAAME,EAAID,EAAI,OAEd,IAAIE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAa,IAAI,IACjBC,EAAiB,EACjBC,EAAM,IAAI,IACd,MAAMC,EAAeC,GAAwB,CAC3C,MAAMC,EAAMN,EAAM,YAAYK,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAE5C,IAAIC,EAAc,EAClB,MAAMC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAU,IAAM,MAAQ,GAExBC,EAAO,CAAIC,EAAmBC,IAASD,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAK,CAAC,EACnEC,EAAUC,GAAe,CAC7BxB,EAAI,KAAKwB,CAAE,EACXJ,EAAKX,EAAQe,CAAE,CACjB,EACMC,EAASC,GAAuB,CACpCzB,EAAK,KAAKyB,GAAK,IAAI,EACnBN,EAAKV,EAAUgB,GAAK,IAAI,CAC1B,EACMC,EAASC,GAAc,CAC3B1B,EAAM,KAAK0B,CAAC,EACZR,EAAKT,EAAWiB,CAAC,EACjBR,EAAKjB,EAAYyB,CAAC,EAClB,EAAEZ,EACFC,EAAS,IAAIW,EAAGZ,CAAW,CAC7B,EAEMa,EAAW,CAACC,EAAgBC,IAAiB,CACjD3B,EAAiBU,GAAUgB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACR,EAAYS,IAAmB,CAC5C,GAAIT,IAAO,GACTG,EAAM,OAAOvB,CAAc,CAAC,UACnBoB,IAAO,GAAM,CAEtB,KAAM,CAACU,EAAO3B,CAAG,EAAIW,EAAK,EAC1BS,EAAOpB,GAAO2B,EAASf,CAAM,CAC/B,SAAWK,IAAO,GAAM,CAEtB,KAAM,CAACW,EAAGC,CAAC,EAAIlB,EAAK,EACpBS,GAAOQ,EAAIC,GAAKjB,CAAM,CACxB,SAAYK,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,UAAWQ,KAAKH,GAAO,CAAC,EAAGL,EAAKA,GAAK,GAAM,OAAOQ,CAAC,EACnD,MAAM5B,EAAMF,EAAYsB,CAAC,EAEzB,GADAD,EAAMC,CAAC,EACHpB,IAAQ,IAAMgB,GAAM,GAAM,CACxBrB,EAAW,IAAIyB,CAAC,EAAK,EAAIjB,EAAU,IAAIiB,CAAC,IAC1CL,EAAO,IAAMf,CAAG,EAChBiB,EAAM,IAAI,GAEZ,MACF,CACA,GAAIG,GAAK,KAAM,CAObL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACF,SAAWD,IAAO,GAAM,CAEtB,MAAMF,EAAI,OAAOpB,EAAM,IAAI,CAAE,EAC7ByB,EAAMtB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWE,IAAO,GAAM,CAEtB,KAAM,CAACM,EAAQO,CAAK,EAAInB,EAAK,EACvBI,EAAI,OAAOQ,CAAM,EACvBzB,EAAI,IAAIiB,EAAGe,EAAQlB,CAAM,EACzBU,EAASP,EAAG,EAAE,CAChB,SAAWE,IAAO,GAAM,CAEtB,KAAM,CAACM,EAAQQ,CAAC,EAAIpB,EAAK,EACzBW,EAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWN,IAAO,KAEhBN,EAAK,EAEPK,EAAOC,CAAE,EACTC,EAAMQ,GAAO,IAAI,CACnB,EAEMT,EAAMe,GAAmBP,EAAMO,CAAM,EACrCC,EAASH,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUjC,EAAgB,OAAO4B,EAAM,EAAI,EAC5D,GAAI,CAACK,EAAO,OAAOL,EAAM,GAAM,MAAS,EACxC,IAAIJ,EAAI,OAAOS,CAAK,EAChB/C,EAAkB,CAAC,EACvB,KAAOsC,GACLtC,EAAM,QAAQ,OAAOsC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOI,EAAM,GAAO1C,EAAM,OAAQA,CAAK,CACzC,EACMmD,EAAS3C,GAAoBkC,EAAM,GAAOlC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrE4C,GAAW,CAACxD,EAAayD,KAC5BzD,EAAI,MAAM,IAAI,OAAOyD,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,SAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAavB,IAAwBsB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAtB,CAAE,CAAC,EAAGY,EAAMZ,CAAC,GACxEwB,EAAahB,IAAmBc,EAAK,KAAK,CAAE,EAAG,QAAS,EAAAd,CAAE,CAAC,EAAGK,EAAML,CAAC,GACrEiB,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG9B,EAAG8B,CAAC,GAG9D,QAASC,EAAO,EAAGA,EAAOxD,EAAGwD,GAAQ,GAAI,CACvC,MAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAI1D,EAAI,MAAMyD,EAAM,KAAK,IAAIA,EAAO,GAAIxD,CAAC,CAAC,EAAG,CAAC,EAEnD,MAAM8C,EAAuC,CAAC,EAC9C,QAASrD,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAMgE,EAAKhE,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,MAAMwD,EAAIxD,EACV,KAAOA,EAAI,IAAMgE,EAAKhE,CAAC,IAAM,GAAG,EAAEA,EAClCqD,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAGxD,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACqD,EAAI,OAAQ,SAGjB,GADeA,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAClC,CACV,SAAW,CAAE,EAAAD,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,CAGA,MAAMI,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAE1BE,EAAY,KAAK,KAAK,KAAK,KAAKJ,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAUpD,EAAiBiE,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAI9C,EAAU,IAAI+B,CAAO,GACvB,GAAIe,EAAc7C,EAAc,IAAI8B,CAAO,EAAKgB,EAAW,CACzDR,EAAUvC,EAAU,IAAI+B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACSxC,EAAc,IAAI8B,CAAO,GAAK,GAAI,CAC3C,MAAMiB,EAAYD,EAAY,EACxBE,EAAOnB,GAASxD,EAAKyD,CAAO,EAClC9B,EAAc,IAAI8B,EAASkB,EAAO,GAAKA,EAAOD,EAAYA,EAAY,EAAE,EACxEhD,EAAU,IAAI+B,EAASY,CAAI,CAC7B,EAGF,GAAIG,GAAed,GAAWC,CAAG,EAC/BO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,SAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,MAAMiB,EAAW,GAAKb,EACtBG,EAAUI,EAAK,MAAMR,EAAGC,EAAI,CAAC,CAAC,EAC1Ba,EAAW,IACbX,EAAUW,EAAW,CAAC,EACtBT,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEArD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTE,EAAiB,EACjBC,EAAM,IAAI,IAGV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKsD,CAAI,IAAMA,EAAO,GAAKtD,IAAQ,IAAMA,IAAQ,IAAI,EAC9D,OAAO,CAAC,CAACA,EAAK+B,CAAC,IACP,OAAO/B,GAAQ,SAAWA,EAAM,OAAOA,CAAG,GAAKvB,EACvD,EACA,KAAK,CAACmD,EAAGC,IAAMnB,EAAS,IAAImB,EAAE,CAAC,CAAC,EAAKnB,EAAS,IAAIkB,EAAE,CAAC,CAAC,CAAE,EACxD,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC5B,EAAK+B,CAAC,IAAM,CACrBE,EAAMjC,CAAG,CACX,CAAC,EAEHJ,EAAa,IAAI,IAEjB,UAAW4D,KAAQb,EACba,EAAK,IAAM,MAAOvB,EAAMuB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAStB,EAAMsB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAMvC,EAAGuC,EAAK,CAAC,EAqBrCvC,EAAG,EAAI,EACPA,EAAG,EAAI,EACPgB,EAAM5C,EAAY,MAAM,EACxB4C,EAAM3C,CAAO,EAEb,MAAMmE,EAAgB,CAAC,EACvB,QAASxE,EAAI,EAAGA,EAAIQ,EAAI,OAAQ,EAAER,EAChCwE,EAAI,KAAKhE,EAAIR,CAAC,CAAC,EACXQ,EAAIR,CAAC,GAAK,IAAQQ,EAAIR,CAAC,GAAK,KAAQS,EAAKT,CAAC,GAAGwE,EAAI,KAAK,GAAG/D,EAAKT,CAAC,CAAE,EAMvE,MAAO,KAAOD,EAAiB,IAAI,WAAWyE,CAAG,CAAC,EAAI,4BACxD,EAEMC,GAA2B,IAC3BC,GAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,GAAM,KAUZ;AACO,MAAM3F,GAAgB,SAAU4F,EAAcC,EAAmB,CACtE,MAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAElD,MAAMpF,EAAMD,EAASqF,EAAQ,MAAQ,IAAI,EACnCG,GAAgBH,EAAQ,MAAQ,MAAM,OAC5C,GAAIG,EAAeR,GAA0B,OAAOK,EAEpD,MAAMI,EAAgBJ,EAAQ,IAAM,GAC9BrE,EAAO,KAAOf,EAEdyF,EAAa,CAACJ,GAAOE,EAAe,KACpCG,EAAML,IAAQH,GAAQO,EAAa,SAAO,YAAY1E,CAAI,EAAI,KAC9D4E,EAAKN,IAAQF,IAAOM,EAAa,SAAO,WAAW1E,CAAI,EAAI,KAE3D6E,EACJP,IAAQE,GAAgB,KAAON,GAAOS,EAAK,OAASC,EAAI,OAAST,EAAOC,IAE1E,IAAIU,EACArF,EAEJ,GAAIoF,IAAmBX,GACrBY,EAAWpF,EAAiBM,CAAI,EAChCP,EAAW,KAAOT,EAASyF,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,MAAMM,EAAQF,IAAmBV,EACjC1E,EAAWsF,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQrG,GAAe+F,CAAa,EAAI7F,GAAe6F,CAAa,CACjF,CAGA,OADuBK,EAAS,OAASrF,EAAS,QAC5B+E,EAAqBH,EAEpC,CACL,GAAGA,EACH,GAAIJ,GACJ,KAAMxE,EACN,UAAW,CACT,GAAI4E,EAAQ,WAAa,CAAC,EAC1B,CAACJ,EAAoB,EAAG,CAAE,KAAMa,CAAS,CAC3C,CACF,CACF",
6
- "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "__toCommonJS", "import_solady", "MAX_160_BIT", "_normHex", "hex", "_hexToUint8Array", "normalized", "len", "bytes", "_uint8ArrayToHex", "i", "address", "calldata", "_jitDecompressor", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "stackFreq2", "trackedMemSize", "mem", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "MASK32", "bump", "m", "k", "pushOp", "op", "pushD", "d", "pushS", "v", "trackMem", "offset", "size", "addOp", "imm", "shift", "a", "b", "value", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "base", "word", "literal", "literalCost", "baseBytes", "reuseCost", "freq", "suffix0s", "step", "out", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "payload", "alg", "rpcMethod", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz"]
4
+ "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"],
5
+ "mappings": "saAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,eAAAC,GAAAN,IAAA,IAAAO,EAAuB,kBAEvB,MAAMC,IAAe,IAAM,MAAQ,GAE7BC,EAAYC,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEC,GAAoBD,GAA4B,CACpD,MAAME,EAAaH,EAASC,CAAG,EACzBG,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,EAEME,GAAoBF,GAA8B,CACtD,IAAIJ,EAAM,GACV,QAASK,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCL,GAAOI,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOL,CACT,EAQA;AACO,MAAMP,GAAkBc,GAC7B,WAAWR,EAASQ,CAAO,CAAC,iYAQ9B;AACO,MAAMZ,GAAkBY,GAC7B,mCAAmCR,EAASQ,CAAO,CAAC,qLAOtD;AACO,MAAMb,GAAc,SAAUc,EAA0B,CAC7D,OAAOC,GAAiB,KAAOV,EAASS,CAAQ,CAAC,CACnD,EAEMC,GAAmB,SAAUD,EAA0B,CAC3D,MAAMR,EAAMD,EAASS,CAAQ,EACvBE,EAAcT,GAAiBD,CAAG,EAOlCW,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,MAAME,EAAID,EAAI,OAEd,IAAIE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAiB,EACjBC,EAAM,IAAI,IACd,MAAMC,EAAeC,GAAwB,CAC3C,MAAMC,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,IAE5C,IAAIC,EAAc,EAClB,MAAMC,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,KAAM,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,UAAWS,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,MAAMpB,EAAMF,EAAYyB,CAAC,EACzB,GAAIvB,IAAQ,IAAMmB,GAAM,GAAM,CAC5B,MAAMc,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,KAAM,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,MAAML,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B2B,EAAMzB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWK,IAAO,GAAM,CAEtB,KAAM,CAACO,EAAQQ,CAAK,EAAIxB,EAAK,EACvBI,EAAI,OAAOY,CAAM,EACvB7B,EAAI,IAAIiB,EAAGoB,EAAQvB,CAAM,EACzBc,EAASX,EAAG,EAAE,CAChB,SAAWK,IAAO,GAAM,CAEtB,KAAM,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,EAChBnD,EAAkB,CAAC,EACvB,KAAOwC,GACLxC,EAAM,QAAQ,OAAOwC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAO7C,EAAM,OAAQA,CAAK,CACzC,EACMyD,EAASjD,GAAoBqC,EAAM,GAAOrC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrEkD,GAAW,CAAC9D,EAAa+D,KAC5B/D,EAAI,MAAM,IAAI,OAAO+D,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,SAAW,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,EAAMR,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,MAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAIhE,EAAI,MAAM+D,EAAM,KAAK,IAAIA,EAAO,GAAI9D,CAAC,CAAC,EAAG,CAAC,EAEnD,MAAMoD,EAAuC,CAAC,EAC9C,QAAS5D,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAMuE,EAAKvE,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,MAAM+D,EAAI/D,EACV,KAAOA,EAAI,IAAMuE,EAAKvE,CAAC,IAAM,GAAG,EAAEA,EAClC4D,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG/D,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAAC4D,EAAI,OAAQ,SAGjB,MAAMY,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAChC,IAAIE,EAAa,GACjB,UAAW1B,KAAKwB,EAASE,EAAcA,GAAc,GAAM,OAAO1B,CAAC,EACnE,MAAM2B,EAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAUzD,GAAiBsE,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,MAAMkB,EAAYD,EAAY,EACxBnC,EAAOiB,GAAS9D,EAAK+D,CAAO,EAClCrC,EAAc,IAAIqC,EAASlB,EAAO,GAAKA,EAAOoC,EAAYA,EAAY,EAAE,EACxExD,EAAU,IAAIsC,EAASY,CAAI,CAC7B,EAKF,MAAMO,GAASjB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAC9C,GAAIZ,GAAUoB,CAAO,EACnBL,EAAUK,CAAO,UACRK,GAAQ,CACjB,SAAW,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,SAAW,CAAE,EAAAC,EAAG,EAAAC,EAAE,IAAKJ,EAAK,CAC1B,MAAMkB,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,GAAOtB,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAACsB,EAAKoC,CAAC,IAAM,CACrBI,EAAMxC,CAAG,CACX,CAAC,EACHwC,EAAM,EAAE,EAER,UAAWwB,KAAQd,EACbc,EAAK,IAAM,MAAOxB,EAAMwB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAASvB,EAAMuB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAM5C,EAAG4C,EAAK,CAAC,EAoBrC5C,EAAG,EAAI,EACPA,EAAG,EAAI,EACPoB,EAAMlD,EAAY,MAAM,EACxBkD,EAAMjD,CAAO,EAEb,MAAM0E,EAAgB,CAAC,EACvB,QAAShF,EAAI,EAAGA,EAAIS,EAAI,OAAQ,EAAET,EAChCgF,EAAI,KAAKvE,EAAIT,CAAC,CAAC,EACXS,EAAIT,CAAC,GAAK,IAAQS,EAAIT,CAAC,GAAK,KAAQU,EAAKV,CAAC,GAAGgF,EAAI,KAAK,GAAGtE,EAAKV,CAAC,CAAE,EAMvE,MAAO,KAAOC,GAAiB,IAAI,WAAW+E,CAAG,CAAC,EAAI,0BACxD,EAEMC,GAA2B,KAC3BC,EAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,EAAM,KAUZ;AACO,MAAMlG,GAAgB,SAAUmG,EAAcC,EAAmB,CACtE,MAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAGlD,MAAMG,EAAQH,EAAQ,SAAS,CAAC,GAAKA,EAC/BI,EAAaJ,EAAQ,SAAS,CAAC,GAAK,SACpCK,EAAwBL,EAAQ,SAAS,CAAC,GAAK,CAAC,EAGhD3F,EAAMD,EAAS+F,EAAM,MAAQ,IAAI,EACjCG,GAAgBH,EAAM,MAAQ,MAAM,OAC1C,GAAIG,EAAeX,IAA6BU,EAAsBT,CAAoB,EAAI,OAAOI,EAErG,MAAMO,EAAgBJ,EAAM,IAAM,GAC5B/E,EAAO,KAAOf,EAEdmG,EAAa,CAACP,GAAOK,EAAe,KACpCG,EAAMR,IAAQH,GAAQU,EAAa,SAAO,YAAYpF,CAAI,EAAI,KAC9DsF,EAAKT,IAAQF,GAAOS,EAAa,SAAO,WAAWpF,CAAI,EAAI,KACjE,IAAIuF,EAAiBV,EAChBU,IACHA,EACEL,GAAgB,OAASA,EAAe,KAAQA,GAAgB,KAC5DT,GACAS,GAAgB,KAAQA,EAAe,KACrCG,EAAK,OAASC,EAAI,OAChBZ,EAEFC,GAGV,IAAIa,EACA/F,EAEJ,GAAI8F,IAAmBd,GACrBe,EAAW9F,GAAiBM,CAAI,EAChCP,EAAW,KAAOT,EAASmG,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,MAAMM,EAAQF,IAAmBb,EACjCjF,EAAWgG,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQ/G,GAAeyG,CAAa,EAAIvG,GAAeuG,CAAa,CACjF,CAGA,OADuBK,EAAS,OAAS/F,EAAS,QAC5ByF,EAAqBN,EAEpC,CACL,GAAGA,EACH,OAAQ,CACN,CACE,GAAGG,EACH,GAAIP,EACJ,KAAM/E,CACR,EACAuF,EACA,CACE,GAAGC,EACH,CAACT,CAAoB,EAAG,CAAE,KAAMgB,CAAS,CAC3C,CACF,CACF,CACF",
6
+ "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "__toCommonJS", "import_solady", "MAX_160_BIT", "_normHex", "hex", "_hexToUint8Array", "normalized", "len", "bytes", "i", "_uint8ArrayToHex", "address", "calldata", "_jitDecompressor", "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", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "payload", "alg", "rpcMethod", "txObj", "blockParam", "existingStateOverride", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz"]
7
7
  }
package/_esm/index.js CHANGED
@@ -1,3 +1,3 @@
1
- var ae=Object.defineProperty;var be=(t,n)=>()=>(t&&(n=t(t=0)),n);var ge=(t,n)=>{for(var o in n)ae(t,o,{get:n[o],enumerable:!0})};var oe={};ge(oe,{compress_call:()=>xe,flzFwdBytecode:()=>ne,jitBytecode:()=>de,rleFwdBytecode:()=>se});import{LibZip as V}from"solady";var me,w,pe,Y,ne,se,de,re,he,v,ee,K,te,xe,ce=be(()=>{me=(1n<<160n)-1n,w=t=>t.replace(/^0x/,"").toLowerCase(),pe=t=>{let n=w(t),o=n.length,a=new Uint8Array(o/2);for(let i=0;i<o;i+=2)a[i/2]=Number.parseInt(n.slice(i,i+2),16);return a},Y=t=>{let n="";for(let o=0;o<t.length;o++)n+=t[o].toString(16).padStart(2,"0");return n};ne=t=>`0x365f73${w(t)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;se=t=>`0x5f5f5b368110602d575f8083813473${w(t)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;de=function(t){return re("0x"+w(t))},re=function(t){let n=w(t),o=pe(n),a=28,i=new Uint8Array(a+o.length);i.set(o,a);let m=i.length,l=[],f=[],u=[],M=new Map,x=0,p=new Map,S=e=>{let s=u.lastIndexOf(e);return s===-1?-1:u.length-1-s},H=new Map,z=new Map,R=new Map,_=new Map,O=new Map,fe=e=>e+31&-32,J=0,E=new Map,I=()=>[u.pop(),u.pop()],F=(1n<<256n)-1n,B=(e,s)=>e.set(s,(e.get(s)||0)+1),T=e=>{l.push(e),B(H,e)},D=e=>{f.push(e||null),B(z,e||null)},U=e=>{u.push(e),B(R,e),B(M,e),++J,E.set(e,J)},W=(e,s)=>{x=fe(e+s)},q=(e,s)=>{if(e===89)U(BigInt(x));else if(e===27){let[r,b]=I();U(b<<r&F)}else if(e===23){let[r,b]=I();U((r|b)&F)}else if(e>=96&&e<=127||e===95){let r=0n;for(let g of s||[])r=r<<8n|BigInt(g);let b=S(r);if(U(r),b!==-1&&e!=95){M.get(r)*2<R.get(r)&&(T(128+b),D(null));return}if(r==224n){T(48),D(null);return}}else if(e===81){let r=Number(u.pop());U(p.has(r)?p.get(r):0n)}else if(e===82){let[r,b]=I(),g=Number(r);p.set(g,b&F),W(g,32)}else if(e===83){let[r,b]=I();W(Number(r),1)}else e===243&&I();T(e),D(s||null)},N=e=>q(e),P=e=>{if(e>0&&e===x)return q(89);if(!e)return q(95,void 0);let s=BigInt(e),r=[];for(;s;)r.unshift(Number(s&0xffn)),s>>=8n;return q(95+r.length,r)},Z=e=>q(95+e.length,Array.from(e)),ue=(e,s)=>(e.match(new RegExp(s,"g"))||[]).length,le=e=>{let s=0,r=!0;for(let{s:b,e:g}of e)s+=1+g-b+1,31-g>0&&(s+=3),r||(s+=1),r=!1;return s},k=[],A=e=>(k.push({t:"num",v:e}),P(e)),$=e=>(k.push({t:"bytes",b:e}),Z(e)),C=e=>(k.push({t:"op",o:e}),N(e));for(let e=0;e<m;e+=32){let s=new Uint8Array(32);s.set(i.slice(e,Math.min(e+32,m)),0);let r=[];for(let c=0;c<32;){for(;c<32&&s[c]===0;)++c;if(c>=32)break;let h=c;for(;c<32&&s[c]!==0;)++c;r.push({s:h,e:c-1})}if(!r.length)continue;if(r.every(({s:c,e:h})=>c===h)){for(let{s:c}of r)A(s[c]),A(e+c),C(83);continue}let g=s.slice(r[0].s),j=1+g.length,X=Math.ceil(Math.log2(e+1)/8),y=Y(s);if(j>8){if(_.has(y)){if(j>O.get(y)+X){A(_.get(y)),C(81),A(e),C(82);continue}}else if(O.get(y)!=-1){let c=X+3,h=ue(n,y);O.set(y,h*32>h*c?c:-1),_.set(y,e)}}if(j<=le(r))$(g);else{let c=!0;for(let{s:h,e:G}of r){let Q=31-G;$(s.slice(h,G+1)),Q>0&&(A(Q*8),C(27)),c||C(23),c=!1}}A(e),C(82)}l=[],f=[],u=[],x=0,p=new Map,Array.from(R.entries()).filter(([e,s])=>s>1&&e!==0n&&e!==224n).filter(([e,s])=>typeof e=="number"?e:Number(e)<=me).sort((e,s)=>E.get(s[0])-E.get(e[0])).slice(0,14).forEach(([e,s])=>{P(e)}),M=new Map;for(let e of k)e.t==="num"?P(e.v):e.t==="bytes"?Z(e.b):e.t==="op"&&N(e.o);N(95),N(95),P(o.length),P(a);let L=[];for(let e=0;e<l.length;++e)L.push(l[e]),l[e]>=96&&l[e]<=127&&f[e]&&L.push(...f[e]);return"0x"+Y(new Uint8Array(L))+"345f355af1503d5f5f3e3d5ff3"},he=800,v="0x00000000000000000000000000000000000000e0",ee="jit",K="flz",te="cd";xe=function(t,n){var z,R;let o=((R=(z=t.params)==null?void 0:z[0])==null?void 0:R.method)||t.method;if(o&&o!=="eth_call")return t;let a=w(t.data||"0x"),i=(t.data||"0x").length;if(i<he)return t;let m=t.to||"",l="0x"+a,f=!n&&i<1150,u=n===K||f?V.flzCompress(l):null,M=n===te||f?V.cdCompress(l):null,x=n||(i>=1150?ee:u.length<M.length?K:te),p,S;if(x===ee)p=re(l),S="0x"+w(m).padStart(64,"0");else{let _=x===K;S=_?u:M,p=_?ne(m):se(m)}return p.length+S.length>=i?t:{...t,to:v,data:S,stateDiff:{...t.stateDiff||{},[v]:{code:p}}}}});var ie=new Map,ye=["deflate-raw","deflate","gzip"],d=typeof CompressionStream>"u"?-1:null;async function we(t,n,o){var l;let a=typeof t=="string"?t:t instanceof URL?t.toString():t.url,i=ie.get(a);if(d=d===-1||i===-1?-1:(i==null?void 0:i[0])??null,o&&(n!=null&&n.body)&&typeof n.body=="string"&&(d===-1||d===null))try{let f=JSON.parse(n.body),u=o(f);u!==void 0&&(n={...n,body:JSON.stringify(u)})}catch{}if(d&&d!==-1&&(n!=null&&n.body)){let f=await new Response(new Blob([n.body]).stream().pipeThrough(new CompressionStream(d))).blob();n={...n,body:f,headers:{...n&&n.headers,"Content-Encoding":d}}}let m=await fetch(a,n);if(d===null){let f=(l=m.headers.get("Accept-Encoding"))==null?void 0:l.split(",").filter(u=>ye.includes(u));ie.set(a,f!=null&&f.length?f:-1)}return m}var Re=(t,n)=>Promise.resolve().then(()=>(ce(),oe)).then(({compress_call:o})=>we(t,n,o));export{we as compressModule,Re as compressModuleWithJIT};
1
+ var me=Object.defineProperty;var ge=(s,r)=>()=>(s&&(r=s(s=0)),r);var de=(s,r)=>{for(var i in r)me(s,i,{get:r[i],enumerable:!0})};var ie={};de(ie,{compress_call:()=>Me,flzFwdBytecode:()=>re,jitBytecode:()=>ye,rleFwdBytecode:()=>oe});import{LibZip as te}from"solady";var he,A,xe,ne,re,oe,ye,ce,we,Z,se,$,V,Me,fe=ge(()=>{he=(1n<<128n)-1n,A=s=>s.replace(/^0x/,"").toLowerCase(),xe=s=>{let r=A(s),i=r.length,b=new Uint8Array(i/2);for(let a=0;a<i;a+=2)b[a/2]=Number.parseInt(r.slice(a,a+2),16);return b},ne=s=>{let r="";for(let i=0;i<s.length;i++)r+=s[i].toString(16).padStart(2,"0");return r};re=s=>`0x365f73${A(s)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;oe=s=>`0x5f5f5b368110602d575f8083813473${A(s)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;ye=function(s){return ce("0x"+A(s))},ce=function(s){let r=A(s),i=xe(r),b=28,a=new Uint8Array(b+i.length);a.set(i,b);let h=a.length,l=[],o=[],u=[],x=0,S=new Map,z=e=>{let t=u.lastIndexOf(e);return t===-1?-1:u.length-1-t},N=new Map,I=new Map,m=new Map,y=new Map,K=new Map,E=e=>e+31&-32,q=0,C=new Map,g=()=>[u.pop(),u.pop()],U=(1n<<256n)-1n,B=(e,t,n)=>e.set(t,(e.get(t)||0)+n),X=(e,t)=>B(e,t,1),G=(e,t)=>B(e,t,-1),F=e=>{l.push(e),X(N,e)},T=e=>{o.push(e||null),X(I,e||null)},w=(e,t=1)=>{u.push(e),B(m,e,t),++q,C.set(e,q)},Q=(e,t)=>{x=E(e+t)},P=(e,t)=>{if(e===54)w(32n,0);else if(e===89)w(BigInt(x),0);else if(e===27){let[n,f]=g();l[l.length-1]==144&&(l.pop(),o.pop(),[n,f]=[f,n]),w(f<<BigInt(n)&U)}else if(e===23){let[n,f]=g();l[l.length-1]==144&&(l.pop(),o.pop()),w((n|f)&U)}else if(e>=96&&e<=127||e===95){let n=0n;for(let p of t||[])n=n<<8n|BigInt(p);if(n==224n){w(n),F(48),T(null);return}let f=z(n);if(f!==-1&&e!=95){let p=m.get(n)==0;if(f==0&&p){G(m,n);return}if(f==1&&p){F(144);let[D,H]=g();u.push(H),u.push(D),T(null),G(m,n);return}w(n,-1),F(128+f),T(null);return}w(n)}else if(e===81){let n=Number(u.pop());w(S.has(n)?S.get(n):0n)}else if(e===82){let[n,f]=g(),p=Number(n);S.set(p,f&U),Q(p,32)}else if(e===83){let[n,f]=g();Q(Number(n),1)}else e===243&&g();F(e),T(t||null)},le=e=>u.includes(e)||e==224||e==32n,L=e=>P(e),R=e=>{if(e>0&&e===x)return P(89);if(e==32n)return P(54);if(!e)return P(95,void 0);let t=BigInt(e),n=[];for(;t;)n.unshift(Number(t&0xffn)),t>>=8n;return P(95+n.length,n)},Y=e=>P(95+e.length,Array.from(e)),ae=(e,t)=>(e.match(new RegExp(t,"g"))||[]).length,be=e=>{let t=0,n=!0;for(let{s:f,e:p}of e)t+=1+p-f+1,31-p>0&&(t+=3),n||(t+=1),n=!1;return t},j=[],O=e=>(j.push({t:"num",v:e}),R(e)),J=e=>(j.push({t:"bytes",b:e}),Y(e)),k=e=>(j.push({t:"op",o:e}),L(e));R(1n);for(let e=0;e<h;e+=32){let t=new Uint8Array(32);t.set(a.slice(e,Math.min(e+32,h)),0);let n=[];for(let c=0;c<32;){for(;c<32&&t[c]===0;)++c;if(c>=32)break;let M=c;for(;c<32&&t[c]!==0;)++c;n.push({s:M,e:c-1})}if(!n.length)continue;let f=t.slice(n[0].s),p=1+f.length,D=0n;for(let c of f)D=D<<8n|BigInt(c);let H=Math.ceil(Math.log2(e+1)/8),_=ne(t);if(p>8){if(y.has(_)){if(p>K.get(_)+H){O(y.get(_)),k(81),O(e),k(82);continue}}else if(K.get(_)!=-1){let c=H+3,M=ae(r,_);K.set(_,M*32>M*c?c:-1),y.set(_,e)}}let pe=n.every(({s:c,e:M})=>c===M);if(le(f))J(f);else if(pe){for(let{s:c}of n)O(t[c]),O(e+c),k(83);continue}else if(p<=be(n))J(f);else{let c=!0;for(let{s:M,e:v}of n){let ee=31-v;J(t.slice(M,v+1)),ee>0&&(O(ee*8),k(27)),c||k(23),c=!1}}O(e),k(82)}l=[],o=[],u=[],x=0,S=new Map,Array.from(m.entries()).filter(([e,t])=>t>1&&e>1n&&e!==32n&&e!==224n).sort((e,t)=>C.get(t[0])-C.get(e[0])).filter(([e,t])=>typeof e=="number"?BigInt(e):e<=he).slice(0,13).forEach(([e,t])=>{R(e)}),R(1n);for(let e of j)e.t==="num"?R(e.v):e.t==="bytes"?Y(e.b):e.t==="op"&&L(e.o);L(95),L(95),R(i.length),R(b);let W=[];for(let e=0;e<l.length;++e)W.push(l[e]),l[e]>=96&&l[e]<=127&&o[e]&&W.push(...o[e]);return"0x"+ne(new Uint8Array(W))+"345f355af13d5f5f3e3d5ff3"},we=1150,Z="0x00000000000000000000000000000000000000e0",se="jit",$="flz",V="cd";Me=function(s,r){var E,q,C,g,U;let i=((q=(E=s.params)==null?void 0:E[0])==null?void 0:q.method)||s.method;if(i&&i!=="eth_call")return s;let b=((C=s.params)==null?void 0:C[0])||s,a=((g=s.params)==null?void 0:g[1])||"latest",h=((U=s.params)==null?void 0:U[2])||{},l=A(b.data||"0x"),o=(b.data||"0x").length;if(o<we||h[Z])return s;let u=b.to||"",x="0x"+l,S=!r&&o<1150,z=r===$||S?te.flzCompress(x):null,N=r===V||S?te.cdCompress(x):null,I=r;I||(I=o>=1150&&(o<3e3||o>=8e3)?se:o>=3e3&&o<8e3&&z.length<N.length?$:V);let m,y;if(I===se)m=ce(x),y="0x"+A(u).padStart(64,"0");else{let B=I===$;y=B?z:N,m=B?re(u):oe(u)}return m.length+y.length>=o?s:{...s,params:[{...b,to:Z,data:y},a,{...h,[Z]:{code:m}}]}}});var ue=new Map,Se=["deflate-raw","deflate","gzip"],d=typeof CompressionStream>"u"?-1:null;async function Re(s,r,i){var l;let b=typeof s=="string"?s:s instanceof URL?s.toString():s.url,a=ue.get(b);if(d=d===-1||a===-1?-1:(a==null?void 0:a[0])??null,i&&(r!=null&&r.body)&&typeof r.body=="string"&&(d===-1||d===null))try{let o=JSON.parse(r.body),u=i(o);u!==void 0&&(r={...r,body:JSON.stringify(u)})}catch{}if(d&&d!==-1&&(r!=null&&r.body)){let o=await new Response(new Blob([r.body]).stream().pipeThrough(new CompressionStream(d))).blob();r={...r,body:o,headers:{...r&&r.headers,"Content-Encoding":d}}}let h=await fetch(b,r);if(d===null){let o=(l=h.headers.get("Accept-Encoding"))==null?void 0:l.split(",").filter(u=>Se.includes(u));ue.set(b,o!=null&&o.length?o:-1)}return h}var Ie=(s,r)=>Promise.resolve().then(()=>(fe(),ie)).then(({compress_call:i})=>Re(s,r,i));export{Re as compressModule,Ie as compressModuleWithJIT};
2
2
  //! @__PURE__
3
3
  //# sourceMappingURL=index.js.map
package/_esm/index.js.map CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "version": 3,
3
3
  "sources": ["../../src/jit-compressor.ts", "../../src/index.ts"],
4
- "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 160n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n const normalized = _normHex(hex);\n const len = normalized.length;\n const bytes = new Uint8Array(len / 2);\n for (let i = 0; i < len; i += 2) {\n bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n }\n return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += bytes[i].toString(16).padStart(2, '0');\n }\n return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n const hex = _normHex(calldata);\n const originalBuf = _hexToUint8Array(hex);\n\n // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n // so that everything after the selector is reconstructed on mostly\n // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n // calldata reconstruction) 32\u2011byte aligned in memory.\n // That way we avoid encoding offsets for writes (most of the time),\n const padding = 28;\n const buf = new Uint8Array(padding + originalBuf.length);\n buf.set(originalBuf, padding);\n\n const n = buf.length;\n\n let ops: number[] = [];\n let data: (number[] | null)[] = [];\n let stack: bigint[] = [];\n let stackFreq2 = new Map<bigint, number>();\n let trackedMemSize = 0;\n let mem = new Map<number, bigint>();\n const getStackIdx = (val: bigint): number => {\n const idx = stack.lastIndexOf(val);\n return idx === -1 ? -1 : stack.length - 1 - idx;\n };\n\n const opFreq = new Map<number, number>();\n const dataFreq = new Map<number[] | null, number>();\n const stackFreq = new Map<bigint, number>();\n const wordCache = new Map<string, number>();\n const wordCacheCost = new Map<string, number>();\n const roundUp32 = (x: number) => (x + 31) & ~31;\n\n let pushCounter = 0;\n const stackCnt = new Map<bigint, number>();\n\n const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n const MASK32 = (1n << 256n) - 1n;\n\n const bump = <K>(m: Map<K, number>, k: K) => m.set(k, (m.get(k) || 0) + 1);\n const pushOp = (op: number) => {\n ops.push(op);\n bump(opFreq, op);\n };\n const pushD = (d: number[] | null) => {\n data.push(d || null);\n bump(dataFreq, d || null);\n };\n const pushS = (v: bigint) => {\n stack.push(v);\n bump(stackFreq, v);\n bump(stackFreq2, v);\n ++pushCounter;\n stackCnt.set(v, pushCounter);\n };\n\n const trackMem = (offset: number, size: number) => {\n trackedMemSize = roundUp32(offset + size);\n };\n\n const addOp = (op: number, imm?: number[]) => {\n if (op === 0x59) {\n pushS(BigInt(trackedMemSize));\n } else if (op === 0x1b) {\n // SHL\n const [shift, val] = pop2();\n pushS((val << shift) & MASK32);\n } else if (op === 0x17) {\n // OR\n const [a, b] = pop2();\n pushS((a | b) & MASK32);\n } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n // PUSH\n let v = 0n;\n for (const b of imm || []) v = (v << 8n) | BigInt(b);\n const idx = getStackIdx(v);\n pushS(v);\n if (idx !== -1 && op != 0x5f) {\n if (stackFreq2.get(v)! * 2 < stackFreq.get(v)!) {\n pushOp(128 + idx);\n pushD(null);\n }\n return;\n }\n if (v == 224n) {\n // Special\u2011case the literal 0xe0 (224):\n // the decompressor is always deployed at 0x...00e0, so the final\n // byte of ADDRESS is exactly 0xe0. Since we must send our own\n // address with the eth_call anyway, we can synthesize this value \n // with a single opcode instead of encoding a literal, effectively\n // giving us one more hot constant slot on the stack.\n pushOp(0x30); // ADDRESS\n pushD(null);\n return;\n }\n } else if (op === 0x51) {\n // MLOAD\n const k = Number(stack.pop()!);\n pushS(mem.has(k) ? mem.get(k)! : 0n);\n } else if (op === 0x52) {\n // MSTORE\n const [offset, value] = pop2();\n const k = Number(offset);\n mem.set(k, value & MASK32);\n trackMem(k, 32);\n } else if (op === 0x53) {\n // MSTORE8\n const [offset, _] = pop2();\n trackMem(Number(offset), 1);\n } else if (op === 0xf3) {\n // RETURN\n pop2();\n }\n pushOp(op);\n pushD(imm || null);\n };\n\n const op = (opcode: number) => addOp(opcode);\n const pushN = (value: number | bigint) => {\n if (value > 0 && value === trackedMemSize) return addOp(0x59);\n if (!value) return addOp(0x5f, undefined); // PUSH0\n let v = BigInt(value);\n let bytes: number[] = [];\n while (v) {\n bytes.unshift(Number(v & 0xffn));\n v >>= 8n;\n }\n return addOp(0x5f + bytes.length, bytes);\n };\n const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n const cntWords = (hex: string, wordHex: string) =>\n (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n // Rough cost model\n const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n let cost = 0;\n let first = true;\n for (const { s, e } of seg) {\n cost += 1 + e - s + 1; // PUSH segLen bytes\n if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n if (!first) cost += 1; // OR\n first = false;\n }\n return cost;\n };\n\n type PlanStep =\n | { t: 'num'; v: number | bigint }\n | { t: 'bytes'; b: Uint8Array }\n | { t: 'op'; o: number };\n\n const plan: PlanStep[] = [];\n const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n\n // First pass: decide how to build each 32-byte word without emitting bytecode\n for (let base = 0; base < n; base += 32) {\n const word = new Uint8Array(32);\n word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n const seg: Array<{ s: number; e: number }> = [];\n for (let i = 0; i < 32; ) {\n while (i < 32 && word[i] === 0) ++i;\n if (i >= 32) break;\n const s = i;\n while (i < 32 && word[i] !== 0) ++i;\n seg.push({ s, e: i - 1 });\n }\n\n if (!seg.length) continue;\n\n const byte8s = seg.every(({ s, e }) => s === e);\n if (byte8s) {\n for (const { s } of seg) {\n emitPushN(word[s]);\n emitPushN(base + s);\n emitOp(0x53); // MSTORE8\n }\n continue;\n }\n\n // Decide whether to build this word via SHL/OR or as a single literal word\n const literal = word.slice(seg[0].s);\n const literalCost = 1 + literal.length;\n\n const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n const wordHex = _uint8ArrayToHex(word);\n if (literalCost > 8) {\n if (wordCache.has(wordHex)) {\n if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n emitPushN(wordCache.get(wordHex)!);\n emitOp(0x51);\n emitPushN(base);\n emitOp(0x52); // MSTORE\n continue;\n }\n } else if (wordCacheCost.get(wordHex) != -1) {\n const reuseCost = baseBytes + 3;\n const freq = cntWords(hex, wordHex);\n wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n wordCache.set(wordHex, base);\n }\n }\n\n if (literalCost <= estShlCost(seg)) {\n emitPushB(literal);\n } else {\n let first = true;\n for (const { s, e } of seg) {\n const suffix0s = 31 - e;\n emitPushB(word.slice(s, e + 1));\n if (suffix0s > 0) {\n emitPushN(suffix0s * 8);\n emitOp(0x1b); // SHL\n }\n if (!first) emitOp(0x17); // OR\n first = false;\n }\n }\n emitPushN(base);\n emitOp(0x52); // MSTORE\n }\n\n ops = [];\n data = [];\n stack = [];\n trackedMemSize = 0;\n mem = new Map();\n\n // Pre 2nd pass. Push most frequent literals into stack.\n Array.from(stackFreq.entries())\n .filter(([val, freq]) => freq > 1 && val !== 0n && val !== 224n)\n .filter(([val, _]) => {\n return typeof val === 'number' ? val : Number(val) <= MAX_160_BIT;\n })\n .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n .slice(0, 14)\n .forEach(([val, _]) => {\n pushN(val);\n });\n\n stackFreq2 = new Map();\n // Second pass: emit ops and track mem/stack\n for (const step of plan) {\n if (step.t === 'num') pushN(step.v);\n else if (step.t === 'bytes') pushB(step.b);\n else if (step.t === 'op') op(step.o);\n }\n\n // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n //\n // Opcodes breakdown:\n // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n // - pushN(originalBuf.length): argsSize = actual data length\n // - pushN(padding): argsOffset (skip leading alignment bytes)\n // - 0x34: CALLVALUE (value)\n // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n // - 0x5a: GAS (remaining gas)\n // - 0xf1: CALL\n // - 0x50: POP (discard success value)\n //\n // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n //\n // RETURN(offset=0, size=RETURNDATASIZE):\n // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n op(0x5f); // PUSH0 (retSize)\n op(0x5f); // PUSH0 (retOffset)\n pushN(originalBuf.length); // argsSize = actual data length\n pushN(padding); // argsOffset = padding\n\n const out: number[] = [];\n for (let i = 0; i < ops.length; ++i) {\n out.push(ops[i]);\n if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n }\n\n // - CALLVALUE, load target address from calldata[0], GAS, CALL\n // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n // - RETURN(0, RETURNDATASIZE)\n return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af1503d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 800;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n const rpcMethod = payload.params?.[0]?.method || payload.method;\n if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n const hex = _normHex(payload.data || '0x');\n const originalSize = (payload.data || '0x').length;\n if (originalSize < MIN_SIZE_FOR_COMPRESSION) return payload;\n\n const targetAddress = payload.to || '';\n const data = '0x' + hex;\n\n const autoSelect = !alg && originalSize < 1150;\n const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n\n const selectedMethod =\n alg || (originalSize >= 1150 ? _jit : flz!.length < cd!.length ? _flz : _cd);\n\n let bytecode: string;\n let calldata: string;\n\n if (selectedMethod === _jit) {\n bytecode = _jitDecompressor(data);\n calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n } else {\n const isFlz = selectedMethod === _flz;\n calldata = isFlz ? flz! : cd!;\n bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n }\n\n const compressedSize = bytecode.length + calldata.length;\n if (compressedSize >= originalSize) return payload;\n\n return {\n ...payload,\n to: DECOMPRESSOR_ADDRESS,\n data: calldata,\n stateDiff: {\n ...(payload.stateDiff || {}),\n [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n },\n };\n};\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n input: string | URL | Request,\n init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n input: string | URL | Request,\n init: RequestInit | undefined,\n transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n input: string | URL | Request,\n init?: RequestInit,\n transformPayload?: PayloadTransform,\n): Promise<Response> {\n const url =\n typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n const cached = _sup_enc.get(url);\n supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n // Only apply the optional payload transform\n // when native HTTP compression is not available for this URL.\n if (transformPayload && init?.body && typeof init.body === 'string') {\n if (supported === -1 || supported === null) {\n try {\n const parsed = JSON.parse(init.body as string);\n const next = transformPayload(parsed);\n if (next !== undefined) {\n init = {\n ...init,\n body: JSON.stringify(next),\n };\n }\n } catch {\n // Non-JSON bodies are left untouched.\n }\n }\n }\n\n if (supported && supported !== -1 && init?.body) {\n const compressed = await new Response(\n new Blob([init.body as string])\n .stream()\n .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n ).blob();\n init = {\n ...init,\n body: compressed,\n headers: { ...(init && init.headers), 'Content-Encoding': supported },\n };\n }\n const response = await fetch(url, init);\n\n if (supported === null) {\n const encodings = response.headers\n .get('Accept-Encoding')\n ?.split(',')\n .filter((e) => _enc.includes(e));\n _sup_enc.set(url, encodings?.length ? encodings : -1);\n }\n\n return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n * transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n input: RequestInfo | URL,\n init?: RequestInit,\n): Promise<Response> => {\n return import('./jit-compressor').then(({ compress_call }) =>\n compressModule(input, init, compress_call),\n );\n};\n"],
5
- "mappings": "iIAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,OAAS,UAAAC,MAAc,SAAvB,IAEMC,GAEAC,EAEAC,GAUAC,EAeOP,GAUAE,GASAD,GAIPO,GA6RAC,GACAC,EAEAC,GACAC,EACAC,GAWOd,GAnWbe,GAAAC,GAAA,KAEMX,IAAe,IAAM,MAAQ,GAE7BC,EAAYW,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEV,GAAoBU,GAA4B,CACpD,IAAMC,EAAaZ,EAASW,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAAS,EAAI,EAAG,EAAIA,EAAK,GAAK,EAC5BC,EAAM,EAAI,CAAC,EAAI,OAAO,SAASF,EAAW,MAAM,EAAG,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOE,CACT,EAEMZ,EAAoBY,GAA8B,CACtD,IAAIH,EAAM,GACV,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EASahB,GAAkBqB,GAC7B,WAAWhB,EAASgB,CAAO,CAAC,iYASjBnB,GAAkBmB,GAC7B,mCAAmChB,EAASgB,CAAO,CAAC,qLAQzCpB,GAAc,SAAUqB,EAA0B,CAC7D,OAAOd,GAAiB,KAAOH,EAASiB,CAAQ,CAAC,CACnD,EAEMd,GAAmB,SAAUc,EAA0B,CAC3D,IAAMN,EAAMX,EAASiB,CAAQ,EACvBC,EAAcjB,GAAiBU,CAAG,EAOlCQ,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAa,IAAI,IACjBC,EAAiB,EACjBC,EAAM,IAAI,IACRC,EAAeC,GAAwB,CAC3C,IAAMC,EAAMN,EAAM,YAAYK,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAExCC,EAAc,EACZC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAU,IAAM,MAAQ,GAExBC,EAAO,CAAIC,EAAmBC,IAASD,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAK,CAAC,EACnEC,EAAUC,GAAe,CAC7BxB,EAAI,KAAKwB,CAAE,EACXJ,EAAKX,EAAQe,CAAE,CACjB,EACMC,EAASC,GAAuB,CACpCzB,EAAK,KAAKyB,GAAK,IAAI,EACnBN,EAAKV,EAAUgB,GAAK,IAAI,CAC1B,EACMC,EAASC,GAAc,CAC3B1B,EAAM,KAAK0B,CAAC,EACZR,EAAKT,EAAWiB,CAAC,EACjBR,EAAKjB,EAAYyB,CAAC,EAClB,EAAEZ,EACFC,EAAS,IAAIW,EAAGZ,CAAW,CAC7B,EAEMa,EAAW,CAACC,EAAgBC,IAAiB,CACjD3B,EAAiBU,GAAUgB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACR,EAAYS,IAAmB,CAC5C,GAAIT,IAAO,GACTG,EAAM,OAAOvB,CAAc,CAAC,UACnBoB,IAAO,GAAM,CAEtB,GAAM,CAACU,EAAO3B,CAAG,EAAIW,EAAK,EAC1BS,EAAOpB,GAAO2B,EAASf,CAAM,CAC/B,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACW,EAAG,CAAC,EAAIjB,EAAK,EACpBS,GAAOQ,EAAI,GAAKhB,CAAM,CACxB,SAAYK,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAWQ,KAAKH,GAAO,CAAC,EAAGL,EAAKA,GAAK,GAAM,OAAOQ,CAAC,EACnD,IAAM5B,EAAMF,EAAYsB,CAAC,EAEzB,GADAD,EAAMC,CAAC,EACHpB,IAAQ,IAAMgB,GAAM,GAAM,CACxBrB,EAAW,IAAIyB,CAAC,EAAK,EAAIjB,EAAU,IAAIiB,CAAC,IAC1CL,EAAO,IAAMf,CAAG,EAChBiB,EAAM,IAAI,GAEZ,MACF,CACA,GAAIG,GAAK,KAAM,CAObL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACF,SAAWD,IAAO,GAAM,CAEtB,IAAMF,EAAI,OAAOpB,EAAM,IAAI,CAAE,EAC7ByB,EAAMtB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWE,IAAO,GAAM,CAEtB,GAAM,CAACM,EAAQO,CAAK,EAAInB,EAAK,EACvBI,EAAI,OAAOQ,CAAM,EACvBzB,EAAI,IAAIiB,EAAGe,EAAQlB,CAAM,EACzBU,EAASP,EAAG,EAAE,CAChB,SAAWE,IAAO,GAAM,CAEtB,GAAM,CAACM,EAAQQ,CAAC,EAAIpB,EAAK,EACzBW,EAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWN,IAAO,KAEhBN,EAAK,EAEPK,EAAOC,CAAE,EACTC,EAAMQ,GAAO,IAAI,CACnB,EAEMT,EAAMe,GAAmBP,EAAMO,CAAM,EACrCC,EAASH,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUjC,EAAgB,OAAO4B,EAAM,EAAI,EAC5D,GAAI,CAACK,EAAO,OAAOL,EAAM,GAAM,MAAS,EACxC,IAAIJ,EAAI,OAAOS,CAAK,EAChB7C,EAAkB,CAAC,EACvB,KAAOoC,GACLpC,EAAM,QAAQ,OAAOoC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOI,EAAM,GAAOxC,EAAM,OAAQA,CAAK,CACzC,EACMiD,EAAS3C,GAAoBkC,EAAM,GAAOlC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrE4C,GAAW,CAACrD,EAAasD,KAC5BtD,EAAI,MAAM,IAAI,OAAOsD,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAavB,IAAwBsB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAtB,CAAE,CAAC,EAAGY,EAAMZ,CAAC,GACxEwB,EAAahB,IAAmBc,EAAK,KAAK,CAAE,EAAG,QAAS,EAAAd,CAAE,CAAC,EAAGK,EAAML,CAAC,GACrEiB,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG9B,EAAG8B,CAAC,GAG9D,QAASC,EAAO,EAAGA,EAAOxD,EAAGwD,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAI1D,EAAI,MAAMyD,EAAM,KAAK,IAAIA,EAAO,GAAIxD,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAM8C,EAAuC,CAAC,EAC9C,QAASpD,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAM+D,EAAK/D,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAMuD,EAAIvD,EACV,KAAOA,EAAI,IAAM+D,EAAK/D,CAAC,IAAM,GAAG,EAAEA,EAClCoD,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAGvD,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACoD,EAAI,OAAQ,SAGjB,GADeA,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAClC,CACV,OAAW,CAAE,EAAAD,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,CAGA,IAAMI,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAE1BE,EAAY,KAAK,KAAK,KAAK,KAAKJ,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAU/D,EAAiB4E,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAI9C,EAAU,IAAI+B,CAAO,GACvB,GAAIe,EAAc7C,EAAc,IAAI8B,CAAO,EAAKgB,EAAW,CACzDR,EAAUvC,EAAU,IAAI+B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACSxC,EAAc,IAAI8B,CAAO,GAAK,GAAI,CAC3C,IAAMiB,EAAYD,EAAY,EACxBE,EAAOnB,GAASrD,EAAKsD,CAAO,EAClC9B,EAAc,IAAI8B,EAASkB,EAAO,GAAKA,EAAOD,EAAYA,EAAY,EAAE,EACxEhD,EAAU,IAAI+B,EAASY,CAAI,CAC7B,EAGF,GAAIG,GAAed,GAAWC,CAAG,EAC/BO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,IAAMiB,EAAW,GAAKb,EACtBG,EAAUI,EAAK,MAAMR,EAAGC,EAAI,CAAC,CAAC,EAC1Ba,EAAW,IACbX,EAAUW,EAAW,CAAC,EACtBT,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEArD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTE,EAAiB,EACjBC,EAAM,IAAI,IAGV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKsD,CAAI,IAAMA,EAAO,GAAKtD,IAAQ,IAAMA,IAAQ,IAAI,EAC9D,OAAO,CAAC,CAACA,EAAK+B,CAAC,IACP,OAAO/B,GAAQ,SAAWA,EAAM,OAAOA,CAAG,GAAK9B,EACvD,EACA,KAAK,CAAC0D,EAAGC,IAAMnB,EAAS,IAAImB,EAAE,CAAC,CAAC,EAAKnB,EAAS,IAAIkB,EAAE,CAAC,CAAC,CAAE,EACxD,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC5B,EAAK+B,CAAC,IAAM,CACrBE,EAAMjC,CAAG,CACX,CAAC,EAEHJ,EAAa,IAAI,IAEjB,QAAW4D,KAAQb,EACba,EAAK,IAAM,MAAOvB,EAAMuB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAStB,EAAMsB,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAMvC,EAAGuC,EAAK,CAAC,EAqBrCvC,EAAG,EAAI,EACPA,EAAG,EAAI,EACPgB,EAAM5C,EAAY,MAAM,EACxB4C,EAAM3C,CAAO,EAEb,IAAMmE,EAAgB,CAAC,EACvB,QAASvE,EAAI,EAAGA,EAAIO,EAAI,OAAQ,EAAEP,EAChCuE,EAAI,KAAKhE,EAAIP,CAAC,CAAC,EACXO,EAAIP,CAAC,GAAK,IAAQO,EAAIP,CAAC,GAAK,KAAQQ,EAAKR,CAAC,GAAGuE,EAAI,KAAK,GAAG/D,EAAKR,CAAC,CAAE,EAMvE,MAAO,KAAOb,EAAiB,IAAI,WAAWoF,CAAG,CAAC,EAAI,4BACxD,EAEMlF,GAA2B,IAC3BC,EAAuB,6CAEvBC,GAAO,MACPC,EAAO,MACPC,GAAM,KAWCd,GAAgB,SAAU6F,EAAcC,EAAmB,CAnWxE,IAAAC,EAAAC,EAoWE,IAAMC,IAAYD,GAAAD,EAAAF,EAAQ,SAAR,YAAAE,EAAiB,KAAjB,YAAAC,EAAqB,SAAUH,EAAQ,OACzD,GAAII,GAAaA,IAAc,WAAY,OAAOJ,EAElD,IAAM5E,EAAMX,EAASuF,EAAQ,MAAQ,IAAI,EACnCK,GAAgBL,EAAQ,MAAQ,MAAM,OAC5C,GAAIK,EAAexF,GAA0B,OAAOmF,EAEpD,IAAMM,EAAgBN,EAAQ,IAAM,GAC9BhE,EAAO,KAAOZ,EAEdmF,EAAa,CAACN,GAAOI,EAAe,KACpCG,EAAMP,IAAQjF,GAAQuF,EAAahG,EAAO,YAAYyB,CAAI,EAAI,KAC9DyE,EAAKR,IAAQhF,IAAOsF,EAAahG,EAAO,WAAWyB,CAAI,EAAI,KAE3D0E,EACJT,IAAQI,GAAgB,KAAOtF,GAAOyF,EAAK,OAASC,EAAI,OAASzF,EAAOC,IAEtE0F,EACAjF,EAEJ,GAAIgF,IAAmB3F,GACrB4F,EAAW/F,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAAS6F,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmB1F,EACjCU,EAAWkF,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQxG,GAAekG,CAAa,EAAIhG,GAAegG,CAAa,CACjF,CAGA,OADuBK,EAAS,OAASjF,EAAS,QAC5B2E,EAAqBL,EAEpC,CACL,GAAGA,EACH,GAAIlF,EACJ,KAAMY,EACN,UAAW,CACT,GAAIsE,EAAQ,WAAa,CAAC,EAC1B,CAAClF,CAAoB,EAAG,CAAE,KAAM6F,CAAS,CAC3C,CACF,CACF,IC7YA,IAAME,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBC,GACpBC,EACAC,EACAC,EACmB,CAjCrB,IAAAC,EAkCE,IAAMC,EACJ,OAAOJ,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFK,EAAST,GAAS,IAAIQ,CAAG,EAK/B,GAJAN,EAAYA,IAAc,IAAUO,IAAW,GAAhB,IAA2BA,GAAA,YAAAA,EAAS,KAAM,KAIrEH,IAAoBD,GAAA,MAAAA,EAAM,OAAQ,OAAOA,EAAK,MAAS,WACrDH,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMQ,EAAS,KAAK,MAAML,EAAK,IAAc,EACvCM,EAAOL,EAAiBI,CAAM,EAChCC,IAAS,SACXN,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUM,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIT,GAAaA,IAAc,KAAMG,GAAA,MAAAA,EAAM,MAAM,CAC/C,IAAMO,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACP,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPG,EAAO,CACL,GAAGA,EACH,KAAMO,EACN,QAAS,CAAE,GAAIP,GAAQA,EAAK,QAAU,mBAAoBH,CAAU,CACtE,CACF,CACA,IAAMW,EAAW,MAAM,MAAML,EAAKH,CAAI,EAEtC,GAAIH,IAAc,KAAM,CACtB,IAAMY,GAAYP,EAAAM,EAAS,QACxB,IAAI,iBAAiB,IADN,YAAAN,EAEd,MAAM,KACP,OAAQQ,GAAMd,GAAK,SAASc,CAAC,GAChCf,GAAS,IAAIQ,EAAKM,GAAA,MAAAA,EAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMG,GAAwB,CACnCZ,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAY,CAAc,IACtDd,GAAeC,EAAOC,EAAMY,CAAa,CAC3C",
6
- "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "LibZip", "MAX_160_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "_jitDecompressor", "MIN_SIZE_FOR_COMPRESSION", "DECOMPRESSOR_ADDRESS", "_jit", "_flz", "_cd", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "stackFreq2", "trackedMemSize", "mem", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "MASK32", "bump", "m", "k", "pushOp", "op", "pushD", "d", "pushS", "v", "trackMem", "offset", "size", "addOp", "imm", "shift", "a", "b", "value", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "base", "word", "literal", "literalCost", "baseBytes", "reuseCost", "freq", "suffix0s", "step", "out", "payload", "alg", "_a", "_b", "rpcMethod", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "_sup_enc", "_enc", "supported", "compressModule", "input", "init", "transformPayload", "_a", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compressModuleWithJIT", "compress_call"]
4
+ "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"],
5
+ "mappings": "iIAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAAA,OAAS,UAAAC,OAAc,SAAvB,IAEMC,GAEAC,EAEAC,GAUAC,GAeOP,GAUAE,GASAD,GAIPO,GAsTAC,GACAC,EAEAC,GACAC,EACAC,EAWOd,GA5Xbe,GAAAC,GAAA,KAEMX,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,QAAS,EAAI,EAAG,EAAIG,EAAM,OAAQ,IAChCH,GAAOG,EAAM,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOH,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,EAASjD,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,EAAMR,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,QAAS1D,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAMqE,EAAKrE,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAM6D,EAAI7D,EACV,KAAOA,EAAI,IAAMqE,EAAKrE,CAAC,IAAM,GAAG,EAAEA,EAClC0D,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG7D,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAAC0D,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,CAAE,IAAKJ,EAAK,CAC1B,IAAMkB,GAAW,GAAKd,EACtBG,EAAUI,EAAK,MAAMR,EAAGC,EAAI,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,EAAMuB,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,CA5XxE,IAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EA6XE,IAAMC,IAAYJ,GAAAD,EAAAF,EAAQ,SAAR,YAAAE,EAAiB,KAAjB,YAAAC,EAAqB,SAAUH,EAAQ,OACzD,GAAIO,GAAaA,IAAc,WAAY,OAAOP,EAGlD,IAAMQ,IAAQJ,EAAAJ,EAAQ,SAAR,YAAAI,EAAiB,KAAMJ,EAC/BS,IAAaJ,EAAAL,EAAQ,SAAR,YAAAK,EAAiB,KAAM,SACpCK,IAAwBJ,EAAAN,EAAQ,SAAR,YAAAM,EAAiB,KAAM,CAAC,EAGhDzF,EAAMX,EAASsG,EAAM,MAAQ,IAAI,EACjCG,GAAgBH,EAAM,MAAQ,MAAM,OAC1C,GAAIG,EAAerG,IAA6BoG,EAAsBnG,CAAoB,EAAI,OAAOyF,EAErG,IAAMY,EAAgBJ,EAAM,IAAM,GAC5B/E,EAAO,KAAOZ,EAEdgG,EAAa,CAACZ,GAAOU,EAAe,KACpCG,EAAMb,IAAQxF,GAAQoG,EAAa7G,GAAO,YAAYyB,CAAI,EAAI,KAC9DsF,EAAKd,IAAQvF,GAAOmG,EAAa7G,GAAO,WAAWyB,CAAI,EAAI,KAC7DuF,EAAiBf,EAChBe,IACHA,EACEL,GAAgB,OAASA,EAAe,KAAQA,GAAgB,KAC5DnG,GACAmG,GAAgB,KAAQA,EAAe,KACrCG,EAAK,OAASC,EAAI,OAChBtG,EAEFC,GAGV,IAAIuG,EACA9F,EAEJ,GAAI6F,IAAmBxG,GACrByG,EAAW5G,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAAS0G,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmBvG,EACjCU,EAAW+F,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQrH,GAAe+G,CAAa,EAAI7G,GAAe6G,CAAa,CACjF,CAGA,OADuBK,EAAS,OAAS9F,EAAS,QAC5BwF,EAAqBX,EAEpC,CACL,GAAGA,EACH,OAAQ,CACN,CACE,GAAGQ,EACH,GAAIjG,EACJ,KAAMY,CACR,EACAsF,EACA,CACE,GAAGC,EACH,CAACnG,CAAoB,EAAG,CAAE,KAAM0G,CAAS,CAC3C,CACF,CACF,CACF,IC1bA,IAAME,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBC,GACpBC,EACAC,EACAC,EACmB,CAjCrB,IAAAC,EAkCE,IAAMC,EACJ,OAAOJ,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFK,EAAST,GAAS,IAAIQ,CAAG,EAK/B,GAJAN,EAAYA,IAAc,IAAUO,IAAW,GAAhB,IAA2BA,GAAA,YAAAA,EAAS,KAAM,KAIrEH,IAAoBD,GAAA,MAAAA,EAAM,OAAQ,OAAOA,EAAK,MAAS,WACrDH,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMQ,EAAS,KAAK,MAAML,EAAK,IAAc,EACvCM,EAAOL,EAAiBI,CAAM,EAChCC,IAAS,SACXN,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUM,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIT,GAAaA,IAAc,KAAMG,GAAA,MAAAA,EAAM,MAAM,CAC/C,IAAMO,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACP,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPG,EAAO,CACL,GAAGA,EACH,KAAMO,EACN,QAAS,CAAE,GAAIP,GAAQA,EAAK,QAAU,mBAAoBH,CAAU,CACtE,CACF,CACA,IAAMW,EAAW,MAAM,MAAML,EAAKH,CAAI,EAEtC,GAAIH,IAAc,KAAM,CACtB,IAAMY,GAAYP,EAAAM,EAAS,QACxB,IAAI,iBAAiB,IADN,YAAAN,EAEd,MAAM,KACP,OAAQQ,GAAMd,GAAK,SAASc,CAAC,GAChCf,GAAS,IAAIQ,EAAKM,GAAA,MAAAA,EAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMG,GAAwB,CACnCZ,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAY,CAAc,IACtDd,GAAeC,EAAOC,EAAMY,CAAa,CAC3C",
6
+ "names": ["jit_compressor_exports", "__export", "compress_call", "flzFwdBytecode", "jitBytecode", "rleFwdBytecode", "LibZip", "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", "_a", "_b", "_c", "_d", "_e", "rpcMethod", "txObj", "blockParam", "existingStateOverride", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "_sup_enc", "_enc", "supported", "compressModule", "input", "init", "transformPayload", "_a", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compressModuleWithJIT", "compress_call"]
7
7
  }
package/_esm/index.node.js CHANGED
@@ -1,3 +1,3 @@
1
- var me=Object.defineProperty;var pe=(n,t)=>()=>(n&&(t=n(n=0)),t);var ge=(n,t)=>{for(var s in t)me(n,s,{get:t[s],enumerable:!0})};var ie={};ge(ie,{compress_call:()=>we,flzFwdBytecode:()=>se,jitBytecode:()=>xe,rleFwdBytecode:()=>re});import{LibZip as Y}from"solady";var de,S,he,v,se,re,xe,oe,ye,ee,te,H,ne,we,ce=pe(()=>{de=(1n<<160n)-1n,S=n=>n.replace(/^0x/,"").toLowerCase(),he=n=>{let t=S(n),s=t.length,a=new Uint8Array(s/2);for(let c=0;c<s;c+=2)a[c/2]=Number.parseInt(t.slice(c,c+2),16);return a},v=n=>{let t="";for(let s=0;s<n.length;s++)t+=n[s].toString(16).padStart(2,"0");return t};se=n=>`0x365f73${S(n)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;re=n=>`0x5f5f5b368110602d575f8083813473${S(n)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;xe=function(n){return oe("0x"+S(n))},oe=function(n){let t=S(n),s=he(t),a=28,c=new Uint8Array(a+s.length);c.set(s,a);let p=c.length,f=[],l=[],b=[],M=new Map,y=0,g=new Map,R=e=>{let r=b.lastIndexOf(e);return r===-1?-1:b.length-1-r},J=new Map,P=new Map,k=new Map,N=new Map,O=new Map,le=e=>e+31&-32,W=0,T=new Map,A=()=>[b.pop(),b.pop()],E=(1n<<256n)-1n,q=(e,r)=>e.set(r,(e.get(r)||0)+1),F=e=>{f.push(e),q(J,e)},L=e=>{l.push(e||null),q(P,e||null)},I=e=>{b.push(e),q(k,e),q(M,e),++W,T.set(e,W)},G=(e,r)=>{y=le(e+r)},z=(e,r)=>{if(e===89)I(BigInt(y));else if(e===27){let[o,u]=A();I(u<<o&E)}else if(e===23){let[o,u]=A();I((o|u)&E)}else if(e>=96&&e<=127||e===95){let o=0n;for(let m of r||[])o=o<<8n|BigInt(m);let u=R(o);if(I(o),u!==-1&&e!=95){M.get(o)*2<k.get(o)&&(F(128+u),L(null));return}if(o==224n){F(48),L(null);return}}else if(e===81){let o=Number(b.pop());I(g.has(o)?g.get(o):0n)}else if(e===82){let[o,u]=A(),m=Number(o);g.set(m,u&E),G(m,32)}else if(e===83){let[o,u]=A();G(Number(o),1)}else e===243&&A();F(e),L(r||null)},B=e=>z(e),U=e=>{if(e>0&&e===y)return z(89);if(!e)return z(95,void 0);let r=BigInt(e),o=[];for(;r;)o.unshift(Number(r&0xffn)),r>>=8n;return z(95+o.length,o)},Z=e=>z(95+e.length,Array.from(e)),ue=(e,r)=>(e.match(new RegExp(r,"g"))||[]).length,be=e=>{let r=0,o=!0;for(let{s:u,e:m}of e)r+=1+m-u+1,31-m>0&&(r+=3),o||(r+=1),o=!1;return r},D=[],C=e=>(D.push({t:"num",v:e}),U(e)),$=e=>(D.push({t:"bytes",b:e}),Z(e)),_=e=>(D.push({t:"op",o:e}),B(e));for(let e=0;e<p;e+=32){let r=new Uint8Array(32);r.set(c.slice(e,Math.min(e+32,p)),0);let o=[];for(let i=0;i<32;){for(;i<32&&r[i]===0;)++i;if(i>=32)break;let h=i;for(;i<32&&r[i]!==0;)++i;o.push({s:h,e:i-1})}if(!o.length)continue;if(o.every(({s:i,e:h})=>i===h)){for(let{s:i}of o)C(r[i]),C(e+i),_(83);continue}let m=r.slice(o[0].s),K=1+m.length,X=Math.ceil(Math.log2(e+1)/8),w=v(r);if(K>8){if(N.has(w)){if(K>O.get(w)+X){C(N.get(w)),_(81),C(e),_(82);continue}}else if(O.get(w)!=-1){let i=X+3,h=ue(t,w);O.set(w,h*32>h*i?i:-1),N.set(w,e)}}if(K<=be(o))$(m);else{let i=!0;for(let{s:h,e:Q}of o){let V=31-Q;$(r.slice(h,Q+1)),V>0&&(C(V*8),_(27)),i||_(23),i=!1}}C(e),_(82)}f=[],l=[],b=[],y=0,g=new Map,Array.from(k.entries()).filter(([e,r])=>r>1&&e!==0n&&e!==224n).filter(([e,r])=>typeof e=="number"?e:Number(e)<=de).sort((e,r)=>T.get(r[0])-T.get(e[0])).slice(0,14).forEach(([e,r])=>{U(e)}),M=new Map;for(let e of D)e.t==="num"?U(e.v):e.t==="bytes"?Z(e.b):e.t==="op"&&B(e.o);B(95),B(95),U(s.length),U(a);let j=[];for(let e=0;e<f.length;++e)j.push(f[e]),f[e]>=96&&f[e]<=127&&l[e]&&j.push(...l[e]);return"0x"+v(new Uint8Array(j))+"345f355af1503d5f5f3e3d5ff3"},ye=800,ee="0x00000000000000000000000000000000000000e0",te="jit",H="flz",ne="cd";we=function(n,t){let s=n.params?.[0]?.method||n.method;if(s&&s!=="eth_call")return n;let a=S(n.data||"0x"),c=(n.data||"0x").length;if(c<ye)return n;let p=n.to||"",f="0x"+a,l=!t&&c<1150,b=t===H||l?Y.flzCompress(f):null,M=t===ne||l?Y.cdCompress(f):null,y=t||(c>=1150?te:b.length<M.length?H:ne),g,R;if(y===te)g=oe(f),R="0x"+S(p).padStart(64,"0");else{let P=y===H;R=P?b:M,g=P?se(p):re(p)}return g.length+R.length>=c?n:{...n,to:ee,data:R,stateDiff:{...n.stateDiff||{},[ee]:{code:g}}}}});import x from"node:zlib";var fe=new Map,Se=["deflate-raw","deflate","gzip"],d=typeof CompressionStream>"u"?-1:null;async function Me(n,t,s){let a=typeof n=="string"?n:n instanceof URL?n.toString():n.url,c=fe.get(a);if(d=d===-1||c===-1?-1:c?.[0]??null,s&&t?.body&&typeof t.body=="string"&&(d===-1||d===null))try{let f=JSON.parse(t.body),l=s(f);l!==void 0&&(t={...t,body:JSON.stringify(l)})}catch{}if(d&&d!==-1&&t?.body){let f=await new Response(new Blob([t.body]).stream().pipeThrough(new CompressionStream(d))).blob();t={...t,body:f,headers:{...t&&t.headers,"Content-Encoding":d}}}let p=await fetch(a,t);if(d===null){let f=p.headers.get("Accept-Encoding")?.split(",").filter(l=>Se.includes(l));fe.set(a,f?.length?f:-1)}return p}var _e=(n,t)=>Promise.resolve().then(()=>(ce(),ie)).then(({compress_call:s})=>Me(n,t,s));var ae=(n,t)=>Object.assign(n,{writable:new WritableStream({write(s){return t.write(s),Promise.resolve()},close(){return t.end(),Promise.resolve()}}),readable:new ReadableStream({type:"bytes",start(s){t.on("data",a=>s.enqueue(a)),t.once("end",()=>s.close())}})});globalThis.CompressionStream||(globalThis.CompressionStream=class{constructor(t){let s;t==="deflate"?s=x.createDeflate():t==="gzip"?s=x.createGzip():t==="br"?s=x.createBrotliCompress():s=x.createDeflateRaw(),ae(this,s)}});globalThis.DecompressionStream||(globalThis.DecompressionStream=class{constructor(t){let s;t==="deflate"?s=x.createInflate():t==="gzip"?s=x.createGunzip():t==="br"?s=x.createBrotliDecompress():s=x.createInflateRaw(),ae(this,s)}});export{Me as compressModule,_e as compressModuleWithJIT};
1
+ var de=Object.defineProperty;var he=(n,t)=>()=>(n&&(t=n(n=0)),t);var xe=(n,t)=>{for(var o in t)de(n,o,{get:t[o],enumerable:!0})};var le={};xe(le,{compress_call:()=>Re,flzFwdBytecode:()=>oe,jitBytecode:()=>Se,rleFwdBytecode:()=>ie});import{LibZip as ne}from"solady";var ye,C,we,se,oe,ie,Se,ce,Me,G,re,Z,$,Re,ae=he(()=>{ye=(1n<<128n)-1n,C=n=>n.replace(/^0x/,"").toLowerCase(),we=n=>{let t=C(n),o=t.length,f=new Uint8Array(o/2);for(let u=0;u<o;u+=2)f[u/2]=Number.parseInt(t.slice(u,u+2),16);return f},se=n=>{let t="";for(let o=0;o<n.length;o++)t+=n[o].toString(16).padStart(2,"0");return t};oe=n=>`0x365f73${C(n)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;ie=n=>`0x5f5f5b368110602d575f8083813473${C(n)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;Se=function(n){return ce("0x"+C(n))},ce=function(n){let t=C(n),o=we(t),f=28,u=new Uint8Array(f+o.length);u.set(o,f);let d=u.length,c=[],a=[],b=[],h=0,M=new Map,U=e=>{let s=b.lastIndexOf(e);return s===-1?-1:b.length-1-s},O=new Map,_=new Map,m=new Map,x=new Map,k=new Map,q=e=>e+31&-32,V=0,L=new Map,A=()=>[b.pop(),b.pop()],j=(1n<<256n)-1n,H=(e,s,r)=>e.set(s,(e.get(s)||0)+r),X=(e,s)=>H(e,s,1),Q=(e,s)=>H(e,s,-1),T=e=>{c.push(e),X(O,e)},D=e=>{a.push(e||null),X(_,e||null)},y=(e,s=1)=>{b.push(e),H(m,e,s),++V,L.set(e,V)},Y=(e,s)=>{h=q(e+s)},z=(e,s)=>{if(e===54)y(32n,0);else if(e===89)y(BigInt(h),0);else if(e===27){let[r,l]=A();c[c.length-1]==144&&(c.pop(),a.pop(),[r,l]=[l,r]),y(l<<BigInt(r)&j)}else if(e===23){let[r,l]=A();c[c.length-1]==144&&(c.pop(),a.pop()),y((r|l)&j)}else if(e>=96&&e<=127||e===95){let r=0n;for(let p of s||[])r=r<<8n|BigInt(p);if(r==224n){y(r),T(48),D(null);return}let l=U(r);if(l!==-1&&e!=95){let p=m.get(r)==0;if(l==0&&p){Q(m,r);return}if(l==1&&p){T(144);let[E,F]=A();b.push(F),b.push(E),D(null),Q(m,r);return}y(r,-1),T(128+l),D(null);return}y(r)}else if(e===81){let r=Number(b.pop());y(M.has(r)?M.get(r):0n)}else if(e===82){let[r,l]=A(),p=Number(r);M.set(p,l&j),Y(p,32)}else if(e===83){let[r,l]=A();Y(Number(r),1)}else e===243&&A();T(e),D(s||null)},be=e=>b.includes(e)||e==224||e==32n,N=e=>z(e),R=e=>{if(e>0&&e===h)return z(89);if(e==32n)return z(54);if(!e)return z(95,void 0);let s=BigInt(e),r=[];for(;s;)r.unshift(Number(s&0xffn)),s>>=8n;return z(95+r.length,r)},v=e=>z(95+e.length,Array.from(e)),pe=(e,s)=>(e.match(new RegExp(s,"g"))||[]).length,me=e=>{let s=0,r=!0;for(let{s:l,e:p}of e)s+=1+p-l+1,31-p>0&&(s+=3),r||(s+=1),r=!1;return s},K=[],B=e=>(K.push({t:"num",v:e}),R(e)),J=e=>(K.push({t:"bytes",b:e}),v(e)),P=e=>(K.push({t:"op",o:e}),N(e));R(1n);for(let e=0;e<d;e+=32){let s=new Uint8Array(32);s.set(u.slice(e,Math.min(e+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 l=s.slice(r[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=se(s);if(p>8){if(x.has(I)){if(p>k.get(I)+F){B(x.get(I)),P(81),B(e),P(82);continue}}else if(k.get(I)!=-1){let i=F+3,w=pe(t,I);k.set(I,w*32>w*i?i:-1),x.set(I,e)}}let ge=r.every(({s:i,e:w})=>i===w);if(be(l))J(l);else if(ge){for(let{s:i}of r)B(s[i]),B(e+i),P(83);continue}else if(p<=me(r))J(l);else{let i=!0;for(let{s:w,e:ee}of r){let te=31-ee;J(s.slice(w,ee+1)),te>0&&(B(te*8),P(27)),i||P(23),i=!1}}B(e),P(82)}c=[],a=[],b=[],h=0,M=new Map,Array.from(m.entries()).filter(([e,s])=>s>1&&e>1n&&e!==32n&&e!==224n).sort((e,s)=>L.get(s[0])-L.get(e[0])).filter(([e,s])=>typeof e=="number"?BigInt(e):e<=ye).slice(0,13).forEach(([e,s])=>{R(e)}),R(1n);for(let e of K)e.t==="num"?R(e.v):e.t==="bytes"?v(e.b):e.t==="op"&&N(e.o);N(95),N(95),R(o.length),R(f);let W=[];for(let e=0;e<c.length;++e)W.push(c[e]),c[e]>=96&&c[e]<=127&&a[e]&&W.push(...a[e]);return"0x"+se(new Uint8Array(W))+"345f355af13d5f5f3e3d5ff3"},Me=1150,G="0x00000000000000000000000000000000000000e0",re="jit",Z="flz",$="cd";Re=function(n,t){let o=n.params?.[0]?.method||n.method;if(o&&o!=="eth_call")return n;let f=n.params?.[0]||n,u=n.params?.[1]||"latest",d=n.params?.[2]||{},c=C(f.data||"0x"),a=(f.data||"0x").length;if(a<Me||d[G])return n;let b=f.to||"",h="0x"+c,M=!t&&a<1150,U=t===Z||M?ne.flzCompress(h):null,O=t===$||M?ne.cdCompress(h):null,_=t;_||(_=a>=1150&&(a<3e3||a>=8e3)?re:a>=3e3&&a<8e3&&U.length<O.length?Z:$);let m,x;if(_===re)m=ce(h),x="0x"+C(b).padStart(64,"0");else{let q=_===Z;x=q?U:O,m=q?oe(b):ie(b)}return m.length+x.length>=a?n:{...n,params:[{...f,to:G,data:x},u,{...d,[G]:{code:m}}]}}});import S from"node:zlib";var fe=new Map,Ie=["deflate-raw","deflate","gzip"],g=typeof CompressionStream>"u"?-1:null;async function Ce(n,t,o){let f=typeof n=="string"?n:n instanceof URL?n.toString():n.url,u=fe.get(f);if(g=g===-1||u===-1?-1:u?.[0]??null,o&&t?.body&&typeof t.body=="string"&&(g===-1||g===null))try{let c=JSON.parse(t.body),a=o(c);a!==void 0&&(t={...t,body:JSON.stringify(a)})}catch{}if(g&&g!==-1&&t?.body){let c=await new Response(new Blob([t.body]).stream().pipeThrough(new CompressionStream(g))).blob();t={...t,body:c,headers:{...t&&t.headers,"Content-Encoding":g}}}let d=await fetch(f,t);if(g===null){let c=d.headers.get("Accept-Encoding")?.split(",").filter(a=>Ie.includes(a));fe.set(f,c?.length?c:-1)}return d}var ze=(n,t)=>Promise.resolve().then(()=>(ae(),le)).then(({compress_call:o})=>Ce(n,t,o));var ue=(n,t)=>Object.assign(n,{writable:new WritableStream({write(o){return t.write(o),Promise.resolve()},close(){return t.end(),Promise.resolve()}}),readable:new ReadableStream({type:"bytes",start(o){t.on("data",f=>o.enqueue(f)),t.once("end",()=>o.close())}})});globalThis.CompressionStream||(globalThis.CompressionStream=class{constructor(t){let o;t==="deflate"?o=S.createDeflate():t==="gzip"?o=S.createGzip():t==="br"?o=S.createBrotliCompress():o=S.createDeflateRaw(),ue(this,o)}});globalThis.DecompressionStream||(globalThis.DecompressionStream=class{constructor(t){let o;t==="deflate"?o=S.createInflate():t==="gzip"?o=S.createGunzip():t==="br"?o=S.createBrotliDecompress():o=S.createInflateRaw(),ue(this,o)}});export{Ce as compressModule,ze as compressModuleWithJIT};
2
2
  //! @__PURE__
3
3
  //# sourceMappingURL=index.node.js.map