One of the worst things for any ISA is that an algorithm's completion
time is directly affected by different implementations having instructions
take longer or shorter times. Knuth's Big-Integer division is unfortunately
-one such algorithm, where Big-Integer Goldschmidt divide is not.
+one such algorithm.
Assuming that the computation of qhat takes 128 cycles to complete on
a small power-efficient embedded design, this time would dominate