Show HN: UL-SMF – Open-source linear-complexity ~300x KV-cache compression

liventruth 11 points 1 comment August 17, 2026
github.com · View on Hacker News

Discussion Highlights (1 comments)

colingauvin

This should be trivially demonstrable if it actually works. Cosine similarity is not a good metric, however, for attention compression.

Semantic search powered by Rivestack pgvector
4,128 stories · 37,281 chunks indexed