Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.os.linux.advocacy > #688865
| From | vallor <vallor@cultnix.org> |
|---|---|
| Newsgroups | comp.os.linux.advocacy |
| Subject | Re: Speed Test For Big-Mouthed Lackeys |
| Date | 2025-04-11 07:06 +0000 |
| Message-ID | <m5rtbcFi7imU1@mid.individual.net> (permalink) |
| References | <pan$35924$463a0a60$2d7b1a01$1cb6757b@linux.rocks> <m5pijjF86pcU2@mid.individual.net> <1834efcfa4096ef8$93605$1602464$802601b3@news.usenetexpress.com> |
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."
Back to comp.os.linux.advocacy | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Speed Test For Big-Mouthed Lackeys Farley Flud <ff@linux.rocks> - 2025-04-08 21:03 +0000
Re: Speed Test For Big-Mouthed Lackeys Joel <joelcrump@gmail.com> - 2025-04-08 17:35 -0400
Re: Speed Test For Big-Mouthed Lackeys vallor <vallor@cultnix.org> - 2025-04-10 09:50 +0000
Re: Speed Test For Big-Mouthed Lackeys Farley Flud <fsquared@fsquared.linux> - 2025-04-10 10:57 +0000
Re: Speed Test For Big-Mouthed Lackeys vallor <vallor@cultnix.org> - 2025-04-11 07:06 +0000
Re: Speed Test For Big-Mouthed Lackeys vallor <vallor@cultnix.org> - 2025-04-14 14:51 +0000
csiph-web