{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-16","reactions":{},"formalized":true,"formalizes":[{"title":"Numerical verification of the ternary Goldbach conjecture up to 8.875 · 10^30","identifier":"arXiv:1305.3062","relationship":"formalizes"}]}