B08 - Hostage
USHTON: Inga! [She comes out of hiding as Ushton restores the oxygen to the room.] Get them out of there. I'll deal with Travis. [Ushton drags Travis out and dumps him down a cliff. Inga lets Blake, Avon and Vila out.]
VILA: Ugh.
https://blake.torpidity.net/m/208/641 …
💡 Why hashes over timestamps?
- Timestamps can be manipulated
- Backup restores mess up mtime
- Hashes reliably detect real content changes
🚀 Result: 32,000 files completely scanned in under 30 seconds – syncing only the delta!
I just found out that in old planes, flight computers were programmed with audio cassette tapes 😯 which now makes me want to look up how data recording on MCs worked on the C64 (before my time).
I remember that in the 90s, I tried to run "play.exe word.doc" to get my SoundBlaster card to write to my cassette tape. Which of course didn't work.
I bet there is a FOSS project that backups and restores to audio cassettes.
Well, I guess now I know how I'll spend my…
Extremely frustrated with #Backblaze today. They actively block restores to non-Apple formats on a Mac - even natively supported ones like ExFAT. I explicitly want to restore to non-Apple format to achieve platform agnosticism. Now I have 8 TB stuck in their cloud and have to decide which bothersome way outside my elderly Mac Mini server I want to struggle with in order to get my data back.…
ZOR filters: fast and smaller than fuse filters
Antoine Limasset
https://arxiv.org/abs/2602.03525 https://arxiv.org/pdf/2602.03525 https://arxiv.org/html/2602.03525
arXiv:2602.03525v1 Announce Type: new
Abstract: Probabilistic membership filters support fast approximate membership queries with a controlled false-positive probability $\varepsilon$ and are widely used across storage, analytics, networking, and bioinformatics \cite{chang2008bigtable,dayan2018optimalbloom,broder2004network,harris2020improved,marchet2023scalable,chikhi2025logan,hernandez2025reindeer2}. In the static setting, state-of-the-art designs such as XOR and fuse filters achieve low overhead and very fast queries, but their peeling-based construction succeeds only with high probability, which complicates deterministic builds \cite{graf2020xor,graf2022binary,ulrich2023taxor}.
We introduce \emph{ZOR filters}, a deterministic continuation of XOR/fuse filters that guarantees construction termination while preserving the same XOR-based query mechanism. ZOR replaces restart-on-failure with deterministic peeling that abandons a small fraction of keys, and restores false-positive-only semantics by storing the remainder in a compact auxiliary structure. In our experiments, the abandoned fraction drops below $1\%$ for moderate arity (e.g., $N\ge 5$), so the auxiliary handles a negligible fraction of keys. As a result, ZOR filters can achieve overhead within $1\%$ of the information-theoretic lower bound $\log_2(1/\varepsilon)$ while retaining fuse-like query performance; the additional cost is concentrated on negative queries due to the auxiliary check. Our current prototype builds several-fold slower than highly optimized fuse builders because it maintains explicit incidence information during deterministic peeling; closing this optimisation gap is an engineering target.
toXiv_bot_toot