Hypermind
The high-availability solution to a problem that doesn't exist
...There’s no central server or database; instead, Hypermind leverages a Distributed Hash Table (DHT) using Hyperswarm to discover peers and maintain approximate counts of active nodes, architected to be a fully decentralized service. Alongside counting nodes, the project also supports ephemeral chat over its mesh network, allowing users to send messages directly to local peers or broadcast via a gossip protocol without storing chat history. The project uses probabilistic data structures like HyperLogLog for efficient estimation of unique peers and provides real-time visualizations and themes for exploring the swarm.