
one matrix replaced the KV cache. (the technique is 100% open source) Kimi just dropped K3, an open model at frontier scale. it leans on a new mechanism called delta attention that does not keep a growing KV cache. that is how it holds a million tokens of context without the memory blowing up. before we can understand delta attention, we need to understand attention itself. it is a lookup. every token stores a key, which works like an address, and a value, which is the content at that address. to build its output, a token sends out a query, matches it against every key in the sequence, and pulls back a blend of the values whose keys matched. that is the picture at the top of the diagram. standard attention keeps every one of those key and value pairs as a list, one entry per token. that list is the KV cache, and it grows with the sequence, so each new token has to scan the whole thing to build its output. double the context and you double both the storage and the scanning, which is where the quadratic cost and the ballooning memory come from. delta attention keeps the lookup but throws away the list. the entire past collapses into one fixed-size matrix that still behavesβ¦

mechanisms that eliminate growth change the cost model for long- .
Checking sign-inβ¦
Loading commentsβ¦