Can Codestral 21B Pruned i1 run on RTX 6000 Ada 48GB?

YES — Runs Great

C50Usable

○Estimated from fit model

Codestral 21B Pruned i1 needs ~21.3 GB VRAM. RTX 6000 Ada 48GB has 48.0 GB. With Q4_K_M quantization, expect ~62 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) — 21.3 GB, 61.5 tok/s, Runs well

21.3 GB required48.0 GB available

44% VRAM used

Fit status

Runs well

Decode

61.5 tok/s

TTFT

3150 ms

Safe context

190K

Memory

21.3 GB / 48.0 GB

Memory breakdown

Weights12.8 GB

KV Cache2.5 GB

Runtime1.2 GB

Headroom4.8 GB

See how fast it feels

See how fast it feelsCodestral 21B Pruned i1 on RTX 6000 Ada 48GB
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: 61.5 tok/s decode · 3.1s TTFT (warm) · 154 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	61.5 tok/s	1718 ms	190K
Coding	C	Runs well	61.5 tok/s	3150 ms	190K
Agentic Coding	C	Runs well	61.5 tok/s	4582 ms	190K
Reasoning	C	Runs well	61.5 tok/s	3723 ms	190K
RAG	C	Runs well	61.5 tok/s	5728 ms	190K

Quantization options

How Codestral 21B Pruned i1 (21B params) fits at each quantization level on RTX 6000 Ada 48GB (48.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	8.2 GB	Low	C42
Q3_K_S	3	10.3 GB	Low	C43
NVFP4	4	11.8 GB	Medium	C43
Q4_K_M	4	12.8 GB	Medium	C43
Q5_K_M	5	15.1 GB	High	C44
Q6_K	6	17.2 GB	High	C45
Q8_0Best for your GPU	8	22.5 GB	Very High	C46
F16	16	43.1 GB	Maximum	F0

Get started

Copy-paste commands to run Codestral 21B Pruned i1 on your machine.

Run

lms load hf-mradermacher--codestral-21b-pruned-i1-gguf && lms server start

Frequently asked questions

See all results for RTX 6000 Ada 48GB See all hardware for Codestral 21B Pruned i1

URL: https://willitrunai.com/can-run/hf-mradermacher--codestral-21b-pruned-i1-gguf-on-rtx-6000-ada-48gb

⇱ Codestral 21B Pruned i1 on RTX 6000 Ada 48GB? YES