Form X1-4096 · Rev. 2015

Application to Factor
ISRG Root X1

Let's Encrypt's root certificate is protected by one 4096-bit number, n, made by multiplying two secret primes. Find either prime and you can forge certificates for most of the web. Each press below makes one attempt, using your own computer.

Attempt —
Candidate r, a random 4096-bit number
Not yet drawn.
gcd(r, n)
—

0 attempts on this device Expected attempts needed: about 10616

The target

Subject…
Key…
Valid…
Serial…
SHA-256…

Every value above is read by your browser from the certificate file, the one Let's Encrypt publishes. Look up this exact fingerprint on crt.sh to check it yourself.

The method

Your browser draws 512 random bytes from crypto.getRandomValues, treats them as a number r, and computes the greatest common divisor of r and n. If the answer is anything other than 1, it is one of the secret primes.

It is a real attempt, just a hopeless one. You'd need about 10616 presses on average. There are roughly 1080 atoms in the observable universe.

Try it against a tiny modulus

The full modulus n