Yggdrasil: A Decentralized Routing Protocol for Mesh Networks

Yggdrasil is an experimental compact routing scheme designed to be fully decentralized and requiring minimal state. It primarily uses a shortest-path approach, finding the most direct route to the destination. Nodes are equal participants, connecting via peer-to-peer links carrying network traffic. Peerings can be established over any IP network, from wired/wireless links and LANs to the internet, with automatic setup possible via multicast discovery. All nodes act as routers, forwarding traffic to bring it closer to its destination, ensuring reachability even in sparsely connected networks, regardless of NAT. The network self-heals from link failures. Each node possesses a location-independent cryptographic identity, generating stable IPv6 addresses, allowing IPv6 applications to work largely unmodified. Yggdrasil contrasts with hierarchical, centrally managed networks, offering rapid ad-hoc network setup and eliminating the need for centralized address assignment. Its end-to-end routability makes it suitable for edge computing and mesh networks independent of the internet. While comparable to anonymity-focused overlays like Tor and VPN solutions like WireGuard, Yggdrasil prioritizes neither anonymity nor VPN functionality, instead focusing on the scalability of its routing scheme. Currently in alpha, the project aims to test its scalability through real-world usage on a public test network.