View Single Post
Old 2007-02-07, 01:18   #93
jasong's Avatar
"Jason Goatcher"
Mar 2005

1101101100112 Posts

Originally Posted by rogue View Post
This affects how deeply you can sieve (the value of p) not the k, b, or range of n for which you are sieving. In other words, unlikely. If the software sieved to a limit of 2^52 (which is extremely unlikely), it would probably terminate. I can't speak for certain on that.

BTW, the reason for 2^52 was because that is a limit in the FPU. As the PPC version doesn't using the FPU, the limit is actually 2^63 (one bit less than the number of bits in a register).
I think there may have been some confusion on the part of BlisteringSheep. The values he gave looked more like n-values instead of sieving values. k and n values define WHAT you're sieving, or trying to find values for. The max 2^52 value determines how high a factor can be tested.

2^52 is 4.5*10^15, while 2^63(which is 2048 times bigger) is 9.22*10^18. To get a grasp of how big these numbers are, 2^52 seconds is a little under 143 million years. 2^63 seconds is about 292 billion years. Not that we're counting seconds with these numbers.
jasong is offline   Reply With Quote