VOOZH about

URL: https://willitrunai.com/can-run/internlm-20b-on-m1-max-32gb


Can InternLM 20B run on MacBook Pro M1 Max 32GB?

NO — Won't Fit

F0Won't run
Estimated from fit model

InternLM 20B needs ~37.1 GB but MacBook Pro M1 Max 32GB only has 23.0 GB. Try a smaller quantization or lighter model.

Runtime: llama.cppCapacity: No fitBandwidth: LowStack: StandardBottleneck: Memory capacity
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

Q5_K_M (High quality) — 37.1 GB, exceeds 23.0 GB available
37.1 GB required23.0 GB available
161% VRAM needed

14.1 GB over capacity — needs offload or smaller quantization

Fit status

Too heavy

Decode

8.4 tok/s

TTFT

22989 ms

Safe context

4K

Memory

37.1 GB / 23.0 GB

Offload

40%

Memory breakdown

Weights14.4 GB
KV Cache18.3 GB
Runtime0.9 GB
Headroom3.5 GB

See how fast it feels

With memory offload — actual speed may be lower
See how fast it feelsInternLM 20B on MacBook Pro M1 Max 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: 8.4 tok/s decode · 23.0s TTFT (warm) · 21 tok/s prefill

What limits this setup

Usable shared or unified memory is the main blocker for this model.

Not enough usable memory

The model needs 37.1 GB, but this setup only exposes 23.0 GB of usable shared or unified memory.

Best improvement path

Move to a larger memory pool

A larger unified-memory SKU or a discrete high-bandwidth GPU is the cleanest way to make this model practical.

Performance by workload

WorkloadGradeFitDecodeTTFTContext
ChatFToo heavy11.7 tok/s9005 ms4K
CodingFToo heavy8.4 tok/s22989 ms4K
Agentic CodingFToo heavy7.0 tok/s40157 ms4K
ReasoningFToo heavy8.4 tok/s27169 ms4K
RAGFToo heavy7.0 tok/s50196 ms4K

Quantization options

How InternLM 20B (20B params) fits at each quantization level on MacBook Pro M1 Max 32GB (23.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
7.8 GB
LowB56
Q3_K_S
3
9.8 GB
LowB57
NVFP4
4

Upgrade options

Hardware that runs InternLM 20B well

Mac mini M4 64GBBudget pick
64 GB Unified (+32)
C
Makes the model fit on the accelerator instead of staying completely out of reach.8 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)
B
Makes the model fit on the accelerator instead of staying completely out of reach.19.4 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

MacBook Pro M4 Max 96GBApple upgrade
96 GB Unified (+64)546 GB/s (+146)
B
Makes the model fit on the accelerator instead of staying completely out of reach.30.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.

~$2,499 MSRP

Frequently asked questions

See all results for MacBook Pro M1 Max 32GBSee all hardware for InternLM 20B
11.2 GB
Medium
B58
Q4_K_M
4
12.2 GB
MediumB58
Q5_K_M
5
14.4 GB
HighB58
Q6_KBest for your GPU
6
16.4 GB
HighB58
Q8_0
8
21.4 GB
Very HighF0
F16
16
41.0 GB
MaximumF0

Move to a larger memory pool. A larger unified-memory SKU or a discrete high-bandwidth GPU is the cleanest way to make this model practical.