-
Notifications
You must be signed in to change notification settings - Fork 12
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
few questions #4
Comments
Hi, thanks! No worries, I'm happy to answer questions.
|
@hoytech Thank you very much for your answer. You are right, after thinking about the size of the proof, I thought this can only work with something like Blake3 and Bao, but then I am just offloading the binary tree implementation to someone smarter than myself. Which is definitely a win. But I don't think either supports further hashing by reusing old trees and diffing. Maybe worth asking for that feature. I was considering using Blake3 for hashing nodes and Bao for streaming media files anyways. Although I suspect Blake3 won't be fit to do optimizations like empty nodes in Quadrable, but maybe it already does, I didn't grok it yet. Thanks again. |
Fascinating project, really loved the README.
However I am not very familiar with C++ so I thought asking these questions is faster than digging into the code base, and I hope it is useful for others as a FAQ.
Thank you very much.
The text was updated successfully, but these errors were encountered: