Deoptimization Is Harder Than Optimization: How JIT Escape Hatches Keep Dynamic Languages Fast
lauriewired · x · 2026-09-23
Security researcher LaurieWired explains deoptimization: JITs like V8, HotSpot, and WebKit make "dirty" speculative optimizations based on what's been true so far, betting the next call is "Dog" like the last 3 million. The safety net: when an assumption breaks, the deoptimizer must reconstruct correct program state at any escape hatch — rebuilding destroyed stack frames and never-allocated objects from limited metadata — before jumping to the slow path. Her metaphor: we drive fast because we have brakes. A great primer on why dynamic languages can fly close to the sun.
More from Research
- Oxford's Yarin Gal pushes back: LLMs are 'really not good' at doing science — yaringal · 2026-09-23
- NexteraBERT out: 5.22x faster than ModernBERT at 65K tokens, trained on 15x fewer tokens — udmrzn · 2026-09-23
- Blue noise sampling yields stable, coherent generations without lowering temperature — amplifiedamp · 2026-09-23
- rei_labs unveils Adapt-1 Machina: RL learns continuous control sequences without demos or critic — burny_tech · 2026-09-23
- Paper: RRSI — adding regularization to recursive self-improvement of agents — HuaxiuYaoML · 2026-09-23
- Self-trained optical flow diffusion model warps LDM frames for coherent video — pixlpa · 2026-09-23