Can Codestral RAG 19B Pruned i1 run on MacBook Pro M4 Pro 64GB?

YES — Runs Great

C47Usable
Estimated — low-sample bucket· few comparable runs

Codestral RAG 19B Pruned i1 needs ~21.6 GB VRAM. MacBook Pro M4 Pro 64GB has 46.1 GB. With Q4_K_M quantization, expect ~23 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.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) 21.6 GB, 22.7 tok/s, Runs well
21.6 GB required46.1 GB available
47% VRAM used

Fit status

Runs well

Decode

22.7 tok/s

TTFT

8539 ms

Safe context

192K

Memory

21.6 GB / 46.1 GB

Memory breakdown

Weights11.6 GB
KV Cache2.2 GB
Runtime0.9 GB
Headroom6.9 GB

See how fast it feels

See how fast it feelsCodestral RAG 19B Pruned i1 on MacBook Pro M4 Pro 64GB
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: 22.7 tok/s decode · 8.5s TTFT (warm) · 57 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

WorkloadGradeFitDecodeTTFTContext
ChatCRuns well22.7 tok/s4658 ms192K
CodingCRuns well22.7 tok/s8539 ms192K
Agentic CodingCRuns well22.7 tok/s12421 ms192K
ReasoningCRuns well22.7 tok/s10092 ms192K
RAGCRuns well22.7 tok/s15526 ms192K

Quantization options

How Codestral RAG 19B Pruned i1 (19B params) fits at each quantization level on MacBook Pro M4 Pro 64GB (46.1 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
7.4 GB
LowC42
Q3_K_S
3
9.3 GB
LowC42
NVFP4
4
10.6 GB
MediumC43
Q4_K_M
4
11.6 GB
MediumC43
Q5_K_M
5
13.7 GB
HighC44
Q6_K
6
15.6 GB
HighC44
Q8_0
8
20.3 GB
Very HighC46
F16Best for your GPU
16
38.9 GB
MaximumC47

Get started

Copy-paste commands to run Codestral RAG 19B Pruned i1 on your machine.

Run

lms load hf-mradermacher--codestral-rag-19b-pruned-i1-gguf && lms server start

Upgrade-Optionen

Hardware, die Codestral RAG 19B Pruned i1 gut ausführt

Frequently asked questions

Can MacBook Pro M4 Pro 64GB run Codestral RAG 19B Pruned i1?

Yes, MacBook Pro M4 Pro 64GB can run Codestral RAG 19B Pruned i1 with a C grade (Runs well). Expected decode speed: 22.7 tok/s.

How much VRAM does Codestral RAG 19B Pruned i1 need?

Codestral RAG 19B Pruned i1 (19B parameters) requires approximately 21.6 GB of memory with Q4_K_M quantization.

What is the best quantization for Codestral RAG 19B Pruned i1?

The recommended quantization for Codestral RAG 19B Pruned i1 is Q4_K_M, which balances quality and memory efficiency.

What speed will Codestral RAG 19B Pruned i1 run at on MacBook Pro M4 Pro 64GB?

On MacBook Pro M4 Pro 64GB, Codestral RAG 19B Pruned i1 achieves approximately 22.7 tokens per second decode speed with a time-to-first-token of 8539ms using Q4_K_M quantization.

Can MacBook Pro M4 Pro 64GB run Codestral RAG 19B Pruned i1 for coding?

For coding workloads, Codestral RAG 19B Pruned i1 on MacBook Pro M4 Pro 64GB receives a C grade with 22.7 tok/s and 192K context.

What context window can Codestral RAG 19B Pruned i1 use on MacBook Pro M4 Pro 64GB?

On MacBook Pro M4 Pro 64GB, Codestral RAG 19B Pruned i1 can safely use up to 192K tokens of context. The model's official context limit is —, but available memory constrains the safe maximum.

Is unified memory on MacBook Pro M4 Pro 64GB as fast as VRAM for Codestral RAG 19B Pruned i1?

Not always. MacBook Pro M4 Pro 64GB can often fit larger models thanks to unified memory, but a discrete GPU with dedicated high-bandwidth VRAM may still decode faster once the model fits. For this combination, the important distinction is capacity versus sustained throughput.

See all results for MacBook Pro M4 Pro 64GBSee all hardware for Codestral RAG 19B Pruned i1
Embed this result

Paste this snippet into any page to show a live fit card.

<iframe src="https://willitrunai.com/embed/hf-mradermacher--codestral-rag-19b-pruned-i1-gguf-on-m4-pro-64gb" width="400" height="180" frameborder="0" style="border:none;border-radius:12px;overflow:hidden;" title="Will It Run AI — fit result"></iframe>

Preview: