← Toutes les offres
L

Trying to understand that compute multiplier graph

loops

Global
Publié le 16 novembre 2026

Description du poste

Anthropic's IPO roadshow video has a graph. It shows four models; I think dot 1 = Claude 3.5, dot 2 = Claude 4, dot 3 = Mythos, arrowhead = unreleased model. The graph provided doesn't have any numbers on the Y axis. In this post I'll explain why I think the Y axis lines most likely represent a 10x jump each, and so the point at the end of the graph represents about a 30000x CM (i.e. Anthropic can currently pretrain models at the same quality with 1/30000th of the compute it needed in 2024). I'm pretty unsure about this though and it could plausibly be much higher or much lower. Keep in mind that this graph is only about pretraining and doesn't say anything about post-training.[1] Without extra context, it's hard to say how much the compute has actually been multiplied: if each Y gridline is 1.1x the total multiplier would be about 1.53x; if each Y gridline is 10x the total multiplier would be about 30000x. (It's not clear to me why the last point is an arrowhead instead of a dot - maybe it's supposed to be their guess of what the compute multiplier will end up at for their latest pretraining run?) What people in the IPO roadshow video say about compute multipliers Sam McCandlish said (while that graph was displayed): It’s how we serve models to customers and how we use Claude at scale internally. By training what we believe to be the most efficient models, we can do more of all these things with the same amount of compute. It’s also how we drive down costs, both for customers as well as our own underlying costs. We’re accelerating these efficiency gains through our research process. Our pace of discovery is speeding up, and a lot of that acceleration comes from Claude itself. Tom Brown said: The second driver of our compute advantage is our rate of discovery of compute multipliers. We focus on total effective compute, which is the multiplicative product of physical capacity times the compute multipliers that we discover. Each one we discover makes our pool of tota