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.
Zero-knowledge digital content single page store fronts. Enable anyone to create a secure digital content store front page on Starknet. Privacy-focused checkouts.
https://ethglobal.com/showcase/zkpages-n3aro
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.
https://ethglobal.com/showcase/zkastle-jeh44
Solas
An attestation / citation system built on starknet using Cairo and starknet tooling.
https://ethglobal.com/showcase/solas-pekhm
Ingopedia
A comprehensive collection of resources and information related to Zero Knowledge Proofs from Ingonyama
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.