Skip to content

Commit

Permalink
Merge pull request #527 from ethersphere/NoahMaizels-patch-1
Browse files Browse the repository at this point in the history
Update what-is-swarm.md
  • Loading branch information
NoahMaizels authored Nov 16, 2023
2 parents 978cb59 + 4e1e054 commit 9954a3d
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion docs/learn/technology/what-is-swarm.md
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,7 @@ The second part of Swarm is an overlay network with protocols powering the [Dist

Swarm's overlay network is built on top of the underlay transport layer and uses [Kademlia](/docs/learn/glossary#kademlia) overlay routing to enable efficient and scalable communication between nodes. Kademlia is a distributed hash table (DHT) algorithm that allows nodes to locate each other in the network based on their unique identifier or hash.

Swarm's DISC is an implementation a Kademlia DHT optimized for storage. While the use of DHTs in distributed data storage protocols is common, for many implementations DHTs are used only for indexing of specific file locations. Swarm's DISC distinguishes itself from other implementations by instead breaking files into chunks and storing the chunks themselves directly within a Kademlia DHT.
Swarm's DISC is an implementation of a Kademlia DHT optimized for storage. While the use of DHTs in distributed data storage protocols is common, for many implementations DHTs are used only for indexing of specific file locations. Swarm's DISC distinguishes itself from other implementations by instead breaking files into chunks and storing the chunks themselves directly within a Kademlia DHT.

Each chunk has a fixed size of 4kb and is distributed across the network using the DISC model. Each chunk has a unique address taken from the same namespace as the network node addresses that allows it to be located and retrieved by other nodes in the network.

Expand Down

0 comments on commit 9954a3d

Please sign in to comment.