Can Codestral RAG 19B Pruned i1 run on MacBook Pro M2 Max 96GB?

YES — Runs Great

C44Usable

○Estimated from fit model

Codestral RAG 19B Pruned i1 needs ~25.1 GB VRAM. MacBook Pro M2 Max 96GB has 69.1 GB. With Q4_K_M quantization, expect ~20 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: LowStack: StandardBottleneck: Balanced

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) — 25.1 GB, 20.0 tok/s, Runs well

25.1 GB required69.1 GB available

36% VRAM used

Fit status

Runs well

Decode

20.0 tok/s

TTFT

9672 ms

Safe context

332K

Memory

25.1 GB / 69.1 GB

Memory breakdown

Weights11.6 GB

KV Cache2.2 GB

Runtime0.9 GB

Headroom10.4 GB

See how fast it feels

See how fast it feelsCodestral RAG 19B Pruned i1 on MacBook Pro M2 Max 96GB
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: 20.0 tok/s decode · 9.7s TTFT (warm) · 50 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	20.0 tok/s	5275 ms	332K
Coding	C	Runs well	20.0 tok/s	9672 ms	332K
Agentic Coding	C	Runs well	20.0 tok/s	14068 ms	332K
Reasoning	C	Runs well	20.0 tok/s	11430 ms	332K
RAG	C	Runs well	20.0 tok/s	17585 ms	332K