Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • It mentions in the definition that by design the majority of the work will take place in the last few years due to the (assumed) exponential rise in computing power. An FPGA running at a thousand times the speed of the best CPU available today won't be a fraction of the computing power of 35 years hence's pocket calculator. Commented May 21, 2014 at 14:19
  • 2
    you CAN use distribution by having each node pick a random starting value and starting from there, when a node comes to a value that another node started from the paths are appended and the node pick another value, but that isn't really useful Commented May 21, 2014 at 14:27
  • if you can do 1 squaring per milli second then it will take 2500 years for the t in the link Commented May 21, 2014 at 15:34
  • 1
    @ratchetfreak not in this universe. n has 616 decimal digits so is of the order of 10^616, there are about 10^80 atoms in the universe, so if every atom was a result mod n you're still only covering 1/10^536 of the cases. Commented May 22, 2014 at 12:21
  • @PeteKirkham that's why the final remark of it not being useful, the search space would be too large to store Commented May 22, 2014 at 12:23