This project generates strings that sort lexicographically between two given strings, enabling stable insertion ordering without recalculating positions for existing items. It is designed for use in Conflict-Free Replicated Data Types (CRDTs), particularly for managing element positions in distributed sequences where concurrent inserts must be commutative