finding
active
finding:llama-3-1-8b-implements-a-two-stage-algorithm-1-compute-integer-sum-via-base-10-addition-e-g-six-august-14-then-2-map-sum-to-cyclic-concept-space-14-februaryLlama-3.1-8B implements a two-stage algorithm: (1) compute integer sum via base-10 addition (e.g., six + August = 14), then (2) map sum to cyclic concept space (14 → February)
The complete mechanistic algorithm discovered for cyclic concept reasoning
Source paper
extracted_from(2026) · Sheridan Feucht · Tal Haklay · Usha Bhalla · Daniel Wurgaft +8
Neighborhood — ranked by edge-count
Claims (1)
claim
- The paper's primary interpretive claim, directly answering the central question
Questions (1)
question
- The empirical question the paper addresses through mechanistic investigation
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.882The central empirical finding that computation does not mirror the circular representational structure
- Predictive hypothesis about domain-generality of the identified mechanism
- The specific computational question the paper resolves empirically
- Key mechanistic finding showing task-agnostic reuse of arithmetic circuitry
- The specific Fourier feature periods identified confirm base-10 rather than modular computation
- Verbatim summary of the main discovery.
- Empirical observation establishing that Llama's internal representations for days-of-week have circular geometric structure.
- Core empirical result demonstrating that manifold steering produces on-target, behavior-aligned outputs.