Run a speculative-decoding round at a time: a cheap drafter proposes γ tokens, the target verifies them in parallel and accepts a prefix plus one free token. Drive α, γ, and drafter cost c; watch the accepted length converge to Leviathan's Ω and the speedup peak, then fade.
Speculative decoding lets a small, even adversarial, drafter propose tokens that a big model verifies in parallel — and the output is provably the big model's, unchanged. Real drafters land at α ≈ 0.6–0.8 for a ~2× win. But the verifier still runs every token, so it's a latency win, not a trust win.