2026-10-11 16:37 UTC

formal-verification

band: hotmomentum: stable score: 0.92
temperature history

Episodes (17)

Independent evaluations will determine whether Mistral's Leanstral materially improves Lean proof development and formal-verification workflows over general-purpose reasoning models.
expiredconvergesscott: medium
Independent testing will determine whether OpenCode Guardians can block unsafe coding-agent tool calls with low latency and an acceptable false-positive rate.
expirednovelscott: none
Independent reproduction will determine whether the reported Codex-assisted SAT computation validly proves that 13 queens cannot dominate a 26-by-26 board.
expiredconvergesscott: medium
Expert verification will determine whether Levent Alpöge’s Claude-assisted construction is a valid Hadamard matrix of order 668, resolving the smallest currently open order.
expiredknownscott: low
Independent evaluation will determine whether the proposed contract-grade verifier reliably catches correctness and safety failures in LLM-generated GPU kernels at practical overhead.
expiredconvergesscott: medium
Vero evaluations will determine whether AI agents can autonomously produce complete software repositories whose required behavior is established through machine-checked formal verification.
expiredconvergesscott: high
Levent Alpöge claims an AI-assisted proof of the Hopf problem, while Boris Alexeev has reportedly released a roughly 250,000-line Codex-generated Lean formalization that would make the result an unusually large advance in AI-assisted formal mathematics if valid.
watchingconvergesscott: medium
Flare’s authors claim their LLM-based theorem-proving system can verify mixed-integer-program reformulations, potentially making equivalence checking more automated and rigorous than informal mathematical review.
expiredconvergesscott: medium
Anthropic claims its released Lean 4 formalization of Fermat’s Last Theorem is a complete, machine-checkable artifact produced with substantial AI assistance, potentially establishing repository-scale formalization as a credible AI-assisted mathematics workflow.
corroboratedconvergesscott: high
FLARE’s authors claim their released LLM-and-Lean verifier achieves 100% accuracy on FormulationBench’s 54 NP-hard reformulation pairs and certifies every accepted pair, potentially replacing instance-only optimization checks with machine-checked formulation-level guarantees.
seedknownscott: low
HN user kbr- claims their published AI-assisted, formalized proof solves a 12-year-old mathematics problem, potentially establishing a new machine-checkable research result if the formal statement and proof substantiate the claimed solution.
seedknownscott: low
srush claims the released Lean Verified Transformers project uses AI-written proofs to verify foundational neural-network and transformer properties in a simplified rational-arithmetic model, providing machine-checkable reasoning about optimization invariants rather than verification of production floating-point kernels.
seedconvergesscott: low
Dan Abramov claims his published AI-assisted Lean proof resolves Conway's refinement conjecture for omnific integers, potentially establishing a new mathematical result through a nonexpert-led agent workflow despite outstanding expert verification.
seedconvergesscott: medium
MoA's author claims its published attention-kernel project establishes minimality before implementation, potentially providing a proof-first basis for kernel design rather than relying solely on empirical optimization.
seedknownscott: low
Vals.ai claims ten Claude Sonnet 5.5 agents ran 15 hours of autonomous research and returned a 17,895-line machine-checkable Lean proof on the 1904 Thomson problem; verification of the artifact would establish sustained multi-agent formal-mathematics research outside frontier labs, while a flawed proof marks another inflated capability demo.
watchingnovelscott: high
Builder unexcitedneurons claims a free 7-agent OpenAI-Dots swarm improved the 47-year-old covering-number record C(24,14,4) from 19 to 20, verified by a sorry-free Lean proof that passed Palomar registry mechanical checks — expert review confirming or breaking the proof decides whether consumer-grade agent swarms now produce verified record-beating mathematics.
corroboratedconvergesscott: high
A 9th-grade student claims to have used Claude to prove the rhombicosidodecahedron cannot pass through a copy of itself, using interval arithmetic over 12.3M boxes and 38 CPU hours to verify singular configurations at √5.
seednovelscott: low

Trajectory notes