Go Back > Great Internet Mersenne Prime Search > Software

Thread Tools
Old 2005-05-27, 17:32   #1
VJS's Avatar
Dec 2004

4538 Posts
Default 64-bit proth sieve possible???

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.
VJS is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Proth primes ET_ Proth Prime Search 9 2020-10-02 07:11
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

All times are UTC. The time now is 00:31.

Wed Oct 20 00:31:00 UTC 2021 up 88 days, 18:59, 0 users, load averages: 2.04, 1.47, 1.24

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.