I blogged about this: <a href="https://blog.reverberate.org/2025/02/10/tail-call-updates.html" rel="nofollow">https://blog.reverberate.org/2025/02/10/tail-call-updates.ht...</a><p>It uses a technique I published several years ago for writing fast interpreters with tail calls: <a href="https://blog.reverberate.org/2021/04/21/musttail-efficient-interpreters.html" rel="nofollow">https://blog.reverberate.org/2021/04/21/musttail-efficient-i...</a><p>There is also this tweet from the author: <a href="https://x.com/kenjin4096/status/1887935698906529903" rel="nofollow">https://x.com/kenjin4096/status/1887935698906529903</a>
> Preliminary numbers on our machines suggest anywhere from -3% to 30% faster Python code, and a geometric mean of 9-15% faster on pyperformance depending on platform and architecture.<p>Nice!
They didn’t add tail calls for the longest time because it blows the stack and makes it harder to debug when stepping through code. Maybe they should make a keyword in Python to explicitly enable tail call recursion when it’s needed.