[base node] Fix pub fn batch_verify_range_proofs(..) to not use powers of two, but batch all proofs

[hansieodendaal]

No description provided.

[AaronFeickert]

Just for clarity, range proofs require a power of two for the aggregation factor; that is, the number of (possibly padded) commitments whose range is asserted in a single proof must be a power of two. The number of proofs that may be verified in a batch is arbitrary, and limited in practice only by any performance concerns relating to multiscalar multiplication and the like.

For batches so large that performance becomes a concern, we can simply split into smaller batches and evaluate them separately.

[AaronFeickert]

Here's the relevant code.