mecha-core 0.1.16

//! How big the *next* request will be, from what the last one actually cost.
//!
//! `compact_at` is checked between turns against `prompt_tokens` — the size
//! the provider reported for the previous request. By the time that check
//! runs, the loop has already appended the assistant turn and a batch of tool
//! results that nobody has priced. So the reading the decision is made from
//! describes a message list that is one turn out of date, and the gap is
//! exactly the failure the overflow-recovery arm exists to catch: *"a turn's
//! parallel tool results land all at once, so the size checked between turns
//! can sit well under the limit while the next request is well over."*
//!
//! `docs/GOAL-SYSTEM-DESIGN.md` §4.4 calls that a control problem solved with
//! a constant, and proposes predicting the next size from an observed growth
//! rate. Building it corrected that in one useful way: **there is nothing to
//! extrapolate.** The un-priced tail is sitting in `messages` and can be
//! measured; all that is missing is the conversion to tokens, and the provider
//! re-supplies that every turn by pricing a list whose size we know. So the
//! prediction is arithmetic on two measurements, with no tuned parameter and
//! no model call — which §7.4 requires, since anticipatory appraisal that
//! costs an inference is a tax on every turn.
//!
//! ## The delta form, and why not a ratio
//!
//! A request costs `a + r·bytes`, where `a` is the system prompt and the tool
//! specs — constant within a run and *not* in the message list. Predicting
//! with the cumulative ratio `tokens/bytes` would smear `a` across the bytes
//! and over-predict as the transcript grows. Anchoring instead on the last
//! real measurement and adding only the marginal cost of what changed since
//! removes `a` from the arithmetic entirely, because it is in the anchor.
//!
//! `r` is measured between the last two observations and **clamped into the
//! band a real tokenizer can occupy** — never below the plain-text rate, never
//! above one token per byte, and not measured at all from a delta too small to
//! be a sample. The floor covers content that is genuinely cheap per byte
//! (repeated characters, whitespace-heavy tool output); the ceiling covers
//! everything that puts tokens on the numerator with no bytes on the
//! denominator, which is the larger hazard and the one that bites in both
//! directions. See `MAX_TOKENS_PER_BYTE`.
//!
//! Note what the ceiling is *not* for: an arriving image. `message_bytes`
//! excludes image payloads, so an image does not produce the cheap-per-byte
//! shape at all — it produces the opposite one, a large token delta over
//! almost no bytes, which is the ceiling's business rather than the floor's.
//!
//! ## Monotonicity, and the one place it looks violated
//!
//! §7.3: a disposition may only narrow. *"Anxiety may compact early; relief
//! may never compact late."* So [`ContextTracker::over`] is `reported ||
//! predicted` and never `predicted` alone: no state of this type can make
//! compaction fire later than the reactive check alone would.
//!
//! The exception is [`ContextTracker::invalidate`], and it is not one. A
//! reported size is a measurement *of a particular message list*. When
//! eviction or thinning rewrites that list, the number is no longer a reading
//! of anything — the transcript it described does not exist. Continuing to
//! honour it is not caution, it is arithmetic about a deleted object. So a
//! rewrite marks it stale and the prediction becomes the only reading there
//! is, until the provider prices the new list and supplies a real one.
//!
//! ## Known: the series does not cross a run boundary
//!
//! A tracker is created per `run_in`, so in `mecha chat` and the TUI — where
//! one submission is one run — it starts empty on every user turn. On the
//! first iteration of a run there is no anchor, so `over` is false whatever
//! the transcript weighs, and a conversation that grew through user turns, or
//! a resumed session already near the window, still discovers the overflow by
//! being refused.
//!
//! Left as it is deliberately, and it is not a regression: `prompt_tokens`
//! reset at exactly the same boundary before this existed. Closing it means
//! bundling the series with `Conversation`, the way taint is bundled — keep
//! the history and you keep what was learned about it — and that needs an
//! answer for the `/model` switch first, because an anchor is a measurement
//! under one tokenizer and one tool surface and means nothing under another.
//! That is a design decision about where the state lives, not a fix.
//!
//! The loop already assumed exactly this: after eviction freed something it
//! `continue`s, meaning to *"give it a turn to take effect before paying for a
//! summary."* That has never worked — `prompt_tokens` is assigned in one place,
//! after a response, so the re-entered check saw the same stale value, the
//! three passes returned zero the second time (they are idempotent, with tests
//! saying so), and the summary was paid for anyway one iteration later. The
//! intent needed a reading the reactive check structurally cannot produce
//! without spending a request. This is that reading.

use crate::message::{Block, Message};

/// Bytes per token for ordinary prose, and the floor on the measured rate.
///
/// The same constant `ToolsConfig::resolved_output_budget` converts with, kept
/// at that value on purpose: the two are estimating the same quantity from
/// opposite ends, and a budget that thinks results cost 3 bytes a token beside
/// a predictor that thinks they cost 4 is two answers to one question.
pub const BYTES_PER_TOKEN: f64 = 3.0;

/// Hard ceiling on the measured rate: **no tokenizer emits more than one token
/// per byte**, because a token is at least one byte.
///
/// So an apparent rate above this is not a property of the text — it is the
/// delta measuring something that is not in the message list at all. That
/// happens: `a` is only *approximately* constant within a run. The tool specs
/// move when a skill narrows the surface or the phase changes, cache
/// accounting shifts between turns, and a failover answers with a different
/// tokenizer. Any of those puts tokens on the numerator with no bytes on the
/// denominator.
///
/// Without the ceiling that is unbounded, and it breaks in both directions.
/// Measured on a probe: `observe(49_000, 149_960)` then `observe(50_000,
/// 150_000)` is a 40-byte delta against 1,000 tokens — `r` of 25 — after which
/// an ordinary 12 KB tool result predicts 350,000 tokens on a transcript
/// really near 54k, buying a summary request and a lossy rewrite for nothing.
/// The same inflated rate then *under*-predicts once the free passes shave 2 KB
/// off: the predicted saving is 50,000 tokens, the prediction lands at zero,
/// and a transcript the provider had just priced at 50,000 skips its summary
/// and goes out oversized. The second direction is the dangerous one, and it
/// is why this is a clamp rather than a warning.
const MAX_TOKENS_PER_BYTE: f64 = 1.0;

/// Below this, an inter-turn delta is noise rather than a sample.
///
/// A turn can move very few message bytes — a `todo` call and a one-line
/// result — while the priced total moves for reasons above. Dividing by a tiny
/// denominator turns that into an arbitrarily large rate, so a short delta
/// does not get a vote and the floor stands in until a real one arrives.
const MIN_SAMPLE_BYTES: f64 = 512.0;

#[derive(Debug, Clone, Copy, PartialEq)]
struct Observation {
    tokens: u64,
    bytes: usize,
}

/// The size series for one conversation. In memory only; nothing is stored.
#[derive(Debug, Clone, Default)]
pub struct ContextTracker {
    /// Newest last, capped at [`RECENT`].
    ///
    /// Two would do for the prediction — it needs one anchor and one delta —
    /// but [`ContextTracker::forecast`] answers "how many turns of headroom is
    /// that", and a single turn is a terrible estimate of a run's pace. The
    /// turn that read one file and the turn that read eight differ by an order
    /// of magnitude, and the model is being asked to decide *between steps*,
    /// which is precisely where the last turn is least representative of the
    /// next one.
    recent: std::collections::VecDeque<Observation>,
    /// The newest entry describes a message list that has since been rewritten.
    stale: bool,
    peak_tokens: u64,
    /// What the anchor was measured under. See [`ContextTracker::carry_into`].
    surface: Option<u64>,
}

/// How many observations the pace is averaged over.
const RECENT: usize = 5;

/// What the model is told, when it asks its plan a question.
///
/// Every field is a **measurement or arithmetic on measurements** — nothing
/// here asks a model to estimate its own token use, which is a thing models
/// are bad at and which would put the least reliable number in the most
/// load-bearing place. The one judgement left is the one the model is
/// genuinely better at: how much of its own plan remains.
#[derive(Debug, Clone, Copy, PartialEq)]
pub struct Forecast {
    /// What the next request is predicted to cost — **excluding the results
    /// of the turn now being executed**.
    ///
    /// The prediction closes one lag and cannot close the other. Reported
    /// usage is a turn out of date, because the provider prices a request
    /// after it is sent; adding the transcript bytes since that measurement
    /// fixes that, which is what this type is for. But the number is handed
    /// *into* `run_tools` so the `todo` result can carry it to the model, so
    /// it is consumed by the very call that produces the results it would
    /// need to include. A reading that waited for them would arrive a turn
    /// later, which is the same lag moved rather than removed.
    ///
    /// Left understated rather than padded with the turn's output budget: the
    /// budget is an upper bound a turn rarely reaches, and inflating every
    /// reading by it would trade a small, well-understood undercount for a
    /// large invented one on the number the model plans against. So the
    /// contract is *at least this much has been used*, and the caller that
    /// renders it says "recent turns cost about X" rather than promising a
    /// total.
    pub used: u64,
    /// The ceiling being measured against — the compaction threshold when
    /// there is one, else the context window.
    pub limit: u64,
    /// `limit - used`, floored at zero.
    pub headroom: u64,
    /// Mean growth per turn across the recent window, when there is more than
    /// one observation to difference.
    pub per_turn: Option<u64>,
    /// `headroom / per_turn`. `None` when the pace is unknown or zero — a run
    /// that has not grown has no meaningful number of turns left, and
    /// reporting a huge one would be a lie in the reassuring direction.
    pub turns_left: Option<u64>,
}

impl std::fmt::Display for Forecast {
    /// One line, and deliberately a statement of fact with no instruction in
    /// it. The model is being told what is true, not what to do about it —
    /// §16's caution is that exposing a resource number invites reasoning
    /// about resource use, and an imperative would guarantee it.
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        let pct = if self.limit > 0 {
            (self.used as f64 / self.limit as f64 * 100.0).round() as u64
        } else {
            0
        };
        write!(
            f,
            "context: {}k of {}k before compaction ({pct}%)",
            self.used / 1000,
            self.limit / 1000
        )?;
        // **Both halves from the same number, or the line argues with
        // itself.** The cost was rounded to whole thousands and floored at
        // one, while the turn count came from the true rate — so at a pace of
        // 400 with 89.6k of headroom the model read "~1k each, so about 224
        // more" against a stated 100k limit, where 224 × 1k is more than twice
        // the whole budget. A reading the model is asked to plan against has
        // to survive being multiplied out, so a sub-1k pace is printed in
        // tokens rather than rounded up to a thousand it is not.
        //
        // `(Some(rate), None)` is deliberately absent: `turns_left` is
        // `per_turn.map(...)`, so it is `Some` whenever the rate is, and an
        // arm for a state that cannot occur reads as a handled case and would
        // quietly go stale if that derivation ever changed.
        match (self.per_turn, self.turns_left) {
            (Some(rate), Some(turns)) if rate >= 1000 => write!(
                f,
                "; recent turns cost ~{}k each, so about {turns} more at this pace",
                rate / 1000
            ),
            (Some(rate), Some(turns)) => write!(
                f,
                "; recent turns cost ~{rate} tokens each, so about {turns} more at this pace"
            ),
            _ => Ok(()),
        }
    }
}

/// What a request looks like apart from its messages: the model, the system
/// prompt, and the tool surface.
///
/// An anchor is a token count for a byte count *under a particular one of
/// these*, and it means nothing under another — a different tokenizer prices
/// the same transcript differently, and a narrowed tool surface changes the
/// constant part of every request. Hashed rather than held so the tracker
/// stays a handful of integers.
pub fn surface_fingerprint<'a>(
    model: &str,
    system: Option<&str>,
    tools: impl Iterator<Item = &'a str>,
) -> u64 {
    use std::hash::{Hash, Hasher};
    let mut h = std::collections::hash_map::DefaultHasher::new();
    model.hash(&mut h);
    system.hash(&mut h);
    for name in tools {
        name.hash(&mut h);
    }
    h.finish()
}

impl ContextTracker {
    pub fn new() -> ContextTracker {
        ContextTracker::default()
    }

    /// Carry the series into a new run, or start clean if the request shape
    /// changed underneath it.
    ///
    /// The series lives on the `Conversation` rather than on the run, for the
    /// reason taint does: it is a fact about the messages, and bundling it with
    /// them makes the right thing the default. It matters because in `mecha
    /// chat` and the TUI **one submission is one run** — so a per-run tracker
    /// started empty on every user turn, and the first request of each turn
    /// went out unpredicted however heavy the transcript was.
    ///
    /// The reset is the other half. An anchor is a measurement under one
    /// model, one system prompt and one tool surface; `/model` replaces all
    /// three and would leave the next prediction extrapolating from a
    /// tokenizer that is no longer answering. Discarding is the only safe
    /// response — there is nothing to convert it *to* — and it costs one
    /// unpredicted turn, which is exactly what every run cost before.
    ///
    /// Not fixed by this: a session resumed from disk starts unanchored,
    /// because a transcript records what runs *cost in total* and never what
    /// the last request weighed. It predicts from its second turn on.
    pub fn carry_into(&mut self, surface: u64) {
        if self.surface != Some(surface) {
            *self = ContextTracker {
                surface: Some(surface),
                ..ContextTracker::default()
            };
        }
    }

    /// Record what the provider charged for a list of a known size.
    pub fn observe(&mut self, tokens: u64, bytes: usize) {
        if self.recent.len() == RECENT {
            self.recent.pop_front();
        }
        self.recent.push_back(Observation { tokens, bytes });
        self.stale = false;
        self.peak_tokens = self.peak_tokens.max(tokens);
    }

    fn last(&self) -> Option<Observation> {
        self.recent.back().copied()
    }

    fn prev(&self) -> Option<Observation> {
        let n = self.recent.len();
        (n >= 2).then(|| self.recent[n - 2])
    }

    /// The transcript was rewritten under the last reading, so it is no longer
    /// a reading of it. See the module docs — this is the one thing here that
    /// can move a decision *later*, and it does so by discarding a number
    /// about a message list that no longer exists rather than by overriding a
    /// live one.
    pub fn invalidate(&mut self) {
        self.stale = true;
    }

    /// The last measured prompt size, or `None` when there is not one that
    /// describes the current transcript.
    pub fn reported(&self) -> Option<u64> {
        (!self.stale).then_some(self.last()?.tokens)
    }

    /// The largest prompt this run ever actually sent. A measurement
    /// throughout — never a prediction — because it is recorded, and a
    /// recorded estimate is indistinguishable from a recorded fact later.
    pub fn peak_tokens(&self) -> u64 {
        self.peak_tokens
    }

    /// Marginal tokens per byte, from the last inter-turn delta, clamped into
    /// the band any real tokenizer can occupy.
    ///
    /// Both bounds fail toward predicting *more*, which is the side that
    /// compacts early — except the ceiling, which also bounds how large a
    /// saving a rewrite may be credited with, and that is the direction a
    /// missing bound skips a summary that was needed.
    fn tokens_per_byte(&self) -> f64 {
        let floor = 1.0 / BYTES_PER_TOKEN;
        let (Some(last), Some(prev)) = (self.last(), self.prev()) else {
            return floor;
        };
        let d_bytes = last.bytes as f64 - prev.bytes as f64;
        let d_tokens = last.tokens as f64 - prev.tokens as f64;
        if d_bytes < MIN_SAMPLE_BYTES || d_tokens <= 0.0 {
            return floor;
        }
        (d_tokens / d_bytes).clamp(floor, MAX_TOKENS_PER_BYTE)
    }

    /// What a request carrying `bytes` of messages would cost.
    ///
    /// `None` before the first response: with no anchor there is no
    /// measurement to extrapolate from, and a guess made entirely of constants
    /// would be a tuned parameter wearing a prediction's clothes.
    pub fn predict(&self, bytes: usize) -> Option<u64> {
        let last = self.last()?;
        let delta = (bytes as f64 - last.bytes as f64) * self.tokens_per_byte();
        Some((last.tokens as f64 + delta).max(0.0) as u64)
    }

    /// Is a transcript of this size due a compaction?
    ///
    /// `reported || predicted`, in that order and never the prediction alone.
    /// That spelling is the monotonicity guarantee in one line: whatever this
    /// type believes, it can only ever add a reason to compact.
    pub fn over(&self, limit: u64, bytes: usize) -> bool {
        self.reported().is_some_and(|t| t >= limit)
            || self.predict(bytes).is_some_and(|t| t >= limit)
    }

    /// How many bytes of tool output the next turn can take before the
    /// transcript crosses `limit`.
    ///
    /// The other half of §4.4's cliff-to-gradient: the compaction threshold
    /// decides *when* to summarise, and this decides how much a single turn is
    /// allowed to add in the first place. They serve one constraint —
    /// `resolved_output_budget`'s docstring already states it — that "one
    /// turn's results must not leap the gap between the threshold and the
    /// window itself". That budget sizes the gap from the *window*, once, at
    /// startup. This sizes it from where the transcript actually is.
    ///
    /// Converted at the measured rate rather than the floor, which is the
    /// conservative direction: a higher rate buys fewer bytes.
    ///
    /// `None` before the first response, where there is no anchor and so no
    /// claim worth making.
    pub fn affordable_output_bytes(&self, limit: u64, current_bytes: usize) -> Option<usize> {
        let predicted = self.predict(current_bytes)?;
        let room = limit.saturating_sub(predicted) as f64;
        Some((room / self.tokens_per_byte()) as usize)
    }

    /// What the model is shown when it looks at its plan.
    ///
    /// `None` before the first response — with no anchor there is no reading,
    /// and inventing one would put a guess where the whole point is that every
    /// number is measured.
    ///
    /// The pace is the mean growth across the recent window, not the last
    /// turn's: a run alternates cheap turns and expensive ones, and the model
    /// is deciding *between plan steps*, which is exactly where one turn is
    /// least representative of the next.
    pub fn forecast(&self, limit: u64, current_bytes: usize) -> Option<Forecast> {
        let used = self.predict(current_bytes)?;
        let headroom = limit.saturating_sub(used);

        // Growth per turn, over the differences the window actually holds.
        // A rewrite inside the window makes a difference negative; those are
        // dropped rather than clamped, because a compaction is not a turn
        // that cost nothing — it is a turn whose cost is not this measure's
        // to report, and averaging a zero in would understate the pace.
        let steps: Vec<u64> = self
            .recent
            .iter()
            .zip(self.recent.iter().skip(1))
            .filter_map(|(a, b)| b.tokens.checked_sub(a.tokens))
            .filter(|d| *d > 0)
            .collect();
        let per_turn = (!steps.is_empty())
            .then(|| steps.iter().sum::<u64>() / steps.len() as u64)
            .filter(|rate| *rate > 0);

        Some(Forecast {
            used,
            limit,
            headroom,
            per_turn,
            // No pace, no estimate. A run that has not grown has no
            // meaningful number of turns left, and reporting an enormous one
            // would be a lie in the reassuring direction.
            turns_left: per_turn.map(|rate| headroom / rate),
        })
    }

    /// Share of the window the largest request used, for the record.
    pub fn peak_pressure(&self, window: Option<u64>) -> Option<f32> {
        let window = window.filter(|w| *w > 0)?;
        (self.peak_tokens > 0).then(|| self.peak_tokens as f32 / window as f32)
    }
}

/// Size of a message list, for the purpose of tracking how it *changes*.
///
/// Image payloads are deliberately excluded. Base64 is enormous per token —
/// llama-server tiles an image to a fixed count regardless of its size, and a
/// 5.7 MB screenshot and its 179 KB re-encoding both priced at 294 tokens — so
/// counting those bytes would say a turn grew by megabytes when it grew by a
/// few hundred tokens. The cost is real and it is already in the anchor, which
/// is a measurement of the whole request; what this walk has to track is the
/// part that grows every turn, which is text.
pub fn message_bytes(messages: &[Message]) -> usize {
    messages
        .iter()
        .flat_map(|m| &m.content)
        .map(|b| match b {
            Block::Text { text } => text.len(),
            Block::Thinking { text, signature } => {
                text.len() + signature.as_ref().map_or(0, String::len)
            }
            // `input` is a `Value`; its rendered length is what goes on the
            // wire, and a tool call's arguments can be most of a turn.
            Block::ToolUse { id, name, input } => id.len() + name.len() + input.to_string().len(),
            Block::ToolResult {
                tool_use_id,
                content,
                ..
            } => tool_use_id.len() + content.len(),
            // `data` excluded, `source` counted: it is a file path the
            // model reads, and it is the only part of an image block whose
            // length says anything about how much text is on the wire.
            Block::Image {
                media_type, source, ..
            } => media_type.len() + source.as_ref().map_or(0, String::len),
        })
        .sum()
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::message::{Role, Usage};

    fn msg(text: &str) -> Message {
        Message {
            role: Role::User,
            content: vec![Block::text(text)],
        }
    }

    #[test]
    fn with_no_measurement_there_is_no_prediction() {
        let t = ContextTracker::new();
        assert_eq!(t.predict(10_000), None);
        assert!(!t.over(1, 10_000), "and nothing to compact on");
    }

    /// The anchor carries the system prompt and the tool specs, which are not
    /// in the message list. A cumulative ratio would smear them across the
    /// bytes; the delta form must not.
    #[test]
    fn the_prediction_anchors_on_the_last_real_measurement() {
        let mut t = ContextTracker::new();
        // 1,000 bytes of messages priced at 2,000 tokens: 1,700 of that is a
        // system prompt and tool specs the message list does not contain.
        t.observe(2_000, 1_000);
        // 300 more bytes of prose is ~100 more tokens, not another 600 — which
        // is what `tokens/bytes = 2.0` scaled up would have claimed.
        assert_eq!(t.predict(1_300), Some(2_100));
    }

    #[test]
    fn a_measured_rate_inside_the_band_is_used_and_one_outside_it_is_not() {
        // Token-dense content: 900 bytes cost 450 tokens, twice the prose rate.
        let mut dense = ContextTracker::new();
        dense.observe(1_000, 1_000);
        dense.observe(1_450, 1_900);
        assert_eq!(dense.predict(2_900), Some(1_950), "0.5 tok/byte carried on");

        // Genuinely cheap per byte — a result that is mostly repeated
        // characters. Carrying that forward would under-predict the next
        // thousand bytes of prose, so the floor takes over. Deliberately not
        // an image: `message_bytes` excludes image payloads, so an image
        // cannot produce this shape.
        let mut cheap = ContextTracker::new();
        cheap.observe(1_000, 1_000);
        cheap.observe(1_010, 9_000);
        assert_eq!(cheap.predict(12_000), Some(2_010), "floored at 1/3");
    }

    /// The rate is a ratio, and a ratio with a tiny denominator is not a
    /// measurement. A turn can move almost no message bytes — a `todo` call
    /// and a one-line result — while the priced total moves for reasons that
    /// are not in the message list at all.
    #[test]
    fn a_delta_too_small_to_be_a_sample_does_not_set_the_rate() {
        let mut t = ContextTracker::new();
        t.observe(49_000, 149_960);
        t.observe(50_000, 150_000); // 40 bytes, 1,000 tokens
                                    // At the unguarded rate of 25 tok/byte this predicted 350,000.
        assert_eq!(t.predict(162_000), Some(54_000), "the floor, not 25x");
    }

    /// The hole the ceiling closes, and it is the dangerous direction: an
    /// inflated rate makes a small rewrite look like an enormous saving, and
    /// the summary that was due is skipped.
    #[test]
    fn an_impossible_rate_cannot_credit_a_rewrite_with_a_saving_it_did_not_make() {
        let mut t = ContextTracker::new();
        // A sample large enough to be believed, but priced at a rate no
        // tokenizer can produce — the shape a narrowed tool surface or a
        // failover to a different tokenizer leaves behind.
        t.observe(20_000, 100_000);
        t.observe(50_000, 101_000); // 1,000 bytes, 30,000 tokens → r = 30
        assert!(t.over(40_000, 101_000), "50,000 is over the limit");

        // The free passes shave 2 KB. At r = 30 that is a 60,000-token saving
        // and the prediction floors at zero, so the summary is skipped on a
        // transcript the provider had just priced at 50,000.
        t.invalidate();
        assert_eq!(
            t.predict(99_000),
            Some(48_000),
            "a 2 KB cut may be credited with at most 2,000 tokens"
        );
        assert!(
            t.over(40_000, 99_000),
            "so the summary is still taken, which is the point"
        );
    }

    /// The guarantee §7.3 asks for, stated as a property rather than as a
    /// comment: no state of this type makes compaction fire later than the
    /// reactive check alone.
    #[test]
    fn a_prediction_can_only_ever_add_a_reason_to_compact() {
        for (tokens, bytes, now) in [
            (100u64, 100usize, 100usize),
            (5_000, 10_000, 10_000),
            (5_000, 10_000, 1_000),
            (5_000, 10_000, 90_000),
        ] {
            let mut t = ContextTracker::new();
            t.observe(tokens, bytes);
            for limit in [1u64, 100, 4_999, 5_000, 5_001, 1_000_000] {
                let reactive = tokens >= limit;
                assert!(
                    !reactive || t.over(limit, now),
                    "reactive fired at limit {limit} and the tracker did not"
                );
            }
        }
    }

    /// What bounds the *other* side, where the property above does not reach.
    ///
    /// Once `invalidate` retires the reported size the prediction is the only
    /// reading, so nothing else stops it claiming a saving the rewrite did not
    /// make. The bound is the ceiling: a prediction may differ from its anchor
    /// by at most the byte change times one token per byte, in either
    /// direction. Written as a sweep including hostile observation pairs,
    /// because the version of this that only tested growth is the version that
    /// shipped the hole.
    #[test]
    fn the_predicted_change_is_bounded_by_the_byte_change() {
        let pairs = [
            (1_000u64, 1_000usize, 2_000u64, 2_000usize),
            (20_000, 100_000, 50_000, 101_000), // an impossible rate
            (49_000, 149_960, 50_000, 150_000), // a delta too small to sample
            (5_000, 50_000, 5_010, 90_000),     // very cheap per byte
            (5_000, 50_000, 4_000, 40_000),     // the transcript shrank
        ];
        for (t0, b0, t1, b1) in pairs {
            for now in [0usize, 1, 500, b1 / 2, b1, b1 + 10_000, 500_000] {
                let mut t = ContextTracker::new();
                t.observe(t0, b0);
                t.observe(t1, b1);
                for tracker in [&t, &{
                    let mut c = t.clone();
                    c.invalidate();
                    c
                }] {
                    let predicted = tracker.predict(now).unwrap() as f64;
                    let moved = (now as f64 - b1 as f64).abs() * MAX_TOKENS_PER_BYTE;
                    let anchor = t1 as f64;
                    assert!(
                        predicted <= anchor + moved + 1.0,
                        "{predicted} overshot {anchor} by more than {moved} bytes allow"
                    );
                    assert!(
                        predicted + 1.0 >= (anchor - moved).max(0.0),
                        "{predicted} undershot {anchor} by more than {moved} bytes allow"
                    );
                }
            }
        }
    }

    /// The deferral the loop has always meant to make and never could.
    #[test]
    fn a_rewrite_retires_the_reading_it_invalidated() {
        let mut t = ContextTracker::new();
        // Priced at the threshold: a summary is due.
        t.observe(21_000, 60_000);
        assert!(t.over(20_000, 60_000));

        // Eviction and thinning cut the transcript in half. The reported size
        // still says 21,000, and it is now a fact about a message list that no
        // longer exists.
        t.invalidate();
        assert_eq!(t.reported(), None, "a rewritten list has no measured size");
        assert!(
            !t.over(20_000, 30_000),
            "the free passes freed enough; the summary is not paid for"
        );
        // But the anchor is not thrown away — it is still the only real
        // measurement, and the next turn is predicted from it.
        assert_eq!(t.predict(30_000), Some(11_000));
        // And a rewrite that freed too little still compacts.
        assert!(t.over(20_000, 58_000));
    }

    /// The gap this closes: one submission is one run in chat and the TUI, so
    /// a per-run series was empty at the top of every turn.
    #[test]
    fn the_series_survives_a_run_boundary_under_the_same_surface() {
        let surface =
            surface_fingerprint("opus", Some("be helpful"), ["fs_read", "shell"].into_iter());
        let mut t = ContextTracker::new();
        t.carry_into(surface);
        t.observe(50_000, 150_000);

        // Next run, same everything.
        t.carry_into(surface);
        assert_eq!(t.reported(), Some(50_000), "the anchor is still there");
        assert_eq!(t.predict(153_000), Some(51_000), "and still predicts");
    }

    /// And is discarded when it would be extrapolating from a tokenizer that
    /// is no longer answering.
    #[test]
    fn a_changed_request_shape_discards_the_anchor_rather_than_converting_it() {
        let base = ["fs_read", "shell"];
        let before = surface_fingerprint("opus", Some("be helpful"), base.into_iter());
        let mut t = ContextTracker::new();
        t.carry_into(before);
        t.observe(50_000, 150_000);

        for after in [
            surface_fingerprint("haiku", Some("be helpful"), base.into_iter()),
            surface_fingerprint("opus", Some("be terse"), base.into_iter()),
            surface_fingerprint("opus", Some("be helpful"), ["fs_read"].into_iter()),
        ] {
            let mut switched = t.clone();
            switched.carry_into(after);
            assert_eq!(switched.reported(), None, "the anchor is gone");
            assert_eq!(switched.predict(153_000), None, "not converted, discarded");
            assert_eq!(switched.peak_tokens(), 0, "and the run's peak with it");
        }
    }

    #[test]
    fn a_fresh_measurement_ends_the_staleness() {
        let mut t = ContextTracker::new();
        t.observe(21_000, 60_000);
        t.invalidate();
        t.observe(9_000, 30_000);
        assert_eq!(t.reported(), Some(9_000));
    }

    #[test]
    fn the_peak_is_the_largest_request_actually_sent() {
        let mut t = ContextTracker::new();
        t.observe(1_000, 1_000);
        t.observe(9_000, 9_000);
        t.observe(4_000, 4_000);
        assert_eq!(t.peak_tokens(), 9_000, "not the last, and not the current");
        assert_eq!(t.peak_pressure(Some(36_000)), Some(0.25));
        assert_eq!(t.peak_pressure(None), None, "no window, no fraction");
        assert_eq!(
            ContextTracker::new().peak_pressure(Some(100)),
            None,
            "and a run that sent nothing has no pressure, rather than zero"
        );
    }

    #[test]
    fn what_a_turn_can_afford_shrinks_as_the_transcript_grows() {
        let mut t = ContextTracker::new();
        t.observe(10_000, 30_000); // 1/3 tok per byte

        // 20,000 tokens of room, at 3 bytes a token, is 60,000 bytes.
        assert_eq!(t.affordable_output_bytes(30_000, 30_000), Some(60_000));
        // Closer to the threshold, less is affordable — the gradient the flat
        // budget cannot express.
        assert_eq!(t.affordable_output_bytes(12_000, 30_000), Some(6_000));
        // Past it, nothing is: the compaction check has already fired.
        assert_eq!(t.affordable_output_bytes(9_000, 30_000), Some(0));
        // And with no anchor there is no claim.
        assert_eq!(
            ContextTracker::new().affordable_output_bytes(30_000, 30_000),
            None
        );
    }

    /// A denser measured rate buys *fewer* bytes, which is the direction that
    /// keeps the turn inside the gap rather than the one that flatters it.
    #[test]
    fn a_denser_rate_affords_less() {
        let mut dense = ContextTracker::new();
        dense.observe(10_000, 30_000);
        dense.observe(20_000, 40_000); // 10k tokens over 10k bytes → r = 1.0
        let dense_room = dense.affordable_output_bytes(30_000, 40_000).unwrap();

        let mut prose = ContextTracker::new();
        prose.observe(10_000, 30_000);
        prose.observe(20_000, 60_000); // r floors at 1/3
        let prose_room = prose.affordable_output_bytes(30_000, 60_000).unwrap();

        assert!(
            dense_room < prose_room,
            "dense {dense_room} should afford less than prose {prose_room}"
        );
    }

    #[test]
    fn the_forecast_is_arithmetic_on_measurements() {
        let mut t = ContextTracker::new();
        // Four turns costing 10k, 4k, 6k and 8k more than the one before.
        for (tok, by) in [
            (10_000u64, 30_000usize),
            (20_000, 60_000),
            (24_000, 72_000),
            (30_000, 90_000),
            (38_000, 114_000),
        ] {
            t.observe(tok, by);
        }
        let f = t.forecast(100_000, 114_000).unwrap();
        assert_eq!(f.used, 38_000);
        assert_eq!(f.headroom, 62_000);
        // (10 + 4 + 6 + 8) / 4 = 7k a turn.
        assert_eq!(f.per_turn, Some(7_000));
        assert_eq!(f.turns_left, Some(8));
    }

    /// A run that has not grown has no pace, and therefore no number of turns
    /// left — reporting an enormous one would be a lie in the reassuring
    /// direction, which is the null-run bug in a new place.
    #[test]
    fn no_growth_means_no_estimate_rather_than_a_large_one() {
        let mut t = ContextTracker::new();
        t.observe(10_000, 30_000);
        t.observe(10_000, 30_000);
        let f = t.forecast(100_000, 30_000).unwrap();
        assert_eq!(f.per_turn, None);
        assert_eq!(f.turns_left, None);
        assert_eq!(f.headroom, 90_000, "the headroom is still a fact");

        assert!(
            ContextTracker::new().forecast(100_000, 30_000).is_none(),
            "and with nothing measured there is no forecast at all"
        );
    }

    /// A compaction inside the window is not a turn that cost nothing.
    #[test]
    fn a_rewrite_inside_the_window_does_not_flatten_the_pace() {
        let mut t = ContextTracker::new();
        t.observe(10_000, 30_000);
        t.observe(20_000, 60_000); // +10k
        t.observe(6_000, 18_000); // a summary landed
        t.observe(16_000, 48_000); // +10k
        let f = t.forecast(100_000, 48_000).unwrap();
        assert_eq!(
            f.per_turn,
            Some(10_000),
            "the two real steps, not averaged with the drop"
        );
    }

    /// **A slow-growing run reports a cost, and the two halves of the line
    /// agree with each other.**
    ///
    /// `rate.max(1) / 1000` reads as the guard against "~0k each" and is not
    /// one: the rate is already filtered to `> 0`, and every rate under 1000
    /// divides to zero. Flooring the *printed* cost at "~1k" fixed the free
    /// turn and bought a worse defect — the turn count kept coming from the
    /// true rate, so the line said "~1k each, so about 224 more" against a
    /// stated 100k limit, and 224 × 1k is more than twice the whole budget.
    ///
    /// The first version of this test pinned only the "~1k" half and would
    /// have gone on passing. A number the model is asked to plan against has
    /// to survive being multiplied out, so that is what is asserted.
    #[test]
    fn a_sub_1k_growth_rate_reads_as_a_cost_the_turn_count_agrees_with() {
        let mut t = ContextTracker::new();
        t.observe(10_000, 30_000);
        t.observe(10_400, 31_000);
        let f = t.forecast(100_000, 31_000).unwrap();
        assert_eq!(f.per_turn, Some(400), "the rate under test is sub-1k");
        let line = f.to_string();
        assert!(
            line.contains("~400 tokens each"),
            "a sub-1k pace is printed as itself, not rounded to a thousand it is \
             not: {line}"
        );
        assert!(!line.contains("~0k"), "and never as free: {line}");

        // The consistency the rounding broke: whatever cost the line states,
        // times the turns it promises, must not exceed the headroom it also
        // states. Fails on `(rate / 1000).max(1)`, where 224 × 1000 = 224k
        // against 89.6k of headroom.
        let turns = f.turns_left.expect("a known pace gives a turn count");
        assert!(
            f.per_turn.unwrap() * turns <= f.headroom,
            "the line promises {turns} turns at {} each, which is more than the \
             {} of headroom it states in the same breath",
            f.per_turn.unwrap(),
            f.headroom
        );
    }

    #[test]
    fn the_line_the_model_reads_states_facts_and_asks_for_nothing() {
        let mut t = ContextTracker::new();
        t.observe(10_000, 30_000);
        t.observe(40_000, 120_000);
        let line = t.forecast(100_000, 120_000).unwrap().to_string();
        assert_eq!(
            line,
            "context: 40k of 100k before compaction (40%); recent turns cost \
             ~30k each, so about 2 more at this pace"
        );
        // No imperative anywhere: the model is told what is true and left to
        // decide, which is what keeps this a reading rather than a nudge.
        for word in ["should", "must", "consider", "prefer", "avoid"] {
            assert!(!line.contains(word), "the line instructs: {line}");
        }
    }

    #[test]
    fn image_payloads_are_not_counted_as_growth() {
        let text = vec![msg("hello")];
        let with_image = vec![Message {
            role: Role::User,
            content: vec![
                Block::text("hello"),
                Block::Image {
                    media_type: "image/png".into(),
                    data: "A".repeat(200_000),
                    source: None,
                },
            ],
        }];
        assert_eq!(message_bytes(&text), 5);
        assert_eq!(
            message_bytes(&with_image),
            5 + "image/png".len(),
            "the base64 is in the anchor, not in the growth"
        );
    }

    #[test]
    fn every_other_block_kind_counts_toward_the_size() {
        let m = vec![Message {
            role: Role::Assistant,
            content: vec![
                Block::Text { text: "ab".into() },
                Block::Thinking {
                    text: "cde".into(),
                    signature: Some("fg".into()),
                },
                Block::ToolUse {
                    id: "h".into(),
                    name: "ij".into(),
                    input: serde_json::json!({}),
                },
                Block::ToolResult {
                    tool_use_id: "k".into(),
                    content: "lmno".into(),
                    is_error: false,
                },
            ],
        }];
        // 2 + (3+2) + (1+2+2) + (1+4)
        assert_eq!(message_bytes(&m), 17);
    }

    /// Guards the one thing that could silently unhook the whole module: a
    /// `Usage` whose `total_input` stopped counting the cached tiers would
    /// make every observation an underestimate, and nothing here would notice.
    #[test]
    fn the_observed_size_is_the_whole_prompt_including_cache() {
        let u = Usage {
            input_tokens: 8,
            cache_creation_input_tokens: 1_000,
            cache_read_input_tokens: 17_000,
            ..Usage::default()
        };
        assert_eq!(u.total_input(), 18_008);
    }
}