Fundamentals 7 min read

World’s Largest Known Prime Discovered Using GPUs: 2^136279841−1

A former Nvidia engineer, working through the GIMPS distributed project and leveraging thousands of GPUs across dozens of data centers, confirmed that 2^136279841−1—a 41,024,320‑digit Mersenne prime—is the largest known prime ever found, surpassing the previous record by over 1.6 million digits.

IT Services Circle
IT Services Circle
IT Services Circle
World’s Largest Known Prime Discovered Using GPUs: 2^136279841−1

The newest record‑breaking prime, 2 136279841 −1, contains 41,024,320 decimal digits and has been identified as the largest known prime to date.

The discovery was reported by a former Nvidia employee who contributed the result to the open‑source GIMPS (Great Internet Mersenne Prime Search) project; an initial detection on an Nvidia A100 was later verified on an H100.

This Mersenne prime, designated M136279841, is the 52nd known Mersenne prime and the 18th found by GIMPS, exceeding the previous record by more than 1.6 million digits.

GPU’s usefulness extends far beyond AI; it is also highly suited for fundamental mathematics and scientific research.

The prime’s value is computed as 2 multiplied by itself 136,279,841 times, then subtracting one, a calculation that underscores the massive parallel power of modern GPUs.

Behind the discovery is Luke, a former Nvidia GPU designer who now runs a startup and leads GIMPS contributions; he built a cloud‑based infrastructure spanning thousands of GPUs across 24 data‑center regions in 17 countries.

On October 11, an Nvidia A100 in Dublin flagged M136279841 as a potential prime, and the following day an H100 in Texas confirmed it via the Lucas‑Lehmer test, earning Luke a $3,000 research prize, which he donated to the Alabama Math & Science Academy.

The article also explains what prime numbers and Mersenne primes are, noting that numbers of the form 2^P−1 allow efficient primality testing even for extremely large exponents.

GIMPS, launched in 1996, is one of the longest‑running distributed computing projects, aiming to discover new record‑breaking Mersenne primes; volunteers worldwide can join by running the open‑source Prime95 or MPrime software.

GIMPS software employs the Lucas‑Lehmer test and, after early CPU‑only versions, incorporated GPU‑accelerated code pioneered by Richard Crandall’s convolution algorithm and implemented in assembly by George Woltman, dramatically speeding up searches.

Despite occasional debate about the practical value of searching for ever larger primes, the prevailing answer is “for glory,” a sentiment later reinforced by the role of large primes in cryptographic algorithms.

Reference links: Mersenne.org , Elon Musk’s tweet , Why Join GIMPS .

distributed computingGPU computingGIMPSlarge primeMersenne prime
IT Services Circle
Written by

IT Services Circle

Delivering cutting-edge internet insights and practical learning resources. We're a passionate and principled IT media platform.

0 followers
Reader feedback

How this landed with the community

login Sign in to like

Rate this article

Was this worth your time?

Sign in to rate
Discussion

0 Comments

Thoughtful readers leave field notes, pushback, and hard-won operational detail here.