Sujet : Re: Speed Test For Big-Mouthed Lackeys
De : fsquared (at) *nospam* fsquared.linux (Farley Flud)
Groupes : comp.os.linux.advocacyDate : 10. Apr 2025, 11:57:10
Autres entêtes
Organisation : UsenetExpress - www.usenetexpress.com
Message-ID : <1834efcfa4096ef8$93605$1602464$802601b3@news.usenetexpress.com>
References : 1 2
User-Agent : Pan/0.146 (Hic habitat felicitas; d7a48b4 gitlab.gnome.org/GNOME/pan.git)
On Thu, 10 Apr 2025 09:50:43 +0000, vallor wrote:
Finally, the artificial limit that one can't use CUDA doesn't jive well
with those of us who have more advanced computational workstations than
you do.
>
It's a way to level the playing field so that comparisons are more meaningful.
Without CUDA there is reliance only on the common distro provided stuff.
Also from the README
"For larger numbers, the code
switches to the GMP-ECM library and runs the P-1, P+1 and ECM algorithms,
expending a user-configurable amount of effort to do so. If these do not
completely factor the input number, the library switches to the heavy
artillery. Unless told otherwise, Msieve runs the self-initializing quadratic
sieve algorithm, and if this doesn't factor the input number then you've
found a library problem. If you know what you're doing, Msieve also contains
a complete implementation of the number field sieve, that has helped complete
some of the largest public factorization efforts known. Information specific
to the quadratic sieve implementation is contained in Readme.qs, while the
number field sieve variant is described in Readme.nfs"
So the user has to do some things.
-- Hail Linux! Hail FOSS! Hail Stallman!