Untraceable transactions (UTT)
tl;dr:
UTT is Chaumiam ecash done the right way: efficiently, decentralized and with sensible-anonymity: a user can only send (say) $\$L$ coins per month (assuming a Sybil-resistant proof-of-humanity system).
UTT is academic work that started in 2018 at VMware, was rebooted in 2021 and now lives as an eprint[^TBAplus22e].
UTT did see deployment...
Complete vs. full vs. perfect binary trees
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 ...
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.
96 post articles, 12 pages.