VOOZH about

URL: https://willitrunai.com/can-run/qwen-3.6-35b-a3b-on-m4-mini-32gb

⇱ Qwen 3.6 35B A3B on Mac mini M4 32GB? No — Alternatives


Can Qwen 3.6 35B A3B run on Mac mini M4 32GB?

YES — With Q3_K_S

A79Great
Estimated from fit model

Qwen 3.6 35B A3B needs ~26.5 GB VRAM. Mac mini M4 32GB has 23.0 GB. With Q3_K_S quantization, expect ~10 tok/s.

Runtime: TransformersCapacity: OffloadBandwidth: Very lowStack: StandardBottleneck: Host offload
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.

Qwen 3.6 35B A3B at Q4_K_M needs 30.7 GB — too much for Mac mini M4 32GB (23.0 GB). Runs at Q3_K_S (26.5 GB) with low quality. 2 quantization levels fit.
Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 30.7 GB, exceeds 23.0 GB available
30.7 GB required23.0 GB available
133% VRAM needed

7.7 GB over capacity — needs offload or smaller quantization

Fit status

Too heavy

Decode

6.7 tok/s

TTFT

28830 ms

Safe context

4K

Memory

30.7 GB / 23.0 GB

Offload

20%

Memory breakdown

Weights21.3 GB
KV Cache4.1 GB
Runtime1.8 GB
Headroom3.5 GB

See how fast it feels

With memory offload — actual speed may be lower
See how fast it feelsQwen 3.6 35B A3B on Mac mini M4 32GB
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: 6.7 tok/s decode · 28.8s TTFT (warm) · 17 tok/s prefill

What limits this setup

It fits through host-memory offload, and offload is the main reason performance drops.

CPU or host-memory offload is active

About 10% of the working set spills out of accelerator memory, which usually hurts latency and sustained decode throughput.

Very little memory headroom

You can run the model, but there is not much room left for longer context, bigger batches, extra apps, or future model updates.

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

Remove offload with more accelerator memory

Prioritize a GPU or unified-memory tier that fits the whole model natively. Removing offload usually helps more than small compute gains.

Buy headroom, not only minimum fit

A slightly larger memory tier gives you safer context growth and makes the recommendation more future-proof.

Increase host RAM if you keep offloading

This setup may need roughly 2.2 GB of extra host RAM just for the offloaded portion, before OS and other tools.

Performance by workload

WorkloadGradeFitDecodeTTFTContext
ChatFToo heavy7.4 tok/s14285 ms4K
CodingFToo heavy6.7 tok/s28830 ms4K
Agentic CodingFToo heavy5.6 tok/s49918 ms4K
ReasoningFToo heavy6.7 tok/s34072 ms4K
RAGFToo heavy5.6 tok/s62398 ms4K

Quantization options

How Qwen 3.6 35B A3B (35B params) fits at each quantization level on Mac mini M4 32GB (23.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
13.7 GB
LowS92
Q3_K_SBest for your GPU
3
17.2 GB
LowS92
NVFP4
4
19.6 GB
MediumF0
Q4_K_M
4
21.3 GB
MediumF0
Q5_K_M
5
25.2 GB
HighF0
Q6_K
6
28.7 GB
HighF0
Q8_0
8
37.5 GB
Very HighF0
F16
16
71.8 GB
MaximumF0

Get started

Copy-paste commands to run Qwen 3.6 35B A3B on your machine.

Run

docker run --rm -it ghcr.io/ggerganov/llama.cpp:full \ --hf-repo "Qwen/Qwen3.6-35B-A3B" \ --hf-file "Qwen3.6-35B-A3B-Q4_K_M.gguf" \ -c 4096 -ngl 99

Upgrade options

Hardware that runs Qwen 3.6 35B A3B well

Mac mini M4 64GBBudget pick
64 GB Unified (+32)
S
Makes the model fit on the accelerator instead of staying completely out of reach.11 tok/s decode

Makes the model fit on the accelerator instead of staying completely out of reach.

Removes host-memory offload, which is usually the single biggest latency and throughput win.

~$1,099 MSRP

MacBook Pro M4 Pro 64GBBest value
64 GB Unified (+32)273 GB/s (+153)
S
Makes the model fit on the accelerator instead of staying completely out of reach.26.7 tok/s decode

Makes the model fit on the accelerator instead of staying completely out of reach.

Removes host-memory offload, which is usually the single biggest latency and throughput win.

~$1,599 MSRP

Mac Studio M2 Ultra 64GBApple upgrade
64 GB Unified (+32)800 GB/s (+680)
S
Makes the model fit on the accelerator instead of staying completely out of reach.59 tok/s decode

Makes the model fit on the accelerator instead of staying completely out of reach.

Removes host-memory offload, which is usually the single biggest latency and throughput win.

~$3,999 MSRP

Frequently asked questions

See all results for Mac mini M4 32GBSee all hardware for Qwen 3.6 35B A3B