blackwatch
12-08-2002, 1:20 PM
here is what the client actually is doing with your cpu
posted by mike 12/8
Its doing a little more then guessing a random number, we are guessing only numbers than the SQR route of the challenge number, and we never guess a number less then 30 digits, you'll agree by doing that that eliminates around the same or more of the key space. We also went a step further, once we guess a number we strip the end digit and check the number 4 times replacing the last digit with a 1, 3, 7 and 9. (Just by checking numbers that end with a 1, 3, 7 or 9 eliminate 60% of the key space of the ~20 - ~25% key space we are checking already).
Even brute forcing the remaining keys would take 10 times the age of the universe. (Thats why we went random)
Prior to running Neo we wrote a small DC project that brute forced every number up to 999999999999999999999999999999 and came up with no luck, so we are positive that the
So its really not all as bad as it sounds. We are 70% done writing our new algorithm using Pollards, P-1, p+1, Quadratic Sieve & ECM. We are emplementing a few at the same time so we have a greater chance. We are also implementing a little chaos in to the algorithms ;)
Chris (The physics nut) and I are working on the client, and Bill & Steve are writing the server. Justin is banging his head wondering what kind of CPU leach we are creating!
So anyhow, we are going to be using a few proven methods with a little chaos.
posted by mike 12/8
Its doing a little more then guessing a random number, we are guessing only numbers than the SQR route of the challenge number, and we never guess a number less then 30 digits, you'll agree by doing that that eliminates around the same or more of the key space. We also went a step further, once we guess a number we strip the end digit and check the number 4 times replacing the last digit with a 1, 3, 7 and 9. (Just by checking numbers that end with a 1, 3, 7 or 9 eliminate 60% of the key space of the ~20 - ~25% key space we are checking already).
Even brute forcing the remaining keys would take 10 times the age of the universe. (Thats why we went random)
Prior to running Neo we wrote a small DC project that brute forced every number up to 999999999999999999999999999999 and came up with no luck, so we are positive that the
So its really not all as bad as it sounds. We are 70% done writing our new algorithm using Pollards, P-1, p+1, Quadratic Sieve & ECM. We are emplementing a few at the same time so we have a greater chance. We are also implementing a little chaos in to the algorithms ;)
Chris (The physics nut) and I are working on the client, and Bill & Steve are writing the server. Justin is banging his head wondering what kind of CPU leach we are creating!
So anyhow, we are going to be using a few proven methods with a little chaos.