Compositional reliability is the name From Determinism to Delegation: AI-Native Software Engineering and the Evolution of the Agentic Engineer gives to what it calls a distinctive and underappreciated failure mode of agentic systems: the multiplicative decay of reliability over long horizons. If an agent must complete n dependent steps and each step succeeds independently with probability p, then under the independence assumption the end-to-end success probability is p raised to the power n. The paper’s own worked figure is that a seemingly strong per-step rate of p = 0.95 yields only about 0.36 across twenty steps.

Two things make this more than arithmetic. The first is that the independence assumption is optimistic: the paper is explicit that the formula is an upper bound in practice, because real errors are often correlated and can cascade. The second is what follows from it for evaluation — that trajectory-level evaluation, recovery and human checkpoints, rather than per-step accuracy alone, are what govern usable autonomy.

Usage

The concept is used to argue against reading per-step accuracy as a proxy for end-to-end capability over a long horizon. It gives a reason to prefer trajectory evaluation — asking whether the agent chose a correct sequence of tools, even where the final answer varies — over scoring outcomes alone, and a reason to place human-in-the-loop checkpoints on the consequential and destructive actions along the way, which is where the paper puts them.

A draft chapter of Jimmy Song’s online handbook 智能体构建指南 makes the same compounding argument for LLM-based agent systems under the heading of an amplification effect of LLM uncertainty, without using this term: assuming a single LLM call is right 90% of the time, it puts a system of 10 calls at about 35% and one of 20 calls at about 12%. The chapter attributes the amplification to memory (uncontrolled state consistency and semantic drift in embedding retrieval), orchestration (the LLM deciding the flow dynamically) and testing (probabilistic output defeating conventional unit tests), and answers it with replay tests, baseline comparison and simulation environments, version tracking of prompts and memory, and monitoring of drift rate and error rate — part of what it calls Agent Systems Engineering.

It is worth reading beside Behavioral Drift, which the same paper treats in the adjacent section: drift concerns an agent having no stable terminal state over time, while compositional reliability concerns the horizon within a single run. The paper discusses both among the mechanisms underlying autonomous software agents; the juxtaposition here is this wiki’s, not a grouping the paper makes.

When It Applies

The formula applies where the steps are genuinely dependent — where a later step requires an earlier one to have succeeded — and where success at each step can be treated as having a probability at all. It is least informative where steps are independent of one another, or where the agent can detect and recover from a failed step — recovery breaks the chain the multiplication assumes, which is this wiki’s reading of why the paper names recovery as one of the three things that govern usable autonomy.

Its characteristic misuse is treating the bound as a prediction rather than a ceiling. Because errors correlate in practice, the true figure is generally worse than p to the n, so the formula understates the problem rather than overstating it. The formula also holds p fixed across every step, which a heterogeneous task rarely satisfies — a limit of the model rather than one the paper states.

The paper lists bounding end-to-end reliability under correlated failures as an open problem, stating that principled methods for doing so are needed — an acknowledgement that the independence formula is a first approximation rather than a tool for planning. Beyond that formula and the consequences it draws for evaluation, the paper offers no measurement of its own.