We didn't think it would happen this fast. We thought the math was safe. We thought our private keys were secure from everything but a quantum computer or a brute-force attack on the heat death of the universe. Then last week, a mathematician at Anthropic sat down with Claude Fable and did something that should have sent a chill through every engineer in crypto: he asked it to find a counterexample to the three-dimensional Jacobian conjecture, a problem that had resisted human insight for over 80 years. It found one. So did Codex at OpenAI. Two different models, one problem—both succeeded.
This is not a math breakthrough. It is a crypto warning shot.
The Jacobian conjecture, for those who don't spend weekends in algebraic geometry, asks whether a polynomial map with a non-zero constant Jacobian determinant must be invertible. For one variable, yes. For two, proven in 1974. For three or more? Open. Until now. The AI-generated counterexample was a map that satisfied the determinant condition but was not invertible—it collapsed multiple points to the same output. Human mathematicians verified it. The machine had found a hole in the structure of abstract algebra.
Context — The connection to crypto is not obvious unless you understand that every public-key system we rely on—RSA, ECDSA, Schnorr, BLS—is built on the hardness of specific mathematical problems. Factoring large integers. Computing discrete logarithms. Solving the elliptic curve discrete log problem. These are not proven to be hard; they are assumed hard because decades of the brightest human minds have failed to break them. That assumption is about to be stress-tested by systems that can search combinatorial spaces faster than any human team, and with a creativity that bypasses our own biases.
Over the past seven days, I have watched this story unfold across cryptography channels, and I can already see the dangerous pattern: dismissal. “Oh, that’s pure math, not factoring. It doesn’t apply.” Wrong. The method AI used to find the Jacobian counterexample—massive symbolic search guided by learned patterns—is exactly the same approach that could discover a polynomial-time algorithm for discrete log. The models don’t know they’re solving crypto; they just see a function and an output, and they try to find a map that violates the expected property. That’s exactly what we need to break a hash function or a signature scheme.
Core — Let’s get technical for a second. As someone with a PhD in cryptography and years on the front lines of DeFi security (I’ve patched more flash loan vectors than I can count), I can tell you that the threat is not theoretical. The standard for a practical break of RSA-2048 is an attack that requires fewer than 2^128 operations. Today, the fastest known classical attack requires about 2^200 operations. But an AI that can search the space of algebraic reductions might discover a new family of composite factorization algorithms that brings that number down to 2^100—still far, but within reach of a determined nation-state with access to top-tier models.
Based on my audit experience, I know that the difference between a theoretical vulnerability and an exploitable one is often just a single insight. The reentrancy bug I found in AeroSwap was hiding in plain sight for weeks—every smart contract auditor had looked at the withdrawal function, but nobody connected the dots between the bonding curve and the call order. AI does that connection in milliseconds. It found a counterexample in a deep algebraic conjecture because it could try thousands of candidate maps and verify each one automatically. Apply that same automation to cryptanalysis: try thousands of parameter settings, algorithmic variants, or side-channel perturbations. One of them will stick.
The contrarian take — Most people in crypto are looking at this and saying: “We have years before quantum breaks cryptography, and AI won’t speed that up.” That is dangerously wrong. Quantum computers require physical breakthroughs; AI requires only algorithmic ones. The Jacobian counterexample was found on classical hardware—no qubits. AI gives us the possibility of a classical break of RSA within the next five years, not the twenty we assumed for quantum. I’ve talked to post-quantum crypto teams; they admit that AI-generated attacks against lattice-based schemes are already being found in sandbox environments. The cat-and-mouse game is accelerating.
And here’s the real contrarian point: Decentralization makes us architects of our own vulnerability. Bitcoin’s ECDSA is hard-coded. Ethereum’s secp256k1 is hard-coded. Every wallet, every bridge, every L2 depends on a fixed set of cryptographic assumptions that cannot be patched without a hard fork. When the AI finds a factoring shortcut, you cannot upgrade the network in a day. The migration to post-quantum signatures like CRYSTALS-Dilithium or Falcon needs to happen now, not after the first theft. Centralized systems can deploy hotfixes; blockchains cannot. We are the most exposed cohort.
Takeaway — Innovation happens at the edge of chaos. The AI that broke the Jacobian conjecture is the same engine that could break your wallet. The only question is whether we act before the chaos catches us. I’m already advising protocols to start testing post-quantum signature migration paths. I’ve begun stress-testing my own cross-chain infrastructure against AI-generated attacks. The window for complacency closed last week.
We didn’t think this day would come so soon. But the machines are already writing theorems. Next, they will write exploits. And when they do, the only wallets that survive will be the ones that moved to quantum-safe cryptography yesterday. So, what are you waiting for?