← All parts of this equation

Equation 23 · Part 7 · What Interpretability Actually Costs to Do at Scale

superscript

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

What this part means

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.

Its job in the formula

A raised mark can be a power or an index. Its position and the surrounding notation determine which.

The passage around this formula

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 this part in the article →

Learn the underlying idea

An exponent tells how a base is used in multiplication. In x³, x is the base and 3 is the exponent: x³ = x × x × x.

Open the illustrated exponents: repeated multiplication and powers guide →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.