Skip to content
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

Reduce shuffle proof serialization overhead #14

Open
dapplion opened this issue Jun 19, 2023 · 0 comments
Open

Reduce shuffle proof serialization overhead #14

dapplion opened this issue Jun 19, 2023 · 0 comments

Comments

@dapplion
Copy link
Contributor

ark-serialize https://crates.io/crates/ark-serialize is good to get some byte format going. However given that this data is spent over the wire we want minimal possible size. Since N in known ahead of time, we can concat all compressed points without any extra overhead.

My tests with https://github.com/asn-d6/curdleproofs/compare/main...dapplion:test-vectors?expand=1 show that the serialized proof size is 480 * log2(N) + 1216. Concatenating all points in the proof assuming 32 bytes per Fr, it should be 480 * log2(N) + 1136.
@dapplion dapplion changed the title Interop friendly shuffle proof serialization format Reduce shuffle proof serialization overhead Jun 19, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@dapplion