Measuring the Unmeasurable: Markov Chain Reliability for LLM Agents

Large language model (LLM) agents increasingly operate as sequential software systems, but their reliability is often summarized by scalar benchmark metrics. Metrics such as pass@k, passk, and the reliability decay curve (RDC) are useful summaries, but they do not identify the success-time distribution being estimated, test whether traces support that distribution, or quantify finite-trace uncertainty. We present textscTraceToChain, a reproducible pipeline that fits agent execution traces to an absorbing discrete-time Markov chain (DTMC), hat M=(hat Q,hat R_oplus,hat R_ominus), with explicit diagnostics and uncertainty. The pipeline builds an automatic cluster taxonomy, estimates transitions with Laplace-smoothed maximum-likelihood estimation (MLE), checks fit with a composite Akaike information criterion (AIC) and Kolmogorov--Smirnov (KS) goodness-of-fit certificate, and reports Dirichlet-posterior credible intervals and non-parametric bootstrap intervals. We adapt classical reliability mathematics (Kemeny--Snell~citekemenysnell, Cheung~citecheung1980, Goel--Okumoto~citegoelokt) to agent traces. The resulting first-passage view reconciles metrics usually reported separately: pass@k, passk, and the RDC are projections of one success-time distribution. On seven controlled MAST-style frameworks with a strict 50/50 fit/test protocol, held-out empirical RDCs overlay their analytic counterparts with max L_∞RDC = 0.053 (median 0.048). A two-sample KS test on the first-passage cumulative distribution function (CDF) accepts the fitted chain with p>0.05 on 7/7 frameworks (min p = 0.78), and per-entry 95% posterior and bootstrap intervals agree to ≈!0.01 at the median.