Can Qwen 3.5 27B run on Mac mini M4 64GB?

YES — Runs Great

S88Excellent

▲Estimated — low-sample bucket· few comparable runs

Qwen 3.5 27B needs ~27.5 GB VRAM. Mac mini M4 64GB has 46.1 GB. With Q4_K_M quantization, expect ~5 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: 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) — 27.5 GB, 9.3 tok/s, Runs well

27.5 GB required46.1 GB available

60% VRAM used

Fit status

Runs well

Decode

9.3 tok/s

TTFT

20710 ms

Safe context

110K

Memory

27.5 GB / 46.1 GB

Memory breakdown

Weights16.5 GB

KV Cache3.2 GB

Runtime0.9 GB

Headroom6.9 GB

See how fast it feels

See how fast it feelsQwen 3.5 27B on Mac mini M4 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: 9.3 tok/s decode · 20.7s TTFT (warm) · 23 tok/s prefill

What limits this setup

The model fits in shared memory, but shared-memory bandwidth is now the real limiter.

Fit does not mean dedicated-VRAM speed

Unified or shared memory can make a model technically fit, but sustained tokens per second may still trail a discrete high-bandwidth GPU with less total memory.

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

Prioritize bandwidth, not only capacity

If this workload feels slow, the next useful step is often a GPU tier with materially faster memory bandwidth rather than only a small bump in capacity.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	S	Runs well	9.3 tok/s	11296 ms	110K
Coding	S	Runs well	5.2 tok/s	36905 ms	110K
Agentic Coding	S	Runs well	9.3 tok/s	30123 ms	110K
Reasoning	S	Runs well	9.3 tok/s	24475 ms	110K
RAG	S	Runs well	9.3 tok/s	37654 ms	110K

Quantization options

How Qwen 3.5 27B (27B params) fits at each quantization level on Mac mini M4 64GB (46.1 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	10.5 GB	Low	S86
Q3_K_S	3	13.2 GB	Low	S87
NVFP4	4

Get started

Copy-paste commands to run Qwen 3.5 27B on your machine.

Run

ollama run qwen3.5:27b

Your hardware

More models your Mac mini M4 64GB can run

Model	Params	Grade	Decode	Capabilities
👁 Alibaba Qwen3-Coder 30B A3B Instruct	30.5B	S	13.1 tok/s

Frequently asked questions

See all results for Mac mini M4 64GB See all hardware for Qwen 3.5 27B

URL: https://willitrunai.com/can-run/qwen-3.5-27b-on-m4-mini-64gb

⇱