• Jennifer Tran

• Google Quantum AI used zero-knowledge proofs to conceal, yet confirm, quantum circuits that can break popular cryptography

• https://open.substack.com/pub/realmscape/p/how-zero-knowledge-proofs-make-quantum?utm_campaign=post-expanded-share&utm_medium=web

• https://encryptorium.medium.com/quantum-safe-bitcoin-transactions-without-a-soft-fork-what-the-qsb-paper-actually-says-93f2850b6d3f

• related paper https://github.com/avihu28/Quantum-Safe-Bitcoin-Transactions/blob/main/paper/QSB.pdf

• Frank Mangone

• This blog introduces Commitment, Merkle tree, PCS, Pairing, KZG...

• https://medium.com/@francomangone18/the-zk-chronicles-commitment-schemes-part-2-8edcc1dc7a77

Quantum Safe Bitcoin (QSB) enables signing Bitcoin transactions in a way that remains secure even against an adversary with a large-scale quantum computer running Shor's algorithm. The scheme requires no changes to the Bitcoin protocol — it operates entirely within the existing legacy script constraints (201 opcodes, 10,000 bytes).

• https://github.com/avihu28/Quantum-Safe-Bitcoin-Transactions/tree/main

• In this episode, Anna Rose and Nico Mohnblatt speak with Shyam Duraishwami and Emanuele Ragnoli, co-founders of Provably. They trace the origins of Provably, from early work on data ecosystems and blockchain infrastructure to the launch of their verifiable database approach, exploring how advances in cryptography and database theory enabled this shift.

• https://zeroknowledge.fm/podcast/398/

• Wujie Xiong, Arefeh Rahaei, Sangwon Shin, Xinxin Fan, Taeweon Suh, Veronika Kuchta, Sica Francesco, Weidong Shi, Lei Xu

• https://eprint.iacr.org/2026/686

• Rahul Dalal, Tamir Hemo, Eugene Rabinovich, Ron Rothblum

• https://eprint.iacr.org/2026/683

• Gal Arnon, Noam Mazor, Rafael Pass, Jad Silbak

• https://eprint.iacr.org/2026/682

• Gal Arnon, Dan Boneh Giacomo Fenzi

• The Ethereum Foundation recently announced the Proximity Prize which aims to resolve some open problems that play an important role in the design of succinct proof systems. This paper reviews the open problems relevant to the Proximity Prize. We focus on some grand challenges relating to list decoding bounds, proximity gaps, correlated agreement, and mutual correlated agreement,as they relate to proof systems and Reed--Solomon codes. Along the way we survey the known results on these topics.

• Recommend:

• https://eprint.iacr.org/2026/680

• Zvika Brakerski, Maya Farber Brodsky, Omer Paneth, Tomer Solomon

• https://eprint.iacr.org/2026/678

• Arad Kotzer, Tom Azoulay, Yoad Abels, Aviv Yaish, Ori Rottenstreich

• https://eprint.iacr.org/2026/675

• Mohammad Hassan Ameri, Jeremiah Blocki

• https://eprint.iacr.org/2026/653

If you're interested in our ZK Insights or have ideas for similar content, we highly encourage everyone to head over to our GitHub repo and submit a Pull Request. Join forces with like-minded ZKPunks to co-create!

✨ Github repo link: https://github.com/ZKPunk-Org/zk-insights