Symbol H_verify
erify is part of the quantity the equation computes from the expression on the right.
Read this term in its guide →Published equation contexts
Why this formula appears here
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 representative guide
Symbol i
i appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Read this term in its guide →Symbol m
m appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Read this term in its guide →Symbol h_i
is an input to the expression that computes the quantity on the left.
Read this term in its guide →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.
Read this term in its guide →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.
Read this term in its guide →How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
Research cited beside this formula
Published contexts (1)
A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.
Equation 23 · AI Research
What Interpretability Actually Costs to Do at Scale
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.
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,…
Equation guide → · Article →