Prove set membership

[uncomputable]

Set membership is an interesting problem that can be solved in ZKP using RSA accumulators.

Merkle trees using ZK-friendly hash functions (Poseidon etc.) or lookup arguments (lasso etc.) are probably too complicated.

Set non-membership will come later.