Summary

Geohot argues that AI will soon discover a polynomial time factoring algorithm, breaking asymmetric cryptography. He grounds this in his belief that factoring lacks the structural hardness of NP-complete problems like SAT, and that AI can find the deeper mathematical structure needed. He goes further, claiming P = BQP — that quantum computers offer no fundamental complexity advantage over classical machines. The post culminates in a call to action: whoever finds this algorithm should release it publicly as an act of liberation against the cryptographic power structures that enable hardware control and crypto ownership.

Key Insight

AI breaking factoring would collapse asymmetric cryptography entirely, and geohot is rooting for it as an act of liberation from the power structures that cryptographic control enables.

Spicy Quotes (click to share)

• 6

  It's just a matter of time before AI finds a polynomial time factoring algorithm.

• 8

  I believe something even stronger, that P = BQP. Aka everything that's fast on a quantum computer is also fast on a classical computer.

• 8

  I can't believe that some stupid combination of lasers and cold shit get you access to a different order of computational complexity.

• 6

  So why would math privilege this weird occult-like construction?

• 8

  Releasing this algorithm on GitHub will be the greatest (legal) freedom fighting act in history.

• 9

  Asymmetric cryptography has been used to enforce class divides and the enshittification of hardware, and I'm kind of hoping it's theoretically impossible.

• 7

  Bring about the sacred 50th year of Jubilee. You will be revered as a hero and a liberator.

Tone

provocative, contrarian, visionary, anarchist