╔═══════════════════════════════════════════════════════════════════════╗
║ ║
║ ███████╗ █████╗ ████████╗██╗ ██╗██████╗ ██████╗ █████╗ ██╗ ██╗ ║
║ ██╔════╝██╔══██╗╚══██╔══╝██║ ██║██╔══██╗██╔══██╗██╔══██╗╚██╗ ██╔╝ ║
║ ███████╗███████║ ██║ ██║ ██║██████╔╝██║ ██║███████║ ╚████╔╝ ║
║ ╚════██║██╔══██║ ██║ ██║ ██║██╔══██╗██║ ██║██╔══██║ ╚██╔╝ ║
║ ███████║██║ ██║ ██║ ╚██████╔╝██║ ██║██████╔╝██║ ██║ ██║ ║
║ ╚══════╝╚═╝ ╚═╝ ╚═╝ ╚═════╝ ╚═╝ ╚═╝╚═════╝ ╚═╝ ╚═╝ ╚═╝ ║
║ ║
║ ██╗ █████╗ ██████╗ ███████╗ ║
║ ██║ ██╔══██╗██╔══██╗██╔════╝ ║
║ ██║ ███████║██████╔╝███████╗ ║
║ ██║ ██╔══██║██╔══██╗╚════██║ ║
║ ███████╗██║ ██║██████╔╝███████║ ║
║ ╚══════╝╚═╝ ╚═╝╚═════╝ ╚══════╝ ║
║ ║
║ proofs · fields · kernels. ║
║ ║
╚═══════════════════════════════════════════════════════════════════════╝
> 64K FIELD ELEMENTS FREE
Cryptography, proof systems and high-performance kernels, built from first principles.
Saturday Labs is an open research and engineering lab. We pick a primitive, a protocol or a kernel, derive it on paper, and implement it from scratch. Every implementation is tested against a reference and benchmarked. We publish the code and what we learned from building it.
- Zero-knowledge proof systems: sumcheck, GKR, FRI, WHIR, PLONK, folding schemes
- Field and polynomial arithmetic: finite fields, extension fields, NTTs, multilinear extensions
- GPU computing: parallel primitives, matrix multiplication, fused kernels for ML and cryptography
- Where they meet: GPU-accelerated provers, and verifiable computation for machine learning
- First principles. Understand why something works before optimizing it.
- Reference first. A naive, obviously correct version comes before the fast one.
- Measured. If it's described as fast, there's a benchmark to back it up.
- In the open. Code, notes and mistakes are all public.
Built on Saturdays.
