Sketch of a protocol I discussed with nostr:npub1xtscya34g58tk0z605fvr788k263gsu6cy9x0mhnm87echrgufzsevkk5s for proving storage of a file.
before uploading, select 32 random bytes from the file, store their indices and the sha256 hash. do this 1000 more times (select 32 different random byes, calc sha256).
upload the file to the server. every day, ask for the hash of the 32 bytes at the indices stored from the server. if it matches transfer some sats. if not the server no longer has the file. you can check for 1000 days.
So if the checksum does not match we know to stop paying. But at that point we have data loss.
If this file is of any importance it need to be stored in multiple places. If it is not important at all, why pay to store it...
If it is stored in multiple independent places we should be able to check the copies against each other.
No need for this subset selection.
Also, if my math maths, 32 bytes is the exact same size of the sha256 hash. Why do the hash?
No replies yet.
