In this blog post, Andrew Poelstra comments that bulletproofs can be used for efficient merkle inclusion proofs.
How would these proofs compare in size and verifying time to simple merkle paths? Take for instance proving a thousand elements in a set of millions. Can we use batch verification and/or aggregation of bulletproofs?
Although the bulletproof would prove inclusion in zero knowledge, could we reveal the leaves so that they match the proof?