In which I try to naively apply the Fiscal Theory of the Price Level (a theory of inflation and fiat currency valuation) to tokens and blockchains.
In which I ramble about some ideas for a new graphical language for cryptographic proofs, and why proofs matter anyways.
In which I talk about stealing the notion of parametricity from functional programming to define idealized models of cryptographic objects.
In which I describe some very early research thoughts about so-called “meta-cryptography”: the analysis of cryptographic models and their interconnections. Guest starring “Category Theory”.
In which I talk about some research I intend to undertake this semester, from threshold ECDSA, to bulletin boards, to robust Schnorr signatures.
In which I talk about CAIT-SITH, and why it’s a pretty cool threshold ECDSA scheme with good implementation ideas and performance.
- 0x00122023 is the New 1971
Or why AI will not cause the economy to grow a bajillion times by 2030
In which I rant about how much mindspace Homomorphic Encryption occupies, and how this is similar to Machine Learning vs Computing.
- 0x0010Bulletin but not Bored
Why alphabetical references are better than numerical, why round complexity is of limited utility, and more!
In which I talk about ECDSA, and various ways of thresholdizing it.
In which I give a high level overview of threshold signatures and how they work.
- 0x000DOn Comparing SNARKs
Why it’s difficult to compare SNARKs together, and why it would be nice to have a centralized table benchmarking and comparing them nonetheless, among other topics.
- 0x000CWhat is security?
What do we mean when we say some piece of cryptography is secure? What are cryptographic assumptions? How does modelling security fail in practice?
In which I explain what the Fiat-Shamir transform is, and go over some thoughts on good ways to implement it in practice.
In which I talk about my recent paper of the same name.
On Zero-Knowledge Proofs and Machine Learning, the centralizing force of Machine Learning, and more!
- 0x0008Ok Algebraic Automaton
What exactly counts as a SNARK? Why do some proof systems need structured computation, and what are its limits? Why are boolean circuits so neat? And more!
How useful is the semi-honest security model? How to integrate MPC at scale? Block producer privacy, and more!
On boolean circuits and their various representations. Why WASM is an interesting ZK proof bytecode. Chunky vs SIMD operations, and more!
What is Tornado Cash anyways? Why is the U.S. Treasury sanctioning it? What are the consequences of this decisions? How should we regulate privacy coins anyways?
- 0x0004MPC In The Head Special
Did you know that not all ZK proofs are SNARKs? Do you want to know how to make concretely efficient ZK proofs? (Terms and conditions may apply). This is the episode for yo
Press F for SIDH, and then… Problems, Primitives, Schemes, Protocols, and Applications oh my!
What is Post-Quantum Cryptography? Can we trust the NIST standardization process? Can we update secure messaging protocols to a Post-Quantum world? And more!
Why are appendices in cryptography papers so long? Can we augment LLVM for boolean and arithmetic circuits? What’s the deal with STARK to SNARK composition?