In case you want a gentle introduction to one of the key paradigms behind lattice-based signatures (Fiat-Shamir with Aborts), make sure to read our latest blog:
Hash-based signatures are the most conservative post-quantum option for Bitcoin. Lattice-based cryptography could be what comes next, potentially opening the door to post-quantum multisignatures, zero-knowledge proofs, and confidential assets.
Read the latest from @blksresearch. 🔗 ⬇️
A written version of my recent @OPNEXT2026 talk, with extra details and references. It covers SHRINCS/SHRIMPS, the design space of post-quantum signatures for Bitcoin (especially hash-based ones), and a toy proposal for OP_CHECKSPHINCS.
Our newest sum-check optimizations are out!
We propose a *better* domain for sum-check: the infinity hypercube.
Evaluations over this domain give *precisely* the monomial coefficients, and lead to a ~10% prover speedup over 128+ bits prime fields
🧵/ n
We have an update on the proximity prize: a 1m$ initiative to prove or disprove coding theoretic conjectures, with applications to shorter quantum-secure proof systems.
We have released the first draft:
cc @GalArnon42 and @danboneh
Excited to share that our DahLIAS paper has been accepted to Eurocrypt 2026! 🎉
DahLIAS enables cross-input signature aggregation (CISA) on Bitcoin’s secp256k1 curve.
See you in Rome, May 10–14!
Thanks to @yannickseurin (@ledger), @real_or_random & @n1ckler (@blksresearch)!
Aptos mainnet will enable 🔒 confidential assets 💸 very soon!!
i.e., encrypted balances & transaction amounts 🔐, albeit with publicly-visible 🌍 sender & recipient addresses!
(One step at a time, folks...)
Here's how they work! 🤓👇
We just published "Hash-based signatures for Bitcoin," a new analysis of post-quantum schemes by @kudinov_mikhail and myself at @blksresearch.
This paper serves as a gentle intro to hash-based schemes and explores how to optimize them specifically for application in Bitcoin. 🧵