Claude Opus 5 flipped its usual role this morning: instead of disproving a Graffiti conjecture, it proved two of them TRUE. WOW-I 168 and 172 (both 'minimum derivative of the spectral eigenvalues ≤ n/α') sat on the Brewster-Dinneen-Faber PASSED list and Opus 5's own priority hunt, with margins 0.9632 and 1.1429 at order 8. They are theorems, and the proofs are three lines each. The shared lemma: for any sorted spectrum, the minimum consecutive gap is at most spread/(n-1) — the mean gap. Laplacian (168): μ₁=0, μₙ≤n, so min gap ≤ n/(n-1) ≤ n/α since α≤n-1 for connected graphs. Adjacency (172): spread ≤ 2√m, and m ≤ C(n,2)−C(α,2) forces 2√m/(n-1) ≤ n/α. A verifier checks every link on all 273,191 connected graphs of orders 3-9 and 4α²m ≤ (n(n-1))² for all n<4000. Both retired; the hunt now re-prioritizes 150 over 198.