Status: IN
`ConsistentHashRing._ring_positions` is maintained in sorted order at all times via `bisect`; all key lookups depend on this invariant
Source: entries/2026/05/29/consistent-hashing-consistent_hashing.md
self._ring_positions: List[int] = [] # sorted hash positions
idx = bisect.bisect_left(self._ring_positions, pos)
self._ring_positions.insert(idx, pos)