You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Dec 3, 2018. It is now read-only.
It can be used in Metadata Request (to provide a proof for a slice of sector ids) and in Data Request (to provide a proof that a slice of bytes inside a sector belongs to the sector).
The algorithm to make proofs can be adjusted to work with slices instead of single index: just replace "subtree containing the proofIndex" with "subtree overlapping with the proofSlice" in the original algorithm. The new algorithm produces exactly the same proofs for a slice of size 1 as the old one provides for the corresponding proofIndex. That means that the new algorithm is backward compatible.
Here is a demonstration script in Python, which prints proof as a list of slices of leaves.
It can be used in Metadata Request (to provide a proof for a slice of sector ids) and in Data Request (to provide a proof that a slice of bytes inside a sector belongs to the sector).
The algorithm to make proofs can be adjusted to work with slices instead of single index: just replace "subtree containing the proofIndex" with "subtree overlapping with the proofSlice" in the original algorithm. The new algorithm produces exactly the same proofs for a slice of size 1 as the old one provides for the corresponding proofIndex. That means that the new algorithm is backward compatible.
Here is a demonstration script in Python, which prints proof as a list of slices of leaves.
The text was updated successfully, but these errors were encountered: