Browse problems

19 problems

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