{"id":111241,"date":"2023-11-01T15:10:18","date_gmt":"2023-11-01T13:10:18","guid":{"rendered":"https:\/\/prohoster.info\/blog\/novosti-interneta\/vypusk-yggdrasil-0-5-realizaczii-privatnoj-seti-rabotayushhej-poverh-interneta"},"modified":"2023-11-01T15:10:18","modified_gmt":"2023-11-01T13:10:18","slug":"vypusk-yggdrasil-0-5-realizaczii-privatnoj-seti-rabotayushhej-poverh-interneta","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/vypusk-yggdrasil-0-5-realizaczii-privatnoj-seti-rabotayushhej-poverh-interneta","title":{"rendered":"Release of Yggdrasil 0.5, implementation of a private network operating over the internet","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
After more than two years of development, the release of the reference implementation of the Yggdrasil 0.5 protocol has been published, allowing the deployment of a separate decentralized private IPv6 network over the regular global network for privacy protection, utilizing end-to-end encryption. Any existing applications that support IPv6 can be used within the Yggdrasil network. The implementation is written in Go and is distributed under the LGPLv3 license. Supported platforms include Linux, OpenWRT, Windows, macOS, FreeBSD, OpenBSD, VyOS, and Ubiquiti EdgeRouter. <\/p>\n
Yggdrasil is developing a new routing concept to create a global decentralized network, where nodes can connect directly to each other in a mesh network (for example, via Wi-Fi or Bluetooth), as well as interact over existing IPv6 or IPv4 networks (a network over a network). A distinctive feature of Yggdrasil is its self-organizing operation, requiring no explicit routing configuration \u2014 routing information is calculated based on the node's location in the network relative to other nodes. Devices are addressed using a standard IPv6 address that does not change if the node moves (Yggdrasil uses an unused address range 0200::\/7). <\/p>\n
The entire Yggdrasil network is viewed not as a collection of disparate subnets but as a single structured spanning tree, which has one 'root', and each node has one parent and one or several descendants. This tree structure allows a route to be built to the destination node relative to the source node, using a 'locator' mechanism that determines the optimal path from the root to the node. Information about the tree is distributed among nodes and is not stored centrally. <\/p>\n
To protect against traffic analysis within the network, end-to-end encryption is employed (transit nodes cannot determine the content), but anonymity is not guaranteed \u2014 when connecting via the internet, peer nodes that directly interact can determine the real IP address. Therefore, for anonymity, it is recommended to connect nodes through Tor or I2P. <\/p>\n