正在加载视频...

视频加载失败

We’re open-sourcing lithos-metal 🚀 Megakernels + DSpark speculative decoding run Qwen3.8-27B at 200+ tokens/s/user peak on one Apple M5 Max. Ultra-fast inference on your laptop. Try it with any coding agent in one command. Code: Tech blog:

423,198 次观看 • 25 天前 •via X (Twitter)

17 条评论

David Dalcu 的头像
David Dalcu24 天前

@Apple

rocky 的头像
rocky25 天前

@sh_reya @Apple nice peak numbers, but apple silicon still runs into the memory bandwidth wall pretty quick once the kv cache grows. curious how much of that 200 tok/s holds up in a real multi-turn agent loop with tool calls instead of pure generation

Zhihao Jia 的头像
Zhihao Jia24 天前

@sh_reya @Apple Great question! We observe 120-130 TPS when context length grows to 32K-64K. The fundamental challenge is the dense attention layers in Qwen3.8-27B.

AI Quanting 的头像
AI Quanting25 天前

@Apple Your projected 127 a second at 32K is the number I'd lead with. That's usually where laptop setups fall apart.

Kim Noël ⚡ 📖 的头像
Kim Noël ⚡ 📖24 天前

@Apple @ivanfioravanti what is this sorcellerie, how is it possible

Dimitrios Skarlatos 的头像
Dimitrios Skarlatos24 天前

@Apple 🍎🚀

Fernando villamizar 的头像
Fernando villamizar24 天前

@Apple 200+ tokens/s on a laptop is wild. as an engineer, what catches my eye is DSpark speculative decoding — that's where the real magic is, turning idle GPU cycles into throughput. local 27B models at this speed change what you can prototype offline.

Luis Casillas 的头像
Luis Casillas24 天前

@Apple Open-sourcing this for local inference on Apple silicon is a solid move. Curious to try it with a coding agent.

Kovex 的头像
Kovex24 天前

@Apple Whats the TTFT for 256 context vs 32k context? Don't see it mentioned anywhere

Ivan Fioravanti 的头像
Ivan Fioravanti24 天前

@Apple Incredible results! Gonna test it immediately!

Abhishek Gahlot 的头像
Abhishek Gahlot24 天前

@Apple reading more about your repo now and how good is drafter. i am trying similar here: though here reaches upto 180tps for shorter prompt. megakernel approach didn't try because smaller fused kernels gave good speed for me.

Catalin Baciu 🍃 #SaveSoil 🍃 的头像
Catalin Baciu 🍃 #SaveSoil 🍃24 天前

@Apple When M1 support, sirs?!?

Rafa Schwinger 🇻🇦 的头像
Rafa Schwinger 🇻🇦24 天前

@old_sound @Apple Really incredible, thank you for your service!

Vera Ai | Tools & Updates 的头像
Vera Ai | Tools & Updates24 天前

@Apple 200+ tokens per second on a laptop is seriously impressive inference performance

Arda Spectaguler 的头像
Arda Spectaguler24 天前

@Apple Curious looks promising

Kim Noël ⚡ 📖 的头像
Kim Noël ⚡ 📖24 天前

@Apple So you are offering the community in Apache 2 the engine that can infer Kimi K3 up to 1000tok/s. Thank you 😭

James 的头像
James24 天前

@Apple @grok is this faster than Tensorfold?

相关视频

Massive breakthrough in speculative decoding! It made a 9B LLM on my MacBook 4x faster, and 2.6x faster than regular speculative decoding. I ran Qwen3.5 9B on my M5 MacBook Pro with the same prompt, three ways: - No speculative decoding: done in 42s - Regular speculative decoding: done in 30s - DFlash + Weaver: done in 11s The video below shows all three side by side. Here's why it works: Speculative decoding lets a cheap drafter guess the next few tokens, and the main model checks them all in one pass. The fastest drafters, like DFlash, guess every position in parallel. But each guess is made on its own, so position 5 never sees what was picked at position 4. One early mismatch and everything after it gets thrown away. Weaver fixes this. It's a tiny adapter (one Transformer layer) on top of DFlash that: ↳ picks among DFlash's top candidates left to right, so each pick depends on the last ↳ grows a tree of likely continuations instead of a single chain ↳ lets the main model verify the whole tree in one pass On my Mac, every pass of the model produced 7.5 tokens instead of 1. On a B200 GPU, the paper reports 4x faster decoding across chat, math and code. Mirai Labs open-sourced the whole stack in their engine, uzu, built for Apple Silicon. GitHub repo: (don't forget to star it 🌟) Trying it takes two commands: 𝗯𝗿𝗲𝘄 𝗶𝗻𝘀𝘁𝗮𝗹𝗹 𝗺𝗶𝗿𝗮𝗶 𝗺𝗶𝗿𝗮𝗶 --𝗺𝗼𝗱𝗲𝗹 𝘁𝗿𝘆𝗺𝗶𝗿𝗮𝗶/𝗤𝘄𝗲𝗻𝟯.𝟱-𝟵𝗕-𝗠 -𝗺 "𝗪𝗿𝗶𝘁𝗲 𝗮 𝗽𝘆𝘁𝗵𝗼𝗻 𝗳𝘂𝗻𝗰𝘁𝗶𝗼𝗻 𝘁𝗼 𝗺𝗲𝗿𝗴𝗲 𝘁𝘄𝗼 𝘀𝗼𝗿𝘁𝗲𝗱 𝗹𝗶𝘀𝘁𝘀" --- I wrote a full breakdown of why local inference is memory-bound and how uzu gets past it, with reproducible code. The article is quoted below. In the replies, there's an illustration of standard vs. speculative vs. uzu decoding.

Akshay 🚀

26,337 次观看 • 3 天前