Optimal Routing in the Presence of Hooks: Three Case Studies
Tarun Chitra, Kshitij Kulkarni, Karthik Srinivasan
TL;DR
This paper addresses optimal routing of user trades in networks of constant function market makers (CFMMs) in the presence of hooks, which enable auxiliary data to influence trade outputs. It develops tractable formulations based on convex optimization and dynamic programming to handle three practical hook scenarios: onchain limit orders, time-weighted liquidity via TWAMMs, and non-composable hooks with fill risk. The authors show that limit orders act as concentrated liquidity at a price tick, TWAMM-like strategies can be outperformed by mispricing-aware liquidations, and mean-variance analysis can quantify tradeoffs when non-composable hooks are involved, providing efficient frontiers for decision-making. The results demonstrate how hooks expand the routing design space while preserving computational tractability, offering practical guidance for deploying hooks in CFMM ecosystems and informing future adaptive routing approaches.
Abstract
We consider the problem of optimally executing a user trade over networks of constant function market makers (CFMMs) in the presence of hooks. Hooks, introduced in an upcoming version of Uniswap, are auxiliary smart contracts that allow for extra information to be added to liquidity pools. This allows liquidity providers to enable constraints on trades, allowing CFMMs to read external data, such as volatility information, and implement additional features, such as onchain limit orders. We consider three important case studies for how to optimally route trades in the presence of hooks: 1) routing through limit orders, 2) optimal liquidations and time-weighted average market makers (TWAMMs), and 3) noncomposable hooks, which provide additional output in exchange for fill risk. Leveraging tools from convex optimization and dynamic programming, we propose simple methods for formulating and solving these problems that can be useful for practitioners.
