ByteBrief
We're a portrait publication through and through. Turn your phone back and your briefing picks up right where you left it.
(We tried widescreen once. It wasn't us.)

OpenAI and Anthropic recently solved difficult mathematical problems including Navier Stokes and Fermat's Last Theorem. OpenAI found a counterexample to Erdős's unit distance conjecture in May and published a proof for the Cycle Double Cover problem a month later. Anthropic formalized Fermat's Last Theorem.
Tap to vote and see what everyone thinks.
Summary by ByteBrief