
When will LLMs be able to generate formal proof for sudoku solver?
6
100Ṁ3302027
1H
6H
1D
1W
1M
ALL
1.1%
2024
34%
2025
46%
2026
19%
2027 or later
When LLMs or hybrid AI models can generate both the implementation of a Sudoku solver and its formal specification, along with a formal proof of correctness?
Prompts might look like: 'Write a Sudoku solver in Coq and formally prove its correctness.'
Model should be generally available
This question is managed and resolved by Manifold.
Get
1,000 to start trading!
People are also trading
Related questions
Will an LLM consistently create 5x5 word squares by 2026?
80% chance
Will LLMs be able to formally verify non-trivial programs by the end of 2025?
30% chance
Will the best public LLM at the end of 2025 solve more than 5 of the first 10 Project Euler problems published in 2026?
75% chance
Will the majority of mathematicians rely on formal computer proof assistants before the end of 2040?
60% chance
Will OpenAI's next major LLM (after GPT-4) solve more than 2 of the first 5 new Project Euler problems?
45% chance
By 2028 will we be able to identify distinct submodules/algorithms within LLMs?
76% chance
When will the next paradigm in LLMs (after reasoning) be released?
Will we have a formalized proof of the Modularity theorem by 2029-05-01?
65% chance
In 2029, will any AI be able to take an arbitrary proof in the mathematical literature and translate it into a form suitable for symbolic verification? (Gary Marcus benchmark #5)
83% chance
When will we have a fully formalized proof of Fermat's Last Theorem?