Graph DB is mostly written. Most of the concurrency work will end up being done by the "left-right" crate, which does the thing I was going to do where there's a read copy and a write copy and every now and then it swaps them, only it turns out I didn't really know how to make that lock-free, but I do now. This is going to be *the fastest* (eventually consistent, for work with a high read:write ratio, single-machine) graphdb

· · Web · 1 · 0 · 3

Now trying to generate realistic models of endorsement networks for performance testing. Surprisingly deep work. The agent models should be simple because the finished system's UX should be simple. I have no excuses now, it is time to face all of the fundamental questions about I expect this to grow. What sorts of people issue invites, how people discovery other people, what incentives a popular curator has to endorse another, how networks improve over time or birth themselves from nothing.

Sign in to participate in the conversation

Revel in the marvels of the universe. We are a collective of forward-thinking individuals who strive to better ourselves and our surroundings through constant creation. We express ourselves through music, art, games, and writing. We also put great value in play. A warm welcome to any like-minded people who feel these ideals resonate with them.