Answer

How much quality do you lose when you quantize a local LLM?

On the published task-level evidence available today, a good 4-bit quantization of a mid-sized model is close to indistinguishable from the full-precision weights on several standard benchmarks, 2-bit shows a measurable but often usable decline, and 1-bit collapses to around random-guess performance on hard reasoning tasks. The damage is nonlinear rather than gradual, so the practical rule is to run the largest model that fits your memory at roughly 4-bit, and to treat sub-2-bit files as demos rather than working tools. These numbers come from one carefully documented public benchmark run on one model plus the quantization vendor's own divergence measurements, so treat them as a strong indication of the shape of the curve, not as a universal constant for every model you download.

Published · Updated · Evidence-linked, not search-volume ranked.

Short answer

Much less than most people fear at 4-bit, and far more than most people expect below 2-bit. In the most detailed public benchmark run currently available, a 4-bit GGUF of a 27B model matched the full BF16 weights on GPQA Diamond, on the IFBench instruction-following benchmark, and on the Terminal-Bench 2.1 agentic coding benchmark, while shrinking the file from 55 GB to 17 GB. A 2-bit build of the same model held instruction-following almost perfectly but lost a visible amount on agentic coding and wrote roughly a quarter more tokens to solve the same tasks. A 1-bit build scored around random guessing on GPQA Diamond, and the quantization vendor itself now tells users not to use 1-bit files for tool calling. The important structural fact is that the loss curve is nonlinear: there is a long flat region where you genuinely cannot measure a difference, then a small decline, then a collapse. Your job is to stay in the flat region, which for current models usually means 4-bit, and to verify on your own prompts rather than trusting a single number.

Why this question is current

Exact query-volume data was unavailable, so RepoRadar uses these as current demand and intent signals rather than a claimed volume ranking.

  • q4_k_m vs q8_0 · Google Suggest (autocomplete) via suggestqueries.google.com · United States, English (gl=us, hl=en) · checked 2026-09-08T23:20:00Z
    Live autocomplete returned a full ten-completion cluster of quantization comparison intent: q4_k_m vs q8_0, q4_k_m vs q8_0 vs bf16, quantization q4_k_m vs q8_0, qwen q4_k_m vs q8_0, q4_k_m vs q8_0 vs fp16, llm q4_k_m vs q8_0, gemma 4 q4_k_m vs q8_0, q4_k_m vs q6_k vs q8_0, qwen 3.5 9b q4_k_m vs q8_0, and difference between q4_k_m and q8_0. This is a current demand and intent signal from live autocomplete, not an exact search-volume figure.
  • how much vram qwen 27b · Google Suggest (autocomplete) via suggestqueries.google.com · United States, English (gl=us, hl=en) · checked 2026-09-08T23:20:00Z
    Seven live completions, five of them model-fit intent for a specific model size: how much vram for qwen 27b, how much vram for qwen 3.6 27b, how much vram for qwen 3.5 27b, how much vram to run qwen 3.6 27b, and how much vram do i need for qwen 3.6 27b. Confirms readers are sizing memory against a specific quantized file, not asking abstractly. A current demand signal, not a volume figure.
  • quantization · Hacker News front page and Algolia search API · global English-language developer community · checked 2026-09-08T23:25:00Z
    nbHits 491 for the topic overall. The single highest-scoring recent item is on the front page at the time of checking: Benchmarking Qwen3.8 27B quantizations: 4-bit holds up, 1-bit collapses, objectID 49611128, 198 points and 97 comments, created 2026-09-08T14:49:19Z. Corroborates that the quality-loss question is being actively argued today, and is not a claim about search volume.

Who this helps

  • anyone choosing which GGUF file to download for a local model
  • local AI users deciding between a bigger model at lower precision and a smaller model at higher precision
  • developers sizing a GPU or a Mac for local inference
  • builders who need to know when a cheap quantization will quietly break tool calling

The shape of the curve matters more than any single number

Quantization stores each model weight in fewer bits. A 27B-parameter model at BF16 needs roughly 55 GB on disk; the same model at about 4.5 bits per weight is roughly 17 GB. The obvious question is what you paid for that reduction.

The measured answer is not a straight line. In the benchmark run cited below there is a long flat region where the quantized model matches the full-precision model within measurement noise, then a modest decline, then a collapse. Treating quantization as a smooth dial where 8-bit is a bit better than 4-bit and 2-bit is a bit worse than 4-bit will lead you to the wrong file.

That shape is why the practical advice is a threshold rather than a preference. You are not trading quality against size continuously. You are staying on one side of a cliff.

  • 8-bit and 4-bit: no reliably measurable difference on the benchmarks tested.
  • 2-bit: instruction-following largely intact, agentic coding measurably worse, more tokens spent per solved task.
  • 1-bit: around random-guess performance on hard reasoning, and tool calling breaks.

What the published measurements actually show

The most detailed public run available today tested a 27B model at BF16, 8-bit Q8_0 at 29 GB, 4-bit Q4_K_M at 17 GB, 2-bit UD-Q2_K_XL at 10.7 GB, and 1-bit UD-IQ1_S at 6.2 GB, across three benchmarks: GPQA Diamond for graduate-level science reasoning, IFBench for instruction following, and Terminal-Bench 2.1 for agentic coding.

The result worth remembering is that the 4-bit build replicated the full-precision score on Terminal-Bench 2.1, the hardest of the three. On GPQA Diamond the author first replicated the vendor's published BF16 number, which is the credibility check that most informal comparisons skip, and then found little difference down to 4-bit with only the 2-bit build scoring lower. On IFBench there was no change at all down to the 2-bit build.

The 2-bit result is more interesting than a single score suggests. It fell noticeably on agentic coding but stayed at a level the author compared to earlier frontier models, and on the tasks it did solve it used a similar number of turns while writing roughly a quarter more output tokens. That is a cost you feel as latency and token spend rather than as a wrong answer.

At 1-bit the numbers stop being a tradeoff. Scores landed around the random-guessing line on GPQA Diamond, and the smallest build fell below it. A detail worth internalising: at 1-bit, giving the model more reasoning effort made it worse, because it reasoned until the token budget ran out and returned nothing.

Why one benchmark run is not the whole truth

This is a single model family, tested by one author, on three benchmarks, with one set of quantization files from one vendor. It is unusually well documented for this kind of comparison, including a replication of the official full-precision numbers and a disclosure of roughly 3,000 USD in rented GPU cost, but it is still one data point about the shape of the curve rather than a constant that transfers to every model.

Separate factors move the result. The benchmark used an F16 KV cache regardless of weight quantization, at roughly 2.3 GB per 32k tokens, so it does not tell you what happens when you also quantize the KV cache; llama.cpp exposes that as its own setting with values from f32 down to q4_0. Quantization quality also differs by producer, because the calibration data and the per-layer bit allocation are choices, not a fixed formula.

Reasoning effort turned out to matter more than the quantization level in some of the tests. That is a useful warning: if you change two settings at once and the model gets worse, do not automatically blame the quantization.

A decision rule you can apply today

Start from memory, not from the quantization label. Pick the largest model whose weights and your intended context window both fit in the memory you have, then choose roughly a 4-bit build of that model. On current evidence that gets you most of the capability of the full weights.

Go above 4-bit only when you have a specific reason and the memory is free anyway. The evidence does not show a reliable benefit for 8-bit on task benchmarks, so spending memory there usually costs you context length or model size that would have helped more.

Go below 4-bit only for non-agentic work. A 2-bit build is a reasonable choice for chat, summarising, and general knowledge on hardware that cannot hold the 4-bit file. Do not put a 2-bit or smaller build behind a tool-calling agent.

Treat 1-bit files as experiments. The vendor that produces them says directly that they should not be used for tool calling, that they need a presence penalty of 1.5 or higher to stop looping, and that thinking must stay enabled or they may return nothing at all. That is not a quality tradeoff; it is a different kind of artifact.

  • Fit the model and the context first, then choose the quantization.
  • 4-bit is the default. Deviating needs a reason.
  • Anything below 2-bit is out of scope for agents and tool use.
  • KV-cache precision is a separate setting; change one thing at a time.

How to check it yourself in under an hour

Public benchmarks answer the general question. Your own prompts answer yours. Download two builds of the same model, one at roughly 4-bit and one a step smaller, and keep everything else identical: same runtime, same context length, same sampling settings, same KV-cache type.

Assemble twenty prompts drawn from work you actually do, with an answer you can grade quickly as right or wrong. Run both builds on all twenty, record the score and the wall-clock time, and only then decide. Twenty items will not give you a statistically tight result, but it will reliably catch a collapse, which is the failure mode that matters.

If you use tools or function calling, include at least five prompts that require a tool call. That is where low-bit builds fail first and where a chat-only test will not warn you.

What this answer does not claim

RepoRadar has not run these benchmarks. Every number here is attributed to a named published source and is reproduced rather than reproduced-and-verified by us.

The figures describe one model family at one point in time. A different architecture, a different quantization producer, or a mixture-of-experts model with a different sensitivity profile can move the cliff. The direction of the finding, that damage is nonlinear and that the collapse is below 2-bit, is more transferable than the exact scores.

Nothing here covers quantization-aware training or quantization for fine-tuning, both of which have different tradeoffs from the post-training quantization used to produce downloadable GGUF files.

A useful next action

Open the model page for whatever you are running locally, look at which quantization you actually downloaded, and check its bits per weight against the format table in the Hugging Face documentation. Many people are running a legacy or an unnecessarily large build without knowing it.

If you are below 4-bit and you use tool calling, move up one step and re-run your twenty prompts. If you are above 4-bit, try moving down one step and spending the freed memory on a longer context or a larger model instead.

Sources checked

  • Quesma - Benchmarking Qwen3.8 27B quantizations: 4-bit holds up, 1-bit collapses ↗ checked · global, independent benchmark run

    Primary source for every task-level number in this article. States the full BF16 model is 55 GB and the Q4_K_M build is 17 GB, fitting a 24 GB card with room for roughly 64k tokens of context. Reports that the author first replicated the vendor-reported BF16 GPQA Diamond result, then found little difference down to 4-bit with only 2-bit scoring slightly lower; that IFBench showed no change down to a 2-bit build under 11 GB; and that on Terminal-Bench 2.1 the Q4_K_M build replicated the BF16 result while the 2-bit UD-Q2_K_XL build fell noticeably but stayed at a usable level. Also reports that on the same solved tasks the 2-bit build used a similar number of turns but wrote about a quarter more output tokens, that 1-bit builds scored around random guessing on GPQA Diamond, and that at 1-bit a higher reasoning effort scored worse than a low one because the model exhausted its token budget and returned empty answers. Discloses methodology: llama.cpp build from 16 August 2026, F16 KV cache regardless of weight quantization at roughly 2.3 GB per 32k tokens, Unsloth quantizations, and roughly 3,000 USD of rented GPU time.

  • Unsloth - Dynamic 3.0 GGUFs documentation ↗ checked · global, quantization vendor documentation

    Primary vendor documentation for the quantization files used in the benchmark above, and the source of the strongest caution in this article. Describes a Divergence-300 at 32 tokens metric built from 300 held-out prompts, and states there is a sharp drop from the 2-bit UD-Q2_K_XL build to UD-IQ2_S, from around 25 percent to under 8 to 10 percent, at which point tool calling and non-thinking modes break down. The vendor explicitly advises that 1-bit quantizations should not be used for agentic use cases or tool calling, that they require a presence penalty of 1.5 or higher to avoid looping, and that thinking must stay enabled or the model may output nothing. Also states the vendor's own top-1 accuracy figure of around 72 percent for a 6.2 GB 1-bit build, while cautioning that top-1 accuracy is a weaker indicator than the multi-token divergence measure.

  • Hugging Face Hub documentation - GGUF quantization types ↗ checked · global, format documentation

    Primary reference for what the quantization labels mean. Documents that Q4_K uses super-blocks of 8 blocks of 32 weights with a 6-bit block scale and minimum, giving 4.5 bits per weight; that Q5_K gives 5.5 bits per weight and Q6_K gives 6.5625 bits per weight; that Q2_K gives 2.625 bits per weight; and that the IQ series uses an importance matrix, with IQ1_S at 1.56 and IQ1_M at 1.75 bits per weight. Also marks Q8_0, Q4_0 and the other underscore-zero formats as legacy round-to-nearest methods.

  • llama.cpp server documentation ↗ checked · global, upstream project documentation

    Primary source for the separate KV-cache precision controls that most quantization discussions omit. Documents the --cache-type-k and --cache-type-v flags with allowed values f32, f16, bf16, q8_0, q4_0, q4_1, iq4_nl, q5_0 and q5_1, defaulting to f16 for both. Confirms KV-cache precision is configured independently of weight quantization.

  • RepoRadar guide - Ollama vs LM Studio vs llama.cpp ↗ checked · RepoRadar internal

    RepoRadar companion answer covering which runtime exposes quantization choice and how, which is the step immediately before choosing a quantization level.

RepoRadar separates factual source claims from analysis. Recheck vendor docs before purchase, deployment, or policy decisions.