Equation 23 · What Interpretability Actually Costs to Do at Scale
What does this equation mean?
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.
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
Symbol H_verify
erify is part of the quantity the equation computes from the expression on the right.
Symbol i
i appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol m
m appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol h_i
is an input to the expression that computes the quantity on the left.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →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.
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.
See an illustrated explanation →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.
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.
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 researcher-hours, including the false starts a competent skeptic would force. Total verification cost per claim is . and the field’s own most careful examples put each 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 researcher-hours, including the false starts a competent skeptic would force. Total verification cost per claim is . and the field’s own most careful examples put each 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 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.
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