The OCaml type system, and its module system in particular, is eminently malleable. One of the consequences of this flexibility is that the same entities can often be referred to by multiple names. Short-paths is the feature that tries to find the shortest path before printing something. Two implementations of short-paths already exist: one in the compiler and one in Merlin. Both are unsatisfying in different ways and in this talk we describe a new blank-slate implementation of that should surpass them in correctness and performances.