Most of you professional math types have probably seen this (someone from there may be an SoBer and reading this)

http://www.ieeta.pt/~tos/goldbach.html

"So far, we have tested all consecutive even numbers up to (and including) 6·10^16, and double-checked our results up to 10^16. Some (13) extra intervals of 10^15 were also tested. The first pass is 73% done, and the second pass (double-check) is 10% done."

Besides the crunchiness of it, is the data collected on prime gaps
". Because it takes very little extra time, we also record information about the gaps between consecutive primes, viz., how many times each gap occurs, and its first occurrence"

of any use in the sieving/factoring efforts? Note the the seiving algorithm
"http://www.ieeta.pt/~tos/software/prime_sieve.html" - anything worth borrowing (with appropriate credit of course). I note a reference to the IA32 instruction set and but I don't know enough about the difference to know how significant it is.

Or just a nice idle diversion for us?