1792 GB/s (+1382)
B
Raises estimated decode speed by about 143%.72.4 tok/s decode
Raises estimated decode speed by about 143%.
Adds memory headroom for longer context windows and future model growth.
~$1,999 MSRP
Can Codestral 22B run on MacBook Pro M4 Max 36GB?
YES — Runs Great
B62Good
○Estimated from fit model
Codestral 22B needs ~20.6 GB VRAM. MacBook Pro M4 Max 36GB has 25.9 GB. With Q4_K_M quantization, expect ~19 tok/s.
Runtime: llama.cppCapacity: RoomyBandwidth: LowStack: 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.
Select quantization to explore
Q4_K_M (Medium quality) — 20.6 GB, 29.8 tok/s, Runs well
20.6 GB required25.9 GB available
80% VRAM used
Fit status
Runs well
Decode
29.8 tok/s
TTFT
6489 ms
Safe context
33K
Memory
20.6 GB / 25.9 GB
Memory breakdown
Weights13.4 GB
KV Cache2.4 GB
Runtime0.9 GB
Headroom3.9 GB
See how fast it feels
See how fast it feelsCodestral 22B on MacBook Pro M4 Max 36GB
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: 29.8 tok/s decode · 6.5s TTFT (warm) · 75 tok/s prefill
What limits this setup
This setup is broadly balanced for this model.
Shared-memory contention still exists
The OS, browser, and inference runtime all compete for the same physical memory pool, so real-world headroom is less forgiving than raw capacity suggests.
Best improvement path
Performance by workload
| Workload | Grade | Fit | Decode | TTFT | Context |
|---|---|---|---|---|---|
| Chat | B | Runs well | 19.2 tok/s | 5486 ms | 33K |
| Coding | B | Runs well | 19.2 tok/s | 10059 ms | 33K |
| Agentic Coding | B | Tight fit | 19.2 tok/s | 14631 ms | 33K |
| Reasoning | B | Runs well | 19.2 tok/s | 11887 ms | 33K |
| RAG | B | Tight fit | 19.2 tok/s | 18288 ms | 33K |
Quantization options
How Codestral 22B (22B params) fits at each quantization level on MacBook Pro M4 Max 36GB (25.9 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 8.6 GB | Low | B57 |
Q3_K_S | 3 | 10.8 GB | Low | B59 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Codestral 22B on your machine.
Run
ollama run codestralUpgrade options