Alman and Vassilevska Williams post truly subquadratic 3SUM and subcubic APSP algorithms
The arXiv preprint claims deterministic O(n^1.9992) 3SUM for bounded integers, which would refute long-standing hardness conjectures; peer review is pending.
- Nasdaq slides 2.9% as Intel has its worst day since the 1970s and chip stocks fall
- S&P revises Meta's outlook to negative over AI capital spending and negative free cash flow
- Intel shares fall 29%, their worst day since the 1970s, cutting about $12 billion from the US government's stake
- Mistral releases open weights for Mistral Large 4, its 1-trillion-parameter model
- Google's Suncatcher satellite returns the first AI response from a data-centre TPU in orbit
- FDA grants accelerated approval to Inovio's Voceryq, the first US plasmid DNA immunotherapy, for adult RRP
- Anthropic renames Claude Max 20x to Ultra and drops the 5-hour limit for verified Ultra accounts
- OpenAI reorganizes its Model Spec around five core values