← Back to article

Equation 23 · What Interpretability Actually Costs to Do at Scale

What does this equation mean?

Hverify  =  ∑i=1mhi,H_{\mathrm{verify}} \;=\; \sum_{i=1}^{m} h_i ,

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 operationssum_i=1^m h_i
Result or conditionH_verify
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

HverifyH_{\mathrm{verify}}

Symbol H_verify

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

Understand this part →

ii

Symbol i

i appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

Understand this part →

mm

Symbol m

m appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

Understand this part →

hih_i

Symbol h_i

hih_i is an input to the expression that computes the quantity on the left.

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 →

superscript

superscript

A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.

Understand this part →

See an illustrated explanation →
i=1i=1

Starting index or lower bound: i=1

This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.

Understand this part →

mm

Ending index or upper bound: m

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

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

A simple model makes the scaling problem legible. Let a verified circuit claim require passing m distinct checks — faithfulness under intervention, completeness against the behavior it is meant to fully explain, minimality against components that turn out not to matter — and let each check take hih_i researcher-hours, including the false starts a competent skeptic would force. Total verification cost per claim is Hverify  =  ∑i=1mhiH_{\mathrm{verify}} \;=\; \sum_{i=1}^{m} h_i . and the field’s own most careful examples put each hih_i measured not in minutes but in dedicated researcher-days once ambiguity has to be resolved rather than merely observed. If a frontier model implements even a low four-figure count of distinguishable,…
Read the full surrounding passage
A simple model makes the scaling problem legible. Let a verified circuit claim require passing m distinct checks — faithfulness under intervention, completeness against the behavior it is meant to fully explain, minimality against components that turn out not to matter — and let each check take hih_i researcher-hours, including the false starts a competent skeptic would force. Total verification cost per claim is Hverify  =  ∑i=1mhiH_{\mathrm{verify}} \;=\; \sum_{i=1}^{m} h_i . and the field’s own most careful examples put each hih_i measured not in minutes but in dedicated researcher-days once ambiguity has to be resolved rather than merely observed. If a frontier model implements even a low four-figure count of distinguishable, individually claim-worthy behaviors — a conservative floor, not an estimate anyone has actually published, because nobody has enumerated a frontier model’s behavior inventory any more than its feature inventory — then HverifyH_{\mathrm{verify}} summed across even a small fraction of them outruns any realistic standing research team within a single model generation, let alone across the several generations a lab now ships per year. This is precisely the bottleneck the field’s own methods papers name as the reason automation is not optional: Conmy and colleagues built an algorithm to prune the computational graph automatically because, in their words, “the current approach to extracting circuits from neural networks relies on a lot of manual inspection by humans,” which is “a major obstacle to scaling up mechanistic interpretability to larger models, more behaviors, and complicated behaviors composed of many sub-circuits” [ 9 ] . Their validation of that automation was itself modest by design — recovering, on GPT-2 small, five component types and sixty-eight of thirty-two thousand edges that had already been found by hand in prior work [ 9 ] . Recovering a known answer faster is real progress on the labor ledger. It is not evidence that automation finds what a human would have missed.

Read the equation in its article →

Sources cited in the surrounding passage

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

Return to What Interpretability Actually Costs to Do at Scale

See this formula across 1 published context →

Browse the mathematical compendium →