← Back to article

Equation 5 · How Verification Actually Works in a Claude Code Workflow

What does this equation mean?

Pmiss=(1−rA)(1−rB)P_{miss} = (1-r_A)(1-r_B)

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

Inputs and operations(1-r_A)(1-r_B)
Result or conditionP_miss
How to read the two sides of this formula. Follow the article passage for the meaning of each quantity.

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

PmissP_{miss}

Symbol P_miss

PmP_miss is part of the quantity the equation computes from the expression on the right.

Understand this part →

rAr_A

Symbol r_A

rAr_A is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

rBr_B

Symbol r_B

the recall.

Understand this part →

=

=

The expressions on both sides represent the same quantity under the stated assumptions.

Understand this part →

See an illustrated explanation →
subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

Say check A independently has recall rAr_A against a real defect — the fraction of the time it would catch that class of problem if it ran — and check B has recall rBr_B . If the two checks fail for unrelated reasons, the chance a defect slips past both is the product of the chances it slips past each: Pmiss=(1−rA)(1−rB)P_{miss} = (1-r_A)(1-r_B). which is smaller than either (1-rAr_A) or (1-rBr_B) alone: real, additive protection. But if the two checks share a failure mode — most obviously, if the “second check” is the same model re-reading its own output inside the same context, primed by the same reasoning that produced the mistake — their misses stop being independent, and the joint miss probability climbs back toward…
Read the full surrounding passage
Say check A independently has recall rAr_A against a real defect — the fraction of the time it would catch that class of problem if it ran — and check B has recall rBr_B . If the two checks fail for unrelated reasons, the chance a defect slips past both is the product of the chances it slips past each: Pmiss=(1−rA)(1−rB)P_{miss} = (1-r_A)(1-r_B). which is smaller than either (1-rAr_A) or (1-rBr_B) alone: real, additive protection. But if the two checks share a failure mode — most obviously, if the “second check” is the same model re-reading its own output inside the same context, primed by the same reasoning that produced the mistake — their misses stop being independent, and the joint miss probability climbs back toward max⁡(1−rA, 1−rB)\max(1-r_A,\ 1-r_B) : no better than the stronger of the two checks alone, and often worse in practice, because the second pass inherits the first pass’s blind spot along with its confidence.

Read the equation in its article →

Sources cited in the article section

These citations give research context. Read each source to check which claims it supports.

Return to How Verification Actually Works in a Claude Code Workflow

See this formula across 1 published context →

Browse the mathematical compendium →