VOOZH about

URL: https://willitrunai.com/can-run/kimi-linear-48b-a3b-on-a6000-48gb

⇱ Kimi Linear 48B A3B on RTX A6000 48GB? YES


Can Kimi Linear 48B A3B run on RTX A6000 48GB?

YES — Runs Great

A84Great
Estimated from fit model

Kimi Linear 48B A3B needs ~37.4 GB VRAM. RTX A6000 48GB has 48.0 GB. With Q4_K_M quantization, expect ~16 tok/s.

Runtime: vLLMCapacity: RoomyBandwidth: MediumStack: OptimizedBottleneck: Balanced
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) — 37.4 GB, 15.9 tok/s, Runs well
37.4 GB required48.0 GB available
78% VRAM used

Fit status

Runs well

Decode

15.9 tok/s

TTFT

12140 ms

Safe context

199K

Memory

37.4 GB / 48.0 GB

Memory breakdown

Weights29.3 GB
KV Cache0.9 GB
Runtime2.4 GB
Headroom4.8 GB

See how fast it feels

See how fast it feelsKimi Linear 48B A3B on RTX A6000 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: 15.9 tok/s decode · 12.1s TTFT (warm) · 40 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

WorkloadGradeFitDecodeTTFTContext
ChatARuns well15.9 tok/s6622 ms199K
CodingARuns well15.9 tok/s12140 ms199K
Agentic CodingARuns well15.9 tok/s17658 ms199K
ReasoningARuns well15.9 tok/s14347 ms199K
RAGARuns well15.9 tok/s22072 ms199K

Quantization options

How Kimi Linear 48B A3B (48B params) fits at each quantization level on RTX A6000 48GB (48.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
18.7 GB
LowA78
Q3_K_S
3
23.5 GB
LowA80
NVFP4
4
26.9 GB
MediumA80
Q4_K_M
4
29.3 GB
MediumA80
Q5_K_MBest for your GPU
5
34.6 GB
HighA80
Q6_K
6
39.4 GB
HighF0
Q8_0
8
51.4 GB
Very HighF0
F16
16
98.4 GB
MaximumF0

Get started

Copy-paste commands to run Kimi Linear 48B A3B on your machine.

Run

docker run --rm -it ghcr.io/ggerganov/llama.cpp:full \ --hf-repo "moonshotai/Kimi-Linear-48B-A3B-Instruct" \ --hf-file "Kimi-Linear-48B-A3B-Instruct-Q4_K_M.gguf" \ -c 4096 -ngl 99

Frequently asked questions

See all results for RTX A6000 48GBSee all hardware for Kimi Linear 48B A3B