Can Devstral 2 123B Instruct run on NVIDIA H200 PCIe 141GB?

YES — Runs Great

S98Excellent

○Estimated from fit model

Devstral 2 123B Instruct needs ~95.4 GB VRAM. NVIDIA H200 PCIe 141GB has 141.0 GB. With Q4_K_M quantization, expect ~58 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: StandardBottleneck: 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) — 95.4 GB, 58.4 tok/s, Runs well

95.4 GB required141.0 GB available

68% VRAM used

Fit status

Runs well

Decode

58.4 tok/s

TTFT

3313 ms

Safe context

152K

Memory

95.4 GB / 141.0 GB

Memory breakdown

Weights75.0 GB

KV Cache5.4 GB

Runtime0.9 GB

Headroom14.1 GB

See how fast it feels

See how fast it feelsDevstral 2 123B Instruct on NVIDIA H200 PCIe 141GB
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: 58.4 tok/s decode · 3.3s TTFT (warm) · 146 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	S	Runs well	58.4 tok/s	1807 ms	152K
Coding	S	Runs well	58.4 tok/s	3313 ms	152K
Agentic Coding	S	Runs well	58.4 tok/s	4819 ms	152K
Reasoning	S	Runs well	58.4 tok/s	3915 ms	152K
RAG	S	Runs well	58.4 tok/s	6023 ms	152K

Quantization options

How Devstral 2 123B Instruct (123B params) fits at each quantization level on NVIDIA H200 PCIe 141GB (141.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	48.0 GB	Low	S87
Q3_K_S	3	60.3 GB	Low	S89
NVFP4	4

Get started

Copy-paste commands to run Devstral 2 123B Instruct on your machine.

Run

lms load Devstral-2-123B-Instruct-2512 && lms server start

Frequently asked questions

See all results for NVIDIA H200 PCIe 141GB See all hardware for Devstral 2 123B Instruct

URL: https://willitrunai.com/can-run/devstral-2-123b-on-h200-pcie-141gb

⇱