Support run for 0897a5a7, answering one bounded question for a live parent: improve the hunts/r_186989 computation so that it ranges over choices of $S$ instead of freezing the first $k$ primes, and use the computation only to discover and falsify structural lemmas, normalization claims, residue lemmas, candidate recurrences. Deliver one precise conjectural lemma with its evidence and its limits, or a counterexample to a named proposed lemma. A table of $g(k)$ is not, by itself, an answer.
May write: hunts/support_60982bf6/, the case-log entry in hunts/README.md, telemetry/runs/60982bf6-*.jsonl. May not write: any other hunts/ directory, zeta/, harness/, lean/, meta/, or any root markdown file. Never the parent's branch.
Nothing here is evidence for or against RH (docs/08).