Can Yi Coder 9B run on MacBook Pro M1 Max 64GB?

YES — Runs Great

B58Good

○Estimated from fit model

Yi Coder 9B needs ~14.8 GB VRAM. MacBook Pro M1 Max 64GB has 46.1 GB. With Q4_K_M quantization, expect ~40 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) — 14.8 GB, 43.6 tok/s, Runs well

14.8 GB required46.1 GB available

32% VRAM used

Fit status

Runs well

Decode

43.6 tok/s

TTFT

4442 ms

Safe context

131K

Memory

14.8 GB / 46.1 GB

Memory breakdown

Weights5.5 GB

KV Cache1.5 GB

Runtime0.9 GB

Headroom6.9 GB

See how fast it feels

See how fast it feelsYi Coder 9B on MacBook Pro M1 Max 64GB
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: 43.6 tok/s decode · 4.4s TTFT (warm) · 109 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	40.1 tok/s	2635 ms	131K
Coding	B	Runs well	40.1 tok/s	4831 ms	131K
Agentic Coding	B	Runs well	40.1 tok/s	7027 ms	131K
Reasoning	B	Runs well	40.1 tok/s	5710 ms	131K
RAG	B	Runs well	40.1 tok/s	8784 ms	131K