It also presented mutated binary search which takes advantage of the prefix length distribution for each specific prefix.
the algorithm makes branching decisions based on the characteristics of the sufixes of the visited prefix entry, reducing the average number of memory references significantly.