Can Yi 9B Coder i1 run on RX 6600 8GB?

YES — With Offload

C48Usable

○Estimated from fit model

Yi 9B Coder i1 needs ~8.2 GB VRAM. RX 6600 8GB has 8.0 GB. With Q4_K_M quantization, expect ~14 tok/s.

Runtime: llama.cppCapacity: OffloadBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth

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) — 8.2 GB, 14.1 tok/s, Runs with offload (needs ~0.2 GB host RAM)

8.2 GB required8.0 GB available

102% VRAM needed

0.2 GB over capacity — needs offload or smaller quantization

Fit status

Runs with offload (needs ~0.2 GB host RAM)

Decode

14.1 tok/s

TTFT

13757 ms

Safe context

12K

Memory

8.2 GB / 8.0 GB

Memory breakdown

Weights5.5 GB

KV Cache1.1 GB

Runtime0.9 GB

Headroom0.8 GB

See how fast it feels

See how fast it feelsYi 9B Coder i1 on RX 6600 8GB
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: 14.1 tok/s decode · 13.8s TTFT (warm) · 35 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

Very little memory headroom

You can run the model, but there is not much room left for longer context, bigger batches, extra apps, or future model updates.

Best improvement path

Buy headroom, not only minimum fit

A slightly larger memory tier gives you safer context growth and makes the recommendation more future-proof.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	C	Runs with offload	20.0 tok/s	5282 ms	12K
Coding	C	Runs with offload (needs ~0.2 GB host RAM)	14.1 tok/s	13757 ms	12K
Agentic Coding	D	Very compromised (needs ~0.8 GB host RAM)	10.9 tok/s	25780 ms	12K
Reasoning	C	Runs with offload (needs ~0.2 GB host RAM)	14.1 tok/s	16258 ms	12K
RAG	D	Very compromised (needs ~0.8 GB host RAM)	10.9 tok/s