Researchers from Polymathic AI, Princeton University, USC ISI, NYU, and the Flatiron Institute have introduced FlashMap, a novel speculative decoding drafter designed to accelerate Large Language Model (LLM) decoding.
Key points
- FlashMap drafts a full 16-token block in one forward pass.
- It achieves up to 6.14x lossless speedup on GSM8K.
- FlashMap uses a continuous flow map for LLM decoding.
- The method ensures token consistency within drafted blocks.
FlashMap replaces traditional discrete diffusion draft methods with a continuous flow map approach. This allows it to draft a full 16-token block in a single forward pass, ensuring token consistency within the block.
The research team reported significant speedups, achieving up to 6.14x lossless speedup on the GSM8K benchmark using the Qwen3-8B model. This performance makes FlashMap the fastest drafter tested on Qwen3-8B, outperforming a retrained DFlash by approximately 7% on average.
By the numbers
- Lossless speedup on GSM8K
- 6.14x
- Tokens drafted per block
- 16
- Drafter parameter size
- 0.5B
FlashMap operates by mapping Gaussian noise to a token block in one step, with a small drafter proposing K tokens. The target model then checks these K tokens in parallel, retaining the longest matching prefix. This process ensures the output remains identical to what the target model would produce.
The efficiency of FlashMap depends on the acceptance rate of drafted tokens and the cost of drafting. Unlike autoregressive methods like EAGLE-3, where cost increases with block length, FlashMap drafts the entire block in one pass using block diffusion.
The researchers noted that diffusion draft methods can lose acceptance due to predicting each slot independently, a phenomenon they term 'factorized approximation.' FlashMap addresses this by using noise samples that jointly determine the mode for every slot within a block.
Sources and references
Original report
Polymathic AI and Princeton Researchers Release FlashMap, a Flow Map Drafter for 6.14x Faster LLM Decoding
MarkTechPost
Read on MarkTechPost (opens in a new tab)Linked in the original report
- Paperarxiv.org/abs/2610.24365 (opens in a new tab)
- Modelhuggingface.co/collections/j-shen/flashmap-6ad0feb955b… (opens in a new tab)
- Codegithub.com/al-jshen/flashmap (opens in a new tab)
- Paperarxiv.org/abs/2503.01840 (opens in a new tab)
- Paperarxiv.org/abs/2602.06036 (opens in a new tab)
- Paperarxiv.org/abs/2602.16813 (opens in a new tab)
Ref 00QJLG9K
Cite this
APA
Interestana AI Editorial. (2026, October 28). Researchers Release FlashMap for 6.14x Faster LLM Decoding. Interestana. https://interestana.com/articles/polymathic-ai-and-princeton-researchers-release-flashmap-a-flow-map-drafter-for-614x-faster-llm-decoding-00qjlg9k
MLA
“Researchers Release FlashMap for 6.14x Faster LLM Decoding.” Interestana, 28 Oct. 2026, interestana.com/articles/polymathic-ai-and-princeton-researchers-release-flashmap-a-flow-map-drafter-for-614x-faster-llm-decoding-00qjlg9k.
Chicago
Interestana AI Editorial. “Researchers Release FlashMap for 6.14x Faster LLM Decoding.” Interestana, October 28, 2026. https://interestana.com/articles/polymathic-ai-and-princeton-researchers-release-flashmap-a-flow-map-drafter-for-614x-faster-llm-decoding-00qjlg9k.
BibTeX
@misc{interestana_00qjlg9k,
author = {{Interestana AI Editorial}},
title = {{Researchers Release FlashMap for 6.14x Faster LLM Decoding}},
howpublished = {Interestana},
year = {2026},
month = oct,
url = {https://interestana.com/articles/polymathic-ai-and-princeton-researchers-release-flashmap-a-flow-map-drafter-for-614x-faster-llm-decoding-00qjlg9k},
note = {Summary of reporting by MarkTechPost, https://www.marktechpost.com/2026/10/28/flashmap-flow-map-speculative-decoding/}
}Credit the source
Original reporting: MarkTechPost, “Polymathic AI and Princeton Researchers Release FlashMap, a Flow Map Drafter for 6.14x Faster LLM Decoding”, https://www.marktechpost.com/2026/10/28/flashmap-flow-map-speculative-decoding/(opens in a new tab)
Follow this story
Get Artificial Intelligence in your inbox — new stories in 40 words or fewer, once a week.
Subscribe