[QUOTE=MyDogBuster;343910]
90*748^116015+1 is prime

[/QUOTE]

Well done! I wanna be next, there's been enough of a dry spell if you ask me...

7019*10^881309-1 (881313 digits)

[QUOTE]7019*10^881309-1 (881313 digits) [/QUOTE]Nice one Borys - 93 on the big list

CRUS's largest to date:bow: and R10 is now a 1ker

Thanks, still one remaining for R10 and another one for S10 :boxer:

Good one! Stamina pays off in the long run...

[QUOTE=Cruelty;344954]7019*10^881309-1 (881313 digits)[/QUOTE]

Awesome!

The depressing part is that I calculate only 19.56% chance of a prime by n=2M for r10.

What is really needed is a fixed-k non-base-2 GPU sieve similar to srsieve :smile:

An excellent reward for three years of persistence. 8579*10^373260-1 seems to have been your previous R10 prime...

Willem.

[QUOTE=Cruelty;344992]What is really needed is a fixed-k non-base-2 GPU sieve similar to srsieve :smile:[/QUOTE]

Unfortunately we are a way from doing that. BSGS needs too much memory so the GPU is not practical. Memory light methods are not very smooth.

[QUOTE=rogue;345012]Unfortunately we are a way from doing that. BSGS needs too much memory so the GPU is not practical. Memory light methods are not very smooth.[/QUOTE]
This has been discussed in the past.
[URL]http://www.mersenneforum.org/showthread.php?t=16250&highlight=bsgs&page=3[/URL]
Is the memory usage dependent on p or the range of p?
Also you talk about needing 256 sets of 80MB data as there are 256 cores. Is there a way to utilize multiple cores on the same set of data?
Another option is to make it use only a few cores(as many as possible) and expect the user to also run a thread of mfaktc to saturate the gpu.