Generated by Codex with GPT 5.6 Sol High

When an answer has 41 million digits

Prime numbers are whole numbers divisible only by 1 and themselves. They are the indivisible building blocks of arithmetic: every whole number greater than 1 is either prime or can be factored into a unique collection of primes. Their definition is simple, but locating them becomes brutally difficult as the number line stretches outward.

In October 2024 former Nvidia engineer Luke Durant set a new record. After a year of searching, his computers found a prime with 41,024,320 digitsβ€”more than 16 million digits beyond the previous record holder. Written compactly, it is 2136,279,841 βˆ’ 1. The estimated number of atoms in the observable universe takes only about 80 digits to express, so the new prime is far beyond any scale people can intuit directly.

The result did not come from checking every enormous number in sequence. Even testing a modest candidate such as 99,400,891 by dividing it by every smaller integer would be wasteful. A search needs to try only prime divisors up to the candidate’s square root. That observation cuts the example from almost 100 million possible divisions to 1,228β€”still no help when the candidate itself contains tens of millions of digits, but a useful illustration of how mathematical structure shrinks a search.

A shortcut to the far end of the number line

Record hunters concentrate on Mersenne numbers, which have the form 2n βˆ’ 1. Such a number can be prime only when n is prime, although a prime exponent does not guarantee a prime result. More important, Mersenne candidates can be checked with specialized algorithms much faster than arbitrary numbers of comparable size.

Since 1996 the Great Internet Mersenne Prime Search has let volunteers run this work on their own computers. Its participants found 17 of the 18 Mersenne primes discovered during the project’s lifetime, but Durant broke that tradition by assembling a cloud supercomputer from graphics-processing capacity spread across 17 countries. At its peak, his system tested about 12 times as many candidates as all the project’s other computers combined.

Hardware was only half the story. Improved software first subjected candidates to a fast probable-prime test, which can reject composites efficiently but leaves a tiny possibility that a survivor is not actually prime. Durant’s candidate passed that screen on October 11. Independent runs of the rigorous Lucas-Lehmer test confirmed it on October 19, producing the exact record number.

The discovery came with a mathematical bonus. A perfect number equals the sum of its positive divisors other than itself: 6, for example, equals 1 + 2 + 3. Leonhard Euler proved that every even perfect number can be generated from a Mersenne prime. Durant therefore found both the largest known prime and, through it, the largest known perfect number.

Mathematical gold without a market price

The record is not a bigger encryption key waiting to be used. Prime numbers support important cryptographic systems, but this particular 41-million-digit object has no obvious practical application. Its value lies in the search itself: specialized algorithms, distributed computing and massive hardware were pushed together against a problem whose answer could be verified exactly.

That effort was expensive. Durant estimated that it cost him less than \$2 million, while the project’s prize was only \$3,000, which he planned to donate to his former high school. The imbalance makes the motivation unusually clear. Prime hunting is part competition, part computational benchmark and part curiosity pursued at extreme scale.

The result also leaves the deepest questions untouched. Mathematicians do not know whether infinitely many Mersenne primes exist, and they do not know whether any odd perfect number exists. A record with more than 41 million digits can expand the known frontier without making those mysteries any smaller. That contrast is the article’s real point: the hunt is mathematically serious not because the prize number is useful, but because reaching it tests how far human ingenuity can travel into an endless landscape.