Speculative decoding accelerates LLM generation through lightweight drafting and parallel verification.
It is particularly promising for long inputs, where KV-cache access costs can be amortized over multiple accepted tokens.
Yet most drafters are trained on short sequences and degrade on long inputs, while long-context training is costly.
Existing training-free approaches restrict the context window, rescale positions, or augment recent context with retrieved distant entries.
Drafters, however, read target hidden states that already encode contextual and positional information, and their lightweight architecture makes full-history attention affordable.
We propose FOLD, a training-free method that preserves exact local positions and treats all distant entries as far memory at a shared position.
To counter attention dilution as the memory grows, we sharpen attention within it to emphasize relevant entries while separately controlling its total weight relative to the local window.
Results
Across six target-drafter pairs and diverse benchmarks of up to 256K tokens, FOLD predominantly delivers the highest speedup.
In the best case, it more than doubles the speedup over autoregressive decoding, from 2.08$\times$ to 4.22$\times$.