eth-compress 0.2.1 → 0.2.2

package/_esm/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/jit-compressor.ts", "../../src/index.ts"],
-  "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 128n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n  return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  const getStackIdx = (val: bigint): number => {\n    const idx = stack.lastIndexOf(val);\n    return idx === -1 ? -1 : stack.length - 1 - idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const MASK32 = (1n << 256n) - 1n;\n\n  const ctr = <K>(m: Map<K, number>, k: K, delta: number) => m.set(k, (m.get(k) || 0) + delta);\n  const inc = <K>(m: Map<K, number>, k: K) => ctr(m, k, 1);\n  const dec = <K>(m: Map<K, number>, k: K) => ctr(m, k, -1);\n  const pushOp = (op: number) => {\n    ops.push(op);\n    inc(opFreq, op);\n  };\n  const pushD = (d: number[] | null) => {\n    data.push(d || null);\n    inc(dataFreq, d || null);\n  };\n  const pushS = (v: bigint, freq: number = 1) => {\n    stack.push(v);\n    ctr(stackFreq, v, freq);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x36) {\n      pushS(32n, 0);\n    } else if (op === 0x59) {\n      pushS(BigInt(trackedMemSize), 0);\n    } else if (op === 0x1b) {\n      let [shift, val] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n        [shift, val] = [val, shift];\n      }\n      pushS((val << BigInt(shift)) & MASK32);\n    } else if (op === 0x17) {\n      // OR\n      const [a, b] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n      }\n      pushS((a | b) & MASK32);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      if (v == 224n) {\n        // Special\u2011case the literal 0xe0 (224):\n        // the decompressor is always deployed at 0x...00e0, so the final\n        // byte of ADDRESS is exactly 0xe0. Since we must send our own\n        // address with the eth_call anyway, we can synthesize this value\n        // with a single opcode instead of encoding a literal, effectively\n        // giving us one more hot constant slot on the stack.\n        pushS(v);\n        pushOp(0x30); // ADDRESS\n        pushD(null);\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        const last = stackFreq.get(v) == 0;\n        if (idx == 0 && last) {\n          dec(stackFreq, v);\n          return;\n        }\n        if (idx == 1 && last) {\n          pushOp(144);\n          const [a, b] = pop2();\n          stack.push(b);\n          stack.push(a);\n          pushD(null);\n          dec(stackFreq, v);\n          return;\n        }\n        pushS(v, -1);\n        pushOp(128 + idx);\n        pushD(null);\n        return;\n      }\n      pushS(v);\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MASK32);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op);\n    pushD(imm || null);\n  };\n  const isInStack = (w) => stack.includes(w) || w == 0xe0 || w == 32n;\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (value == 32n) return addOp(0x36);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n  pushN(1n);\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n    let literalVal = 0n;\n    for (const b of literal) literalVal = (literalVal << 8n) | BigInt(b);\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    // Convert literal bytes to bigint for stack comparison\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    if (isInStack(literal)) {\n      emitPushB(literal);\n    } else if (byte8s) {\n      for (const { s } of seg) {\n        emitPushN(word[s]);\n        emitPushN(base + s);\n        emitOp(0x53); // MSTORE8\n      }\n      continue;\n    } else if (literalCost <= estShlCost(seg)) {\n      emitPushB(literal);\n    } else {\n      let first = true;\n      for (const { s, e } of seg) {\n        const suffix0s = 31 - e;\n        emitPushB(word.slice(s, e + 1));\n        if (suffix0s > 0) {\n          emitPushN(suffix0s * 8);\n          emitOp(0x1b); // SHL\n        }\n        if (!first) emitOp(0x17); // OR\n        first = false;\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val > 1n && val !== 32n && val !== 224n)\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? BigInt(val) : val <= MAX_160_BIT;\n    })\n    .slice(0, 13)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n  pushN(1n);\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af13d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 1150;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const rpcMethod = payload.params?.[0]?.method || payload.method;\n  if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n  // Extract data and target address from params[0] if available, otherwise top-level\n  const txObj = payload.params?.[0] || payload;\n  const blockParam = payload.params?.[1] || 'latest';\n  const existingStateOverride = payload.params?.[2] || {};\n\n  // If there are any existing state overrides for the decompressor address, do not compress\n  const hex = _normHex(txObj.data || '0x');\n  const originalSize = (txObj.data || '0x').length;\n  if (originalSize < MIN_SIZE_FOR_COMPRESSION || (existingStateOverride[DECOMPRESSOR_ADDRESS])) return payload;\n\n  const targetAddress = txObj.to || '';\n  const data = '0x' + hex;\n\n  const autoSelect = !alg && originalSize < 1150;\n  const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n  const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n  let selectedMethod = alg;\n  if (!selectedMethod) {\n    selectedMethod =\n      originalSize >= 1150 && (originalSize < 3000 || originalSize >= 8000)\n        ? _jit\n        : originalSize >= 3000 && originalSize < 8000\n          ? flz!.length < cd!.length\n            ? _flz\n            : _cd\n          : _cd;\n  }\n\n  let bytecode: string;\n  let calldata: string;\n\n  if (selectedMethod === _jit) {\n    bytecode = _jitDecompressor(data);\n    calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n  } else {\n    const isFlz = selectedMethod === _flz;\n    calldata = isFlz ? flz! : cd!;\n    bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n  }\n\n  const compressedSize = bytecode.length + calldata.length;\n  if (compressedSize >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      {\n        ...txObj,\n        to: DECOMPRESSOR_ADDRESS,\n        data: calldata,\n      },\n      blockParam,\n      {\n        ...existingStateOverride,\n        [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n      },\n    ],\n  };\n};\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  if (supported && supported !== -1 && init?.body) {\n    const compressed = await new Response(\n      new Blob([init.body as string])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
-  "mappings": "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",
-  "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"]
+  "sourcesContent": ["import { LibZip } from 'solady';\nimport { MIN_BODY_SIZE } from './index';\n\nconst MAX_128_BIT = (1n << 128n) - 1n;\nconst MAX_256_BIT = (1n << 256n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\nconst not = (a: bigint): bigint => ~a & MAX_256_BIT;\nconst and = (a: bigint, b: bigint): bigint => a & b & MAX_256_BIT;\nconst or = (a: bigint, b: bigint): bigint => (a | b) & MAX_256_BIT;\nconst xor = (a: bigint, b: bigint): bigint => (a ^ b) & MAX_256_BIT;\nconst shl = (shift: bigint, value: bigint): bigint => (value << shift) & MAX_256_BIT;\nconst shr = (shift: bigint, value: bigint): bigint => (value >> shift) & MAX_256_BIT;\nconst sub = (a: bigint, b: bigint): bigint => (a - b) & MAX_256_BIT;\nconst sigext = (byteSize: bigint, value: bigint): bigint => {\n  const numBytes = Number(byteSize) + 1;\n  const mask = (1n << BigInt(numBytes * 8)) - 1n;\n  const signBit = 1n << BigInt(numBytes * 8 - 1);\n  const maskedVal = value & mask;\n  const extended = maskedVal & signBit ? maskedVal | (~mask & MAX_256_BIT) : maskedVal;\n  return extended & MAX_256_BIT;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nconst flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nconst rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  let firstPass = true;\n  const getStackIdx = (val: bigint): number => {\n    let idx = stack.lastIndexOf(val);\n    idx = idx === -1 ? -1 : stack.length - 1 - idx;\n    return idx > 15 ? -1 : idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const ctr = <K>(m: Map<K, number>, k: K, delta: number) => m.set(k, (m.get(k) || 0) + delta);\n  const inc = <K>(m: Map<K, number>, k: K) => ctr(m, k, 1);\n  const pushOp = (op: number, d?: number[] | null) => {\n    ops.push(op);\n    inc(opFreq, op);\n    const imm = d ?? null;\n    data.push(imm);\n    inc(dataFreq, imm);\n  };\n  const pushS = (v: bigint, freq: number = 1) => {\n    stack.push(v);\n    ctr(stackFreq, v, freq);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x36) {\n      pushS(32n, 0);\n    } else if (op === 0x59) {\n      pushS(BigInt(trackedMemSize), 0);\n    } else if (op === 0x0b) {\n      // SIGNEXTEND\n      const [byteSize, val] = pop2();\n      pushS(sigext(byteSize, val), 1);\n    } else if (op === 0x19) {\n      // NOT\n      const val = stack.pop()!;\n      pushS(not(val), 0);\n    } else if (op === 0x18) {\n      // XOR\n      const [a, b] = pop2();\n      pushS(xor(a, b), 1);\n    } else if (op === 0x16) {\n      // AND\n      const [a, b] = pop2();\n      pushS(and(a, b), 1);\n    } else if (op === 0x03) {\n      // SUB\n      const [a, b] = pop2();\n      pushS(sub(a, b), 1);\n    } else if (op === 0x1b) {\n      // SHL\n      let [shift, val] = pop2();\n      pushS(shl(shift, val), 1);\n    } else if (op === 0x1c) {\n      // SHR\n      let [shift, val] = pop2();\n      pushS(shr(shift, val), 1);\n    } else if (op === 0x17) {\n      // OR\n      let [a, b] = pop2();\n      pushS(or(a, b), 1);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      if (v == 224n) {\n        pushS(v, 0);\n        pushOp(0x30); // ADDRESS\n        return;\n      }\n      if (v == 32n) {\n        pushS(v, 0);\n        pushOp(0x36); // ADDRESS\n        return;\n      }\n      if (v === BigInt(trackedMemSize)) {\n        pushS(v, 0);\n        pushOp(0x59); // MemSize\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        let pushCtr = firstPass ? 1 : -1;\n        pushS(v, pushCtr);\n        pushOp(128 + idx);\n        return;\n      }\n      if (v == MAX_256_BIT) {\n        pushS(v);\n        pushOp(0x5f); // 0\n        pushOp(0x19); // NOT\n        return;\n      }\n      pushS(v);\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MAX_256_BIT);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op, imm || null);\n  };\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (value == 32n) return addOp(0x36);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n  pushN(1n);\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  const _stack = [1n, 32n, 224n];\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n    let literalVal = 0n;\n    for (const b of literal) literalVal = (literalVal << 8n) | BigInt(b);\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    const shlCost = estShlCost(seg);\n\n    const inStack = _stack.includes(literalVal);\n    if (inStack) {\n      emitPushB(literal);\n      emitPushN(base);\n      emitOp(0x52); // MSTORE\n      continue;\n    }\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    const byte8sCost = seg.length * 3; // each: PUSH1 (value), PUSH1 (offset), MSTORE8\n    if (inStack) {\n      emitPushB(literal);\n    } else {\n      // Aggregate all costs\n      let bestCost = literalCost;\n      let bestEmit: (() => void) | null = () => {\n        emitPushB(literal);\n      };\n      if (literalVal == MAX_256_BIT) {\n        bestCost = 2;\n        bestEmit = () => {\n          emitPushN(notVal);\n          emitOp(0x19);\n        };\n      }\n      // Try NOT: PUSH<n> ~val, NOT\n      const notVal = not(literalVal);\n      let notBytes = 0;\n      let tmp = notVal;\n      while (tmp > 0n) {\n        ++notBytes;\n        tmp >>= 8n;\n      }\n      notBytes = 1 + notBytes;\n      if (notBytes === 0) notBytes;\n      const notCost = notBytes + 1; // PUSH<n> + NOT\n      if (notCost < bestCost) {\n        bestCost = notCost;\n        bestEmit = () => {\n          emitPushN(notVal);\n          emitOp(0x19);\n        };\n      }\n\n      // Try SUB: PUSH1 0, PUSH<n> val, SUB\n      const subVal = sub(0n, literalVal);\n      let subBytes = 0;\n      tmp = subVal;\n      while (tmp > 0n) {\n        ++subBytes;\n        tmp >>= 8n;\n      }\n      if (subBytes === 0) subBytes = 1;\n      if (_stack.includes(subVal)) subBytes = 1;\n      const subCost = 1 + (1 + subBytes) + 1; // PUSH0 + PUSH<n> + SUB\n      if (subCost < bestCost) {\n        bestCost = subCost;\n        bestEmit = () => {\n          emitPushN(0);\n          emitPushN(subVal);\n          emitOp(0x03);\n        };\n      }\n\n      // Try SIGNEXTEND: PUSH<n> truncated, PUSH1 byteSize, SIGNEXTEND\n      for (let numBytes = 1; numBytes < literal.length; numBytes++) {\n        const mask = (1n << BigInt(numBytes * 8)) - 1n;\n        const truncated = literalVal & mask;\n        const extended = sigext(BigInt(numBytes - 1), truncated);\n        if (extended === literalVal && (truncated & (1n << BigInt(numBytes * 8 - 1))) !== 0n) {\n          let trueByteCost = 1 + numBytes;\n          if (_stack.includes(BigInt(extended))) trueByteCost = 1;\n          let signCost = trueByteCost + (1 + 1) + 1; // PUSH<n> + PUSH1 + SIGNEXTEND\n          if (signCost < bestCost) {\n            bestCost = signCost;\n            bestEmit = () => {\n              emitPushN(truncated);\n              emitPushN(numBytes - 1);\n              emitOp(0x0b);\n            };\n          }\n          break;\n        }\n      }\n\n      // Try SHIFT+NOT: PUSH<n> val, PUSH1 shift, SHL, NOT\n      for (let shiftBits = 8; shiftBits <= 248; shiftBits += 8) {\n        const shifted = shr(BigInt(shiftBits), literalVal);\n        if (shifted === 0n) break;\n\n        const notShifted = not(shifted);\n        const reconstructed = shl(BigInt(shiftBits), notShifted);\n\n        if (reconstructed === literalVal) {\n          let shiftedBytes = 0;\n          let tmpShifted = notShifted;\n          while (tmpShifted > 0n) {\n            ++shiftedBytes;\n            tmpShifted >>= 8n;\n          }\n          if (shiftedBytes === 0) shiftedBytes = 1;\n          const shiftNotCost = 1 + shiftedBytes + 2 + 1 + 1; // PUSH<n> + PUSH1 + SHL + NOT\n          if (shiftNotCost < bestCost) {\n            bestCost = shiftNotCost;\n            bestEmit = () => {\n              emitPushN(notShifted);\n              emitPushN(shiftBits);\n              emitOp(0x1b); // SHL\n              emitOp(0x19); // NOT\n            };\n          }\n        }\n      }\n\n      if (byte8s && byte8sCost < bestCost && byte8sCost <= shlCost) {\n        for (const { s } of seg) {\n          emitPushN(word[s]);\n          emitPushN(base + s);\n          emitOp(0x53); // MSTORE8\n        }\n        continue; // Skip the single MSTORE at the end\n      } else if (shlCost < bestCost) {\n        // Use SHL/OR\n        let first = true;\n        for (const { s, e } of seg) {\n          const suffix0s = 31 - e;\n          emitPushB(word.slice(s, e + 1));\n          if (suffix0s > 0) {\n            emitPushN(suffix0s * 8);\n            emitOp(0x1b); // SHL\n          }\n          if (!first) emitOp(0x17); // OR\n          first = false;\n        }\n      } else {\n        bestEmit!();\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val > 1n && val !== 32n && val !== 224n)\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? BigInt(val) : val <= MAX_128_BIT;\n    })\n    .slice(0, 15)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n  pushN(1n);\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af13d5f5f3e3d5ff3';\n};\n\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n *\n * Only applies compression to calls that:\n * - target the latest block ID\n * - have no state overrides\n * - have a target address and calldata\n * - have no other properties (nonce, gas, etc.)\n *\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const { method, params } = payload;\n  if (method && method !== 'eth_call') return payload;\n  const txObj = params?.[0] || payload;\n  const blockParam = params?.[1];\n  const overrides = params?.[2];\n\n  // Validation\n  if (\n    (blockParam && blockParam !== 'latest') ||\n    (overrides && Object.keys(overrides).length > 0) ||\n    !txObj?.to ||\n    !txObj?.data ||\n    Object.keys(txObj).some((k) => !['to', 'data', 'from'].includes(k))\n  ) {\n    return payload;\n  }\n\n  const originalSize = txObj.data.length;\n  if (originalSize < MIN_BODY_SIZE) return payload;\n\n  const inputData = '0x' + _normHex(txObj.data);\n  const to = txObj.to;\n\n  // Determine compression method and generate bytecode/calldata\n  let bytecode: string;\n  let calldata: string;\n\n  if (alg === 'jit' || (!alg && (originalSize < 3000 || originalSize >= 8000))) {\n    bytecode = _jitDecompressor(inputData);\n    calldata = '0x' + _normHex(to).padStart(64, '0');\n  } else {\n    // Need FLZ and/or CD compression\n    const flzData = alg === 'flz' || !alg ? LibZip.flzCompress(inputData) : null;\n    const cdData = alg === 'cd' || (!alg && flzData) ? LibZip.cdCompress(inputData) : null;\n\n    // Pick the best or requested one\n    const useFlz =\n      alg === 'flz' || (!alg && flzData && (!cdData || flzData.length < cdData.length));\n\n    if (useFlz) {\n      calldata = flzData!;\n      bytecode = flzFwdBytecode(to);\n    } else {\n      calldata = cdData!;\n      bytecode = rleFwdBytecode(to);\n    }\n  }\n\n  // Skip if not beneficial\n  if (bytecode.length + calldata.length >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      { ...txObj, to: DECOMPRESSOR_ADDRESS, data: calldata },\n      blockParam || 'latest',\n      { ...overrides, [DECOMPRESSOR_ADDRESS]: { code: bytecode } },\n    ],\n  };\n};\n", "export const MIN_BODY_SIZE = 1150;\n\nconst _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  const bodyStr = typeof init?.body === 'string' ? (init.body as string) : null;\n\n  if (supported && supported !== -1 && bodyStr && bodyStr.length >= MIN_BODY_SIZE) {\n    const compressed = await new Response(\n      new Blob([bodyStr])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
+  "mappings": "iIAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,KAAA,OAAS,UAAAC,OAAc,SAAvB,IAGMC,GACAC,EAEAC,EAEAC,GAUAC,GAQAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAgBAC,GAUAC,GAGAC,GA6aAC,GAkBOlB,GA7fbmB,GAAAC,GAAA,KAGMlB,IAAe,IAAM,MAAQ,GAC7BC,GAAe,IAAM,MAAQ,GAE7BC,EAAYiB,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEhB,GAAoBgB,GAA4B,CACpD,IAAMC,EAAalB,EAASiB,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAAS,EAAI,EAAG,EAAIA,EAAK,GAAK,EAC5BC,EAAM,EAAI,CAAC,EAAI,OAAO,SAASF,EAAW,MAAM,EAAG,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOE,CACT,EAEMlB,GAAoBkB,GAA8B,CACtD,IAAIH,EAAM,GACV,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EAEMd,EAAOmB,GAAsB,CAACA,EAAIvB,EAClCK,GAAM,CAACkB,EAAWC,IAAsBD,EAAIC,EAAIxB,EAChDM,GAAK,CAACiB,EAAWC,KAAuBD,EAAIC,GAAKxB,EACjDO,GAAM,CAACgB,EAAWC,KAAuBD,EAAIC,GAAKxB,EAClDQ,GAAM,CAACiB,EAAeC,IAA2BA,GAASD,EAASzB,EACnES,GAAM,CAACgB,EAAeC,IAA2BA,GAASD,EAASzB,EACnEU,GAAM,CAACa,EAAWC,IAAuBD,EAAIC,EAAKxB,EAClDW,GAAS,CAACgB,EAAkBD,IAA0B,CAC1D,IAAME,EAAW,OAAOD,CAAQ,EAAI,EAC9BE,GAAQ,IAAM,OAAOD,EAAW,CAAC,GAAK,GACtCE,EAAU,IAAM,OAAOF,EAAW,EAAI,CAAC,EACvCG,EAAYL,EAAQG,EAE1B,OADiBE,EAAYD,EAAUC,EAAa,CAACF,EAAO7B,EAAe+B,GACzD/B,CACpB,EASMY,GAAkBoB,GACtB,WAAW/B,EAAS+B,CAAO,CAAC,iYASxBnB,GAAkBmB,GACtB,mCAAmC/B,EAAS+B,CAAO,CAAC,qLAEhDlB,GAAmB,SAAUmB,EAA0B,CAC3D,IAAMf,EAAMjB,EAASgC,CAAQ,EACvBC,EAAchC,GAAiBgB,CAAG,EAOlCiB,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAiB,EACjBC,EAAM,IAAI,IACVC,EAAY,GACVC,EAAeC,GAAwB,CAC3C,IAAIC,EAAMN,EAAM,YAAYK,CAAG,EAC/B,OAAAC,EAAMA,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,EACpCA,EAAM,GAAK,GAAKA,CACzB,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,GAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAExCC,GAAc,EACZC,EAAW,IAAI,IACfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAM,CAAIC,EAAmBC,EAAMC,IAAkBF,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAKC,CAAK,EACrFC,GAAM,CAAIH,EAAmBC,IAASF,GAAIC,EAAGC,EAAG,CAAC,EACjDG,EAAS,CAACC,EAAYC,IAAwB,CAClD1B,EAAI,KAAKyB,CAAE,EACXF,GAAId,EAAQgB,CAAE,EACd,IAAME,EAAMD,GAAK,KACjBzB,EAAK,KAAK0B,CAAG,EACbJ,GAAIb,EAAUiB,CAAG,CACnB,EACMC,EAAQ,CAACC,EAAWC,EAAe,IAAM,CAC7C5B,EAAM,KAAK2B,CAAC,EACZV,GAAIR,GAAWkB,EAAGC,CAAI,EACtB,EAAEd,GACFC,EAAS,IAAIY,EAAGb,EAAW,CAC7B,EAEMe,GAAW,CAACC,EAAgBC,IAAiB,CACjD9B,EAAiBW,GAAUkB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACT,EAAYE,IAAmB,CAC5C,GAAIF,IAAO,GACTG,EAAM,IAAK,CAAC,UACHH,IAAO,GAChBG,EAAM,OAAOzB,CAAc,EAAG,CAAC,UACtBsB,IAAO,GAAM,CAEtB,GAAM,CAACpC,EAAUkB,CAAG,EAAIW,EAAK,EAC7BU,EAAMvD,GAAOgB,EAAUkB,CAAG,EAAG,CAAC,CAChC,SAAWkB,IAAO,GAAM,CAEtB,IAAMlB,EAAML,EAAM,IAAI,EACtB0B,EAAM9D,EAAIyC,CAAG,EAAG,CAAC,CACnB,SAAWkB,IAAO,GAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAM3D,GAAIgB,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,GAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAM7D,GAAIkB,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,EAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAMxD,GAAIa,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,GAAM,CAEtB,GAAI,CAACtC,EAAOoB,CAAG,EAAIW,EAAK,EACxBU,EAAM1D,GAAIiB,EAAOoB,CAAG,EAAG,CAAC,CAC1B,SAAWkB,IAAO,GAAM,CAEtB,GAAI,CAACtC,EAAOoB,CAAG,EAAIW,EAAK,EACxBU,EAAMzD,GAAIgB,EAAOoB,CAAG,EAAG,CAAC,CAC1B,SAAWkB,IAAO,GAAM,CAEtB,GAAI,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EAClBU,EAAM5D,GAAGiB,EAAGC,CAAC,EAAG,CAAC,CACnB,SAAYuC,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAW3C,KAAKyC,GAAO,CAAC,EAAGE,EAAKA,GAAK,GAAM,OAAO3C,CAAC,EACnD,GAAI2C,GAAK,KAAM,CACbD,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,GAAIK,GAAK,IAAK,CACZD,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,GAAIK,IAAM,OAAO1B,CAAc,EAAG,CAChCyB,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,IAAMhB,EAAMF,EAAYuB,CAAC,EACzB,GAAIrB,IAAQ,IAAMiB,GAAM,GAAM,CAE5BG,EAAMC,EADQxB,EAAY,EAAI,EACd,EAChBmB,EAAO,IAAMhB,CAAG,EAChB,MACF,CACA,GAAIqB,GAAKnE,EAAa,CACpBkE,EAAMC,CAAC,EACPL,EAAO,EAAI,EACXA,EAAO,EAAI,EACX,MACF,CACAI,EAAMC,CAAC,CACT,SAAWJ,IAAO,GAAM,CAEtB,IAAMJ,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B0B,EAAMxB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWI,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQ5C,CAAK,EAAI8B,EAAK,EACvBG,EAAI,OAAOW,CAAM,EACvB5B,EAAI,IAAIiB,EAAGjC,EAAQ1B,CAAW,EAC9BqE,GAASV,EAAG,EAAE,CAChB,SAAWI,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQG,CAAC,EAAIjB,EAAK,EACzBa,GAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWP,IAAO,KAEhBP,EAAK,EAEPM,EAAOC,EAAIE,GAAO,IAAI,CACxB,EACMF,EAAMW,GAAmBF,EAAME,CAAM,EACrCC,EAASjD,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUe,EAAgB,OAAO+B,EAAM,EAAI,EAC5D,GAAI9C,GAAS,IAAK,OAAO8C,EAAM,EAAI,EACnC,GAAI,CAAC9C,EAAO,OAAO8C,EAAM,GAAM,MAAS,EACxC,IAAIL,EAAI,OAAOzC,CAAK,EAChBL,EAAkB,CAAC,EACvB,KAAO8C,GACL9C,EAAM,QAAQ,OAAO8C,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAOnD,EAAM,OAAQA,CAAK,CACzC,EACMuD,GAASxC,GAAoBoC,EAAM,GAAOpC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrEyC,GAAW,CAAC3D,EAAa4D,KAC5B5D,EAAI,MAAM,IAAI,OAAO4D,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAanB,IAAwBkB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAlB,CAAE,CAAC,EAAGQ,EAAMR,CAAC,GACxEoB,EAAa/D,IAAmB6D,EAAK,KAAK,CAAE,EAAG,QAAS,EAAA7D,CAAE,CAAC,EAAGoD,GAAMpD,CAAC,GACrEgE,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG1B,EAAG0B,CAAC,GAC9Dd,EAAM,EAAE,EAER,IAAMe,EAAS,CAAC,GAAI,IAAK,IAAI,EAC7B,QAASC,EAAO,EAAGA,EAAOtD,EAAGsD,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAIxD,EAAI,MAAMuD,EAAM,KAAK,IAAIA,EAAO,GAAItD,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAM2C,EAAuC,CAAC,EAC9C,QAAS1D,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAMsE,EAAKtE,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAM6D,EAAI7D,EACV,KAAOA,EAAI,IAAMsE,EAAKtE,CAAC,IAAM,GAAG,EAAEA,EAClC0D,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG7D,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAAC0D,EAAI,OAAQ,SAGjB,IAAMa,EAAUD,EAAK,MAAMZ,EAAI,CAAC,EAAE,CAAC,EAC7Bc,EAAc,EAAID,EAAQ,OAC5BE,EAAa,GACjB,QAAWvE,KAAKqE,EAASE,EAAcA,GAAc,GAAM,OAAOvE,CAAC,EACnE,IAAMwE,GAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7Cb,EAAU3E,GAAiByF,CAAI,EAC/BK,GAAUlB,GAAWC,CAAG,EAExBkB,GAAUR,EAAO,SAASK,CAAU,EAC1C,GAAIG,GAAS,CACXX,EAAUM,CAAO,EACjBP,EAAUK,CAAI,EACdH,EAAO,EAAI,EACX,QACF,CACA,GAAIM,EAAc,GAChB,GAAI5C,EAAU,IAAI4B,CAAO,GACvB,GAAIgB,EAAc3C,EAAc,IAAI2B,CAAO,EAAKkB,GAAW,CACzDV,EAAUpC,EAAU,IAAI4B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUK,CAAI,EACdH,EAAO,EAAI,EACX,QACF,UACSrC,EAAc,IAAI2B,CAAO,GAAK,GAAI,CAC3C,IAAMqB,EAAYH,GAAY,EACxB5B,EAAOS,GAAS3D,EAAK4D,CAAO,EAClC3B,EAAc,IAAI2B,EAASV,EAAO,GAAKA,EAAO+B,EAAYA,EAAY,EAAE,EACxEjD,EAAU,IAAI4B,EAASa,CAAI,CAC7B,EAGF,IAAMS,GAASpB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EACxCiB,GAAarB,EAAI,OAAS,EAChC,GAAIkB,GACFX,EAAUM,CAAO,MACZ,CAEL,IAAIS,EAAWR,EACXS,EAAgC,IAAM,CACxChB,EAAUM,CAAO,CACnB,EACIE,GAAc/F,IAChBsG,EAAW,EACXC,EAAW,IAAM,CACfjB,EAAUkB,CAAM,EAChBhB,EAAO,EAAI,CACb,GAGF,IAAMgB,EAASpG,EAAI2F,CAAU,EACzBU,EAAW,EACXC,EAAMF,EACV,KAAOE,EAAM,IACX,EAAED,EACFC,IAAQ,GAEVD,EAAW,EAAIA,EAEf,IAAME,GAAUF,EAAW,EACvBE,GAAUL,IACZA,EAAWK,GACXJ,EAAW,IAAM,CACfjB,EAAUkB,CAAM,EAChBhB,EAAO,EAAI,CACb,GAIF,IAAMoB,EAASlG,GAAI,GAAIqF,CAAU,EAC7Bc,EAAW,EAEf,IADAH,EAAME,EACCF,EAAM,IACX,EAAEG,EACFH,IAAQ,GAENG,IAAa,IAAGA,EAAW,GAC3BnB,EAAO,SAASkB,CAAM,IAAGC,EAAW,GACxC,IAAMC,GAAU,GAAK,EAAID,GAAY,EACjCC,GAAUR,IACZA,EAAWQ,GACXP,EAAW,IAAM,CACfjB,EAAU,CAAC,EACXA,EAAUsB,CAAM,EAChBpB,EAAO,CAAI,CACb,GAIF,QAAS5D,EAAW,EAAGA,EAAWiE,EAAQ,OAAQjE,IAAY,CAC5D,IAAMC,GAAQ,IAAM,OAAOD,EAAW,CAAC,GAAK,GACtCmF,EAAYhB,EAAalE,EACzBmF,EAAWrG,GAAO,OAAOiB,EAAW,CAAC,EAAGmF,CAAS,EACvD,GAAIC,IAAajB,IAAegB,EAAa,IAAM,OAAOnF,EAAW,EAAI,CAAC,KAAQ,GAAI,CACpF,IAAIqF,EAAe,EAAIrF,EACnB8D,EAAO,SAAS,OAAOsB,CAAQ,CAAC,IAAGC,EAAe,GACtD,IAAIC,EAAWD,EAAgB,EAAS,EACpCC,EAAWZ,IACbA,EAAWY,EACXX,EAAW,IAAM,CACfjB,EAAUyB,CAAS,EACnBzB,EAAU1D,EAAW,CAAC,EACtB4D,EAAO,EAAI,CACb,GAEF,KACF,CACF,CAGA,QAAS2B,EAAY,EAAGA,GAAa,IAAKA,GAAa,EAAG,CACxD,IAAMC,EAAU3G,GAAI,OAAO0G,CAAS,EAAGpB,CAAU,EACjD,GAAIqB,IAAY,GAAI,MAEpB,IAAMC,EAAajH,EAAIgH,CAAO,EAG9B,GAFsB5G,GAAI,OAAO2G,CAAS,EAAGE,CAAU,IAEjCtB,EAAY,CAChC,IAAIuB,EAAe,EACfC,EAAaF,EACjB,KAAOE,EAAa,IAClB,EAAED,EACFC,IAAe,GAEbD,IAAiB,IAAGA,EAAe,GACvC,IAAME,GAAe,EAAIF,EAAe,EAAI,EAAI,EAC5CE,GAAelB,IACjBA,EAAWkB,GACXjB,EAAW,IAAM,CACfjB,EAAU+B,CAAU,EACpB/B,EAAU6B,CAAS,EACnB3B,EAAO,EAAI,EACXA,EAAO,EAAI,CACb,EAEJ,CACF,CAEA,GAAIY,IAAUC,GAAaC,GAAYD,IAAcJ,GAAS,CAC5D,OAAW,CAAE,EAAAd,CAAE,IAAKH,EAClBM,EAAUM,EAAKT,CAAC,CAAC,EACjBG,EAAUK,EAAOR,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,SAAWS,GAAUK,EAAU,CAE7B,IAAIpB,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,IAAMyC,EAAW,GAAKrC,EACtBG,EAAUK,EAAK,MAAMT,EAAGC,EAAI,CAAC,CAAC,EAC1BqC,EAAW,IACbnC,EAAUmC,EAAW,CAAC,EACtBjC,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,MACEqB,EAAU,CAEd,CACAjB,EAAUK,CAAI,EACdH,EAAO,EAAI,CACb,CAEAlD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTC,EAAiB,EACjBC,EAAM,IAAI,IAEV,MAAM,KAAKO,GAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKuB,CAAI,IAAMA,EAAO,GAAKvB,EAAM,IAAMA,IAAQ,KAAOA,IAAQ,IAAI,EAC3E,KAAK,CAACtB,EAAGC,IAAM+B,EAAS,IAAI/B,EAAE,CAAC,CAAC,EAAK+B,EAAS,IAAIhC,EAAE,CAAC,CAAC,CAAE,EACxD,OAAO,CAAC,CAACsB,EAAK4B,CAAC,IACP,OAAO5B,GAAQ,SAAW,OAAOA,CAAG,EAAIA,GAAO9C,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC8C,EAAK4B,CAAC,IAAM,CACrBE,EAAM9B,CAAG,CACX,CAAC,EACH8B,EAAM,EAAE,EAER,QAAW+C,KAAQrC,EACbqC,EAAK,IAAM,MAAO/C,EAAM+C,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAS9C,GAAM8C,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAM3D,EAAG2D,EAAK,CAAC,EAoBrC3D,EAAG,EAAI,EACPA,EAAG,EAAI,EACPY,EAAMzC,EAAY,MAAM,EACxByC,EAAMxC,CAAO,EAEb,IAAMwF,EAAgB,CAAC,EACvB,QAASrG,EAAI,EAAGA,EAAIgB,EAAI,OAAQ,EAAEhB,EAChCqG,EAAI,KAAKrF,EAAIhB,CAAC,CAAC,EACXgB,EAAIhB,CAAC,GAAK,IAAQgB,EAAIhB,CAAC,GAAK,KAAQiB,EAAKjB,CAAC,GAAGqG,EAAI,KAAK,GAAGpF,EAAKjB,CAAC,CAAE,EAMvE,MAAO,KAAOnB,GAAiB,IAAI,WAAWwH,CAAG,CAAC,EAAI,0BACxD,EAEM5G,GAAuB,6CAkBhBlB,GAAgB,SAAU+H,EAAcC,EAAmB,CACtE,GAAM,CAAE,OAAAC,EAAQ,OAAAC,CAAO,EAAIH,EAC3B,GAAIE,GAAUA,IAAW,WAAY,OAAOF,EAC5C,IAAMI,GAAQD,GAAA,YAAAA,EAAS,KAAMH,EACvBK,EAAaF,GAAA,YAAAA,EAAS,GACtBG,EAAYH,GAAA,YAAAA,EAAS,GAG3B,GACGE,GAAcA,IAAe,UAC7BC,GAAa,OAAO,KAAKA,CAAS,EAAE,OAAS,GAC9C,EAACF,GAAA,MAAAA,EAAO,KACR,EAACA,GAAA,MAAAA,EAAO,OACR,OAAO,KAAKA,CAAK,EAAE,KAAMrE,GAAM,CAAC,CAAC,KAAM,OAAQ,MAAM,EAAE,SAASA,CAAC,CAAC,EAElE,OAAOiE,EAGT,IAAMO,EAAeH,EAAM,KAAK,OAChC,GAAIG,EAAe,KAAe,OAAOP,EAEzC,IAAMQ,EAAY,KAAOnI,EAAS+H,EAAM,IAAI,EACtCK,EAAKL,EAAM,GAGbM,EACArG,EAEJ,GAAI4F,IAAQ,OAAU,CAACA,IAAQM,EAAe,KAAQA,GAAgB,KACpEG,EAAWxH,GAAiBsH,CAAS,EACrCnG,EAAW,KAAOhC,EAASoI,CAAE,EAAE,SAAS,GAAI,GAAG,MAC1C,CAEL,IAAME,EAAUV,IAAQ,OAAS,CAACA,EAAM/H,GAAO,YAAYsI,CAAS,EAAI,KAClEI,EAASX,IAAQ,MAAS,CAACA,GAAOU,EAAWzI,GAAO,WAAWsI,CAAS,EAAI,KAIhFP,IAAQ,OAAU,CAACA,GAAOU,IAAY,CAACC,GAAUD,EAAQ,OAASC,EAAO,SAGzEvG,EAAWsG,EACXD,EAAW1H,GAAeyH,CAAE,IAE5BpG,EAAWuG,EACXF,EAAWzH,GAAewH,CAAE,EAEhC,CAGA,OAAIC,EAAS,OAASrG,EAAS,QAAUkG,EAAqBP,EAEvD,CACL,GAAGA,EACH,OAAQ,CACN,CAAE,GAAGI,EAAO,GAAIjH,GAAsB,KAAMkB,CAAS,EACrDgG,GAAc,SACd,CAAE,GAAGC,EAAW,CAACnH,EAAoB,EAAG,CAAE,KAAMuH,CAAS,CAAE,CAC7D,CACF,CACF,IC1hBA,eAAsBG,GACpBC,EACAC,EACAC,EACmB,CAnCrB,IAAAC,EAoCE,IAAMC,EACJ,OAAOJ,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFK,EAASC,GAAS,IAAIF,CAAG,EAK/B,GAJAG,EAAYA,IAAc,IAAUF,IAAW,GAAhB,IAA2BA,GAAA,YAAAA,EAAS,KAAM,KAIrEH,IAAoBD,GAAA,MAAAA,EAAM,OAAQ,OAAOA,EAAK,MAAS,WACrDM,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMC,EAAS,KAAK,MAAMP,EAAK,IAAc,EACvCQ,EAAOP,EAAiBM,CAAM,EAChCC,IAAS,SACXR,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUQ,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,IAAMC,EAAU,OAAOT,GAAA,YAAAA,EAAM,OAAS,SAAYA,EAAK,KAAkB,KAEzE,GAAIM,GAAaA,IAAc,IAAMG,GAAWA,EAAQ,QAAU,KAAe,CAC/E,IAAMC,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACD,CAAO,CAAC,EACf,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPN,EAAO,CACL,GAAGA,EACH,KAAMU,EACN,QAAS,CAAE,GAAIV,GAAQA,EAAK,QAAU,mBAAoBM,CAAU,CACtE,CACF,CACA,IAAMK,EAAW,MAAM,MAAMR,EAAKH,CAAI,EAEtC,GAAIM,IAAc,KAAM,CACtB,IAAMM,GAAYV,EAAAS,EAAS,QACxB,IAAI,iBAAiB,IADN,YAAAT,EAEd,MAAM,KACP,OAAQW,GAAMC,GAAK,SAASD,CAAC,GAChCR,GAAS,IAAIF,EAAKS,GAAA,MAAAA,EAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAtFA,IAAaI,GAEPV,GACAS,GACFR,EA0GSU,GA9GbC,GAAAC,GAAA,KAAaH,GAAgB,KAEvBV,GAAW,IAAI,IACfS,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CR,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA0GvEU,GAAwB,CACnCjB,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAmB,CAAc,IACtDrB,GAAeC,EAAOC,EAAMmB,CAAa,CAC3C",
+  "names": ["jit_compressor_exports", "__export", "compress_call", "LibZip", "MAX_128_BIT", "MAX_256_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "not", "and", "or", "xor", "shl", "shr", "sub", "sigext", "flzFwdBytecode", "rleFwdBytecode", "_jitDecompressor", "DECOMPRESSOR_ADDRESS", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "a", "b", "shift", "value", "byteSize", "numBytes", "mask", "signBit", "maskedVal", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "trackedMemSize", "mem", "firstPass", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "ctr", "m", "k", "delta", "inc", "pushOp", "op", "d", "imm", "pushS", "v", "freq", "trackMem", "offset", "size", "addOp", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "_stack", "base", "word", "literal", "literalCost", "literalVal", "baseBytes", "shlCost", "inStack", "reuseCost", "byte8s", "byte8sCost", "bestCost", "bestEmit", "notVal", "notBytes", "tmp", "notCost", "subVal", "subBytes", "subCost", "truncated", "extended", "trueByteCost", "signCost", "shiftBits", "shifted", "notShifted", "shiftedBytes", "tmpShifted", "shiftNotCost", "suffix0s", "step", "out", "payload", "alg", "method", "params", "txObj", "blockParam", "overrides", "originalSize", "inputData", "to", "bytecode", "flzData", "cdData", "compressModule", "input", "init", "transformPayload", "_a", "url", "cached", "_sup_enc", "supported", "parsed", "next", "bodyStr", "compressed", "response", "encodings", "e", "_enc", "MIN_BODY_SIZE", "compressModuleWithJIT", "init_index", "__esmMin", "compress_call"]
 }

package/_esm/index.node.js

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

package/_esm/index.node.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../src/jit-compressor.ts", "../../src/index.node.ts", "../../src/index.ts"],
-  "sourcesContent": ["import { LibZip } from 'solady';\n\nconst MAX_160_BIT = (1n << 128n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nexport const rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\n/**\n * JIT Compiles decompressor bytecode\n * @param calldata - Calldata to compress\n * @pure\n */\n//! @__PURE__\nexport const jitBytecode = function (calldata: string): string {\n  return _jitDecompressor('0x' + _normHex(calldata));\n};\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  const getStackIdx = (val: bigint): number => {\n    const idx = stack.lastIndexOf(val);\n    return idx === -1 ? -1 : stack.length - 1 - idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const MASK32 = (1n << 256n) - 1n;\n\n  const ctr = <K>(m: Map<K, number>, k: K, delta: number) => m.set(k, (m.get(k) || 0) + delta);\n  const inc = <K>(m: Map<K, number>, k: K) => ctr(m, k, 1);\n  const dec = <K>(m: Map<K, number>, k: K) => ctr(m, k, -1);\n  const pushOp = (op: number) => {\n    ops.push(op);\n    inc(opFreq, op);\n  };\n  const pushD = (d: number[] | null) => {\n    data.push(d || null);\n    inc(dataFreq, d || null);\n  };\n  const pushS = (v: bigint, freq: number = 1) => {\n    stack.push(v);\n    ctr(stackFreq, v, freq);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x36) {\n      pushS(32n, 0);\n    } else if (op === 0x59) {\n      pushS(BigInt(trackedMemSize), 0);\n    } else if (op === 0x1b) {\n      let [shift, val] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n        [shift, val] = [val, shift];\n      }\n      pushS((val << BigInt(shift)) & MASK32);\n    } else if (op === 0x17) {\n      // OR\n      const [a, b] = pop2();\n      if (ops[ops.length - 1] == 144) {\n        ops.pop();\n        data.pop();\n      }\n      pushS((a | b) & MASK32);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      if (v == 224n) {\n        // Special\u2011case the literal 0xe0 (224):\n        // the decompressor is always deployed at 0x...00e0, so the final\n        // byte of ADDRESS is exactly 0xe0. Since we must send our own\n        // address with the eth_call anyway, we can synthesize this value\n        // with a single opcode instead of encoding a literal, effectively\n        // giving us one more hot constant slot on the stack.\n        pushS(v);\n        pushOp(0x30); // ADDRESS\n        pushD(null);\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        const last = stackFreq.get(v) == 0;\n        if (idx == 0 && last) {\n          dec(stackFreq, v);\n          return;\n        }\n        if (idx == 1 && last) {\n          pushOp(144);\n          const [a, b] = pop2();\n          stack.push(b);\n          stack.push(a);\n          pushD(null);\n          dec(stackFreq, v);\n          return;\n        }\n        pushS(v, -1);\n        pushOp(128 + idx);\n        pushD(null);\n        return;\n      }\n      pushS(v);\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MASK32);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op);\n    pushD(imm || null);\n  };\n  const isInStack = (w) => stack.includes(w) || w == 0xe0 || w == 32n;\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (value == 32n) return addOp(0x36);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n  pushN(1n);\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n    let literalVal = 0n;\n    for (const b of literal) literalVal = (literalVal << 8n) | BigInt(b);\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    // Convert literal bytes to bigint for stack comparison\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    if (isInStack(literal)) {\n      emitPushB(literal);\n    } else if (byte8s) {\n      for (const { s } of seg) {\n        emitPushN(word[s]);\n        emitPushN(base + s);\n        emitOp(0x53); // MSTORE8\n      }\n      continue;\n    } else if (literalCost <= estShlCost(seg)) {\n      emitPushB(literal);\n    } else {\n      let first = true;\n      for (const { s, e } of seg) {\n        const suffix0s = 31 - e;\n        emitPushB(word.slice(s, e + 1));\n        if (suffix0s > 0) {\n          emitPushN(suffix0s * 8);\n          emitOp(0x1b); // SHL\n        }\n        if (!first) emitOp(0x17); // OR\n        first = false;\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val > 1n && val !== 32n && val !== 224n)\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? BigInt(val) : val <= MAX_160_BIT;\n    })\n    .slice(0, 13)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n  pushN(1n);\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af13d5f5f3e3d5ff3';\n};\n\nconst MIN_SIZE_FOR_COMPRESSION = 1150;\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\nconst _jit = 'jit';\nconst _flz = 'flz';\nconst _cd = 'cd';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const rpcMethod = payload.params?.[0]?.method || payload.method;\n  if (rpcMethod && rpcMethod !== 'eth_call') return payload;\n\n  // Extract data and target address from params[0] if available, otherwise top-level\n  const txObj = payload.params?.[0] || payload;\n  const blockParam = payload.params?.[1] || 'latest';\n  const existingStateOverride = payload.params?.[2] || {};\n\n  // If there are any existing state overrides for the decompressor address, do not compress\n  const hex = _normHex(txObj.data || '0x');\n  const originalSize = (txObj.data || '0x').length;\n  if (originalSize < MIN_SIZE_FOR_COMPRESSION || (existingStateOverride[DECOMPRESSOR_ADDRESS])) return payload;\n\n  const targetAddress = txObj.to || '';\n  const data = '0x' + hex;\n\n  const autoSelect = !alg && originalSize < 1150;\n  const flz = alg === _flz || autoSelect ? LibZip.flzCompress(data) : null;\n  const cd = alg === _cd || autoSelect ? LibZip.cdCompress(data) : null;\n  let selectedMethod = alg;\n  if (!selectedMethod) {\n    selectedMethod =\n      originalSize >= 1150 && (originalSize < 3000 || originalSize >= 8000)\n        ? _jit\n        : originalSize >= 3000 && originalSize < 8000\n          ? flz!.length < cd!.length\n            ? _flz\n            : _cd\n          : _cd;\n  }\n\n  let bytecode: string;\n  let calldata: string;\n\n  if (selectedMethod === _jit) {\n    bytecode = _jitDecompressor(data);\n    calldata = '0x' + _normHex(targetAddress).padStart(64, '0');\n  } else {\n    const isFlz = selectedMethod === _flz;\n    calldata = isFlz ? flz! : cd!;\n    bytecode = isFlz ? flzFwdBytecode(targetAddress) : rleFwdBytecode(targetAddress);\n  }\n\n  const compressedSize = bytecode.length + calldata.length;\n  if (compressedSize >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      {\n        ...txObj,\n        to: DECOMPRESSOR_ADDRESS,\n        data: calldata,\n      },\n      blockParam,\n      {\n        ...existingStateOverride,\n        [DECOMPRESSOR_ADDRESS]: { code: bytecode },\n      },\n    ],\n  };\n};\n", "import zlib from 'node:zlib';\n\n// Polyfill for CompressionStream/DecompressionStream in Node.js\nconst make = (ctx: any, handle: any) =>\n  Object.assign(ctx, {\n    writable: new WritableStream({\n      write(chunk) {\n        handle.write(chunk);\n        return Promise.resolve();\n      },\n      close() {\n        handle.end();\n        return Promise.resolve();\n      },\n    }),\n    readable: new ReadableStream({\n      type: 'bytes',\n      start(ctrl) {\n        handle.on('data', (chunk: any) => ctrl.enqueue(chunk));\n        handle.once('end', () => ctrl.close());\n      },\n    }),\n  });\n\nif (!globalThis.CompressionStream) {\n  globalThis.CompressionStream = class CompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createDeflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliCompress();\n      } else {\n        handle = zlib.createDeflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nif (!globalThis.DecompressionStream) {\n  globalThis.DecompressionStream = class DecompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createInflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGunzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliDecompress();\n      } else {\n        handle = zlib.createInflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nexport * from './index';\n", "const _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  if (supported && supported !== -1 && init?.body) {\n    const compressed = await new Response(\n      new Blob([init.body as string])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n"],
-  "mappings": "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,QAASI,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAChCJ,GAAOG,EAAMC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOJ,CACT,EASahB,GAAkBqB,GAC7B,WAAWhB,EAASgB,CAAO,CAAC,iYASjBnB,GAAkBmB,GAC7B,mCAAmChB,EAASgB,CAAO,CAAC,qLAQzCpB,GAAc,SAAUqB,EAA0B,CAC7D,OAAOd,GAAiB,KAAOH,EAASiB,CAAQ,CAAC,CACnD,EAEMd,GAAmB,SAAUc,EAA0B,CAC3D,IAAMN,EAAMX,EAASiB,CAAQ,EACvBC,EAAcjB,GAAiBU,CAAG,EAOlCQ,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAiB,EACjBC,EAAM,IAAI,IACRC,EAAeC,GAAwB,CAC3C,IAAMC,EAAML,EAAM,YAAYI,CAAG,EACjC,OAAOC,IAAQ,GAAK,GAAKL,EAAM,OAAS,EAAIK,CAC9C,EAEMC,EAAS,IAAI,IACbC,EAAW,IAAI,IACfC,EAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,EAAaC,GAAeA,EAAI,GAAM,IAExCC,EAAc,EACZC,EAAW,IAAI,IAEfC,EAAO,IAAwB,CAACf,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DgB,GAAU,IAAM,MAAQ,GAExBC,EAAM,CAAIC,EAAmBC,EAAMC,IAAkBF,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAKC,CAAK,EACrFC,EAAM,CAAIH,EAAmBC,IAASF,EAAIC,EAAGC,EAAG,CAAC,EACjDG,EAAM,CAAIJ,EAAmBC,IAASF,EAAIC,EAAGC,EAAG,EAAE,EAClDI,EAAUC,GAAe,CAC7B1B,EAAI,KAAK0B,CAAE,EACXH,EAAIf,EAAQkB,CAAE,CAChB,EACMC,EAASC,GAAuB,CACpC3B,EAAK,KAAK2B,GAAK,IAAI,EACnBL,EAAId,EAAUmB,GAAK,IAAI,CACzB,EACMC,EAAQ,CAACC,EAAWC,EAAe,IAAM,CAC7C7B,EAAM,KAAK4B,CAAC,EACZX,EAAIT,EAAWoB,EAAGC,CAAI,EACtB,EAAEhB,EACFC,EAAS,IAAIc,EAAGf,CAAW,CAC7B,EAEMiB,EAAW,CAACC,EAAgBC,IAAiB,CACjD/B,EAAiBU,EAAUoB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACT,EAAYU,IAAmB,CAC5C,GAAIV,IAAO,GACTG,EAAM,IAAK,CAAC,UACHH,IAAO,GAChBG,EAAM,OAAO1B,CAAc,EAAG,CAAC,UACtBuB,IAAO,GAAM,CACtB,GAAI,CAACW,EAAO/B,CAAG,EAAIW,EAAK,EACpBjB,EAAIA,EAAI,OAAS,CAAC,GAAK,MACzBA,EAAI,IAAI,EACRC,EAAK,IAAI,EACT,CAACoC,EAAO/B,CAAG,EAAI,CAACA,EAAK+B,CAAK,GAE5BR,EAAOvB,GAAO,OAAO+B,CAAK,EAAKnB,CAAM,CACvC,SAAWQ,IAAO,GAAM,CAEtB,GAAM,CAACY,EAAGC,CAAC,EAAItB,EAAK,EAChBjB,EAAIA,EAAI,OAAS,CAAC,GAAK,MACzBA,EAAI,IAAI,EACRC,EAAK,IAAI,GAEX4B,GAAOS,EAAIC,GAAKrB,CAAM,CACxB,SAAYQ,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAWS,KAAKH,GAAO,CAAC,EAAGN,EAAKA,GAAK,GAAM,OAAOS,CAAC,EACnD,GAAIT,GAAK,KAAM,CAObD,EAAMC,CAAC,EACPL,EAAO,EAAI,EACXE,EAAM,IAAI,EACV,MACF,CACA,IAAMpB,EAAMF,EAAYyB,CAAC,EACzB,GAAIvB,IAAQ,IAAMmB,GAAM,GAAM,CAC5B,IAAMc,EAAO9B,EAAU,IAAIoB,CAAC,GAAK,EACjC,GAAIvB,GAAO,GAAKiC,EAAM,CACpBhB,EAAId,EAAWoB,CAAC,EAChB,MACF,CACA,GAAIvB,GAAO,GAAKiC,EAAM,CACpBf,EAAO,GAAG,EACV,GAAM,CAACa,EAAGC,CAAC,EAAItB,EAAK,EACpBf,EAAM,KAAKqC,CAAC,EACZrC,EAAM,KAAKoC,CAAC,EACZX,EAAM,IAAI,EACVH,EAAId,EAAWoB,CAAC,EAChB,MACF,CACAD,EAAMC,EAAG,EAAE,EACXL,EAAO,IAAMlB,CAAG,EAChBoB,EAAM,IAAI,EACV,MACF,CACAE,EAAMC,CAAC,CACT,SAAWJ,IAAO,GAAM,CAEtB,IAAML,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B2B,EAAMzB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQQ,CAAK,EAAIxB,EAAK,EACvBI,EAAI,OAAOY,CAAM,EACvB7B,EAAI,IAAIiB,EAAGoB,EAAQvB,CAAM,EACzBc,EAASX,EAAG,EAAE,CAChB,SAAWK,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQS,CAAC,EAAIzB,EAAK,EACzBe,EAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWP,IAAO,KAEhBT,EAAK,EAEPQ,EAAOC,CAAE,EACTC,EAAMS,GAAO,IAAI,CACnB,EACMO,GAAaC,GAAM1C,EAAM,SAAS0C,CAAC,GAAKA,GAAK,KAAQA,GAAK,IAC1DlB,EAAMmB,GAAmBV,EAAMU,CAAM,EACrCC,EAASL,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUtC,EAAgB,OAAOgC,EAAM,EAAI,EAC5D,GAAIM,GAAS,IAAK,OAAON,EAAM,EAAI,EACnC,GAAI,CAACM,EAAO,OAAON,EAAM,GAAM,MAAS,EACxC,IAAIL,EAAI,OAAOW,CAAK,EAChBjD,EAAkB,CAAC,EACvB,KAAOsC,GACLtC,EAAM,QAAQ,OAAOsC,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAO3C,EAAM,OAAQA,CAAK,CACzC,EACMuD,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,QAAS,EAAI,EAAG,EAAI,IAAM,CACxB,KAAO,EAAI,IAAMW,EAAK,CAAC,IAAM,GAAG,EAAE,EAClC,GAAI,GAAK,GAAI,MACb,IAAMR,EAAI,EACV,KAAO,EAAI,IAAMQ,EAAK,CAAC,IAAM,GAAG,EAAE,EAClCX,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAACH,EAAI,OAAQ,SAGjB,IAAMY,EAAUD,EAAK,MAAMX,EAAI,CAAC,EAAE,CAAC,EAC7Ba,EAAc,EAAID,EAAQ,OAC5BE,EAAa,GACjB,QAAW1B,KAAKwB,EAASE,EAAcA,GAAc,GAAM,OAAO1B,CAAC,EACnE,IAAM2B,EAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7CZ,EAAUrE,GAAiBkF,CAAI,EACrC,GAAIE,EAAc,GAChB,GAAIrD,EAAU,IAAIsC,CAAO,GACvB,GAAIe,EAAcpD,EAAc,IAAIqC,CAAO,EAAKiB,EAAW,CACzDT,EAAU9C,EAAU,IAAIsC,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUI,CAAI,EACdF,EAAO,EAAI,EACX,QACF,UACS/C,EAAc,IAAIqC,CAAO,GAAK,GAAI,CAC3C,IAAMkB,EAAYD,EAAY,EACxBnC,EAAOiB,GAAS3D,EAAK4D,CAAO,EAClCrC,EAAc,IAAIqC,EAASlB,EAAO,GAAKA,EAAOoC,EAAYA,EAAY,EAAE,EACxExD,EAAU,IAAIsC,EAASY,CAAI,CAC7B,EAKF,IAAMO,GAASjB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EAC9C,GAAIZ,GAAUoB,CAAO,EACnBL,EAAUK,CAAO,UACRK,GAAQ,CACjB,OAAW,CAAE,EAAAd,CAAE,IAAKH,EAClBM,EAAUK,EAAKR,CAAC,CAAC,EACjBG,EAAUI,EAAOP,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,SAAWK,GAAed,GAAWC,CAAG,EACtCO,EAAUK,CAAO,MACZ,CACL,IAAIV,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,EAAE,IAAKJ,EAAK,CAC1B,IAAMkB,GAAW,GAAKd,GACtBG,EAAUI,EAAK,MAAMR,EAAGC,GAAI,CAAC,CAAC,EAC1Bc,GAAW,IACbZ,EAAUY,GAAW,CAAC,EACtBV,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,CACAI,EAAUI,CAAI,EACdF,EAAO,EAAI,CACb,CAEA3D,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTC,EAAiB,EACjBC,EAAM,IAAI,IAEV,MAAM,KAAKM,EAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKyB,CAAI,IAAMA,EAAO,GAAKzB,EAAM,IAAMA,IAAQ,KAAOA,IAAQ,IAAI,EAC3E,KAAK,CAACgC,EAAGC,IAAMvB,EAAS,IAAIuB,EAAE,CAAC,CAAC,EAAKvB,EAAS,IAAIsB,EAAE,CAAC,CAAC,CAAE,EACxD,OAAO,CAAC,CAAChC,EAAKoC,CAAC,IACP,OAAOpC,GAAQ,SAAW,OAAOA,CAAG,EAAIA,GAAO7B,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC6B,EAAKoC,CAAC,IAAM,CACrBI,EAAMxC,CAAG,CACX,CAAC,EACHwC,EAAM,EAAE,EAER,QAAWwB,KAAQd,EACbc,EAAK,IAAM,MAAOxB,EAAMwB,EAAK,CAAC,EACzBA,EAAK,IAAM,QAASvB,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,CACtE,IAAMC,EAAYF,EAAQ,SAAS,CAAC,GAAG,QAAUA,EAAQ,OACzD,GAAIE,GAAaA,IAAc,WAAY,OAAOF,EAGlD,IAAMG,EAAQH,EAAQ,SAAS,CAAC,GAAKA,EAC/BI,EAAaJ,EAAQ,SAAS,CAAC,GAAK,SACpCK,EAAwBL,EAAQ,SAAS,CAAC,GAAK,CAAC,EAGhDnF,EAAMX,EAASiG,EAAM,MAAQ,IAAI,EACjCG,GAAgBH,EAAM,MAAQ,MAAM,OAC1C,GAAIG,EAAehG,IAA6B+F,EAAsB9F,CAAoB,EAAI,OAAOyF,EAErG,IAAMO,EAAgBJ,EAAM,IAAM,GAC5B1E,EAAO,KAAOZ,EAEd2F,EAAa,CAACP,GAAOK,EAAe,KACpCG,EAAMR,IAAQxF,GAAQ+F,EAAaxG,GAAO,YAAYyB,CAAI,EAAI,KAC9DiF,EAAKT,IAAQvF,GAAO8F,EAAaxG,GAAO,WAAWyB,CAAI,EAAI,KAC7DkF,EAAiBV,EAChBU,IACHA,EACEL,GAAgB,OAASA,EAAe,KAAQA,GAAgB,KAC5D9F,GACA8F,GAAgB,KAAQA,EAAe,KACrCG,EAAK,OAASC,EAAI,OAChBjG,EAEFC,GAGV,IAAIkG,EACAzF,EAEJ,GAAIwF,IAAmBnG,GACrBoG,EAAWvG,GAAiBoB,CAAI,EAChCN,EAAW,KAAOjB,EAASqG,CAAa,EAAE,SAAS,GAAI,GAAG,MACrD,CACL,IAAMM,EAAQF,IAAmBlG,EACjCU,EAAW0F,EAAQJ,EAAOC,EAC1BE,EAAWC,EAAQhH,GAAe0G,CAAa,EAAIxG,GAAewG,CAAa,CACjF,CAGA,OADuBK,EAAS,OAASzF,EAAS,QAC5BmF,EAAqBN,EAEpC,CACL,GAAGA,EACH,OAAQ,CACN,CACE,GAAGG,EACH,GAAI5F,EACJ,KAAMY,CACR,EACAiF,EACA,CACE,GAAGC,EACH,CAAC9F,CAAoB,EAAG,CAAE,KAAMqG,CAAS,CAC3C,CACF,CACF,CACF,IC1bA,OAAOE,MAAU,YCAjB,IAAMC,GAAW,IAAI,IACfC,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CC,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA2BpF,eAAsBC,GACpBC,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASR,GAAS,IAAIO,CAAG,EAK/B,GAJAL,EAAYA,IAAc,IAAUM,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDH,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMO,EAAS,KAAK,MAAMJ,EAAK,IAAc,EACvCK,EAAOJ,EAAiBG,CAAM,EAChCC,IAAS,SACXL,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUK,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,GAAIR,GAAaA,IAAc,IAAMG,GAAM,KAAM,CAC/C,IAAMM,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACN,EAAK,IAAc,CAAC,EAC3B,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPG,EAAO,CACL,GAAGA,EACH,KAAMM,EACN,QAAS,CAAE,GAAIN,GAAQA,EAAK,QAAU,mBAAoBH,CAAU,CACtE,CACF,CACA,IAAMU,EAAW,MAAM,MAAML,EAAKF,CAAI,EAEtC,GAAIH,IAAc,KAAM,CACtB,IAAMW,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMb,GAAK,SAASa,CAAC,CAAC,EACjCd,GAAS,IAAIO,EAAKM,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAwBO,IAAMG,GAAwB,CACnCX,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAW,CAAc,IACtDb,GAAeC,EAAOC,EAAMW,CAAa,CAC3C,ED7GF,IAAMC,GAAO,CAACC,EAAUC,IACtB,OAAO,OAAOD,EAAK,CACjB,SAAU,IAAI,eAAe,CAC3B,MAAME,EAAO,CACX,OAAAD,EAAO,MAAMC,CAAK,EACX,QAAQ,QAAQ,CACzB,EACA,OAAQ,CACN,OAAAD,EAAO,IAAI,EACJ,QAAQ,QAAQ,CACzB,CACF,CAAC,EACD,SAAU,IAAI,eAAe,CAC3B,KAAM,QACN,MAAME,EAAM,CACVF,EAAO,GAAG,OAASC,GAAeC,EAAK,QAAQD,CAAK,CAAC,EACrDD,EAAO,KAAK,MAAO,IAAME,EAAK,MAAM,CAAC,CACvC,CACF,CAAC,CACH,CAAC,EAEE,WAAW,oBACd,WAAW,kBAAoB,KAAwB,CACrD,YAAYC,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAASI,EAAK,cAAc,EACnBD,IAAW,OACpBH,EAASI,EAAK,WAAW,EAChBD,IAAW,KACpBH,EAASI,EAAK,qBAAqB,EAEnCJ,EAASI,EAAK,iBAAiB,EAEjCN,GAAK,KAAME,CAAM,CACnB,CACF,GAGG,WAAW,sBACd,WAAW,oBAAsB,KAA0B,CACzD,YAAYG,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAASI,EAAK,cAAc,EACnBD,IAAW,OACpBH,EAASI,EAAK,aAAa,EAClBD,IAAW,KACpBH,EAASI,EAAK,uBAAuB,EAErCJ,EAASI,EAAK,iBAAiB,EAEjCN,GAAK,KAAME,CAAM,CACnB,CACF",
-  "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", "rpcMethod", "txObj", "blockParam", "existingStateOverride", "originalSize", "targetAddress", "autoSelect", "flz", "cd", "selectedMethod", "bytecode", "isFlz", "zlib", "_sup_enc", "_enc", "supported", "compressModule", "input", "init", "transformPayload", "url", "cached", "parsed", "next", "compressed", "response", "encodings", "e", "compressModuleWithJIT", "compress_call", "make", "ctx", "handle", "chunk", "ctrl", "format", "zlib"]
+  "sources": ["../../src/jit-compressor.ts", "../../src/index.ts", "../../src/index.node.ts"],
+  "sourcesContent": ["import { LibZip } from 'solady';\nimport { MIN_BODY_SIZE } from './index';\n\nconst MAX_128_BIT = (1n << 128n) - 1n;\nconst MAX_256_BIT = (1n << 256n) - 1n;\n\nconst _normHex = (hex: string): string => hex.replace(/^0x/, '').toLowerCase();\n\nconst _hexToUint8Array = (hex: string): Uint8Array => {\n  const normalized = _normHex(hex);\n  const len = normalized.length;\n  const bytes = new Uint8Array(len / 2);\n  for (let i = 0; i < len; i += 2) {\n    bytes[i / 2] = Number.parseInt(normalized.slice(i, i + 2), 16);\n  }\n  return bytes;\n};\n\nconst _uint8ArrayToHex = (bytes: Uint8Array): string => {\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += bytes[i].toString(16).padStart(2, '0');\n  }\n  return hex;\n};\n\nconst not = (a: bigint): bigint => ~a & MAX_256_BIT;\nconst and = (a: bigint, b: bigint): bigint => a & b & MAX_256_BIT;\nconst or = (a: bigint, b: bigint): bigint => (a | b) & MAX_256_BIT;\nconst xor = (a: bigint, b: bigint): bigint => (a ^ b) & MAX_256_BIT;\nconst shl = (shift: bigint, value: bigint): bigint => (value << shift) & MAX_256_BIT;\nconst shr = (shift: bigint, value: bigint): bigint => (value >> shift) & MAX_256_BIT;\nconst sub = (a: bigint, b: bigint): bigint => (a - b) & MAX_256_BIT;\nconst sigext = (byteSize: bigint, value: bigint): bigint => {\n  const numBytes = Number(byteSize) + 1;\n  const mask = (1n << BigInt(numBytes * 8)) - 1n;\n  const signBit = 1n << BigInt(numBytes * 8 - 1);\n  const maskedVal = value & mask;\n  const extended = maskedVal & signBit ? maskedVal | (~mask & MAX_256_BIT) : maskedVal;\n  return extended & MAX_256_BIT;\n};\n\n/**\n * Generates FastLZ (LZ77) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nconst flzFwdBytecode = (address: string): string =>\n  `0x365f73${_normHex(address)}815b838110602f575f80848134865af1503d5f803e3d5ff35b803590815f1a8060051c908115609857600190600783149285831a6007018118840218600201948383011a90601f1660081b0101808603906020811860208211021890815f5b80830151818a015201858110609257505050600201019201916018565b82906075565b6001929350829150019101925f5b82811060b3575001916018565b85851060c1575b60010160a6565b936001818192355f1a878501530194905060ba56`;\n\n/**\n * Generates RLE (run-length encoded) decompressor bytecode. The generated code decompresses incoming calldata and forwards it to the target address.\n * @param address - Target contract address\n * @see {@link https://github.com/Vectorized/solady/blob/main/src/utils/LibZip.sol}\n * @pure\n */\n//! @__PURE__\nconst rleFwdBytecode = (address: string): string =>\n  `0x5f5f5b368110602d575f8083813473${_normHex(address)}5af1503d5f803e3d5ff35b600180820192909160031981019035185f1a8015604c57815301906002565b505f19815282820192607f9060031981019035185f1a818111156072575b160101906002565b838101368437606a56`;\n\nconst _jitDecompressor = function (calldata: string): string {\n  const hex = _normHex(calldata);\n  const originalBuf = _hexToUint8Array(hex);\n\n  // Right\u2011align the 4\u2011byte selector in the first 32\u2011byte slot (offset 28),\n  // so that everything after the selector is reconstructed on mostly\n  // word\u2011aligned boundaries. This keeps the ABI words (and therefore most\n  // calldata reconstruction) 32\u2011byte aligned in memory.\n  // That way we avoid encoding offsets for writes (most of the time),\n  const padding = 28;\n  const buf = new Uint8Array(padding + originalBuf.length);\n  buf.set(originalBuf, padding);\n\n  const n = buf.length;\n\n  let ops: number[] = [];\n  let data: (number[] | null)[] = [];\n  let stack: bigint[] = [];\n  let trackedMemSize = 0;\n  let mem = new Map<number, bigint>();\n  let firstPass = true;\n  const getStackIdx = (val: bigint): number => {\n    let idx = stack.lastIndexOf(val);\n    idx = idx === -1 ? -1 : stack.length - 1 - idx;\n    return idx > 15 ? -1 : idx;\n  };\n\n  const opFreq = new Map<number, number>();\n  const dataFreq = new Map<number[] | null, number>();\n  const stackFreq = new Map<bigint, number>();\n  const wordCache = new Map<string, number>();\n  const wordCacheCost = new Map<string, number>();\n  const roundUp32 = (x: number) => (x + 31) & ~31;\n\n  let pushCounter = 0;\n  const stackCnt = new Map<bigint, number>();\n  const pop2 = (): [bigint, bigint] => [stack.pop()!, stack.pop()!];\n  const ctr = <K>(m: Map<K, number>, k: K, delta: number) => m.set(k, (m.get(k) || 0) + delta);\n  const inc = <K>(m: Map<K, number>, k: K) => ctr(m, k, 1);\n  const pushOp = (op: number, d?: number[] | null) => {\n    ops.push(op);\n    inc(opFreq, op);\n    const imm = d ?? null;\n    data.push(imm);\n    inc(dataFreq, imm);\n  };\n  const pushS = (v: bigint, freq: number = 1) => {\n    stack.push(v);\n    ctr(stackFreq, v, freq);\n    ++pushCounter;\n    stackCnt.set(v, pushCounter);\n  };\n\n  const trackMem = (offset: number, size: number) => {\n    trackedMemSize = roundUp32(offset + size);\n  };\n\n  const addOp = (op: number, imm?: number[]) => {\n    if (op === 0x36) {\n      pushS(32n, 0);\n    } else if (op === 0x59) {\n      pushS(BigInt(trackedMemSize), 0);\n    } else if (op === 0x0b) {\n      // SIGNEXTEND\n      const [byteSize, val] = pop2();\n      pushS(sigext(byteSize, val), 1);\n    } else if (op === 0x19) {\n      // NOT\n      const val = stack.pop()!;\n      pushS(not(val), 0);\n    } else if (op === 0x18) {\n      // XOR\n      const [a, b] = pop2();\n      pushS(xor(a, b), 1);\n    } else if (op === 0x16) {\n      // AND\n      const [a, b] = pop2();\n      pushS(and(a, b), 1);\n    } else if (op === 0x03) {\n      // SUB\n      const [a, b] = pop2();\n      pushS(sub(a, b), 1);\n    } else if (op === 0x1b) {\n      // SHL\n      let [shift, val] = pop2();\n      pushS(shl(shift, val), 1);\n    } else if (op === 0x1c) {\n      // SHR\n      let [shift, val] = pop2();\n      pushS(shr(shift, val), 1);\n    } else if (op === 0x17) {\n      // OR\n      let [a, b] = pop2();\n      pushS(or(a, b), 1);\n    } else if ((op >= 0x60 && op <= 0x7f) || op === 0x5f) {\n      // PUSH\n      let v = 0n;\n      for (const b of imm || []) v = (v << 8n) | BigInt(b);\n      if (v == 224n) {\n        pushS(v, 0);\n        pushOp(0x30); // ADDRESS\n        return;\n      }\n      if (v == 32n) {\n        pushS(v, 0);\n        pushOp(0x36); // ADDRESS\n        return;\n      }\n      if (v === BigInt(trackedMemSize)) {\n        pushS(v, 0);\n        pushOp(0x59); // MemSize\n        return;\n      }\n      const idx = getStackIdx(v);\n      if (idx !== -1 && op != 0x5f) {\n        let pushCtr = firstPass ? 1 : -1;\n        pushS(v, pushCtr);\n        pushOp(128 + idx);\n        return;\n      }\n      if (v == MAX_256_BIT) {\n        pushS(v);\n        pushOp(0x5f); // 0\n        pushOp(0x19); // NOT\n        return;\n      }\n      pushS(v);\n    } else if (op === 0x51) {\n      // MLOAD\n      const k = Number(stack.pop()!);\n      pushS(mem.has(k) ? mem.get(k)! : 0n);\n    } else if (op === 0x52) {\n      // MSTORE\n      const [offset, value] = pop2();\n      const k = Number(offset);\n      mem.set(k, value & MAX_256_BIT);\n      trackMem(k, 32);\n    } else if (op === 0x53) {\n      // MSTORE8\n      const [offset, _] = pop2();\n      trackMem(Number(offset), 1);\n    } else if (op === 0xf3) {\n      // RETURN\n      pop2();\n    }\n    pushOp(op, imm || null);\n  };\n  const op = (opcode: number) => addOp(opcode);\n  const pushN = (value: number | bigint) => {\n    if (value > 0 && value === trackedMemSize) return addOp(0x59);\n    if (value == 32n) return addOp(0x36);\n    if (!value) return addOp(0x5f, undefined); // PUSH0\n    let v = BigInt(value);\n    let bytes: number[] = [];\n    while (v) {\n      bytes.unshift(Number(v & 0xffn));\n      v >>= 8n;\n    }\n    return addOp(0x5f + bytes.length, bytes);\n  };\n  const pushB = (buf: Uint8Array) => addOp(0x5f + buf.length, Array.from(buf));\n  const cntWords = (hex: string, wordHex: string) =>\n    (hex.match(new RegExp(wordHex, 'g')) || []).length;\n\n  // Rough cost model\n  const estShlCost = (seg: Array<{ s: number; e: number }>) => {\n    let cost = 0;\n    let first = true;\n    for (const { s, e } of seg) {\n      cost += 1 + e - s + 1; // PUSH segLen bytes\n      if (31 - e > 0) cost += 1 /* PUSH1 */ + 1 /* shift byte */ + 1 /* SHL */;\n      if (!first) cost += 1; // OR\n      first = false;\n    }\n    return cost;\n  };\n\n  type PlanStep =\n    | { t: 'num'; v: number | bigint }\n    | { t: 'bytes'; b: Uint8Array }\n    | { t: 'op'; o: number };\n\n  const plan: PlanStep[] = [];\n  const emitPushN = (v: number | bigint) => (plan.push({ t: 'num', v }), pushN(v));\n  const emitPushB = (b: Uint8Array) => (plan.push({ t: 'bytes', b }), pushB(b));\n  const emitOp = (o: number) => (plan.push({ t: 'op', o }), op(o));\n  pushN(1n);\n  // First pass: decide how to build each 32-byte word without emitting bytecode\n  const _stack = [1n, 32n, 224n];\n  for (let base = 0; base < n; base += 32) {\n    const word = new Uint8Array(32);\n    word.set(buf.slice(base, Math.min(base + 32, n)), 0);\n\n    const seg: Array<{ s: number; e: number }> = [];\n    for (let i = 0; i < 32; ) {\n      while (i < 32 && word[i] === 0) ++i;\n      if (i >= 32) break;\n      const s = i;\n      while (i < 32 && word[i] !== 0) ++i;\n      seg.push({ s, e: i - 1 });\n    }\n\n    if (!seg.length) continue;\n\n    // Decide whether to build this word via SHL/OR or as a single literal word\n    const literal = word.slice(seg[0].s);\n    const literalCost = 1 + literal.length;\n    let literalVal = 0n;\n    for (const b of literal) literalVal = (literalVal << 8n) | BigInt(b);\n    const baseBytes = Math.ceil(Math.log2(base + 1) / 8);\n    const wordHex = _uint8ArrayToHex(word);\n    const shlCost = estShlCost(seg);\n\n    const inStack = _stack.includes(literalVal);\n    if (inStack) {\n      emitPushB(literal);\n      emitPushN(base);\n      emitOp(0x52); // MSTORE\n      continue;\n    }\n    if (literalCost > 8) {\n      if (wordCache.has(wordHex)) {\n        if (literalCost > wordCacheCost.get(wordHex)! + baseBytes) {\n          emitPushN(wordCache.get(wordHex)!);\n          emitOp(0x51);\n          emitPushN(base);\n          emitOp(0x52); // MSTORE\n          continue;\n        }\n      } else if (wordCacheCost.get(wordHex) != -1) {\n        const reuseCost = baseBytes + 3;\n        const freq = cntWords(hex, wordHex);\n        wordCacheCost.set(wordHex, freq * 32 > freq * reuseCost ? reuseCost : -1);\n        wordCache.set(wordHex, base);\n      }\n    }\n\n    const byte8s = seg.every(({ s, e }) => s === e);\n    const byte8sCost = seg.length * 3; // each: PUSH1 (value), PUSH1 (offset), MSTORE8\n    if (inStack) {\n      emitPushB(literal);\n    } else {\n      // Aggregate all costs\n      let bestCost = literalCost;\n      let bestEmit: (() => void) | null = () => {\n        emitPushB(literal);\n      };\n      if (literalVal == MAX_256_BIT) {\n        bestCost = 2;\n        bestEmit = () => {\n          emitPushN(notVal);\n          emitOp(0x19);\n        };\n      }\n      // Try NOT: PUSH<n> ~val, NOT\n      const notVal = not(literalVal);\n      let notBytes = 0;\n      let tmp = notVal;\n      while (tmp > 0n) {\n        ++notBytes;\n        tmp >>= 8n;\n      }\n      notBytes = 1 + notBytes;\n      if (notBytes === 0) notBytes;\n      const notCost = notBytes + 1; // PUSH<n> + NOT\n      if (notCost < bestCost) {\n        bestCost = notCost;\n        bestEmit = () => {\n          emitPushN(notVal);\n          emitOp(0x19);\n        };\n      }\n\n      // Try SUB: PUSH1 0, PUSH<n> val, SUB\n      const subVal = sub(0n, literalVal);\n      let subBytes = 0;\n      tmp = subVal;\n      while (tmp > 0n) {\n        ++subBytes;\n        tmp >>= 8n;\n      }\n      if (subBytes === 0) subBytes = 1;\n      if (_stack.includes(subVal)) subBytes = 1;\n      const subCost = 1 + (1 + subBytes) + 1; // PUSH0 + PUSH<n> + SUB\n      if (subCost < bestCost) {\n        bestCost = subCost;\n        bestEmit = () => {\n          emitPushN(0);\n          emitPushN(subVal);\n          emitOp(0x03);\n        };\n      }\n\n      // Try SIGNEXTEND: PUSH<n> truncated, PUSH1 byteSize, SIGNEXTEND\n      for (let numBytes = 1; numBytes < literal.length; numBytes++) {\n        const mask = (1n << BigInt(numBytes * 8)) - 1n;\n        const truncated = literalVal & mask;\n        const extended = sigext(BigInt(numBytes - 1), truncated);\n        if (extended === literalVal && (truncated & (1n << BigInt(numBytes * 8 - 1))) !== 0n) {\n          let trueByteCost = 1 + numBytes;\n          if (_stack.includes(BigInt(extended))) trueByteCost = 1;\n          let signCost = trueByteCost + (1 + 1) + 1; // PUSH<n> + PUSH1 + SIGNEXTEND\n          if (signCost < bestCost) {\n            bestCost = signCost;\n            bestEmit = () => {\n              emitPushN(truncated);\n              emitPushN(numBytes - 1);\n              emitOp(0x0b);\n            };\n          }\n          break;\n        }\n      }\n\n      // Try SHIFT+NOT: PUSH<n> val, PUSH1 shift, SHL, NOT\n      for (let shiftBits = 8; shiftBits <= 248; shiftBits += 8) {\n        const shifted = shr(BigInt(shiftBits), literalVal);\n        if (shifted === 0n) break;\n\n        const notShifted = not(shifted);\n        const reconstructed = shl(BigInt(shiftBits), notShifted);\n\n        if (reconstructed === literalVal) {\n          let shiftedBytes = 0;\n          let tmpShifted = notShifted;\n          while (tmpShifted > 0n) {\n            ++shiftedBytes;\n            tmpShifted >>= 8n;\n          }\n          if (shiftedBytes === 0) shiftedBytes = 1;\n          const shiftNotCost = 1 + shiftedBytes + 2 + 1 + 1; // PUSH<n> + PUSH1 + SHL + NOT\n          if (shiftNotCost < bestCost) {\n            bestCost = shiftNotCost;\n            bestEmit = () => {\n              emitPushN(notShifted);\n              emitPushN(shiftBits);\n              emitOp(0x1b); // SHL\n              emitOp(0x19); // NOT\n            };\n          }\n        }\n      }\n\n      if (byte8s && byte8sCost < bestCost && byte8sCost <= shlCost) {\n        for (const { s } of seg) {\n          emitPushN(word[s]);\n          emitPushN(base + s);\n          emitOp(0x53); // MSTORE8\n        }\n        continue; // Skip the single MSTORE at the end\n      } else if (shlCost < bestCost) {\n        // Use SHL/OR\n        let first = true;\n        for (const { s, e } of seg) {\n          const suffix0s = 31 - e;\n          emitPushB(word.slice(s, e + 1));\n          if (suffix0s > 0) {\n            emitPushN(suffix0s * 8);\n            emitOp(0x1b); // SHL\n          }\n          if (!first) emitOp(0x17); // OR\n          first = false;\n        }\n      } else {\n        bestEmit!();\n      }\n    }\n    emitPushN(base);\n    emitOp(0x52); // MSTORE\n  }\n\n  ops = [];\n  data = [];\n  stack = [];\n  trackedMemSize = 0;\n  mem = new Map();\n  // Pre 2nd pass. Push most frequent literals into stack.\n  Array.from(stackFreq.entries())\n    .filter(([val, freq]) => freq > 1 && val > 1n && val !== 32n && val !== 224n)\n    .sort((a, b) => stackCnt.get(b[0])! - stackCnt.get(a[0])!)\n    .filter(([val, _]) => {\n      return typeof val === 'number' ? BigInt(val) : val <= MAX_128_BIT;\n    })\n    .slice(0, 15)\n    .forEach(([val, _]) => {\n      pushN(val);\n    });\n  pushN(1n);\n  // Second pass: emit ops and track mem/stack\n  for (const step of plan) {\n    if (step.t === 'num') pushN(step.v);\n    else if (step.t === 'bytes') pushB(step.b);\n    else if (step.t === 'op') op(step.o);\n  }\n\n  // CALL stack layout (top to bottom): gas, address, value, argsOffset, argsSize, retOffset, retSize\n  //\n  // Opcodes breakdown:\n  // - 0x5f5f: PUSH0 PUSH0 (retSize=0, retOffset=0)\n  // - pushN(originalBuf.length): argsSize = actual data length\n  // - pushN(padding): argsOffset (skip leading alignment bytes)\n  // - 0x34: CALLVALUE (value)\n  // - 0x5f35: PUSH0 CALLDATALOAD (address from calldata[0])\n  // - 0x5a: GAS (remaining gas)\n  // - 0xf1: CALL\n  //\n  // RETURNDATACOPY(destOffset=0, offset=0, length=RETURNDATASIZE):\n  // - 0x3d5f5f3e: RETURNDATASIZE PUSH0 PUSH0 RETURNDATACOPY\n  //\n  // RETURN(offset=0, size=RETURNDATASIZE):\n  // - 0x3d5ff3: RETURNDATASIZE PUSH0 RETURN\n\n  op(0x5f); // PUSH0 (retSize)\n  op(0x5f); // PUSH0 (retOffset)\n  pushN(originalBuf.length); // argsSize = actual data length\n  pushN(padding); // argsOffset = padding\n\n  const out: number[] = [];\n  for (let i = 0; i < ops.length; ++i) {\n    out.push(ops[i]);\n    if (ops[i] >= 0x60 && ops[i] <= 0x7f && data[i]) out.push(...data[i]!);\n  }\n\n  // - CALLVALUE, load target address from calldata[0], GAS, CALL\n  // - RETURNDATACOPY(0, 0, RETURNDATASIZE)\n  // - RETURN(0, RETURNDATASIZE)\n  return '0x' + _uint8ArrayToHex(new Uint8Array(out)) + '345f355af13d5f5f3e3d5ff3';\n};\n\nconst DECOMPRESSOR_ADDRESS = '0x00000000000000000000000000000000000000e0';\n\n/**\n * Compresses eth_call payload using JIT, FastLZ (FLZ), or calldata RLE (CD) compression.\n * Auto-selects best algorithm if not specified. Only compresses if >800 bytes and beneficial.\n *\n * Only applies compression to calls that:\n * - target the latest block ID\n * - have no state overrides\n * - have a target address and calldata\n * - have no other properties (nonce, gas, etc.)\n *\n * @param payload - eth_call RPC payload\n * @param alg - 'jit' | 'flz' | 'cd' | undefined (auto)\n * @returns (un)compressed eth_call payload\n * @pure\n */\n//! @__PURE__\nexport const compress_call = function (payload: any, alg?: string): any {\n  const { method, params } = payload;\n  if (method && method !== 'eth_call') return payload;\n  const txObj = params?.[0] || payload;\n  const blockParam = params?.[1];\n  const overrides = params?.[2];\n\n  // Validation\n  if (\n    (blockParam && blockParam !== 'latest') ||\n    (overrides && Object.keys(overrides).length > 0) ||\n    !txObj?.to ||\n    !txObj?.data ||\n    Object.keys(txObj).some((k) => !['to', 'data', 'from'].includes(k))\n  ) {\n    return payload;\n  }\n\n  const originalSize = txObj.data.length;\n  if (originalSize < MIN_BODY_SIZE) return payload;\n\n  const inputData = '0x' + _normHex(txObj.data);\n  const to = txObj.to;\n\n  // Determine compression method and generate bytecode/calldata\n  let bytecode: string;\n  let calldata: string;\n\n  if (alg === 'jit' || (!alg && (originalSize < 3000 || originalSize >= 8000))) {\n    bytecode = _jitDecompressor(inputData);\n    calldata = '0x' + _normHex(to).padStart(64, '0');\n  } else {\n    // Need FLZ and/or CD compression\n    const flzData = alg === 'flz' || !alg ? LibZip.flzCompress(inputData) : null;\n    const cdData = alg === 'cd' || (!alg && flzData) ? LibZip.cdCompress(inputData) : null;\n\n    // Pick the best or requested one\n    const useFlz =\n      alg === 'flz' || (!alg && flzData && (!cdData || flzData.length < cdData.length));\n\n    if (useFlz) {\n      calldata = flzData!;\n      bytecode = flzFwdBytecode(to);\n    } else {\n      calldata = cdData!;\n      bytecode = rleFwdBytecode(to);\n    }\n  }\n\n  // Skip if not beneficial\n  if (bytecode.length + calldata.length >= originalSize) return payload;\n\n  return {\n    ...payload,\n    params: [\n      { ...txObj, to: DECOMPRESSOR_ADDRESS, data: calldata },\n      blockParam || 'latest',\n      { ...overrides, [DECOMPRESSOR_ADDRESS]: { code: bytecode } },\n    ],\n  };\n};\n", "export const MIN_BODY_SIZE = 1150;\n\nconst _sup_enc = new Map<string, string[] | -1>();\nconst _enc = ['deflate-raw', 'deflate', 'gzip'];\nlet supported: string | -1 | null = typeof CompressionStream === 'undefined' ? -1 : null;\n\nexport type PayloadTransform = (payload: unknown) => unknown;\n\n/**\n * Fetch-compatible function that applies HTTP compression (gzip/deflate) to requests.\n * Optionally transforms request payloads before sending.\n *\n * @param input - The resource URL, Request object, or URL string\n * @param init - Optional request initialization options\n * @param transformPayload - Optional function to transform the request payload\n * @returns A Promise that resolves to the Response\n */\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init: RequestInit | undefined,\n  transformPayload?: PayloadTransform,\n): Promise<Response>;\n\n//! @__PURE__\nexport async function compressModule(\n  input: string | URL | Request,\n  init?: RequestInit,\n  transformPayload?: PayloadTransform,\n): Promise<Response> {\n  const url =\n    typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url;\n\n  const cached = _sup_enc.get(url);\n  supported = supported === -1 ? -1 : cached === -1 ? -1 : (cached?.[0] ?? null);\n\n  // Only apply the optional payload transform\n  // when native HTTP compression is not available for this URL.\n  if (transformPayload && init?.body && typeof init.body === 'string') {\n    if (supported === -1 || supported === null) {\n      try {\n        const parsed = JSON.parse(init.body as string);\n        const next = transformPayload(parsed);\n        if (next !== undefined) {\n          init = {\n            ...init,\n            body: JSON.stringify(next),\n          };\n        }\n      } catch {\n        // Non-JSON bodies are left untouched.\n      }\n    }\n  }\n\n  const bodyStr = typeof init?.body === 'string' ? (init.body as string) : null;\n\n  if (supported && supported !== -1 && bodyStr && bodyStr.length >= MIN_BODY_SIZE) {\n    const compressed = await new Response(\n      new Blob([bodyStr])\n        .stream()\n        .pipeThrough(new CompressionStream(supported as CompressionFormat)),\n    ).blob();\n    init = {\n      ...init,\n      body: compressed,\n      headers: { ...(init && init.headers), 'Content-Encoding': supported },\n    };\n  }\n  const response = await fetch(url, init);\n\n  if (supported === null) {\n    const encodings = response.headers\n      .get('Accept-Encoding')\n      ?.split(',')\n      .filter((e) => _enc.includes(e));\n    _sup_enc.set(url, encodings?.length ? encodings : -1);\n  }\n\n  return response;\n}\n\n/**\n * Combines HTTP compression with EVM JIT compression.\n * Just pass this as `fetchFn` to viem's http transport.\n *\n * @param input - The resource URL or Request object\n * @param init - Optional request initialization options\n * @returns A Promise that resolves to the Response\n *\n * @example\n * ```ts\n * const client = createPublicClient({\n *   transport: http(rpcUrl, { fetchFn: compressModuleWithJIT })\n * })\n * ```\n *\n * If the target RPC endpoint and runtime support native HTTP compression,\n * this helper prefers that path and will not apply JIT calldata compression;\n * the JIT-based transform is used as a legacy/fallback path when HTTP\n * content-encoding is unavailable.\n * @pure\n */\n//! @__PURE__\nexport const compressModuleWithJIT = (\n  input: RequestInfo | URL,\n  init?: RequestInit,\n): Promise<Response> => {\n  return import('./jit-compressor').then(({ compress_call }) =>\n    compressModule(input, init, compress_call),\n  );\n};\n", "import zlib from 'node:zlib';\n\n// Polyfill for CompressionStream/DecompressionStream in older versions of Node.js & Bun\nconst make = (ctx: any, handle: any) =>\n  Object.assign(ctx, {\n    writable: new WritableStream({\n      write(chunk) {\n        handle.write(chunk);\n        return Promise.resolve();\n      },\n      close() {\n        handle.end();\n        return Promise.resolve();\n      },\n    }),\n    readable: new ReadableStream({\n      type: 'bytes',\n      start(ctrl) {\n        handle.on('data', (chunk: any) => ctrl.enqueue(chunk));\n        handle.once('end', () => ctrl.close());\n      },\n    }),\n  });\n\nif (!globalThis.CompressionStream) {\n  globalThis.CompressionStream = class CompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createDeflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliCompress();\n      } else {\n        handle = zlib.createDeflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nif (!globalThis.DecompressionStream) {\n  globalThis.DecompressionStream = class DecompressionStream {\n    constructor(format: string) {\n      let handle;\n      if (format === 'deflate') {\n        handle = zlib.createInflate();\n      } else if (format === 'gzip') {\n        handle = zlib.createGunzip();\n      } else if (format === 'br') {\n        handle = zlib.createBrotliDecompress();\n      } else {\n        handle = zlib.createInflateRaw();\n      }\n      make(this, handle);\n    }\n  } as any;\n}\n\nexport * from './index';\n"],
+  "mappings": "iIAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,mBAAAE,KAAA,OAAS,UAAAC,OAAc,SAAvB,IAGMC,GACAC,EAEAC,EAEAC,GAUAC,GAQAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAgBAC,GAUAC,GAGAC,GA6aAC,GAkBOlB,GA7fbmB,GAAAC,GAAA,KAGMlB,IAAe,IAAM,MAAQ,GAC7BC,GAAe,IAAM,MAAQ,GAE7BC,EAAYiB,GAAwBA,EAAI,QAAQ,MAAO,EAAE,EAAE,YAAY,EAEvEhB,GAAoBgB,GAA4B,CACpD,IAAMC,EAAalB,EAASiB,CAAG,EACzBE,EAAMD,EAAW,OACjBE,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAASE,EAAI,EAAGA,EAAIF,EAAKE,GAAK,EAC5BD,EAAMC,EAAI,CAAC,EAAI,OAAO,SAASH,EAAW,MAAMG,EAAGA,EAAI,CAAC,EAAG,EAAE,EAE/D,OAAOD,CACT,EAEMlB,GAAoBkB,GAA8B,CACtD,IAAIH,EAAM,GACV,QAAS,EAAI,EAAG,EAAIG,EAAM,OAAQ,IAChCH,GAAOG,EAAM,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAE9C,OAAOH,CACT,EAEMd,EAAOmB,GAAsB,CAACA,EAAIvB,EAClCK,GAAM,CAACkB,EAAWC,IAAsBD,EAAIC,EAAIxB,EAChDM,GAAK,CAACiB,EAAWC,KAAuBD,EAAIC,GAAKxB,EACjDO,GAAM,CAACgB,EAAWC,KAAuBD,EAAIC,GAAKxB,EAClDQ,GAAM,CAACiB,EAAeC,IAA2BA,GAASD,EAASzB,EACnES,GAAM,CAACgB,EAAeC,IAA2BA,GAASD,EAASzB,EACnEU,GAAM,CAACa,EAAWC,IAAuBD,EAAIC,EAAKxB,EAClDW,GAAS,CAACgB,EAAkBD,IAA0B,CAC1D,IAAME,EAAW,OAAOD,CAAQ,EAAI,EAC9BE,GAAQ,IAAM,OAAOD,EAAW,CAAC,GAAK,GACtCE,EAAU,IAAM,OAAOF,EAAW,EAAI,CAAC,EACvCG,EAAYL,EAAQG,EAE1B,OADiBE,EAAYD,EAAUC,EAAa,CAACF,EAAO7B,EAAe+B,GACzD/B,CACpB,EASMY,GAAkBoB,GACtB,WAAW/B,EAAS+B,CAAO,CAAC,iYASxBnB,GAAkBmB,GACtB,mCAAmC/B,EAAS+B,CAAO,CAAC,qLAEhDlB,GAAmB,SAAUmB,EAA0B,CAC3D,IAAMf,EAAMjB,EAASgC,CAAQ,EACvBC,EAAchC,GAAiBgB,CAAG,EAOlCiB,EAAU,GACVC,EAAM,IAAI,WAAWD,EAAUD,EAAY,MAAM,EACvDE,EAAI,IAAIF,EAAaC,CAAO,EAE5B,IAAME,EAAID,EAAI,OAEVE,EAAgB,CAAC,EACjBC,EAA4B,CAAC,EAC7BC,EAAkB,CAAC,EACnBC,EAAiB,EACjBC,EAAM,IAAI,IACVC,EAAY,GACVC,EAAeC,GAAwB,CAC3C,IAAIC,EAAMN,EAAM,YAAYK,CAAG,EAC/B,OAAAC,EAAMA,IAAQ,GAAK,GAAKN,EAAM,OAAS,EAAIM,EACpCA,EAAM,GAAK,GAAKA,CACzB,EAEMC,EAAS,IAAI,IACbC,GAAW,IAAI,IACfC,GAAY,IAAI,IAChBC,EAAY,IAAI,IAChBC,EAAgB,IAAI,IACpBC,GAAaC,GAAeA,EAAI,GAAM,IAExCC,GAAc,EACZC,EAAW,IAAI,IACfC,EAAO,IAAwB,CAAChB,EAAM,IAAI,EAAIA,EAAM,IAAI,CAAE,EAC1DiB,GAAM,CAAIC,EAAmBC,EAAMC,IAAkBF,EAAE,IAAIC,GAAID,EAAE,IAAIC,CAAC,GAAK,GAAKC,CAAK,EACrFC,GAAM,CAAIH,EAAmBC,IAASF,GAAIC,EAAGC,EAAG,CAAC,EACjDG,EAAS,CAACC,EAAYC,IAAwB,CAClD1B,EAAI,KAAKyB,CAAE,EACXF,GAAId,EAAQgB,CAAE,EACd,IAAME,EAAMD,GAAK,KACjBzB,EAAK,KAAK0B,CAAG,EACbJ,GAAIb,GAAUiB,CAAG,CACnB,EACMC,EAAQ,CAACC,EAAWC,EAAe,IAAM,CAC7C5B,EAAM,KAAK2B,CAAC,EACZV,GAAIR,GAAWkB,EAAGC,CAAI,EACtB,EAAEd,GACFC,EAAS,IAAIY,EAAGb,EAAW,CAC7B,EAEMe,GAAW,CAACC,EAAgBC,IAAiB,CACjD9B,EAAiBW,GAAUkB,EAASC,CAAI,CAC1C,EAEMC,EAAQ,CAACT,EAAYE,IAAmB,CAC5C,GAAIF,IAAO,GACTG,EAAM,IAAK,CAAC,UACHH,IAAO,GAChBG,EAAM,OAAOzB,CAAc,EAAG,CAAC,UACtBsB,IAAO,GAAM,CAEtB,GAAM,CAACpC,EAAUkB,CAAG,EAAIW,EAAK,EAC7BU,EAAMvD,GAAOgB,EAAUkB,CAAG,EAAG,CAAC,CAChC,SAAWkB,IAAO,GAAM,CAEtB,IAAMlB,EAAML,EAAM,IAAI,EACtB0B,EAAM9D,EAAIyC,CAAG,EAAG,CAAC,CACnB,SAAWkB,IAAO,GAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAM3D,GAAIgB,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,GAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAM7D,GAAIkB,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,EAAM,CAEtB,GAAM,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EACpBU,EAAMxD,GAAIa,EAAGC,CAAC,EAAG,CAAC,CACpB,SAAWuC,IAAO,GAAM,CAEtB,GAAI,CAACtC,EAAOoB,CAAG,EAAIW,EAAK,EACxBU,EAAM1D,GAAIiB,EAAOoB,CAAG,EAAG,CAAC,CAC1B,SAAWkB,IAAO,GAAM,CAEtB,GAAI,CAACtC,EAAOoB,CAAG,EAAIW,EAAK,EACxBU,EAAMzD,GAAIgB,EAAOoB,CAAG,EAAG,CAAC,CAC1B,SAAWkB,IAAO,GAAM,CAEtB,GAAI,CAACxC,EAAGC,CAAC,EAAIgC,EAAK,EAClBU,EAAM5D,GAAGiB,EAAGC,CAAC,EAAG,CAAC,CACnB,SAAYuC,GAAM,IAAQA,GAAM,KAASA,IAAO,GAAM,CAEpD,IAAII,EAAI,GACR,QAAW3C,KAAKyC,GAAO,CAAC,EAAGE,EAAKA,GAAK,GAAM,OAAO3C,CAAC,EACnD,GAAI2C,GAAK,KAAM,CACbD,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,GAAIK,GAAK,IAAK,CACZD,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,GAAIK,IAAM,OAAO1B,CAAc,EAAG,CAChCyB,EAAMC,EAAG,CAAC,EACVL,EAAO,EAAI,EACX,MACF,CACA,IAAMhB,EAAMF,EAAYuB,CAAC,EACzB,GAAIrB,IAAQ,IAAMiB,GAAM,GAAM,CAE5BG,EAAMC,EADQxB,EAAY,EAAI,EACd,EAChBmB,EAAO,IAAMhB,CAAG,EAChB,MACF,CACA,GAAIqB,GAAKnE,EAAa,CACpBkE,EAAMC,CAAC,EACPL,EAAO,EAAI,EACXA,EAAO,EAAI,EACX,MACF,CACAI,EAAMC,CAAC,CACT,SAAWJ,IAAO,GAAM,CAEtB,IAAMJ,EAAI,OAAOnB,EAAM,IAAI,CAAE,EAC7B0B,EAAMxB,EAAI,IAAIiB,CAAC,EAAIjB,EAAI,IAAIiB,CAAC,EAAK,EAAE,CACrC,SAAWI,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQ5C,CAAK,EAAI8B,EAAK,EACvBG,EAAI,OAAOW,CAAM,EACvB5B,EAAI,IAAIiB,EAAGjC,EAAQ1B,CAAW,EAC9BqE,GAASV,EAAG,EAAE,CAChB,SAAWI,IAAO,GAAM,CAEtB,GAAM,CAACO,EAAQG,CAAC,EAAIjB,EAAK,EACzBa,GAAS,OAAOC,CAAM,EAAG,CAAC,CAC5B,MAAWP,IAAO,KAEhBP,EAAK,EAEPM,EAAOC,EAAIE,GAAO,IAAI,CACxB,EACMF,EAAMW,GAAmBF,EAAME,CAAM,EACrCC,EAASjD,GAA2B,CACxC,GAAIA,EAAQ,GAAKA,IAAUe,EAAgB,OAAO+B,EAAM,EAAI,EAC5D,GAAI9C,GAAS,IAAK,OAAO8C,EAAM,EAAI,EACnC,GAAI,CAAC9C,EAAO,OAAO8C,EAAM,GAAM,MAAS,EACxC,IAAIL,EAAI,OAAOzC,CAAK,EAChBL,EAAkB,CAAC,EACvB,KAAO8C,GACL9C,EAAM,QAAQ,OAAO8C,EAAI,KAAK,CAAC,EAC/BA,IAAM,GAER,OAAOK,EAAM,GAAOnD,EAAM,OAAQA,CAAK,CACzC,EACMuD,GAASxC,GAAoBoC,EAAM,GAAOpC,EAAI,OAAQ,MAAM,KAAKA,CAAG,CAAC,EACrEyC,GAAW,CAAC3D,EAAa4D,KAC5B5D,EAAI,MAAM,IAAI,OAAO4D,EAAS,GAAG,CAAC,GAAK,CAAC,GAAG,OAGxCC,GAAcC,GAAyC,CAC3D,IAAIC,EAAO,EACPC,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EACrBC,GAAQ,EAAIG,EAAID,EAAI,EAChB,GAAKC,EAAI,IAAGH,GAAQ,GACnBC,IAAOD,GAAQ,GACpBC,EAAQ,GAEV,OAAOD,CACT,EAOMI,EAAmB,CAAC,EACpBC,EAAanB,IAAwBkB,EAAK,KAAK,CAAE,EAAG,MAAO,EAAAlB,CAAE,CAAC,EAAGQ,EAAMR,CAAC,GACxEoB,EAAa/D,IAAmB6D,EAAK,KAAK,CAAE,EAAG,QAAS,EAAA7D,CAAE,CAAC,EAAGoD,GAAMpD,CAAC,GACrEgE,EAAUC,IAAeJ,EAAK,KAAK,CAAE,EAAG,KAAM,EAAAI,CAAE,CAAC,EAAG1B,EAAG0B,CAAC,GAC9Dd,EAAM,EAAE,EAER,IAAMe,EAAS,CAAC,GAAI,IAAK,IAAI,EAC7B,QAASC,EAAO,EAAGA,EAAOtD,EAAGsD,GAAQ,GAAI,CACvC,IAAMC,EAAO,IAAI,WAAW,EAAE,EAC9BA,EAAK,IAAIxD,EAAI,MAAMuD,EAAM,KAAK,IAAIA,EAAO,GAAItD,CAAC,CAAC,EAAG,CAAC,EAEnD,IAAM2C,EAAuC,CAAC,EAC9C,QAAS1D,EAAI,EAAGA,EAAI,IAAM,CACxB,KAAOA,EAAI,IAAMsE,EAAKtE,CAAC,IAAM,GAAG,EAAEA,EAClC,GAAIA,GAAK,GAAI,MACb,IAAM6D,EAAI7D,EACV,KAAOA,EAAI,IAAMsE,EAAKtE,CAAC,IAAM,GAAG,EAAEA,EAClC0D,EAAI,KAAK,CAAE,EAAAG,EAAG,EAAG7D,EAAI,CAAE,CAAC,CAC1B,CAEA,GAAI,CAAC0D,EAAI,OAAQ,SAGjB,IAAMa,EAAUD,EAAK,MAAMZ,EAAI,CAAC,EAAE,CAAC,EAC7Bc,EAAc,EAAID,EAAQ,OAC5BE,EAAa,GACjB,QAAWvE,KAAKqE,EAASE,EAAcA,GAAc,GAAM,OAAOvE,CAAC,EACnE,IAAMwE,GAAY,KAAK,KAAK,KAAK,KAAKL,EAAO,CAAC,EAAI,CAAC,EAC7Cb,EAAU3E,GAAiByF,CAAI,EAC/BK,GAAUlB,GAAWC,CAAG,EAExBkB,GAAUR,EAAO,SAASK,CAAU,EAC1C,GAAIG,GAAS,CACXX,EAAUM,CAAO,EACjBP,EAAUK,CAAI,EACdH,EAAO,EAAI,EACX,QACF,CACA,GAAIM,EAAc,GAChB,GAAI5C,EAAU,IAAI4B,CAAO,GACvB,GAAIgB,EAAc3C,EAAc,IAAI2B,CAAO,EAAKkB,GAAW,CACzDV,EAAUpC,EAAU,IAAI4B,CAAO,CAAE,EACjCU,EAAO,EAAI,EACXF,EAAUK,CAAI,EACdH,EAAO,EAAI,EACX,QACF,UACSrC,EAAc,IAAI2B,CAAO,GAAK,GAAI,CAC3C,IAAMqB,EAAYH,GAAY,EACxB5B,EAAOS,GAAS3D,EAAK4D,CAAO,EAClC3B,EAAc,IAAI2B,EAASV,EAAO,GAAKA,EAAO+B,EAAYA,EAAY,EAAE,EACxEjD,EAAU,IAAI4B,EAASa,CAAI,CAC7B,EAGF,IAAMS,GAASpB,EAAI,MAAM,CAAC,CAAE,EAAAG,EAAG,EAAAC,CAAE,IAAMD,IAAMC,CAAC,EACxCiB,GAAarB,EAAI,OAAS,EAChC,GAAIkB,GACFX,EAAUM,CAAO,MACZ,CAEL,IAAIS,EAAWR,EACXS,EAAgC,IAAM,CACxChB,EAAUM,CAAO,CACnB,EACIE,GAAc/F,IAChBsG,EAAW,EACXC,EAAW,IAAM,CACfjB,EAAUkB,CAAM,EAChBhB,EAAO,EAAI,CACb,GAGF,IAAMgB,EAASpG,EAAI2F,CAAU,EACzBU,EAAW,EACXC,EAAMF,EACV,KAAOE,EAAM,IACX,EAAED,EACFC,IAAQ,GAEVD,EAAW,EAAIA,EAEf,IAAME,GAAUF,EAAW,EACvBE,GAAUL,IACZA,EAAWK,GACXJ,EAAW,IAAM,CACfjB,EAAUkB,CAAM,EAChBhB,EAAO,EAAI,CACb,GAIF,IAAMoB,EAASlG,GAAI,GAAIqF,CAAU,EAC7Bc,EAAW,EAEf,IADAH,EAAME,EACCF,EAAM,IACX,EAAEG,EACFH,IAAQ,GAENG,IAAa,IAAGA,EAAW,GAC3BnB,EAAO,SAASkB,CAAM,IAAGC,EAAW,GACxC,IAAMC,GAAU,GAAK,EAAID,GAAY,EACjCC,GAAUR,IACZA,EAAWQ,GACXP,EAAW,IAAM,CACfjB,EAAU,CAAC,EACXA,EAAUsB,CAAM,EAChBpB,EAAO,CAAI,CACb,GAIF,QAAS5D,EAAW,EAAGA,EAAWiE,EAAQ,OAAQjE,IAAY,CAC5D,IAAMC,GAAQ,IAAM,OAAOD,EAAW,CAAC,GAAK,GACtCmF,EAAYhB,EAAalE,EACzBmF,EAAWrG,GAAO,OAAOiB,EAAW,CAAC,EAAGmF,CAAS,EACvD,GAAIC,IAAajB,IAAegB,EAAa,IAAM,OAAOnF,EAAW,EAAI,CAAC,KAAQ,GAAI,CACpF,IAAIqF,EAAe,EAAIrF,EACnB8D,EAAO,SAAS,OAAOsB,CAAQ,CAAC,IAAGC,EAAe,GACtD,IAAIC,EAAWD,EAAgB,EAAS,EACpCC,EAAWZ,IACbA,EAAWY,EACXX,EAAW,IAAM,CACfjB,EAAUyB,CAAS,EACnBzB,EAAU1D,EAAW,CAAC,EACtB4D,EAAO,EAAI,CACb,GAEF,KACF,CACF,CAGA,QAAS2B,EAAY,EAAGA,GAAa,IAAKA,GAAa,EAAG,CACxD,IAAMC,EAAU3G,GAAI,OAAO0G,CAAS,EAAGpB,CAAU,EACjD,GAAIqB,IAAY,GAAI,MAEpB,IAAMC,EAAajH,EAAIgH,CAAO,EAG9B,GAFsB5G,GAAI,OAAO2G,CAAS,EAAGE,CAAU,IAEjCtB,EAAY,CAChC,IAAIuB,EAAe,EACfC,EAAaF,EACjB,KAAOE,EAAa,IAClB,EAAED,EACFC,IAAe,GAEbD,IAAiB,IAAGA,EAAe,GACvC,IAAME,GAAe,EAAIF,EAAe,EAAI,EAAI,EAC5CE,GAAelB,IACjBA,EAAWkB,GACXjB,EAAW,IAAM,CACfjB,EAAU+B,CAAU,EACpB/B,EAAU6B,CAAS,EACnB3B,EAAO,EAAI,EACXA,EAAO,EAAI,CACb,EAEJ,CACF,CAEA,GAAIY,IAAUC,GAAaC,GAAYD,IAAcJ,GAAS,CAC5D,OAAW,CAAE,EAAAd,CAAE,IAAKH,EAClBM,EAAUM,EAAKT,CAAC,CAAC,EACjBG,EAAUK,EAAOR,CAAC,EAClBK,EAAO,EAAI,EAEb,QACF,SAAWS,GAAUK,EAAU,CAE7B,IAAIpB,EAAQ,GACZ,OAAW,CAAE,EAAAC,EAAG,EAAAC,CAAE,IAAKJ,EAAK,CAC1B,IAAMyC,EAAW,GAAKrC,EACtBG,EAAUK,EAAK,MAAMT,EAAGC,EAAI,CAAC,CAAC,EAC1BqC,EAAW,IACbnC,EAAUmC,EAAW,CAAC,EACtBjC,EAAO,EAAI,GAERN,GAAOM,EAAO,EAAI,EACvBN,EAAQ,EACV,CACF,MACEqB,EAAU,CAEd,CACAjB,EAAUK,CAAI,EACdH,EAAO,EAAI,CACb,CAEAlD,EAAM,CAAC,EACPC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACTC,EAAiB,EACjBC,EAAM,IAAI,IAEV,MAAM,KAAKO,GAAU,QAAQ,CAAC,EAC3B,OAAO,CAAC,CAACJ,EAAKuB,CAAI,IAAMA,EAAO,GAAKvB,EAAM,IAAMA,IAAQ,KAAOA,IAAQ,IAAI,EAC3E,KAAK,CAACtB,EAAGC,IAAM+B,EAAS,IAAI/B,EAAE,CAAC,CAAC,EAAK+B,EAAS,IAAIhC,EAAE,CAAC,CAAC,CAAE,EACxD,OAAO,CAAC,CAACsB,EAAK4B,CAAC,IACP,OAAO5B,GAAQ,SAAW,OAAOA,CAAG,EAAIA,GAAO9C,EACvD,EACA,MAAM,EAAG,EAAE,EACX,QAAQ,CAAC,CAAC8C,EAAK4B,CAAC,IAAM,CACrBE,EAAM9B,CAAG,CACX,CAAC,EACH8B,EAAM,EAAE,EAER,QAAW+C,KAAQrC,EACbqC,EAAK,IAAM,MAAO/C,EAAM+C,EAAK,CAAC,EACzBA,EAAK,IAAM,QAAS9C,GAAM8C,EAAK,CAAC,EAChCA,EAAK,IAAM,MAAM3D,EAAG2D,EAAK,CAAC,EAoBrC3D,EAAG,EAAI,EACPA,EAAG,EAAI,EACPY,EAAMzC,EAAY,MAAM,EACxByC,EAAMxC,CAAO,EAEb,IAAMwF,EAAgB,CAAC,EACvB,QAASrG,EAAI,EAAGA,EAAIgB,EAAI,OAAQ,EAAEhB,EAChCqG,EAAI,KAAKrF,EAAIhB,CAAC,CAAC,EACXgB,EAAIhB,CAAC,GAAK,IAAQgB,EAAIhB,CAAC,GAAK,KAAQiB,EAAKjB,CAAC,GAAGqG,EAAI,KAAK,GAAGpF,EAAKjB,CAAC,CAAE,EAMvE,MAAO,KAAOnB,GAAiB,IAAI,WAAWwH,CAAG,CAAC,EAAI,0BACxD,EAEM5G,GAAuB,6CAkBhBlB,GAAgB,SAAU+H,EAAcC,EAAmB,CACtE,GAAM,CAAE,OAAAC,EAAQ,OAAAC,CAAO,EAAIH,EAC3B,GAAIE,GAAUA,IAAW,WAAY,OAAOF,EAC5C,IAAMI,EAAQD,IAAS,CAAC,GAAKH,EACvBK,EAAaF,IAAS,CAAC,EACvBG,EAAYH,IAAS,CAAC,EAG5B,GACGE,GAAcA,IAAe,UAC7BC,GAAa,OAAO,KAAKA,CAAS,EAAE,OAAS,GAC9C,CAACF,GAAO,IACR,CAACA,GAAO,MACR,OAAO,KAAKA,CAAK,EAAE,KAAMrE,GAAM,CAAC,CAAC,KAAM,OAAQ,MAAM,EAAE,SAASA,CAAC,CAAC,EAElE,OAAOiE,EAGT,IAAMO,EAAeH,EAAM,KAAK,OAChC,GAAIG,EAAe,KAAe,OAAOP,EAEzC,IAAMQ,EAAY,KAAOnI,EAAS+H,EAAM,IAAI,EACtCK,EAAKL,EAAM,GAGbM,EACArG,EAEJ,GAAI4F,IAAQ,OAAU,CAACA,IAAQM,EAAe,KAAQA,GAAgB,KACpEG,EAAWxH,GAAiBsH,CAAS,EACrCnG,EAAW,KAAOhC,EAASoI,CAAE,EAAE,SAAS,GAAI,GAAG,MAC1C,CAEL,IAAME,EAAUV,IAAQ,OAAS,CAACA,EAAM/H,GAAO,YAAYsI,CAAS,EAAI,KAClEI,EAASX,IAAQ,MAAS,CAACA,GAAOU,EAAWzI,GAAO,WAAWsI,CAAS,EAAI,KAIhFP,IAAQ,OAAU,CAACA,GAAOU,IAAY,CAACC,GAAUD,EAAQ,OAASC,EAAO,SAGzEvG,EAAWsG,EACXD,EAAW1H,GAAeyH,CAAE,IAE5BpG,EAAWuG,EACXF,EAAWzH,GAAewH,CAAE,EAEhC,CAGA,OAAIC,EAAS,OAASrG,EAAS,QAAUkG,EAAqBP,EAEvD,CACL,GAAGA,EACH,OAAQ,CACN,CAAE,GAAGI,EAAO,GAAIjH,GAAsB,KAAMkB,CAAS,EACrDgG,GAAc,SACd,CAAE,GAAGC,EAAW,CAACnH,EAAoB,EAAG,CAAE,KAAMuH,CAAS,CAAE,CAC7D,CACF,CACF,IC1hBA,eAAsBG,GACpBC,EACAC,EACAC,EACmB,CACnB,IAAMC,EACJ,OAAOH,GAAU,SAAWA,EAAQA,aAAiB,IAAMA,EAAM,SAAS,EAAIA,EAAM,IAEhFI,EAASC,GAAS,IAAIF,CAAG,EAK/B,GAJAG,EAAYA,IAAc,IAAUF,IAAW,GAAhB,GAA2BA,IAAS,CAAC,GAAK,KAIrEF,GAAoBD,GAAM,MAAQ,OAAOA,EAAK,MAAS,WACrDK,IAAc,IAAMA,IAAc,MACpC,GAAI,CACF,IAAMC,EAAS,KAAK,MAAMN,EAAK,IAAc,EACvCO,EAAON,EAAiBK,CAAM,EAChCC,IAAS,SACXP,EAAO,CACL,GAAGA,EACH,KAAM,KAAK,UAAUO,CAAI,CAC3B,EAEJ,MAAQ,CAER,CAIJ,IAAMC,EAAU,OAAOR,GAAM,MAAS,SAAYA,EAAK,KAAkB,KAEzE,GAAIK,GAAaA,IAAc,IAAMG,GAAWA,EAAQ,QAAU,KAAe,CAC/E,IAAMC,EAAa,MAAM,IAAI,SAC3B,IAAI,KAAK,CAACD,CAAO,CAAC,EACf,OAAO,EACP,YAAY,IAAI,kBAAkBH,CAA8B,CAAC,CACtE,EAAE,KAAK,EACPL,EAAO,CACL,GAAGA,EACH,KAAMS,EACN,QAAS,CAAE,GAAIT,GAAQA,EAAK,QAAU,mBAAoBK,CAAU,CACtE,CACF,CACA,IAAMK,EAAW,MAAM,MAAMR,EAAKF,CAAI,EAEtC,GAAIK,IAAc,KAAM,CACtB,IAAMM,EAAYD,EAAS,QACxB,IAAI,iBAAiB,GACpB,MAAM,GAAG,EACV,OAAQE,GAAMC,GAAK,SAASD,CAAC,CAAC,EACjCR,GAAS,IAAIF,EAAKS,GAAW,OAASA,EAAY,EAAE,CACtD,CAEA,OAAOD,CACT,CAtFA,IAAaI,GAEPV,GACAS,GACFR,EA0GSU,GA9GbC,GAAAC,GAAA,KAAaH,GAAgB,KAEvBV,GAAW,IAAI,IACfS,GAAO,CAAC,cAAe,UAAW,MAAM,EAC1CR,EAAgC,OAAO,kBAAsB,IAAc,GAAK,KA0GvEU,GAAwB,CACnChB,EACAC,IAEO,sCAA2B,KAAK,CAAC,CAAE,cAAAkB,CAAc,IACtDpB,GAAeC,EAAOC,EAAMkB,CAAa,CAC3C,ICxDFC,KA5DA,OAAOC,MAAU,YAGjB,IAAMC,GAAO,CAACC,EAAUC,IACtB,OAAO,OAAOD,EAAK,CACjB,SAAU,IAAI,eAAe,CAC3B,MAAME,EAAO,CACX,OAAAD,EAAO,MAAMC,CAAK,EACX,QAAQ,QAAQ,CACzB,EACA,OAAQ,CACN,OAAAD,EAAO,IAAI,EACJ,QAAQ,QAAQ,CACzB,CACF,CAAC,EACD,SAAU,IAAI,eAAe,CAC3B,KAAM,QACN,MAAME,EAAM,CACVF,EAAO,GAAG,OAASC,GAAeC,EAAK,QAAQD,CAAK,CAAC,EACrDD,EAAO,KAAK,MAAO,IAAME,EAAK,MAAM,CAAC,CACvC,CACF,CAAC,CACH,CAAC,EAEE,WAAW,oBACd,WAAW,kBAAoB,KAAwB,CACrD,YAAYC,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAASH,EAAK,cAAc,EACnBM,IAAW,OACpBH,EAASH,EAAK,WAAW,EAChBM,IAAW,KACpBH,EAASH,EAAK,qBAAqB,EAEnCG,EAASH,EAAK,iBAAiB,EAEjCC,GAAK,KAAME,CAAM,CACnB,CACF,GAGG,WAAW,sBACd,WAAW,oBAAsB,KAA0B,CACzD,YAAYG,EAAgB,CAC1B,IAAIH,EACAG,IAAW,UACbH,EAASH,EAAK,cAAc,EACnBM,IAAW,OACpBH,EAASH,EAAK,aAAa,EAClBM,IAAW,KACpBH,EAASH,EAAK,uBAAuB,EAErCG,EAASH,EAAK,iBAAiB,EAEjCC,GAAK,KAAME,CAAM,CACnB,CACF",
+  "names": ["jit_compressor_exports", "__export", "compress_call", "LibZip", "MAX_128_BIT", "MAX_256_BIT", "_normHex", "_hexToUint8Array", "_uint8ArrayToHex", "not", "and", "or", "xor", "shl", "shr", "sub", "sigext", "flzFwdBytecode", "rleFwdBytecode", "_jitDecompressor", "DECOMPRESSOR_ADDRESS", "init_jit_compressor", "__esmMin", "hex", "normalized", "len", "bytes", "i", "a", "b", "shift", "value", "byteSize", "numBytes", "mask", "signBit", "maskedVal", "address", "calldata", "originalBuf", "padding", "buf", "n", "ops", "data", "stack", "trackedMemSize", "mem", "firstPass", "getStackIdx", "val", "idx", "opFreq", "dataFreq", "stackFreq", "wordCache", "wordCacheCost", "roundUp32", "x", "pushCounter", "stackCnt", "pop2", "ctr", "m", "k", "delta", "inc", "pushOp", "op", "d", "imm", "pushS", "v", "freq", "trackMem", "offset", "size", "addOp", "_", "opcode", "pushN", "pushB", "cntWords", "wordHex", "estShlCost", "seg", "cost", "first", "s", "e", "plan", "emitPushN", "emitPushB", "emitOp", "o", "_stack", "base", "word", "literal", "literalCost", "literalVal", "baseBytes", "shlCost", "inStack", "reuseCost", "byte8s", "byte8sCost", "bestCost", "bestEmit", "notVal", "notBytes", "tmp", "notCost", "subVal", "subBytes", "subCost", "truncated", "extended", "trueByteCost", "signCost", "shiftBits", "shifted", "notShifted", "shiftedBytes", "tmpShifted", "shiftNotCost", "suffix0s", "step", "out", "payload", "alg", "method", "params", "txObj", "blockParam", "overrides", "originalSize", "inputData", "to", "bytecode", "flzData", "cdData", "compressModule", "input", "init", "transformPayload", "url", "cached", "_sup_enc", "supported", "parsed", "next", "bodyStr", "compressed", "response", "encodings", "e", "_enc", "MIN_BODY_SIZE", "compressModuleWithJIT", "init_index", "__esmMin", "compress_call", "init_index", "zlib", "make", "ctx", "handle", "chunk", "ctrl", "format"]
 }

package/_esm/jit-compressor.js

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