Can Yi Coder 9B run on MacBook Pro M4 16GB?

YES — Tight Fit

B60Good

▲Estimated — low-sample bucket· few comparable runs

Yi Coder 9B needs ~9.6 GB VRAM. MacBook Pro M4 16GB has 11.5 GB. With Q4_K_M quantization, expect ~16 tok/s.

Runtime: llama.cppCapacity: TightBandwidth: 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.6 GB, 15.7 tok/s, Tight fit

9.6 GB required11.5 GB available

83% VRAM used

Fit status

Tight fit

Decode

15.7 tok/s

TTFT

12296 ms

Safe context

37K

Memory

9.6 GB / 11.5 GB

Memory breakdown

Weights5.5 GB

KV Cache1.5 GB

Runtime0.9 GB

Headroom1.7 GB

See how fast it feels

See how fast it feelsYi Coder 9B on MacBook Pro M4 16GB
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: 15.7 tok/s decode · 12.3s TTFT (warm) · 39 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	B	Runs well	15.7 tok/s	6707 ms	37K
Coding	B	Tight fit	15.7 tok/s	12296 ms	37K
Agentic Coding	B	Runs with offload	15.7 tok/s	17884 ms	37K
Reasoning	B	Tight fit	15.7 tok/s	14531 ms	37K
RAG	B	Runs with offload	15.7 tok/s	22355 ms	37K

Quantization options

How Yi Coder 9B (9B params) fits at each quantization level on MacBook Pro M4 16GB (11.5 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	3.5 GB	Low	B63
Q3_K_S	3	4.4 GB	Low	B64
NVFP4	4	5.0 GB	Medium	B65
Q4_K_M	4	5.5 GB	Medium	B65
Q5_K_M	5	6.5 GB	High	B64
Q6_KBest for your GPU	6	7.4 GB	High	B64
Q8_0	8	9.6 GB	Very High	F0
F16	16	18.5 GB	Maximum	F0