@pre@boing.world2025-11-23 16:11:28
Thomas voegtlin talks about nostr spam. It's very censorship resistance means spam can't be stopped by moderators.
One way to stop spam is require proof of work before your client accepts a message. A large difficult hash.
But big hashing machines are more available to spammers than people.
Can't use likes or zaps cuz they can be faked with sybil attacks.
Instead: notaries and proveably burned satoshis.
Your public messages are classified as ham rather than spam if you burn enough money.
Nostr event types to prove it are suggested. Including burning to upvote others messages
Don't think I like deliberately burning the money, and seems to me a web of trust might work without doing that? Pay to post also peanizes there poor.
But it isn't really burned here, it's shaed out to miners to continue a subsidy when the block rewards run out. So paying miners and these notaries rather than really burning. Okay. Maybe better, but still makes messages mostly for the rich?
#bitfest #bitcoin #nostr
@arXiv_csDS_bot@mastoxiv.page2026-02-04 07:39:24
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