A couple of days ago, I did a quick explainer on Claude’s new watermarking process and implementation. Since it’s such a popular topic and sparked such a lively discussion, I thought it might be interesting to go into a bit more detail when explaining how it works. So, instead of the usual text article, I recorded a little lecture on the topic (to change it up a bit from my usual articles). It ended up a bit longer than intended, but I hope it clarifies a lot of things: - Sampling the next token in an LLM and pseudorandom number generators - How watermarking relates to the regular LLM sampling process - Whether watermarking makes text "worse" - How to remove watermarks - Tournament sampling - How new text is checked for watermarks without rerunning the LLM I ended up with ~50 slides, but I hope that these explain it well, though! Happy watching!