[QUOTE=rogue;263774]If anyone is interested, I have a Win64 build of sr2sieve. It is twice as fast as a Win32 build. You must have a 64-bit version of Windows to run. I had to monkey with the code a little to get it to build, but that was just to address external symbols and none of the binary code. Send me a PM with your e-mail address if you are interested. I could probably do the same with Geoff's other sieving programs, but I'm going to hold off for now. I sent an e-mail to Geoff hoping that he will provide the release himself.[/QUOTE]

I'll give it a shot. I've been reading up on Riesel and there seems to be a widely-scattered, loosely-connected bundle of pages (from a newcomer's perspective). I would recommend sieving your own analog output!

:smile:

You can find my email address on the contact section of this page:

Posts about advertising moved to a separate thread [URL="http://www.mersenneforum.org/showthread.php?t=15766"]On advertising[/URL].

k > 2^64?
 

Is there a program that allows you to use constants > 2^64 for doing a Riesel Prime search?

Yes, pfgw. The following is one such prime proved by pfgw:
96880162584451340130465*2^226714+1

k > 2^76. k has to be given as the product of its factors, in this case
k=3*5*11*13*19*29*37*53*59*591499*1197767

[QUOTE=Kosmaj;277221]Yes, pfgw. The following is one such prime proved by pfgw:
96880162584451340130465*2^226714+1

k > 2^76. k has to be given as the product of its factors, in this case
k=3*5*11*13*19*29*37*53*59*591499*1197767[/QUOTE]

THANKS 10^6 !!

It worked!