The Metis Routing Algo
summary
Jupiter rewrites routing into Rust and implements a Metis router that frames routing as a constrained shortest path problem (citing Loano and Medaglia 2013) and applies aggressive pruning rules to avoid exponential permutation growth under Solana’s 64-account limit. Validation uses saved on‑chain snapshots and Criterion benchmarks. Deployed on Jupiter (which has done $34B volume and ~955k wallets), Metis finds better prices than V2 at the cost of latency — about 70ms average runtime versus V2’s <60ms.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 0:29What is Metis
- 1:04Metis Stats
- 1:28Dr Promise
- 1:46Routing
- 6:18Constraint shortest path
- 8:18PSE algorithm
- 9:08Validate results
- 10:11Experiment results
- 10:37Runtime results
- 12:10Summary
related talks
17mServiceRouter: Hyperscale and Minimal Cost Service Mesh
05mMantis: Powering Best Execution
21mServiceRouter: Hyperscale Service Mesh
06mJito - Building The Market Layer of Solana
11mLightning talk: Rust in blockchain. How Rust powers Solana
55mScaling out operational research with Rust
23mBest of Both Worlds: Building a Mirror-trading Platform on Top of ...
35mMEV: Next Frontier of the DeFi Stack