cwinfo/yggdrasil-network.github.io
5
0
Fork 0
mirror of https://github.com/cwinfo/yggdrasil-network.github.io.git synced 2024-11-09 16:50:31 +00:00
Code Releases Activity

Spelling tweaks

Browse Source
This commit is contained in:
Neil Alexander 2019-01-09 08:32:44 +00:00 committed by GitHub
parent 142b3554e7
commit ef9df6a5c5
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
_posts/2019-01-08-history.md
View File

@ -29,7 +29,7 @@ That simultaneously addresses the protocol overhead issue, address assignment, a
What could go wrong?
Well, the best short example I can give, is to imagine that Alice wants to deliver a package to Carol, and they live in a world without maps or addresses, and where you can't rely on directions like "go North by any route until you reach X", so everyone needs to memorize any roads or routes that they care about.
Alice doens't know where Carol lives, but she knows where Bob lives, and she has reason to believe that Bob knows where Carol lives.
Alice doesn't know where Carol lives, but she knows where Bob lives, and she has reason to believe that Bob knows where Carol lives.
So, Alice visits Bob and asks for directions to Carol.
Bob tells Alice how to get from Bob's house to Carol's house, and Alice memorizes this.
Now, any time Alice wants to deliver a package to Carol, she travels form her house to Bob's house, and then from Bob's house to Carol's house.
@ -55,7 +55,7 @@ Using a DHT, we can look up *who* we want to talk to (specified by an IPv6 "addr
Then, when a node needs to forward a packet, it checks the tree location of each of its peers and forwards to whichever one is closest to the destination (+- a few caveats about congestion control).
This is explained in more detail in earlier blog posts, if you're not familiar with how Yggdrasil routes and care to read more.
In our package delivery example, imagine if the streets in Alice's town were layed out in a grid, and then named and numbered systematically by blocks, with street signs to label where any off-grid bypasses go.
In our package delivery example, imagine if the streets in Alice's town were laid out in a grid, and then named and numbered systematically by blocks, with street signs to label where any off-grid bypasses go.
Alice and friends still haven't bought maps, but they they know each other's *addresses* instead.
So, if Alice wants to contact Carol, she first travels to Bob's house and asks him for Carol's address.
Now, when she wants to deliver a package to Carol, she can simply follow the block structure of the town until she arrives on Carol's block, and she has the option to take any bypass she happens to come across if it brings her closer to Carol's place.
@ -71,8 +71,8 @@ Having (mostly) finished simulation tests by about spring of 2016, I sat on the
I eventually sat down one weekend and worked through [gobyexample](https://gobyexample.com/).
The language seemed fast enough for a reasonable prototype, easy enough to learn/read that other people could pick it up quickly if they want to contribute, and generally made multithreading/multiprocessing bearable for me.
Since I wanted to continue playing with the language, and I'd been meaning to implement my routing scheme for a while, I ultimately resolved to rewrite my sim in Go, refactor the important parts into the library, and then add the missing pieces to make it more-or-less a cjdns clone with different routing.
Most of the work happened over a couple of long weekends, and I released the first working prototype on github just before the end of 2017.
Most of the work happened over a couple of long weekends, and I released the first working prototype on GitHub just before the end of 2017.
Changes since then are mostly documented in the `git log`, github issues and pull requests, and discussions in our public matrix channel.
Changes since then are mostly documented in the `git log`, GitHub issues and pull requests, and discussions in our public matrix channel.
Neil joined and started adding support for other platforms, and we started to roll out public nodes and attract more users.
As of writing, a year or so after the first public release, there are around 130-140 nodes in the network, depending on the time of day, with maybe half of them having joined in the last few months.