惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

L
LangChain Blog
Recent Announcements
Recent Announcements
GbyAI
GbyAI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Azure Blog
Microsoft Azure Blog
N
Netflix TechBlog - Medium
人人都是产品经理
人人都是产品经理
MongoDB | Blog
MongoDB | Blog
D
DataBreaches.Net
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
WordPress大学
WordPress大学
U
Unit 42
腾讯CDC
D
Docker
The GitHub Blog
The GitHub Blog
阮一峰的网络日志
阮一峰的网络日志
Vercel News
Vercel News
I
InfoQ
Jina AI
Jina AI
爱范儿
爱范儿
宝玉的分享
宝玉的分享
博客园 - Franky
G
Google Developers Blog
P
Proofpoint News Feed

DEV Community

Authentication Security Deep Dive: From Brute Force to Salted Hashing (With Java Examples) Why AI Systems Don’t Fail — They Drift Spilling beans for how i learn for exam😁"Reinforcement Learning Cheat Sheet" I Replaced Chrome with Safari for AI Browser Automation. Here's What Broke (and What Finally Worked) How Python Borrows Other People's Work The $40 Architecture: Processing 1 Billion API Requests with 99.99% Uptime Vibe Coding: A Workflow Guide (From Zero to SaaS) Most webhook security guides protect the wrong side. The scary part is delivery. Headless CMS for TanStack Start: Build a Blog with Cosmic EU Age Verification App "Hacked in 2 Minutes" — What Actually Happened Comfy Cloud’s delete function does not actually remove files Running AI Models on GPU Cloud Servers: A Beginner Guide Event-driven media intelligence with AWS Step Functions and Bedrock I scored 500 AI prompts across 8 quality dimensions — here's what broke How to Call Google Gemini API from Next.js (Free Tier, No Backend Needed) The Portal Protocol: Reclaiming Human Connection in the Age of AI How to Fix Your Team's Scattered Knowledge Problem With a Self-Hosted Forum Intro to tc Cloud Functors: A Graph-First Mental Model for the Modern Cloud Designing Multi-Tenant Backends With Both Ownership and Team Access I Built a Neumorphic CSS Library with 77+ Components — Here's What I Learned PostgreSQL Performance Optimization: Why Connection Pooling Is Critical at Scale Cómo construí un SaaS multi-rubro para gestionar expensas en Argentina con FastAPI + Vue 3 🚀 I Built an Ethical Hacking Scanner Tool – Open Source Project I Replaced /usage and /context in Claude Code With a Single Statusline A Pythonic Way to Handle Emails (IMAP/SMTP) with Auto-Discovery and AI-Ready Design I Collected 8.9 Million Polymarket Price Points — Here's What I Found About How Markets Really Move EcoTrack AI — Carbon Footprint Tracker & Dashboard Everyone's Using AI. No One Agrees How. 5 self-hosted ebook managers worth trying in 2026 Building Your First AI Agent with LangChain: From Chatbot to Autonomous Assistant
Orthrus: Parallel Token Generation That Doesn't Change Yo...
pickuma · 2026-05-28 · via DEV Community

Speculative decoding cut LLM inference latency by predicting multiple tokens ahead and validating them with the base model. It works — but you pay for it with a separate draft model, a second KV cache, and acceptance rates that fall off when the drafter misreads the distribution. Orthrus is a research direction that aims for the same speedup without those overheads. It bolts a trainable diffusion attention module onto each layer of a frozen autoregressive Transformer and uses it to emit blocks of tokens in parallel.

The claim that should catch a developer's eye: 32 tokens per forward pass, while the base model's output distribution stays mathematically identical. If the math holds in practice, you get parallel generation without the "is the drafter agreeing with the target" hand-wringing that defines speculative decoding.

This is still early research, not a pip install. The architecture is worth understanding anyway, because it points at a different design space for self-hosted inference — one where the speedup comes from inside the model, not from a separate drafter running next to it.

How Orthrus generates tokens in parallel

The base Transformer stays frozen. Orthrus inserts a diffusion attention module at each layer that operates on a set of placeholder positions — a block of 32 future tokens in the published configuration. During inference, the diffusion module iteratively refines those placeholders into concrete tokens through a small number of denoising steps that share the existing layer activations.

The "preserves the output distribution exactly" claim is the unusual part. Speculative decoding achieves distribution preservation through rejection sampling: the drafter proposes, the target model verifies, mismatches get rolled back. Orthrus reaches the same guarantee through a different mechanism. The diffusion module is conditioned on the frozen model's hidden states and uses them as the convergence signal, so the accepted outputs are equivalent to what the AR model would emit if you sampled token-by-token at the same temperature. The cost moves from "sometimes the draft is wrong, accept fewer tokens" to "sometimes denoising needs more steps to converge."

The shared KV cache is what makes this attractive for self-hosted deploys. Speculative decoding implementations such as Medusa and Eagle generally require either a separate drafter cache or extending the main cache with drafter-specific entries. Orthrus reuses the frozen model's KV cache directly, which keeps the memory footprint closer to a single model than a model-plus-drafter pair.

Orthrus is described in research materials, not shipped as a production library. The properties below come from the architectural design and reported configuration, not independent benchmarks. Treat them as a hypothesis to verify on your own workload before you plan any infrastructure around them.

How it compares to speculative decoding

Speculative decoding has been in production for a while. vLLM, TensorRT-LLM, and llama.cpp all support some flavor of it. The mechanics: you load a small drafter (sometimes a tuned Medusa head, sometimes a separate 1B-class model), the drafter proposes K tokens, the target model runs a single forward pass to verify all K at once, and the runtime accepts the longest matching prefix.

The pieces Orthrus changes:

  • Drafter cost. No separate model to load, train, or maintain. The diffusion modules ship as part of the base model's layers.
  • KV memory. Shared with the base model, not doubled by a sidecar drafter.
  • Acceptance behavior. Outputs are distributionally identical to the base AR sample by construction, not probabilistically identical via rejection sampling.
  • Training cost. The diffusion attention modules need to be trained once per base model. That's not free, but it's amortized across every deployment of that checkpoint.

Until there's a published implementation against a well-known base model and a reproducible benchmark on standard hardware, the wall-clock speedup against Eagle-2 or Medusa-2 is hard to put a number on. The architectural argument is strong; the empirical comparison is still pending.

What this means if you're self-hosting

If you're running a local LLM behind a developer tool, the latency that matters is time-to-first-token plus tokens-per-second on the decode side. Speculative decoding mainly attacks the decode side. Orthrus targets the same metric with a different cost profile.

A few practical questions to keep on the watchlist:

  • Quantization. Most self-hosted setups run 4-bit or 8-bit weights. Whether the trained diffusion modules survive aggressive quantization is an open question — modules trained in fp16 don't always round-trip cleanly through GPTQ or AWQ.
  • Batch size interaction. Speculative decoding's speedup shrinks as batch size grows, because the verifier pass is already saturating compute. Orthrus's parallel block generation interacts with batching differently depending on how the denoising steps schedule, and the published material doesn't yet have a multi-batch comparison.
  • Long-context decoding. 32-token blocks are the easy case for short responses. Multi-thousand-token outputs need 100+ blocks back-to-back; per-block convergence cost matters more than peak parallelism in that regime.

If you're using an AI coding tool that runs against a local inference server, the wall-clock improvements from techniques in this family are what make local models competitive with cloud APIs on edit latency.

Caveats and what's missing

The discussion around the architecture surfaces the unanswered questions cleanly. There's no released checkpoint against a popular base model (Llama, Qwen, Mistral) that a developer can drop into an existing inference runtime. There's no head-to-head benchmark against Eagle-2 or Medusa-2 on the same hardware and prompt distribution. There's no documented behavior on tool-use or function-calling outputs, which tend to be the prompts where speculative decoding does worst because the next-token distribution is structurally constrained.

None of that is a knock on the research — it's the normal early-architecture gap. It does mean that if you're planning self-hosted LLM infrastructure for the next two quarters, speculative decoding is still the default. Orthrus is the thing to track, not to bet on yet.


Originally published at pickuma.com. Subscribe to the RSS or follow @pickuma.bsky.social for new reviews.