-
Notifications
You must be signed in to change notification settings - Fork 0
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
Spike: Direct File CID #83
Comments
Partial verification is possible with HTTP range requests. The paths to get there is
Essentially, we must verify all blocks on the path from root to the leaves; the leaves are hash chunks of the actual data, whereas all nodes in the middle contains some kind of metadata. The significance is that multiple exchanges between Prover (server) and Verifier (client) is required to verify a block to achieve be trustless concurrent/incrementally verifiable transfers. Number of exchanges between the prover and the verifier are Question arises:
QmHash is CID v0, now IPFS is migrating to V1. These two formats seems bijective. |
Other crates |
Problem statement
Consider removing File Manifest CID with direct File CID, using IPFS merkledag for proofs.
Expectation proposal
Clearly list out the benefit/costs of switching verification schemes
The text was updated successfully, but these errors were encountered: