Downloads · 30 days
69
1% of all-time downloads
williamliao/Qwen3.6-27B-NVFP4-GGUF
Qwen3.6-27B-NVFP4-GGUF is a text generation model from williamliao. Use it when you need the model to write or continue text. It is set up for llama.cpp. The card lists the license as apache-2.0.
GGUF conversion of nvidia/Qwen3.6-27B-NVFP4 for use with llama.cpp.
Downloads · 30 days
69
1% of all-time downloads
All-time downloads
12.3K
Public
Repo size
65.4 GB
Likes
19
Public
Click a slice to open those files.
.gguf37.2 GB · 100%
From the Hugging Face model README
GGUF conversion of nvidia/Qwen3.6-27B-NVFP4 for use with llama.cpp.
This is an NVFP4-quantized standalone language model.
The converted GGUF preserves the NVFP4 tensors and the model's native MTP tensors. It is not a separate draft model and does not require an external speculator.
nvidia/Qwen3.6-27B-NVFP4Qwen/Qwen3.6-27BNVIDIA quantized the weights and activations of linear operators inside the transformer blocks to NVFP4. Other tensors may remain in higher-precision formats.
This repository contains the complete target model. It is not an MTP, EAGLE3, or DFlash draft-only checkpoint.
A recent version of llama.cpp with Qwen3.6, NVFP4, and native MTP support is required.
Tested with:
Older llama.cpp builds may fail to recognize the nvfp4 tensor type or may not correctly load the associated scale tensors.
Performance may vary with llama.cpp build, GPU split, context size, KV-cache format, prompt, sampling settings, and other runtime options.
llama-server \
-m Qwen3.6-27B-NVFP4.gguf \
--spec-type draft-mtp \
--spec-draft-n-max 3 \
--flash-attn on \
-ngl 99
llama-cli \
-m Qwen3.6-27B-NVFP4.gguf \
--spec-type draft-mtp \
--spec-draft-n-max 3 \
--flash-attn on \
-ngl 99
llama-server \
-m Qwen3.6-27B-NVFP4.gguf \
--spec-type draft-mtp \
--spec-draft-n-max 3 \
--split-mode layer \
--tensor-split 1,1 \
--flash-attn on \
-ngl 99
The best tensor split depends on available VRAM, GPU speed, PCIe topology, context length, and KV-cache placement. An even split is only a starting point.
Based on the mixed-task benchmark below:
n_max = 3 gave the best aggregate wall-clock result of the tested settings.n_max = 2 gave the highest aggregate acceptance rate.n_max = 3 was substantially faster for code completion, JSON, repeated patterns, summarization, mathematical reasoning, and long reasoning.n_max = 2 performed better for translation, creative writing, and conceptual explanations.A reasonable general-purpose starting point is:
--spec-draft-n-max 3
For translation, role-play, creative writing, conversational output, or open-ended explanations, start with:
--spec-draft-n-max 2
For code, JSON, tool output, repeated patterns, and other predictable generation, n_max = 3 is the better tested setting.
Converted from the original Hugging Face ModelOpt checkpoint using a recent convert_hf_to_gguf.py from llama.cpp:
python convert_hf_to_gguf.py \
/path/to/Qwen3.6-27B-NVFP4 \
--outfile Qwen3.6-27B-NVFP4.gguf \
--outtype auto \
--verbose
Do not pass a conventional GGUF quantization type such as q4_k_m when the goal is to preserve the original NVFP4 tensors. The conversion repackages the ModelOpt checkpoint into GGUF rather than requantizing it into a K-quant.
No neural-network weights were retrained. The original NVFP4 weights and their associated scale tensors were converted to GGUF-compatible representations.
The converted file can be checked with llama-gguf:
.\llama-gguf.exe E:\HF_MODELS\Qwen3.6-27B-NVFP4.gguf r
A successful conversion should show NVFP4 tensors and their associated scale tensors, for example:
tensor: name = blk.0.ffn_down.weight, type = nvfp4
tensor: name = blk.0.ffn_down.scale, type = f32
tensor: name = blk.0.ffn_down.input_scale, type = f32
This confirms that the checkpoint was not converted into a conventional Q4 type and is not an empty metadata-only GGUF.
Benchmarked using mtp-bench with native Qwen3.6 MTP speculative decoding.
n_max | Draft acceptance | Predicted tokens | Draft tokens | Accepted tokens | Wall time | Effective batch throughput |
|---|---|---|---|---|---|---|
| 2 | 83.7% | 1,857 | 1,380 | 1,155 | 48.97 s | 37.92 tok/s |
| 3 | 76.6% | 1,857 | 1,680 | 1,286 | 46.00 s | 40.37 tok/s |
Effective batch throughput is calculated from total predicted tokens divided by total wall time. Per-request tok/s values may be higher because aggregate wall time can also include prompt processing and benchmark overhead.
These results do not include a non-speculative baseline and therefore should not be interpreted as a direct speedup ratio over standard decoding.
n_max = 2code_python pred= 192 draft= 132 acc= 124 rate=0.939 tok/s=44.0
code_cpp pred= 54 draft= 36 acc= 36 rate=1.000 tok/s=46.1
explain_concept pred= 192 draft= 173 acc= 104 rate=0.601 tok/s=34.2
summarize pred= 46 draft= 34 acc= 29 rate=0.853 tok/s=41.3
qa_factual pred= 170 draft= 132 acc= 103 rate=0.780 tok/s=39.8
translation pred= 17 draft= 12 acc= 10 rate=0.833 tok/s=42.4
creative_short pred= 35 draft= 34 acc= 18 rate=0.529 tok/s=31.6
stepwise_math pred= 192 draft= 138 acc= 121 rate=0.877 tok/s=42.4
json_output pred= 192 draft= 128 acc= 127 rate=0.992 tok/s=46.2
long_reasoning pred= 192 draft= 138 acc= 122 rate=0.884 tok/s=42.6
repeat_pattern pred= 192 draft= 127 acc= 127 rate=1.000 tok/s=46.0
code_completion pred= 191 draft= 130 acc= 126 rate=0.969 tok/s=45.1
long_code_review pred= 192 draft= 166 acc= 108 rate=0.651 tok/s=35.6
Aggregate:
requests: 13
predicted tokens: 1857
draft tokens: 1380
accepted tokens: 1155
acceptance rate: 0.8370
total wall time: 48.97 s
n_max = 3code_python pred= 192 draft= 151 acc= 140 rate=0.927 tok/s=50.1
code_cpp pred= 54 draft= 45 acc= 40 rate=0.889 tok/s=47.8
explain_concept pred= 192 draft= 232 acc= 113 rate=0.487 tok/s=33.2
summarize pred= 46 draft= 39 acc= 32 rate=0.821 tok/s=47.3
qa_factual pred= 170 draft= 162 acc= 115 rate=0.710 tok/s=42.7
translation pred= 17 draft= 18 acc= 12 rate=0.667 tok/s=36.7
creative_short pred= 35 draft= 48 acc= 21 rate=0.438 tok/s=28.6
stepwise_math pred= 192 draft= 165 acc= 135 rate=0.818 tok/s=46.4
json_output pred= 192 draft= 144 acc= 142 rate=0.986 tok/s=52.6
long_reasoning pred= 192 draft= 167 acc= 135 rate=0.808 tok/s=46.4
repeat_pattern pred= 192 draft= 144 acc= 142 rate=0.986 tok/s=53.5
code_completion pred= 191 draft= 147 acc= 141 rate=0.959 tok/s=53.0
long_code_review pred= 192 draft= 218 acc= 118 rate=0.541 tok/s=35.5
Aggregate:
requests: 13
predicted tokens: 1857
draft tokens: 1680
accepted tokens: 1286
acceptance rate: 0.7655
total wall time: 46.00 s
n_max = 3 reduced total wall time by approximately 6.1% compared with n_max = 2.n_max = 3 increased effective aggregate throughput from approximately 37.92 tok/s to 40.37 tok/s.n_max = 2 retained a very high aggregate acceptance rate of 83.7%.n_max = 3.The results show a clear task-dependent trade-off: predictable outputs benefit from a longer native MTP draft, while high-entropy natural-language generation generally favors a shorter draft.
Q4_K_M, Q4_K_S, or an Unsloth dynamic quant.The source model is distributed under the Apache License 2.0.
Users should review the upstream nvidia/Qwen3.6-27B-NVFP4 and Qwen/Qwen3.6-27B model cards before redistribution or commercial use.