tinyagents 2.1.0

A recursive language-model (RLM) harness for Rust.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
//! Type definitions for the durable observability layer.
//!
//! These types build on the live event vocabulary in
//! [`crate::harness::events`] to add **durability**: an envelope
//! ([`AgentObservation`]) that carries the run lineage and a timestamp so a
//! single event can be journaled, replayed, and correlated across a recursive
//! run tree; pluggable journal and status traits; and a set of
//! [`EventListener`] sinks that fan out, redact, and persist events.
//!
//! All public items here are re-exported through [`super`]. Trait
//! implementations, sink logic, and tests live in the sibling `mod.rs` and
//! `test.rs` files.

use std::collections::{HashMap, VecDeque};
use std::sync::{Arc, Mutex};

use async_trait::async_trait;
use serde::{Deserialize, Serialize};

use crate::error::Result;
use crate::harness::events::{AgentEvent, EventListener, HarnessRunStatus};
use crate::harness::ids::{CallId, EventId, RunId, now_ms};
use crate::harness::store::AppendStore;

use super::worker::AppendWorker;

// ---------------------------------------------------------------------------
// AgentObservation
// ---------------------------------------------------------------------------

/// A durable observability envelope around an [`AgentEvent`].
///
/// Where [`crate::harness::events::EventRecord`] is the lightweight,
/// in-process fan-out record (just id, offset, and event), an
/// `AgentObservation` adds everything a durable journal or external trace
/// needs to correlate the event without an in-memory broadcast: the run's
/// `run_id`, its `parent_run_id` / `root_run_id` lineage, the stream `offset`,
/// and a wall-clock `ts_ms` timestamp.
#[derive(Clone, Debug, PartialEq, Serialize, Deserialize)]
pub struct AgentObservation {
    /// Stable, unique identifier for the underlying event.
    pub event_id: EventId,

    /// The run that emitted the event.
    pub run_id: RunId,

    /// Parent run id when this run was spawned by another run (a sub-agent or
    /// graph node). `None` for top-level runs.
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub parent_run_id: Option<RunId>,

    /// Root ancestor run, equal to `run_id` for top-level runs.
    pub root_run_id: RunId,

    /// Monotonic position of the event within its run's stream.
    pub offset: u64,

    /// Wall-clock time the observation was created, in Unix-epoch milliseconds.
    pub ts_ms: u64,

    /// The typed event payload.
    pub event: AgentEvent,
}

// ---------------------------------------------------------------------------
// Agent latency metrics
// ---------------------------------------------------------------------------

/// Latency for a completed model or tool call within an agent run.
///
/// These records are derived from durable [`AgentObservation`] timestamps by
/// correlating `*.started` and `*.completed` events. They intentionally carry
/// ids and short names only, never prompt text, tool arguments, or provider
/// payloads.
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct AgentCallLatency {
    /// The model/tool call id being measured.
    pub call_id: CallId,

    /// Stable call family, currently `"model"` or `"tool"`.
    pub kind: String,

    /// Model id or tool name associated with the call.
    pub name: String,

    /// Wall-clock elapsed time between start and completion, in milliseconds.
    pub elapsed_ms: u64,
}

/// Summarized latency metrics for a single agent run.
///
/// `run_elapsed_ms` is measured between `run.started` and the first terminal
/// `run.completed` / `run.failed` observation when both are available. Model
/// and tool latencies are measured by call id from the same observation stream.
#[derive(Clone, Debug, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct AgentLatencyMetrics {
    /// End-to-end run latency, when both run start and terminal events exist.
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub run_elapsed_ms: Option<u64>,

    /// Per-model-call latencies in completion order.
    #[serde(default)]
    pub model_calls: Vec<AgentCallLatency>,

    /// Per-tool-call latencies in completion order.
    #[serde(default)]
    pub tool_calls: Vec<AgentCallLatency>,

    /// Sum of completed model-call latency.
    pub total_model_ms: u64,

    /// Slowest completed model call.
    pub max_model_ms: u64,

    /// Sum of completed tool-call latency.
    pub total_tool_ms: u64,

    /// Slowest completed tool call.
    pub max_tool_ms: u64,
}

impl AgentObservation {
    /// Builds an observation from a live [`EventRecord`] and the emitting run's
    /// lineage, stamping it with the current wall-clock time.
    ///
    /// [`EventRecord`]: crate::harness::events::EventRecord
    pub fn from_record(
        record: &crate::harness::events::EventRecord,
        run_id: RunId,
        parent_run_id: Option<RunId>,
        root_run_id: RunId,
    ) -> Self {
        Self {
            event_id: record.id.clone(),
            run_id,
            parent_run_id,
            root_run_id,
            offset: record.offset,
            ts_ms: now_ms(),
            event: record.event.clone(),
        }
    }
}

// ---------------------------------------------------------------------------
// HarnessEventJournal
// ---------------------------------------------------------------------------

/// A durable, append-only journal of [`AgentObservation`]s keyed by run id.
///
/// Journals decouple durable replay from live broadcast: a UI or supervisor
/// can attach after a run has started and reconstruct history by reading from
/// a known offset rather than relying on having subscribed to an in-memory
/// [`crate::harness::events::EventSink`].
#[async_trait]
pub trait HarnessEventJournal: Send + Sync {
    /// Appends `obs` to the journal and returns the offset it was stored at
    /// within its run's stream.
    async fn append(&self, obs: AgentObservation) -> Result<u64>;

    /// Returns every observation for `run_id` whose stream offset is `>=
    /// offset`, in offset order. Reading from `0` replays the whole run;
    /// reading an unknown run returns an empty `Vec`.
    async fn read_from(&self, run_id: &str, offset: u64) -> Result<Vec<AgentObservation>>;

    /// Returns at most `limit` observations for `run_id` starting at `offset`
    /// (a bounded replay window). The default reads from `offset` and
    /// truncates; durable backends may override for a server-side limit.
    async fn read_window(
        &self,
        run_id: &str,
        offset: u64,
        limit: usize,
    ) -> Result<Vec<AgentObservation>> {
        let mut all = self.read_from(run_id, offset).await?;
        all.truncate(limit);
        Ok(all)
    }

    /// Returns observations for `run_id` from `offset` whose
    /// [`AgentEvent::kind`][crate::harness::events::AgentEvent::kind] is in
    /// `kinds`. An empty `kinds` slice matches everything. This is the
    /// UI-surface filter (text-only, tool timeline, cost updates, errors, …).
    async fn read_filtered(
        &self,
        run_id: &str,
        offset: u64,
        kinds: &[&str],
    ) -> Result<Vec<AgentObservation>> {
        let all = self.read_from(run_id, offset).await?;
        Ok(all
            .into_iter()
            .filter(|obs| kinds.is_empty() || kinds.contains(&obs.event.kind()))
            .collect())
    }
}

/// Default number of distinct `run_id` streams an [`InMemoryEventJournal`]
/// retains before evicting the oldest (by insertion order) to bound memory.
pub const DEFAULT_JOURNAL_MAX_RUNS: usize = 10_000;

/// A single run's retained observations, plus the offset its first retained
/// entry corresponds to.
///
/// `base_offset` is normally `0`, but once a run's stream has previously been
/// evicted and then receives another append, the new stream must continue
/// numbering offsets from where the evicted one left off rather than
/// restarting at `0` — otherwise a consumer resuming from a durable offset
/// would have entries silently skipped (see [`EventJournalState::evicted`]).
#[derive(Debug, Default)]
pub(crate) struct EventStream {
    pub(crate) base_offset: u64,
    pub(crate) entries: Vec<AgentObservation>,
}

/// Inner state for [`InMemoryEventJournal`]: the per-run observation streams
/// plus insertion order so the oldest run can be evicted once `max_runs` is
/// exceeded.
#[derive(Debug, Default)]
pub(crate) struct EventJournalState {
    pub(crate) streams: HashMap<String, EventStream>,
    /// Oldest-first insertion order of run ids, used for FIFO eviction.
    pub(crate) order: VecDeque<String>,
    /// Next offset to resume from for runs whose stream was evicted, so a
    /// later append for the same `run_id` continues numbering instead of
    /// restarting at `0` (which would corrupt any durable offset a consumer
    /// has already saved). Bounded the same way `streams` is: entries are
    /// dropped oldest-first once `evicted_order` exceeds `max_runs`.
    pub(crate) evicted: HashMap<String, u64>,
    pub(crate) evicted_order: VecDeque<String>,
}

/// In-memory [`HarnessEventJournal`] backed by a per-run `Vec`.
///
/// Cheaply clonable through an inner [`Arc`]; clones share the same streams.
/// There is no durability — entries are lost when the last clone drops.
///
/// Retains at most [`InMemoryEventJournal::max_runs`] distinct `run_id`
/// streams (default [`DEFAULT_JOURNAL_MAX_RUNS`]); once exceeded, the oldest
/// run (by first-append order) is evicted wholesale to keep memory bounded
/// across long-lived processes that journal many runs.
#[derive(Clone, Debug)]
pub struct InMemoryEventJournal {
    pub(crate) state: Arc<Mutex<EventJournalState>>,
    pub(crate) max_runs: usize,
}

impl Default for InMemoryEventJournal {
    fn default() -> Self {
        Self {
            state: Arc::new(Mutex::new(EventJournalState::default())),
            max_runs: DEFAULT_JOURNAL_MAX_RUNS,
        }
    }
}

/// [`HarnessEventJournal`] backed by any [`AppendStore`].
///
/// Each run's observations are appended to the store under a stream named by
/// the run id, so `read_from` resumes from a durable offset. Pair with
/// [`crate::harness::store::JsonlAppendStore`] for a local durable journal or
/// [`crate::harness::store::InMemoryAppendStore`] for deterministic tests.
#[derive(Clone, Debug)]
pub struct StoreEventJournal<A: AppendStore> {
    /// The backing append store; stream key is the run id.
    pub(crate) store: A,
}

// ---------------------------------------------------------------------------
// HarnessStatusStore
// ---------------------------------------------------------------------------

/// A readable status surface for harness runs.
///
/// Status records are overwritten by `run_id` ("what is running now?") in
/// contrast to the append-only journal ("what happened?"). Writes must stay
/// compact: counters, ids, phase, error summaries, and timestamps — never full
/// prompts or provider payloads (see [`HarnessRunStatus`]).
#[async_trait]
pub trait HarnessStatusStore: Send + Sync {
    /// Inserts or overwrites the status for its `run_id`.
    async fn put_status(&self, status: HarnessRunStatus) -> Result<()>;

    /// Returns the latest status for `run_id`, or `None` if unknown.
    async fn get_status(&self, run_id: &str) -> Result<Option<HarnessRunStatus>>;

    /// Returns all known statuses whose `thread_id` matches `thread_id`, in
    /// unspecified order.
    async fn list_by_thread(&self, thread_id: &str) -> Result<Vec<HarnessRunStatus>>;

    /// Returns all known statuses whose `root_run_id` matches `root_run_id`,
    /// letting a supervisor walk every descendant of a run tree.
    ///
    /// The default returns an empty `Vec` (backends without enumeration cannot
    /// answer lineage queries); enumerable backends such as
    /// [`InMemoryStatusStore`] override it.
    async fn list_by_root(&self, root_run_id: &str) -> Result<Vec<HarnessRunStatus>> {
        let _ = root_run_id;
        Ok(Vec::new())
    }

    /// Returns every non-terminal (active) run status. The default returns an
    /// empty `Vec`; enumerable backends override it.
    async fn list_active(&self) -> Result<Vec<HarnessRunStatus>> {
        Ok(Vec::new())
    }
}

/// Default number of distinct runs an [`InMemoryStatusStore`] retains before
/// evicting terminal runs (oldest first) to bound memory.
pub const DEFAULT_STATUS_STORE_MAX_RUNS: usize = 10_000;

/// Inner state for [`InMemoryStatusStore`]: the `run_id → status` map plus
/// insertion order so terminal runs can be evicted oldest-first once
/// `max_runs` is exceeded.
#[derive(Debug, Default)]
pub(crate) struct StatusStoreState {
    pub(crate) statuses: HashMap<String, HarnessRunStatus>,
    /// Oldest-first insertion order of run ids, used for eviction.
    pub(crate) order: VecDeque<String>,
}

/// In-memory [`HarnessStatusStore`] backed by a `run_id → status` map.
///
/// Cheaply clonable through an inner [`Arc`]; clones share the same map.
///
/// Retains at most [`InMemoryStatusStore::max_runs`] distinct runs (default
/// [`DEFAULT_STATUS_STORE_MAX_RUNS`]). Once exceeded, the oldest **terminal**
/// runs (anything not `Pending`/`Running`/`Interrupted`) are evicted first so
/// an in-flight run's status is never dropped out from under it; active runs
/// are only evicted once no terminal run remains to make room.
#[derive(Clone, Debug)]
pub struct InMemoryStatusStore {
    pub(crate) state: Arc<Mutex<StatusStoreState>>,
    pub(crate) max_runs: usize,
}

impl Default for InMemoryStatusStore {
    fn default() -> Self {
        Self {
            state: Arc::new(Mutex::new(StatusStoreState::default())),
            max_runs: DEFAULT_STATUS_STORE_MAX_RUNS,
        }
    }
}

// ---------------------------------------------------------------------------
// Sinks
// ---------------------------------------------------------------------------

/// An [`EventListener`] that broadcasts every record to N inner listeners.
///
/// Listeners are notified in registration order. A failure or panic in one
/// listener is not isolated, so listeners should themselves be best-effort.
#[derive(Clone, Default)]
pub struct FanOutSink {
    /// The downstream listeners, notified in order.
    pub(crate) listeners: Vec<Arc<dyn EventListener>>,
}

/// An [`EventListener`] that masks configured secret substrings in an event's
/// string fields before forwarding to an inner listener.
///
/// Redaction is generic: the event is serialized to JSON, every string value
/// (at any depth) has each secret substring replaced by the mask, and the
/// result is deserialized back into an [`AgentEvent`]. If (de)serialization
/// fails the original record is forwarded unchanged so observability is never
/// silently dropped.
#[derive(Clone)]
pub struct RedactingSink {
    /// The downstream listener that receives the redacted record.
    pub(crate) inner: Arc<dyn EventListener>,
    /// Secret substrings to mask wherever they appear in string fields.
    pub(crate) secrets: Vec<String>,
    /// Replacement text substituted for each secret occurrence.
    pub(crate) mask: String,
}

/// An [`EventListener`] that writes each event as an [`AgentObservation`] into
/// a [`HarnessEventJournal`].
///
/// The sink is configured with the emitting run's lineage; each received
/// [`EventRecord`] is wrapped into an [`AgentObservation`] and handed to a
/// background [`AppendWorker`] that persists it off the emitting thread. The
/// append is best-effort: see [`AppendWorker`] for the backpressure/drop and
/// error policy, and use [`JournalSink::flush`] to block until the durable log
/// has caught up.
///
/// [`EventRecord`]: crate::harness::events::EventRecord
#[derive(Clone)]
pub struct JournalSink {
    /// The run that owns events delivered to this sink.
    pub(crate) run_id: RunId,
    /// Parent run id stamped onto every observation.
    pub(crate) parent_run_id: Option<RunId>,
    /// Root run id stamped onto every observation.
    pub(crate) root_run_id: RunId,
    /// Background drain that persists observations without blocking the run.
    pub(crate) worker: Arc<AppendWorker<AgentObservation>>,
}

/// An [`EventListener`] that appends each [`EventRecord`] as a JSON line into a
/// [`JsonlAppendStore`](crate::harness::store::JsonlAppendStore) stream.
///
/// This is the lightweight durable sink: it persists the live record (id,
/// offset, event) under a fixed stream name. Each record is handed to a
/// background [`AppendWorker`] that appends it off the emitting thread
/// (best-effort — see [`AppendWorker`] for the drop/error policy). Use
/// [`JsonlSink::flush`] to block until the durable log has caught up.
///
/// [`EventRecord`]: crate::harness::events::EventRecord
#[derive(Clone, Debug)]
pub struct JsonlSink {
    /// Background drain that appends records without blocking the run.
    pub(crate) worker: Arc<AppendWorker<serde_json::Value>>,
}