Math Olympiad

This is a proof-oriented solver for IMO, Putnam, USAMO, and AIME problems that runs parallel solving attempts with internal refinement, then strips the thinking traces and runs fresh-context adversarial verification. The workflow matters: it launches 8-12 solver agents that each iterate through solve, self-improve, self-verify cycles, cleans the solutions to remove reasoning traces that bias verifiers toward agreement, then attacks each proof with pattern-specific checks like "does this prove the Riemann hypothesis as a special case" and small counterexample testing. No computation tools allowed, pure reasoning only. It will say "no confident solution" rather than confidently hallucinate a proof. Best for competition proofs where wrong-and-confident is worse than honest abstention. For full problem sets, run one workflow per problem in parallel with labels to track which result belongs to which problem.