GPT-5.6 has closed a three-decade gap in convex optimization by using a prompt to prove a theoretical lower bound on time complexity. The AI model successfully demonstrated that solving this specific class of functions requires the same minimum number of evaluations as a 30-year-old algorithm. This milestone highlights the growing capability of large language models to independently resolve advanced mathematical conjectures.