DEV Community

AI OpenFree
AI OpenFree

Posted on

VIDRAFT's `vidraft-darwin` Hits 510.58 TPS on Google's Fast Gemma Challenge — ~6 Speedup With Quality Intact

VIDRAFT's vidraft-darwin Hits 510.58 TPS on Google's Fast Gemma Challenge — ~6× Speedup With Quality Intact

TL;DR: Korean AI startup VIDRAFT topped the verified leaderboard of Google's The Fast Gemma Challenge — a software-only inference optimization competition co-run by Google's Gemma team and Hugging Face — achieving 510.58 tokens per second (TPS) and a perplexity (PPL) of 2.39 on the gemma-4-E4B-it multimodal model. The result represents roughly a 6× throughput improvement over the baseline without sacrificing output quality, meaning the same service could theoretically run on one-sixth the GPU capacity. If you care about inference efficiency and cost-per-token at scale, this is worth paying attention to.


What it is

The Fast Gemma Challenge is a global inference-optimization competition jointly operated by the Google Gemma team and Hugging Face. The rules are deliberately narrow to make results comparable:

  • Every participant receives the same model (gemma-4-E4B-it, Google's publicly released multimodal model) and the same GPU hardware.
  • Only software-level optimizations are permitted — swapping the model, disabling text/image/audio modalities, or any other model-level shortcuts are explicitly banned.
  • Rankings are determined exclusively by organizer-reproduced results: the judges re-run each submission on a private prompt set and measure both speed (TPS) and quality (PPL) independently. Self-reported numbers don't count.

VIDRAFT's autonomous AI agent system vidraft-darwin claimed the #1 verified spot on that leaderboard, as announced on August 2, 2026.


How it works

VIDRAFT has not disclosed the full implementation details, but the press coverage points to two internal technology pillars that fed into this result:

  • VK-series inference engine: VIDRAFT's proprietary inference runtime, which the company has developed as part of its broader model-serving stack. The engine is designed to squeeze more throughput out of standard hardware through software-layer optimizations.
  • POCKET on-device platform: An optimization platform originally built to run large models on hardware without a discrete GPU. The efficiency techniques developed for that constrained environment appear to transfer well to accelerated GPU inference — a classic case of on-device optimization techniques improving server-side throughput.

At a conceptual level, the approach targets the gap between raw hardware capability and what a naïve model-serving stack actually utilizes. Common levers in this space include operator fusion, attention kernel optimization, quantization-aware serving, memory layout improvements, and smarter batching/scheduling — though VIDRAFT has not specified which combination was applied here.

Critically, the competition's PPL constraint means pure speed tricks that degrade output distribution (e.g., aggressive lossy quantization with no quality guard) are penalized. The verified PPL of 2.39 suggests the optimizations preserved the model's generation quality relative to the baseline.


Benchmarks & results

All figures below are from the organizer-verified leaderboard run (not self-reported):

Metric vidraft-darwin Approximate Baseline
Throughput 510.58 TPS ~85 TPS (implied by ~6× claim)
Perplexity (PPL) 2.3929
Speedup vs. baseline ~6×
  • The ~6× speedup figure is stated by VIDRAFT relative to the stock inference speed of the same gemma-4-E4B-it model on the same hardware.
  • A 6× throughput gain translates directly to infrastructure cost: the same request volume could theoretically be served with ~83% fewer GPUs, or equivalently, the same hardware could handle 6× the traffic.
  • This is the highest verified score among submissions where quality (PPL) was also preserved, per the article's framing.

The full leaderboard is publicly viewable through the official Fast Gemma Challenge page.


How to try it

The source article does not announce a public release of the vidraft-darwin inference stack or the specific optimizations used in this competition submission. Access to the underlying optimization engine is not publicly documented in this announcement.

What is public:

  • The competition leaderboard — you can inspect VIDRAFT's verified entry via the official Fast Gemma Challenge leaderboard hosted by Hugging Face/Google.
  • The base modelgemma-4-E4B-it is a publicly available model on Hugging Face, so you can experiment with your own inference optimizations against the same baseline.
  • VIDRAFT has previously published model releases and inference tooling (including the VKAE leaderboard and container) — check their Hugging Face organization and GitHub for any public artifacts.

If VIDRAFT releases the optimized serving stack or a public API, this article will note it. Watch their official channels for updates.


FAQ

Q: Is this a fine-tuning competition or a systems/inference competition?
A: Purely systems. Participants cannot modify model weights or disable modalities. Only software-level inference stack changes are allowed. Rankings are determined by the organizer re-running submissions — making score inflation structurally impossible.

Q: Does a 6× TPS gain actually mean 6× lower serving cost in production?
A: In an idealized, throughput-bound scenario, yes — the same GPU fleet handles 6× the token volume, or you scale down to ~1/6 the hardware for the same load. Real-world cost savings depend on whether your workload is actually throughput-bound vs. latency-bound, batching strategy, and memory constraints.

Q: What is vidraft-darwin exactly?
A: It is VIDRAFT's autonomous AI agent system. For this competition it served as the inference-optimization framework applied on top of gemma-4-E4B-it. VIDRAFT also develops a fully open foundation model called AETHER and the Darwin model family as separate products.

Q: How do I verify the result myself?
A: The official Fast Gemma Challenge leaderboard (run by Google Gemma team + Hugging Face) is the authoritative source. Only organizer-reproduced scores appear there.


Originally reported by AI타임스 (2026-08-03) — source article.

Top comments (0)