dom retweeted
To elaborate -
If P = NP is proven & we get a practical polynomial-time algo for an NP-complete problem, modern cryptography largely collapses.
Most public-key systems (RSA, elliptic curves, Diffie-Hellman) rely on the hardness of problems that would suddenly become efficiently solvable. TLS, banking, digital signatures, secure messaging, and most of blockchain infra would become insecure unless built differently. Society would need an emergency global transition to new foundations - only info-theoretically secure methods (one-time pads) or certain quantum schemes would remain safe by default.
The upside is enormous: optimal solutions for logistics, scheduling, protein folding, circuit design, and countless optimization problems become feasible. But “polynomial time” can still be useless in practice if the degree or constants are huge, and a non-constructive proof would change almost nothing on its own.
But yeah - god help us if proven true.
dom retweeted
OK everyone, it's time to talk about the real part of every non-trivial zero of the Riemann zeta function
(1/2)
dom retweeted
Fuck modern dating i’m just gonna keep doing cool stuff until a baddie likes my flavor of autism































