This repository was archived by the owner on Dec 6, 2022. It is now read-only.
This repository was archived by the owner on Dec 6, 2022. It is now read-only.
Graph Agnostic #18
Closed
Description
So, it would be kind of nice if we could treat links as truly transparent. Basically, in London, we discussed the fact that paths don't care about link boundaries so, really, our datastructures shouldn't either.
Now, the primary downsides are:
- We need to replace CIDs with paths. That is, we need to support path-links in addition to CID links.
- Not all files would have CIDs.
However, giving every file and it's own CID is already a bit of a performance nightmare and we cant feasibly announce every CID to the network so we already need to start talking about files with paths instead of just CIDs.