Bit-Plane Dispersion Scan

Exact top-K inner-product search over int8 vectors that reads the corpus one bit plane at a time. Each pass scores the remaining candidates with popcounts on packed planes, bounds what the unread planes could add, and drops every candidate whose upper bound falls below the K-th best lower bound.

Corpus and query

Idle.

Result

Generate a corpus, then run.

Passes (first query; counts averaged over all queries in the last column)

PassPlanes readUnread rInOut (GPU)Out (CPU ref) SurviveBytes readGPU msMean out, all q
No run yet.

What is verified where