An experimental graph database written in Go, motivated by the poor performance of existing options like Neo4J and the question of whether a bare-metal approach could do better. The design used Morton-coded indexes to maintain bidirectional edge relationships between nodes in a way that could be distributed across a cluster, although it didn’t progress that far.
It reached a working single-node implementation with acceptable traversal performance, including some connected component algorithms, but never gained replication or clustering. In the end, confidence in the implementation wasn’t high enough to use it in production, and the need for deep graph analysis turned out to be less pressing than expected. At Stashmetrics, the follower graph problem was solved more pragmatically by storing edge lists directly in DynamoDB - paginated arrays of follower IDs per user rather than one record per edge.