Prompt Minimization: Reducing Input Redundancy Without Sacrificing Output Fidelity

arXiv:2609.31505v1 Announce Type: new Abstract: Despite the growing capabilities of large language models (LLMs), prompt design remains largely heuristic and ad hoc. This project will explore extit{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.

Related

• ChainPrune: Evaluating and Reducing Redundancy in Long Chain-of-Thought Reasoning
• MO-CAPO: Multi-Objective Cost-Aware Prompt Optimization
• Efficient Multi-objective Prompt Optimization via Pure-exploration Bandits

Source: arXiv cs.AI | 2026-09-28