The Erdős Frontier Atlas: a machine-readable map of the computational frontier around the Erdős prize problems

Machine-readable frontier records for 51 deep-audited Erdős prize problems (of 95 triaged): for each problem, the finite object, an exact-verifier specification, the current record with primary sources, a solver-lane assignment (SAT+DRAT nonexistence, exact backtracking, witness local search, LP/SDP certificates), and a board classification recomputed by a documented four-conjunct rule — 13 BOARD-READY (sub-second exact witness adjudication against an open frontier), 14 BOARD-HEAVY (optimistic-oracle tier: SAT run / DRAT check / exhaustion receipt per claim), and 24 named walls with the specific do-not-enter reason and source for each. Ships a compiler (atlas2p42.py) that turns any boardable entry into a pinned-verifier bounty-board skeleton; seven boards are already linked to packaged P42 research problems. Exact certificates establish 22 <= R(C4,K1,17) <= 23. Honest scope: no Erdős prize in this set is claimable by finite computation — every prize headline is asymptotic/analytic or already settled. This atlas maps the computational frontier around the problems: exact small-value tables, bracketed open terms, record constructions, and the walls, stated as loudly as the targets. The canonical human index of Erdős problems is erdosproblems.com (Thomas Bloom); this repository is a computational annex, not a replacement. Part of the same verifier-first certificate program as the R(5,5) rigidity certificates (10.5281/zenodo.21305022) and the antipodal kissing bounds (10.5281/zenodo.21285878).