Simple succinct dynamic predecessor with $O(\sqrt{n})$ redundancy in contiguous space
Pat Morin demonstrates a structure with $O(\sqrt{n})$ extra words of space and $O(\log^2 n)$ insert, delete, and predecessor search in his notes for his advanced data structures class.