Sieving

OmbooHankvald · 2005-06-06, 19:18

I am new here and was just wondering: Aren't you guys doing the same sieving stuff as projects like www.seventeenorbust.com (their sub-project about sieving) and www.rieselsieve.com?

Are the three of you sieving the same ranges or have you picked some each?

Or am I just getting it all wrong?

Mystwalker · 2005-06-06, 19:34

It is the same kind of work and the same program to do - but every project tests different numbers:

SoB: Proth numbers (k*2^n+1) with k < 78,557
RieselSieve: Riesel numbers (k*2^n-1) with k < IDon'tKnowAtTheMoment
PSP: Proth numbers with prime k's (prime k's < 78,557 won't get checked again, of course)

OmbooHankvald · 2005-06-07, 06:34

Ahh... I see

battlemaxx · 2005-06-29, 14:29

How does the work give divided up by the different projects, or does it?

Mystwalker · 2005-06-30, 07:51

Each project is working on disjunct candidates, so there is no need to divide work.

An exception can be seen in the prime k's of (potential) proth numbers < 78,557. These are necessary for PSP and SoB. But SoB was already way ahead when PSP was founded, so PSP stays away from these candidates and cheers everytime a SoB prime is of a prime k.

2005-06-06, 19:18	#1
OmbooHankvald May 2005 Copenhagen, Denmark 121₁₆ Posts	Sieving I am new here and was just wondering: Aren't you guys doing the same sieving stuff as projects like www.seventeenorbust.com (their sub-project about sieving) and www.rieselsieve.com? Are the three of you sieving the same ranges or have you picked some each? Or am I just getting it all wrong?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Going over 100% during sieving	wombatman	Msieve	4	2013-07-11 15:41
NFS sieving?	Dubslow	Factoring	8	2012-09-28 06:47
Line sieving vs. lattice sieving	JHansen	NFSNET Discussion	9	2010-06-09 19:25
10^420 + 1 sieving	juno1369	Factoring	20	2010-04-28 01:11
Sieving	robert44444uk	Sierpinski/Riesel Base 5	8	2005-04-02 22:30

2005-06-06, 19:34	#2
Mystwalker Jul 2004 Potsdam, Germany 3·277 Posts	It is the same kind of work and the same program to do - but every project tests different numbers: SoB: Proth numbers (k2^n+1) with k < 78,557 RieselSieve: Riesel numbers (k2^n-1) with k < IDon'tKnowAtTheMoment PSP: Proth numbers with prime k's (prime k's < 78,557 won't get checked again, of course)

2005-06-07, 06:34	#3
OmbooHankvald May 2005 Copenhagen, Denmark 289₁₀ Posts	Ahh... I see

2005-06-29, 14:29	#4
battlemaxx Nov 2002 43 Posts	How does the work give divided up by the different projects, or does it?

2005-06-30, 07:51	#5
Mystwalker Jul 2004 Potsdam, Germany 3×277 Posts	Each project is working on disjunct candidates, so there is no need to divide work. An exception can be seen in the prime k's of (potential) proth numbers < 78,557. These are necessary for PSP and SoB. But SoB was already way ahead when PSP was founded, so PSP stays away from these candidates and cheers everytime a SoB prime is of a prime k.