mlsanityData to 14 Oct 2026

CoIn: Counting the Invisible Reasoning Tokens in Commercial Opaque LLM APIs

arXiv 2505.13778 ↗First posted 19 May 2025cs.AIcited by 14

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

As post-training techniques evolve, large language models (LLMs) are increasingly augmented with structured multi-step reasoning abilities, often optimized through reinforcement learning. These reasoning-enhanced models outperform standard LLMs on complex tasks and now underpin many commercial LLM APIs. However, to protect proprietary behavior and reduce verbosity, providers typically conceal the reasoning traces while returning only the final answer. This opacity introduces a critical transparency gap: users are billed for invisible reasoning tokens, which often account for the majority of the cost, yet have no means to verify their authenticity. This opens the door to token count inflation, where providers may overreport token usage or inject synthetic, low-effort tokens to inflate charges. To address this issue, we propose CoIn, a verification framework that audits both the quantity and semantic validity of hidden tokens. CoIn constructs a verifiable hash tree from token embedding fingerprints to check token counts, and uses embedding-based relevance matching to detect fabricated reasoning content. Experiments demonstrate that CoIn, when deployed as a trusted third-party auditor, can effectively detect token count inflation with a success rate reaching up to 94.7%, showing the strong ability to restore billing transparency in opaque LLM services. The dataset and code are available at https://github.com/CASE-Lab-UMD/LLM-Auditing-CoIn.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 23 of its 35 references that are in the map. First posted on arXiv 19 May 2025.

Builds on

23 of 35 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025Understanding Aha Moments: from External Observations to Internal Mechanisms3 Apr
  2. 2025LightThinker: Thinking Step-by-Step Compression21 Feb
  3. 2025s1: Simple test-time scaling31 Jan
  4. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug

Other references · 19

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  3. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  4. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  5. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
  6. 2024OpenAI o1 System Cardcited by 1,244
  7. 2022PAL: Program-aided Language Modelscited by 652
  8. 2024LLMs-as-Judges: A Comprehensive Survey on LLM-based Evaluation Methodscited by 465
  9. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  10. 2024HuatuoGPT-o1, Towards Medical Complex Reasoning with LLMscited by 265
  11. 2024The Impact of Reasoning Step Length on Large Language Modelscited by 153
  12. 2025LLM Post-Training: A Deep Dive into Reasoning Large Language Modelscited by 135
7 more
  1. 2025Auditing language models for hidden objectivescited by 83
  2. 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82
  3. 2024LLM Reasoners: New Evaluation, Library, and Analysis of Step-by-Step Reasoning with Large Language Modelscited by 70
  4. 2023Pairwise Proximal Policy Optimization: Harnessing Relative Feedback for LLM Alignmentcited by 57
  5. 2025Are You Getting What You Pay For? Auditing Model Substitution in LLM APIscited by 38
  6. 2025CALM: Curiosity-Driven Auditing for Large Language Modelscited by 6
  7. 2025Trust, but verifycited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 8.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2025Invisible Tokens, Visible Bills: The Urgent Need to Audit Hidden Operations in Opaque LLM Services
  2. 2025Token-by-Token Regeneration and Domain Biases: A Benchmark of LLMs on Advanced Mathematical Problem-Solving
  3. 2026One-Token Verification for Reasoning Correctness Estimation
  4. 2026Reading Between the Dots: Decoding Hidden Computation across Filler Tokens
  5. 2025OckBench: Measuring the Efficiency of LLM Reasoning
  6. 2026Not All LLM Reasoning is Visible in the Chain-of-Thought
  7. 2024Critical Tokens Matter: Token-Level Contrastive Estimation Enhances LLM's Reasoning Capability
  8. 2026On the Token Value Inequality in Efficient Reasoning