ETH concerns how hard Boolean satisfiability is to solve; researchers have used it to show problems in graph theory, computational biology and databases are hard to solve quickly, according to TNW.[1] OpenAI checked the result in Lean, a language that verifies proofs by machine, and posted it on GitHub.[1] Russell Impagliazzo and Ramamohan Paturi of UC San Diego, who first proposed ETH, will examine it with Ryan Williams of MIT; they wrote that their involvement "should not be taken as certification of the claim."[1]