mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > And now for something completely different

Reply
 
Thread Tools
Old 2017-04-27, 17:08   #1
Stargate38
 
Stargate38's Avatar
 
"Daniel Jackson"
May 2011
14285714285714285714

23×34 Posts
Default How/Where to get Jens Kruse Andersen's prime constellation sieve?

Does anyone know how to obtain Jens Kruse Andersen's prime constellation sieve (or any other program he wrote)? I've been looking everywhere for it.

Last fiddled with by Stargate38 on 2017-04-27 at 17:10 Reason: clarification...
Stargate38 is offline   Reply With Quote
Old 2017-04-27, 18:04   #2
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

70518 Posts
Default

Quote:
Originally Posted by Stargate38 View Post
Does anyone know how to obtain Jens Kruse Andersen's prime constellation sieve (or any other program he wrote)? I've been looking everywhere for it.
Try emailing him: jens.k.a at get2net dot dk
paulunderwood is offline   Reply With Quote
Old 2017-04-28, 00:08   #3
danaj
 
"Dana Jacobsen"
Feb 2011
Bangkok, TH

90810 Posts
Default

There are alternatives to it that are open source, but his benchmark numbers make it sound faster, but that's just based on a couple data points.

Jörg Waldvogel also has published results about constellations and believes his software is faster than mine based on time for a particular cluster search. Without source it's hard to tell. I know his method is similar in gross overview "a sieve to eliminate the small divisors in an entire block of numbers" followed by primality tests. In more specifics he generates candidates from the first 15 primes, then sieves from 53 to 541, then uses Pari's BPSW test. It's also done in a cluster framework.

My version chooses the candidate size dynamically so it will differ based on the size and clsuter, trying to meet a very approximate target goal of candidates per segment. Then sieves to 997, followed by BPSW in GMP. I do the dynamic limit partly because as part of a library I believe I should try to limit memory use, and work without someone changing the source code for each search. I suspect the real key is in reducing the time taken for sieving out the candidates, especially the first 5-20 next primes.

Anyway, email him as Paul said.
danaj is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
How do you efficiently sieve for prime 3/4-tuples? Puzzle-Peter Software 156 2019-06-03 20:19
Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve mickfrancis Factoring 2 2016-05-06 08:13
GPU Prime Sieve tapion64 GPU Computing 7 2014-04-10 06:15
Sieve depth vs. prime probability Unregistered Information & Answers 2 2010-05-25 20:51
Prime in Riesel Sieve Project Sloth Prime Sierpinski Project 1 2006-05-10 02:02

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

Wed Apr 21 04:18:05 UTC 2021 up 12 days, 22:58, 0 users, load averages: 1.88, 2.09, 2.01

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.