## Comment: Re:Implications (Score 2, Informative) 457

It is sortof a negative result.
It has been known for forty years that many (10,000s) of difficult problems share a common difficulty, that makes them prohibitive to solve: NP-completeness. It was proven in the 70s that if you can solve one NP-complete problem fast, you can solve them all fast. This new result claims to prove that you cannot solve any NP-complete problem "fast".
Some nerdy NP-complete problems are, for instance: how to make a certain circuit (CPU) using as few NAND gates as possible (i.e. faster hardware cheaper) or how to wire your motherboard as efficiently as possible (both how to draw the wires, and how to place the components). This says that it might ake more than a human lifetime (or Sun's) lifetime to solve any NP-complete problem.
Some would like to see it as good news for cryptography, since it make some ciphers provably hard (however I am not aware of any such cipher -- unless it is proven that RSA is in NPC or in NPI).