WeaveMark: Robust and Scalable Multi-bit LLM Watermarking via Coded Payload Spreading

Gang-Hyun Park, Ju-Hyeong Lee, Hee-Youl Kwak, Dae-Young Yun
9/2/2026
cs.CRcs.LG

Official code: qkrrkd90-source/WeaveMark (0 stars, MIT, last commit 2026-07-21).

Abstract

Multi-bit watermarking for large language models (LLMs) enables content source tracing by embedding user-identifiable messages into generated text. Existing methods face a fundamental trade-off among extraction accuracy, text quality, and payload capacity. We propose WeaveMark, a robust and scalable multi-bit LLM watermarking scheme based on coded payload spreading. WeaveMark shifts this trade-off frontier by improving payload capacity through multi-bit-per-token spreading, improving extraction accuracy through soft-decision error-correcting code, and preserving text quality through unbiased multilayer reweighting. It further introduces dedicated zero-bit layers for reliable watermark presence detection. Experiments show large gains, especially for long messages and edited text. WeaveMark achieves 89.8% match rate for 32-bit messages at 200 tokens, compared with 20.8% for BiMark. Under 10% substitution attacks on 16-bit messages at 200 tokens, it maintains 86.0% versus 30.7%, while preserving text quality. Our code is available at https://github.com/qkrrkd90-source/WeaveMark.

View on arXivView PDF

Code Implementations(1)

MIT
00PythonJul 20, 20263 months agoMIT

Similar Papers

Cite this paper

@article{park2026weavemark,
  title  = {WeaveMark: Robust and Scalable Multi-bit LLM Watermarking via Coded Payload Spreading},
  author = {Gang-Hyun Park and Ju-Hyeong Lee and Hee-Youl Kwak and Dae-Young Yun},
  year   = {2026},
  eprint = {2609.02177},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2609.02177v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2609.02177.svg)](https://codeofpaper.com/paper/2609.02177)

Discussion