SOURCE-LINKED INTELLIGENCE

Flip, Don't Shuffle: Watermarking LLMs at the Speed of Inference

arXiv · AI, language, vision and robotics · article · Sep 3, 2026 · UTC

We introduce Stateless Bernoulli Watermarking (SBW), a new statistical watermark for Large Language Models that determines green list membership through independent per-token Bernoulli trials. Unlike KGW's vocabulary permutation or SynthID's multi-layer tournament, SBW requires only a single comparison per token against a counter-based random number generator, reducing membership complexity to $O(1)$ and enabling single-kernel execution with zero intermediate allocations. We prove that this formulation preserves the same detection guarantees as fixed-size green lists: the z-score test remains

Read original source ↗ Open in workspace

recordType

paper

region

Global