Register FAQ Search Today's Posts Mark Forums Read

 2018-10-22, 14:45 #1 Stargate38     "Daniel Jackson" May 2011 14285714285714285714 647 Posts Where can I download GenSv? On this page, they mention this tool: Code: GenSv: ------ A Generic Siever for finding ultra-sparse forms, such as exceptionally long Cunningham Chains. Used by Phil Carmody and Paul Jobling for their longest records. Can someone please tell me where to download it? I've been looking everywhere. Last fiddled with by Stargate38 on 2018-10-22 at 14:47 Reason: wrong tags
 2018-10-22, 17:36 #2 VBCurtis     "Curtis" Feb 2005 Riverside, CA 22·7·132 Posts 1. Where is everywhere? 2. If you can't easily find it, say by going to the personal web pages of the two mentioned mathematicians, what makes you think it is publicly available?
 2018-10-22, 20:40 #3 Stargate38     "Daniel Jackson" May 2011 14285714285714285714 647 Posts By everywhere, I mean by googling for it. It has to be made available someday. I want to use it to find record cunningham chains. Last fiddled with by Stargate38 on 2018-10-22 at 20:46
 2018-10-22, 23:50 #4 VBCurtis     "Curtis" Feb 2005 Riverside, CA 473210 Posts What's wrong with NewPGen?
2018-10-23, 00:54   #5
Dr Sardonicus

Feb 2017
Nowhere

105478 Posts

Quote:
 Originally Posted by Stargate38 On this page, they mention this tool: Code: GenSv: ------ A Generic Siever for finding ultra-sparse forms, such as exceptionally long Cunningham Chains. Used by Phil Carmody and Paul Jobling for their longest records. Can someone please tell me where to download it? I've been looking everywhere.
The info at the page you cite, Cunningham Chain records, indicates that the Carmody/Jobling results are dated February 2002. It also mentions results obtained by one Serge Batalov, from 2014 to as recently as December 2017.

I did find some descriptions by Phil Carmody of how gensv worked, but they were also of 2002 vintage. From Prime puzzle #167 we have
Quote:
 It's a 'generic sieve', it uses a bit of CRT, and then several different bit-blasting techniques to sieve a contiguous block of numbers for patterns in residues. In order to run it, you simply need to generate a file containing the included or excluded residues for each prime. No particular problem is hard-coded into it, which is why it's so 'generic'."

 2018-10-23, 02:01 #6 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 222558 Posts

 Similar Threads Thread Thread Starter Forum Replies Last Post ima wana be Software 6 2012-03-14 03:44 Unregistered Information & Answers 1 2011-07-23 14:30 xorbe Information & Answers 3 2009-03-15 05:46 Unregistered Information & Answers 4 2009-01-28 04:54 ReMMbErMyTiTaNs Software 3 2008-10-09 09:01

All times are UTC. The time now is 01:50.

Wed Apr 14 01:50:24 UTC 2021 up 5 days, 20:31, 1 user, load averages: 1.94, 2.03, 1.93