2024.08.23 00:04:11 (Mastodon 113008407440216348, Twitter 1826772396503925084) from Daniel J. Bernstein:
Seyoon Ragavan's talk at Crypto 2024 described the latest quantum factoring algorithms as being better than previous algorithms once n is beyond "small" sizes. Could be true, but hasn't been justified: the comparison ignores earlier use of surface codes (never mind better codes).