finding
active
finding:llama-3-1-8b-reuses-a-single-generic-addition-mechanism-across-all-cyclic-tasks-independently-of-concept-specific-geometryLlama-3.1-8B reuses a single generic addition mechanism across all cyclic tasks independently of concept-specific geometry
Key mechanistic finding showing task-agnostic reuse of arithmetic circuitry
Source paper
extracted_from(2026) · Sheridan Feucht · Tal Haklay · Usha Bhalla · Daniel Wurgaft +8
Neighborhood — ranked by edge-count
Claims (2)
claim
- The paper's primary interpretive claim, directly answering the central question
- Broader interpretive claim about LM learning bias inferred from the findings
Hypotheses (1)
hypothesis
- Predictive hypothesis about domain-generality of the identified mechanism
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Llama-3.1-8B uses base-10 addition rather than modular addition to compute cyclic concept sumsfinding0.858The central empirical finding that computation does not mirror the circular representational structure
- The specific computational question the paper resolves empirically
- The complete mechanistic algorithm discovered for cyclic concept reasoning
- The empirical question the paper addresses through mechanistic investigation
- Verbatim summary of the main discovery.
- The representation geometry finding that motivates the question about whether computation mirrors it
- Llama-3.3-70B exhibits internal consistency-checking mechanisms that operate during inferenceclaim0.805Central interpretive claim of the paper supported by causal ablation and activation evidence
- The specific Fourier feature periods identified confirm base-10 rather than modular computation