Cases

Routing

A 1000-SOL route that would not fit in a transaction, made to fit without widening slippage.

A large split route serialized past the 1,232-byte versioned transaction limit even with 19 address lookup tables attached.

Lookup-table-aware leg capping in the lander: drop the smallest-allocation legs, redistribute their size across the survivors, gated on real serialized size, not a fixed hop count.

Siblings in the same engine: reverse-pool synthesis for both-direction quotes on every pair, splits forced across disjoint pools so a route never re-drains one reserve, staleness-safe CLMM quoting bounded on chain at quote time.

The route graph sits in a 2 GiB unified-memory carveout, about 97% of legs collapsing to an 8 to 16 byte back-pointer; only pools that changed on a stream tick are recomputed.

Bring us the hard

The router, the program, the migration. Built on metal we run ourselves.

Book a call