cs.AISep 25, 2026

Prompt Minimization: Reducing Input Redundancy Without Sacrificing Output Fidelity

Authors: Marius F. R. Juston, Kevin A. Karim, Jonathan Gao, Kevin C. Li, Rudhi Bashambu

Organizations: UIUC University of Illinois Urbana-Champaign, Illinois, USA · KTH Royal Institute of Technology, Stockholm, Sweden

Abstract

Despite the growing capabilities of large language models (LLMs), prompt design remains largely heuristic and ad hoc. This project will explore prompt minimization\textit{prompt minimization}, the process of reducing prompts to their smallest, most information-dense form while preserving output fidelity. Practically, shorter prompts reduce computational overhead and inference latency, especially when large contexts, such as entire documents or codebases, are included unnecessarily. Further, longer prompts can damage LLM reasoning and accuracy. Theoretically, the existence of multiple prompts yielding equivalent outputs suggests a high degree of redundancy in the input space, raising fundamental questions about what information is essential to elicit specific model behaviors. We propose three variant frameworks to identify and evaluate minimal prompts and demonstrate that minimal prompts often produce outputs comparable to those of their longer counterparts. These findings suggest new directions for efficient prompt engineering and deepen our understanding of input compression in LLMs.

Figures & tables

Appendix figures & tables6 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. How Much Prompt Is Enough? A Blackbox Minimization of Few-Shots in LLMs

    Sep 28, 2026Ali Alfageeh, Rahul Gopinath, Amin AlipourLLM PromptingFew-Shot Prompting

  2. Prompting Complexity: Shortest Prompts for Texts and Behaviors in LLMs

    Jul 7, 2026Adrian CosmaLLM PromptingPrompt Optimization