Hi, following the discussion so far, I've added: - Three new members for zero-bit search: find_first_off(), find_first_off( size_type ) and find_next_off( size_type ). I'm considering merging the first two (and, consistently, the two overloads of find_first(), which search for 1 bits). - Custom container support: You can now specify the underlying container via an `AllocatorOrContainer` template argument. The unit tests exercise this with boost::container::small_vector. - C++20 iterators. The implementation for all of this is here: <https://github.com/boostorg/dynamic_bitset/tree/pr/dynamic_biset_is_back_in_business_mailing_list_discussion_sept_3_2025>. Comments welcome. Unfortunately, the CI shows many failures in seemingly unrelated code. I'll have to look into it. -- Gennaro Prota <https://prota.dev>