Beta The Briev beta is out. Free on iPhone via TestFlight — install it in under a minute.

Join the beta ↗
Briev
Live
Technology

Researcher Eric Lu Breaks Record by Factoring RSA-260 Without AI Assistance

Eric Lu, an engineer at Cognition, posted a 130-digit divisor that successfully factors the RSA-260 challenge, the biggest RSA number ever broken.

Early Thursday, Eric Lu of the AI startup Cognition announced he had found a 130-digit factor that divides RSA-260, the largest RSA challenge ever solved. RSA numbers were published in 1991 as a test of factoring difficulty, with RSA-250 factored in 2020 after months of massive sieving across many machines. Lu says his approach involved manual prime sampling with limited computer help, and he offered little detail beyond a tongue-in-cheek remark about “good old paper and pencil.”

Fellow researcher Emmanuele Thomé estimates RSA-260 to be roughly three times harder than RSA-250, suggesting a multi-month effort. While the achievement demonstrates progress, the primes used in practical RSA encryption are much larger—typically over two thousand binary bits—so current online security remains intact. Experts point to quantum computing as the more plausible future threat to RSA, as classical factoring, even with clever tricks, stays computationally prohibitive. Nonetheless, the breakthrough highlights ongoing interest in cryptographic challenges and the ingenuity of individual researchers.

Why it matters

Factoring RSA-260 shows progress in cryptanalysis but does not endanger everyday encryption, underscoring the limits of current computing.

In this story

RSA-260factoringcryptographyprime numbersEric LuCognitionquantum computingsievingRSA encryption
Get the beta ↗