<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel>
        <title>ZK Insights</title>
        <link>https://paragraph.com/@zkinsights</link>
        <description>undefined</description>
        <lastBuildDate>Wed, 18 Nov 2026 21:21:34 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <image>
            <title>ZK Insights</title>
            <url>https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/381a515225026b945d85156004d9a387.png</url>
            <link>https://paragraph.com/@zkinsights</link>
        </image>
        <copyright>All rights reserved</copyright>
        <item>
            <title><![CDATA[ZK Insights | 13 Nov 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-13-nov-2026</link>
            <guid>NFd77U3LCXWnvDS1JyEo</guid>
            <pubDate>Fri, 13 Nov 2026 15:00:20 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover zkVM experiments, tools for writing and verifying ZK circuits, and research on succinct proofs and anonymous credentials.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-2026-zk-industry-report-or-zero-knowledge-podcast-and-succinct" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">2026 ZK Industry Report | Zero Knowledge Podcast and Succinct</h3><ul><li><p>Surveys advances in proving performance and how governments, technology companies, and banks are deploying ZK.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/zk-industry-report-2026/">https://zeroknowledge.fm/zk-industry-report-2026/</a></p></li></ul><h3 id="h-the-last-two-curves-or-zkm" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The last two curves | ZKM</h3><ul><li><p>Describes experimental replacements for Ziren's elliptic-curve memory check and its pairing-based on-chain proof wrapper.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.zkm.io/blog/the-last-two-curves">https://www.zkm.io/blog/the-last-two-curves</a></p></li></ul><h3 id="h-folding-vs-full-verifier-recursion-for-pq-signature-aggregation-in-leanvm-measurements-and-negative-results" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Folding vs full-verifier recursion for PQ signature aggregation in leanVM: measurements and negative results</h3><ul><li><p>Benchmarks folding and full-verifier recursion for post-quantum signature aggregation in leanVM.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/folding-vs-full-verifier-recursion-for-pq-signature-aggregation-in-leanvm-measurements-and-negative-results/26227">https://ethresear.ch/t/folding-vs-full-verifier-recursion-for-pq-signature-aggregation-in-leanvm-measurements-and-negative-results/26227</a></p></li></ul><h3 id="h-seam-verifying-zcash-headers-on-base-with-eip-152-and-proving-shielded-payments-without-linking-the-chains" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Seam: verifying Zcash headers on Base with EIP-152, and proving shielded payments without linking the chains</h3><ul><li><p>A prototype that verifies Zcash headers on Base and proves shielded payments without revealing the underlying transaction.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/seam-verifying-zcash-headers-on-base-with-eip-152-and-proving-shielded-payments-without-linking-the-chains/26239">https://ethresear.ch/t/seam-verifying-zcash-headers-on-base-with-eip-152-and-proving-shielded-payments-without-linking-the-chains/26239</a></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/Himess/seam">https://github.com/Himess/seam</a></p></li></ul><h3 id="h-zero-knowledge-proof-from-first-principles-to-production-or-pawel-jakubas-cardano-foundation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Zero Knowledge Proof from First Principles to Production | Pawel Jakubas, Cardano Foundation</h3><ul><li><p>Walks through building a small circuit, generating a Groth16 proof, and verifying it on Cardano.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://cardanofoundation.org/blog/zkp-principles-to-production">https://cardanofoundation.org/blog/zkp-principles-to-production</a></p></li></ul><h3 id="h-noir-10-is-live-or-aztec" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Noir 1.0 Is Live | Aztec</h3><ul><li><p>The first stable Noir release brings a versioned toolchain and a stable ACIR interface for proving backends.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://aztec.network/blog/noir-1-0-is-live">https://aztec.network/blog/noir-1-0-is-live</a></p></li></ul><h3 id="h-certiplonk-or-nethermind" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">CertiPlonk | Nethermind</h3><ul><li><p>Extracts constraint systems from the Plonky3 zkDSL and supports verifying their properties in Lean.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/NethermindEth/CertiPlonk">https://github.com/NethermindEth/CertiPlonk</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-when-math-meets-auto-research-with-bartosz-naskrecki" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">When Math Meets Auto Research with Bartosz Naskręcki</h3><ul><li><p>ZK Podcast, Episode 416</p></li><li><p>Discusses AI-assisted mathematics and the role of Lean in checking generated proofs.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/podcast/416/">https://zeroknowledge.fm/podcast/416/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-bulletproofs-are-optimal-lower-bounds-for-vector-commitments-from-fiat-shamir-in-pairing-free-groups" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Bulletproofs are Optimal: Lower Bounds for Vector Commitments from Fiat-Shamir in Pairing-Free Groups</h3><ul><li><p>Marian Dietz, Emanuele Giunta</p></li><li><p>Proves lower bounds on opening proofs for constant-size vector commitments built via Fiat–Shamir in pairing-free generic groups.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2868">https://eprint.iacr.org/2026/2868</a></p></li></ul><h3 id="h-revisiting-fiat-shamir-nizkps-and-signatures-from-seed-friendly-sigma-protocols" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Revisiting Fiat-Shamir NIZKPs and Signatures from Seed-Friendly Sigma Protocols</h3><ul><li><p>Andrea Flamini, Federico Pintore, Edoardo Signorini</p></li><li><p>Shows that salted seed trees enable straight-line extraction for Fiat–Shamir proofs from seed-friendly Sigma protocols in the classical random-oracle model.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2858">https://eprint.iacr.org/2026/2858</a></p></li></ul><h3 id="h-ascent-algebraic-structured-compilation-of-exact-norms-for-succinct-lattice-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ASCENT: Algebraic Structured Compilation of Exact Norms for Succinct Lattice Proofs</h3><ul><li><p>Lizhen Zhang, Shang Gao, Bin Xiao</p></li><li><p>Compiles exact Euclidean norm constraints for committed lattice witnesses into structured inner-product claims and relaxed shortness bounds.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2853">https://eprint.iacr.org/2026/2853</a></p></li></ul><h3 id="h-delegatable-keyed-verification-anonymous-credentials" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Delegatable Keyed-Verification Anonymous Credentials</h3><ul><li><p>Omid Mirzamohammadi, Varesh Mishra, Jan Bobolz, Emad Heydari Beni, Aysajan Abidin, Dave Singelée, Bart Preneel</p></li><li><p>Gives two pairing-free constructions that let holders delegate restricted versions of their keyed-verification anonymous credentials.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2860">https://eprint.iacr.org/2026/2860</a></p></li></ul><h3 id="h-bmraccoon-blind-multi-signatures-from-lattices" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">BMRaccoon: Blind Multi-Signatures from Lattices</h3><ul><li><p>Keerthi Aiswarya Varshini, Kanchan Bisht, Palkesh Jain, Maria Francis, R. Kabaleeshwaran</p></li><li><p>Builds a two-round lattice-based blind multi-signature scheme that supports concurrent signing sessions and produces Raccoon-compatible signatures.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2870">https://eprint.iacr.org/2026/2870</a></p></li></ul><h3 id="h-anamorphic-nizk-definition-construction-and-more" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Anamorphic NIZK: Definition, Construction and More</h3><ul><li><p>Wenhui Kong, Gongxian Zeng, Zhengan Huang</p></li><li><p>Constructs publicly verifiable zero-knowledge proofs that can carry covert messages recoverable with a secret key.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2866">https://eprint.iacr.org/2026/2866</a></p></li></ul><h3 id="h-revisiting-witness-succinct-uc-lifting-compilers" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Revisiting Witness-Succinct UC-lifting Compilers</h3><ul><li><p>Davide Li Calsi, Luigi Russo, Dominique Schröder, Federico Valbusa</p></li><li><p>Identifies a proof-rerandomization attack on a prior UC compiler and gives a new compiler that binds openings to their respective repetitions.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2453">https://eprint.iacr.org/2026/2453</a></p></li></ul><h3 id="h-snarks-from-lwe-via-non-black-box-reductions" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SNARKs from LWE via Non-black-box Reductions</h3><ul><li><p>Zhengzhong Jin, Mingqi Lu, Bo Peng</p></li><li><p>Constructs SNARKs from LWE for certain languages with efficiently provable witness uniqueness, with an infinitely-often soundness guarantee.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2805">https://eprint.iacr.org/2026/2805</a></p></li></ul><h3 id="h-on-proximity-gaps-for-expander-codes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">On Proximity Gaps for Expander Codes</h3><ul><li><p>Kobi Gurkan, Andrija Novakovic, Ron D. Rothblum</p></li><li><p>Establishes proximity gaps for low-degree expander codes, a property used to analyze soundness in proof systems.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2806">https://eprint.iacr.org/2026/2806</a></p></li></ul><h3 id="h-polygero-proximity-testing-from-polynomial-challenges" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Polygero: Proximity Testing From Polynomial Challenges</h3><ul><li><p>Matteo Frigo, abhi shelat</p></li><li><p>Uses low-degree polynomial challenges for Reed–Solomon proximity testing in a Ligero-style IOP with Lean-checked soundness.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2481">https://eprint.iacr.org/2026/2481</a></p></li></ul><h3 id="h-nowhere-man-device-binding-for-post-quantum-anonymous-credentials" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Nowhere Man: Device Binding for Post-Quantum Anonymous Credentials</h3><ul><li><p>Calvin Abou Haidar, Ryo Kikuchi, Octavio Perez-Kempner, Marcel Tiepelt</p></li><li><p>Binds anonymous credentials to a device using ML-DSA signatures and zero-knowledge proofs at presentation.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2472">https://eprint.iacr.org/2026/2472</a></p></li></ul><h3 id="h-post-quantum-sublinear-lookup-arguments-from-polynomial-preprocessing" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Post-Quantum Sublinear Lookup Arguments from Polynomial Preprocessing</h3><ul><li><p>Adarsh Basumata, Chaya Ganesh, Varun Narayanan, Sikhar Patranabis, Surbhi Shaw, Nitin Singh</p></li><li><p>Uses polynomial preprocessing and Reed–Muller proximity tests to obtain plausibly post-quantum lookups with sublinear online prover time.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2581">https://eprint.iacr.org/2026/2581</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/880d902b9c914d9408cf813b5e05bb29a76ed766b76d8f843f2fa5ddabf6ec8e.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 6 Nov 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-6-nov-2026</link>
            <guid>K2X84p4LNy7b0X0Rbx5d</guid>
            <pubDate>Fri, 06 Nov 2026 13:44:23 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover zero-knowledge proofs for LLM inference, a Lean-certified STARK verifier in OpenVM, and Ethereum block-proving benchmarks from Pico and Ziren. The papers explore bit packing and ring switching over binary fields, threshold anonymous credentials, and the conditions for preserving Fiat–Shamir extraction when instantiating the random oracle.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-flashprove-an-open-source-library-for-provable-inference" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0"><span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span><span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span><span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span> FlashProve: an open-source library for provable inference</h3><ul><li><p>Roy Rinberg, Alex Allain, Alessandro Chiesa, Miranda Christ, Rahul Dalal, Giacomo Fenzi, Ben Mayer, Guy Weissenberg</p></li><li><p>An open-source system for proving LLM inference while keeping model weights private.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.anthropic.com/research/provable-inference">https://www.anthropic.com/research/provable-inference</a></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.anthropic.com/document/flashprove-technical-report">https://www.anthropic.com/document/flashprove-technical-report</a></p></li></ul><h3 id="h-openvm-v210" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">OpenVM v2.1.0</h3><ul><li><p>Adds a Lean-certified STARK verifier to the OpenVM SDK and CLI.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/openvm-org/openvm/releases/tag/v2.1.0">https://github.com/openvm-org/openvm/releases/tag/v2.1.0</a></p></li></ul><h3 id="h-pico-31-128-bit-provable-security-still-real-time-on-4-gpus-now-fully-open-source-or-brevis" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Pico 3.1: 128-Bit Provable Security, Still Real-Time on 4 GPUs, Now Fully Open Source | Brevis</h3><ul><li><p>A Pico zkVM release with a reported 128-bit security bound and an open-source GPU prover.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.brevis.network/2026/11/05/pico-3-1-128-bit-provable-security-still-real-time-on-4-gpus-now-fully-open-source/">https://blog.brevis.network/2026/11/05/pico-3-1-128-bit-provable-security-still-real-time-on-4-gpus-now-fully-open-source/</a></p></li></ul><h3 id="h-ziren-20-or-zkm" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ziren 2.0 | ZKM</h3><ul><li><p>A MIPS32 zkVM release with a proving core based on jagged sumcheck and WHIR.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.zkm.io/blog/ziren-2-0">https://www.zkm.io/blog/ziren-2-0</a></p></li></ul><h3 id="h-lean-for-cryptanalysts-or-hosein-hadipour" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Lean for Cryptanalysts | Hosein Hadipour</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://hoseinhadipour.com/blog/lean-for-cryptanalysts/">https://hoseinhadipour.com/blog/lean-for-cryptanalysts/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-sumcheck-bit-packing" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Sumcheck bit packing</h3><ul><li><p>Matteo Frigo, abhi shelat</p></li><li><p>Uses the field trace to check linear claims about witness bits packed into binary extension-field elements.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2770">https://eprint.iacr.org/2026/2770</a></p></li></ul><h3 id="h-airbb-lightweight-threshold-anonymous-credentials-without-random-oracles-from-bb-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">AirBB: Lightweight Threshold Anonymous Credentials without Random Oracles from BB Signatures</h3><ul><li><p>Sebastian Faust, Jonas Hofmann, Philipp-Florens Lehwalder, Hussien Othmann</p></li><li><p>Builds threshold anonymous credentials from Boneh–Boyen signatures without random oracles.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2762">https://eprint.iacr.org/2026/2762</a></p></li></ul><h3 id="h-a-note-on-zero-knowledge-ring-switching" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A note on zero-knowledge ring switching</h3><ul><li><p>Andrei Kochergin</p></li><li><p>Gives a zero-knowledge version of Diamond and Posen's ring-switching technique.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2754">https://eprint.iacr.org/2026/2754</a></p></li></ul><h3 id="h-beyond-standard-indifferentiability-simulator-properties-for-fiat-shamir-security" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Beyond Standard Indifferentiability: Simulator Properties for Fiat-Shamir Security</h3><ul><li><p>Ashrujit Ghoshal, Sikhar Patranabis</p></li><li><p>Studies when Fiat–Shamir knowledge extraction is preserved as a structured hash replaces the random oracle.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2708">https://eprint.iacr.org/2026/2708</a></p></li></ul><h3 id="h-nenya-efficient-zksnarks-for-integer-rings-z2kz-via-reverse-multiplication-friendly-embeddings" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Nenya: Efficient zkSNARKs for Integer Rings Z/2kZ via Reverse Multiplication-Friendly Embeddings</h3><ul><li><p>Tianyu Zhang, Nikita Borisov, Yupeng Zhang</p></li><li><p>A zkSNARK for native fixed-width integer arithmetic using reverse multiplication-friendly embeddings.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2672">https://eprint.iacr.org/2026/2672</a></p></li></ul><h3 id="h-improving-code-rate-and-query-complexity-for-the-ligero-iop-system" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Improving Code Rate and Query Complexity for the Ligero-IOP System</h3><ul><li><p>Ignacio Cascudo, Carmit Hazay, Muthu Venkitasubramaniam</p></li><li><p>Sharpens Ligero's soundness analysis and introduces a variant that supports higher Reed–Solomon code rates.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2681">https://eprint.iacr.org/2026/2681</a></p></li></ul><h3 id="h-weir-bounded-memory-indexing-and-proving-with-sequential-storage" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Weir: Bounded-Memory Indexing and Proving with Sequential Storage</h3><ul><li><p>Kyeongtae Lee, Jihye Kim, Hyunok Oh</p></li><li><p>A Shockwave-based prover that uses sequential storage to keep RAM usage low during indexing and proving.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2689">https://eprint.iacr.org/2026/2689</a></p></li></ul><h3 id="h-anamorphic-proofs-of-knowledge-from-prover-randomness" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Anamorphic Proofs of Knowledge from Prover Randomness</h3><ul><li><p>Zhi Lu, Songfeng Lu, Jiaheng Zhang</p></li><li><p>Uses prover randomness to let a public proof also certify knowledge of a hidden witness to a designated verifier.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2706">https://eprint.iacr.org/2026/2706</a></p></li></ul><h3 id="h-authenticated-outsourced-incrementally-verifiable-mpc" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Authenticated Outsourced Incrementally Verifiable MPC</h3><ul><li><p>Hamidreza Khoshakhlagh, Anders Kallesøe, Anders Dalskov</p></li><li><p>Uses incremental proofs and an external prover to let auditors verify state updates and committee rotations in long-running MPC.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2721">https://eprint.iacr.org/2026/2721</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/880d902b9c914d9408cf813b5e05bb29a76ed766b76d8f843f2fa5ddabf6ec8e.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 30 Oct 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-30-oct-2026</link>
            <guid>CdxbE7j3gW7EaMhID6zs</guid>
            <pubDate>Fri, 30 Oct 2026 14:12:35 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover anonymous credentials from standardized signatures, bitwidth-aware SNARKs, Bulletproofs++ range proofs, Reed-Solomon polynomial commitments, and under-constrained circuit diagnostics. We also look at zkVM memory management, AI-assisted auditing and formal verification, post-quantum engineering discussions, and the research path from Nova to Magnetar.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-zkvm-proof-based-general-purpose-computing-with-magnetar" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">zkVM: Proof-based general-purpose computing with Magnetar</h3><ul><li><p>Srinath Setty, Microsoft Research</p></li><li><p>Introduces Magnetar, a RISC-V zkVM built on standard hash functions and binary-field arithmetic, tracing its design through Spartan, memory-checking arguments, and BinarySpartan. Reports average speedups of 10–39× over the compared zkVMs across 15 benchmarks on the same machine, with proof verification around 12 ms. Explains how efficient verification enables recursive composition for long computations.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/">https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/</a></p></li></ul><h3 id="h-lambda-vm-continuations" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Lambda VM: continuations</h3><ul><li><p>Aligned Layer</p></li><li><p>Compares how RISC Zero, OpenVM, SP1, and ZisK split long executions, then explores two approaches to bounding Lambda VM's prover memory. Epochs use local proofs and a global memory-consistency argument; prove-and-retire rebuilds tables across passes to trade computation for lower memory use. Epochs are implemented, while prove-and-retire remains experimental.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.alignedlayer.com/lambda-vm-continuations/">https://blog.alignedlayer.com/lambda-vm-continuations/</a></p></li></ul><h3 id="h-auditing-in-the-age-of-good-enough-ai" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Auditing in the age of (good enough) AI</h3><ul><li><p>Fredrik Dahlgren, Trail of Bits</p></li><li><p>Describes building a decompiler, static analyses, and a Lean execution model to support a Miden zkVM audit. The tools exposed an under-constrained advice value that could enable Falcon signature forgery. AI-assisted formalization also produced 95 correctness proofs covering the core library's binary arithmetic components and helped identify two further implementation bugs.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.trailofbits.com/2026/09/18/auditing-in-the-age-of-good-enough-ai/">https://blog.trailofbits.com/2026/09/18/auditing-in-the-age-of-good-enough-ai/</a></p></li></ul><h3 id="h-better-codes-and-how-they-can-be-worse-if-youre-not-careful" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Better Codes - and how they can be worse if you're not careful</h3><ul><li><p>Kobi Gurkan, zkSecurity</p></li><li><p>Examines an AI-assisted formalization failure in better.codes: when independent Lean replay struggled with an extension-field irreducibility certificate, several agents proposed disabling the replay check. Explains how that bypass breaks the verification boundary and how making the field cardinality explicit resolves the underlying type-equivalence problem without removing the check.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/better-codes/">https://blog.zksecurity.xyz/posts/better-codes/</a></p></li></ul><h3 id="h-ethlambda-at-the-cambridge-workshops-post-quantum-signatures-fast-finality-and-formal-verification" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ethlambda at the Cambridge workshops: post-quantum signatures, fast finality, and formal verification</h3><ul><li><p>LambdaClass</p></li><li><p>Reports technical discussions on post-quantum signature aggregation, hash-function proving costs, and matching Lean specifications to deployed binaries. Also highlights open questions about the security models used for recursive proofs and Fiat-Shamir, alongside experience scaling leanConsensus devnets from 32 to 4,096 validators.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.lambdaclass.com/ethlambda-at-the-cambridge-workshops-post-quantum-signatures-fast-finality-and-formal-verification/">https://blog.lambdaclass.com/ethlambda-at-the-cambridge-workshops-post-quantum-signatures-fast-finality-and-formal-verification/</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-from-nova-to-magnetar-three-years-of-research-with-srinath-setty" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">From Nova to Magnetar: Three Years of Research with Srinath Setty</h3><ul><li><p>ZK Podcast, Episode 415; Srinath Setty</p></li><li><p>An October 28 conversation tracing work from Spartan and Nova through lattice-based folding, identity proofs, lookups, and memory checking. Setty explains Magnetar's hash-based zkVM design, the sources of its performance gains, and what remains to build, adding context to the paper covered in an earlier issue.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/podcast/415/">https://zeroknowledge.fm/podcast/415/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-faster-and-smaller-anonymous-credentials-from-standardized-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Faster and Smaller Anonymous Credentials from Standardized Signatures</h3><ul><li><p>Chad Sharp, Paul Grubbs</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Introduces GordieHowe, combining multi-field ZK proofs for ECDSA-, RSA-, and ML-DSA-based credentials with Lean-certified compiler optimizations and machine-checked proof-system security theorems. Reports an ECDSA-signed mobile driving license presentation in 64.8 ms on four cores with a 276 KiB proof. Extends BCS to series-parallel IOPs, analyzing knowledge soundness, zero knowledge, and a form of simulation extractability in the QROM.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2615">https://eprint.iacr.org/2026/2615</a></p></li></ul><h3 id="h-mikros-bitwidth-aware-snarks-over-extensions-of-small-fields" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Mikros: Bitwidth-Aware SNARKs over Extensions of Small Fields</h3><ul><li><p>Mingshu CONG</p></li><li><p>Packs small-field vectors into extension-field elements to make inner-product proofs, Hadamard-product proofs, polynomial commitments, and permutation arguments bitwidth-aware without requiring binary fields. On batches of 256 SHA-256 compressions, Keccak permutations, and BLAKE3 compressions, reports prover speedups of 2.19×, 2.55×, and 1.85× over Flock, respectively. </p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2646">https://eprint.iacr.org/2026/2646</a></p></li></ul><h3 id="h-notes-on-bulletproofs-range-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Notes on BulletProofs++ Range Proofs</h3><ul><li><p>Philipp Jovanovic, Arnab Roy</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Gives a self-contained specification of 64-bit and general batched range proofs, with honest-verifier zero knowledge and exact-form knowledge soundness. Its Rust implementation over Ristretto255 reports proving and verification speedups of up to 7.8× and 4.5× over regular Bulletproofs. Also corrects two formulas in the original Bulletproofs++ paper. </p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2648">https://eprint.iacr.org/2026/2648</a></p></li></ul><h3 id="h-reedweave-faster-reed-solomon-polynomial-commitments-from-interleaving-and-folding" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ReedWeave: Faster Reed-Solomon Polynomial Commitments from Interleaving and Folding</h3><ul><li><p>Yuhao Jia, Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, Jielong Zhang</p></li><li><p>Combines interleaved Reed-Solomon encoding with an initial higher-arity fold to reduce early prover work while retaining polylogarithmic verification. Its Rust benchmark over Goldilocks uses 32 threads and targets 100-bit security; at degree 2^24, the reported proof is 594.7 KiB, smaller than FRI's but larger than STIR's. </p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2147">https://eprint.iacr.org/2026/2147</a></p></li></ul><h3 id="h-jacobian-diagnostics-for-under-constrained-zero-knowledge-circuits" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Jacobian Diagnostics for Under-Constrained Zero-Knowledge Circuits</h3><ul><li><p>Vijaykumar Singh</p></li><li><p>Uses exact Jacobian linear algebra to detect and localize potential freedom in security-relevant circuit wires, with experiments on R1CS and PLONKish standard-gate systems. Separates local infinitesimal freedom from finite-field non-uniqueness and provides certificates under stated conditions. Shows why honest witnesses can miss defects exposed by adversarial witnesses, positioning the method as a candidate detector paired with confirmation. </p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1852">https://eprint.iacr.org/2026/1852</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/880d902b9c914d9408cf813b5e05bb29a76ed766b76d8f843f2fa5ddabf6ec8e.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 23 Oct 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-23-oct-2026</link>
            <guid>LBiI4UHq0aYHjqjaqAWC</guid>
            <pubDate>Fri, 23 Oct 2026 12:54:35 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we look at the engineering and security tradeoffs behind zkVM optimization, post-quantum signature aggregation, transcript specifications, and recursive privacy proofs. We also cover ZK tooling, proof provenance, integer SNARKs, verifiable FHE, VOLE, and private inference, with research on binary-field proximity gaps providing important context.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-optimizing-the-monad-client-for-zkvm-execution" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Optimizing the Monad Client for zkVM Execution</h3><ul><li><p>Anne-Laure Schmitt, Bruce Collie, Samuel Balco, Category Labs</p></li><li><p>Shows why native CPU optimizations can backfire inside a zkVM: doubling hash-table bucket fields to aligned 64-bit words reduces ZisK's proving cost, while selective Keccak memoization avoids caching one-off work. Also discusses adversarial collisions in cheap hash functions. Reports 57% lower COST than its initial implementation and 17% lower median proving time than ziskethone on 30 blocks with an RTX 5090; benchmark checks and manual review do not yet provide formal correctness guarantees.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.category.xyz/blogs/optimizing-the-monad-client-for-zkvm-execution">https://www.category.xyz/blogs/optimizing-the-monad-client-for-zkvm-execution</a></p></li></ul><h3 id="h-fast-post-quantum-signature-aggregation-with-lattice-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Fast post-quantum signature aggregation with lattice SNARKs</h3><ul><li><p>Alberto Centelles, Quang Dao, Justin Thaler, Markos Georghiades, Michael Zhu, Andrew Tretyakov</p></li><li><p>Aerie pairs Falcon signatures with the Akita lattice PCS, offering an alternative to hash-based signature aggregation. Its M4 Max benchmark aggregates 32,768 Falcon-512 signatures in 645 ms with 16 threads; verification takes 53.6 ms on one thread. The important distinction is proof size versus transmitted data: per-signature salts bring the aggregate to 1,346 KiB, excluding public keys and messages. Common-salt mode reduces this to 66 KiB but requires a different signer and an additional unforgeability assumption. This is a research implementation; zero knowledge is not claimed.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.a16zcrypto.com/posts/article/fast-post-quantum-signature-aggregation-with-lattice-snarks">https://www.a16zcrypto.com/posts/article/fast-post-quantum-signature-aggregation-with-lattice-snarks</a></p></li><li><p>Code and benchmark details: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/a16z/aerie">https://github.com/a16z/aerie</a></p></li></ul><h3 id="h-longfellow-zk-draft-irtf-cfrg-longfellow-00" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Longfellow ZK (draft-irtf-cfrg-longfellow-00)</h3><ul><li><p>Matteo Frigo, abhi shelat</p></li><li><p>The new CFRG research-group draft specifies a Ligero-based ZK system with sumcheck. Its engineering value lies in the details implementations must agree on: typed, prefix-free transcript encoding, hash-and-expand state transitions, and challenge sampling without replacement. Useful for studying how protocol descriptions become interoperable implementations; this remains an Internet-Draft, not a finalized RFC.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://datatracker.ietf.org/doc/draft-irtf-cfrg-longfellow/">https://datatracker.ietf.org/doc/draft-irtf-cfrg-longfellow/</a></p></li></ul><h3 id="h-paranoid-eip-8288-heterogeneous-recursion-with-an-authenticated-class-bank" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Paranoid EIP-8288: heterogeneous recursion with an authenticated class bank</h3><ul><li><p>ignotusnemo, Ethereum Research</p></li><li><p>Explores whether small and large recursive workloads can use different proof configurations instead of sharing one largest-size relation. An authenticated verifier-class bank carries a separate accumulator lane per class, trading flexibility for public state and terminal verification work that grow with the class count. The implementation follows one parent per step; merging multiple children and accounting for their dependencies remain open work for EIP-8288 aggregation.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/paranoid-eip-8288-heterogeneous-recursion-with-an-authenticated-class-bank/26170">https://ethresear.ch/t/paranoid-eip-8288-heterogeneous-recursion-with-an-authenticated-class-bank/26170</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-zkgolf-ai-clean-and-optimising-zk-circuits-with-zksecurity" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">zkGolf: AI, Clean and Optimising ZK Circuits with zkSecurity</h3><ul><li><p>ZK Podcast, Episode 414; Mathias Hall-Andersen and Giorgio Dell'Immagine</p></li><li><p>Discusses AI-assisted circuit optimization through zkGolf and Clean, a Lean framework for writing and verifying circuits. Covers the SHA-256 optimization experiment, competition exploits, and what formally checked circuit development could mean for ZK engineering and audits.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/podcast/414/">https://zeroknowledge.fm/podcast/414/</a></p></li><li><p>Clean: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/Verified-zkEVM/clean/">https://github.com/Verified-zkEVM/clean/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-counterexamples-to-beyond-johnson-proximity-gaps-over-binary-fields" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Counterexamples to Beyond-Johnson Proximity Gaps over Binary Fields</h3><ul><li><p>Quang Dao, Scott Duke Kominers, Justin Thaler, Kai Zhe Zheng</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Gives Lean-verified counterexamples showing that beyond-Johnson proximity-gap results in large characteristic do not extend to binary fields. Covers domains used by Binius64, LeanVM, and Flock, with concrete limits on the soundness of a single proximity-gap check. Important when evaluating proposed proof-size reductions; these counterexamples constrain security analyses rather than establishing a break of every system using those domains.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eccc.weizmann.ac.il/report/2026/237/">https://eccc.weizmann.ac.il/report/2026/237/</a></p></li></ul><h3 id="h-zippel-a-language-compiler-runtime-and-analyzer-for-zk-proof-systems" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Zippel: A Language, Compiler, Runtime, and Analyzer for ZK Proof Systems</h3><ul><li><p>Sebastian Angel, Sydnie-Shea Cohen, Eleftherios Ioannidis, Pratyush Mishra, Alex Ozdemir, Yuxiang Qiu, Alireza Shirzad</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Compiles a unified protocol description into prover and verifier code, managing transcripts and Fiat-Shamir automatically; implements 35 proof systems. Its static analyses check completeness and special soundness at fixed parameter sizes, with current limitations including no automatic certification of zero knowledge or general knowledge soundness.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2517">https://eprint.iacr.org/2026/2517</a></p></li><li><p>Code: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/eniac/zippel">https://github.com/eniac/zippel</a></p></li></ul><h3 id="h-watermarking-proofs-with-provenance-binding-zk-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Watermarking Proofs with Provenance-Binding ZK-SNARKs</h3><ul><li><p>Wenhao Wang, Fan Zhang, Charalampos Papamanthou</p></li><li><p>Shows that inserting prover identity and a request nonce into Fiat-Shamir challenges can still permit precomputation attacks against proof provenance. Formalizes the requirement to perform fresh proving work and constructs provenance-binding SNARKs from code-based polynomial commitments, including BaseFold and FRI.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2516">https://eprint.iacr.org/2026/2516</a></p></li></ul><h3 id="h-regular-syndrome-decoding-is-easier-than-previously-estimated" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Regular Syndrome Decoding Is Easier Than Previously Estimated</h3><ul><li><p>Jiseung Kim, Minkyu Kim, Changmin Lee, Hochang Lee</p></li><li><p>Refines hybrid algebraic attacks on regular syndrome decoding by coordinating guesses and variable elimination across blocks. Reports below-target security estimates for selected parameter sets used in Ferret, Wolverine, and committed VOLE, making this relevant to concrete parameter choices for code-based ZK and correlation-generation protocols.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2563">https://eprint.iacr.org/2026/2563</a></p></li></ul><h3 id="h-firebolt-fast-lightweight-malicious-non-interactive-vector-ole" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Firebolt: Fast, Lightweight, Malicious Non-Interactive Vector-OLE</h3><ul><li><p>Michael Adjedj, Geoffroy Couteau, Nikolaos Makriyannis</p></li><li><p>Builds maliciously secure non-interactive VOLE from a Paillier-based construction, reporting 535 bytes per entry and about 5 ms per party in single-threaded experiments. Applications include concurrently secure two-round two-party ECDSA; the paper also develops proofs of plaintext shortness for Paillier ciphertexts and integer commitments.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2549">https://eprint.iacr.org/2026/2549</a></p></li></ul><h3 id="h-off-key-inconsistent-mac-keys-compromise-privacy-in-spdz-family-mpc" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Off-Key: Inconsistent MAC Keys Compromise Privacy in SPDZ-Family MPC</h3><ul><li><p>Marcel Keller, Sela Navot, Nirvan Tyagi</p></li><li><p>Shows how inconsistent global MAC keys across preprocessing batches, threads, or process runs can expose secrets through authentication checks. Demonstrates the issue in evaluated versions of MP-SPDZ, SCALE-MAMBA, and FANNG-MPC, and identifies state that implementations must preserve to enforce the protocols' key-consistency requirement.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2533">https://eprint.iacr.org/2026/2533</a></p></li></ul><h3 id="h-optimal-proofs-of-sequential-work" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Optimal Proofs of Sequential Work</h3><ul><li><p>Krzysztof Pietrzak, Leonid Reyzin</p></li><li><p>Proves communication lower bounds for efficient graph-labeling-based proofs of sequential work and gives a matching construction with maximum indegree two. Reduces the honest prover's total hash-input complexity from O(T log T) to O(T), while retaining asymptotically optimal communication and verifier hash-input complexity in this setting.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2569">https://eprint.iacr.org/2026/2569</a></p></li></ul><h3 id="h-laminate-succinct-simd-friendly-verifiable-fhe" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Laminate: Succinct SIMD-Friendly Verifiable FHE</h3><ul><li><p>Kabir Peshawaria, Zeyu Liu, Ben Fisch, Eran Tromer</p></li><li><p>The revision adds a C++ implementation and replaces performance estimates with measured server, proof-size, and client costs. Combines blind interactive proofs with GKR to preserve BGV/BFV SIMD computation while adding integrity; one evaluated variant incurs 21–33× server overhead and 52–54 MB proofs.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2025/2285">https://eprint.iacr.org/2025/2285</a></p></li></ul><h3 id="h-limber-low-overhead-snarks-for-integers-from-any-pcs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Limber: Low Overhead SNARKs for Integers from Any PCS</h3><ul><li><p>Jessica Chen, Lucas Xia, Wilson Nguyen, Benedikt Bünz</p></li><li><p>Builds integer SNARKs through an integer polynomial commitment that supports evaluations modulo a prime chosen after commitment. The reported implementation proves an RSA accumulator benchmark 15–30× faster than circuit-based approaches and non-native Poseidon2 hashing 24× faster.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1635">https://eprint.iacr.org/2026/1635</a></p></li></ul><h3 id="h-argo-leaking-a-secret-from-an-invalid-groth16-proof" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Argo: Leaking a Secret from an Invalid Groth16 Proof</h3><ul><li><p>Liam Eagen, Ying Tong Lai</p></li><li><p>Encodes Groth16 proof invalidity so that a decoder can recover a designated secret when the proof is invalid. Combines this mechanism with projective garbling and BitVM for permissionless optimistic verification on Bitcoin, with about 21 kB of offline encoding in its BN254 instantiation.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2165">https://eprint.iacr.org/2026/2165</a></p></li></ul><h3 id="h-dpa-style-attacks-on-vole-in-the-head-signature-schemes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">DPA-style Attacks on VOLE-in-the-Head Signature Schemes</h3><ul><li><p>Jinnuo Li, Shu Han, Yunyan Zou, Fan Zhang, Puwen Wei, Weijia Wang, Hao Cheng</p></li><li><p>Studies leakage of the secret witness through VOLE-correlation computations in FAEST and SDitH. Proposes six classes of differential power-analysis attacks, validated with simulated leakage and measurements on three ARM Cortex-M4 devices, highlighting implementation risks for signatures built from ZK techniques.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2519">https://eprint.iacr.org/2026/2519</a></p></li></ul><h3 id="h-enjoy-faest-on-hardware-efficient-and-novel-hardware-acceleration-of-emerging-post-quantum-digital-signature-scheme-faest" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Enjoy FAEST on Hardware: Efficient and Novel Hardware Acceleration of Emerging Post-Quantum Digital Signature Scheme FAEST</h3><ul><li><p>Brendan Funk, Jiafeng Xie</p></li><li><p>Presents an FPGA accelerator for FAEST, optimizing its dominant operations and their scheduling, including a dedicated L1-EM-fast design. Evaluates hardware cost and latency against existing signature accelerators; its fast variant reports at least 98% lower equivalent area-delay product than the compared complete SDitH design at the same security level.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2525">https://eprint.iacr.org/2026/2525</a></p></li></ul><h3 id="h-evasive-inner-product-functional-encryption-is-broken-too" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Evasive Inner Product Functional Encryption Is Broken Too</h3><ul><li><p>Shweta Agrawal, Anuja Modi, Anshu Yadav, Shota Yamada</p></li><li><p>Gives a counterexample to the full evasive inner-product functional-encryption assumption of Hsieh, Lin, and Luo. Extends earlier attacks on pseudorandom functional encryption to the weaker inner-product setting, showing that the adversary's freedom to choose private coins remains a critical issue in these evasive-LWE assumptions.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2548">https://eprint.iacr.org/2026/2548</a></p></li></ul><h3 id="h-io-from-lwe-with-structured-preimage" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">iO from LWE with Structured Preimage</h3><ul><li><p>Shweta Agrawal, Anuja Modi, Anshu Yadav, Shota Yamada</p></li><li><p>Constructs indistinguishability obfuscation from a new instance-independent, falsifiable, non-interactive lattice assumption involving LWE samples and a carefully structured short Gaussian matrix. The result relies on this additional assumption, with cryptanalysis informed by attacks on evasive LWE.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2547">https://eprint.iacr.org/2026/2547</a></p></li></ul><h3 id="h-new-ind-cpa-d-attacks-on-bfv-and-bgv" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">New IND-CPA-D Attacks on BFV and BGV</h3><ul><li><p>Hyeongmin Choe, Minsik Kang, Damien Stehlé</p></li><li><p>Examines FHE security when computation results are exposed, targeting parameter choices justified by heuristic correctness bounds. Gives bootstrapping-failure and noise/mask-skewing attacks, with experiments in HElib and OpenFHE; a BFV key-recovery attack takes minutes to hours for the tested parameters.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2546">https://eprint.iacr.org/2026/2546</a></p></li></ul><h3 id="h-homomorphic-encryption-for-high-precision-arithmetic-of-approximate-numbers" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Homomorphic Encryption for High-precision Arithmetic of Approximate Numbers</h3><ul><li><p>Shihe Ma, Jiaming Liu, Anyu Wang, Xiaoyun Wang</p></li><li><p>Proposes Generalized CKKS, trading SIMD slots for lower modulus consumption through a new encoding of high-precision values. Reports seven levels at 1,000-bit precision with ring dimension 2^14 and multiplications below 30 ms in its experiments, with applications to retaining precision after noise flooding.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2524">https://eprint.iacr.org/2026/2524</a></p></li></ul><h3 id="h-membership-inference-in-privacy-preserving-vector-search" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Membership Inference in Privacy-Preserving Vector Search</h3><ul><li><p>Georg Fuchsbauer, Carter Luck, Adam O'Neill, Ian Rapko</p></li><li><p>Studies membership leakage in vector protections that preserve compatibility with existing search backends. Breaks Scale-and-Perturb without known plaintexts, analyzes how geometry leakage interacts with linked known plaintexts, and evaluates mitigations such as shuffling and secret projection.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2570">https://eprint.iacr.org/2026/2570</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 16 Oct 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-16-oct-2026</link>
            <guid>dcbWCqRIFFGjsiiqqHkw</guid>
            <pubDate>Fri, 16 Oct 2026 12:23:40 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover Aztec's post-quantum roadmap, cryptographic package integrity, Lean proof guarantees, useful proof of work, reusable execution proofs, post-quantum proof verification and account keys, private stablecoins, distributed key generation, Magnetar, asynchronous threshold FHE, Bitcoin vaults, private face recognition, post-quantum secure aggregation, efficient edabits, inclusion proofs, and private Transformer inference benchmarks.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-post-quantum-aztec" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Post-Quantum Aztec</h3><ul><li><p>Zac Williamson, Mike Connor</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Distinguishes protecting today's private data against harvest-now-decrypt-later attacks from a full post-quantum migration, with a 2030 migration target spanning proving, authentication, encryption, and Ethereum settlement.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://aztec.network/blog/post-quantum-aztec">https://aztec.network/blog/post-quantum-aztec</a></p></li></ul><h3 id="h-package-managers-have-an-integrity-problem" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Package managers have an integrity problem</h3><ul><li><p>Keegan Ryan, Trail of Bits</p></li><li><p>Tests 25 package managers against compromised repositories and examines why hashes, signatures, and lockfiles do not always translate into effective integrity checks.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.trailofbits.com/2026/10/14/package-managers-have-an-integrity-problem/">https://blog.trailofbits.com/2026/10/14/package-managers-have-an-integrity-problem/</a></p></li></ul><h3 id="h-when-the-natural-language-paper-and-the-lean-proof-disagree" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">When the Natural-Language Paper and the Lean Proof Disagree</h3><ul><li><p>Zero Knowledge Podcast</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>A discussion of what Lean verification guarantees when formal and natural-language proofs differ, and why theorem statements, definitions, and the correspondence between proofs still need review.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.substack.com/p/when-the-natural-language-paper-and">https://zeroknowledge.substack.com/p/when-the-natural-language-paper-and</a></p></li></ul><h3 id="h-how-llms-might-make-crypto-mining-useful" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How LLMs might make crypto mining useful</h3><ul><li><p>Byron Gilliam, Blockworks</p></li><li><p>Explores Pearl's matrix-multiplication-based proof of useful work, including the distinction between proving computation and proving that it served a useful AI workload.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mail.blockworks.com/p/how-llms-might-make-crypto-mining-useful">https://mail.blockworks.com/p/how-llms-might-make-crypto-mining-useful</a></p></li></ul><h3 id="h-proof-of-useful-work-for-verifying-ai-treaties" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Proof of useful work for verifying AI treaties</h3><ul><li><p>Ondrej Kubu</p></li><li><p>Reviews software-based compute verification and the missing link between proving how much work a GPU performed and proving that it ran the declared model.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://kubuondr.substack.com/p/proof-of-useful-work-for-verifying">https://kubuondr.substack.com/p/proof-of-useful-work-for-verifying</a></p></li></ul><h2 id="h-research-discussions" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Research Discussions</h2><h3 id="h-rapidblocks-with-split-proofs-execution-proofs-that-outlive-their-state" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Rapidblocks with split proofs: execution proofs that outlive their state</h3><ul><li><p>cskiraly, Ethereum Research</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Splits execution proofs from input/output state-binding proofs so that unrelated state changes need not trigger reproving. An exploratory design with small-model checks, without a full proof or performance evaluation yet.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/rapidblocks-with-split-proofs-execution-proofs-that-outlive-their-state/26157">https://ethresear.ch/t/rapidblocks-with-split-proofs-execution-proofs-that-outlive-their-state/26157</a></p></li></ul><h3 id="h-erc-8403-an-account-as-one-hash-and-post-quantum-keys" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ERC-8403: an account as one hash, and post-quantum keys</h3><ul><li><p>AnkushinDaniil, Ethereum Research</p></li><li><p>Uses a Merkle root to manage account authorities and explores key rotation and post-quantum migration without changing the address. Includes a demo; the account demo uses classical keys, and the full post-quantum integration remains incomplete.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/erc-8403-an-account-as-one-hash-and-post-quantum-keys/26147">https://ethresear.ch/t/erc-8403-an-account-as-one-hash-and-post-quantum-keys/26147</a></p></li></ul><h3 id="h-private-stablecoin-on-ethereum" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Private Stablecoin on Ethereum</h3><ul><li><p>JiangXb-son, Ethereum Research</p></li><li><p>Proposes private stablecoins backed by USDC/USDT with contract-enforced minting and redemption, selective disclosure, and private DeFi applications. The discussion links to the full proposal paper.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/private-stablecoin-on-ethereum/26140">https://ethresear.ch/t/private-stablecoin-on-ethereum/26140</a></p></li></ul><h3 id="h-exposing-an-isa-for-post-quantum-proofs-on-ethereum" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Exposing an ISA for post-quantum proofs on Ethereum</h3><ul><li><p>soispoke, Ethereum Research</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Explores EIP-8288 proof dependencies verified outside the EVM and the tradeoffs between RISC-V, EVM, and dedicated instruction sets. First posted October 8, with follow-up discussion on October 12.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/exposing-an-isa-for-post-quantum-proofs-on-ethereum/26136">https://ethresear.ch/t/exposing-an-isa-for-post-quantum-proofs-on-ethereum/26136</a></p></li></ul><h2 id="h-talks-and-resources" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Talks and Resources</h2><h3 id="h-tortl-dkg-two-round-trustless-distributed-key-generation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">TORTL DKG: Two-Round Trustless Distributed Key Generation</h3><ul><li><p>Florian Le Mouël, NIST TCPT3</p></li><li><p>An October 13 presentation covering elliptic-curve and module-lattice DKG variants, using secret sharing and zero-knowledge proofs to check correctness. The official page provides an abstract and a technical writeup; a recording link has not been confirmed.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://csrc.nist.gov/presentations/2026/tcpt3-4b1">https://csrc.nist.gov/presentations/2026/tcpt3-4b1</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-magnetar-high-speed-post-quantum-rv64-zkvm-from-standard-hashes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Magnetar: High-speed post-quantum RV64 zkVM from standard hashes</h3><ul><li><p>Srinath Setty</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>A transparent RV64I proof system based on standard hashes such as SHA-256 and SHA-3, with BinarySpartan enabling efficient recursion. First submitted October 9 and revised October 15.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2423">https://eprint.iacr.org/2026/2423</a></p></li><li><p>Official introduction: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/">https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/</a></p></li></ul><h3 id="h-tulva-practical-asynchronous-threshold-fhe" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Tulva: Practical Asynchronous Threshold FHE</h3><ul><li><p>Valerio Cini, Antonio Guimarães, Russell W. F. Lai, Michał Osadnik, Ivy K. Y. Woo</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Enables threshold decryption without requiring participants to coordinate or be online simultaneously, with an implementation and evaluations for privacy-preserving EVM use cases.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2485">https://eprint.iacr.org/2026/2485</a></p></li></ul><h3 id="h-trustless-bitcoin-vaults" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Trustless Bitcoin Vaults</h3><ul><li><p>Lukas Aumayr, Xinshu Dong, Runchao Han, Srivatsan Sridhar, David Tse, Nikhil Vanjani</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Constructs vaults for collateral-based applications where withdrawals follow application contract logic without trusting a third party, including an Aave v4 lending example. First submitted October 14 and revised October 15.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2466">https://eprint.iacr.org/2026/2466</a></p></li></ul><h3 id="h-ghostfacempc-privacy-preserving-face-recognition-with-multi-party-computation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">GhostFaceMPC: Privacy-Preserving Face Recognition with Multi-Party Computation</h3><ul><li><p>Davide Carnemolla, Dario Catalano, Mario Di Raimondo</p></li><li><p>Covers facial feature extraction and matching under MPC without exposing raw images or biometric embeddings, using model quantization and circuit optimizations with open-source code.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2499">https://eprint.iacr.org/2026/2499</a></p></li></ul><h3 id="h-secagg-a-post-quantum-privacy-preserving-federated-learning-protocol" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SecAgg++: A Post-Quantum Privacy Preserving Federated Learning Protocol</h3><ul><li><p>Alessandro Perez, Giulia Cavicchioni, Silvio Cretti, Riccardo Longo, Alessandro Tomasi, Silvio Ranise</p></li><li><p>Integrates post-quantum primitives into single-server secure aggregation while preserving efficiency and supporting recovery when clients drop out.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2497">https://eprint.iacr.org/2026/2497</a></p></li></ul><h3 id="h-edabits-generation-with-quasi-linear-communication-complexity" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Edabits Generation with Quasi-Linear Communication Complexity</h3><ul><li><p>Alexander Bienstock, Daniel Escudero, Qijia Fan, Fengrun Liu, Yifan Song</p></li><li><p>Reduces edabit generation communication from quadratic to quasi-linear when a constant fraction of parties are honest, improving building blocks for MPC comparison, truncation, and bit decomposition.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2482">https://eprint.iacr.org/2026/2482</a></p></li></ul><h3 id="h-flatmerkle-logarithmic-space-inclusion-proofs-over-a-single-linear-hash-stream" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">FlatMerkle: Logarithmic-Space Inclusion Proofs over a Single Linear Hash Stream</h3><ul><li><p>Sergio Demian Lerner</p></li><li><p>Supports logarithmic-size inclusion proofs over a single linear hash stream, with applications to Bitcoin transaction annexes, data availability, and cross-chain cost comparisons.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2468">https://eprint.iacr.org/2026/2468</a></p></li></ul><h3 id="h-a-graph-based-analysis-of-comparability-scale-and-attribution-in-private-transformer-inference" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Graph-Based Analysis of Comparability, Scale, and Attribution in Private Transformer Inference</h3><ul><li><p>Souvik Das, Ariful Azad, Nitesh Saxena</p></li><li><p>Analyzes 62 private Transformer inference systems; only one of 1,891 candidate system pairs is directly comparable under shared assumptions, highlighting pitfalls in performance comparisons.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2464">https://eprint.iacr.org/2026/2464</a></p></li></ul><h3 id="h-heterogeneous-cpu-npu-implementation-of-the-aimer-post-quantum-signature-for-low-latency-on-a-mobile-soc" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Heterogeneous CPU–NPU Implementation of the AIMer Post-Quantum Signature for Low Latency on a Mobile SoC</h3><ul><li><p>Myoungsu Shin, Jihoon Jang, Hanbeom Shin, Insung Kim, Dongjae Lee, Donggeun Kwon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2486">https://eprint.iacr.org/2026/2486</a></p></li></ul><h3 id="h-robust-ecdsa-threshold-signing-at-scale" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Robust ECDSA Threshold Signing at Scale</h3><ul><li><p>Carsten Baum, Anders Dalskov</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2493">https://eprint.iacr.org/2026/2493</a></p></li></ul><h3 id="h-speeding-up-sumcheck-using-algebraic-geometry" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Speeding up Sumcheck using Algebraic Geometry</h3><ul><li><p>Rahul Dalal, Benedikt Bunz, Tamir Hemo, Ron D. Rothblum</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2494">https://eprint.iacr.org/2026/2494</a></p></li></ul><h3 id="h-issuer-independent-decentralized-exchange-for-e-cash" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Issuer-Independent Decentralized Exchange for E-Cash</h3><ul><li><p>Roozbeh Sarenche, Omid Mirzamohammadi</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2495">https://eprint.iacr.org/2026/2495</a></p></li></ul><h3 id="h-tenseup-doubly-efficient-lookup-arguments-from-tensor-codes-and-applications-to-dynamic-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">TenseUp: Doubly-Efficient Lookup Arguments from Tensor Codes and Applications to Dynamic SNARKs</h3><ul><li><p>Christodoulos Pappas, Pariya Akhiani, Yupeng Zhang, Dimitrios Papadopoulos</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2435">https://eprint.iacr.org/2026/2435</a></p></li></ul><h3 id="h-censorship-resistance-in-credential-systems-and-application-to-the-eudi-wallet" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Censorship Resistance in Credential Systems and Application to the EUDI Wallet</h3><ul><li><p>Pierpaolo Della Monica, Ivan Visconti, Andrea Vitaletti, Marco Zecchini</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2438">https://eprint.iacr.org/2026/2438</a></p></li></ul><h3 id="h-a-black-box-compiler-from-static-to-dynamic-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Black-Box Compiler from Static to Dynamic SNARKs</h3><ul><li><p>Anubhav Baweja, Charalampos Papamanthou</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2445">https://eprint.iacr.org/2026/2445</a></p></li></ul><h3 id="h-cuts-chained-uniform-sum-tree-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">CUTS: Chained Uniform-sum Tree Signatures</h3><ul><li><p>Jamie Judd, Louis Tajan, Conor Deegan, Furkan Akal</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2455">https://eprint.iacr.org/2026/2455</a></p></li></ul><h3 id="h-secret-sharing-from-non-extractable-randomness" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Secret Sharing from Non-Extractable Randomness</h3><ul><li><p>Divesh Aggarwal</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2477">https://eprint.iacr.org/2026/2477</a></p></li></ul><h3 id="h-witness-succinct-uc-secure-snarks-with-weaker-trust-assumptions" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Witness-Succinct UC-Secure SNARKs with Weaker Trust Assumptions</h3><ul><li><p>Nahid Roustaeifar, Maryam Zarezadeh, Neel Mehendale, Behzad Abdolmaleki, Mahshid Delavar, Stefan Köpsell</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2434">https://eprint.iacr.org/2026/2434</a></p></li></ul><hr><br><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 9 Oct 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-9-oct-2026</link>
            <guid>sJwxfMvy3hZIa7LWXQcc</guid>
            <pubDate>Fri, 09 Oct 2026 11:05:27 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover private API payments, Zcash's post-quantum research, Bitcoin privacy, formal verification audits, secure multihashing, TEE and MPC security, zkML, AI-assisted research, quantum computing hardware, lattice isomorphism, Fiat-Shamir proofs of work, MIPS32 execution proofs, time-space tradeoffs, FHE-based MPC, secure shuffles, oblivious message retrieval, lattice sieving, and SNARKs over power-of-two rings.</p><h2 id="h-news" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">News</h2><h3 id="h-introducing-zkapi-private-usage-credits-for-any-api" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Introducing zkAPI: private usage credits for any API</h3><ul><li><p>Vittorio Rivabella, Ethereum Foundation dAI Team</p></li><li><p>Highlights: Uses ZK proofs to separate API usage from billing identity; payment privacy does not hide request contents or network metadata.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.ethereum.org/en/2026/10/01/introducing-zkapi">https://blog.ethereum.org/en/2026/10/01/introducing-zkapi</a></p></li></ul><h3 id="h-epoch-future-proof-cryptography-for-zcash" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Epoch: Future-Proof Cryptography for Zcash</h3><ul><li><p>Jason McGee, Shielded Labs</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Combines post-quantum cryptography and formal verification to strengthen Zcash, starting with research and design.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://shieldedlabs.net/epoch-future-proof-cryptography-for-zcash/">https://shieldedlabs.net/epoch-future-proof-cryptography-for-zcash/</a></p></li></ul><h3 id="h-citrea-acquires-crest-to-bring-zcash-style-privacy-to-bitcoin" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Citrea Acquires Crest to Bring Zcash-Style Privacy to Bitcoin</h3><ul><li><p>Citrea Team</p></li><li><p>Brings a private wallet into the Citrea ecosystem, with plans for auto-shielding, private BTC transfers, and cross-chain swaps.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.blog.citrea.xyz/citrea-acquires-crest-to-bring-zcash-style-privacy-to-bitcoin/">https://www.blog.citrea.xyz/citrea-acquires-crest-to-bring-zcash-style-privacy-to-bitcoin/</a></p></li></ul><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-checking-the-checkers-and-auditing-the-ironwood-fv" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Checking the Checkers and Auditing the Ironwood FV</h3><ul><li><p>Mathias Hall-Andersen, zkSecurity</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Examines how to audit formal verification itself, including security definitions, unintended assumptions, and correspondence with deployed implementations.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/auditing-formal-verifications/">https://blog.zksecurity.xyz/posts/auditing-formal-verifications/</a></p></li></ul><h3 id="h-sequencehash-multihashing-for-the-rest-of-us" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SequenceHash: multihashing for the rest of us</h3><ul><li><p>Opal Wright, Trail of Bits</p></li><li><p>Prevents ambiguous input encodings when hashing multiple values, with support for several hash functions and Rust, Go, and Python implementations.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.trailofbits.com/2026/10/02/sequencehash-multihashing-for-the-rest-of-us/">https://blog.trailofbits.com/2026/10/02/sequencehash-multihashing-for-the-rest-of-us/</a></p></li></ul><h3 id="h-dont-let-tees-break-your-mpc" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Don't let TEEs break your MPC</h3><ul><li><p>Paul Bottinelli, Trail of Bits</p></li><li><p>Explains how TEE rollback attacks can trigger nonce reuse in threshold signatures and leak private key shares.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.trailofbits.com/2026/09/25/dont-let-tees-break-your-mpc/">https://blog.trailofbits.com/2026/09/25/dont-let-tees-break-your-mpc/</a></p></li></ul><h3 id="h-up-25x-can-zcash-flip-bitcoin" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Up 25x: Can Zcash flip Bitcoin?</h3><ul><li><p>Jake Koch-Gallup, Blockworks</p></li><li><p>A market opinion piece examining Zcash's privacy premium, shielded usage, and competition from privacy applications on other chains.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mail.blockworks.com/p/cash">https://mail.blockworks.com/p/cash</a></p></li></ul><h3 id="h-fiat-shamir-bugs-how-one-missing-line-breaks-a-proof-system" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Fiat-Shamir Bugs: How One Missing Line Breaks a Proof System</h3><ul><li><p>Giap Vu, David Wong, zkSecurity</p></li><li><p>Shows how missing transcript bindings enable proof forgery, with audit examples involving public inputs, verification keys, and batching.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/fiat-shamir/">https://blog.zksecurity.xyz/posts/fiat-shamir/</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-proof-is-in-the-pudding-11-zkml" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Proof is in the Pudding #11: zkML</h3><ul><li><p>Archetype x zkSecurity</p></li><li><p>Connects transformer inference to sumcheck, GKR, lookups, quantization, and KV caching, explaining the bottlenecks in practical zkML.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://youtu.be/yaqDe1yXvjA">https://youtu.be/yaqDe1yXvjA</a></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/pudding-11-zkml/">https://blog.zksecurity.xyz/posts/pudding-11-zkml/</a></p></li></ul><h3 id="h-auto-research-on-yukon-with-soubhik-deb" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Auto Research on Yukon with Soubhik Deb</h3><ul><li><p>ZK Podcast, Episode 411</p></li><li><p>Explores collaborative AI research through ECDSA.fail, SNARK.fast, and better.codes, emphasizing well-defined problems and reliable verifiers.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/podcast/411/">https://zeroknowledge.fm/podcast/411/</a></p></li></ul><h3 id="h-exploring-the-lasers-that-power-quantum-computers" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Exploring the Lasers that Power Quantum Computers</h3><ul><li><p>ZK Podcast, Episode 413</p></li><li><p>Examines laser systems and optical scaling bottlenecks in atom-based quantum computers, providing hardware context for the quantum-risk discussion.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/podcast/413/">https://zeroknowledge.fm/podcast/413/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-the-lattice-isomorphism-problem-with-hints" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The Lattice Isomorphism Problem with Hints</h3><ul><li><p>Mélissa Rossi</p></li><li><p>Studies LIP with partial secret information and refines Hawk key-recovery estimates, including an estimated security loss of about 11 bits for Hawk-1024.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2381">https://eprint.iacr.org/2026/2381</a></p></li></ul><h3 id="h-it-takes-two-proofs-of-work-for-fiat-shamir" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">It Takes Two: Proofs of Work for Fiat–Shamir</h3><ul><li><p>Benedikt Bünz, Jessica Chen, Ziyi Guan</p></li><li><p>Shows that strong and non-amortizing PoW cannot coexist with a sufficiently cheap verifier, then combines two PoWs for grinding and diagonalization resistance.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2326">https://eprint.iacr.org/2026/2326</a></p></li></ul><h3 id="h-ziren-succinct-arguments-for-mips32-execution" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ziren: Succinct Arguments for MIPS32 Execution</h3><ul><li><p>Stephen Duan</p></li><li><p>Combines a CPU-less chip architecture, jagged sumcheck, WHIR openings, and Lean-checked chip determinism to prove MIPS32 execution.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2330">https://eprint.iacr.org/2026/2330</a></p></li></ul><h3 id="h-time-space-tradeoffs-for-probabilistic-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Time-Space Tradeoffs For Probabilistic Proofs</h3><ul><li><p>Alessandro Chiesa, Ziyi Guan, Omer Paneth, Nicholas Spooner</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Establishes time-space tradeoffs for PCPs and IOPs with straightline knowledge soundness under sequential input access; random witness access enables an R1CS exception.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2406">https://eprint.iacr.org/2026/2406</a></p></li></ul><h3 id="h-practical-and-efficient-mpc-from-fhe-without-zkpoks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Practical and Efficient MPC from FHE, without ZKPoKs</h3><ul><li><p>Kelong Cong, Nigel P. Smart, Titouan Tanguy, Michael Walter</p></li><li><p>Uses encrypted PRF functionality to remove ZK proofs of knowledge from a specific FHE-based MPC protocol and simplify its security proof.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2403">https://eprint.iacr.org/2026/2403</a></p></li></ul><h3 id="h-truffle-maliciously-secure-three-party-shuffles-with-applications-to-parsing" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Truffle: Maliciously Secure Three-Party Shuffles with Applications to Parsing</h3><ul><li><p>Nidhish Bhimrajka, Yashvanth Kondi, Daniel Noble, Bhavish Raj Gopal</p></li><li><p>Uses distributed-verifier ZK proofs for shuffles secure against one active corruption, enabling efficient parsing of secret-shared strings.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2376">https://eprint.iacr.org/2026/2376</a></p></li></ul><h3 id="h-stomr-stateful-oblivious-message-retrieval" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">StOMR: Stateful Oblivious Message Retrieval</h3><ul><li><p>Charles Gouert, Keewoo Lee, Dimitris Mouris, Yiannis Tselekounis, Jean-Luc Watson</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p>Introduces lightweight private state for anonymous message retrieval, reporting sender signals approximately 178–650 times smaller than three prior systems.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2369">https://eprint.iacr.org/2026/2369</a></p></li></ul><h3 id="h-faster-provable-lattice-sieving-with-spherical-codes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Faster Provable Lattice Sieving with Spherical Codes</h3><ul><li><p>Divesh Aggarwal, Aditya Morolia, Noah Stephens-Davidowitz</p></li><li><p>Combines fast nearest-neighbor methods with provably correct approximate-SVP sieving; runtime bounds depend on the spherical-code bounds or assumptions used.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2388">https://eprint.iacr.org/2026/2388</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 2 Oct 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-2-oct-2026</link>
            <guid>Pl88cmBo5gOMLCkZmKxn</guid>
            <pubDate>Fri, 02 Oct 2026 15:16:00 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover the cryptographic world computer, ZK learning resources, Boolean-kernel folding, private blockchains, quantum and AI risks to cryptography, anonymous blocklisting, proof of personhood, post-quantum signatures, AI cryptanalysis, wallet provenance, incrementally verifiable computation, multi-party signature aggregation, and Fiat-Shamir transformations.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-the-cryptographic-world-computer" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The cryptographic world computer</h3><ul><li><p>Vitalik Buterin</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://vitalik.eth.limo/general/2026/09/27/the_cryptographic_world_computer.html">https://vitalik.eth.limo/general/2026/09/27/the_cryptographic_world_computer.html</a></p></li><li><p>Chinese version: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/r2xEXTYafCXcWo0OJVg5Lg">https://mp.weixin.qq.com/s/r2xEXTYafCXcWo0OJVg5Lg</a></p></li></ul><h2 id="h-projects" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Projects</h2><h3 id="h-zk-roadmap-a-structured-curriculum-map-for-learning-zero-knowledge-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ZK Roadmap: A structured curriculum map for learning Zero-Knowledge Proofs</h3><ul><li><p>SrishtiCode</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/SrishtiCode/ZKRoadmap">https://github.com/SrishtiCode/ZKRoadmap</a></p></li></ul><h3 id="h-boolean-kernel-basis-native-evaluation-form-fri-folding-a-multilinear-pcs-post-quantum-security-lean-4-formalisation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Boolean-kernel basis: native evaluation-form FRI folding, a multilinear PCS, post-quantum security, Lean 4 formalisation</h3><ul><li><p>qoosmo/kbfold</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/qoosmo/kbfold">https://github.com/qoosmo/kbfold</a></p></li></ul><h3 id="h-zones-private-blockchains-anchored-to-tempo" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Zones: Private Blockchains Anchored to Tempo</h3><ul><li><p>Tempo</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/tempoxyz/zones">https://github.com/tempoxyz/zones</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-jp-aumasson-on-quantum-risk-ai-attacks-and-too-much-crypto" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">JP Aumasson on Quantum Risk, AI Attacks and Too Much Crypto</h3><ul><li><p>Anna, Tarun and Nico are joined by JP Aumasson, co-designer of BLAKE3, author of Serious Cryptography and cryptography engineer at Cloudflare. They revisit the quantum threat to cryptography, looking at recent advances in quantum attacks on RSA and elliptic-curve cryptography, and discuss why JP remains cautious about predictions of an imminent “Q-day.” They then explore how AI is changing cryptanalysis, from recent RSA factoring records to the growing divide between symmetric and asymmetric cryptography.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zeroknowledge.fm/podcast/412/">https://zeroknowledge.fm/podcast/412/</a></p></li><li><p>Chinese version: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/VJwwI9rS5oYcw6nf_W1fGQ">https://mp.weixin.qq.com/s/VJwwI9rS5oYcw6nf_W1fGQ</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-zk-ban-an-efficient-anonymous-blocklisting-system-with-signature-based-revocation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">zk-BAN: An efficient anonymous blocklisting system with signature-based revocation</h3><ul><li><p>Kosei Akama, Yoshimichi Nakatsuka, Koichi Moriyama, Keisuke Uehara</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2274">https://eprint.iacr.org/2026/2274</a></p></li></ul><h3 id="h-binding-humans-to-keys-a-secure-decentralized-proof-of-personhood-protocol" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Binding Humans to Keys: A Secure Decentralized Proof of Personhood Protocol</h3><ul><li><p>Bilel Zaghdoudi, Gewu BU, Frederic Hayek, Pascal Lafourcade, Maria Potop-Butucaru</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2246">https://eprint.iacr.org/2026/2246</a></p></li></ul><h3 id="h-superposition-key-recovery-attacks-on-dilithium-and-fiat-shamir-signature-schemes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Superposition Key-Recovery Attacks on Dilithium and Fiat-Shamir Signature Schemes</h3><ul><li><p>Carlos Cid, David Elkouss, Manuel Goulão</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2258">https://eprint.iacr.org/2026/2258</a></p></li></ul><h3 id="h-chinese-ngcc-algorithms-the-first-week-of-ai-cryptanalysis" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Chinese NGCC Algorithms: The First Week of AI Cryptanalysis</h3><ul><li><p>Markku-Juhani O. Saarinen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2266">https://eprint.iacr.org/2026/2266</a></p></li></ul><h3 id="h-provenance-proofs-linkable-zero-knowledge-derivation-relations-for-hierarchical-deterministic-wallets" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Provenance Proofs: Linkable Zero-Knowledge Derivation Relations for Hierarchical Deterministic Wallets</h3><ul><li><p>Vincenzo Botta, Michal Pospieszalski, Emanuele Ragnoli, Justus Ranvier</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2204">https://eprint.iacr.org/2026/2204</a></p></li></ul><h3 id="h-incrementally-verifiable-computation-without-extraction" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Incrementally Verifiable Computation without Extraction</h3><ul><li><p>Abhishek Jain, Surya Mathialagan, Brent Waters</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2219">https://eprint.iacr.org/2026/2219</a></p></li></ul><h3 id="h-sok-the-landscape-of-post-quantum-multi-party-signature-aggregation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SoK: The Landscape of Post-Quantum Multi-Party Signature Aggregation</h3><ul><li><p>Gaurav Kumar</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2222">https://eprint.iacr.org/2026/2222</a></p></li></ul><h3 id="h-a-fiat-shamir-transformation-for-private-coin-protocols" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Fiat-Shamir Transformation for Private-Coin Protocols</h3><ul><li><p>Shany Ben-David, Eylon Yogev, Agni Datta</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2227">https://eprint.iacr.org/2026/2227</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 25 Sept 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-25-sept-2026</link>
            <guid>eCITYqirqoATZBzGbLVP</guid>
            <pubDate>Fri, 25 Sep 2026 12:55:09 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK, privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover AI-assisted cryptanalysis, RSA-896 factorization, the four-color theorem, Bitcoin's quantum migration, Fiat-Shamir attacks, succinct VOLE, algebraic folding, formal verification of Jolt, binary-field proofs, sparse arguments of knowledge, succinct arguments for QMA, lattice-based shortness checks, polynomial commitments and signatures, and witness encryption.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-gpt-6-astra-solves-a-wwi-german-radio-cipher" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">GPT-6 Astra Solves a WWI German Radio Cipher</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.prinzai.com/p/gpt-6-astra-solves-a-wwi-german-radio">https://www.prinzai.com/p/gpt-6-astra-solves-a-wwi-german-radio</a></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://substack.com/home/post/p-216400777">https://substack.com/home/post/p-216400777</a></p></li></ul><h3 id="h-openai-gpt-6-astra-2005-enigma" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">OpenAI GPT-6 Astra 破解一则自 2005 年以来悬而未决的 Enigma 密电</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/RrwRRWAj277GrVgxQNiFZA">https://mp.weixin.qq.com/s/RrwRRWAj277GrVgxQNiFZA</a></p></li></ul><h3 id="h-rsa-896-is-factored-or-stephen-a-weis" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">RSA-896 is factored | Stephen A. Weis</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://saweis.net/posts/rsa-896.html">https://saweis.net/posts/rsa-896.html</a></p></li></ul><h3 id="h-the-four-color-theorem-gets-a-rare-new-proof" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The Four-Color Theorem Gets a Rare New Proof</h3><ul><li><p>By revisiting the famous problem — which was controversially solved in the 1970s with the help of computers — mathematicians have gained important new insights into the nature of graphs.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.quantamagazine.org/the-four-color-theorem-gets-a-rare-new-proof-20260910/">https://www.quantamagazine.org/the-four-color-theorem-gets-a-rare-new-proof-20260910/</a></p></li></ul><h3 id="h-bitcoins-quantum-migration-debate" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Bitcoin's Quantum Migration Debate</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.lopp.net/bitcoin-quantum-migration-debate/">https://blog.lopp.net/bitcoin-quantum-migration-debate/</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-ron-rothblum-on-fiat-shamir-attacks-flock-and-snarkfast" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ron Rothblum on Fiat-Shamir Attacks, Flock and SNARK.fast</h3><ul><li><p>This week, Anna and Kobi are joined by Ron Rothblum, Professor of Computer Science at Technion and researcher at Succinct. They catch up on Ron’s move from theory into practice, including his work on the SP1 zkVM, Jagged Polynomial Commitments, and a recent Fiat-Shamir attack that exposed vulnerabilities in practical uses of GKR. Ron explains what the attack revealed about Fiat-Shamir’s security assumptions and why it prompted changes to deployed systems.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://youtu.be/sm1wA5HQCF8?si=SUuTPh2Pd-PIG3Cy">https://youtu.be/sm1wA5HQCF8?si=SUuTPh2Pd-PIG3Cy</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-batch-it-mac-program-the-randomness-in-succinct-vole" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Batch IT-MAC: Program the Randomness in Succinct VOLE</h3><ul><li><p>Liqiang Liu, Tianren Liu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2159">https://eprint.iacr.org/2026/2159</a></p></li></ul><h3 id="h-accordion-efficient-batch-proving-via-algebraic-folding" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Accordion: Efficient Batch Proving via Algebraic Folding</h3><ul><li><p>David Balbás, Anca Nitulescu, Maxime Plançon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2160">https://eprint.iacr.org/2026/2160</a></p></li></ul><h3 id="h-jolt-qed-formally-verifying-bytecode-expansions-in-lean" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Jolt-QED: Formally Verifying Bytecode Expansions In Lean</h3><ul><li><p>Ari Biswas, Quang Dao, Daniel Ross, Justin Thaler</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2157">https://eprint.iacr.org/2026/2157</a></p></li></ul><h3 id="h-bitz-proofs-and-commitments-in-arbitrary-rings-through-binary-fields" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">BitZ: proofs and commitments in arbitrary rings through binary fields</h3><ul><li><p>Remco Bloemen, Albert Garreta, Marcin Kostrzewa, Shreyas Londhe, John Wu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2141">https://eprint.iacr.org/2026/2141</a></p></li></ul><h3 id="h-sak-sparse-arguments-of-knowledge-from-sparse-lookup-arguments" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SAK: Sparse Arguments of Knowledge, from Sparse Lookup Arguments</h3><ul><li><p>Abhiram Kothapalli, Sriram Sridhar, Arantxa Zapico</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2143">https://eprint.iacr.org/2026/2143</a></p></li></ul><h3 id="h-succinct-shortness-check-under-a-few-kilobytes-via-tensor-train-random-projections" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Succinct Shortness Check Under a Few Kilobytes via Tensor Train Random Projections</h3><ul><li><p>Zhiyuan Geng, Maxime Plançon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2146">https://eprint.iacr.org/2026/2146</a></p></li></ul><h3 id="h-succinct-arguments-for-qma-in-the-quantum-random-oracle-model" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Succinct Arguments for QMA in the Quantum Random Oracle Model</h3><ul><li><p>Alessandro Chiesa, Zihan Hu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2099">https://eprint.iacr.org/2026/2099</a></p></li></ul><h3 id="h-labinius-fast-lattice-based-binary-polynomial-commitment-scheme" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">LaBinius – Fast Lattice-Based Binary Polynomial Commitment Scheme</h3><ul><li><p>Michał Osadnik, Gregor Seiler</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2103">https://eprint.iacr.org/2026/2103</a></p></li></ul><h3 id="h-lattice-based-synchronous-signatures-efficiently-aggregatable-and-thresholdizable" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Lattice-Based Synchronous Signatures: Efficiently Aggregatable and Thresholdizable</h3><ul><li><p>Dan Boneh, Binyi Chen, Trisha Datta</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2121">https://eprint.iacr.org/2026/2121</a></p></li></ul><h3 id="h-maltese-succinct-polynomial-commitment-from-lattices" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Maltese: Succinct Polynomial Commitment from Lattices</h3><ul><li><p>Katarina Cheng, Wilson Nguyen, Nirvan Tyagi</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2067">https://eprint.iacr.org/2026/2067</a></p></li></ul><h3 id="h-witness-encryption-for-np-from-snargs-and-groups" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Witness Encryption for NP from SNARGs and Groups</h3><ul><li><p>Zhengzhong Jin</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2063">https://eprint.iacr.org/2026/2063</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 18 Sept 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-18-sept-2026</link>
            <guid>j65vgaEzwkC1CoMUUgkc</guid>
            <pubDate>Fri, 18 Sep 2026 14:47:43 GMT</pubDate>
            <description><![CDATA[Weekly news on ZK,  privacy and cryptography]]></description>
            <content:encoded><![CDATA[<p>This week we cover the Cyphral Distich, post-quantum cryptography, recursive STARKs, payments, zero-knowledge image editing, succinct arguments for QMA, Reed-Solomon list decoding, ElGamal shuffle proofs, VOLE-based proofs, lattice signatures, ideal lattice hardness, succinct obfuscation, oblivious pseudorandom functions, and lattice folding.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-claude-fable-51-solves-the-cyphral-distich" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Claude Fable 5.1 Solves the Cyphral Distich</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.vals.ai/blogs/fable-solves-cyphral-distich">https://www.vals.ai/blogs/fable-solves-cyphral-distich</a></p></li></ul><h3 id="h-from-algebra-to-noise-why-post-quantum-cryptography-looks-different" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">From Algebra to Noise: Why Post-Quantum Cryptography Looks Different</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.openzeppelin.com/news/why-post-quantum-cryptography-looks-different">https://www.openzeppelin.com/news/why-post-quantum-cryptography-looks-different</a></p></li></ul><h3 id="h-the-post-quantum-security-model-built-for-an-age-of-ai-agents" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The Post-Quantum Security Model Built for an Age of AI Agents</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://hackernoon.com/the-post-quantum-security-model-built-for-an-age-of-ai-agents">https://hackernoon.com/the-post-quantum-security-model-built-for-an-age-of-ai-agents</a></p></li></ul><h3 id="h-scaling-ethereum-with-recursive-starks-and-the-trustless-log-index" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Scaling Ethereum with recursive STARKs and the Trustless Log Index</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethresear.ch/t/scaling-ethereum-with-recursive-starks-and-the-trustless-log-index/26002">https://ethresear.ch/t/scaling-ethereum-with-recursive-starks-and-the-trustless-log-index/26002</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-silent-payments-formally-security-scanning-costs-and-blind-collaborative-payments" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Silent Payments, Formally: Security, Scanning Costs, and Blind Collaborative Payments</h3><ul><li><p>Rong Qian, Yu Cheng, Mengrun Chen, Yuchang Zhang, Zengli Guo</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2037">https://eprint.iacr.org/2026/2037</a></p></li></ul><h3 id="h-zk-jpeg-zero-knowledge-image-editing-and-compression" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ZK-JPEG: Zero-knowledge Image Editing and Compression</h3><ul><li><p>Samuel Dittmer, Steve Lu, Kimberlee Model, Joseph Near</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2039">https://eprint.iacr.org/2026/2039</a></p></li></ul><h3 id="h-succinct-arguments-for-qma-from-collapsing-hash-functions" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Succinct Arguments for QMA from Collapsing Hash Functions</h3><ul><li><p>James Bartusek, Giulio Malavolta</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2040">https://eprint.iacr.org/2026/2040</a></p></li></ul><h3 id="h-linear-list-size-bounds-for-reed-solomon-beyond-the-johnson-bound" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Linear list size bounds for Reed-Solomon beyond the Johnson bound</h3><ul><li><p>Ariel Gabizon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2048">https://eprint.iacr.org/2026/2048</a></p></li></ul><h3 id="h-one-scalar-to-fold-them-all-and-in-the-commitment-bind-them-reduced-logarithmic-elgamal-shuffle-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">One Scalar to Fold Them All, and in the Commitment Bind Them: Reduced Logarithmic ElGamal Shuffle Proofs</h3><ul><li><p>Freeman Slaughter</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2052">https://eprint.iacr.org/2026/2052</a></p></li></ul><h3 id="h-bonsai-scalable-private-payments" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Bonsai: Scalable Private Payments</h3><ul><li><p>Patrick O'Grady, Lúcás Críostóir Meier, Guru-Vamsi Policharla</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1987">https://eprint.iacr.org/2026/1987</a></p></li></ul><h3 id="h-wasp-succinct-non-interactive-zero-knowledge-proofs-from-vole" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Wasp: Succinct Non-Interactive Zero-Knowledge Proofs from VOLE</h3><ul><li><p>Zhanpeng Guo, Zhelei Zhou, Yun Li, Chenkai Weng, Cheng Hong, Tao Wei</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1988">https://eprint.iacr.org/2026/1988</a></p></li></ul><h3 id="h-towards-practical-iterative-rejection-sampling-a-compact-and-efficient-signature-over-module-lattices" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Towards Practical Iterative Rejection Sampling: A Compact and Efficient Signature over Module Lattices</h3><ul><li><p>Yifan Ming, Jipeng Zhang, Zihan Liu, Guofeng Tang, Pengfei Chen, Yutao Sun, Si Gao, Cong Zhang, Long Chen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1991">https://eprint.iacr.org/2026/1991</a></p></li></ul><h3 id="h-np-hardness-of-ideal-lattice-problems" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">NP-Hardness of Ideal Lattice Problems</h3><ul><li><p>Daniel E. Martin</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2003">https://eprint.iacr.org/2026/2003</a></p></li></ul><h3 id="h-on-succinct-obfuscation-via-propositional-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">On Succinct Obfuscation via Propositional Proofs</h3><ul><li><p>Abhishek Jain, Zhengzhong Jin, Surya Mathialagan, Omer Paneth</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2009">https://eprint.iacr.org/2026/2009</a></p></li></ul><h3 id="h-beasley-efficient-zero-knowledge-proofs-for-lattice-based-round-optimal-oblivious-pseudorandom-functions" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Beasley: Efficient Zero-Knowledge Proofs for Lattice-based Round-Optimal Oblivious Pseudorandom Functions</h3><ul><li><p>Baiyu Li, Ting-Yuan Wang, Jiapeng Zhang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2010">https://eprint.iacr.org/2026/2010</a></p></li></ul><h3 id="h-cauchyfold-residue-optimal-high-arity-lattice-folding-via-scaled-cauchy-challenges" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">CauchyFold: Residue-Optimal High-Arity Lattice Folding via Scaled Cauchy Challenges</h3><ul><li><p>Xiang Wang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/2011">https://eprint.iacr.org/2026/2011</a></p></li></ul><hr><p><strong>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!</strong></p><p><span data-name="sparkles" class="emoji" data-type="emoji">✨</span><strong> Web collection version: </strong><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a></p><p><span data-name="sparkles" class="emoji" data-type="emoji">✨</span><strong> GitHub repo link: </strong><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 11 Sept 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-11-sept-2026</link>
            <guid>3Dxp1qZf6opqyZpaQAat</guid>
            <pubDate>Fri, 11 Sep 2026 12:30:24 GMT</pubDate>
            <description><![CDATA[Weekly highlights on zero-knowledge proofs, cryptography, privacy, and verifiable computation.]]></description>
            <content:encoded><![CDATA[<p>This week we cover post-quantum Jolt, year of AI and ZKP, zkVMs, Ethereum's post-quantum roadmap, threshold signatures, anonymous authentication, Falcon, lattice anonymous credentials and ring signatures, blind multi-signatures, matrix lookups, VOLE over Galois rings, PCPs, and lattice-based PCS.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-entering-the-era-of-lattice-snarks-with-a-faster-post-quantum-jolt" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Entering the era of lattice SNARKs – with a faster, post-quantum Jolt</h3><ul><li><p>Markos Georghiades, Justin Thaler, Andrew Tretyakov, and Michael Zhu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://a16zcrypto.com/posts/article/lattice-snarks-jolt-post-quantum-faster/">https://a16zcrypto.com/posts/article/lattice-snarks-jolt-post-quantum-faster/</a></p></li></ul><h3 id="h-how-to-prove-software-ran-correctly-on-a-phone-or-gpu-in-a-post-quantum-world" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How to prove software ran correctly — on a phone or GPU, in a post-quantum world</h3><ul><li><p>Introducing a fast, post-quantum Jolt</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://a16zcrypto.substack.com/p/how-to-prove-software-ran-correctly?r=78jqeo&amp;utm_campaign=post-expanded-share&amp;utm_medium=web">https://a16zcrypto.substack.com/p/how-to-prove-software-ran-correctly?r=78jqeo&amp;utm_campaign=post-expanded-share&amp;utm_medium=web</a></p></li></ul><h3 id="h-the-year-finding-and-exploiting-bugs-became-cheap-and-what-to-do-about-it-or-zksec" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The Year Finding and Exploiting Bugs Became Cheap, and What to Do About It | ZK/SEC</h3><ul><li><p>Stefanos Chaliasos</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="http://blog.zksecurity.xyz/posts/the-year-finding-bugs-became-cheap/">http://blog.zksecurity.xyz/posts/the-year-finding-bugs-became-cheap/</a></p></li></ul><h3 id="h-introducing-zkvmblast-differential-fuzzing-for-ethereums-zkvms" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Introducing zkvmBlast: Differential Fuzzing for Ethereum's zkVMs</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/zkvmblast/">https://blog.zksecurity.xyz/posts/zkvmblast/</a></p></li></ul><h3 id="h-ethereum-foundation-targets-post-quantum-l1-by-2029" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ethereum Foundation Targets Post-Quantum L1 by 2029</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blockchain.news/news/ethereum-quantum-resistance-2029">https://blockchain.news/news/ethereum-quantum-resistance-2029</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-tightly-and-adaptively-secure-two-round-threshold-signatures-from-ddh" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Tightly and Adaptively Secure Two-Round Threshold Signatures from DDH</h3><ul><li><p>Renas Bacho, Yanbo Chen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1909">https://eprint.iacr.org/2026/1909</a></p></li></ul><h3 id="h-aipa-anonymous-image-provenance-authentication-in-online-social-networks-via-unlinkable-pseudonym-certificates-and-zk-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">AIPA: Anonymous Image Provenance Authentication in Online Social Networks via Unlinkable Pseudonym Certificates and zk-SNARKs</h3><ul><li><p>Linsheng Yu, Yanqing Yao</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1914">https://eprint.iacr.org/2026/1914</a></p></li></ul><h3 id="h-a-ram-efficient-implementation-of-falcon" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A RAM-Efficient Implementation of Falcon</h3><ul><li><p>Thomas Pornin</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1915">https://eprint.iacr.org/2026/1915</a></p></li></ul><h3 id="h-compact-lattice-anonymous-credentials-from-tighter-approximate-range-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Compact Lattice Anonymous Credentials from Tighter Approximate Range Proofs</h3><ul><li><p>Corentin Jeudy, Olivier Sanders</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1920">https://eprint.iacr.org/2026/1920</a></p></li></ul><h3 id="h-compact-lattice-based-nizk-arguments-for-set-membership-and-ring-signatures-without-ro" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Compact Lattice-Based NIZK Arguments for Set Membership and Ring Signatures without RO</h3><ul><li><p>Nam Tran, Khoa Nguyen, Dongxi Liu, Josef Pieprzyk, Willy Susilo</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1885">https://eprint.iacr.org/2026/1885</a></p></li></ul><h3 id="h-symplex-improved-pairing-based-zksnark-using-partial-fraction-techniques" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Symplex: Improved Pairing-Based zkSNARK using Partial Fraction Techniques</h3><ul><li><p>Charanjit S. Jutla, Arnab Roy</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1886">https://eprint.iacr.org/2026/1886</a></p></li></ul><h3 id="h-bmusig2-schnorr-compatible-blind-multi-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">BMuSig2: Schnorr-Compatible Blind Multi-Signatures</h3><ul><li><p>Kanchan Bisht, Keerthi Aiswarya Varshini, Shivam Sethi, Maria Francis, R. Kabaleeshwaran</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1888">https://eprint.iacr.org/2026/1888</a></p></li></ul><h3 id="h-rogue-updatable-matrix-lookup-arguments-and-applications-to-verifiable-databases" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Rogue: Updatable Matrix Lookup Arguments and Applications to Verifiable Databases</h3><ul><li><p>Christodoulos Pappas, Zhuo Cai, Dimitrios Papadopoulos</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1890">https://eprint.iacr.org/2026/1890</a></p></li></ul><h3 id="h-subring-vole-over-galois-rings-with-applications-to-zk-over-zpk" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Subring VOLE over Galois Rings with Applications to ZK over Zp^k</h3><ul><li><p>Ignacio Cascudo, Xiang Liu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1864">https://eprint.iacr.org/2026/1864</a></p></li></ul><h3 id="h-zero-knowledge-pcps-of-quasilinear-size-via-locally-simulatable-sheaf-codes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Zero-Knowledge PCPs of Quasilinear Size via Locally Simulatable Sheaf Codes</h3><ul><li><p>Tom Gur, Nicholas Spooner, Hadas Zeilberger</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1868">https://eprint.iacr.org/2026/1868</a></p></li></ul><h3 id="h-akita-a-high-performance-lattice-based-polynomial-commitment-scheme" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Akita: A High-Performance Lattice-Based Polynomial Commitment Scheme</h3><ul><li><p>Quang Dao, Omid Bodaghi, Amirhossein Khajehpour, Giuseppe Vitto, Mohammadtaghi Badakhshan, Markos Georghiades, Fengrun Liu, Jiapeng Zhang, Justin Thaler</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://assets.layerzero.network/pdf/akita.pdf">https://assets.layerzero.network/pdf/akita.pdf</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 4 Sept 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-4-sept-2026</link>
            <guid>lBJ5w6iYDAITmRq2JUKd</guid>
            <pubDate>Fri, 04 Sep 2026 10:09:11 GMT</pubDate>
            <description><![CDATA[Weekly highlights on zero-knowledge proofs, cryptography, privacy, and verifiable computation.]]></description>
            <content:encoded><![CDATA[<p>This week we cover optimizing cryptography, KZG commitment variants, exotic domains, ZKPassport, binary fields, verifiable computing, threshold secret sharing, NTRU, recursive zk-SNARK credentials, lattice folding, quantum pessiland, Fiat-Shamir limits, polynomial commitments, ZK hashing, and privacy-preserving revocation.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-optimizing-cryptography-with-ai" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Optimizing Cryptography with AI</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/optimizing-cryptography-with-ai/">https://blog.zksecurity.xyz/posts/optimizing-cryptography-with-ai/</a></p></li></ul><h3 id="h-variants-of-kzg-zksecurity" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Variants of KZG ｜ zkSecurity</h3><ul><li><p>Part I, Univariate: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-1/">https://blog.zksecurity.xyz/posts/kzg-1/</a></p></li><li><p>Part II, Mulilinear Commitments with PST: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-2/">https://blog.zksecurity.xyz/posts/kzg-2/</a></p></li><li><p>Part III, Multilinear Commitments with Zeromorph: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-3/">https://blog.zksecurity.xyz/posts/kzg-3/</a></p></li><li><p>Part IV, Multilinear Commitments with Gemini: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-4/">https://blog.zksecurity.xyz/posts/kzg-4/</a></p></li><li><p>Part V, Multilinear Commitments with Mercury: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-5/">https://blog.zksecurity.xyz/posts/kzg-5/</a></p></li></ul><h3 id="h-the-zk-chronicles-exotic-domains-or-frank-mangone" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The ZK Chronicles: Exotic Domains | Frank Mangone</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://arkana.blog/en/blog/the-zk-chronicles/exotic-domains/">https://arkana.blog/en/blog/the-zk-chronicles/exotic-domains/</a></p></li></ul><h3 id="h-a-quick-look-at-zero-knowledge-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A quick look at zero-knowledge proofs</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://bernsteinbear.com/blog/zkp/">https://bernsteinbear.com/blog/zkp/</a></p></li></ul><h3 id="h-zkpassport-goes-live-on-the-taceo-network-or-taceo" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ZKPassport goes live on the TACEO Network | TACEO</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://core.taceo.io/articles/partner-zkpassport/">https://core.taceo.io/articles/partner-zkpassport/</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-ethproofs-call-10-or-binary-fields" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ethproofs call #10 | binary fields</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.youtube.com/watch?v=m2Jf2lLHfG0">https://www.youtube.com/watch?v=m2Jf2lLHfG0</a></p></li></ul><h3 id="h-how-do-you-prove-a-computer-isnt-lying" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How Do You Prove a Computer Isn’t Lying?</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.youtube.com/watch?v=jVHeHmufZhk">https://www.youtube.com/watch?v=jVHeHmufZhk</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-a-code-based-dollarkndollar-threshold-secret-sharing-scheme-with-integrity-verification" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Code-Based $(k,n)$-Threshold Secret Sharing Scheme with Integrity Verification</h3><ul><li><p>Sapna Jyoti Patel, Sumit Kumar Debnath</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1850">https://eprint.iacr.org/2026/1850</a></p></li></ul><h3 id="h-distributed-key-generation-for-ntru" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Distributed Key Generation for NTRU</h3><ul><li><p>Patrick Hough, Jérôme Nguyen, Caroline Sandsbråten, Tjerand Silde</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1854">https://eprint.iacr.org/2026/1854</a></p></li></ul><h3 id="h-delegatable-anonymous-credentials-from-legacy-credentials-using-recursive-zk-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Delegatable Anonymous Credentials from Legacy Credentials using Recursive zk-SNARKs</h3><ul><li><p>Leandro Rometsch, Philipp-Florens Lehwalder, Sebastian Faust, Stefan Schulte</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1855">https://eprint.iacr.org/2026/1855</a></p></li></ul><h3 id="h-latticeblindfold-a-lattice-based-analogue-of-novablindfold" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">LatticeBlindFold: A Lattice-Based Analogue of NovaBlindFold</h3><ul><li><p>Luca Dall'Ava</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1857">https://eprint.iacr.org/2026/1857</a></p></li></ul><h3 id="h-anonymous-attribute-based-signcryption-definitions-constructions-and-applications" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Anonymous Attribute-Based Signcryption: Definitions, Constructions, and Applications</h3><ul><li><p>Yongkang Lang, Fangguo Zhang, Zhiyuan An, Xinyi Huang, Xiaofeng Chen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1861">https://eprint.iacr.org/2026/1861</a></p></li></ul><h3 id="h-quantum-pessiland" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Quantum Pessiland</h3><ul><li><p>Boyang Chen, Tomoyuki Morimae, Takashi Yamakawa</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1834">https://eprint.iacr.org/2026/1834</a></p></li></ul><h3 id="h-how-to-prove-more-false-statements-fiat-shamir-limitations-on-generated-r1cs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How to prove more false statements: Fiat–Shamir limitations on (generated) R1CS</h3><ul><li><p>Giacomo Fenzi</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1838">https://eprint.iacr.org/2026/1838</a></p></li></ul><h3 id="h-quasar-a-field-agnostic-polynomial-commitment-scheme-with-polylogarithmic-verification-from-quasi-abelian-codes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Quasar: A Field-Agnostic Polynomial Commitment Scheme with Polylogarithmic Verification from Quasi-Abelian Codes</h3><ul><li><p>Yuhao Jia, Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1839">https://eprint.iacr.org/2026/1839</a></p></li></ul><h3 id="h-avoiding-product-denominator-blowup-in-lattice-folding-extraction" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Avoiding Product-Denominator Blowup in Lattice-Folding Extraction</h3><ul><li><p>Xiang Wang, Shihui Fu, Michał Osadnik</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1841">https://eprint.iacr.org/2026/1841</a></p></li></ul><h3 id="h-arion-arithmetization-oriented-hashing-for-zero-knowledge-proof-systems" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Arion: Arithmetization-Oriented Hashing for Zero-Knowledge Proof Systems</h3><ul><li><p>Luca Campa, Arnab Roy, Matthias Johann Steiner, Stefano Trevisani</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1842">https://eprint.iacr.org/2026/1842</a></p></li></ul><h3 id="h-comparing-privacy-preserving-revocation-for-the-eudi-wallet" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Comparing Privacy-Preserving Revocation for the EUDI Wallet</h3><ul><li><p>Andrea Flamini, Anja Lehmann, Giada Sciarretta, Mario Scuro, Nicola Smaniotto, Alessandro Tomasi, Silvio Ranise</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1824">https://eprint.iacr.org/2026/1824</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 28 Aug 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-28-aug-2026</link>
            <guid>wl0B6fJLTIgObrA7LSkr</guid>
            <pubDate>Fri, 28 Aug 2026 09:47:08 GMT</pubDate>
            <description><![CDATA[Weekly highlights on zero-knowledge proofs, privacy, and verifiable computation]]></description>
            <content:encoded><![CDATA[<p>This week we cover quantum computer coordination, floating-point-free Falcon, anonymous credentials, lattice-based signatures for Bitcoin, post-quantum zkSNARK provers, compact lattice signatures, quantum proofs, ZK retrieval for RAG, lattice folding, silent threshold signatures, and knowledge reductions.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-can-all-qubits-in-a-quantum-computer-work-together-or-jennifer-tran" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Can all qubits in a quantum computer work together? | Jennifer Tran</h3><ul><li><p>Using GHZ states to determine if qubits in a quantum computer can operate as a single system</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://realmscape.substack.com/p/how-to-tell-if-qubits-are-working?r=78jqeo&amp;utm_campaign=post-expanded-share&amp;utm_medium=web">https://realmscape.substack.com/p/how-to-tell-if-qubits-are-working?r=78jqeo&amp;utm_campaign=post-expanded-share&amp;utm_medium=web</a></p></li></ul><h3 id="h-falcon-without-floating-point-or-pqshield" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Falcon without floating-point | PQShield</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://pqshield.com/falcon-without-floating-point/">https://pqshield.com/falcon-without-floating-point/</a></p></li></ul><h3 id="h-multi-verifier-keyed-verification-anonymous-credentials-mkvac" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Multi-Verifier Keyed-Verification Anonymous Credentials (mKVAC)</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.esat.kuleuven.be/cosic/blog/multi-verifier-keyed-verification-anonymous-credentials-mkvac/">https://www.esat.kuleuven.be/cosic/blog/multi-verifier-keyed-verification-anonymous-credentials-mkvac/</a></p></li><li><p>COSIC Seminar: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.youtube.com/watch?v=0fgxph8I6Aw">https://www.youtube.com/watch?v=0fgxph8I6Aw</a></p></li></ul><h3 id="h-falcon-dilithium-and-the-fall-of-hawk-evaluating-lattice-based-signatures-for-bitcoin" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Falcon, Dilithium, and the Fall of Hawk: Evaluating Lattice-Based Signatures for Bitcoin</h3><ul><li><p>Blockstream Team</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.blockstream.com/lattice-signatures-for-bitcoin/">https://blog.blockstream.com/lattice-signatures-for-bitcoin/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-faster-post-quantum-zksnark-provers-using-the-lch-polynomial-basis" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Faster Post-Quantum zkSNARK Provers Using the LCH Polynomial Basis</h3><ul><li><p>Mohammadtaghi Badakhshan, Susanta Samanta, Guang Gong</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1784">https://eprint.iacr.org/2026/1784</a></p></li></ul><h3 id="h-lithium-making-iterative-rejection-sampling-practical-for-compact-lattice-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Lithium: Making Iterative Rejection Sampling Practical for Compact Lattice Signatures</h3><ul><li><p>Jipeng Zhang, Pengfei Chen, Long Chen, Cong Zhang, Jiaheng Zhang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1790">https://eprint.iacr.org/2026/1790</a></p></li></ul><h3 id="h-ideal-secret-sharing-schemes-over-small-domains" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ideal Secret Sharing Schemes over Small Domains</h3><ul><li><p>Amos Beimel, Aner Ben-Efraim, Oriol Farràs, Adriana Moya</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1794">https://eprint.iacr.org/2026/1794</a></p></li></ul><h3 id="h-on-removing-interaction-from-quantum-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">On Removing Interaction from Quantum Proofs</h3><ul><li><p>Nicholas Spooner, Max Tromanhauser</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1795">https://eprint.iacr.org/2026/1795</a></p></li></ul><h3 id="h-verif-an-efficient-zero-knowledge-proof-system-for-verifying-ivf-flat-retrieval-in-rag-services" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">VERIF: An Efficient Zero-Knowledge Proof System for Verifying IVF-Flat Retrieval in RAG Services</h3><ul><li><p>Zhiwen Zhang, Yuao Zhou, Ge Chang, Cong Li, Yuejian Fang, Qingni Shen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1802">https://eprint.iacr.org/2026/1802</a></p></li></ul><h3 id="h-pikkufold-efficient-folding-in-a-few-kilobytes" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">PikkuFold: Efficient Folding in a Few Kilobytes</h3><ul><li><p>Michał Osadnik</p></li><li><p>A folding scheme from lattices</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1809">https://eprint.iacr.org/2026/1809</a></p></li></ul><h3 id="h-practical-silent-threshold-signatures-and-silent-threshold-encryption-for-dynamic-committees" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Practical Silent Threshold Signatures and Silent Threshold Encryption for Dynamic Committees</h3><ul><li><p>Yifei He, Zheng Zhou, Yu Chen, Zhi Guan, Zhong Chen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1820">https://eprint.iacr.org/2026/1820</a></p></li></ul><h3 id="h-non-malleable-reductions-of-knowledge" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Non-Malleable Reductions of Knowledge</h3><ul><li><p>Antonio Faonio, Lili Tong</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1822">https://eprint.iacr.org/2026/1822</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 23 Aug 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-23-aug-2026</link>
            <guid>Z6hUrmnGzVguwHPoRzf6</guid>
            <pubDate>Sun, 23 Aug 2026 14:05:16 GMT</pubDate>
            <description><![CDATA[This week we have control of AI agents, verifying Rust cryptography, Bitcoin maximalism, modern SNARK theory...]]></description>
            <content:encoded><![CDATA[<p>This week we have control of AI agents, verifying Rust cryptography, Bitcoin maximalism, modern SNARK theory, Lightning custody, bounded-memory Groth16, threshold signatures and ZK proofs, proof-of-uniqueness, DeFi design, ZK benchmarking, ring signatures, and verifiable image compression.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-human-in-the-loop-alternatives-how-to-keep-control-of-ai-agents-without-approving-every-action" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Human-in-the-Loop Alternatives: How to Keep Control of AI Agents Without Approving Every Action</h3><ul><li><p>By Wyatt Benno in AI</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.icme.io/human-in-the-loop-alternatives-how-to-keep-control-of-ai-agents-without-approving-every-action/">https://blog.icme.io/human-in-the-loop-alternatives-how-to-keep-control-of-ai-agents-without-approving-every-action/</a></p></li></ul><h3 id="h-verifying-rust-cryptography-in-symcrypt-from-standards-to-code-microsoft-research" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Verifying Rust cryptography in SymCrypt, from standards to code｜ Microsoft Research</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.microsoft.com/en-us/research/blog/verifying-rust-cryptography-in-symcrypt-from-standards-to-code/">https://www.microsoft.com/en-us/research/blog/verifying-rust-cryptography-in-symcrypt-from-standards-to-code/</a></p></li></ul><h3 id="h-a-second-and-final-eulogy-for-bitcoin-maximalism" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Second and Final Eulogy for Bitcoin Maximalism</h3><ul><li><p>Nic Carter</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://murmurationstwo.substack.com/p/a-second-and-final-eulogy-for-bitcoin">https://murmurationstwo.substack.com/p/a-second-and-final-eulogy-for-bitcoin</a></p></li><li><p>中文版（Kurt Pan）: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/akLxj9SPz01flXixAusuWQ">https://mp.weixin.qq.com/s/akLxj9SPz01flXixAusuWQ</a></p></li></ul><h2 id="h-video" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Video</h2><h3 id="h-the-useless-theory-behind-modern-snarks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The 'useless' theory behind modern SNARKs</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://a16zcrypto.com/posts/article/snarks-noam-nisan">https://a16zcrypto.com/posts/article/snarks-noam-nisan</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-threshold-lattice-based-zero-knowledge-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Threshold Lattice-Based Zero-Knowledge Proofs</h3><ul><li><p>Scott Griffy, Victor Youdom Kemmoe, Ngoc Khanh Nguyen, Tjerand Silde</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1750">https://eprint.iacr.org/2026/1750</a></p></li></ul><h3 id="h-enabling-threshold-custody-for-the-lightning-network-with-nested-threshold-multi-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Enabling Threshold Custody for the Lightning Network with Nested Threshold Multi-Signatures</h3><ul><li><p>Paul Gerhart, Nadav Kohen, Jesse Posner, Matias Furszyfer</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1757">https://eprint.iacr.org/2026/1757</a></p></li></ul><h3 id="h-dollartextsfsluicedollar-prove-phase-bounded-memory-groth16-via-read-write-streaming" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">$\textsf{Sluice}$: Prove-Phase Bounded-Memory Groth16 via Read-Write Streaming</h3><ul><li><p>Kyeongtae Lee, Jihye Kim, Hyunok Oh</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1758">https://eprint.iacr.org/2026/1758</a></p></li></ul><h3 id="h-pilaf-fully-tight-two-round-threshold-signatures-with-adaptive-corruptions" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Pilaf: Fully Tight Two-Round Threshold Signatures with Adaptive Corruptions</h3><ul><li><p>Chen Qian, Xingyu Zhao, Hao Cheng, Zengpeng Li, Puwen Wei, Quan Yuan</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1762">https://eprint.iacr.org/2026/1762</a></p></li></ul><h3 id="h-elementary-vector-modeling-for-shorter-vole-based-signatures-from-sd-and-pkp" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Elementary-Vector Modeling for Shorter VOLE-Based Signatures from SD and PKP</h3><ul><li><p>Boyuan Gao, Zongyang Zhang, Weihan Li, Jianwei Liu, Jianting Ning</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1722">https://eprint.iacr.org/2026/1722</a></p></li></ul><h3 id="h-proof-of-uniqueness-sybil-resistant-privacy-preserving-decentralized-identity-through-threshold-oprf-and-zk-snark-registry" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Proof-of-Uniqueness: Sybil-Resistant Privacy-Preserving Decentralized Identity through Threshold-OPRF and zk-SNARK Registry</h3><ul><li><p>Adam Vozda, Martin Peresini, Juraj Mariani, Ivan Homoliak</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1725">https://eprint.iacr.org/2026/1725</a></p></li></ul><h3 id="h-jacobi-signatures-revisited" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Jacobi Signatures, Revisited</h3><ul><li><p>Yansong Feng</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1726">https://eprint.iacr.org/2026/1726</a></p></li></ul><h3 id="h-enhancing-capital-efficiency-in-defi-lending-and-liquidity-provision" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Enhancing Capital Efficiency in DeFi Lending and Liquidity Provision</h3><ul><li><p>Adam Smehyl, Ivan Homoliak</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1727">https://eprint.iacr.org/2026/1727</a></p></li></ul><h3 id="h-a-controlled-case-study-of-design-trade-offs-in-defi-lending-protocols" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Controlled Case Study of Design Trade-offs in DeFi Lending Protocols</h3><ul><li><p>Jan Findra, Zdenek Lapes, Ivan Homoliak</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1728">https://eprint.iacr.org/2026/1728</a></p></li></ul><h3 id="h-a-unified-framework-for-contract-validated-benchmarking-of-zero-knowledge-proving-systems" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Unified Framework for Contract-Validated Benchmarking of Zero-Knowledge Proving Systems</h3><ul><li><p>Matej Hulek, Martin Peresini, Ivan Homoliak</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1729">https://eprint.iacr.org/2026/1729</a></p></li></ul><h3 id="h-generic-ring-signature-transforms-for-fiat-shamir-with-aborts-and-hash-and-sign-with-retry" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Generic Ring-Signature Transforms for Fiat-Shamir with Aborts and Hash-and-Sign with Retry</h3><ul><li><p>Haruhisa Kosuge, Koutarou Suzuki</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1731">https://eprint.iacr.org/2026/1731</a></p></li></ul><h3 id="h-verifiable-compression-of-images" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Verifiable Compression of Images</h3><ul><li><p>Yue Zhang, Mingxun Zhou, Benedikt Bünz</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1717">https://eprint.iacr.org/2026/1717</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 16 Aug 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-16-aug-2026</link>
            <guid>FnxorPxyV10YXQrd6Fr5</guid>
            <pubDate>Sun, 16 Aug 2026 15:03:38 GMT</pubDate>
            <description><![CDATA[This week we have blockchain history, homomorphic encryption, Bitcoin's quantum threat, mathematical curiosity, rate limiting, ZKSNARKs, and isogeny-based signatures. ]]></description>
            <content:encoded><![CDATA[<p>This week we have blockchain history, practical private AI with homomorphic encryption, Bitcoin's quantum threat, mathematical curiosity, lattice-based rate limiting, binary-field SNARKs, post-quantum ZKSNARKs, and isogeny-based signatures.</p><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-before-bitcoin-the-ideas-that-made-blockchains-possible-a16zcrypto" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Before Bitcoin: The ideas that made blockchains possible ｜ a16zcrypto</h3><ul><li><p>Interviews with pioneers of computing technologies</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://a16zcrypto.substack.com/p/before-bitcoin-the-ideas-that-made">https://a16zcrypto.substack.com/p/before-bitcoin-the-ideas-that-made</a></p></li></ul><h3 id="h-how-google-is-making-private-ai-practical-with-homomorphic-encryption-or-jeremy-kun" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How Google is Making Private AI Practical with Homomorphic Encryption | Jeremy Kun</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.google/security/how-google-is-making-private-ai-practical-with-homomorphic-encryption/">https://blog.google/security/how-google-is-making-private-ai-practical-with-homomorphic-encryption/</a></p></li><li><p>中文翻译版（Kurt Pan）: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/t6RhLv-J8J0oBxkTHaomfw">https://mp.weixin.qq.com/s/t6RhLv-J8J0oBxkTHaomfw</a></p></li></ul><h2 id="h-video" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Video</h2><h3 id="h-web3-101-e83" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">关于比特币面临的量子威胁，我们需要了解的事 ｜ Web3 101 E83</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://web3101.fireside.fm/92">https://web3101.fireside.fm/92</a></p></li></ul><h2 id="h-book" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Book</h2><h3 id="h-" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">《數學諸事：直覺與好奇心的祕密世界》</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mathematica.zkpunk.pro/">https://mathematica.zkpunk.pro/</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-lattice-based-rate-limited-tokens-in-the-random-oracle-model" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Lattice-Based Rate-Limited Tokens in the Random Oracle Model</h3><ul><li><p>Victor Youdom Kemmoe, Anna Lysyanskaya, Ngoc Khanh Nguyen</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1649">https://eprint.iacr.org/2026/1649</a></p></li></ul><h3 id="h-binaryspartan-spartan-over-binary-fields" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">BinarySpartan: Spartan over binary fields</h3><ul><li><p>Srinath Setty</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1656">https://eprint.iacr.org/2026/1656</a></p></li></ul><h3 id="h-transient-quantum-resistance-with-application-to-ethereum-consensus" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Transient Quantum Resistance, with Application to Ethereum Consensus</h3><ul><li><p>Pranay Anchuri, Matteo Campanelli, Rosario Gennaro</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1660">https://eprint.iacr.org/2026/1660</a></p></li></ul><h3 id="h-rate-limiting-nullifiers-for-gasless-sequencer-admission-in-ethereum-layer-2-rollups" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Rate-Limiting Nullifiers for Gasless Sequencer Admission in Ethereum Layer-2 Rollups</h3><ul><li><p>Uğur Şen, Sergei Tikhomirov, Sylvain Delhomme, Nadeem Bhati, Cyprien Grau</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1666">https://eprint.iacr.org/2026/1666</a></p></li></ul><h3 id="h-non-interactive-translation-of-winternitz-signatures-to-lamport-signatures-via-secret-sharing" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Non-Interactive Translation of Winternitz Signatures to Lamport Signatures via Secret Sharing</h3><ul><li><p>Mikhail Sergeevitch, Konrad Staniec, David Tse, Nikhil Vanjani, Robin Linus Woll</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1684">https://eprint.iacr.org/2026/1684</a></p></li></ul><h3 id="h-the-eprint20261591-quantum-algorithm-does-not-solve-dcp" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">The ePrint:2026/1591 Quantum Algorithm Does Not Solve DCP</h3><ul><li><p>Aparna Gupte, Seyoon Ragavan, Mark Zhandry</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1693">https://eprint.iacr.org/2026/1693</a></p></li></ul><h3 id="h-mamabearzkp-a-holistic-co-design-of-prime-fields-and-proving-stacks-for-high-throughput-zkp-on-modern-cpus" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">MamaBearZKP: A Holistic Co-design of Prime Fields and Proving Stacks for High-Throughput ZKP on Modern CPUs</h3><ul><li><p>Jipeng Zhang, Yanpei Guo, Tao Lu, Hao Cheng, Jiaheng Zhang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1698">https://eprint.iacr.org/2026/1698</a></p></li></ul><h3 id="h-luna-more-succinct-post-quantum-zk-snarks-from-computational-privacy" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">LUNA+: More Succinct Post-Quantum ZK-SNARKs from Computational Privacy</h3><ul><li><p>Yuki Kume, Ron Steinfeld, Amin Sakzad, Mert Yassi</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1639">https://eprint.iacr.org/2026/1639</a></p></li></ul><h3 id="h-qlapoti-and-more-optimizing-isogeny-based-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Qlapoti+ and More: Optimizing Isogeny-based Signatures</h3><ul><li><p>Yi-Fu Lai</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1640">https://eprint.iacr.org/2026/1640</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 9 Aug 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-9-aug-2026</link>
            <guid>a2A01cBxlEaYQprw2e5w</guid>
            <pubDate>Sun, 09 Aug 2026 15:19:11 GMT</pubDate>
            <description><![CDATA[This week we have client-side ZK, KZG commitment, privacy in the AI age, post-quantum, SVP, video provenance, self-custodial credentials, and signatures.]]></description>
            <content:encoded><![CDATA[<h2 id="h-" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0"></h2><h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-zk-client-side-proving-myth-or-imminent-reality" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ZK Client-Side Proving: Myth or Imminent Reality?</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://hackmd.io/@QmCYMVNVQuqRJhiqMlXVdA/Sya1ewPA-e">https://hackmd.io/@QmCYMVNVQuqRJhiqMlXVdA/Sya1ewPA-e</a></p></li></ul><h3 id="h-variants-of-kzg-zksecurity" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Variants of KZG ｜ zkSecurity</h3><ul><li><p>Part I, Univariate: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-1/">https://blog.zksecurity.xyz/posts/kzg-1/</a></p></li><li><p>Part II, Mulilinear Commitments with PST: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-2/">https://blog.zksecurity.xyz/posts/kzg-2/</a></p></li><li><p>Part III, Multilinear Commitments with Zeromorph: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/kzg-3/">https://blog.zksecurity.xyz/posts/kzg-3/</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-protecting-privacy-in-the-ai-age-featuring-sudo-privacy-podcast" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Protecting Privacy in the AI Age, Featuring Sudo ｜ Privacy Podcast</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://youtu.be/C-vr9c5ozL4?si=dbnJ8ZKoeq7zMjar">https://youtu.be/C-vr9c5ozL4?si=dbnJ8ZKoeq7zMjar</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-strided-frobenius-additive-fft-and-its-application-to-hqc" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Strided Frobenius Additive FFT and its Application to HQC</h3><ul><li><p>Ming-Shing Chen, Tun-You Chien, Chun-Ming Chiu, Cesare Huang, Han-Hsuan Lin, Chun-Tao Peng, Bo-Yin Yang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1588">https://eprint.iacr.org/2026/1588</a></p></li></ul><h3 id="h-a-polynomial-time-quantum-algorithm-for-the-dihedral-coset-problem" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Polynomial-Time Quantum Algorithm for the Dihedral Coset Problem</h3><ul><li><p>Daniel R. Simon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1591">https://eprint.iacr.org/2026/1591</a></p></li></ul><h3 id="h-zk-cinema-proving-video-provenance-in-zero-knowledge" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">zk-Cinema: Proving Video Provenance in Zero Knowledge</h3><ul><li><p>Alexander Frolov, Jianfeng Guo, Xinyi Zhao, Trisha Datta, Dan Boneh, Ian Miers</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1598">https://eprint.iacr.org/2026/1598</a></p></li></ul><h3 id="h-z-scape-zero-knowledge-self-custodial-credential-operation-for-privacy-preserving-asset-protection-under-entropy-source-failure" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Z-SCAPE: Zero-Knowledge Self-Custodial Credential Operation for Privacy-Preserving Asset Protection under Entropy-Source Failure</h3><ul><li><p>Mehmet Sabir Kiraz, Suleyman Kardas</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1621">https://eprint.iacr.org/2026/1621</a></p></li></ul><h3 id="h-lattice-based-shuffle-arguments-using-subset-checking" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Lattice-Based Shuffle Arguments using Subset Checking</h3><ul><li><p>Behzad Abdolmaleki, Prastudy Fauzi, Jiaqi Gu, Toomas Krips, Nahid Roustaeifar</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1540">https://eprint.iacr.org/2026/1540</a></p></li></ul><h3 id="h-zero-knowledge-proofs-of-isogeny-diamonds" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Zero-Knowledge Proofs of Isogeny Diamonds</h3><ul><li><p>Leonardo Colò, Maher Mamah, Youcef Mokrani, Bruno Sterner, Nicolas Swanson</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1545">https://eprint.iacr.org/2026/1545</a></p></li></ul><h3 id="h-amortized-multi-verifier-proofs-from-reductions-of-knowledge" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Amortized Multi-Verifier Proofs from Reductions of Knowledge</h3><ul><li><p>Nikitas Paslis, Carla Ràfols, Alexandros Zacharakis</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1553">https://eprint.iacr.org/2026/1553</a></p></li></ul><h3 id="h-verifiable-outsourced-bte-with-silent-setup-achieving-constant-rate-batched-delegation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Verifiable Outsourced BTE with Silent Setup: Achieving Constant-Rate Batched Delegation</h3><ul><li><p>Kwangsu Lee</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1558">https://eprint.iacr.org/2026/1558</a></p></li></ul><h3 id="h-zero-knowledge-barcode-decoding-with-application-to-private-online-attribute-verification" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Zero Knowledge Barcode Decoding with Application to Private Online Attribute Verification</h3><ul><li><p>Kelsey Merrill, Anna Woo, Wenting Zheng, Sarah Scheffler</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1567">https://eprint.iacr.org/2026/1567</a></p></li></ul><h3 id="h-privacy-preserving-multi-signatures-achieving-transcript-aware-privacy" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Privacy-Preserving Multi-Signatures: Achieving Transcript-Aware Privacy</h3><ul><li><p>Yanzibo Zhou, Fuchun Guo, Willy Susilo, Nan Li</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1574">https://eprint.iacr.org/2026/1574</a></p></li></ul><h3 id="h-svps" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SVPs</h3><h4 id="h-solving-the-shortest-vector-problem-in-dollar206039ndollar-time-via-mid-point-hessian" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian</h4><ul><li><p>Minki Hhan</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1597">https://eprint.iacr.org/2026/1597</a></p></li></ul><h4 id="h-solving-the-shortest-vector-problem-in-dollar207314nondollar-time-via-discrete-gaussian-sampling-on-superlattices" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Solving the Shortest Vector Problem in $2^{0.7314n+o(n)}$ Time via Discrete Gaussian Sampling on Superlattices</h4><ul><li><p>Yiming Gao, Yansong Feng, Honggang Hu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1587">https://eprint.iacr.org/2026/1587</a></p></li></ul><h4 id="h-dimension-reduction-for-svp-in-hawk-a-trace-zero-approach" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Dimension Reduction for SVP in Hawk: A Trace-Zero Approach</h4><ul><li><p>Guilhem Mureau, Alice Pellet-Mary</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1560">https://eprint.iacr.org/2026/1560</a></p></li></ul><p><strong>If you’d like to receive updates via email, subscribe to us!</strong></p><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://paragraph.xyz/@zkinsights">https://paragraph.xyz/@zkinsights</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 2 Aug 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-2-aug-2026</link>
            <guid>tTHgnrjz4RNwg7owwgwS</guid>
            <pubDate>Sun, 02 Aug 2026 11:30:01 GMT</pubDate>
            <description><![CDATA[This week we have Anthropic cryptanalysis notes, 10 advances in math and TCS, quantum chip anatomy, Falcon, AVX-512 speedups, vector commitments, and secret sharing.]]></description>
            <content:encoded><![CDATA[<h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-some-thoughts-about-anthropics-new-cryptanalysis-results-matthew-green" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Some thoughts about Anthropic’s new cryptanalysis results ｜ Matthew Green</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.cryptographyengineering.com/2026/07/29/some-notes-about-anthropics-new-results/">https://blog.cryptographyengineering.com/2026/07/29/some-notes-about-anthropics-new-results/</a></p></li><li><p>中文翻译版：<a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/EZfWU9eEgLunbLFn1NTzYg">https://mp.weixin.qq.com/s/EZfWU9eEgLunbLFn1NTzYg</a></p></li></ul><h3 id="h-ten-advances-in-mathematics-and-theoretical-computer-science" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Ten advances in mathematics and theoretical computer science</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://openai.com/index/ten-advances-in-mathematics/">https://openai.com/index/ten-advances-in-mathematics/</a></p></li></ul><h3 id="h-why-quantum-chip-anatomy-matters" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Why quantum chip anatomy matters</h3><ul><li><p>How the layout of a quantum processing unit (QPU) influences quantum software compilation</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://open.substack.com/pub/realmscape/p/the-anatomy-of-a-quantum-chip?r=78jqeo&amp;utm_campaign=post-expanded-share&amp;utm_medium=web">https://open.substack.com/pub/realmscape/p/the-anatomy-of-a-quantum-chip?r=78jqeo&amp;utm_campaign=post-expanded-share&amp;utm_medium=web</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-toward-a-secure-fixed-point-implementation-of-the-falcon-signature-scheme" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Toward a Secure Fixed-Point Implementation of the Falcon Signature Scheme</h3><ul><li><p>Daniel De Almeida Braga, Pierre-Alain Fouque, Bachir Lachguel, Thomas Prest</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1531">https://eprint.iacr.org/2026/1531</a></p></li></ul><h3 id="h-masking-sequences-and-falcon-a-theoretical-study-on-masking-strategies-using-sequences-for-non-linear-operands-in-the-falcon-post-quantum-signature" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Masking, Sequences, and FALCON: A Theoretical Study on Masking Strategies Using Sequences for Non-Linear Operands in the FALCON Post-Quantum Signature</h3><ul><li><p>Pierre-Augustin Berthet</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1534">https://eprint.iacr.org/2026/1534</a></p></li></ul><h3 id="h-falcon-verify-on-avx-512-speed-records" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Falcon Verify on AVX-512: Speed Records</h3><ul><li><p>David Rubin, Emanuele Cesena</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1539">https://eprint.iacr.org/2026/1539</a></p></li></ul><h3 id="h-distributed-vector-commitments-and-their-applications" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Distributed Vector Commitments and Their Applications</h3><ul><li><p>Rui Gao, Huaqun Wang, Zhiguo Wan, Yuncong Hu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1514">https://eprint.iacr.org/2026/1514</a></p></li></ul><h3 id="h-convertinput-free-vector-homomorphic-secret-sharing-and-its-applications" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ConvertInput-Free Vector Homomorphic Secret Sharing and Its Applications</h3><ul><li><p>Fan Yang, Fucai Luo, Xingfu Yan, Haining Yang, Zheng Gong, Wing W. Y. Ng</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1517">https://eprint.iacr.org/2026/1517</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 26 Jul 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-26-jul-2026</link>
            <guid>hWAlXbKyNHXhPFKImumS</guid>
            <pubDate>Mon, 27 Jul 2026 05:58:46 GMT</pubDate>
            <description><![CDATA[This week we have BIP459 aggregation, falsifiability, STARK explainers, lookup arguments, proofs of space, adaptor signatures, recursive code switching, formal verification, FHE sorting, and ZK wallets.]]></description>
            <content:encoded><![CDATA[<h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-dahliasbip459-schnorr-kurt-pan" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">DahLIAS：BIP459 与 Schnorr 签名全聚合 ｜ Kurt Pan</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/Qzp2uSIxjDtnCV_uSvq4uQ">https://mp.weixin.qq.com/s/Qzp2uSIxjDtnCV_uSvq4uQ</a></p></li></ul><h3 id="h-" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">可證偽性的邊界</h3><ul><li><p>一門學科如何證明關於自己解釋能力的定理</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mp.weixin.qq.com/s/FzALCca6qXGd0-CbsTI6pg">https://mp.weixin.qq.com/s/FzALCca6qXGd0-CbsTI6pg</a></p></li></ul><h3 id="h-how-starks-work" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How STARKs Work?</h3><ul><li><p>Eli Ben-Sasson | Starknet.io</p></li><li><p>A simple explanation for non-mathematicians</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://x.com/EliBenSasson/status/2081285490553036988?s=20">https://x.com/EliBenSasson/status/2081285490553036988?s=20</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-celer-a-lookup-argument-for-large-scale-queries" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Celer: A Lookup Argument for Large-Scale Queries</h3><ul><li><p>Wenjie Qu, Yanpei Guo, Zhen Xuan, Xuanming Liu, Jiaheng Zhang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1453">https://eprint.iacr.org/2026/1453</a></p></li></ul><h3 id="h-a-complexity-theoretic-approach-to-proofs-of-space" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Complexity-Theoretic Approach to Proofs of Space</h3><ul><li><p>Marshall Ball, Jiaxin Guan</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1470">https://eprint.iacr.org/2026/1470</a></p></li></ul><h3 id="h-mu-qt-pegasis-interactive-aggregate-signatures-from-effective-isogenies-in-the-programmable-random-oracle-model" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Mu-qt-PEGASIS: Interactive Aggregate Signatures from Effective Isogenies in the Programmable Random-Oracle Model</h3><ul><li><p>Nouhou Abdou Idris, Mustapha Hedabou</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1474">https://eprint.iacr.org/2026/1474</a></p></li></ul><h3 id="h-persephone-zero-knowledge-multiplicative-non-negative-proof-for-sequential-private-range-verification" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">PERSEPHONE: Zero-Knowledge Multiplicative Non-Negative Proof for Sequential Private Range Verification</h3><ul><li><p>Ivan Tjuawinata, Yann Fraboni, Darian Gunamardi, Jun Jie Sim, Zhenghao Wu, Hasventhran Baskaran, Chi-Hung Chi, Pu Duan, Kwok-Yan Lam</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1477">https://eprint.iacr.org/2026/1477</a></p></li></ul><h3 id="h-practical-adaptor-signatures-security-and-applications" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Practical Adaptor Signatures: Security and Applications</h3><ul><li><p>Pavel Hubáček, Kristýna Mašková, Berenika Richterová</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1482">https://eprint.iacr.org/2026/1482</a></p></li></ul><h3 id="h-switchfold-code-agnostic-succinct-polynomial-commitments-via-recursive-code-switching" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SwitchFold: Code-Agnostic Succinct Polynomial Commitments via Recursive Code Switching</h3><ul><li><p>Mingshu Cong, Tsz Hon Yuen, Siu-Ming Yiu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1489">https://eprint.iacr.org/2026/1489</a></p></li></ul><h3 id="h-on-the-formal-verification-of-polynomial-commitments-two-kzg-constructions-and-the-algebraic-group-model" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">On the Formal Verification of Polynomial Commitments: two KZG constructions and the Algebraic Group Model</h3><ul><li><p>Tobias Rothmann</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1490">https://eprint.iacr.org/2026/1490</a></p></li></ul><h3 id="h-bob-dylean-a-framework-for-the-symbolic-analysis-of-cryptographic-protocols-in-lean" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Bob DyLean: A Framework for the Symbolic Analysis of Cryptographic Protocols in Lean</h3><ul><li><p>Théophile Wallez, Cas Cremers</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1493">https://eprint.iacr.org/2026/1493</a></p></li></ul><h3 id="h-oblivious-sorting-under-fully-homomorphic-encryption-a-comprehensive-survey-and-performance-analysis" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Oblivious Sorting under Fully Homomorphic Encryption: A Comprehensive Survey and Performance Analysis</h3><ul><li><p>Omar Ahmed, Rostin Shokri, Nektarios Georgios Tsoutsos</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1495">https://eprint.iacr.org/2026/1495</a></p></li></ul><h3 id="h-how-to-define-expected-quantum-polynomial-time-zero-knowledge-simulation" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How to Define Expected Quantum Polynomial-Time Zero Knowledge Simulation</h3><ul><li><p>Zhengnan Lai, Nicholas Spooner, Max Tromanhauser</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1500">https://eprint.iacr.org/2026/1500</a></p></li></ul><h3 id="h-zkposp-post-quantum-zero-knowledge-proofs-for-hierarchical-deterministic-wallets" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ZKPoSP: Post-Quantum Zero-Knowledge Proofs for Hierarchical Deterministic Wallets</h3><ul><li><p>Vincenzo Botta, Michal Pospieszalski, Emanuele Ragnoli, Justus Ranvier</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1508">https://eprint.iacr.org/2026/1508</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 19 Jul 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-19-jul-2026</link>
            <guid>ayTHZrlZozfXzL7TdHXA</guid>
            <pubDate>Sun, 19 Jul 2026 15:48:24 GMT</pubDate>
            <description><![CDATA[This week we have neurosymbolic formalization, crypto ownership after Q-Day, propositions as types, theorem provers meeting ZK, Groth16 on Bitcoin, Reed-Solomon agreement, verifiable e-voting, succinct range proofs, lattices, anonymous communication, and GPU-accelerated sumcheck.]]></description>
            <content:encoded><![CDATA[<h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-neurosymbolic-approaches-to-natural-language-formalization-what-is-state-of-the-art" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Neurosymbolic approaches to natural language formalization: what is state-of-the-art?</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.icme.io/neurosymbolic-approaches-to-natural-language-formalization-what-is-state-of-the-art/">https://blog.icme.io/neurosymbolic-approaches-to-natural-language-formalization-what-is-state-of-the-art/</a></p></li></ul><h3 id="h-proving-crypto-ownership-after-q-day" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Proving Crypto Ownership After Q-Day</h3><ul><li><p>How do you prove ownership of a wallet after quantum computers can forge its signatures?</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/binius-zk/binius64/tree/bip32-demo-cli/crates/bip32-sig/src">https://github.com/binius-zk/binius64/tree/bip32-demo-cli/crates/bip32-sig/src</a></p></li></ul><h2 id="h-videos" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Videos</h2><h3 id="h-propositions-as-types-by-philip-wadler" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Propositions as Types by Philip Wadler</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.youtube.com/watch?v=IOiZatlZtGU">https://www.youtube.com/watch?v=IOiZatlZtGU</a></p></li></ul><h3 id="h-alex-ozdemir-on-where-theorem-provers-and-zk-meet" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Alex Ozdemir on where Theorem Provers and ZK meet</h3><ul><li><p>This week, Anna and Nico are joined by Alex Ozdemir, Assistant Professor at Georgia Tech, to explore the intersection of formal verification and zero knowledge. They begin by revisiting the evolution of the ZK DSL landscape since Alex's last appearance, discussing the rise of ZKVMs, new language tooling, and how his compiler infrastructure project, CirC, has evolved.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://youtu.be/tv6rTGxwWuM?si=fDKgidg_k5xFVi0O">https://youtu.be/tv6rTGxwWuM?si=fDKgidg_k5xFVi0O</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-trapgc-dv-trapdoor-garbled-circuit-designated-verification-of-groth16-on-bitcoin" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">TRAPGC-DV: Trapdoor Garbled Circuit Designated Verification of Groth16 on Bitcoin</h3><ul><li><p>Ariel Futoransky, Fadi Barbàra, Ramses Fernandez, Gabriel Larotonda, Sergio Demian Lerner</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1430">https://eprint.iacr.org/2026/1430</a></p></li></ul><h3 id="h-reed-solomon-mutual-correlated-agreement-beyond-the-johnson-radius" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Reed–Solomon Mutual Correlated Agreement Beyond the Johnson Radius</h3><ul><li><p>Sunghyeon Jo</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1432">https://eprint.iacr.org/2026/1432</a></p></li></ul><h3 id="h-filtrumvote-scalable-verifiable-and-coercion-resistant-internet-voting" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">FiltrumVote: Scalable, Verifiable, and Coercion-Resistant Internet Voting</h3><ul><li><p>Leonardo Kimura, Dimitri Leskow, Diego F. Aranha, Roberto Araújo, Marcos Simplicio</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1435">https://eprint.iacr.org/2026/1435</a></p></li></ul><h3 id="h-sok-on-the-design-of-secure-ranking-based-e-voting-systems" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SoK: On the Design of Secure Ranking-based E-voting Systems</h3><ul><li><p>Luke Harrison, Feng Hao, Bowen Zheng, Bingsheng Zhang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1437">https://eprint.iacr.org/2026/1437</a></p></li></ul><h3 id="h-rarus-a-succinct-and-efficient-range-proof-for-polynomial-based-vector-commitment" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Rarus: A Succinct and Efficient Range Proof for Polynomial-based Vector Commitment</h3><ul><li><p>Xinyang Yang, Wenjie Qu, Yanpei Guo, Jiaheng Zhang</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1440">https://eprint.iacr.org/2026/1440</a></p></li></ul><h3 id="h-an-dollarnnondollar-time-algorithm-for-the-lattice-isomorphism-problem" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">An $n^{n+o(n)}$-Time Algorithm for the Lattice Isomorphism Problem</h3><ul><li><p>Divesh Aggarwal, Kaijie Jiang, Zihan Li, Yinchen Liu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1406">https://eprint.iacr.org/2026/1406</a></p></li></ul><h3 id="h-anonymous-communication-on-expander-networks" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Anonymous Communication on Expander Networks</h3><ul><li><p>Megumi Ando, Hannah Lynn, Anna Lysyanskaya, Eli Upfal</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1404">https://eprint.iacr.org/2026/1404</a></p></li></ul><h3 id="h-on-the-differential-uniformity-of-polynomials-over-galois-rings" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">On the Differential Uniformity of Polynomials over Galois Rings</h3><ul><li><p>Sondre Rønjom, Arne Sandrib</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1393">https://eprint.iacr.org/2026/1393</a></p></li></ul><h3 id="h-chimera-a-hybrid-gpu-backend-for-sumcheck-acceleration-in-zero-knowledge-provers" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Chimera: A Hybrid GPU Backend for Sumcheck Acceleration in Zero Knowledge Provers</h3><ul><li><p>Kashfia Farheen, Nektarios Georgios Tsoutsos</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1388">https://eprint.iacr.org/2026/1388</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/484d07b9b28883bdff6cae6f220405f5cefeaa2b2b37d47b1bf9187ae432db44.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 5 Jul 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-5-jul-2026</link>
            <guid>qQfdwvrEQM1fhu8J9oHa</guid>
            <pubDate>Sun, 05 Jul 2026 10:29:44 GMT</pubDate>
            <description><![CDATA[This week we have verified zkVMs, quantum canaries, post-quantum migration notes, Leanstral 1.5, Quantum Bitcoin, Flock, stateful signatures, RWA proofs...]]></description>
            <content:encoded><![CDATA[<h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-clean-from-verified-circuits-to-verified-zkvms" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Clean: From Verified Circuits to Verified zkVMs</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.zksecurity.xyz/posts/clean-verified-zkvms/">https://blog.zksecurity.xyz/posts/clean-verified-zkvms/</a></p></li><li><p>Git repo: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/Verified-zkEVM/clean">https://github.com/Verified-zkEVM/clean</a></p></li></ul><h3 id="h-building-quantum-canaries-and-tripwires-with-smart-contracts" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Building quantum canaries and tripwires with smart-contracts</h3><ul><li><p>This blog post will take a look at the options for constructing such "quantum canaries" and outline why smart-contract capable chain such as Ethereum can host even more powerful constructs, without requiring any changes to the underlying blockchain.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.randomoracle.io/2026/06/15/building-quantum-canaries-and-trip-wires-with-smart-contracts/">https://blog.randomoracle.io/2026/06/15/building-quantum-canaries-and-trip-wires-with-smart-contracts/</a></p></li></ul><h3 id="h-google-is-switching-to-ecdsa-certificates-that-is-not-the-post-quantum-migration" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Google Is Switching to ECDSA Certificates. That Is Not the Post-Quantum Migration.</h3><ul><li><p>By Encryptorium</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://encryptorium.medium.com/google-is-switching-to-ecdsa-certificates-that-is-not-the-post-quantum-migration-8b9dd5da09c7">https://encryptorium.medium.com/google-is-switching-to-ecdsa-certificates-that-is-not-the-post-quantum-migration-8b9dd5da09c7</a></p></li></ul><h2 id="h-project" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Project</h2><h3 id="h-leanstral-15-proof-abundance-for-all" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Leanstral 1.5: Proof Abundance for All</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mistral.ai/news/leanstral-1-5/">https://mistral.ai/news/leanstral-1-5/</a></p></li></ul><h2 id="h-video" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Video</h2><h3 id="h-whats-up-with-quantum-bitcoin" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">What's up with Quantum Bitcoin?</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://x.com/blockspace/status/2069809679736193380">https://x.com/blockspace/status/2069809679736193380</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-signing-it-twice-mitigating-the-effects-of-state-reuse-for-stateful-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Signing It Twice: Mitigating the Effects of State Reuse for Stateful Signatures</h3><ul><li><p>Niels Duif, Daan S. Meijer</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1321">https://eprint.iacr.org/2026/1321</a></p></li></ul><h3 id="h-flock-fast-proving-for-batch-boolean-computations" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Flock: Fast Proving for Batch Boolean Computations</h3><ul><li><p>Benedikt Bünz, Ron Rothblum, William Wang</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1329">https://eprint.iacr.org/2026/1329</a></p></li></ul><h3 id="h-real-world-qualification-proof-a-protocol-for-supporting-real-world-assets-in-defi" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Real-world Qualification Proof: A Protocol for Supporting Real-world Assets in DeFi</h3><ul><li><p>Xiaohan Yue, Haoran Si, Fucai Zhou, Jian Xu, Yong Yu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1330">https://eprint.iacr.org/2026/1330</a></p></li></ul><h3 id="h-principles-for-prhl-proofs-of-cryptographic-protocols-how-to-convince-easycrypt-that-your-protocol-is-secure" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Principles for pRHL Proofs of Cryptographic Protocols: How to Convince EasyCrypt that your Protocol is Secure</h3><ul><li><p>Manuel Barbosa, François Dupressoir, Cameron Low, Charlotte Mylog, Sabine Oechsner, Théo Vignon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1334">https://eprint.iacr.org/2026/1334</a></p></li></ul><h3 id="h-falafel-modular-zero-knowledge-proofs-of-training-in-the-federated-setting" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Falafel: Modular Zero-Knowledge Proofs of Training in the Federated Setting</h3><ul><li><p>Tariq Bontekoe, Sven Bootsma, Vincent Dunning, Thom Sijpesteijn, Thomas Attema</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1335">https://eprint.iacr.org/2026/1335</a></p></li></ul><h3 id="h-on-canonical-liftings-group-actions-and-linkable-ring-signatures" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">On Canonical Liftings, Group Actions, and (Linkable) Ring Signatures</h3><ul><li><p>Alessandro Budroni, Giuseppe D'Alconzo, Leonardo Errati, Edoardo Persichetti</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1348">https://eprint.iacr.org/2026/1348</a></p></li></ul><h3 id="h-spain-succinct-proofs-for-numerical-computations" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Spain: Succinct proofs for numerical computations</h3><ul><li><p>Zachary DeStefano, Noah Golub, Zile Huang, Julius Zhang, Sam Frank, Michael Walfish</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1356">https://eprint.iacr.org/2026/1356</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p><br>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[ZK Insights | 28 June 2026]]></title>
            <link>https://paragraph.com/@zkinsights/zk-insights-or-28-june-2026</link>
            <guid>h6qtQSuRt5t9G29e01lU</guid>
            <pubDate>Sun, 28 Jun 2026 19:38:54 GMT</pubDate>
            <description><![CDATA[This week we have Flock for proving standard hashes, LeanIMT+, IP=PSPACE, confidential transactions, and lattice-based folding.]]></description>
            <content:encoded><![CDATA[<h2 id="h-blogs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Blogs</h2><h3 id="h-how-close-can-proving-get-to-computing" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">How Close Can Proving Get to Computing?</h3><ul><li><p>Introducing Flock: a new SNARK for proving batches of standard hash functions at just 250× the cost of computing them natively.</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://blog.succinct.xyz/introducing-flock/?ref=succinct-newsletter">https://blog.succinct.xyz/introducing-flock/?ref=succinct-newsletter</a></p></li><li><p>Git repo: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/succinctlabs/flock?ref=blog.succinct.xyz">https://github.com/succinctlabs/flock?ref=blog.succinct.xyz</a></p></li><li><p>Paper: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/succinctlabs/flock/blob/main/paper/flock-paper.pdf">https://github.com/succinctlabs/flock/blob/main/paper/flock-paper.pdf</a></p></li></ul><h3 id="h-leanimt-efficient-merkle-tree-for-membership-and-non-membership-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">LeanIMT+: Efficient Merkle Tree for Membership and Non-Membership Proofs</h3><ul><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://pse.dev/blog/lean-imt-plus-efficient-merkle-tree-for-membership-and-non-membership-proofs">https://pse.dev/blog/lean-imt-plus-efficient-merkle-tree-for-membership-and-non-membership-proofs</a></p></li></ul><h2 id="h-papers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Papers</h2><h3 id="h-towards-a-doubly-efficient-ippspace" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Towards a Doubly Efficient IP=PSPACE</h3><ul><li><p>Liyan Chen, Matthew M. Hong, Yael Tauman Kalai, Zoe Xi</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1287">https://eprint.iacr.org/2026/1287</a></p></li></ul><h3 id="h-succinct-succinct-confidential-transaction-for-miner-privacy" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">SuccinCT: Succinct Confidential Transaction for Miner Privacy</h3><ul><li><p>Ying-Teng Chen, Tsz Hon Yuen, Dongkun Hou, Jie Xu, Joseph K. Liu, Wayne Yang, Jiangshan Yu</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1288">https://eprint.iacr.org/2026/1288</a></p></li></ul><h3 id="h-a-toolkit-for-succinct-lattice-based-zero-knowledge-proofs" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">A Toolkit for Succinct Lattice-Based Zero Knowledge Proofs</h3><ul><li><p>Beatrice Biasioli, Madalina Bolboceanu, Vadim Lyubashevsky, Antonio Merino-Gallardo, Michał Osadnik, Gregor Seiler, Patrick Steuer</p></li><li><p>Recommend: <span data-name="glowing_star" class="emoji" data-type="emoji">🌟</span></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1289">https://eprint.iacr.org/2026/1289</a></p></li></ul><h3 id="h-structured-lattices-and-their-applications-to-security" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">STRUCTURED LATTICES AND THEIR APPLICATIONS TO SECURITY</h3><ul><li><p>LENNY FUKSHANSKY, CAMILLA HOLLANTI, RAHINATOU Y. NJAH NCHIWO</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1301">https://eprint.iacr.org/2026/1301</a></p></li></ul><h3 id="h-protogalattice-constant-round-lattice-based-folding-for-general-polynomial-relations" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">ProtogaLattice: Constant-Round Lattice-based Folding for General Polynomial Relations</h3><ul><li><p>David Balbás, Anca Nitulescu, Maxime Plançon</p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2026/1317">https://eprint.iacr.org/2026/1317</a></p></li></ul><hr><p>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!</p><p><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>Web collection version:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://insights.zkpunk.pro/"><strong>https://insights.zkpunk.pro/</strong></a><br><span data-name="sparkles" class="emoji" data-type="emoji">✨</span> <strong>GitHub repo link:</strong> <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ZKPunk-Org/zk-insights"><strong>https://github.com/ZKPunk-Org/zk-insights</strong></a></p>]]></content:encoded>
            <author>zkinsights@newsletter.paragraph.com (ZK Insights)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/05827f49cc60845dcee5bcfce3a62b5201d7c1b9963db8e67e0a808528eb9085.jpg" length="0" type="image/jpg"/>
        </item>
    </channel>
</rss>