mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2020-12-02, 00:08   #474
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

22·7·223 Posts
Default

That shouldn't be hard to do.
rogue is online now   Reply With Quote
Old 2020-12-02, 08:51   #475
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

3×163 Posts
Default

Also, don't report a fatal error when running the programs with the "--help" switch. It's unnecessarily scary.
Happy5214 is offline   Reply With Quote
Old 2020-12-02, 13:33   #476
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

22·7·223 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
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.
rogue is online now   Reply With Quote
Old 2020-12-02, 13:57   #477
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2×2,909 Posts
Default

Quote:
Originally Posted by rogue View Post
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
henryzz is offline   Reply With Quote
Old 2020-12-02, 21:14   #478
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

22×7×223 Posts
Default

Quote:
Originally Posted by henryzz View Post
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
rogue is online now   Reply With Quote
Old 2020-12-11, 17:31   #479
YaoPlaysMC
 
Nov 2020

32 Posts
Default

Can you make a program for sieving Generalized Unique primes of the form Phi(3, -k^b)?
YaoPlaysMC is offline   Reply With Quote
Old 2020-12-11, 20:08   #480
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

22×7×223 Posts
Default

Quote:
Originally Posted by YaoPlaysMC View Post
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.
rogue is online now   Reply With Quote
Old 2021-01-05, 20:14   #481
YaoPlaysMC
 
Nov 2020

32 Posts
Default

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
YaoPlaysMC is offline   Reply With Quote
Old 2021-01-05, 21:59   #482
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

22·7·223 Posts
Default

Quote:
Originally Posted by YaoPlaysMC View Post
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?
rogue is online now   Reply With Quote
Old 2021-01-06, 15:10   #483
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

186416 Posts
Default

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.
rogue is online now   Reply With Quote
Old 2021-01-10, 02:27   #484
MisterBitcoin
 
MisterBitcoin's Avatar
 
"Nuri, the dragon :P"
Jul 2016
Good old Germany

80110 Posts
Default

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

Thread Tools


All times are UTC. The time now is 04:05.

Fri Feb 26 04:05:14 UTC 2021 up 85 days, 16 mins, 0 users, load averages: 2.93, 2.81, 2.45

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.