math-olympiad

Submit the problem statement and proof for adversarial verification. A fresh-context verifier attacks the argument using 12 specific failure patterns such as tautological reductions, unsatisfied theorem hypotheses, and one-line lemmas, returning a HOLDS, HOLE FOUND, or UNCLEAR verdict.

It launches 8-12 parallel solver agents with different starting angles, each iterating through solve, self-improve, and self-verify rounds. The top candidate then passes up to 5 independent adversarial verifiers with a 4-confirm/2-refute asymmetric vote before revision or presentation.

Yes, if pdflatex or xelatex is installed. After verification passes, a presentation agent rewrites the proof for clarity using a LaTeX template, and the compile_pdf.sh script wraps it in a minimal preamble and compiles it to PDF.

After 3 failed revise cycles it abstains with a calibrated verdict listing what was tried, what partial results survived verification, and where the proof breaks. A deep-mode agent with bounded local computation then gets one focused attempt before the abstention is finalized.

No. Solvers and verifiers use pure reasoning only, and web access is explicitly forbidden including in deep mode. Deep mode permits only bounded local computation such as modular arithmetic and small-case enumeration with a 60-second limit.

Use majority voting for numeric-answer problems like AIME where no proof is required. Run 5-7 solvers with varied approaches and take the majority answer; if there is no majority, verify the top two candidates by substitution.