RecurrentGemma
Open 2B language model on the Griffin recurrent architecture — no KV cache, fast long-sequence inference.
About
RecurrentGemma-2B is an open language model from Google DeepMind built on the novel Griffin architecture, which replaces global attention with a mixture of linear recurrences and local attention. Because it compresses input into a fixed-size state instead of a growing KV cache, it needs substantially less memory than a comparable transformer and runs inference on long sequences much faster — while matching Gemma-2B's downstream performance despite being trained on fewer tokens.
Released with both pre-trained and instruction-tuned checkpoints plus efficient JAX training code (including a specialized Pallas kernel for TPUs), RecurrentGemma is a landmark proof that attention-free architectures can compete with transformers at matched budgets. It shipped under Gemma-style terms, and its release accelerated industry interest in linear-time sequence models as an alternative to the KV-cache bottleneck.
Specs
Context window
Pricing
Free quota
API access
Weights
Released
Benchmarks
Provider-reported unless a source says otherwise. Benchmarks are marketing-adjacent by nature — treat them as directional.
Use cases
Trust score — 6/10
Scored 6/10 (metrics tier, metrics-v1). Evidence: Verified via vendor site/docs/GitHub and reputable coverage, wave 69; Trending score 65/100 from researcher assessment.