llama.cpp and DeepSeek V4: quantization explained
Learn how K-quants, I-quants and importance matrices compress model weights, with a reported 81 GB DeepSeek V4 example on a MacBook Pro.
Player not loading? Watch on YouTube
This overview explains how quantization helps people run models locally by reducing the memory needed for model weights. The speaker uses a 27-billion-parameter model as an example: its weights occupy about 54 GB at 16-bit precision, compared with roughly 14 GB at four bits. Those figures describe weights, rather than a complete runtime memory requirement.
The explanation covers K-quants, which give small blocks of weights their own scales and mix precision across layers. I-quants use codebooks of weight combinations to preserve more quality at very low bit rates. An importance matrix uses activations measured on sample text to guide which errors the quantizer should penalize most. The speaker compares this approach with GPTQ and AWQ, reporting similar quality with less calibration work.
The video credits Iwan Kawrakow's work in llama.cpp and connects these methods to a local LLM example: Salvatore Sanfilippo running DeepSeek V4 on a Mac. The speaker reports 81 GB at around two bits per weight and roughly 30 tokens per second on a MacBook Pro. These are reported results, not performance guarantees for other hardware. The closing discussion argues that rising RAM costs make compression more useful. This is an explanation of the techniques, rather than an installation guide.