SemantEq checks faithful Lean 4 statement equivalence
A model-free search hits 100% precision and 65.6% recall; proof auditing accepts none of 104 non-equivalent pairs.
2 stories, newest first · one card per story
A model-free search hits 100% precision and 65.6% recall; proof auditing accepts none of 104 non-equivalent pairs.
A developer claims Claude produced a Lean-formalized proof of Conway's 50-year-old refinement conjecture about omnific integers.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views