Pinned Tweet
Pleased to announce PQConnect: pqconnect.net Easy-to-install software for your Linux box (more OSes coming later) to protect network applications against future quantum computers. Paper will appear at NDSS 2025. Joint work with @hyperelliptic, Jonathan Levin, @bo_yin.
Daniel J. Bernstein retweeted
Yesterday I told John Harrison that a "certain person" said that HOL Light was not up to the job of checking the Navier–Stokes paper. Today he has a proof, and it's 8% shorter than the Lean one. Claude converted the full 166 pages.
Daniel J. Bernstein retweeted
Replying to @Timeroot
I asked, "Are you sure?" They replied that they'd verified it in Lean. I said, "OK but are you sure?"
Daniel J. Bernstein retweeted
Fil-C PHP without the CVE patch already thwarts the StealMyBitcoin exploit chain
A new paper eprint.iacr.org/2026/2622 says that square-matrix-multiplication exponents below 9/4 would also reduce the exponent of lattice sieving. If that's correct, can it be generalized to use non-square matrix mult? "Rectangular" matrix mult is faster than square matrix mult.
Daniel J. Bernstein retweeted
You won't believe how many people told me over the past 10+ years that proof assistants would never achieve widespread use, and that my work was therefore not useful. Ignore people who discount entire fields of research because they are hard. All the more motivation for research
There's a survey by Neale Pickett from January of tools to convert git repos to static HTML: woozle.org/blog/2026/01-30-s… I'm intrigued by the gitpages approach of showing the current files (rendering md etc.) while requiring cloning to see the history; is that too minimal?
Daniel J. Bernstein retweeted
Rather last minute but we're doing another TDL chat round on PQC on Mon afternoon (26 Oct 16:00 CET)
trustindigitallife.eu/event/…
Daniel J. Bernstein retweeted
Service announcement:
the call for affiliated workshops for Eurocrypt 2027 is open eurocrypt.iacr.org/2027/call…
Submission deadline is 16 Nov, notification on 1 Dec.
Daniel J. Bernstein retweeted
Beginning to feel that @filpizlo orchestrated today as guerrilla marketing for Fil-C
Daniel J. Bernstein retweeted
if you have tokens to spare, consider having your agents use github.com/mbrock/filnix as a base camp for porting and verifying some important or amusing C/C++ packages building with Fil-C for memory safety
Daniel J. Bernstein retweeted
memory safe PHP 8.4.25 built with Fil-C as Docker images (compatible with official php images) and as a single relocatable directory for Linux that doesn’t depend on any system libraries
github.com/mbrock/filnix/rel…
Daniel J. Bernstein retweeted
How often do ArXiv papers contain errors in the main theorems they claim to prove? Using GPT-6.1 Sol to identify such mistakes, it finds:
- 6% of papers before 08/2026 contain main theorems that are false.
- Only 1.5% contain similar mistakes in the last two months.
Posted slides for my talk "Getting a subroutine right: a case study" today: cr.yp.to/talks.html#2026.10.… The case study I picked for the talk is integer sorting. The broader point is the multifaceted engineering benefit of limiting data flow from inputs to branches and array indices.
Daniel J. Bernstein retweeted
Fun fact: xz has extremely low Fil-C overhead. The overhead of Fil-xz is lower than the performance increases in latest versions of xz.
In many cases, using the latest version of xz compiled with Fil-C results in better performance than using your distro's version of xz.
Like you, I have a job trying to solve real-world problems. Did you realize how much of our tax money goes to pure mathematicians wandering around inventing and understanding pointless theory stuff like this PDF? web.archive.org/web/20031205… Oh, oops, wait: quantamagazine.org/post-quan…
Daniel J. Bernstein retweeted
The big open question is: Are we witnessing the vulnpocalypse or the bugocide?
Cryptography and computer security have all these cool attack names like CRIME and Spectre and the Slicer. I found a great name for the attack that I'm currently working on: I call it the Terminator. I've already proven that the algorithm terminates.
Gave a talk today cr.yp.to/talks/2026.10.09/sl… reviewing the 35, oops, no, 37 lattice-cryptanalysis papers that appeared on eprint in the past 365 days. I decided to focus on cryptanalysis of conventional lattice problems; didn't include, e.g., the papers on HAWK.
Daniel J. Bernstein retweeted
I don't recommend anyone scramble to move their funds to new wallets today. But we should take the risks to cryptography from AI-accelerated math seriously, and minimize our exposure to not just quantum-vulnerable cryptography, but also potentially AI-vulnerable cryptography.
The core new area of risk from this viewpoint is, unfortunately, ML-DSA / FHE / lattices.
(and it's also another reason, along with quantum, why ECDSA might fall even faster than expected, hence the "fresh address" recommendation)
So far most people have been in the mode of thinking "elliptic curves broken, hashes safe, lattices safe". But there is a good chance that the concrete security of lattices will take serious hits from the next two years of AI math.
The basic threat model is: factoring is something that naively takes 2^(n/2) time, but over decades smart people have found and optimized number field sieves, and degraded that to 2^O(n^(1/3)), which is why RSA keys and signatures need to be ~400 bytes (and not 64 bytes). What if there are skeletons in the closet like that, both for elliptic curves and lattices, that we are simply not smart enough to discover - but bots soon will be?
This is a major part of the reason why for the past year ethereum's lean roadmap has been going in the "hash-only" direction: no lattices, no ML-DSA, no Falcon, no lattice-based commitments inside ZK proofs, etc. Signatures in lean ethereum are all hash-based, either WOTS or SPHINCS-.
For signatures and proofs, we already know how to go hash-only. The bigger challenge is for *public-key encryption* - and this goes far beyond blockchains. Secure communication, anonymizing protocols, lots of things need public-key encryption.
And unfortunately there are long-standing mathematical theorems showing why public-key encryption cannot be done with hashes alone. You have to have some kind of trapdoor object that has at least one form of usable "structure" - either group theory (incl. isogenies) or lattices or code-based or potentially in the future even more newfangled and spooky things (local mixing?). But for anything that has structure, you should assume that AI will make at least some progress in breaking that structure. Here, one reasonable inference is that if you want to make something plausibly long-term secure, multiply the key sizes by 10.
To me that's a very plausible world and something not at all extreme to predict. If AI will bring us 50 years of math in 2 years, then that 50 years of math may very plausibly include a "naive factoring -> GNFS" level of improvement to our ability to break lattices. In that world, lattices will still exist, but they will have to be significantly bigger to guarantee the same level of safety.
And at those new larger sizes, hash-based constructions will beat lattice-based constructions on concrete efficiency in every use case where hash-based constructions are possible at all.
Theoretically, of course it's possible that hashes are broken too (eg. P = NP would imply that). But I think P = NP is very unlikely. And intuitively, it's much more likely that a mathematical object has exactly no exploitable structure (like hashes are intended to), than that a mathematical object has exactly ~3 forms of exploitable structure (for elliptic curves: associativity, Schoof, pairings) and not some secret fourth form of structure we have not yet discovered that greatly degrades its security (for elliptic curves, ECDLP and pairing security). Similar for LWE, SVP, RLWE and the zoo of lattice problems.
For this reason, we do not yet see any reason to worry and start padding the byte size of hashes (if we start to worry more, we would pad the round count first before doing anything to the byte size).
Concrete TLDR, my own personal views:
* Hash-based > lattice-based, in those situations where hash-based is possible at all
* For anything lattice-based, be much more paranoid on param sizes. Remember that blockchains are only a small portion of the cryptography story; this point goes far beyond blockchains and applies to eg. access to websites, secure messaging, Tor / VPNs ...
* For privacy protocols, strongly favor NOT putting encrypted notes onchain. Instead, send them offchain through some third-party mechanism.
* If it's not difficult for you, keeping your funds in addresses which have not yet been used to make a transaction is a good idea. If it's easy for you, do it. **But be careful about migrations; I personally have lost more money in botched migrations than I have lost in all hacks combined**.
* For multisig wallets, doing confirmations offchain is better than onchain, because this way the signatures of signer wallets do not get exposed to the public, so if ECDSA falls to AI much faster than expected, at least the multisig "gracefully degrades" to a 1-of-1 where the 1 is whoever was gathering the signatures - a much better place to be than "anyone can take the money"
firefly.social/post/x/210783…












