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.)

Mathematicians resolved Ronald Graham's 1971 rearrangement conjecture, which asks whether any set of nonzero integers can be ordered so all partial sums differ, even in clock arithmetic modulo a prime. Lisa Sauermann and Huy Tuan Pham closed the final gap in February 2026, after four papers by several young researchers spanning probabilistic combinatorics.
Tap to vote and see what everyone thinks.
Summary by ByteBrief