There are a lot of fat-mouthed distro lackeys on this group
that claim that a generic distro is just as fast as any optimized
system.

Well, it's time for them to put their money where their fat mouths
are.

Download and build "msieve" which is a program to factor very
large integers:

https://sourceforge.net/projects/msieve/files/msieve/

Perhaps your distro already has msieve ready to rock and roll.
Gentoo certainly does. So too does ArchLinux.

Whatever, be sure to use msieve that is NOT built to use the
GPU (via CODA) but only the CPU.

Then factor the following 159-digit integer:

343065624301876906744214935814545423476905577648850799588019249360798320538732597045829167171100863421689224335886880379963254179442200201724690242850228936603

Report the time required. Msieve will output the time upon
completion.

My customized 12-year-old Core i7 will doubtless beat the pants
over all recent systems using a genric distro.

C'mon! Get fucking moving! Report or else forever shut the
fuck up.



--
Systemd: solving all the problems that you never knew you had.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

On Tue, 08 Apr 2025 21:03:07 +0000, Farley Flud <ff@linux.rocks> wrote in <pan$35924$463a0a60$2d7b1a01$1cb6757b@linux.rocks>:

There are a lot of fat-mouthed distro lackeys on this group that claim
that a generic distro is just as fast as any optimized system.

Well, it's time for them to put their money where their fat mouths are.

Download and build "msieve" which is a program to factor very large
integers:

https://sourceforge.net/projects/msieve/files/msieve/

Perhaps your distro already has msieve ready to rock and roll.
Gentoo certainly does. So too does ArchLinux.

Whatever, be sure to use msieve that is NOT built to use the GPU (via
CODA) but only the CPU.

Then factor the following 159-digit integer:

343065624301876906744214935814545423476905577648850799588019249360798320538732597045829167171100863421689224335886880379963254179442200201724690242850228936603

Report the time required. Msieve will output the time upon completion.

I notice you didn't report the time it takes your machine to factor this number.

My customized 12-year-old Core i7 will doubtless beat the pants over all recent systems using a genric distro.

From the Readme:

_ _ _ _ _ _ _
The maximum size of numbers that can be given to the library is hardwired
at compile time. Currently the code can handle numbers up to ~310 digits; however, you should bear in mind that I don't expect the library to be
able to complete a factorization larger than about 120 digits by itself.
The larger size inputs can only really be handled by the number field
sieve, and the NFS sieving code is not efficient or robust enough to deal
with problems larger than that. Msieve *can* complete very large NFS factorizations as long as you use the NFS sieving tools from other open-
source packages.
_ _ _ _ _ _ _

The fact that this runs on a single core, and has logical errors in the
code, should be noted.

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.

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.14.1 Release: Mint 22.1 Mem: 258G
"The calm confidence of a Christian with four Aces. - M.Twain"

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

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!

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

On Thu, 10 Apr 2025 10:57:10 +0000, Farley Flud <fsquared@fsquared.linux>
wrote in <1834efcfa4096ef8$93605$1602464$802601b3@news.usenetexpress.com>:

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.

"Congrats you have just finished factoring your integer and now you are
done. Enjoy. Remember that factoring larger numbers will take longer to select a good polynomial, sieve, and require more time and memory for the linear algebra stages. Factoring a 155 digit number for example using
GNFS will take months on a quad-core PC. "

Do you want a fair assessment, or are you going to just play games?

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.14.1 Release: Mint 22.1 Mem: 258G
"Of course I know what I'm doing! Now gimme that bulk eraser."

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

On 11 Apr 2025 07:06:20 GMT, vallor <vallor@cultnix.org> wrote in <m5rtbcFi7imU1@mid.individual.net>:

On Thu, 10 Apr 2025 10:57:10 +0000, Farley Flud
<fsquared@fsquared.linux> wrote in <1834efcfa4096ef8$93605$1602464$802601b3@news.usenetexpress.com>:

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.

"Congrats you have just finished factoring your integer and now you are
done. Enjoy. Remember that factoring larger numbers will take longer
to select a good polynomial, sieve, and require more time and memory for
the linear algebra stages. Factoring a 155 digit number for example
using GNFS will take months on a quad-core PC. "

Do you want a fair assessment, or are you going to just play games?

<crickets.wav>

I guess that answers _that_ question...

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.14.2 Release: Mint 22.1 Mem: 258G
"I distinctly remember forgetting that."

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)