Oossa

llama.cpp b12094 speeds up Hexagon top-k sampling

The llama.cpp release changes top-k sampling on Hexagon hardware, using a scan to avoid sorting blocks that cannot make the cut. No speedup figures are given.

NoteBy Published by Oossa: 1 min read

The ggml-org team released llama.cpp b12094 on November 4, 2026, with a faster top-k sampling path for its Hexagon backend. Top-k sampling selects among the highest-scoring options when generating text.

The change targets k values from 2 to 64 and rows wider than 1,024 entries. It skips sorting blocks that cannot contain a top result, but the release gives no measured speedup.

Why it matters

People running llama.cpp on supported Hexagon hardware get a more efficient sampling method for these workloads, though the release does not quantify any real-world speed gain.

Was this article useful?
Share

Read next

Oossa · Newsletter

The week in AI, explained

Every Monday: the stories worth knowing, in plain language. Free, no spam.