A y-Fast trie splits nodes into blocks. Each block is a balanced search tree and has 2/w to 2w nodes. The block maximums constitutes an ♯ x-Fast Trie.