mersenneforum.org mtsieve
 Register FAQ Search Today's Posts Mark Forums Read

 2020-12-02, 00:08 #474 rogue     "Mark" Apr 2003 Between here and the 5·1,249 Posts That shouldn't be hard to do.
 2020-12-02, 08:51 #475 Happy5214     "Alexander" Nov 2008 The Alamo City 7608 Posts Also, don't report a fatal error when running the programs with the "--help" switch. It's unnecessarily scary.
2020-12-02, 13:33   #476
rogue

"Mark"
Apr 2003
Between here and the

11000011001012 Posts

Quote:
 Originally Posted by Happy5214 Also, don't report a fatal error when running the programs with the "--help" switch. It's unnecessarily scary.
I've gone back and forth on that. Technically the programs allow you to sieve even if you used -h, but I could probably make an exception in this case.

2020-12-02, 13:57   #477
henryzz
Just call me Henry

"David"
Sep 2007
Cambridge (GMT/BST)

10110101110102 Posts

Quote:
 Originally Posted by rogue I've gone back and forth on that. Technically the programs allow you to sieve even if you used -h, but I could probably make an exception in this case.
Most programs only display help with -h

2020-12-02, 21:14   #478
rogue

"Mark"
Apr 2003
Between here and the

141458 Posts

Quote:
 Originally Posted by henryzz Most programs only display help with -h
Changing the behavior for -h is easy, but after looking at the code I can say that factor validation of files input with -I is going to take more time.

Last fiddled with by rogue on 2020-12-02 at 21:14

 2020-12-11, 17:31 #479 YaoPlaysMC   Nov 2020 2·5 Posts Can you make a program for sieving Generalized Unique primes of the form Phi(3, -k^b)?
2020-12-11, 20:08   #480
rogue

"Mark"
Apr 2003
Between here and the

5×1,249 Posts

Quote:
 Originally Posted by YaoPlaysMC Can you make a program for sieving Generalized Unique primes of the form Phi(3, -k^b)?
I suggest that you start with the Prime Pages and search for "Generalized Unique" to see if any of those primes were found with the help of sieving software that you can use.

I'm not saying that I don't want to do this. I just don't want to cover ground done by someone else, unless I believe that I can write something either more accessible to the average use or much faster than what's available.

 2021-01-05, 20:14 #481 YaoPlaysMC   Nov 2020 2·5 Posts Can you make a program to sieve generalized Gaussian Mersenne primes of the form ((b^n-1)^2+1)/2? Side note: These numbers are considered to be half-GFN because they are of the form (k^2+1)/2
2021-01-05, 21:59   #482
rogue

"Mark"
Apr 2003
Between here and the

5×1,249 Posts

Quote:
 Originally Posted by YaoPlaysMC Can you make a program to sieve generalized Gaussian Mersenne primes of the form ((b^n-1)^2+1)/2? Side note: These numbers are considered to be half-GFN because they are of the form (k^2+1)/2
Possibly. Is there an efficient way to sieve them?

 2021-01-06, 15:10 #483 rogue     "Mark" Apr 2003 Between here and the 5·1,249 Posts I have posted 2.1.3 over at sourceforge. Here are the changes: Code:  framework: Improve determination of "largest prime" tested for per minute stats by ignoring workers that haven't done any work. dmdsieve: version 1.3 Added working factor validation logic with -I. Modify factor validation logic to only verify the first 5 factors for each small prime. If there is a problem it will reveal itself immediately. This improves the speed when starting a new sieve. gnfdsieve, gfndsievecl: version 1.9 Added working factor validation logic with -I. Modify factor validation logic to only verify the first 5 factors for each small prime. If there is a problem it will reveal itself immediately. This improves the speed when starting a new sieve. Allow the GPU to start sieving at (kMax-kMin)/2 instead of kMax. Switched to Montgomery mulitplication in the GPU. Changed GPU code to handle "too many factors" similar to other GPU sievers in the framework as opposed to crashing if not enough GPU memory. GPU code is about 9x faster than CPU code, but GPU code is only of value if one needs to sieve more deeply than (kMax-kMin)/2, which is somwhere over n=1000. mfsieve: version 1.9 Used vectorized Montgomery logic to get a 1% to 5% speed boost. srsieve2: version 1.3.1 Modify factor validation logic to only verify the first 5 factors for each small prime. If there is a problem it will reveal itself immediately. This improves the speed when starting a new sieve.
 2021-01-10, 02:27 #484 MisterBitcoin     "Nuri, the dragon :P" Jul 2016 Good old Germany 32·89 Posts Code:  p=24662984657, 428.2K p/sec, 2771 factors found at 13.13 sec per factor, 98.6% done. ETC 2021-01-10 03:06 Sieve completed at p=25000000013. Processor time: 9358.14 sec. (15.48 sieving) (3.87 cores) I wonder how he took 15,48 for sieving. Maybe its just an error, i used srsieve v 1.1 with the -W 4 flag. This is the first time sieving goes above 1 for me :D