Tip of my Tongue: several weeks ago I read an article on compressing tries by lexically sorting insertions and "freezing" (sharing) suffixes. It included a #RustLang implementation and referred to these tries with a 3-letter acronym that I haven't seen (or recalled) anywhere else. I've scoured the aggregators, shifted through search results for related keywords, and while I've found some great resources[1], I'm particularly interested in referencing that implementation (and curious what the acronym was, some kinda state-machine jargon). Am giving a shout before bed in case anyone has any idea what I'm on about.

1: https://medium.com/basecs/compressing-radix-trees-without-too-many-tears-a2e658adb9a0