
Building https://iroh.computer
12 Followers
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.
Hey look I made a vid about bloom filters https://www.youtube.com/watch?v=eCUm4U3WDpM