  This note proposes a probabilistic language-free proof of the famous
Croot-Laba-Sisask Lemma. In between, we do the same for the Khintchine and
Marcinkiewicz-Zygmund inequalities and explicitate the implied constants.
