Ghostty Leads the Day; Python's JIT Exits; Mathematics Gets a Machine Witness

Ghostty 1.4 topped Wednesday's Hacker News scoring at 1,072 points, a figure that reflects the substantial community investment the terminal emulator has built in under two years. Built by Mitchell Hashimoto, who co-founded HashiCorp, Ghostty differentiated itself by using native, platform-specific graphics APIs for rendering rather than a cross-platform abstraction layer — a design choice that produces noticeably sharper text rendering, smoother performance at high refresh rates, and better integration with platform accessibility features. The 1.4 release combined rendering improvements, new configuration options, performance work, and protocol support, generating 341 comments from users who have clearly been running it in production.

The Python JIT story drew more engagement — 520 points and 282 comments — reflecting genuine contentiousness. Python's experimental JIT compiler, added to CPython 3.13 under PEP 744 using a copy-and-patch approach targeting CPython's internal bytecode, is being removed. The CPython team's argument is that the implementation adds complexity to a widely depended-upon codebase without delivering performance improvements that justify the maintenance burden. The counter-argument prominent in the comment thread is that JIT compilation is the obvious path for Python to close the performance gap with Go and Rust in compute-intensive workloads — PyPy has demonstrated that a JIT-compiled Python can be dramatically faster for certain tasks — and that removing the experimental JIT without a clear successor strategy leaves the question open-ended. Several commenters noted that the decision removes this specific implementation rather than foreclosing future JIT work, but frustration that the experimental period produced no clearer path forward was evident throughout the thread.

The day's most underappreciated story, by the measure of points relative to significance, may be the formalization of the Classification of Finite Simple Groups in the Lean proof assistant — 216 points and 62 comments. The Classification, sometimes called the enormous theorem, is the complete enumeration of all finite simple groups; the original proof spans tens of thousands of pages across hundreds of papers by dozens of mathematicians accumulated over roughly fifty years. Formalizing it in Lean means translating that argument into a form that the proof assistant can mechanically verify as logically valid, providing the first fully machine-checked assurance that the classification is complete and correct. Potential gaps in the original proof have been identified and patched over the decades; a formal Lean verification would retire the question definitively.