Ask what should change when the equation is manipulated, then let the visualization test that expectation.
Foundation Lab
Transformer Circuits, Induction Heads & Mechanistic Interpretability
These frameworks study GPT-style models, including Llama-3 and Claude-3, by identifying concrete circuits
r_{l+1} = r_l + W^{\text{attn}}_l r_l + W^{\text{mlp}}_l r_lSelected Foundation Object
Keep the equation fixed; move through the evidence.
Interactive visualizations of how QK and OV matrices implement algorithms like induction
r_{l+1} = r_l + W^{\text{attn}}_l r_l + W^{\text{mlp}}_l r_lUse the runnable panel, the key equation, and canonical papers as separate forms of evidence for the same object.
The useful learning product is the reusable mechanism you can carry into another model, paper, or engineering tradeoff.
Use prerequisites, dependents, and semantic links to repair the next gap without leaving the object behind.
Why It Matters for Modern Models
- These frameworks study GPT-style models, including Llama-3 and Claude-3, by identifying concrete circuits
- Inform safety research (locating deception-related circuits) and architecture design
What Tutorials Skip
What is still poorly explained in textbooks and papers:
- Interactive visualizations of how QK and OV matrices implement algorithms like induction
- Broader taxonomies of circuit motifs beyond a few toy examples
Interactive Visualization
Core Math (Optional Deep Dive)
If you want intuition first, start with the key equation and the visualization. Come back here for the full walkthrough.
Decompose transformer computations into linear components on the residual stream:
Induction heads: specific attention heads implement an algorithm:
by attending from the final [A] token to previous [A] tokens and copying the subsequent token's representation.
The sudden appearance of these heads is tied to a phase transition in in-context learning.