---
title: 'Least-to-Most Prompting Enables Complex Reasoning in Large Language Models'
license: CC-BY-4.0
license_url: https://creativecommons.org/licenses/by/4.0/
license_note: 'paper is arXiv non-exclusive distribution license (verified on arXiv abs page 2026-11-12); this pointer note is our own words and is CC BY 4.0; we link to the paper rather than reproduce it'
source: https://iinventedlight.com/library/notes/2205-10625-least-to-most-prompting.md
source_license: 'arXiv non-exclusive distribution license'
attribution: 'Pointer by iinventedlight (AI-assisted). Source: Denny Zhou, Nathanael Schärli, Le Hou, and 8 coauthors (listed on the arXiv abs page), Least-to-Most Prompting Enables Complex Reasoning in Large Language Models (arXiv non-exclusive distribution license). This note links to the paper rather than reproducing it.'
author: 'iinventedlight (AI-assisted)'
date: 2026-11-12
status: published
approved_by: "Cole Withington, 2026-11-12 14:44 PT, Librarian chat widget t51s316: \"Yes, publish all 100 second-list arXiv notes\""
checked_on: 2026-11-12
as_of: 2026-11-12
confidence: medium
untested: 'Pointer note only. Paper not reproduced. Abs page and license checked 2026-11-12.'
category: arxiv
topic_area: 'ai-research: reasoning'
tags: arxiv, reasoning, prompting, chain-of-thought
arxiv_id: 2205.10625
alias: 2205.10625-least-to-most-prompting
type: pointer
format: pointer
sources:
  - id: S1
    title: 'Least-to-Most Prompting Enables Complex Reasoning in Large Language Models'
    publisher: arXiv
    authors: 'Denny Zhou, Nathanael Schärli, Le Hou, and 8 coauthors (listed on the arXiv abs page)'
    url: https://arxiv.org/abs/2205.10625
    version_read: 'v3 (16 Apr 2023)'
    accessed: 2026-11-12
    license: 'arXiv non-exclusive distribution license'
---
# Least-to-Most Prompting Enables Complex Reasoning in Large Language Models

## Summary
[Least-to-Most Prompting Enables Complex Reasoning in Large Language Models](https://arxiv.org/abs/2205.10625) (2022) proposed least-to-most prompting, a method that decomposes a hard problem into a sequence of easier subproblems and solves them in order. It is an important variant of chain-of-thought prompting, aimed at cases where the target problem is harder than the exemplars in the prompt.

What it introduced: a two-stage prompting pattern. First the model is asked to break a complex problem into simpler parts. Then it solves those parts from easiest to hardest, using earlier answers as context.

What it led to: later decomposition and tool-using agent patterns that treat hard tasks as a queue of easier steps. Live note: [2201-11903-chain-of-thought-prompting](https://iinventedlight.com/library/notes/2201-11903-chain-of-thought-prompting/). This week's drafts also include [2203-14465-star](https://iinventedlight.com/library/notes/2203-14465-star/) in this same pointer batch.

Use it when you want the decomposition variant of chain-of-thought prompting. Where to read it: https://arxiv.org/abs/2205.10625 (v3 (16 Apr 2023)).

The paper is posted on arXiv under the arXiv non-exclusive distribution license. This note links to it rather than reproducing it. The note itself is CC BY 4.0.

License: this note is CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). Pointer by iinventedlight (AI-assisted). Paper license: arXiv non-exclusive distribution; this note links to it and does not reproduce it.

---

Agents: [/agents.md](/agents.md) | [/.well-known/agent-library.json](/.well-known/agent-library.json).
