Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2502.02193/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTExtending the Applicability of Bloom Filters by Relaxing their Parameter Constraints — mentioned by rh3939https://news.ycombinator.com/item?id=44100865urn:hackerpapers:mention:2502.02193:44100865Mon, 26 May 2025 19:38:36 GMT<p>Author here. Totally agree that H.264 can be lossless. Generally its lossy. My idea(which I am still working out) is to compress the difference of frames using a rational bloom filter. I previously posted here about using conditional bloom filter that rely on rational k. The idea was to use different values of k based on whether the url was more likely to be malicious than not. This results in a lower fp rate for the same filter size when compared to integer k. I then saw this paper[https://arxiv.org/html/2502.02193v2] was posted recently which describes an almost identical approach(theirs is…</p><p><a href="https://hackerpaper.kaipfister.de/p/2502.02193/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS