Great news, but keep pushing against Chat Control until October 14, especially if you live in a still undecided country:
🇧🇪🇬🇷🇮🇹🇱🇻🇸🇰🇸🇪

fightchatcontrol.eu

Excited to see so many colleagues sign the open letter against Chat Control csa-scientist-open-letter.org/Sep2025 If you're in crypto & haven't signed yet, consider adding your name.

Everyone can #FightChatControl until October 14 fightchatcontrol.eu
Still undecided: 🇧🇪🇩🇪🇬🇷🇮🇹🇱🇻🇸🇰🇸🇮🇸🇪

The Financial Crypto deadline has been extended to this Friday, September 20: fc26.ifca.ai/cfp.html Still time to submit your blockchain-related work :)

Naysayer proofs This work introduces the notion of naysayer proofs. We observe that in numerous (zero-knowledge) proof systems, it is significantly more efficient for the verifier to be convinced by a so-called naysayer that a false proof is invalid than it is to check that a genuine proof is valid. We show that every NP language has constant-size and constant-time naysayer proofs. We also show practical constructions for several example proof systems, including FRI polynomial commitments, post-quantum secure digital signatures, and verifiable shuffles. Naysayer proofs enable an interesting new optimistic verification mode potentially suitable for resource-constrained verifiers, such as smart contracts.

In writing my dissertation, I significantly reworked the formalism of naysayer proofs and clarified details in our main theorem and example constructions. The eprint (eprint.iacr.org/2023/1472) has now been updated with these improvements! Go check it out :)