Mac Studio M2 Ultra 128GBBudget pick
128 GB Unified (+48)
C
This setup is broadly balanced for this model.98 tok/s decode
~$3,999 MSRP
Can speechless zephyr code functionary 7b run on NVIDIA H800 80GB?
YES — Runs Great
C46Usable
○Estimated from fit model
speechless zephyr code functionary 7b needs ~14.3 GB VRAM. NVIDIA H800 80GB has 80.0 GB. With Q4_K_M quantization, expect ~98 tok/s.
Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: 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.
Select quantization to explore
Q4_K_M (Medium quality) — 14.3 GB, 98.0 tok/s, Runs well
14.3 GB required80.0 GB available
18% VRAM used
Fit status
Runs well
Decode
98.0 tok/s
TTFT
1976 ms
Safe context
1.3M
Memory
14.3 GB / 80.0 GB
Memory breakdown
Weights4.3 GB
KV Cache0.8 GB
Runtime1.2 GB
Headroom8.0 GB
See how fast it feels
See how fast it feelsspeechless zephyr code functionary 7b on NVIDIA H800 80GB
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: 98.0 tok/s decode · 2.0s TTFT (warm) · 245 tok/s prefill
What limits this setup
This setup is broadly balanced for this model.
No major red flags
This recommendation has enough memory headroom and acceptable estimated speed for the selected workload.
Best improvement path
Performance by workload
| Workload | Grade | Fit | Decode | TTFT | Context |
|---|---|---|---|---|---|
| Chat | C | Runs well | 98.0 tok/s | 1078 ms | 1.3M |
| Coding | C | Runs well | 98.0 tok/s | 1976 ms | 1.3M |
| Agentic Coding | C | Runs well | 98.0 tok/s | 2873 ms | 1.3M |
| Reasoning | C | Runs well | 98.0 tok/s | 2335 ms | 1.3M |
| RAG | C | Runs well | 98.0 tok/s | 3592 ms | 1.3M |
Quantization options
How speechless zephyr code functionary 7b (7B params) fits at each quantization level on NVIDIA H800 80GB (80.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 2.7 GB | Low | D39 |
Q3_K_S | 3 | 3.4 GB | Low | D39 |
NVFP4 | 4 |
Get started
Copy-paste commands to run speechless zephyr code functionary 7b on your machine.
Run
lms load hf-uukuguy--speechless-zephyr-code-functionary-7b && lms server startUpgrade options