- GPT-5.6 Sol Pro solved a convex optimization complexity gap from 1996 in 148 minutes.
- It provided a proof for a quadratic lower bound on deterministic zeroth-order convex optimization oracle complexity.
- The proof was formally verified in Lean, with all details available in the linked preprint and repository.