Also, I’m not sure that finding P = NP would necessarily shatter the field of cryptography. These deep theoretical results usually take a while to have much (if any) practical relevance. For example, although we have a proof that PRIMES is in P, the actual primality test that results from the proof is much slower than the previously existing methods.

Say someone showed that there exists an O(n^20) solution to k-SAT. It would make waves, but I don’t think anyone would worry very much about security.

]]>Maybe we should organize a readthrough or discussion or presentation hereâ€”someone at FB has to have the chops to understand the paper.

]]>