1344 GB/s (+944)
C
Raises estimated decode speed by about 370%.84.1 tok/s decode
Raises estimated decode speed by about 370%.
Adds memory headroom for longer context windows and future model growth.
~$4,999 MSRP
Can Codestral 22B v0.1 run on MacBook Pro M3 Max 48GB?
YES — Runs Great
C50Usable
○Estimated from fit model
Codestral 22B v0.1 needs ~22.1 GB VRAM. MacBook Pro M3 Max 48GB has 34.6 GB. With Q4_K_M quantization, expect ~18 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) — 22.1 GB, 17.9 tok/s, Runs well
22.1 GB required34.6 GB available
64% VRAM used
Fit status
Runs well
Decode
17.9 tok/s
TTFT
10825 ms
Safe context
93K
Memory
22.1 GB / 34.6 GB
Memory breakdown
Weights13.4 GB
KV Cache2.6 GB
Runtime0.9 GB
Headroom5.2 GB
See how fast it feels
See how fast it feelsCodestral 22B v0.1 on MacBook Pro M3 Max 48GB
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: 17.9 tok/s decode · 10.8s TTFT (warm) · 45 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 | C | Runs well | 17.9 tok/s | 5905 ms | 93K |
| Coding | C | Runs well | 17.9 tok/s | 10825 ms | 93K |
| Agentic Coding | C | Runs well | 17.9 tok/s | 15746 ms | 93K |
| Reasoning | C | Runs well | 17.9 tok/s | 12794 ms | 93K |
| RAG | C | Runs well | 17.9 tok/s | 19683 ms | 93K |
Quantization options
How Codestral 22B v0.1 (22B params) fits at each quantization level on MacBook Pro M3 Max 48GB (34.6 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 8.6 GB | Low | C45 |
Q3_K_S | 3 | 10.8 GB | Low | C46 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Codestral 22B v0.1 on your machine.
Run
lms load hf-lmstudio-community--codestral-22b-v0-1-gguf && lms server startUpgrade options