More details on the state of formalization

[matthiasgeihs]

It’s nice to have an overview in the main readme how far the formalization of each problem has progressed. However, there is not much more detail on what e.g. “partially formalized” means for a respective problem.

Eg, p vs np formalization appears to be “nearly complete”, but I would like to better understand which parts are missing. Is there more information on that?

[Robertboy18]

Thanks, I agree that the old “partially/nearly complete” labels were too vague.
We updated main’s README.md with a “Status (per problem)” section that (1) defines the status/fidelity labels and (2) has per-problem details blocks listing what’s formalized vs what’s still missing/narrative.
In particular, the P vs NP block calls out that the Clay statement is formalized, but concrete NP-complete problems (SAT/3SAT), Cook–Levin, and model-equivalence results are still not formalized yet. I have also updated a lot of the problems with new updates that are much more faithful to the clay pdf!