1792 GB/s (+992)
C
Raises estimated decode speed by about 242%.164.5 tok/s decode
Raises estimated decode speed by about 242%.
~$9,999 MSRP
Can StarCoder2 15B run on Mac Studio M1 Ultra 128GB?
YES — Runs Great
C46Usable
○Estimated from fit model
StarCoder2 15B needs ~25.6 GB VRAM. Mac Studio M1 Ultra 128GB has 92.2 GB. With Q4_K_M quantization, expect ~48 tok/s.
Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: 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) — 25.6 GB, 48.1 tok/s, Runs well
25.6 GB required92.2 GB available
28% VRAM used
Fit status
Runs well
Decode
48.1 tok/s
TTFT
4026 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 on Mac Studio M1 Ultra 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: 48.1 tok/s decode · 4.0s TTFT (warm) · 120 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 | 48.1 tok/s | 2196 ms | 622K |
| Coding | C | Runs well | 48.1 tok/s | 4026 ms | 622K |
| Agentic Coding | C | Runs well | 48.1 tok/s | 5856 ms | 622K |
| Reasoning | C | Runs well | 48.1 tok/s | 4758 ms | 622K |
| RAG | C | Runs well | 48.1 tok/s | 7320 ms | 622K |
Quantization options
How StarCoder2 15B (15B params) fits at each quantization level on Mac Studio M1 Ultra 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 |
Get started
Copy-paste commands to run StarCoder2 15B on your machine.
Run
lms load hf-second-state--starcoder2-15b-gguf && lms server startUpgrade options