logoalt Hacker News

RenRenJuan • today at 3:34 PM • 0 replies • view on HN

An unreadable proof is basically none at all. Suggest you have a model produce a concise summary and work edge in from that. Apparently none of these problems has been verified and anybody working with models would be justly skeptical of these helium filled claims which are almost certainly not going to pan out.

Also apparently the Riemann claim is based on it compiling in Lean. This is classic because just the differences between an actual verification of a proof and it compiling in Lean are the standard model failure tropes, lack of judgement, confabulation, etc., to which this adds shortcomings of Lean.