Trivial instances of univariate polynomial factorization over complicated number fields are extremely slow because Sage starts by trying to compute an integral basis. We introduce a fast path that ...