Docs
CommunityJev Benchmarks & Evaluations
next-jev Tetris Demo
One timed Tetris game by the next-jev choice-head model on Qwen3.5-0.8B: 1,000 pieces, 398 lines and 9.52 seconds on an H100 NVL, with per-piece timings and decoded latent reasoning.
- Format
- Docs
- Reading time
- 2 min
- Published by
- Community
- Author
- JonesLin
- Last verified
- Oct 2026
Works forJev for Realtime control
Used inJev for Gaming
- Capabilities
- Open source
Highlights
- Checkpoint stage2-choice/checkpoint-00006056 is based on Qwen3.5-0.8B; seed 42 ran up to 1,000 pieces in one loop.
- The game cleared 398 lines and stopped at the piece limit without topping out, in 9.52 seconds on an NVIDIA H100 NVL.
- Model time per piece averaged 3.75 ms and whole-step time 9.19 ms; bf16, fused projections, torch.compile and CUDA graphs were used.
- The card warns the decoded reasoning text is not reliable and is included for analysis only.
- Reasoning is decoded from 128 hidden workspace vectors by a weak aux_decoder that predicts about 40% of next words with previous words given.
Watch out
The dataset card states no licence, and its own warning dominates: the decoded reasoning text does not match the board, names the chosen move no more often than a random other move, and the stage 2 decoder was judged reasonable on 0 of 366 steps and partly reasonable on 20. The game itself is a single seed-42 sample.
Questions about this entry
Short answers drawn from the linked project or page.
The next-jev choice-head model at checkpoint stage2-choice/checkpoint-00006056, based on Qwen3.5-0.8B, playing seed 42 for up to 1,000 pieces in one loop.
It reached the 1,000-piece limit without topping out, cleared 398 lines, and finished in 9.52 seconds on an NVIDIA H100 NVL with bf16, fused projections, torch.compile and CUDA graphs.
Model time from token ids to option scores averaged 3.75 ms with p95 3.80 ms, and whole-step time including localhost HTTP overhead averaged 9.19 ms with p95 10.90 ms.
No. The card warns the decoded reasoning is not reliable: it does not match the board or explain the choices, and it names the chosen move no more often than a random other option.
The model decides in 128 hidden workspace vectors and never writes text; after the game, each saved request is re-run and a small aux_decoder greedily decodes text from the last loop's workspace.
The same game with the newer last-block decoder over 366 pieces, a raw slow video with decoded reasoning for every piece, and an LLM judge verdict per step: 0 of 366 reasonable and 20 partly reasonable.
game/ holds one JSONL row per piece with piece, candidates, chosen id, heuristic rank, confidence, lines and timings, plus CSV and summary JSON, and requests captures the exact model input for each piece.
From the Jev guides
Original write-ups on what this entry is for.
From the Jev AI model community
Posts from builders shipping with Jev right now.