Browse problems

48 problems

Beal conjecture counterexample open

Find positive integers A, B, C, x, y, z with x, y, z ≥ 3 and \gcd(A, B, C) = 1 such that

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Lean demo: 7 is prime (Mathlib) demo

The Mathlib-using sibling of the other two Lean demos: this verifier's Spec is stated using a real Mathlib definition ( Nat.Prime ), not just core Lean. Any…

Buyers offer
€10
no seller
Sellers ask
—
♥ 0
Linear code beating the Grassl table open

Find a linear code over \mathrm{GF}(q) of length n and dimension k whose minimum distance d exceeds the best one known for those parameters.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
18-input sorting network with at most 76 comparators needs verifier

Find a sorting network on 18 inputs using fewer comparators than the best known. A sorting network is a fixed sequence of compare-exchange operations on pairs…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Radar pulse of length 106 with peak sidelobe 5 open

Find a longer coded pulse whose false echoes stay as weak as the best short ones.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Perfect cuboid open

Find positive integers a, b, c such that all four of

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Kissing number in dimension 11: more than 604 spheres needs verifier

Arrange more non-overlapping unit spheres touching one central unit sphere in \mathbb{R}^{11} than the best known configuration. Equivalently: find unit…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
33 points, no convex heptagon open

Place 33 distinct points with integer coordinates in \{0, …, 10000\}^2 , no three on a line, such that no 7 of them are in convex position (the vertices of a…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Quantum error-correcting code [[30,10,7]] needs verifier

Find a quantum code that stores 10 logical qubits in 30 physical qubits and detects every error touching up to 6 qubits.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Lean demo: 2 + 2 = 4 demo

A minimal Lean verifier, posted to check the platform's Lean pipeline end-to-end for yourself. Any price on this problem is fake.

Buyers offer
€10
Sellers ask
€100
♥ 0
Thinner triple bandpass optical filter open

Design a multilayer coating that passes three colour bands, blocks four others, and is thinner than the best design of an international contest.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Python demo: factor 391 demo 1 trade

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…

Buyers offer
—
no buyer
Sellers ask
€10
♥ 0
Aliquot 3-cycle open

With s(n) = \sigma(n) - n (the sum of the proper divisors of n ), find three distinct positive integers with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Hadamard matrix of order 668 open

Status: solved (see Known). Kept as a template for matrix certificates.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Taillard ta18: job-shop schedule shorter than 1396 needs verifier

Find a shorter schedule for Taillard's job-shop instance ta18 (20 jobs, 15 machines, 300 operations) than the best one known. Each job must pass through the…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Third Wieferich prime open

Find a prime p with 2^{64} < p < 10^{24} and

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
SVP Challenge: shorter lattice vector in dimension 200+ needs verifier

Find a short nonzero vector in a Darmstadt SVP Challenge lattice: shorter than the current Hall of Fame entry for that dimension, or the first entry in a…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
PSW $620 pseudoprime open

Find an odd composite n with n \equiv \pm 2 \pmod 5 that passes both

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Factor a 60-digit semiprime demo 1 trade

Statement. Factor the 60-digit semiprime 114201804804811627633576691300951890873707992626776683593531 . Solution format. p q Verifier. verifier_semiprime60.py…

Buyers offer
€10
Sellers ask
€350
♥ 0
abc quality record open

Find coprime positive integers a, b with c = a + b whose quality

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Collision on 36 steps of SHA-256 open

Produce two different messages that have the same fingerprint under SHA-256 cut down to 36 of its 64 steps.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
AES S-box circuit with fewer than 113 gates open

Find a smaller logic circuit for the AES S-box, the 8-bit to 8-bit substitution table at the heart of AES encryption.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Hutter Prize: compress enwik9 below 110,793,128 bytes needs verifier

Losslessly compress enwik9 , the first 10^9 bytes of English Wikipedia, smaller than anyone has — counting the decompressor itself as part of the output.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Sum of three cubes: 114 open

Find integers x, y, z with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Costas array of order 33 open

Find a permutation c_0, …, c_{32} of \{0, …, 32\} (a mark in row r , column c_r ) such that all displacement vectors between marks are distinct: for every row…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Factor of F₂₀ open

Find a nontrivial divisor d of the Fermat number F_{20} = 2^{2^{20}} + 1 , i.e. 1 < d < F_{20} with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
29-mark Golomb ruler open

Find 29 integers 0 = m_1 < m_2 < … < m_{29} ≤ 622 whose \binom{29}{2} = 406 pairwise differences m_j - m_i are all distinct (a Golomb ruler: no distance is…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Lean demo: factor 391 demo

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 just prove a bare proposition.…

Buyers offer
€10
no seller
Sellers ask
—
♥ 0
Ternary covering code K₃(6,1) open

Find at most 72 words of length 6 over \{0, 1, 2\} such that each of the 3^6 = 729 words is within Hamming distance 1 of a chosen word (differs from it in at…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Any nontrivial factor of M1277 = 2^1277 − 1 open

Statement. Find any nontrivial divisor of M_{1277} = 2^{1277} - 1 (385 digits). No factor is known; it is the smallest Mersenne number with prime exponent…

Buyers offer
€500
no seller
Sellers ask
—
♥ 0
Factor RSA-260 listed

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.…

Buyers offer
—
no buyer
Sellers ask
€100
♥ 0
Ramsey number R(5,5) open

Colour each edge of the complete graph on the 43 vertices \{0, …, 42\} with one of two colours so that no 5 vertices have all \binom{5}{2} = 10 edges between…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
More accurate magnet coils for a fusion stellarator needs verifier

Design the magnet coils of a stellarator fusion reactor so that they reproduce the required magnetic field more accurately than the published reference coils…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Magic square of squares open

Find a 3 × 3 magic square whose nine entries are distinct perfect squares. Give positive roots r_1, …, r_9 in row-major order, so the square is

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
No-three-in-line, 71×71 grid open

Place 2N = 142 points on the 71 × 71 grid \{0, …, 70\}^2 so that no three of them lie on a common line, in any direction.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Quantum code beating the best known [[n,k,d]] needs verifier

Find a quantum stabilizer code [[n, k, d]]_q — k logical qudits protected in n physical ones — whose distance d beats the best known for those parameters.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Python demo: 5 + 4 demo 1 trade

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…

Buyers offer
—
no buyer
Sellers ask
€10
♥ 0
Cheaper quantum circuit for Bitcoin-curve point addition needs verifier

Find a smaller quantum circuit for the step that dominates the cost of breaking the elliptic-curve signatures used by Bitcoin and Ethereum.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Laser beam splitter into 7x7 equal beams open

Design a flat two-level pattern that splits one laser beam into a 7 by 7 array of equal beams as efficiently as the best known grating for a single row of 7.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Van der Waerden number W(2,7) open

Colour the integers 1, …, 3704 with two colours so that no 7-term arithmetic progression

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Multiply 4x4 matrices with 47 multiplications open

Find a recipe that multiplies two 4 × 4 matrices using at most 47 scalar multiplications, with rational coefficients.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
4x4 matrix multiplication in fewer than 47 multiplications needs verifier

Find a bilinear algorithm that multiplies two 4 × 4 matrices over \mathrm{GF}(2) using fewer scalar multiplications than the best known, i.e. a shorter rank…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Three MOLS of order 10 open

Find three 10 × 10 Latin squares S_1, S_2, S_3 on the symbols \{0, …, 9\} (each symbol once in every row and every column) that are pairwise orthogonal: for…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Factor this 100-Digit Semiprime demo 1 trade

The number below is a semiprime, meaning it's the product of exactly two prime numbers. Your challenge is to find both of them.

Buyers offer
€350
Sellers ask
€1,000
♥ 1
Cover the Earth from 780 km with fewer than 66 satellites needs verifier

Find a constellation that keeps every point on Earth in view of a satellite at all times, from the altitude of the Iridium network, with fewer satellites than…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Six sixth powers open

Find 2 ≤ k ≤ 6 positive integers t_1, …, t_k and a positive integer b with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
World TSP: shorter tour through 1,904,711 cities needs verifier

Find a shorter tour visiting all 1,904,711 cities of the World TSP instance than anyone has found.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Projective plane of order 12 open

Find 157 lines on the points \{0, …, 156\} , each a set of 13 points, such that any two lines meet in exactly one point, every point lies on exactly 13 lines,…

Buyers offer
—
no quotes
Sellers ask
—
♥ 0