Suppose I have a set of numbers:
[1, 7, 6, 4, 8, 9, 4, 6, 3, 3, 1, 5, 4]
Suppose also that a verifier knows the merkle root of that set,
R, but he doesn't know the set itself. Is it possible to convince him that the sum of all even numbers - i.e.,
6 + 4 + 8 + 4 + 6 + 4 is
32 with a string of a small, constant size (i.e., not depending on the length of the array)?
I thought that was possible with zk-snarks, but now I'm under the impression even a zk-snark proof would be of linear size w.r.t the number of elements.