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.

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

Making persistent and incremental merkle trees #9

Open
QEDK opened this issue Nov 26, 2024 · 2 comments
Open

Making persistent and incremental merkle trees #9

QEDK opened this issue Nov 26, 2024 · 2 comments

Comments

@QEDK
Copy link

QEDK commented Nov 26, 2024

It is not possible to create a 32-depth incremental tree sadly, due to RAM constraints. It would be great if there was persistence through RocksDB, it would also be a great alternative to https://docs.rs/monotree/latest/monotree imo.

@rkdud007
Copy link
Owner

rkdud007 commented Nov 26, 2024

thank you for opening issue - i agree to have an option of persistent storage is needed. I'll try to refactor storage in near future.

just to confirm, you need it for the case of this below right? :

 let tree = IncrementalMerkleTree::<32>::new();

@QEDK
Copy link
Author

QEDK commented Nov 26, 2024

thank you for opening issue - i agree to have an option of persistent storage is needed. I'll try to refactor storage in near future.

for your context, you need it for the case of this below right? :

 let tree = IncrementalMerkleTree::<32>::new();

That is correct, it seems that the proof generation is too slow - takes around 12s for depth 20 and depth 32 is unattainable on a M2 Pro machine.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants