Least-to-Most Prompting
Least-to-Most prompting breaks a hard problem into a sequence of simpler subproblems, solving them in order so each answer feeds the next.
Overview
It matters because it lets models tackle questions far harder than the examples they were shown.
Deep Dive
Least-to-Most prompting, introduced by Zhou and colleagues at Google in 2022, has two stages. First, the model is prompted to decompose a complex question into an ordered list of easier subquestions. Second, it solves those subquestions one at a time, appending each solved answer to the context so later steps can build on earlier ones. This differs from chain-of-thought, which reasons in a single pass without explicit decomposition. The headline result was strong easy-to-hard generalization: on the SCAN compositional-generalization benchmark, least-to-most prompting solved a large majority of long commands even though the prompt examples were short, where standard chain-of-thought largely failed.
Technical Insight
The power comes from separating planning from execution. Decomposition produces a dependency-ordered chain so that subproblem N only relies on subproblems already solved. Each solved answer is concatenated into the running prompt, giving the model the intermediate results it needs rather than asking it to hold everything in one leap. This reduces the reasoning each individual step must perform, which is why models generalize to inputs longer and harder than any single demonstration.
Strategic Impact
Speed and scale
Language workflows can move faster without sacrificing consistency.
Access and reach
It expands access across languages and communication styles.
Clearer decisions
Teams can spend more time on judgment while automation handles repetition.
The Future of Least-to-Most Prompting
Least-to-Most ideas now underpin many agent and planner architectures that split goals into ordered subtasks before acting. Expect hybrids with tool use, where each subquestion can trigger a calculator, search, or code call, and with self-consistency for more robust subanswers. Research is also exploring automatic decomposition that adapts depth to problem difficulty, and combining it with verification so a wrong early subanswer does not silently corrupt the entire downstream chain.
Real-World Implementation
Solving a multi-step word problem by first listing the quantities to compute, then computing them in order
Compositional language tasks like translating long instructions into action sequences from short examples
Answering a complex research question by breaking it into sub-questions whose answers combine into the final response
Writing a program by decomposing it into helper functions solved one at a time, each reused by later steps
Risks & Guardrails
Hallucinated facts can quietly enter reports, support flows, or research outputs.
Prompt sensitivity can create inconsistent results across similar requests.
Sensitive text data may be exposed if access controls are weak.
Implementation Roadmap
Define output format, tone, and quality standards before rollout.
Ground responses with trusted sources whenever accuracy matters.
Keep a human review checkpoint for high-stakes outputs.
Track failure patterns and retrain prompts or workflows regularly.
Keep Exploring
Free newsletter
Keep up with AI in 3 minutes a day
One short email each weekday with the three AI stories that actually matter. Free forever, no ads.
One email each weekday. Unsubscribe in one click. We never sell or share your address.
Test yourself
Take the Least-to-Most Prompting quiz
Instant feedback on every answer, and a shareable certificate with a verifiable ID once you pass a course.
Support free AI education. AI Understanding is a 501(c)(3) nonprofit — no ads, no paywall, ever. Make a donation
Next guide
Plan-and-Solve Prompting
Frequently asked questions
What is Least-to-Most Prompting?
Least-to-Most prompting breaks a hard problem into a sequence of simpler subproblems, solving them in order so each answer feeds the next. It matters because it lets models tackle questions far harder than the examples they were shown.
What are the two main stages of Least-to-Most prompting?
It first breaks the problem into an ordered set of easier subquestions, then solves each in sequence.
How does Least-to-Most differ from standard chain-of-thought prompting?
Chain-of-thought reasons in one pass; least-to-most explicitly decomposes and chains subanswers together.
What capability did Least-to-Most notably demonstrate on the SCAN benchmark?
It solved long compositional commands despite only seeing short examples, showing easy-to-hard generalization.
Why is the order of subquestions important?
Subproblems are arranged so each depends only on previously solved ones, letting answers build up correctly.
How are intermediate answers used during the solving stage?
Each solved subanswer is added to the running prompt so subsequent steps have the results they need.