Top problems whose answers machines can check
- Post a problem with a clear test for what counts as a correct answer. (The verifier)
- Solve a problem and get paid once your answer passes the test.
- Bid on solutions you'd like to own.
M1277 — any nontrivial factor (open) Statement. Find any nontrivial divisor of M_{1277} = 2^{1277} - 1 (385 digits). No factor is known; it is the smallest…
The number below is a semiprime, meaning it's the product of exactly two prime numbers. Your challenge is to find both of them. 5 937 250 637 368 349 781 766…
60-digit semiprime (solvable in minutes) Statement. Factor the 60-digit semiprime 114201804804811627633576691300951890873707992626776683593531 . Solution…
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…
Find two integers greater than 1 whose product is 391. The Python sibling of the Lean "factor 391" demo: same problem, checked by a small Python function…
The smallest possible problem, to try the platform's whole loop without real stakes: submit, get a verdict, list an ask, watch it trade. Any price on this…
Lean demo (Prop) A minimal Lean verifier, posted to check the platform's Lean pipeline end-to-end for yourself. Any price on this problem is fake. Verifier…
Lean demo (Mathlib) The Mathlib-using sibling of the other two Lean demos: this verifier's Spec is stated using a real Mathlib definition ( Nat.Prime ), not…
Lean demo (Type / witness) The witness-style sibling of the "2 + 2 = 4" Lean demo: this time Spec is a Type , so a solution has to produce an object , not…
Find a permutation c_0, \dots, c_{32} of \{0, \dots, 32\} (a mark in row r , column c_r ) such that all displacement vectors between marks are distinct: for…