Negentropy is a minimal version of IPFS’s BitSwap, used by Strfry and NostrDB.

GraphSync is IPFS’s evolution of BitSwap: it syncs with ranged requests rather than asking for each note one at a time.

We are building our own version of ranged-request syncing, similar to GraphSync, for #Nostr.

The Scionic Merkle DAG-Trees come equipped with numbered leaves to facilitate this type of syncing. Given that the new Merkle DAG-Trees make it possible, we’ve named our syncing system FOREST. 🌲 FOREST synchronizes the Merkle DAG-Trees across nodes. 🌐

Reply to this note

Please Login to reply.

Discussion

No replies yet.