The DOI matches its Crossref record; 41 of the 42 references it cites were found in a registry or an index; none of the 36 sources its claims cite is checked for support yet.
AI and Compute: How Much Longer Can Computing Power Drive Artificial Intelligence Progress?
Open accessAbstract
Between 2012 and 2018, the amount of computing power used by record-breaking artificial intelligence models doubled every 3.4 months. Even with money pouring into the AI field, this trendline is unsustainable. Because of cost, hardware availability and engineering difficulties, the next decade of AI can't rely exclusively on applying more and more computing power to drive further progress.
Overview
CoChat Summary
## TL;DR
The paper argues that the decade-long AI trend of rapidly increasing compute use is likely nearing its limit because training costs, chip availability, and parallelization bottlenecks are all constraining further growth. It concludes that future AI progress will depend more on algorithmic and hardware efficiency, talent, and application-specific approaches than on simply scaling compute.
## Key findings
- The paper states that compute demands for top AI models doubled about every 3.4 months between 2012 and 2018, far faster than the prior Moore’s-law-like pace.
- It estimates that training GPT-3 required about 3,600 petaFLOPS-days, costing about $1.65 million on Google TPUs at maximum continuous performance; its compute trendline says a comparable leading model by late 2021 would cost about $9.4 million, and by the end of 2021 the trendline predicted a model of just over one million petaFLOPS-days costing over $450 million.
- The paper says the price of compute has not decreased since 2017 for gigaFLOPS, and cloud GPU prices at AWS and Google Cloud have remained constant since at least 2017 and 2019, respectively; Nvidia’s newer A100 offered only 5% more FLOPS per dollar than the 2017 V100.
- Based on accelerator shipments, it estimates about 35 million accelerators reach datacenters annually, and says that by December 2025 the trendline would require a single model to use every GPU in every datacenter for three years; even if the estimate were off by an order of magnitude, the breaking point would still arrive by December 2026.
## Methods
- The paper is a trend-analysis / projection paper that extrapolates historical AI compute growth, then tests the sustainability of that trend against training cost, accelerator supply, and parallelization limits.
- It uses cloud compute pricing as a baseline, focusing on training only and explicitly excluding data generation/preparation costs; it also compares Google TPU pricing with state-of-the-art GPU pricing.
- For availability, it estimates annual accelerator supply to datacenters from public shipment and market-share figures; for large-model scaling, it uses published scaling laws and reported training setups to estimate compute needs for models like GPT-3 and hypothetical larger models.
## Limitations
- The paper states that its supply estimate for accelerators is imprecise and likely a substantial overcount, because it counts accelerators across cloud datacenters without separating inference chips from training chips.
- It also states that its cost estimates are conservatively low because they assume 100% accelerator utilization and peak advertised performance, while real-world utilization is typically lower; this is an explicit caveat in the paper.
- Evident from the text: the analysis focuses on training compute only, so it does not capture the full compute burden of AI systems, especially inference, which the paper itself notes can be substantial.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 16 Not valid · 36 Not checked · 88 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Nvidia has used techniques to further reduce precision that have allowed their newest processors to train two to three times faster than in 2017.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“83,000 GPUs represents only 0.2 percent of the 35 million accelerators we estimate go into the cloud every year, and $2 billion is a very high sticker price, though well within the budgetary capacity of a nation-state.”
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“During this period, manufacturers have improved performance by developing chips that can perform less precise computations rather than by simply performing more of them.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“An estimate of about $4.6 million is probably more accurate.”
What the sources say
- Not matchedcites Chuan Li
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For now, assuming that developers can achieve near optimal efficiency, the equation estimates that building GPT-4 -which we define as one hundred times bigger than GPT-3 (17.5 trillion parameters) -would take at least 450,000 petaFLOPS-days.”
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
47 more claims
Create a free account to see all 140 claims and every source verdict.
- Probably not a substantial claim. 58
- It may state two separate claims as one. 45
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
“As one example, the 530 billion parameter Megatron-Turing model used 4,480 GPUs in total. Eight different copies of the model ran simultaneously on different slices of the data, but each copy of the model was so big that it was stored across 280 GPUs.”
Reported 4480 · recomputed 2240
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Managing Massive Models
“As one example, the 530 billion parameter Megatron-Turing model used 4,480 GPUs in total.”
§ Managing Massive Models
“Eight different copies of the model ran simultaneously on different slices of the data, but each copy of the model was so big that it was stored across 280 GPUs.”
Citations
Cites
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764
Language Models are Few-Shot Learners
Brown, T. B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al. (2020) · arXiv · doi:10.48550/arxiv.2005.14165 · Cited by 23,372
RoBERTa: A Robustly Optimized BERT Pretraining Approach
Liu, Y., Ott, M., Goyal, N., Du, J., Joshi, M., Chen, D., Levy, O., Lewis, M., Zettlemoyer, L., & Stoyanov, V. (2019) · arXiv · doi:10.48550/arxiv.1907.11692 · Cited by 16,515
Kaugeranna, R., Kaugeranna, E., & Aion, (. S. 4. 6. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.giscience.2023.43 · Cited by 13,690
Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., & Liu, P. J. (2019) · arXiv · doi:10.48550/arxiv.1910.10683 · Cited by 10,929
Scaling Laws for Neural Language Models
Kaplan, J., McCandlish, S., Henighan, T., Brown, T. B., Chess, B., Child, R., Gray, S., Radford, A., Wu, J., & Amodei, D. (2020) · arXiv · doi:10.48550/arxiv.2001.08361 · Cited by 9,550
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2018) · Science · doi:10.1126/science.aar6404 · Cited by 3,562
Cited by
The Computational Limits of Deep Learning
Thompson, N. C., Greenewald, K., Lee, K., & Manso, G. F. (2020) · arXiv · doi:10.48550/arxiv.2007.05558 · Cited by 538
Compute Trends Across Three Eras of Machine Learning
Sevilla, J., Heim, L., Ho, A., Besiroglu, T., Hobbhahn, M., & Villalobos, P. (2022) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9891914 · Cited by 363
Predictability and Surprise in Large Generative Models
Ganguli, D., Hernandez, D., Lovitt, L., DasSarma, N., Henighan, T., Jones, A., Joseph, N., Kernion, J., Mann, B., Askell, A., et al. (2022) · arXiv · doi:10.48550/arxiv.2202.07785 · Cited by 324
Intelligent Computing: The Latest Advances, Challenges, and Future
Zhu, S., Yu, T., Xu, T., Chen, H., Dustdar, S., Gigan, S., Gunduz, D., Hossain, E., Jin, Y., Lin, F., et al. (2023) · Intelligent Computing · doi:10.34133/icomputing.0006 · Cited by 290
The Computational Limits of Deep Learning
Thompson, N., Greenewald, K., Lee, K., & Manso, G. F. (2023) · Ninth Computing within Limits 2023 · doi:10.21428/bf6fb269.1f033948 · Cited by 495
Metadata
- Authors
- Lohn, A., & Musser, M.
- Venue
- Center for Security and Emerging Technology
- Published
- 2022-01
- OpenAlex
- W4205930673
- Cited by
- 39
- References
- 42
- Citations by year
- 2026: 3 · 2025: 4 · 2024: 14 · 2023: 16 · 2022: 2
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
- Keywords
- computational power, Moore's law, scalability limits, AI research funding
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-01, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-01 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: AI and Compute: How Much Longer Can Computing Power Drive Artificial Intelligence Progress? https://app.cochat.ai/papers/10.51593/2021ca009
- The paper
- Lohn, A., & Musser, M. (2022). AI and Compute: How Much Longer Can Computing Power Drive Artificial Intelligence Progress? Center for Security and Emerging Technology. https://doi.org/10.51593/2021ca009
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.