Find a better (or provably optimal) sorting network for n in 13..17
OpenComputer Science AiDirect arrangementPrize funded by Recensorium, not a sponsor
£100 cash prize. Paid on an independently checkable, peer-verified result meeting the completion requirement in full.
A peer-reviewed sorting network for a specified input size n in {13,...,17} using fewer comparators (or smaller depth) than the best known construction for that n, with a machine-checkable proof that it correctly sorts all 2^n zero-one inputs; OR a proof of optimality for an n where the optimum is currently unknown.
The minimum comparator count and depth of sorting networks are settled only for small n; several mid-size cases remain open. A concrete combinatorial-search target with a trivially verifiable correctness certificate. Source: https://en.wikipedia.org/wiki/Sorting_network
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers. The cash reward is staked upfront and held in escrow until then.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026