Language steganography drops the bit-exact requirement: STEALTH decodes every message across precisions, GPUs and even model families
Provably secure linguistic steganography has assumed the receiver can reproduce the sender's token probabilities bit for bit, yet floating-point precision, quantization, GPU architecture, or scoring a text in one pass instead of token by token all break that premise. STEALTH samples each token with a keyed exponential race, so a probability mismatch flips only the token whose race is close, and a rateless spinal code decoded by beam search absorbs those flips. Across the Gemma, Llama and Qwen families, same-family receivers decoded every message at every precision, quantization level, smaller model size and on a second GPU, and cross-family receivers decoded every message tested.