VOOZH about

URL: https://willitrunai.com/can-run/hf-gabriellarson--mamba-codestral-7b-v0-1-gguf-on-rtx-3060-12gb

⇱ Mamba Codestral 7B v0.1 on RTX 3060 12GB? YES


Can Mamba Codestral 7B v0.1 run on RTX 3060 12GB?

YES — Runs Great

C53Usable
Estimated from fit model

Mamba Codestral 7B v0.1 needs ~7.5 GB VRAM. RTX 3060 12GB has 12.0 GB. With Q4_K_M quantization, expect ~56 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: LowStack: BasicBottleneck: 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) — 7.5 GB, 55.6 tok/s, Runs well
7.5 GB required12.0 GB available
63% VRAM used

Fit status

Runs well

Decode

55.6 tok/s

TTFT

3479 ms

Safe context

104K

Memory

7.5 GB / 12.0 GB

Memory breakdown

Weights4.3 GB
KV Cache0.8 GB
Runtime1.2 GB
Headroom1.2 GB

See how fast it feels

See how fast it feelsMamba Codestral 7B v0.1 on RTX 3060 12GB
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: 55.6 tok/s decode · 3.5s TTFT (warm) · 139 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
ChatCRuns well55.6 tok/s1898 ms104K
CodingCRuns well55.6 tok/s3479 ms104K
Agentic CodingCRuns well55.6 tok/s5061 ms104K
ReasoningCRuns well55.6 tok/s4112 ms104K
RAGCRuns well55.6 tok/s6326 ms104K

Quantization options

How Mamba Codestral 7B v0.1 (7B params) fits at each quantization level on RTX 3060 12GB (12.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
2.7 GB
LowC49
Q3_K_S
3
3.4 GB
LowC49
NVFP4
4
3.9 GB
MediumC50
Q4_K_M
4
4.3 GB
MediumC51
Q5_K_M
5
5.0 GB
HighC52
Q6_K
6
5.7 GB
HighC52
Q8_0Best for your GPU
8
7.5 GB
Very HighC51
F16
16
14.3 GB
MaximumF0

Get started

Copy-paste commands to run Mamba Codestral 7B v0.1 on your machine.

Run

lms load hf-gabriellarson--mamba-codestral-7b-v0-1-gguf && lms server start

Frequently asked questions

See all results for RTX 3060 12GBSee all hardware for Mamba Codestral 7B v0.1