From 3dfd1805357cf4756a28022be8d4c2211078c1c5 Mon Sep 17 00:00:00 2001 From: "emily.vaughan@protocol.ai" Date: Wed, 3 Nov 2021 16:21:24 +0000 Subject: [PATCH] Update from Forestry.io emily.vaughan@protocol.ai updated src/_blog/understanding-the-three-fundamental-principles-of-how-ipfs-works.md --- ...ding-the-three-fundamental-principles-of-how-ipfs-works.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/src/_blog/understanding-the-three-fundamental-principles-of-how-ipfs-works.md b/src/_blog/understanding-the-three-fundamental-principles-of-how-ipfs-works.md index 252e27ea..ba2b1836 100644 --- a/src/_blog/understanding-the-three-fundamental-principles-of-how-ipfs-works.md +++ b/src/_blog/understanding-the-three-fundamental-principles-of-how-ipfs-works.md @@ -31,7 +31,7 @@ The web today as we know it is highly centralized. To a very large extent, centralized web is driven by a data economy - the utilization of the content created by users and using it against these users. -Centralized web thus leads to the absolute control of information, how we see information and exploitation via the taking of advantage of how we now perceive things. +A centralized web thus leads to the absolute control of information, how we see information and exploitation via the taking of advantage of how we now perceive things. ## How does IPFS works? A look at the underlying concepts @@ -58,8 +58,6 @@ In getting to understand how IPFS works, we will take a deep dive into the under * 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) 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.