It's not illegal either way. I wouldn't mess with it if it was. You will get slapped with a DMCA notice, but after breaking a 1024 bit key, it would be impossible to even take them all down, besides being monetarily infeasable.

Now, since we can view the code anyway, and since iPhone jailbreaking is now legal, then so is this.  Besides, distribution of numbers is not illegal, nor is seining them to slashdot, hackaday, and pretty much every other site known to man. Expect 500+ guests if they link to omni.

This should be fun.

I get the exact same on linux!!!

Sir just ninja'd you with the answer to life, the universe, and everything.

@calc84maniac.  That's not a bad algorithm at all.  In fact, if you could solve the Diophantine equation N=A²-B², we could solve it pretty quickly.  That's one of the main things I've been using to try and break this.  (Besides tree structures, and bit error checking)

@alberthro yeah, you pretty much described boinc there.

Combination Combinations space

What effect?

Could I have that number in hex?

somewhere between 0x2 and 0x164

What is the maximum 512-bit prime number?  Does anyone know?
(If not, the biggest non-prime 512-bit number works, too)
Also, what is a reasonably good distance between numbers to try?

The reasonable distance is essentially random.  Smallest number bellow 2^512? That would be slightly difficult.  Just start at 2^512, I guess.

I think there may be a simple method we have overlooked.  This isn't neccissarily the best resource, but this is a list of the top 500 known prime numbers.  Perhaps we can multiply them to each other until we find n?  I know it's brute force, but hey, it could work.

Quite possibly, but unlikely.  It would work if it only had one factor, but if it has both, it won't work.  The best thing dealing with that I've seen, is start off with some prime number S₁.  Then, multiply 1 S₁ with 2 S₂. S₂ is the next prime lower than S₁.  This would take huge initial amounts of memory and would output the file that had this number for some bound B.  So, for example:
B=11
S₁=11
S₂=7
S₃=5
S₄=3
S₅=2
11*(7*7)*(5*5*5)*(3*3*3*3)*(2*2*2*2*2)= 174636000

So, for numbers like 35, we get:
174636000 mod 35 = 0, so we do 174636000 / 35 = 4,989,600.
4989600 mod 35 = 0, so we do 4989600 / 35 =142,560
142,560 mod 35 = 5, hey look a factor.

It gets slightly strange on numbers like 33. (Pretty much any number that doesn't have it's other prime next to it.  I'm just going to use // to mean divide it out as far as it will go out completely. e.g., no fraction or decimal points after dividing.
174,636,000 // 33 =5,292,000
5,292,000 mod 33 = 21. Strange I know, but you only have to do gcd(21,33) to get 3, which is a factor.

So the problem involves setting your maximum bound, and figuring out how many times each number should be multiplied, and sending that task out to whatever...  hmmm... Me has an idea.  I could figure that out, by just saying the maximum bound B minus whatever prime number you are on S, plus 1.  So say the upper bound is 11 (B), and we need to know how many times to multiply 5 in.  So 11-5+1=7.  So that adds slight redundancy but it's easier to split on many machines.

I couldl set up a site that allows you to download data file(s), and a program (Most likely java for easy portability), and gives rewards based on how many you have completed.  Simply download the file, run the program, upload the output, and you get a point or something.  Sounds good to me!  What do you think?