Chain-in-Tree: Back to Sequential Reasoning in LLM Tree Search

Test-time scaling improves large language models (LLMs) on long-horizon reasoning tasks by allocating more compute at inference.LLM inference via tree search (LITS) achieves strong performance but is highly inefficient.We propose Chain-in-Tree (CiT), a plug-in framework that decides when to branch during search instead of expanding at every step.CiT introduces lightweight Branching Necessity (BN) evaluations, including BN-DP (direct prompting) and BN-SC (self-consistency).Integrated into Tree of Thoughts, ReST-MCTS, and RAP, BN-DP reduces token generation, model calls, and runtime by 75-85% on GSM8K and Math500, with often negligible or no accuracy loss.BN-SC typically yields substantial savings (up to 80%) generally but shows instability in 1-4 out of 14 settings, caused by a small subset of examples that produce extremely long reasoning steps.We theoretically prove that BN-DP never increases policy invocations and release unified implementations applicable across LITS frameworks.The full codebase is publicly available at https: //github.com/xinzhel/chain_in_tree.