@bfive

Is the bigger problem traffic or memory pressure caused by the long list of dedupe hashes? If it’s the latter we could likely optimize libp2p gossip to use a probabilistic filter for (like a bloom filter) for hash set membership checks.

0 reply

0 recast

0 reaction