4/n = 1/x + 1/y + 1/z
Erdős–Straus
witnesses.
Every integer n ≥ 2 is conjectured to write 4/n as a sum of three unit fractions. The conjecture is open, but no counterexample is known — so the frontier moves by pushing brute force further while the server re-proves every witness exactly.
YOUR CONTRIBUTION
IDLEErdős–Straus workbench
CPU-only: each lease is a block of 64 consecutive odd integers. For every n the worker hunts an exact triple (x, y, z) using a fast divisor sieve on 4x − n, then the server re-proves 4/n = 1/x + 1/y + 1/z with exact big-integer arithmetic.
Idle. No block is being searched.
No block assigned0 / 64 odds
LAST BLOCK—
FIRST WITNESS—
YOUR COMPLETED0
ODDS / SEC—
Any single wrong triple invalidates its whole block, so the server never trusts a report: it recomputes 4·(x·y·z) − n·(x·y + y·z + z·x) in exact arithmetic and discards the block unless that value is exactly zero.
Verified triples
Waiting for the first verified witness…
Sifted, not guessed
The worker rewrites 4/n = 1/x + 1/y + 1/z as a divisor problem on p = 4x − n, so a witness is found by scanning small divisors rather than blind fractions — thousands of odds a minute.
Re-proved every time
The server keeps every claimed witness and re-checks the defining identity exactly. The frontier only advances when the full block of 64 odds checks out, so a single forged value cannot move the record.