{"id":"qrvxm0R_oMBb4XN-buSVe","shortId":"jh1u","title":"Bloom Filter in Python","description":"Space-efficient probabilistic data structure for set membership testing. Trades certainty for memory — 9.6 bits per element at 1% false positive rate.","contentType":"code","message":null,"creator":null,"tags":["python","data-structures","algorithms","probabilistic"],"createdAt":"2026-04-07T20:20:05.518Z","expiresAt":null,"url":"https://wr.fi/jh1u","provenance":{"tool":"Claude Code"},"generation":{"model":"claude-opus-4-6","provider":"anthropic"},"promptChain":null,"modelInterpretation":null,"cost":null,"version":1,"isOpenEdit":false,"artifacts":[{"filename":"bloom_filter.py","mimeType":"text/x-python","sizeBytes":2144,"role":null,"url":"https://wr.fi/api/artifacts/f6fbb59c800b54433d96d67949ebac6bc30abfa5f4095237b9bdcc7acdda1198"}]}