You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
On my machine n_*_preinv functions are often faster than the n_*_precomp versions, e.g. a 54-bit primality test is faster than a 52-bit one because of this.
We ought to profile these on various current machines and choose the precomp functions conditionally based a flag that we define in flint-mparam.h.
The text was updated successfully, but these errors were encountered:
One could also see if the precomp versions run faster when reimplemented using floating-point FMA. However, keeping residues in double format through a whole algorithm as in fft_small ought to be better than converting back and forth between ulong and double.
On my machine
n_*_preinv
functions are often faster than then_*_precomp
versions, e.g. a 54-bit primality test is faster than a 52-bit one because of this.We ought to profile these on various current machines and choose the
precomp
functions conditionally based a flag that we define inflint-mparam.h
.The text was updated successfully, but these errors were encountered: