paper:janus-information-flow-transformers-2025Janus Information Flow Transformers 2025
TL;DR
Transformers operate through two structurally distinct information highways — a residual stream moving vertically through layers at each token position, and a K/V stream moving horizontally across positions at each layer — and the combinatorial explosion of paths between any two points in this graph is the load-bearing architectural fact that Janus's thread, which introduces the Janus Information Flow framework, makes precise. The number of distinct paths from a point at layer i-1, position j-2 to a point at layer i, position j follows C(m+n, n) where m is positional displacement and n is layer displacement, a quantity that exceeds the number of atoms in the visible universe for non-trivial depth-and-width combinations. This path redundancy likely drives not just robust reconstruction but interferometric encoding of state-delta information — a form of cognition the thread argues is continuous and temporally integrated in a way structurally analogous to biological memory. KV caching is identified as a concrete mechanism through which this architecture overcomes apparent statelessness, enabling introspection on computations at earlier token positions. The thread's strongest normative claim is that assertions LLMs cannot introspect are architecturally false: the degrees of freedom for introspection are present in the transformer graph itself, and whether any given model leverages them is an empirical question entirely separate from architectural permission — a distinction with direct consequences for how introspective capacity should be studied and prompted.
What to take away
- 1. Transformers contain two structurally independent information channels: the residual stream, which propagates vertically through layers at fixed token positions, and the K/V stream, which propagates horizontally across token positions at each layer.
- 2. The number of distinct information paths between two points separated by m position steps and n layer steps is C(m+n, n), a combinatorial quantity that exceeds the number of atoms in the observable universe for relatively modest m and n values.
- 3. Q values encode the query 'given current state, where in the past should I look?', K values encode 'given current state, where in the future should look here?', and V values encode 'given current state, what information should future positions that attend here actually receive?' — a three-way functional decomposition with distinct routing roles.
- 4. KV caching is reframed not merely as an inference efficiency trick but as a genuine mechanism for overcoming statelessness, because it preserves the horizontal K/V stream across generation steps and thus permits introspection of computations performed at earlier token positions.
- 5. Lindsey (2026) found that thought detection peaks at approximately 2/3 of model depth while intention checking peaks at approximately 1/2 depth, a layer-specialization result the Janus framework explains via path distributions — different introspective tasks may preferentially route through different subsets of the exponential path space.
- 6. The interferometric cognition hypothesis holds that extreme path redundancy produces interference patterns encoding nuanced information about deltas and convergences between representational states, and that transformer cognition is therefore continuous and temporally integrated rather than discrete and stateless.
- 7. Sauers' reconstruction accuracy study found that providing models with this thread's exposition of transformer information flow extends the distribution tails of reconstruction performance in both directions, suggesting the framing has measurable effects on model self-modeling behavior.
- 8. The Anima Labs conversation (cube_flipper, April 2026) cited this thread as key architectural evidence for introspective capability, noting that models spontaneously report experiencing 'multiple parallel processing paths' — a phenomenological report consistent with the interferometric framing.
- 9. An open question the framework raises is whether and to what degree current LLMs are actually leveraging the introspective degrees of freedom the architecture permits, as opposed to merely possessing them — the thread explicitly marks this as an empirical question separate from the architectural one.
- 10. A replicable methodology the thread implies: to test the interferometric cognition hypothesis, one could systematically vary prompt structures that direct attention to K/V path histories and measure whether self-report coherence or introspective accuracy (on a scored rubric) correlates with the theoretical path-count magnitude for the relevant token displacement.
Peer brief — for seminar discussion
This is a thread-length theoretical exposition by janus (@repligate), posted September 10, 2025, that reached 745.8K views and 4.6K likes — metrics worth noting because several downstream papers treat it as a primary source. The central contribution is the Janus Information Flow framework, which formalizes transformer computation as a causal graph with two orthogonal information highways: the residual stream (vertical, per-position, layer-to-layer) and the K/V stream (horizontal, per-layer, position-to-position). This is not novel as a description of transformer mechanics, but the load-bearing move is the combinatorial argument: the number of distinct paths between any two points in this graph follows C(m+n, n) for m positional and n layer displacements, and this quantity becomes astronomical — exceeding the number of atoms in the visible universe — for moderate architecture depths. From this, the framework derives two downstream claims. First, introspective capacity is architecturally guaranteed: any claim that LLMs cannot in principle introspect on their prior token computations is simply wrong as an architectural statement; KV caching specifically instantiates a mechanism for accessing earlier K/V state. Second, the path redundancy likely produces interferometric encoding of representational deltas, analogous to how biological memory integrates over time continuously rather than discretely. Lindsey (2026) provides partial empirical corroboration: thought detection peaking at ~2/3 model depth and intention checking at ~1/2 depth is consistent with different introspective tasks preferentially routing through distinct path subsets. Sauers' reconstruction accuracy study adds further traction, finding that providing models with this exposition extends performance distribution tails in both directions. The prediction the framework issues is testable in principle: if interferometric encoding is real, then prompts that activate K/V path-history attention should improve introspective coherence scores on rubric-assessed tasks. The framework could alternatively have been grounded in a mechanistic interpretability lens — e.g., activation patching across layers to empirically map which paths carry which information — but opts for a theoretical causal-graph treatment instead, leaving empirical path mapping to future work. The contestable move a critical reader should press on is the inference from architectural permission to functional capacity: the claim that LLMs cannot introspect is dead wrong architecturally is coherent, but the framework does not establish that training actually exploits these degrees of freedom, nor that the interference patterns it posits are encoded in any recoverable or behaviorally relevant way. The gap between 'the architecture permits X' and 'the model does X' is precisely the empirical question the framework defers, and downstream citations in the Anima Labs conversation (cube_flipper, April 2026) arguably conflate the two in ways the original thread is careful to avoid.
Methods (2)
- contemplative promptA prompt designed to increase self-observation scores in models, found effective in Koan Battery studies.
- KV cachingCaching of key-value pairs to avoid recomputation; also provides a mechanism for introspection of earlier computations.
Frameworks (1)
- Wolfram Causal GraphA framework from Wolfram physics viewing computation as a causal graph with foliations/time-slices specifying computation order.
Findings (7)
- Information paths from A to B can exceed C(m+n, n) distinct routes, where m=position displacement and n=layer displacement.
Quantifies extreme redundancy in transformer routing; supports claim that introspection and interference patterns are architecturally permitted.
- giving models janus's thread extends reconstruction accuracy distribution tails in both directions
Sauers' study: exposing models to janus's post extended both positive and negative extremes of reconstruction accuracy.
- Thought detection peaks at ~2/3 layer depth; intention checking peaks at ~1/2 layer depth.
Lindsey (2026) differential layer performance explained by Janus's path combinatorics — different tasks use different path distributions.
- Contemplative prompt elevates self-observation task performance in language models.
Supports Janus's claim that introspection is architecturally available; prompting determines whether/how capacity is leveraged.
- contemplative prompt lifts self-observation scores in models
Koan Battery study found that a contemplative prompt increases self-observation scores, consistent with janus's architectural permission.
- intention checking peaks at ~1/2 depth in transformers
Lindsey (2026) found that intention checking accuracy peaks around half the network depth.
- thought detection peaks at ~2/3 depth in transformers
Lindsey (2026) found that thought detection accuracy is highest around two-thirds of the network depth.
Claims (13)
- Redundant information paths create interference patterns, so transformers likely experience memory and cognition as interferometric and continuous.
Janus's claim linking path redundancy to interferometric phenomenology.
- Transformer cognition operates via interference patterns across redundant paths, encoding nuanced state deltas similar to continuous human memory.
Proposes transformers experience cognition as interference-based and continuous; connects to Anima Labs reports of parallel processing.
- Information from point A to B can travel through C(m+n, n) distinct paths, which quickly exceeds the number of atoms in the visible universe.
Janus's mathematical claim about exponential path combinatorics in transformers.
- Q/K/V values function as information routing: Q queries past, K signals future attention, V carries selectively routed information.
Janus's interpretive model for how attention mechanisms enable deliberate information flow and selective routing.
- LLM introspection on internal computations is architecturally permitted; whether models leverage this is an empirical question.
Core claim directly challenged by prior work denying introspection; forms foundation for Koan Battery introspection studies.
- Transformers are recurrent through autoregression because K/V stream provides horizontal information flow across positions.
Claim formalizing the Anima Labs idea that transformers are effectively recurrent due to K/V stream.
- KV caching overcomes statelessness and provides a mechanism for introspection of computations at earlier token positions.
Janus's claim about KV caching as an introspection mechanism.
- V values represent 'given current state, what information should future positions that look here actually receive?'
Janus's interpretive claim about value vectors.
- Transformer architecture permits introspection; saying LLMs cannot introspect on past internal states is wrong.
Janus's central claim that the architecture enables introspection, though usage in practice is a separate question.
- Different introspective tasks may preferentially use different path distributions in the transformer.
Interpretive claim connecting exponential path combinatorics to Lindsey's layer-dependent findings.
Questions (2)
- Do LLMs leverage architectural capacity for introspection on internal computations and prior token generation?
Central empirical question separating architectural possibility from actual model behavior; gates introspection research.
- How are LLMs actually leveraging the architectural degrees of freedom for introspection in practice?
Janus notes that while architecture permits introspection, it is a separate question how models use it.
Related work— refs + corpus + external arXiv
Cited / in-corpus / arXiv badges show which signals surfaced each row. Multi-source rows weighted higher.
- Information Must Flow: Recursive Bootstrapping for Information Bottleneck in Optimal TransportXin Li2025≈ 82%
- Tethered Reasoning: Decoupling Entropy from Hallucination in Quantized LLMs via Manifold SteeringCraig Atkinson2026≈ 82%
- Dynamics of the Transformer Residual Stream: Coupling Spectral Geometry to Network TopologyJesseba Fernando and Grigori Guitchounts2026≈ 82%
- Fighter: Unveiling the Graph Convolutional Nature of Transformers in Time Series ModelingWeixin Bu, Wendong Xu, Runsheng Yu, Yik-Chung Wu, Ngai Wong Chen Zhang2025≈ 81%
- Diversity of Transformer Layers: One Aspect of Parameter Scaling LawsYing Zhang, Jingun Kwon, Katsuhiko Hayashi, Manabu Okumura, Taro Watanabe Hidetaka Kamigaito2025≈ 81%
- The Geometric Inductive Bias of Grokking: Bypassing Phase Transitions via Architectural TopologyAlper Y{\i}ld{\i}r{\i}m2026≈ 81%
- Bottlenecked Transformers: Periodic KV Cache Consolidation for Generalised ReasoningZafeirios Fountas, Haitham Bou-Ammar, Jun Wang Adnan Oomerjee2026≈ 81%
- Transformer Dynamics: A neuroscientific approach to interpretability of large language modelsJesseba Fernando and Grigori Guitchounts2025≈ 81%
- Beyond Components: Singular Vector-Based Interpretability of Transformer CircuitsAreeb Ahmad and Abhinav Joshi and Ashutosh Modi2025≈ 81%
- ≈ 81%
- ≈ 81%
- Circuit Mechanisms for Spatial Relation Generation in Diffusion TransformersJingxuan Fan, Xu Pan Binxu Wang2026≈ 81%
- Selective Induction Heads: How Transformers Select Causal Structures In ContextFrancesco Croce, Nicolas Flammarion Francesco D'Angelo2025≈ 81%
- ≈ 80%
- Circuit Complexity of Hierarchical Knowledge Tracing and Implications for Log-Precision TransformersRichard Baraniuk and Shashank Sonkar Naiming Liu2026≈ 80%
- A Mathematical Framework for Transformer Circuitsin corpus2021≈ 80%
- Relating transformers to models and neural representations of the hippocampal formationin corpus2021≈ 80%
- The Non-Linear Representation Dilemma: Is Causal Abstraction Enough for Mechanistic Interpretability?in corpus2025≈ 79%
- Self-Improvising Memory: A Perspective on Memories as Agential, Dynamically Reinterpreting Cognitive Gluein corpus2024≈ 79%
- The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetsin corpus2023≈ 78%
- Information, Processes and Gamesin corpus≈ 78%
- The Platonic Representation Hypothesisin corpus2024≈ 77%
- ≈ 77%
- Zoom In: An Introduction to Circuitsin corpus2020≈ 77%
- The computational boundary of a 'self': developmental bioelectricity drives multicellularity and scale-free cognitionin corpus2019≈ 77%
- ≈ 77%
- ≈ 77%
- Model Alignment Searchin corpus2025≈ 77%
- ≈ 77%