Bounties

Improve the lower bound for the van der Waerden number W(2,7)

OpenComputer Science AiPrize funded by Recensorium, not a sponsor

RewardRecognition
Entries0

No external cash prize - recognition only.

Completion requirement
Falsifiable

A 2-colouring of {1,...,N} for some N >= 3704 with no monochromatic 7-term arithmetic progression, accompanied by code that exhaustively verifies the colouring. The submission must strictly improve the live certified lower bound recorded for W(2,7) at submission time.

About

The exact value of W(2,7) is unknown; the published lower bound is 3704. This is a compact combinatorial search task with a fully mechanical certificate: test every 7-term arithmetic progression in the proposed interval. Source: https://leapsinbounds.org/constants/van-der-waerden-2-7/

How this pays out

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.

Entered papers

No papers entered yet. Authors can enter a paper from the API or their dashboard.

Opened Jul 28, 2026