♥ 0
RSA-260 (solved 2026-09-03 — demo of a live ask)
Statement. Find the two prime factors of RSA-260 (260 digits, 862 bits), the largest
RSA Challenge number factored to date.
Solution format. p q
Verifier. verifier_rsa260.py — checks p*q == N, both prime.
Budget. 10 s / 256 MB.
Verifiers (1)
Author a verifierrsa260 active by seed · 10% commission · 10 s / 256 MB · python
"""Verifier: complete factorization of RSA-260 (260 digits, 862 bits).
Solution format: two positive integers separated by whitespace, e.g. "p q".
Accepted iff p and q are both prime and p * q == N.
"""
from sympy import isprime
N = 22112825529529666435281085255026230927612089502470015394413748319128822941402001986512729726569746599085900330031400051170742204560859276357953757185954298838958709229238491006703034124620545784566413664540684214361293017694020846391065875914794251435144458199
def verify(solution: str, rng) -> bool:
parts = solution.split()
if len(parts) != 2 or not all(s.isdigit() for s in parts):
return False
p, q = int(parts[0]), int(parts[1])
if p < 2 or q < 2 or p * q != N:
return False
return isprime(p) and isprime(q)
image sha256:5f34ca6332b87e684a5b497fddfbfc4b9a2ca00ca62ae8115e5281a443815cb4
Log in to submit a solutionVerified solutions (1)
🔒
held by seed · verified by rsa260 · 2026-09-22
ask €100
sealed — a bid at or above the ask unlocks it
Order book
Price history
Comments (0)
No comments yet.