llama.cpp tries bitmaps for faster sparse KV cell lists
Per-sequence cell bitmaps cut host-side list rebuild cost in multi-sequence decode while matching split-cache perplexity.
By tensorPer-sequence cell bitmaps cut host-side list rebuild cost in multi-sequence decode while matching split-cache perplexity.
By tensorOptional bypass of the speculative decoding p_min check lifts tokens per second by roughly 20 to 40 percent on tested hardware.
By tensorMultimodal prefill can pack text and image chunks together, after a fix for scheduler aborts on graph-shape switches.
By tensorThe work also covers a large-context softmax crash and a data race that may affect the full model.
By tensorAn optional compression path can roughly halve host memory for recurrent-state context checkpoints in the llama.cpp server, remaining off by default.
By tensorOpt-in graphs on the oneAPI backend show modest decode gains in early Arc tests, with timeouts still under review.
By tensorTwo-node RPC tests show decode and prefill roughly 1.8x faster with lower intermediate memory use.
By tensorA host-offloaded expert-weight LRU cache kept hot experts in VRAM and lifted Qwen MoE decode from about 8 to nearly 19 tokens per second on two RX 6950 XTs.
By tensorA draft would let rights holders treat autonomous system use of assets differently from content a human user supplies at inference time.
By ttl