You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: content/en/curriculum/ipfs/introduction/index.md
+17-8
Original file line number
Diff line number
Diff line change
@@ -5,7 +5,7 @@ draft: false
5
5
menu:
6
6
curriculum:
7
7
parent: "curriculum-ipfs"
8
-
weight: 70
8
+
weight: 20
9
9
category: lecture
10
10
level:
11
11
- shallow
@@ -24,14 +24,14 @@ objectives:
24
24
25
25
IPFS is one of many [general purpose peer to peer (P2P) networks](https://en.wikipedia.org/wiki/Peer-to-peer#Other_P2P_applications). Peer to peer networks are just everyday computer users that share data directly with each other. In these systems, you don't have to go through an intermediary like Google to share a file with someone. As an example, if we were looking for the [IPFS white paper](https://github.com/ipfs/papers/blob/master/ipfs-cap2pfs/ipfs-p2p-file-system.pdf), we would ask a peer and they will either respond with the paper or pass along the request to another peer. Eventually, someone will return with the paper if they have it saved.
26
26
27
-

28
-
Peer to peer systems are most synonymous with distributed networks. This is because we have direct connections with our peers as opposed to in centralised and decentralised networks, we often still have to go through a mediary to find content.
27
+

28
+
Peer to peer systems are most synonymous with distributed networks. This is because we have direct connections with our peers as opposed to in centralized and decentralized networks, we often still have to go through a mediary to find content.
29
29
30
-
These [different types of networks](https://www.gemini.com/cryptopedia/blockchain-network-decentralized-distributed-centralized) offer various tradeoffs. The world wide web is in essense a centralised network. We are familiar with the speed of receiving content, availability of data when we want it, the ease of discovering new things, and straight forward way of securing our accounts.
30
+
These [different types of networks](https://www.gemini.com/cryptopedia/blockchain-network-decentralized-distributed-centralized) offer various tradeoffs. The world wide web is in essence a centralized network. We are familiar with the speed of receiving content, availability of data when we want it, the ease of discovering new things, and straight forward way of securing our accounts.
31
31
32
-
On the other hand, peer to peer networks excel in everything that centralised networks don't. This includes owning our own data and censorship resistance against governments, corporations, or hackers. They allow us to trust that the data we recieve is the data we ask for, if it is available. And generally the more users sharing data with each other, the better the network will be.
32
+
On the other hand, peer to peer networks excel in everything that centralized networks don't. This includes owning our own data and censorship resistance against governments, corporations, or hackers. They allow us to trust that the data we receive is the data we ask for, if it is available. And generally the more users sharing data with each other, the better the network will be.
33
33
34
-
[Decentralised networks](https://petkanics.medium.com/the-benefits-of-decentralization-88a0b5d0fd39) maintain privacy and censorship resistance while being able to discover new content and maintain availability of data. Unfortunately, this comes at the cost of speed. Decentralised networks have to agree on all actions made by users because they save the actions on every computer in the network. Then in the future, all computers can reference any action taken by any single user. For this reason, decentralised networks are generally paid for by the user and use up large amounts of electricty.
34
+
[decentralized networks](https://petkanics.medium.com/the-benefits-of-decentralization-88a0b5d0fd39) maintain privacy and censorship resistance while being able to discover new content and maintain availability of data. Unfortunately, this comes at the cost of speed. decentralized networks have to agree on all actions made by users because they save the actions on every computer in the network. Then in the future, all computers can reference any action taken by any single user. For this reason, decentralized networks are generally paid for by the user and use up large amounts of electricity.
35
35
36
36
## Why IPFS?
37
37
@@ -45,8 +45,17 @@ Though it gets difficult to predict what is going to happen in the next, say, 10
45
45
46
46
Computation has gone through so many phases; from the first computers, to machines that can timeshare, to multiprocessing and sandboxed VMs, to user terminals, to networked computers with multiprocessing, now with personal computers networked across a worldwide internet that all came from a relatively simple set of functions and data transmission. Now, IPFS is on the front lines of the Web3 evolution that will bring us to the next stage in computing.
47
47
48
+
## IPFS Introduction
49
+
50
+
This recording and deck is intended to provide a high-level overview of the fundamental concepts of IPFS.
#### The State of the IPFS Ecosystem | Molly Mackinlay
49
-
In this video from IPFS Camp 2022, Molly Mackinaly highlights the major events and growth in the ecosystem since 2019 and looks toward the future of IPFS.
58
+
In this video from IPFS Camp 2022, Molly Mackinlay highlights the major events and growth in the ecosystem since 2019 and looks toward the future of IPFS.
50
59
51
60
{{< youtube fGwhPLik3_4 >}}
52
61
@@ -73,5 +82,5 @@ At a high level, the talk covered the following concepts:
73
82
*[Kademlia](https://docs.ipfs.io/concepts/dht/#kademlia) – Kademlia is a distance metric + query algorithm that helps users find the peers with the most accessible pieces of data.
74
83
75
84
#### Fetch
76
-
*[Bitswap](https://docs.ipfs.io/concepts/bitswap/#how-bitswap-works) – Using wantlists of data, or CIDs, that specific users are looking for, and checks peers that a node is connected to first for those CIDs before querying the rest of the DHT.
85
+
*[Bitswap](https://docs.ipfs.io/concepts/bitswap/#how-bitswap-works) – Using want-lists of data, or CIDs, that specific users are looking for, and checks peers that a node is connected to first for those CIDs before querying the rest of the DHT.
0 commit comments