Hello. I remember a long time ago I found some protocol that was boasted as a less out-dated version of bittorrent. I think one of its features was that you could update a whatever-their-equivalent-of-a-torrent-is with small changes and those changes could be seeded.
If this sounds familiar, and you know anything about this, I would really appreciate pointing me in the right direction. Thank you.
I think the problem with IPFS is it’s terribly inefficient with large and or dynamic data storages, the exact problem bittorent tackles(large not dynamic).
IPFS does seem to provide great p2p functionality for small static files though, albeit pretty slow.
also data duplication, if you want to store a file in application readable format and IPFS you need to store TWO files, makes archiving and management expensive
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !programming@programming.dev
Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!
Cross posting is strongly encouraged in the instance. If you feel your post or another person’s post makes sense in another community cross post into it.
Hope you enjoy the instance!
Rules
Rules
Follow the programming.dev instance rules
Keep content related to programming in some way
If you’re posting long videos try to add in some form of tldr for those who don’t want to watch videos
I think the problem with IPFS is it’s terribly inefficient with large and or dynamic data storages, the exact problem bittorent tackles(large not dynamic).
IPFS does seem to provide great p2p functionality for small static files though, albeit pretty slow.
also data duplication, if you want to store a file in application readable format and IPFS you need to store TWO files, makes archiving and management expensive
Yeah, the discovery process is shite on IPFS. You kinda have to cheat it to get it to work with something like .
Idk if it’s inefficient with large data, but it’s inefficient with compressed storage, as it does block-level deduplication, which is very cool.