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
Starting a community discussion - lemme know what you think :)
Draft design:
(Note: there are many, many, many potential solutions to this problem. For now, we're starting with an example high level, simplest route to achieving these goals)
At a regular interval (eg daily) a randomized group of nodes are chosen to be act as a "retrievability" proving committee. The committee will choose a subset of CIDs to confirm retrievablity.
The committee will attempt to connect to each IPFS server, downloaded the file, and verify it matches the CID.
Eg ipfs swarm connect ipfs swarm connect /ip4/<server_ip_address>/tcp/4001/ipfs/<peer_id> , ipfs get <ipfs_file_hash>
Committee updates the AVS contracts with the peerID, CID and success or failure of the download operation.
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
Starting a community discussion - lemme know what you think :)
Draft design:
(Note: there are many, many, many potential solutions to this problem. For now, we're starting with an example high level, simplest route to achieving these goals)
Eg ipfs swarm connect ipfs swarm connect /ip4/<server_ip_address>/tcp/4001/ipfs/<peer_id> , ipfs get <ipfs_file_hash>
Beta Was this translation helpful? Give feedback.
All reactions