Liquid AI ships draft models that cut function-calling latency by 57%
DSpark checkpoints add speculative decoding to three LFM2.5 models. Liquid AI reports up to 3.18x more throughput on a GPU and 2.87x on device, with quality unchanged, and llama.cpp and SGLang support upstream on day one.
Source
Up to 3.2x Faster Inference with LFM2.5-DSparkHugging Face Blog · Original published August 20, 2026
Liquid AI released DSpark draft checkpoints for three models in its LFM2.5 family: LFM2.5-1.2B-Instruct, LFM2.5-2.6B, and LFM2.5-8B-A1B. They add a speculative decoding path that trades a small memory increase for a large decoding speedup, and the company reports output quality is unchanged.
The numbers
Liquid AI reports up to 3.18x throughput improvement on a GPU and up to 2.87x on device. The figure that matters most for agents is a different one: function-calling latency drops by 57% on average for LFM2.5-2.6B. Agent loops spend their time waiting on short tool calls, and halving that wait changes what feels usable on a laptop or a phone.
Support for llama.cpp and SGLang landed upstream at release rather than weeks later, which is the difference between a benchmark post and something you can run this afternoon.
- Up to 3.18x throughput on GPU, up to 2.87x on device.
- Function-calling latency down 57% on average for LFM2.5-2.6B.
- Draft checkpoints for LFM2.5-1.2B-Instruct, LFM2.5-2.6B, and LFM2.5-8B-A1B.
- llama.cpp and SGLang integration open-sourced upstream on day one.
Why speculative decoding wins here
Decoding is memory-bound, not compute-bound. Most of the latency is streaming weights from DRAM into SRAM rather than doing arithmetic. A small draft model proposes several tokens, the target model verifies them in a single forward pass, and the cost of loading those weights is shared across every token verified instead of paid per token.
DSpark combines three parts: a DFlash-style parallel backbone conditioned on the target model's context features, a lightweight sequential head modeled as a Markov chain between neighboring tokens that raises acceptance at later positions, and a confidence-scheduled verifier that drops low-confidence suffixes when checking them would cost more than it saves.
One training detail worth stealing
The draft models are deliberately plain: attention-only, five layers, a block of nine. Liquid AI ran 15 epochs over the full mix and then picked the epoch with the highest acceptance rate rather than the lowest loss.
That choice is the whole trick. Loss measures how well the draft imitates the target in general; acceptance rate measures how often its guesses actually survive verification, which is the only thing that turns into speed. Optimizing the metric you are paid on rather than the one that is easy to plot is a habit worth carrying into your own work.
Related
GPT-5.6 Sol drops to $4 and $20, and overtakes Claude Opus 5 on cost
OpenAI cut Sol's API price on August 21: input from $5 to $4, output from $30 to $20, cached input from $0.50 to $0.40. On a standard task the model goes from more expensive than Claude Opus 5 to cheaper than it. The cut is promotional and runs at least through November 21.
OpenAIverified

The best-scoring speech models reproduce the benchmark's own transcription errors
Hugging Face ran three diagnostics across 11 open speech recognition models and found that the ones with the lowest word error rates are the most likely to repeat mistakes that exist only in the reference transcript. On some tests the models appear to work out which dataset they are being scored on and switch spelling conventions accordingly. A low error rate can mean the model learned the dataset rather than the speech.
Hugging Faceverified
Gemini 3.7 Flash, read from Google's own numbers
Google shipped it on August 13, 2026, 23 days after Gemini 3.6 Flash, with large gains on coding and agent benchmarks and an introductory price it labels as such. All of that holds. Four things are visible only if you open the model card instead of the launch post, and one of them is a score that went down.
Googleverified
