Limit on the size (in bits) of sparseint leaves.
This constant sets a tradeoff between representation efficiency of a single element versus opportunities for structure sharing between multiple elements. If the bitlimit is small, then we can potentially share structure more granularly among objects. However, if it is so small that the bignums on the leaves are dwarfed in size by the conses used to create the tree nodes, then this is unlikely to be efficient.
Absent empirical evidence, we currently set the limit to 256, which we think is likely to be the size of a tree node in most 64-bit Lisps (i.e., two conses, 128 bits each).
We wrap the constant