On the Convergence Rate of the One-Hop Transfer Algorithm
Optimization and Control
2026-03-31 v1
Abstract
The transfer algorithm~\cite{jiang} solves the on-chain one-hop swap routing problem. In \cite{jiang}, the convergence is proved but the convergence rate is left open. We prove that the algorithm terminates in at most rounds, where is the number of AMMs, a liquidity heterogeneity parameter and a tolerance parameter.
Cite
@article{arxiv.2603.27172,
title = {On the Convergence Rate of the One-Hop Transfer Algorithm},
author = {Ruichao Jiang and Long Wen},
journal= {arXiv preprint arXiv:2603.27172},
year = {2026}
}