ZK BIP32 derivation proofs, post-quantum and client-side 🤤 An excellent example of what Binius64 is great at, and a potential practical answer for one of the harder questions a chain’s post quantum migration must answer - how do you prove a coin is yours once a quantum attacker can forge the same signature? Instead of signing some message to prove an address is yours, you prove you know how it was derived instead. Signatures don’t survive quantum computers but hashes do and derivation is all about hashes. It’s also super fast; ~240ms proof gen, ~40ms verification, on a laptop, CPU only. Faster than previous work by 16x. And the only security assumption is SHA-256. Pleasure working with @jimpo_potamus on this.

I've been working on a post-quantum cryptography registry/wiki and it's now live. If you're an engineer trying to evaluate PQC algorithms side by side, you have to piece together information from FIPS documents, ePrint papers, mailing list threads, and scattered READMEs. There are some existing resources out there for parameter sets but I wanted something that goes much further and includes everything; algorithm descriptions, use case and feature filtering, benchmarks, implementation references, and wiki-style prose all in one place with a consistent schema. So that's what this is. It covers nine algorithms today; the NIST standards (ML-KEM, ML-DSA, SLH-DSA), the NIST pipeline (FN-DSA, HQC), blockchain-specific schemes (SHRINCS, SHRIMPS, leanSig), and XMSS. There are a lot more I want to add and the registry is open source so contributions are welcome.