VOOZH about

URL: https://willitrunai.com/can-run/hf-lmstudio-community--yi-coder-1-5b-gguf-on-m3-ultra-256gb

⇱ Yi Coder 1.5B on Mac Studio M3 Ultra 256GB? YES


Can Yi Coder 1.5B run on Mac Studio M3 Ultra 256GB?

YES — Runs Great

C40Usable
Estimated from fit model

Yi Coder 1.5B needs ~29.6 GB VRAM. Mac Studio M3 Ultra 256GB has 184.3 GB. With Q4_K_M quantization, expect ~21 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.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 29.6 GB, 21.0 tok/s, Runs well
29.6 GB required184.3 GB available
16% VRAM used

Fit status

Runs well

Decode

21.0 tok/s

TTFT

9219 ms

Safe context

14.1M

Memory

29.6 GB / 184.3 GB

Memory breakdown

Weights0.9 GB
KV Cache0.2 GB
Runtime0.9 GB
Headroom27.6 GB

See how fast it feels

See how fast it feelsYi Coder 1.5B on Mac Studio M3 Ultra 256GB
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: 21.0 tok/s decode · 9.2s TTFT (warm) · 53 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

WorkloadGradeFitDecodeTTFTContext
ChatCRuns well21.0 tok/s5029 ms12.4M
CodingCRuns well21.0 tok/s9219 ms14.1M
Agentic CodingCRuns well21.0 tok/s13410 ms14.1M
ReasoningCRuns well21.0 tok/s10895 ms14.1M
RAGCRuns well21.0 tok/s16762 ms14.1M

Quantization options

How Yi Coder 1.5B (1.5B params) fits at each quantization level on Mac Studio M3 Ultra 256GB (184.3 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
0.6 GB
LowD37
Q3_K_S
3
0.7 GB
LowD37
NVFP4
4
0.8 GB
MediumD37
Q4_K_M
4
0.9 GB
MediumD37
Q5_K_M
5
1.1 GB
HighD37
Q6_K
6
1.2 GB
HighD37
Q8_0
8
1.6 GB
Very HighD37
F16Best for your GPU
16
3.1 GB
MaximumD37

Get started

Copy-paste commands to run Yi Coder 1.5B on your machine.

Run

lms load hf-lmstudio-community--yi-coder-1-5b-gguf && lms server start

Frequently asked questions

See all results for Mac Studio M3 Ultra 256GBSee all hardware for Yi Coder 1.5B