New Tutorial: The lifecycle of data in IPFS

[terichadbourne]

This issue is a result of evaluation of IPFS Camp 2019 content for inclusion in ProtoSchool. See #261.

We'd like to build a new course on the lifecycle of data in IPFS based on

Core Course D: The lifecycle of data in the DWeb

• Course Repo
• Slides (Google Slides, PDF)
• Video

This one addresses a lot of very common questions about what happens after you add file to IPFS. More than some other resources it also focuses on blocks specifically as opposed to files (which our MFS and Files tutorials focus on).

The lecture format used at IPFS Camp would lend itself well to a text or multiple choice format but likely not coding challenges.

There are also lots of helpful graphics in the deck that would be great to incorporate.

Content to include:

• providing (I have these blocks)
  • distributed discovery, locating content-addresses data with Kademlia / DHT (distributed hash table)
• getting (I want those blocks)
  • Bitswap for trading blocks, as illustrated in the preso by the dance/skit
  • Wantlists, messages, sessions, verified data
• pinning (keep these blocks)
  • garbage collection
  • recursive pinning (block party tool was helpful for demonstrating this but might not have quite the self-evident UX yet to stand without a presenter)
  • reciprocal co-hosting
• deleting (do not want)
  • local-ness of deletion

There's enough content here that it may be worth separating out into multiple tutorials. We can get into more detail when setting up an outline, but @olizilla please let us know if you've already had thoughts on a clean breakdown here, or if you think we're wrong that multiple-choice is the most appropriate format for this content.

[terichadbourne]

@zebateira I chatted a bit with @olizilla today about this tutorial and he mentioned a couple of things that might be useful when we circle back to start building it:

• bitswap and the DHT are actually separate systems/processes but from the standpoint of an end user of IPFS you can't really distinguish between them
• there's a method ipfs.dht.findprovs(CID) that lets you see the peer IDs of those who have the file you're looking for