🌱 TIL: Field multiplications are faster than hashing!
tl;dr: I ran some benchmarks and was surprised to learn that multiplying two BLS12-381 scalar field elements is ~5.5x faster than hashing 64 bytes with Blake3.
🌲 Learning parity with noise (LPN)
tl;dr: A very useful cryptographic assumption that is related to coding theory.
🌱 Curve trees
tl;dr: A few notes on the beautiful curve tree[^CHK22e] work by Campanelli, Hall-Andersen and Kamp.
⭐️ Chunky: Weighted PVSS and DKG for field elements
tl;dr: A work-in-progress weighted PVSS for field elements using chunked ElGamal encryption and DeKART range proofs.
🌱 $\Sigma$-phore
tl;dr: A primitive much more powerful than Semaphore, that we’d like to build without zkSNARKs.
110 post articles, 14 pages.