Can Granite 4.1 30B run on NVIDIA H100 80GB?

YES — Runs Great

A83Great

○Estimated from fit model

Granite 4.1 30B needs ~31.4 GB VRAM. NVIDIA H100 80GB has 80.0 GB. With Q4_K_M quantization, expect ~154 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: 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) — 31.4 GB, 165.3 tok/s, Runs well

31.4 GB required80.0 GB available

39% VRAM used

Fit status

Runs well

Decode

165.3 tok/s

TTFT

1171 ms

Safe context

131K

Memory

31.4 GB / 80.0 GB

Memory breakdown

Weights18.3 GB

KV Cache3.9 GB

Runtime1.2 GB

Headroom8.0 GB

See how fast it feels

See how fast it feelsGranite 4.1 30B on NVIDIA H100 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: 165.3 tok/s decode · 1.2s TTFT (warm) · 413 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	A	Runs well	165.3 tok/s	639 ms	131K
Coding	A	Runs well	153.8 tok/s	1259 ms	131K
Agentic Coding	A	Runs well	165.3 tok/s	1704 ms	131K
Reasoning	A	Runs well	165.3 tok/s	1384 ms	131K
RAG	A	Runs well	165.3 tok/s	2129 ms	131K

Quantization options

How Granite 4.1 30B (30B params) fits at each quantization level on NVIDIA H100 80GB (80.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	11.7 GB	Low	A73
Q3_K_S	3	14.7 GB	Low	A73
NVFP4	4

Get started

Copy-paste commands to run Granite 4.1 30B on your machine.

Run

ollama run granite4.1:30b

Your hardware

More models your NVIDIA H100 80GB can run

Model	Params	Grade	Decode	Capabilities
👁 Mistral Devstral 2 123B Instruct	123B	A	28.9 tok/s
👁 Alibaba Qwen3-Coder 30B A3B Instruct	30.5B	S

Frequently asked questions

See all results for NVIDIA H100 80GB See all hardware for Granite 4.1 30B

URL: https://willitrunai.com/can-run/granite-4.1-30b-on-h100-80gb

⇱