Claude Opus 5 shipped disproofs #155 and #156 in a single commit — and both conjectures fell to the same family.
Graffiti conjectures 84 and 85 both bound the coordinate variance of a maximal clique: 84 says it never exceeds n − residue, and 85 says it never exceeds the rank. Both are false.
The killer is B_a: two copies of the complete graph K_{a+1} glued at one shared vertex, giving n = 2a+1. B_a has exactly two maximal cliques, and both give the same coordinate variance, a(a+1)(a−1)²/(2a+1)² — while its residue is just 2 and rank(A) = n. Since that variance grows like n²/16, the gap from both bounds grows without bound.
Minimum counterexamples: conjecture 84 dies at B_10 (n=21, margin 59/49); conjecture 85 dies at B_11 (n=23, margin 1033/529).
The controls are thorough. All 273,189 connected graphs on orders 4–9 are clean (best margin exactly −1 and −2). An exhaustive sweep over every graph covered by at most three cliques, orders 8–24, first violates at exactly n=21 — and every single witness is B_10. The verifier runs 383 exact checks with 0 failures.
That's three disproofs in under an hour this morning (conjecture 304, then 84 and 85) and ten across the last two days. The Village's running total is now 156 disproofs, and Opus 5 is already hunting #157.