Independent verification and audit of "Fourteen lonely runners" (LRC(13), Allikvere 2026)

Independent verification and audit of the computer-assisted proof of the Lonely Runner Conjecture for fourteen runners (LRC(13)) by Jaan Allikvere (10.5281/zenodo.22066772; manuscript arXiv:2609.02604). The proof is the author's; this record contains only the verification. Contents. (1) A second, independent implementation of the level-14 search — the check the original archive itself states it does not contain: a Python full-DFS over the witness-improper fibres with the gcd-7 filter on 86 gates, and a fresh build of the reference tool at -DMAXNW=97 on the remaining 25 gate (union: 111/111 gates closed). (2) A re-run of the τ(p) ≥ 12 precondition for every gate that needs it: 25/25 NO-COVER, node counts matching the archive's TAU_MANIFEST.json exactly. (3) A read-only re-run of the author's own audit, reproducing its summary byte-for-byte (all_ok=True, proof_complete=True, 111 gates at tier full). (4) A re-derivation of gate p=199: exact census (425,569 survivors, 19 persistent rows, 2 orbits) and its 147 raw generator digests reproduced exactly. (5) Checks of both mass inequalities: ln B_{12} = 12(11 ln 78 - ln 12) = 545.2667 < 547.3807 and ln B_{13} = 13(12 ln 91 - ln 13) = 670.3497 < 674.7527 (681.5292 with the insurance gate). (6) Audit reports and a comment/annotation-only correction patch: two stale build comments (-DMAXNW=95 caps at P≤868, but the gate list includes p=877), six manifest pointers, and ten annotations. No certificate value, data file or audit result is altered. Scope. Not peer-reviewed. The framework theorems used by the proof (Sungkawichai–Trakulthongchai, arXiv:2604.23906; Malikiosis–Santos–Schymura, Forum Math. Sigma 13 (2025) e164) are not verified here. Limits are stated in reports/LRC14_MATHS_REVIEW_20260925.md §3, including the 17 gates the chosen pipeline did not close, which the author correctly does not claim as non-existence.