https://hackerpaper.kaipfister.de/p/1612.05665/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=41316054urn:hackerpapers:mention:1612.05665:41316054Thu, 22 Aug 2024 02:04:20 GMT<p>Your analysis sounds reasonable to the non-expert, but recent work on purely-functional trees suggests that the gap is smaller than you suggest (&quot;orders of magnitude slower&quot;). E.g., see the nice work on the PAM library (https://arxiv.org/abs/1612.05665). Ideas from this work were used to build lots of cool things (immutable graph data structures, segment trees, databases) that are very fast, and all immutable.</p><p><a href="https://hackerpaper.kaipfister.de/p/1612.05665/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS