The Circuitry
THE CIRCUITRYYour one-stop source for all tech news
HOMETODAYNEWSFEEDEVENTS
BOOKMARKS
RSS
© 2026 The Circuitry
About UsSourcesContactCorrectionsPrivacy
  • Today
  • Feed
  • Events
  • Saved
Scroll for more
Verification
VERIFIEDConfidence: HIGH
Source identified
Claims cross-referenced
No discrepancies found
Fact-check summary

Google's official blog, NVIDIA, The New Stack, and Hugging Face confirm the June 10, 2026 DiffusionGemma release: a 26B MoE diffusion model delivering up to 4x faster local text generation.

Sourcing
1source

via Ars Technica

Ars Technica · track record
27Stories
100%Verified
230d
All sources →
Markets
GOOGL···

Live quote · not investment advice

Home/Tech/Google DeepMind releases DiffusionGemma for 4x faster local AI
VERIFIEDBy Xavier Rivera· ·2 min read

Google DeepMind releases DiffusionGemma for 4x faster local AI

Google DeepMind released DiffusionGemma, a parallel text-generation model that produces up to four times more tokens per second than similarly sized autoregressive Gemma models on local GPUs. The approach trades higher error rates for better compute efficiency on non-linear tasks but remains experimental.

Source:Ars Technica
Post
Google DeepMind releases DiffusionGemma for 4x faster local AI
TL;DRAI · 60 sec read

Google DeepMind releases DiffusionGemma, a 26-billion-parameter Mixture of Experts model that generates text in parallel via diffusion rather than token by token. It reaches 700-1,000 tokens per second on RTX 5090 and H100 GPUs, four times faster than autoregressive Gemma models, by shifting the bottleneck from memory to compute on local hardware.

Google DeepMind has released DiffusionGemma, a new member of the Gemma 4 open model family that generates text in parallel rather than one token at a time.

DiffusionGemma uses a parallel generation approach borrowed from image models. Unlike autoregressive models that produce text left to right one token at a time, DiffusionGemma starts with a field of placeholder tokens and runs over the canvas multiple times to generate likely tokens. It uses those to improve estimation of others before finalizing outputs in one large block of denoised text. Google says this makes the model faster and more efficient on local hardware such as an Nvidia DGX or a gaming GPU.
In language, a single bad token can render an entire block meaningless and require restarting, unlike image generation where one flawed pixel rarely ruins the result.

The model is a 26-billion-parameter Mixture of Experts design. Only 3.8 billion parameters activate during inference, allowing it to fit in the 18GB RAM of a high-end GPU. In testing on an RTX 5090, DiffusionGemma produces around 700 tokens per second. On a single Nvidia H100, it reaches 1,000-plus tokens per second, roughly four times the output of similarly sized autoregressive Gemma models.
POST FROM @GoogleDeepMind· official announcement tweet matching the article topic and date
https://x.com/GoogleDeepMind/status/2064741061352636762

Parallel generation shifts the performance bottleneck from memory to compute. The model can generate up to 256 tokens at once. Google reports measurable gains on non-linear tasks including in-line editing, molecular sequencing and mathematical graphing. An animation in the release demonstrates how DiffusionGemma solves Sudoku puzzles by continuously self-correcting large sets of tokens, a task that challenges standard autoregressive models because each token depends on future ones.
From The CircuitryThe Feed — live briefs across tech, all day.See what’s happening →

Text diffusion carries trade-offs that limit its use in cloud models. Google has experimented with the technique for its Gemini models but notes a higher error rate. In language, a single bad token can render an entire block meaningless and require restarting, unlike image generation where one flawed pixel rarely ruins the result. Diffusion models also waste resources on short outputs that autoregressive models can complete in just a few steps.
An animation in the release demonstrates how DiffusionGemma solves Sudoku puzzles by continuously self-correcting large sets of tokens, a task that challenges standard autoregressive models because each token depends on future ones.
Local hardware benefits more from diffusion than cloud systems do. Cloud autoregressive models batch jobs across users and leverage high-bandwidth memory to stay efficient. Local AI often faces idle cycles and lower memory bandwidth. Diffusion makes better use of available compute, outperforming even Google's Multi-Token Prediction drafters that also target wasted cycles. Google describes DiffusionGemma as experimental.
Why this mattersAI · ~100 words

Tap a lens to see what this story means for you.

Reader-supported
DonateBuy me a coffee →Follow@thecircuitry_ →Follow@thecircuitry.to →

Reader-supported · The Brief

Liked this? The Brief brings you the whole day in tech, verified, every morning. Two minutes, free forever.

HELP US IMPROVE
From The Circuitry

See what’s happening right now

The Feed runs all day — short, verified briefs the moment they break.

Open the Feed →
From The Circuitry

Follow @thecircuitry_

Every story we publish, as it happens. No noise between.

Follow on X ↗On Bluesky ↗

Reader-supported

The Circuitry is a passion project I've always wanted to build, and I love the work behind it.

Running it costs real money. APIs, hosting, time. To keep improving the site and growing this into something useful for everyone, those costs have to be covered.

Any contribution is appreciated. If not, no pressure. Thanks for reading.

Buy me a coffee
AIGoogleDeepMindGemma
More fromArs Technica
  • Samsung debuts its first wide-body foldable in 2026 Galaxy Z8 lineup

    Tech · 17d
  • Microsoft Secure Boot bypassed for 13 years via unrevoked shims

    Tech · 24d
  • Blue Origin reportedly raising up to $10B in first private capital round

    Tech · 1mo
More inTech
  • Tesla and SpaceX confirm Terafab chip fab in Texas

    Tech · 1d
  • OpenAI Urges Federal Judge to Throw Out Apple's Trade Secrets Complaint

    Tech · 2d
  • Meta introduces Muse Code, its terminal-based coding agent

    Tech · 2d
SupportThe Work

The Circuitry is reader-supported. If you find the daily brief useful, you can buy me a coffee to keep it going.

Buy a coffee →
SubscribeCircuitry Brief

Liked this? The Brief brings you the whole day in tech, verified, every morning. Free forever.

MORE IN TECH

Tesla and SpaceX confirm Terafab chip fab in Texas

Tesla and SpaceX have confirmed Grimes County, Texas as the site for their Terafab semiconductor megafactory, with the first phase costing roughly $16.8 billion. The project targets the largest chip manufacturing facility on the planet to supply over 1 terawatt of compute per year that exceeds current and future global production capacity.

OpenAI Urges Federal Judge to Throw Out Apple's Trade Secrets Complaint

OpenAI has filed a motion asking a federal judge to dismiss Apple's trade secrets lawsuit, describing the claims as meritless. The dispute, which follows a July suit and this week's injunction request from Apple, highlights tensions after their prior partnership on Siri and OpenAI's hardware push.

Meta introduces Muse Code, its terminal-based coding agent

Meta has released an early beta of Muse Code, a terminal-based coding agent driven by the updated Muse Spark 1.2 model and positioned against Anthropic's Claude Code and OpenAI's Codex. Substantially lower rates, including a contributor plan at $0.10 for every million tokens received, may encourage migration away from higher-priced options such as Anthropic's Sonnet 5.