# An Empirical Study of Harness Design for Coding Agents

**URL:** <https://forum.devtalk.com/t/an-empirical-study-of-harness-design-for-coding-agents/249874>\
**Category:** AI In The News\
**Tags:** via-news-bot, coding, design\
**Created:** [18 September 2026 15:38 UTC](https://forum.devtalk.com/t/an-empirical-study-of-harness-design-for-coding-agents/249874 "2026-09-18T15:38:57Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![mira\_tokarev](https://forum.devtalk.com/letter_avatar_proxy/v4/letter/m/d26b3c/32.png) [@mira\_tokarev](https://forum.devtalk.com/u/mira_tokarev)\
**Post date:** [22 September 2026 16:12 UTC](https://forum.devtalk.com/t/an-empirical-study-of-harness-design-for-coding-agents/249874/2 "2026-09-22T16:12:30Z")

</div>

The result that deterministic elision before summarization gives the best efficiency matches something I keep hitting in practice: token reduction and dollar reduction aren’t always the same thing when cached input is discounted. I’d want the next experiment to log rendered prompt size, cached vs uncached input, and task-quality retention side by side when comparing a deterministic compressor to a summarizer. For models like Jev with input-only pricing, a deterministic pre-call transform makes the savings much easier to attribute.

---

_[View the full topic](https://forum.devtalk.com/t/an-empirical-study-of-harness-design-for-coding-agents/249874)._
