VOOZH about

URL: https://willitrunai.com/can-run/qwen-3.5-4b-on-m2-24gb

⇱ Can Qwen 3.5 4B Run on Mac mini M2 24GB? YES (8.1/17.3GB)


Can Qwen 3.5 4B run on Mac mini M2 24GB?

YES — Runs Great

S88Excellent
Estimated from fit model

Qwen 3.5 4B needs ~8.1 GB VRAM. Mac mini M2 24GB has 17.3 GB. With Q4_K_M quantization, expect ~29 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth
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) — 8.1 GB, 28.6 tok/s, Runs well
8.1 GB required17.3 GB available
47% VRAM used

Fit status

Runs well

Decode

28.6 tok/s

TTFT

6760 ms

Safe context

83K

Memory

8.1 GB / 17.3 GB

Memory breakdown

Weights2.4 GB
KV Cache2.2 GB
Runtime0.9 GB
Headroom2.6 GB

See how fast it feels

See how fast it feelsQwen 3.5 4B on Mac mini M2 24GB
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: 28.6 tok/s decode · 6.8s TTFT (warm) · 72 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
ChatSRuns well28.6 tok/s3687 ms83K
CodingSRuns well28.6 tok/s6760 ms83K
Agentic CodingSRuns well28.6 tok/s9833 ms83K
ReasoningSRuns well28.6 tok/s7990 ms83K
RAGSRuns well28.6 tok/s12292 ms83K

Quantization options

How Qwen 3.5 4B (4B params) fits at each quantization level on Mac mini M2 24GB (17.3 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
1.6 GB
LowS86
Q3_K_S
3
2.0 GB
LowS86
NVFP4
4
2.2 GB
MediumS86
Q4_K_M
4
2.4 GB
MediumS86
Q5_K_M
5
2.9 GB
HighS86
Q6_K
6
3.3 GB
HighS87
Q8_0
8
4.3 GB
Very HighS88
F16Best for your GPU
16
8.2 GB
MaximumS91

Get started

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

Run

ollama run qwen3.5:4b

Your hardware

More models your Mac mini M2 24GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen 3.5 9B
9BS12.7 tok/s
👁 Mistral
Magistral Small 2507
24BB3.7 tok/s
👁 Mistral
Devstral Small 2 24B Instruct
24BB3.7 tok/s
👁 Alibaba
Qwen 3 14B
14BS8.2 tok/s

Frequently asked questions

See all results for Mac mini M2 24GBSee all hardware for Qwen 3.5 4B