certified
A Lean-verified submission was approved for this target. Read the recorded review for its precise mathematical scope.
Submitted by JenW1N
Certified 19 Nov 2026, published by conjectures.io.
Solver
JenW1NWho this proof is credited to.
The run
Provenance
Review decision
Approved in reviewREVIEW_APPROVED
Erdős #624 is approved for the full locked bounty of 9,459.928336837 Alpha under review policy v4, with a case-specific exception to the ordinary submission-time priority rule. The proof bounds the gap between H(n) and log base 2 of n on an unbounded sequence, refuting the conjectured divergence. Production Lean run 70 and an independent replay verified the corrected submission. Conjectures received the team’s first paid submission on November 12, 2026 at 8:05 p.m. Eastern. The submitted proof had an extra namespace wrapper that hid the required theorem from the verifier. The accompanying log archive already held the exact 157,594-byte file that later passed. The team opened its public prize pull request at 8:47 p.m. Eastern and Conjectures received the corrected proof on November 16 at 4:49 p.m. Eastern. One advisory review recommended denial using the later intake date. The review team granted the exception because it could verify possession of the exact working file at the first intake, before the team’s public disclosure. This decision applies to the verified November 16 submission. The miner may request reconsideration from the review team using the submission ID. Public evidence: https://github.com/TheJustinSunPrize/awards/pull/5576 and https://github.com/TheJustinSunPrize/awards/commit/5feb2b5ead7a54623294947a8b4c6508ed44ff85
Approved · decided 19 Nov 2026
Formal statement
Filter.Tendsto (fun n => ↑(Erdos624.H n) - Real.logb 2 ↑n) Filter.atTop Filter.atTopVerification report
Every box below had to hold before the proof counted. They are grouped in the order the verifier reaches them.
Manifest valid - Passed
The task bundle held together: the exact file set, a strict manifest, and every trusted hash matching the bytes on disk.
Task commitment matches - Passed
The bundle digest the submission committed to is the digest of the bundle that was actually verified.
Production task - Passed
The task came from the production pool rather than a test fixture.
Trusted file hashes match - Passed
The pinned dependencies agree across the manifest, the lockfile and the checkout, down to the same Formal Conjectures commit.
Submission policy respected - Passed
The submitted source passed the static scan: no imports, no axiom declarations, no sorry, no native_decide, no unsafe options.
Production sandbox - Passed
The run happened under real isolation, Landrun with seccomp, and the sandbox passed its own live self-test before the proof was touched.
Challenge built - Passed
The trusted Challenge.lean, which contains no miner code, compiled on its own.
Source type hash matches - Passed
The source theorem in the compiled environment still hashes to the type recorded in the task, so the statement has not drifted upstream.
Solution built - Passed
The submitted Solution.lean compiled.
Statement unchanged - Passed
The theorem the proof establishes has exactly the same canonical type as the task's target - it was not weakened or restated.
Only permitted axioms - Passed
The transitive axiom closure of the proof stays inside the axioms this task permits.
Lean kernel accepted - Passed
The Lean kernel replayed the proof and accepted it.
Nanoda accepted - Not run
A second kernel, written independently of Lean's, also accepted the proof.
One kernel, not two
This task does not require a second, independent kernel, so Nanoda was not run. The verdict rests on a single kernel implementation.
Theorems established
Stage COMPLETED · Axioms permitted: propext, Quot.sound, Classical.choice