Mining that is actually useful.

A pool of primes, not hashes

An integer factorization pool works similarly to a cryptocurrency mining pool — but instead of hashing for blocks, it decomposes large composite numbers into their prime factors. The pool divides each factorization into subtasks, distributes them to contributors, and aggregates the results.

Standing on serious algorithms

Distribution makes integers tractable that no single machine could factor, using:

• General Number Field Sieve (GNFS)
• Elliptic Curve Method (ECM)

RSA is a factoring problem

The security of RSA rests on the difficulty of factoring large semiprimes. A capable pool tests cryptographic strength of key sizes, supports academic research, identifies vulnerable keys in outdated systems, and benchmarks hardware on mathematically demanding workloads.

Research in the open

Researchers, students, and security professionals cooperate on hard factorization problems — cryptanalysis and auditing, hands-on education in computational number theory, and proof-of-concept demonstrations of factoring progress.