Fair-share transit enforcement
A built-in reciprocity mechanism that measures how much relay bandwidth each peer contributes versus consumes, prioritizing nodes that actively help route traffic for the network.
Planned features and architectural capabilities ordered chronologically by implementation feasibility, from immediate software extensions to advanced hardware-gated integrations.
A built-in reciprocity mechanism that measures how much relay bandwidth each peer contributes versus consumes, prioritizing nodes that actively help route traffic for the network.
Enhanced direct traversal through strict home and cellular NAT firewalls without requiring manual port forwards or public relay intermediaries.
Allowing exit nodes to distribute outbound traffic across multiple public IP addresses, preventing destination servers from correlating or rate-limiting traffic to a single address.
Cryptographic proof exchanges during discovery that allow peers to verify authorization to join a private mesh without revealing their public identity keys over the wire.
Secondary LDPC error correction across sustained high-throughput streams, repairing packet bursts on severely unstable lossy networks beyond single-frame sharding.
Continuous in-memory encryption of volatile buffers to protect cryptographic session material against physical physical-memory dumping or cold-boot attacks.
Binding node identity keys directly into physical TPM 2.0 chips and YubiKey HSMs so master private keys can never be extracted from host storage.
Direct network card packet ingestion via eBPF and XDP drivers on Linux, allowing multi-gigabit mesh routing without operating system kernel overhead.
Predictive orbit trajectory modeling and Doppler frequency adjustment to route traffic across Low Earth Orbit satellite constellations and ground stations.