In WT-595, we optimize lexical key comparisons to skip prefix bytes when we know they will be the same for a range of keys.

It should be possible to do the same thing for skip lists: once we go down a level, we have a key greater than the search key, so we can calculate the common prefix and skip those bytes on all subsequent keys. Rinse and repeat each time we go down: the prefix can only get longer.