VOOZH about

URL: https://willitrunai.com/can-run/codestral-2-25.08-on-instinct-mi250-128gb

⇱ Codestral 2 25.08 on AMD Instinct MI250 128GB? YES


Can Codestral 2 25.08 run on AMD Instinct MI250 128GB?

YES — Runs Great

A81Great
Estimated from fit model

Codestral 2 25.08 needs ~29.6 GB VRAM. AMD Instinct MI250 128GB has 128.0 GB. With Q4_K_M quantization, expect ~164 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: StandardBottleneck: Balanced
Share:

Operating mode

Choose the run profile you care about

Interactive favors responsiveness, while light API and scale-out lean harder on serving readiness. The fit stays the same, but the recommendation lens changes.

Current mode

Balanced

Balanced for general local use. Keeps the ranking neutral across personal and serving workflows.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 29.6 GB, 163.8 tok/s, Runs well
29.6 GB required128.0 GB available
23% VRAM used

Fit status

Runs well

Decode

163.8 tok/s

TTFT

1182 ms

Safe context

256K

Memory

29.6 GB / 128.0 GB

Memory breakdown

Weights13.4 GB
KV Cache2.4 GB
Runtime0.9 GB
Headroom12.8 GB

See how fast it feels

See how fast it feelsCodestral 2 25.08 on AMD Instinct MI250 128GB
1st promptCold start — includes initialization
>Write a Python function to sort a list
Here's a Python function that sorts a list using quicksort: def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) # Example usage numbers = [3, 6, 8, 10, 1, 2, 1] print(quicksort(numbers)) # [1, 1, 2, 3, 6, 8, 10] The algorithm picks a pivot, partitions the list into smaller, equal, and larger elements, then recursively sorts each partition and concatenates the results.
2nd promptWarm — model ready, no init overhead
>Now add type hints and a docstring
def quicksort(arr: list[int]) -> list[int]: """Sort a list using the quicksort algorithm. Args: arr: List of integers to sort. Returns: A new sorted list. """ if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) Added type hints for the input and return type, plus a Google-style docstring.
Estimated: 163.8 tok/s decode · 1.2s TTFT (warm) · 410 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

No major red flags

This recommendation has enough memory headroom and acceptable estimated speed for the selected workload.

Best improvement path

Performance by workload

WorkloadGradeFitDecodeTTFTContext
ChatARuns well163.8 tok/s644 ms256K
CodingARuns well163.8 tok/s1182 ms256K
Agentic CodingARuns well163.8 tok/s1719 ms256K
ReasoningARuns well163.8 tok/s1396 ms256K
RAGARuns well163.8 tok/s2148 ms256K

Quantization options

How Codestral 2 25.08 (22B params) fits at each quantization level on AMD Instinct MI250 128GB (128.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
8.6 GB
LowA73
Q3_K_S
3
10.8 GB
LowA73
NVFP4
4
12.3 GB
MediumA73
Q4_K_M
4
13.4 GB
MediumA73
Q5_K_M
5
15.8 GB
HighA73
Q6_K
6
18.0 GB
HighA73
Q8_0
8
23.5 GB
Very HighA74
F16Best for your GPU
16
45.1 GB
MaximumA77

Get started

Copy-paste commands to run Codestral 2 25.08 on your machine.

Run

lms load codestral-2508 && lms server start

Your hardware

More models your AMD Instinct MI250 128GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS31.5 tok/s
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS329 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS142.7 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS88.9 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS87.5 tok/s

Frequently asked questions

See all results for AMD Instinct MI250 128GBSee all hardware for Codestral 2 25.08