Does this translate into a similar reduction in compute? What's the catch?
It is all about moving the bottleneck. During prompt processing everything can be calculated in parallel, while during token generation you create a single token at a time. For example, using an RTX 4000 Ada, I'm getting 2700 t/s for prompt processing, and 48 t/s for token generation using an 8B class model. Their approach is essentially a speculative decoding approach where multiple tokens are predicted at once and…
Reminds me a little of a carry lookahead adder.