New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Prove set membership #5

Open

uncomputable opened this issue Jul 16, 2023 · 0 comments

Owner

uncomputable commented Jul 16, 2023 •

edited

Loading

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.

uncomputable changed the title ~~Set membership example~~ Prove set membership

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment