“It is the first learned index with provably optimal time and space complexity guarantees.”
The B-tree is blind to patterns in your data. This index learns where keys sit in memory and answers the same queries with the same worst-case guarantees, often in orders of magnitude less space. Most “learned” data structures fall apart on adversarial input. This one comes with proofs.