We present the Skip lift  a randomized dictionary data structure inspired by the skip list [Pugh90  Comm of the ACM] Similar to the skip list  the skip lift has the finger search property: given a pointer to an arbitrary element f  searching for an element x takes expected O(logδ) time where δ is the rank distance between the elements x and f