Skip to content
Preprint

SCIT: Testing Causal Cache Carriers in Latent Chain-of-Thought Models

Aug 2026 · 1 citation · 22 references
Computer Science

TL;DR

SCIT, the Suffix Cache Interchange Test, is introduced, a causal protocol that constructs exact source-recipient counterfactuals, patches declared cache segments, and identifies which transformer object carries the counterfactual computation.

Abstract

Latent chain-of-thought models move intermediate reasoning from emitted text into continuous states, improving compactness but hiding the causal object. We introduce SCIT, the Suffix Cache Interchange Test, a causal protocol that constructs exact source-recipient counterfactuals, patches declared cache segments, and identifies which transformer object carries the counterfactual computation. SCIT combines sufficiency tests with K/V component splits, hidden-state controls, semantic source controls, decoded validation, and matched corruption. On CODI-GPT2 and a Sim-CoT-style GPT-2 reproduction, counterfactual arithmetic transfers primarily through value-cache suffix trajectories rather than hidden states, keys, reusable answer slots, or single-token triggers. Complete sufficiency-and-necessity evidence for the late-value-suffix mechanism holds for the main CODI-GPT2 checkpoint; the Sim-CoT-style checkpoint shows the same sufficiency and decoded-control pattern but insufficient matched-corruption evidence for a necessity call. Beyond these local arithmetic cells, SCIT reveals carrier-regime shifts: arithmetic-like GPT-2/1B cells preserve latent-tail value/KV transfer, whereas competent 8B and repaired non-arithmetic cells route through prompt-prefix or full-cache K/V; boundary cells receive no mechanism call. SCIT therefore contributes a cache-level diagnostic, a checkpoint-specific GPT-2 arithmetic mechanism, and a competence-gated carrier map rather than a universal latent-tail claim.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Are Stated Reasoning Steps Causally Load-Bearing?

This work uses synthetic multi-hop lookup tasks to measure faithfulness causally at the activation level, specifically on self-generated reasoning, and aims to measure faithfulness causally at the activation level, specifically on self-generated reasoning.

Abhiram Bhupatiraju, Rayan Nyaupane · 0 citations
#artificial intelligence Preprint Sep 2026

It's the Problem, Not the Path: Budget and Difficulty Confounds in LLM Reasoning Trajectories

Two restart-controlled truncation probes separate when a solution fits the continuation budget from when a prefix carries value that fresh computation cannot buy, and a pre-registered, difficulty-controlled test finds no detectable outcome information in early-window internal signals beyond a problem-difficulty baselin...

Yigit Utku Bulut · 1 citation
Preprint Aug 2026

A Pre-Specified Construction-Confirmation Test of Operation-Level Causal Transfer Across Finite Isomorphic Symbolic Domains

Behavioral accuracy, linear decodability, and successful activation interventions do not by themselves show that a model carries an operation-level structure from one symbolic domain to another. We ask a narrower question in finite isomorphic state spaces: if the hidden-state difference between two operations is estima...

Xinyi Shan · 0 citations
Conference Sep 2026

Integrating structural causal models into large language models: the PertAdapt framework

To address the systemic flaw of current large-scale language models exhibiting logical deduction failures when faced with out-of-distribution test data and synthetic counterfactual interference, this paper proposes a PertAdapt causal adaptive framework integrating directed acyclic graph constraints. By constructing qua...

Zi-Hao Zhao · 0 citations
#machine learning Preprint Aug 2026

CoEvo: Oracle-Grounded Self-Evolution of a Single Model for Multi-Step Causal Reasoning

CoEvo is an oracle-grounded self-evolution framework where a single model alternates between Proposer and Solver, and enables an 8B LLM to sustain self-evolution, surpassing distillation baselines and the strongest proprietary reference on path correctness.

Jian Zhang, Bing-Yi Wang, Yi-Zhi Liu · 0 citations
Preprint Sep 2026

CPUNeSy: Controlling Model Writes for Reliable Neuro-Symbolic Reasoning

CPUNeSy, a serving architecture that controls model writes to symbolic state via a task-defined predicate interface and certificate gate, abstaining when grounding passes disagree is introduced, showing deterministic execution drives most accuracy recovery on derivation-heavy tasks.

Zeyan Li, Si-Yuan Qiu, Shuai Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.