Clever hacker needs to look up a Bloom Filter

Lukas_Skywalker a day ago | parent | next [-]

Lazy commenters need to look at the README to see that the bloom filter is mentioned as a next step. The hacker is indeed clever.

▲

amelius a day ago | parent [-]

Only if the hacker also tests for false positives.

▲

Lukas_Skywalker a day ago | parent [-]

The way it's worded in the readme makes it sound as if this was exactly the intention.

▲

amelius a day ago | parent [-]

Very clever hacker indeed!

May even have Sonnet or Opus level of intelligence.

	▲	docjay a day ago \| parent [-]
		As someone with an intelligence near Opus I have to be clear with you: your premise is wrong. Having intelligence is not the same as being clever — a person can cleverly pass a difficult test without having or acquiring intelligence. That’s not a revelation, that’s common-sense. You’re also conflating quantum superposition and macroscopic observations — one is physics, the other is psychology. The exact same thing cannot exist in two places at the same time above 10⁻¹⁰ meters, and intelligence is not measurable using most displacement methods. It is not possible for Opus, Sonnet, and the person to all have the same intelligence. That’s just physics. I also noticed that you did not use any punctuation in your comment, so I must firmly decline continuing this line of inquiry. # Correction I reviewed your comment again and I can see that you did use punctuation. I retract that statement, but I stand by my assertion that being intelligent is typically more important than being clever.

▲

amazingamazing a day ago | parent | prev | next [-]

> how it could grow : Bloom filter in RAM as a fast pre-filter (skip flash for the ~99% of misses)

https://github.com/M-Abozaid/esp32-c3-adblock

▲

rustyhancock a day ago | parent | prev | next [-]

The README mentions it and conventionally it seems right.

But back of the envelope it seems you're shaving not much off if the latency is primarily WiFi latency (tens of milliseconds) not flash reads (microseconds?).

If you use loads of transient clients perhaps a LRU cache would help since round trips might be quite slow.

▲

rurban a day ago | parent | prev | next [-]

Double space. Go from 42 bit to 46 bit and you get the same. Still wondering about the dynamic binary search. A static search can be faster, even on an AVR

▲

Graziano_M a day ago | parent | prev | next [-]

I opened the article and immediately ctrl-f'd for the word "bloom". Though the author plans to use them.

▲

intheitmines a day ago | parent | prev | next [-]

What do people use bloom filters for in production? I've only ever used as part of a blacklist

	▲	gtowey a day ago \| parent [-]
		Search partition pruning in distributed databases is one concrete application I'm aware of. Hashtables optimized for really large item counts; it can be a useful fast pre-check for item existence.

▲

a day ago | parent | prev [-]

[deleted]