Skip to content
HomeNewsConceptsGuidesToolbox
AboutSubscribeUA
Subscribe

AI Today Brief

The daily AI-engineering brief. Built in public. EN · UA.

XTelegramLinkedInYouTubeRSS

Follow AI Today Brief on LinkedIn for daily AI-engineering updates and the weekly “5 shifts that changed how developers work” PDF.

Explore

NewsDigestsConceptsGuides

Company

SubscribeAdvertiseAbout

Legal

Editorial policyAI disclosurePrivacyTerms

© 2026 AI Today Brief. All rights reserved.

  1. Home/
  2. News/
  3. Models & research/
  4. How LLM Statistical Watermarking Works and Why Light Paraphrasing Fails
Models & research

How LLM Statistical Watermarking Works and Why Light Paraphrasing Fails

An interactive breakdown illustrates how models like Claude and Gemini embed statistical watermarks by subtly biasing candidate token selection using secret keys. Detection relies on k-gram window matches, meaning only full semantic rewrites successfully erase the mark.

August 17, 2026· 4 min read
OKCurated by Oleksandr Kuzmenko, AI Product Engineer·Updated August 17, 2026·Sources cited on every story
AI-assisted · editor-reviewed·How we use AI
How LLM Statistical Watermarking Works and Why Light Paraphrasing Fails

Impact: Medium

Why it matters

Understand how model-level sampling watermarks behave during generation and how window-based detection resists superficial edits.

TL;DR

  • 01Watermarks are embedded during model sampling without adding metadata or changing characters.
  • 02Detectors require the provider's private secret key to verify green-token statistical bias.
  • 03Only full semantic re-composition breaks contiguous n-gram windows enough to reset detection.

Key facts

KGW Window Survival
0.5% after full rewrite
Detection Threshold
~1,500 words for subtle shifts
Key Ownership
Model provider required

Token Sampling and Secret Keys

During sentence generation, language models evaluate a shortlist of plausible next tokens. Watermarking algorithms use a secret key based on preceding tokens to color candidate words red or green, tilting selection probability toward green tokens.

Detection Mechanics and Window Thresholds

Detection does not use stylistic heuristics; it recalculates token colors with the key and measures green token frequencies:

  • Short texts & code: Offer insufficient statistical slack for watermark insertion.
  • Long text (>1,500 words): Provides high statistical confidence even with minimal probability shifts.
  • Light paraphrase: Fails to remove marks because contiguous n-gram windows survive.
  • Full semantic rewrite: Erases marks by breaking >99.5% of original token window sequences.

✓ When to use

  • When evaluating whether light text editing erases LLM generation artifacts
  • When designing pipelines to audit or verify AI-generated documentation

✕ When NOT to use

  • When analyzing source code or deterministic data structures where word choice has zero variance

What to do today

  • →Audit automated content generation workflows to ensure full semantic recomposition when clean output is required.
#Claude#Gemini#SynthID

Sources

  • declaude Watermarking Visual Guide
ShareShare on XShare on LinkedIn
← Previous storyCursor Launches Origin Codebase Hosting and Bidirectional GitHub SyncNext story →Decompiling Legacy Game Binaries with Claude Code Agentic Workflows

Related stories

  • Models & researchLegacy Claude Models Vulnerable to Multi-Turn Prompt Exploits on Third-Party APIs
  • Models & researchMystery Model Ox Alpha Appears on OpenRouter Surpassing Fable 5 and GPT-5.6 Sol
  • Models & researchOpen-Source Ornith-1.5 Drops 397B MoE Model Under MIT License
  • Models & researchCanonical Backs Neurosymbolic AI Research to Automate C to Rust Refactoring

Email digest

Get the morning AI brief

One email a day — the stories that matter for engineers, founders and tech leads. Human-edited, with links to primary sources.

  • ✓120+ sources scanned daily
  • ✓Edited by a human
  • ✓1 email per day
  • ✓EN + UA

By subscribing you agree to the privacy policy.