The main reason for the weaker bit complexity of the Descartes method is its conservative subdivision strategy that allows linear convergence only.
In the new algorithm, we combine Descartes method with Newton iteration. Following this approach, quadratic convergence can be achieved in most iterations. As a result, the size of the induced recursion tree reduces by one magnitude, whereas the bit complexity becomes comparable to that of the known asymptotically fast methods.