10 ms·
A proof that P=NP doesn't necessarily mean that NP-hard problems are solvable in any practical sense. The time complexity claimed by the paper, O(n^2 * m^3), gr
by pcwalton 3y ago
A proof that P=NP doesn't necessarily mean that NP-hard problems are solvable in any practical sense. The time complexity claimed by the paper, O(n^2 * m^3), grows quickly, and the constant factors may be high. In fact, I'd go so far as to say it's very unlikely that a P=NP proof would make any difference in practice, since SAT solvers are so good for real-world problems.
(I'm leaving aside the fact that cryptocurrency theft is a crime that most people would be disinclined to commit, as well as the extraordinarily high likelihood that this proof is incorrect.)
- tromp 3y ago> cryptocurrency theft is a crime If you know the private key, then you own the coins. At least that's the whole basis that crypto currency is founded on...
- xorvoid 3y agoExcept most legal systems don’t see it that way. When you say this, they hear “if you have a copy of the key to a house/car/etc, then you also own it”. Cryptocurrency theft is a crime by the basic definitions of the legal system.
- bagels 3y agoThat is not how the law works. It's equivalent to knowing your bank account number and routing number and making an unauthorized transaction.
- remram 3y agoThat's just not how keys work. If someone finds the key to my house and uses it to open the door and take something, it's still theft.