adam/ipfs-blog
1
0
Fork 0
mirror of https://github.com/ipfs/ipfs-blog.git synced 2026-08-11 03:12:47 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #346 from ipfs/staging

Browse Source 
Edit to "Understanding the Three Fundamental Principles of How IPFS Works"
This commit is contained in:
emilymvaughan
2021-11-05 12:16:28 -04:00
committed by GitHub
parent add4d14a4e 604def7552
commit 4e907668fe
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/_blog/understanding-the-three-fundamental-principles-of-how-ipfs-works.md
+1 -1
View File
@@ -58,7 +58,7 @@ In better understanding how IPFS works, we will take a deep dive into the underl
* Directed Graphs: A graph is said to be directed if each edge has some sense of direction. The connections between nodes only correctly associate in one direction, and a single-head arrow indicates this direction. We use genealogical terms like ancestor, descendent, parent, and child to refer to nodes in a directed graph.
* Acyclic Graphs: An acyclic graph has no loops in the graph. This means there is no way to navigate from that node back to itself along the graph’s edges.
* Directed Acyclic Graphs - DAGs: A graph that is both directed and acyclic is called, you guessed it right? A directed acyclic graph - DAG.
3. Content discovery via directed hash tables (DHTs)
3. Content discovery via distributed hash tables (DHTs)
A distributed hash table - DHT is a distributed system for mapping keys to values. In IPFS, the DHT is used as the fundamental component of the content routing system and acts like a cross between a catalog and a navigation system.