I'm going to build some projects to do primes fast computing.
https://code.google.com/p/prime-constant/
https://odd-prime-position-constant-1mbitx4096-0.googlecode.com/git/
This code generate part of odd-prime-position-constant:
pr = 0;
x = 2*pr*2^32 - 1;
For[k = 0, k < 4096, k++,
t = Table[x += 2; If[PrimeQ[x], 1, 0], {n, 0, 2^20 - 1}];
Export[StringJoin[{"I:/cloud/googlecode/odd-prime-position-constant-\
1mbitx4096-", ToString[pr], "/1MbX4096-", ToString[pr], "--",
ToString[k], ".oppc"}], t, "Bit"];
]
Q:
1. Now! What's the largest index-known prime?
2. How to generate odd-prime-position-constant and storage&access it on cloud?fast,high-capacity...
Can you give some advice or some Mathematica code sample for this?
3. I think HTML5 WebWorker can do a good work on prime constant. Is there ex Js framework on primes?