Finite handles — Riemann hypothesis

The published window is $0\leq\Lambda\leq1/5$ . One row per campaign; certified requires a verified improvement of that record.

Leaf	Folder	Status	Finite task and remaining obligation
Published-parameter and Lehmer replay; first candidate audit	`q1/`	residue	Small arithmetic and partial fresh checks only. Neither rounded Table 1 arithmetic nor a negative historical lower bound improves the record.
Independent certification of the existing upper-bound candidate	`q2/`	certified	$\Lambda\leq893927/5000000=0.1787854<1/5$ . Two complete finite algorithms cover all 3,149,013 indices; fresh height, error, tail, and 883-prism barrier checks pass. Analytic transfer, including $t=0$ , reviewed in `q2/ANALYTIC_REVIEW.md`; full evidence retained in `q2/certificate/`.

The second row completes the finite handle left by the first campaign. Only one heavy computation runs at a time. Covering and other problem claims are outside this campaign.