Papers › Large Language Models are Zero-Shot Reasoners
Large Language Models are Zero-Shot Reasoners
Takeshi Kojima, Shixiang Shane Gu, Machel Reid, Yutaka Matsuo, Yusuke Iwasawa
Pretrained large language models (LLMs) are widely used in many sub-fields of natural language processing (NLP) and generally known as excellent few-shot learners with task-specific exemplars. Notably, chain of thought (CoT) prompting, a recent technique for eliciting complex multi-step reasoning through step-by-step answer examples, achieved the state-of-the-art performances in arithmetics and symbolic reasoning, difficult system-2 tasks that do not follow the standard scaling laws for LLMs. While these successes are often attributed to LLMs' ability for few-shot learning, we show that LLMs are decent zero-shot reasoners by simply adding "Let's think step by step" before each answer. Experimental results demonstrate that our Zero-shot-CoT, using the same single prompt template, significantly outperforms zero-shot LLM performances on diverse benchmark reasoning tasks including arithmetics (MultiArith, GSM8K, AQUA-RAT, SVAMP), symbolic reasoning (Last Letter, Coin Flip), and other logical reasoning tasks (Date Understanding, Tracking Shuffled Objects), without any hand-crafted few-shot examples, e.g. increasing the accuracy on MultiArith from 17.7% to 78.7% and GSM8K from 10.4% to 40.7% with large InstructGPT model (text-davinci-002), as well as similar magnitudes of improvements with another off-the-shelf large model, 540B parameter PaLM. The versatility of this single prompt across very diverse reasoning tasks hints at untapped and understudied fundamental zero-shot capabilities of LLMs, suggesting high-level, multi-task broad cognitive capabilities may be extracted by simple prompting. We hope our work not only serves as the minimal strongest zero-shot baseline for the challenging reasoning benchmarks, but also highlights the importance of carefully exploring and analyzing the enormous zero-shot knowledge hidden inside LLMs before crafting finetuning datasets or few-shot exemplars.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2205.11916")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2205.11916", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2205.11916")
Code
Syntology 4 code samples harvested from 2 repositories linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.
By repository: official repository: 1 sample from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 3 samples from 1 repository, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
4 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 1 of the 4 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.
2a69062c931fd044 · report
019cef4a931d36cf · report
fixture: signature d:dict/0/?, key:str/0/str · returned str · level recorded 2026-09-24 12eff61056f9a673 · report
fixture: signature name:str/0/str · returned str · level recorded 2026-09-24 663cefba5b844a67 · report
fixture: signature filepath:str/0/str, default_filepath:str/0/str, default_ext:str/0/str · returned tuple · level recorded 2026-09-24 Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.
1 assembly on this paper: 1 harvested, 0 generated.
harvested Assembly for Zero-shot-CoT (graph method: Zero-shot-CoT). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.
- decoder_for_gpt3 entry · level 0 · unverified ·
2a69062c931fd044
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2205.11916") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Arithmetic Reasoning | GSM8K | PaLM-540B (few-Shot-cot) | Accuracy | 58.1 | #120 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | PaLM-540B (few-Shot-cot) | Parameters (Billion) | 540 | #120 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | Finetuned GPT-3 175B + verifier | Accuracy | 55.0 | #127 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | Finetuned GPT-3 175B + verifier | Parameters (Billion) | 175 | #127 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | Text-davinci-002-175B (zero-plus-few-Shot-cot (8 samples)) | Accuracy | 51.5 | #133 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | Text-davinci-002-175B (zero-plus-few-Shot-cot (8 samples)) | Parameters (Billion) | 175 | #133 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | text-davinci-002 175B (2-shot, CoT) | Accuracy | 41.3 | #138 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | text-davinci-002 175B (2-shot, CoT) | Parameters (Billion) | 175 | #138 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | text-davinci-002 175B (0-shot, CoT) | Accuracy | 40.7 | #140 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | text-davinci-002 175B (0-shot, CoT) | Parameters (Billion) | 175 | #140 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | PaLM 540B (few-shot) | Accuracy | 17.9 | #153 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | PaLM 540B (few-shot) | Parameters (Billion) | 540 | #153 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | Text-davinci-002-175B (0-shot) | Accuracy | 10.4 | #160 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | Text-davinci-002-175B (0-shot) | Parameters (Billion) | 175 | #160 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | MultiArith | Text-davinci-002 (175B)(zero-shot-cot) | Accuracy | 78.7 | #1 of 2 | Archive leaderboard | report |
| Arithmetic Reasoning | MultiArith | Text-davinci-002 (175B) (zero-shot) | Accuracy | 17.7 | #2 of 2 | Archive leaderboard | report |
| Common Sense Reasoning | ReCoRD | GPT-3 175B (one-shot) | F1 | 90.2 | #40 of 45 | Archive leaderboard | report |
| Math Word Problem Solving | SVAMP | PaLM (zero-shot, CoT) | Execution Accuracy | 62.1 | #14 of 26 | Archive leaderboard | report |
| Math Word Problem Solving | SVAMP | PaLM (zero-shot) | Execution Accuracy | 58.8 | #15 of 26 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections