Question

This question is related to this one, as I am looking for a way for adding bitset(-like) structures.
I need something like a bitset which can store at least 2400bits, and can (random) access all of them. The second important ability the class has to have is addition, I need to be able to add at least 1. The representation as a number wouldn’t work (I guess) due to the possible size, which would be around 2,96 x10^722 and the uncomfortable bit access.
Is there any known efficient implementation?

Answer 1

Take a look at XInt. It is developed as a candidate for boost.