VOOZH about

URL: https://willitrunai.com/can-run/lfm2-24b-on-m1-max-64gb

⇱ LFM2 24B on MacBook Pro M1 Max 64GB? YES


Can LFM2 24B run on MacBook Pro M1 Max 64GB?

YES — Runs Great

A81Great
Estimated from fit model

LFM2 24B needs ~24.9 GB VRAM. MacBook Pro M1 Max 64GB has 46.1 GB. With Q4_K_M quantization, expect ~16 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: LowStack: StandardBottleneck: Balanced
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) — 24.9 GB, 16.2 tok/s, Runs well
24.9 GB required46.1 GB available
54% VRAM used

Fit status

Runs well

Decode

16.2 tok/s

TTFT

11984 ms

Safe context

131K

Memory

24.9 GB / 46.1 GB

Memory breakdown

Weights14.6 GB
KV Cache2.4 GB
Runtime0.9 GB
Headroom6.9 GB

See how fast it feels

See how fast it feelsLFM2 24B on MacBook Pro M1 Max 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: 16.2 tok/s decode · 12.0s TTFT (warm) · 40 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
ChatARuns well16.2 tok/s6537 ms131K
CodingARuns well16.2 tok/s11984 ms131K
Agentic CodingARuns well16.2 tok/s17432 ms131K
ReasoningARuns well16.2 tok/s14163 ms131K
RAGARuns well16.2 tok/s21790 ms131K

Quantization options

How LFM2 24B (24B params) fits at each quantization level on MacBook Pro M1 Max 64GB (46.1 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
9.4 GB
LowA76
Q3_K_S
3
11.8 GB
LowA77
NVFP4
4
13.4 GB
MediumA77
Q4_K_M
4
14.6 GB
MediumA78
Q5_K_M
5
17.3 GB
HighA79
Q6_K
6
19.7 GB
HighA80
Q8_0Best for your GPU
8
25.7 GB
Very HighA82
F16
16
49.2 GB
MaximumF0

Get started

Copy-paste commands to run LFM2 24B on your machine.

Run

ollama run lfm2

Your hardware

More models your MacBook Pro M1 Max 64GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS33.3 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS14.4 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS11 tok/s
👁 Alibaba
Qwen 3.6 35B A3B
35BS30.8 tok/s
👁 Alibaba
Qwen3-VL 30B A3B Instruct
30BS34.4 tok/s

Frequently asked questions

See all results for MacBook Pro M1 Max 64GBSee all hardware for LFM2 24B