Files
modules/indexes-search/hyper-p2p-bloom-gossip
Raven ScottandCursor d51bfea987 feat(modules): manual deepen gossip, bloom, trust, storage, economy
Gossip mesh drop rate, bloom batch filter, blind relay best pick,
key rotation helpers, OR-map values, writer lease releaseAll,
view sync catchUp, channel prune, credit closeAccount, argv bridge.

Co-authored-by: Cursor <[email protected]>
2026-05-21 02:33:33 -04:00
..
2026-05-20 22:56:32 -04:00
2026-05-21 00:07:44 -04:00
2026-05-20 21:57:50 -04:00
2026-05-20 21:57:50 -04:00
2026-05-20 22:56:32 -04:00

hyper-p2p-bloom-gossip

Probabilistic set membership filter with bloom-add gossip over Hyperswarm.

Category: indexes-search

Protocol: bloom-gossip/v1

When to use

Cheap “maybe seen” checks for peer IDs, hashes, or cache keys replicated across a swarm.

When not to use

When false positives are unacceptable without secondary verification, or when exact set membership is required locally only.

Quick start

const { HyperP2PBloomGossip } = require('hyper-p2p-bloom-gossip')
const mod = new HyperP2PBloomGossip({ topic: process.argv[2] })
await mod.ready()
mod.add('peer-abc')
console.log(mod.mightContain('peer-abc'), mod.exportBits())
await mod.close()

Docs

Test

npm install && npm test