Can starcoder2 15b instruct v0.1 run on MacBook Pro M4 Max 128GB?

YES — Runs Great

C44Usable

○Estimated from fit model

starcoder2 15b instruct v0.1 needs ~25.6 GB VRAM. MacBook Pro M4 Max 128GB has 92.2 GB. With Q4_K_M quantization, expect ~35 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: MediumStack: 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.6 GB, 34.7 tok/s, Runs well

25.6 GB required92.2 GB available

28% VRAM used

Fit status

Runs well

Decode

34.7 tok/s

TTFT

5573 ms

Safe context

622K

Memory

25.6 GB / 92.2 GB

Memory breakdown

Weights9.2 GB

KV Cache1.8 GB

Runtime0.9 GB

Headroom13.8 GB

See how fast it feels

See how fast it feelsstarcoder2 15b instruct v0.1 on MacBook Pro M4 Max 128GB
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: 34.7 tok/s decode · 5.6s TTFT (warm) · 87 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	34.7 tok/s	3040 ms	622K
Coding	C	Runs well	34.7 tok/s	5573 ms	622K
Agentic Coding	C	Runs well	34.7 tok/s	8107 ms	622K
Reasoning	C	Runs well	34.7 tok/s	6587 ms	622K
RAG	C	Runs well	34.7 tok/s	10133 ms	622K

Quantization options

How starcoder2 15b instruct v0.1 (15B params) fits at each quantization level on MacBook Pro M4 Max 128GB (92.2 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	5.9 GB	Low	D39
Q3_K_S	3	7.4 GB	Low	D39
NVFP4	4	8.4 GB	Medium	D39
Q4_K_M	4	9.2 GB	Medium	D39
Q5_K_M	5	10.8 GB	High	D39
Q6_K	6	12.3 GB	High	D39
Q8_0	8	16.1 GB	Very High	D40
F16Best for your GPU	16	30.7 GB	Maximum	C42