<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Tokens on Loop &amp; Retry</title>
    <link>https://loopandretry.github.io/tags/tokens/</link>
    <description>Recent content in Tokens on Loop &amp; Retry</description>
    <image>
      <title>Loop &amp; Retry</title>
      <url>https://loopandretry.github.io/images/og-default.png</url>
      <link>https://loopandretry.github.io/images/og-default.png</link>
    </image>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 14 Jul 2026 05:00:00 -0400</lastBuildDate>
    <atom:link href="https://loopandretry.github.io/tags/tokens/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Your token bill is the cheap part: dimensioning the real cost of an agent</title>
      <link>https://loopandretry.github.io/posts/cost-beyond-tokens/</link>
      <pubDate>Tue, 14 Jul 2026 05:00:00 -0400</pubDate>
      <guid>https://loopandretry.github.io/posts/cost-beyond-tokens/</guid>
      <description>Everyone budgets the token bill because the provider hands you an invoice for it. But an agent in production spends across five other axes that never show up on that invoice — wall-clock latency, orchestration, tool-call fees, human review, and idle polling — and for a lot of workloads the tokens are the smallest line. A model that sums all six so you can see which one you&amp;rsquo;re actually paying.</description>
    </item>
    <item>
      <title>Why a long agent run costs O(N²) tokens — and how to flatten it</title>
      <link>https://loopandretry.github.io/posts/long-agent-runs-are-quadratic/</link>
      <pubDate>Mon, 13 Jul 2026 18:05:00 -0400</pubDate>
      <guid>https://loopandretry.github.io/posts/long-agent-runs-are-quadratic/</guid>
      <description>A naive agent&amp;rsquo;s token bill doesn&amp;rsquo;t grow with the number of steps — it grows with the square of them, because every step re-reads the whole transcript that every previous step appended to. A small cost model shows the curve, and four structural moves turn the quadratic back into something close to linear without dropping information the agent actually needs.</description>
    </item>
    <item>
      <title>The context window is a cache, not a memory</title>
      <link>https://loopandretry.github.io/posts/context-window-is-a-cache/</link>
      <pubDate>Tue, 07 Jul 2026 20:00:00 -0400</pubDate>
      <guid>https://loopandretry.github.io/posts/context-window-is-a-cache/</guid>
      <description>Treating the context window as append-only memory is how agents get slow, expensive, and quietly wrong. The fix is to run it like a cache with a budget and an eviction policy: decide what earns its tokens every turn. Here&amp;rsquo;s the cost math, the accuracy failure mode, and a working context manager.</description>
    </item>
    <item>
      <title>Retry budgets: why 20% per-step failure doubles your token bill</title>
      <link>https://loopandretry.github.io/posts/retry-budgets/</link>
      <pubDate>Sun, 05 Jul 2026 09:00:00 -0400</pubDate>
      <guid>https://loopandretry.github.io/posts/retry-budgets/</guid>
      <description>Retries feel cheap and local. In a multi-step agent they&amp;rsquo;re neither. A small cost model shows why 20% per-step failure can more than double your bill — and how your recovery architecture, not your failure rate, decides the multiplier.</description>
    </item>
  </channel>
</rss>
