Python 3.14 Getting New Interpreter

I blogged about this: <a href="https:&#x2F;&#x2F;blog.reverberate.org&#x2F;2025&#x2F;02&#x2F;10&#x2F;tail-call-updates.html" rel="nofollow">https:&#x2F;&#x2F;blog.reverberate.org&#x2F;2025&#x2F;02&#x2F;10&#x2F;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:&#x2F;&#x2F;blog.reverberate.org&#x2F;2021&#x2F;04&#x2F;21&#x2F;musttail-efficient-interpreters.html" rel="nofollow">https:&#x2F;&#x2F;blog.reverberate.org&#x2F;2021&#x2F;04&#x2F;21&#x2F;musttail-efficient-i...</a><p>There is also this tweet from the author: <a href="https:&#x2F;&#x2F;x.com&#x2F;kenjin4096&#x2F;status&#x2F;1887935698906529903" rel="nofollow">https:&#x2F;&#x2F;x.com&#x2F;kenjin4096&#x2F;status&#x2F;1887935698906529903</a>

&gt; 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!

I get the feeling that Python is finally reaching the critical mass needed to significantly improve performance, good times.

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.

Pi-thon.