If I'm accustomed to using a Linked Data Platform (LDP) approach to model my data, I mint lots of stable identifiers to represent objects in the system. For example, in order to describe a PhD Thesis, I need an identifier for the creative work that is the thesis itself and I also need identifiers for each of the individual files within the thesis. These identifiers need to stay stable over time even if I add, update or remove individual files or metadata -- they are separate from the links that point to the specific content of the files in my thesis. In an LDP context, I can use any algorithm to mint these identifiers as long as (due to the constraints of Linked Data) they are HTTP URIs.

How can I translate these notions to IPLD? Do I still mint those HTTP URI identifiers and then use the cryptographic hashes of those URIs to incorporate them into the IPLD graph? Do I put those hashes into IPNS? How does this work?

Given that, please explain the benefit of using the hash of an (URI) identifier to build links (IPLD) rather than simply using the identifier itself (RDF).

cc @nicola