Can speechless zephyr code functionary 7b run on MacBook Air M4 24GB?

YES — Runs Great

C47Usable

▲Estimated — low-sample bucket· few comparable runs

speechless zephyr code functionary 7b needs ~8.6 GB VRAM. MacBook Air M4 24GB has 17.3 GB. With Q4_K_M quantization, expect ~20 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth

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.6 GB, 18.6 tok/s, Runs well

8.6 GB required17.3 GB available

50% VRAM used

Fit status

Runs well

Decode

18.6 tok/s

TTFT

10400 ms

Safe context

186K

Memory

8.6 GB / 17.3 GB

Memory breakdown

Weights4.3 GB

KV Cache0.8 GB

Runtime0.9 GB

Headroom2.6 GB

See how fast it feels

See how fast it feelsspeechless zephyr code functionary 7b on MacBook Air M4 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: 18.6 tok/s decode · 10.4s TTFT (warm) · 47 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

Workload	Grade	Fit	Decode	TTFT	Context
Chat	C	Runs well	20.2 tok/s	5219 ms	186K
Coding	C	Runs well	20.2 tok/s	9568 ms	186K
Agentic Coding	C	Runs well	20.2 tok/s	13917 ms	186K
Reasoning	C	Runs well	20.2 tok/s	11308 ms	186K
RAG	C	Runs well	20.2 tok/s	17396 ms	186K