How Unix spell ran in 64 kB of RAM (2025) (blog.codingconfessions.com) 75 points by donw 3mo ago ↗ HN
[–] inigyou 3mo ago ↗ Would a bloom filter be more or less effective if each hash function was given a separate bit-table rather than sharing the same one?
4 comments of 7
[ 5.5 ms ] story [ 11.8 ms ] threadhttps://prog21.dadgum.com/29.html