Two Bets Against Hidden Structure: Riemann Meets P vs NP

Put the two most famous open problems in mathematics side by side and the first honest finding is an absence. The Riemann Hypothesis — that every non-trivial zero of the zeta function lies on the critical line, equivalent to saying the primes are distributed as regularly as randomness permits — and P versus NP — whether every problem whose solution is quick to check is also quick to solve — are not connected by any theorem. No implication runs in either direction. A proof of one would leave the other exactly where it stands.

The Unproven Lock traced P versus NP down into the gears of SHA-256; this puts the two giants next to each other and asks what, if anything, they share. The answer: no logic, four points of contact, and one deep structural difference that almost nobody writes about.

First Contact: Riemann as an Algorithm Accelerator

The working relationship between the two fields is conditional mathematics. Complexity theorists routinely assume the generalised Riemann Hypothesis — the extension of Riemann’s claim to a whole family of zeta-like functions — and derive guarantees from it. The canonical example: under GRH, the Miller–Rabin primality test, in practice a fast randomised procedure, becomes provably deterministic in polynomial time. The hypothesis acts as scaffolding — assume the primes behave, and certain algorithms can be certified fast.

The instructive footnote is what happened in 2002. The AKS algorithm proved that primality testing lies in P unconditionally — no Riemann needed. Mathematics walked around the scaffold it had leaned on for decades. The lesson cuts both ways: GRH is genuinely load-bearing in many conditional results, and yet none of this touches the NP-complete problems at the heart of P versus NP. Riemann accelerates specific algorithms; it says nothing about whether the haystack of all search problems has a secret shortcut.

Second Contact: The Cryptography Knot

The two problems get tangled in the popular imagination at exactly one place: RSA. The chain of association runs — RSA rests on the hardness of factoring; factoring is about primes; primes are Riemann’s subject; therefore a proof of Riemann threatens cryptography. Every link before the “therefore” holds, and the conclusion is still wrong. A proof of the Riemann Hypothesis would confirm what cryptographers, number theorists and every deployed algorithm already assume — the primes are distributed regularly, no surprises. Confirmation of the expected breaks nothing; it is the mathematical equivalent of a maintenance inspection finding exactly what the manual predicts.

The genuinely dangerous scenario is subtler, and readers of The Unproven Lock will recognise its shape: not the proof, but the method. A proof technique powerful enough to settle Riemann might, along the way, expose structure in the primes that nobody anticipated — and unexpected structure is precisely what attacks are made of. The threat to a hardness assumption is never the confirmation of randomness, always the discovery of hidden order. P = NP, meanwhile, would not need to sneak in through a method. It would pulverise public-key cryptography directly, Riemann or no Riemann — which is why, of the two, only one conjecture has civilisational infrastructure leaning on it.

Third Contact: Two Shapes of Doubt

Now the angle this issue exists for. Both conjectures enjoy the same kind of support: overwhelming evidence, zero proof. Over ten trillion non-trivial zeros of the zeta function have been computed; every single one sits on the critical line. Decades of assault by the strongest minds in mathematics and computer science have failed to produce a polynomial algorithm for any NP-complete problem. Expert belief in both is correspondingly near-universal. Epistemically, they look like twins.

Logically, they are not even siblings. The Riemann Hypothesis is a claim about an existing, fixed mathematical object — the zeta function and its zeros. It is falsifiable in the cleanest Popperian sense: a single zero off the critical line, located by computation and verifiable in principle by a finite calculation, ends the matter. The conjecture lives permanently one counterexample away from death. Every verified zero is a genuine, if infinitesimal, test survived.

P ≠ NP has no such exposure. It is a universal claim over the space of all possible algorithms — including every algorithm that has never been written, never been conceived, and never will be. There is no experiment that could refute it, no place in the world or in the numbers where one could look and find it failed. Its refutation would not be a find but a construction: an explicit algorithm together with a proof of its polynomial running time — which is to say, refuting it is itself a piece of mathematics, not an observation. The trillions of zeta zeros are data about Riemann’s object. The decades of failed attacks on NP-completeness are data about us — about the reach of human technique — not about the space of all procedures. That is why the known barriers (relativisation, natural proofs, algebrisation — the trio from The Unproven Lock) sting so badly: they prove that the tools we have cannot even in principle decide the question. The problem is not merely unsolved; it is unaddressable with the current sort of mathematics.

One conjecture lives a single computation away from death and has survived ten trillion executions. The other cannot be killed by any observation at all — and that is not a strength.

Epistemic twins, logical strangers. Both unproven, both believed — but only one can be refuted by looking.

Fourth Contact: The Shared Wager

And yet the two problems are recognisably kin, and the kinship explains why the question of their connection keeps occurring to people. Both are, at bottom, conjectures about the absence of exploitable structure. Riemann asserts that the primes are distributed as regularly as chance maximally allows — pseudo-random in the best sense, with no hidden pattern waiting to be mined. P ≠ NP asserts that for hard search problems there is no concealed shortcut — that the haystack genuinely must be searched. Each is a bet that, at a particular load-bearing point, the universe has no back doors built in.

Readers of this blog will recognise where that lands. Bitcoin’s proof of work, as The Unproven Lock traced in detail, is calibrated against exactly one of these wagers — the second. SHA-256’s one-way asymmetry is an engineering bet that finding is hard and checking is cheap, the NP-shaped gap turned from threat into load-bearing mechanism. Nobody has proven the bet sound, and nobody can yet; what exists is a quarter-century of the strongest possible empirical hardening. The Riemann Hypothesis is the same species of wager placed on a different table — and the comparison is clarifying precisely because the two bets, identical in their evidential standing, differ in the one property this issue has circled all along: one of them could, in principle, be settled against us by a single computation tomorrow morning. The other could not. Sound money rests on the unfalsifiable one — which sounds alarming until you notice it is the conjecture whose refutation would require not a discovery but a revolution.

What It Means

The comparison teaches something neither problem teaches alone: the anatomy of justified belief without proof — and the discovery that it comes in more than one logical shape.

No theorem connects them, so resist the narrative. The two giants share a price tag, a museum, and a mystique, and it is tempting to assume a hidden wire runs between them. There is none. The honest connections are four, they are looser than implication, and knowing exactly how loose is the difference between understanding the problems and merely collecting them. Falsifiability is the underrated axis: Riemann could die tomorrow from one computation; P ≠ NP cannot die from any observation at all — and the unfalsifiable one is the structurally harder problem, because the barriers prove our current mathematics cannot even reach it. When you hear “overwhelming evidence” for any open conjecture, the follow-up question should become reflexive: evidence of what kind, against what sort of claim?

And both are wagers that the universe has no back doors. Pseudo-random primes, shortcut-free search: two assertions that hidden exploitable order does not exist at a load-bearing point. Every hardness assumption in cryptography — including the one under Bitcoin — is a member of this family. None is proven. All are hardened. Knowing the family resemblance, and the falsifiability asymmetry inside it, is what separates informed confidence from faith.

Flight Log — Dispatch from Altitude

A pilot’s working life runs on two entirely different kinds of certainty, and most of us never notice they are different — until something like this forces the distinction.

The first kind lives in the walkaround. Before every departure someone circles the aircraft and looks: at the tyres, the static ports, the leading edges, the drain masts. The walkaround is a search for a counterexample. It asks a falsifiable question — is there a crack, a leak, a dent, a missing fastener? — and a single find settles it. One crack and the aircraft does not fly; the claim “this airframe is sound today” dies by observation, on the spot, the way a conjecture dies by counterexample. Ten thousand clean walkarounds are ten thousand survived tests, and the next one could still be the one that finds something. That is Riemann’s kind of certainty: a claim about one existing object, permanently exposed to refutation by looking, strengthened every time the look comes back clean.

The second kind of certainty lives somewhere you cannot walk around: in the type certificate. When a design is certified, the claim being made is not about this airframe today — it is about every aircraft of the type, in every permissible configuration, in every corner of the envelope, including conditions no individual aircraft will ever actually meet. No inspection can verify that claim, because it is not a claim about anything you can inspect. It is a statement about a space of possibilities — and the only access to it is analysis, modelling, proof-like reasoning about loads and margins and failure modes that have never occurred. You cannot falsify a flight envelope by looking at a wing. The claim lives in a different logical country from the walkaround, even though both end in the same word: airworthy.

That is the asymmetry of this issue, standing on the ramp. The Riemann Hypothesis is a walkaround claim — about one object, killable by one find, ten trillion inspections clean so far. P ≠ NP is a type-certificate claim — about all possible procedures, unreachable by any inspection, addressable only by a kind of analysis nobody has yet invented. A pilot trusts both kinds of certainty every day, and trusts them differently: the walkaround because it has looked and keeps looking, the certificate because of the depth of reasoning behind it. Neither trust is faith. But they are not the same trust — and knowing which kind is holding the thing you are standing on is, in the air as in mathematics, the beginning of actually understanding it.