![]() |
![]() |
#1 |
Dec 2004
13·23 Posts |
![]()
I was just wondering if anyone out there was thinking about writing a new program like proth sieve, newpgen, etc...
It seems like there are always advancements with factoring and testing clients but not much when it comes to sieve. Proth is a great program sieves multiple k's ranges of n. (Related to SoB, PSP, riesel, etc...) But I would think there is room for improvement here. Proth generally consumes <30MB of memory for SOB and PSP. (I've been told could use some optimization when it comes to memory issues, has alot of page faults...) I'm just wondering if a new more optimised client is in the works, or has it been though about. It could be more demanding on memory, cache, 64-bit??? I think a client optimised for 512K cache and higher memory amounts could be alot faster. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Proth primes | ET_ | Proth Prime Search | 15 | 2022-06-26 03:27 |
Proth's Theorem | ATH | Math | 9 | 2011-02-15 19:09 |
Converse of Proth's Theorem | Dougy | Math | 15 | 2008-01-30 21:17 |
Proth Test Limits | amcfarlane | Math | 1 | 2006-07-23 18:29 |
Last possible proth tested! | Deamiter | PSearch | 3 | 2003-03-03 03:19 |