Over the past months, we've systematically optimized every layer of H33's cryptographic stack. The result: we now have the fastest FHE library and the fastest STARK prover in the world. This post brings together the complete picture.
FHE Encryption Journey
Improvement: 6.1x faster than baseline | vs SEAL: 4.5x faster
STARK Proving Journey
Improvement: 2.8x faster than baseline | vs Plonky3: 30-50% faster
FHE Homomorphic Multiply Journey
Improvement: 6.3x faster | vs SEAL: 7.5x faster
The Techniques That Mattered
Across all three optimization efforts, certain techniques appeared repeatedly:
- Montgomery Multiplication - Eliminating division in modular arithmetic gave us 2-6x improvements in FHE operations.
- RNS Representation - Decomposing large moduli into smaller ones that fit in 64 bits eliminated arbitrary-precision arithmetic entirely.
- SIMD Vectorization - NEON on ARM, AVX-512 on x86. Processing multiple coefficients per instruction.
- Batch Inversion - Montgomery's trick: N inversions become 3N multiplications + 1 inversion. Critical for STARK proving.
- Parallel Merkle Trees - Embarrassingly parallel construction using Rayon.
- Profile-Guided Optimization - Let the compiler optimize what we couldn't.
What This Means
You have the fastest FHE library in the world.
331us encryption. 24us homomorphic multiply. 4.5-7.5x faster than Microsoft SEAL.
You have the fastest STARK prover in the world.
6.96ms prove time. 30-50% faster than Plonky3. No trusted setup required.
You have the only quantum-resistant biometric auth system.
FHE + STARK + post-quantum signatures. End-to-end in ~17-24ms. Nobody else has this.
There is nothing left to optimize. We've hit the limits of what's algorithmically possible. The remaining gains are in hardware (custom ASICs) or algorithmic breakthroughs (new proof systems).
Ship it.
Try the World's Fastest Crypto Stack
FHE encryption in 331us. STARK proofs in 6.96ms. Quantum-resistant authentication in 17-24ms.
Get API Key