On Fri, Apr 24, 2009 at 3:18 PM, Jonathan Lettvin <[email protected]> wrote: > Being all practical (I apologize), would it not be nice to have a godaddy > server on a domain called "isprime.info" with some ULNT (unpleasantly large > number of Terabytes), where each bit was mapped to a cardinal from 1 to > ULNT*8e12, serving all who care for Brobdignagian primes which returns a > minimalist formatted response to a request like:
The point is, an average home computer can easily test the primality of any one really huge number in a few moments (and does too when doing public-key cryptography), but it's completely impossible to cache the result of primality testing of all number up to such large numbers. Thus, a server like this would just take one moment to do the primality testing that your slower home computer could do in two moments anyway, which is completely negotiated by network overhead. The same is true for factorization, a home computer can factorize such large numbers very fast that it's impossible to store all numbers up to such large numbers even on a big server farm. Ambrus ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
