If you describe what you want instead of coding how to get it, how much build time do you actually save?
How much build time does declarative configuration save versus custom code?
This explores how much engineering time you save by describing what a system should do (configuration, templates, rules) instead of writing custom code for it, and the corpus has no note that measures this.
This explores how much engineering time you save by describing what a system should do (configuration, templates, rules) instead of writing custom code for it. Nothing in the collection measures build time for either approach. No note compares hours, effort or cost for declarative versus hand-coded builds, so any figure here would be invented. What the corpus does have is evidence on the related question of what you gain and lose when you declare the goal and let something else handle the how.
The cleanest example is constraint solving. A solver lets you state the constraints and does the searching itself, and the key ingredient is the ability to throw away a bad partial answer and back up. Autoregressive language models can't retract tokens they've already emitted, so they hit a ceiling that better training doesn't fix. Plugging in a symbolic solver works because it supplies what the architecture lacks (Why does autoregressive generation fail at constraint satisfaction?). The payoff of declaring here is a capability you couldn't otherwise reach, not saved hours.
The corpus also shows where declared rules stop working. Per-action checks, the guardrail version of configuration, can't express a constraint that depends on what came before. "Never do X after Y" needs memory of history, so it takes a stateful monitor, which is real code (Can stateless checks ever catch sequence-level constraint violations?). The time saved by configuring runs out at the point where your requirements depend on sequence.
The nearest quantified results measure agent performance, not build time. Organizing a repository around an explicit behavior-to-code map raised win rates by 10–19 points and cut planner tokens by 8–13%, and it let a weaker model match a stronger one at locating code (Can explicit behavior maps help weaker planners compete with stronger models?). Natural-language templates capture much of the discipline of formal verification without formalizing anything, which makes them a cheaper middle path (Can structured templates replace formal verification for code reasoning?). Small adapters on one shared base model can stand in for millions of custom models, but only when scale-up, scale-down and scale-out all reinforce each other (Can lightweight adapters replace millions of personalized models?). These suggest that lightweight, structured specifications can beat bespoke builds, but none of them says by how much. Answering your question needs a source that tracks engineering time, and this collection doesn't have one yet.
Sources 5 notes
The performance ceiling on constraint satisfaction problems is not a model-quality issue but an architectural limitation: autoregressive transformers cannot retract emitted tokens, while CSP solvers fundamentally depend on discarding invalid partial assignments. Symbolic solver integration works because it supplies what the architecture lacks.
Per-action checks are structurally unable to state constraints that depend on prior history. Only stateful monitors tracking composed multi-party behavior can verify the behavioral envelopes that prevent individually permissible actions from collectively violating system-level safety.
A behavior-to-code mapping representation improved win rates by 10–19 points while reducing planner tokens by 8–13%. Weaker planners using this mapping matched stronger models' code localization across all precision and recall metrics.
Semi-formal reasoning using natural-language templates enforces the discipline of formal methods without formalizing language semantics. Templates prevent case-skipping, unsupported claims, and confirmation bias—capturing the verification benefits of formalism through forced completeness scaffolding rather than symbolic rigor.
PEFT adapters function as durable behavioral deltas carrying learned user experience, enabling a single strong base plus millions of lightweight adapters to replace millions of full models—but only when scale-up, scale-down, and scale-out reinforce simultaneously.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- Harness Handbook: Making Evolving Agent Harnesses Readable,Navigable, and Editable
- On the Scaling of PEFT: Towards Million Personal Models of Trillion Parameters
- An Empirical Study of Harness Design for Coding Agents
- Large Language Diffusion Models
- From Model Scaling to System Scaling: Scaling the Harness in Agentic AI
- Scaling Laws for Agent Harnesses via Effective Feedback Compute
- Tree of Thoughts: Deliberate Problem Solving with Large Language Models
- Self-Evaluation Guided Beam Search for Reasoning