Home

tl;dr: The terms full, complete, and perfect binary tree are often confused with each other. In this short post, we define each one, give examples, and work out all the relationships between them — including the perhaps-surprising fact that full + complete does not imply perfect. Real quickly, the Venn diagram below shows how the three classes ...

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.

tl;dr: A very useful cryptographic assumption that is related to coding theory.

tl;dr: A very much celebrated protocol.

tl;dr: Some notes on post-quantum (PQ) signature schemes.

tl;dr: A few notes on the beautiful curve tree[^CHK22e] work by Campanelli, Hall-Andersen and Kamp.

tl;dr: How to think clearly about domain separation in your protocols.

tl;dr: A work-in-progress weighted PVSS for field elements using chunked ElGamal encryption and DeKART range proofs.