VOOZH about

URL: https://willitrunai.com/can-run/kimi-k2-5-on-a800-80gb


Can Kimi K2.5 run on NVIDIA A800 80GB?

NO — Won't Fit

F0Won't run
Estimated from fit model

Kimi K2.5 needs ~627.8 GB but NVIDIA A800 80GB only has 80.0 GB. Try a smaller quantization or lighter model.

Runtime: vLLMCapacity: No fitBandwidth: HighStack: OptimizedBottleneck: Memory capacity
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.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 627.8 GB, exceeds 80.0 GB available
627.8 GB required80.0 GB available
785% VRAM needed

547.8 GB over capacity — needs offload or smaller quantization

Fit status

Too heavy

Decode

2.0 tok/s

TTFT

96800 ms

Safe context

4K

Memory

627.8 GB / 80.0 GB

Offload

90%

Memory breakdown

Weights610.0 GB
KV Cache7.4 GB
Runtime2.4 GB
Headroom8.0 GB

See how fast it feels

With memory offload — actual speed may be lower
See how fast it feelsKimi K2.5 on NVIDIA A800 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: 2.0 tok/s decode · 96.8s TTFT (warm) · 5 tok/s prefill

What limits this setup

Usable VRAM is the main blocker for this model.

Not enough usable memory

The model needs 627.8 GB, but this setup only exposes 80.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

WorkloadGradeFitDecodeTTFTContext
ChatFToo heavy2.0 tok/s52800 ms4K
CodingFToo heavy2.0 tok/s96800 ms4K
Agentic CodingFToo heavy2.0 tok/s140800 ms4K
ReasoningFToo heavy2.0 tok/s114400 ms4K
RAGFToo heavy2.0 tok/s176000 ms4K

Quantization options

How Kimi K2.5 (1000B params) fits at each quantization level on NVIDIA A800 80GB (80.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
390.0 GB
LowF0
Q3_K_S
3
490.0 GB
LowF0
NVFP4
4

Frequently asked questions

See all results for NVIDIA A800 80GBSee all hardware for Kimi K2.5
560.0 GB
Medium
F0
Q4_K_M
4
610.0 GB
MediumF0
Q5_K_M
5
720.0 GB
HighF0
Q6_K
6
820.0 GB
HighF0
Q8_0
8
1070.0 GB
Very HighF0
F16
16
2050.0 GB
MaximumF0