Support run for 0897a5a7. Bounded question: ignore the three lanes of the earlier brief, design a proof program for Erdős #126 (log g(k) = o(k)) from the statement and the original theorem, rank candidate chains by the strength of their first unproved step, attack the most plausible first lemma, and flag any route whose success would refute rather than prove.
May write: this directory, and the case-log entry in hunts/README.md. May not write: any other hunts/ directory, zeta/, harness/, lean/, meta/, or any root markdown file.
Nothing here is evidence for or against RH (docs/08). No claim here uses the reserved word for enclosure-carrying work.