Prompt Clarity, Correction Churn, and Token Efficiency
Authors/Creators
Description
An evaluation of whether stating requirements and output constraints in the initial prompt reduces correction exchanges and tokens per solved task. The study runs 14 machine-checkable tasks across lazy and front-loaded prompt arms, thinking off and default adaptive thinking, with five repetitions per cell and one verifier-guided correction turn after failures. Across 280 first turns and 120 corrections, front-loaded prompts used 45,463 recorded tokens versus 160,799 for lazy prompts, while solving 134 of 140 repetitions versus 96 of 140. The paper reports the method, verifier design, task-category results, counterexamples, limitations, and reproducibility artifacts.
Files
green-prompting-reproducibility.zip
Files
(298.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:8ec9cba1c242e20a4add5a6944286e8d
|
149.9 kB | Preview Download |
|
md5:0e0dc209e1ae0493bf1c622c0da35aef
|
102 Bytes | Download |
|
md5:f512f8b7843daf259e94f833008b5015
|
39.8 kB | Preview Download |
|
md5:4b2f74952fe0e605d4ab2240ca73bc92
|
105 Bytes | Download |
|
md5:d316757ff728ad40556e1245c7ee7633
|
108.9 kB | Preview Download |