Surpassing vLLM with a Generated Inference Stack
lukebechtel
31 points
11 comments
March 10, 2026
Related Discussions
Found 5 related stories in 77.5ms across 8,303 title embeddings via pgvector HNSW
- Executing programs inside transformers with exponentially faster inference u1hcw9nx · 17 pts · March 12, 2026 · 52% similar
- KV Sharing, MHC, and Compressed Attention gmays · 29 pts · May 19, 2026 · 51% similar
- Show HN: A new benchmark for testing LLMs for deterministic outputs khurdula · 50 pts · April 29, 2026 · 51% similar
- UK sovereign LLM inference benjamintnorris · 104 pts · May 15, 2026 · 51% similar
- SubQ: Sub-quadratic LLM built for 12M-token context gagan2020 · 17 pts · May 05, 2026 · 49% similar
Discussion Highlights (5 comments)
ntonozzi
Why do they need to run benchmarks to confirm performance? Can't they run an example prompt and verify they get the exact same output token probabilities for all prompts? The fact that they are not doing this makes me suspicious that they are in fact not doing the exact same thing as vLLM. It is also a bit weird that they are not incorporating speculative decoding, that seems like a critical performance optimization, especially for decode heavy workloads.
rfw300
OK... we need way more information than this to validate this claim! I can run Qwen-8B at 1 billion tokens per second if you don't check the model's output quality. No information is given about the source code, correctness, batching, benchmark results, quantization, etc. etc. etc.
acuozzo
Luke: Do you have benchmarks for BF16?
storus
Does it support paged attention like vLLM though? Without that they will run into memory fragmentation quickly.
cermicelli
Dumb shit this says nothing you are saying x is better and there is no way to check or look into what it does and how it works or if it didn't just clone vllm code because why not atleast c compiler claude wrote was the verifiable kind of shit. This is plain bullshit.