← Mathematical compendium

Published equation contexts

E[duplicates]  ≈  n⋅p⋅(1−i)\mathbb{E}[\text{duplicates}] \;\approx\; n \cdot p \cdot (1 - i)

Why this formula appears here

The shape of the exposure is simple enough to write down. Let n be the number of side-effecting tool calls in a session, p the probability that any one call’s response is lost after the server has already executed it, and i the fraction of those calls actually covered by a working, executor-enforced idempotency key. Then the expected count of uncontrolled duplicate side effects across the session is approximately E[duplicates]  ≈  n⋅p⋅(1−i)\mathbb{E}[\text{duplicates}] \;\approx\; n \cdot p \cdot (1 - i). The only term a protocol upgrade could move is i ; n and p are properties of the workload and the network. Today, for most deployments, i is close to zero, because nothing in the base protocol gives a server a caller-supplied key to deduplicate against.

Read the full article-specific guide →

Read the representative guide

nn

Symbol n

n is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →
ii

Symbol i

i is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →

How to interpret it

Its accuracy depends on the assumptions and range of use described in the article.

Research cited beside this formula

Learn the mathematics behind it

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

E[duplicates]  ≈  n⋅p⋅(1−i).\mathbb{E}[\text{duplicates}] \;\approx\; n \cdot p \cdot (1 - i).

Equation 4 · AI Infrastructure

Ten Failure Modes That Define Production Tool-Protocol Integrations

This equation gives an approximation: it relates the quantities while allowing an approximation.

The shape of the exposure is simple enough to write down. Let n be the number of side-effecting tool calls in a session, p the probability that any one call’s response is lost after the server has already executed it, and i the fraction of those calls actually covered by a working, executor-enforced idempotency key. Then the expected count of uncontrolled duplicate side effects across the session is approximately E[duplicates]  ≈  n⋅p⋅(1−i)\mathbb{E}[\text{duplicates}] \;\approx\; n \cdot p \cdot (1 - i). The only term a protocol upgrade could move is i ; n and p are properties of the workload and the network. Today, for most deployments, i is close to zero, because nothing in the base protocol gives a server a caller-supplied key to deduplicate against.

Meanings in this article

  • E\mathbb{E}: The expected value operator: the probability-weighted average of the quantity inside its brackets.
  • pp: properties of the workload and the network.
Equation guide → · Article →