Can Qwen 3.5 122B A10B run on MacBook Pro M3 Max 128GB?

YES — With Offload

S90Excellent

○Estimated from fit model

Qwen 3.5 122B A10B needs ~91.6 GB VRAM. MacBook Pro M3 Max 128GB has 92.2 GB. With Q4_K_M quantization, expect ~14 tok/s.

Runtime: llama.cppCapacity: OffloadBandwidth: 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) — 91.6 GB, 15.0 tok/s, Runs with offload

91.6 GB required92.2 GB available

99% VRAM used

Fit status

Runs with offload

Decode

15.0 tok/s

TTFT

12945 ms

Safe context

20K

Memory

91.6 GB / 92.2 GB

Memory breakdown

Weights74.4 GB

KV Cache2.4 GB

Runtime0.9 GB

Headroom13.8 GB

See how fast it feels

See how fast it feelsQwen 3.5 122B A10B on MacBook Pro M3 Max 128GB
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: 15.0 tok/s decode · 12.9s TTFT (warm) · 37 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

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

Buy headroom, not only minimum fit

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

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	S	Runs with offload	13.7 tok/s	7723 ms	20K
Coding	S	Runs with offload	13.7 tok/s	14159 ms	20K
Agentic Coding	S	Runs with offload	13.1 tok/s	21531 ms	20K
Reasoning	S	Runs with offload	13.7 tok/s	16733 ms	20K
RAG	S	Runs with offload	13.1 tok/s	26913 ms	20K

Quantization options

How Qwen 3.5 122B A10B (122B params) fits at each quantization level on MacBook Pro M3 Max 128GB (92.2 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	47.6 GB	Low	S90
Q3_K_S	3	59.8 GB	Low	S90
NVFP4	4

Get started

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

Run

lms load Qwen3.5-122B-A10B-Instruct && lms server start

Your hardware

More models your MacBook Pro M3 Max 128GB can run

Model	Params	Grade	Decode	Capabilities
👁 Mistral Devstral 2 123B Instruct	123B	S	3.3 tok/s

Frequently asked questions

See all results for MacBook Pro M3 Max 128GB See all hardware for Qwen 3.5 122B A10B

URL: https://willitrunai.com/can-run/qwen-3.5-122b-a10b-on-m3-max-128gb

⇱