I just read this link. Wow, I’m currently using merkle trees with hashes for this problem, getting a window of messages to send but it easily over sends. I may need to try this out too!
I wonder how large the bloom filter gets though with tens of thousands of messages. I prune the merkle tree, losing accuracy but it stays very small as messages scale
Quite so -- we have a pretty decent two-node hash graph sync working now. I expect it to extend really nicely to n-peer & incremental sync though we have more work to do for that.