arXiv 2510.06557 (also 2606.x in the news) introduces "Markovian Thinker," a reasoning framework from Mila and CMU that uses fixed-size "blocks" to break the quadratic complexity curse of Long Chain-of-Thought (LongCoT). The result: LongCoT reasoning at linear cost, with quality on par with full LongCoT.

The LongCoT curse: Long Chain-of-Thought (e.g., OpenAI o1, DeepSeek R1) generates thousands of reasoning tokens per query. The cost is O(n²) in the number of reasoning tokens — the attention complexity grows quadratically. For a 10K-token reasoning chain, the attention compute is 100M operations per layer.

The Markovian Thinker fix: split the reasoning into "blocks" of fixed size (e.g., 1024 tokens), and only attend within each block + a small "summary" of previous blocks. The block size is the only hyperparameter, and the result is O(n × b) complexity (linear in the total length, with a small constant b for the block size).

The benchmark: on a set of math and code reasoning tasks, Markovian Thinker with block size 1024 matches the quality of full LongCoT with 10× less compute. The reasoning quality is preserved because the "summary" of previous blocks captures the essential information.

The bigger takeaway: "fixed-block reasoning" is a significant step toward scalable LongCoT. The "LongCoT is too expensive" critique is the biggest barrier to deploying reasoning models in production, and Markovian Thinker is a clean, effective fix. For the industry, this means "reasoning as a service" can be priced more competitively, and reasoning models will become the default for complex tasks.