"What are Rogue primes," you ask? To put it simply, "Rogue Primes" are primes that I search for and my nickname is "rogue". Nothing more. Nothing less.

Today I responsible for writing or maintaining sieving software used for many projects, which you can find below. I also maintain a lot of software that I did not write and tend to add useful features when necessary. I also wrote the current version of ECMNet and am the author of PRPNet.

I cannot point you to the game sources or executables, but I do know that they can be found on the Internet fairly easily with a little bit of searching.

If I haven't posted a link yet, then it means that the code can be found elsewhere, but needs to be cleaned up.

mtsieve - a framework for many of my sieving programs. All programs using framework can be found via the link.

fsievecl - a sieve for Factorials, optimized for the GPU, also suppots mulit-factorials and inverse factorials. This will be ported to mtsieve in the near future.

gcwsievecl - an OpenCL sieve for finding factors of Cullen and Woodall numbers.

srsieve - a sieve for finding factors of k*b^n+-c numbers

sr1sieve - a sieve for finding factors of k*b^n+-c numbers for a single k, b, n, and c

sr2sieve - a sieve for finding factors of k*b^n+-c numbers for multiple k, b, n, and c

ECMNet - a client/server application for factoring numbers using ECM

PRPNet - a client/server applications for finding prime numbers

pfgw - a program that can PRP test anything, using George Woltman's gwnum library

wwww - a program for finding Wieferich and Wall-Sun-Sun primes

wwwwcl - an OpenCL version of wwww

MultiSieve - a older Windows GUI application for sieving numbers of various forms. I no longer support it. Fortunately most of the sieves it supports are written as 64-bit apps that are much faster. If you absolutely gotta have it, then send me a request and I can share the source.Alternating
Factorials - the sum of consecutive factorials with alternating
signs

Smarandache-Wellin - primes generated from a string of consecutive numbers

Copeland-Erdos - primes generated from a string of consecutive prime numbers

Generalized Woodalls and Cullens - Numbers in the form b^n-1 (Woodall) and b^n+1 (Cullen)

Conjectures 'R Us - primes to help prove Sierpinski and Riesel conjectures of various bases

Carol / Kynea - a form of Near Square numbers with the form (b^n-1)^2-2 and (b^n+1)^2-2

Multifactorial - a derivative of the Factorials with the form m!n-1 and m!n+1