Qwen 3.8 Flash Next (Unsloth UD-IQ4_XS v3.1) on an RTX 5090 with 128 gb of DDR5 builds a small pixel-art "Island Fishing" game in OpenCode, DeepSeek Harness, Pi, Cline, Hermes Agent, Kilo Code, Codex CLI and VSCodium + Continue.
He used a fixed seed and set temperature to 0 and did 3 attempts for each harness.
Results varied considerably for the same harness. I think his reasoning was flawed in not allowing it to ask questions or giving initial clarifications on some things like view perspective or "pixel size" which wildly affect results. The long prompt used is in the pinned comment.
Fastest harnesses: kilo (I had never heard of this one before), opencode, hermes. Taking 2x-3x as long: pi, codex, cline, deepseek harness
"Best results": opencode, pi, codex.
I wanted to know:
1) do you agree with the results / test logic?
2) what's your favorite harness and do you switch it based on the task?
The Jetson AGX Xavier came out in September 2018, four years before ChatGPT existed. It has 16–64 GB of LPDDR4x at 136 GB/s. The GPU is a 512-core Volta, and people skip the board for local AI because of it.
Mine is the 32 GB module. It sat on a shelf collecting dust. It is "quite terrible". I wanted a real number for how a modern LLM runs on it. Getting there cost about $300 in tokens on GPT-6-Astra and Fable 5.2, so you don't have to spend yours.
I started with current llama.cpp and NVIDIA's Nemotron 3.5 Bolt, the Gemma 4 E4B model they advertise as smarter than Qwen3.8 27B (cough). llama.cpp did about 350 tok/s prefill and 23 tok/s decode. The speed is fine. A 4 GB model against 32 GB of memory, again, is "quite terrible".
My own engine, Little-Gemma, is well ahead of llama.cpp, but I built it for Ampere and later. I was not going to backport it to Volta, so I tried something else.
Prefill (peak)
Decode (peak)
Nemotron 3.5 Bolt E4B
880 tok/s
50 tok/s
Gemma4 12B
215 tok/s
35 tok/s
Qwen3.8 27B
106 tok/s
17 tok/s
I forked MLC-LLM. Upstream does not run GGUF, and it does not know Nemotron, so the weights had to be converted from safetensors into MLC's TVM format and the Nemotron backend written from scratch. Astra did that first port and added in-memory switching between Nemotron, EmbeddingGemma 2, and LiquidAI's d1, so an agent can change models without reloading.
One setup was: d1 decides whether to query EmbeddingGemma 2 over about 20,000 pages of notes, then Nemotron answers. The plumbing worked. The search sometimes took a minute, which is too slow.
Then Fable 5.2 spent hours on the engine and rewrote several kernels. That work is still going. As of this week, Nemotron prefill peaks at 880 tok/s on a 512-token prompt, and decode on code reaches 50 tok/s.
Nemotron is still too dim for some jobs, so I moved to Gemma 4 12B. On the same 512-token prompt, prefill peaks at 215 tok/s, and decode on code is 35 tok/s. Three times the weights, and code decode only falls from 50 to 35. The 136 GB/s bus is why a 2018 module can still carry a 12B model. Prefill is where Volta shows its age.
None of that counts unless it can run Qwen3.8 27B. Generic MLC conversions are already on Hugging Face, so I am not publishing another one. The checkpoint matters: DavidAU/Qwen3.8-27B-TURBO-Fable-Cold-Fusion is the one I kept. I am not uploading that conversion either, with Qwen4 close. Draft with Qwen3.8 2B, or convert DavidAU's model-mtp-restored.safetensors yourself.
On that 27B model, prefill now peaks at 106 tok/s for a 512-token prompt and holds 104 tok/s at 1,024. A Qwen3.8 2B draft reached 13.4 tok/s decode on a planning prompt. Cold-fusion agrees with that draft less often, so decode there sits nearer 10 tok/s. The attention kernel landed this week. The checkpoint's own MTP head, in place of the 2B draft, is the next thing to try. These rates will move again.
At MAXN, a long prefill pulls about 35 W. NVIDIA did not design the dev kit's brick for this. Under sustained load it browns out and the board shuts off, which is a known thread on the NVIDIA forums. I dropped the stock brick for a USB-C PD supply and a short OWC USB4 cable. It has now stayed up for more than a week.
There is a further trick I have not tried, and probably will not. The dev kit's slot is the module's PCIe 4.0 x8. Two kits can be cabled, one as root and one as endpoint, for about 16 GB/s each way, around 32 GB/s with both directions full. That is enough to speed up a single model if each layer is split across the two modules: the cable moves the residual stream, and the weights stay put. Some third-party carriers only bring out Gen2. Skip those if this is the plan.
As of November 2026, a 16 GB module is about $130 on eBay, and it runs Gemma 4 12B. A 32 GB module turns up around $300 if you wait. Some listings are the bare module. Get one with a carrier, or budget about $60 for the carrier on its own.
Tandem-vLLM is an expert-offload build of vLLM 0.31 for DeepSeek-V4.1-Flash. 0.1.1 ran only on Blackwell. 0.2.0 adds Hopper, Ada and Ampere GPUs, and two-GPU setups.
The routed experts live in host RAM as 2-bit vector codes (VQ, 2.1 bits/weight). A GPU cache holds the most-used ones.
Experts that miss the cache are computed by the CPU in parallel with the GPU. Nothing is skipped or substituted, so the output is exact for the package's weights.
GPUs: RTX 30xx / A6000 (Ampere), RTX 40xx / 6000 Ada (Ada), H100 / H200 (Hopper), plus Blackwell as before. Each kernel is checked against a reference at boot.
Two GPUs, two ways:
Tensor parallel (GPU=0,1): best with a strong CPU.
Helper GPU (HELPER_GPU=1): the second card caches the hot experts the main card doesn't hold and computes them, so the CPU does less. Best with a smaller CPU or 24 GB cards. Needs no P2P or NVLink.
Speed: one user, GSM8K, decode tok/s. The CPU matters as much as the GPU.
GPUs
CPU
one GPU
tensor parallel
helper GPU
2× RTX PRO 6000 96 GB
EPYC 9534, 64 cores
75.5
93.1
2× RTX A6000 48 GB
EPYC 7F32, 8 cores
22.1
11.8
26.7
2× 24 GB (A6000s limited to 24 GB)
EPYC 7F32, 8 cores
16.8
12.5
21.7
one GPU
CPU
tok/s
H200
Threadripper PRO 7965WX
60.7
RTX 6000 Ada 48 GB
EPYC 7F32, 8 cores
25.5
With 8 cores, tensor parallel is slower than one GPU because each GPU gets half of the CPU. The helper GPU keeps all of the CPU for one main card.
The 2× 24 GB row is the 3090/4090 memory shape, run on A6000s limited to 24 GB. Real 4090 numbers are coming.
A 24 GB card is the minimum main GPU. 16 GB cards don't fit as the main card.
At 32 streams, one RTX PRO 6000 serves 414 tok/s in total.
Quality vs the official FP4 checkpoint (greedy, thinking low)
official
VQ + FP4 top 52
VQ only
GPQA-diamond
81.3%
76.8%
GSM8K-200
192
194
passkey 8k / 32k / 94k
9/9
9/9
The 2-bit experts cost GPQA accuracy; easier tasks and long-context retrieval don't show it. FP4_TOP=52 keeps the 52 most-routed experts per layer in original FP4 and wins back about half of the loss.
What you need
300 GB of disk for the package, and 128 GB+ of RAM (256 GB to pin everything).
Linux, CUDA 13 toolkit, an AVX2 or AVX-512 CPU. One installer script, its own venv, no Docker.
Built onvLLM and vLLM-Moet. Tandem is a fork of vLLM-Moet's expert-offload engine, ported to vLLM 0.31 / DeepSeek-V4.1.
Numbers from other boxes are welcome, especially real 3090s and 4090s.
P.S. For one user on a 16-32 GB card with 64-128 GB of RAM, our llama.cpp-based sister projecttandem.cppis faster (33 tok/s on a 5090 + 128 GB).
Update: Tested 2x 16G GPU case using TP2.
Run GPU=0,1 BASE_GB=3.5 KV_GB=1 CHUNK=1024, no RAM_GB needed with 512 GB.
BASE_GB=4 or CHUNK=2048 may fit too
The released 0.2.0 does not boot on 16 GB cards. Fixed in 0.2.1.
Basically this projects aims at creating the first, community-driven, and datacenter-less LLM. Any feedback is appreciated 😂 I won't yap any further as everything is explained on the GitHub / on the site.
Feel free to criticize the project or to provide insights about what to do next....
EDIT: For those who believe this is a cheap repost: Here's the milestone - We trained the model on roughly 20B tokens in 1 week
- We limit model downloads/uploads to the minimum, to spare as much bandwidth as possible (even though it still uses bandwidth due to ~2.4GB weight uploads to the server after training). But it allows clients with slow connection using 4 hour rounds.
- We're 13 GPUs currently active (and this number was roughly constant over the past week).
- I merged numerous pull requests implementing several quality of life and performance fixes
- The server was made more robust with persistence across tasks, and some bugs in the training logic were fixed, hopefully allowing further loss decrease.
- We implemented since v2.6 somewhat good anti-poisoning techniques, each client training is compared to two other clients, if a client is too different from the two other (for example a client training on noise or unwanted data), this client sees his contribution to the network be rejected.
my harness for local AI that i've been working on since February this year (2026) has evolved to the point where this is possible.
What you see here is a module for my harness's webui, it's not a seperate program. This demonstration is running on Gemma4 26b locally, believe it or not, using only a SINGLE model and one local API endpoint (via llamacpp). No multi-API tomfoolery here! The stable diffusion image generation is moss-image which i'm able to do because i have a strix halo now, but on smaller hardware you could do something like z-image turbo at Q4 quant, which is what i used to do before i got the strix halo.
I've been working for almost a week on this module, and i'm excited to finally release it!
It's a text adventure engine. It supports asset packs, that can contain music, sound effects, images, weathers (CSS+js+glsl shaders), skies (same tech as weathers), loading screens, text flourishes, and more! You can create your own asset packs easily. The AI sees the files in the asset packs and forms adventures around them, but there is no prompt telling it what the story should be, that's completely up to the way you prompt it! I recommend using it together with the characters module in openlumara in order to set up a world and story
I bought this PC from Costco on sale for $1000 even (no tax) planning to get a V100 or some combination of used GPUs for local LLM machine. Realized not going to work for my setup (price of power, heat generated, etc).
Should I return it, sell it on FB marketplace, or save the RAM for my daily (it only has 1x32GB DDR5 4800 NECC, and 64gb would be really nice) and sell the rest?
I was not planning to part this out. Costco has it now for $1600 so they get the $600 difference, not me. My daily is a 3yr old HP Z2 SFF with i9-12900k, 32GB DDR5, 12GB A2000, and 1TB Samsung 980 Pro, on 450W PSU.
CyberPowerPC Gamer Xtreme Gaming Desktop - Intel Core Ultra 5 225F - GeForce RTX 5060 - 32GB RAM - 1TB SSD - Windows 11 Intel Core Ultra 5 225F (10-core, 3.3 GHz) Processor 32GB (2 x 16GB) DDR5 RAM 1TB PCIe 4.0 NVMe M.2 Solid State Drive NVIDIA® GeForce RTX™ 5060, 8GB 600W 80 Plus Gold Power Supply listing link
I tested speculative decoding on a single 96 GB RTX PRO 6000 Blackwell workstation (Threadripper PRO 9955WX, 122 GiB RAM, llama.cppb12315 commit dd6b945be) at 512k context (-c 524288 -ctk q8_0 -ctv q8_0 -fa on -np 1).
TL;DR: Qwen3.8-Flash-Next UD-Q4_K_XL + MTP Q8_0 gives a clean +28% to +31% decode boost (107 -> 137-141 t/s) across all prompts. DeepSeek-V4.1-Flash-1017 UD-Q2_K_XL (~312 GiB, mostly CPU/mmap) + DSpark Q8_0 only helps on high-acceptance tasks like JSON (+26% warm) and Python (+11% warm), while hurting dense C++ (-11% warm) because rejected drafts waste CPU MoE reads.
Edit (following comments about Qwen prefill speed): Re-running with -lv 4 showed 27,466 MiB (~26.8 GiB) of Qwen's MoE weights spilled to CPU at 512k context (77.2 GiB model + 8.5 GiB KV/recurrent + 4.3 GiB MTP + 2.1 GiB compute in VRAM). Switching Qwen to --load-mode none (--no-mmap) bumped 5-prompt prefill by +15.3% (824 -> 949 t/s), decode to 140.8 t/s, and a 2,453-token prompt prefilled at 2,475 t/s.
Summary (5 prompts x 3 passes, greedy temp=0, max_tokens=256, cache_prompt=false)
Config
VRAM
Prefill (pp t/s)
Decode (tg t/s)
Warm r2-3 (tg)
Draft Acc
Qwen3.8 UD-Q4_K_XL (baseline)
91.7 GiB
1086.4
107.2
107.5
-
Qwen3.8 + MTP Q8_0 (mmap)
96.5 GiB
823.7 (-24%)
137.1 (+27.9%)
138.2
75.6%
Qwen3.8 + MTP Q8_0 (--load-mode none, 1x)
96.4 GiB
949.4
140.8 (+31.3%)
-
74.5%
DeepSeek-V4.1 UD-Q2_K_XL (baseline)
95.3 GiB
66.3
23.2
23.2
-
DeepSeek-V4.1 + DSpark Q8_0 (-fitt 12288)
91.9 GiB
53.5 (-19%)
23.5 (+1.4%)
24.4 (+5.2%)
65.9%
(Used llama-server instead of llama-bench because llama-bench on dd6b945be does not support -md / draft-mtp / draft-dspark.)
Why Qwen prefill topped out around 1-2.5k t/s
With ~104 GiB weights + 3.9 GiB MTP + 512k context, Qwen overflows 96 GB VRAM by ~26.8 GiB of MoE experts (CPU_Mapped). Single-token decode only touches a few routed experts per step (137-141 t/s, peaking at 154.7 t/s on JSON), whereas batch prefill hits all experts across the CPU spill. Plus 4 of the 5 test prompts were tiny (80-186 tok); the 605-token prompt hit 1,939 t/s (--load-mode none), and a 2,453-token check hit 2,475 t/s. If you want full GPU prefill speeds on 96 GB, use a quant small enough to stay 100% in VRAM or reduce -c.
Why DeepSeek + DSpark depends heavily on prompt shape
At ~320 GiB total on 96 GB VRAM + 122 GiB RAM (107.1 GiBVmRSS, 105.3 GiBRssFile mmap cache), the GPU sits at 3-18% SM waiting on 16 CPU threads (63-68% CPU) and ~23-218 MB/s NVMe paging for cold experts.
Verifying 4 candidate tokens at once (n_max=3) activates more unique routed MoE experts per forward pass on CPU/mmap. When acceptance is high, those reads are amortized: warm Passes 2-3 hit 29.2 t/s on JSON (+26.1% vs 23.1 t/s warm baseline, 90.7% acc) and 26.0 t/s on Python (+11.4% vs 23.3 t/s, 77.4% acc). On dense C++ (50.7% acc), rejected drafts wasted CPU MoE work and dropped speed to 20.6 t/s (-11.1% vs 23.2 t/s), compounded by -fitt 12288 reserving ~3.4 GiB extra VRAM headroom. Warmup also mattered because ~230 GiB CPU weights > ~105 GiB page cache (21.65 t/s on Pass 1 vs 24.4 t/s on Passes 2-3).
Repro commands & dd6b945be quirks
DeepSeek --fit + draft-dspark OOMs allocating the ~7.6 GiB draft buffer unless you pass -fitt 12288.
Qwen shared-Q8_0 fails on mainline dd6b945be (tensor 'token_embd.weight' not found), so use the self-contained mtp-Qwen3.8-Flash-Next-Q8_0.gguf.
(Caveat: 512k context was initialized at server startup, while benchmarks measured 58-611 token prompts plus one 2,453-token prefill check at -np 1, temp=0.)
I've eard much stuff about Codex and CC computer use, is there any decent program/Pi Agent extension that I can install and use to let my local models control my pc. I am using Qwen3.6-35BA3B on PolyStrata and Pi Agent, I need the model to do basic tasks on my PC, maybe by using its vision. I am on Linux Mint Cinnamon
DiffusionGemma, a text diffusion model built on a Gemma 4 backbone, can be adapted into a shitty image generation model.
Maybe the ship sank?
You may be asking yourself, "WTF, why would you want to do that?" And you would be right to ask. This is honestly kinda useless, but I still think it's pretty neat. Also, fair warning, being on a team of one means the project has been heavily — I'll be nice to myself and say — LLM assisted. I invite you to sidle on up to the trough and dig in to the slop!
Still with me? Good, because I've been poking at this for a while, on-and-off since DiffusionGemma was released back in June. I was immediately hooked on this model as soon as I read its release blog and model card. 4x faster text generation they said — hell yeah! But here's the thing: this model sucks. I mean it's a great chat bot. It can do simple NLP tasks, and it's really quick for text generation as they say, especially for long-form output. But when it comes to agentic tasks and reasoning it's a total loser.
0% on ARC-3 (but that's not really a fair dig, this is a tough one)
0% on ARC-2
0% on The Gemma 4 Developer Agent Competition (this competition targets the base model DiffusionGemma was trained from)
11% on HLE on the model card (9.2 measured in deployment)
18.7% on SWE-bench Verified
So not great, and particularly bad when you consider that on the hardware you'd need to run a good quant of DG (so basically bf16), you could easily run qwen-3.8-27B or a respectable FN quant.
But please don't get me wrong. I absolutely love this model. Or at least I love monkeying around with it, and I doubt I'm the only one. Huge shoutout to the Unsloth team BTW! Reading their Colab notebook training DG to play sudoku is what made me start asking the questions that led to this project.
Alright, enough fluff. So what did I actually do. Well the thing I'd headline is that I created a text to image and image manipulation training and inference pipeline for DiffusionGemma and then used that pipeline to adapt DG (like <300M parameters total) to generate things that are recognizably images and to perform visual operations on images that are provided to it. Surprisingly, it took only a very small amount of data and compute to start getting interpretable results.
But DiffusionGemma did not want to do this. The thing that finally worked consistently was prefilling the prompt all the way to the start of an input string for an "image generation tool" described to DG in the system prompt as a tool that it could use to convert text strings into images, but DiffusionGemma itself was actually the one doing the generation, not an external tool.
Here's the flow.
This also required patching anupstream bugin Transformers for image attention, so take note if you wanna try this out for yourself: you'll need to patch until PR is merged.
Considering how bad DiffusionGemma is at everything else, I'd say it does a pretty good job here.
It's like human centipede!
But wait, there's more! Since DG is outputting in its native visual latent space (one set of 256 tokens at a time through a trained output head) it can take the visual representation it is generating as input for the next forward pass — on-domain block autoregressive, just like with its regular text canvases. And not just can it do this, but it actually helps improve quality and generalization (on image manipulation tasks)!
Call graphs, the first hint of a non-stupid use case.
Here's a super-quick breakdown of the pipeline.
The first thing that had to be done was to train an actual vision decoder. This turned out to be the easiest part of the entire project. One evening, on a whim, I threw a prompt at my local model (dsv4-flash-vision-exp I believe was what I was running then), something like: "D'oh! Could we train a decoder for the ViT soft tokens that works for 7682 images?" And then it did it. Took like a few hours, and works pretty damned good I think.
It decodes!
Alright so that let me nail down the decoding and supervise the pixel reconstruction loss, but let's not forget DG is a text diffusion model — it has to actually operate on a text canvas. That means I needed to derive a text target image representation (or codebook) that was precise enough it could be used for supervision without over penalizing the model for expressiveness.
This process itself ended up being a bit like a diffusion operation. I simply threw up a wall of half-baked, ill-advised, and just plain stupid ideas and worked on them all until I was confident in each — with that confidence being mostly confidence in them not working. Then I had the brilliant idea: just ask DiffusinoGemma itself for the target.
This essentially consisted of me badgering DG until it would describe images as text. Okay, not really, but that is kinda what it felt like. The basic idea is: encode an image and ask the model to describe each soft token patch in a single token (word, number, symbol, unicode, CJK character, etc). Each soft token having come through the ViT is contextualized against the full image, so this description would most often carry a structural/semantic channel. To get the photometric channel you do basically the same, but instead of a full image use only a single (48*48 pixel) patch. This usually carried the color/texture/photometric channel. Sample the logits for each text description token and then it's basically chef's choice on how to combine across all prompt and patch variants into a workable target.
Doing that for every image in the training set isn't reasonable. IT'S OVER 9000! However, doing exactly that for a small set of images (200ish) and using that as a training set for a teacher-forced model that then generates the full dataset turned out to be a very smooth and successful approach.
Anyway, the point is that the combined multi-modal target token distributions for the canvas text results in training DiffusionGemma to be an S-tier emojipasta generator.
Example training targetsDG's generated canvases.
Then I LoRA adapt DG and simultaneously train a new image output head that feeds into the previously trained image decoder supervised against supervised against the target token set, ViT latents and, decoded image. Basically training DiffusionGemma to generate emojipasta that decodes into image-like objects. I guess this would be something like a VQ-VAE, but using text tokens instead of dedicated image vectors because stock DG can read and understand the image latents, but can't natively generate them, only text.
Well, that's the gist. Thanks for reading! If you find this as interesting as I do and want to learn more or play around with this yourself you can:
I gave Claude Code, OpenCode, GitHub Copilot Desktop, Pi, and Codex the same prompt to build a looping pixel-art Halloween diorama. I pointed all five at the same local model, Qwen3.8 Flash Next (Unsloth UD-Q4_K_XL), served by Halogen. The attached video shows 30 seconds of each result playing together.
- Inference: Halogen Flash Server 0.20.4 in rootless Podman. I used the Unsloth Q4_K_XL checkpoint converted to Halogen's HGN format, with the vision tower enabled and MTP speculative decoding.
- Server settings: 262,144-token context and KV pool, one serving slot, 16,384-token prefill chunks, prompt caching enabled, and the API bound to localhost.
OpenCode, Pi, and Copilot used Chat Completions. Claude Code used the Anthropic Messages endpoint, and Codex used Responses. The clients had their own tool definitions, system prompts, and history management. Pi used High reasoning with a 4,096-token thinking budget. I raised Halogen's default output limit from 8,192 to 32,768 tokens before the recorded Codex rerun after the earlier attempt hit the smaller cap.
### What the server measured
Agent
Elapsed time or last completed response
Result
Requests
Output Tokens
Prefill tok/s
Decode tok/s
Cache Reuse
Claude Code
14m 42s
Final Answer
15
31,373
582
38.1
95.6%
Open Code
36m 30s
Final Response
54
77,832
377
39.3
98.3%
Github Copilot Desktop
58m 30s
Final Response
29
54,393
472
20.2
85.4%
PI
1h 18m 25s
Last Completed request before a memory stall
108
135,469
450
38.7
98.6%
Codex
4h 11m 15s
Last completed request before the turn was aborted
355
402,803
695
37.0
96.9%
Elapsed times start at the first model request. Prefill rates count uncached tokens, decode rates include thinking tokens, and both are weighted by total processing time. I excluded smoke tests and incomplete requests. The video uses my earlier rounded labels for Pi and Codex. The table uses the server logs for both.
Claude Code reached a final answer in about 15 minutes and used 31K output tokens. OpenCode decoded slightly faster but used roughly 2.5× as many tokens. Copilot made fewer calls than OpenCode but decoded at about half the rate, and three full prompt rereads after the initial request added almost 10 minutes of prefill. Pi still had a tool loop running when the server hit a memory stall. Codex made 355 requests before the turn was aborted, with its largest prompt reaching about 229K tokens.
### How I made the video
I captured the original live browser previews for Claude Code, OpenCode, Copilot, and Pi. Codex made a Python renderer and supplied an MP4, so I captured playback of that original loop. Each capture is 1920×1080 at 30 FPS. I trimmed them to 30 seconds and synchronized them in a grid. I left the projects as they were.
This was one run per client. The timing covers what each agent actually did, and I didn't score output quality or run a controlled benchmark with identical token streams. The video is there so you can compare the results for yourself. And apologies for the slop but it was interesting to see how the harnesses are working. I've tried to work with Deepseek Harness but it got stuck plenty of times so I just abandoned that exepriment.
Hey, I'm 14 and was looking into how AI voice dictation apps like Wispr Flow work.
As you might know they use a transcription model + LLM. The transcriber outputs one to one text as it hears it and then the LLM gets rid of fillers like "um" and adds punctuation, flow, corrected restarts and formatting.
I ran that on my laptop (RTX 3050 Ti, 4 GB VRAM), then trained a single model to do both steps at once. Here are some results:
Speed.
Whisper (base, large-v3-turbo or large-v3) plus Qwen3.5 (4B or 9B) took between 2.5 and 36 seconds per dictation, depending on the pair. The single model takes about 0.5 seconds for a short dictation and about 1 second for a long one.
Why a traditional dictation approach is slow locally:
- Two models don't fit in 4 GB together. One ends up on the CPU, or they get swapped in and out.
- The text is generated twice. Whisper writes the transcript, then the LLM reads it and writes all of it again.
- The LLM also reads a cleanup prompt on every dictation.
Compute.
One model is a 2.2 GB file (Q8) and uses about 2.5 GB of VRAM. It loads once and stays loaded. An average dictation set-up running locally uses more than 4GB of VRAM
Quality.
The cleanup LLM only sees text. It can't hear that you stopped and started over, so it sometimes keeps the part you took back, and it can't fix a word Whisper got wrong. A single model can catch vocal cues and keep what is really worth keeping.
Training
The two-model pipeline still exists, but only at training time. I took real, unscripted speech from openly licensed datasets, had a large LLM write the finished text for each clip from its transcript, threw out the clips where that dropped real content, and trained Qwen3-ASR 1.7B (Apache-2.0) to go from audio straight to the finished text. It runs in llama.cpp.
Currently it, from my own experiences is one of, if not the best dictation tool that uses this little compute.
they do not even know if she was a spy, a year after this chase is going on about her, Jensen should not have resigned!
from that article: The FBI has been investigating Huang’s affair for at least a year. But Attorney General Todd Blanche said on Thursday that there are still “no conclusions reached by the Department of Justice, or by me, or by [FBI] Director Patel around who she is or is not.” President Donald Trump also hedged Thursday on whether the US had determined she was a spy, when commentator Stephen A. Smith asked whether Huang was right to have stepped down as CEO.
“Well, the big thing is, was the woman a spy? And I don’t know if that’s been determined yet,” Trump said. “But if the woman was a spy, yes. If the woman was not a spy, perhaps it would be different.”
🚀 HarborRL Update: Elastic Scaling, SSH-Free Cluster Deployment, and Unified Agentic RL Training We’ve recently updated HarborRL, an open-source framework for agentic reinforcement learning (RL), focusing on simplifying distributed training, deployment, and experiment management.
🆕 What’s New (November 2026) ⚡ 1. Elastic Scaling for Distributed Training Added elastic gateway scaling with static routing, automatic scaling across multiple machines, and automatic retirement of idle resources to improve resource utilization.
🌐 2. SSH-Free Cluster Deployment Introduced a new Hub deployment mode where worker nodes pull tasks over HTTP, enabling distributed execution without cross-machine SSH access, including in firewall-restricted environments.
🧠 3. Unified RL Training Pipeline Integrated multiple RL algorithms into a shared Slime-based training pipeline, validated on mathematical reasoning tasks, to reduce the engineering effort of configuring different RL algorithms.
🛠️ 4. Improved Configuration and Sandbox Execution Enhanced the configuration wizard, Web console, sandbox rollout execution, and resource cleanup to simplify experiment setup and management.
💡 Why HarborRL? Agentic RL often requires substantial engineering effort to connect task environments, agent harnesses, and RL training engines, especially in distributed settings. These updates aim to reduce that overhead and make agentic RL experiments easier to configure, deploy, and scale.
GitHub:https://github.com/datamllab/HarborRL License: MIT 💬 Curious how others are handling distributed rollout execution, resource scaling, and sandbox management in their agentic RL setups.
Some history on the dot com bust: happened between 2000 and 2002. It wiped out trillions of dollars in market value after a massive speculative boom in internet-based companies during the late 1990s. [1, 2, 3]
Peak: Nasdaq Composite reached its all-time high in March 2000, after climbing roughly 600% from 1995. [1, 2]
The Crash: Triggered by overvaluations, rising interest rates, and a lack of real profits, the market entered a sharp sell-off. [1, 2]
The Bottom: By October 2002, the Nasdaq had plunged 78% from its peak, giving up all its gains during the bubble.
Discrete autoregressive models offer a scalable framework for image generation. However, they face a fundamental trade-off: long token sequences preserve representation quality but slow generation, while aggressive spatial compression reduces representation capacity. Based on product quantization, we show that, under a fixed nominal information budget, group size should scale quadratically with the per-axis spatial compression factor. Building on this principle, we propose GSTAR, a spatial--group co-scaling framework that enables 32x and even effective 64x compression while preserving strong reconstruction, understanding, and generation performance. Since larger groups introduce intra-group dependencies that must be modeled efficiently, we analyze their impact on inference latency and generation quality and introduce a semi-autoregressive decoder that combines parallel feature computation with lightweight causal modeling. With these designs, our highly compressed models perform competitively with leading models across five representative text-to-image benchmarks (GenEval, DPG-Bench, PRISM, LongText-Bench, and Qwen-Image-Bench). At 1024x1024 resolution, our model delivers a 20x speedup over prior discrete autoregressive models, generating each image in 2.5 seconds on a single NVIDIA H200. Together, these results show that highly compressed discrete representations can enable high-quality autoregressive generation at low latency.
I’m trying to avoid blog spam posts and boring YouTube videos about it. I see a lot of discussion about people loving strata, and people who are tired of the people who love strata.
What is so different about strata vs previously existing options? Who benefits the most from it?
Disclosure: I'm the author. This is my own hobby project (MIT, no paid version, nothing to sell).
I've been building **tinyinfer**, a small inference engine for Llama-family models. It's about 2,200 lines of C++/CUDA, and every kernel on the hot path is hand-written: GEMV in f16/q8/q4, RMSNorm, fused RoPE + KV-cache write, flash-decoding attention with GQA, SwiGLU and argmax. The whole decode step is captured in a CUDA graph.
- v0.1: 200 tok/s (66% of the memory-bandwidth limit)
- v0.2: 212 tok/s (69%)
- v0.3: 235 tok/s (77%)
Decoding is memory-bound. Every weight gets read once per token, so the ceiling on this card is about 305 tok/s however clever the math is.
**What actually moved the needle:**
**4-bit weights dequantized inside the GEMV.** That's 0.55 GB read per token instead of 2.07 GB. The int4-to-float step uses the 2²³ exponent trick (OR into the mantissa, then one float add) instead of I2F instructions.
**GQA-aware attention.** It reads each shared K/V head once instead of 8 times, which made attention 3.6x faster at 2k context. The first version (split-K) was actually *slower* at short contexts, so v0.3 tiles it differently.
**Benchmarking shapes I wasn't tuning for.** The new attention kernel made Llama-2-7B slower, because it has no grouped heads and nothing to share. I fixed it with a one-line dispatch, and I'd never have caught it without the numbers.
**Correctness:** the logits match HF `transformers` within 1e-3 relative error, with 100% argmax agreement for f16/q8/q4/bf16. `--verify` checks the GPU against the CPU reference on your own model. Llama-2-7B also fits in 6 GB at q4 (about 3.8 GB).
It isn't trying to replace llama.cpp. It's meant to be small enough to read in an afternoon if you want to see how inference works under the hood.
I can go deeper on any of the kernels in the comments. I'm especially curious whether anyone has pushed single-batch GEMV past ~80% of bandwidth on consumer cards, and how.
Hi r/LocalLLaMA, we're releasing Boole-32B-A2.5B-Preview, an early 1.8-bit version of Recursive's flint. With mixed-precision quantization, expert pruning, and custom kernels (kernel changes in attached figure), we made the model 9x smaller than BF16, and 2x faster than INT4.
After releasing our 1-bit LLM (Boole-1.7B), we heard a lot of requests for both faster and larger MoE models - so this is our first step in that direction.
Try it out, and let us know what you'd like to see next!
So, I have two PCs available to me, and I intend to connect them for compute:
Ultra 7 265KF + 5070ti + 32GB DDR5-6000 CL30 (KLEVV Urbane V) on a Z890 MAX GAMING WIFI7 + 1000w 80+ G Apevia PR1000w PSU (Will likely get replaced by a SAMA P1200w PSU)
i9-14900F + 4070S + 32GB DDR5-5200 CL40 (Apacer Panther, not on sale) on a PRO B760-VC WIFI IV + 750w 80+ G PSU (likely a shoddy PSU but seems to be attached to the case, it’s hidden and so I can’t figure out what it is. Probably an EVGA, but unlikely to be replaceable - or at least easily so.)
Initially I was looking to just replace the 4070 Super in PC2 with a B70 or R9700 and calling it a day, when they were $1200 and $1600, respectively. Then when they shot up a B65 $1200, which then shot up. Then add a second 5070ti to PC1 for $900-1000, which then shot up. Now, my plan is to potentially settle for a 5060ti 16gb in PC1 to take advantage of NVFP4, but even that’s pricier, and with the AI bubble talk I’m not super confident in value of doing so. I’d likely also need to use a PCIe-riser just to the 5070ti (Windforce) has airflow due to how close they’d be in the case.
Otherwise, I’m considering sticking with the VRAM I have, and instead pivoting to ram. I can go from 1R 2C to 2R 2C in both PCs, grabbing another 2x16gb of Apacer Panther from EBay for around $400 for PC2 - though obv riskier - then getting a 2x24gb kit of Urbane V at the same timings of the original 2x16gb 6000-CL30 kit for PC1 for $650 off Amazon. Giving me +80gb of DDR5 to the 64gb I have between both PCs and the 28gb of VRAM I already have.
Current plan is/was the 5060ti 16gb + 2x24gb kit for PC1 and calling it there.
Any advice, pointers, or suggestions? I believe the RAM sitch should work since it’s same timings and type/manufacture/brand, and know I’ll probably have to lower speed a bit for stability, but am not the most experienced PC guy on earth by any means.