Id: palomar/PALOMAR-2026-11-16-000012 Url: https://github.com/sthubbar/goldbach-lean/tree/0e201f43acf714d7821daadf5963c06d961132e8/entries/helfgottplatt2013 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-16-000012-v1.json Repo: https://github.com/sthubbar/goldbach-lean Tags: math.NT, msc:11P32, msc:11Y11, msc:11Y16 Score: 0 Title: Proth's criterion and the prime ladder reduction for ternary Goldbach up to 8.875 · 10^30 Trust: high Domain: math.NT Source: palomar Authors: Steve Hubbard Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-16 Formalized: true Formalizes: title=Numerical verification of the ternary Goldbach conjecture up to 8.875 · 10^30 identifier=arXiv:1305.3062 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-16-000012 Lean 4 proofs, with no unproved steps, of two results from H. A. Helfgott and D. J. Platt, Numerical verification of the ternary Goldbach conjecture up to 8.875 · 10^30, Experimental Mathematics 22, 2013, arXiv:1305.3062. First, Proth's criterion of Section 2, Theorem 2.3 in existential form; the converse printed after it, for every such a, is proved as converse but not compared: a Proth number N = k 2^n + 1 with 0 < k < 2^n is prime if and only if some integer a has Jacobi symbol -1 over N and a raised to the power N - 1 over 2 is -1 mod N. Second, Theorem 4.1, every odd number from 7 to T…