Can Mamba Codestral 7B v0.1 run on MacBook Pro M3 Pro 36GB?

YES — Runs Great

C46Usable

○Estimated from fit model

Mamba Codestral 7B v0.1 needs ~9.9 GB VRAM. MacBook Pro M3 Pro 36GB has 25.9 GB. With Q4_K_M quantization, expect ~30 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth

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

9.9 GB required25.9 GB available

38% VRAM used

Fit status

Runs well

Decode

29.5 tok/s

TTFT

6565 ms

Safe context

329K

Memory

9.9 GB / 25.9 GB

Memory breakdown

Weights4.3 GB

KV Cache0.8 GB

Runtime0.9 GB

Headroom3.9 GB

See how fast it feels

See how fast it feelsMamba Codestral 7B v0.1 on MacBook Pro M3 Pro 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.5 tok/s decode · 6.6s TTFT (warm) · 74 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	29.5 tok/s	3581 ms	329K
Coding	C	Runs well	29.5 tok/s	6565 ms	329K
Agentic Coding	C	Runs well	29.5 tok/s	9549 ms	329K
Reasoning	C	Runs well	29.5 tok/s	7758 ms	329K
RAG	C	Runs well	29.5 tok/s	11936 ms	329K

Quantization options

How Mamba Codestral 7B v0.1 (7B params) fits at each quantization level on MacBook Pro M3 Pro 36GB (25.9 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	2.7 GB	Low	C44
Q3_K_S	3	3.4 GB	Low	C44
NVFP4	4	3.9 GB	Medium	C44
Q4_K_M	4	4.3 GB	Medium	C44
Q5_K_M	5	5.0 GB	High	C45
Q6_K	6	5.7 GB	High	C45
Q8_0	8	7.5 GB	Very High	C46
F16Best for your GPU	16	14.3 GB	Maximum	C50