Checking in on those in the Back of the Yards today. I heard about the trauma and hardship these businesses experienced from the Trump Administration’s attacks. But I also heard something else: resilience and hope.

Checking that a major mathematical proof is correct can take years. Formalization—converting the mathematical reasoning into a form computer proof assistants like Lean can verify—can help. Last month, Claude completed the first formalized proof of Fermat’s Last Theorem, one of the most famous theorems of all time. This was a project experts thought would take many years. It is the largest Lean proof ever written. Fermat’s Last Theorem was first proven in 1995 by Sir Andrew Wiles, more than 350 years after it was conjectured. Our proof, which totals over 13 million lines of code, provides machine verification. More importantly, it proves over 29,000 other theorems that the proof requires, across many areas of math which had never before been formalized. We see this as a major step in the long process of firming up the core of mathematical knowledge, building on work from three centuries of mathematicians and hundreds of contributors to Lean and Mathlib. We are optimistic that AI-assisted verification of mathematical proofs will help reduce the burden of refereeing mathematics in an era where more proofs are being produced than ever before. You can read about the process on our Science Blog: And see the complete proof on GitHub:

Checking five wallets across three providers before you can even see your real balance is not a workflow. CROPR pulls every wallet into one view, across 30+ providers (@MetaMask, @phantom, @Rabby_io), each named with its balance. Non-custodial throughout.

Checking multiple tokens means multiple tabs, one at a time. GMGN OpenAPI does it in one batch — basics, security, and holder distribution, every token at once. "Batch-check the basics, security, and holder distribution for [address1, address2, address3] ."