Highlights
Introducing the ZK Catalog
Ariel Gabizon UJ crypto course: the KZG PCS scheme and PlonK SNARK
Disarming Fiat-Shamir footguns
Building a Decentralized Privacy Preserving Order Book Exchange on Polygon Miden
FRIDA: Data-Availability Sampling from FRI
Montgomery Multiplication
Many algorithms in number theory, like prime testing or integer factorization, and in cryptography, like RSA, require lots of operations modulo a large number. The Montgomery (modular) multiplication is a method that allows computing such multiplications faster. Instead of dividing the product and subtracting n multiple times, it adds multiples of n to cancel out the lower bits and then just discards the lower bits.
zkPages
Zero-knowledge digital content single page store fronts. Enable anyone to create a secure digital content store front page on Starknet. Privacy-focused checkouts.
zKastle
zKastle is a solo strategy card game. Manage resources, and upgrade your village to make the maximum points possible. Make tactical decisions to help your village grow and flourish.
Solas
An attestation / citation system built on starknet using Cairo and starknet tooling.
Ingopedia
A comprehensive collection of resources and information related to Zero Knowledge Proofs from Ingonyama
Updates
ZK Summit 11 Retrospective
Reflections on NFC cards and advanced cryptography at ZK Summit 11
zkStudyClub - FRI-Binius: Polylogarithmic Proofs for Multilinears over Binary Towers (Ben Diamond)
Cloaking Layer - zCloak Network released its universal ZKP verification infrastructure for all blockchains
HyperNova: Recursive arguments for customizable constraint systems
The paper is now updated. The newly added content highlights a new use of folding schemes. Previously, folding schemes were used to construct IVC. We now show that certain folding schemes (e.g., Nova's) unlock a new approach to add ZK in proof systems.
Papers
【论文速递】STOC 2024（量子、电路、单向函数、承诺、零知识、证明、不可区分混淆、格基SNARKs）
On the vector subspaces of over which the multiplicative inverse function sums to zero
The Sum-Check Protocol over Fields of Small Characteristic
Constraint-Packing and the Sum-Check Protocol over Binary Tower Fields
A note on adding zero-knowledge to STARKs
A note on the G-FFT
Sparsity-Aware Protocol for ZK-friendly ML Models: Shedding Lights on Practical ZKML
Dong Mo博士团队新做的一个ZKML的工作。主要讲的是通过ternary network可以将神经网络模型 （LLM之类）无损压缩和整数化，并且在这种简化的基础上面设计了一个叫SpaGKR的ZK算法，实现高效ZKML inference。目前初步测下来能做到100X以上的速度提升，之后会补实验部分。