Can DeepSeek V3.2 run on NVIDIA B200 180GB?

NO — Won't Fit

F0Won't run

○Estimated from fit model

DeepSeek V3.2 needs ~429.0 GB but NVIDIA B200 180GB only has 180.0 GB. Try a smaller quantization or lighter model.

Runtime: OllamaCapacity: No fitBandwidth: HighStack: BasicBottleneck: Memory capacity

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) — 429.0 GB, exceeds 180.0 GB available

429.0 GB required180.0 GB available

238% VRAM needed

249.0 GB over capacity — needs offload or smaller quantization

Fit status

Too heavy

Decode

10.7 tok/s

TTFT

18138 ms

Safe context

Memory

429.0 GB / 180.0 GB

Offload

60%

Memory breakdown

Weights409.3 GB

KV Cache0.5 GB

Runtime1.2 GB

Headroom18.0 GB

See how fast it feels

With memory offload — actual speed may be lower

See how fast it feelsDeepSeek V3.2 on NVIDIA B200 180GB
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: 10.7 tok/s decode · 18.1s TTFT (warm) · 27 tok/s prefill

What limits this setup

Usable VRAM is the main blocker for this model.

Not enough usable memory

The model needs 429.0 GB, but this setup only exposes 180.0 GB of usable VRAM.

Best improvement path

Add more VRAM headroom

The first useful upgrade is more dedicated VRAM so you can fit the model without shrinking context or dropping to a much lower quant.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	F	Too heavy	9.7 tok/s	10866 ms	4K
Coding	F	Too heavy	9.7 tok/s	19938 ms	4K
Agentic Coding	F	Too heavy	10.7 tok/s	26430 ms	4K
Reasoning	F	Too heavy	10.7 tok/s	21436 ms	4K
RAG	F	Too heavy	10.7 tok/s	33038 ms	4K

Quantization options

How DeepSeek V3.2 (671B params) fits at each quantization level on NVIDIA B200 180GB (180.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	261.7 GB	Low	F0
Q3_K_S	3	328.8 GB	Low	F0
NVFP4	4

Frequently asked questions

See all results for NVIDIA B200 180GB See all hardware for DeepSeek V3.2

URL: https://willitrunai.com/can-run/deepseek-v3.2-671b-on-b200-180gb

⇱