Proof-of-concept software

The constants labelled below as ``2000 Bernstein''
were found in 1999 and published here in 2000:
reciprocal,
square root,
exponential.
These algorithms are explained in Section 5 of the paper.

Summary of the results

High-precision division, square root, etc. can be accelerated.
The best algorithms are nearly three times faster than the usual algorithms.

The following table shows the constants for various algorithms
compared to multiplication.
For example, 1.5 for 1/f means that there is a reciprocal algorithm
taking 1.5+o(1) times as long as multiplication.
``Simple'' is the usual algorithm;
``best'' is the smallest published constant.