Agent Energy Costs, Memory Attacks, and Compute Limits
Three new papers reframe how we measure agent efficiency, defend agent memory from poisoning attacks, and calculate hard accuracy ceilings for transformers.

This week's arXiv batch includes three papers that don't fit the usual "new model, better score" template. They're each asking a harder question: not what AI systems can do, but whether we understand what they actually cost, how vulnerable they are, and where their ceilings sit.
TL;DR
- Energy per Successful Goal - Agentic workflows burn 4.33x more energy per completed task than linear baselines, but the overhead is orchestration, not inference compute
- MemAudit - A post-hoc auditing framework cuts memory injection attack success rates from 70% to 0% on QA tasks
- Transformer accuracy ceilings are computable before training - measured between 19 and 31 across 12 architectures
Rethinking AI Energy: Goals, Not Inferences
The AI energy debate has centered on training costs and per-inference compute. Deepak Panigrahy and Aakash Tyagi argue that framing is wrong for agents, and the math to back that up is striking.
Their paper introduces a framework called A-LEMS (Agentic Layer Energy Measurement System) and a new metric: Energy per Successful Goal (EpG). The idea is simple. When a user asks an agent to complete a task, that task might trigger a dozen tool calls, several retries, and multiple failure-recovery cycles. Measuring energy at the inference level - the current standard - captures none of that overhead. EpG aggregates the total workflow cost across all execution attempts and divides by goals actually completed.
The 4.33x Finding
The headline result: agentic workflows consumed 888.1 joules per successful goal on average, compared to 205.3 J for linear baselines. That's a 4.33x overhead. The paper also introduces an Orchestration Overhead Index (OOI) that isolates orchestration costs from inference costs.
The nuance is important. For tool-augmented tasks, OOI fell below 1.0 - meaning agentic execution can be more efficient than linear execution when tools offload expensive compute steps. The overhead driver isn't the LLM calls themselves. It's the orchestration: the retries, the routing decisions, the failure handling.
Energy accounting for AI needs a new unit of measurement - goal-level tracking shows costs that inference-level billing never shows.
Source: unsplash.com
What This Means for Teams Building Agents
Infrastructure teams currently get per-token costs from their API providers. That number is accurate for single-turn workloads. For multi-step agents - anything involving planning, tool use, or retries - it's systematically misleading. A workflow that completes goals reliably might be cheaper than one with a lower per-inference cost but a higher retry rate. EpG surfaces that difference; per-inference billing hides it.
The paper's reproducibility protocol binds measurements to hardware and runtime configurations, which is necessary groundwork for this to become an industry standard. Whether cloud providers will expose goal-level energy accounting is a different question. The metric itself is sound.
For more context on sustainable AI infrastructure, see our earlier coverage of alignment gaps and greener LLMs.
Poisoned Memories: Detecting What Slipped Through
Memory-augmented agents are increasingly the default for long-horizon tasks. The attack surface that comes with persistent memory stores hasn't received proportional attention - until now.
Zhewen Tan and eleven co-authors describe MemAudit, a post-hoc auditing framework for detecting poisoned records in agent memory. The adversarial model is realistic: attackers inject malicious memories through normal interactions, records that look legitimate but corrupt the agent's future behavior. Existing defenses try to block injections at runtime. MemAudit takes a different approach - auditing the memory store after suspicious behavior surfaces.
How the Attack Works
The paper evaluates against MINJA, one of the more documented memory injection vectors. An attacker interacts with an agent through ordinary-seeming queries and plants records that redirect future responses. The agent hasn't been modified; its retrieval mechanism just keeps pulling from a store that's been quietly corrupted.
A memory store that looks clean isn't necessarily clean - MemAudit shows that post-hoc causal analysis can find what runtime filters miss.
Dual-Signal Detection
MemAudit uses two signals together. The first is counterfactual influence scoring: for each stored memory, the framework simulates what the agent would have produced without that record and measures the delta against the observed harmful output. High-influence memories in the direction of harm are flagged.
The second signal is a memory consistency graph: a structural analysis that identifies records anomalous within the coherence patterns of the legitimate memory store. Poisoned memories, injected through adversarial queries, tend to sit oddly in the graph topology of organically accumulated experience.
Memory injection attacks work through normal-looking interactions - post-hoc auditing catches what real-time defenses miss.
Source: unsplash.com
Against MINJA, the results are clean: QA task attack success dropped from 70% to 0%. Reasoning agents using the RAP framework fell from 83.3% to 0%. Both signals together beat either alone.
The limitation is the post-hoc framing - MemAudit catches poisoned memories after bad behavior manifests, not before. For high-stakes deployments that's still a meaningful capability: you can audit after an incident rather than only relying on prevention. If you're working with persistent agent memory, this pairs well with our earlier analysis of memory architecture tradeoffs in agents.
Transformers Have Ceilings - and They're Calculable
The third paper comes from Dongxin Guo at the University of Hong Kong and makes a claim that sounds theoretical but has concrete pre-deployment consequences: transformer architectures have hard accuracy ceilings that can be computed from the model's structure before training begins.
Guo calls this the Deterministic Horizon - a critical reasoning depth past which no additional training improves performance. The mechanism is information-theoretic: the residual stream has finite capacity, and once reasoning chains exceed the horizon, accuracy decays super-exponentially. The horizon is set by layer count and embedding width, not by training data or loss function.
Measuring the Horizon
Across 12 transformer architectures, the measured horizon fell between 19 and 31. The paper catalogs 16 computable specifications covering different capability domains - modular exponentiation, misspecified preference learning, retrieval pipeline staging, and zero-knowledge inference overhead. Each specification provides a computable boundary, quantified violation costs, and design rules.
One practically useful result: models can recover to within 4% of their theoretical ceiling through fine-tuning on ideal-length reasoning traces. That suggests the ceiling isn't purely architectural - training distribution mismatch at depth is part of the story. You can get close to the ceiling; you can't push past it.
Using This Before You Deploy
The direct application is a pre-deployment sanity check. Before you commit to an architecture, compute its horizon. If your target use case requires reasoning chains longer than the horizon supports, adding more parameters won't fix it. You need a different architecture or a different decomposition of the problem. Teams running agentic AI benchmarks that involve multi-step reasoning should pay attention to this: the benchmark scores you're seeing may be capped by architecture, not by training budget.
The 110-190x overhead for zero-knowledge neural inference is a separate finding buried in the paper's appendices - relevant for anyone exploring privacy-preserving inference, where that cost differential is the current state of the art.
The Common Thread
Energy accounting, memory security, and architectural limits look like unrelated problems. They share a diagnosis: the metrics and assumptions designed for single-turn model evaluation don't transfer to production agents. EpG replaces a misleading efficiency metric. MemAudit addresses a threat model that runtime defenses leave open. The Deterministic Horizon gives teams a pre-deployment measurement that didn't exist before.
For anyone building agents rather than benchmarking models, all three papers belong on the reading list. See our guide to understanding what AI agents are for background on the deployment patterns these papers address.
Sources:
- Energy per Successful Goal: Goal-Level Energy Accounting for Agentic AI Systems - arXiv:2605.22883
- MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection - arXiv:2605.23723
- The Deterministic Horizon: Impossibility Results as Design Specifications for Trustworthy AI Systems - arXiv:2605.23024
