How Lossless Is Lossless Speculative Decoding? The Role of Numerical Precision in Orthrus

Ilya Koziev, Leonid Sinev, Ivan Oseledets

Published September 14, 2026 · on the feed September 15, 2026 · ▲ 23 · arXiv 2609.15504

Efficiency & inferenceAgentsModel architecture No code arXiv ↗Hugging Face ↗

The abstract

Orthrus is a hybrid autoregressive-diffusion architecture that accelerates autoregressive language-model inference by generating multiple tokens in parallel while using a frozen autoregressive backbone. Its central claim is that an intra-model consensus mechanism enables lossless speculative decoding, producing the same output sequence as the autoregressive model. We independently reproduce Orthrus and examine this claim under different numerical precisions. Under BF16 inference, exact trajectory matching occurs in only 45% of cases for the authors' checkpoint and 43% for our independently trained model across 1,190 prompts from 12 domains. The probability of exact matching is also strongly associated with the response-conditional perplexity of the reference model. Despite this trajectory divergence, Orthrus does not show systematic degradation on downstream lm-eval-harness benchmarks. In contrast, repeating the trajectory evaluation with FP32 yields exact trajectory matching on all evaluated prompts. These results show that the practical losslessness of Orthrus depends on numerical precision and that exact trajectory equivalence should be evaluated separately from downstream task performance.

The Brief

2:15

A short podcast summary of the paper. Written and voiced by AI.

Transcript

How Lossless Is Lossless Speculative Decoding? The Role of Numerical Precision in Orthrus. By Ilya Koziev and two others. Published on the fourteenth of September. No code repository is linked to it.

Orthrus is a hybrid autoregressive-diffusion architecture. It accelerates autoregressive language-model inference by generating multiple tokens in parallel, while using a frozen autoregressive backbone. Its central claim is that an intra-model consensus mechanism makes this speculative decoding lossless, producing the same output sequence as the autoregressive model would. The finding here is that in practice this depends on numerical precision. Lossless is a strong word. It means not approximately the same text, but exactly the same sequence.

The authors independently reproduce Orthrus and examine the claim under different numerical precisions. Under BF16 inference, the trajectories match exactly in only forty-five percent of cases for the original authors' checkpoint, and in forty-three percent for the independently trained model, across one thousand one hundred ninety prompts from twelve domains. The probability of an exact match is also strongly associated with the response- conditional perplexity of the reference model. Fewer than half of the outputs, in other words, were token for token identical to what the backbone alone would produce.

Two further results frame that divergence. Despite it, Orthrus does not show systematic degradation on downstream lm-eval-harness benchmarks. And repeating the trajectory evaluation with FP32 yields exact trajectory matching on every prompt evaluated. The divergence shows up in the exact text, then, but not in the scores.

The claim, then, is qualified rather than overturned. Under FP32, exact matching holds on all the prompts tested. Under BF16, most trajectories diverge, while benchmark scores show no systematic loss. The study concerns one architecture, examined at these two precisions, on the stated set of prompts and benchmarks. The link to perplexity is reported as an association.

The authors draw a methodological conclusion. The practical losslessness of Orthrus depends on numerical precision, and exact trajectory equivalence should be evaluated separately from downstream task performance, because, as this reproduction shows, one can fail while the other holds.

Paper Quest · 7 chapters · about 39 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

A claim of perfection is a challenge. This quest takes it up.

A new architecture speeds up a language model by proposing several tokens at once from a diffusion view and checking them with the frozen original model. Its authors call it lossless: the same output as the original.

The road ahead

  1. 1 · The problem ~6 min A fast decoder claims to give exactly the same output as its original model, and you must decide how to check such a strong claim.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min Whether the fast decoder is truly lossless depends on numerical precision, and matching benchmark scores cannot show identical outputs.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Reproduce the fast decoder, diff its outputs against the original in BF16, check benchmarks, then repeat the diff in FP32.
  6. 6 · The experiment ~6 min You’ll guess: Under BF16 inference, on what share of 1,190 prompts did the released Orthrus checkpoint produce exactly the same output as its autoregressive model?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.