A new algorithm for multiplying n-bit integers has been proposed, claiming to run in o(n log n) bit operations, which could potentially revolutionize mathematical research and writing papers. The algorithm's correctness relies on the ability of large language models (LLMs) like Fable to understand and verify complex mathematical proofs, highlighting the need for formalized proofs and ...