This prototype of a Brainstorm instance shows that the set of all known pubkeys that I follow, plus the ones they follow, plus the ones they follow, ad infinitum until there are no more known pubkeys to add, yields less than 300 thousand pubkeys, with the highest degree of separation by follows being 10 hops away.
Login to reply
Replies (2)
You’re setting an array, with booleans this could be an open algorithm…
This isn’t magic right? You’re graphing traversals + Boolean visited with BFS overlay. If you’re interested in fleshing this out further I’ll work with you on it as long as it’s foss
Foss all the way 🤝