The Geometry of Thought: How Scale Restructures Reasoning In Large Language Models
Samuel Cyrenius Anderson
TL;DR
This paper shows that scaling large language models reshapes reasoning through domain-specific geometric reorganizations rather than a uniform performance boost. By analyzing over 25,000 chain-of-thought trajectories across Law, Science, Code, and Math and two model scales, it uncovers three phases—Crystallization in Law, Liquidity in Science/Math, and Lattice in Code—each with distinct effects on global dimension $d_{95}$, intrinsic dimension $d_{\mathrm{mle}}$, alignment, and clustering, plus a universal oscillatory coherence of about $-0.4$. It introduces Neural Reasoning Operators to map initial to terminal hidden states and demonstrates that favorable geometry predicts operator learnability, enabling amortized inference in crystalline domains. The findings imply that the cost of thought depends on manifold geometry and point toward geometry-aware deployment, compression, and safety considerations, with practical methods for operator-based inference and a reproducible measurement suite. Overall, the work provides a geometry-centric map of how scale restructures reasoning, offering a blueprint for domain-specific acceleration and more reliable deployment of high-stakes AI systems.
Abstract
Scale does not uniformly improve reasoning - it restructures it. Analyzing 25,000+ chain-of-thought trajectories across four domains (Law, Science, Code, Math) and two scales (8B, 70B parameters), we discover that neural scaling laws trigger domain-specific phase transitions rather than uniform capability gains. Legal reasoning undergoes Crystallization: 45% collapse in representational dimensionality (d95: 501 -> 274), 31% increase in trajectory alignment, and 10x manifold untangling. Scientific and mathematical reasoning remain Liquid - geometrically invariant despite 9x parameter increase. Code reasoning forms a discrete Lattice of strategic modes (silhouette: 0.13 -> 0.42). This geometry predicts learnability. We introduce Neural Reasoning Operators - learned mappings from initial to terminal hidden states. In crystalline legal reasoning, our operator achieves 63.6% accuracy on held-out tasks via probe decoding, predicting reasoning endpoints without traversing intermediate states. We further identify a universal oscillatory signature (coherence ~ -0.4) invariant across domains and scales, suggesting attention and feedforward layers drive reasoning through opposing dynamics. These findings establish that the cost of thought is determined not by task difficulty but by manifold geometry - offering a blueprint for inference acceleration where topology permits.
