Could we improve sorting with "orasort"?

Hey y'all,

This is a little out of the ordinary, but it was pointed out to me that
Oracle's "orasort" has fallen out of patent and is now usable.

The original claim is that this adaptive common prefix sorting is much
faster than typical quick or radix sort.

https://smalldatum.blogspot.com/2026/01/common-prefix-skipping-adaptive-sort.html


While I have been working a while in Lucene, I am still pretty ignorant
about large portions of the code base (if it ain't vectors, I likely
haven't touched it much...). So, wondering if others had ideas if this
could actually be used?

Here is a Golang impl: https://github.com/mattn/go-orasort

Thanks!

Ben