3 ms·
Sorry if this is an easy-answerable question - but by open we can download this and use totally offline if now or in the future if we have hardware capable? Se
by gedy 9mo ago
Sorry if this is an easy-answerable question - but by open we can download this and use totally offline if now or in the future if we have hardware capable? Seems like a great thing to archive if the world falls apart (said half-jokingly)
- Carrok 9mo agoYes.
- cmrdporcupine 9mo agoYes, but you'll need some pretty massive hardware.
- Tepix 9mo agoYou could buy five Strix Halo systems at $2000 each, network them and run it. Rough estimage: 12.5:2.2 so you should get around 5.5 tokens/s.
- j-bos 9mo agoIs the software/drivers for networking LLMs on Strix Halo there yet? I was under the impression a few weeks ago that it's veeeery early stages and terribly slow.
- Tepix 9mo agoLlama.cpp with its rpc-server
- Tepix 9mo agollama.cpp with rpc-server doesn't require a lot of bandwidth during inference. There is a loss of performance. For example using two Strix Halo you can get 17 or so tokens/s with MiniMax M2.1 Q6. That's a 229B parameter model with a 10b active set (7.5GB at Q6). The theoretical maximum speed with 256GB/s of memory bandwidth would be 34 tokens/s.
- Tepix 9mo agoCheck out https://github.com/kyuz0/amd-strix-halo-vllm-toolboxes/blob/main/rdma_cluster/setup_guide.md https://github.com/kyuz0/amd-strix-halo-vllm-toolboxes/blob/...
- fragmede 9mo agoYes but the hardware to run it decently gonna cost you north of $100k, so hopefully you and your bunkermates allocated the right amount to this instead of guns or ammo.
- fancy_pantser 9mo agoSure. Someone on /r/LocalLLaMA was seeing 12.5 tokens/s on dual Strix Halo 128GB machines (run you $6-8K total?) with 1.8bits per parameter. It performs far below the unquantized model, so it would not be my personal pick for a one-local-LLM-forever, but it is compelling because it has image and video understanding. You lose those features if you choose, say, gpt-oss-120B. Also, that's with no context, so it would be slower as it filled (I don't think K2.5 uses the Kimi-Linear KDA attention mechanism, so it's sub-quadratic but not their lowest).